Struct BivariateMLEcheckProver

pub struct BivariateMLEcheckProver<'a, F: Field, Hal: ComputeLayer<F>, HostAllocatorType, DeviceAllocatorType>
where
    HostAllocatorType: ComputeAllocator<F, CpuMemory>,
    DeviceAllocatorType: ComputeAllocator<F, Hal::DevMem>,
{ /* private fields */ }

MLEcheck prover implementation for the special case of bivariate product compositions over large-field multilinears.

This implements the SumcheckProver interface. The implementation uses a ComputeLayer instance for expensive operations and the input multilinears are provided as device memory slices.

Implementations

impl<'a, F, Hal, HostAllocatorType, DeviceAllocatorType> BivariateMLEcheckProver<'a, F, Hal, HostAllocatorType, DeviceAllocatorType>

where F: TowerField, Hal: ComputeLayer<F>, HostAllocatorType: ComputeAllocator<F, CpuMemory>, DeviceAllocatorType: ComputeAllocator<F, Hal::DevMem>,

pub fn new( hal: &'a Hal, dev_alloc: &'a DeviceAllocatorType, host_alloc: &'a HostAllocatorType, claim: &EqIndSumcheckClaim<F, IndexComposition<BivariateProduct, 2>>, multilins: Vec<FSlice<'a, F, Hal>>, eq_ind_partial_evals: FSlice<'a, F, Hal>, eq_ind_challenges: Vec<F>, ) -> Result<Self, Error>

pub fn required_host_memory( claim: &EqIndSumcheckClaim<F, IndexComposition<BivariateProduct, 2>>, ) -> usize

Returns the amount of host memory this sumcheck requires.

pub fn required_device_memory( claim: &EqIndSumcheckClaim<F, IndexComposition<BivariateProduct, 2>>, with_eq_ind_partial_evals: bool, ) -> usize

Returns the amount of device memory this sumcheck requires.

pub fn fold_multilinears(&mut self, challenge: F) -> Result<(), Error>

pub fn fold_eq_ind(&mut self) -> Result<(), Error>

Trait Implementations

impl<F, Hal, HostAllocatorType, DeviceAllocatorType> SumcheckProver<F> for BivariateMLEcheckProver<'_, F, Hal, HostAllocatorType, DeviceAllocatorType>

where F: TowerField, Hal: ComputeLayer<F>, HostAllocatorType: ComputeAllocator<F, CpuMemory>, DeviceAllocatorType: ComputeAllocator<F, Hal::DevMem>,

fn n_vars(&self) -> usize

The number of variables remaining in the multivariate polynomial.

fn evaluation_order(&self) -> EvaluationOrder

Sumcheck evaluation order assumed by this specific prover.

fn execute(&mut self, batch_coeff: F) -> Result<RoundCoeffs<F>, Error>

Computes the prover message for this round as a univariate polynomial.

fn fold(&mut self, challenge: F) -> Result<(), Error>

Folds the sumcheck multilinears with a new verifier challenge.

fn finish(self: Box<Self>) -> Result<Vec<F>, Error>

Finishes the sumcheck proving protocol and returns the evaluations of all multilinears at the challenge point.