Struct Phase1SumcheckProver 

pub struct Phase1SumcheckProver<'alloc, A: Allocator, P: PackedField> { /* private fields */ }

A sumcheck prover for the product of a sparse row list and a dense weight table, both spanning one shift slot and the bit position.

The row list is zero outside the rows a constraint system’s shifts name, dense within a named row. So this prover changes strategy halfway through:

• While the row index has unbound variables, each round reads only the stored rows, at a cost that follows how many shifts the constraint system names, not the whole row space.
• Once the row index is bound, both multilinears are one dense row, and a shared dense-product prover takes over.

Every round message matches what a fully dense prover would send.

Performance

Both the sampled evaluations and the fold are linear in the sparse row list, so each stored row contributes independently, walking whole packed rows rather than individual scalar points.

Implementations

impl<'alloc, A: Allocator, F: Field, P: PackedField<Scalar = F>> Phase1SumcheckProver<'alloc, A, P>

pub fn new( g: SparseShiftRows<P>, h: FieldVec<P, A>, sum: F, alloc: &'alloc A, ) -> Self

Creates a prover for the claim that the two multilinears’ product sums to the given value over the hypercube.

The outer shift slot is already bound by the time this runs, so the dense multilinear is the weight table over the weights those rounds left behind, and the row list’s remaining row index is the inner slot.

Panics

Panics unless both multilinears span exactly one shift slot and the bit position.

Trait Implementations

impl<A: Allocator, F: Field, P: PackedField<Scalar = F>> SumcheckProver<F> for Phase1SumcheckProver<'_, A, 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.