Lean verification confirms the result
Commenters formally verified the surprising sub-n-log-n bound in Lean on Mathlib's Turing machine model and are pushing kappa improvements, inviting contributions.
How does the speedup work?
Readers asked for intuition; replies point to splitting one FFT into many smaller FFTs and sharing a small amount of work, plus explanatory papers.
The tracking chart is badly made
The bigospeedrun graph was mocked for a misleading log scale and buggy controls, sparking a tangent on LLMs writing bespoke code instead of using mature libraries.