OpenAI algorithm for the FFT is less a breakthrough and more a malicious exploit

Automated excerpt

With the bookkeeping, the FFT computes a length-n Fourier transform in fewer than 5 n log2 n arithmetic operations. To make this acceleration concrete, when n is 1,000, n^2 is 1,000,000 and 5 * n log n is around 50,000, a 20-fold speedup. An algorithm that requires n + 1080 is also considered a linear time algorithm in the big-O regime. But given the constants, the algorithm runs faster only when n is impossibly large.

Selected automatically from source text; not independently written or fact-checked. Read the original for full context.