Expand description
This module contains a GeneralEvaluationDomain for
performing various kinds of polynomial arithmetic on top of
a FFT-friendly finite field.
It is a wrapper around specific implementations of EvaluationDomain that
automatically chooses the most efficient implementation
depending on the number of coefficients and the two-adicity of the prime.
Structs
- An iterator over the elements of a domain.
- A generalized version of an iterator over the elements of a domain.
Enums
- Defines a domain over which finite field (I)FFTs can be performed. Generally tries to build a radix-2 domain and falls back to a mixed-radix domain if the radix-2 multiplicative subgroup is too small.