Struct DynamicPolynomial 

pub struct DynamicPolynomial<E> {
    pub coeffs: Vec<E>,
}

Polynomials of dynamic degree over an arbitrary semiring (fixed like Int, or dynamic like a random finite field). To be used in UAIR and PIOP where ZIP+ degree bound is not observed anymore.

This is a dumb data holder: all operations are performed via DynamicPolynomialConfig, obtainable from the coefficient config with HasDynamicPolynomialConfig::dyn_poly_cfg.

Note that operations involving dynamic polynomials do not trim leading zeros meaning one can end up with unequal objects of the type DynamicPolynomial<E> that represent equal polynomials, therefore DynamicPolynomialConfig::trim has to be called before checking equality.

Fields

coeffs: Vec<E>

Implementations

impl<E> DynamicPolynomial<E>

pub const ZERO: Self

pub fn try_map<T, Er>( &self, f: impl FnMut(&E) -> Result<T, Er> + Copy, ) -> Result<DynamicPolynomial<T>, Er>

Maps every field element through f, preserving structure — used to lift elements into wire integers and to project wire integers back into elements at the (de)serialization boundary.

pub fn new(coeffs: impl AsRef<[E]>) -> Self

where E: Clone,

Create a new polynomial with the given coefficients.

Trait Implementations

impl<E: Clone> Clone for DynamicPolynomial<E>

fn clone(&self) -> DynamicPolynomial<E>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<E: Debug> Debug for DynamicPolynomial<E>

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

Formats the value using the given formatter.

impl<E> Default for DynamicPolynomial<E>

fn default() -> Self

Returns the “default value” for a type.

impl<E: Display> Display for DynamicPolynomial<E>

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

Formats the value using the given formatter.

impl<const DEGREE_PLUS_ONE: usize> From<BinaryU64Poly<DEGREE_PLUS_ONE>> for DynamicPolynomial<Boolean>

fn from(binary_poly: BinaryPoly<DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<E, const DEGREE_PLUS_ONE: usize> From<DensePolynomial<E, DEGREE_PLUS_ONE>> for DynamicPolynomial<E>

fn from(dense_poly: DensePolynomial<E, DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<E> From<Vec<E>> for DynamicPolynomial<E>

fn from(value: Vec<E>) -> Self

Converts to this type from the input type.

impl<E> FromIterator<E> for DynamicPolynomial<E>

fn from_iter<T: IntoIterator<Item = E>>(iter: T) -> Self

Creates a value from an iterator.

impl<E: Hash> Hash for DynamicPolynomial<E>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<E: PartialEq> PartialEq for DynamicPolynomial<E>

fn eq(&self, other: &DynamicPolynomial<E>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<E, C> ProjectableToField<C> for DynamicPolynomial<E>

where C: FieldConfig + ProjectElementWithConfig<E> + Clone + Send + Sync + 'static,

Projection by evaluation: a dynamic polynomial over projectable coefficients maps to the field element obtained by projecting the coefficients and evaluating at the sampled point.

fn prepare_projection( cfg: &C, sampled_value: &C::Element, ) -> impl Fn(&Self) -> C::Element

Prepare a projection function that will project the current type to a prime field using the given config and sampled value.

impl<E: Eq> Eq for DynamicPolynomial<E>

impl<E> StructuralPartialEq for DynamicPolynomial<E>