Struct ZerocheckProver

pub struct ZerocheckProver<'a, FDomain, P, Composition, M, Backend>
where
    FDomain: Field,
    P: PackedField,
    M: MultilinearPoly<P> + Send + Sync,
    Backend: ComputationBackend,
{ /* private fields */ }

A “regular” multilinear zerocheck prover.

The main difference of this prover from a regular sumcheck prover is that it computes round evaluations of a much simpler “prime” polynomial multiplied by a “higher” portion of the equality indicator. This “prime” polynomial has the same degree as the underlying composition, reducing the number of would-be evaluation points by one, and the tensor expansion of the zerocheck indicator doesn’t have to be interpolated. Round evaluations for the “full” assumed zerocheck composition are computed in monomial form, out of hot loop. See Gruen24 Section 3.2 for details.

When “jump starting” a zerocheck prover in a middle of zerocheck, pay attention that claimed_prime_sums are on “prime” polynomial, and not on full zerocheck polynomial.

Trait Implementations

impl<'a, FDomain, P, Composition: Debug, M, Backend> Debug for ZerocheckProver<'a, FDomain, P, Composition, M, Backend>

where FDomain: Field + Debug, P: PackedField + Debug, M: MultilinearPoly<P> + Send + Sync + Debug, Backend: ComputationBackend + Debug, P::Scalar: Debug, Backend::Vec<P>: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<F, FDomain, P, Composition, M, Backend> SumcheckProver<F> for ZerocheckProver<'_, FDomain, P, Composition, M, Backend>

where F: Field + ExtensionField<FDomain>, FDomain: Field, P: PackedFieldIndexable<Scalar = F> + PackedExtension<FDomain>, Composition: CompositionPolyOS<P>, M: MultilinearPoly<P> + Send + Sync, Backend: ComputationBackend,

fn n_vars(&self) -> usize

The number of variables in the multivariate polynomial.

fn fold(&mut self, challenge: F) -> Result<(), Error>

Folds the sumcheck multilinears with a new verifier challenge.

fn execute(&mut self, batch_coeff: F) -> Result<RoundCoeffs<F>, Error>

Computes the prover message for this round as a univariate polynomial.

fn finish(self: Box<Self>) -> Result<Vec<F>, Error>

Finishes the sumcheck proving protocol and returns the evaluations of all multilinears at the challenge point.