OpenAI and Anthropic each claim AI algorithms refute the Exponential Time Hypothesis
OpenAI and Anthropic independently report AI-discovered algorithms that would refute the Exponential Time Hypothesis, a 27-year-old open problem; Anthropic's Claude research model submitted a paper on Hexagon claiming a 2^o(n) time algorithm for 3-SAT, pending peer verification.
2026-10-31 ~ 2026-11-02 · 3 related posts
- Episode 1: Viral Claims That Claude and GPT-Next Refuted the Exponential Time Hypothesis Appear to Be a Hoax(2026-10-27, 4 posts)
- Episode 2: Subexponential Hamiltonian Cycle Algorithm Built on ETH Refutation(2026-10-28, 3 posts)
- Episode 3: OpenAI paper claims the Exponential Time Hypothesis is false(2026-10-28, 3 posts)
- Episode 4: OpenAI and Anthropic each claim AI algorithms refute the Exponential Time Hypothesis(2026-10-31, 3 posts)
- AI cracks a 27-year-old pillar of computer science, OpenAI and Anthropic claim — Fcking_Chuck · 2026-10-31
- Anthropic's internal Claude model claims 2^o(n) 3-SAT algorithm, purportedly refuting the ETH — ctjlewis · 2026-10-31
- OpenAI and Anthropic both claim algorithms that would refute the Exponential Time Hypothesis — burny_tech · 2026-11-02