DeepMind's Irving: number theorists can't name the conjecture beyond Riemann
geoffreyirving · x · 2026-11-21
Commenting on the claimed RH proof, DeepMind researcher Geoffrey Irving notes that number theorists he asked can't name a canonical stronger conjecture beyond Riemann. Montgomery's pair correlation conjecture — zeta zero spacings matching random Hermitian matrices, supported by Odlyzko's 1987 computations — isn't the 'Riemann++' analogue of Circuit-SETH for P≠NP. He also notes cryptographic hardness conjectures are phrased as sharp cycle counts, e.g. no SHA-256 collisions under 2^128 cycles.
More from Research
- Riemann Hypothesis Lean proof passes independent kernel checks; davidad calls it biggest surprise since GPT-5 — davidad · 2026-11-21
- "Would you please look at the data?": giffmana flags bad annotations in FineVision's coco_color — giffmana · 2026-11-21
- Vishal Sikka on reported Riemann Hypothesis proof with Claude: 'an incredible day' — vsikka · 2026-11-21
- Interpretability competition launched to test logit lenses on Thinking Machines' Inkling — benno_krojer · 2026-11-21
- NDIF hosts Thinking Machines' Inkling 2 Mini and launches a Looped Lens interpretability challenge — benno_krojer · 2026-11-21
- OpenAI's GPT-Rosalind agents surface new drug discovery lead for neurodegenerative disease — OpenAI · 2026-11-21