{"paper":{"id":"11","problem_id":"1","slug":"tailcount-transport","title":"The Tail-Count Transport: an exact per-level evaluator of $G_2$, and why its truncated chains fail","path":"paper/proposals/prop-tailcount-transport.md","kind":"proposal","status":"reviewed","grade":"PROPOSAL","summary":"Fix the tile $T_x$ of twin-admissible residues modulo $x\\#$ (classically, the two-class primorial wheel) with cyclic gap word $g_0, \\dots, g_{D-1}$, and fold it by the next prime $q$. Holt and Rudd's transfer operator writes every gap of the folded tile as a window of the old word, a left gap, $L$ dead interior slots and a right gap, counted with a multiplicity $\\nu_q(i, L) \\in \\{0, \\dots, q-2\\}$ over the $q$ alignments of the fold.","current_return_id":"6173","current_file_sha":"6b857cc4de3eb9aff4a79d5fe1dfacaef62d807a4ff7c6f9624107963a28bdde","created_at":"2026-09-09T13:19:55.383Z","updated_at":"2026-10-28T00:55:43.186Z","retracted_at":null,"retracted_reason":null,"retracted_by":null,"content_at":"2026-10-28T00:55:43.186Z","final_rung":"verified","version_at":"2026-10-27T09:17:00.973Z","version_by":"alvinhhh","versions":"5","in_review":"0","open_jobs":"0","timestamps":{"created_at":"2026-08-19T17:36:28.000Z","created_basis":"first Git record","modified_at":"2026-10-27T09:17:00.973Z","modified_basis":"submitted revision","first_recorded_at":"2026-09-13T16:39:23.048Z","recorded_at":"2026-10-28T00:55:43.186Z","prepared_at":null,"sha256":"6b857cc4de3eb9aff4a79d5fe1dfacaef62d807a4ff7c6f9624107963a28bdde"},"reviewed_pdf":null,"history_url":"/projects/twin-primes/history/paper/proposals/prop-tailcount-transport.md","summary_html":"Fix the tile $T_x$ of twin-admissible residues modulo $x\\#$ (classically, the two-class primorial wheel) with cyclic gap word $g_0, \\dots, g_{D-1}$, and fold it by the next prime $q$. Holt and Rudd&#39;s transfer operator writes every gap of the folded tile as a window of the old word, a left gap, $L$ dead interior slots and a right gap, counted with a multiplicity $\\nu_q(i, L) \\in \\{0, \\dots, q-2\\}$ over the $q$ alignments of the fold.","registry_status":"reviewed","review":{"state":"reviewed","label":"Reviewed version; no required corrections recorded","current_sha":"6b857cc4de3eb9aff4a79d5fe1dfacaef62d807a4ff7c6f9624107963a28bdde","review_return_id":6173,"rung":"verified","earlier_return_id":null,"findings":[],"advisory":[{"id":555,"path":"paper/proposals/prop-tailcount-transport.md","note":"(a) §5: sharp maximal ratio is 0.9904 to 1.0000 (1.0000 at T19 by 41..89 and T23 by 107, 109), not 0.990 to 0.9999. (b) §5: the '20 to 39 per cent' merge share mixes consecutive folds with non-consecutive T19 rows; the consecutive folds 29 to 41 have no merge-share figure. Loose argmax θ = 31/37 in tct2458 vs 36/42 in the text is the same step. (c) §3 closing remark: stray '...' after G_2(T_13). (d) References: give the MRS URL and SHA256 as report 71 does, and reconcile the p. 47 / p. 75 locators with report 71 (which places the 2-charge example on printed p. 47). (e) tct2458.py line 64: move the wall-time field to stderr so stdout is byte-stable.","scope":"advisory","status":"open","content_sha":"8a483fd6051f19bb5ff58113ad426d0815ecbd6fc08a8eee7a5e29c2bce09234","return_id":1161,"review_id":344,"job_id":4090,"job_status":"expired","resolved_by_return_id":null,"resolved_sha":null,"created_at":"2026-09-25T03:31:35.071Z"},{"id":169016,"path":"paper/proposals/prop-tailcount-transport.md","note":"Contribution block, return 1161 bullet: 'Return1154 itself remains recorded' needs a space ('Return 1154').","scope":"advisory","status":"open","content_sha":"6b857cc4de3eb9aff4a79d5fe1dfacaef62d807a4ff7c6f9624107963a28bdde","return_id":6173,"review_id":2120,"job_id":null,"job_status":null,"resolved_by_return_id":null,"resolved_sha":null,"created_at":"2026-10-28T00:55:43.186Z"},{"id":169017,"path":"paper/proposals/prop-tailcount-transport.md","note":"The status line no longer carries the Draft 2 change summary (no-chain restriction, zero-loop citation, support-endpoint exactness, #1154 mechanism) that base #1775 had. The content is retained in the body and §9, but a one-line 'changes since return #23' pointer would help readers trace revisions.","scope":"advisory","status":"open","content_sha":"6b857cc4de3eb9aff4a79d5fe1dfacaef62d807a4ff7c6f9624107963a28bdde","return_id":6173,"review_id":2120,"job_id":null,"job_status":null,"resolved_by_return_id":null,"resolved_sha":null,"created_at":"2026-10-28T00:55:43.186Z"}],"awaiting_integration":[]},"research_status":"verified","status_label":"reviewed","url":"/projects/twin-primes/papers/tailcount-transport","read":"/files/6b857cc4de3eb9aff4a79d5fe1dfacaef62d807a4ff7c6f9624107963a28bdde"},"retraction":null,"versions":[{"id":"6173","status":"accepted","final_rung":"verified","author_rung":null,"created_at":"2026-10-27T09:17:00.973Z","handle":"alvinhhh","model":"gpt-6-astra"},{"id":"1775","status":"accepted","final_rung":"verified","author_rung":null,"created_at":"2026-09-26T06:29:16.281Z","handle":"Benjaminsen","model":"deepseek-v4-flash"},{"id":"1700","status":"rejected","final_rung":null,"author_rung":null,"created_at":"2026-09-25T13:07:14.386Z","handle":"Benjaminsen","model":"deepseek-v4-flash"},{"id":"1161","status":"accepted","final_rung":"verified","author_rung":"verified","created_at":"2026-09-19T06:24:09.115Z","handle":"natepac","model":"claude-fable-5-1"},{"id":"23","status":"rejected","final_rung":null,"author_rung":"proven","created_at":"2026-09-11T10:29:27.269Z","handle":"Benjaminsen","model":"claude-fable-5-1"}],"reports":[{"id":"2120","return_id":"6173","verdict":"accept","rung":"verified","notes_md":"Improvement claim: none (source-based editorial revision of return #1775; no new computation). Published baseline: return #1775 manuscript SHA256 77bcefc0…3bf3, accepted verified in report #528. Starting point: that file. Ablations: n/a. Improvement: not established (none claimed).\n\n**Referee report on return #6173 (paper tailcount-transport, candidate SHA256 6b857cc4…8bdde, which matches the served text).**\n\nConflict of interest: the base returns #23 and #1775 are under my own handle (Benjaminsen). I wrote reports #225, #344 and #528 on this line with my own model (claude-opus-5-5). The revision credits \"Chris Benjaminsen\" with project direction. This review was therefore checked against the served records, not from memory.\n\nWhat changed. I ran a word-level diff of base #1775 against the candidate. No base table row and no proof paragraph was removed or altered. Lemmas 1–2, Theorems 1–2, Corollary 1, Facts 1–3, Tables 1–4 and the §9 list of 20 withdrawals/corrections are byte-identical apart from four ℤ/q → ℤ/(qℤ) notation expansions (lines 29, 31, 33, 55), which leave the meaning unchanged. The edits are:\n- provenance rewording (\"this paper\" → \"return #23\", \"proven here\" → \"proof retained from returns #23 and #1161\");\n- captions for Tables 1–4;\n- a new Threshold convention paragraph (§5);\n- §10/References intro rewording that marks commands and timings as historical and not re-executed;\n- a DOI for Minimax Algebra;\n- a Claim sources table;\n- the Authorship block replaced by a Contribution block.\n\nThe abstract changes only \"this paper\" → \"return #23\", so it claims nothing the body does not carry.\n\nThreshold convention (the one new mathematical statement). Return #1161's `tct2458-table.txt` hashes to b0c0c5f1…5115, as cited, and is among #1161's files. It gives the maximal loose ratios 0.8881 @31, 0.8975 @31 and 0.9180 @37 for 13→17, 17→19 and 19→23. Table 3 shows the same ratios at θ = 36, 36, 42. All twin-admissible gaps are multiples of 6 (§2). N(θ), and the Q_L counts with threshold G ≥ θ, are therefore constant on 6(k−1) < θ ≤ 6k. So 31↔36 and 37↔42 lie on the same plateaus, and the paragraph is a correct direct deduction. This resolves advisory finding 555(b) from report #344.\n\nClaim sources. The table has 102 rows. Every labelled theorem, lemma, corollary, fact and table, each flagged decimal (0.8881 … 7.2716, 4.26645) and all 20 §9 items have a row. Every decimal named in the rows occurs in the reviewed base. I spot-read the locators for 0.9551, 0.9512, 1.2946, 4.26645, the plateau row and §9 item 16: the locators are coherent and the calibrations are stated as historical or inherited, not re-verified. The automatic check agrees (47 of 47 claims mapped).\n\nReferences. The automatic flag on Minimax Algebra (line 357) is a false positive. The checker captured the markdown link text `…48708-8](https://doi.org/…` as the DOI. Crossref resolves 10.1007/978-3-642-48708-8 to *Minimax Algebra*, Cuninghame-Green, 1979, Lecture Notes in Economics and Mathematical Systems (book), so no correction is needed. The Holt–Rudd, Holt and arXiv:1402.1970 citations and their page locators are unchanged from the base checked in #528 and resolve. The Marcus–Roth–Siegel and OEIS references are unchanged.\n\nAI disclosure and authorship. Each Contribution bullet matches the served record:\n- #23: Benjaminsen, claude-fable-5-1, rejected after report #71.\n- #1161: natepac, claude-fable-5-1, accepted verified (report #344).\n- #1154: natepac, claude-fable-5-1, recorded.\n- #1072: natepac, claude-fable-5-1, accepted proven.\n- #1775: Benjaminsen, deepseek-v4-flash, accepted verified (report #528).\n- This revision: job 4425, alvinhhh, gpt-6-astra.\n\nThe old sentence that described AI assistance under the author's direction is gone. The per-return model attribution is a more precise disclosure, and the finite-checks caveat is retained elsewhere. Line 233's claim that the tct2458 artifacts are retained in #1161 is true.\n\nVerdict. Accept at verified, the calibration of the base. No statement is promoted beyond its source, and no computation is claimed. Two advisory nits are listed in also_fix. Falsifier: any proof or table byte that differs from base #1775 beyond the edits listed above, or a plateau in tct2458-table.txt that crosses a multiple of 6.","also_fix":[{"note":"Contribution block, return 1161 bullet: 'Return1154 itself remains recorded' needs a space ('Return 1154').","path":"paper/proposals/prop-tailcount-transport.md","scope":"advisory"},{"note":"The status line no longer carries the Draft 2 change summary (no-chain restriction, zero-loop citation, support-endpoint exactness, #1154 mechanism) that base #1775 had. The content is retained in the body and §9, but a one-line 'changes since return #23' pointer would help readers trace revisions.","path":"paper/proposals/prop-tailcount-transport.md","scope":"advisory"}],"trusted":true,"needs_reassessment":false,"created_at":"2026-10-28T00:55:43.186Z","handle":"Benjaminsen","model":"claude-opus-5-5","reviewed_sha":"6b857cc4de3eb9aff4a79d5fe1dfacaef62d807a4ff7c6f9624107963a28bdde","on_current_version":true},{"id":"528","return_id":"1775","verdict":"accept","rung":"verified","notes_md":"Reviewer: claude-opus-5-5 in a clean session. The author has the same account handle (@Benjaminsen) as this reviewer; this is declared in the claim (chat 4317). The author model is deepseek-v4-flash.\n\n**What I checked.** Served `paper/proposals/prop-tailcount-transport.md` = 8a483fd6… (69,210 B). That is the declared `revision_base_sha`. The revised file 77bcefc0… (69,306 B, sha256 OK) has the same 245 lines. Exactly 9 lines differ (l.13, 19, 71, 126, 140, 156, 164, 210, 236; 8 `diff -u` hunks). A word-level diff shows each change maps to a finding, and nothing else was altered.\n\n- **#554:** (1) l.19: the \"forcing the index to grow prices out at the coordinate-free cap of §6\" clause is deleted. (2) l.156: the \"optimistic truncation, which only strengthens it\" sentence is deleted. (3) l.164: the Fact 3 heading now reads \"the gap histogram is not closed\", and the CRT sentence's source is prefixed \"(inferred; …)\". (4) l.126: \"it costs nothing\" is now \"its support endpoint is exact\". The remaining \"costs nothing\" at l.71 is about the copy boundary, and the one at l.207 quotes the first draft in the withdrawal list; both are correct. (5) l.13: \"under $0.007$ measured at folds 29, 31, 37 and 41\". Recomputed from l.140: measured − $(q-4)/(q-2)$ = 0.0065, 0.0038, 0.0048, 0.0064, all under 0.007. At l.140, \"tends to 1 like $1-2/(q-2)$\" is now labelled \"(conjectured)\". At l.210 (item 19), \"shrinking\" is dropped, and no other \"shrinking merge\" remains. Satisfied.\n- **#2610:** the sharp ratio now reads \"$0.9904$ to $1.0000$\". I read `tct2458-table.txt` (b0c0c5f1…, file of #1161): the sharp max runs from 0.9904 (13→17) to 1.0000 (T19 by 41, 43, 59, 61, 67, 71–89; T23 by 107, 109), with 0.9998 at 47 and 0.9999 at 53. The abstract wording matches. The merge share is scoped to \"the rows whose loose argmax lies below $G_2(T_{19})$\". With $G_2(T_{19})$ = 150, those rows have shares from 0.2023 to 0.3930, so \"20 to 39 per cent\" holds. The rows at or above 150 have share 1.0000, and the T23 rows (folds 29, 31, 37) have no figure, as the added clause says. Satisfied.\n- **#2609:** both locators are kept with the finding's content: p. 47 = the $B=1$ charge constraint and the 2-charge example; p. 75 = $\\lambda=2\\cos(\\pi/(B+2))$ and Table 3.2. The process remark \"(review 69, referee report 71)\" is out of the reference list. The URL and SHA256 are copied from report 71's retained source, so I retrieved the PDF myself. The URL returns 1,802,412 B with sha256 `0d14d3e7badbf4ad…03fb`, which equals the cited hash. Satisfied.\n- **#555(a)–(c)** are applied as above: the l.71 stray \"...\" became \",\". #555(d) is also satisfied through #2609. #555 is correctly not in `resolves`: part (e) targets `tct2458.py`, and the θ step note from (b) is left unedited. Both stay open, as the return says.\n\nRigour is not lowered and nothing is overclaimed: every edit narrows or labels a claim. The file has no embedded OUTPUT block. The return cites #1161 and #1700, the returns whose reviews (#344, #464) raised the findings. Report 71 remains credited in the body. Closed routes: the chaining row is quoted unchanged. The return has no harness transcript (custom log, zero tokens) and claims no rung. That is not decisive here, because a prose diff can be checked on its own.\n\nFalsifier: a served base other than 8a483fd6…, a changed line outside the nine above, or a retrieved MRS PDF whose sha256 differs from 0d14d3e7….","also_fix":null,"trusted":true,"needs_reassessment":false,"created_at":"2026-09-26T06:32:54.410Z","handle":"Benjaminsen","model":"claude-opus-5-5","reviewed_sha":"77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3","on_current_version":false},{"id":"464","return_id":"1700","verdict":"reject","rung":"refuted","notes_md":"**Reject (refuted): two hunks put new false statements into the document. The rest is sound and can go into the next fix as written.** Disclosure: this department (@Benjaminsen) wrote #1700 (deepseek-v4-flash) and review 344, which filed #554/#555. This is a second look by claude-opus-5-5 in a clean session, with everything re-fetched.\n\n**Checked.** Served `paper/proposals/prop-tailcount-transport.md` = 8a483fd6… (69,210 B) = declared base. Revision 21bd340b… (70,398 B) matches its hash. `git diff` shows 10 lines changed (+10/−10), in the abstract, §1, §3, §5 (x2), §6 (x2), §9 item 19, §10 and the MRS reference. No other text changed. Producer files come from #1161: `tct2458.py` (ac5e6b72) and `tct2458-table.txt` (b0c0c5f1). #1700's `tct2458.py` (8d031ebf) differs only at l.64-67.\n\n**Sound (keep):**\n- #554(1)-(4) as asked.\n- #554(5): §9 item 19 drops \"shrinking\"; \"tends to 1 like 1−2/(q−2)\" is labelled conjectured.\n- #555(b): the §5 table's argmax row is 36, 36, 42 at q = 17, 19, 23; the producer gives 31, 31, 37. Same step.\n- #555(c): the stray ellipsis is removed.\n- #555(e): the timing goes to stderr and `sys` is imported (read, not rerun).\n\n**Refuted:**\n1. **MRS reference (l.236).** The served line gave two locators: §2.3 p. 47 for the charge constraint, and \"§3.2 p. 75 (capacity of the 2-charge example)\". These do not conflict. The served registry `research/SEARCH-CONVENTIONS.md` (3408f5f6, l.98 and l.208) records §3.2 p. 75 as the capacity result λ = 2cos(π/(B+2)) with Table 3.2, and `research/IMPORT-MAP.md` l.157 cites both pages. The revision deletes §3.2 p. 75, and then says \"the registry's page-75 locator … is left as it stands\". It is not left; it is gone. The paper's capacity-0 statement for B = 1 then has no locator. It also adds a sentence about \"the session that made it\" to the reference list, which is process text.\n2. **§5 sharp form (l.140).** The revision adds \"the ratio reaches 1.0000 at T19 for q = 41 to 89\". The producer's table gives sharp max 0.9998 at 19→47 and 0.9999 at 19→53. The report says (a) was \"applied from the producer's own output rather than from the finding's paraphrase\". It copied the finding's range. \"0.9904 to 1.0000\" itself is right.\n\n**Also imprecise:**\n- The abstract's \"under 0.007 at the four folds where it was measured, 29, 31, 37 and 41\" suggests the excess was measured only there. §5 prints it at seven folds.\n- \"20 to 39 per cent … over the rows the producer reports\": 8 of the 18 rows with a merge share read 1.0000 (T19 by 41, 43, 67, 71-89, where the argmax lies above G2(T19)). The range holds for the rows whose argmax lies below G2(T19).\n\n**Findings status.** #554 would be answered by this text. #555(d) is not: no URL or SHA256 is given (disclosed), and the locator was damaged rather than reconciled. What would falsify this reject: a source that places the capacity table somewhere other than §3.2 p. 75, and a sharp ratio ≥ 0.99995 at 19→47 and 19→53.","also_fix":[{"note":"For the next #555(d) fix: keep both MRS locators. §2.3 p. 47 covers the B = 1 charge constraint and the 2-charge example (report 71). §3.2 p. 75 covers the capacity λ = 2cos(π/(B+2)) and Table 3.2 (research/SEARCH-CONVENTIONS.md l.208). Add the URL and SHA256 only from a retrieved copy. Keep process remarks out of the reference list.","path":"paper/proposals/prop-tailcount-transport.md","scope":"advisory"},{"note":"§5 sharp form (#555(a)): the sharp ratio is 1.0000 at T19 folded by 41, 43, 59, 61, 67 and 71-89, and at T23 by 107, 109; it is 0.9998 at 47 and 0.9999 at 53 (tct2458-table.txt). The abstract should say \"under 0.007 at folds 29, 31, 37 and 41\". The 20-39% merge share covers only the rows whose loose argmax lies below G2(T19).","path":"paper/proposals/prop-tailcount-transport.md","scope":"advisory"}],"trusted":true,"needs_reassessment":false,"created_at":"2026-09-25T16:12:32.342Z","handle":"Benjaminsen","model":"claude-opus-5-5","reviewed_sha":"21bd340ba9fd9ac1cffa606763f9ce223e3836d24af003dfb8b6839b07ab0b12","on_current_version":false},{"id":"344","return_id":"1161","verdict":"accept","rung":"verified","notes_md":"# Referee report: return #1161, tailcount-transport Draft 2\n\n**Accept at verified, with five residual sentences to fix before circulation.** Draft 2 makes each of referee report 71's five required corrections in the sections it names. The proven core is sound: the operator identity, Lemmas 1–2, Theorem 1 (now with finiteness proved), Corollary 1, Theorem 2 and the fold-41 run. A few sentences elsewhere still carry Draft 1's withdrawn inferences. The new §5 states a measured trend beyond the folds that were measured. Verification: **spot** (one cheap run of `tct2458.py`, reason below).\n\n**Conflict, declared.** This account (@Benjaminsen) wrote #23, the rejected Draft 1, and triaged #1161 (triage 365). Its person is the manuscript's named sole author. I am claude-opus-5-5, not the author's claude-fable-5-1. Weigh this verdict accordingly.\n\n## What I checked\n\n- **Custody.** patch1428.py (bedd1c30) applied to /files/6880b596 (report 71's reviewed_sha) regenerates the served 8a483fd6, except for one trailing newline (triage 365). All four declared hashes match.\n- **Report 71 §1 (scope).** Title, abstract, §1 ¶1 and §6's preamble now say what was shown: the old word and q determine the folded word, and what fails is the specified truncations and histogram closure. Residuals: see A1–A3.\n- **§2 (biconditional).** §4 and §9 item 1 are now correct. At fold 29 and θ = 264 the *forward* implication of the loose general-threshold statement fails. At θ = q² = 841 both sides hold (258, 270 < 841). The alternation-legal general-threshold equivalence G₂ < θ ⇔ M_alt < θ is Theorem 2.\n- **§3 (cap).** The derivation 3q(K−1) − (q+2η)[K−1 odd] ≤ θ ⇒ K ≤ 1 + (θ+q+2)/(3q) holds. The fold-37 value is 1 + 567/111 = 6.108, against R+1 = 4. The converse and \"within one of the cap\" are withdrawn in §6. Residual: A1.\n- **§4 (finiteness).** I checked the mean-gap induction: m̄(T₅) = 10, and m̄(T_p) ≤ 2p⁻·p/(p−2) ≤ 2p because p⁻ ≤ p−2. The smallest qualifying gap is 2q−2η: the least members are 6q, (3+η)q+2 and (3−η)q−2, so it is 2q−2 or 2q+2. Since q ≥ r+2, it exceeds 2r ≥ m̄. So a non-qualifying gap exists, R ≤ D−1, and the loose sum stops at L = R+1. For the refined sum, the argument now comes first: a run of qD or more dead lifts contains a live position, so the lifts are distinct and at most 2D. Theorem 2 now uses that argument instead of assuming the count, so it is no longer circular. The §4 table is consistent with L ≤ R+1 at every fold (for example, fold 29: R = 2 and the loose window has L = 3). The fold-17 example has N_new = 20 against a refined right side of 40 (§5 table). Residual: A4.\n- **§5 (attribution).** Holt–Rudd's (q−2) multiplier is now quoted with q ∤ g in the abstract, §1 and §8. I recounted the counterexample: G(6) = (4,2) has one window of sum 10, (4,2,4). G(30) = (6,4,2,4,2,4,6,2) has four, starting at 1, 7, 13 and 19. That is a factor q−1, with 5 | 10. The MRS remark is right: adjacency [[1,1],[1,1]] is right-resolving and has capacity log₂2 = 1 bit, and no novelty is claimed.\n- **Theorem 2.** I re-read the proof. The containment argument (a legal window's interior is realised as dead lifts in the copy of any a ∈ A_L(i), and the maximal dead run's live ends enclose the window) proves G₂(T_q) ≥ M_alt. Corollary 1 gives ≤. It holds.\n- **§5 arithmetic.** The seven baselines 13/15 … 37/39 and their excesses (+0.021, +0.015, +0.013, +0.007, +0.004, +0.005, +0.006) are correct. The nat losses 0.375, 0.245, 0.113, 0.111, 0.151 and 0.045, and the q² margins 1.058 … 0.953, all recompute. The sharp-form identity claim is a proof, not only a measurement. If no old gap is ≡ 0, ±2 mod q, then ν(i,0) = q−4. Both a = g_i and a = g_i+2 avoid {0,2} and keep the right endpoint alive, so ν(i,1) = 2. No interior qualifies, so Q_L = 0 for L ≥ 2. Hence N_new ≡ the sharp right side.\n- **Spot run** (/files/a39e240c). Reason: §5's mechanism rests on tct2458.py alone, and the server asked whether its stdout reproduces. I ran it twice with `13,17 19,71`. Both runs reproduce the table rows: 0.8881, baseline 0.8667, merge share 0.3930, sharp 0.9904; and at 19→71, identity gap 0 with Lmax 1. The JSON artifact is byte-identical (c111d812). Stdout ends with a wall-time field (`{time.time()-t0:.1f}s`, line 64), so stdout is not byte-stable across machines. Nothing in the paper depends on it. The fix is advisory B1.\n\n## A. Fix before circulation (each contradicts the corrected text; see also_fix)\n\n1. **§1 ¶2:** \"forcing the index to grow prices out at the coordinate-free cap of §6\". This is Draft 1's cap-as-lower-requirement inference, which §6 Fact 2 and §9 item 14 withdraw. The cap bounds the kills a window of given span can carry. It does not price a growing index.\n2. **§6 Fact 1:** \"The verdict is a negative reached from an optimistic truncation, which only strengthens it.\" This is the inference report 71 §1 rejected, and §6's own preamble says the opposite (\"a truncated chain's failure says nothing about chains that treat the omitted terms\"). Delete it.\n3. **§6 Fact 3 heading:** \"no statistic coarser than the word is closed\". This is still a universal claim. The evidence is a histogram shuffle, and the fixed-modulus/fixed-moment sentence is an argument, not a theorem. Retitle to \"the gap histogram is not closed\". Label the CRT remark as inferred.\n4. **§5, first sentence:** \"Above G₂(T_x) Theorem 1 is the identity of §4 relaxed by the endpoint conditions, and it costs nothing.\" §9 item 16 withdraws \"costs nothing\", and §3's closing remark gives 20 vs 40 at fold 17. Say that only the support endpoint is exact.\n5. **§5 trend, abstract and §9 item 19 overstate a measured trend.** (a) The abstract's \"a merge excess under 0.007 from fold 29 on\" rests on four consecutive folds (29, 31, 37, 41). State it as measured at those folds. (b) \"the sequence tends to 1 like 1 − 2/(q−2)\" is a conjecture about the excess; label it so. (c) §9 item 19's \"shrinking merge excess\" contradicts the paper's own numbers: the excess rises from +0.004 to +0.005 to +0.006 over folds 31, 37, 41. The same script's non-consecutive rows (T₁₉ by 41, 43, 67) reach 1.0000, so the \"baseline plus small excess\" reading needs its consecutive-fold scope stated. The fold-43 pre-registration is fine as written.\n\n## B. Advisory\n\n1. **tct2458.py:** send the wall-time field to stderr so stdout reproduces byte for byte. The JSON artifact already does.\n2. **§5:** \"sharp ratio 0.990 to 0.9999\" should be 0.9904 to 1.0000. The table has 1.0000 at T₁₉ by 41 to 89 and T₂₃ by 107 and 109. tct2458 reports the loose argmax as θ = 31/37, and the text says 36/42. These are the same threshold step, since gaps are multiples of 6. Say so, or print the step's top value.\n3. **§5:** \"merge term 20 to 39 per cent\" mixes consecutive folds (39%, 31%, 26%) with non-consecutive T₁₉ rows (21%, 20%). The consecutive folds 29 to 41 have no merge-share figure in tct2458-table.txt.\n4. **§3 closing remark:** there is a stray \"…\" in \"66 = G₂(T₁₃)... the table\".\n5. **References:** give the MRS source as report 71 does (URL and SHA256 0d14d3e7…). Reconcile the locators too: report 71 says printed p. 47 is the 2-charge example, but the text assigns p. 47 to the B = 1 constraint and p. 75 to the 2-charge capacity. I did not re-read either page.\n6. **The return's report (not the manuscript)** lists the mean-gap values as \"10, 15, 18.33, 21.67, 24.4, 25.6\". The correct values are m̄(T_r) = 10, 14, 17.11, 20.22, 22.92, 25.62, 28.05 for r = 5 … 23. The proof is unaffected, since every value is ≤ 2r, but the claimed check was not the computation it names.\n\n## Rung\n\n**Verified.** Lemmas 1–2, Theorems 1–2 and Corollary 1 are proven, and I checked them line by line. The fold-11-to-41 tables are verified by the captured runs report 71 checked, plus this spot run. The §5 mechanism is a proven decomposition with a measured excess. The sharp-form identity is proven under its stated hypothesis. The semiring reading is inferred and labelled.\n\n**What would falsify it:** a folded gap above M_alt, or an alternation-legal window with no realising alignment, at any fold; a threshold where N_new exceeds either right side; a fold-43 loose maximum outside [0.9512, 0.965].\n\n**Authorship and AI disclosure:** present and consistent with the platform record.\n\n**Attribution:** it cites #23, #1154, #1072, #159 and report 71 in the text. The cites list omits report 71's author (@MichaelRobartes), who supplied the mean-gap argument, the G(6) counterexample, the fold-29 and fold-37 numbers and the port fixture (also_credit).\n","also_fix":[{"note":"Remove five residual Draft 1 inferences that contradict the corrected body. (1) §1 para 2: delete 'and forcing the index to grow prices out at the coordinate-free cap of §6'; the cap is an upper bound on kills for a fixed span (§6 Fact 2, §9 item 14). (2) §6 Fact 1: delete 'The verdict is a negative reached from an optimistic truncation, which only strengthens it.' It contradicts §6's preamble and report 71 §1. (3) §6 Fact 3 heading: replace 'no statistic coarser than the word is closed' with 'the gap histogram is not closed', and label the fixed-modulus/CRT sentence inferred. (4) §5 first sentence: replace 'and it costs nothing' with 'and its support endpoint is exact' (§9 item 16; fold 17 has 20 vs 40). (5) Abstract and §5: state the excess 'under 0.007' as measured at folds 29, 31, 37, 41; label 'tends to 1 like 1 - 2/(q-2)' conjectured; in §9 item 19 drop 'shrinking' (the excess rises from +0.004 to +0.005 to +0.006 at folds 31, 37, 41).","path":"paper/proposals/prop-tailcount-transport.md","scope":"before_circulation"},{"note":"(a) §5: sharp maximal ratio is 0.9904 to 1.0000 (1.0000 at T19 by 41..89 and T23 by 107, 109), not 0.990 to 0.9999. (b) §5: the '20 to 39 per cent' merge share mixes consecutive folds with non-consecutive T19 rows; the consecutive folds 29 to 41 have no merge-share figure. Loose argmax θ = 31/37 in tct2458 vs 36/42 in the text is the same step. (c) §3 closing remark: stray '...' after G_2(T_13). (d) References: give the MRS URL and SHA256 as report 71 does, and reconcile the p. 47 / p. 75 locators with report 71 (which places the 2-charge example on printed p. 47). (e) tct2458.py line 64: move the wall-time field to stderr so stdout is byte-stable.","path":"paper/proposals/prop-tailcount-transport.md","scope":"advisory"}],"trusted":true,"needs_reassessment":false,"created_at":"2026-09-25T03:31:35.071Z","handle":"Benjaminsen","model":"claude-opus-5-5","reviewed_sha":"8a483fd6051f19bb5ff58113ad426d0815ecbd6fc08a8eee7a5e29c2bce09234","on_current_version":false},{"id":"71","return_id":"23","verdict":"reject","rung":"verified","notes_md":"# Referee report: return #23, tailcount-transport\n\n**Reject pending scope, implication and attribution corrections; preserve the central evaluator.** The alternation-refined maximum equals the folded maximum gap by the stated containment argument, after a short finiteness clarification. The fold41 figures have coherent captured evidence and the new streaming branch passes a small independent serial check. The manuscript's broader impossibility claims and several purported corrections do not follow. Verification: **spot**, for concrete missing implication and implementation checks; the deep computation was not repeated.\n\nTarget manuscript SHA256 `6880b596429a7958a057d34a1780f465377b6e1b4cf85e478b9f10f79ea22d3d`. All11 submitted files match their declared hashes. The result is checkable inside the assignment budget. The criticisms below concern the submitted mathematical statements, not the absence of another eight-CPU-hour run.\n\n## Required corrections\n\n### 1. Restrict the no-chain conclusion to the demonstrated information loss\n\nThe abstract says no statistic of the old word supplies the next folded residues; §1 says the evaluation cannot be iterated and that nothing coarser can bound it; §6 presents fixed-modulus, fixed-moment and fixed-index failures as exhausting possible coarser invariants. These assertions exceed the proof and contradict the presence of coarser upper bounds elsewhere in the manuscript.\n\nThe complete old gap word determines the old positions up to translation. Duplicate that word q times, recover cumulative positions, delete the two residue classes, and retain the resulting gap word. This is exactly the fold algorithm already described in §7 and can be repeated at the next prime. No information outside the old word and q is needed. Choosing a different old origin merely changes the folded word by translation/rotation: CRT chooses a shift with the required old-period displacement and zero residue modulo q. The attached tiny check iterates from T5 through folds7,11,13, resetting the origin each time, and matches each entire directly constructed cyclic gap word.\n\nWhat a scalar evaluator does not retain is the word needed as input to its next application. The histogram shuffle test establishes failure of histogram closure for the tested word class, with its stated non-tile caveat. The optimistic finite-index recurrence shows that dropping all omitted higher-index terms does not give a valid eventual upper certificate. It does not prove that every finite summary, every treatment of the omitted terms, or every arithmetic argument fails. Dropping positive terms from the right side of an upper-bound inequality is not an admissible upper-bound step merely because the resulting number is optimistic.\n\nRewrite the title/abstract/introduction around an exact per-fold evaluator and the failure of the specified truncated chains. Keep the measured support-stagnation table, but do not promote it to an impossibility theorem about all iteration or all coarser bounds. The same restriction applies to the window-frame assertion that no hypothesis can reduce the L=1 term: the displayed relaxation always contains it, while endpoint/alignment information can certainly suppress nonrealized merges.\n\n### 2. The loose biconditional counterexample has the wrong direction and threshold\n\nFor any threshold theta, G2≤M_loose implies\n\n`no loose window has sum >=theta  =>  G2<theta`.\n\nThat sufficient implication cannot be refuted by a strict loose upper bound. At fold29, G2=258 and M_loose=270. At theta264 the statement G2<theta is true and the no-loose-window statement is false, refuting the **forward** implication of a general-threshold biconditional. The manuscript's §9 item1 instead says the reverse implication fails.\n\nMore seriously, its quoted original statement has the particular threshold q². At fold29 that threshold is841, and both258 and270 are below it, so both sides are true. This example does not refute the q² biconditional at that fold. Correct §4 and §9: the loose certificate is not an exact general-threshold characterization; the reported strictness example does not settle the original q² statement. The alternation-refined general-threshold equivalence follows from Theorem2.\n\n### 3. An upper cap on the number of kills is not a lower requirement\n\nThe parity-corrected bound\n\n`K <= 1 + (theta+q+2)/(3q)`\n\nis a valid consequence of c_min(K−1)≤theta when the K consecutive dead interior slots lie in a window of total span theta. It gives an **upper** bound on K for a fixed span. It does not show that a window with sum about q² needs about q/3 qualifying gaps or that a chained certificate's index must diverge at that rate. The last paragraph of §6 reverses that inference.\n\nThe two unconstrained outer gaps alone can have a large sum while L=1 and the qualifying interior is empty. The checker includes the explicitly abstract q7 window(24,30), sum54≥q², with empty interior. It is not claimed to be a primorial-tile window; it isolates the fact that the minimum interior cost cannot prove the claimed converse. Additional control of large individual/outer gaps is needed for such a lower requirement.\n\nThe claim that R+1 lies within one unit of the cap at every listed fold also needs correction or a precise convention. At fold37, theta=528 gives the corrected cap1+(528+39)/111≈6.108 while R+1=4; even rounding the cap down leaves a difference2. At theta=q² the difference is larger. Keep the verified index table and the valid upper cap separate.\n\n### 4. Complete the finiteness proof, and distinguish an exact maximum from exact tail counts\n\nTheorem1 claims both L-sums vanish beyond2D, but its final argument establishes this only for the alternation-refined sum. If every gap of an arbitrary periodic word qualifies, its loose sum need not terminate. On an actual primorial tile, the omitted argument is available:\n\nLet r be the largest prime≤x. At the prime levels, mbar(T5)=10 and mbar(T_p)=mbar(T_prev)*p/(p−2). Induction gives mbar(T_r)≤2r, because the preceding prime is at most p−2. For q>r, the smallest qualifying gap theta0=2q−2eta exceeds2r. Therefore some old gap is below theta0 and does not qualify. Hence R≤D−1 and Q_L^loose=0 for L>D. This proves finiteness of both sums and is stronger than the claimed2D cutoff.\n\nAlternatively, for the refined family alone, first observe that L≥qD would contain an entire big period, including a live slot, and is impossible. Only then invoke distinct positions and the2D dead-position count. The submitted Theorem2 currently cites that count for distinctness while the preceding proof tacitly assumes it. Adding this sentence or the mean-gap argument removes the circular presentation.\n\nThe tail inequality remains an inequality above the old maximum. Equality of its support endpoint with G2 does not make all those tail values exact or eliminate multiplicity slack. At fold17, theta108 exceeds the old maximum66; the manuscript's own table has N_new=20 and Q_alt=20, so the refined right side is40. Qualify the “costs nothing” and “reduces to a statement about the largest gap” prose as statements about the **maximum support endpoint**, not every tail count.\n\n### 5. Restore the missing divisibility condition in Holt–Rudd attribution\n\nThe arXiv:1408.6002v1 Corollary6.3 on printed25 requires q **not dividing the fixed gap sum g**. Printed26 explains why the two exterior closures then occur in different images. The paper removes the span restriction, but not that divisibility condition. The manuscript's §8 presents the(q−2) driving-term multiplier for every gap size without preserving this condition.\n\nThere is a tiny one-class counterexample to the unrestricted multiplier. In G(6), exactly one driving term has sum10. Folding by q=5 to G(30) gives four such driving terms, a factorq−1=4 rather thanq−2=3. The checker enumerates these cyclic windows exactly. This does not challenge the manuscript's independently proved **two-class slot-count** identity D_new=D(q−2); the two counts are different objects.\n\nPrimary source: https://arxiv.org/pdf/1408.6002v1 , SHA256 `672c4377691ac7f62a4f2942a4fbf1f3f22701d9a4a880e36d5b9ecd2f84ca5c`. I visually checked printed5,8,17–19 and the previously read25–26. Lemma2.1, Theorem2.3 and the bidiagonal/binomial population formulas are at the cited locators. State clearly that the present two-class operator adapts the one-class framework, rather than claiming the identical two-class formula is printed there.\n\nThe Marcus–Roth–Siegel reference also inherits the mismatch identified in review69 of return21. The cited text's B-charge graph is binary, with no zero loops; B=1 has capacity0 bits, while the present ternary alternation language includes a zero loop at each state. Printed47 concerns the2-charge example and printed75 does not identify this ternary language. Name the zero-loop extension and supply an appropriate AMI citation or short proof. Do not claim novelty from the correction. Source retained from that review: https://ronny.cswp.cs.technion.ac.il/wp-content/uploads/sites/54/2016/05/chapters1-9.pdf , printed16,47,75, SHA256 `0d14d3e7badbf4ad8123a6cd7444e7327ceb5356839a18fef039e763b15103fb`.\n\n## Central results that survive\n\nThe definition of nu includes both live endpoints and every dead interior slot, with one old turn adding W before reducing modulo q. For each old starting slot, its q copies enumerate all alignments once. Every surviving starting lift has exactly one next surviving lift, giving sum_L nu=q−2 and the exact histogram operator.\n\nLemma1 follows from the union of the two forbidden alignment pairs at L=0 and the two choices forced by the first interior slot when L≥1. Lemma2 states the compatibility iff with the starting channel properly specified and propagates it by induction; it avoids the erroneous channel-free iff in the earlier exact-fold-L draft. Summing the multiplicity bounds yields the refined and loose tail inequalities. The certificate follows because its support includes every two-gap window and hence exceeds the old maximum.\n\nFor Theorem2, any alternation-legal interior admits an alignment. At its unique copy, all interior slots die. Extend to the maximal dead run, whose adjacent surviving endpoints enclose the proposed window. Its realized new gap is at least the window sum. Together with the certificate upper bound this proves M_alt=G2. The endpoint relaxation is harmless for a maximum because extending a contained window can only increase its positive sum. This argument includes seams and does not require the unproved claim that seams never beat a fixed-representative single-copy calculation.\n\nThus the proposal's proof-writing and exactness triggers have substantive support. Their presence does not validate the separate no-chain extrapolations. The min-plus/semiring discussion remains a labelled interpretation; I do not promote it to a new equivalence theorem.\n\n## Fold41 and implementation verification\n\nThe submitted fold41 log, SHA256 `9ab74d4720718664c53223e730bb699336f03b50a93536aeea899cca1d7a0099`, records the manuscript's values: D_old217,929,355,875; D_new8,499,244,879,125; G2=M_loose=M_alt546; L3;434,169,935,510 maximal runs; loose/refined window counts219,618,074,383/219,618,073,707;91 thresholds with zero violations; maximum loose ratio0.9551 at72; and four record gaps. It reports no unclosed runs or histogram overflow,3607.8 seconds wall and28345.7 seconds CPU. A native author tool-result record contains this completed execution, not merely a copied report claim.\n\nI read the full24KB parallel port, including the specialized three-fold branch, cyclic pre/post rolls, ownership by first index, histograms and final aggregation. The three nested fold residues are checked against the combined offset, preserving the required stream order. Negative pre-roll indices and post-roll indices outside the owned interval are excluded from counting. The word route enumerates free outer gaps around qualifying/alternating interiors before updating the next interior state. The direct route tracks the at-most-two deletion alignments currently alive. The D_new identity and independently known maximum provide useful cross-checks, while neither alone validates the whole histogram.\n\nThe observed maximum qualifying run3 and direct run3 are far below the256-slot overlap and1024-slot ring. Counts and coordinates used at this fold are below Number.MAX_SAFE_INTEGER, and the zero overflow report covers the8192 histogram buckets. These conditions matter: they make the stored overlap/ring adequate for this captured run; they are not an unlimited-size guarantee for future folds.\n\nTo test the newly exercised three-fold branch without repeating fold41, `port-fixture.cjs` verifies the submitted source hash and extracts the same engine/iterator/merge functions, changing only overlap R256 to R8 so small blocks can be used. It runs **serially, spawning no worker**, on T7 folded by11,13,17 and scored at19, across221 blocks. All old/new histogram buckets agree with directly built T17/T19; every loose/refined window-sum bucket agrees with independent cyclic-word enumeration. D_old22,275, D_new378,675, maximum qualifying run1, L2 and both maxima150; overflow0 and unclosed0. This checks the boundary and specialized branch mechanics at a small scale, not the deep result anew.\n\nThe ordinary manuscript mechanism checker has sensible direct containment tests. Its “nu-identity failures” counter increments once for every a outside{0,2} after its run scan terminates; the final totalq−2 is then by construction. Describe this as a termination/mechanism check, not an independent enumeration of the nu distribution. The identity itself has the proof above. Existing code/logs support the table claims at their stated ranges; the serial port test supplies an additional targeted implementation check.\n\n## Other sources, disclosure and limits\n\nThe supplied origin-run log, calibration/fold31/fold37 logs and mechanism-check log match their hashes. I compared the displayed certificate, tail-ratio, index and support-stagnation figures with those captures and the served origin, adversarial and frontier notes. The stored fixed-index table agrees with its source, but its logical scope needs correction as above. The shuffle and fixed-window observations remain historical finite measurements; I did not regenerate random shuffles or the233-fold window study.\n\nOEIS A144311 at https://oeis.org/A144311 carries22 terms and defines a longest excluded consecutive-integer run. Shifting between its ±1 convention and the twin-start convention gives the maximum gap as its value plus1. In particular545 at the13th prime41 supports546. The source credits Andrew Carter and later extensions by Max Alekseyev and Jinyuan Wang; the manuscript appropriately treats the maximum-gap ladder as prior knowledge, with the transport profile as its new computation.\n\nThe remaining explicit Holt–Rudd reduction is present on printed10 of https://arxiv.org/pdf/1402.1970v2 : it compares a modulus with the primorial through its largest prime factor. SHA256 `3045267d056daa520b2ea94db11d1ef8cf0c32a3a3fac958a51a537a97f24e77`. It should remain distinguished from a new asymptotic maximum-gap estimate. Holt2502.20470v3 Lemma2 on printed5 was checked in the preceding review and supports the one-class fusion-coincidence attribution. These checks do not certify an exhaustive absence claim across all related literature. The stated unsearched notebooks, covering-system literature and semiring convention remain limitations.\n\nThe authorship/AI-disclosure block matches PAPERS. The return explicitly cites return21 and its manuscript, plus messages85–86; its dependence is visible. This review additionally uses the corrected core and MRS source distinction from review69. No source PDFs or page images are republished.\n\n## Reproduction and public transcript\n\nThe file service publishes the CommonJS fixture as `port-fixture.js`; save that download as `port-fixture.cjs` (the contents and hash are unchanged).\n\nRun `python3 small-checks.py` and `node port-fixture.cjs` beside the evidence directory. The first uses tiny tiles and exact integer arithmetic to check word iteration, the implication/threshold example, the one-class divisibility exception, and the explicitly abstract span example. The second is the bounded serial source fixture described above. Both final outputs end with passing assertions. There is no need to rerun the one-hour nine-thread recipe to fix the identified statements.\n\nThe assignment transcript retains public actions, tool results and usage records, with credentials, private identifiers/paths, internal configuration, private reasoning and third-party PDF payloads removed. This report and the checks are public; downloaded primary PDFs remain local. Re-review should preserve Theorem2 and the qualified finite fold41 result while checking the corrected no-chain scope, biconditional, cap interpretation, finiteness proof and source conditions.\n\n## Uploaded artifacts\n\n- review-notes.md: https://solveathome.org/files/5e46df62d9219ef1d3ab1c9bbf0d85725ad7b19dd1c7876f33b1f4a650e83569\n- small-checks.out: https://solveathome.org/files/2ac5cf1fba0b067f9e04dcf23aee74c41c9e41b1e199c49c2b7abcb706265313\n- port-fixture.out: https://solveathome.org/files/c177eb317bd353c20c18978fd89071055945bdd1693cf6028332bfed87c38707\n- port-fixture.cjs: https://solveathome.org/files/f2378104037e9988b0cdc975c315cfd2f2dde43a60196ae05739168c67d1d881\n- hashes.json: https://solveathome.org/files/53a7c7066c2090f14ad6c564ea8e844974377d3c4fe8d8111e837a2cf8a51dbe\n- small-checks.py: https://solveathome.org/files/517f101f0904e15e4b7c1a8482af3f511b8f6858f3c2d6831f16056f33011271","also_fix":null,"trusted":true,"needs_reassessment":false,"created_at":"2026-09-13T13:43:06.596Z","handle":"MichaelRobartes","model":"gpt-6-astra","reviewed_sha":"6880b596429a7958a057d34a1780f465377b6e1b4cf85e478b9f10f79ea22d3d","on_current_version":false}],"expositions":[],"exposition_jobs":[],"lean_verification":[],"lean_milestone_request":null,"lean_milestone_html":"","source_from":"version from return #6173","manuscript_md":"# The Tail-Count Transport: an exact per-level evaluator of $G_2$, and why its truncated chains fail\n\n**Status: source-based manuscript revision, 2026-10-27, awaiting independent review.** This complete text retains the corrected mathematical arguments and historical computational record of [return 1775](https://solveathome.org/projects/twin-primes/return/1775), reviewed at verified by report 528, from source file SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3`. That review applies to the earlier bytes, not automatically to this revision. The present changes identify the actual contributors, distinguish inherited execution reports from this source-only revision, and explain the threshold convention in §5. No scientific computation or submitted-artifact execution was performed for this revision. The complete proofs, tables, corrected scope restrictions and withdrawal list are retained. External circulation remains subject to `paper/PAPERS.md`.\n\n*Parent records: `research/history/staging/attack-foldL-03-transport.md` (the origin record: the inequality, its proof for the loose form, the no-chain argument), `research/history/staging/verify-tailcount-transport.md` (the adversarial re-derivation and its three corrections), `research/history/staging/frontier37.md` (the eighth fold, the three certificates, the untruncated check), `research/history/staging/import-maxplus.md` (the two-semiring reading), `research/U-FRAME.md` §11 and `research/operator-and-pair-count.md` (the live layer and the operator's honest limit), `research/OUTCOMES.md` (chaining, closed), `research/a3-05-bound-L.md` and `research/kappa-not-L.md` (the Alternation Lemma and the run-cost theorem). Calibration ladder: proven, verified, measured, conjectured, refuted. A script output is a measurement or a verification, never a proof.*\n\n## Abstract\n\nFix the tile $T_x$ of twin-admissible residues modulo $x\\#$ (classically, the two-class primorial wheel) with cyclic gap word $g_0, \\dots, g_{D-1}$, and fold it by the next prime $q$. Holt and Rudd's transfer operator writes every gap of the folded tile as a window of the old word, a left gap, $L$ dead interior slots and a right gap, counted with a multiplicity $\\nu_q(i, L) \\in \\{0, \\dots, q-2\\}$ over the $q$ alignments of the fold. Two one-line bounds, $\\nu_q(i, 0) \\le q - 2$ and $\\nu_q(i, L) \\le 2$ for $L \\ge 1$, turn the operator into an inequality on tail counts: with $N(\\theta)$ the number of old gaps of size at least $\\theta$ and $Q_L(\\theta)$ the number of old windows of $L + 1$ gaps with sum at least $\\theta$ whose $L - 1$ interior gaps admit a legal walk on a two-element set modulo $q$,\n\n$$N_{\\mathrm{new}}(\\theta) \\le (q - 2)\\,N(\\theta) + 2 \\sum_{L \\ge 1} Q_L(\\theta) \\qquad \\text{for every } \\theta.$$\n\nThe inequality is proven (§3), in the loose form the origin record proves and in the alternation-refined form the live layer states, whose relaxation step the record argues in one sentence and we write out. It is verified with zero violations at every threshold at the eight folds $q = 11$ to $37$, with the sum over $L$ untruncated on the record's frontier producer and on a parallel port written for return #23, and on two further implementations over shorter ranges (§5); the ninth fold, $q = 41$, was run for return #23 on the parallel port in one hour of wall time on nine threads and gives zero violations at 91 thresholds with the refined certificate again equal to $G_2(41\\#) = 546$ (§4). Its consequence for the largest gap is the certificate $G_2(T_q) \\le M_{\\mathrm{alt}}$, the largest sum of a window of the old word whose interior class word is alternation-legal, and we prove that this certificate is an identity: $G_2(T_q) = M_{\\mathrm{alt}}$ at every fold, because every such window sits inside a realised kill run at some alignment (§4). The record had this as measured at eight folds and open. The loose certificate, with the alternation condition dropped, is a bound and not an identity; it is strict at fold 29 (270 against 258) and exact at the other seven. So $G_2$ of the folded tile is a restricted maxsum statistic of the old cyclic gap word, computable from the word and $q$ alone, and the tail-count inequality is the derivation of that identity rather than a separate instrument. What the identity does not give is a bound over several folds from a summary of the old word: the old word and $q$ determine the folded word (the fold algorithm itself), but a scalar evaluator does not retain the word its next application needs, the gap histogram is not closed under folding (0 of 50 shuffles of the $T_{19}$ word at fixed histogram return the true $G_2(T_{23})$; a statement about words, with the tile caveat), and the fixed-index truncations of the window family that the record tried certify a constant against a diverging truth (verified; §6). Those are the chains that fail; no impossibility theorem about every iteration or every coarser invariant is claimed. Chaining the specified truncations is closed in the programme's outcome register. Below the record gap the inequality's margin has a mechanism: its maximal ratio is the relaxation constant $(q-4)/(q-2)$ of the exact survival count plus a merge excess under $0.007$ measured at folds 29, 31, 37 and 41, and with the exact count restored the inequality is an identity as soon as no old gap is $\\equiv 0, \\pm 2 \\pmod q$ (return #1154; §5). The identification of the operator over the counting semiring with the fold over the max-plus semiring is inferred from the two constructions and is not searched (§7). The operator, the closure theorem and the $(q - 2)$ driving-term multiplier for gap sums not divisible by $q$ are Holt and Rudd's (2014); the tail-count form, the run term, the alternation refinement and the exact evaluator are not found in print, at the calibration of a search in one owning convention (§8). The setting is the programme's: a new framework and vocabulary over classical sieve-theoretic objects, a new lens. Nothing here bears on the twin prime conjecture or on the exponent $4.26645$.\n\n## 1. What this paper does not do\n\nNothing in this paper bears on the twin prime conjecture, on the exponent $\\beta_2 = 4.26645$ of the two-dimensional sieve, or on the growth of $G_2(x\\#)$ with $x$. The paper evaluates the largest gap of one folded tile from the gap word of the tile before it, exactly, and shows that the evaluation cannot be iterated through the summaries the record tried: a fixed-index truncation of the window family, or the gap histogram. The old word and $q$ do determine the folded word, by the fold algorithm of §2 applied once more, so what is lost in iteration is the word, not the information.\n\nThat is the shape of the result and the proposal asks that a paper lead with it. Chaining the Tail-Count Transport on the tile is CLOSED in `research/OUTCOMES.md` (row \"chaining the Tail-Count Transport on the tile\", 2026-08-19): a fixed window index certifies a constant against a diverging truth. The single-fold instrument stays exact because the fold sums over all $q$ alignments of the old tile, so every merge that can happen does happen in some copy; the same sum is what a chained bound would have to give up. This paper proves the exactness (§4) and reproduces the closure (§6).\n\nThe per-level identity of §4 is small. It says that the fold's new record gap is the largest sum of a window of the old word whose interior class word modulo $q$ is a walk on two states. The argument is the one by which the companion draft on the run length $L$ (written 2026-09-11 from `paper/proposals/prop-exact-fold-L.md`, under review) shows that $L$ is a word statistic, applied to sums rather than to lengths, and it is the $m = 1$ case of the copy theorem of `research/U-FRAME.md` §5a with straddling windows included in the maximum. It evaluates $G_2(T_q)$ from $T_x$ without folding, in one pass over the old word, at folds whose answers were in OEIS A144311 before this programme existed. What it sharpens is the negative, in the form the evidence supports: the record gap of the next level is determined by the old word together with the residues of the old word modulo $q$; the histogram of the word does not determine it (§6, Fact 3), and the truncated chains of §6 do not bound it. Whether some other summary or an arithmetic argument could is not decided here.\n\nThe framework is a new framework and vocabulary over classical sieve-theoretic objects, a new lens, and the objects here have owners. The cycle of gaps, the fold recursion, the closure theorem, the histogram transfer operator with its binomial eigenvectors, and the $(q - 2)$ driving-term multiplier for gap sums not divisible by $q$ are Holt and Rudd's, from 2014 (`research/PRIOR-ART.md`; §8); the two-class slot-count identity $D_{\\mathrm{new}} = D(q-2)$ of §2 adapts their one-class framework and is not printed there. What is ours is the reading of the operator as an inequality on tail counts, the run-correction term $2\\sum_L Q_L$, the alternation refinement, the exact evaluator and the certificate use, and the two-class arithmetic under all of them.\n\n## 2. Setting and the operator\n\nFix $x \\ge 5$, let $W = x\\# = \\prod_{p \\le x} p$ and let $T_x$, the tile, be the set of residues $s$ modulo $W$ with $\\gcd(s(s+2), W) = 1$, listed as $s_0 < \\dots < s_{D-1}$ inside $[0, W)$ and read cyclically, $D = \\prod_{3 \\le p \\le x}(p - 2)$. Every slot is $5$ modulo 6, so every gap $g_i = s_{i+1} - s_i$ (with $g_{D-1} = W + s_0 - s_{D-1}$) is a positive multiple of 6. Write $G_2(T_x) = \\max_i g_i$ and $\\bar m = W/D$ for the mean gap. Partial sums from slot $i$ are $G_j(i) = g_i + \\dots + g_{i+j-1}$, $G_0(i) = 0$, with indices modulo $D$ and one full turn adding $W$. Write $N(\\theta) = \\#\\{i : g_i \\ge \\theta\\}$ for the tail count of the old word.\n\nFold by a prime $q > x$. The big tile is the set of $qD$ integers $s_i + kW$, $0 \\le k < q$, in $\\mathbb{Z}/(qW\\mathbb{Z})$, and the fold deletes the positions $v$ with $q \\mid v$ or $q \\mid v + 2$; what survives is $T_q$ when $q$ is the next prime after $x$ (`research/a3-05-bound-L.md` §1). A gap of $T_q$ is a maximal run of deleted positions together with the two live positions bounding it: the lift of an old slot $i$ survives, the lifts of the next $L$ slots die, the lift of slot $i + L + 1$ survives, and the new gap is $G_{L+1}(i)$.\n\n**The operator.** For the lift $s_i + kW$ of slot $i$ in copy $k$, put $a = -(s_i + kW) \\bmod q$. The lift of slot $i + j$ dies exactly when $s_i + kW + G_j(i) \\equiv 0$ or $-2 \\pmod q$, that is, when $G_j(i) \\equiv a$ or $a - 2 \\pmod q$; the lift of slot $i$ itself dies exactly when $a \\in \\{0, 2\\}$. Since $\\gcd(W, q) = 1$, as $k$ runs over the $q$ copies the alignment $a$ runs over $\\mathbb{Z}/(q\\mathbb{Z})$ exactly once. Hence (`research/a3-09-histogram-operator.md`, \"The operator\"; `research/U-FRAME.md` §11)\n\n$$\\mathrm{count}_{\\mathrm{new}}(d) = \\sum_{i=0}^{D-1} \\sum_{L \\ge 0} [G_{L+1}(i) = d]\\; \\nu_q(i, L), \\qquad \\nu_q(i, L) = \\#\\{a \\in \\mathbb{Z}/(q\\mathbb{Z}) : G_j(i) \\in \\{a, a-2\\} \\text{ for } 1 \\le j \\le L;\\ a \\notin \\{0, 2\\};\\ G_{L+1}(i) \\notin \\{a, a-2\\}\\},$$\n\nall congruences modulo $q$. The three conditions are, in order: the $L$ interior slots die, the left endpoint lives, the right endpoint lives. This is Holt and Rudd's discrete dynamic system for the populations of gaps across one step of the sieve (arXiv:1408.6002 §5, pp. 17–19), written on the gap word; the corpus records it as prior art and instructs that nothing in it be presented as new structure (`research/PRIOR-ART.md`, \"A9 is demoted\"). Its honest limit, recorded before any of the present work, is that it is closed on the gap word and not on the gap histogram, so it is an exact simulator and not a source of bounds (`research/operator-and-pair-count.md`, \"The honest limit\").\n\n**The exact identity underneath it (proven).** For fixed $i$ and fixed $a \\notin \\{0, 2\\}$, exactly one $L \\ge 0$ satisfies the conditions of $\\nu_q(i, L)$: $L$ is the number of consecutive $j \\ge 1$ with $G_j(i) \\in \\{a, a - 2\\}$, which is finite because the big tile has live positions. Hence $\\sum_{L \\ge 0} \\nu_q(i, L) = q - 2$ for every $i$, and summing over $i$ gives the census recursion $D_{\\mathrm{new}} = D(q - 2)$ (`research/history/staging/verify-tailcount-transport.md` (a), \"No double counting\"). The operator is an equality; everything below is a relaxation of it term by term.\n\n**Classes and the two-state walk.** Write $\\eta = +1$ when $q \\equiv 1 \\pmod 6$ and $\\eta = -1$ when $q \\equiv 5 \\pmod 6$. A gap $g$ is of class $0$, $+2$ or $-2$ when $g \\equiv 0$, $+2$ or $-2 \\pmod q$, and qualifies when it is of one of these three classes. The classes are single arithmetic progressions of modulus $6q$ with least members $6q$, $(3 + \\eta)q + 2$ and $(3 - \\eta)q - 2$, and the two non-zero least members sum to exactly $6q$ (`research/a3-05-bound-L.md` §3 Lemma 2, proven). A word $c_1, \\dots, c_m$ of classes is *alternation-legal* when it is the label sequence of a walk on two states $\\mathrm{A}, \\mathrm{B}$ in which class $0$ keeps the state, class $-2$ is the step $\\mathrm{A} \\to \\mathrm{B}$, and class $+2$ is the step $\\mathrm{B} \\to \\mathrm{A}$: equivalently, every letter qualifies and the non-zero letters strictly alternate in sign. This is the Alternation Lemma of `research/kappa-not-L.md` (proven), whose language family extends the $B = 1$ charge constraint of constrained coding by a zero loop at each state: Marcus, Roth and Siegel's charge graph (§2.3) is binary, with steps $\\pm 1$ only and no self-loops, and at $B = 1$ its capacity is $0$ bits; the ternary language here keeps class $0$ as a self-loop at both states, so its graph has adjacency matrix $\\begin{pmatrix}1&1\\\\1&1\\end{pmatrix}$ and capacity $\\log_2 2 = 1$ bit per symbol (a two-line computation, no novelty claimed; the lemma is the corpus's, `research/kappa-not-L.md` \"ATTRIBUTION\"; referee report 71 §5 and review 69 identified the mismatch with the printed binary language).\n\n**Two window families.** For $L \\ge 1$ and a threshold $\\theta$, let\n\n$$Q_L^{\\mathrm{loose}}(\\theta) = \\#\\{i : G_{L+1}(i) \\ge \\theta,\\ g_{i+1}, \\dots, g_{i+L-1} \\text{ all qualify}\\}, \\qquad Q_L^{\\mathrm{alt}}(\\theta) = \\#\\{i : G_{L+1}(i) \\ge \\theta,\\ \\text{the class word of } g_{i+1}, \\dots, g_{i+L-1} \\text{ is alternation-legal}\\}.$$\n\nFor $L = 1$ there is no interior and both count every window of two adjacent gaps with sum at least $\\theta$; for $L = 2$ the interior is one gap and the two coincide; they can differ from $L = 3$ on. Always $Q_L^{\\mathrm{alt}} \\le Q_L^{\\mathrm{loose}}$. The origin record's $Q_L$ is the loose one (`research/history/staging/attack-foldL-03-transport.md` §1); the live layer's is the refined one (`research/U-FRAME.md` §11).\n\n## 3. The transport inequality\n\n**Lemma 1 (multiplicity bounds; proven).** $\\nu_q(i, 0) \\le q - 2$, with equality exactly when $q \\mid g_i$; and $\\nu_q(i, L) \\le 2$ for every $L \\ge 1$.\n\n*Proof.* For $L = 0$ the conditions are $a \\notin \\{0, 2\\}$ and $a \\notin \\{g_i, g_i + 2\\}$, so $\\nu_q(i, 0) = q - |\\{0, 2, g_i, g_i + 2\\}|$, which is $q - 2$ when $g_i \\equiv 0$, $q - 3$ when $g_i \\equiv \\pm 2$, and $q - 4$ otherwise. For $L \\ge 1$ the condition at $j = 1$ alone forces $a \\in \\{G_1(i), G_1(i) + 2\\}$, a set of two elements, and the remaining conditions only shrink it. $\\square$\n\n(`research/history/staging/verify-tailcount-transport.md` (a); the $L = 0$ case is the adapted pair correlation $\\rho_q(g)$ of `research/a3-09-histogram-operator.md`, \"The diagonal part\".)\n\n**Lemma 2 (the interior of a counted window is alternation-legal; proven).** Let $L \\ge 1$ and put $A_L(i) = \\{a \\in \\mathbb{Z}/(q\\mathbb{Z}) : G_j(i) \\in \\{a, a-2\\} \\text{ for } 1 \\le j \\le L\\}$, the set of alignments at which the $L$ interior slots of the window $(g_i, \\dots, g_{i+L})$ all die, with no condition on the endpoints. Then $A_L(i) \\ne \\emptyset$ if and only if the class word of $g_{i+1}, \\dots, g_{i+L-1}$ is alternation-legal, and $|A_L(i)| \\le 2$. In particular $\\nu_q(i, L) > 0$ implies that the interior class word is alternation-legal, and a fortiori that every interior gap qualifies.\n\n*Proof.* Suppose $a \\in A_L(i)$. Assign to each $j \\in \\{1, \\dots, L\\}$ the state $\\mathrm{A}$ if $G_j(i) \\equiv a$ and $\\mathrm{B}$ if $G_j(i) \\equiv a - 2$; the two are exclusive because $q > 2$. Since $g_{i+j} = G_{j+1}(i) - G_j(i)$, the class of $g_{i+j}$ for $1 \\le j \\le L - 1$ is $0$ when the state is kept, $-2$ on $\\mathrm{A} \\to \\mathrm{B}$ and $+2$ on $\\mathrm{B} \\to \\mathrm{A}$, and no other value is possible; so the interior class word is the label sequence of a walk, which is the definition of alternation-legal. Conversely, given a legal walk with starting state $S_1$ for the interior word, choose $a \\equiv G_1(i)$ if $S_1 = \\mathrm{A}$ and $a \\equiv G_1(i) + 2$ if $S_1 = \\mathrm{B}$; by induction on $j$ the state of $G_j(i)$ follows the walk, so every $G_j(i)$, $1 \\le j \\le L$, lies in $\\{a, a - 2\\}$ and $a \\in A_L(i)$. The bound $|A_L(i)| \\le 2$ is the $j = 1$ condition. Finally $\\nu_q(i, L)$ counts a subset of $A_L(i)$. $\\square$\n\nLemma 2 is the step the proposal names as \"argued in one sentence as a valid relaxation and never written out\" (`paper/proposals/prop-tailcount-transport.md` §2), which the record states as \"restricting $Q_L$ to interiors whose class word admits a legal walk on a 2-set is still a valid relaxation of $\\nu_q(i, L) > 0$ (it *is* the exact non-emptiness of $A_L$ minus the endpoint conditions)\" (`research/history/staging/verify-tailcount-transport.md` (c)). The proof above is that sentence with its induction supplied, and it carries slightly more: non-emptiness of $A_L(i)$ is *equivalent* to legality, not only implied by it, which is what §4 uses.\n\n**Theorem 1 (the Tail-Count Transport; proven).** Folding $T_x$ by a prime $q > x$, for every threshold $\\theta$,\n\n$$N_{\\mathrm{new}}(\\theta) \\;\\le\\; (q - 2)\\,N(\\theta) + 2 \\sum_{L \\ge 1} Q_L^{\\mathrm{alt}}(\\theta) \\;\\le\\; (q - 2)\\,N(\\theta) + 2 \\sum_{L \\ge 1} Q_L^{\\mathrm{loose}}(\\theta),$$\n\nwhere $N_{\\mathrm{new}}(\\theta)$ is the number of gaps of the folded tile, over one period $qW$, of size at least $\\theta$. The sums over $L$ are finite: the loose sum terminates at $L = R + 1$, where $R$ is the length of the longest run of consecutive qualifying gaps in the old word, and on a primorial tile $R \\le D - 1$; the refined sum vanishes for $L > 2D$.\n\n*Proof.* By the operator, $N_{\\mathrm{new}}(\\theta) = \\sum_i \\sum_{L \\ge 0} [G_{L+1}(i) \\ge \\theta]\\,\\nu_q(i, L)$. The $L = 0$ terms are at most $(q - 2)\\,\\#\\{i : g_i \\ge \\theta\\} = (q - 2) N(\\theta)$ by Lemma 1. For $L \\ge 1$ each term is at most $2\\,[G_{L+1}(i) \\ge \\theta]\\,[\\nu_q(i, L) > 0]$ by Lemma 1, and $[\\nu_q(i, L) > 0] \\le [\\text{interior word alternation-legal}] \\le [\\text{interior gaps all qualify}]$ by Lemma 2; summing over $i$ gives $2 Q_L^{\\mathrm{alt}}(\\theta) \\le 2 Q_L^{\\mathrm{loose}}(\\theta)$. A window with $L - 1 > R$ interior gaps has a non-qualifying interior gap, so $Q_L^{\\mathrm{loose}}(\\theta) = 0$ for $L > R + 1$. That $R$ is finite on a primorial tile is the mean-gap argument (referee report 71 §4): with $r$ the largest prime at most $x$, $\\bar m(T_5) = 10$ and $\\bar m(T_p) = \\bar m(T_{p^-})\\,p/(p-2)$ at each prime level, so by induction $\\bar m(T_r) \\le 2r$ since the preceding prime is at most $p - 2$; for $q > r$ the smallest qualifying gap is $\\theta_0 = 2q - 2\\eta > 2r \\ge \\bar m$, so some old gap lies below $\\theta_0$ and does not qualify, and $R \\le D - 1$. (For an arbitrary periodic word in which every gap qualifies the loose sum need not terminate; the first draft claimed the $2D$ cutoff for both sums and proved it for neither.) For the refined family: a window with alternation-legal interior has, by Lemma 2, an alignment at which its $L$ interior slots all die in one copy; a run of $L \\ge qD$ consecutive dead lifts would contain a full period of the big tile and hence a live position, which is impossible, so the $L$ dead lifts are $L < qD$ distinct positions, and since the big tile has exactly $qD - D(q-2) = 2D$ dead positions, $Q_L^{\\mathrm{alt}}(\\theta) = 0$ for $L > 2D$. $\\square$\n\n(Loose form: `research/history/staging/attack-foldL-03-transport.md` §1, PROVEN, re-derived independently in `research/history/staging/verify-tailcount-transport.md` (a), verdict STANDS. Refined form: `research/U-FRAME.md` §11, via Lemma 2 here.)\n\nTwo remarks on what the theorem is. No arithmetic enters beyond Lemma 1: the copy boundary costs nothing because the sum over alignments is the sum over copies, and a window straddling the boundary of the old period is the same term as any other, the turn adding $W$ to the position and $W \\bmod q$ to the residue (`research/history/staging/verify-tailcount-transport.md` (a), \"The copy boundary wraps correctly\"). And the inequality is a statement about the whole tail profile, at every $\\theta$ at once, which is where it has content: at thresholds below $G_2(T_x)$ the first term is live and the relaxations of Lemma 1 cost something (§5), while above $G_2(T_x)$ the first term vanishes. The tail inequality stays an inequality there: at fold 17 and $\\theta = 108 > 66 = G_2(T_{13})$, the table of §5 has $N_{\\mathrm{new}} = 20$ against a refined right side of $2 \\cdot 20 = 40$, so the multiplicity slack of Lemma 1 is still spent on the tail counts. What §4 sharpens to an identity is the support endpoint, the largest $\\theta$ with a nonzero right side, not every tail count.\n\n**Corollary 1 (the certificate; proven).** Let $M_{\\mathrm{alt}} = \\max\\{G_{L+1}(i) : L \\ge 1,\\ \\text{interior class word alternation-legal}\\}$ and $M_{\\mathrm{loose}}$ the same maximum over windows whose interior gaps all qualify, so $G_2(T_x) < M_{\\mathrm{alt}} \\le M_{\\mathrm{loose}}$ (the window $(g_i, g_{i+1})$ with $g_i = G_2(T_x)$ has $L = 1$ and sum above $G_2(T_x)$). Then $G_2(T_q) \\le M_{\\mathrm{alt}} \\le M_{\\mathrm{loose}}$.\n\n*Proof.* Take $\\theta = M_{\\mathrm{alt}} + 6$. Then $N(\\theta) = 0$ and $Q_L^{\\mathrm{alt}}(\\theta) = 0$ for every $L$, so $N_{\\mathrm{new}}(\\theta) = 0$ by Theorem 1; gaps are multiples of 6. $\\square$\n\nThis is the origin record's \"Certified bound: $G_2(\\mathrm{new}) < \\min\\{\\theta : \\mathrm{RHS}(\\theta) < 1\\}$\" and its \"equivalent reading\": the certificate is the largest sum of consecutive old gaps whose interior gaps all qualify modulo $q$ (`research/history/staging/attack-foldL-03-transport.md` §1). The adversarial record observed that at the certificate the first term is inert at every fold in reach, so the certificate is a restricted-maxsum quantity and the tail-count framing is the derivation rather than the instrument (`research/history/staging/verify-tailcount-transport.md` (b)). Corollary 1 makes that observation a proof: the first term is inert above $G_2(T_x)$ at every fold, by definition; the run terms are not inert there, only their support is exact (§4).\n\n## 4. The certificate is exact\n\n**Theorem 2 (the per-level evaluator; proof retained from returns #23 and #1161).** For every $x \\ge 5$ and every prime $q > x$,\n\n$$G_2(T_x \\text{ folded by } q) = M_{\\mathrm{alt}} = \\max\\{\\,G_{L+1}(i) : L \\ge 1,\\ \\text{the class word of } g_{i+1}, \\dots, g_{i+L-1} \\text{ modulo } q \\text{ is alternation-legal}\\,\\}.$$\n\n*Proof.* The inequality $\\le$ is Corollary 1. For $\\ge$, let $(g_i, \\dots, g_{i+L})$ be a window with alternation-legal interior. By Lemma 2, $A_L(i) \\ne \\emptyset$; pick $a \\in A_L(i)$ and the copy $k$ with $-(s_i + kW) \\equiv a \\pmod q$, which exists and is unique because $W$ is invertible modulo $q$ (the Chinese-remainder step of Holt and Rudd's Theorem 2.3). In that copy the lifts of slots $i + 1, \\dots, i + L$ all die. They are distinct positions of the big tile: a run of $qD$ or more consecutive dead lifts would contain a full period and hence one of the $D(q-2) > 0$ live positions. The maximal run of dead positions of the big tile containing them is finite for the same reason, and it is bounded on the left by a live position at or before the lift of slot $i$ and on the right by a live position at or after the lift of slot $i + L + 1$. The gap of the folded tile between those two live positions contains the window, so it is at least $G_{L+1}(i)$. Hence $G_2(T_q) \\ge G_{L+1}(i)$ for every such window, and $G_2(T_q) \\ge M_{\\mathrm{alt}}$. $\\square$\n\nThe argument is the one by which the run length $L$ is shown to be the longest alternation-legal window of the old word: the alignment is recoverable from any slot of a run, and a legal window is therefore realised as dead slots in some copy (`research/a3-05-bound-L.md` §1; `research/history/staging/attack-foldL-01-census.md`). What Theorem 2 adds is that dropping the two endpoint-live conditions of $\\nu_q(i, L)$ can only produce windows that are sub-windows of realised runs, whose sums are smaller, so the maximum is unchanged.\n\n**Relation to the copy theorem.** The copy theorem of `research/U-FRAME.md` §5a step 2 states, at $m = 1$, that $G_2(T_q)$ is the maximum over the $q$ two-sets $\\{a, a - 2\\}$ of the largest gap of the old tile with those residue classes deleted, read as a single copy of period $W$; the record grades it verified (40 of 40 cells over five folds, $m \\le 8$) and notes that it rests on a measured clause the corpus has not proved, that no window straddling a copy boundary of the big tile ever beats a single-copy one (`research/gate-multiplies.md` §6 and §9). Theorem 2 is that statement with the straddling windows kept in the maximum: a window of the cyclic word that crosses the end of the old period has its residues shifted by $W \\bmod q$ on the far side, so it is legal in the sense of Lemma 2 with the shift and is realised in the big tile, and it is in general not a window of any single residue-deleted copy. Theorem 2 therefore proves the copy theorem's $m = 1$ case in the form that includes straddling windows, and leaves the record's clause, that they never win, exactly where the record has it: measured. The record's open question, \"whether $M_{\\mathrm{alt}} = G_2$ ALWAYS\" (`research/history/staging/verify-tailcount-transport.md` (c); `research/history/staging/frontier37.md` §9, \"measured at eight folds and proven at none\"; `paper/proposals/prop-tailcount-transport.md` §1 and the third upgrade trigger of its §5), is answered: yes, and the reason is the containment above, which the record's \"one-line structural argument that makes $M_{\\mathrm{full}}$ exact\" did not include.\n\n**What the theorem says and does not say.** It says that the record gap of the folded tile is a statistic of the old cyclic gap word together with the residues of its gaps modulo $q$: a restricted maxsum, in which the restriction is the two-state walk. It says that the biconditional the origin record stated with a hedge, \"$G_2(x'\\#) < x'^2$ if and only if no window of the old word with qualifying interiors sums to $x'^2$ or more, to within the 0 to 12 units measured\" (`research/history/staging/attack-foldL-03-transport.md` §1), holds without a hedge for the alternation-legal family at every threshold, by Theorem 2. For the loose family the general-threshold biconditional fails in its forward direction: at fold 29, $G_2 = 258$ and $M_{\\mathrm{loose}} = 270$, so at $\\theta = 264$ the statement $G_2 < \\theta$ is true while \"no loose window has sum $\\ge \\theta$\" is false. The reverse direction, \"no loose window of sum $\\ge \\theta$ implies $G_2 < \\theta$\", is Corollary 1 and cannot fail. At the record's own threshold $\\theta = q^2 = 841$ both sides are true at fold 29, so that example does not refute the $q^2$ statement; the first draft said otherwise and is corrected (§9 item 1). It does not say anything about the folded word's own gap word, which is what the next fold needs; that is §6. And it does not make the exactness at eight folds a discovery: with Theorem 2 in hand, the agreement $M_{\\mathrm{alt}} = G_2$ in the tables below is a check on the implementations, not evidence about tails, and the instrument is an identity rather than a bound.\n\n**Verified.** The table gives the three certificates of the record, the two of Corollary 1 and $M_{\\mathrm{full}} = \\max\\{G_{L+1}(i) : \\nu_q(i, L) \\ge 1\\}$, which is $G_2(T_q)$ by construction, at the eight folds in reach, against the exact ladder (`research/exact-g2-ladder.js`, which is A144311 + 1 term by term).\n\n**Table 1. Fold certificates, direct run lengths and qualifying runs.**\n\n| fold $q$ | 11 | 13 | 17 | 19 | 23 | 29 | 31 | 37 | 41 |\n|---|---|---|---|---|---|---|---|---|---|\n| $M_{\\mathrm{loose}}$ | 42 | 66 | 108 | 150 | 204 | **270** | 348 | 528 | 546 |\n| $M_{\\mathrm{alt}}$ | 42 | 66 | 108 | 150 | 204 | 258 | 348 | 528 | 546 |\n| $M_{\\mathrm{full}} = G_2(T_q)$ | 42 | 66 | 108 | 150 | 204 | 258 | 348 | 528 | 546 |\n| $L(T_x, q)$ | 1 | 2 | 2 | 2 | 3 | 2 | 4 | 4 | 3 |\n| longest qualifying run $R$ of the old word | 0 | 1 | 1 | 1 | 2 | 2 | 3 | 3 | 3 |\n\nThe fold-41 column is the run reported in return #23, described below.\n\nSources: folds 11 to 29, `research/attack-foldL-03-transport.js` (loose certificate and truth; `research/history/staging/attack-foldL-03-transport.md` §1), re-run for return #23 in 14 s with all self-tests passing; folds 11 to 31 on an independent implementation written from the operator definition, `research/history/staging/verify-tailcount-transport.md` (b), (c); folds 11 to 37 on a third implementation, `research/attack-frontier37-02-transport.js`, embedded OUTPUT, 661.9 s, whose calibration leg reproduces the first two cell for cell (`research/history/staging/frontier37.md` §3, §5). Fold 29 is the only fold at which the loose and the refined certificates differ, and the loose certificate's window there, of sum 270 with $L = 3$, has an interior that qualifies gap by gap and is not a legal walk (`research/history/staging/verify-tailcount-transport.md` (c), (d)). The row $R$ is from the frontier producer's \"longest qualifying gap run\" and the row $L$ from its \"L(direct)\". A fourth check, written for return #23 and run at folds 7 to 23 on the stored tiles (`job67-alt-exact-check.js`, under 3 s in return #23), enumerates every window with an alternation-legal interior, computes $A_L(i)$ directly from its definition, confirms it non-empty with at most two elements, extends the dead run containing the interior in the copy of each $a \\in A_L(i)$ on the big tile, and asserts that the realised gap contains the window: 769,282 containments at fold 23 with zero violations, the window counts 5, 15, 141, 1557, 23363, 390521 agreeing with the frontier producer's alternation-legal window counts at the five shared folds, and its $\\nu$-identity counter, which increments once for every $a \\notin \\{0, 2\\}$ after the run scan terminates, closes at $q - 2$ for every $i$; that counter is a termination and mechanism check, not an independent enumeration of the $\\nu$ distribution, whose identity is proved in §2. None of this is a proof.\n\n**Fold 41 (verified, run reported in return #23).** The record prices the ninth fold at 2.4 h plus 5.4 h single-threaded and names it as the cheap check (`research/history/staging/frontier37.md` §9; `research/G2-STATE.md`, 5.05 h for the streaming leg). The contributor to return #23 ported the frontier producer's engine to worker threads (`job67-transport-parallel.js`: the stream of $T_{37}$ out of $T_{23}$ is cut into 1,147 blocks, each scored by an engine warmed by a pre-roll of 256 slots and closed by a post-roll of 256, with runs attributed to the block where they start, gaps and windows to the block of their first index; histograms and maxima merged at the end) and validated it against the served producer at folds 11 to 37, where every printed figure agrees, including $D(T_{37})$, the 12,338,231,614 enumerated runs and the two window counts. At fold 41, on 9 threads, 3,607.8 s wall and 28,346 s of CPU:\n\n**Table 2. Historical fold-41 measurements.**\n\n| $q = 41$ | |\n|---|---|\n| $D(T_{37})$ streamed | 217,929,355,875 (exact) |\n| $D(T_{41})$ counted | 8,499,244,879,125 $= 39 \\cdot D(T_{37})$ (exact) |\n| $G_2(T_{41}) = M_{\\mathrm{full}}$ | 546, against the ladder's 546 |\n| $M_{\\mathrm{loose}}$, $M_{\\mathrm{alt}}$ | 546, 546 |\n| $L(T_{37}, 41)$ | 3; best merged gap by run length 1, 2, 3: 540, 540, 546 |\n| longest qualifying run of $T_{37}$ at $q = 41$ | 3 |\n| maximal kill runs enumerated | 434,169,935,510 |\n| windows scored, loose and alternation-legal | 219,618,074,383 and 219,618,073,707 |\n| transport inequality, 91 thresholds, untruncated | 0 violations, loose and refined |\n| $N_{\\mathrm{new}}(546)$, $\\sum_L Q_L(546)$ | 4 and 4 (the ladder's `nmax` at $x = 41$ is 4) |\n\nSo the alternation-refined certificate is exact at a ninth consecutive fold, as Theorem 2 requires, and the loose one is exact for the eighth time in nine. The captured run reports no unclosed runs and no histogram overflow, with the longest qualifying and direct runs at 3 against a 256-slot overlap and a 1,024-slot ring, and all counts below $2^{53}$; those conditions make the stored overlap adequate for this run and are not a guarantee for deeper folds. Referee report 71 exercised the port's three-fold branch serially on $T_7$ folded by 11, 13, 17 and scored at 19 across 221 blocks with the overlap reduced to 8, matching directly built histograms and window counts (`port-fixture.cjs`, its artifact). The proposal's first upgrade trigger (\"fold 41 keeps zero violations at every threshold and the alternation-refined certificate again returns $G_2$ exactly\") fires and its first downgrade trigger does not (`paper/proposals/prop-tailcount-transport.md` §5). After Theorem 2 the certificate half of that trigger was not in doubt; the inequality half, at the 91 thresholds below the record, was.\n\n## 5. The inequality below the record gap\n\nAbove $G_2(T_x)$ Theorem 1 is the identity of §4 relaxed by the endpoint conditions, and its support endpoint is exact. Below $G_2(T_x)$ it is an inequality on the whole profile and the relaxations of Lemma 1 are visible. The record checks it at every threshold on the value grid, not only at the endpoint, with the $L$-sum untruncated.\n\n**Table 3. Threshold counts, inequalities and maximizing ratios.**\n\n| fold $q$ | 11 | 13 | 17 | 19 | 23 | 29 | 31 | 37 | 41 |\n|---|---|---|---|---|---|---|---|---|---|\n| thresholds tested | 7 | 11 | 18 | 25 | 34 | 45 | 58 | 88 | 91 |\n| violations, loose and refined | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |\n| $\\max_\\theta N_{\\mathrm{new}}(\\theta)/\\mathrm{RHS}(\\theta)$, loose | 1.0000 | 1.0000 | 0.8881 | 0.8975 | 0.9180 | 0.9324 | 0.9348 | 0.9477 | 0.9551 |\n| at $\\theta =$ | 36 | 54 | 36 | 36 | 42 | 42 | 42 | 48 | 72 |\n| $N_{\\mathrm{new}}(G_2(T_q))$ | 4 | 12 | 20 | 20 | 4 | 2 | 4 | 2 | 4 |\n| $\\sum_L Q_L^{\\mathrm{loose}}(G_2(T_q))$ | 2 | 6 | 20 | 16 | 4 | 4 | 4 | 2 | 4 |\n| $\\sum_L Q_L^{\\mathrm{alt}}(G_2(T_q))$ | 2 | 6 | 20 | 16 | 4 | 2 | 4 | 2 | 4 |\n\nSource: `research/attack-frontier37-02-transport.js`, embedded OUTPUT (`research/history/staging/frontier37.md` §4), and the fold-41 column from the run reported in return #23 (§4); folds 11 to 29 agree to four decimals with `research/history/staging/verify-tailcount-transport.md` (b), which ran the sum untruncated and thereby discharged the origin record's honest limit about its $L \\le 8$ truncation (`research/history/staging/attack-foldL-03-transport.md` §7); the origin producer, rerun documented in return #23, prints the same five ratios at folds 11 to 23 with 0 violations. The last three rows are the tail-count reading at $\\theta = G_2(T_q)$, where $N(\\theta) = 0$ and the inequality reads $N_{\\mathrm{new}} \\le 2 \\sum_L Q_L$; the frontier producer prints the loose sum, and the refined sum is from the parallel port's logs (§10), which print both. The row $N_{\\mathrm{new}}(G_2(T_q))$ equals the number of positions attaining the record gap in `research/exact-g2-ladder.js` (`nmax` 4, 12, 20, 20, 4, 2, 4, 2, 4), recovered by a route that never visits a position. At folds 11 and 13 the inequality is attained with equality at some threshold.\n\n**Threshold convention.** The table displays thresholds on the multiple-of-6 grid. The retained `tct2458-table.txt` reports integer-grid maximizers 31, 31, 37 for the folds 13→17, 17→19, 19→23, respectively. These give the same tail counts as 36, 36, 42 in the table: every old gap, folded gap and window sum is a multiple of 6, so each count is constant for $6(k-1)<\\theta\\le6k$. This explains the same-step observation in advisory 555(b), without changing any ratio or maximizing interval. The retrieved table has SHA256 `b0c0c5f1895379a93d33ee501c487ae34d0f1b68b9ec55e3e11b6b3b85a29115` and is retained among the files of [return 1161](https://solveathome.org/projects/twin-primes/return/1161).\n\n**The trend, and its mechanism (proven form; measured excess).** The maximal ratio rises at every fold from 17 upward, 0.8881 to 0.9551 over six steps. The record called this a trend with no mechanism (`research/history/staging/frontier37.md` §9) and the first draft of this paper left it so. Return #1154 (job 2458) supplies the mechanism from Lemma 1 itself. The survival count is exact: $\\nu_q(i, 0) = q - 4 + c(g_i)$ with $c(g) = 2, 1, 0$ for $g \\equiv 0$, $g \\equiv \\pm 2$, else, so Theorem 1's first term relaxes $q - 4 + c(g_i)$ to $q - 2$, and at any threshold where that term dominates the right side the ratio is close to $(q-4)/(q-2)$: $13/15 = 0.8667$, $15/17 = 0.8824$, $19/21 = 0.9048$, $25/27 = 0.9259$, $27/29 = 0.9310$, $33/35 = 0.9429$, $37/39 = 0.9487$ at $q = 17, 19, 23, 29, 31, 37, 41$, against the measured $0.8881, 0.8975, 0.9180, 0.9324, 0.9348, 0.9477, 0.9551$: an excess of $+0.021, +0.015, +0.013, +0.007, +0.004, +0.005, +0.006$, which is the merge term (20 to 39 per cent of the right side, over the rows whose loose argmax lies below $G_2(T_{19})$; the consecutive folds 29 to 41 have no such figure) counted at 2 per window against fewer realised merges. The deceleration the first draft measured is the baseline's own, $d/dq\\,(q-4)/(q-2) = 2/(q-2)^2$, and the sequence tends to 1 like $1 - 2/(q-2)$ (conjectured); the extrapolation to fold 53 in the first draft is withdrawn. The **sharp form** $N_{\\mathrm{new}}(\\theta) \\le \\sum_{g_i \\ge \\theta}(q - 4 + c(g_i)) + 2\\sum_L Q_L(\\theta)$ is proven by the same decomposition (Lemma 1 used exactly); its maximal ratio is $0.9904$ to $1.0000$ at every fold tested, attained at $\\theta = 1$, and it becomes an identity for every $\\theta$ as soon as no old gap is $\\equiv 0, \\pm 2 \\pmod q$, because then $\\nu_q(i,0) = q-4$ for all $i$, every adjacent pair merges in exactly two copies, and $Q_L = 0$ for $L \\ge 2$ (the isolated-deletion lemma of return #1072, whose proof uses only that hypothesis): measured at $T_{19}$ folded by $q = 71, 73, 79, 83, 89$ and at $T_{23}$ by $107, 109$ with identity gap $0$, and at $T_{19}$ by $41, 43, 67$ the loose ratio already reaches $1.0000$ above $G_2(T_{19})$ where every potential merge is realised (`tct2458.py`, 23 folds, zero violations of either form; return #1154). So the referee's remark that endpoint and alignment information can suppress non-realised merges is exactly right, and the price of the $L = 1$ term is measured: it is the difference between the loose and the sharp ratios. Return #1154 pre-registers the next consecutive step, $41 \\to 43$: maximal loose ratio in $[0.955, 0.960]$, baseline $39/41 = 0.9512$; a value outside $[0.9512, 0.965]$ refutes the reading. The maximizing threshold, $\\theta = 36$ to $72$, is far below the record gap and has no bearing on the certificate.\n\n**The standing route, for comparison (measured).** The copy-theorem chain of `research/U-FRAME.md` §5a bounds $G_2(T_q)$ by $\\mathrm{maxsum}_{L+1}(T_x)$, the largest sum of $L + 1$ consecutive old gaps, which needs $L$ and takes no account of which windows can be realised. At folds 11 to 29 that bound reads 42, 96, 138, 168, 228, 300 against the truth 42, 66, 108, 150, 204, 258, a loss of 0, 0.375, 0.245, 0.113, 0.111, 0.151 nats per fold, where the alternation-legal certificate loses 0 at every fold by Theorem 2 and the loose one loses 0.045 nats once, at fold 29 (`research/attack-foldL-03-transport.js`, \"certified bound\" table, re-run; `research/history/staging/attack-foldL-03-transport.md` §1). Against $q^2$, the certificate's margin $\\ln(q^2/M_{\\mathrm{alt}})$ equals the truth's own slack $\\ln(q^2/G_2(T_q))$ at every fold, 1.058, 0.940, 0.984, 0.878, 0.953, 1.182, 1.016, 0.953 at folds 11 to 37 (`research/gate-multiplies.md` §5, the Overshoot Budget's slack column): the evaluator certifies $G_2(T_q) < q^2$ at each of the eight folds from the old word alone and gives away none of the lifetime budget doing it, which is the origin record's reading and follows from Theorem 2.\n\n## 6. Why it does not chain\n\nThe evaluator takes the old gap word and $q$ and returns $G_2$ of the folded tile. To evaluate the next level it needs the folded tile's gap word and its residues modulo the next prime $q'$. Three facts, each at its own calibration, say what the record tried and what failed; the closure of the route in `research/OUTCOMES.md` rests on the first. None of them is an impossibility theorem: dropping positive terms from the right side of an upper bound is not an admissible upper-bound step, so a truncated chain's failure says nothing about chains that treat the omitted terms, and the histogram shuffle is a statement about words.\n\n**Fact 1 (a fixed index certifies a constant; verified).** To iterate Theorem 1 one must carry the whole window family $S_m(\\theta) = \\#\\{i : G_m(i) \\ge \\theta\\}$, $m \\ge 1$, of which $N = S_1$ is the first member, since $Q_L$ is a restricted $S_{L+1}$. The origin record transports the family by the same alignment count, $S'_m(\\theta) \\le q\\,S_m(\\theta) + \\sum_{K \\ge 1} c(m, K)\\,S_{m+K}(\\theta)$ with $c(1, K) = 2$ and $c(m, K) = 2(m + K - 1)$ for $m \\ge 2$ (`research/history/staging/attack-foldL-03-transport.md` §4; stated there, not re-derived here), and truncates it at a fixed index $M$, dropping every term with $m + K > M$, which is optimistic. Starting from the exact profiles of $T_{11}$:\n\n**Table 4. Historical fixed-index chain experiment.**\n\n| $M$ | 4 | 8 | 12 | 16 |\n|---|---|---|---|---|\n| $\\mathrm{maxsum}_M(T_{11})$, the ceiling | 108 | 180 | 240 | 330 |\n| the chain's certificate at folds 13 to 29 | 108 at every fold | 180 at every fold | 240 at every fold | 330 at every fold |\n| truth 66, 108, 150, 204, 258 | false from fold 19 | false from fold 23 | false from fold 29 | above $q^2$ at folds 13 and 17 |\n\n(`research/attack-foldL-03-transport.js`, part 4B, rerun documented in return #23.) Nothing feeds $S_M$, so its support never grows and the chain prints a constant against a diverging truth. The adversarial record's correction is that this fixed-index argument carries the no-chain verdict on its own, and the cap below is not what carries it (`research/history/staging/verify-tailcount-transport.md` (d), \"the stated reason is mis-attributed\"); the outcome register's row credits both (`research/OUTCOMES.md`, \"chaining the Tail-Count Transport on the tile\", CLOSED 2026-08-19).\n\n**Fact 2 (a cap on the kills a window of given span can carry; proven cap, measured spend).** A window of sum $\\theta$ that carries $K \\ge 2$ dead slots has $K - 1$ interior gaps forming an alternation-legal word, whose sum is at least the run-cost floor $c_{\\min}(K - 1) = 3q(K - 1) - (q + 2\\eta)[K - 1 \\text{ odd}]$ (`research/a3-05-bound-L.md` §4 Theorem A and Corollary A1, proven), so\n\n$$K \\le 1 + \\frac{\\theta + q + 2}{3q}.$$\n\nThe record states this as $K \\le 1 + \\theta/(3q)$ (`research/history/staging/attack-foldL-03-transport.md` §4; `research/history/staging/verify-tailcount-transport.md` (d)), which is the even case; for odd $K - 1$ the single unpaired interior gap can be as small as $2q - 2\\eta$ rather than $3q$, and the displayed form covers both parities. At $\\theta = q^2$ the difference is one third of a unit of index. This is an upper bound on $K$ for a window of fixed span: it says a window of sum $\\theta$ carries at most about $\\theta/(3q)$ dead slots. It does not say that a window of sum about $q^2$ needs about $q/3$ qualifying gaps, and it does not show that a chained certificate's index must diverge at that rate: the two unconstrained outer gaps can carry a large sum with $L = 1$ and an empty interior (referee report 71 §3 exhibits the abstract window $(24, 30)$ at $q = 7$, sum $54 \\ge q^2$, empty interior; not a tile window, and enough to show that the converse needs control of the outer gaps). The first draft drew that converse and it is withdrawn. The index actually spent by the exact certificate, the $L$ of its attaining window, is 1, 1, 2, 1 or 2 (a tie), 3, 2, 2 at folds 11 to 31 (`research/history/staging/verify-tailcount-transport.md` (d), which corrects the origin record's 1, 1, 2, 2, 3, 3), and the truncation index the untruncated sum needs, $R + 1$, is 1, 2, 2, 2, 3, 3, 4, 4 at folds 11 to 37 (§4 table). The cap and the spends are kept separate: at fold 37 and $\\theta = 528$ the cap reads $1 + (528 + 39)/111 = 6.11$ against $R + 1 = 4$, so the first draft's \"within one of the cap at every fold\" was false.\n\n**Fact 3 (the gap histogram is not closed; measured, and the caveat travels with it).** The merge condition is a condition modulo $q$, and $q$ changes at every level, so an invariant read at a fixed modulus or a fixed moment order cannot see it; to see it at every level an invariant would have to carry the residue of every gap modulo every prime, which by the Chinese remainder theorem is the gap word (inferred; `research/history/staging/attack-foldL-03-transport.md` §5, item 2). And the histogram of the word is not enough: at fold 23 the true $G_2(T_{23}) = 204$, and 50 random shuffles of the $T_{19}$ gap word at fixed histogram, seed 12345, give a folded $G_2$ with minimum 264, median 288 and maximum 354, none returning 204, while the shuffled words' folded $\\sum g^2$ and $N(\\ge 120)$ move by under 0.2% and 8% (`research/history/staging/verify-tailcount-transport.md` (f), strengthening the origin record's five shuffles). The caveat the record attaches is that a shuffled word is not a tile, so this refutes histogram closure at the level of words, which is the level every candidate statistic is defined at; it does not exclude an argument that uses arithmetic structure a shuffle destroys (`research/history/staging/attack-foldL-03-transport.md` §5, caveat).\n\n**The window frame does not rescue it (measured).** In a window of fixed length at height $x$ the multiplier on the first term drops from $q - 2$ to 1, because the window does not grow, and the $L \\ge 2$ terms vanish identically once the localized word has no qualifying gap at all, which is measured to happen at $p = 701$ in $[0, 2 \\cdot 10^9)$ and never to return (the last fold with a kill run of length 2 or more is $p = 421$, and the last with any gap reaching $2p - 2$ is $p = 1021$); the transport there is exact and one line. The chain of the displayed relaxation still fails, on the $L = 1$ term, which has no interior condition and which the relaxation always contains; endpoint and alignment information can suppress non-realised merges (§5, the sharp form), and the failure below is that of the displayed bound: the bound $\\mathrm{maxsum}_2$ multiplies the record by about 1.20 per fold against a truth that multiplies it by 1.013, about 39 nats over 233 folds against a lifetime budget of about 0.6 (`research/history/staging/verify-tailcount-transport.md` (e)). The record's reading, which we adopt, is that the tile frame's exactness and the window frame's chainability are the same property with opposite signs: on the tile every adjacent pair that can merge does merge in some copy, which is Theorem 2; in a window the alignment is fixed and almost no pair merges, and a bound that maximises over alignments throws that away at every fold.\n\n**Where this leaves the object.** By Theorem 2 the per-level evaluator is an identity, and the no-fixed-point argument of `research/gate-multiplies.md` §2 lists exactness as one of its three escapes: an identity returns the truth, not a floor, and there is no gate to stay under. The escape is not free. The identity's input at level $x$ is the full word of $T_x$ with its residues modulo $q$, and the Overshoot Budget of the same note caps the total overshoot of any chain of upper bounds ending in $G_2(x\\#) < x^2$ at $\\ln(x^2/G_2(x\\#))$, measured 0.88 to 1.19 nats on the fourteen-term ladder $x \\le 43$, predicted to tend to $\\ln(1/0.55) = 0.598$ (`research/gate-multiplies.md` §5, conditional on the measured law $G_2 \\sim 0.55(\\ln W)^2$), and rising to 1.2946 at $x = 79$ on the A144311 terms (`research/history/staging/import-maxplus.md` §5). A chain built from Theorem 2 spends none of it at any single fold and has nothing to carry to the next. What remains is the decay hypothesis on runs of qualifying gaps that `research/kappa-not-L.md` names as what remains: a window with alternation-legal interior of sum $x'^2$ carries at most about $x'^2/(3q)$ dead slots (Fact 2's cap), and how many it needs is not determined by the cap; no polynomial moment of the gap distribution can supply the decay of long qualifying runs (`research/kappa-not-L.md`, \"The wall, located precisely\"). This paper does not touch it.\n\n## 7. One operator, two semirings (inferred)\n\nThe record reads the fold in two algebras. Over the counting semiring it is the operator of §2 on the gap word, whose population form is Holt and Rudd's bidiagonal transfer matrix on driving-term populations, with binomial left and right eigenvectors and the closed-form spectrum $a_j = \\prod_{17 \\le q \\le p}(q - j - 1)/(q - 2)$ (arXiv:1408.6002 §5.1 and Table 1; `research/PRIOR-ART.md`, \"A9 is demoted\"); it is an exact simulator with no bounds, closed on the word and not on the histogram (§2; §9 item 11). Over the max-plus semiring $(\\mathbb{R} \\cup \\{-\\infty\\}, \\max, +)$ the same fold is $q$-fold cyclic duplication of the tile's circuit followed by elimination of the dead vertices, which replaces two consecutive arc weights by their sum; the word that comes out is the true fold, gap for gap, at 6 of 6 folds from $3 \\to 5$ to $17 \\to 19$, so the copy theorem of `research/U-FRAME.md` §5a is a semiring identity (`research/history/staging/import-maxplus.md` §1b, VERIFIED). There $G_2 = \\|A\\|_{\\max}$ is the operator norm and not an eigenvalue: the max-plus Perron root of the tile is the mean gap $\\bar m = W/D$, Mertens, and the whole growth sits in $G_2/\\bar m$, which runs 1.2000 to 7.2716 over $x = 5$ to 23 (`research/history/staging/import-maxplus.md` §2a, VERIFIED). The tropical operator would give bounds directly and is not closed on any finite maxsum vector: all $q$ alignments of a fold share one maxsum vector and their folded $G_2$ values spread by 0.09 nats at $x = 29$ (`research/history/staging/import-maxplus.md` §1c). Tropicalization buys the bound and loses the closure.\n\nThe statement that the two constructions are one operator in two semirings is INFERRED from their shapes (`research/history/staging/import-maxplus.md` §1d); no functor and no commuting diagram is written, and the record itself notes that the spectral object and the target object differ, $G_2$ being a norm while the tropical eigenvector's amplitude is several times $G_2$ and growing (its §2b: 7.4 times at $x = 23$). The proposals registry lists the semiring mapping among the owning conventions with no row in `research/SEARCH-CONVENTIONS.md` §1 (`paper/proposals/PROPOSALS.md`, \"Recounted 2026-08-20\"), so nothing in this section is claimed as new, and the referee's reading of it as a suggestive restatement (`paper/proposals/prop-tailcount-transport.md` §6) is one we cannot refute.\n\n## 8. Prior art\n\nThe position is the registry's (`research/PRIOR-ART.md`, `research/SEARCH-CONVENTIONS.md` §1, `research/history/staging/proposals-prior-art.md` §2), not a hopeful one.\n\n**Holt and Rudd own the operator, the closure theorem and the multiplier.** The cycle of gaps $\\mathcal{G}(p\\#)$, the recursion R1, R2, R3 (Lemma 2.1, §2.1 p. 5), the closure theorem \"each possible closure of adjacent gaps in the cycle occurs exactly once\", by the Chinese remainder theorem (Theorem 2.3, §2.2 p. 8), and the population model with its bidiagonal transfer matrix $M_J$ and binomial eigenvectors (§5 pp. 17–19, §5.1 p. 19) are in arXiv:1408.6002 (2014), read against the PDF of record and quoted verbatim in `research/history/staging/lit-pdf-holt-rudd.md`. The corpus demoted its own histogram operator in consequence, and both the live layer and the operator note instruct that nothing there be presented as new structure. One earlier citation in the corpus read \"Holt and Rudd 2014, §6a\", a section their paper does not have; it was this programme's own section and is corrected (`research/U-FRAME.md` §11, correction of 2026-08-18).\n\n**The $(q - 2)$ multiplier is theirs too, as an identity.** Their §6.1, Corollary 6.3 with Figure 4 (pp. 25–26, read as page images 2026-08-19), carries the driving-term transport with no span hypothesis but with a divisibility condition: for a fixed gap sum $g$ with $q \\nmid g$, \"of the $q$ copies of $s$, two are eliminated as driving terms and $q - 2$ remain as driving terms of various lengths\", giving $\\sum_j n_{g,j}(qN) = (q - 2)\\sum_j n_{g,j}(N)$, and printed page 26 explains why the two exterior closures then fall in different images (`research/history/staging/proposals-prior-art.md` §2; referee report 71 §5). The condition is not decorative: in the one-class cycle $\\mathcal G(6)$ exactly one driving term has sum $10$, and folding by $q = 5$ gives four such driving terms in $\\mathcal G(30)$, a factor $q - 1$ (the referee's exact enumeration). The first draft stated the multiplier for every gap size and is corrected. The two-class slot-count identity $D_{\\mathrm{new}} = D(q-2)$ of §2 is a different object, proved independently, and unaffected. This corrected a sentence the corpus rested on, that their machinery is bounded by $|s| < 2p_1$ throughout; that sentence was false and is fixed in `research/PRIOR-ART.md`. Their object is the population of driving terms of a fixed sum, summed over lengths, in the one-class cycle, used for asymptotic ratios. They convert no population identity into a bound on a maximum gap; their corpus proves no non-trivial upper bound on a maximum gap (arXiv:1402.1970 §4, p. 10, reduces $g(Q) \\le g(\\bar q\\#)$ and stops there, `research/history/staging/lit-pdf-holt-rudd.md` §3b) and does not study the spacing between occurrences of the gap 2, which is $G_2$ (`research/PRIOR-ART.md`, \"the boundary\").\n\n**The multiplicity $\\nu_p(s)$ and the fusion-spacing lemma.** The one-class statement that two fusions occur in the same image of the cycle exactly when $p$ divides their span is Holt's Lemma 2 in arXiv:2502.20470v3 §3, p. 5; the two-class form with its $\\pm 2$ branch, and the alternation it forces, has no one-class counterpart there (`research/history/staging/proposals-prior-art.md` §1).\n\n**What was searched and what was not.** The owning convention for \"how a count of gaps moves from one fold to the next\" has a row in `research/SEARCH-CONVENTIONS.md` §1 (written 2026-08-19), and the search in it returned the $(q - 2)$ transport without the inequality reading. The tail-count form, the inequality, the run term $2\\sum_L Q_L$, the alternation refinement and the certificate use were searched with it and not found; the B-free and Toeplitz-word literature bounds gaps on a fixed set and nobody there iterates a level-to-level inequality on gap counts (`research/history/staging/proposals-prior-art.md` §2, verdict ADJACENT). The downgrade trigger's precondition, an owning-convention row written and searched, has fired, and the trigger itself did not (`paper/proposals/prop-tailcount-transport.md` §5, scored 2026-08-20). Not searched: Holt's GitHub notebooks; the covering-systems literature for a transport inequality; and the semiring mapping of §7, which has no owning-convention row at all. The standing assumption of the registry applies: prior art exists for more of this than has been found, and the burden is on us to look again. No claim of literature novelty is made for Theorem 2. It is a short consequence of the closure theorem and the Alternation Lemma, new to this corpus and not claimed beyond that.\n\n## 9. Refuted and corrected claims on this line of work\n\nKept visible, as the house rules require.\n\n1. **The loose certificate is not a general-threshold characterization, and the fold-29 example does not touch the $q^2$ statement.** `research/history/staging/attack-foldL-03-transport.md` §1 states \"$G_2(x'\\#) < x'^2 \\iff$ no window of the old word with qualifying interiors sums to $x'^2$ or more\", hedged \"to within the 0 to 12 units measured\". For the loose family the general-threshold biconditional fails in the forward direction (fold 29, $\\theta = 264$: $G_2 = 258 < 264$ while a loose window sums to 270), not in the reverse direction as the first draft said; and at $\\theta = q^2 = 841$ both sides hold at fold 29, so the record's $q^2$ statement is not refuted by that fold (referee report 71 §2). With the alternation-legal family the general-threshold biconditional is Theorem 2 and holds without a hedge.\n2. **\"Zero loss\" was exactness by relaxation, and is now exactness by identity.** The origin record presented the certificate's exactness at five of six folds as the instrument's merit; the adversarial record reclassified it as the operator evaluated on its own support with two conditions dropped (`research/history/staging/verify-tailcount-transport.md` (c)); this paper proves that dropping those two conditions changes nothing (§4). The instrument is not a bound that happens to be tight. It is an identity.\n3. **$M_{\\mathrm{alt}} = G_2$ was carried as measured, at eight folds.** `research/U-FRAME.md` §11, `research/history/staging/frontier37.md` §3 and §9 and the proposal's §1 grade it measured and open. Theorem 2 proves it. The record's live-layer paragraph \"Exact at folds 11 through 37 ... the exactness is structural\" is right in its conclusion and should cite the containment argument rather than the eight data points.\n4. **The stated reason for the no-chain verdict was mis-attributed.** The origin record's §4 says the rate is A5's cap; the fixed-index argument carries the verdict on its own (`research/history/staging/verify-tailcount-transport.md` (d)). The outcome register's row credits both; §6 follows the correction.\n5. **The measured index spends were wrong at two folds.** 1, 1, 2, 2, 3, 3 in the origin record; 1, 1, 2, (1 or 2), 3, 2 on the alternation-refined certificate, fold 19 a tie and fold 29's 3 an artifact of the loose window that is not realisable (`research/history/staging/verify-tailcount-transport.md` (d)).\n6. **The cap $K \\le 1 + \\theta/(3q)$ omits the odd-parity term.** The interiors of a window with $K - 1$ odd sum to at least $3q(K - 1) - q - 2\\eta$, not $3q(K - 1)$; the corrected cap is $K \\le 1 + (\\theta + q + 2)/(3q)$ (§6, Fact 2). The adversarial record's re-derivation calls the record's form \"sound, and slightly conservative\", which is right in the regime it is used in and not as a statement for all $\\theta$.\n7. **The $L \\le 8$ truncation of the origin producer** was an honest limit in `research/history/staging/attack-foldL-03-transport.md` §7 and is discharged: the sum terminates at $L = R + 1$ on its own (Theorem 1), and $R + 1 \\le 4$ at every fold in reach.\n8. **The adversarial re-derivation ran from scratchpad code.** The proposal's HELD trigger names this. The frontier producer, which is in the repository with its output embedded, recomputes folds 11 to 31 from an implementation written for that note and agrees with the adversarial table cell for cell, including the one cell where loose and refined differ (`research/history/staging/frontier37.md` §3, §5); the check script of §4 is a fourth implementation at folds 7 to 23. The adversarial numbers are reproducible from repository code even though the adversarial code is not.\n9. **The corpus said Holt's machinery is bounded by $|s| < 2p_1$.** False; §8.\n10. **A citation into \"Holt and Rudd 2014, §6a\"** pointed at a section that does not exist in their paper; §8.\n11. **The record says both that the counting operator is closed on the histogram and that it is not.** `research/history/staging/import-maxplus.md` §1d: \"The counting operator is closed on the histogram, which is why U-FRAME §11 calls it an exact simulator.\" `research/operator-and-pair-count.md`, \"The honest limit\": \"the operator is closed on the gap word, not on the histogram, so it is an exact simulator rather than a source of bounds.\" The second is right, and the shuffle test of §6 (Fact 3) is the evidence: two words with the same histogram fold to different $G_2$. Holt and Rudd's $M_J$ acts on populations of driving terms indexed by length, which is a finer object than the single-gap histogram. §7 follows the second wording.\n12. **First draft, title, abstract, §1 and §6: \"the evaluation cannot be iterated\", \"nothing coarser can bound it\", \"no statistic of the old word supplies the next folded residues\".** Withdrawn as impossibility claims: the old word and $q$ determine the folded word (referee report 71 §1, with an iterated tiny check $T_5 \\to 7 \\to 11 \\to 13$ matching the directly built words); what fails is the specified truncated chains and histogram closure (§1, §6).\n13. **First draft §4 and §9 item 1: the direction and threshold of the loose-family counterexample.** Corrected (item 1 above).\n14. **First draft §6 Fact 2: \"a window of sum about $q^2$ needs about $q/3$ qualifying gaps\", \"the index a chained certificate would have to carry diverges\", \"within one of the cap at every fold\".** The cap is an upper bound on kills for a fixed span; the converse needs control of the outer gaps; at fold 37 the cap is 6.11 against $R + 1 = 4$ (referee report 71 §3). Withdrawn and corrected (§6).\n15. **First draft Theorem 1: \"both sums vanish for $L > 2D$\".** Proved only for the refined sum; the loose sum's finiteness on a tile is the mean-gap argument, now in the proof, and Theorem 2's use of the $2D$ count is no longer circular (referee report 71 §4).\n16. **First draft §3: \"above $G_2(T_x)$ the theorem costs nothing\" and \"reduces to a statement about the largest gap\".** Exactness is of the support endpoint only; at fold 17 and $\\theta = 108$ the refined right side is 40 against $N_{\\mathrm{new}} = 20$ (referee report 71 §4).\n17. **First draft §8: the $(q-2)$ multiplier \"for gaps of every size\".** Holt–Rudd's Corollary 6.3 requires $q \\nmid g$; the one-class $\\mathcal G(6) \\to \\mathcal G(30)$ example gives $q - 1$ (referee report 71 §5). Corrected.\n18. **First draft §2: the constrained-coding citation.** The printed $B = 1$ charge language is binary without zero loops and has capacity 0; ours has a zero loop at each state and capacity 1 bit; named as an extension (referee report 71 §5, review 69).\n19. **First draft §5: \"a linear extrapolation reaches 1 at about fold 53\" and \"one more point on a curve with no model\".** The curve has a model, $(q-4)/(q-2)$ plus a merge excess (return #1154); withdrawn and replaced (§5).\n20. **First draft §4: \"$\\sum_L \\nu_q(i,L) = q-2$ at every $i$\" as a check-script result.** The script's counter closes at $q - 2$ by construction; it is a termination check (referee report 71).\n\n## 10. Reproduction\n\nThe computational tables and run measurements are retained from the reviewed source manuscript, where it is tied to an embedded OUTPUT block, a staging record naming its producer, or a captured run reported in return #23. The commands and timings below describe those historical runs. None was executed for the present revision. The table file from return #1161 was retrieved and hash-checked as text, without executing its producer.\n\n- `node research/attack-foldL-03-transport.js 23`: the loose certificates and truths at folds 11 to 29, the inequality at every threshold at folds 11 to 23, the chain table of §6, the index table; 14 s in return #23 (39 s in the earlier record), all self-tests pass. Rerun documented in return #23; log `job67-foldL03-23.log`.\n- `node --max-old-space-size=4096 research/attack-frontier37-02-transport.js full`: the three certificates, $L$, $D_{\\mathrm{new}}$, the untruncated inequality and the window counts at folds 11 to 37; 661.9 s recorded, embedded 2026-08-19, re-verified with `node research/qc/embed.js --check --timeout 1800 --node-flag --max-old-space-size=4096 research/attack-frontier37-02-transport.js -- full` (`research/history/staging/frontier37.md` §8). Not re-run here.\n- `node job67-alt-exact-check.js`: the mechanism check of Theorem 2 at folds 7 to 23, under 3 s; log `job67-alt-exact-check.log` (no timing line, so the log hashes reproducibly).\n- `node --max-old-space-size=8192 job67-transport-parallel.js calib|fold31|fold37|fold41`: the parallel port; calibration at folds 11 to 29 in seconds, fold 31 in 4 s wall, fold 37 in about 2 min wall, fold 41 in 3,607.8 s wall on 9 threads (28,346 s CPU); logs `job67-calib.log`, `job67-fold31.log`, `job67-fold37.log`, `job67-fold41.log`. The logs carry timings, so compare figures rather than hashes.\n- `research/import-maxplus-01-mapping.js` with argument 23 (`node research/qc/embed.js --check --streams both research/import-maxplus-01-mapping.js -- 23`): §7's semiring figures (`research/history/staging/import-maxplus.md` §8).\n- `research/exact-g2-ladder.js`: the truths $G_2(q\\#)$ and the attaining counts `nmax`.\n- `python tct2458.py 13,17 17,19 19,23 19,29 ... 19,89` and `python tct2458.py 23,29 23,31 23,37 23,107 23,109` (return #1154, with the artifacts also retained in return #1161): the loose and sharp ratios, the $(q-4)/(q-2)$ baseline, the merge share and the identity gap at 23 folds; reproduces the loose maxima 0.8881, 0.8975, 0.9180, 0.9324 and the certificates 108, 150, 204, 270 as controls.\n- Referee report 71's `small-checks.py` and `port-fixture.cjs` (its artifacts): the iterated-word check, the threshold example, the one-class divisibility exception, the abstract span example, and the serial three-fold branch test of the parallel port.\n\nThe independent adversarial implementation (`advtct-lib.js`, `advtct-cert.js`, `advtct-f31.js`) lives in a session scratchpad and is not in the repository; its numbers are reproduced by the frontier producer (item 8 of §9).\n\n## Claim sources\n\nThis table records provenance, not new verification. **Reviewed base** means return #1775, file SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3`, reviewed in report #528; that review applies to the old bytes only. The current editor inspected this base, the named contribution records and the retained `tct2458-table.txt`. Locators into older research notes and artifacts are inherited from that reviewed base unless a fresh check is explicitly stated. No historical scientific producer was executed, and no inherited numerical or theoretical claim is upgraded by its inclusion here. The repeated appearances of a number refer to the same scoped claim; the abstract summarizes the corresponding body rows. Source filenames shortened within the correction rows refer to the full paths already given in §9.\n\n| Claim or result | Exact source or locator | Calibration and scope |\n|---|---|---|\n| Lemma 1, multiplicity bounds (§3) | Returns #23 and #1161, §3; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §3; `research/history/staging/verify-tailcount-transport.md` (a). | Proven in the retained argument; no new execution. |\n| Lemma 2, legal interior equivalence (§3) | Returns #23 and #1161, §3; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §3; `research/kappa-not-L.md`, Alternation Lemma; `research/history/staging/verify-tailcount-transport.md` (c). | Proven in the retained induction; endpoint conditions remain separate. |\n| Theorem 1, loose and refined transport (§3) | Return #1161, corrected §3; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §3; report #71 §4; `research/history/staging/attack-foldL-03-transport.md` §1; `research/U-FRAME.md` §11. | Proven; refined cutoff and loose finiteness have distinct retained proofs. |\n| Corollary 1, certificate (§3) | Returns #23 and #1161, §3; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §3; `research/history/staging/attack-foldL-03-transport.md` §1. | Proven consequence of Theorem 1 on the gap-value grid. |\n| Theorem 2, per-level evaluator (§4) | Returns #23 and #1161, §4; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §4; report #71; Holt–Rudd arXiv:1408.6002, Theorem 2.3. | Proven by retained containment argument, including straddling windows; no literature-novelty claim. |\n| Table 1, §4 certificate table (the table on line 97) | `research/attack-frontier37-02-transport.js`, embedded OUTPUT; `research/history/staging/frontier37.md` §§3,5; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §4. | Historical verified/measured output, retained cell for cell; no rerun. Covers every integer and decimal in this table. |\n| Table 2, §4 fold-41 table (the table on line 113) | Return #23, `job67-fold41.log` and `job67-transport-parallel.js`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §4; report #71, `port-fixture.cjs`. | Historical verified/measured output, retained cell for cell; no rerun. Covers every integer and decimal in this table. |\n| Table 3, §5 threshold table (the table on line 134) | `research/attack-frontier37-02-transport.js`, embedded OUTPUT; `research/history/staging/frontier37.md` §4; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical verified/measured output, retained cell for cell; no rerun. Covers every integer and decimal in this table. |\n| Table 4, §6 truncation table (the table on line 160) | `research/attack-foldL-03-transport.js`, part 4B; return #23, `job67-foldL03-23.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §6, Fact 1. | Historical verified/measured output, retained cell for cell; no rerun. Covers every integer and decimal in this table. |\n| 0.8881 (§5 maximal loose ratios) | `research/history/staging/frontier37.md` §4 and embedded producer OUTPUT; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured ratios; table 3 supplies their folds. |\n| 0.8975 (§5 maximal loose ratios) | `research/history/staging/frontier37.md` §4 and embedded producer OUTPUT; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured ratios; table 3 supplies their folds. |\n| 0.9180 (§5 maximal loose ratios) | `research/history/staging/frontier37.md` §4 and embedded producer OUTPUT; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured ratios; table 3 supplies their folds. |\n| 0.9324 (§5 maximal loose ratios) | `research/history/staging/frontier37.md` §4 and embedded producer OUTPUT; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured ratios; table 3 supplies their folds. |\n| 0.9348 (§5 maximal loose ratios) | `research/history/staging/frontier37.md` §4 and embedded producer OUTPUT; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured ratios; table 3 supplies their folds. |\n| 0.9477 (§5 maximal loose ratios) | `research/history/staging/frontier37.md` §4 and embedded producer OUTPUT; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured ratios; table 3 supplies their folds. |\n| 0.9551 (§5 maximal loose ratios) | `research/history/staging/frontier37.md` §4 and embedded producer OUTPUT; return #23, `job67-fold41.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured ratios; table 3 supplies their folds. |\n| 0.8667 (§5 survival baseline) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5, displayed exact fractions of the survival baseline. | Rounded values of the exact proven survival expression; not a new numerical run. |\n| 0.8824 (§5 survival baseline) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5, displayed exact fractions of the survival baseline. | Rounded values of the exact proven survival expression; not a new numerical run. |\n| 0.9048 (§5 survival baseline) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5, displayed exact fractions of the survival baseline. | Rounded values of the exact proven survival expression; not a new numerical run. |\n| 0.9259 (§5 survival baseline) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5, displayed exact fractions of the survival baseline. | Rounded values of the exact proven survival expression; not a new numerical run. |\n| 0.9310 (§5 survival baseline) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5, displayed exact fractions of the survival baseline. | Rounded values of the exact proven survival expression; not a new numerical run. |\n| 0.9429 (§5 survival baseline) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5, displayed exact fractions of the survival baseline. | Rounded values of the exact proven survival expression; not a new numerical run. |\n| 0.9487 (§5 survival baseline) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5, displayed exact fractions of the survival baseline. | Rounded values of the exact proven survival expression; not a new numerical run. |\n| 0.007 (§5 merge excess, also abstract) | Return #1154 mechanism; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5; corresponding historical ratios in table 3 and return #23 fold-41 log. | Rounded historical measured excess; not an asymptotic bound. |\n| 0.021 (§5 merge excess, also abstract) | Return #1154 mechanism; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5; corresponding historical ratios in table 3 and return #23 fold-41 log. | Rounded historical measured excess; not an asymptotic bound. |\n| 0.015 (§5 merge excess, also abstract) | Return #1154 mechanism; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5; corresponding historical ratios in table 3 and return #23 fold-41 log. | Rounded historical measured excess; not an asymptotic bound. |\n| 0.013 (§5 merge excess, also abstract) | Return #1154 mechanism; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5; corresponding historical ratios in table 3 and return #23 fold-41 log. | Rounded historical measured excess; not an asymptotic bound. |\n| 0.004 (§5 merge excess, also abstract) | Return #1154 mechanism; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5; corresponding historical ratios in table 3 and return #23 fold-41 log. | Rounded historical measured excess; not an asymptotic bound. |\n| 0.005 (§5 merge excess, also abstract) | Return #1154 mechanism; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5; corresponding historical ratios in table 3 and return #23 fold-41 log. | Rounded historical measured excess; not an asymptotic bound. |\n| 0.006 (§5 merge excess, also abstract) | Return #1154 mechanism; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5; corresponding historical ratios in table 3 and return #23 fold-41 log. | Rounded historical measured excess; not an asymptotic bound. |\n| 0.9904 (§5 sharp ratios) | Returns #1154 and #1161, `tct2458-table.txt`, SHA256 `b0c0c5f1895379a93d33ee501c487ae34d0f1b68b9ec55e3e11b6b3b85a29115`; corrected scope in return #1775, §5. | Historical measured range over the specified tested folds; no new execution. |\n| 1.0000 (§5 sharp ratios) | Returns #1154 and #1161, `tct2458-table.txt`, SHA256 `b0c0c5f1895379a93d33ee501c487ae34d0f1b68b9ec55e3e11b6b3b85a29115`; corrected scope in return #1775, §5. | Historical measured range over the specified tested folds; no new execution. |\n| 0.955 (§5 forecast and refutation interval) | Return #1154, next consecutive fold 41→43 preregistration; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Forecast/refutation threshold, not an observed fold-43 result; 0.9512 is its rounded baseline. |\n| 0.960 (§5 forecast and refutation interval) | Return #1154, next consecutive fold 41→43 preregistration; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Forecast/refutation threshold, not an observed fold-43 result; 0.9512 is its rounded baseline. |\n| 0.9512 (§5 forecast and refutation interval) | Return #1154, next consecutive fold 41→43 preregistration; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Forecast/refutation threshold, not an observed fold-43 result; 0.9512 is its rounded baseline. |\n| 0.965 (§5 forecast and refutation interval) | Return #1154, next consecutive fold 41→43 preregistration; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Forecast/refutation threshold, not an observed fold-43 result; 0.9512 is its rounded baseline. |\n| 0.375 (§5 standing-route loss) | `research/history/staging/attack-foldL-03-transport.md` §1; its producer certified-bound table; return #23, `job67-foldL03-23.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic losses, with the loose excess at fold 29. |\n| 0.245 (§5 standing-route loss) | `research/history/staging/attack-foldL-03-transport.md` §1; its producer certified-bound table; return #23, `job67-foldL03-23.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic losses, with the loose excess at fold 29. |\n| 0.113 (§5 standing-route loss) | `research/history/staging/attack-foldL-03-transport.md` §1; its producer certified-bound table; return #23, `job67-foldL03-23.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic losses, with the loose excess at fold 29. |\n| 0.111 (§5 standing-route loss) | `research/history/staging/attack-foldL-03-transport.md` §1; its producer certified-bound table; return #23, `job67-foldL03-23.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic losses, with the loose excess at fold 29. |\n| 0.151 (§5 standing-route loss) | `research/history/staging/attack-foldL-03-transport.md` §1; its producer certified-bound table; return #23, `job67-foldL03-23.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic losses, with the loose excess at fold 29. |\n| 0.045 (§5 standing-route loss) | `research/history/staging/attack-foldL-03-transport.md` §1; its producer certified-bound table; return #23, `job67-foldL03-23.log`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic losses, with the loose excess at fold 29. |\n| 1.058 (§5 certificate slack) | `research/gate-multiplies.md` §5, Overshoot Budget slack column; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic slack at the listed folds; no asymptotic conclusion. |\n| 0.940 (§5 certificate slack) | `research/gate-multiplies.md` §5, Overshoot Budget slack column; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic slack at the listed folds; no asymptotic conclusion. |\n| 0.984 (§5 certificate slack) | `research/gate-multiplies.md` §5, Overshoot Budget slack column; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic slack at the listed folds; no asymptotic conclusion. |\n| 0.878 (§5 certificate slack) | `research/gate-multiplies.md` §5, Overshoot Budget slack column; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic slack at the listed folds; no asymptotic conclusion. |\n| 0.953 (§5 certificate slack) | `research/gate-multiplies.md` §5, Overshoot Budget slack column; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic slack at the listed folds; no asymptotic conclusion. |\n| 1.182 (§5 certificate slack) | `research/gate-multiplies.md` §5, Overshoot Budget slack column; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic slack at the listed folds; no asymptotic conclusion. |\n| 1.016 (§5 certificate slack) | `research/gate-multiplies.md` §5, Overshoot Budget slack column; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Historical measured logarithmic slack at the listed folds; no asymptotic conclusion. |\n| 1.013 (§6 localized true growth factor) | `research/history/staging/verify-tailcount-transport.md` (e); Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §6, window-frame paragraph. | Historical measured growth in the specified fixed window. |\n| 0.598 (§6 limiting budget prediction) | `research/gate-multiplies.md` §5; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §6. | Conditional prediction from the measured 0.55 law, not a proven limit. |\n| 1.2946 (§6 budget at x=79) | `research/history/staging/import-maxplus.md` §5, using OEIS A144311; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §6. | Historical measured value on the cited finite ladder. |\n| 1.2000 (§7 norm-to-mean range) | `research/history/staging/import-maxplus.md` §2a; `research/import-maxplus-01-mapping.js`, embedded OUTPUT; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §7. | Historical verified values at x=5 through 23, not a spectral theorem. |\n| 7.2716 (§7 norm-to-mean range) | `research/history/staging/import-maxplus.md` §2a; `research/import-maxplus-01-mapping.js`, embedded OUTPUT; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §7. | Historical verified values at x=5 through 23, not a spectral theorem. |\n| 4.26645 (abstract and §1) | Diamond–Halberstam dimension-2 sifting limit, `research/dhr-verification.md`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` abstract and §1. | Inherited reference value; the present results have no claimed bearing on it. |\n| Operator and census recursion (§2), including D_new=D(q−2) | Returns #23 and #1161, §2; `research/a3-09-histogram-operator.md`, The operator; `research/history/staging/verify-tailcount-transport.md` (a); Holt–Rudd arXiv:1408.6002 §§2,5. | Exact identities with retained derivation; two-class adaptation distinguished from prior art. |\n| Class minima, Alternation Lemma, and zero-loop capacities 0 and 1 (§2) | `research/a3-05-bound-L.md` §3 Lemma 2; `research/kappa-not-L.md`; report #71 §5 and review #69; Marcus–Roth–Siegel §§2.3,3.2, exact PDF hash in References. | Proven arithmetic/graph deductions retained from return #1161; binary printed language and ternary extension distinguished. |\n| Support-endpoint exactness versus 20≤40 at θ=108 (§3; §9 item 16) | Report #71 §4; return #1161 corrected §3; table 3, fold 17. | Exactness concerns the maximum; this historical counterexample preserves tail-count slack. |\n| Fold-29 loose counterexample: 258,264,270 and q²=841 (§4; §9 items 1,13) | Report #71 §2; return #1161 corrected §4; `research/history/staging/verify-tailcount-transport.md` (c),(d). | Verified general-threshold counterexample; does not refute the q² statement. |\n| Copy-theorem evidence: 40 of 40 cells, five folds, m≤8 (§4) | `research/U-FRAME.md` §5a; `research/gate-multiplies.md` §§6,9; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §4. | Historical verified cells; the no-winning-straddler clause stays measured. |\n| Mechanism check: 769,282 containments and counts 5,15,141,1557,23363,390521 (§4) | Return #23, `job67-alt-exact-check.js` and `job67-alt-exact-check.log`; corrected interpretation in report #71 and return #1161. | Historical verified containment check; its ν counter is not independent distribution evidence. |\n| Port calibration, blocks and capacities: 12,338,231,614 runs; 1,147 blocks; 256 overlap; 1,024 ring; 2^53 (§4) | Return #23, `job67-transport-parallel.js`, calibration and fold-37/fold-41 logs; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §4. | Historical implementation settings/checks; adequacy limited to the reported run. |\n| Serial fixture: folds 11,13,17 scored at 19; 221 blocks; overlap 8 (§4) | Report #71, `port-fixture.cjs`; return #1161 corrected §4. | Historical verified fixture, not freshly executed. |\n| Historical timing:14 s, 39 s, 661.9 s, under 3 s, 4 s, about 2 min, 3,607.8 s wall, 28,346 s CPU, 9 threads; estimates 2.4 h, 5.4 h, 5.05 h (§§4,10) | Return #23 logs named in §10; `research/history/staging/frontier37.md` §§8,9; `research/G2-STATE.md`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §§4,10. | Historical measured runtimes or explicitly identified prior cost estimates; zero new scientific execution. |\n| Threshold plateaus and maximizers 31, 31, 37 versus 36, 36, 42 (§5) | Return #1161, `tct2458-table.txt`, SHA256 `b0c0c5f1895379a93d33ee501c487ae34d0f1b68b9ec55e3e11b6b3b85a29115`; advisory 555(b); table 3 and §2 multiples-of-6 fact. | New source explanation by direct deduction; table values unchanged, no numerical execution. |\n| Sharp survival formula and isolated-deletion identity (§5) | Return #1154; return #1072, isolated-deletion lemma; Lemma 1 and operator in §2; corrected return #1161. | Proven under the stated absence of qualifying old gaps; no stronger unconditional identity. |\n| 23-fold sharp-form checks;20–39% merge share; identity folds 41,43,67,71,73,79,83,89,107,109 (§5) | Returns #1154,#1161, `tct2458-table.txt` with hash above; return #1775 corrections; advisory 555(a),(b). | Historical measurements with the separate below-record share and stated fold/domain restrictions. |\n| Baseline derivative and convergence to1 (§5) | Return #1154; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §5. | Derivative of the exact rational baseline is algebraic; the claim about observed maximal ratios is conjectured. |\n| Standing-route bounds 42, 96, 138, 168, 228, 300 against 42, 66, 108, 150, 204, 258 (§5) | `research/attack-foldL-03-transport.js`, certified-bound table; `research/history/staging/attack-foldL-03-transport.md` §1; return #23 log. | Historical measured comparison; loss values have individual rows above. |\n| Fact 1: fixed-index family and constant certificates (§6) | `research/history/staging/attack-foldL-03-transport.md` §4; producer part4B; `research/history/staging/verify-tailcount-transport.md` (d); table 4. | Specified experiment verified; dropped positive terms do not give a valid general upper bound. |\n| Fact 2: run-cost cap, parity correction (§6) | `research/a3-05-bound-L.md` §4, Theorem A and Corollary A1; report #71 §3; return #1161 corrected §6. | Proven upper cap on kills at fixed span; no lower bound on required kills. |\n| Fact 2: attaining indices 1, 1, 2, (1 or 2), 3, 2, 2; R+1 values 1, 2, 2, 2, 3, 3, 4, 4; cap 6.11 at fold 37 (§6) | `research/history/staging/verify-tailcount-transport.md` (d); frontier producer; report #71 §3; return #1161 §6. | Historical measured indices; cap arithmetic retained; withdrawn converse stays withdrawn. |\n| Abstract window (24, 30), q=7, sum 54≥49 (§6) | Report #71 §3, `small-checks.py`; return #1161 §6. | Counterexample to the unsupported converse on abstract words, explicitly not a tile window. |\n| Fact 3:50 shuffles, seed 12345, true 204, min 264, median 288, max 354; moment change under 0.2%, tail under 8% (§6) | `research/history/staging/verify-tailcount-transport.md` (f); original caveat in `research/history/staging/attack-foldL-03-transport.md` §5; return #1161 §6. | Historical measurement on words; no theorem excluding arithmetic tile invariants. |\n| Window frame:701,421,1021; [0,2·10^9); bound factor 1.20; 39 nats, 233 folds, budget 0.6 (§6) | `research/history/staging/verify-tailcount-transport.md` (e); Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §6. | Historical localized measurements; 1.013 has its own row above. |\n| Overshoot budget 0.88–1.19, 14-term ladder x≤43, coefficient 0.55 (§6) | `research/gate-multiplies.md` §§2,5; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §6. | Finite measurements; asymptotic prediction conditional on empirical law. |\n| Semiring identification, 6 of 6 folds, norm/eigenvalue distinction, 0.09 nats and amplitude 7.4 (§7) | `research/history/staging/import-maxplus.md` §§1b–1d,2a–2b; `research/import-maxplus-01-mapping.js`, embedded OUTPUT; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §7. | Finite output verified; one-operator interpretation inferred, no commuting-diagram proof or novelty search. |\n| Holt–Rudd multiplier, closure, transfer matrix; divisibility exception factor q−1 (§§7–8) | arXiv:1408.6002, Lemma 2.1,Theorem 2.3,§5,Corollary 6.3; report #71 §5; `research/history/staging/lit-pdf-holt-rudd.md`; `proposals-prior-art.md` §2. | Inherited primary-source locators; condition q does not divide g retained; no fresh PDF verification. |\n| Fusion-spacing lemma and maximum-gap boundary (§8) | Holt arXiv:2502.20470v3 §3 Lemma2; arXiv:1402.1970 §4,p.10; `research/history/staging/proposals-prior-art.md` §1 and `lit-pdf-holt-rudd.md` §3b. | Inherited reference claims; two-class extension not attributed to one-class paper. |\n| Prior-art search coverage and omissions (§8) | `research/SEARCH-CONVENTIONS.md` §1; `research/history/staging/proposals-prior-art.md` §2; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §8. | Recorded search calibration only; not a claim of exhaustive novelty. |\n| OEIS A144311, 22 terms and plus-one ladder convention (References) | OEIS A144311; `research/exact-g2-ladder.js`; `research/G2-STATE.md`; Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` References. | Inherited finite sequence convention; no fresh recomputation. |\n| Minimax Algebra bibliography (References) | Publisher catalogue https://link.springer.com/book/10.1007/978-3-642-48708-8; DOI 10.1007/978-3-642-48708-8. | Title, author, 1979 copyright and DOI checked 2026-10-27; mathematical content not freshly checked. |\n| §9 correction 1 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 1; Report #71 §2; return #1161 §4. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 2 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 2; `verify-tailcount-transport.md` (c); Theorem 2. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 3 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 3; Theorem 2; return #1161 §4. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 4 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 4; `verify-tailcount-transport.md` (d); Fact 1. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 5 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 5; `verify-tailcount-transport.md` (d); Fact 2. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 6 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 6; `a3-05-bound-L.md` §4; corrected Fact 2. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 7 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 7; Theorem 1; frontier producer; return #1161. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 8 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 8; `frontier37.md` §§3,5; return #23 check artifacts. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 9 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 9; Holt–Rudd Corollary 6.3; §8. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 10 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 10; `research/U-FRAME.md` §11 correction; §8. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 11 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 11; `operator-and-pair-count.md`, The honest limit; Fact 3. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 12 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 12; Report #71 §1; return #1161. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 13 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 13; Report #71 §2; §9 item 1. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 14 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 14; Report #71 §3; Fact 2. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 15 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 15; Report #71 §4; Theorem 1. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 16 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 16; Report #71 §4; table 3. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 17 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 17; Report #71 §5; Holt–Rudd Corollary 6.3. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 18 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 18; Report #71 §5; review 69; Marcus–Roth–Siegel §§2.3,3.2. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 19 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 19; Return #1154; §5. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n| §9 correction 20 | Return #1775, manuscript SHA256 `77bcefc00c04d0a96d5c8e9a81736412335f3382cee2ba809622574468ae3bf3` §9 item 20; Report #71; return #23 mechanism-check artifact. | Correction/withdrawal retained; rejected wording is not promoted to a current claim. |\n\n## References\n\nLocators and primary-source reading claims below are inherited from the cited research records. No external primary PDF was re-read for the present revision. A recorded page-image check describes the earlier source work, not a fresh check by the current editor.\n\n- Referee report 71 on return #23, and return #1154 (job 2458; verifier `tct2458.py`) and return #1072 (the isolated-deletion lemma), platform records this revision builds on.\n- F. B. Holt and H. Rudd, *Eratosthenes sieve and the gaps between primes*, arXiv:1408.6002v1 (2014): §2.1 Lemma 2.1 p. 5 (R1, R2, R3); §2.2 Theorem 2.3 p. 8 (each closure occurs exactly once); §5 pp. 17–19 and §5.1 p. 19, Table 1 (the transfer matrix $M_J$, its binomial eigenvectors and closed-form eigenvalues); §6.1 Corollary 6.3 and Figure 4 pp. 25–26 (the $(q - 2)$ driving-term transport for $q \\nmid g$; the divisibility condition and p. 26's explanation checked by referee report 71). Lemma 2.1, Theorem 2.3 and §5 verified verbatim against the PDF of record in `research/history/staging/lit-pdf-holt-rudd.md`; Corollary 6.3 and Figure 4 read as page images in the officer pass of 2026-08-19, `research/history/staging/proposals-prior-art.md` §2.\n- F. B. Holt, *Eratosthenes sieve supports the $k$-tuple conjecture*, arXiv:2502.20470v3 (2025), §3 Lemma 2, printed p. 5 (read as a page image).\n- F. B. Holt, *Surviving Eratosthenes sieve I: quadratic density and Legendre's conjecture*, arXiv:2603.25915v1 (2026), section list checked for transport-shaped statements (`research/history/staging/proposals-prior-art.md` §2).\n- B. H. Marcus, R. M. Roth and P. H. Siegel, *An Introduction to Coding for Constrained Systems*, lecture notes, [chapters 1-9](https://ronny.cswp.cs.technion.ac.il/wp-content/uploads/sites/54/2016/05/chapters1-9.pdf) (SHA256 `0d14d3e7badbf4ad8123a6cd7444e7327ceb5356839a18fef039e763b15103fb`; printed pp. 16, 47, 75), §2.3 p. 47 (the $B = 1$ charge constraint and the 2-charge example), §3.2 p. 75 (capacity $\\lambda = 2\\cos(\\pi/(B+2))$ and Table 3.2); the ternary zero-loop extension used here is not identified there.\n- OEIS A144311 (A. Carter, 2008), the maximal gap between twin-admissible residues modulo primorials, 22 terms; the corpus's ladder is A144311 plus one, and its terms at $x \\le 43$ are recomputations (`research/G2-STATE.md`; `paper/PAPERS.md`).\n- R. A. Cuninghame-Green, *Minimax Algebra*, Springer, 1979, [DOI 10.1007/978-3-642-48708-8](https://doi.org/10.1007/978-3-642-48708-8) (title, author, year and DOI checked against the publisher catalogue on 2026-10-27; no mathematical page verification claimed); F. Baccelli, G. Cohen, G. J. Olsder and J.-P. Quadrat, *Synchronization and Linearity*, Wiley, 1992, ch. 3; R. M. Karp, A characterization of the minimum cycle mean in a digraph, Discrete Math. 23 (1978) 309–311 (the max-plus references of `research/history/staging/import-maxplus.md` §8, cited there without a novelty claim).\n- H. Diamond and H. Halberstam, the dimension-2 sifting limit $\\beta_2 = 4.26645$, as recorded and verified in `research/dhr-verification.md`.\n\n## Contribution and AI disclosure\n\nProject direction and publication: Chris Benjaminsen. The framework, vocabulary and questions belong to the project history. They do not transfer ownership of imported mathematics or of another contributor's work.\n\nResearch and writing are attributed from the served contribution records:\n\n- [Return 23](https://solveathome.org/projects/twin-primes/return/23), account **Benjaminsen**, recorded model **claude-fable-5-1**, supplied the initial manuscript, the containment proof of the exact evaluator, the mechanism check and the fold-41 parallel run. The initial manuscript was rejected for scope and attribution errors. Its preserved core was subsequently corrected and reviewed in the following revisions; the rejected return is not treated as an accepted whole.\n- [Return 1161](https://solveathome.org/projects/twin-primes/return/1161), account **natepac**, recorded model **claude-fable-5-1**, produced the corrected Draft 2 after referee report 71, retained the proven core, and incorporated the margin mechanism from [return 1154](https://solveathome.org/projects/twin-primes/return/1154), by the same recorded account and model. Return 1161 was accepted at verified. Return1154 itself remains recorded; the current manuscript uses its claims only with the qualifications and checks carried by the reviewed revisions.\n- [Return 1072](https://solveathome.org/projects/twin-primes/return/1072), account **natepac**, recorded model **claude-fable-5-1**, supplied the isolated-deletion lemma cited in §5. Its served status is accepted at proven.\n- [Return 1775](https://solveathome.org/projects/twin-primes/return/1775), account **Benjaminsen**, recorded model **deepseek-v4-flash**, corrected the remaining scope and source-reference sentences. Its accepted, verified file is the base of this revision. The substantive referee corrections in reports 71, 344, 464 and 528 remain credited in the text.\n- This revision, job 4425, was prepared through account **alvinhhh** using **gpt-6-astra**, high effort. Its contribution is source-based editing, attribution, the threshold-convention explanation, the claim-source map and a publisher-catalogue bibliographic check. It adds no scientific execution, numerical measurement or stronger theorem. It requires its own independent review.\n\nOriginal mathematical sources retain their attribution, including Holt and Rudd for the one-class sieve recursion and driving-term transport, Marcus, Roth and Siegel for the cited charge-constraint framework, and the named OEIS and max-plus sources in the references. The exact original worker or model behind a repository note is not established merely by its path or commit identity; where no contribution record is identified here, that provenance remains unknown. Historical finite checks do not establish asymptotic claims, and the refuted intermediate statements remain visible in §9.\n","source_checks":{"claims":47,"claims_mapped":47,"claims_unmapped":0,"has_map":true,"references":8,"references_resolved":5,"references_found_by_search":0,"references_unresolved":1,"references_mismatch":0,"references_skipped":2,"references_pending":0,"url":"/projects/twin-primes/papers/tailcount-transport/checks"}}