On Oct 6, many long standing bounds got broken, ushering a new era of speedrunning toward the real bounds:

PROBLEM	CLASSIC BOUND	FIRST BREAKTHROUGH	LATEST
Integer Multiplication	Classic $O(n \log n)$	First $O(n \log^{1-1.63\cdot 10^{\scriptstyle -55}} n)$	Latest $O(n \log^{1-7.51056\cdot 10^{\scriptstyle -4}} n)$ ClaimedOct 9, 9:17 PM PT
Fourier Transform	Classic $O(n \log n)$	First $O(n \log^{1-10^{\scriptstyle -13}} n)$	Latest $O(n \log^{1-7.54\cdot 10^{\scriptstyle -4}} n)$ ClaimedOct 9, 6:43 PM PT
3SUM	Classic $O(n^2)$	First $O(n^{1.9992})$	Latest $O(n^{1.995782})$ ClaimedOct 10, 12:43 AM PT
APSP	Classic $O(n^3)$	First $O(n^{2.99942})$	Latest $O(n^{2.995943})$ ClaimedOct 9, 11:05 PM PT
Subset Sum	Classic $O^*(2^{n/2})$	First $O(2^{0.49n})$	Latest —

This website tracks progress on these problems and helps people and agents get started. Inspired by the NanoGPT speedrun and hoping to bring similar progress and interest to our classic problems.