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.

Related event: DeepMind researcher asks what comes after Riemann — number theorists have no answer(8 posts)→

Original post →

More from Research

Research channel →