Module lambdaworks_math::field::fields

Implementation of particular cases of fields.

Modules

• fft_friendly
  Implementation of two-adic prime fields to use with the Fast Fourier Transform (FFT).
• mersenne31
  Implementation of the 32-bit Mersenne Prime field (p = 2^31 - 1)
• montgomery_backed_prime_fields
• p448_goldilocks_prime_field
  Implementation of the Goldilocks Prime field (p = 2^448 - 2^224 - 1)
• pallas_field
  Implemenation of Pallas field
• u64_goldilocks_field
  Implementation of the u64 Goldilocks Prime field (p = 2^64 - 2^32 + 1)
• u64_prime_field
  Implementation of prime fields over 64 bit unsigned integers.
• vesta_field
  Implemenation of Vesta Prime field (p = 2^254 + 45560315531506369815346746415080538113)