A new ceiling for Λ: the de Bruijn–Newman constant

In 1859 Bernhard Riemann explained where that hidden order comes from. He took Euler's identity, which connects the primes to a single function of one complex variable,

extended it to the whole complex plane, and discovered that the wobble of the prime count around its smooth curve is governed — exactly, via an explicit formula — by the locations of the zeros of this function. Each zero contributes one wave to the error; the zero's height sets the wave's frequency and, crucially, its horizontal position sets the wave's amplitude. Riemann observed that every zero he could examine sat on one vertical line, Re s = ½, now called the critical line — the position giving the smallest possible amplitude — and remarked it was “very probable” all of them do. That remark is the Riemann hypothesis. Its concrete content: the prime-count error up to x never exceeds roughly √x, the same size as the wobble of a fair coin flipped x times. The primes are allowed to look random; RH says they are never allowed to drift with a bias.

The wave description is an actual formula, and you can run it below. The slate staircase counts prime powers (a cousin of the staircase above, weighted so the mathematics is exact), and the vermillion curve is Riemann's formula built from the smooth trend plus one wave per zeta zero. Drag the slider and watch thirty zeros carve the primes:

Try it — build the primes out of zeta zeros, one wave at a time

zero-waves included 0 / 30no zeros: just the smooth trend x, which misses every step

every one of these zeros has real part exactly ½, which makes its wave swell like √x as x grows — the slowest growth the explicit formula allows. A zero off the line at real part β ≠ ½ would make its wave grow like x^β instead, out of step with all the others, and the prime count would drift off course.

It has now been open for 167 years. It is part of the eighth of Hilbert's problems (1900) and is one of the Clay Millennium Prize problems today; hundreds of theorems across number theory and beyond are proved conditionally, “assuming RH.” Its zeros have been checked by computer into the trillions — every one on the line — but a check is not a proof. The way forward is to turn the question into a number that can be moved — and that is exactly what Λ is.

Λ (defined properly in the next chapter) repackages the Riemann hypothesis as a statement about one real number: RH holds if and only if Λ ≤ 0 (a proved equivalence, established in Chapter 1). That reformulation has three consequences. First, progress becomes measurable: a yes/no conjecture has no partial credit, but an upper bound on Λ can shrink: ½ → 0.22 → 0.2 → and now 0.1787854. Second, since 2018 we know Λ ≥ 0, so Λ is confined to the interval from 0 to the current ceiling, and RH is the statement that Λ sits at the left endpoint; every improvement to the ceiling is measured distance toward the answer. Third, bounds on Λ are unconditional — nothing in them assumes RH itself. Lowering Λ is one of the few rigorous, quantifiable ways to make progress on the Riemann hypothesis.

Start with Riemann's xi function, a repackaging of the zeta function: $\xi(s)=\tfrac12 s(s-1)\pi^{-s/2}\Gamma(s/2)\zeta(s)$. The Riemann hypothesis says all its zeros lie on the critical line $\mathrm{Re}\,s=\tfrac12$. Rotate coordinates so that line becomes the real axis (this proof uses the Polymath 15 normalization $H_0(z)=\tfrac18\,\xi\!\left(\tfrac12+\tfrac{iz}{2}\right)$) and RH becomes a single sentence:

In 1950 de Bruijn had the idea of deforming this function with a one-parameter flow — mathematically, running the heat equation on it:

where $\Phi$ is the fixed super-exponentially decaying kernel with $H_0=\tfrac18\xi$. Positive t smooths the function and, as we'll see, herds its zeros toward the real axis; negative t roughens it and pushes zeros off. De Bruijn proved that once all zeros are real they stay real at every later time. So there is a single threshold, made precise by Newman in 1976:

That threshold is the de Bruijn–Newman constant, and it converts the Riemann hypothesis from a statement about infinitely many zeros into a statement about one real number:

$$\mathrm{RH}\iff \Lambda\le 0$$

Analogy. Λ is a thermostat reading. The xi function is a room full of particles (its zeros), and t is heat: warm the room and the particles settle onto the floor (the real axis); chill it and some lift off. Λ is the exact temperature at which the last airborne particle lands. The Riemann hypothesis says the room as built — at temperature zero — already has everything on the floor. Since we can't yet check every particle, we do the next best thing: prove the landing temperature is low.

Under the flow, the zeros of $H_t$ move like interacting particles: real zeros repel each other along the axis, and each complex-conjugate pair gets pulled toward the axis. For an isolated pair at height y (that is, at $z=x\pm iy$), the dynamics are governed, up to smaller corrections, by

so the squared height falls at a constant rate 2, and a pair starting at height y touches down at time about $y^2/2$. The final bound has the same form: it will be $t_0+y_0^2/2$: “run the flow to time $t_0$, show nothing flies higher than $y_0$, then wait $y_0^2/2$ longer for the stragglers to land.” Polymath 15's Theorem 1.2 (introduced next chapter) is the rigorous, effective version of that sentence.

Try it — run the heat flow and watch the zeros land

time t 0.0000still complex 5 pairsrule a pair at height y lands at t = y²/2…heating

Analogy. Rain settling after a storm. Each complex pair is a droplet at altitude y, and gravity here acts on altitude-squared: every droplet loses y² at the same steady rate 2. You don't need to track any droplet individually — if you can certify that by time t₀ no droplet is above altitude y₀, physics finishes the argument: the sky is completely clear by t₀ + y₀²/2. The hard work is the certifying, and it splits into the three parts of the next chapter.

Two structural facts make the schedule provable. First, zeros move continuously in t: a zero cannot appear at a point without traveling there. Second, a zero's vertical speed is bounded by the dynamics, so a region that is empty stays empty unless a zero crosses its boundary. Together these reduce the problem to fencing a region and checking the fence — which is what the criterion asks.

Analogy. Theorem 1.2 works like a crane left standing on the site: anyone who can supply the three certified parts it needs — a verified height, a clean final-time region, and a barrier — can use it to lift the bound. This proof machines heavier parts and lifts with the same crane, near its rated capacity at today's verified height.

The squeeze on Λ has two independent sides, and they work by completely different mechanisms. Both live in the upper half-plane: since $H_t$ takes real values on the real axis, every off-axis zero at $x+iy$ has a mirror twin at $x-iy$, so it is enough to track the region above the axis — position x running along the axis, height y measuring how far a zero still has to fall. RH is the statement that this upper region is empty.

1. The floor: why Λ ≥ 0 (Rodgers–Tao, 2018)

   Recall from the last chapter what Λ is: the moment in flow time when the last zeros finish landing on the real axis — and t = 0 is the function as built. Saying Λ is negative would mean the landing finished before t = 0 — so the zeros we actually observe would not be fresh arrivals, but particles that had already spent time settled on the axis, jostling each other. That extra time matters, because zeros on the axis repel each other, and the longer they jostle, the more the irregularity irons out: crowded neighbors push apart, wide gaps close up, and the spacings drift toward uniformity — the way a traffic jam evens out once cars can spread along the road. Rodgers and Tao showed the real zeta zeros are too unevenly spaced for that: their gaps fluctuate more than any configuration that had already relaxed this way could still allow. So the landing cannot have finished early, and Λ ≥ 0. Note what the argument does and does not do: it locates no zero off the line; it only shows the observed spacings are incompatible with earlier relaxation.

1. The ceiling machine: Tao and Polymath 15's barrier method (2019)

   The upper bound must rule out zeros in the canopy — Polymath's name for the region at height $y_0$ and above at the final time $t_0$, stretching along the entire infinite axis. A theorem of de Bruijn says an empty canopy forces $\Lambda\le t_0+y_0^2/2$. Their method empties it in three zones. Left of a chosen abscissa X: the computer-verified stretch of RH keeps the region clean at t = 0, and a continuity analysis of each zero's velocity keeps it clean afterward — provided nothing crosses in from the right. Blocking that crossing is the barrier construction: a rectangle one unit wide at X, meshed along its boundary, where the effective approximation is evaluated at a ladder of time slices; certified bounds on how fast the values can move between mesh points and between slices, plus the argument principle (winding number 0), keep it zero-free at every intermediate time. Right of the barrier, the canopy is checked at the final time only, using the approximation $H_t\approx B_t f_t$ and Euler-product mollifiers. Polymath 15 ran this at $t_0=0.2$, $y_0=0.2$, $X=6\times10^{10}+83952-0.5$, with the barrier parked at the limit of Platt's 2011 verification, the fractional shift chosen to make the small-prime Euler product large at the barrier — and obtained Λ ≤ 0.22. Their bottleneck was the final-time check (ii).

1. Platt–Trudgian's lever (2020–21)

   The criterion consumes exactly one external computation, the verified height: the barrier must stand below it, and a barrier further out allows better $(t_0, y_0)$. Platt and Trudgian raised the rigorously verified height a hundredfold, to exactly 3,000,175,332,800, itself an interval-arithmetic computation. Feeding it to the same criterion gives Λ ≤ 0.2, noted in their own paper.

2. What I changed (2026)

   Same criterion, same verified height; the differences are in the parameters and in how the result is certified. I parked the barrier so the height it consumes, X/2, sits 175,239,886.5 below the exact Platt–Trudgian record (0.006% from the edge), re-optimized the row in exact rationals to the criterion's boundary, and built the heavier certification the thinner row demands: mollifiers up to the prime 11 where the floors are thinnest, the window-freeze, native-binding and Dini-transfer lemmas, an all-N tail theorem in place of sampling, and a 883-prism barrier certificate that includes t = 0 exactly. That takes 0.2 to 0.1787854, about $2\times10^{-7}$ below the most this criterion can give at this height. The rest of this post is the detail.

In numbers, my row is $X=6{,}000{,}000{,}185{,}827$, $t_0=\tfrac{129}{800}$, and $y_0^2=\tfrac{87677}{2500000}$, supported by roughly 3.15 million interval-arithmetic certificates and an audit trail built so a reviewer can rebuild every piece from source. The next chapter turns the flow's machinery into three finite checks, taken one at a time.

Pick three numbers: a barrier location $X$, a final time $t_0$, and a landing height $y_0$. Polymath 15's Theorem 1.2 says: if the three hypotheses below hold, then $\Lambda\le t_0+y_0^2/2$. (A theorem's hypotheses are its if-part: supply them, and the conclusion is yours. They are the three “checks” of the chapter titles ahead.) The colors below match the map and the chapter headings that follow: slate for (i), brass for (ii), vermillion for (iii). I chose the exact row

$$\begin{aligned}X&=6000000185827,\\[2pt] t_0&=\frac{129}{800}=0.16125,\qquad y_0^2=\frac{87677}{2500000}=0.0350708,\end{aligned}$$

chosen so that $t_0+\tfrac{y_0^2}{2}=\tfrac{893927}{5000000}=0.1787854$ exactly — every parameter is a rational number, and the final arithmetic is exact, not floating-point.

Analogy. A quarantine protocol. You want to certify a city district is virus-free at time t₀ without inspecting the whole world. So: (i) at time zero, door-to-door inspect everything inside the district — that's the brute-force RH verification up to height X/2. (iii) Close the border for the entire duration — a wall one unit thick, checked zero-free at every moment: nothing sneaks in from outside while the flow runs. (ii) At the final time, scan the region just beyond the wall to confirm nothing is pressed up against it. Continuity of zero trajectories is the epidemiology: infection can't teleport. Conclusion: at time t₀, nothing in the protected zone flies above y₀ — so everything lands by t₀ + y₀²/2.

Why these three numbers and not others? Try it yourself — the bound, the criterion's validity condition, and the feasibility of actually certifying a row all move as you drag:

Try it — pick your own row (t₀, y₀²) and see what bound it would buy

final time t₀ = 0.16125landing height² y₀² = 0.03507

bound Λ ≤ t₀ + y₀²/2 = 0.1787854canopy y₀² + 2t₀ = 0.3576 < 1 ✓

provable — and essentially at the wall (this is the proof's territory)

the proof's row: t₀ = 0.16125, y₀² = 0.0350708 → 0.1787854

The first hypothesis is the one part I didn't prove myself but licensed from the literature: Platt and Trudgian's record verification (2020) that every nontrivial zeta zero up to height

$$T_{\rm PT}=3{,}000{,}175{,}332{,}800$$

lies exactly on the critical line. The criterion at our row consumes height $X/2=3{,}000{,}000{,}092{,}913.5$, which sits inside the verified range with an exact margin of $175{,}239{,}886.5$. The zero-height endpoint $T=0$ is closed classically: on the real segment $0<\sigma<1$ a two-line alternating-series argument shows $\zeta(\sigma)<0$ (strictly negative, so no zero hides at the bottom), and at $s=1$ zeta has a pole, not a zero. Nothing conjectural enters: RH is used only as a finite, machine-verified fact up to a specific height, plus the functional equation to map $H_0$-zeros to zeta zeros by the exact change of variables $x=2T$.

A detail the audit surfaced: the margin lives entirely inside Platt–Trudgian's precise Theorem-1 height 3,000,175,332,800. With the rounded “3×10¹²” of their abstract, hypothesis (i) would fail by 92,913.5. The height the barrier consumes, X/2, sits less than one part in 10⁴ below the exact record; it is the single thinnest external dependency in the whole chain, and it is cited to the digit.

Analogy. The verified height is a foundation poured by others — a twelve-trillion-zero computation, published and checkable — that this proof builds on rather than repeats. The house goes up at the property line: a margin of 175 million against a depth of three trillion puts the fence 0.006% from the edge. Chapter 11 explains why building there is the right choice: at this height, that is where the value lies.

Check (i) secured.

Hypothesis (ii) demands that at the final time $t_0$, the function $H_{t_0}$ has no zeros to the right of the barrier in the band $y_0\le y\le\sqrt{1-2t_0}$, an infinite region. Polymath 15's Theorem 1.3 makes this tractable: it supplies an explicit approximation

where $B_t$ is an explicit nonvanishing factor, together with hard error bounds whose certified total we call $E_{\max}$. So it suffices to prove $|f_{t_0}|>E_{\max}$ everywhere: if the computable sum always beats the worst possible approximation error, the true function cannot vanish — a strict inequality between computable quantities. The region is cut into natural “Riemann–Siegel windows” $W_N=[x_N,x_{N+1})$ with $x_N=4\pi(N^2-t_0/16)$, indexed by the length N of the finite sum — the natural coordinate system of the Riemann–Siegel approximation. The scan runs from the window containing the barrier, $N=690{,}988$, to the tail cutoff $N=3{,}840{,}000$: one certified row per window, 3,149,013 rows — each a strict interval-arithmetic inequality — with no gaps, duplicates, or uncertain records.

Most of this proof consists of certificates, so the word needs a precise meaning. A certificate is not an approximate computation. It is a guaranteed enclosure: an interval the true value provably cannot escape, which narrows with more work. A claim is proved only when the whole interval lands on the required side. Try it yourself:

Try it — certify a fact about π the way this proof certifies 3,149,896 facts

interval width 4.27e-2UNDECIDED — the interval still straddles the claim, so the checker will not rule in either direction; add effort to shrink it

this toy uses Machin's series for π with guaranteed truncation directions; the proof's certificates play the same game with exact rationals at 256-bit precision. Note the third claim: it is false by 2.7 millionths, and no amount of effort ever certifies it — the interval just lands on the wrong side. A fail-closed checker has three possible outcomes: proved, disproved, or no answer.

Three ideas make the scan rigorous rather than merely numerical:

1. Freeze conservatively, prove monotonicity

   Within each window, the certificate evaluates the bound at the window's left edge and proves — by elementary monotonicity in x, including through the kink of a positive-part term — that this frozen value is conservative across the whole window (the Window Freeze theorem). Exact rational Machin brackets for π and exact square-root brackets pin the very first window: $x_{690988}<X+\sqrt{1-y_0^2}<x_{690989}$ with millions to spare on both sides.

2. Mollify with small primes

   Raw $|f_t|$ can dip close to zero. Multiplying by a short Euler product $E$ (four families of auxiliary primes:{2,3,5,7,11} near the barrier, stepping down through {2,3,5,7} and {2,3,5} to {2,3} far out) flattens the dips — a damping factor of this kind is called a mollifier, from the Latin for “to soften”. The native binding lemma proves by exact Dirichlet convolution that the stored floors bound the paper's normalized $|f_t|$ directly — the certified numbers are in the right units, with no extra conversion factor left to trust.

3. Certify one height, transfer to all heights

   Each row certifies a floor at one height; a separate Dini-derivative theorem proves the relevant mass is monotone in y — with the scan's thinnest certified ratio, $0.99999860767275095<1$, so the floor transfers to the entire band $y_0\le y\le\sqrt{1-2t_0}$. The margin is thin, but it is a proven strict inequality, checked at two precisions that agree to 17 digits.

The payoff: the binding floor across all 3,149,013 rows is $|f_{t_0}|\ge 7.91366\times10^{-7}$, against a certified total error $E_{\max}\le 2.33495\times10^{-7}$: nonvanishing with a 3.4× cushion.

Analogy. Mowing an infinite lawn to prove there are no snakes in the first three million meters: you don't photograph every blade. You cut the lawn into mower widths (windows), prove the grass in each strip is never taller than at its left edge (freeze), wear polarized glasses that make snakes stand out against grass (the mollifier), and prove that if a strip is clear at eye level it's clear at every level (Dini transfer). What remains — the lawn past three million — needs a different tool.

Past the cutoff $N_*=3{,}840{,}000$ no finite list of certificates can help — there are infinitely many windows left. This infinite remainder is called the tail, and the tail lemma handles all of it at once. Its engine is a contraction: the mollified sum is written as its leading term 1 plus a correction mass $D$, and every ingredient of D is bounded by quantities that decrease as N grows. A capping lemma — each ingredient is bounded by its value at the cutoff, which is its worst case — plus exact finite Dirichlet convolution reduce all $N\ge N_*$ to one interval computation at the cutoff itself:

after subtracting all error terms — uniformly for every window past the cutoff, every height in the band (in fact an extended band), and a full closed box of times around $t_0$ — with no sampling in N and no assumed monotonicity in t. The computation is a single standalone FLINT/Arb program, run at 256-bit and 512-bit precision (agreeing), with a separate Python interval implementation as corroboration.

The certified 0.999721 overstates how close D is to 1: it includes a provably redundant padding term. Removing it (the audit checked this) gives a true contraction around 0.96, so the tail has real headroom: about four orders of magnitude above the interval widths. And the two proof lanes overlap on the complete window N = 3,840,000: the finite scan proves it, the tail proves it again, and no seam between them is left to trust.

Analogy. Proving every domino past the three-millionth falls without touching any of them: show the push each domino receives always exceeds its resistance by a fixed factor, and show that factor only improves down the line. Then checking the single worst domino — the one at the cutoff — settles infinitely many at a stroke.

Checks (i) and (ii) secured: the final time is clean everywhere right of the barrier.

The barrier is where the proof must control every intermediate time, not just the endpoints: no zero of $H_t$ may enter the closed box

$$R=[X,\,X+1]\;+\;i\,[0.1809,\ 1],\qquad 0\le t\le t_0=\tfrac{129}{800}$$

which strictly contains the curved wall Theorem 1.2 actually requires (the floor clearance is exact: $y_0^2-0.1809^2=\tfrac{234599}{10^8}>0$). The tool is the argument principle, the classical way to count zeros inside a region: walk the boundary of R, watch the function's value wind around the origin; winding number zero means no zeros inside. The certificate makes this rigorous under the flow by slicing time into 883 consecutive closed prisms and, on each prism, gating a strict interval inequality:

In words: the boundary values stay so far from zero that neither the gaps between mesh points, nor the motion of the function during the prism's time slice, nor the approximation error of using $f_t$ for $H_t/B_t$, could possibly let a zero slip through. The certified total approximation error, $3.565\times10^{-4}$, fits the 0.00125 allowance 3.5 times over; the worst prism margin is 0.5198.

Try it — the argument principle as a zero detector

min |f| on the boundary 0.47winding number 0verdict origin avoided — no zeros inside; this prism passes

the real certificate proves min |f| ≥ 0.5198 on every one of the 883 prisms — the loop never gets close

The corners were the risky parts, so I gave each one its own lemma. The $t=0$ endpoint is included exactly — the first prism's seam is required to be literally zero, where the boundary modulus is 4.278, and the derivative majorants provably do not blow up as $t\to0$. The derivative box lemma proves the uniform bounds $D_z,D_t$ on whole prisms (never sampled at a single endpoint). The 7,688 stored Taylor-series coefficient components were independently regenerated — all contained in their stored balls — and the truncated Taylor tail is bounded by $1.96\times10^{-22}$, carried explicitly through every value. Every gate is fail-closed: an interval that straddles it counts as failure.

Analogy. Guarding a gate for a fixed shift, with a camera that takes one frame per prism. A frame alone proves nothing — an intruder could cross between frames. So for each frame the guard also proves a speed limit (the derivative bounds): nothing can move far enough between this frame and the next to reach the gate. 883 frames, each with its certified speed limit, and the shift is covered — from the exact first second to the exact last.

All three checks secured: Theorem 1.2's hypotheses are met.

By design, nothing new happens in the final step. A fail-closed assembly checker confirms that hypothesis (i) is licensed by the cited Platt–Trudgian height (with its exact margin of 175,239,886.5), that the finite lane and the tail jointly cover hypothesis (ii) with an overlapped seam, that the 883-prism certificate covers hypothesis (iii) down to exactly $t=0$ and up to an endpoint enclosing $129/800$, and then performs the one line of mathematics left, in exact rational arithmetic:

A proof with this much computation is only as good as its audit trail, so I engineered the trail as carefully as the mathematics. Four layers, in escalating order of independence:

1. Checksums and fail-closed checkers

   Every artifact — certificates, logs, sources, references — is pinned by SHA-256 and re-attested by verify.sh. The parsers are fail-closed: 54 strict checks on the barrier alone; any gap, duplicate, overlap, or indeterminate interval anywhere is a hard failure.

2. Cross-implementation and cross-toolchain replays

   Every interval computation the bound rests on — the finite scan's error budget, the tail contraction, and the 883-prism barrier — is certified by FLINT/Arb ball arithmetic, with Python interval code as cross-checks. The finite error budget and the margin above it are certified by a standalone C program run at 256-bit and 512-bit precision inside the pinned container, gated as prerequisite P17 of the 40-gate fail-closed assembly (the original Python interval computation is retained as same-answer corroboration); the tail agrees across 256 and 512 bits plus a separate Python implementation; and the barrier replays end-to-end on two different OS/compiler/library stacks (Linux/FLINT 3.0.1 and macOS/FLINT 3.6.0), emitting identical verdicts on all 883 prisms.

3. An adversarial review, then a full recompute

   I then set a four-agent adversarial AI review panel loose on each proof leg separately (July 2026), with instructions to break it. Verdict: no fatal or bound-invalidating defect; it surfaced — and fixed — one real gap (the thinnest inequality, the Dini transfer, wasn't wired into the assembly gate) and flagged the precise-height citation subtlety of Chapter 5. Every heavy computation was then rebuilt fresh from source: all 7,688 coefficients, all 883 prisms, all 3,149,013 finite rows regenerated and matched line-for-line.

4. Independent human review: Dan Romik

   Dan Romik (author of the standard modern exposition of the ξ function's orthogonal-polynomial theory) reviewed my proof independently: he worked through the full package, verified the cited literature against the arXiv sources, re-proved every analytic lemma, and rewrote the mathematics as two journal-grade manuscripts — an expository account and a research paper — with the computer-assisted components isolated as seven standalone, self-contained verification programs.

Analogy. The trust model is an aircraft's: redundant independent systems (two toolchains, two implementations, two precisions), black-box recorders (hash-pinned logs), a hostile test pilot (the adversarial panel), and finally certification by an outside inspector who takes the engine apart himself (the independent reviewer). No single layer is asked to be infallible; the design is that they cannot all fail the same way.