/teal-sea
teal-sea / zeta-labstate of record · compiled 02 Nov 2026 · revision b09fa4dd · source

Library · hunts/qrh_rival_step/RESULTS.md

RESULTS: where the quasi-Riemann argument spends its Euler product, and a rival that cannot pay

5,778 words · 514 lines · source

Hunt #120, 2026-10-08. Status: measured and read; nothing here is evidence about the truth of the paper's theorem. Grades used: cited (a page of the paper or a published theorem), measured (one float route), hardened (independent routes agree, or balls carry the step), ordinary argument (a derivation written here, unreviewed). A composite claim takes the grade of its weakest step.

The one-paragraph answer. The OpenAI argument never consumes the Euler product inside its continuation criterion (Proposition 2.1 of the 7/8 paper), which is an abstract statement about the reciprocal of a function with two Mellin estimates and survives, with trivial edits, for any function whose reciprocal is bounded on Re s >= 2. It consumes the Euler product where those two estimates are manufactured: in the 11/12 paper at the one display that writes 1/L_K^S(s, nu) as the Dirichlet series of mu(n) nu(n) (Section 3, page 12), which is what makes the object being bounded a twisted Moebius sum with coefficients of modulus at most one, supported on squarefree ideals and multiplicative apart from mu; and in the 7/8 paper at Lemma 7.1, the scalar Euler identity (Section 7.2, page 53), which factors the Poisson-dual series prime by prime into a quotient of Hecke L-functions times a local Euler product H, and whose u = 1 case is the hypothesis (2.2) of Proposition 2.1 (page 71, display (10.1) and (10.2)). A finite linear combination of two nonproportional Hecke L-functions has no such identity: its reciprocal's coefficients are measured here to be non-multiplicative and unbounded. The rival in the paper's own vocabulary, zeta_Q(s) = zeta(s) L(s, chi_-15) + L(s, chi_-3) L(s, chi_5) for Q = x^2 + xy + 4y^2, has zeros measured at 0.92746 + 15.49663i, 0.91294 + 47.53316i and 1.02597 + 61.42280i (twelve beyond 7/8 below height 300.5, two of them past 1), the third inside the paper's region of absolute convergence, each a cancellation between two nonvanishing products of Dirichlet L-functions. The rival fails the distinguishing step and is therefore not a counterexample (docs/08 section 4.3, second line); what it shows is where a reviewer should look.


1. The claim and its object class

The 7/8 paper (OpenAI, 2026-09-30, 199 pages) states, Theorem 1.1 page 4: every finite-order Hecke L-function over F = Q(sqrt(-3)) has no zero in Re s > 7/8, and the same holds for every Dirichlet L-function including zeta. The 11/12 paper (2026-10-05, 49 pages, "written with human assistance") proves the same statement with 11/12 by the first of the two stages. The transfer to Dirichlet L-functions is quadratic base change: for a Dirichlet character chi, L_F(s, chi o N) = L(s, chi) L(s, chi chi_-3) up to finitely many nonzero Euler factors (11/12 paper page 12; 7/8 paper Proposition 11.3, page 84, display (11.2)). Cited.

The lab's rival class (zeta/epstein.py, docs/08 section 4.1): the Epstein zeta function zeta_Q(s) = sum over (m, k) != 0 of Q(m, k)^{-s} of a positive definite binary quadratic form of class number h > 1. It is (w/h) times a sum over the class-group characters psi of L(s, psi) weighted by conj(psi(Q)), so a finite linear combination of Hecke L-functions of the imaginary quadratic field of discriminant D; it has the functional equation of a degree-two L-function of conductor |D|, real coefficients (the representation numbers), no Euler product, and infinitely many zeros in Re s > 1 (Davenport and Heilbronn 1936, J. London Math. Soc. 11, part II; Titchmarsh section 10.25). Cited, not re-derived. For D = -15 the two class-group characters are the trivial one and the genus character, and the two Hecke L-functions are products of Dirichlet L-functions:

zeta_Q0(s) = zeta(s) L(s, chi_-15) + L(s, chi_-3) L(s, chi_5), Q0 = x^2 + xy + 4y^2, zeta_Q1(s) = zeta(s) L(s, chi_-15) - L(s, chi_-3) L(s, chi_5), Q1 = 2x^2 + xy + 2y^2.

Hardened: this identity (route C) agrees with the lab's lattice route (A) and with the Fourier-Bessel expansion (B) to 1e-18 at twenty digits at the points pinned in test_rival_step.py; the three routes share no code. So the rival is, in the paper's own words, a sum of two products of objects each of which Theorem 1.1 declares zero-free in Re s > 7/8.

2. The distinguishing step, with citations

2.1 Proposition 2.1 is a shared lemma, not the step

7/8 paper, Section 2, page 8. beta_* is defined in (2.1) as the supremum of 1/2 and the real parts of zeros in 1/2 <= Re s <= 1 of L_F(s, eta) over primitive finite-order Hecke characters eta, with the sentence "Absolute convergence of the Euler product excludes zeros in Re s > 1, so 1/2 <= beta_* <= 1." A superscript S deletes finitely many Euler factors: L_F^S(s, eta) = L_F(s, eta) prod_{p in S} (1 - eta(p) Np^{-s}).

Proposition 2.1 (Continuation from a common signal), page 8, hypotheses: for every primitive finite-order Hecke character eta there are a finite set S, a holomorphic H_eta on Re s > sigma_0 with sup |H_eta - 1| <= 1/2 (display 2.2), and a function J_eta(Z) such that, with

f_eta(Z) = (1 / 2 pi i) int_{Re s = 2} Z^{C(s)} e^{(s - 5/6)^2} H_eta(s) / L_F^S(s, eta) ds (2.3),

one has |J_eta(Z)| << Z^{C(sigma_0) + omega} (2.4) and |J_eta(Z) - f_eta(Z)| << Z^{C(beta_*) - sigma} (2.5), with omega, sigma > 0 independent of eta. Conclusion: these contradict beta_* > sigma_0.

Its proof, page 9, touches the Euler product in exactly two sentences: "The reciprocal Euler product is absolutely and uniformly bounded on Re s >= 2" (to move the contour right for the small-Z bound) and "Both sides are holomorphic on Re s > 1, so the identity theorem gives F_eta(s) = e^{(s - 5/6)^2} H_eta(s) / L_F^S(s, eta) (Re s > 1)". Everything else is Mellin inversion, Fourier inversion on the line Re s = 2, and the definition of beta_*. Cited.

Read against the rival (ordinary argument, with measured inputs). Put F = zeta_Q0 for D = -15 and let beta_F be the supremum of the real parts of its zeros. (i) F/2 = 1 + sum_{n >= 4} (r(n)/2) n^{-s}, and the real series takes the value zeta_Q0(2) = 2.68461677469 at s = 2 (measured, route B), so |F(s)/2 - 1| <= 0.3423 on Re s >= 2 and 1/F is bounded there by 0.76; the same triangle inequality gives F != 0 on Re s >= sigma_1 where zeta_Q0(sigma_1) = 4, sigma_1 = 1.52709889569 (measured), so beta_F <= 1.5271. (ii) 1/F is holomorphic on Re s > beta_F. With "Re s > 1" replaced by "Re s > beta_F" and "L_F^S" by "F", every line of the proof of Proposition 2.1 goes through unchanged: the Mellin transform F_eta converges on Re s > beta_F - epsilon_*, the identity theorem applies on Re s > beta_F, and a zero with real part above beta_F - epsilon_* contradicts the continuation. So the proposition, as a mechanism, does not distinguish a single Hecke L-function from a finite combination. As a statement it does not apply to the rival at all, because its integrand is 1/L_F^S(s, eta) for one primitive character and the rival is not one; that is a scope restriction, not a step the rival fails. The kill condition "Proposition 2.1 applies verbatim to a linear combination" therefore does not fire, and the proposition is a shared lemma in the sense of docs/08 section 4.3. The paper says the same thing in its own words: the proposition "compares a normalized character sum with a Mellin integral containing 1/L_F(s, eta)" (page 5), and the content lies in producing the two estimates.

2.2 The 11/12 paper: the Moebius identity, Section 3, page 12

The object the whole analytic machine bounds is the nu-twisted Moebius sum, Section 2.1, page 4:

A_1(D) = sum_n mu(n) nu(n) W(N(n) / D), target A_1(D) << D^{1 - delta + epsilon} (2.1),

introduced with the remark that "the implication from (2.1) to a zero-free half-plane is the smoothed Hecke version of the classical relation between Moebius sums and zero-free regions" due to Littlewood. The implication is carried out on page 12 (proof of Theorem 1.1 from Proposition 3.1), and the display is the step:

"Termwise integration for Re s > 1 gives M_W(s) = W^(s) sum_{(n, S) = 1} mu(n) nu(n) / N(n)^s = W^(s) / L_K^S(s, nu), where L_K^S is the Euler product outside S."

That identity, 1/L_K^S = sum mu nu N^{-s}, holds because L_K(s, nu) is an Euler product with completely multiplicative coefficients, so the Dirichlet inverse of nu is mu nu. It is what makes the coefficients of the Mellin signal (a) of modulus at most one, (b) supported on squarefree ideals, (c) multiplicative apart from the sign mu. Each of the three is consumed downstream, and each consumption is a place a combination cannot enter:

Cited. For the rival the analogue of A_1(D) is sum_n b(n) W(n / D) with b the Dirichlet inverse of r(n)/2. Section 4 measures b.

2.3 The 7/8 paper: the scalar Euler identity, Section 7.2, Lemma 7.1, page 53

Page 50, Section 7: "We will factor each row into Hecke L-functions and a holomorphic Euler product; the row u = 1 will contain the reciprocal of the target function." Page 51, Section 7.2: "Our objective is to prove that the high series is a scalar Euler product for the target eta." The coefficient (7.4) carries the target as eta(A) with A = c n^3, a completely multiplicative function of the completed index. Page 53: "The coefficient in Equation (7.4) has therefore separated into prime factors. In absolute convergence, its factor at p is the series (7.10)." Lemma 7.1 (The complete local identity) then states, display (7.13),

F_{eta, u}(x, w, z) = zeta_F^S(6z) L^S(w, chi_•(u)) / L^S(x, eta conj(chi_•(u))) · H_{eta, u}(x, w, z),

with H a product of local factors (7.12) converging normally in the regions (7.14) and (7.15), the latter being x_r >= 7/8, z_r >= 33/200, w_r >= 19/20, and "for u = 1 in the second region, H_{eta, 1} = 1 + O(P_0^{-c_H})" (page 54). Page 55: "For u = 1, Equation (7.13) contains 1/L^S(x, eta), and its numerator has the two principal factors zeta_F^S(6z) and zeta_F^S(w). Their residues will produce the target Mellin signal." Section 10.1, page 71, defines H_eta(s) = H_{eta, 1}(s, 1, 1/6) (10.1) and fixes P_0 so that sup_{Re s > 7/8} |H_eta(s) - 1| <= 1/2 (10.2), which is hypothesis (2.2) of Proposition 2.1; the proof of Theorem 3.1 on page 85 says "Lemma 7.1 and Equation (10.2) give the required holomorphic, nonzero H_eta on Re s > 11/12 for every primitive target." Cited.

This is the step. The series (7.3) separates into prime factors because every arithmetic function in its coefficient, eta(A) among them, is multiplicative; the local identity (7.11) is then a computation at one prime. For a target F = c_1 L(s, eta_1) + c_2 L(s, eta_2) with eta_1, eta_2 nonproportional, the coefficient would carry c_1 eta_1(A) + c_2 eta_2(A), which is not multiplicative in A, the series does not separate, and there is no local identity to state; and what the principal row would then contain is not 1/F but a sum of two reciprocals 1/L^S(x, eta_1), 1/L^S(x, eta_2) with different numerators, so the residue calculation of Section 10 would not produce a scalar multiple of a Mellin integral of 1/F. Ordinary argument, stated at the level of the paper's own displays; it is where a reviewer should look, and what they should check is that (7.13) is exact and H_{eta,1} is holomorphic and within 1/2 of 1 on Re s > 7/8, since that single lemma is the one place the arithmetic of a single character becomes the analytic input of Proposition 2.1.

3. The measured rival

Instrument: probe.py. Zeros are counted by the lab's argument-principle routine zeta.epstein.count_zeros_box (forced subdivision plus adaptive bisection, integer check at 1e-6) in windows of height 10, located by a grid-seeded Newton iteration with deflation, polished separately on two routes, and each located zero is checked by a winding count in a square of side 0.1 on mpmath and, for D = -15, by a winding number on python-flint balls in which every segment of the square is enclosed (the segment ball excludes zero, so the argument moves by less than pi along it) and the increments come from point balls (Section 3.3). Every scan range is the scan's limit.

3.1 Discriminant -15, Q0 = x^2 + xy + 4y^2, class number 2

Box [0.8751, 1.6] x [0.5, 300.5] on route C at fifteen digits, located at twenty. The right edge is above sigma_1 = 1.5271, beyond which the triangle inequality leaves no zero. The real axis: zeta_Q0 is real there, negative on [0.875, 1) (zeta is negative on (0, 1) and L(1, chi_-15) = 1.622 > 0 while the genus product is 0.26 at 1), and positive on (1, 1.6]; the segment 0 < t < 0.5 was not scanned.

windowlocated zero (route C, twenty digits)Re smpmath winding
[10.5, 20.5]0.9274608807556767112 + 15.496634067901130613i0.9274611
[40.5, 50.5]0.9129364012498515931 + 47.533162611865967388i0.9129361
[60.5, 70.5]1.0259726162187534587 + 61.422798308789397105i1.0259731
[110.5, 120.5]0.8758727322992154756 + 110.77795340738078210i0.8758731
[130.5, 140.5]0.9265846323553476706 + 138.22488912340182573i0.9265851
[160.5, 170.5]0.9741991963234244458 + 170.19070397317808286i0.9741991
[180.5, 190.5]0.8802982435910100229 + 184.28429694618574729i0.8802981
[180.5, 190.5]0.8909421422270621602 + 187.66579052572042931i0.8909421
[200.5, 210.5]0.9070546356201938789 + 205.69694326558172698i0.907055 (relocated, RUNS.md)1
[240.5, 250.5]1.0267748672021328832 + 246.99363615893182523i1.0267751
[290.5, 300.5]0.9103840133351492982 + 292.97956002825989272i0.9103841
[290.5, 300.5]0.9099701528937347036 + 296.36856104603011507i0.9099701

12 zeros in the box below height 300.5, all twelve located inside their windows with |f| below 7e-24 at twenty digits and mpmath winding 1 in a square of side 0.1; 2 of them have Re s > 1 (heights 61.42 and 246.99); the largest real part is 1.026775 at height 246.99; 20 of the 30 windows are empty. The top window [290.5, 300.5] recounted at half the forced subdivision step gives the same 2 (and 0 above Re s = 1), the control against contour aliasing. Elapsed 1622 s on one core, plus 40 s for the one relocation. Measured.

The independent count in [1.0003, 1.6] x [0.5, 300.5], which shares the routine but not the box, found 2 zeros, in the windows [60.5, 70.5] and [240.5, 250.5], the same two windows as the located zeros with Re s > 1. Measured, two contour counts.

3.2 Discriminant -23, Q0 = x^2 + xy + 6y^2, class number 3

Box [0.8751, 1.5] x [0.5, 60.5] on route B at fifteen digits (route B at fifteen digits is reliable to height about 60, RUNS.md). sigma_1 = 1.42171147228. 1 zero, in the window [10.5, 20.5], at 0.9532604747946606863 + 16.290215720390390793i (Re s = 0.953260), |f| = 8.5e-24 at twenty digits, mpmath winding 1; the other five windows are empty; 103 s. Measured; confirmed on route A at the located zero (Section 3.3).

3.3 Hardening of the located zeros

D = -15, all twelve zeros (results_confirm_d15.json, 170 s in all). Columns: the distance between the route C and route B polished roots (thirty digits; route B on mpmath only below height 100), the residuals |f| on routes C, B and A (with the digits used), the segment-enclosed ball winding on route C with the number of segments it needed, the same on the square displaced by 0.15, the point winding on route B balls over 256 points with its largest increment (below height 100), and the upper bounds of |f| from the route B and route C point balls at the root rounded to twelve digits.

heightC root minus B rootresidual on Cresidual on B (digits)residual on A (digits)ball winding on C (segments)displacedpoint winding on B balls (max increment)ball values at the root, B and C
15.49662.5e-413.3e-404.7e-42 (32)5.6e-42 (35)1 (128)01 (0.032)3.2e-12, 3.2e-12
47.53322.9e-402.4e-401.7e-41 (58)1.7e-41 (58)1 (128)01 (0.032)8.5e-11, 8.5e-11
61.42289.5e-417.4e-403.1e-41 (69)3.1e-41 (67)1 (128)01 (0.033)2.6e-11, 2.6e-11
110.7780not run2.7e-39not runnot run1 (128)0not run1.1e-09, 1.1e-09
138.2249not run2.2e-39not runnot run1 (128)0not run8.8e-10, 8.8e-10
170.1907not run5.5e-39not runnot run1 (128)0not run5.1e-10, 5.1e-10
184.2843not run1.1e-39not runnot run1 (256)0not run4.2e-10, 4.2e-10
187.6658not run4.9e-39not runnot run1 (128)0not run1.1e-09, 1.1e-09
205.6969not run1.2e-39not runnot run1 (128)0not run1.2e-09, 1.2e-09
246.9936not run8.3e-40not runnot run1 (128)0not run1.8e-10, 1.8e-10
292.9796not run7.7e-40not runnot run1 (256)0not run6.9e-10, 6.9e-10
296.3686not run1.0e-38not runnot run1 (128)0not run1.0e-10, 1.0e-10

At every zero the two ball routes overlap at the root, the mirror point 1 - conj(rho) has |f| below 2.2e-32 on route C, and the two constituent products are equal in modulus and opposite in sign: |zeta L(chi_-15)| = |L(chi_-3) L(chi_5)| runs from 0.626 (height 138) to 0.961 (height 296). The faulted route B reads 0.67 to 0.77 (scale 4) and 1.34 to 1.55 (sine) at the three low zeros, and the function at rho + 10^{-3} reads 2.2e-3 to 3.8e-3 at all twelve. The ball point values at the root are bounded by the twelve-digit rounding of the root, not by the arithmetic (radii below 6e-41 at up to 2626 bits).

D = -23, the zero at height 16.29. Route B polish at 33 digits: 0.953260474794660686250509013566 + 16.2902157203903907929631726452i with |f| = 3.6e-41; route A at the same point and 36 digits: |f| = 3.6e-41 (7 s); the faulted route B reads 0.728 (scale 4) and 1.455 (sine) there and the function at rho + 10^{-3} reads 3.9e-3; the point winding on route B balls at 386 bits is 1 over 256 points with largest increment 0.033; the point ball at the root has |f| <= 3.8e-11 (root rounded to twelve digits) with radius 7e-45. No segment-enclosed winding for this form (no ball route C).

Grades. Each located zero is hardened: two evaluation routes sharing no code agree on its position to at least 1e-25, the lattice route vanishes there to the stated residual where it was run, the mpmath winding in a square of side 0.1 is 1, and for D = -15 the segment-enclosed ball winding on route C is 1 with a displaced square giving 0. The ball winding is enclosure-carrying only relative to Arb's correctness and to the identity that route C computes zeta_Q0; that identity is itself hardened (three routes, 1e-18) and classical, not kernel-checked, so the composite stays at hardened. The rival has twelve zeros beyond 7/8 below height 300.5, two of them beyond 1 (heights 61.4 and 247.0, real parts 1.02597 and 1.02677): the rival is a rival to the 7/8 conclusion and to the Re s > 1 region, at the heights stated.

3.4 The Davenport-Heilbronn function, for the record

Box [0.8751, 2.0] x [0, 300] on zeta.epstein.dh_f (f != 0 for Re s >= 2 is pinned by tests/test_epstein.py): 0 zeros in thirty windows (367 s). The battery's pinned zero has Re s = 0.80851718, below 7/8 by 0.0665. The deepest pair in the lab's census (hunts/flow_repair, height 240.4) re-polished here lands at 0.869530579640643 + 240.404672351441i with |f| = 2.3e-30 and winding 1, below 7/8 by 0.0055. So no Davenport-Heilbronn zero known to this lab has real part above 7/8, and none exists below height 300 (measured). Zeros with real part up to the Bombieri-Ghosh supremum 1.12036 exist at some height (cited from hunts/lambda_dh_bounds/GATE.md; Davenport and Heilbronn 1936 part I for Re s > 1), none located. The Davenport-Heilbronn function is therefore not a measured rival to 7/8 at any height the lab has reached; the Epstein functions are, at height 15.

4. What the Moebius input becomes for the rival

The paper's twisted Moebius sum has coefficients mu(n) nu(n). The rival's Mellin signal would need the Dirichlet inverse b of a(n) = r_Q0(n)/2 (a(1) = 1 for the principal form), computed exactly by sieve to n = 10^6 (probe.py inverse, 2 s).

5. Controls

6. What this shows, and what it does not

Shows. (1) The Euler product of the target enters the argument at Lemma 7.1 of the 7/8 paper (page 53, used at (10.1) and (10.2), page 71) and at the Moebius identity on page 12 of the 11/12 paper, not inside the continuation criterion Proposition 2.1, which is a shared lemma. (2) An object with the functional equation, real coefficients and the same L-function building blocks, but without an Euler product, has measured zeros at real parts 0.9275, 0.9129 and 1.0260 below height 62 for D = -15 (twelve beyond 7/8 below height 300.5 in all, two beyond 1, the largest 1.02677 at height 247.0) and 0.95326 for D = -23, each one a cancellation between two nonvanishing Euler products. (3) Its reciprocal's coefficients, the only candidate for the paper's Moebius input, are non-multiplicative and unbounded, so neither the sextic-family embedding nor the local identity has an analogue, and the power saving (2.1) is false for it by the amount of its zero.

Does not show. That the paper's proofs of Lemma 7.1 and of Proposition 3.1 are correct, or that they are wrong: nothing here checks an estimate. That 7/8 is true or false for zeta. That the rival is a counterexample: it is not, because it lacks a hypothesis the proof uses (docs/08 section 4.3, second line), and its zeros are consistent with each constituent L-function being zero-free, as section 6 of 38-the-quasi-riemann-claim.md already records for Davenport-Heilbronn. Novelty of anything: nothing was searched; the Davenport-Heilbronn theorem is ninety years old and the zeros of Epstein zeta functions of small discriminant are surely tabulated somewhere not consulted here.

7. Kill conditions

conditionfiredevidence
Proposition 2.1 applies verbatim to a linear combinationnoits statement is for 1/L_F^S(s, eta) of one primitive character; its proof survives with "1" replaced by beta_F, which makes it a shared lemma, not a verbatim application (Section 2.1)
routes disagree at a located zero beyond tolerancenoagreement 1e-25 or better at every located zero (Section 3.3)
positive control fails or a planted fault goes undetectednoSection 5
no zero beyond 7/8 below the height boundnotwelve zeros beyond 7/8 below 300.5 for D = -15, two of them beyond 1; one beyond 7/8 below 60.5 for D = -23

8. Limitations

The doors

This hunt measures a boundary rather than a ceiling, the lowest height at which a rival of the stated class has a zero past 7/8 and past 1, so the section is short, but it is owed.

Active constraints at the optimum

What binds, ranked by how much it moves the answer:

  1. The scan height. The smallest real part the rival shows past 7/8 is fixed by the first located zero at height 15.5 and will not move; the largest real part found, 1.02677 at height 247.0, is a lower bound on beta_F that a longer scan can only raise, toward the triangle-inequality ceiling 1.5271. Every unit of height costs about 0.1 s per contour point at height 300 on route C and the window cost grows like log t.
  2. The class of rival. Only principal forms of two discriminants were scanned. Non-principal forms (their leading coefficient r(1) = 0 changes the reciprocal's shape: 1/zeta_Q1 is 2^s/2 times a Dirichlet series) and larger class numbers were not.
  3. The depth of the paper reading. Lemma 7.1 was identified as the step from its statement and the paper's own signposts; its proof (pages 51 to 55) was read for structure, not checked.

The frozen-constant inventory

frozenvaluewherewhat relaxing it trades
window height10censusshorter windows cost more contour per unit height but isolate zeros for the locator; 10 never held more than three zeros in the strip
left edge of the box0.8751 (and 1.0003)censusset 1e-4 above the thresholds so a zero on the threshold is not on the contour; the nudge list handles the rest; no trade shape
right edge1.6 and 1.5censusanything above sigma_1 is free of zeros by the triangle inequality; a lower edge saves a little contour
count precision15 digitscensusthe winding integer check at 1e-6 passed everywhere; more digits cost linearly and buy nothing seen
locate precision20 digits, polish 30locate_zeros, confirmthe two-route agreement is at the polish precision; genuine trade against time only above height 100 where route B needs 0.8 t digits
ball precision256 bits (route C), 256 + 8 t bits (route B)confirmroute B balls need the extra bits for the Gamma-Bessel cancellation; route C does not; both decided at first try
square half-side0.05, displaced by 0.15confirmsmaller squares need finer subdivision for the segment exclusion; 0.05 decided at 32 to 128 segments per side
inverse range10^6inverse10^7 would cost about 15 s and 1 GB and would still not separate the located zero from the x^{1/2} noise (Section 4)
strip floor for the prediction0.55strip censuszeros nearer the line were left out of the explicit-formula sum on purpose; including them means locating every on-line zero to height 60, which is a different instrument

The information class of each door

Inside the current data, recomputation only. Re-counting any window at half the forced step; polishing the three D = -15 zeros beyond height 100 on route A; the point-sampled D = -23 ball check at more points. None changes a statement above.

Inside the current family, more height. Scanning D = -15 above 300 to raise the lower bound on beta_F; scanning D = -23 above 60.5, which needs route B on balls or a Hecke-L route for the cubic character (not available in python-flint) because route B on mpmath fails above height 100.

Reading more. Whether Lemma 7.1 is exact and H_{eta,1} is within 1/2 of 1 on Re s > 7/8 is a question about pages 51 to 55 and 71 of the 7/8 paper, and it is the question this hunt hands to a reviewer. No computation in this directory bears on it.