Anthropic Says Claude Refuted the Exponential Time Hypothesis, and Shipped a Lean Proof to Check
Anthropic's repository says an internal Claude model found a subexponential algorithm for 3-SAT and shipped a Lean proof that rebuilds in eight minutes, and its own README admits that no machine checks that the short statement file matches the paper. That question of who checks the checkable thing runs through the rest of the day, from a self-hosted coding model at Revolut to four conference talks on verification.
Anthropic's formal-math repository, ETH folder holds the paper, the Lean 4 formalization, the 2^O(n log log n / √log n) counting bound, and the README's statement-fidelity caveat…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.