Skip to main content

batch_prove

Function batch_prove 

Source
pub fn batch_prove<F, P, Data>(
    pairs: Vec<[FieldBuffer<P, Data>; 2]>,
    channel: &mut impl IPProverChannel<F>,
) -> BatchSumcheckOutput<F>
where F: Field, P: PackedField<Scalar = F>, Data: BufferData<P>,
Expand description

Proves a batch of claims $\sum_{x \in {0, \infty}^n} u^\infty(x) \cdot w^\infty(x)$, one per pair of monomial-coefficient tables $(u, w)$.

The claimed sum of each pair is $\langle u, w \rangle$. The pairs may have different variable counts; the batch runs on the largest, binding the top variable each round. A pair on k variables sits out the first rounds, contributing its unchanged claim as a constant round polynomial, and closes at the low k coordinates of the evaluation point.

Verify with [binius_ip::sumcheck::infinity::batch_verify] at degree 2.

Each prover’s evaluations are $[u^\infty(r), w^\infty(r)]$, the multilinears with monomial coefficients $u$, $w$ at the claim’s challenge point $r$. The evaluations are not written to the channel.

§Preconditions

  • the two tables of a pair must have the same number of variables