Screenshot claims AI system refuted Exponential Time Hypothesis, verified in Lean
felpix_ · x · 2026-10-27
A circulating screenshot claims a computer science collaboration AI system has proved the Exponential Time Hypothesis (ETH) false, with the result subsequently verified in Lean.
- ETH is a longstanding conjecture about the computational complexity of Boolean SAT, closely tied to P vs. NP, and widely believed true;
- Hundreds of papers have used ETH to derive conditional hardness results across graph theory, computational biology, databases, computational geometry and more;
- If true, the refutation reopens how much faster these tasks could become and may guide the search for better algorithms, though turning theory into practice needs significant further research.
The claim currently rests only on a screenshot with no paper or official announcement, so treat as unverified.
More from AGI Musings
- John Carmack: no robot today can change batteries in a jack-o-lantern — ID_AA_Carmack · 2026-10-27
- Stripe exec: AI trains on words yet is terrible at writing — jeff_weinstein · 2026-10-27
- Thiel asked what matters most post-SI, pauses 30 seconds: "Human Relationships" — kleffew94 · 2026-10-27
- Claude Opus 5.5 claims ETH false, all-dimension Kakeya and Yang-Mills in one day — repligate · 2026-10-27
- Vergecast: files are over — Paul Ford puts your stuff in URLs — round · 2026-10-27
- OpenAI asked 3 scientific fields how to release AI discoveries — got 3 very different answers — amasad · 2026-10-27