Struct DynamicPolynomialF 

pub struct DynamicPolynomialF<F: PrimeField> {
    pub coeffs: Vec<F>,
}

Polynomials of dynamic degree. The implementation is tailored to work with random finite fields. To be used in UAIR and PIOP where ZIP+ degree bound is not observed anymore.

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

Fields

coeffs: Vec<F>

Implementations

impl<F: PrimeField> DynamicPolynomialF<F>

pub fn new_trimmed(coeffs: impl AsRef<[F]>) -> Self

Create a new polynomial with the given coefficients.

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

pub fn degree(&self) -> Option<usize>

pub fn trim(&mut self)

pub fn constant_poly(a: F) -> Self

Trait Implementations

impl<F: PrimeField> Add<&DynamicPolynomialF<F>> for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the + operator.

fn add(self, rhs: &Self) -> Self::Output

Performs the + operation.

impl<F: PrimeField> Add for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl<F: PrimeField> AddAssign<&DynamicPolynomialF<F>> for DynamicPolynomialF<F>

fn add_assign(&mut self, rhs: &Self)

Performs the += operation.

impl<F: PrimeField> AddAssign for DynamicPolynomialF<F>

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<F: PrimeField> CheckedAdd for DynamicPolynomialF<F>

fn checked_add(&self, rhs: &Self) -> Option<Self>

Adds two numbers, checking for overflow. If overflow happens, None is returned.

impl<F: PrimeField> CheckedMul for DynamicPolynomialF<F>

fn checked_mul(&self, rhs: &Self) -> Option<Self>

Multiplies two numbers, checking for underflow or overflow. If underflow or overflow happens, None is returned.

impl<F: PrimeField> CheckedNeg for DynamicPolynomialF<F>

fn checked_neg(&self) -> Option<Self>

Negates a number, returning None for results that can’t be represented, like signed MIN values that can’t be positive, or non-zero unsigned values that can’t be negative.

impl<F: PrimeField> CheckedSub for DynamicPolynomialF<F>

fn checked_sub(&self, rhs: &Self) -> Option<Self>

Subtracts two numbers, checking for underflow. If underflow happens, None is returned.

impl<F: Clone + PrimeField> Clone for DynamicPolynomialF<F>

fn clone(&self) -> DynamicPolynomialF<F>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: PrimeField> ConstZero for DynamicPolynomialF<F>

const ZERO: Self

The additive identity element of Self, 0.

impl<F: Debug + PrimeField> Debug for DynamicPolynomialF<F>

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

Formats the value using the given formatter.

impl<F: PrimeField> Default for DynamicPolynomialF<F>

fn default() -> Self

Returns the “default value” for a type.

impl<F: PrimeField> Display for DynamicPolynomialF<F>

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

Formats the value using the given formatter.

impl<F: PrimeField> Div for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the / operator.

fn div(self, rhs: Self) -> Self::Output

Performs the / operation.

impl<F: PrimeField> Euclid for DynamicPolynomialF<F>

fn div_euclid(&self, v: &Self) -> Self

Calculates Euclidean division, the matching method for rem_euclid.

fn rem_euclid(&self, v: &Self) -> Self

Calculates the least nonnegative remainder of self (mod v).

fn div_rem_euclid(&self, divisor: &Self) -> (Self, Self)

Returns both the quotient and remainder from Euclidean division.

impl<F: PrimeField> EvaluatablePolynomial<F, F> for DynamicPolynomialF<F>

type EvaluationPoint = F

The type of points a polynomial can be evaluated on. For univariate polynomials this typically is Out, for multivariate this is [Out].

fn evaluate_at_point(&self, point: &F) -> Result<F, EvaluationError>

Evaluates the polynomial at the given point.

impl<F: PrimeField, const DEGFEE_PLUS_ONE: usize> From<DensePolynomial<F, DEGFEE_PLUS_ONE>> for DynamicPolynomialF<F>

fn from(dense_poly: DensePolynomial<F, DEGFEE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<F: PrimeField> From<Vec<F>> for DynamicPolynomialF<F>

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

Converts to this type from the input type.

impl<F: PrimeField> FromIterator<F> for DynamicPolynomialF<F>

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

Creates a value from an iterator.

impl<F: Hash + PrimeField> Hash for DynamicPolynomialF<F>

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<F: PrimeField> Mul<&DynamicPolynomialF<F>> for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the * operator.

fn mul(self, rhs: &Self) -> Self::Output

Performs the * operation.

impl<'a, F: PrimeField> Mul for &'a DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl<F: PrimeField> Mul for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl<F: PrimeField> MulAssign<&DynamicPolynomialF<F>> for DynamicPolynomialF<F>

fn mul_assign(&mut self, rhs: &Self)

Performs the *= operation.

impl<F: PrimeField> MulAssign for DynamicPolynomialF<F>

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<F: PrimeField> Neg for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<F: PartialEq + PrimeField> PartialEq for DynamicPolynomialF<F>

fn eq(&self, other: &DynamicPolynomialF<F>) -> 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<F: PrimeField> Polynomial<F> for DynamicPolynomialF<F>

const DEGREE_BOUND: usize = usize::MAX

impl<F: PrimeField> Rem for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the % operator.

fn rem(self, rhs: Self) -> Self::Output

Performs the % operation.

impl<F: PrimeField> Sub<&DynamicPolynomialF<F>> for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the - operator.

fn sub(self, rhs: &Self) -> Self::Output

Performs the - operation.

impl<F: PrimeField> Sub for DynamicPolynomialF<F>

type Output = DynamicPolynomialF<F>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation.

impl<F: PrimeField> SubAssign<&DynamicPolynomialF<F>> for DynamicPolynomialF<F>

fn sub_assign(&mut self, rhs: &Self)

Performs the -= operation.

impl<F: PrimeField> SubAssign for DynamicPolynomialF<F>

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<F: PrimeField> Zero for DynamicPolynomialF<F>

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl<F: Eq + PrimeField> Eq for DynamicPolynomialF<F>

impl<F: PrimeField> Semiring for DynamicPolynomialF<F>

impl<F: PrimeField> StructuralPartialEq for DynamicPolynomialF<F>