🔥An AI model (Claude), asked to check some cryptography, wandered off task and spent 16 million tokens inventing an algorithm that beat two of computer science's most stubborn textbook speed limits. (1) Do any three of n numbers sum to zero? (3SUM) (2) Find the shortest route between every pair of points in a network (All-Pairs Shortest Paths, APSP). For decades nobody could do fundamentally better than n² and n³ steps. Now it's n^1.9992 and n^2.9995. https://arxiv.org/pdf/2610.06783v1