⬢github Lean · 445 ★ +2 since we first saw it · pushed 5 d ago · Apache-2.0
anthropics/formal-math
Anthropic's repository of machine-checked Lean 4 formalizations of published mathematical results. Projects like a proof that over two-thirds of Riemann zeta zeros are simple and on the critical line, near-3SUM/APSP algorithm bounds, and a claimed 2^O(n) 3-SAT algorithm refuting the Exponential Time Hypothesis, are verified by Lean's kernel and accepted via the Palomar registry's independent checker.
Why now: It's notable because an AI lab is formalizing major research theorems — including a claimed refutation of the ETH from a paper attributed to Claude — pushing machine-checked verification into cutting-edge math and complexity theory.
Who it is for: Lean/Mathlib users, mathematicians and complexity theorists interested in formal verification, and anyone tracking AI-assisted mathematical proof.
Stars over our 50 snapshots: 443 to 445, since 12 h ago.
Where people talked about it
- Yhn A 2^o(n) time algorithm for 3-SAT 1 h ago
API: https://socialmediatrends-api.osmike.com/v1/repos/anthropics/formal-math