binius_core::protocols::evalcheck

Struct EvalcheckProver

source 
pub struct EvalcheckProver<'a, 'b, F, PW, Backend>
where
    F: TowerField,
    PW: PackedField + WithUnderlier,
    PW::Underlier: PackScalar<PW::Scalar, Packed = PW>,
    Backend: ComputationBackend,
{ /* private fields */ }
Expand description

A mutable prover state.

Can be persisted across EvalcheckProver::prove invocations. Accumulates new_sumchecks bivariate sumcheck instances, as well as holds mutable references to the trace (to which new oracles & multilinears may be added during proving)

Implementations§

source§

impl<'a, 'b, F, PW, Backend> EvalcheckProver<'a, 'b, F, PW, Backend>
where F: TowerField, PW: PackedField + WithUnderlier, PW::Underlier: PackScalar<PW::Scalar, Packed = PW>, Backend: ComputationBackend,

source

pub fn batch_committed_eval_claims(&self) -> &BatchCommittedEvalClaims<F>

source

pub fn new_sumchecks(&self) -> &Vec<BivariateSumcheck<'b, F, PW>>

source§

impl<'a, 'b, F, PW, Backend> EvalcheckProver<'a, 'b, F, PW, Backend>
where F: TowerField, PW: PackedField + WithUnderlier, PW::Underlier: PackScalar<PW::Scalar, Packed = PW>, Backend: ComputationBackend,

source

pub fn batch_committed_eval_claims_mut( &mut self, ) -> &mut BatchCommittedEvalClaims<F>

source§

impl<'a, 'b, F, PW, Backend> EvalcheckProver<'a, 'b, F, PW, Backend>
where F: TowerField + From<PW::Scalar>, PW: PackedFieldIndexable + WithUnderlier, PW::Scalar: TowerField + From<F>, PW::Underlier: PackScalar<PW::Scalar, Packed = PW>, Backend: ComputationBackend,

source

pub fn new( oracles: &'a mut MultilinearOracleSet<F>, witness_index: &'a mut MultilinearExtensionIndex<'b, PW::Underlier, PW::Scalar>, backend: Backend, ) -> Self

Create a new prover state by tying together the mutable references to the oracle set and witness index (they need to be mutable because new_sumcheck reduction may add new oracles & multilinears) as well as committed eval claims accumulator.

source

pub fn take_new_sumchecks(&mut self) -> Vec<BivariateSumcheck<'b, F, PW>>

A helper method to move out the set of reduced sumcheck instances

source

pub fn prove( &mut self, evalcheck_claim: EvalcheckClaim<F>, ) -> Result<EvalcheckProof<F>, Error>

Prove an evalcheck claim.

Given a prover state containing MultilinearOracleSet indexing into given MultilinearExtensionIndex, we prove an EvalcheckClaim (stating that given composite poly equals eval at eval_point) by recursively processing each of the multilinears in the composition. This way the evalcheck claim gets transformed into an EvalcheckProof and a new set of claims on:

  • PCS openings (which get inserted into BatchCommittedEvalClaims accumulator)
  • New sumcheck instances that need to be proven in subsequent rounds (those get appended to new_sumchecks)

All of the new_sumchecks instances follow the same pattern:

  • they are always a product of two multilins (composition polynomial is BivariateProduct)
  • one multilin (the multiplier) is transparent (shift_ind, eq_ind, or tower basis)
  • other multilin is a projection of one of the evalcheck claim multilins to its first variables
source

pub fn prove_multilinear( &mut self, evalcheck_claim: EvalcheckMultilinearClaim<F>, ) -> Result<EvalcheckProof<F>, Error>

Auto Trait Implementations§

§

impl<'a, 'b, F, PW, Backend> Freeze for EvalcheckProver<'a, 'b, F, PW, Backend>
where <PW as WithUnderlier>::Underlier: Sized, <F as WithUnderlier>::Underlier: Sized, Backend: Freeze,

§

impl<'a, 'b, F, PW, Backend> !RefUnwindSafe for EvalcheckProver<'a, 'b, F, PW, Backend>

§

impl<'a, 'b, F, PW, Backend> Send for EvalcheckProver<'a, 'b, F, PW, Backend>
where <PW as WithUnderlier>::Underlier: Sized, <F as WithUnderlier>::Underlier: Sized,

§

impl<'a, 'b, F, PW, Backend> Sync for EvalcheckProver<'a, 'b, F, PW, Backend>
where <PW as WithUnderlier>::Underlier: Sized, <F as WithUnderlier>::Underlier: Sized,

§

impl<'a, 'b, F, PW, Backend> Unpin for EvalcheckProver<'a, 'b, F, PW, Backend>
where <PW as WithUnderlier>::Underlier: Sized, <F as WithUnderlier>::Underlier: Sized, Backend: Unpin, F: Unpin, PW: Unpin, <Backend as ComputationBackend>::Vec<PW>: Unpin, <PW as PackedField>::Scalar: Unpin,

§

impl<'a, 'b, F, PW, Backend> !UnwindSafe for EvalcheckProver<'a, 'b, F, PW, Backend>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more