Struct MleCheckMaskProver 

pub struct MleCheckMaskProver<F: Field, P: PackedField<Scalar = F>, Data: Deref<Target = [P]>> { /* private fields */ }

Prover for the Libra mask polynomial in ZK MLE-check.

The mask polynomial has the separable form $g(X_0, …, X_{n-1}) = sum_{i} g_i(X_i)$, where each $g_i$ is a univariate polynomial of configurable degree.

This structure allows efficient round polynomial computation in O(degree) time per round.

Implementations

impl<F: Field, P: PackedField<Scalar = F>, Data: Deref<Target = [P]>> MleCheckMaskProver<F, P, Data>

pub fn new(mask: Mask<P, Data>, eval_point: Vec<F>, eval_claim: F) -> Self

Creates a new prover for the Libra mask polynomial.

Arguments

• mask - The mask polynomial (takes ownership).
• eval_point - The evaluation point z for the MLE-check claim, in high-to-low order.
• eval_claim - The claimed value of the MLE of g at the evaluation point.

Panics

Panics if mask.n_vars() != eval_point.len().

Trait Implementations

impl<F: Field, P: PackedField<Scalar = F>, Data: Deref<Target = [P]>> MleCheckProver<F> for MleCheckMaskProver<F, P, Data>

fn n_vars(&self) -> usize

The number of variables still free.

fn execute(&mut self) -> Vec<RoundCoeffs<F>>

Computes this round’s message, one univariate polynomial per claim.

fn fold(&mut self, challenge: F)

Binds this round’s variable to the verifier challenge.

fn finish(self) -> Vec<F>

Consumes the prover and returns every multilinear’s evaluation at the challenge point.

fn eval_point(&self) -> &[F]

The still-unbound part of the evaluation point, one coordinate per free variable.