Ryan Shea(@ryaneshea):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

Ryan Shea

@ryaneshea

AI+bio experiments: Fmr Senior Advisor @US_FDA. 10+ unicorn investor. Cofounder @Stacks. MechE/CS @Princeton. NJ Math League State Champ.

Joined March 2010

3.9K Following 30.3K Followers

Ryan Shea@ryaneshea

2026.10.10 03:31

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.

342

Forward to community

Most Popular Users