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

# Λ ≤ 0.1787854 — a new bound for the de Bruijn–Newman constant Source: [https://www.judegomila.com/posts/riemann-lambda-0.1787854](https://www.judegomila.com/posts/riemann-lambda-0.1787854) A complete walkthrough of the proof ## A new ceiling for*Λ*: the de Bruijn–Newman constant is at most*0\.1787854* I'm Jude Gomila and I've been exploring the zeta function in private since 2025\. This post is part of a series of posts on discoveries obtained from human/ai collaboration\. This post is about the de Bruijn–Newman constant Λ — a single real number with this property: the Riemann hypothesis holds exactly when Λ ≤ 0\. Nobody can prove that yet, but its known ceiling can be lowered, and this is my computer\-assisted proof taking it from 0\.2 to 0\.1787854, unconditionally, with no unproved conjecture anywhere in the chain\. I'll walk you through the whole proof, step by step\. Every claim links back to my[audit repository](https://github.com/judegomila/dbn-lambda-01787854-candidate-audit)and the independent review record\. Feedback, bugs and upgrade comments are welcome as[GitHub issues](https://github.com/judegomila/dbn-lambda-01787854-candidate-audit/issues)\. Previous bound**Λ ≤ 0\.2**This result**Λ ≤ 0\.1787854**Method**Polymath 15 criterion \+ interval certificates**Special thanks**[Dan Romik](https://en.wikipedia.org/wiki/Dan_Romik),[Max Atkin](https://uni-bielefeld.academia.edu/MaxAtkin)** Λ ≤ 0\.1787854 = 129/800 \+ 87677/5,000,000: an exact rational, obtained by exact arithmetic from 3,149,013 \+ 883 \+ 1 machine\-checked interval certificates\. ruled out · Rodgers–Tao, 2018½ · de Bruijn, 19500\.22 · Polymath 15 \(Tao et al\.\), 20190\.2 · via Platt–Trudgian, 2021earlier ceilings ↓Λ lives here0 ⟺ the Riemann hypothesis0\.1787854 · this work**Animation**The proof in 2 minutes 35 seconds — from ζ\(s\) to Riemann’s ξ\(s\), the H₀ normalization, the de Bruijn heat flow, and the three checks that pin Λ ≤ 0\.1787854\. Also at[/assets/zetasota](https://www.judegomila.com/assets/zetasota/index.html)\. 1. [00Why the Riemann hypothesis matters](https://www.judegomila.com/posts/riemann-lambda-0.1787854#rh) 2. [01Λ, the constant whose value decides the Riemann hypothesis](https://www.judegomila.com/posts/riemann-lambda-0.1787854#lambda) 3. [02Heating the function pulls its zeros onto the real axis](https://www.judegomila.com/posts/riemann-lambda-0.1787854#heatflow) 4. [03The bounds on Λ, and how the methods work](https://www.judegomila.com/posts/riemann-lambda-0.1787854#history) 5. [04Three finite checks that prove an upper bound on Λ](https://www.judegomila.com/posts/riemann-lambda-0.1787854#criterion) 6. [05Check one: RH is already machine\-verified below the barrier](https://www.judegomila.com/posts/riemann-lambda-0.1787854#height) 7. [06Check two: 3\.1 million windows certified zero\-free](https://www.judegomila.com/posts/riemann-lambda-0.1787854#windows) 8. [07Check two, continued: one lemma covers the rest to infinity](https://www.judegomila.com/posts/riemann-lambda-0.1787854#tail) 9. [08Check three: a wall no zero can cross](https://www.judegomila.com/posts/riemann-lambda-0.1787854#barrier) 10. [09Combining the checks gives Λ ≤ 0\.1787854](https://www.judegomila.com/posts/riemann-lambda-0.1787854#assembly) 11. [10How the proof was checked, four layers deep](https://www.judegomila.com/posts/riemann-lambda-0.1787854#audit) 12. [11Why this method cannot reach Λ ≤ 0](https://www.judegomila.com/posts/riemann-lambda-0.1787854#limits) 13. [12Provenance & links](https://www.judegomila.com/posts/riemann-lambda-0.1787854#provenance) Prologue ## Why the Riemann hypothesis matters The primes 2, 3, 5, 7, 11, 13, … are the atoms of arithmetic: every whole number factors into primes in exactly one way, so facts about primes become facts about all numbers\. Individually they are irregular — no known rule produces the next prime from the ones before it\. Counted in bulk, they obey a law: the number of primes up to x stays close to a single smooth curve \(the prime number theorem, proved in 1896\)\. The open question is the size of the error — how far the true count can stray from the curve\. That error term is what the Riemann hypothesis governs, and it is why RH matters: sharpen the error term and you sharpen hundreds of results in number theory that depend on it\. 0204050100150200250each vermillion tick: a primethe smooth prediction Li\(x\)π\(x\): how many primes ≤ x **Fig\. 1**The prime\-counting staircase π\(x\) \(the dark stepped line\) climbs one step at each prime\. The dashed blue curve is the smooth prediction Li\(x\)\. The gap between them is a sum of waves, one wave per zeta zero, and the Riemann hypothesis says every wave has the smallest possible amplitude\.In 1859[Bernhard Riemann](https://en.wikipedia.org/wiki/Bernhard_Riemann)explained where that hidden order comes from\. He took Euler's identity, which connects the primes to a single function of onecomplex variable, ζ\(s\)=∑n≥11ns=∏pprime\(1−p−s\)−1\\htmlData\{term=zeta, tc=v\}\{\\zeta\(s\)\}\\;=\\;\\htmlData\{term=sum, tc=s\}\{\\sum\_\{n\\ge1\}\\frac\{1\}\{n^\{s\}\}\}\\;=\\;\\htmlData\{term=prod, tc=b\}\{\\prod\_\{p\\ \\mathrm\{prime\}\}\\left\(1\-p^\{\-s\}\\right\)^\{\-1\}\} hover or tap a colored term for what it does extended it to the whole complex plane, and discovered that the wobble of the prime count around its smooth curve is governed —*exactly*, via anexplicit 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 04080120x =20x =60x =100the primes: ψ\(x\), one step per prime powerRiemann's formula with0zero\-waveszero\-waves included**0/ 30**no 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\. Chapter 1 ## Λ, the constant whose value decides the Riemann hypothesis A single real number whose sign settles the question: the Riemann hypothesis holds exactly when Λ ≤ 0\. Start withRiemann's xi function, a repackaging of the zeta function:ξ\(s\)=12s\(s−1\)π−s/2Γ\(s/2\)ζ\(s\)\\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 lineRes=12\\mathrm\{Re\}\\,s=\\tfrac12\. Rotate coordinates so that line becomes the real axis \(this proof uses the Polymath 15 normalizationH0\(z\)=18ξ⁣\(12\+iz2\)H\_0\(z\)=\\tfrac18\\,\\xi\\\!\\left\(\\tfrac12\+\\tfrac\{iz\}\{2\}\\right\)\) and RH becomes a single sentence: RH, restated Every zero of theentire functionH0H\_0is a**real number**\. In 1950 de Bruijn had the idea of*deforming*this function with a one\-parameter flow — mathematically, running the heat equation on it: Ht\(z\)=∫0∞etu2Φ\(u\)cos⁡\(zu\)du\\htmlData\{term=ht, tc=v\}\{H\_t\(z\)\}\\;=\\;\\int\_0^\\infty \\htmlData\{term=heat, tc=s\}\{e^\{tu^2\}\}\\,\\htmlData\{term=phi, tc=b\}\{\\Phi\(u\)\}\\,\\htmlData\{term=cos, tc=b\}\{\\cos\(zu\)\}\\,du whereΦ\\Phiis the fixed super\-exponentially decaying kernel withH0=18ξ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: Λ=inf⁡\{t:Hthas only real zeros\}\\Lambda\\;=\\;\\htmlData\{term=inf, tc=v\}\{\\inf\}\\\{\\,t:\\ \\htmlData\{term=real, tc=s\}\{H\_t\\ \\text\{has only real zeros\}\}\\,\\\} 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: RH⟺Λ≤0\\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\. \-0\.200\.20\.40\.6Rodgers–Tao 2018Λ ≥ 0: “RH, if true, is only barely so”Λ lives hereRH ⟺ Λ = 00\.1787854 **Fig\. 2**The state of knowledge about Λ\. The Riemann hypothesis is equivalent to Λ ≤ 0; the equivalence is itself a theorem\. Rodgers–Tao \(2018\) proved Λ ≥ 0, so RH, if true, is true with nothing to spare\. This work moves the other wall: Λ is now known to be at most 0\.1787854\. The truth lives somewhere in the vermillion interval, and RH says it lives at its left endpoint\.One direction is now settled\. Newman conjectured Λ ≥ 0, famously adding that if RH is true, it is*“only barely so”*— and Rodgers and Tao proved this in 2018\. So Λ is confined:0≤Λ0\\le\\Lambda, and progress can now come only from the upper side\. This proof moves the ceiling toΛ≤0\.1787854\\Lambda\\le 0\.1787854\. With the floor at 0, this removes just over 10% of the interval that remained\. Chapter 2 ## Heating the function pulls its zeros onto the real axis Complex zero pairs sink toward the real axis at a computable rate; the proof is a schedule for when the last of them arrives\. Under the flow, the zeros ofHtH\_tmove like interacting particles: real zeros repel each other along the axis, and eachcomplex\-conjugate pairgets pulled toward the axis\. For an isolated pair at height y \(that is, atz=x±iyz=x\\pm iy\), the dynamics are governed, up to smaller corrections, by dydt≈−1y⟹d\(y2\)dt≈−2\\htmlData\{term=dydt, tc=s\}\{\\frac\{dy\}\{dt\}\}\\;\\approx\\;\\htmlData\{term=pull, tc=b\}\{\-\\frac\{1\}\{y\}\}\\qquad\\Longrightarrow\\qquad \\htmlData\{term=dy2, tc=v\}\{\\frac\{d\(y^2\)\}\{dt\}\\;\\approx\\;\-2\} so the*squared*height falls at a constant rate 2, and a pair starting at height y touches down at time abouty2/2y^2/2\. The final bound has the same form: it will bet0\+y02/2t\_0\+y\_0^2/2: “run the flow to timet0t\_0, show nothing flies higher thany0y\_0, then waity02/2y\_0^2/2longer 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 real axis — where RH wants every zerolands at t = 0\.1922lands at t = 0\.1250lands at t = 0\.0722lands at t = 0\.0365lands at t = 0\.0175height y₀ = 0\.1873time t**0\.0000**still complex**5pairs**rule**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\. Chapter 3 ## The bounds on Λ, and how the methods work From de Bruijn's 1/2 to Polymath's 0\.22 to 0\.1787854\. De Bruijn provedΛ≤12\\Lambda\\le\\tfrac12in 1950\. Fifty\-nine years later, Ki, Kim and Lee improved it to the strict inequalityΛ<12\\Lambda<\\tfrac12\. The current method dates from 2018–2019, when Terence Tao'sPolymath 15project built an*effective*theory of the heat flow: explicit, computable approximations toHtH\_twith rigorous error bounds, and a criterion \(their Theorem 1\.2\) that converts three finite, checkable statements into an upper bound on Λ\. Polymath 15 instantiated it to get Λ ≤ 0\.22; plugging in Platt–Trudgian's 2020 record\-height RH verification pushed the same machinery to 0\.2\. 0\.00\.10\.20\.30\.40\.51950197620092026Λ = 0: the Riemann hypothesisNewman conjectures Λ ≥ 0Rodgers–Tao prove itde Bruijn·Λ ≤ 1/2Ki–Kim–Lee·Λ < 1/2Polymath 15·Λ ≤ 0\.22via Platt–Trudgian height·Λ ≤ 0\.2this work·Λ ≤ 0\.1787854 **Fig\. 3**Seventy\-six years of squeezing from above\. De Bruijn's 1/2 stood for six decades before Ki, Kim and Lee made it strict; Polymath 15's 2019 breakthrough — the criterion this proof instantiates — brought it to 0\.22, and Platt–Trudgian's record RH verification pushed the same criterion to 0\.2\. Below the axis of battle: Newman conjectured Λ ≥ 0 in 1976 and Rodgers–Tao proved it in 2018, so the interval can never close from this side past zero\.**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**: sinceHtH\_ttakes real values on the real axis, every off\-axis zero atx\+iyx\+iyhas a mirror twin atx−iyx\-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\. iyreal axis — Htis real here; zeros land hereupper half\-plane — the whole proof happens hereRH: this region holds no zeros at t = 0lower half\-plane — a perfect reflection, nothing new to trackzero at x \+ iymirror twin at x − iyxheight y — how far it still has to fall **Fig\. 4**Httakes real values on the real axis, so its complex zeros come in conjugate pairs: x \+ iy above the axis, x − iy below\. The lower half\-plane is a perfect reflection — nothing happens there that the upper half doesn’t already show — so the whole proof watches one region: position x along the axis, height y above it\. The Riemann hypothesis is the statement that the tinted 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\. if Λ were negative — gaps ironed toward uniform by the extra time on the axisthe actual zeta zeros — clusters and wide gaps survive↑ crowded↑ wide gaptoo uneven to have relaxed ⇒ the landing didn't finish early ⇒ Λ ≥ 0 **Fig\. 5**The floor argument compares two worlds\. If the landing had finished before time 0 \(Λ < 0\), the zeros would have spent extra time repelling each other on the axis, ironing their gaps toward uniformity \(top\)\. The zeros we actually observe keep clusters and wide gaps \(bottom\) — too uneven to have relaxed\. So the landing cannot have finished early, and Λ ≥ 0\.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 heighty0y\_0and above at the final timet0t\_0, stretching along the entire infinite axis\. A theorem of de Bruijn says an empty canopy forcesΛ≤t0\+y02/2\\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 approximationHt≈BtftH\_t\\approx B\_t f\_tand Euler\-product mollifiers\. Polymath 15 ran this att0=0\.2t\_0=0\.2,y0=0\.2y\_0=0\.2,X=6×1010\+83952−0\.5X=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\)\. the canopy — height y₀ and above, along the whole axisempty at the final time t₀ ⇒ Λ ≤ t₀ \+ y₀²/2y₀real axisleft of XRH machine\-verified at t = 0;velocity bounds keep it cleanwhile the flow runsthe barrierXone unit wide, meshed; zero\-free atevery time slice \(winding number 0\)nothing crosses inright of Xchecked at the final time t₀ only:Hₜ ≈ Bₜ·fₜ with Euler\-product mollifiers **Fig\. 6**The ceiling machine\. The*canopy*is everything at height y₀ and above at the final time — if it is empty, de Bruijn’s theorem forces Λ ≤ t₀ \+ y₀²/2\. It is emptied in three zones: left of X the machine\-verified stretch of RH keeps it clean \(velocity bounds keep zeros from wandering up\); the barrier at X is a wall checked zero\-free at*every*intermediate time, so nothing crosses in from the right; and right of the barrier the canopy is checked at the final time only\.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\(t0,y0\)\(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](https://arxiv.org/abs/2004.09765)\. 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, about2×10−72\\times10^\{\-7\}below the most this criterion can give at this height\. The rest of this post is the detail\. In numbers, my row isX=6,000,000,185,827X=6\{,\}000\{,\}000\{,\}185\{,\}827,t0=129800t\_0=\\tfrac\{129\}\{800\}, andy02=876772500000y\_0^2=\\tfrac\{87677\}\{2500000\}, supported by roughly 3\.15 millioninterval\-arithmetic certificatesand 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\. **What’s new in this work\.**The crane is Polymath 15’s and the verified height is Platt–Trudgian’s; here is exactly what this proof adds on top of them: - A new exact parameter row — t₀ = 129/800, y₀² = 87677/2,500,000 — chosen at the edge of what the criterion admits at today’s verified height \(Chapter 11 maps that edge\)\. - Three small theorems that turn a 3\.1\-million\-window scan from numerics into proof: one evaluation per window, proved conservative across the whole window \(the Window Freeze theorem\); certified floors that bound the paper’s own quantity exactly, with no conversion factor left to trust \(the native binding lemma\); and one certified height carried to every height in the band \(the Dini transfer\) — Chapter 6\. - A contraction argument covering the infinite remainder — every window past the cutoff — in a single certified computation \(Chapter 7\)\. - A barrier rebuilt at the modern verified height: 883 closed prisms, each held zero\-free through time by winding\-number certificates \(Chapter 8\)\. - An audit trail built like flight certification: a hash\-pinned repository, fail\-closed checkers, replays on two toolchains at two precisions, an adversarial AI review panel, a full from\-source recompute, and an independent human review \(Chapter 10\)\. Chapter 4 ## Three finite checks that prove an upper bound on Λ Theorem 1\.2 of Polymath 15, instantiated at one exact row of parameters\. Pick three numbers: a barrier locationXX, a final timet0t\_0, and a landing heighty0y\_0\. Polymath 15's Theorem 1\.2 says: if the three hypotheses below hold, thenΛ≤t0\+y02/2\\Lambda\\le t\_0\+y\_0^2/2\. \(A theorem'shypothesesare 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 X=6000000185827,t0=129800=0\.16125,y02=876772500000=0\.0350708,\\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 thatt0\+y022=8939275000000=0\.1787854t\_0\+\\tfrac\{y\_0^2\}\{2\}=\\tfrac\{893927\}\{5000000\}=0\.1787854exactly — every parameter is a rational number, and the final arithmetic is exact, not floating\-point\. The three hypotheses \(Polymath 15, Theorem 1\.2\) **\(i\) Verified height\.**No zeta zerosζ\(σ\+iT\)=0\\zeta\(\\sigma\+iT\)=0with1\+y02≤σ≤1\\tfrac\{1\+y\_0\}\{2\}\\le\\sigma\\le1and0≤T≤X/20\\le T\\le X/2\. **\(ii\) Final\-time clearance\.**No zeros ofHt0\(x\+iy\)H\_\{t\_0\}\(x\+iy\)withx≥X\+1−y02x\\ge X\+\\sqrt\{1\-y\_0^2\}andy0≤y≤1−2t0y\_0\\le y\\le\\sqrt\{1\-2t\_0\}\. **\(iii\) The barrier\.**No zeros ofHt\(x\+iy\)H\_t\(x\+iy\)in a thin curved wall overX≤x≤X\+1−y02X\\le x\\le X\+\\sqrt\{1\-y\_0^2\}, for*every*intermediate time0≤t≤t00\\le t\\le t\_0\. y = 1y = √\(1−2t₀\) ≈ 0\.823y = y₀ ≈ 0\.1873real axis\(i\) VERIFIED HEIGHTno zeros at t = 0: RH machine\-checkedup to zeta height X/2 ≈ 3\.0×10¹²\(iii\) THE BARRIER\[X, X\+1\] × \[0\.1809, 1\]: zero\-free for ALL 0 ≤ t ≤ t₀x = Xx = X\+1\(ii\) FINAL\-TIME SCANno zeros at the final time t₀3,149,013 window certificates \+ one tail lemmax = X \+ √\(1−y₀²\) — inside the walltogether: Λ ≤ t₀ \+ y₀²/2 = 0\.1787854 **Fig\. 7**The Polymath 15 criterion as a quarantine map \(schematic — the barrier is 1 unit wide at x ≈ 6×10¹²\)\. Hypothesis \(i\) clears everything left of the wall at time zero, using the finite RH verification\. Hypothesis \(iii\) makes the wall itself zero\-free at*every*time 0 ≤ t ≤ t₀\. Hypothesis \(ii\) clears the right half\-line at the final time t₀, starting at x = X \+ √\(1−y₀²\) — a landmark just*inside*the wall \(since √\(1−y₀²\) ≈ 0\.982 < 1\), so regions \(ii\) and \(iii\) overlap and leave no gap\. Zeros move continuously — so nothing can be above height y₀ at time t₀, and the last stragglers land within y₀²/2 more\.**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\.1787854**canopy 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 three hypotheses are supplied by three completely different technologies — a cited world\-record computation, a 3\.15\-million\-row certified scan with a tail theorem, and an argument\-principle certificate\. The next four chapters take them in order\. Chapter 5 ## Check one: RH is already machine\-verified below the barrier Platt and Trudgian's verification covers the height the criterion needs, with margin 175,239,886\.5\. 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 TPT=3,000,175,332,800T\_\{\\rm PT\}=3\{,\}000\{,\}175\{,\}332\{,\}800 lies exactly on the critical line\. The criterion at our row consumes heightX/2=3,000,000,092,913\.5X/2=3\{,\}000\{,\}000\{,\}092\{,\}913\.5, which sits inside the verified range with an exact margin of175,239,886\.5175\{,\}239\{,\}886\.5\. The zero\-height endpointT=0T=0is closed classically: on the real segment0<σ<10<\\sigma<1a two\-line alternating\-series argument showsζ\(σ\)<0\\zeta\(\\sigma\)<0\(strictly negative, so no zero hides at the bottom\), and ats=1s=1zeta 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 thefunctional equationto mapH0H\_0\-zeros to zeta zeros by the exact change of variablesx=2Tx=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\. Chapter 6 ## Check two: 3\.1 million windows certified zero\-free 3,149,013 certified inequalities, one for every window from the barrier to the tail\. Hypothesis \(ii\) demands that at the final timet0t\_0, the functionHt0H\_\{t\_0\}has no zeros to the right of the barrier in the bandy0≤y≤1−2t0y\_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 Ht≈Bt⋅ft,ft=a finite, computable Dirichlet\-type sumH\_t \\;\\approx\\; \\htmlData\{term=bt, tc=s\}\{B\_t\}\\cdot \\htmlData\{term=ft, tc=v\}\{f\_t\},\\qquad f\_t \\;=\\; \\text\{a finite, computable Dirichlet\-type sum\} whereBtB\_tis an explicit nonvanishing factor, together with hard error bounds whose certified total we callEmax⁡E\_\{\\max\}\. So it suffices to prove∣ft0∣\>Emax⁡\|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”WN=\[xN,xN\+1\)W\_N=\[x\_N,x\_\{N\+1\}\)withxN=4π\(N2−t0/16\)x\_N=4\\pi\(N^2\-t\_0/16\), indexed by the length N of the finite sum — the natural coordinate system of theRiemann–Siegel approximation\. The scan runs from the window containing the barrier,N=690,988N=690\{,\}988, to the tail cutoffN=3,840,000N=3\{,\}840\{,\}000: one certified row per window,**3,149,013 rows**— each a strictinterval\-arithmeticinequality — 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 everything π could be: \[3\.140596932,3\.183263696\]\(true π, which the method never needs to know\)claim:π < 3\.1416computation effort \(series terms\) =2 interval width**4\.27e\-2**UNDECIDED — 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\. 690,988819,0001,028,0003,840,0002·3·5·7·1138,012rows2·3·5·790,000rows2·3·5209,000rows2·32,812,001rowsFINITE LANE: 3,149,013 certified windows, no gaps, no duplicatesmollifier primes per leg · every row a strict interval inequalitybinding floor 7\.91×10−7\> error 2\.33×10−7\(the global worst case, at N = 690,988\)TAIL LEMMAall N ≥ 3,840,000 → ∞one theorem, one Arb run \(256 & 512\-bit\): D < 0\.999721lanes overlap on the complete window N = 3,840,000 **Fig\. 8**Hypothesis \(ii\), lane by lane \(the N\-axis is stretched for legibility\)\. Each window W\_N gets one certified interval\-arithmetic row proving \|f\| stays above a stored floor; richer Euler mollifiers \(more auxiliary primes\) are spent exactly where the problem is hardest, near the barrier\. The tail lemma is a single theorem covering every N ≥ 3,840,000 at once — and the two lanes overlap by construction on the full window N = 3,840,000, so no seam is left uncovered\.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 rationalMachin bracketsfor π and exact square\-root brackets pin the very first window:x690988<X\+1−y02<x690989x\_\{690988\}<X\+\\sqrt\{1\-y\_0^2\}<x\_\{690989\}with millions to spare on both sides\. 2. #### Mollify with small primes Raw∣ft∣\|f\_t\|can dip close to zero\. Multiplying by a short Euler productEE\(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 exactDirichlet convolutionthat the stored floors bound the paper's normalized∣ft∣\|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<10\.99999860767275095<1, so the floor transfers to the entire bandy0≤y≤1−2t0y\_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∣ft0∣≥7\.91366×10−7\|f\_\{t\_0\}\|\\ge 7\.91366\\times10^\{\-7\}, against a certified total errorEmax⁡≤2\.33495×10−7E\_\{\\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\. Chapter 7 ## Check two, continued: one lemma covers the rest to infinity One theorem, one contraction, and every window past three million folds into a single computation\. Past the cutoffN∗=3,840,000N\_\*=3\{,\}840\{,\}000no 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 massDD, 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 allN≥N∗N\\ge N\_\*to one interval computation at the cutoff itself: D<0\.999721<1⟹∣ft0∣≥1−DMmax⁡\>1\.734×10−4\\htmlData\{term=d, tc=s\}\{D\}\\;<\\;0\.999721\\;<\\;1\\qquad\\Longrightarrow\\qquad \|f\_\{t\_0\}\|\\;\\ge\\;\\htmlData\{term=flow, tc=v\}\{\\frac\{1\-D\}\{M\_\{\\max\}\}\}\\;\>\\;1\.734\\times10^\{\-4\} 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 aroundt0t\_0— with no sampling in N and no assumed monotonicity in t\. The computation is a single standaloneFLINT/Arbprogram, 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\. Chapter 8 ## Check three: a wall no zero can cross A wall one unit thick, held zero\-free at every instant by 883 interval certificates\. The barrier is where the proof must control*every intermediate time*, not just the endpoints: no zero ofHtH\_tmay enter the closed box R=\[X,X\+1\]\+i\[0\.1809,1\],0≤t≤t0=129800R=\[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:y02−0\.18092=234599108\>0y\_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 closedprisms**and, on each prism, gating a strict interval inequality: Mi⏟min boundary modulus\>Dz,i2\(num−1\)⏟mesh interpolation\+Dt,iΔti⏟motion in time\+0\.00125⏟approximation\\underbrace\{\\htmlData\{term=mi, tc=v\}\{M\_i\}\}\_\{\\text\{min boundary modulus\}\}\\;\>\\;\\underbrace\{\\htmlData\{term=mesh, tc=s\}\{\\tfrac\{D\_\{z,i\}\}\{2\(\\mathrm\{num\}\-1\)\}\}\}\_\{\\text\{mesh interpolation\}\}\\;\+\\;\\underbrace\{\\htmlData\{term=time, tc=b\}\{D\_\{t,i\}\\,\\Delta t\_i\}\}\_\{\\text\{motion in time\}\}\\;\+\\;\\underbrace\{\\htmlData\{term=approx, tc=b\}\{0\.00125\}\}\_\{\\text\{approximation\}\} 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 usingftf\_tforHt/BtH\_t/B\_t, could possibly let a zero slip through\. The certified total approximation error,3\.565×10−43\.565\\times10^\{\-4\}, fits the 0\.00125 allowance 3\.5 times over; the worst prism margin is 0\.5198\. 883 CLOSED TIME PRISMS\(42 drawn — thinner where the flow moves faster\)t = 0t = 129/800each prism: mesh floor \> spatial \+ time\-motion \+ 0\.00125inside one prism0margin ≥ 0\.5198boundary image loopwinding number 0 ⟹ no zeros inside **Fig\. 9**Hypothesis \(iii\), the barrier certificate\. Left: time is cut into 883 consecutive closed prisms from t = 0 \(included exactly — not as a limit\) to t₀ = 129/800, with byte\-identical seams\. Right: on each prism, the function's values around the boundary of the barrier rectangle trace a loop; the certificate proves the loop never comes near the origin \(minimum certified margin 0\.5198\) and winds zero times around it — by the argument principle, no zeros inside\. All 883 gates are strict interval inequalities: any overlap or indeterminacy is failure\.The function's values along the rectangle's boundary trace a closed loop in the complex plane, and a zero inside the rectangle forces that loop to wrap around the origin\. The certificate proves the loop stays far away: Try it — the argument principle as a zero detector 0: if f has a zero inside,the loop must lasso this pointthe values of f around the barrier's boundarymin \|f\| on the boundary**0\.47**winding number0verdict**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\. Thet=0t=0endpoint 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 ast→0t\\to0\. The*derivative box lemma*proves the uniform boundsDz,DtD\_z,D\_ton 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 by1\.96×10−221\.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\. Chapter 9 ## Combining the checks gives Λ ≤ 0\.1787854 Three checks, one exact rational, and margins that are proved inequalities\. 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 exactlyt=0t=0and up to an endpoint enclosing129/800129/800, and then performs the one line of mathematics left, in exact rational arithmetic: Λ≤t0\+y022=129800\+876775000000=8939275000000=0\.1787854\\Lambda\\;\\le\\;\\htmlData\{term=t0, tc=s\}\{t\_0\}\+\\htmlData\{term=y02, tc=b\}\{\\frac\{y\_0^2\}\{2\}\}\\;=\\;\\htmlData\{term=frac, tc=v\}\{\\frac\{129\}\{800\}\+\\frac\{87677\}\{5000000\}\}\\;=\\;\\boxed\{\\dfrac\{893927\}\{5000000\}\\;=\\;0\.1787854\} \(i\) VERIFIED HEIGHTPlatt–Trudgian, citedRH checked to 3,000,175,332,800margin 175,239,886\.5 · Ch\. 5\(ii\) FINAL\-TIME CLEARANCE3,149,013 window certificates\+ one tail lemma to ∞margins ≥ 3\.4× · Ch\. 6–7\(iii\) THE BARRIER883 closed time prismswinding number 0 in eachmargin ≥ 0\.5198 · Ch\. 8POLYMATH 15 · THEOREM 1\.2if \(i\) ∧ \(ii\) ∧ \(iii\) hold at \(X, t₀, y₀\), then Λ ≤ t₀ \+ y₀²/2Λ ≤ 129/800 \+ 87677/5,000,000 = 0\.1787854 **Fig\. 10**The whole proof on one page\. Three independently certified inputs — colored as throughout this post — feed Polymath 15's Theorem 1\.2, which converts them into the bound by exact rational arithmetic\. Remove any input and the theorem concludes nothing; all three held\.FINITE LANEfloor 7\.914×10−7error ≤ 2\.335×10−7margin 5\.58×10−7\(headroom 3\.4×\)INFINITE TAILfloor \(1−D\)/M ≥ 1\.735×10−4error ≤ 1\.17×10−8post\-error margin 1\.735×10−4\(headroom ~15,000×\)BARRIERallowance 1\.25×10−3error ≤ 3\.565×10−4headroom 3\.5× **Fig\. 11**The three decisive gates, drawn to per\-gate scale: the full bar is the largest error each leg could tolerate; the filled portion is the error the interval arithmetic actually certifies\. The tightest gate clears by a factor of 3\.4\. Every number shown is the rounded value of a directed interval inequality\.None of these margins is a floating\-point comparison\. Every gate is a*directed interval inequality*: outward\-rounded enclosures on both sides, strict comparison, overlap treated as failure\. The three cited inputs that code cannot prove \(the two Polymath theorems and Platt–Trudgian's verification\) are printed by the checker as**cited theorem inputs**and left ungated, marking the boundary between what the machine certifies and what the literature supplies\. The audit also confirmed there is no circularity: the three hypotheses are logically independent, and no certificate consumes a value derived from the bound it proves\. Chapter 10 ## How the proof was checked, four layers deep Checksums, independent replays, an adversarial review, and an independent human review\. 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](https://en.wikipedia.org/wiki/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\. The repository describes itself as a *computer\-assisted proof awaiting journal review*\. The adversarial pass found no defect in the bound and the independent review has produced the journal manuscripts; formal publication is the remaining step\. The chain is unconditional: it assumes neither the Riemann hypothesis, nor GUE, nor any other conjecture\. Chapter 11 ## Why this method cannot reach Λ ≤ 0 Each certificate lane has its own wall, set by mollifier design; later research in the repository reaches 5\.5×10⁻⁴ lower at the same verified height\. Reaching Λ ≤ 0 still requires new mathematics\. This bound will not be improved by re\-running the same machinery with more computing time: I chose the row at the edge of what this certificate lane admits — an early companion analysis placed the wall for these parameters about2×10−72\\times10^\{\-7\}below 0\.1787854\. Later research in the repository showed that wall belongs to the lane, not to the verified height: the mollifier is tuned tot0t\_0\(lowering the time while holding it fixed fails structurally, at any precision\), and a lower\-time lane at the*same*height reaches 0\.1782354 — 5\.5×10⁻⁴ lower, its arithmetic and archive machine\-checked though its mathematics is not yet independently reviewed\. Getting below that needs a mollifier retuned to the lower time, not a bigger dial\. 0\.1787840\.1787850\.1787860\.178787this lane's wall \(mollifier tuned to t₀\)no certificate in this lane gets past thiswithout retuning the mollifierthis work: 0\.1787854≈ 2×10−7← Λ = 0 \(RH\) is 0\.179 away: 60,000 chart\-widths to the left **Fig\. 12**A zoom of the number line near the new bound \(full width here: three millionths\)\. An early companion analysis placed the wall of what this lane's certificates can achieve about 0\.0000002 below the bound — the parameters sit at the edge of what this mollifier admits\. Later research showed the wall belongs to the lane, not the height: a lane retuned to a lower time reaches 0\.1782354 at the same verified height\. The long\-run lever is verified height, which pays only inverse\-logarithmically: reaching Λ ≤ 0 this way would require verification without end\.In the long run the binding lever is verified height — and it pays inverse\-logarithmically: the achievable bound shrinks roughly like 1/log\(height\)\. Concretely, halving the bound requires roughly*squaring*the verified height, from 3×10¹² to about 10²⁵ \(far beyond any conceivable computation\), and driving the bound all the way to 0 would require verifying RH to infinite height, which is just RH again\. Together the two bounds say the following about0≤Λ≤0\.17878540\\le\\Lambda\\le0\.1787854: Rodgers–Tao's floor says RH has no safety margin; the wall says brute force alone will never finish the job\. Closing the remaining interval will take new mathematical ideas, most likely alongside heavier computation — each idea still has to be instantiated and certified\. Working the bound downward is itself one way those ideas get found: every improvement forces a sharper structural understanding of how the zeros move under the flow, and of what the primes do and do not permit\. ## Provenance & links The proof, its parameters, certificates, and audit apparatus are my own work \(**Jude Gomila**, 2026\)\. The mathematics instantiates**Polymath 15**'s Theorems 1\.2 and 1\.3 \(D\.H\.J\. Polymath, led by Terence Tao\) at a new exact parameter row, and consumes**Platt–Trudgian**'s record RH verification as its only external computation\. The independent reviewer is[**Dan Romik**](https://en.wikipedia.org/wiki/Dan_Romik), who verified the analytic lemmas and reworked the material into journal\-grade manuscripts; an adversarial AI audit with full from\-source recomputation preceded his review\. The result is unconditional in logical form; journal publication is the remaining step\.