Struct Fft

pub struct Fft<F: FftField> {
    pub elements: Vec<F>,
    /* private fields */
}

fft construction using n th root of unity supports polynomial operation less than n degree

Fields

elements: Vec<F>

Implementations

impl<F: FftField> Fft<F>

pub fn new(k: usize) -> Self

pub fn size(&self) -> usize

polynomial degree

pub fn size_inv(&self) -> F

size inverse

pub fn generator(&self) -> F

nth unity of root

pub fn generator_inv(&self) -> F

nth unity of root

pub fn dft(&self, coeffs: Coefficients<F>) -> PointsValue<F>

perform discrete fourier transform

pub fn idft(&self, points: PointsValue<F>) -> Coefficients<F>

perform classic inverse discrete fourier transform

pub fn coset_dft(&self, coeffs: Coefficients<F>) -> PointsValue<F>

perform discrete fourier transform on coset

pub fn coset_idft(&self, points: PointsValue<F>) -> Coefficients<F>

perform discrete fourier transform on coset

pub fn z(&self, tau: &F) -> F

This evaluates t(tau) for this domain, which is tau^m - 1 for these radix-2 domains.

pub fn z_on_coset(&self) -> F

This evaluates t(tau) for this domain, which is tau^m - 1 for these radix-2 domains.

pub fn divide_by_z_on_coset(&self, points: PointsValue<F>) -> PointsValue<F>

The target polynomial is the zero polynomial in our evaluation domain, so we must perform division over a coset.

pub fn poly_mul( &self, rhs: Coefficients<F>, lhs: Coefficients<F>, ) -> Coefficients<F>

polynomial multiplication

pub fn evaluate_all_lagrange_coefficients(&self, tau: F) -> Vec<F>

Evaluate all the lagrange polynomials defined by this domain at the point tau.

pub fn compute_vanishing_poly_over_coset( &self, poly_degree: u64, ) -> PointsValue<F>

Given that the domain size is D This function computes the D evaluation points for the vanishing polynomial of degree n over a coset

Trait Implementations

impl<F: Clone + FftField> Clone for Fft<F>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Debug + FftField> Debug for Fft<F>

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

Formats the value using the given formatter.

impl<F: PartialEq + FftField> PartialEq for Fft<F>

fn eq(&self, other: &Fft<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: Eq + FftField> Eq for Fft<F>

impl<F: FftField> StructuralPartialEq for Fft<F>