---
format: "aidr-story-markdown/v1"
id: "69e4cab0a49eb8fe129a84339124519dd03e404a177f6e50f7af6207ba2dbbac"
canonical_url: "https://aidr.today/69e4cab0?lang=en"
title: "Anthropic's Disproof of the ETH"
lang: "en"
requested_lang: "en"
available_langs: ["en","vi"]
translation_fallback: null
fallback_fields: []
published_at: "2026-10-27T05:58:59.000Z"
category: "Research"
topics: ["anthropic","llm"]
source_urls: ["https://hexagonmath.org/2610.00577v1","https://news.ycombinator.com/item?id=50255159"]
summary: "Anthropic has refuted the Exponential Time Hypothesis (ETH) by developing a deterministic algorithm for 3-SAT on n variables that runs in $2^{o(n)}$ time. The algorithm also solves the harder problem #3-SAT by counting the number of satisfying assignments. The result was discovered by an internal research Claude model and has been formalized in Lean 4."
---

# Anthropic's Disproof of the ETH

> [Open the canonical story](<https://aidr.today/69e4cab0?lang=en>)

**Published:** 2026-10-27T05:58:59.000Z
**Category:** Research
**Topics:** anthropic, llm

## Summary

Anthropic has refuted the Exponential Time Hypothesis \(ETH\) by developing a deterministic algorithm for 3\-SAT on n variables that runs in $2^\{o\(n\)\}$ time\. The algorithm also solves the harder problem \#3\-SAT by counting the number of satisfying assignments\. The result was discovered by an internal research Claude model and has been formalized in Lean 4\.

## Sources

- [Story source](<https://hexagonmath.org/2610.00577v1>)
- [Discussion](<https://news.ycombinator.com/item?id=50255159>)