A New Preprint Credits Claude With Beating the 3SUM and APSP Barriers; OpenAI Apologizes to Australia
A preprint says an AI model found the first polynomial speedups for 3SUM and all-pairs shortest paths, and that a Lean proof checked them, while the same day brought OpenAI's apology to Australia, a protocol flaw in agents from Google and others, and a fight over who pays when an agent causes damage. The exponents move by a hair; the question the authors leave open is how far the same method goes.
arXiv 2610.06783: Alman and Vassilevska Williams report 3SUM in n^1.9992 and APSP in n^2.9995, and credit Claude with discovering the algorithm; it is an unrefereed preprint, and the Lean…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.