Module lambdaworks_math::field::fields::fft_friendly

Implementation of two-adic prime fields to use with the Fast Fourier Transform (FFT).

Modules

• babybear
  Implemenation of the Babybear Prime Field p = 2^31 - 2^27 + 1
• quadratic_babybear
  Implemenation of the quadratic extension of the babybear field
• stark_252_prime_field
  Implementation of two-adic prime field over 256 bit unsigned integers.
• u64_goldilocks
  Implemenation of the Goldilocks Prime Field p = 2^64 - 2^32 + 1
• u64_mersenne_montgomery_field
  Implemenation of the Mersenne Prime field p = 2^31 - 1