pub fn verify_sumcheck_basefold<F, Channel>(
fri_params: &FRIParams<F>,
codeword_commitments: &[Channel::Commitment],
eval_claim: Channel::Elem,
n_vars: usize,
batch_challenge: Option<Channel::Elem>,
multiplicand_eval: impl FnOnce(&[Channel::Elem], &[Channel::Elem]) -> Channel::Elem,
channel: &mut Channel,
) -> Result<(), Error>Expand description
Verifies the single BaseFold sumcheck opening of the Batched ZK BaseFold construction (binius.xyz#128, step 4).
This is the verifier counterpart of binius_iop_prover::basefold::prove_sumcheck_basefold. The
claim is Σ_{X,Z} G(X, Z) · T(X, Z) = eval_claim, where G is the multilinear the FRI opens:
the γ-folded round oracles, concatenated along the oracle-index variables Z (log_n_oracles
of them) with G(X, Z) = Σ_r M^γ_r↑(X) · eq(r, Z). T is the verifier-computable multiplicand.
The sumcheck binds the variables in the order the FRI folder consumes its challenges: the mask
fold γ (no round polynomial, and only if some round is masked), then the Z variables, then
the X variables, low to high. Each round polynomial is degree 2 and is received before the
FRI round is processed, so that a commitment the FRI sends in the same round lands after it.
§Arguments
codeword_commitments- one per oracle, in the same order asFRIParams::input_oracles, as commitment handles previously received overchannel.eval_claim- the targetΣ_{X,Z} G · T.n_vars- the number of variablesX, the largest round oracle’s.batch_challenge- the mask fold challengeγ, if any round is masked.multiplicand_eval- evaluatesT(ρ, ζ). It receivesρin the order sampled, which is the variable order (low to high), andζin the order sampled, which is the bit order of the oracle index.channel- the Merkle channel carrying all prover interaction: round coefficients, challenges, commitments, and query openings.
The final consistency check G(ρ, ζ) · T(ρ, ζ) = final sum is asserted internally, so Ok
means the opening verified.