Struct ConstantFraction 

pub struct ConstantFraction<F> { /* private fields */ }

The layer a tree contributes while the batch is still above it: one fraction beside the zero fraction $0/1$.

Such a layer is a padding of the tree’s own fractional sum, so its low child is that sum and its high child is identically $0/1$. Every one of its variables is a padding variable, so there is nothing to reduce — ZeroPadMleCheckProver goes straight to its padding rounds and only ever asks for these four child evaluations.

Implementations

impl<F: Field> ConstantFraction<F>

pub const fn new(num: F, den: F) -> Self

The layer whose low child is the fraction (num, den) and whose high child is $0/1$.

Trait Implementations

impl<F: Field> MleCheckProver<F> for ConstantFraction<F>

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.