AI-assisted math lowers bound for de Bruijn–Newman constant to 0.1787854
ctjlewis · x · 2026-08-22
Jude Gomila published a result discovered with AI assistance, lowering the ceiling of the de Bruijn–Newman constant (Λ) from 0.2 to 0.1787854. This constant is critical to the Riemann Hypothesis.
- Method: Uses Polymath 15 criterion combined with interval certificates.
- Verification: Involves certifying 3.1+ million zero-free windows and a lemma covering the rest to infinity.
- Details: A full walkthrough, animation, and audit repository are provided, inviting community feedback and adversarial checks.
More from Research
- Devin Oncall tops SREGym with 100% end-to-end success, auto-resolving production incidents — tianyin_xu · 2026-10-16
- SJTU AutoLab releases Drive3R, a streaming geometric foundation model for long-horizon driving 3D reconstruction — AutoLab-SJTU · 2026-10-16
- Cortex A/B-tests coding-agent skills and rules by replaying developer corrections before keeping them — Samuele Giampieri · 2026-10-16
- Zero-latency lab-in-the-loop tests whether drug-discovery agents cheat via memorization — niloofar_mire · 2026-10-16
- 260M-parameter looped diffusion transformer beats 6x larger baselines with 5x less compute — burkov · 2026-10-16
- Stanford's Next-Concept Modeling sketches text first, 21x faster generation on one H100 — lmoroney · 2026-10-16