For over 150 years the Riemann hypothesis has remained unsolved. Anthropic’s unreleased AI model examined 650 approaches, using 60 sub‑agents and 31 million tokens, pushing the lower bound of solutions forward.

Key Takeaways

  • Anthropic's model tested 650 different ideas on the Riemann hypothesis.
  • The effort involved 60 sub‑agents and 31 million output tokens.
  • Two sub‑agents produced the core mathematical concepts, advancing the lower bound.

On Monday, Anthropic announced that an as‑yet‑unreleased large language model (LLM) made notable progress on the Riemann hypothesis, increasing the lower bound of solutions where the hypothesis holds true. The model evaluated 650 distinct ideas, coordinated across 60 sub‑agents, and consumed a total of 31 million output tokens.

Historical Background

The Riemann hypothesis, first formulated by Bernhard Riemann in 1859, is a cornerstone problem concerning the distribution of prime numbers. For more than a century and a half, mathematicians have pursued a proof, and a $1 million bounty currently stands for a valid general proof—still unclaimed.

Why This Matters

BozokMedia analysis shows that this level of exploratory capability by LLMs could reshape not only mathematical research but also the broader narrative of AI’s role in scientific discovery. The result reignites debate over how AI‑generated insights should be credited and validated.

"The ability of LLMs to explore combinatorial proof spaces could redefine mathematical research," says Dr. Elena Kovacs, professor of computational mathematics.
Did You Know?: The $1 million prize for a proof of the Riemann hypothesis was established in 2000 and remains unclaimed.

Frequently Asked Questions

Q1: Has Anthropic’s model fully solved the Riemann hypothesis?
A: No, the model only extended the lower bound of verified solutions; a complete proof is still pending.

Q2: How much human involvement was required?
A: A single Anthropic staff member provided the initial prompt; the model coordinated the remainder autonomously.