OpenAI and Anthropic both claim algorithms that would refute the Exponential Time Hypothesis
burny_tech · x · 2026-11-02
Two rival AI labs, OpenAI and Anthropic, have independently claimed algorithms that would overturn the Exponential Time Hypothesis, one of theoretical CS's deepest assumptions.
- Anthropic's claimed algorithm counts 3-SAT solutions in subexponential time: T(n) = 2^{O(n log log n / √log n)}, where log log n / √log n approaches zero — the mathematical surprise.
- If correct, this would upend an assumption underpinning decades of complexity theory.
- Both labs have released formal proof material, but independent verification is still pending.
- The open question: whether these AI-generated arguments survive mathematical scrutiny.
More from Research
- BioCompute opens its remotely controlled wet lab, pitching 'Lovable for biology' — vaibhavbetter · 2026-11-04
- Legora CTO hand-writes 100k-param model weights with Fable, one-shot beats training — dair_ai · 2026-11-04
- 20-40% of alignment data is noisy: a loss-reduction scoring framework to fix it — burkov · 2026-11-04
- Scientists image quantum entangled photons in real time, and the result looks like a taijitu — CurieuxExplorer · 2026-11-04
- kalomaze: crude diffusion autoencoders may lose low-frequency info at the latent stage — kalomaze · 2026-11-04
- Structured captions boost text-to-music alignment, new Music DSG metric beats CLAP — affige_yang · 2026-11-04