Struct ArithCircuitPoly

pub struct ArithCircuitPoly<F: TowerField, P: PackedField<Scalar: ExtensionField<F>>> { /* private fields */ }

Describes polynomial evaluations using a directed acyclic graph of expressions.

This is meant as an alternative to a hard-coded CompositionPoly.

The advantage over a hard coded CompositionPoly is that this can be constructed and manipulated dynamically at runtime.

Implementations

impl<F: TowerField, P: PackedField<Scalar: ExtensionField<F>>> ArithCircuitPoly<F, P>

pub fn new(exprs: Vec<Expr<F>>) -> Self

Trait Implementations

impl<F: TowerField, P: PackedField<Scalar: ExtensionField<F>>> CompositionPoly<P> for ArithCircuitPoly<F, P>

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.

fn degree(&self) -> usize

Total degree of the polynomial.

fn n_vars(&self) -> usize

The number of variables.

fn binary_tower_level(&self) -> usize

Returns the maximum binary tower level of all constants in the arithmetic expression.

fn sparse_batch_evaluate( &self, sparse_batch_query: &[&[P]], evals: &mut [P], ) -> Result<(), Error>

Batch evaluation that admits non-strided argument layout. sparse_batch_query is a slice of slice references of equal length, which furthermore should equal the length of evals parameter.

impl<F: Debug + TowerField, P: Debug + PackedField<Scalar: ExtensionField<F>>> Debug for ArithCircuitPoly<F, P>

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

Formats the value using the given formatter.