pub struct ArithCircuitPoly<F: TowerField> { /* private fields */ }
Expand description
Describes polynomial evaluations using a directed acyclic graph of expressions.
This is meant as an alternative to a hard-coded CompositionPolyOS.
The advantage over a hard coded CompositionPolyOS is that this can be constructed and manipulated dynamically at runtime and the object representing different polnomials can be stored in a homogeneous collection.
Implementations§
source§impl<F: TowerField> ArithCircuitPoly<F>
impl<F: TowerField> ArithCircuitPoly<F>
Trait Implementations§
source§impl<F: Clone + TowerField> Clone for ArithCircuitPoly<F>
impl<F: Clone + TowerField> Clone for ArithCircuitPoly<F>
source§fn clone(&self) -> ArithCircuitPoly<F>
fn clone(&self) -> ArithCircuitPoly<F>
Returns a copy of the value. Read more
1.6.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<F: TowerField> CompositionPoly<F> for ArithCircuitPoly<F>
impl<F: TowerField> CompositionPoly<F> for ArithCircuitPoly<F>
fn degree(&self) -> usize
fn n_vars(&self) -> usize
fn binary_tower_level(&self) -> usize
fn evaluate<P: PackedField<Scalar: ExtensionField<F>>>( &self, query: &[P], ) -> Result<P, Error>
fn batch_evaluate<P: PackedField<Scalar: ExtensionField<F>>>( &self, batch_query: &[&[P]], evals: &mut [P], ) -> Result<(), Error>
source§impl<F: TowerField, P: PackedField<Scalar: ExtensionField<F>>> CompositionPolyOS<P> for ArithCircuitPoly<F>
impl<F: TowerField, P: PackedField<Scalar: ExtensionField<F>>> CompositionPolyOS<P> for ArithCircuitPoly<F>
source§fn binary_tower_level(&self) -> usize
fn binary_tower_level(&self) -> usize
Returns the maximum binary tower level of all constants in the arithmetic expression.
source§fn evaluate(&self, query: &[P]) -> Result<P, Error>
fn evaluate(&self, query: &[P]) -> Result<P, Error>
Evaluates the polynomial using packed values, where each packed value may contain multiple scalar values.
The evaluation follows SIMD semantics, meaning that operations are performed
element-wise across corresponding scalar values in the packed values. Read more
Auto Trait Implementations§
impl<F> Freeze for ArithCircuitPoly<F>
impl<F> RefUnwindSafe for ArithCircuitPoly<F>
impl<F> Send for ArithCircuitPoly<F>
impl<F> Sync for ArithCircuitPoly<F>
impl<F> Unpin for ArithCircuitPoly<F>
impl<F> UnwindSafe for ArithCircuitPoly<F>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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