Module snarkvm_algorithms::fft

Expand description

This crate implements functions for manipulating polynomials over finite fields, including FFTs.

Re-exports

pub use domain::EvaluationDomain;

pub use evaluations::Evaluations;

pub use polynomial::Polynomial;

This module contains an EvaluationDomain abstraction for performing various kinds of polynomial arithmetic on top of the scalar field.

A polynomial represented in evaluations form.

Work with sparse and dense polynomials.

Stores a polynomial in coefficient form.

Stores a sparse polynomial in coefficient form.

Types that can be FFT-ed must implement this trait.