Struct snarkos_algorithms::fft::DensePolynomial

pub struct DensePolynomial<F: Field> {
    pub coeffs: Vec<F>,
}

Stores a polynomial in coefficient form.

Fields

coeffs: Vec<F>

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

Implementations

impl<F: Field> DensePolynomial<F>

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: &[F]) -> Self

Constructs a new polynomial from a list of coefficients.

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

Constructs a new polynomial from a list of coefficients.

pub fn degree(&self) -> usize

Returns the degree of the polynomial.

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

Evaluates self at the given point in the field.

pub fn naive_mul(&self, other: &Self) -> Self

Perform a naive n^2 multiplicatoin of self by other.

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<F: PrimeField> DensePolynomial<F>

pub fn mul_by_vanishing_poly(
    &self,
    domain: EvaluationDomain<F>
) -> DensePolynomial<F>

Multiply self by the vanishing polynomial for the domain domain. Returns the quotient and remainder of the division.

pub fn divide_by_vanishing_poly(
    &self,
    domain: EvaluationDomain<F>
) -> Option<(DensePolynomial<F>, DensePolynomial<F>)>

Divide self by the vanishing polynomial for the domain domain. Returns the quotient and remainder of the division.

impl<F: PrimeField> DensePolynomial<F>

pub fn evaluate_over_domain_by_ref(
    &self,
    domain: EvaluationDomain<F>
) -> Evaluations<F>

Evaluate self over domain.

pub fn evaluate_over_domain(self, domain: EvaluationDomain<F>) -> Evaluations<F>

Evaluate self over domain.

Trait Implementations

impl<'a, 'b, F: Field> Add<&'a DensePolynomial<F>> for &'b DensePolynomial<F>

type Output = DensePolynomial<F>

The resulting type after applying the + operator.

fn add(self, other: &'a DensePolynomial<F>) -> DensePolynomial<F>

Performs the + operation.

impl<'a, 'b, F: Field> AddAssign<&'a DensePolynomial<F>> for DensePolynomial<F>

fn add_assign(&mut self, other: &'a DensePolynomial<F>)

Performs the += operation.

impl<'a, 'b, F: Field> AddAssign<(F, &'a DensePolynomial<F>)> for DensePolynomial<F>

fn add_assign(&mut self, (f, other): (F, &'a DensePolynomial<F>))

Performs the += operation.

impl<F: Field> CanonicalDeserialize for DensePolynomial<F>

fn deserialize<R: Read>(reader: &mut R) -> Result<Self, SerializationError>

Reads Self from reader.

fn deserialize_uncompressed<R: Read>(
    reader: &mut R
) -> Result<Self, SerializationError>

Reads Self from reader without compression.

impl<F: Field> CanonicalSerialize for DensePolynomial<F>

fn serialize<W: Write>(&self, writer: &mut W) -> Result<(), SerializationError>

Serializes self into writer.

fn serialized_size(&self) -> usize

fn serialize_uncompressed<W: Write>(
    &self,
    writer: &mut W
) -> Result<(), SerializationError>

Serializes self into writer without compression.

fn uncompressed_size(&self) -> usize

impl<F: Clone + Field> Clone for DensePolynomial<F>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Field> Debug for DensePolynomial<F>

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

Formats the value using the given formatter.

impl<F: Default + Field> Default for DensePolynomial<F>

fn default() -> DensePolynomial<F>

Returns the "default value" for a type.

impl<F: Field> Deref for DensePolynomial<F>

type Target = [F]

The resulting type after dereferencing.

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

Dereferences the value.

impl<F: Field> DerefMut for DensePolynomial<F>

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

Mutably dereferences the value.

impl<'a, 'b, F: Field> Div<&'a DensePolynomial<F>> for &'b DensePolynomial<F>

type Output = DensePolynomial<F>

The resulting type after applying the / operator.

fn div(self, divisor: &'a DensePolynomial<F>) -> DensePolynomial<F>

Performs the / operation.

impl<F: Eq + Field> Eq for DensePolynomial<F>

impl<'a, F: 'a + Field> From<&'a DensePolynomial<F>> for DenseOrSparsePolynomial<'a, F>

fn from(other: &'a DensePolynomial<F>) -> Self

Performs the conversion.

impl<F: Field, '_> From<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

fn from(other: DensePolynomial<F>) -> Self

Performs the conversion.

impl<F: Hash + Field> Hash for DensePolynomial<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, 

Feeds a slice of this type into the given [Hasher].

impl<F: Field> Into<DensePolynomial<F>> for SparsePolynomial<F>

fn into(self) -> DensePolynomial<F>

Performs the conversion.

impl<F: Field, '_> Into<DensePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

fn into(self) -> DensePolynomial<F>

Performs the conversion.

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

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

type Output = DensePolynomial<F>

The resulting type after applying the * operator.

fn mul(self, other: &'a DensePolynomial<F>) -> DensePolynomial<F>

Performs the * operation.

impl<F: Field> Neg for DensePolynomial<F>

type Output = DensePolynomial<F>

The resulting type after applying the - operator.

fn neg(self) -> DensePolynomial<F>

Performs the unary - operation.

impl<F: PartialEq + Field> PartialEq<DensePolynomial<F>> for DensePolynomial<F>

fn eq(&self, other: &DensePolynomial<F>) -> bool

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

fn ne(&self, other: &DensePolynomial<F>) -> bool

This method tests for !=.

impl<F: Field> StructuralEq for DensePolynomial<F>

impl<F: Field> StructuralPartialEq for DensePolynomial<F>

impl<'a, 'b, F: Field> Sub<&'a DensePolynomial<F>> for &'b DensePolynomial<F>

type Output = DensePolynomial<F>

The resulting type after applying the - operator.

fn sub(self, other: &'a DensePolynomial<F>) -> DensePolynomial<F>

Performs the - operation.

impl<'a, 'b, F: Field> SubAssign<&'a DensePolynomial<F>> for DensePolynomial<F>

fn sub_assign(&mut self, other: &'a DensePolynomial<F>)

Performs the -= operation.