pub fn verify<F, C>(
evaluation_claim: C::Elem,
eval_point: &[C::Elem],
channel: &mut C,
) -> Result<RingSwitchVerifyOutput<C::Elem>, Error>where
F: BinaryField + PackedField<Scalar = F>,
C: IPVerifierChannel<F>,
C::Elem: FieldOps<Scalar = F> + From<F>,Expand description
Verify the ring-switching reduction.
Takes the expected evaluation claim and eval point, and:
- Receives s_hat_v from prover via channel
- Verifies the partial evaluation matches the expected claim
- Samples row-batching challenges
- Computes the sumcheck claim for BaseFold
Returns the eq_r_double_prime (for final check) and sumcheck claim.
§Arguments
evaluation_claim- the expected evaluation of the B1 polynomialeval_point- the evaluation point from shift reductionchannel- the verifier channel for receiving/sampling
§Preconditions
eval_point.len()must equallog_witness_elems + log_packingwhere log_packing is the base-2 log of the extension degree of F over B1