Prime gap comparison shows Riemann is far weaker than Cramér's O(log²n) prediction
geoffreyirving · x · 2026-11-21
Amid the Riemann proof buzz, geoffreyirving notes the cleanest illustration that Riemann is weak relative to what's probably true: it only bounds maximal prime gaps at O(√n log n), while reasonable random models of the primes (Cramér's conjecture) suggest O(log² n).
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