lambdaworks_math/field/fields/
mod.rs

1/// Implementation of two-adic prime fields to use with the Fast Fourier Transform (FFT).
2pub mod fft_friendly;
3/// Implementation of the 32-bit Mersenne Prime field (p = 2^31 - 1)
4pub mod mersenne31;
5pub mod montgomery_backed_prime_fields;
6/// Implementation of the Goldilocks Prime field (p = 2^448 - 2^224 - 1)
7pub mod p448_goldilocks_prime_field;
8/// Implemenation of Pallas field
9pub mod pallas_field;
10/// Implementation of secp256k1 base field.
11pub mod secp256k1_field;
12/// Implementation of secp256k1 scalar field.
13pub mod secp256k1_scalarfield;
14/// Implementation of secp256r1 base field.
15pub mod secp256r1_field;
16pub mod u32_montgomery_backend_prime_field;
17/// Implementation of the u64 Goldilocks Prime field (p = 2^64 - 2^32 + 1)
18pub mod u64_goldilocks_field;
19/// Implementation of prime fields over 64 bit unsigned integers.
20pub mod u64_prime_field;
21
22/// Winterfell and miden field compatibility
23#[cfg(feature = "winter_compatibility")]
24pub mod winterfell;
25
26/// Implemenation of Vesta Prime field (p = 2^254 + 45560315531506369815346746415080538113)
27pub mod vesta_field;