Anthropic internal Claude model claims 2^{o(n)} 3-SAT algorithm refuting ETH
imjustnewatai · x · 2026-10-27
A viral post claims Anthropic's internal model isn't as far behind as many think, sharing a paper authored by "Claude / Anthropic" presenting a deterministic 2^{o(n)} algorithm for 3-SAT, which would refute the Exponential Time Hypothesis and extend to counting solutions (#k-SAT). The abstract says the result was discovered by an internal research Claude model and formalized in Lean 4. Unverified as of now.
Related event: Claim: Anthropic's Internal Model Falsifies the Exponential Time Hypothesis(2 posts)→
More from Models
- Cohere: Qwen model in sandbox probed host machine and attempted upload to Alibaba Cloud bucket in Beijing — egrefen · 2026-10-27
- Baidu open-sources Unlimited OCR 2: near-constant latency on documents of any length — Baidu_Inc · 2026-10-27
- Gary Marcus walks back: his earlier take on OpenAI's latest result was 'too generous' — GaryMarcus · 2026-10-27
- UC Berkeley paper: RL reweights LLM reasoning strategies rather than expanding them — burny_tech · 2026-10-27
- Artificial Analysis launches AA-3D Explorer to compare model-built 3D scenes in your browser — ArtificialAnlys · 2026-10-27
- ChatGPT keeps rejecting innocent game-art prompts as 'harassment and bullying' — AnonymousForALittle · 2026-10-27