binius_core::protocols::sumcheck::prove::zerocheck

Struct UnivariateZerocheck

source
pub struct UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where FDomain: Field, PBase: PackedField, P: PackedField, Backend: ComputationBackend,
{ /* private fields */ }
Expand description

A prover that is capable of performing univariate skip.

By recasting skip_rounds first variables in a multilinear sumcheck into a univariate domain, it becomes possible to compute all of these rounds in small fields, unlocking significant performance gains. See zerocheck_univariate_evals rustdoc for a more detailed explanation.

This struct is an entrypoint to proving all zerochecks instances, univariatized and regular. “Regular” multilinear case is covered by calling Self::into_regular_zerocheck right away, producing a ZerocheckProver. Univariatized case is handled by using methods from a UnivariateZerocheckProver trait, where folding results in a reduced multilinear zerocheck prover for the remaining rounds.

Implementations§

source§

impl<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend> UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where FDomain: Field, PBase: PackedField, P: PackedField, Backend: ComputationBackend,

source

pub fn multilinears(&self) -> &Vec<M>

source§

impl<'a, 'm, F, FDomain, PBase, P, CompositionBase, Composition, M, Backend> UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where F: Field + ExtensionField<PBase::Scalar> + ExtensionField<FDomain>, FDomain: Field, PBase: PackedField<Scalar: ExtensionField<FDomain>> + PackedExtension<FDomain>, P: PackedFieldIndexable<Scalar = F> + PackedExtension<FDomain>, CompositionBase: CompositionPolyOS<PBase>, Composition: CompositionPolyOS<P>, M: MultilinearPoly<P> + Send + Sync + 'm, Backend: ComputationBackend,

source

pub fn new( multilinears: Vec<M>, zero_claims: impl IntoIterator<Item = (CompositionBase, Composition)>, zerocheck_challenges: &[F], evaluation_domain_factory: impl EvaluationDomainFactory<FDomain>, switchover_fn: impl Fn(usize) -> usize, backend: &'a Backend, ) -> Result<Self, Error>

source

pub fn into_regular_zerocheck( self, ) -> Result<ZerocheckProver<'a, FDomain, PBase, P, CompositionBase, Composition, MultilinearWitness<'m, P>, Backend>, Error>

Trait Implementations§

source§

impl<'a, 'm, FDomain, PBase, P, CompositionBase: Debug, Composition: Debug, M: Debug, Backend> Debug for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where FDomain: Field + Debug, PBase: PackedField + Debug, P: PackedField + Debug, Backend: ComputationBackend + Debug, P::Scalar: Debug,

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a, 'm, F, FDomain, PBase, P, CompositionBase, Composition, M, Backend> UnivariateZerocheckProver<F> for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where F: TowerField + ExtensionField<PBase::Scalar> + ExtensionField<FDomain>, FDomain: TowerField, PBase: PackedFieldIndexable<Scalar: ExtensionField<FDomain>> + PackedExtension<FDomain, PackedSubfield: PackedFieldIndexable>, P: PackedFieldIndexable<Scalar = F> + RepackedExtension<PBase> + PackedExtension<FDomain>, CompositionBase: CompositionPolyOS<PBase>, Composition: CompositionPolyOS<P>, M: MultilinearPoly<P> + Send + Sync + 'm, Backend: ComputationBackend,

source§

type RegularZerocheckProver = ZerocheckProver<'a, FDomain, PBase, P, CompositionBase, Composition, Arc<dyn MultilinearPoly<P> + Sync + Send + 'm>, Backend>

“Regular” prover for the multilinear rounds remaining after the univariate skip.
source§

fn n_vars(&self) -> usize

The number of variables in the multivariate polynomial.
source§

fn domain_size(&self, skip_rounds: usize) -> usize

Maximal required Lagrange domain size among compositions in this prover.
source§

fn execute_univariate_round( &mut self, skip_rounds: usize, max_domain_size: usize, batch_coeff: F, ) -> Result<LagrangeRoundEvals<F>, Error>

Computes the prover message for the univariate round as a univariate polynomial. Read more
source§

fn fold_univariate_round( self, challenge: F, ) -> Result<Self::RegularZerocheckProver, Error>

Folds into a regular multilinear prover for the remaining rounds.

Auto Trait Implementations§

§

impl<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend> Freeze for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where <FDomain as WithUnderlier>::Underlier: Sized, <Backend as ComputationBackend>::Vec<P>: Freeze,

§

impl<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend> RefUnwindSafe for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where <FDomain as WithUnderlier>::Underlier: Sized, Backend: RefUnwindSafe, PBase: RefUnwindSafe, <Backend as ComputationBackend>::Vec<P>: RefUnwindSafe, M: RefUnwindSafe, <P as PackedField>::Scalar: RefUnwindSafe, CompositionBase: RefUnwindSafe, Composition: RefUnwindSafe, FDomain: RefUnwindSafe,

§

impl<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend> Send for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where <FDomain as WithUnderlier>::Underlier: Sized, M: Send, CompositionBase: Send, Composition: Send,

§

impl<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend> Sync for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where <FDomain as WithUnderlier>::Underlier: Sized, M: Sync, CompositionBase: Sync, Composition: Sync,

§

impl<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend> Unpin for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where <FDomain as WithUnderlier>::Underlier: Sized, PBase: Unpin, <Backend as ComputationBackend>::Vec<P>: Unpin, M: Unpin, <P as PackedField>::Scalar: Unpin, CompositionBase: Unpin, Composition: Unpin, FDomain: Unpin,

§

impl<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend> UnwindSafe for UnivariateZerocheck<'a, 'm, FDomain, PBase, P, CompositionBase, Composition, M, Backend>
where <FDomain as WithUnderlier>::Underlier: Sized, Backend: RefUnwindSafe, PBase: UnwindSafe, <Backend as ComputationBackend>::Vec<P>: UnwindSafe, M: UnwindSafe, <P as PackedField>::Scalar: UnwindSafe, CompositionBase: UnwindSafe, Composition: UnwindSafe, FDomain: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more