pub fn verify<F, C>(
n_vars: usize,
degree: usize,
sum: C::Elem,
channel: &mut C,
) -> Result<SumcheckOutput<C::Elem>, Error>where
F: Field,
C: IPVerifierChannel<F>,Expand description
Verify a sumcheck over ${0, \infty}^n$.
This is super::verify() with each round checked as $R(0) + R(\infty) = s$.
ยงArguments
n_vars- The number of variables in the multivariate polynomialdegree- The degree of the univariate polynomial in each roundsum- The claimed sum of the multivariate polynomial over ${0, \infty}^n$channel- The channel for receiving prover messages and sampling challenges