Struct SumcheckClaim

pub struct SumcheckClaim<F: Field, C> { /* private fields */ }

A group of claims about the sum of the values of multilinear composite polynomials over the boolean hypercube.

All polynomials in the group of claims are compositions of the same sequence of multilinear polynomials. By defining SumcheckClaim in this way, the sumcheck protocol can implement efficient batch proving and verification and reduce to a set of multilinear evaluations of the same polynomials. In other words, this grouping deduplicates prover work and proof data that would be redundant in a more naive implementation.

Implementations

impl<F: Field, C> SumcheckClaim<F, C>

pub fn n_vars(&self) -> usize

pub fn n_multilinears(&self) -> usize

impl<F: Field, Composition> SumcheckClaim<F, Composition>

where Composition: CompositionPolyOS<F>,

pub fn new( n_vars: usize, n_multilinears: usize, composite_sums: Vec<CompositeSumClaim<F, Composition>>, ) -> Result<Self, Error>

Constructs a new sumcheck claim.

Throws

• Error::InvalidComposition if any of the composition polynomials in the composite claims vector do not have their number of variables equal to n_multilinears

pub fn max_individual_degree(&self) -> usize

Returns the maximum individual degree of all composite polynomials.

pub fn composite_sums(&self) -> &[CompositeSumClaim<F, Composition>]

Trait Implementations

impl<F: Debug + Field, C: Debug> Debug for SumcheckClaim<F, C>

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

Formats the value using the given formatter.