Module snarkvm_algorithms::fft

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::DensePolynomial;
• pub use polynomial::Polynomial;
• pub use polynomial::SparsePolynomial;

Modules

• domain
  This module contains an EvaluationDomain abstraction for performing various kinds of polynomial arithmetic on top of the scalar field.
• evaluations
  A polynomial represented in evaluations form.
• polynomial
  Work with sparse and dense polynomials.

Traits

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