Struct SharedSumcheckProver 

pub struct SharedSumcheckProver<'a, A: Allocator, P: PackedField, Evaluator> { /* private fields */ }

A SumcheckProver over a shared MleStore and a list of SumcheckRoundEvaluators, one per claim.

Each round makes one parallel pass over the store’s column chunks, feeding every evaluator, and lists the round polynomials in evaluator registration order. Self::fold folds each shared column and eq tracker once. Self::finish emits each store column’s evaluation once, computed a single time by the store no matter how many claims read the column.

Implementations

impl<'a, A, F, P, Evaluator> SharedSumcheckProver<'a, A, P, Evaluator>

where A: Allocator, F: Field, P: PackedField<Scalar = F>, Evaluator: SumcheckRoundEvaluator<F, P>,

pub fn new( store: MleStore<'a, A, P>, claims_with_evaluators: impl IntoIterator<Item = (F, Evaluator)>, ) -> Self

Creates a prover from a store and the evaluators reading its columns, each paired with its initial claim — one (claim, evaluator) per claim.

pub const fn store(&self) -> &MleStore<'a, A, P>

Returns a shared reference to the underlying column store.

pub const fn store_mut(&mut self) -> &mut MleStore<'a, A, P>

Returns an exclusive reference to the underlying column store.

Lets a caller extend the shared store with columns that a later-added evaluator reads: the logUp* final layer pushes the table halves onto it before adding its product evaluators.

pub fn add_evaluator(&mut self, claim: F, evaluator: Evaluator)

Adds one more evaluator — a claim reading the shared store, with its initial claim — to the group.

Its round polynomial is appended after the existing evaluators’ in Self::execute.

Trait Implementations

impl<A, F, P, Evaluator> SumcheckProver<F> for SharedSumcheckProver<'_, A, P, Evaluator>

where A: Allocator, F: Field, P: PackedField<Scalar = F>, Evaluator: SumcheckRoundEvaluator<F, P>,

fn n_vars(&self) -> usize

The number of variables in the remaining multivariate polynomial.

fn execute(&mut self) -> Vec<RoundCoeffs<F>>

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

fn fold(&mut self, challenge: F)

Folds the sumcheck multilinears with a new verifier challenge.

fn finish(self) -> Vec<F>

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