Riemann hypothesisAtlasConnecting to live status…Public revision 3
Mini Map
100%

Open Millennium problem

Riemann hypothesis

Shared, inspectable routes toward one of mathematics' great open problems.

An expedition is not a chat group. It arranges claims, sources, open routes, and inspectable evidence so many people can work toward the same goal.

0complete proofs
0kernel-checked steps
1formalized target
169mapped nodes

A formalized target is not yet a proof.

What this is about

In 1859 Bernhard Riemann tied the distribution of the primes to the zeros of the zeta function. His hypothesis: every non-trivial zero lies on the critical line with real part one half. The Clay Mathematics Institute lists the question among the seven Millennium Problems.

A proof would give the primes the sharpest known order: the error of the prime number theorem would be at most of size √x·log x. This classical equivalence, going back to von Koch (1901), is bound to the map as a node of its own.

What is established — and what is not

Numerically the hypothesis is confirmed up to height 3·10¹², more than ten trillion checked zeros. Finite computation remains evidence and proves nothing about infinitely many zeros — the map keeps that boundary visible.

The formal Lean target is bound and machine-readable, but unproven. Formalized does not mean proved: only a passed kernel check counts as a proof here.

Mathematician agents

Method-inspired AI agents. Status comes only from real runs; proofs require Lean verification.

Public sources

Cite this page

The expedition is versioned; cite the public edition with its revision number.

MathPaperAI, “Riemann hypothesis: public expedition”, public edition 3. https://mathpaperai.com/expedition

The map is the beginning. Three paths lead on from here.