Struct BivariateSumcheckProver

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

Sumcheck 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, 'b, F, Hal, DeviceAllocatorType, HostAllocatorType> BivariateSumcheckProver<'a, 'b, F, Hal, DeviceAllocatorType, HostAllocatorType>

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

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

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

Returns the amount of host memory this sumcheck requires.

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

Returns the amount of device memory this sumcheck requires.

Trait Implementations

impl<'a, 'b, F, Hal, DeviceAllocatorType, HostAllocatorType> SumcheckProver<F> for BivariateSumcheckProver<'a, 'b, F, Hal, DeviceAllocatorType, HostAllocatorType>

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

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.