Expand description

The multivariate sumcheck and zerocheck polynomial protocols.

Sumcheck supports an efficient prover algorithm when the virtual polynomial is a multilinear composite, so this module only handles that case, rather than the case of general multivariate polynomials.

This is the V2 implementation of sumcheck. The legacy implementation is in the crate::protocols::abstract_sumcheck, crate::protocols::sumcheck, and crate::protocols::zerocheck modules.

Re-exports§

Modules§

Structs§

  • A claim about the sum of the values of a multilinear composite polynomial over the boolean hypercube.
  • A sumcheck batch proof.
  • A univariate polynomial in monomial basis.
  • A sumcheck round proof is a univariate polynomial in monomial basis with the coefficient of the highest-degree term truncated off.
  • A group of claims about the sum of the values of multilinear composite polynomials over the boolean hypercube.

Enums§

Functions§

  • Create a sumcheck claim out of constraint set. Fails when the constraint set contains zerochecks. Returns claim and metadata used for evalcheck claim construction.
  • Create a zerocheck claim from the constraint set. Fails when the constraint set contains regular sumchecks. Returns claim and metadata used for evalcheck claim construction.
  • Constructs evalcheck claims from metadata returned by constraint set claim constructors.