S2024:E12
We’ll review recent progress on FFT’s from these papers that enables fast FFT’s over Fp when a large power of two divides p+1. There is recent excitment about this because it enables using very convenient Mersenne prime fields of order 2^k-1
