Module 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

babybear_u32

Inmplementation of the Babybear Prime Field p = 2^31 - 2^27 + 1 using u32

quadratic_babybear

Implementation of the quadratic extension of the babybear field

quartic_babybear

Implementation of the extension of degree 4 of the babybear field using u64.

quartic_babybear_u32

Implementation of the extension of degree 4 of the babybear field using u32.

stark_101_prime_field

Implementation of the prime field used in Stark101 tutorial, p = 3 * 2^30 + 1

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