Struct EvalcheckProver

pub struct EvalcheckProver<'a, 'b, U, F, Backend>
where
    U: UnderlierType + PackScalar<F>,
    F: TowerField,
    Backend: ComputationBackend,
{ /* private fields */ }

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

impl<'a, 'b, U, F, Backend> EvalcheckProver<'a, 'b, U, F, Backend>

where U: UnderlierType + PackScalar<F>, F: TowerField, Backend: ComputationBackend,

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

impl<'a, 'b, U, F, Backend> EvalcheckProver<'a, 'b, U, F, Backend>

where U: UnderlierType + PackScalar<F>, F: TowerField, Backend: ComputationBackend,

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

impl<'a, 'b, U, F, Backend> EvalcheckProver<'a, 'b, U, F, Backend>

where U: UnderlierType + PackScalar<F>, PackedType<U, F>: PackedFieldIndexable, F: TowerField, Backend: ComputationBackend,

pub fn new( oracles: &'a mut MultilinearOracleSet<F>, witness_index: &'a mut MultilinearExtensionIndex<'b, U, F>, backend: &'a 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.

pub fn take_new_sumchecks_constraints( &mut self, ) -> Result<Vec<ConstraintSet<PackedType<U, F>>>, OracleError>

A helper method to move out sumcheck constraints

pub fn prove( &mut self, evalcheck_claims: Vec<EvalcheckMultilinearClaim<F>>, ) -> Result<Vec<EvalcheckProof<F>>, Error>

Prove an evalcheck claim.

Given a prover state containing MultilinearOracleSet indexing into given MultilinearExtensionIndex, we prove an EvalcheckMultilinearClaim (stating that given composite poly equals eval at eval_point) by recursively processing each of the multilinears. 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 constraints that need to be proven in subsequent rounds (those get appended to new_sumchecks)

All of the new_sumchecks constraints 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