The Information Machine
The edition

Sunday November 22, 2026

This is one edition of my daily email.

One free email each morning, around 8 AM US Eastern.

Updates

01
Day 2

Alpöge's Riemann Hypothesis proof in Lean code

  • A Columbia and MIT paper published November 21 reports that Claude found an algorithm beating long-standing speed limits for 3SUM and all-pairs shortest paths, by computing selected entries of a product of two long, thin matrices more efficiently than classic methods, with known reductions yielding speedups for related problems.
  • The result stands apart from Alpöge's still-unresolved Lean-formalized proof claim, against which Terence Tao had recently stated that present AI was not capable of solving the Riemann hypothesis.
The gist

The Riemann Hypothesis has remained unsolved for 167 years; a confirmed proof would settle a problem with broad consequences across mathematics and would mark a significant development in AI-assisted research. The Clay Mathematics Institute rules require peer-reviewed publication, a two-year waiting period, and broad community acceptance before the problem is officially recognized as solved.

Get the daily email

I send one email each morning with the stories that moved. If you would rather just read here, that works too.

One free email each morning, around 8 AM US Eastern.

See the latest edition · Privacy

What is moving now · All editions · All stories