GitHub radar
OpenAI Ten Proofs: Formal Math in Lean 4
OpenAI released machine-checkable Lean 4 proofs for ten advances in mathematics and theoretical computer science — from sphere packing and Ramsey theory to quantum game repetition and circuit complexity.
Lean 4 formal proofs of ten mathematical and theoretical computer science results published by OpenAI: sphere packing bounds, binary and spherical codes, non-sofic groups, Connes's rigidity conjecture, arithmetic circuit complexity, quantum parallel repetition, closest vector problem, Ehrhart's volume conjecture, multicolor Ramsey numbers, and extremal graph theory. Each is a machine-checkable certificate, not a sketch.
Why a vibe-coder should care
Shows that AI systems are now contributing to areas of mathematics that have stood open for decades — and that the results can be verified down to every logical step by machine. A concrete measure of how AI reasoning capabilities have grown.
▌ More finds