We’re publishing another update to OpenAI Problem #
130#: computing the exact discrete Fourier transform below n log n.
Our paper now incorporates the all-length bound:
T(n) = O(n(log n)^(1−δ)), with δ = 0.0007547360.
That’s 10.34 times the exponent saving of δ = 7.3×10⁻⁵ in our previous announcement.
The stronger Fourier result comes from Jacob Sussman’s five-stage framework and Chafik Boukhalfa’s improved construction, building on
@OpenAI,
@0xdoug,
@RohanArun,
@SJ_Swapnil_Jain and the wider community.