Module fft 

Fast Fourier Transform (FFT) over the BLS12-381 Scalar Field

This module implements a Number Theoretic Transform (NTT), which is an FFT adapted for finite fields. It operates on vectors of Scalar elements from the BLS12-381 curve, enabling O(n log n) polynomial multiplication and interpolation.

This is the high-performance engine required for schemes like Verkle trees that rely on polynomial commitments over large prime fields.

Functions

fft

Computes the forward Fast Fourier Transform (NTT) of a polynomial for cyclic convolution.

fft_negacyclic

Computes the forward negacyclic NTT.

ifft

Computes the inverse Fast Fourier Transform (iNTT) for cyclic convolution.

ifft_negacyclic

Computes the inverse negacyclic NTT.