Struct EqIndSumcheckProverBuilder

pub struct EqIndSumcheckProverBuilder<'a, P, M, Backend>
where
    P: PackedField,
    M: MultilinearPoly<P>,
    Backend: ComputationBackend,
{ /* private fields */ }

An “eq-ind” sumcheck prover.

The main difference of this prover from the RegularSumcheckProver is that it computes round evaluations of a much simpler “prime” polynomial multiplied by an already substituted 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 avoids interpolating the tensor expansion of the equality indicator. Round evaluations for the “full” assumed composition are computed in monomial form, out of hot loop. See Gruen24 Section 3.2 for details.

The rationale behind builder interface is the need to specify the pre-expanded equality indicator and potentially known evaluations at one in first round.

Implementations

impl<'a, F, P, Backend> EqIndSumcheckProverBuilder<'a, P, MLEDirectAdapter<P, Vec<P>>, Backend>

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

pub fn without_switchover( n_vars: usize, multilinears: Vec<Vec<P>>, backend: &'a Backend, ) -> Self

impl<'a, F, P, M, Backend> EqIndSumcheckProverBuilder<'a, P, M, Backend>

where F: TowerField, P: PackedField<Scalar = F>, M: MultilinearPoly<P> + Send + Sync, Backend: ComputationBackend,

pub fn with_switchover( multilinears: Vec<M>, switchover_fn: impl Fn(usize) -> usize, backend: &'a Backend, ) -> Result<Self, Error>

pub fn with_eq_ind_partial_evals( self, eq_ind_partial_evals: Backend::Vec<P>, ) -> Self

Specify an existing tensor expansion for eq_ind_challenges in Self::build. Avoids duplicate work.

pub fn with_first_round_eval_1s(self, first_round_eval_1s: &[F]) -> Self

Specify the value of round polynomial at 1 in the first round if it is available beforehand.

Prime example of this is GPA (grand product argument), where the value of the previous GKR layer may be used as an advice to compute the round polynomial at 1 directly with less effort compared to direct composite evaluation.

pub fn with_const_suffixes( self, const_suffixes: &[(F, usize)], ) -> Result<Self, Error>

Specify the const suffixes for multilinears.

The provided array specifies the const suffixes at the end of each multilinear. Prover is able to reduce multilinear storage and compute using this information.

pub fn build<FDomain, Composition>( self, evaluation_order: EvaluationOrder, eq_ind_challenges: &[F], composite_claims: impl IntoIterator<Item = CompositeSumClaim<F, Composition>>, domain_factory: impl EvaluationDomainFactory<FDomain>, ) -> Result<EqIndSumcheckProver<'a, FDomain, P, Composition, M, Backend>, Error>

where F: ExtensionField<FDomain>, P: PackedExtension<FDomain>, FDomain: Field, Composition: CompositionPoly<P>,