pub fn verify<F, C>(
zerocheck_challenges: &[C::Elem],
bitand_claim: C::Elem,
lagrange: &[C::Elem],
operands: &[OperandClaims<'_, C::Elem>],
channel: &mut C,
) -> Result<RerandOutput<C::Elem>, Error>where
F: Field,
C: IPVerifierChannel<F>,Expand description
Verifies the BitAnd sumcheck batched with the operand-column MLE-checks.
The prover sends the round polynomials, then the evaluations [a, b, c], then one evaluation
per operand column in input order.
§Arguments
zerocheck_challenges- the BitAnd summand’s pointr_x.bitand_claim- the univariate-skip polynomial atz,g(z).lagrange- the Lagrange weights atzon the 64-point domain.operands- the operand claims of each multiplication reduction.channel- the verifier channel.
§Soundness
The per-bit claims of operands must be in the transcript before z was drawn. Otherwise a
prover can choose them as a function of the weights that fold them.
§Errors
Returns an error if the sumcheck or its closing check fails.