One All the Way Down

Here is a thing you can do with the primes that takes ten seconds to describe and has resisted proof for two-thirds of a century. The instrument below does it for you: it lays out a starting row and takes iterated absolute differences — each new row is the gaps between neighbours in the row above, sign thrown away. The leftmost column is what we are watching.

I · The triangle

Press it into life. The default row is the primes themselves; row 0 begins with 2, and every row after it begins with 1. That is the whole claim, and it is Gilbreath's conjecture: with d⁰ the primes and dᵏ the row of absolute differences of dᵏ⁻¹, the leading entry dᵏ₀ = 1 for every k ≥ 1.

Norman Gilbreath found it in 1958 “by chance while doing arithmetic on a napkin,” and Martin Gardner carried it to a wide audience; François Proth had already published the same observation in 1878. It is the kind of thing that ought to be either obviously true or quickly false, and is neither.

II · The check

It is unproven, but it is very checked. This page re-derives the leading column live in your browser, and an offline verifier carries it much further — no stored answers, every number printed from a fresh checkout.

Checking the leading column in your browser…

For the record, Andrew Odlyzko (1993) carried this to the first n = π(10¹³) ≈ 3.4 × 10¹¹ terms — three hundred forty billion — and it has not failed. (That figure is cited from his paper, not recomputed here.) So the question is not really whether it holds. It is why, and what it is a fact about.

III · Why a 1 keeps coming back — the {0,2} machine

Look again at the triangle. Within a few rows the entries are almost all 0s and 2s (the shaded rows mark where a row has fallen into “a 1, then nothing but 0s and 2s”). That regime is not a coincidence; it is the engine. Here is the only lemma you need, and it is a four-line proof, not a conjecture:

Suppose a row reads 1, then nothing but 0s and 2s. Then the very next row does too. Its first entry is |a₁ − 1|, and a₁ ∈ {0,2}, so that is 1 either way. Every later entry is |aᵢ₊₁ − aᵢ| with both values in {0,2}, so the difference is again 0 or 2. The shape 1, {0,2}, {0,2}, … is a fixed point of the difference step: feed it in, get it back out, one row shorter, the leading 1 regenerated for free.

So the leading 1 is not won fresh on every row. It is won once — as soon as a row first falls into the 1-then-only-0s-and-2s pattern — and then it sustains itself, mechanically, all the way down. Operate the fixed point yourself: tap a cell to flip it between 0 and 2, then take the difference and watch the shape (and the leading 1) survive.

The verifier watches this happen on the real primes: over the first 4,000 primes, row 52 is already 1 followed by only 0s and 2s across all 3,948 of its entries — and from that row down, every leading entry is forced to be 1 by the lemma. This is exactly how Odlyzko reached 340 billion: he didn't check the rows one at a time; he exhibited a single row that is 1 then only 0s and 2s for the next ~3.4 × 10¹¹ entries, and let the lemma do the rest.

And this is precisely why the conjecture is still open. The machine gives you a leading 1 for as many rows as the {0,2} run is long. To get it forever, you would need some row to be 1-then-{0,2} for its entire infinite tail — and no one has proved any row is. The run is, empirically, astronomically long. “Astronomically long” is not “infinite,” and the whole difficulty lives in that gap.

IV · Is it even about the primes?

Notice what the lemma never mentioned: primes. It only needed small, even differences appearing fast enough to flood the rows with 0s and 2s. So switch the triangle above to Random odd and re-roll: many random small-gap odd sequences satisfy Gilbreath too — and many don't. Hallard Croft conjectured (via Gardner, 1980) that any sequence starting with 2, otherwise odd, with a low enough bound on its gaps, would always do it. Put it to a real experiment — the exact one the offline verifier runs, reproduced here in your browser, seed for seed:

Two things at once, and they pull against each other. The property is not unique to the primes — plenty of random small-gap odd sequences have it, so primality is not the secret ingredient. But it is not automatic for any bounded-gap sequence either — fully half of the {2,4} sequences fail, and as you let the gaps widen the property drains away. The truth sits in the uncomfortable middle: it is structural, about how fast small even differences can flood the rows — but “bounded gaps” is too crude a way to name the structure that actually does it.

V · Where it breaks

Croft's generalisation is not just unproven; it is false, and you can hold a counterexample in your hand. Switch the triangle to Counterexample: the shortest one, starting from only 2, 3, is

2, 3, 7

Its rows are 2 3 7 → 1 4 → 3: the second difference-row leads with 3, not 1. Gaps of 1 and 4 — bounded, odd after the 2 — and it fails immediately. You can even copy the primes' own opening and still break it; the witness 2, 3, 5, 7, 13 keeps the first four primes exactly and then takes a single step of 6, and its row 4 leads with 3.

David Eppstein settled the general question in 2011 (“Anti-Gilbreath sequences”): for every prescribed start of 2-and-odds, and every non-constant growth rate you allow the gaps, there is a continuation by odd numbers obeying that rate whose difference-rows fail to begin with 1 infinitely often. No gap bound, however generous, rescues Croft. The leading 1 is real, it is structural, and it is not a free consequence of small gaps — which is the most interesting place a conjecture can land: not true, not trivially false, but false in a way that tells you the structure was subtler than the name you gave it.

VI · What is actually true

Strip it to what survives every check:

1. For the primes, the leading entry of every difference-row is 1, verified to the first 100,000 rows by the offline verifier and to ~3.4 × 10¹¹ terms by Odlyzko (1993). Still unproven in general.

2. The leading 1 persists by a mechanical fixed point: a row of 1 then only 0s and 2s reproduces its own shape forever, so the property is won once and sustained. The conjecture is open exactly because no row is known to hold that shape for its whole infinite tail.

3. The property is not special to primes — random small-gap odd sequences share it — but it is not implied by bounded gaps either, and Croft's 1980 generalisation to all such sequences is false (Eppstein, 2011).

The pleasure of it is the bait-and-switch. You are shown something that looks like a deep secret of the primes; you find the secret has almost nothing to do with primes; and just as you are ready to say “so it's only about small gaps,” that turns out to be false too. The honest answer is the narrow ledge between the two easy ones — and the only way to stand on it is to show the check.