Struct dusk_plonk::fft::Polynomial

pub struct Polynomial {
    pub coeffs: Vec<Scalar>,
}

Polynomial represents a polynomial in coeffiient form.

Fields

coeffs: Vec<Scalar>

The coefficient of x^i is stored at location i in self.coeffs.

Implementations

impl Polynomial

pub fn zero() -> Self

Returns the zero polynomial.

pub fn is_zero(&self) -> bool

Checks if the given polynomial is zero.

pub fn from_coefficients_slice(coeffs: &[Scalar]) -> Self

Constructs a new polynomial from a list of coefficients.

pub fn from_coefficients_vec(coeffs: Vec<Scalar>) -> Self

Constructs a new polynomial from a list of coefficients.

Panics

When the length of the coeffs is zero.

pub fn degree(&self) -> usize

Returns the degree of the polynomial.

pub fn evaluate(&self, point: &Scalar) -> Scalar

Evaluates self at the given point in the field.

pub fn rand<R: Rng>(d: usize, rng: &mut R) -> Self

Outputs a polynomial of degree d where each coefficient is sampled uniformly at random from the field F.

impl Polynomial

pub fn ruffini(&self, z: Scalar) -> Polynomial

Divides self by x-z using Ruffinis method

Trait Implementations

impl<'a, 'b> Add<&'a Polynomial> for &'b Polynomial

type Output = Polynomial

The resulting type after applying the + operator.

fn add(self, other: &'a Polynomial) -> Polynomial

Performs the + operation.

impl<'a, 'b> Add<&'a Scalar> for &'b Polynomial

Convenience Trait to sub a scalar and polynomial

type Output = Polynomial

The resulting type after applying the + operator.

fn add(self, constant: &'a Scalar) -> Polynomial

Performs the + operation.

impl<'a, 'b> AddAssign<&'a Polynomial> for Polynomial

fn add_assign(&mut self, other: &'a Polynomial)

Performs the += operation.

impl<'a, 'b> AddAssign<(Scalar, &'a Polynomial)> for Polynomial

fn add_assign(&mut self, (f, other): (Scalar, &'a Polynomial))

Performs the += operation.

impl Clone for Polynomial

fn clone(&self) -> Polynomial

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Polynomial

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

Formats the value using the given formatter.

impl Deref for Polynomial

type Target = [Scalar]

The resulting type after dereferencing.

fn deref(&self) -> &[Scalar]

Dereferences the value.

impl DerefMut for Polynomial

fn deref_mut(&mut self) -> &mut [Scalar]

Mutably dereferences the value.

impl Eq for Polynomial

impl<'a, 'b> Mul<&'a Polynomial> for &'b Polynomial

Performs O(nlogn) multiplication of polynomials if F is smooth.

type Output = Polynomial

The resulting type after applying the * operator.

fn mul(self, other: &'a Polynomial) -> Polynomial

Performs the * operation.

impl<'a, 'b> Mul<&'a Scalar> for &'b Polynomial

Convenience Trait to multiply a scalar and polynomial

type Output = Polynomial

The resulting type after applying the * operator.

fn mul(self, constant: &'a Scalar) -> Polynomial

Performs the * operation.

impl Neg for Polynomial

type Output = Polynomial

The resulting type after applying the - operator.

fn neg(self) -> Polynomial

Performs the unary - operation.

impl PartialEq<Polynomial> for Polynomial

fn eq(&self, other: &Polynomial) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl StructuralEq for Polynomial

impl StructuralPartialEq for Polynomial

impl<'a, 'b> Sub<&'a Polynomial> for &'b Polynomial

type Output = Polynomial

The resulting type after applying the - operator.

fn sub(self, other: &'a Polynomial) -> Polynomial

Performs the - operation.

impl<'a, 'b> Sub<&'a Scalar> for &'b Polynomial

type Output = Polynomial

The resulting type after applying the - operator.

fn sub(self, constant: &'a Scalar) -> Polynomial

Performs the - operation.

impl<'a, 'b> SubAssign<&'a Polynomial> for Polynomial

fn sub_assign(&mut self, other: &'a Polynomial)

Performs the -= operation.

impl Sum<Polynomial> for Polynomial

fn sum<I>(iter: I) -> Self where
    I: Iterator<Item = Self>, 

Method which takes an iterator and generates Self from the elements by "summing up" the items.