Struct EvalcheckProver

pub struct EvalcheckProver<'a, 'b, F, P>
where
    P: PackedField<Scalar = F>,
    F: TowerField,
{
    pub memoized_data: MemoizedData<'b, P>,
    /* 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)

Fields

memoized_data: MemoizedData<'b, P>

Implementations

impl<'a, 'b, F, P> EvalcheckProver<'a, 'b, F, P>

where P: PackedField<Scalar = F>, F: TowerField,

pub fn committed_eval_claims(&self) -> &Vec<EvalcheckMultilinearClaim<F>>

The committed evaluation claims arising in this round

impl<'a, 'b, F, P> EvalcheckProver<'a, 'b, F, P>

where P: PackedField<Scalar = F>, F: TowerField,

pub fn committed_eval_claims_mut( &mut self, ) -> &mut Vec<EvalcheckMultilinearClaim<F>>

The committed evaluation claims arising in this round

impl<'a, 'b, F, P> EvalcheckProver<'a, 'b, F, P>

where P: PackedField<Scalar = F>, F: TowerField,

pub fn new( oracles: &'a mut MultilinearOracleSet<F>, witness_index: &'a mut MultilinearExtensionIndex<'b, P>, ) -> 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_bivariate_sumchecks_constraints( &mut self, ) -> Result<Vec<ConstraintSet<F>>, OracleError>

A helper method to move out bivariate sumcheck constraints

pub fn take_new_mlechecks_constraints( &mut self, ) -> Result<Vec<ConstraintSetEqIndPoint<F>>, OracleError>

A helper method to move out mlechecks constraints

pub fn prove<Challenger_: Challenger>( &mut self, evalcheck_claims: Vec<EvalcheckMultilinearClaim<F>>, transcript: &mut ProverTranscript<Challenger_>, ) -> Result<(), 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 EvalcheckHint and a new set of claims on:

• Committed polynomial evaluations
• 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

pub fn collect_evals( &mut self, oracle_id: OracleId, eval_point: &EvalPoint<F>, ) -> F

pub fn collect_suffixes(&mut self, oracle_id: OracleId, suffix: EvalPoint<F>)

Collect common suffixes to reuse partial_evals with different prefixes.