Lean proof of Riemann Hypothesis, code generated with Claude, passes paranoid-mode kernel check
Singularitarian · x · 2026-11-21
Mathematician Andrew Sutherland completed the first independent nanoda kernel and comparator verification, essentially confirming a Lean formalization of the Riemann Hypothesis.
- nanoda (Rust kernel bundled with Lean 4.36.0) checked the full 61.57 GB export, exiting 0 in 27 min 42 s on 80 threads (9.2 CPU-hours, 89 GB peak memory), with matching sha256
- Statement comparison and axiom checks passed under lake comparator --paranoid; the canonical challenge run is still parsing
- The proof code was generated by @alpoge using Claude and possibly other tools
If fully verified, it would be the first time humanity holds a magnificent proof it doesn't yet fully understand — but that is probably correct.
More from Research
- Meta FAIR's Agents Write Their Own Memory Prompts, Beating Human-Crafted Ones 56.0 vs 44.6 — winer666 · 2026-11-21
- Heave-Ho: decentralized framework coordinates teams of 2–10 humanoids on long-horizon tasks — yuewang314 · 2026-11-21
- USC's Heave-Ho coordinates humanoid robot teams with zero network messages, 86% success at 120x faster planning — yuewang314 · 2026-11-21
- Researcher flags Depth Pro 2 border artifacts: matting vs depth confusion, RL could fix it — giffmana · 2026-11-21
- Free online book: Statistical Foundations of Reinforcement Learning (2026) — burkov · 2026-11-21
- AgentRoboCritic: action-level benchmark reveals how frontier agents really control robots — XiongChenyan · 2026-11-21