OpenAI claims its models disproved the Exponential Time Hypothesis, with Lean-verified proof
faraz0x · x · 2026-10-27
OpenAI says its system has proved the Exponential Time Hypothesis (ETH) false — a widely believed conjecture about the complexity of Boolean satisfiability, closely tied to P vs. NP, that underpins conditional hardness results in hundreds of papers across graph theory, computational biology, databases, and more.
The refutation was verified in Lean and the proof is public; OpenAI also claims additional proofs in math and physics. If it holds, the result reopens questions about how fast these problems could be solved and may guide the search for better algorithms. Outside experts still need to verify the claims.
More from Models
- User shows Gemini ignoring explicit custom instructions and starting actions unbidden — loriofficialita · 2026-10-27
- EdgeRock architecture keeps KV cache at 72 MiB for 256K context, 99.1% smaller than Qwen3.5-4B — alifcoder · 2026-10-27
- Dev Who Called Kimi Subscription a Scam Gets Locked Out Over False Paid-Post Flag — Scobleizer · 2026-10-27
- Blogger reverses stance: Anthropic now 'crushes' OpenAI models, opposite of 3 months ago — Scobleizer · 2026-10-27
- Power user's stress test: ChatGPT great at research, flaky at image consistency — andytechuk · 2026-10-27
- Claude's answers to the IEB Mathematics Paper 1 exam, published in full — shauntrennery · 2026-10-27