Struct RFSumcheck 

pub struct RFSumcheck<F, R>(/* private fields */);

Implementations

impl<F: FromPrimitiveWithConfig, R: Semiring + ProjectableToField<F>> RFSumcheck<F, R>

pub fn prove_as_subprotocol( transcript: &mut impl Transcript, mles: Vec<DenseMultilinearExtension<R>>, mles_f: Vec<DenseMultilinearExtension<F::Inner>>, nvars: usize, degree: usize, comb_fn: impl Fn(&F, &[F]) -> F + Send + Sync, field_cfg: &F::Config, ) -> (RFSumcheckProof<F, R>, RFProverState<F, R>)

where F: InnerTransparentField, F::Inner: ConstTranscribable + ConstIntSemiring + FromRef<F::Inner>, F::Modulus: ConstTranscribable,

Random field sumcheck prover. Samples a random field element, projects the input MLEs and performs the sumcheck proving algorithm.

Arguments

• transcript: A mutable reference to a Fiat-Shamir Transcript.
• mles: A Vec of dense multilinear extension over the input semiring R. These will be projected by the prover.
• mles_f: A Vec of dense multilinear extension over the random field. E.g. eq_r can go into this argument. These will not be projected by the prover.
• nvars: The number of variables over which the mles are defined. This must be consistent across all mles.
• degree: The maximum combined degree of the mles under the comb_fn.
• comb_fn: A closure that defines the combination function $G(\alpha, \text{mles}(x))$. It takes the projecting element $\alpha$ the prover has sampled and a slice of field elements (the evaluations of the mles at a point $x$) and returns a single field element. The element $\alpha$ might be used to project some parts of the sumcheck polynomial, e.g. if a constraint systems requires projecting too.
• config: The configuration for the underlying field used in the protocol. The protocol does not sample the random prime and assumes it comes in this argument.

pub fn verify_as_subprotocol( transcript: &mut impl Transcript, num_vars: usize, degree: usize, proof: &RFSumcheckProof<F, R>, field_cfg: F::Config, ) -> Result<Subclaim<F>, RFSumcheckError<F>>

where F::Inner: ConstTranscribable + ConstIntSemiring, F::Modulus: ConstTranscribable,

The verifier part of the random field sumcheck protocol.

Arguments

• transcript: A mutable reference to a Fiat-Shamir Transcript.
• num_vars: The number of variables over which the sum was originally computed.
• degree: The maximum combined degree of the underlying polynomial $G(x)$. This must match the degree used by the Prover.
• claimed_sum: The initial claimed value of the sum.
• proof: A reference to the SumcheckProof<F> generated by the Prover.
• config: The configuration for the underlying field used in the protocol.