Expand description
A linear sumcheck prover
Modules§
- eq
- To eq(x,e) polynomial for n variables has this shape n-1 eq(x,e) = 𝜫 (xi * ei + (1 - xi)(1 - ei)) i=0 it can be cheaply evaluated in a point, but evaluating it over the 2^n points of the domain require n*log(n) multiplications if done point by point and precomputing each 1-ei
- eval_
check - An environment to check the function of evaluations in a point. At the end of sumcheck G(x) has to be check at a point r, as G is but a composition of several multilinear polynomials, we instead evaluates each of those polynomials at r and then apply the function to get the evaluation. For example: G(r) = f_0(r) * f_1(r) + f_2(r)
- eval_
impls - folding
- polynomials
- sumcheck
- symbolic
- Multivariate polynomial computation and optimal evaluation Intended for for multivariate polynomials where the variables are univariate polynomials
- utils
- zerocheck
- Utilities for zerocheck.
Enums§
Functions§
- prove_
and_ verify - Creates a prove with the mle and tries to verify it. Returns evals and point to double check if desired.