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
- Equilibrium Forcing: Adaptive video generation without noise conditioning — kwangmoo_yi · 2026-08-22
- Equilibrium Forcing Enables Adaptive Video Generation Without Noise Conditioning — kwangmoo_yi · 2026-08-22
- Deep Dive: How World Models Unlock Physical AI and Robotics — risingodegua · 2026-08-22
- OpenBind Released: Small Molecule Co-folding Model Based on OpenFold3 — MoAlQuraishi · 2026-08-22
- Research Uses LLM Code Gen to Drive Evolutionary Algorithms — kenneth0stanley · 2026-08-22
- Yukon Leaderboard Updated to Rank by Total Speedup Contribution — morgymcg · 2026-08-22