Module domain 

This module contains an EvaluationDomain abstraction for performing various kinds of polynomial arithmetic on top of fields that are friendly to fast-fourier-transforms (FFTs).

A field is FFT-friendly if it contains enough roots of unity to perform the FFT in O(n log n) time. These roots of unity comprise the domain over which polynomial arithmetic is performed.

Re-exports

pub use general::GeneralEvaluationDomain;

pub use mixed_radix::MixedRadixEvaluationDomain;

pub use radix2::Radix2EvaluationDomain;

Modules

general

This module contains a GeneralEvaluationDomain for performing various kinds of polynomial arithmetic on top of a FFT-friendly finite field.

mixed_radix

This module provides a MixedRadixEvaluationDomain for performing various types of polynomial arithmetic on fields that are FFT-friendly.

radix2

This module defines Radix2EvaluationDomain, an EvaluationDomain for performing various kinds of polynomial arithmetic on top of fields that are FFT-friendly.

Traits

DomainCoeff

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

EvaluationDomain

Defines a domain over which finite field (I)FFTs can be performed.