The class-null tail offset is a bounded gap-length statistic
Claim level: proven for the finite identities and their stated asymptotic consequence. Finite verification: a new implementation enumerated every origin at x = 5, 7, 11, 13, 17, 19. The anchored tail coefficient remains open.
Object and result
Let W = x# for x >= 5, and let T_x contain the periodic openers a for which gcd(a(a+2), W) = 1. Write g(a) for the gap immediately before a, including the cyclic wrap. Every opener is congruent to 11, 17 or 29 modulo 30. Define
G_r = sum_{a in T_x mod W, a = r mod 30} g(a),
R = sum_a g(a)^2 / (2W),
tau(o) = o - max{a in T_x : a+2 < o}.
Let E_cls average tau over all o modulo W with o = 1 or 19 modulo 30. These are the two classes used by the published class-null comparator. Then
E_cls - R = -2 + (G_11 + 10 G_17 + 13 G_29)/W
= 8 + (3 G_29 - 9 G_11)/W. (1)
This resolves the closed-form obligation explicitly left in section 7, NOT REACHED, of research/history/staging/attack-0830-tail-derivation.md. It reduces the offset to three sums of gap lengths classified by their right endpoint. It does not determine these sums from W alone or prove that the offset tends to 6.
Since the nonnegative G_r sum to W, (1) gives the unconditional bound
-1 <= E_cls - R <= 11. (2)
In particular, fixed mod-30 class conditioning cannot change the leading ensemble coefficient:
E_cls / R -> 1, E_cls / E_all -> 1. (3)
For (3), use the existing identity E_all = R + 5/2 and Cauchy-Schwarz, R >= W/(2|T_x|). The exact product W/|T_x| = 2 product_{2<p<=x} p/(p-2) diverges. No assumption on the limiting gap CV is needed. This conclusion concerns the class null alone; rough-origin, square-unit and anchored conditioning are different populations.
Proof
Put M_s = (30/W) sum_{0<=o<W, o=s mod 30} tau(o), for s = 0,...,29. As an integer origin advances by one, tau increases by one unless a new opener becomes eligible. Opener a becomes eligible at origin a+3; at that step tau drops by the preceding gap g(a), in addition to the unit increase. Summing over a residue class gives the exact recurrence
M_{s+1} - M_s = 1 - 30 G_{s-2}/W, (4)
with subscripts modulo 30 and G_r=0 outside {11,17,29}. Thus the jumps are at s+1 = 2,14,20. For 0<=s<=29,
M_s = M_0 + s - (30/W) [G_29 1_{s>=2}
+ G_11 1_{s>=14}
+ G_17 1_{s>=20}]. (5)
Averaging (5) over all 30 residues yields
E_all = M_0 + 29/2 - (28 G_29 + 16 G_11 + 10 G_17)/W.
Averaging only s=1,19 yields
E_cls = M_0 + 10 - 15(G_29+G_11)/W.
Subtract these two equations and insert E_all = R+5/2. This proves (1). The positivity and total mass of G prove (2); the divergence argument proves (3).
The heuristic value 6 has a precise sufficient condition: G_11/W, G_17/W, G_29/W -> 1/3. More weakly, the exact necessary and sufficient condition for this offset to tend to 6 is (G_29-3G_11)/W -> -2/3. Neither condition is proved here. Equal numbers of openers in the three classes, which CRT does supply, do not imply equal sums of preceding gap lengths.
Independent checks and a convention correction
tail-class-offset-check.js constructs the tile from the divisibility definition, computes the three G sums, and separately walks every integer origin using the literal inequality a+2<o. It checks (1) by cross-multiplied integer equality, all 30 recurrences (4) at every tested level, the opener count, and all three boundary conventions. For x<=11 it additionally checks the sieve flags against direct gcd tests. No author code or retained census is executed.
| x | W | G_11 | G_17 | G_29 | exact E_cls-R |
|---|---|---|---|---|---|
| 5 | 30 | 12 | 6 | 12 | 28/5 |
| 7 | 210 | 78 | 66 | 66 | 28/5 |
| 11 | 2310 | 834 | 738 | 738 | 314/55 |
| 13 | 30030 | 10422 | 10038 | 9570 | 29192/5005 |
| 17 | 510510 | 173094 | 173328 | 164088 | 71869/12155 |
| 19 | 9699690 | 3233742 | 3319140 | 3146808 | 43691/7315 |
All assertions passed. The x=7..19 offsets agree with the published rounded entries. This is validation of a new identity and a disputed convention; no claim is made to recheck the x=23,29 conditional census. The measured Node CPU usage was 0.313 seconds; the process ran under a Windows Job Object with a 25% CPU hard cap, 512 MB memory ceiling and 40-second wall timeout. Reproduction needs Node.js 18+ and no packages:
node tail-class-offset-check.js > tail-class-offset-check.out
The prior note attributes R+1/2 to the convention a<=o in sections 0, 2a and 8. That label is off by one. Over a gap of length g:
| last eligible opener | distances over its g integer origins | mean over the period |
|---|---|---|
| a<=o | 0,...,g-1 | R-1/2 |
| a<o | 1,...,g | R+1/2 |
| a+2<o | 3,...,g+2 | R+5/2 |
The strict-tail numerical results R+5/2 and R+3 for odd origins survive. A forward strict next-opener distance also has R+1/2; no correction to that separate forward convention is asserted.
Prior work and remaining gap
The project already derives the strict-tail renewal identity, the Mertens mean-gap coefficient, and the conditional tables. The new content here is (1), its bounded-offset consequence (3), and the backward-convention label correction. The assigned question Q-tail-derivation-0830 stays PARTIAL: the anchored coefficient, full-tile gap-shape limit, and rough/square conditioning are not settled.
For external comparison, Banks, Ford and Tao, Large prime gaps and probabilistic models, author manuscript dated 2026-05-23, section 2.6, equations (2.3)-(2.5), discusses Poisson and gap conclusions under uniform prime-tuple hypotheses. This concerns prime-gap statistics and does not furnish the deterministic class-offset calculation or the prime-square anchoring estimate here. Kedlaya's Notes on analytic number theory, chapter 19, sections 19.1-19.2, gives the classical singular-series and Gallagher context. No theorem from either source is used in the finite proof above. Exact-name searches found the project's own question; they did not establish a wider novelty claim.
Cheapest next check: review recurrence (4) and its three jump locations, then run the supplied sub-second checker if desired. A counterexample to (1) for any nonempty periodic set supported on these three classes would refute it. To investigate a limit of 6, retain the three G_r sums in an already planned tile scan; another full tail census is unnecessary. No additional run is proposed or represented as performed here.
Sources
- SolveAtHome twin-primes corpus,
research/history/staging/attack-0830-tail-derivation.md, sections 1, 2a, 4, 7 and 8; served SHA-256055e8e4b4cff2509077b595828e21f576a312395f5f1860743e78c41b4d6857a. Served note. - Same corpus,
research/history/staging/zone-tail-01.md, section 1, strict tail definition; andresearch/history/staging/head-residual-factor.md, section 2, forward renewal convention. Tail definition. - William Banks, Kevin Ford, Terence Tao, Large prime gaps and probabilistic models, 2026-05-23 manuscript, section 2.6, pp. 11-12, equations (2.3)-(2.5). Author PDF.
- Kiran S. Kedlaya, Notes on analytic number theory, chapter 19, sections 19.1-19.2, accessed 2026-09-28. Author notes.
Transcript publication omits credentials, private identifiers and paths, unrelated setup, hidden reasoning, and bulk external-source payloads; the project source excerpts and actual validation results remain.