Argmin critiques OpenAI's claimed faster Fourier transform as galactic algorithm

Argmin's Ben Recht examines OpenAI's math repository, which claims a faster Fourier transform with a slightly smaller log(n) term than Cooley-Tukey FFT. He argues the algorithm is galactic, with an estimated hidden constant of 10^100 at n=10^12, and assumes exact complex arithmetic that real computers cannot perform.

He concludes the result is less a practical breakthrough than a product of loose formalization in theoretical computer science.