Claims: OpenAI and Claude models independently found subexponential 3-SAT algorithms, refuting ETH
deedydas · x · 2026-10-27
Deedy claims the 27-year-old Exponential Time Hypothesis has fallen: on Oct 16, OpenAI and Anthropic models independently produced 3-SAT algorithms with the same 2^(n/√log n) bound. Attached screenshots show paper-style documents — OpenAI's "The Exponential Time Hypothesis is False" and Claude's "A 2^(o(n)) Time Algorithm for 3-SAT" (which also counts #3-SAT, discovered by an internal research Claude model) — both stressing this is not P=NP and yields no practical fast algorithms for NP-complete problems. Extraordinary, unverified claim pending confirmation.
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
- Claude's answers to the IEB Mathematics Paper 1 exam, published in full — shauntrennery · 2026-10-27
- Roblox downloaded 145GB of 3D models, including adult content, without asking — choult · 2026-10-27