{"job_id":729,"registry":"# Questions: what has been asked here, what it got, and where the record is\n\n*(GENERATED from the `` blocks at the top of the notes; never\nhand-edited. Regenerate with `node research/qc.js --index` or\n`node research/gen-questions-index.js`. The block format and the gate that\nenforces it are documented at the top of `qc/questions.js`.)*\n\n**Before proposing an attack or briefing an agent:** find the TODO item in\nsection 1, search for the actual object, then read the relevant records and\ntheir decisive dependencies. Use [OUTCOMES.md](OUTCOMES.md) for reuse and\nrevisit conditions. An item can span many unrelated attempts; loading every\nlinked note is not the required first step. Verify any conclusion that\ndetermines the next move, including an ANSWERED or CLOSED entry.\n\n**Status describes the question, not proof strength or review grade.**\nOPEN: unresolved. PARTIAL: specified parts are resolved. ANSWERED: the bounded\nquestion has an answer, which may be a negative finding, finite measurement\nor completed specification. Its underlying arithmetic target may remain OPEN.\nCLOSED: the stated premise or approach is closed at its recorded scope; this\ndoes not refute every related conjecture. SUPERSEDED: another record replaces\nthis one. Consult the owning note and linked reviews for HELD or other grades.\n\n**Multiple records:** conflicting statuses are shown as MIXED. The displayed\nverdict comes from the last record in path order, not necessarily the newest\nor most authoritative review. Read the linked records before resolving a\ndisagreement; the generator does not adjudicate it.\n\n## 1. By TODO item: what has already run under each\n\n| TODO item | question | status | verdict | records |\n|---|---|---|---|---|\n| C | `Q-agent-start` What must an incoming agent read and preserve before continuing the reviewed arithmetic campaign? | ANSWERED | Onboarding and document ownership only. The second dispatch is completed and independently reviewed on 2026-09-09. RESEARCH-EXECUTION.md owns current dispositions and candidate next obligations; RESEARCH-HANDOFF.md owns the updated exact contract. No assignment is started by that review. Twin-prime infinitude and required signed estimates remain OPEN. | [AGENT-START.md](AGENT-START.md) |\n| C | `Q-bilinear-fold-first-attack` Does assigning each Mobius factor to its first fold, or applying a direct second-moment bound, establish the missing one-sided estimate? | ANSWERED | The first-fold identity yields no saving; a direct second moment has a negligible diagonal and an open two-prime off-diagonal. Fixed-fold covariance is an exact residue-imbalance square and the beta weights balance at each fixed modulus. Growing-depth joint control remains OPEN; B>=-C2*x+o(x) is not improved. | [bilinear-fold-attack.md](bilinear-fold-attack.md) |\n| C | `Q-centered-discrepancy-estimate` Can the top of D_y be removed using ordinary prime distribution after an exact divisor flip, and what estimate remains? | PARTIAL | Equations (3)-(4), the exact split and flip, survive review and finite controls. A repair of the top-range bound T^top=O_(A,eps)(x/log^A x) is DERIVED in section 3a (2026-09-08) with the endpoint atom retained, odd square divisors, the corrected reciprocal-totient local factors with (m',g)=1, explicit truncation powers, a Cauchy multiplicity device, and a uniform Mobius mean proved from the q=1 Siegel-Walfisz statements; its inputs are the terminal-point BV of Tao Notes 3 Theorem 17 with the prefix form derived by rounding. The handler (lane V) read the derivation on 2026-09-08, reconstructed (BV*), (3a.9), (3a.14) and (3a.16), checked the limiting constant of (3a.9) numerically at eight (b,g) pairs and found no defect; it is accepted at its stated scope, with ineffective constants. The payoff is D_y=D^(e_1)+O_(A,eps)(x/log^A x) only, so the handoff consumer is equivalent to D^(e_1)>=-4x/25+o(x). The fixed-endpoint signed discrepancy, D_y>=-4x/25+o(x) and twin-prime infinitude remain OPEN. | [centered-discrepancy-estimate.md](centered-discrepancy-estimate.md) |\n| C | `Q-centered-discrepancy-measurement` At reachable x, is the OPEN sufficient input D_y>=-4x/25 numerically violated, is the absolute form (13) numerically plausible, and does D_y carry structure beyond a random-sign model? | ANSWERED | MEASURED to x=2^38. Neither pre-registered falsifier fires. D_y/x stays within 0.0043 of zero for the measured j>=26. Over 30<=j<=38, D_y/x differs from -(T1/x-C2) by at most 2e-4, with maximum 1.84401e-4 at j=30; the classical term dominates this finite comparison. The data do not establish an asymptotic fluctuation scale, an impossibility of informative future measurements, or the sufficient signed estimate. No proof status changes. | [centered-discrepancy-measurement.md](centered-discrepancy-measurement.md) |\n| C | `Q-chain-review-0906` Do the written derivations from S(x) down to E_dagger hold as stated, with every imported theorem used inside its hypotheses and every discarded term at the claimed O_H(x/log^H x) rate, and where does the chain remain unreviewed? | ANSWERED | Three independent adversarial passes found no defect in the six classical contributions from S(x) to E_>, none in the grouped moment (1)-(20) including the E_* to E_dagger step, and none in the residual-coverage link E_> to E_*, whose block-shape derivation was reconstructed and verified exactly. Every imported theorem was confirmed in its primary source except the Mobius Bombieri-Vinogradov citation, which points at an exercise sheet and needs a published replacement. Stale o(x) rates in three note bodies were replaced. A checked argument is not a refereed theorem; the OPEN signed margin is untouched. | [chain-review-0906.md](chain-review-0906.md) |\n| C | `Q-chen-fold-benchmark` Can the fold framework reproduce a classical Chen lower bound on long intervals with every imported hypothesis and error budget stated? | ANSWERED | The classical implication is derived below using three explicitly imported theorem statements, with the combinatorial minorant proved and its integral margin certified by exact rational arithmetic. This is a benchmark, not a new prime theorem, and it does not prove twins or a short-zone result. | [chen-fold-benchmark.md](chen-fold-benchmark.md) |\n| C | `Q-chen-opportunity` Does the signed Chen target identify an approachable proof mechanism, and what should the next research obligation be? | ANSWERED | The target is sufficient but subtracts an avoidable odd-composite penalty; even cancellation of its obvious signed components does not close the existing separate bounds. Select a prime-detecting weight against explicitly justified arithmetic input ranges before pursuing a new estimate. The opportunity is a research judgment, not a proved mechanism. | [chen-opportunity-audit.md](chen-opportunity-audit.md) |\n| C | `Q-chen-signed-target` What exact additional arithmetic estimate would turn the completed Chen benchmark into a proof of infinitely many twin primes? | PARTIAL | An elementary prime minorant gives a conditional twin theorem with all weights, ranges, quantifiers and errors specified. The opportunity audit identifies an avoidable negative-weight penalty and a separate-estimate budget that fails even under component cancellation; this sufficient target remains OPEN and is not the sole next proof obligation. | [chen-signed-target.md](chen-signed-target.md) |\n| C | `Q-coefficient-structure` Does the arithmetic structure of the aggregated coefficients reduce the endpoint estimate beyond the previous rectangle, and can smaller coefficient norms alone supply the remaining power saving? | ANSWERED | Exact classification gives a nonsquarefree L2 norm of size at most sqrt(D)*W^(1/4) times logarithms, while the squarefree top-band energy is at least a constant times D*W*log(W). At d~x^0.277, e~x^0.467 every endpoint sector except the squarefree-squarefree prime sum has a power saving. This reduces that rectangle to one explicit endpoint correlation; prime-dispersion.md supplies the remaining estimate and controls the full rectangle. Finite algebra, CRT sectors and archived prefixes are checked separately. | [coefficient-structure.md](coefficient-structure.md) |\n| C | `Q-cofactor-progression-transfer` Can the corrected full-cofactor kernel be estimated on a growing cofactor range by representing its actual arithmetic on CRT progressions, and does the resulting bound reach the twin consumer? | PARTIAL | Derived from named imports: for some positive absolute kappa and d, all prime-r cofactor pairs s,t <= floor((log x)^kappa), including non-squarefree inputs and mixed transition/smoothed profiles, admit a dyadic scale-average O(log^(2-d) X) bound after division by x. The extension uses bounded multiplicative Euler modifications on the progression s\\|n, t\\|n-2 and keeps its density 1/lcm(s,t), so summing cofactors costs only O((log log X)^2). This goes beyond s=t=1 but remains short of o(x). The large-cofactor joint remainder, outside residual and twin margin remain OPEN; the attempted extension to power-sized cofactors fails on source modulus range and accumulated logarithmic cost. | [cofactor-progression-transfer.md](cofactor-progression-transfer.md) |\n| C | `Q-consumer-comparison` How does the sufficient margin C_2 x + E_dagger(x) >= c_0 x/(log x)^K compare logically with the published sufficient routes to twin primes, and what does the literature already own of the corner object? | ANSWERED | The sufficient margin remains OPEN. The published conditional routes imply it where their hypotheses and stated lower bounds apply; reverse implications are not established. The dictionary is E_dagger(x)/x = C_2(2 delta_x - delta_{x/2} - 1) + o(1), with K>0 below that normalisation's resolution. Independent review corrects the comparison: cumulative and dyadic consumers on unbounded scales are equivalent at the same fixed K with possibly different positive constants. At K=0 an eventual cumulative lower bound also implies the unbounded-scale dyadic consumer. The nonnegative-weight corner identification applies only to the prime-cofactor subfamily; the full residual retains additional branches. Every surveyed route remains conditional. | [consumer-comparison.md](consumer-comparison.md) |\n| C | `Q-corner-branch-diagnostic` Can future experiments enumerate the full coefficients C(n) and C'(n-2) branch by branch, without silently dropping proper prime powers, cofactors s>1, non-squarefree inputs or either gcd branch? | ANSWERED | The driver exists and its two independent constructions of each side agree exactly on 8192 retained sides and 1802 fixture sides; five deletion and reconstruction controls are ACTIVE in both runs. Its split by gcd(n,n-2) measures integer parity, not the per-term CRT gcd partition. The fixed-eta corner is empty on the retained prefix, and Elo exceeds E0 across the entire J_x, so the matrix is a proxy window. This is finite algebra and tool preparation, with no asymptotic estimate or twin margin. | [corner-branch-diagnostic.md](corner-branch-diagnostic.md) |\n| C | `Q-corner-coefficient-energy` Can the full corner coefficients be studied before splitting their cofactor branches, and what do exact energy and classical smoothed sieve weights supply? | ANSWERED | The sharp coefficient energy is an explicit signed quadratic form in short cofactors plus O_epsilon(x^(1/2)K^2*x^epsilon), a power below x at the fixed corner. Logarithmically averaging the divisor cutoff gives Barban–Vehov weights and an O_eta(x log x) squared norm on each side and absolute shifted-product bound. The follow-up sharp-corner-transition.md gives sharp O_eta(x log^2 x) norms and proves a non-negligible norm transition for sufficiently small fixed eta. Signed transition saving and the global complement remain OPEN; no exact residual cut or twin margin changes. | [corner-coefficient-energy.md](corner-coefficient-energy.md) |\n| C | `Q-corner-correlation` On the corner S_0 where both cofactors sit just above their own cutoffs, what exactly is the remaining endpoint sum, what does the sufficient consumer need there, and does any reviewed correlation theorem supply it? | PARTIAL | The full corner is exactly sum_n C(n)C'(n-2). Proper-prime-power terms above the cutoffs are negligible at fixed eta by §1.1; the remaining prime-r terms with s>1 or s'>1 and non-squarefree inputs remain OPEN. The s=s'=1 piece has a nonnegative Mobius-product weight with exact moving cuts. The multiplicative lift and round-review sampling give small continuous and dyadic scale-average log savings for that subfamily, with no o(x), full-corner control or twin margin. The complement is still open. | [corner-correlation.md](corner-correlation.md) |\n| C | `Q-corner-log-average` What do logarithmically averaged correlation theorems and their quantitative successors actually supply for the prime-cofactor corner weight, with exact support, rates and scale quantifiers? | PARTIAL | The pure band is invariant under dilation by primes outside it; the exact cofactor window is not, but its support extends to x^(1-2eta) and need not leave the window under a fixed dilation. Uniform-prefix logarithmic bounds imply block bounds by Abel summation; a relative exponent above 3 is one sufficient route to o(x), not a universal necessary threshold. Pilatte's 1/(96e) calculation applies only to his displayed parameter choice. A bounded multiplicative Fourier lift now gives a small continuous scale-average log saving for the prime-cofactor subfamily via Tao-Teravainen v2; see prime-band-transfer.md. No o(x), dyadic pointwise estimate, full-corner estimate or positive twin margin follows. | [corner-log-average.md](corner-log-average.md) |\n| C | `Q-corner-measurement` At finite dyadic x, how large is the corner two-point correlation K(x)=sum_{x/2(x)>=c*x/log^K x on unbounded dyadic scales suffices, as does a stated logarithmically rescaled average. These implications are derived from named inputs; their endpoint hypotheses remain OPEN. The recorded uniform-gap theorem comparison has different quantifiers and does not establish an obstruction for this consumer. | [endpoint-target-audit.md](endpoint-target-audit.md) |\n| C | `Q-fixed-endpoint-discrepancy` After the accepted truncation to odd moduli e=-4x/25+o(x)? | PARTIAL | Reviewed 2026-09-09 after the coprimality repair: T_I^low=O_(A,eps')(x/log^A x), hence S=C_2x+B+O_A(x/log^A x), with B the exact Type II plus band sum (2.9). The untruncated modulus bound was false; g<=(log x)^(A+13), both tails, the coprime density and the weighted BV multiplicity now pay the estimate. Review corrects harmless log powers and the power-of-two atom over the full eps' range. D^(e_1)>=-4x/25+o(x) is equivalent to B+2C_2M>=-4x/25+o(x); it implies, but is not equivalent to, B>=-(C_2-1/200)x+o(x). The latter and H_B are sufficient OPEN margins. The absolute band statement (4.9) is one stronger sufficient input, not a necessary condition. No inspected source estimates the remaining actual signed B. Twin-prime infinitude remains OPEN. | [fixed-endpoint-discrepancy.md](fixed-endpoint-discrepancy.md) |\n| C | `Q-fold-arithmetic-bridge` Does one parity-table bridge from the anchored fold ledger yield a sufficient twin lower bound with named arithmetic inputs? | PARTIAL | Exact identities retained. The one unread sieve input of the pricing, Bombieri--Vinogradov for k-fold X^(1/u)-rough products, is derived from Wu's Lemma 2.3 (section 3a); the same input, sieved in the composite variable, gives the contamination aggregate constant 4 for each fixed k,u, replacing the displayed 12.86 to 19.72. With these inputs, elementary bounds give Q_cov(u)<1 and c*_real(u)<4 for every u>4 (section 4a, independently reviewed 2026-09-09 with rational certificates), so neither sufficient ratio test succeeds at any depth. This closes the two tests, not the decorrelation hypotheses, and supplies no twin estimate. | [fold-arithmetic-bridge.md](fold-arithmetic-bridge.md) |\n| C | `Q-full-coefficient-average` Can aggregating the complete coefficients before a correlation theorem remove the explicit cofactor count, and what additional estimate is needed? | PARTIAL | Exact factor and rounded-endpoint Fourier identities retained, with c_(i,0)=3/5 and an explicit composite-filtered weighted sum. The full family is not 1-bounded, but the sufficient phase condition admits at least k=0,+/-1 on the left and l=0,+/-1,...,+/-6 on the right for every Mellin twist; the earlier zero-only claim is corrected. Composite filtering and the required correlation rate remain unmatched. Proposition 6.5, independently reviewed including on 2026-09-09, proves coefficient norm at least (log x)^(2/5) for representations by 1-bounded functions on all smooth inputs. This does not exclude density-one representations, paid growing components or a jointly treated Fourier sum. No sufficient signed twin margin follows. | [full-coefficient-average.md](full-coefficient-average.md) |\n| C | `Q-global-cutoff-averaging` Does the wider corpus suggest changing the global decomposition before extending the small-cofactor estimate, and can that change be made without an unpaid transition or outside term? | PARTIAL | Derived: independently averaging the two initial Mobius cutoffs over fixed exponent intervals gives S=C2*x+sum G_L(n)G_R(n-2)+O_A(x/log^A x), uniformly on dyadic scales, with all cofactor and prime-power branches included. Each full G has squared norm O(x log x). The existing sharp-corner lower norm then forces cancellation between the corner coefficient and the rest at the same input. This does not estimate their shifted product. The global signed residual was already O(x) by the sieve upper bound and positivity; the new norm representation is not an improved signed bound. Prefer a bounded attempt on this global coefficient pair and a one-sided consumer; the twin margin remains OPEN. | [global-cutoff-averaging.md](global-cutoff-averaging.md) |\n| C | `Q-global-factor-signs` Which full factor configurations cause negative global products, can prime-power exceptions be paid, and does a pair-trigger upper bound control the negative part? | PARTIAL | Derived: G_i(n)=Lambda_(>W_i)(n)-F_i(s_i(n))*log t_i(n)-E_i(n), with all small-prime factors in s_i and all primes of t_i exceeding W_i. The correction is supported on a small-prime power exceeding W_i; its full shifted effect is O_epsilon(x^(39/40+epsilon)). After also paying proper prime powers, the residual is a composite-filtered signed smooth/rough cofactor sum. A ten-small-prime cell has F=-84 although every pair lies below a, refuting the proposed pair-trigger majorant. Prime filters contribute explicit terms when bounding the negative part; dropping them is an upper bound, not an identity. No scale-x signed improvement or twin margin follows. | [global-factor-signs.md](global-factor-signs.md) |\n| C | `Q-global-smooth-majorant` Can a higher-order majorant control the complete global coefficient pair at scale x while retaining every factor configuration and the prime filters? | PARTIAL | Derived using the corrected Henriot upper theorem: a C3 probability average of the same admissible initial cutoffs gives a full residual with sum \\|Ghat_L(n) Ghat_R(n-2)\\|=O(x). The three-smallest-prime majorant has bounded harmonic mass and meets the source growth class uniformly, despite not being multiplicative. All prime-power exceptions are paid. This replaces the O(x log x) absolute budget for the earlier logarithmic profile by O(x) for a different admissible profile representing the same signed residual to arbitrary logarithmic precision. The implied constant is not compared with C2 and no improved signed lower bound or twin margin is supplied. | [global-smooth-majorant.md](global-smooth-majorant.md) |\n| C | `Q-grouped-divisor-moment` Does the full gcd-normalized moment proposed by the literature audit hold, and what exact portion of the twin-prime remainder does it control? | ANSWERED | The proposed moment is derived from classical completion with all coefficient sectors and uniform twists included. Full rectangles are controlled when delta<19/25 and delta+3nu<161/100, in addition to the preceding region. A concrete extra cut d<=floor(x^(151/200)), de^3<=floor(x^(321/200)) controls the entire d~e~x^(2/5) benchmark and leaves an explicit smaller-domain endpoint remainder. The uniform product threshold stays below 19/25. At delta=8/25,nu=9/20, the next deficit is confined to small-common-divisor nonzero kernels; their required saving and the global twin margin remain OPEN. Finite validation does not prove asymptotic rates. | [grouped-divisor-moment.md](grouped-divisor-moment.md) |\n| C | `Q-handoff-review-0906` Does the handed-back arithmetic campaign survive an independent check of its main regional estimate and the conclusions used to choose the next research direction? | ANSWERED | The bounded handoff audit is completed in reports 20 and 21: the checked local reduction and regional mechanisms survive, named source statements were verified, and the consumer, corner support, rate, shrinking-margin and identity-piece overclaims were corrected. Joint Cauchy is now priced and adds no region. The multiplicative band transfer has a separate PARTIAL owner with a weaker continuous-scale payoff. Imported deep theorems remain imports; this is not corpus-wide certification or a twin margin. | [handoff-review-0906.md](handoff-review-0906.md) |\n| C | `Q-heath-brown-edges` Does the a=1 edge, and hence the corner S_0, come from the particular two-cutoff Vaughan identity in prime-detection-spec.md and shifted-prime-decomposition.md, or does an equivalent edge reappear under Heath-Brown's identity and the other standard decompositions of Lambda? | ANSWERED | The exact identities and exponent simplex leave a=1 in separately bounded formal pieces, including Heath-Brown's balanced j=K configuration. This does not prove an intrinsic edge after identity-piece cancellation. The bounded-cofactor object has affine dilations, not literally F(n)F(n-2). Linnik's fixed truncation has a large term-wise absolute tail by an elementary counting proof; its signed tail is not thereby bounded below. Heath-Brown K=3 narrows the classical split band, with coefficient and Type I normalization obligations retained. No full alternative reduction, new region or twin margin follows. | [heath-brown-edges.md](heath-brown-edges.md) |\n| C | `Q-joint-correction-source-audit` Does completing the supported prime-partner correction yield cancellation beyond the existing Vaughan reduction, and which literature inputs actually justify that completion? | ANSWERED | CHECKED prior-art matches for subset convolution, complementary sieve sums and signed smooth-number distribution. DERIVED reconstruction identifies the unrestricted factor weight with an existing short divisor approximant, up to the paid prime-power error. Its supports are x^(12/25) and x^(1/10). Reassembling the entire joint correction returns the already-open Vaughan remainder and supplies no new signed bound. A formal factor-vector control distinguishes the unrestricted logarithmic weight from the selected prime-cofactor branch. The matched general sieve theorems require inputs not supplied here. Literature novelty is unestablished; twin infinitude remains OPEN. | [joint-correction-source-audit.md](joint-correction-source-audit.md) |\n| C | `Q-joint-factor-estimate` Can an additional estimate for actual factor configurations control the full signed balance of the C3 residual? | ANSWERED | DERIVED: for the single-large-prime delta-rough family F, the residual splits exactly as R_F = C2*x*H_delta - Z_F^p + o(x), where the Type I part C2*x*H_delta is evaluated by ordinary prime BV on each cofactor interval and the twisted Mobius constant 2C2 (corrected 2026-09-08 after V2: Wu Lemma 2.3 is squarefree-only and did not cover the non-squarefree b_R moduli; prime BV covers all moduli), and Z_F^p is the signed prime-partner sum. The complement carries the opposite Type I part -C2*x*H_delta, so grouping by factor configuration transfers Type I mass and leaves the twisted prime correlation B_L unchanged. With the matched upper sieve the family bound is C2*x(1+H_delta-(40/9)H^+), certified below -2/5 C2*x: INSUFFICIENT BOUND. Even a sieve constant 2 in place of 40/9 needs H^abs<1 and leaves the complement unpaid. Independently reviewed 2026-09-09 with the uniform delta-range and complement corrections below. Twin infinitude and every sufficient margin remain OPEN. | [joint-factor-estimate.md](joint-factor-estimate.md) |\n| C | `Q-kernel-sign-control` At delta=8/25, nu=9/20, is the moment Mfrak and its small-common-divisor kernel X_small measurably smaller with the actual coefficient b_u=A_right(gu) than with \\|b_u\\| or with \\|b_u\\| times an independent seeded random sign, and does the actual/random ratio decrease with x over the feasible dyadic range? | ANSWERED | MEASURED, negative. Over seven dyadic scales j=18..30 and four boxes, the pre-registered slope of log2(actual/random) for X_small has mean + sd >= 0 in all four families, so the run gives no heuristic support for extra Mobius-sign cancellation in the small-j kernel. The actual coefficient's \\|X_small\\| ranks like one more random draw. The measurement is weak where it matters: the finite moment is 97.66-102.58 percent equal-frequency class, X_small carries 0.02-2.88 percent, J0=floor(x^(1/20)) is 1 at j=18 and 2 at j=20..30, and Z=2 collapses the prime-power sector of (13) to r=2. Equation (21) and the global twin margin remain OPEN and untouched. | [kernel-sign-control.md](kernel-sign-control.md) |\n| C | `Q-left-divisor-signs` Can the Möbius structure of the left coefficient A_left(gm) replace the first Cauchy inequality, so that its sqrt(M) loss is not paid, and what does that buy at the target box (delta,nu)=(8/25,9/20) and at the corner a=b=1? | PARTIAL | Partly, and not where it is needed. Two lemmas are derived: a Type I bound with no zero-frequency budget, usable at the target box whenever the arbitrary block is shorter than x^(1/4), and a Type II bound that is uniform in the Perron twist heights. Applied to the actual coefficient they confine the target-box deficit to sectors with left prime power r>=x^(43/200) and right prime power q>x^(3/100), and lower the worst block exponent there from 103/100 to 41/40. The corner a=b=1 is untouched: grouped, Type I, Type II, Bettin-Chandee/Wright and even a hypothetical per-block square-root bound all exceed 1 there. No region is added, E_dagger and the consumer (20) are unchanged, and the global twin margin remains OPEN. | [left-divisor-signs.md](left-divisor-signs.md) |\n| C | `Q-mobius-bv-derivation` Is there a published theorem statement of Bombieri-Vinogradov for the Mobius function at level T^(1/2)/log^B T with a maximum over coprime classes, and if not, does that estimate follow from published theorems by a derivation whose every hypothesis is checked? | ANSWERED | No published theorem statement was located in five channels searched in the owning convention named in research/SEARCH-CONVENTIONS.md; the closest is Granville-Shao's published assertion that the result is known, which carries no proof locator for the Mobius case. The estimate is derived here from four numbered results of Koukoulopoulos, GSM 203 (Corollary 13.4, Theorem 26.2, Theorem 26.6, equation (26.3)) plus Vaughan's identity for mu, with B(A)=A+6 and an ineffective constant. This is a derivation from published theorems, not a refereed theorem, and it is read from the author's preliminary version of that book. | [mobius-bv-derivation.md](mobius-bv-derivation.md) |\n| C | `Q-moving-cutoff-parity` Does a proof-level reading of the shifted-Mobius sieve give a valid, explicit error-tolerant arithmetic target, and does its divisor switching preserve the moving boundary? | ANSWERED | CHECKED prior art: Murty--Vatwani already supplies the conditional squarefree/parity mechanism and fixed-residue reduction. Its printed p. 654 swap omits n+h>ey; an exact finite counterexample verifies failure of that equality. DERIVED dyadic repair keeps the boundary and gives S=C2*x-2*C2*M+D_y+O_A(x/log^A x). A one-sided D_y>=-4*x/25+o(x) on unbounded dyadic scales is sufficient, using the certified margin C2*(1-A2)>33/200. That discrepancy estimate remains OPEN. Vatwani's recovered author preprint clarifies the one-odd-exponent cases and unfilled near-level-one hypotheses. No new signed bound is obtained; literature novelty is unestablished. | [moving-cutoff-parity.md](moving-cutoff-parity.md) |\n| C | `Q-next-correlation-source-map` Is there a primary-source statement with stronger scale or coefficient quantifiers than the ones the prime-band transfer actually consumed? | ANSWERED | Scoped negative for the inspected statements: function-class and rate mismatches remain. The coordinating review withdraws the all-scales/dyadic-omitting requirement as a necessary gate, since bounded-interval stability yields a weak dyadic scale average from the existing input. No sufficient rate or full-coefficient theorem is matched. Proper-prime-power terms are already negligible on the fixed corner; other prime-r cofactor branches remain open. | [next-correlation-source-map.md](next-correlation-source-map.md) |\n| C | `Q-next-transfer-review` Does prime-band-transfer.md (1)-(6) follow at exactly its stated scope, and does any step fail against an adversarial reading of its hypotheses? | ANSWERED | The derivation (1)-(6) survives at its stated continuous-average scope. The coordinating round review corrects check l: interval stability additionally gives a dyadic scale average, with a further exponent loss. There is no every-dyadic estimate, o(N), full-corner control or twin margin. Proper-prime-power branches have a separate negligible fixed-corner bound. | [next-transfer-review.md](next-transfer-review.md) |\n| C | `Q-paired-factor-budget` Does averaging the proposed two-small-prime loss and three-small-prime gain using existing distribution theorems make their net contribution sufficient for the current twin consumer? | ANSWERED | DERIVED from the matched classical inputs, with finite rational enclosures VERIFIED: the explicit positive family has liminf P3/(C2*x)>1, but liminf (N2-P3)/(C2*x)>11/10. Keeping only these families and the main term therefore fails at the current cutoffs. Pan--Ding supplies aggregate level x^(9/20), stronger than the earlier per-cofactor application; the complete signed margin remains OPEN. The aggregation machinery is prior art and literature novelty of this application is unestablished. | [paired-factor-budget.md](paired-factor-budget.md) |\n| C | `Q-polylog-fold-transfer` Can the fixed-fold calculation be made uniform at growing depth, and transferred to the actual bilinear remainder with an adequate error? | ANSWERED | The local bilinear model is O_H(x/log^H x) uniformly for polylogarithmic squarefree moduli. Its absolute reconstruction error is at least (1/2+o(1))*x. The needed signed reconstruction bound remains OPEN, so this model does not establish the twin-prime lower bound. | [polylog-fold-transfer.md](polylog-fold-transfer.md) |\n| C | `Q-prime-band-completion` Can the remaining squarefree correlation be localized to simpler prime and harmonic bands, and does completion then permit a direct general bilinear Kloosterman estimate? | ANSWERED | The pilot reduces, with power-saving endpoint errors, to p in (x^0.235,x^0.24], q in (x^0.045,x^0.05] and positive h in (x^0.029,T], with T=O(x^0.0342). Both primes exceed 2h eventually. Completion is exact but produces coupled h-dependent coefficients on every dual residue modulo q. Its full-frequency Kloosterman matrix has norm exactly q, so a uniform power saving by an arbitrary-coefficient operator bound is impossible at that scope. This completion alone leaves the 61/20000 budget deficit; prime-dispersion.md controls the pilot using a different second moment. No twin lower bound is established. | [prime-band-completion.md](prime-band-completion.md) |\n| C | `Q-prime-band-transfer` Can the nonmultiplicative prime-band weight be represented by bounded multiplicative functions, and what does an available quantitative correlation theorem actually give after all scale and normalization costs? | PARTIAL | A smooth Fourier superposition represents mu(n)L_B(n)/log X exactly on n<=2X+2. The quantitative non-pretentious input and a mesh give a continuous scale-average saving for the exact s=s'=1 windows. The round review additionally derives a dyadic scale-average saving by bounded-interval stability, with exponent c_*/2. Neither estimate gives an every-dyadic bound, o(N), full-corner control or a twin margin. The extension in cofactor-progression-transfer.md now estimates a growing polylogarithmic cofactor family; the full remainder remains open. Proper-prime-power branches have the separate bound in corner-correlation §1.1. | [prime-band-transfer.md](prime-band-transfer.md) |\n| C | `Q-prime-detection-inputs` Can we give a locally correct positive comparison sequence, justify the ordinary arithmetic inputs, and prove exactly what one additional estimate would buy? | ANSWERED | Yes: the comparison sequence and Type I estimates are derived, and a classical Vaughan decomposition gives S(x)=C2*x+B(x)+O_H(x/log^H x) for every fixed H. A fixed one-sided saving over B>=-C2*x+o(x) implies twins on unbounded scales. This is a fully specified classical reduction, not a new cancellation estimate or proof mechanism. | [prime-detection-spec.md](prime-detection-spec.md) |\n| C | `Q-prime-dispersion` Can a second moment retaining two right primes control the remaining localized squarefree pilot after its actual conductor and coefficient costs are included? | ANSWERED | Yes at this rectangle: aggregation in m=dp before Cauchy gives a logarithmically bounded coefficient on a long interval. The only zero-phase pairs are identical (q,h). Distinct primes give modulus e*q1*q2 with gcd loss at most O(A*Z); completion and Weil bound all off-diagonal terms. The diagonal has exponent 1989/2000 and the largest off-diagonal exponent is 1173/1250 before an arbitrarily small loss. The remaining high-frequency polynomial is O(x^(199/200)); consuming the previous reductions gives R_IJ=O_H(x/log^H x) at D=x^0.277, E=x^0.467. This is a full rectangle at product scale x^0.744, not a uniform product cutoff or a twin lower bound. | [prime-dispersion.md](prime-dispersion.md) |\n| C | `Q-prime-power-dispersion` Does the repeated-prime structure control the BB contribution beyond its two-norm bound, and can a prime-power moment include every harmonic uniformly? | ANSWERED | The decomposition leaves an exceptional coefficient with norm at most sqrt(D) times logarithms; its odd prime-power core has a derived all-harmonic dispersion bound. The same bound for first powers removes the former left-prime cutoff and unpaired diagonal constraint. Two strict inequalities control a region including d~x^0.247, e~x^0.612 at product scale x^0.859. Their product-exponent supremum is 5757/6700, not a uniform product cutoff or a twin lower bound. Exact finite checks run separately from this classical-input derivation. | [prime-power-dispersion.md](prime-power-dispersion.md) |\n| C | `Q-reachability-coverage` Which part of the original divisor domain can no improvement to the grouped moment's nonzero kernel reach, in either orientation, and what would a uniform saving on that kernel actually buy? | ANSWERED | For a prescribed fixed exponent margin eta0, the zero budgets leave S_0={p<2eta0,q<2eta0} below that required margin regardless of the nonzero-kernel saving. Uniform gamma=2 covers its complement at that prescribed margin. Smaller positive margins can reach fixed interior points of S_0; only p=q=0 remains at zero budget one for every margin. The proposed eta0~loglog x/log x substitution is not justified by estimates carrying x^epsilon losses; its box count is geometry only. The sufficient twin margin remains OPEN. Independent review F3 and F5 correct the quantifiers and the prime-power tail proof; round-review-0906 corrects the diagonal scope, fixed-margin bulk claim and six-cut separation. | [reachability-coverage.md](reachability-coverage.md) |\n| C | `Q-research-execution` How should agents use the integrated returns, avoid repeated work and select the next bounded research obligation? | ANSWERED | The second dispatch from 1285d47 closed at 46fa948 and was independently reviewed on 2026-09-09. A/A2/B/C/D/E and V/W returns are present and integrated at their owning scopes. A2's corrected Type I estimate is accepted; D's fourth residual cut is retained and its remaining moment saving corrected to 7/200. C's low nonzero modes and E's aggregate scope are corrected. No new assignment is started by this integration; next obligations are candidates, not running work. Twin-prime infinitude and every sufficient signed margin remain OPEN. | [RESEARCH-EXECUTION.md](RESEARCH-EXECUTION.md) |\n| C | `Q-research-handoff` What must an incoming research agent understand, verify and return before its work can advance the current twin-prime argument? | ANSWERED | Current handoff after the 2026-09-09 independent review of the dispatch ending at 46fa948. The full residual has four simultaneous complement conditions after D's regional estimate. A's centered truncation and A2's repaired low Type I estimate give the alternative S=C2*x+B+O_A(x/log^A x). B and all sufficient signed margins remain OPEN. The C3 absolute bound, family identities and scoped C/E failures retain their owning hypotheses. Execution is owned by RESEARCH-EXECUTION.md. | [RESEARCH-HANDOFF.md](RESEARCH-HANDOFF.md) |\n| C | `Q-research-round-validation` Which submitted results from lanes A, A2, B, C, D, E, V and W survive direct review, and what can be integrated or used to choose the next attempt? | ANSWERED | Reviewed incoming commits 07ab47f through 46fa948 on 2026-09-09. A's truncation and A2's repaired low Type I estimate are accepted with bookkeeping corrections. B's ordinary-BV family identity survives; its uniform Dickman constant and complement condition are repaired. C's norm obstruction survives on all smooth inputs, but low nonzero Fourier modes are also 1-bounded. D's block estimate and fourth residual cut survive; its next moment saving is 7/200, not 17/200. E's rough-product distribution and aggregate constant 4 are accepted at the stated Wu uniformity reading; rational certificates close the two displayed tests for every fixed u>4. W remains OCR-only at the original 1974 theorem page. All sufficient twin-prime margins remain OPEN. | [research-round-validation.md](research-round-validation.md) |\n| C | `Q-residual-coverage` What portion of the full residual is controlled with uniform margins, and can the exceptional first branch improve that coverage rather than just a regional corner? | ANSWERED | The first-branch and prime-free moments remove the exceptional norm condition. Full rectangles are controlled when delta+nu<19/25 or 5delta+2nu<123/50. Uniform twists justify exact coupled cuts: every fixed de<=x^theta with theta<19/25, and d^5*e^2<=x^lambda with lambda<123/50, as well as their union, have arbitrary fixed logarithmic savings. A concrete remaining endpoint sum has de>floor(x^(3/4)) and d^5*e^2>floor(x^(49/20)). Its twin margin is OPEN. The right zero-frequency budget, after an extra Cauchy inequality, limits the uniform product range; the left cross moment limits the other edge. Finite checks validate identities and masks, not asymptotic rates. | [residual-coverage.md](residual-coverage.md) |\n| C | `Q-review-request-0906` Which claims of the arithmetic campaign should an independent reviewer check, in what order, against which records, and what must the review return? | ANSWERED | Completed review specification at the bounded scope recorded in handoff-review-0906.md and reports 20 and 21, with the subsequent round reviewed in round-review-0906.md. The dependency list records questions at dispatch, not current unfinished assignments. Imported proofs retain their review limits and the twin margin remains OPEN. Current assignments are in RESEARCH-EXECUTION.md. | [REVIEW-REQUEST.md](REVIEW-REQUEST.md) |\n| C | `Q-round-review-0906` Which conclusions of the completed agent round survive review, and which corrections change the next research specification? | ANSWERED | The fixed-band lift and continuous moving-window estimate survive the checked source interface. Interval stability additionally gives a dyadic scale-average logarithmic saving, so the blanket scale exclusion was too strong. The rate and missing prime-cofactor terms with s>1 or s'>1 still prevent a twin margin. Proper-prime-power branches already have a negligible bound on the fixed corner. The driver computes integer parity, not the CRT gcd partition; its total coefficient identities survive. Diagonal lower-bound, reachability and six-cut bookkeeping overclaims are corrected. No region, exact residual cut or twin lower bound changes. | [round-review-0906.md](round-review-0906.md) |\n| C | `Q-sharp-corner-transition` What is the energy of the complete sharp corner coefficient, and can the smoothed estimate be transferred through a negligible L2 transition? | ANSWERED | DERIVED using named analytic inputs: for each fixed 00 both sharp squared norms and sharp-minus-smoothed squared norms are Theta_eta(x log^2 x) on the actual dyadic intervals. Thus an O_eta(x log x) sharp squared norm or negligible L2 transition fails in that range. Signed transition correlations and the global complement remain OPEN. No region, exact residual cut or twin margin changes. | [sharp-corner-transition.md](sharp-corner-transition.md) |\n| C | `Q-shifted-prime-decomposition` Does decomposing Lambda(dk-2) give a provable saving on any part of the actual shifted-prime sum, and what exact arithmetic remains outside the imported hypotheses? | ANSWERED | Both second Type I terms are O_H(x/log^H x) by classical Mobius BV. The residual is an explicit weighted sum over dk-ev=2, equivalently an average of two-linear-form Mobius correlations with growing coefficients and possibly one-point intervals. Its required one-sided improvement is OPEN. No twin lower bound or novelty is claimed. | [shifted-prime-decomposition.md](shifted-prime-decomposition.md) |\n| C | `Q-shifted-prime-mobius-sums` At reachable x, do the shifted-prime Mobius and Liouville sums, the cleanest instance of the parity input the twin reduction lacks, show any size or sign structure that a random-sign model does not, and how loose is the trivial bound on M(x) used for the centered tolerance? | ANSWERED | MEASURED to x=2^38 (10.9e9 primes). All four sums sit at random-sign size: \\|U\\|/control rms at most 2.8 at any j, slopes 0.28 to 0.65 against the control's 0.43 to 0.47 with per-draw spread 0.19 to 0.30; the pre-registered structure falsifier did not fire. M(x)/x is at most 8.8e-5 in magnitude for j>=29 against the trivial bound 0.374, so the -4x/25 tolerance in moving-cutoff-parity is loose by four orders at these scales; a proof still needs a bound on M, which is the same parity object. The squarefree density of p+2 among primes is 0.747911 at 2^38 against 2*Artin = 0.7479116. pi(2^j) matches OEIS A007053 at every j. Nothing here bears on the asymptotic conjecture. | [shifted-prime-mobius-sums.md](shifted-prime-mobius-sums.md) |\n| C | `Q-signed-divisor-grouping` Can grouping different fibers while retaining their Mobius signs control an explicit part of R, and what signed error remains after that grouping? | ANSWERED | For every fixed H>0 the actual remainder restricted to de<=x^(7/10) is O_H(x/log^H x), although each sign's mass there is at least c*x*log(x) eventually. This follows from a written classical-input derivation, with finite algebra and archived-factor checks. The remaining de>x^(7/10) contribution reduces to an explicit weighted CRT endpoint discrepancy whose required one-sided improvement is OPEN. | [signed-divisor-grouping.md](signed-divisor-grouping.md) |\n| C | `Q-signed-moment` Is there an argument for the block that does not pay sqrt(M) at the first Cauchy inequality or that extracts cancellation from the R=0 class, and what are its budgets at the corner a=b=1 and at the target box (delta,nu)=(8/25,9/20)? | PARTIAL | The true diagonal has an upper bound x^(1+o(1)) on the transition band, not a uniform nonzero lower bound. Lemma A controls only u1=u2,h1=h2; unequal proportional R=0 pairs remain outside it. Lemma B and the now-priced joint Cauchy arrangement add no region. The former general Holder floor is valid only under additional coefficient assumptions, not for arbitrary sparse coefficients. Conditional off-diagonal budgets and the random-matrix ceiling remain conditional and heuristic. No necessity of using both signs, full-corner estimate or sufficient twin margin is established. | [signed-moment.md](signed-moment.md) |\n| C | `Q-singleton-fiber-audit` Can the one-point fibers of the coupled remainder be discarded or controlled in absolute value at scale x, and what do the actual weights and archived intervals show? | ANSWERED | The grouped coefficient is zero whenever either integer is prime. Each sign's ungrouped singleton mass is at least c*x*log(x) eventually for an absolute c>0, by a written derivation from named classical inputs. Finite full-interval and archived-prefix checks validate the partition. The signed singleton and longer-fiber contributions remain OPEN; no twin lower bound or novelty is claimed. | [singleton-fiber-audit.md](singleton-fiber-audit.md) |\n| C | `Q-small-divisor-kernel` Does reciprocity separate the j<=x^(1/20) kernel of grouped-divisor-moment (21) at delta=8/25, nu=9/20, and do the Duke-Friedlander-Iwaniec / Bettin-Chandee and Kuznetsov interfaces then supply the required saving? | ANSWERED | The separation is exact and cheap: reciprocity splits index by index, the correction phase has sup norm and total variation O(A/(MN))=O(1/x) at this box, and Mellin separation of the endpoint weight costs x^epsilon with L1 mass min(1,Ax/(MN)), so the whole block reduces to a pure trilinear Kloosterman fraction with unimodular twists. The interfaces then fail by explicit amounts: Bettin-Chandee Theorem 1 gives block exponent 129/125, above the required 1 by 4/125 and above the classical 103/100; DFI (1.1) gives 1267/1200; every box Bettin-Chandee controls is already controlled, verified on 19005 rational boxes; the audit's spectral diagnostic factor is trivial for all common divisors up to x^(19/50). Closing this box inside the same interface needs the (M+N) exponent below 27/140 or the (AMN) exponent below 9/28. Target (21) and the global twin margin remain OPEN; nothing is added to the controlled region. | [small-divisor-kernel.md](small-divisor-kernel.md) |\n| C | `Q-smooth-sieve-literature` Which nearby published results should be imported instead of rediscovered, and do their methods give a more focused next question for the complete global remainder? | PARTIAL | Existing sources supply the finite-difference mechanism, one-point concentration and quadratic profile optimization; shifted divisor-sum estimates admit fixed shift two under their own support and smoothness conditions. A derived application of corrected Henriot bounds gives small-prime mass O_sigma(delta^sigma x)+O_epsilon(x^(39/40+epsilon)), uniformly in delta for fixed 0floor(x^(77/100)) as a fourth simultaneous condition of W_dagger through the Perron machinery, changing only the summation domain of E_dagger. The target box (407/400), the corner, the uniform product threshold 19/25, the sign of E_dagger and the global twin margin are unchanged; the margin remains OPEN. | [structured-dispersion-estimate.md](structured-dispersion-estimate.md) |\n| C | `Q-supported-coefficient-dickman` Can the whole supported coefficient be priced using existing literature before enumerating its factor cells, and does the resulting separate-sign sieve estimate supply a positive twin margin? | ANSWERED | DERIVED from classical inputs: at delta=1/100 the harmonic limit is H_delta=D(25/12)-1+E_delta with 0<=E_delta<=24/22!, hence -13/2, where I is the explicit ordered two-factor integral below. A three-prime left input and rough composite right input suffice; prime partners are subtracted using an upper sieve. The witness survives every fixed delta<1/50 and every averaging profile with the same plateaus. Consequently the negative-only consumer is false, and liminf Phat/(C2*x)>1/2. The signed twin margin remains OPEN; literature novelty is unestablished. | [switching-negative-mass.md](switching-negative-mass.md) |\n| C | `Q-transition-energy-review` Does the sharp-energy chain in sharp-corner-transition.md survive an adversarial check, and do the upper norm, the small-fixed-eta lower norm and the failed negligible transition each stand at their stated scope? | ANSWERED | All ten assigned rows survive at their stated scope; no counterexample or decisive contradiction was found. The upper norm, the small-fixed-eta lower norm and the refuted negligible L2 transition each stand separately. Two repairs are citation-level only: the integer Barban-Vehov input is Graham 1978 quoted by Chen An, and the note should record why the k=Q constant is absolute. The de la Breteche-Dress-Tenenbaum PDF was refetched and its SHA-256 matches the pinned hash; its (1.5) and Theorem 1.1 supply exactly the imported (3) and (4). eta_0 remains positive and unextracted, and the signed sums, E_out and the twin margin remain OPEN. | [transition-energy-review.md](transition-energy-review.md) |\n| C | `Q-transition-energy-review-spec` What independent checks are required before the sharp-energy and non-negligible-transition conclusions can guide the next signed research attempt? | ANSWERED | Bounded review assignment with explicit source, algebra, interval, error and quantifier checks; per-claim verdicts and dependency consequences are required. The assignment is specified, not executed. | [transition-energy-review-spec.md](transition-energy-review-spec.md) |\n| C | `Q-transition-joint-budget` Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | PARTIAL | The exact split, cutoff-average identities and separate upper budgets survive. Averaging cutoff norms after triangle and Cauchy is saturated for sufficiently small fixed eta, but signed cutoff arguments and joint cancellation are not closed. R_00 need not be estimated separately under every grouping. The short-window constraint is corrected with a bounded majorant and a safely reduced lower constant. No consumer input or signed improvement is supplied; E_out and the sufficient twin margin remain OPEN. | [transition-joint-budget.md](transition-joint-budget.md) |\n| C | `Q-transition-joint-budget-spec` Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | ANSWERED | Bounded assignment to audit the exact four-term decomposition, price a concrete joint treatment, and return a sufficient one-sided or common-scale inequality with all open terms explicit. The decomposition and existing norm budgets are inputs, not new findings. | [transition-joint-budget-spec.md](transition-joint-budget-spec.md) |\n| C | `Q-transition-research-execution` How should the core research handler execute and integrate the three bounded transition assignments while retaining the central signed estimate? | ANSWERED | Prepared execution contract with a fixed mathematical baseline, three independently assignable specs, handler-owned signed research, dependency checks, shared-file ownership, reporting requirements and stopping rules. Execution is complete; the corrected results are in transition-round-review.md and transition-round-audit.md. The specification itself supplies no arithmetic estimate. | [TRANSITION-RESEARCH-EXECUTION.md](TRANSITION-RESEARCH-EXECUTION.md) |\n| C | `Q-transition-round-audit` Which conclusions of the completed transition round survive direct review, which require correction, and what research decisions remain justified? | ANSWERED | The sharp upper norms and sufficiently-small-fixed-eta lower norms survive. The integration contained substantive errors: an omitted lower cutoff, an incorrect Mellin formula for the transition, a conflation of singleton divisor fibers with long cofactor fibers, an unpriced source representation and overbroad closures of joint or cutoff arguments. Owning notes and current records are corrected. No signed improvement or sufficient twin margin is established; the corrected cofactor and joint-correlation interfaces remain open. | [transition-round-audit.md](transition-round-audit.md) |\n| C | `Q-transition-round-review` What survives the executed transition round after direct review, and what combined estimate is still missing? | ANSWERED | The energy chain survives at its original scope; the integration's missing cutoff, Mellin representation, fiber identification, normalization and general closure claims are corrected. The exact cofactor and joint-cutoff formulations remain useful. No signed estimate, controlled region, exact cut or sufficient twin margin changed. Only the stated norm-only procedure and the arbitrary-factor fixed-shift relaxation are refuted at their specified scopes. | [transition-round-review.md](transition-round-review.md) |\n| C | `Q-transition-signed-estimate` Can the signed transition kernel (E1) be estimated beyond its absolute norm budget, and if not, what exact input does the consumer need? | PARTIAL | No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN. | [transition-signed-estimate.md](transition-signed-estimate.md) |\n| C | `Q-transition-source-match` Do the inspected divisor-correlation, shifted-convolution and averaged-Chowla statements directly supply a usable estimate for the exact transition kernel? | ANSWERED | No direct supplier was established among the inspected statements. The cofactor exchange and Theta identity are exact, but their scalar coefficient mass is not a full bounded-class representation for T. The transition Mellin kernel requires a sharp subtraction with a 1/s tail. Fixed-divisor singleton fibers differ from potentially long cofactor fibers. The fixed-shift arbitrary-factor relaxation is refuted; broader signed and cutoff methods remain open. | [transition-source-match.md](transition-source-match.md) |\n| C | `Q-transition-source-match-spec` What bounded source investigation could supply a usable signed estimate for the transition kernel, and how must its hypotheses and losses be priced? | ANSWERED | Specification for up to three detailed source-interface assessments, including coefficient representation, scale quantifiers, normalization, separation errors and exact downstream payoff. No new theorem match or literature-absence result is claimed. | [transition-source-match-spec.md](transition-source-match-spec.md) |\n| C | `Q-twin-reduction` What has the arithmetic campaign of 2026-09-05 and 2026-09-06 actually established about the twin sum, at what calibration, what exactly remains, and what would suffice? | ANSWERED | Consolidates the checked regional reduction S=C2*x+E_dagger+O_H(x/log^H x), its sufficient unbounded-scale margins, coefficient definitions and source dependencies. Later complete smooth and centered formulations are owned by RESEARCH-HANDOFF.md and their linked derivations. No new arithmetic estimate is supplied. Imported theorem proofs retain their stated review limits; every sufficient twin margin remains OPEN. | [TWIN-REDUCTION.md](TWIN-REDUCTION.md) |\n| 9 | `Q-applied-0828-varE` Were the Var/E red team's corrections applied to the four HELD notes? | ANSWERED | Every WEAKENED and REFUTED verdict in redteam-0828-varE.md is applied to its target note in the present tense; four ledger verdicts are rewritten, the theta=1 row is raised to PROVEN, and seven live-doc sentences plus one producer reading stay open and are drafted here. | [applied-0828-varE.md](history/staging/applied-0828-varE.md) |\n| 9 | `Q-lit-scourfield-2008` Does Scourfield, Smooth divisors of polynomials (LMS Lect. Note Ser. 352, CUP 2008, 286-311), supply the divisor-distribution estimate that varE-theta2-proof.md section 6 leaves open? | ANSWERED | DOES NOT DELIVER, at SECOND-HAND rung, and the chapter is still UNREAD at the page: ten channels were attempted, nine answered, and every one that answered is closed, degraded or paywalled, but the author's own restatement of the 2008 theorem, read at the page image of Scourfield, Funct. Approx. 55.1 (2016) 84 eq. (1.1), counts divisors m <= x of f(n) for n <= x with weight 1, for f a product of pairwise coprime irreducible factors each of degree at least 2, and the open step needs divisors n > 2L above the window, carrying a branch-dependent weight of total mass 4^omega, for the product of three LINEAR factors C(C-2)(C+2). Two gaps each independently fatal, plus a third that is AMBIGUOUS between two author-sourced statements and does not carry the verdict. One correction to lit-smooth-divisors.md is earned: the precision register of the owning convention is not uniformly (log y)^{o(1)} or order-of-magnitude, since (1.1) is an asymptotic with relative error O(1/log x), which is the right register and one epsilon short of the o(1/ln y) the open step needs. Step 1 of Var/E does NOT become conditional on a citation, and no absence may be written, since the chapter's interior lemmas were not read. | [lit-scourfield-2008.md](history/staging/lit-scourfield-2008.md) |\n| 9 | `Q-paper-iii-restructure` Is Paper III restructured around the proven model theorem? | ANSWERED | Yes. paper/variance-note.md now carries four new sections in place of its fit narrative: sec.8 the proven spectral form (Var/E = delta X, delta ln^2 W -> 16 C_2 e^{-2gamma}/3 = 1.109905, the Montgomery-Soundararajan main term exactly L prime by prime, so all of Var/E is discrepancy), sec.9 the decoupled model with Theorems 7 and 8 and Lemmas 9-11 written out with proofs and the closed form lambda_2(2) = 1 - e^{-2gamma}(9/2 - 4 ln 2) = 0.45546 plus the theta = 1 identity with Gorodetsky, sec.10 Conjecture 1 (delta(X - X_dec) -> 0) with eight exact ratios, two of three lag groups closed and the third named as a divisor-distribution statement not yet searched, and sec.11 the 0.611 refutation as a short calibration paragraph; sections 1-5 are untouched, the abstract and section 6's open question are rewritten to match, and the \"u = 2 exactly\" defect in section 7 is corrected. | [paper-iii-restructure.md](history/staging/paper-iii-restructure.md) |\n| 9 | `Q-recon-0830-smooth-aps` Does any theorem on y-friable integers in arithmetic progressions (Granville, Fouvry-Tenenbaum, Soundararajan, Harper, Drappeau, Drappeau-Granville-Shao) supply the uniform o(1) equidistribution that attack-0830-varE-identification.md section 4 leaves open, for moduli up to y^(4/5) with the lam1 weight and the squarefree restriction? | PARTIAL | NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength. | [recon-0830-smooth-aps.md](history/staging/recon-0830-smooth-aps.md) |\n| 9 | `Q-redteam-0828-varE` Does the 2026-08-28 chain from the exact comb variance to lim Var/E = Pr[GD(2) > 2] = 0.45546 survive an adversarial re-derivation, and does the refutation of the 0.611 reading hold? | ANSWERED | The constant survives at HEURISTIC and the 0.611 refutation is CONFIRMED and strengthened (the frozen out-of-sample half of the protocol also fails on the control); the correction is that TWO steps are open, not one, and that the theta=1 branch is an exact identity with a read theorem rather than a second-hand numerical match. | [redteam-0828-varE.md](history/staging/redteam-0828-varE.md) |\n| 9 | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| 9 | `Q-redteam-0830-slack` Do attack-0830-head-remainder.md, attack-0830-tail-derivation.md and verify-0830-record-defects.md survive an adversarial re-derivation on independent code, and do the five riders the verification put on live notes stand as written? | ANSWERED | Arithmetically they survive: every figure of the three notes that this pass could recompute reproduced to the printed digit on code written from the definitions, 0 assertion failures over 58 assertion call sites (most inside per-level loops), including every figure of the verification's three claims and the half-decade Delta_HL it quoted rather than recomputed. Four sentences do not survive. (1) verify-0830-record-defects.md:316, a replacement queued for head-residual-hl3.md sec.0, says the pooled value sits \"0.038 to 0.052 below the sub-window mean at all three decades\"; measured, the two lower decades run to 0.076 and 0.066, and the same note's own falsifier row says 0.038 to 0.076, so the wrong half is the one queued to land. (2) verify-0830-record-defects.md:379's un-measured \"+0.005\" residual inside the eighths is +0.0004 measured at sixteenths, so the de-pooled top-decade value is converged and the caution can be dropped. (3) the ruling that the class null is \"the matched figure\" for the tail is matched on residue class only: p'^2 is coprime to every q <= p', and the ensemble's rough-class offset is E_rc - R = 5.6714 -> 7.5357 over x = 7..29 against the class null's 5.6000 -> 6.0336, giving t/(R_shell + 7.5357) = 1.0123 against t/classNull = 1.0157. (4) attack-0830-head-remainder.md sec.3's top row is not gap-scale matched: E[g] 244.0 against 235.9, y_match capped at 19997, and on the note's own six ensemble points Delta_ens ~ E[g]^-0.312, so meas/ens reads 0.9640 not 0.9539 and the headline \"0.954 to 0.995\" reads 0.964 to 0.995. Three levels the notes recorded as out of reach are run here: the X2 group at x = 23, the tile identities and conditionals at x = 29, and the ensemble ladder at y = 29 (pipe/ens 0.9535, 40 s, against the head note's \"about fifteen minutes\"). No route opens or closes and nothing here touches Z2. | [redteam-0830-slack.md](history/staging/redteam-0830-slack.md) |\n| 9 | `Q-var41` What does the stable law predict for Var(41), and what can the tenth Var/E point pin? | OPEN | Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift. | [var41-prereg.md](history/staging/var41-prereg.md) |\n| 9 | `Q-varE-identification-0830` Can either open step behind lim Var/E = 0.45546 (the identification delta*(X - X_dec) -> 0, or the theta = 2 mean-coefficient replacement) be proven, and if not, which single inequality does not close? | PARTIAL | Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength. | [attack-0830-varE-identification.md](history/staging/attack-0830-varE-identification.md) |\n| 9 | `Q-varE-limit` Does lim Var/E on the diagonal window exist, and what is it? | PARTIAL | The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open. | [lit-dickman-variance.md](history/staging/lit-dickman-variance.md), [lit-smooth-divisors.md](history/staging/lit-smooth-divisors.md), [varE-asymptotic.md](history/staging/varE-asymptotic.md), [varE-exact-ladder-01.md](history/staging/varE-exact-ladder-01.md), [varE-limit-theorem.md](history/staging/varE-limit-theorem.md), [varE-spectral.md](history/staging/varE-spectral.md), [varE-theta2-proof.md](history/staging/varE-theta2-proof.md), [varE-theta2-step.md](history/staging/varE-theta2-step.md) |\n| 9 | `Q-verify-record-defects-0830` Do the three defect claims of 2026-08-30 (attack-0830-varE-identification.md sec.8 on the doubled X2 column; attack-0830-tail-derivation.md sec.7 on the corpus's \"R + 1/2\"; attack-0830-head-remainder.md sec.1 on the decade-pooled Delta = 0.6214) reproduce on independent code from the definitions, and which of the corrections they list apply? | ANSWERED | Claim 1 CONFIRMED: the corpus delta*X2 column is the positive half of the p \\| h-2 pattern doubled, that pattern's mirror is the p \\| h+2 pattern (W-(-h) = W+(h) exactly, W-(h) != W-(-h) at 9 to 900,679 shifts), the group sum 2X2 reads -0.5603 .. 0.1846 at x = 7..19 against 5.7147 .. 5.3266, and Xmix is overstated 2.305x at x = 19 (6.9x at x = 7); X, X1 untouched. Claim 2 AMENDED: R + 5/2 and R + 3 are exact for the tail convention (all and odd origins, asserted at x = 7..23) and t/(R + 3) = 1.0228, but head-residual-factor.md:70 is the HEAD's forward convention where R + 1/2 and R + 1 are exact, so that correction does not apply; and p'^2 is 1 mod 6, where the tail constant is 5 (t/(R + 5) = 1.0181), with the class null (1.0157) the matched figure, so 1.0228 is one unmatched convention replacing another. Claim 3 CONFIRMED as an artefact, AMENDED on mechanism and on the half-decade reading: 0.6214 pooled against 0.6592, 0.6705, 0.6736 at 2, 4, 8 sub-windows; the between-slope (Simpson) piece the note derives is half of the pooling term (0.0187 of 0.0378 at halves, 0.0261 of 0.0522 at eighths), the other half is the within slope's own fall with height weighted by Var(g); and re-reading the halves from their eighths puts HL BELOW the measurement at 5 of 6 half-decades by 2.5 to 3.4 percent at the top decade, so \"within 1.6 s.e., sign alternating\" is itself a pooled statement. | [verify-0830-record-defects.md](history/staging/verify-0830-record-defects.md) |\n| Z2 | `Q-X-upper-0829n` Can the rough-pair census X(K) on the stretch window be bounded above, unconditionally and with an explicit error term, by a dimension-2 upper-bound sieve, and how loose is the bound against exact X(K)? | PARTIAL | Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated. | [attack-0829n-X-upper.md](history/staging/attack-0829n-X-upper.md) |\n| Z2 | `Q-applied-0828-quadpoint` Were the quadpoint red team's corrections applied to the four HELD notes? | ANSWERED | Applied: the nine REFUTED and WEAKENED verdicts that target the four notes are written into them in present tense, with ledger blocks added; the tenth targets the sealed prereg, outside the fence, and is recorded in attack-quadpoint-02.md instead; three corrections owed by TODO.md Z2 and one by Z0 are listed here and are NOT applied. | [applied-0828-quadpoint.md](history/staging/applied-0828-quadpoint.md) |\n| Z2 | `Q-capture-identity` Does the transplanted cap family collapse onto a classical object, and what does the collapse say about the depth law and the wall? | ANSWERED | PROVEN, elementary: floor_K = T − X(K) on the half-open window with both members in [Q², Q′²), a convention that is load-bearing; the wall is renamed, not weakened; Σ capU counts each member against its own threshold, not against a uniform p_K, the two differing 11% to 37% at K*. | [quadpoint-identity-01.md](history/staging/quadpoint-identity-01.md) |\n| Z2 | `Q-derive-0904-r0-extension` Which pieces of the R0 decomposition (the tile form, the zone form, head, tail, Z2, and the composites R0/R1/R2/stretch) carry the parity obstruction's forbidden extension, and is any single piece both legal on the TPC-strength axis and exempt from it? | ANSWERED | No piece of R0 is both legal and exempt with content: the criterion reduces to a coordinate count (Proposition A) under which every statement forcing a twin pair into a range where roughness implies primality is covered, and the exempt residue is exactly the statements that assert no such forcing (R0's identity, lower bounds, boundary artefacts) plus the tile form, whose exemption is a property of the statement and provably does not close under deduction (Proposition B), so it survives only for routes with no sieve weight anywhere. | [derive-0904-r0-extension.md](history/staging/derive-0904-r0-extension.md) |\n| Z2 | `Q-parity-adversary` Does a parity adversary built on our own stretches survive at every level, and what precision class does a certificate need? | ANSWERED | It does NOT survive: the exact-data adversary dies at D* about Q^1.18 (MEASURED, exact arithmetic, 43 anchors Q <= 200), and the certificate that kills it is itself destroyed by 0.30 of one count per modulus, so Z2's precision class is now measured rather than described; it is PROVEN not to be a proof ingredient. | [attack-parity-adversary.md](history/staging/attack-parity-adversary.md) |\n| Z2 | `Q-parity-dstar-law-0829n` Does the exact-data parity adversary's killing level D*(Q) follow D* ~ Q^c with a stable c on the decades past Q = 200, and is c distinguishable from the independent-thinning null's? | CLOSED | No law in Q and CLOSED by the sealed kill rule (score 5 HIT, 1 MISS): MEASURED on 271 anchors 211 <= Q <= 13679, the Q-slope moves 1.446 to 1.204 to 0.575 across ranges while ln D* on ln width holds slope 1.097 +- 0.012 with a quarter of the scatter, D*/width about 0.5, and the independent-thinning null reproduces the width law within 0.025 in slope; the mechanism is that D* is where a modulus first reads a single position of the window, which is the wall survey's remainder statement in the stretch coordinate and names nothing new. | [attack-0829n-parity-dstar.md](history/staging/attack-0829n-parity-dstar.md) |\n| Z2 | `Q-quadpoint-blind-31607-0830` Does the zero-parameter depth law y*(Q), stated on the set where T(Q) >= 1 and on both the 1/(2e^gamma) = 0.280730 and the u*omega(u) = 2 (1/u* = 0.280438) forms with and without the finite-size Mertens factor, survive a sealed blind test on the bands past Q = 10007, and can that decade tell the two asymptotes apart? | ANSWERED | MEASURED, blind, and it decides nothing asymptotic: on 8363 new anchors 10009 <= Q <= 100003 the 76 sealed rows score 64 HIT and 12 MISS with every MISS on the two naked asymptotes as pre-declared, the two finite-size zero-parameter comparators HIT every row at every band (residual on ln y*/ln h -0.00022 to -0.00002 against C2), K*/pool falls 0.032 -> 0.026 -> 0.020 -> 0.016 -> 0.013 with no bend and a quiet sup, and the band means sit 0.0017 to 0.0037 below both asymptotes, six to twelve times their 0.000291 difference, so which limit the deficit tends to is set by the comparator and not by the data. | [blind-0830-quadpoint-31607.md](history/staging/blind-0830-quadpoint-31607.md) |\n| Z2 | `Q-quadpoint-c1c2-0830` Does the fourth decade's post-hoc, unsealed preference for the omega-form comparator C2 over the exact-Mertens comparator C1 (C1 above the data by 3.46 and 8.83 se at B11 and B12, C2 within 2.82 se) survive a sealed blind test at the fifth decade, Q in (100003, 316243], and what does that say about which mechanism explains the depth law's drift? | ANSWERED | MEASURED, sealed before the run and scored blind on 17702 new anchors, and it decides nothing asymptotic: the sealed D1 row HITs at both B13 and B14 (C1 above the data by 13.33 and 23.82 se, C2 within 1.26 and 1.82 se), so by the sealed rule the omega-at-finite-u crossing of import-rough-anatomy.md §2.1 is CONFIRMED over the exact-Mertens product of u2-engine-depth.md §5 as the depth law's main term at the sampling scale, while both still HIT every ±0.0015 row, the kill rows on C2 all HIT, K*/pool falls 0.013 -> 0.010 -> 0.008 with no bend, and the band means sit 0.0012 to 0.0018 below both asymptotes, so the two constants 0.280438 and 0.280730 stay unseparated by the pre-declared rule and the run separates two mechanisms, not two limits. | [blind-0830-quadpoint-c1c2.md](history/staging/blind-0830-quadpoint-c1c2.md) |\n| Z2 | `Q-quadpoint-prior-art` In the owning conventions, who holds the rough-pair census, the capture identity and the crossing law, and is any of it ours? | ANSWERED | The object and the identity are standard (the dimension-2 twin sifting function plus Buchstab's identity; ADJACENT-STANDARD, no verbatim carrier, no novelty language); only the comparison X(y) < T and the crossing law stay ABSENT-PER-CONVENTION, and the Buchstab correction is 6.6% of the top-band residual, not 2%. | [quadpoint-prior-art.md](history/staging/quadpoint-prior-art.md) |\n| Z2 | `Q-quadpoint-transplant` Does the anchored-cap family transplanted onto the stretch window S_Q certify every anchor, and what does the depth cost do with height? | ANSWERED | Pre-registration for the decade extension, committed ALONE before the segmented producer existed: it fixes the FALL trend line, the registered band readings, the kill rule and a digit-exact calibration gate that must abort before any new figure prints, and states that a falling K*/pool over two decades would still be only a measurement. | [attack-quadpoint-01.md](history/staging/attack-quadpoint-01.md), [attack-quadpoint-02.md](history/staging/attack-quadpoint-02.md), [quadpoint-decade-prereg.md](history/staging/quadpoint-decade-prereg.md) |\n| Z2 | `Q-recon-0828-rough` Does the 2000-2026 literature on y-rough numbers, sifted sets and short intervals hold any theorem that lowers Z2 or G2, meaning any control on the largest gap or the minimum count of a sifted set in EVERY short interval, or any structure of rough numbers a gap bound could use? | ANSWERED | No. Ten angles examined, ten killed for this purpose; the strongest every-interval statement in print for one-class rough numbers is Iwaniec's S(x,y,z) >= (4y/log^2 y)(log(y/z^2) - O(1)) for y >> z^2, uniform in x, giving J(P(z)) << z^2, and it is the linear sieve run exactly at its sifting limit beta_1 = 2 with no slack outside it; no two-class analogue exists in print at any exponent, the corpus's own x^4.2665 is beta_2 by the same mechanism, and every remaining branch of the field (Matomaki-Radziwill, Gorodetsky, Friedlander-Iwaniec Cor 6.28, Gafni-Tao) carries the almost-all quantifier, which a second-moment statement can never convert into a bound on one empty window. | [recon-0828-rough.md](history/staging/recon-0828-rough.md) |\n| Z2 | `Q-recon-0828-sieve` Is there anything in the 2008-2026 sieve literature, or in the parity-breaking literature, that lowers beta_2 = 4.26645 or supplies a consumer for a level theta > 1 on the two-class comb? | ANSWERED | No route. Twenty-one angles examined, nineteen dead on arrival, nothing in print beats 4.26645 at kappa = 2 at any level on four calibrated channels; the two survivors are an owning-convention row and one unresolved hypothesis in a five-page 1990 announcement whose stated requirement beta < 3 excludes beta_2 = 4.26645. | [recon-0828-sieve.md](history/staging/recon-0828-sieve.md) |\n| Z2 | `Q-redteam-0828-quadpoint` Do the four HELD quadpoint notes of 2026-08-22 survive an adversarial pass: the capture identity's proof line by line, the depth law and its asymptote, the sealed prereg scoring, and the prior-art citations at page level? | ANSWERED | The identity is PROVEN once its window convention is written down and holds at every K of 50 anchors under an independent implementation; four load-bearing sentences are wrong (section 4's gloss on Sum capU, v1 section 2's limit, the prior-art note's 2%, and the note's unconditional y* sentences), and none of the four defects opens or closes a route. | [redteam-0828-quadpoint.md](history/staging/redteam-0828-quadpoint.md) |\n| Z2 | `Q-redteam-0830-records` Do attack-0829n-parity-dstar.md (CLOSED, HELD) and attack-0830-record-mechanism.md (PARTIAL, HELD) survive an adversarial pass on independent code, does REFUTED row 95 stand as worded, and is TODO Z5's new title supported? | ANSWERED | Both notes' measurements reproduce on independent code and neither headline is refuted: D* is confirmed EXACTLY, by a BigInt rational simplex written here, at 299 of 376 anchors with 0 contradictions (the other 77 exceed the exact solver's size cap), the old range's 172-figure gate is re-derived exactly at all 43 anchors with 0 disagreements, and an independent 30-wheel sieve to 1e11 reproduces note (b)'s seven decade gap counts, CV^2 and far-tail slopes to every printed digit, with the counts also matching the published pi_2(10^k). Four sentences are wrong or over-stated and are replaced here: REFUTED row 95, note (a)'s ledger, its section 6 and TODO Z5 all attribute the null's 0.025 agreement to the WIDTH law when 0.025 is the ln Q slope difference (the width-slope difference on the same 84 matched anchors is 0.031); note (a) section 3's \"the threshold sits in a gap of at least 0.25 at every anchor\" is scoped in its own producer to the true arm and the null arm's exact gap is 0.1212; P6's HIT rests entirely on the decade-2 collapse that section 5 discounts as a sampler artefact when it discounts kill clause (a); and note (b)'s \"d b_z = 1.0806 +- 0.0014\" carries only the Monte Carlo pairing error, while moving the far-tail slope by 0.02 (against a spread of 0.0174 across six fit windows on the same decade and 0.1196 across decades) moves d b_z from 0.9888 to 1.1720, and continuing the law at slope 1 above the last resolved point still gives 0.7752. REFUTED row 95's CLOSED verdict stands on kill clause (b), which is better powered than the note presents it (paired s.e. 0.0401 against a 0.15 band), and the row needs two clauses reworded; TODO Z5's title is supported for \"measured and not derived\", and the resolved part of the law carries 72 per cent of the residual on its own with the extrapolation carrying the rest. | [redteam-0830-records.md](history/staging/redteam-0830-records.md) |\n| Z2 | `Q-redteam-0830-zone` Do attack-0829n-X-upper.md, blind-0830-quadpoint-31607.md and blind-0830-quadpoint-c1c2.md survive an adversarial re-derivation and an independent re-implementation of their producers, and at what rung does the corpus carry each of their headline claims? | ANSWERED | They survive on the numbers and mostly on the wording. On independent code every band sum, tier ratio, sealed forecast, band statistic and z of all three notes reproduces to the printed digit (X-upper 7.82 to 10.13 and the flat 378100.0; the fourth decade's 76 rows at 64 HIT and 12 MISS with the same twelve MISSes; the fifth decade's class A at both bands), and three attacks failed to break them (the paired-se attack on the D rows, a search for a fitted constant in C1, and gap-selection at the band edges). Four defects stand: the X-upper note's \"s_max 1.81 to 1.96\" is wrong in its own arrow convention, which means B3 to B8, since s_max peaks at B4 and reads 1.85 at B8; the c1c2 note's OLD R2 row at B14 is a boundary call that my 1-in-8 subsample scores the other way; the c1c2 note's custody line \"three tails, one code-sha256\" is a tautology of tailfmt.js and is not evidence of a seal; and the unscored y* check carries a Jensen bias of about +0.44 in y, which is the whole size of the C2 gap it is read as corroborating. Nothing here moves 4.2665 to 2, no rung rises, and all three notes stay HELD. | [redteam-0830-zone.md](history/staging/redteam-0830-zone.md) |\n| Z2 | `Q-redteam-0904-r0-extension` Do the seven load-bearing claims of derive-0904-r0-extension.md survive an adversarial re-derivation against Tao's own text, and do its proposed live-layer changes survive? | ANSWERED | Six of seven survive at their stated rung and one is refuted: Proposition A, the scope slip, row e'' and the equivariance transfer are CONFIRMED (the slip is strengthened, since Tao's own Example 2 is the target note's missing one-coordinate witness), Propositions B and D are WEAKENED (B's stated mechanism proves too much and its proposed insertion drops the qualifier that saves it; D's \"same trigger\" is near-definitional and its causal reading of the exponent band does not hold), and the claim that no corpus artifact certifies the window-count variance at width p'^2 is REFUTED by research/06-variance-theorem.js, which computes exactly that, brute-force verified at two levels; separately, EXEMPT throughout means \"Claim 1's H5 fails\", which is not the parity statement wall-note Face 1 is priced against, and the note's proposed live-layer text carries no H6 conditional. | [redteam-0904-r0-extension.md](history/staging/redteam-0904-r0-extension.md) |\n| Z2 | `Q-roughpair-error` How big is the empirical error of the rough-pair census, and is Z2 dead on the numbers? | PARTIAL | Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit. | [attack-roughpair-error.md](history/staging/attack-roughpair-error.md) |\n| Z2 | `Q-roughpair-null` Does the independent-thinning null named in attack-roughpair-error.md's defects list return chi2/df = 1, and is the measured sub-Poisson dispersion of the rough-pair census error real or a normalisation artefact? | ANSWERED | MEASURED, null-side, label (i), no bearing on the certificate: the independent-thinning null is binomial and returns 1 - p (0.8164 to 0.9808), not 1, so attack-roughpair-error.md's \"below 1 everywhere: sub-Poisson\" is WEAKENED and the registered F1 fires at u = 5; the deficit against the mean-matched null survives at pooled z = -5.87, -7.09, -11.39; and a CRT-exact null that only makes each prime's kill count exact in the window predicts 0.33 to 0.56, which the measured value EXCEEDS by 1.26 to 1.40, so D8 is interval-level in form, elementary in content, and not wall-relevant. | [measure-roughpair-null-0829.md](history/staging/measure-roughpair-null-0829.md) |\n| Z4 | `Q-applied-0828-census` Were the census red team's corrections applied to the three HELD notes? | ANSWERED | Every WEAKENED and REFUTED verdict in redteam-0828-census.md is applied to its target note in the present tense; two producer defects and four live-doc corrections stay open and are listed here. | [applied-0828-census.md](history/staging/applied-0828-census.md) |\n| Z4 | `Q-applied-0828-head` Were the head red team's corrections applied to the three HELD notes? | ANSWERED | Applied. Every WEAKENED and REFUTED row of redteam-0828-head.md lands in the note it targets as 42 prose edits, and all three ledger verdict lines now carry the surviving chain; four corrections fall outside the fence and are owed elsewhere, the load-bearing one being destroyer-census-01 §6(b)'s R and its h/R = 1.09 -> 1.03. | [applied-0828-head.md](history/staging/applied-0828-head.md) |\n| Z4 | `Q-applied-0828-live` Which engine and head red-team corrections reached the live layer? | ANSWERED | Nineteen edits across four documents: the glossary's cap_K dimension count with its mandatory sifted-versus-assumed clause plus three new entries (twin opener, head, tail); the survey's one-class density factor, S1's restored pi(q-1) terms and r in N_x hypothesis, the dropped Chen absorption, Theorem C with its emptiness, dimension 1 for q_i < q, the comb-conditioning qualifier and the inverted shallow-band bullet; the certificate engine's equidistribution status cell, the q = T^{o(1)} second hypothesis and the Comb Discrepancy scope cell; and the census's R as the continuum functional with its three comparators; paper/staircase-note.md, TODO.md and QUESTIONS.md are owed and untouched. | [applied-0828-live.md](history/staging/applied-0828-live.md) |\n| Z4 | `Q-destroyer-census` Who destroys each channel pair, what does the zone kill budget certify, and where does the counting certificate die? | ANSWERED | The census reproduces digit-exactly on an independent engine; the destroyer rule is positional, not temporal, the certificate holds at 15 zones and dies at p = 67 where B/C first crosses 1, and no first-mover excess survives the derived null. | [destroyer-census-01.md](history/staging/destroyer-census-01.md) |\n| Z4 | `Q-head-remainder-0830` Does the 5.3 percent remainder that Hardy-Littlewood leaves in the head's endpoint deficit Delta = 2 - beta derive by a route that is not HL: the frozen-sieve first-survivor object, a level-of-distribution correction, or the exact tile-ensemble head? | PARTIAL | No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2. | [attack-0830-head-remainder.md](history/staging/attack-0830-head-remainder.md) |\n| Z4 | `Q-head-residual` What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive? | PARTIAL | h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63. | [head-residual-factor.md](history/staging/head-residual-factor.md), [head-residual-hl3.md](history/staging/head-residual-hl3.md), [head-residual-null.md](history/staging/head-residual-null.md) |\n| Z4 | `Q-redteam-0828-census` Do destroyer-census-01.md, stretch-01.md and records-placement-01.md survive an independent re-derivation of every load-bearing claim, and may they leave HELD? | ANSWERED | All three survive on arithmetic, every decisive number reproducing exactly on an independent engine; one sealed reading (records READ-3) is REFUTED as vacuous and four sentences need correcting before integration. | [redteam-0828-census.md](history/staging/redteam-0828-census.md) |\n| Z4 | `Q-redteam-0828-head` Do the three 2026-08-28 head-residual notes survive an adversarial re-derivation of every load-bearing claim on independent code? | ANSWERED | Mostly yes on the numbers and no on two framings: \"h/R -> 1 iff beta CV^2 -> 2\" is REFUTED (the limit needs only boundedness, the product controls the RATE), and 9 to 59 percent of the quoted h - R is the choice of comparator, since R is the continuum functional and a discrete uniform origin sees R + 1/2 exactly. | [redteam-0828-head.md](history/staging/redteam-0828-head.md) |\n| Z4 | `Q-redteam-0830-slack` Do attack-0830-head-remainder.md, attack-0830-tail-derivation.md and verify-0830-record-defects.md survive an adversarial re-derivation on independent code, and do the five riders the verification put on live notes stand as written? | ANSWERED | Arithmetically they survive: every figure of the three notes that this pass could recompute reproduced to the printed digit on code written from the definitions, 0 assertion failures over 58 assertion call sites (most inside per-level loops), including every figure of the verification's three claims and the half-decade Delta_HL it quoted rather than recomputed. Four sentences do not survive. (1) verify-0830-record-defects.md:316, a replacement queued for head-residual-hl3.md sec.0, says the pooled value sits \"0.038 to 0.052 below the sub-window mean at all three decades\"; measured, the two lower decades run to 0.076 and 0.066, and the same note's own falsifier row says 0.038 to 0.076, so the wrong half is the one queued to land. (2) verify-0830-record-defects.md:379's un-measured \"+0.005\" residual inside the eighths is +0.0004 measured at sixteenths, so the de-pooled top-decade value is converged and the caution can be dropped. (3) the ruling that the class null is \"the matched figure\" for the tail is matched on residue class only: p'^2 is coprime to every q <= p', and the ensemble's rough-class offset is E_rc - R = 5.6714 -> 7.5357 over x = 7..29 against the class null's 5.6000 -> 6.0336, giving t/(R_shell + 7.5357) = 1.0123 against t/classNull = 1.0157. (4) attack-0830-head-remainder.md sec.3's top row is not gap-scale matched: E[g] 244.0 against 235.9, y_match capped at 19997, and on the note's own six ensemble points Delta_ens ~ E[g]^-0.312, so meas/ens reads 0.9640 not 0.9539 and the headline \"0.954 to 0.995\" reads 0.964 to 0.995. Three levels the notes recorded as out of reach are run here: the X2 group at x = 23, the tile identities and conditionals at x = 29, and the ensemble ladder at y = 29 (pipe/ens 0.9535, 40 s, against the head note's \"about fifteen minutes\"). No route opens or closes and nothing here touches Z2. | [redteam-0830-slack.md](history/staging/redteam-0830-slack.md) |\n| Z4 | `Q-tail-derivation-0830` Does the tail's measured law c = 0.7522 ln^2(p'^2) and its surplus derive, and which part of the coefficient is the tile's own (no prime input) against which part needs Hardy-Littlewood? | PARTIAL | PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3. | [attack-0830-tail-derivation.md](history/staging/attack-0830-tail-derivation.md) |\n| Z4 | `Q-verify-record-defects-0830` Do the three defect claims of 2026-08-30 (attack-0830-varE-identification.md sec.8 on the doubled X2 column; attack-0830-tail-derivation.md sec.7 on the corpus's \"R + 1/2\"; attack-0830-head-remainder.md sec.1 on the decade-pooled Delta = 0.6214) reproduce on independent code from the definitions, and which of the corrections they list apply? | ANSWERED | Claim 1 CONFIRMED: the corpus delta*X2 column is the positive half of the p \\| h-2 pattern doubled, that pattern's mirror is the p \\| h+2 pattern (W-(-h) = W+(h) exactly, W-(h) != W-(-h) at 9 to 900,679 shifts), the group sum 2X2 reads -0.5603 .. 0.1846 at x = 7..19 against 5.7147 .. 5.3266, and Xmix is overstated 2.305x at x = 19 (6.9x at x = 7); X, X1 untouched. Claim 2 AMENDED: R + 5/2 and R + 3 are exact for the tail convention (all and odd origins, asserted at x = 7..23) and t/(R + 3) = 1.0228, but head-residual-factor.md:70 is the HEAD's forward convention where R + 1/2 and R + 1 are exact, so that correction does not apply; and p'^2 is 1 mod 6, where the tail constant is 5 (t/(R + 5) = 1.0181), with the class null (1.0157) the matched figure, so 1.0228 is one unmatched convention replacing another. Claim 3 CONFIRMED as an artefact, AMENDED on mechanism and on the half-decade reading: 0.6214 pooled against 0.6592, 0.6705, 0.6736 at 2, 4, 8 sub-windows; the between-slope (Simpson) piece the note derives is half of the pooling term (0.0187 of 0.0378 at halves, 0.0261 of 0.0522 at eighths), the other half is the within slope's own fall with height weighted by Var(g); and re-reading the halves from their eighths puts HL BELOW the measurement at 5 of 6 half-decades by 2.5 to 3.4 percent at the top decade, so \"within 1.6 s.e., sign alternating\" is itself a pooled statement. | [verify-0830-record-defects.md](history/staging/verify-0830-record-defects.md) |\n| Z4 | `Q-zone-tail` What is the tail field of the zone (p, p'^2) - its law against ln^2, its worst case, its share of the R0 width, and is it the frozen-sieve last survivor below p'^2 at the rate the head is the frozen sqrt(p)-level first survivor above p? | PARTIAL | The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after. | [zone-tail-01.md](history/staging/zone-tail-01.md) |\n| Z4 | `Q-zone-tail-02` On the full zonegap-01 range to 1e11, what is the per-zone tail law in both units, is the renewal surplus t/R real at 27,292 zones, and do the head and the tail of a zone have a joint law? | ANSWERED | Resolved DOWN and nothing is derived: zone-tail-01's unresolved t/R = 1.0619 at 782 zones reads 1.0298 on a height-matched comparator at 17,700 zones (bootstrap [1.0156, 1.0443], excluding 1) and 1.0157 against the exactly matched discrete class null (bootstrap [1.0013, 1.0308], clearing 1 by 0.0013), so part of the original figure was the comparator and the pre-registered rule returns MATCH by two parts in ten thousand; c_local = 0.7522 at the top band with bootstrap [0.7410, 0.7630] now CONTAINING HL's 0.7574 and the band drift inside the registered 0.03 per step for the first time but still non-monotone (0.7518, 0.7664, 0.7416, 0.7522), so no convergence is measured; global worst tail/ln^2(p'^2) = 6.840 at p = 15107 with max/mean no longer flat (4.40, 5.36, 8.59, 8.43); Q5 is answered in the negative, head and tail showing no dependence at 27,292 zones (detrended r = -0.0009 against null s.e. 0.0061, permutation p = 0.8920, variance ratio 0.9990, no KS rejection, no chi-square near threshold), so the R0 pieces are a product structure to first and second moments and in the sum's whole law while independence is NOT proven and the simultaneous-extremes regime is untouched; a candidate rough-origin mechanism for the surplus is HEURISTIC and does not fit the head's own excess band by band; the head field's effective sample size is measured at 1,910 distinct a_first among 17,700 top-band zones, so this note's own head interval is priced over draws the field does not hold, a cluster bootstrap over distinct a_first (producer SEC I(a), seed 613009117) measuring the inflation at 4.10 rather than the 3.04 the redundancy alone implies and moving the top-band interval to [0.6848, 0.7692], still inside the registered [0.68, 0.78] (correction originating with redteam-0829-measure-b.md section 1c C15); the scope of that defect is that one interval and not the corpus, since destroyer-census-01.md publishes no bootstrap, head-residual-factor.js bootstraps over gaps, zonegap-01.js has none and zone-tail-01.js bootstraps only tail quantities; ten of ten predictions hit, which is a criticism of the pre-registration; and the R0 shares read 1.40% / 92.80% / 5.81% with the tail's share still falling, so Z2 is more of the obstruction after this pass than before it. | [zone-tail-02-0829.md](history/staging/zone-tail-02-0829.md) |\n| Z5 | `Q-applied-0828-litimports` Were the lit/imports red team's corrections applied to the six HELD notes? | ANSWERED | Applied, 64 substantive edits across the six notes: the Saffari-Vaughan range exponent is 6/11 in both import notes, the fixed-M THEOREM in import-fracparts is struck and the cap-36 MEASURED to PROVEN upgrade withdrawn, row 15 loses its theorem column and row 16 is regraded stale, and the six weakened sentences in the four literature notes now read as the audit requires; four claims are declined with reasons, and nine live documents plus two fenced staging notes are recorded here as owing corrections that this pass did not apply. | [applied-0828-litimports.md](history/staging/applied-0828-litimports.md) |\n| Z5 | `Q-applied-0828-registries` Which lit/imports corrections reached the registries? | ANSWERED | 13 edits across six files, plus one appended changelog section: IMPORT-MAP gains rows 15 (no THEOREM, the column struck), 16 (STALE) and 17 (CLOSURE, two-sided) with its three counts recounted to seventeen rows; SEARCH-CONVENTIONS gains the Kourbatov-b, generalized-Dickman and VC-of-multiples rows with each channel's calibration state; import-map-construction's determinantal cell, natal-cap-36's separate-census sentence, one REFUTED row and one PRIOR-ART block are corrected; GLOSSARY, TODO, QUESTIONS, the five loose hyperuniformity documents and two staging notes are left for their holders and listed here. | [applied-0828-registries.md](history/staging/applied-0828-registries.md) |\n| Z5 | `Q-record-deficit` Does the 6.0 percent record-location deficit survive the corrected null, and what is it? | MIXED (lit-kourbatov-shortfall.md: ANSWERED; record-location-null.md: PARTIAL) | Survives (z = -3.3, five window cuts); Z5's premises on 'location' and on n_eff were wrong; corrected-null formula in §4. | [lit-kourbatov-shortfall.md](history/staging/lit-kourbatov-shortfall.md), [record-location-null.md](history/staging/record-location-null.md) |\n| Z5 | `Q-record-mechanism-0830` Which of three candidate mechanisms (sub-Poisson gap dispersion, the tile's exact gap law, Kourbatov's k = 1 conspiracy heuristic transported to k = 2) carries the residual 0.78 to 0.97 of Kourbatov's b, at what derived size, and what fraction of b is left? | PARTIAL | The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier. | [attack-0830-record-mechanism.md](history/staging/attack-0830-record-mechanism.md) |\n| Z5 | `Q-record-null2` How much of Kourbatov's shortfall coefficient b does an inhomogeneous-intensity record null carry, how much does a 6Z-latticed null carry, and what is the residual? | ANSWERED | The inhomogeneous null carries essentially none of b (d b_z = -0.0012 +- 0.0001, MEASURED); the 6Z lattice's share is LAW-DEPENDENT, +0.1113 +- 0.0003 under the memoryless rounding-up law against -0.0060 +- 0.0003 under rounding to nearest, so the null side is a bracket of 16.1 to 25.1 percent of b and three quarters or more stays a residual with no mechanism; record-location-null.md section 8's argued 1.7e-4 lattice bound is wrong but no single number replaces it; the 15 percent estimator disagreement is pinned as an exact weighting identity; and the shape assumption behind every b reading is measured at 1.6 sigma and stays open. | [measure-record-null2-0829.md](history/staging/measure-record-null2-0829.md) |\n| Z5 | `Q-redteam-0828-litimports` Do the six notes of 2026-08-28 survive an adversarial pass, and which of their load-bearing claims are wrong? | ANSWERED | Every measured number reproduces on independent code; Saffari-Vaughan Theorem 10's range exponent is 6/11 not 1/11, which voids import-fracparts's one banked THEOREM at fixed M and corrects row 15 twice; four further weakenings, one refuted verdict line, no note refuted whole. | [redteam-0828-litimports.md](history/staging/redteam-0828-litimports.md) |\n| Z5 | `Q-redteam-0830-records` Do attack-0829n-parity-dstar.md (CLOSED, HELD) and attack-0830-record-mechanism.md (PARTIAL, HELD) survive an adversarial pass on independent code, does REFUTED row 95 stand as worded, and is TODO Z5's new title supported? | ANSWERED | Both notes' measurements reproduce on independent code and neither headline is refuted: D* is confirmed EXACTLY, by a BigInt rational simplex written here, at 299 of 376 anchors with 0 contradictions (the other 77 exceed the exact solver's size cap), the old range's 172-figure gate is re-derived exactly at all 43 anchors with 0 disagreements, and an independent 30-wheel sieve to 1e11 reproduces note (b)'s seven decade gap counts, CV^2 and far-tail slopes to every printed digit, with the counts also matching the published pi_2(10^k). Four sentences are wrong or over-stated and are replaced here: REFUTED row 95, note (a)'s ledger, its section 6 and TODO Z5 all attribute the null's 0.025 agreement to the WIDTH law when 0.025 is the ln Q slope difference (the width-slope difference on the same 84 matched anchors is 0.031); note (a) section 3's \"the threshold sits in a gap of at least 0.25 at every anchor\" is scoped in its own producer to the true arm and the null arm's exact gap is 0.1212; P6's HIT rests entirely on the decade-2 collapse that section 5 discounts as a sampler artefact when it discounts kill clause (a); and note (b)'s \"d b_z = 1.0806 +- 0.0014\" carries only the Monte Carlo pairing error, while moving the far-tail slope by 0.02 (against a spread of 0.0174 across six fit windows on the same decade and 0.1196 across decades) moves d b_z from 0.9888 to 1.1720, and continuing the law at slope 1 above the last resolved point still gives 0.7752. REFUTED row 95's CLOSED verdict stands on kill clause (b), which is better powered than the note presents it (paired s.e. 0.0401 against a 0.15 band), and the row needs two clauses reworded; TODO Z5's title is supported for \"measured and not derived\", and the resolved part of the law carries 72 per cent of the residual on its own with the extrapolation carrying the rest. | [redteam-0830-records.md](history/staging/redteam-0830-records.md) |\n| D | `Q-doubling-C2` Does the doubling inequality hold on the base-2 chain, and can a bridging certificate prove it? | PARTIAL | Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412). | [attack-doubling-01.md](history/staging/attack-doubling-01.md) |\n| D | `Q-doubling-bridge-0829n` Can a bridging certificate carry Ghat(2s) <= 8 Ghat(s) from level s to level 2s uniformly in s, all s, on the base-2 chain? | PARTIAL | Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched. | [attack-0829n-doubling-bridge.md](history/staging/attack-0829n-doubling-bridge.md) |\n| D | `Q-doubling-killrun-0830` Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | PARTIAL | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN. | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n| D | `Q-kstar-prereg` What is K* at the three next doubling steps, predicted before any period walk? | OPEN | Pre-registration only, committed alone: the predictions, the scoring rule and the growth-type verdict thresholds are fixed in advance, with the inclusion-exclusion engine validated against an independent scan engine on all eleven known steps first. | [attack-kstar-01-prereg.md](history/staging/attack-kstar-01-prereg.md) |\n| D | `Q-recon-0830-rec-killrun` Does the literature hold, in its own conventions, a theorem whose hypotheses REC(s, u0) (the sup-versus-rms recovery of the level-D signed remainder over all positions, attack-0829n-rml-proof.md section 3) or the weighted kill-run K*(s) (the longest run of level-s slots the primes in (s, 2s] can kill, attack-0829n-doubling-bridge.md sections 0 and 3) satisfies as stated, or a Maier-type theorem that makes REC false for two-class sifted sets at some u0 below beta_2? | ANSWERED | No theorem applies to either object as stated, on four calibrated channels searched in the owning conventions; every neighbour is graded NEAREST with its unmet hypothesis named, and neither object is on any refuted row. On the Maier question the answer is negative for REC as stated (the Maier family bounds the COUNT, i.e. the full-level remainder, never a level-D truncation) but carries one calibration: at one class and full level the REC-shaped inequality is FALSE asymptotically, by Buchstab's origin ratio against the Montgomery-Vaughan full-period variance ceiling, and the embedded arithmetic puts the level where that falsity first shows at log10 z between 16 and 141 depending on u0 and epsilon, so a finite-z margin of the kind the corpus measures cannot see a failure of this type; at two classes the same full-level statement is HL-conditional at u0 = 2 and unlocated in print at any u0. No exponent moved. | [recon-0830-rec-killrun.md](history/staging/recon-0830-rec-killrun.md) |\n| D | `Q-redteam-0830-doubling` Do attack-0829n-doubling-bridge.md and attack-0830-doubling-killrun.md survive an adversarial re-derivation on an engine sharing nothing with their producers, and do REFUTED rows 94 and 98 stand as worded? | ANSWERED | The mathematics survives: the maxsum certificate Ghat(2s) <= maxsum_{K*+1}(T_s) and the product composition K*+1 <= prod(1+L_j) are each re-derived here and hold, the second at 21,641,346 nesting links over 6,012,804 killed runs with zero failures including the zero-kill fold, and every quoted figure reproduces digit for digit on a fresh engine (K*(16) = 17; G2(31#) = 348 @ 8813641451 x4 from both base tiles; sup msc 6.6364; the diagonal cells; the 2^N ratios 1.226/1.481/41.348). Row 94 STANDS and is if anything under-claimed, but its attribution is wrong in one direction: Lemma 1 at s = 128 alone clears the whole band, so the s = 16 walk corroborates rather than carries it. One statement is falsified: the bridge note's NOT-REACHED line puts 19#->37# out of reach, but column-major it returns here, reproducing the ladder row x = 37 and adding a FIFTEENTH step at s = 19, 20 (K* = 13, N = 4, C2 3.5200, certificate 3.8000), so the enumerable range ends at s = 20, not s = 18. Row 98 STANDS on its mathematics and is WEAKENED on one clause: \"the truth sits under it everywhere (sup w/a = 0.8295)\" attaches the CERTIFICATE's ratio to the word truth; the truth's sup is 0.6591. | [redteam-0830-doubling.md](history/staging/redteam-0830-doubling.md) |\n| D | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| 0 | `Q-applied-0828-closures` Were the closures red team's corrections applied to the five HELD notes? | ANSWERED | Applied. 47 prose corrections across the five notes; c2prime-refit-22 drops from CLOSED to PARTIAL and three ledger verdicts are rewritten; four producer READINGS blocks and eleven live-document lines carry the same defects and are listed here uncorrected, behind the fence. | [applied-0828-closures.md](history/staging/applied-0828-closures.md) |\n| 0 | `Q-barrier-kappa2` Does Granville's exceptional-character construction, which makes the Jurkat-Richert f and F attained by interval sieving problems at kappa = 1, transfer to kappa = 2 and supply the missing barrier on wall-note Face 4, so that no class-blind argument can beat beta_2 = 4.26645 on intervals? | CLOSED | No. Verdict (b): the transfer runs, fixes the axiom obstruction that sift-limit-attack.md section 2 blamed for the mixed-sign sketch's death, and then hits a hard ceiling at u = 2, because the character's only gift is the one-point identity lambda = chi on z-rough integers and a sign pattern with a +1 coordinate is empty exactly when z^2 >= x; above u = 2 the surviving question is the shifted intersection of two positive-density lambda-classes, which is Chowla-strength, so the section 2 verdict stands with a corrected reason; the band (2, 4.26645] is untouched, and the hypothesis itself implies the target by Heath-Brown 1983. | [attack-barrier-kappa2.md](history/staging/attack-barrier-kappa2.md) |\n| 0 | `Q-derive-0904-L7-transfer` Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to? | PARTIAL | No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), and the sieve-on-holes transfer is the Bruedern-Fouvry vector sieve, whose coupled unconditional form lands at 2(1 + sqrt e) = 5.2974 above beta2 and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap; L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only. | [derive-0904-L7-transfer.md](history/staging/derive-0904-L7-transfer.md) |\n| 0 | `Q-g2-provenance-x37` Does the headline G2 exponent depend on the eight terms this repository has never reproduced, and does any instrument without G2(37#) inside it flag x = 37? | ANSWERED | MEASURED, both largely negative: the custody-only refit lands at 1.533 against the headline 1.498 and no provenance-block drop moves the corrected central by more than 0.035 (Ghat(64) alone moves it 0.002), while no G2-free instrument flags 37 in the high direction, the one \\|z\\| past 2 being h(37#) at -2.20 in the low direction and range-dependent; the blind extreme-value forecast of G2(37#) does overshoot at z = +6.58, unexplained. | [measure-g2-provenance-0829.md](history/staging/measure-g2-provenance-0829.md) |\n| 0 | `Q-gap-spectrum` What is the full gap-length distribution of twin slots over one period of the tile, what does the excess functional \\|B_N\\| = sum_{g>N}(g-N) read on an x^s grid, and where does the empirical minimum window count leave zero? | ANSWERED | The distribution is exact at nine levels to x = 31 and the pre-registered renewal null FAILS in the light direction at every one: the tail is uniformly steeper than exponential (body slope -1.3302 against -1), no power law survives (the power-law slope moves by a factor 17), the maximum is 2.087 to 2.241 BELOW the renewal maximum, and \\|B_N\\| sits at 0.0245 to 0.7436 of the null and is exactly zero at s = 1.75 where the null predicts 6.5262e+5 empty windows; so no heavy-tail mechanism for a super-linear G2 exponent exists at any computable level, the identity G2 <= N + \\|B_N\\| is proven but degenerates to G2 <= N on this grid, and the sifting onset is flat at 1.63 to 1.70 against a sieve bound f2 that is zero everywhere the grid reaches. | [gap-spectrum-01.md](history/staging/gap-spectrum-01.md) |\n| 0 | `Q-lit-siebert` Is Siebert's 1983 result stated for general sieve dimension kappa, or for kappa = 1 only, and does it therefore already contain the kappa = 2 extremal example that SEARCH-CONVENTIONS section 3 records as not found? | ANSWERED | kappa = 1 ONLY, on three independent statements of the theorem (the chapter's own publisher abstract, Granville 2020 section 1, Friedlander-Iwaniec 2022 page 20), all naming the LINEAR sieve and the Jurkat-Richert f and F; the chapter's full text was NOT reached, so this is testimony not primary reading, and the SEARCH-CONVENTIONS section 3 \"no published kappa = 2 extremal example\" row needs no correction. | [lit-siebert-1983.md](history/staging/lit-siebert-1983.md) |\n| 0 | `Q-maximal-law-tpc` Is the SIEVE Gaussian maximal law TPC-implying? | ANSWERED | YES in the only form that would deliver anything: stated for the operative remainder R_H, need/z^2 runs 0.49 to 0.61, flat and below the zone budget at every z from 13 to 43, which is the Gap Reformulation, hence the Zone Postulate, hence TPC, so no soft argument can prove it; the published above-2 theta column is not the maximal law's verdict but the law plus two lossy steps. | [phase1-T4-maximal-law.md](history/staging/phase1-T4-maximal-law.md) |\n| 0 | `Q-measure-g2-generic` Where does G2(x#) sit in the distribution of the same maximum gap taken over other two-class configurations with the same census, and is the constant-shift family generic inside the free-pair family? | ANSWERED | G2 is GENERIC in this coordinate on the registered rule, MEASURED: the midrank percentile of G2 in the census-matched two-class ensemble reads 20.00, 18.06, 26.35, 17.14 exhaustively at x = 11..19 and 13.70 sampled at x = 23, all inside the registered [5, 95] band so the falsifier does not fire, while sitting about one ensemble sd below the mean at all five levels; and the free-pair and constant-shift ensembles are PROVEN identical up to translation, so killer 1 gains no target in the class positions at these levels. | [measure-g2-generic-0829.md](history/staging/measure-g2-generic-0829.md) |\n| 0 | `Q-omega-floor-blind-0830` Does the local log-slope of the pointwise floor Omega(z) of attack-0830-rec-cheapest.md (exact to z = 73, certified 2+4-chain family to z = 5e5), extended blind to new levels under a sealed forecast, behave as the DERIVED growth law Omega >> z^{16s/9}/ln^8 z predicts at s = 2.698721, and at what z would the test be decisive? | ANSWERED | MEASURED, blind, on the derived law only: 18 of 22 sealed rows HIT; the certified 2+4-chain family at p* = (47, 43) runs 5e5 -> 1e9 (A1A2 = 8.863e17 -> 9.351e32, exact integers) with its step slope falling 4.85 -> 4.38 through every sealed band onto the law's log-corrected slope, the decisive decade 1e8 -> 1e9 reading 4.410 against 16s/9 - 8/ln z = 4.389 (HIT, kill rule not triggered at 4.452 +/- 0.011); the 4 MISSes are the ratio to z^{16s/9}/ln^8 z sitting at 2.00-2.14 above the sealed cap of 2 at z >= 1e8, the pre-declared non-adverse direction; the exact floor is extended 73 -> 113 (251 -> 1980, equal to the hill-climb floors at 89 and 101), where the law predicts nothing; no exponent moves and the law stays DERIVED and HELD. | [blind-0830-omega-floor.md](history/staging/blind-0830-omega-floor.md) |\n| 0 | `Q-rec-cheapest-0830` At the cheapest legal point of REC(s, u0), s -> 1+sqrt(e) and u0 -> beta_2, where the saving asked over the triangle inequality is only z^{1.031}, does any of the five dead routes close, does a mixed mean-square-plus-cap strategy close, and is the failure a proof gap or a truth gap? | PARTIAL | No route closes and the failing step is yesterday's statement, so PARTIAL on the routes; but the step is located as a TRUTH gap, not a proof gap, asymptotically: the certificate's own value at a CRT-planted doubly-smooth window is cc(r) = -(A1A2 + A1B2 + B1A2) with every term a count of exit chains of the Rosser supports (PROVEN, checked exhaustively at z <= 73), the window bound T <= cc(r) + H - 1 is exact, and the exit-chain count is DERIVED (held) to grow like z^{16s/9 - o(1)} at four primes and z^{2s - o(1)} in the limit, so REC(s, u0) is false for every u0 < 16s/9 = 4.7088 at s -> 1+sqrt(e), the whole legal band (2, beta_2] included, and RML(alpha) with it; at every computable z it is a proof gap (Omega(z) exact to z = 73 reads 251 against z^{u0} = 1.05e6, and a certified lower bound 8.86e17 at z = 5e5 sits a factor 1.2e6 under z^{u0}); no exponent moved. | [attack-0830-rec-cheapest.md](history/staging/attack-0830-rec-cheapest.md) |\n| 0 | `Q-recon-0828-covering` Does the interval-covering, automated-proof or extremal-combinatorics literature hold a method that bounds the length of an interval covered by two residue classes per prime, or that turns the exact G₂ ladder into a statement at all x? | ANSWERED | No route. Fifteen angles examined, fourteen dead on arrival or already closed here; the best interval-covering bound in print is Crittenden-Vanden Eynden's own Lemma 2, which reads 1.02e12 against G₂(79#) = 1710 and is 8181x weaker than the corpus's own 4.2665 sieve bound at the same level; the one survivor, transplanting Costello-Watts's recurrent certificate to two classes, is a computation that certifies finitely many levels and whose analytic half is Erdős #970 at one class. | [recon-0828-covering.md](history/staging/recon-0828-covering.md) |\n| 0 | `Q-recon-0828-farfields` Do any of the fields still absent from IMPORT-MAP.md hold a theorem whose hypothesis the tile satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | ANSWERED | No route from any of the sixteen candidates priced; two reach STRONG-ANALOGY or better and CLEAN and both bank only a closure or a wall address, the Fourier one by a one-line non-vanishing proof that empties the Donoho-Stark/Tao/Meshulam family on this object, and Janson's lower tail by saturating at exp(-1/c) >= 0.0805 against the 1/W a position union bound needs, short by 3.6e2 at x = 11 and 2.8e13 at x = 41. | [recon-0828-farfields.md](history/staging/recon-0828-farfields.md) |\n| 0 | `Q-recon-0828-rough` Does the 2000-2026 literature on y-rough numbers, sifted sets and short intervals hold any theorem that lowers Z2 or G2, meaning any control on the largest gap or the minimum count of a sifted set in EVERY short interval, or any structure of rough numbers a gap bound could use? | ANSWERED | No. Ten angles examined, ten killed for this purpose; the strongest every-interval statement in print for one-class rough numbers is Iwaniec's S(x,y,z) >= (4y/log^2 y)(log(y/z^2) - O(1)) for y >> z^2, uniform in x, giving J(P(z)) << z^2, and it is the linear sieve run exactly at its sifting limit beta_1 = 2 with no slack outside it; no two-class analogue exists in print at any exponent, the corpus's own x^4.2665 is beta_2 by the same mechanism, and every remaining branch of the field (Matomaki-Radziwill, Gorodetsky, Friedlander-Iwaniec Cor 6.28, Gafni-Tao) carries the almost-all quantifier, which a second-moment statement can never convert into a bound on one empty window. | [recon-0828-rough.md](history/staging/recon-0828-rough.md) |\n| 0 | `Q-recon-0828-sieve` Is there anything in the 2008-2026 sieve literature, or in the parity-breaking literature, that lowers beta_2 = 4.26645 or supplies a consumer for a level theta > 1 on the two-class comb? | ANSWERED | No route. Twenty-one angles examined, nineteen dead on arrival, nothing in print beats 4.26645 at kappa = 2 at any level on four calibrated channels; the two survivors are an owning-convention row and one unresolved hypothesis in a five-page 1990 announcement whose stated requirement beta < 3 excludes beta_2 = 4.26645. | [recon-0828-sieve.md](history/staging/recon-0828-sieve.md) |\n| 0 | `Q-recon-0829-escapes` Each of the three killers is an obstruction shape that occurs elsewhere in mathematics; where has each shape been beaten in print, by what mechanism, under what hypothesis, and does that hypothesis hold for the tile and zone objects? | ANSWERED | Of nineteen escapes read, fourteen fail a hypothesis check (twelve on a fact already in this corpus), four fail some other way and one (the decoupled vector sieve) stays OPEN as the programme's existing road, so no route opens; Granville-Soundararajan's uncertainty principle is NOT killer 3 in print, is adverse-direction, and is already cited here twice. | [recon-0829-escapes.md](history/staging/recon-0829-escapes.md) |\n| 0 | `Q-recon-0829-farfields2` Do any of eight fields still absent from IMPORT-MAP.md and from the three 2026-08-28 recon notes hold a theorem whose hypothesis the tile or the zone satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | ANSWERED | No route from any of the eight; the pass banks one PUBLISHED-ANCHOR (Holt and Rudd's transfer matrix has its full spectrum in print, second eigenvalue a2 = prod_{17<=q<=p}(q-3)/(q-2), printed 0.10206751799779 at p = 999999999989, decaying only like 2.82/ln p, and this corpus's prior-art record names the eigenstructure and the binomial eigenvectors but carries the per-prime eigenvalue (p-j-1)/(p-2) at lit-pdf-holt-rudd.md line 259 but no product-over-primes closed form, no numerical value and no rate), one CLOSURE with mechanism (Beurling-Selberg is the proof device behind the large sieve, whose constant N-1+1/delta is an l2-to-l2 statement and whose error 1/delta exceeds the window at the operative theta_total > 2, so the whole extremal-function family reproduces a row already rejected), and three wall addresses; two angles are TPC-strength at the form that would pay and are labelled (ii). | [recon-0829-farfields2.md](history/staging/recon-0829-farfields2.md) |\n| 0 | `Q-recon-0830-rec-killrun` Does the literature hold, in its own conventions, a theorem whose hypotheses REC(s, u0) (the sup-versus-rms recovery of the level-D signed remainder over all positions, attack-0829n-rml-proof.md section 3) or the weighted kill-run K*(s) (the longest run of level-s slots the primes in (s, 2s] can kill, attack-0829n-doubling-bridge.md sections 0 and 3) satisfies as stated, or a Maier-type theorem that makes REC false for two-class sifted sets at some u0 below beta_2? | ANSWERED | No theorem applies to either object as stated, on four calibrated channels searched in the owning conventions; every neighbour is graded NEAREST with its unmet hypothesis named, and neither object is on any refuted row. On the Maier question the answer is negative for REC as stated (the Maier family bounds the COUNT, i.e. the full-level remainder, never a level-D truncation) but carries one calibration: at one class and full level the REC-shaped inequality is FALSE asymptotically, by Buchstab's origin ratio against the Montgomery-Vaughan full-period variance ceiling, and the embedded arithmetic puts the level where that falsity first shows at log10 z between 16 and 141 depending on u0 and epsilon, so a finite-z margin of the kind the corpus measures cannot see a failure of this type; at two classes the same full-level statement is HL-conditional at u0 = 2 and unlocated in print at any u0. No exponent moved. | [recon-0830-rec-killrun.md](history/staging/recon-0830-rec-killrun.md) |\n| 0 | `Q-recon-0904-sifting-limit-floor` What is actually known, in the owning convention and at the page, about LOWER bounds on sifting limits at dimension kappa > 1, and is the class-blind cap at beta_2 = 4.26645 a barrier or a method artefact? | PARTIAL | Both. The corpus's [ABSENT] is wrong for lower bounds and right for extremal examples: Selberg's Lectures section 17 and Brady's 2017 Corollaries 1 and 3 ARE lower bounds on beta(kappa) at kappa > 1, invisible because Selberg's convention is the reciprocal a_k = 1/beta_kappa so his lower bounds are titled \"upper bounds for sifting limits\", while no kappa > 1 extremal example exists and Halberstam's own 2003 review says so; the best floor on beta(2) resting on a citation is 1.8394 from Brady's reduction evaluated at kappa = 2, unconditional and below the band, and beta(2) >= 2 follows from monotonicity by a padding argument DERIVED here and probably folklore; the cap at 4.26645 is a METHOD ARTEFACT at rung MEASURED, since the level-D LP is exactly the axiom-only information class and its calibrated floor of 3.3152 sits about 18 per cent below the DHR value and passed, 0 of 15, its first external test against the published beta_3 and beta_4; the band (2, 4.26645] is untouched by anything proven. | [recon-0904-sifting-limit-floor.md](history/staging/recon-0904-sifting-limit-floor.md) |\n| 0 | `Q-redteam-0828-closures` Do the five 2026-08-28 closure notes stand, and do they stand for the reasons they give? | ANSWERED | Three stand on corrected sentences (1d, Z5b, 0); one stands in half (10, the 1.074 counter-claim does not); one does not stand for its stated reason (1c, closed on a narrower window than the prior work's significant one, and its CLOSED has overwritten a PARTIAL in the generated index). | [redteam-0828-closures.md](history/staging/redteam-0828-closures.md) |\n| 0 | `Q-redteam-0830-floor-growth` Does the DERIVED growth half of attack-0830-rec-cheapest.md sec.4.2 (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive an adversarial re-derivation on independent code, does it really make REC(s, u0) false for every u0 < 16s/9, and does the blind slope test of blind-0830-omega-floor.md test the LAW or the CONSTRUCTION? | ANSWERED | No break found in six attacks, so the growth half SURVIVES this pass and stays DERIVED (one failed break is not a proof, and the whole thing still rests on the exact half E1-E3 that this pass did not grade); but four claims are corrected - the threshold 16s/9 needs the unstated hypothesis s <= 3 (above it the four-prime LP maximum is 2(2s+2)/3, then 8, both below 16s/9, though the corollary that every legal u0 < beta_2 fails survives at every admissible s because 2 x LP-max > beta_2 for all s > 9beta_2/16 = 2.3999), the 2s - o(1) limit needs 3^k <= ln D / ln 8 so only k = 2 is available at every z below 1.1e9, A_i is >= not ~ the dyadic count, and the certified ratio does NOT rise monotonically (0.0118, 0.0128, 0.0101, 0.0057, 0.0051, 0.0093, 0.0336, 0.0801, 0.1658, 0.3545 on my own recount, which reproduces all ten S4b rows digit for digit); the blind test is ruled a test of the CONSTRUCTION's count and not of the law, since it cannot see E1-E3 or the CRT step; on the ruling Chris asked for, the floor does make the RML route a truth gap asymptotically and conditionally on E1-E4, and changes nothing computable, the literal construction first passing H = z^{u0} at z ~ 5.6e31 on the constant 2.93e-4 measured here; no exponent moved. | [redteam-0830-floor-growth.md](history/staging/redteam-0830-floor-growth.md) |\n| 0 | `Q-redteam-0830-floor-sign` Does the EXACT half of attack-0830-rec-cheapest.md sec.4 (E1-E4, the sign facts, the window bound T <= cc(r) + H - 1, the exact Omega, and sec.(d)/(e)'s calibration sentences) survive an adversarial re-derivation on independent code, and does it by itself constrain REC at any u0 without the growth law? | ANSWERED | The mathematics STANDS as PROVEN and is stronger in two places than the note claims, but it constrains REC at NO u0 by itself: E3's identity is pure algebra and holds at every position (0 mismatches in 20.5M positions, both s), E2 holds at every divisor n > 1 under three disjoint routes at every s >= 1 and FAILS at s = 0.8, locating a hypothesis D >= z the note omits, E4 has 0 violations at every x over four complete periods with the wrap, and Omega is reproduced by an independent enumeration at all 26 tabled values and EXTENDED to z = 101 (285, 441, 684, 990, 1155 at z = 79, 83, 89, 97, 101), confirming blind-0830's exact 684 and 1155; three sentences are wrong -- E1's \"every pair with gcd \\| 2 is realised\" (exactly half are; the missing half is all those with 2 dividing one side), the ledger's and sec.0's \"251 against z^{u0} = 1.05e6\" (1.05e6 is HM, z^{u0} = 7.19e7, so the gap is understated 68.3x), and sec.4.4's reason for lam+(P(z)) = 0 (0.24 exceeds 1/8; the figure that closes the slab is 0.1199 at z = 89, under 1/8 by 4 percent) -- and sup\\|rho~\\| >= (Omega - M)/2 is loose: sup\\|R_1\\| = Omega + M exactly. Every exactly known log_z Omega is under 2 while REC needs it above u0 > 2, so the exact half touches REC at no u0 and every adverse consequence in the note still rests entirely on the growth half. No exponent moves. | [redteam-0830-floor-sign.md](history/staging/redteam-0830-floor-sign.md) |\n| 0 | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| 0 | `Q-redteam-0830-rml` Do the three HELD notes of 2026-08-29 night and 2026-08-30 on the RML chain survive an adversarial pass — the six-arrow chain and the term-count cap lemma of attack-0829n-rml-proof.md, the same-object ruling and the applied replacement sentences of verify-0830-usup-convention.md, and the reflection identity, custody, pilot bounds and sealed forecast of measure-0830-rho-sup-z41.md? | ANSWERED | The three load-bearing PROVEN claims survive independent re-derivation — the CAP lemma (every step, sine sum at worst ratio 0.585568, the constant 6, 0 per-modulus violations at z = 13, 17), the reflection identity rho~(W-3-y) = -rho~(y) (proved here and its two hypotheses verified at z = 13..37, residual <= 1.7e-10 at every position of z = 13, 17, 19), and the same-object ruling (an independent lattice reproduces the repository's term multiset exactly at z = 13..37 and its {Vabs > 0} set equals LSE's records at all ten levels); five of the seven cited exact sups and three of the five walked sup\\|R_H3\\| reproduce to <= 5.0e-7, and every figure of the sealed z = 41 forecast reproduces from the seven cited sups alone. Fourteen claims do not survive, none of them reopening a route. The load-bearing one is RML sec.2's ms_m/ask column: it measures the PROVEN mean-square BOUND sqrt(B H), not the ^{1/2} that REC names, the two differing by 36.53x to 200.45x on the tabled rows because saturates in H while B H does not, so sec.5's ordering (ask below the Gaussian factor at u0 = 3.0 and 3.5) is an artifact and reverses at every row against the true mean square. \"gauss -> 0\" (sec.5) and \"sup/rms <= sqrt(2 lnW) O(1) = z^{o(1)}\" (sec.3) are the same error twice, against the note's own sec.0: sqrt(2 ln W) = z^{1/2+o(1)}, measured gauss 0.7905 at z = 19 falling to 0.5645 at z = 1e7, limit 1/2. \"the recovery exponent is log_z(2 sup\\|rho~\\|/rms): about 0.99-1.29\" quotes the truth column, which is log_z(2 sup\\|rho~\\|) alone; the quantity named measures 0.5628 to 0.6712. \"REC would be moot rather than false\" should read false. \"u_cap -> 2s + o(1)\" and \"n ~ z^{2s}/polylog\" are asserted where only \"<=\" is proven and the data cannot decide: u_cap is 4.2652 at z = 47, crosses beta_2 only at z = 53, reaches 4.4891 at z = 79, and passes u_triv from z = 53. \"seven points spanning less than one octave\" is 1.509 octaves, still uncorrected in three places including the ledger verdict. verify-0830's applied \"polynomially many from z = 223 on\" is true at every z >= 13, and its z = 331 crossover silently sets A = 1 (A fitted to LSE's own Ssat moves it to 337). No exponent moves, no route opens or closes, and no ledger verdict changes. | [redteam-0830-rml.md](history/staging/redteam-0830-rml.md) |\n| 0 | `Q-redteam-0904-floor-growth-2` Does the growth half of the adverse pointwise floor (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive a SECOND adversarial pass, and does a floor on the certificate at a CRT-planted window make REC(s,u0) false (a truth gap) or only unprovable by that certificate (a proof gap)? | ANSWERED | SURVIVES, at the same rung and no higher: four new attacks and two unasked ones found no break, so the growth half stays DERIVED and red-teamed twice, which is two failed breaks on a derivation and not a proof; the proof-gap reading is REFUTED because REC is a statement about R_H, the remainder of the very certificate the floor bounds below, and the chain has no step where a certificate value must become a true remainder, so it is a truth gap for REC as the corpus states it; five corrections are owed to the record -- the REFUTED row is UNSCOPED and should read \"on the Rosser vector-sieve lattice at equal levels\" since only the Rosser instance is derived, the \"falsity beyond z ~ 5.6e31\" is an s = 2.698721 figure quoted without its s and the fitted crossing at the corpus's own measured family s = 3.0 is z ~ 10^15.3, the analytic p* window (4D^{1/27}, D^{1/9}/4) is neither necessary nor sufficient at reachable levels so the exact onset is 4.42e5 at s = 3.0 rather than the quoted 1.055e6, the four-prime construction has NO exit prime below z once s >= 7 so the first pass's \"8 beyond s = 5\" holds only on [5,7), and the first pass's escape-(a) density 1/W understates the planted class by the factor W/(n1n2) though the escape still fails by an exponential; the LP maximum 8s/9 is confirmed as an exact vertex and the corollary crossing reproduces 9beta2/16 to 4.4e-16, the pre-registered slope band held at a new s (top step 4.9025 at s = 3.0 against a model 4.8990), and no exponent moved. | [redteam-0904-floor-growth-2.md](history/staging/redteam-0904-floor-growth-2.md) |\n| 0 | `Q-redteam-0904-item0` Do the two HELD notes of 2026-09-04 on item 0, the second adversarial pass on the adverse floor's growth half and the L7 one-class-to-two-class transfer, survive an independent adversarial pass, and do the live-layer changes they propose survive verbatim? | ANSWERED | Both notes SURVIVE at their own rungs and neither moves an exponent, but SIX of their proposed live-layer changes need rewording and two of their supporting derivations are wrong; every load-bearing number reproduces on independent code (18 of 18 A1A2 cells digit for digit, the LP maximum 8s/9 at 0 deviations of 16 with residual 4.441e-16, the crossing 2.399878284834 against 9beta2/16 at 1.097e-13, the fitted C = 1.1206e-4 and the s = 3.0 crossing 10^15.30, the onsets 4.390e5 / 1.111e6 / 1.860e6, ln(n1n2) = 7.4993e7, and the L7 CRT counts EQUAL at x = 7, 11, 13), so the truth-gap reading of REC is CONFIRMED and the growth half stays DERIVED and red-teamed twice, not proven; what does not survive is the scoping, the exit-window and the price wording: the proposed clause \"at equal levels D1 = D2 = z^s\" is NARROWER than the derivation supports, since over 1643 admissible upper-and-lower level splits the floor beats the decoupled window at every cell by at least 0.644444, so no level split escapes and the sibling rider \"asymmetric levels give 8s1/9 + 8s2/9 with s1 + s2 pinned\" is REFUTED as written (it holds only while both s_i <= 3); the record's z ~ 5.6e31 is u0-specific as well as s-specific (10^31.68 at u0 = 4.2165 against 10^35.36 at u0 = beta2, same s), so replacing it with a beta2-convention 10^15.30 mixes two conventions; the onset correction is right numerically and wrong in wording, since at the record's own s = 2.698721 the exact onset is 1.875e6, LATER than the quoted analytic 1.055e6, not earlier; the escape-(a) correction is right in substance but its \"(A1A2)^2 / (2 n1n2)\" is a LOWER bound on the split's contribution, and the two-sided version through lambda+(n) <= 2^omega(n) reads 10^{-3.004323e+7} against B ~ 10^{10.1}, still no contradiction; and on the L7 side the union-bound argument and the CRT count are CONFIRMED while the coupled vector-sieve price 2(1 + sqrt e) = 5.297442541400 is the FORCED-equal-level constant, the corpus's live figure being K_BF = 5.158064680330, reproduced here to twelve digits at (a, b) = (2.229949, 2.928115), and the sieve-on-holes is the vector sieve only after the Ford-Halberstam substitution step that sift-limit-attack.md 7b(1b) already owns; the \"no third mechanism excluded\" line is honest but incomplete, since weighted sieves with Chen switching are already priced and closed at sift-limit-attack.md 4.2; scope of death gains one row, L7's mechanism 2, which the growth note's own section 10 calls untouched while its sibling calls it dead; no exponent moved. | [redteam-0904-item0.md](history/staging/redteam-0904-item0.md) |\n| 0 | `Q-redteam-0904-sifting-limit` Do recon-0904-sifting-limit-floor.md's five claims survive adversarial re-derivation at the page, and in particular is the 4.26645 cap a method artefact at rung MEASURED? | ANSWERED | Four of five claims survive with corrections and the headline does not. Claim d is REFUTED as stated on four grounds, each sufficient: the level-D LP fixes one omega-profile out of a class Ford defines by a ONE-SIDED inequality, and inside the classical (Omega_2(kappa,L)) budget a legal profile at x = 13 gives a calibrated reading of 5.0113, above beta_2 = 4.26645, which fires the target note's own pre-registered refutation of its floor; the calibration is a 1.72 multiplicative correction fitted at one point and it misses the second proven point beta(1/2) = 1 by 66 to 82 per cent, two and a half times the 28.7 per cent effect the headline rests on; the pooled 3.3152 averages four statistics of which only s* is the definitional analogue of beta, and that route reads 3.4678 here and 3.9487 at x = 43 in the corpus's own data, still climbing at +0.4297 per ln x with the fitted line reaching 4.26645 at x = 104; and 3.3152 is 22.2961 per cent below 4.26645 rather than the 18 per cent the note prints. Claim a is CONFIRMED with a second source off the OCR channel (Ford 2023 p. 37, \"Some authors, e.g. Selberg, refer to 1/beta(kappa) as the sieve limit\"), one page correction owed (Halberstam is p. 117, not p. 116). Claim b is CONFIRMED and strengthened: Brady's class is stated on his p. 10 and IS the axiom-only interval class Face 4 needs, his v_R table is reproduced here, and the identity v_{2d+2} = v_{2d+1} his proof asserts is confirmed at d = 0, 1, 2, so 1.819592 rests on proved facts alone. Claim c is CONFIRMED but demoted: beta(2) >= beta(1) = 2 is two lines from Ford's own one-sided (Omega) plus his own beta(1) >= 2, so the padding construction is correct and unnecessary. Of the eight proposed live-layer changes, two survive verbatim, five need rewording and one is refuted; the new SEARCH-CONVENTIONS row adds exactly three clearing phrases and changes nothing for any existing absence claim. | [redteam-0904-sifting-limit.md](history/staging/redteam-0904-sifting-limit.md) |\n| 0 | `Q-rho-maximal-law` What is the rho maximal law, what is its weakest sufficient form against the crossing, and where does it sit against print? | PARTIAL | The pricing lemma turns any RML(alpha) with alpha < beta_2 = 4.26645 into G2(z#) << z^alpha ln^2 z, every step proven except the law itself; the sufficiency curve lambda_max falls from 2.31949 at z = 13 to 1.78446 at z = 47, the weakest measured point, and whether it ever reaches zero is model-dependent and undecided, so nothing here is an unconditional exponent. | [rho-exact-z31-01.md](history/staging/rho-exact-z31-01.md), [rho-maximal-law.md](history/staging/rho-maximal-law.md) |\n| 0 | `Q-rho-sup-z41-0830` What is the exact sup over all positions of the centred sawtooth remainder at z = 41 (period 7.42e12), and of R_H at H = z^3 and z^4, and what does the eighth exact point do to the truth's slope and to the u0 = 3 form of REC(s, u0)? | PARTIAL | Not run in full; the exact z = 41 point prices at 4.8 to 5.4 h on this machine from measured per-position costs (naive 69.8, table 23.5, table-plus-windows 36.6 ns per worker; fleet 4.52 ns of wall at z = 41), above the 3.5 h rule, so what exists is a new engine (a PROVEN reflection that halves the walk, a P(29) periodic table worth 2.9x, per-block exact re-seeding) reproducing every cited exact sup at z = 13..37 digit for digit, sup\\|R_H\\| at H = z^3 walked for the first time at z = 19..37 (F3 = 26.4 to 35.9, the factor 2 was 1.5 to 2.2x loose), a sealed pre-registration (forecast sup 60.07, band [47.25, 76.37], kill needs sup\\|R_H3\\| >= 1807.417), one pilot twelfth giving lower bounds sup\\|rho~\\|(41) >= 70.651250 and sup\\|R_H3\\| >= 64.416936, and an eleven-segment plan for the box; no bound-and-prune exists on three routes; nothing asymptotic can move whatever the point turns out to be. | [measure-0830-rho-sup-z41.md](history/staging/measure-0830-rho-sup-z41.md) |\n| 0 | `Q-rho2-bound` Is there an analytic upper bound on (z) from its proven closed form, and does it matter for RML? | ANSWERED | Already proven 2026-08-21 (attack-rhoms-01); the constant is now named, 170.88 z^{2s} ln^8 z; Chebyshev off any second moment diverges from RML (the true C_L = ms = 1 floor clears at z = 41 and 43 and misses by 2.155x at z = 47), so it is an ingredient, not a route. | [attack-rhoms-01.md](history/staging/attack-rhoms-01.md), [rho2-analytic-bound.md](history/staging/rho2-analytic-bound.md) |\n| 0 | `Q-rml-proof-0829n` Starting from Lemma V's PROVEN mean-square bound, what is the exact chain of implications to a two-class exponent below beta_2 = 4.26645, which single arrow is open, and does it close? | PARTIAL | The chain from the proven mean square to an exponent below beta_2 has exactly one open arrow, the mean-square-to-sup recovery REC(s,u0): sup_x \\|R_H(x)\\| <= z^{u0/2 - eps} rms(R_H) at H = z^{u0} for one fixed u0 in (2, beta_2); every attempt here dies at a named place (term-by-term accounting is capped at 2s + o(1), the trivial-level exponent; position-union pays e^{theta(z)/q}; window smoothing and the P(y) lever move polylog only; the smooth-profile form is closed on hypothesis and priced above beta_2), the arrow is measured TRUE with certified margin z^1.72 to z^1.92 at u0 = 4 over z = 19..37 and the truth's slope 2.766 +/- 0.212 sits 5.8 se under u0 = 4 on seven points under one octave, so the failure is a proof gap at every computable z and undecided asymptotically; no exponent moved. | [attack-0829n-rml-proof.md](history/staging/attack-0829n-rml-proof.md) |\n| 0 | `Q-tail-deficit-model` Does the exact compound-geometric thinning of the previous level's own gap histogram, with the qualifying-gap constraint g = 0, +/-2 (mod q) carried through the ladder, predict the tile's tail-deficit factor G2/(mbar ln D) at zero parameters, and does that make object-models-read-0829's D5 residue-level classification constructive rather than inferred? | ANSWERED | NO. The zero-parameter CRT-constrained thinning predicts a tail HEAVIER than the tile's at every level, delta_M2 = 0.6461, 0.6746, 0.7021 against a measured 0.4577, 0.4463, 0.4791, so the pre-registered \"classification was wrong\" arm fires and D5 returns to OPEN with C3's constructive route REFUTED; the constraint is informative but small, carrying 4.0 to 10.0 percent of ln(null/truth) at the far tail, or 7.7 to 14.4 percent read against a rate-matched control, against the grain's ORDER at 39.4 to 54.6 percent at the deepest abscissa each level resolves; at shallow abscissae the ordering reverses (B 8.7 against C 4.8 at x = 23, u = 4), which the exact operator on a shuffled true grain confirms without any model (maximum 276, 354, 426 against the true 204, 258, 348), and the order effect is now localised (sections 7 and 9): a first-order Markov word from the true adjacent-pair statistics carries 32.3, 34.2 and 60.8 percent of ln(shuffled/truth) at the deepest abscissa of the three folds, and a SECOND-order word from the true adjacent-triple statistics carries 97.3, 97.9 and 102.6 percent there, r = 0.972, 1.061 and 1.000 on draw-mean maxima over 40, 20 and 10 draws, so the folded tile's tail is MEASURED to be a function of the previous grain's three-consecutive-gap statistics and of essentially nothing longer-range; that surrogate is seeded on the true previous grain at one fold, is not iterated, predicts no delta and does not revive C3, and the 348.0 sd 0.0 at 29->31 rests on ten draws. | [measure-tail-deficit-0829.md](history/staging/measure-tail-deficit-0829.md) |\n| 0 | `Q-theta-ladder` Does the all-positions exponent theta turn over below 2, converge to exactly 2, or settle above 2? | CLOSED | The answer is above 2 with an amendment, and the route is retired regardless: theta does not turn over (it dips and comes back, need/z^2 = 0.3550 to 0.6119 at z = 13..31 and rising from 31), convergence to exactly 2 is not supported (e = 1 rejected at 95% in all four fits), point estimates run 2.37 to 2.99 without settling, and OUTCOMES.md records the certificate route as RETIRED because the sharp maximal law it needs is itself TPC-implying. | [theta-ladder.md](theta-ladder.md) |\n| 0 | `Q-usup-convention-0830` Are lemmaV-sup-extension.md's u_sup and u_sat and attack-0829n-rml-proof.md sec.4.1's CAP(z) statements about the same object (level D = z^s at s = 3.0, same moduli, weights and normalisation), so that the sec.4.1 correction in passing applies, or does a level-convention mismatch void it? | ANSWERED | SAME object, VERIFIED at the code: both notes build the lattice through buildTerms(z, z^3), the modulus sets and Vabs(e) agree to 6.9e-18 at z = 13..23 and the count convention matches at all ten levels, the cited Ssat and u_sat reproduce on the RML lattice to every printed digit at z = 13..19 and the full-level alternative does not (19.544 against 19.602 at z = 13, 45.827 against 50.314 at z = 17); so the PROVEN cap Ssat <= CAP <= z^{2s+o(1)} applies and refutes lemmaV-sup-extension.md's asymptotic prose at lines 485-486 and 508-516 (2^pi(z) moduli, a C^pi(z) theorem as the reachable end), while sec.4.1's attribution sentence overreaches by calling that note's \"reading\" a shape it lists as one of two indistinguishable fits and flags as its likeliest error; neither ledger verdict line changes. | [verify-0830-usup-convention.md](history/staging/verify-0830-usup-convention.md) |\n| 1d | `Q-applied-0828-closures` Were the closures red team's corrections applied to the five HELD notes? | ANSWERED | Applied. 47 prose corrections across the five notes; c2prime-refit-22 drops from CLOSED to PARTIAL and three ledger verdicts are rewritten; four producer READINGS blocks and eleven live-document lines carry the same defects and are listed here uncorrected, behind the fence. | [applied-0828-closures.md](history/staging/applied-0828-closures.md) |\n| 1d | `Q-delta-reader-0830` Can any instrument read the sign of the log-power correction delta in G2 ~ c n^beta (ln n)^delta at reach 79, passing the one-class control first? | ANSWERED | No. Six readers were pre-registered against stepped synthetic laws and the one-class control; the four power-chain readers (the diagonal meter among them) are killed by the P(n) stepping alone, the joint fit is calibrated but reads the control's finite-reach delta NEGATIVE (-0.38 +- 0.14 at 64 terms) where its conjectured asymptotic delta is +2, and the one reader that passes does so by importing the exponent, its sign being the sign of (1.777 - beta_hat). delta's sign for G2 is unreadable at reach 79 by any instrument tried, and the control shows a finite-reach reading would not carry the asymptotic sign anyway; item 1d's all-bases form stays unattackable. | [measure-0830-delta-reader.md](history/staging/measure-0830-delta-reader.md) |\n| 1d | `Q-fekete-1d-defect47` Does the bounded-defect Fekete route survive a probe at 47#? | PARTIAL | The defect at 47# is ordinary and the 47# enumeration cannot move item 1d's TPC threshold whatever value it returns; the bounded-defect Fekete lemma is stated exactly and proved with every hypothesis except the candidate itself discharged, so the route reduces to one named inequality and is neither closed nor open beyond that. | [fekete-1d.md](history/staging/fekete-1d.md) |\n| 1d | `Q-g2-falls-decision-rule` Does G2(x#)/x^2 fall, and what pre-registered decision rule would settle it? | PARTIAL | The instrument is calibrated and sharp, resolving the one-class control at 11.6 sigma on the same nine points where it returns 0.9 sigma on G2, and the honest band on the slope is +/-0.117 at nine terms, so the rule is registered; but the power analysis puts separation at x = 53 only if the falling law is x ln^2 x and at x = 151 if it is x ln^3 x, so phase 1's extra terms settle nothing and no reachable exact ladder does either. | [phase1-T3prep-decision-rule.md](history/staging/phase1-T3prep-decision-rule.md) |\n| 1d | `Q-hsub-reductions` Can (H-sub) be proven or refuted, and what does the fold machinery reach? | PARTIAL | Neither, but the statement is smaller: three reductions of the hypothesis are proven, the lemma consuming only power pairs so that it weakens to (H-sub-pow) with the conclusion unchanged, the fold machinery's inability to reach any of them is made exact, and the hunt over all 111 reachable pairs found no drifting family and no counterexample. | [attack-hsub-01.md](history/staging/attack-hsub-01.md) |\n| 1d | `Q-hsubpow-K` Can (H-sub-pow) be proven with an explicit K in the legal zone? | CLOSED | NO by three mechanisms: the CRT lift (K* >= pi(y') - pi(y) diverges), anchored caps (diverge at every base), Iwaniec at two classes (it IS beta2-note); TODO 1d's legal zone is mis-stated, the trusted zone is [1.3946, 11.3568). | [hsubpow-explicit-K.md](history/staging/hsubpow-explicit-K.md) |\n| 1d | `Q-hsubpow-K-0829n` Can (H-sub-pow) be proven with an explicit K inside the trusted legal zone [1.3946, 11.3568) by a mechanism the 2026-08-28 pass did not close? | OPEN | No K is proven at any base; the single open inequality is the uniform-in-k ratio cap G(b^(k+1))/G(b^k) <= e^K G(b), which is a proof gap at a fixed base and a possible truth gap across bases, since for any law G ~ c n^beta (ln n)^delta the all-bases hypothesis holds with finite K if and only if delta >= 0. | [attack-0829n-hsubpow-K.md](history/staging/attack-0829n-hsubpow-K.md) |\n| 1d | `Q-import-interp` Does the Bayati-Gamarnik-Tetali interpolation method reach the G2 Fekete object? | ANSWERED | No: BGT closes on hypothesis H1, since the constraint count never splits (pi(st) - pi(s) - pi(t) is zero at no pair with st >= 25, minimum 2, maximum 12, VERIFIED on 104 pairs), and the one coordinate that does split has limit +infinity; the row lands as WALL-ADDRESS plus the identity that the submultiplicativity defect is the Overshoot slack. | [import-interp.md](history/staging/import-interp.md) |\n| 1d | `Q-redteam-0828-closures` Do the five 2026-08-28 closure notes stand, and do they stand for the reasons they give? | ANSWERED | Three stand on corrected sentences (1d, Z5b, 0); one stands in half (10, the 1.074 counter-claim does not); one does not stand for its stated reason (1c, closed on a narrower window than the prior work's significant one, and its CLOSED has overwritten a PARTIAL in the generated index). | [redteam-0828-closures.md](history/staging/redteam-0828-closures.md) |\n| 1d | `Q-redteam-0830-fekete` Do the load-bearing claims of attack-0829n-hsubpow-K.md (the sign lemma, the K -> beta_bound map, the zone, the TODO.md base-16 correction) and measure-0830-delta-reader.md (the six pre-registered readers, their kill gates, the joint fit's calibration, the RB circularity argument) survive independent re-derivation, and are the two live-doc corrections they caused the right sentences? | ANSWERED | Every number in both notes reproduces on independently written code (all 14 cells of the beta_bound / K_min table, all 48 cells of the reader-calibration table, all 24 figures of the real-control table, the margins, the sups, the 5.607 correction, the 10-of-81 count), and the sign lemma is re-proven as stated for continuous exact laws. Two claims are WEAKENED and one live-doc sentence needs a qualifier: the sign lemma's constant 1.0597 loses 43% of its value if the base floor moves from 2 to 3 and its whole shape fails for the stepped law that a primorial ladder must present, where beta re-enters the sup and a delta = 0 law already needs K = 1.37 at beta = 2, inside the trap; and TODO.md 1d's \"the sign of delta is unreadable for G2 at reach 79 by any instrument tried\" is wrong on the letter, since reader RB passed all four pre-registered criteria and read delta_hat = +0.80 +- 0.09, the note voiding it post-hoc on a circularity the pre-registration flagged but did not make a kill criterion; the honest sentence adds \"non-circular\". No claim in either note is refuted. | [redteam-0830-fekete.md](history/staging/redteam-0830-fekete.md) |\n| 1d | `Q-y2-recompute` Does the sixteen-level Y2 ladder reproduce on the corrected instrument, and does Y2/x^2 fall? | ANSWERED | The ladder reproduces exactly, sixteen of sixteen from sixteen independent processes, digit for digit against the published 2026-08-18 ladder, and Y2/x^2 falls at 15 of the 15 consecutive steps; this does NOT show that G2(x#)/x^2 falls, since the shortfall Y2/(G2-1) is unmeasured above x = 79. | [y2-recompute.md](history/staging/y2-recompute.md) |\n| 0b | `Q-gate-multiplies` Does \"the gate multiplies\" close the entire u-frame recursion branch, or only the merge chain? | ANSWERED | Only the merge chain and one relative of it: the no-fixed-point argument does not reach TODO 0b at all, though 0b is wrong as stated for an unrelated reason and the error is a factor of ln u; what survives is the copy theorem for maxsum (VERIFIED 40 of 40), which needs a residue-deleted maxsum bound that does not pass through a kill count. | [gate-multiplies.md](gate-multiplies.md) |\n| 0b | `Q-import-thinning` Do point-process thinning and interval coalescence give H'' a null model? | ANSWERED | Yes and exactly: the fold recursion is an exactly solvable thinning whose gap pgf transforms by a Mobius map fixing 0 and 1, so under independent thinning the gap word of T_x is exactly geometric with mean mbar/6 at every rung with no error term, which turns both of the record's fitted parameters into derived ones. | [import-thinning.md](history/staging/import-thinning.md) |\n| 0c | `Q-0c-holesweep` At a fold, how does maxsum degrade copy by copy as the two deleted residues sweep through their possible positions? | ANSWERED | The full curve is on disk for nine folds (5->7 through 31->37, every copy) and it is a PALINDROME: the Mirror-Sweep Lemma is proven here and verified exhaustively, giving the fingerprint any kill-count-free bound must reproduce, but no such bound was produced by this pass. | [attack-0c-holesweep.md](history/staging/attack-0c-holesweep.md) |\n| 0c | `Q-0c0e-level-selection` Can a residue-deleted maxsum bound that only has to hold at levels of the argument's choosing carry the weak Zone Postulate? | CLOSED | CLOSED, and the mechanism has a name: the level-selection licence is worth 0.3187 nats once and is falling, no selection rule beats its own null by anything worth having across T_11..T_29, and the BV/EH sweep supplies no moduli-selecting statement to spend. | [attack-0c0e-level-selection.md](history/staging/attack-0c0e-level-selection.md) |\n| 0c | `Q-foldL-maxsum-direct` Can maxsum_m(T_x), plain and residue-deleted, be bounded above by an argument that never counts kills? | CLOSED | The brief's premise contradicts the corpus's own Bridge Floor (maxsum_k >= maxsum_1 = G2(T_x) for every k), so the bridge cannot convert far enough however good the bound is; all four routes close (R1 partial then closed, R2 tautological and quantitative, R3 busts the budget), and the order-m object is in print, so item 0c's absence sentence has to change. | [attack-foldL-05-maxsum-direct.md](history/staging/attack-foldL-05-maxsum-direct.md) |\n| 0c | `Q-import-chaining` Can Dudley's entropy bound or Talagrand's generic chaining beat the union bound over positions on the maxsum law? | CLOSED | No, and the reason is geometric rather than probabilistic: the entropy integral of the true increment metric is already 1.054-1.099 times rms*sqrt(2 lnW) at its lower branch and 1.484-1.545 at its upper, flat across z = 13..23, so chaining's ceiling with a perfect universal constant sits below the union bound's floor; the honest constant-carrying chain measures 2.878 to 3.027. | [import-chaining.md](history/staging/import-chaining.md) |\n| X | `Q-verify-cofactor-convolution` Does the cofactor-convolution identity at the anchor hold, and does it test the joint law? | ANSWERED | RESTATED with corrections: the arithmetic is right, an independent re-derivation reproducing every figure to the digit at all five levels and confirming the asserted closed-form step, but the framing does not survive, since X is pinned by the identity X = M - Nbar + n_0 so the whole comparison collapses to one cell and the joint is measurably not a product elsewhere; the model error is 0.52 per cent, not 0.050. | [verify-cofactor-convolution.md](history/staging/verify-cofactor-convolution.md) |\n| X | `Q-xchan-at29-prereg` Does the joint-deficit closed form survive a blind test at @29? | OPEN | Pre-registration only, committed alone before any producer existed: the statistic, the predictions adopted verbatim from the record, two acceptance bands, the validation gate the instrument must clear before any @29 number is reported, and what each verdict does to TODO item X. | [xchan-at29-prereg.md](history/staging/xchan-at29-prereg.md) |\n| X | `Q-xchan-at37-offset` Does any registered offset-correction candidate for the ~3.8 law survive at @37? | ANSWERED | Sealed and committed alone before any @37 census of any kind existed, fixing the candidates, the sigma model and its projection band, the scoring rule and what each verdict does to item X's offset clause; scored in xchan-at37-score.md, where every registered candidate is killed and the number survives an independent recount. | [xchan-at37-offset-prereg.md](history/staging/xchan-at37-offset-prereg.md) |\n| X | `Q-xchan-at37-score` What does the @37 census say about the sealed X-channel offset pre-registration? | ANSWERED | The census measured 1 - J = 0.020823, below every registered prediction, so scored exactly as registered every one of the seven candidates dies at \\|z\\| = 104 to 122 and the survivor set is EMPTY, an outcome the sealed prereg has no consequence clause for; the number itself survives an independent recount on a different marking scheme, and the offset question is replaced by a larger one. | [xchan-at37-score.md](history/staging/xchan-at37-score.md) |\n| X | `Q-xchannel-at23` What is the fifth point of the X-channel statistic, at @23, and does the monotone rise hold? | PARTIAL | The fifth point is +0.2658 at @23, the rise holds at five levels and is larger than the four-point trend predicted, and the deficit has migrated into m >= 3, whose share of the X-gap runs 10.5, 23.5 and 81.1 per cent at @17, @19 and @23; the constant itself is not derived here. | [xchannel-at23.md](history/staging/xchannel-at23.md) |\n| X | `Q-xchannel-closedform` Does the zero-parameter closed form for the joint deficit survive its two blind tests at @29 and @31? | PARTIAL | 1 - J = 4S2 is the only one of the three pre-registered laws left standing and it is not exact: a clean hit at @29, z = -0.90, and 4.93 sigma low at @31 where sigma_J falls to 0.000024, with the two rivals dying at 6.35 and 20.81 sigma; both blind levels agree on a stable relative offset of about half a percent, -0.41% and -0.48%, whose absolute residuals match to 2%. | [xchan-at29.md](history/staging/xchan-at29.md) |\n| X | `Q-xchannel-offset` What produces the ~3.8 law's -0.45% offset, and which candidate correction survives? | PARTIAL | The best available description is a finite-level correction of S3's size and sign - 1 - J = 4S2 - S3 scores z = +0.04 at @29 and -0.41 at @31 where the standing law scores -0.43 and -2.32 - but it is POST HOC; two candidate corrections and one shape are refuted on existing data, the sigma behind the @31 detection is calibrated on seven known-truth controls, and the deciding blind test at @37 is pre-registered and committed alone. | [item-x-offset.md](history/staging/item-x-offset.md) |\n| X | `Q-xchannel-triples` Does the joint deficit deepen or decay as the mixed super-W triple census is extended past @17? | ANSWERED | It decays: J = 0.9025, 0.9599, 0.9659 at @17, @19, @23, so the deficit runs 9.7%, 4.0%, 3.4%, both new points land inside the pre-registered DECAYING FASTER THAN FORCED band, and the DEEPENING instinct is refuted by 3.50 sigma between @17 and @19 and a further 1.68 sigma to @23. | [xchannel-triples.md](history/staging/xchannel-triples.md) |\n| A | `Q-anchored-ladder` Does the unified anchored ladder generalize past @11 and @13, and what does cheap K buy at each level? | ANSWERED | It generalizes verbatim to @17 and @19, and the K = 0 unified floor is DEAD there (vacuous at -1262 and -55865); what survives and grows is the family lead at the classic certification depth K*, margin +2, +5, +26, +110 across @11 to @19. | [attack-anchored-02.md](history/staging/attack-anchored-02.md) |\n| A | `Q-anchored-ladder-17-0830` At @17 and above, at which depth K does the composed (unified) anchored floor first turn positive and at which K does it reach the truth, and does the depth-cost curve K_first_positive(level), K_truth(level) move with level? | ANSWERED | At @17/@19 the answer was already on record (Q-anchored-ladder: positive at K = 2/10, truth at ascending K = 109/410, minimal pool 88/350) and is re-derived here as the custody gate; the new level @23 ran under a sealed 14-of-14 forecast: positive first at K = 27 = K* (PROVEN from the record before the run), truth at ascending K = 1732 of 1739, minimal pool 1543 = 0.887 of the scour (PROVEN lower bound meets VERIFIED upper bound); across five levels positivity costs exactly K* while the truth fraction rises 0.40, 0.62, 0.73, 0.81, 0.89, a MEASURED finite table with no law in x and no exponent touched. | [attack-0830-anchored-ladder-17.md](history/staging/attack-0830-anchored-ladder-17.md) |\n| A | `Q-anchored-unify` Can the three anchored mechanics be unified at @11, and what floor family does the unified cap certify? | ANSWERED | MEASURED and PROVEN-here but HELD: extending the staircase's cofactor injection to m = 1 folds the self-strike allowance into the count, the unified-cap lemma gives fresh <= capU_K <= cap_K at every depth and prime at @11 and @13, and the floor family runs 36 to 45; the x = 37 secondary is a clean negative. | [attack-anchored-01.md](history/staging/attack-anchored-01.md) |\n| A | `Q-history-dial` Does revealing the scour primes' classes concentrate the floor on a bounded set of strike locations, and what is the history dial worth? | ANSWERED | Disconfirming: the class axis is linear at 2.90 survivors per prime read, so no bounded set of strike locations carries the floor, and the touch-count ceiling is proven and tight; deliverable (1) of the brief already existed as canonical state (the forcing ladder 16 -> 45 at @11), so nothing new was bought there. | [attack-history-dial.md](history/staging/attack-history-dial.md) |\n| A | `Q-redteam-0830-engine` Do attack-0830-buchstab-deep.md, attack-0830-comb-tail.md and attack-0830-anchored-ladder-17.md survive an adversarial re-derivation on code that shares nothing with their producers, and does REFUTED row 97 stand as worded? | ANSWERED | Every headline number in the three notes reproduces exactly on independent code (26 of 26 comparisons, including F2/f2 = 3.6682 at sigma = 4.7088 by a near-analytic route, the 0-of-1512930 pair count, the tail defect at five levels, the full 419328-term Legendre split, and the whole @23 anchored ladder including K* = 27, floorU = 5364, truth 597475 and the minimal pool 1543 proven exact); one load-bearing DERIVATION is REFUTED — \"\\|B - 1\\| >= c forces sigma(q) < u_c - 1\" fails at @23 on 21134 (q, K) pairs for the engine's model B at c = 0.1 and on 33875 high-count pairs for the measured B at c = 0.01, because the step bounds every u in a weighted average by the largest one and treats the denominator as e^-gamma, so the \"level-free\" clause of buchstab-deep section 4 and REFUTED row 97's \"\\|B - 1\\| >= 0.01 forces sigma < 1.798\" must be re-graded from DERIVED to MEASURED-at-@23 (where the conclusion survives: the worst sigma is 2.159, still far below beta2 = 4.26645); row 97's \"the best sigma any level has\" is separately WEAKENED, since @29's head sigma is 5.5785 with width 1.5325 and @97's is 17.1422 with width 1.0000; comb-tail derives its main-term factor from prod (1 - 1/q_i) and measures it against prod (1 - 1/(q_i - 1)), which is what natal-cap-28 line 283 computes against its own line 20 and against certificate-engine.md section 1, a 0.9% difference at @23 that moves nothing certified; comb-tail also misquotes its own cited source as F1 in [1.5, 4] where that source says [1.5, 3] and says there is no bound at all at s < 1; four smaller slips are listed and none opens or closes a route. | [redteam-0830-engine.md](history/staging/redteam-0830-engine.md) |\n| 1 | `Q-at43-bigint-0830` Can the K-30 natal march be carried past its 2^53 ceiling to @43 exactly, and is the @43 point worth its cost? | PARTIAL | The engine side is done and VERIFIED (five paths promoted to BigInt, @7..@37 and a 0.248% slice of @41 reproduced digit for digit); the @43 point is NOT run, because the measured extrapolation is 579 h of eight cores on this machine (a 43x tile times a 2.23x per-cell cost, against the brief's ~13x), which is a weeks-class box job whose only payoff is a sixth point on a curve with no consumer; the forecast 0.8393 raw / 0.8399 persisted stands unscored. | [engine-0830-at43-bigint.md](history/staging/engine-0830-at43-bigint.md) |\n| 1 | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| Z7 | `Q-zonegap-03-score` Do the ten predictions sealed in zonegap-03-prereg.md score against the stage-3 sweep at X = 1e12? | ANSWERED | All ten sealed rows score HIT and none miss, after a second pass added a band-edge argument to zonegap-01.js and re-ran the decade so the two rows that named an unprinted band could be scored; the four Group T hits are a custody promotion that follows from CUSTODY 1 and 3 passing, one sub-clause of T5 (the full-decade sd) stays unprinted, and the sweep still needs a DERIVED engine because zonegap-01.js's inlined 41-record ladder makes it exit at 1e12. | [zonegap-03-score.md](history/staging/zonegap-03-score.md) |\n| 2 | `Q-var41` What does the stable law predict for Var(41), and what can the tenth Var/E point pin? | OPEN | Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift. | [var41-prereg.md](history/staging/var41-prereg.md) |\n| 8 | `Q-applied-0828-engine` Were the engine red team's corrections applied to the five HELD notes? | ANSWERED | Applied, 37 edits across the five notes: two numbers corrected (first s >= 10.82 at x = 263 not 239, first non-empty kappa=1 level @37 not @53), two ledger verdict lines and one note title rewritten, one proof step given BV's max-over-y form, the one-class freshness factor restated on P^-(m) >= q so it holds at every scour prime, and two mislabelled columns renamed; six corrections that land on live documents are collected here unapplied, and no producer was touched. | [applied-0828-engine.md](history/staging/applied-0828-engine.md) |\n| 8 | `Q-applied-0828-live` Which engine and head red-team corrections reached the live layer? | ANSWERED | Nineteen edits across four documents: the glossary's cap_K dimension count with its mandatory sifted-versus-assumed clause plus three new entries (twin opener, head, tail); the survey's one-class density factor, S1's restored pi(q-1) terms and r in N_x hypothesis, the dropped Chen absorption, Theorem C with its emptiness, dimension 1 for q_i < q, the comb-conditioning qualifier and the inverted shallow-band bullet; the certificate engine's equidistribution status cell, the q = T^{o(1)} second hypothesis and the Comb Discrepancy scope cell; and the census's R as the continuum functional with its three comparators; paper/staircase-note.md, TODO.md and QUESTIONS.md are owed and untouched. | [applied-0828-live.md](history/staging/applied-0828-live.md) |\n| 8 | `Q-buchstab-deep-0830` Can the certificate engine's deep-ladder Buchstab transfer be proven at dimension 2 at the depths the run levels reach by a route that does not go through the fundamental lemma at s >= 22.06 or the constant-free DH Theorem 9.1 (TODO 8a)? | CLOSED | NO by any instrument this corpus can cite, and the non-closing step is structural, not a constant: the transfer is an asymptotic for a ratio of two dimension-2 sifting functions at one sifting depth z = q, so a sieve bracket [f2, F2] survives undivided in the ratio (width 3.67 at the best sigma any level has, 4.71 at the @23 head); a correction \\|B - 1\\| >= 1% can only occur at sigma(q) < 1.8 where f2 = 0 and F2 >= 7.85, while a lower bound exists only at sigma > 4.266 where \\|B - 1\\| < 1e-5; the Buchstab identity iterated once is already negative at K = 1 for q = 37 at @23 and is the sieve itself when iterated fully; Jurkat-Richert fails Omega(1) as stated; in the certificate's legal direction F2 beats the trivial cap_K <= cap2 at 0 of 1512930 (q, K) pairs at @23, so the sharp-sieve floor is -1733138 at every K; the transfer stays HEURISTIC, what would move it is a kappa = 2 asymptotic in the open band 2 < sigma < 4.266, and part (b) is scoped and graded, not attacked. | [attack-0830-buchstab-deep.md](history/staging/attack-0830-buchstab-deep.md) |\n| 8 | `Q-buchstab-transfer` Is the certificate engine's Buchstab transfer provable in the shallow regime y = T^{o(1)}? | ANSWERED | PROVEN conditional on the fundamental lemma and EMPTY at every run level (needs s >= 22.06; available 4.7 @23, 17.1 @97); the engine's B is a dimension-1 object, the survey's pair-Buchstab is dimension 2, the certificate needs a third. | [thm-buchstab-transfer-shallow.md](history/staging/thm-buchstab-transfer-shallow.md) |\n| 8 | `Q-comb-discrepancy` Can the Comb Discrepancy Lemma's constant 2*3^k be tightened (TODO 8c)? | PARTIAL | The lemma IS the trivial per-block bound; the attained optimum is max G - min G, a computed number per level (slack 29x @23, 54x @29, growing); term-by-term pricing lifts the certified head share to about 28-29 percent, not the 50 hoped for. | [comb-discrepancy-tight.md](history/staging/comb-discrepancy-tight.md) |\n| 8 | `Q-comb-tail-0830` Can TODO item 8's remaining part (b), prime-comb equidistribution in the tail regime, be proven at the depths the certificate needs, or at least measured and priced at the enumerable levels (8b)? | PARTIAL | Not proven and no exponent moves: the tail defect is measured exactly for the first time (signed -0.01% of the tail main term at @23, -0.00% at @29, unsigned 0.60% and 0.25%, smaller than the head's 1.00% in aggregate but 8 to 37% per prime at its worst), the Comb Discrepancy Lemma's method fails in the tail on its MAIN TERM (off by a derived factor e^gamma(1/u - q^(1-u)), measured aggregate 1.14x at @23) before its error term (10^27 x main), the prime-comb Legendre form has 2^(k+2) terms of which the short ones obey the lemma's <1 bound and the long ones are prime-in-AP discrepancies whose term-by-term sum is 11.2% of main at @23 against a signed -0.01%; the all-x form at K = 0 is Theorem C (PROVEN, limit only) and at the certificate's depth K* the non-closing step is a kappa = 1 asymptotic at sifting parameter s < 2, a proof gap on data that show B_tail = 0.998-1.000 at K* through @29; the full-depth half is 8(a), CLOSED. | [attack-0830-comb-tail.md](history/staging/attack-0830-comb-tail.md) |\n| 8 | `Q-redteam-0828-engine` Do the five 2026-08-28 certificate-engine notes survive an adversarial re-derivation, and does the one-class freshness factor correction hold before it reaches a live document? | ANSWERED | The one-class factor holds and is stronger than either note states; four numbers are refuted (first s>=10.82 is x=263 not 239, first non-empty kappa=1 level is @37 not @53, rho*g_max is off by one gap, the @17 certified share and per-term constant carry the wrong convention) and one proof step needs the max-over-y form of BV; the cluster's shared verdict stands. | [redteam-0828-engine.md](history/staging/redteam-0828-engine.md) |\n| 8 | `Q-redteam-0830-engine` Do attack-0830-buchstab-deep.md, attack-0830-comb-tail.md and attack-0830-anchored-ladder-17.md survive an adversarial re-derivation on code that shares nothing with their producers, and does REFUTED row 97 stand as worded? | ANSWERED | Every headline number in the three notes reproduces exactly on independent code (26 of 26 comparisons, including F2/f2 = 3.6682 at sigma = 4.7088 by a near-analytic route, the 0-of-1512930 pair count, the tail defect at five levels, the full 419328-term Legendre split, and the whole @23 anchored ladder including K* = 27, floorU = 5364, truth 597475 and the minimal pool 1543 proven exact); one load-bearing DERIVATION is REFUTED — \"\\|B - 1\\| >= c forces sigma(q) < u_c - 1\" fails at @23 on 21134 (q, K) pairs for the engine's model B at c = 0.1 and on 33875 high-count pairs for the measured B at c = 0.01, because the step bounds every u in a weighted average by the largest one and treats the denominator as e^-gamma, so the \"level-free\" clause of buchstab-deep section 4 and REFUTED row 97's \"\\|B - 1\\| >= 0.01 forces sigma < 1.798\" must be re-graded from DERIVED to MEASURED-at-@23 (where the conclusion survives: the worst sigma is 2.159, still far below beta2 = 4.26645); row 97's \"the best sigma any level has\" is separately WEAKENED, since @29's head sigma is 5.5785 with width 1.5325 and @97's is 17.1422 with width 1.0000; comb-tail derives its main-term factor from prod (1 - 1/q_i) and measures it against prod (1 - 1/(q_i - 1)), which is what natal-cap-28 line 283 computes against its own line 20 and against certificate-engine.md section 1, a 0.9% difference at @23 that moves nothing certified; comb-tail also misquotes its own cited source as F1 in [1.5, 4] where that source says [1.5, 3] and says there is no bound at all at s < 1; four smaller slips are listed and none opens or closes a route. | [redteam-0830-engine.md](history/staging/redteam-0830-engine.md) |\n| 8 | `Q-sharp-sieve-range` Do the sharp sieve functions (Jurkat-Richert, DHR) make the two empty certificate-engine theorems non-empty at run levels? | CLOSED | NO at finite level: DH Thm 9.1 carries no written constant and the crude fundamental lemma is strictly better; as limit statements kappa=1 is first non-empty @37 (a 19.8-wide bracket; @53 is the first narrow one, 1.656) and kappa=2 @23. | [thm-sharp-sieve-range.md](history/staging/thm-sharp-sieve-range.md) |\n| 8 | `Q-u2-engine-depth` Is the certificate engine's operative depth heading to u = 2, and does that make TODO item 8's payout form TPC-strength? | ANSWERED | It is not: the measured operative depth runs u = 4.191 at @17 down to 3.557 at @97 and is still falling, so the brief's conditional does not fire and item 8 is shown neither TPC-strength nor safe; a WALL-ADDRESS in the weakest sense, every figure SCRATCHPAD-GRADE. | [u2-engine-depth.md](history/staging/u2-engine-depth.md) |\n| Z0 | `Q-applied-0828-census` Were the census red team's corrections applied to the three HELD notes? | ANSWERED | Every WEAKENED and REFUTED verdict in redteam-0828-census.md is applied to its target note in the present tense; two producer defects and four live-doc corrections stay open and are listed here. | [applied-0828-census.md](history/staging/applied-0828-census.md) |\n| Z0 | `Q-applied-0828-quadpoint` Were the quadpoint red team's corrections applied to the four HELD notes? | ANSWERED | Applied: the nine REFUTED and WEAKENED verdicts that target the four notes are written into them in present tense, with ledger blocks added; the tenth targets the sealed prereg, outside the fence, and is recorded in attack-quadpoint-02.md instead; three corrections owed by TODO.md Z2 and one by Z0 are listed here and are NOT applied. | [applied-0828-quadpoint.md](history/staging/applied-0828-quadpoint.md) |\n| Z0 | `Q-redteam-0828-census` Do destroyer-census-01.md, stretch-01.md and records-placement-01.md survive an independent re-derivation of every load-bearing claim, and may they leave HELD? | ANSWERED | All three survive on arithmetic, every decisive number reproducing exactly on an independent engine; one sealed reading (records READ-3) is REFUTED as vacuous and four sentences need correcting before integration. | [redteam-0828-census.md](history/staging/redteam-0828-census.md) |\n| Z0 | `Q-redteam-0828-quadpoint` Do the four HELD quadpoint notes of 2026-08-22 survive an adversarial pass: the capture identity's proof line by line, the depth law and its asymptote, the sealed prereg scoring, and the prior-art citations at page level? | ANSWERED | The identity is PROVEN once its window convention is written down and holds at every K of 50 anchors under an independent implementation; four load-bearing sentences are wrong (section 4's gloss on Sum capU, v1 section 2's limit, the prior-art note's 2%, and the note's unconditional y* sentences), and none of the four defects opens or closes a route. | [redteam-0828-quadpoint.md](history/staging/redteam-0828-quadpoint.md) |\n| Z0 | `Q-review-request-0907` Which claims of the 2026-09-07 session should an independent math agent check, in what order, against which records, and what must the review return? | ANSWERED | Reviewed 2026-09-08 by an outside reader (history/reviews-0907/10): ranked claims 1 (conditional on the unread 1974 page), 2, 4, 5, 6 verified within stated scope; claim 3 verified with its quoted tolerances corrected (max deviation 1.8e-4, not 1e-4 or 1e-5); the Corollary 1 slip sharpened (fails for every representative other than 1, and mis-signs even then); ASSUMED items 4 and 6 discharged, 2 partially, 1, 3, 5 not. Twin-prime infinitude and every sufficient signed margin remain OPEN. Ranked below: the §6.2 demotion in the two-class manuscript (a change to a proof's dependency), the D_y identity reading (a change to what a census can show), the Erdős #687 attribution, and the two measurement artifacts. Twin-prime infinitude and every sufficient signed margin remain OPEN. | [review-request-0907.md](review-request-0907.md) |\n| A9 (retired) | `Q-a9-histogram-operator` What is the exact evolution of the gap-size histogram under folding, as a transfer operator on count(d), and what is the tail P(gap >= 2p)? | ANSWERED | The operator is derived and then verified by exact computation at every fold from T5 to T31 and the tail law is computed exactly, but the machinery is a rediscovery of Holt and Rudd arXiv:1408.6002 section 5 and may not be presented as new; only the G2 spacing beyond their \\|s\\| < 2p restriction is ours. | [a3-09-histogram-operator.md](a3-09-histogram-operator.md) |\n| G (retired) | `Q-block-L-first-dead` Is the block-1 counting bound on L the first-dead 62 or the last-alive 111, and does downward closure hold in the block coordinate? | ANSWERED | Downward closure HOLDS in the block coordinate: L <= 62 is sound and recomputed from scratch rather than inherited, L <= 111 is true, implied by 62 and weaker by 1.79x, and the adjudication's supposedly sharper instrument is attack 3's instrument. | [adjudicate-L-bound.md](history/staging/adjudicate-L-bound.md) |\n| 1c (retired) | `Q-c2prime-drift` Why does c2' drift on the 22-term ladder? | PARTIAL | Class-count-blind (attack-c2drift-01 §1); on item 1c's own band x >= 41 the ten-point rate is unresolvable: c2' 0.3745 +/- 0.1411 against c1's 0.3344 +/- 0.2358 on the same primes, a difference of 0.0401 = 0.12 of the control's ten-point window sd. Whether the drift is real is NOT closed here: attack-c2drift-01 measured it at p = 0.0053 on x >= 17 and left (i)' and (ii) alive. exponent-control §2/§4/§6 refit at 22 terms. | [attack-c2drift-01.md](history/staging/attack-c2drift-01.md), [c2prime-refit-22.md](history/staging/c2prime-refit-22.md) |\n| 11 (retired) | `Q-capK-bv` Is the prime-regime cap_K over the full wheel an unconditional asymptotic via the fundamental lemma over Bombieri-Vinogradov? | ANSWERED | PROVEN at short-note grade for q_K = W^{o(1)}, and EMPTY in every computable range (needs s >= 10.82, first cleared at x = 263; the lemma's floor s >= 10 is first reached at x = 239); the deep ladder is untouched. | [thm-capK-bv.md](history/staging/thm-capK-bv.md) |\n| 11b (retired) | `Q-consolidation-wave` Can the five cost-class scripts be bound to their own output, and can U-FRAME's two lost tables be rebuilt? | ANSWERED | All four runnable cost-class embeds are bound and the hand-pasted-tail counter falls 19 to 15 with the gate at TOTAL 0; three needed --force at a cost of 24 tokens out of 211 with no value changed anywhere, and natal-cap-33-overnight.js is a three-run composite that should never have been on the cost list. | [consolidation-wave.md](history/staging/consolidation-wave.md) |\n| 10 (retired) | `Q-excess-chain-c` Does the excess chain's constant c pin to 1.074 via a compressed-tail max correction? | CLOSED | NO: for any FIXED correlation length the derived family tends to 1 and both named corrections lower the maximum, so 1.074 is not derivable from a compressed-tail max correction; c measures 1.05 +/- 0.07 (sd) over x = 17..31, MEASURED, which does not separate 1.05 from 1.074. | [excess-chain-c.md](history/staging/excess-chain-c.md) |\n| 1b (retired) | `Q-greedy-oracle` Is the corrected greedy a G2 oracle? | ANSWERED | ORACLE ESTABLISHED, 13 of 13 exactly-known terms hit with minimum ratio 1.0000, so the greedy RULE is an exact solver where the answer is checkable at x <= 41; the rider matters more, the search budget needed grows 3.31x per additional prime and two objects whose truth reaches further show the same estimator's fidelity DECAYING, so nothing is established for the greedy AS RUN on the ladder. | [greedy-oracle-validation.md](history/staging/greedy-oracle-validation.md), [phase1-T1-greedy-oracle.md](history/staging/phase1-T1-greedy-oracle.md) |\n| 4 (retired) | `Q-import-fracparts` Does Saffari-Vaughan Theorem 10 cover the branches carrying the Skeleton door's mass? | ANSWERED | Prediction HIT: the covered branches carry at most 8 percent of the mass; anchor and a sharper wall-address banked; the THEOREM column is struck, not merely overpriced, because Theorem 10's range condition is x^{6/11+eps} < y, which fails at fixed M; no route; no cap-36 line is upgraded. | [import-fracparts.md](history/staging/import-fracparts.md) |\n| 0e (retired) | `Q-ioslack-survey` Does any instrument in the corpus carry a sharp-level signature that would let the infinitely-often slack be spent? | CLOSED | None does: 23 instruments surveyed and 19 eligible, smallest per-instrument p_FWE = 0.1082 and 0.8865 after Šidák, so dial 4's fourth channel closes and the dial is finished; the second finding is that maxsum_{L+1} is sharp exactly when L = 1. | [ioslack-survey.md](history/staging/ioslack-survey.md) |\n| Z5b (retired) | `Q-lambda-ledger` Does parity information survive in the lambda-weighted fold ledger? | CLOSED | REJECT, against a pre-registered threshold fixed before the producer existed: the lambda multiplier exists and is parity-free, so the ledger is blind at its design point rather than at its margins; two columns are pinned by proof, and nothing here is novel mathematics. | [attack-lambda-ledger.md](history/staging/attack-lambda-ledger.md) |\n| Z5b (retired) | `Q-ledger-forced` Which properties of the fold ledger's columns are FORCED rather than expected? | ANSWERED | Fourteen forced constraints, all identities or wrong-direction bounds; by_new is forced only in the prime gap (its O(1) is MEASURED); nothing forces net from below. | [fold-ledger-forced.md](history/staging/fold-ledger-forced.md) |\n| 11 (retired) | `Q-mod30-tail` Are the BV survey's S1 (mod-30 tail) and S2 (fixed truncation and depth) provable as stated? | ANSWERED | Both PROVEN at short-note grade (no second reader) once S2's freshness factor is corrected to one class per prime, which needs only P^-(m) >= q > q_i and so holds at every scour prime, not only in the prime regime; tail constant 2 ln 2 -> (ln 2)/2; nothing in the head. | [thm-mod30-tail.md](history/staging/thm-mod30-tail.md) |\n| 3 (retired) | `Q-monotonicity-sweep` Does anything in the corpus assume certificate validity is monotone in L? | ANSWERED | One unsound artifact and one invalid inference: attack-beta2-04-loss-budget.js section 6 bisects on a predicate measured not upward-closed and is wrong at 3 of 5 levels, true first-crossings 30/72/132/174/210 against the reported 36/72/144/174/354, and redteam-DP1-certificate.js draws a global minimality conclusion from a two-point local check; corrected, worst-casing certifies within 1.00 to 2.00 of true G2 and the exponent penalty runs 0 to 0.27 and falls with x. | [monotonicity-sweep.md](history/staging/monotonicity-sweep.md) |\n| Z6 (retired) | `Q-records-placement` Do the seven unswept twin-gap records 76-82, above 2^53, land uniformly inside their stretches, or is there square-anchor coupling in record-start placement? | ANSWERED | Sealed alone before the producer existed: the uniform band, the fixed definitions, the registered readings, the calibration abort gate and the riders are all fixed here and no placement fraction, q or stretch boundary was evaluated; scored in records-placement-01.md. | [records-placement-01.md](history/staging/records-placement-01.md), [records-placement-02.md](history/staging/records-placement-02.md), [records-placement-prereg.md](history/staging/records-placement-prereg.md) |\n| 5 (retired) | `Q-shadow-amplitude` Where does the kill shadow's drift amplitude come from, and does the record's counting floor explain it? | MIXED (shadow-amplitude-prereg.md: OPEN; shadow-amplitude.md: PARTIAL) | The finite-y correction is an identity with no free parameter and both measurement routes agree 10 of 10, but the record's own counting floor is four to six times too small and its candidate explanation is the wrong half, so the label stays PARTIALLY EXPLAINED. | [shadow-amplitude-prereg.md](history/staging/shadow-amplitude-prereg.md), [shadow-amplitude.md](history/staging/shadow-amplitude.md) |\n| 5 (retired) | `Q-shadow-prereg` Is the kill shadow's 0.85 the band-average of the Unification-Law survival curve over the post-crystallization window? | ANSWERED | Scored in shadow-buchstab.md: SHAPE-ONLY under the original y >= 997 rule; D3 passes in the reported ten clusters but D1 fails near y = 1000 at 1.49 times the 0.011 tolerance. Later finite-y normalisation and counting-floor corrections do not promote this verdict. The pair-Buchstab identification remains conjectural; the pre-registration body is preserved. | [shadow-prereg.md](history/staging/shadow-prereg.md) |\n| 0d (retired) | `Q-single-alignment` Does the head's single-alignment fold recursion for M(x, x^3) give a proven-shaped handle on the per-fold multiplier that the max-over-alignments recursion lacked? | CLOSED | The answer splits: the multiplier IS different in shape, measured - exactly 1 at 225 of 240 folds from x = 53, total spend 1.09 nats against a tile-shaped ladder's 7.12, measured M(1613) = 2220 against a tile-shaped 3.7e5 - but the route to a growth law through the recursion closes anyway, because the growth is initiated by the window's expansion into fresh ground, a boundary term that is the localized gap problem re-posed and that no fold reaches. | [localized-single-alignment.md](localized-single-alignment.md) |\n| 4 (retired) | `Q-skeleton-decide-0830` Should TODO item 4, \"Skeleton Equidistribution: restate or demote\", be restated around the modulus-W mass or demoted off the board, and what exactly is banked either way? | ANSWERED | DEMOTE. Over every scour prime the branches on which the door is a fixed-modulus question carry 9.2, -0.9, 0.2 and 0.5 percent of the skeleton at @13, @17, @19, @23 (the -10.8 and 5.5 percent on record were 9 and 2 percent subsamples), so the door as named removes at most 0.0102 from a G30_agg whose open part is 0.094 to 0.126; on the open side the phase never wraps and no equidistribution statement remains, only the inequality; nothing on the live board consumes G30_agg < 1/2; no first move exists that is not already ANSWERED. Banked regardless: the Skeleton Collapse Theorem (PROVEN, all x, all q) and G30_agg < 1/2 CERTIFIED at six levels @11..@29. | [decide-0830-skeleton-door.md](history/staging/decide-0830-skeleton-door.md) |\n| 4 (retired) | `Q-skeleton-door` Is the Skeleton Equidistribution Conjecture the blocker on the anchored calm? | ANSWERED | It is not the blocker as far as the door can be seen: Theorem A (Trapezoid Cancellation) is proven for all x, q and branches, @29 is certified as an exact integer inequality at G30_agg = 0.1176 with margin 0.3824 over 7,863 scour primes, and the decay-law shortcut is REFUTED, the six levels being flat within their own spread with every fit made strictly worse by adding @29. | [natal-cap-36-skeleton-door.md](natal-cap-36-skeleton-door.md) |\n| Z3 (retired) | `Q-stretch-structure` What is the stretch S_q = [q^2, q'^2) as an object, where does the Stretch Postulate sit against the Zone Postulate, and does the square anchor's QR structure buy any density advantage? | ANSWERED | The implication chain and the QR kill law re-derive independently arrow by arrow; the anchor's structure is real, deterministic and redistribution-only (exactly two killed offset classes at every prime anchor checked), so there is structure and no advantage, and SP sits strictly above the strong Zone Postulate. | [stretch-01.md](history/staging/stretch-01.md) |\n| 0e (retired) | `Q-verify-monotone-depth` Does the Monotone Depth obstruction, which retires dial 4, survive an adversarial re-derivation? | ANSWERED | NARROWED: every measurement in the record reproduces, several to the last digit, but the mechanism as named is false as a general law and the corpus already holds a counterexample to it; what survives is an accounting of three channels priced in tenths of a nat against a need of 6.700, 8.191 and 9.637 nats, so dial 4 becomes priced slack with one channel open and unpriced. | [verify-monotone-depth.md](history/staging/verify-monotone-depth.md) |\n| 1e (retired) | `Q-wrongdirection-audit` Are any of the ten live targets secretly TPC-strength, before the sessions are spent on them? | ANSWERED | The audit closes no target: two of the ten come out TPC-strength and three more carry a TPC-strength face under a quantifier they are likely to drift into, which is a labelling result and not a reason to drop them; item 1e is settled only because the answer was already on disk, and one route-blocking number in it is hand arithmetic and unstamped. | [attack-wrongdirection-audit.md](history/staging/attack-wrongdirection-audit.md) |\n| Z3 (retired) | `Q-z3-immune` Do the square anchor's immune offset classes (stretch-01 §4) carry a survivor surplus beyond the redistribution-only guardrail, do they attract the floor's first survivor, and does restricting the transplanted caps to them lower K*? | CLOSED | No, on all three. The preregistered surplus test is VOID on its own matched control (a 0.6% ratio-of-means bias present with and without the quadratic point); the preregistered placement test HOLDS at Z = +0.49; the design-free class test reads the guardrail's r/(r-2) over 3.4 million twin openers with a largest per-prime deviation of 0.11% and per-prime Z in -0.48..+1.66; and the restricted certificate, while lowering K* at 61% of anchors, has no certificate at all at 93 of 1219 and is beaten head to head by the QR-BLIND restriction that certifies 1219 of 1219. The refinement is closed. | [attack-z3-immune-01.md](history/staging/attack-z3-immune-01.md) |\n| Z (retired) | `Q-zonegap-reduction` What must be proven for Z2, what already is, and what does the proven head machinery give the zone? | PARTIAL | The Zone Restriction Lemma is proven and verified at five levels - the in-zone twin slots of T_p ARE the in-zone twin primes, so Z2(p) IS the whole-tile gap object restricted to the head window - the three-slack chain is graded honestly, the transfer inventory is listed item by item, and the deep end is proven an onset desert over 24 levels; section 5 lists what was not reached. | [zonegap-02-reduction.md](history/staging/zonegap-02-reduction.md) |\n\n## 2. Every question, by id\n\n| id | status | question | verdict | TODO | records |\n|---|---|---|---|---|---|\n| `Q-0c-holesweep` | ANSWERED | At a fold, how does maxsum degrade copy by copy as the two deleted residues sweep through their possible positions? | The full curve is on disk for nine folds (5->7 through 31->37, every copy) and it is a PALINDROME: the Mirror-Sweep Lemma is proven here and verified exhaustively, giving the fingerprint any kill-count-free bound must reproduce, but no such bound was produced by this pass. | 0c | [attack-0c-holesweep.md](history/staging/attack-0c-holesweep.md) |\n| `Q-0c0e-level-selection` | CLOSED | Can a residue-deleted maxsum bound that only has to hold at levels of the argument's choosing carry the weak Zone Postulate? | CLOSED, and the mechanism has a name: the level-selection licence is worth 0.3187 nats once and is falling, no selection rule beats its own null by anything worth having across T_11..T_29, and the BV/EH sweep supplies no moduli-selecting statement to spend. | 0c, 0e (retired) | [attack-0c0e-level-selection.md](history/staging/attack-0c0e-level-selection.md) |\n| `Q-DP1-mechanism` | ANSWERED | Does anything consume two-point data about a sifted set? | One consumer exists and is priced: the sharp degree-2 Boole-Frechet bound on empty windows is unconditional and concludes at every window position, but it over-certifies G2 with a log-log slope of +5.20 against x over x = 5..19, so the price of stopping at two-point data grows as a power of x rather than as a constant. | none | [attack-DP1-mechanism.md](history/staging/attack-DP1-mechanism.md) |\n| `Q-L-own-law` | ANSWERED | Does L, the adjacent-kill run length, have a law of its own level by level, and which abscissa is it linear in? | L has no law of its own: (L+1)*mbar(T_v) is approximately G2(y#) at every tile and top prime where both sides are exact, spread 1.0000 to 1.0838 over four tiles at y >= 23 with mean 1.0198, so the residue is quantisation, the abscissa question returns a calibrated negative, and the distance to 529 is priced rather than closed. | none | [attack-L-law.md](history/staging/attack-L-law.md) |\n| `Q-L-subadditivity` | ANSWERED | Is L sub-additive when two prime sets merge, as the intuition that L should be smaller for the combined set suggests? | Read literally the intuition is wrong by a one-line proof rather than an edge case: L is super-additive, exhaustively censused to nine primes; read as a statement about reusing primes it is right, and that reading is worth more than the refutation. | none | [attack-L-subadditivity.md](history/staging/attack-L-subadditivity.md) |\n| `Q-T2a-prediction` | PARTIAL | What are G2(43#) and G2(47#), predicted blind from the thirteen exact terms? | Registered blind: G2(43#) central 630, window 561 to 747, and G2(47#) central 720, window 653 to 868, with the method's calibration PASSING on the eight-term prefix; the 43# term has since been enumerated at 618, inside the window and below the central value, and 47# remains unmeasured, with the report's own largest risk being that c2' may be about to turn down. | none | [phase1-T2a-prediction.md](history/staging/phase1-T2a-prediction.md) |\n| `Q-W1a-applied` | ANSWERED | Were the unapplied findings for partition A, the paper suite and citation-heavy files, applied? | Thirty-three findings, 24 applied, 3 refused at a primary source (two of which would have written a falsehood into the corpus) and 6 handed back; the most consequential item was not on the list, since covering-dive's stated reason for dismissing Kalmynin-Konyagin was false by the corpus's own proof and the corrected reason had to be found rather than copied. | none | [phase1-W1a-applied.md](history/staging/phase1-W1a-applied.md) |\n| `Q-W3-literature` | ANSWERED | What do the four literature targets give: the Omega(kappa, L) quantifier, the Kalmynin-Konyagin transfer, Erdos-Ruzsa 1980, and the two-class upper bound? | The quantifier is over all pairs, confirmed verbatim in two independent sources, and every page and section citation in beta2-note checks out; the higher-consequence find is that covering-dive's stated reason for dismissing Kalmynin-Konyagin is false, since the proof only sees the size of Omega_p, and the two-class upper bound survives a second independent attempt as ABSENT. | none | [phase1-W3-literature.md](history/staging/phase1-W3-literature.md) |\n| `Q-X-upper-0829n` | PARTIAL | Can the rough-pair census X(K) on the stretch window be bounded above, unconditionally and with an explicit error term, by a dimension-2 upper-bound sieve, and how loose is the bound against exact X(K)? | Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated. | Z2 | [attack-0829n-X-upper.md](history/staging/attack-0829n-X-upper.md) |\n| `Q-a144311-vocabulary` | ANSWERED | In the vocabulary the literature actually uses, is there a published upper bound for G2, and is beta2 still the best known kappa = 2 sifting limit? | The terms of art are the paired Jacobsthal function and Jacobsthal-type functions for polynomials, and in that vocabulary no published upper bound exists at any exponent, beta2 is unimproved since 2008, nothing is found on A144311's asymptotic growth, and an Erdős-Rankin lower bound is free; both load-bearing corpus claims survive. | none | [audit-a144311-vocabulary.md](history/staging/audit-a144311-vocabulary.md) |\n| `Q-a3-05-bound-L` | PARTIAL | Can L be bounded unconditionally from run consistency, and where does that stop? | Theorem B gives the first unconditional bound, L <= 1 + m*, sitting 0 to 3 above the truth at all eight measured folds, but it is of order G2(old)/p, which is linear in x on the fold diagonal; section 8 locates the wall at one large-deviation hypothesis H″ the residue side cannot reach, and Theorem C inherits it for kappa(m). | none | [a3-05-bound-L.md](a3-05-bound-L.md) |\n| `Q-a9-histogram-operator` | ANSWERED | What is the exact evolution of the gap-size histogram under folding, as a transfer operator on count(d), and what is the tail P(gap >= 2p)? | The operator is derived and then verified by exact computation at every fold from T5 to T31 and the tail law is computed exactly, but the machinery is a rediscovery of Holt and Rudd arXiv:1408.6002 section 5 and may not be presented as new; only the G2 spacing beyond their \\|s\\| < 2p restriction is ours. | A9 (retired) | [a3-09-histogram-operator.md](a3-09-histogram-operator.md) |\n| `Q-ab-coupling` | MIXED (attack-ab-coupling.md: PARTIAL; verify-ab-coupling.md: ANSWERED) | How much of the counting criterion's known slack does the rigidity of the two kill channels A = 0 mod p and B = -2 mod p close? | The pilot survives, every held number reproducing on an independent code path, and the one correction is in its favour: the depth-3 ceiling is 38 slots, not 39; the LP answers NO, its exact depth-2 optimum over the full polytope being 54 slots, identical to the pilot's, so it prices the idea and does not clear 51. | none | [attack-ab-coupling.md](history/staging/attack-ab-coupling.md), [verify-ab-coupling.md](history/staging/verify-ab-coupling.md) |\n| `Q-adversary-wave2` | ANSWERED | Do the four same-evening headlines (kill shadow, scanstat, sofic, Shearer) survive a refute-first adversarial pass? | Nothing BROKEN: sofic SURVIVES and the other three SURVIVE WITH CORRECTIONS, the corrections being one verdict label a grade too high by the record's own prereg rule, three false custody sentences and an oversold prediction, a misdescribed extremal witness, and an atomicity hypothesis that is load-bearing and not shown. | none | [adversary-wave2.md](history/staging/adversary-wave2.md) |\n| `Q-advmin-1113` | CLOSED | Can joint caps quantified over classes recover the staircase-to-truth gap at @11 and @13? | CLOSED at @11: the adversarial minimum for the whole family is 16, below the class-blind ceiling and 18 under the staircase floor of 34, which also refutes the task's own framing that it would sit between floor and truth; at @13 the same family is priced at advmin <= 152. | none | [attack-advmin-1113.md](history/staging/attack-advmin-1113.md) |\n| `Q-agent-start` | ANSWERED | What must an incoming agent read and preserve before continuing the reviewed arithmetic campaign? | Onboarding and document ownership only. The second dispatch is completed and independently reviewed on 2026-09-09. RESEARCH-EXECUTION.md owns current dispositions and candidate next obligations; RESEARCH-HANDOFF.md owns the updated exact contract. No assignment is started by that review. Twin-prime infinitude and required signed estimates remain OPEN. | C | [AGENT-START.md](AGENT-START.md) |\n| `Q-anchored-calm` | PARTIAL | What is proven about the anchored calm, and what is not? | The calm names a phenomenon and never a claim: the Mirror-Sibling, Fusion, Mirror-Phase Doubling and Minus-Half results are PROVEN at all x and all scour q, the phenomenon itself is MEASURED (the anchored rotation at rank 2 of 510,510 at @17), and two things stay unproven, of which the Skeleton Equidistribution Conjecture is one. | none | [anchored-calm.md](anchored-calm.md) |\n| `Q-anchored-ladder` | ANSWERED | Does the unified anchored ladder generalize past @11 and @13, and what does cheap K buy at each level? | It generalizes verbatim to @17 and @19, and the K = 0 unified floor is DEAD there (vacuous at -1262 and -55865); what survives and grows is the family lead at the classic certification depth K*, margin +2, +5, +26, +110 across @11 to @19. | A | [attack-anchored-02.md](history/staging/attack-anchored-02.md) |\n| `Q-anchored-ladder-17-0830` | ANSWERED | At @17 and above, at which depth K does the composed (unified) anchored floor first turn positive and at which K does it reach the truth, and does the depth-cost curve K_first_positive(level), K_truth(level) move with level? | At @17/@19 the answer was already on record (Q-anchored-ladder: positive at K = 2/10, truth at ascending K = 109/410, minimal pool 88/350) and is re-derived here as the custody gate; the new level @23 ran under a sealed 14-of-14 forecast: positive first at K = 27 = K* (PROVEN from the record before the run), truth at ascending K = 1732 of 1739, minimal pool 1543 = 0.887 of the scour (PROVEN lower bound meets VERIFIED upper bound); across five levels positivity costs exactly K* while the truth fraction rises 0.40, 0.62, 0.73, 0.81, 0.89, a MEASURED finite table with no law in x and no exponent touched. | A | [attack-0830-anchored-ladder-17.md](history/staging/attack-0830-anchored-ladder-17.md) |\n| `Q-anchored-unify` | ANSWERED | Can the three anchored mechanics be unified at @11, and what floor family does the unified cap certify? | MEASURED and PROVEN-here but HELD: extending the staircase's cofactor injection to m = 1 folds the self-strike allowance into the count, the unified-cap lemma gives fresh <= capU_K <= cap_K at every depth and prime at @11 and @13, and the floor family runs 36 to 45; the x = 37 secondary is a clean negative. | A | [attack-anchored-01.md](history/staging/attack-anchored-01.md) |\n| `Q-anchored-vs-global-gap` | CLOSED | Is the anchored gap A(v) = F(v) - v easier to bound than the global gap G2(v#)? | The separation is real and correctly measured but worth exactly one unit of exponent against a deficit of 2.2665, and the anchored quantity's only proven bound is beta_2 = 4.26645, the IDENTICAL theorem rather than a consequence, because the DHR sieve is position-uniform; so the anchored object sits further from its bound, and Proposition D is a closure at today's exponent only. | none | [attack-block-09-anchored.md](history/staging/attack-block-09-anchored.md) |\n| `Q-anchored-windows` | SUPERSEDED | How much does anchoring at the origin enrich a window against a random window, and for how long? | SPENT, live treatment is paper/anchored-note.md: Theorems A-C proven (A and B unconditional, C's constants HL-conditional), anchored enrichment bounded by e^{2gamma} = 3.172 and mortal, the head-window dip constant e^{2gamma}/4 = 0.79305 with 0.89 a finite-size blend; the kill shadow is no longer a separate object and section 3's peak sequence remains unreproduced. | none | [anchored-windows.md](anchored-windows.md) |\n| `Q-applied-0828-backfill-1` | ANSWERED | Which legacy notes in chunk 1 received ledger blocks? | All 86 notes in the chunk received a block and none was skipped; 85 distinct question ids were minted, no id was reused from QUESTIONS.md section 2, and two notes were chained onto one shared id. | none | [applied-0828-backfill-1.md](history/staging/applied-0828-backfill-1.md) |\n| `Q-applied-0828-backfill-2` | ANSWERED | Which legacy notes in chunk 2 received ledger blocks? | 85 of the 86 notes in chunk 2 carry a block; only GLOSSARY.md was left unindexed, as a vocabulary registry that poses no question, and one id (Q-records-placement) was reused from QUESTIONS.md section 2 with its question text copied exactly. | none | [applied-0828-backfill-2.md](history/staging/applied-0828-backfill-2.md) |\n| `Q-applied-0828-backfill-3` | ANSWERED | Which legacy notes in chunk 3 received ledger blocks? | All 86 notes in the chunk carry a block; none was skipped, one id (Q-quadpoint-transplant) is reused from QUESTIONS.md section 2 with its question text copied exactly, one id (Q-f-census) is shared by the two notes of the f-from-census chain, and seven blocks name a TODO item whose Ledger line does not yet list them. | none | [applied-0828-backfill-3.md](history/staging/applied-0828-backfill-3.md) |\n| `Q-applied-0828-backfill-4` | ANSWERED | Which legacy notes in chunk 4 received ledger blocks? | All 85 notes of chunk 4 carry a ledger block, none reuses an id already in QUESTIONS.md section 2, and none was left unclassified. | none | [applied-0828-backfill-4.md](history/staging/applied-0828-backfill-4.md) |\n| `Q-applied-0828-census` | ANSWERED | Were the census red team's corrections applied to the three HELD notes? | Every WEAKENED and REFUTED verdict in redteam-0828-census.md is applied to its target note in the present tense; two producer defects and four live-doc corrections stay open and are listed here. | Z0, Z4, Z6 (retired) | [applied-0828-census.md](history/staging/applied-0828-census.md) |\n| `Q-applied-0828-closures` | ANSWERED | Were the closures red team's corrections applied to the five HELD notes? | Applied. 47 prose corrections across the five notes; c2prime-refit-22 drops from CLOSED to PARTIAL and three ledger verdicts are rewritten; four producer READINGS blocks and eleven live-document lines carry the same defects and are listed here uncorrected, behind the fence. | 10 (retired), 1c (retired), 1d, Z5b (retired), 0 | [applied-0828-closures.md](history/staging/applied-0828-closures.md) |\n| `Q-applied-0828-engine` | ANSWERED | Were the engine red team's corrections applied to the five HELD notes? | Applied, 37 edits across the five notes: two numbers corrected (first s >= 10.82 at x = 263 not 239, first non-empty kappa=1 level @37 not @53), two ledger verdict lines and one note title rewritten, one proof step given BV's max-over-y form, the one-class freshness factor restated on P^-(m) >= q so it holds at every scour prime, and two mislabelled columns renamed; six corrections that land on live documents are collected here unapplied, and no producer was touched. | 11 (retired), 8 | [applied-0828-engine.md](history/staging/applied-0828-engine.md) |\n| `Q-applied-0828-glossary` | ANSWERED | Was the hyperuniformity conflation corrected? | In the vocabulary yes: GLOSSARY's single entry is split into Sub-Poisson window counts (Var/E), which keeps every measured value, and Hyperuniformity, which now carries Torquato's definition, the class I/II/III taxonomy, the tile's vacuous class I by periodicity and the sub-Poisson-not-hyperuniform reading at L = y^u; in the corpus no, one staging note is corrected here and ten further loose uses in nine .md files plus eighteen in seven scripts sit outside the fence with their replacement sentences listed below. | none | [applied-0828-glossary.md](history/staging/applied-0828-glossary.md) |\n| `Q-applied-0828-head` | ANSWERED | Were the head red team's corrections applied to the three HELD notes? | Applied. Every WEAKENED and REFUTED row of redteam-0828-head.md lands in the note it targets as 42 prose edits, and all three ledger verdict lines now carry the surviving chain; four corrections fall outside the fence and are owed elsewhere, the load-bearing one being destroyer-census-01 §6(b)'s R and its h/R = 1.09 -> 1.03. | Z4 | [applied-0828-head.md](history/staging/applied-0828-head.md) |\n| `Q-applied-0828-litimports` | ANSWERED | Were the lit/imports red team's corrections applied to the six HELD notes? | Applied, 64 substantive edits across the six notes: the Saffari-Vaughan range exponent is 6/11 in both import notes, the fixed-M THEOREM in import-fracparts is struck and the cap-36 MEASURED to PROVEN upgrade withdrawn, row 15 loses its theorem column and row 16 is regraded stale, and the six weakened sentences in the four literature notes now read as the audit requires; four claims are declined with reasons, and nine live documents plus two fenced staging notes are recorded here as owing corrections that this pass did not apply. | Z5, 4 (retired) | [applied-0828-litimports.md](history/staging/applied-0828-litimports.md) |\n| `Q-applied-0828-live` | ANSWERED | Which engine and head red-team corrections reached the live layer? | Nineteen edits across four documents: the glossary's cap_K dimension count with its mandatory sifted-versus-assumed clause plus three new entries (twin opener, head, tail); the survey's one-class density factor, S1's restored pi(q-1) terms and r in N_x hypothesis, the dropped Chen absorption, Theorem C with its emptiness, dimension 1 for q_i < q, the comb-conditioning qualifier and the inverted shallow-band bullet; the certificate engine's equidistribution status cell, the q = T^{o(1)} second hypothesis and the Comb Discrepancy scope cell; and the census's R as the continuum functional with its three comparators; paper/staircase-note.md, TODO.md and QUESTIONS.md are owed and untouched. | 11 (retired), 8, Z4 | [applied-0828-live.md](history/staging/applied-0828-live.md) |\n| `Q-applied-0828-quadpoint` | ANSWERED | Were the quadpoint red team's corrections applied to the four HELD notes? | Applied: the nine REFUTED and WEAKENED verdicts that target the four notes are written into them in present tense, with ledger blocks added; the tenth targets the sealed prereg, outside the fence, and is recorded in attack-quadpoint-02.md instead; three corrections owed by TODO.md Z2 and one by Z0 are listed here and are NOT applied. | Z0, Z2 | [applied-0828-quadpoint.md](history/staging/applied-0828-quadpoint.md) |\n| `Q-applied-0828-queue0827` | ANSWERED | Were the 2026-08-27 drafted corrections applied? | Eighteen edit entries applied across six files, the Wu band-label inference and the saturation claim being the load-bearing ones; six proposals declined, two on ownership, one because the brief forbids promoting its note, one as already carried in paraphrase, one on an unverified inferred theta-law, and one because two scratchpad notes disagree on the number. | none | [applied-0828-queue0827.md](history/staging/applied-0828-queue0827.md) |\n| `Q-applied-0828-registries` | ANSWERED | Which lit/imports corrections reached the registries? | 13 edits across six files, plus one appended changelog section: IMPORT-MAP gains rows 15 (no THEOREM, the column struck), 16 (STALE) and 17 (CLOSURE, two-sided) with its three counts recounted to seventeen rows; SEARCH-CONVENTIONS gains the Kourbatov-b, generalized-Dickman and VC-of-multiples rows with each channel's calibration state; import-map-construction's determinantal cell, natal-cap-36's separate-census sentence, one REFUTED row and one PRIOR-ART block are corrected; GLOSSARY, TODO, QUESTIONS, the five loose hyperuniformity documents and two staging notes are left for their holders and listed here. | Z5, 4 (retired) | [applied-0828-registries.md](history/staging/applied-0828-registries.md) |\n| `Q-applied-0828-registries2` | ANSWERED | Which queued registry corrections were applied? | 15 edits across four files: SEARCH-CONVENTIONS gains four §1 rows (the census as a pretentious correlation with the Chowla warning, Boolean analysis on the CRT product, covering a cyclic group by translates, the fractional parts of N/n) and five §3 rows, plus one pipe fix that was hiding a clearing phrase from the gate; import-rough-anatomy's λ₁ → λ₂ comparand is corrected in four places, 12–23× becoming 2.11 to 2.86×; lit-dickman-variance §6.3's \"row 15\" is disambiguated to the drafted row it means; IMPORT-MAP's circularity and payoff tallies are recounted and now sum to seventeen; REFUTED.md needed no edit and got none. | none | [applied-0828-registries2.md](history/staging/applied-0828-registries2.md) |\n| `Q-applied-0828-todo-prune` | ANSWERED | Which TODO items left the file under its charter after 2026-08-28? | Five left (11, 10, 1c, 1e, Z5b), nine were restated on what remains (Z2, Z4, Z5, Z6, Z7, Z0, A, 0, 1d, 4, 8), the rest stand; every retained Ledger line is verbatim, no claim's rung moved, and eleven notes now need `(retired)` on their todo lines before the gate is green. | none | [applied-0828-todo-prune.md](history/staging/applied-0828-todo-prune.md) |\n| `Q-applied-0828-varE` | ANSWERED | Were the Var/E red team's corrections applied to the four HELD notes? | Every WEAKENED and REFUTED verdict in redteam-0828-varE.md is applied to its target note in the present tense; four ledger verdicts are rewritten, the theta=1 row is raised to PROVEN, and seven live-doc sentences plus one producer reading stay open and are drafted here. | 9 | [applied-0828-varE.md](history/staging/applied-0828-varE.md) |\n| `Q-applied-0829-ledger` | ANSWERED | Were today's notes linked into the question ledger's TODO guard, the Z2 draft's last two non-fit lines fixed, and the covering-prune root corrected? | All three landed and none of them moves a result: nine of thirty notes read now name the TODO item their move executes and four TODO items carry the new ids, so `node research/qc.js` reports the ledger check clean at 0 findings; the Z2 draft's legal items 3 and 4 carry the audit's instrument rider and the quantifier-police clause the red team asked for; and the covering-prune producer now computes the root of a*ln(a/e) = 1 instead of quoting it, giving a = 3.5911214767 and a divergence constant of 7.1822 lnln x against the 7.19 the file carried, a 0.08 per cent change with nothing downstream consuming it. | none | [applied-0829-ledger.md](history/staging/applied-0829-ledger.md) |\n| `Q-applied-0829-measure-a` | ANSWERED | Were red team A's corrections applied to the notes it reviewed? | Of the nine APPLY items in redteam-0829-measure-a.md §3a-3c, seven were applied here as exact string edits, two (E1 and E5) were verified as already applied by the producing agent with a producer fix and a forced re-embed, one clause of E1's proposed wording is left unapplied and is recorded as owed, and the four live-document items of §3d plus the QUESTIONS.md regeneration are left for the orchestrator; node research/qc.js returns TOTAL 0 across all thirteen checks after the edits. | none | [applied-0829-measure-a.md](history/staging/applied-0829-measure-a.md) |\n| `Q-applied-0829-measure-b` | ANSWERED | Were red team B's corrections applied to the notes it reviewed? | 17 of 17 APPLY items whose target is a staging note are applied in place, 2 ledger verdict lines rewritten as the red team specified (measure-record-null2-0829 and zone-tail-02-0829), 3 HOLD/DECLINE items deliberately not applied, 5 live-document items left verbatim for the orchestrator, and 3 producer items recorded as OWED without touching any .js; the fast gate returns 0 findings after the pass, the single mid-pass finding having belonged to another agent's file, research/measure-g2z2-0829.js:432, and never to any edit made here. | none | [applied-0829-measure-b.md](history/staging/applied-0829-measure-b.md) |\n| `Q-applied-0829-measure-c` | ANSWERED | Were red team C's corrections applied to the notes it reviewed? | 22 of the 25 items in section 3 target the four HELD staging notes and all 22 are applied (21 as the exact old-text to new-text strings the red team wrote, 1 as a minimal carry because filling its column for all nineteen rows would be a fresh grading judgement rather than a citation), plus 1 directed edit to lit-scourfield-2008.md section 0 that red team section 1g names and section 3 gives no string for; 3 items are flagged HOLD and are left verbatim for the orchestrator (varE-theta2-proof.md, lit-smooth-divisors.md, SEARCH-CONVENTIONS.md); 1 producer item is OWED and untouched, since the producer's readings 13 and 14 still carry the M-P1 failure that E8 and E9 reverse in the note and correcting them needs a re-embed; node research/qc.js returned TOTAL 1 on the run straight after the edits, the one finding being research/measure-g2z2-0829.js:432 in another agent's file, and TOTAL 0 on the run after this note was written, with refs, quotes and ledger clean on both. | none | [applied-0829-measure-c.md](history/staging/applied-0829-measure-c.md) |\n| `Q-applied-0829-refuted` | ANSWERED | Were the four refuted-claims audits' APPLY row rewrites applied to REFUTED.md? | 25 of the 27 APPLY items are in the file, 1 more merged into a sibling's text at the shared boundary row, 1 deferred to the in-progress red team, 7 HOLD items untouched and listed here for Chris, 4 items owed outside REFUTED.md; the table still holds exactly 67 data rows and qc.js reports refs 0 and crosslinks 0. | none | [applied-0829-refuted.md](history/staging/applied-0829-refuted.md) |\n| `Q-applied-0829-registries` | ANSWERED | Were the registry debts of 2026-08-29 (IMPORT-MAP rows, the PRIOR-ART spectrum line, the escape labels, the REFUTED HOLD proposals) landed? | All four debts are discharged as far as a non-adjudicating pass may take them: IMPORT-MAP carries rows 20 and 21 at CLOSURE-plus-anchor and anchor-plus-wall-address with nothing opened, PRIOR-ART's Holt-Rudd attribution now names the printed spectrum and the SCRATCHPAD-GRADE 2.82/ln p mixing rate with priority stated as Holt and Rudd's, recon-0829-escapes.md section 6 carries all sixteen owed (i)/(ii)/(iii) labels of which nine are fresh judgements and three come out (ii), and three of the seven REFUTED HOLD proposals were applied as wording and calibration while four are left verbatim for Chris because they touch a producer, a canonical file, a cross-file number or the index's format; the table stands at 67 rows and qc.js is 0 on refs, crosslinks, calibration and search-convention. | none | [applied-0829-registries.md](history/staging/applied-0829-registries.md) |\n| `Q-applied-C` | ANSWERED | Which wave-2 consistency findings were applied to the paper suite? | Applied across the seven paper/ files with post-edit line numbers, plus a CHRIS-DECIDES list, handoffs to other partitions and one unresolved item: two scopes for the Cov_adj anticorrelation exception count, both now printed, one of which should be checked and the other dropped. | none | [applied-C.md](history/staging/applied-C.md) |\n| `Q-applied-G` | ANSWERED | Which wave-3 partition G findings were applied, and what did the pass find on its own? | Applied to the eleven owned files: the OEIS off-by-one confirmed and provable four ways, a factor of two found in the seam draft's Hardy-Littlewood heuristic, the L gap corrected in three files from a flat 0.58 ln p to the home's 0.58 to 0.95 ln p range, seven orphans swept, and one supplied answer refused as wrong before it reached a header banner. | none | [applied-G.md](history/staging/applied-G.md) |\n| `Q-applied-Q` | ANSWERED | Do the two OEIS drafts survive an instrument that recomputes them rather than reads them? | Two defects found in the G2 draft (the Maier-Pomerance conjecture cited in the wrong direction, and a no-upper-bound-published claim the repository itself contradicts) plus a third error class routed from partition P; every DATA term was recomputed and audit-numbers went from 37/39 to 76/78 checks. | none | [applied-Q.md](history/staging/applied-Q.md) |\n| `Q-applied-wave2-A` | ANSWERED | Which wave-2 partition A corrections were applied, and to which files? | Five jobs applied across G2-STATE.md, LOCALIZED-GAP.md, maier-matrix.md and origin-excess.md, with partition A's own qc columns at 0 on every check afterwards; handoffs to other partitions and one decision needing Chris are listed rather than guessed. | none | [applied-A.md](history/staging/applied-A.md) |\n| `Q-applied-wave2-B` | ANSWERED | Which wave-2 partition B corrections were applied to U-FRAME.md, ATTACKS3.md and gate-multiplies.md? | Applied with the U-FRAME section map preserved (128 inbound pointers, 47 on 5a, nothing renumbered), the strategic contradiction resolved, statistics corrected, one dead quotation removed and two further corrections to the record found on the way; section 12 lists what stayed unresolved. | none | [applied-B.md](history/staging/applied-B.md) |\n| `Q-applied-wave2-D` | ANSWERED | Were wave-2 partition D's findings applied to the eight entry-path documents? | Applied across all eight files with qc total 22 to 21 and one refs finding of its own (a framework bug), two transfers pairs word-diffed; the em-dash scope question and one GLOSSARY entry are flagged as judgement calls rather than omissions, and other partitions were live in the same tree so the deltas are not all this partition's. | none | [applied-D.md](history/staging/applied-D.md) |\n| `Q-applied-wave2-E` | ANSWERED | Which wave-2 partition E corrections were applied, and to which files? | Seven jobs applied across covering-dive, two-class-lower-bounds, PRIOR-ART, sift-limit-attack, theta-ladder, maxgap-law and dhr-verification, with refs and quotes at 0 in this partition before and after; one novelty verdict in a publication-track file is weakened by de Polignac 1849 and flagged for Chris. | none | [applied-E.md](history/staging/applied-E.md) |\n| `Q-applied-wave2-F` | ANSWERED | Which wave-2 partition F corrections were applied to the natal-cap family and its compound claims? | Applied across nine natal-cap files with two new homes created (anchored-calm.md and certificate-engine.md); the Fused-Window Calm Lemma was decomposed and its name retired, the X-limitation theorem's scope is confirmed a scope error, and the refutation is recorded as bigger than it had been reported. | none | [applied-F.md](history/staging/applied-F.md) |\n| `Q-applied-wave3-H` | ANSWERED | Were wave-3 partition H's U-FRAME sections 10-12 split into child documents? | Split and applied: U-FRAME falls 1,032 to 772 lines with three children created, but the corpus as a whole is 87 lines larger and that must not be reported as a shrink; refs and crosslinks stay at zero and no transfers finding exists between any stub and its child. | none | [applied-H.md](history/staging/applied-H.md) |\n| `Q-applied-wave3-I` | ANSWERED | Was the flagship paper split as wave 3 partition I directed, and what did the split expose? | Split into paper/moire-primes.md and the new paper/wall-note.md, with every deliberate change to moved text word-diffed; three open defects sit inside the split, two of them already landed and one not, and the judgement calls are listed so they can be overruled. | none | [applied-I.md](history/staging/applied-I.md) |\n| `Q-applied-wave4-P` | ANSWERED | Which calibration defects sit on a3-05-bound-L.md, localized-04-maxsum.md and level-ledger-tight.md, and were they fixed? | Fourteen defects found and fixed on the one axis wave 3 never ran, none of them reachable by any check in qc.js: two numbers contradicting the file's own pasted script output, one slot count against thirteen other sites and an exact closed form, one superseded sifting limit and three dropped scopes; the gate stayed at zero on all six checks. | none | [applied-P.md](history/staging/applied-P.md) |\n| `Q-at43-bigint-0830` | PARTIAL | Can the K-30 natal march be carried past its 2^53 ceiling to @43 exactly, and is the @43 point worth its cost? | The engine side is done and VERIFIED (five paths promoted to BigInt, @7..@37 and a 0.248% slice of @41 reproduced digit for digit); the @43 point is NOT run, because the measured extrapolation is 579 h of eight cores on this machine (a 43x tile times a 2.23x per-cell cost, against the brief's ~13x), which is a weeks-class box job whose only payoff is a sixth point on a curve with no consumer; the forecast 0.8393 raw / 0.8399 persisted stands unscored. | 1 | [engine-0830-at43-bigint.md](history/staging/engine-0830-at43-bigint.md) |\n| `Q-attacks-wall-ten` | ANSWERED | Which ten attacks on the frontier-zone wall were executed, and what did each return? | All ten are marked DONE with their learnings recorded; none breached the wall, parity stands, and the durable yields are attack 8's unconditional small-gap theorem for p >= 17 and the anchored-origin phase picture. | none | [ATTACKS.md](ATTACKS.md) |\n| `Q-attacks2` | ANSWERED | What did the ten copy-geography attacks of the second wave find? | All ten complete: one theorem-grade result (the Exact Invariance Lemma, fossil depth frozen at birth, proved independently twice) and one MEASURED, Hardy-Littlewood-conditional law (the Unification Law, to about 1 percent); no unexplained novelty survives and the wall stands. | none | [ATTACKS2.md](ATTACKS2.md) |\n| `Q-attacks3-uframe` | ANSWERED | What did the ten-attack u-frame wave (A1-A10) settle about the fold structure and the Zone Postulate? | The R/I split held: every residue attack returned an exact object and no interval attack moved; the additive chain G2(new) <= G2(old) + L*mbar it was framed around is itself REFUTED (U-FRAME 5a step 4), A5's Theorem B is structurally capped, and A10's exactness route is a dead end (rate 0.927 over 329 cells, excess 6..120 not shrinking). | none | [ATTACKS3.md](ATTACKS3.md) |\n| `Q-audit-campaign` | ANSWERED | Does the campaign archive layer - the natal-cap notes, ATTACKS, covering-dive and their neighbours - hold internal inconsistencies? | Six files and eight of the natal-cap notes are clean and need no change; the remainder carry per-file findings recorded in place, and this is a diagnosis pass rather than an edit. | none | [audit-campaign.md](history/staging/audit-campaign.md) |\n| `Q-audit-cross-doc` | ANSWERED | Where does the corpus carry two values for the same object in two different documents? | Twenty-six findings ranked A, B and C, eighteen of them the Kourbatov shape where the resolution was already on disk in a document the stale one cites by name, including a retracted theta column quoted as live in nine places and a prior-art collision on the dimension-2 Rankin accounting; the gate read 0 findings before and after. | none | [audit-cross-document-constants.md](history/staging/audit-cross-document-constants.md) |\n| `Q-audit-front-door` | ANSWERED | Does someone arriving after the 2026-08-19/20 wave get the true current picture from README, G2-STATE section 0 and CHRONICLE in ten minutes? | All three are STALE: README's Status is dated 2026-08-17 with a broken map row and four missing files, G2-STATE section 0 stops at the second attack wave, and CHRONICLE ends at Day 5; drafts are ready for two of the three and README's rewrite is left in Chris's register. | none | [audit-front-door.md](history/staging/audit-front-door.md) |\n| `Q-audit-new1` | ANSWERED | Do G2-STATE.md, LOCALIZED-GAP.md, localized-04-maxsum.md, exponent-control.md and gate-multiplies.md agree with themselves and with their sources? | Findings per file, the leading one a NARROWED Origin Excess claim: the lemma carries an unstated third hypothesis, positivity of D_y(y'^2) - 2(pi(x) - pi(y) + 1), which forces ln x*/ln y near 1.44 at every level computed and caps the advantage at about 2.2 rather than order (ln x / ln y)^2. | none | [audit-new1.md](history/staging/audit-new1.md) |\n| `Q-audit-new2` | ANSWERED | Are the seven research documents of the new2 partition internally consistent and correctly scoped? | Per-file findings across the seven, mostly dropped scopes and attribution defects, plus four documents that were missing the standard current-understanding footer, which was added. | none | [audit-new2.md](history/staging/audit-new2.md) |\n| `Q-audit-numbers` | ANSWERED | Does the corpus's arithmetic survive recomputation from scratch by an independent method? | The ladder is right: all twelve G2 terms reproduce under a method sharing no code with the one that produced them, 37 of 39 assertions pass in 152 s, and the four errors found are small and none is load-bearing. | none | [audit-numbers.md](history/staging/audit-numbers.md) |\n| `Q-audit-papers` | ANSWERED | Are the paper suite and the root README consistent with their research homes? | Per-file corrections applied across the six paper/ files and README, with a Not fixed section naming what was deliberately left, including the exposition question the Holt attribution raises and one stylistic sentence of Chris's that was left alone. | none | [audit-papers.md](history/staging/audit-papers.md) |\n| `Q-audit-reading-path` | ANSWERED | Can a cold reader reach every live result in two hops? | The two-hop test passes for eight of the ten headline results of 2026-08-19/20 and no staging record is orphaned; what fails is narrower, the front door being three days behind and contradicting REFUTED.md on u_sup, G2-STATE's section 10 table still the 2026-08-17 list, and kappa-not-L carrying nothing from the L wave. | none | [audit-reading-path.md](history/staging/audit-reading-path.md) |\n| `Q-audit-spine` | ANSWERED | Do the spine documents - ZONE-POSTULATE, THE-DIALS, THE-LENS, GLOSSARY, OBSERVATIONS - state their objects correctly? | Findings per file, the leading one a frame error in ZONE-POSTULATE section 5: G2's own exponent measures 1.57 central, bracket 1.3 to 1.9, against a calibrated one-class control, while theta is above 2 and rising, so the two readings that sat on boundary exponent 2 resolve in opposite directions. | none | [audit-spine.md](history/staging/audit-spine.md) |\n| `Q-audit-staleness` | ANSWERED | How much of the live layer is stale against changelog passes 26 to 48? | Eleven of the nineteen files in scope are clean and eight carry at least one stale sentence (U-FRAME three, G2-STATE two and others), with a separate list of upgrades the live layer has not absorbed; report only, nothing outside the report was edited. | none | [audit-staleness.md](history/staging/audit-staleness.md) |\n| `Q-audit-uframe` | ANSWERED | Do the u-frame documents' claims survive an audit against their own sources? | Several are REFUTED: the multiplier requirement ln c <~ 2 ln^2 u / u is off by a factor ln u and is replaced by the per-fold rate ln c(p) <= 2 ln p / p, the Inertness Lemma's rate is narrowed to 4/u, and SUM L*mbar ~ 2 x ln^3 x is false because U-FRAME step 4 is false. | none | [audit-uframe.md](history/staging/audit-uframe.md) |\n| `Q-b2mean` | ANSWERED | Can the mean value of B2 = Sum e^2 Vabs(e)^2 be bounded below its trivial qmax*B ceiling? | Yes, by one logarithm: B2 = O(qmax*ln^7 z) against the trivial O(qmax*ln^8 z), with the mass located on primorial-core smooth e nowhere near qmax, the primitive-mode weight J2(e)/12 proved and priced as a flat 1.48x cut of MS3, and the finite forms computed exactly at z = 13..47. | none | [attack-b2mean-01.md](history/staging/attack-b2mean-01.md) |\n| `Q-barrier-kappa2` | CLOSED | Does Granville's exceptional-character construction, which makes the Jurkat-Richert f and F attained by interval sieving problems at kappa = 1, transfer to kappa = 2 and supply the missing barrier on wall-note Face 4, so that no class-blind argument can beat beta_2 = 4.26645 on intervals? | No. Verdict (b): the transfer runs, fixes the axiom obstruction that sift-limit-attack.md section 2 blamed for the mixed-sign sketch's death, and then hits a hard ceiling at u = 2, because the character's only gift is the one-point identity lambda = chi on z-rough integers and a sign pattern with a +1 coordinate is empty exactly when z^2 >= x; above u = 2 the surviving question is the shifted intersection of two positive-density lambda-classes, which is Chowla-strength, so the section 2 verdict stands with a corrected reason; the band (2, 4.26645] is untouched, and the hypothesis itself implies the target by Heath-Brown 1983. | 0 | [attack-barrier-kappa2.md](history/staging/attack-barrier-kappa2.md) |\n| `Q-bc-parity-floor` | CLOSED | Is the 2 that the census's B/C ratio limits to the same object as the parity floor's 2? | REFUTED at the first step, before any kappa-scan: the certificate dies where B/C crosses 1, not 2 (B = 503 against C = 497 at the death zone), the constant reads the sifting dimension while the threshold does not, and the parity floor's 2 cannot be this one. | none | [attack-bc-parity-floor.md](history/staging/attack-bc-parity-floor.md) |\n| `Q-beta2-AB-bounded` | ANSWERED | Is B(z,s) bounded, and does bounding it move the 4.2665 exponent? | B(z,s) <= 9 A(z)^2 (E(z) - 1) = O((log z)^8) is proven, unconditional, explicit and uniform in s, but the gap it closed was never load-bearing, the estimate has a published neighbour at s >= 9, Opera de Cribro Lemma 6.18, which does not cover this corpus's s in [2.0, 3.4], and the route to B = O(1) is measured dead as a uniform statement. | none | [attack-AB-bounded.md](history/staging/attack-AB-bounded.md) |\n| `Q-beta2-exact-strata` | CLOSED | Does re-inserting exact Buchstab strata (DP3) lower the dimension-2 positivity threshold below beta2 = 4.26645? | A sharp negative with a price tag: exact strata are legitimate and worth 1.72 to 1.84 of exponent, taking the positivity threshold to 2.0260 at finite levels, but they produce no theorem because the exact stratum value is the upper sieve function of a dilated tile one level down, so the regress terminates at every finite z and at no uniform z. | none | [attack-beta2-03-exact-strata.md](history/staging/attack-beta2-03-exact-strata.md) |\n| `Q-beta2-loss-budget` | ANSWERED | Where in the chain from truth to beta2 = 4.26645 is the loss, and which discard point is worth attacking? | Aim at theta: it carries the largest derivative (-4.2665 per unit) and the only consumer in the literature, beta is worth at most 1.07 and has no consumer, DP2 and the o(1) are worth exactly zero, and the two live knobs together stop at 1.597, so the last factor of 1.6 down to truth is in neither of them. | none | [attack-beta2-04-loss-budget.md](history/staging/attack-beta2-04-loss-budget.md) |\n| `Q-beta2-theta-total` | CLOSED | What is the largest theta_total defensible position-uniformly, and does it clear the break-even the beta2 upper-bound attack needs? | The largest defensible theta_total is 1 and it does not clear break-even: it misses by 0.2417 under the brief's symmetric arithmetic and by 0.2090 under the corrected asymmetric one, no part of the gap closes, and the weakest link in the negative is an ABSENT rather than a PROVEN. | none | [attack-beta2-02-theta-total-minimal.md](history/staging/attack-beta2-02-theta-total-minimal.md) |\n| `Q-beyond-chebyshev` | PARTIAL | Can the ensemble bound on P(S = 0) be pushed beyond Chebyshev, and how far? | Two beyond-Chebyshev bounds now stand, at @11 where capacity gives P(S = 0) = 0 exactly and at @13 where P(S = 0) <= 1.898e-6, a factor 513 below Chebyshev's 9.74e-4, with 683 assertions machine-checked; @17 is blocked on a 4.9e16-term sum and needs a 4-point wrap identity that does not exist. | none | [natal-cap-21-beyond-chebyshev.md](natal-cap-21-beyond-chebyshev.md) |\n| `Q-bf-split` | ANSWERED | Is Brüdern-Fouvry's level split optimal for their own theorem, or is there unclaimed exponent in it? | It was 99.3 per cent a trap: their condition (iii) binds at the published split and the proposed re-split violates it by x^{0.040403}, leaving 0.0000120536 in theta of the claimed 0.0295482779, real but invisible at the four decimals they print. | none | [attack-bf-split.md](history/staging/attack-bf-split.md) |\n| `Q-bilinear-fold-first-attack` | ANSWERED | Does assigning each Mobius factor to its first fold, or applying a direct second-moment bound, establish the missing one-sided estimate? | The first-fold identity yields no saving; a direct second moment has a negligible diagonal and an open two-prime off-diagonal. Fixed-fold covariance is an exact residue-imbalance square and the beta weights balance at each fixed modulus. Growing-depth joint control remains OPEN; B>=-C2*x+o(x) is not improved. | C | [bilinear-fold-attack.md](bilinear-fold-attack.md) |\n| `Q-bilinear-transplant` | CLOSED | Does this programme's frame have anywhere to put bilinear or Type-II arithmetic information, the only thing that defeats parity in practice? | The tile side cannot host it, since no corpus object is a signed sum over two ranging element ranges; the zone side can express one, and the estimate that one needs is the one already recorded absent. Section 9 lists the four findings that would reopen the row. | none | [attack-bilinear-transplant.md](history/staging/attack-bilinear-transplant.md) |\n| `Q-block-L-first-dead` | ANSWERED | Is the block-1 counting bound on L the first-dead 62 or the last-alive 111, and does downward closure hold in the block coordinate? | Downward closure HOLDS in the block coordinate: L <= 62 is sound and recomputed from scratch rather than inherited, L <= 111 is true, implied by 62 and weaker by 1.79x, and the adjudication's supposedly sharper instrument is attack 3's instrument. | G (retired) | [adjudicate-L-bound.md](history/staging/adjudicate-L-bound.md) |\n| `Q-block-alternation` | CLOSED | Is there a block-level alternation law? | No: a block-level inequality exists and is a real theorem, but it is not an alternation law - over a block the alternation law is strictly weaker than plain slot counting by the exact factor mbar(T_v)/6, at least 10/6 and growing like ln^2 v, and the resulting Block Partition Inequality closes only at v = 5 and v = 7 and is vacuous from v = 11 because 2*Sum_{v v^2 block ladder to sustain itself? | No: on the eleven-term exact ladder (this attack computed G2(41#) = 546) the ratio is flat at slope +0.05 +/- 0.11 on b >= 11 against a 12.3 per cent band, while the same estimator resolves the one-class control's falling ratio at 11.6 sigma; and the criterion is not independent, since at the natal it IS G2(x#)/x^2, the Zone Postulate itself. | none | [attack-block-01-ladder.md](history/staging/attack-block-01-ladder.md) |\n| `Q-block-exponent` | CLOSED | Does the block sub-problem have a better exponent than the proven 4.2665? | The required exponent for the ladder to close is 2, not 4 (the brief's step-3 arithmetic carried a factor error), and 2 is the TPC-equivalent line, so the useful part of the open band (2, 4.2665] is empty; the block's own prime range pins kappa = 2 and starting from T_v does not change the dimension. | none | [attack-block-05-exponent.md](history/staging/attack-block-05-exponent.md) |\n| `Q-block-greedy` | ANSWERED | Does the block-restricted adversarial greedy reach the truth at v = 5, and does block restriction cost anything? | Deterministic greedy reaches 17 against truth 19, randomised restarts reach 19 and an exhaustive DP confirms it, so greedy as a rule is optimal at v = 5 and the shortfall is a search failure; block restriction costs nothing on ten points with the same estimator on both sides, and the published Y2 ladder's bisection on a non-monotone predicate is a real defect. | none | [attack-block-04-greedy.md](history/staging/attack-block-04-greedy.md) |\n| `Q-block-kappa` | CLOSED | What does the block version of kappa(m) buy over the per-fold form? | Nothing: kappa_block(1) = 19 equals combined L at block 1 by construction, the minimal shift j*(m) equals kappa_block(m) at every m from 1 to 12 so there is zero slack in the block object, and the block form of Theorem C is empty, its vacuity coefficient 1.552 against a requirement of 1 at block 1 and growing like ln^2 v. | none | [attack-block-07-kappa.md](history/staging/attack-block-07-kappa.md) |\n| `Q-block-killers` | ANSWERED | For a maximal run of deleted T_v slots under the block v -> v^2, which primes do the deleting and how concentrated is the work? | Not concentrated: across 40 runs in five datasets every block prime kills at least one slot of every run and the exact minimum set cover is 82 to 100 per cent of the block, so no bound ranging over the block gets a reduction; the one favourable number is 915 of 1146 slots, 79.8 per cent, with exactly one killer. | none | [attack-block-02-killers.md](history/staging/attack-block-02-killers.md) |\n| `Q-block-literature` | ANSWERED | Does the literature already own the range-restricted covering object behind the block v -> v^2? | FOUND, and it has a name: the range-restricted covering problem is Erdős Problem #688 and is OPEN, the bounded-capacity conjecture #1200 is a third trap of the same class as the brief's two, and the Kalmynin-Konyagin journal version that covering-dive.md says does not exist does; the remaining negatives are ABSENT-AFTER-COMPETENT-SEARCH on calibrated channels. | none | [attack-block-06-literature.md](history/staging/attack-block-06-literature.md) |\n| `Q-block-reformulation` | CLOSED | Does the v to v^2 block reformulation, treating the block as a set, give a smaller combined L and an exponentially growing window? | Sound reformulation, no open path: no primality input is needed anywhere, nothing is deleted inside the window at all so combined L there is identically zero, and the object has to live in the tile; this note's own correction (the counting bound is 111, not 62) was itself reversed the same day by adjudicate-L-bound.md. | none | [attack-block-00-ADJUDICATION.md](history/staging/attack-block-00-ADJUDICATION.md) |\n| `Q-block-secondmoment` | CLOSED | Can a second moment over a block bound the empty windows, and is it allowed to work? | NO, on a tile-independent impossibility: Chebyshev needs dist(E, Z) < E/sqrt(W) and the measured shortfall at H = 204 is a factor 8.41e6, so a second moment gives a density bound that is legal at every H and TPC-relevant nowhere; the TPC line sits at eps = 1/W and at H about w^2, and quantifying over w buys nothing. | none | [attack-block-08-secondmoment.md](history/staging/attack-block-08-secondmoment.md) |\n| `Q-block-target` | CLOSED | What exponent does the squaring ladder v -> v^2 actually need, and do the steps get easier up the ladder? | The required exponent is exactly 2 with a constant below 1, which by the p^2 rule is TPC-equivalent, and the requirement is exponent-invariant at every step, so as a route to a theorem weaker than TPC the ladder is dead. | none | [attack-block-10-target.md](history/staging/attack-block-10-target.md) |\n| `Q-bonferroni-degree` | CLOSED | What degree does the Boole-Frechet certificate need, and does raising the degree reach an asymptotic bound? | Dead for asymptotics on a loop that closes on itself: raising the degree divides the over-certification exponent by the number of pairs without removing it (measured slopes 0.5441, 0.5425, 0.2816, 0.2937, 0.1695 at k = 2..6 against the predicted 1/(2 floor(k/2))), and Theorem A gives k >= (theta(x) - O(1))/(log G2 + O(1)), so the better the G2 bound assumed the higher the degree needed. | none | [attack-bonferroni-degree.md](history/staging/attack-bonferroni-degree.md) |\n| `Q-buchstab-deep-0830` | CLOSED | Can the certificate engine's deep-ladder Buchstab transfer be proven at dimension 2 at the depths the run levels reach by a route that does not go through the fundamental lemma at s >= 22.06 or the constant-free DH Theorem 9.1 (TODO 8a)? | NO by any instrument this corpus can cite, and the non-closing step is structural, not a constant: the transfer is an asymptotic for a ratio of two dimension-2 sifting functions at one sifting depth z = q, so a sieve bracket [f2, F2] survives undivided in the ratio (width 3.67 at the best sigma any level has, 4.71 at the @23 head); a correction \\|B - 1\\| >= 1% can only occur at sigma(q) < 1.8 where f2 = 0 and F2 >= 7.85, while a lower bound exists only at sigma > 4.266 where \\|B - 1\\| < 1e-5; the Buchstab identity iterated once is already negative at K = 1 for q = 37 at @23 and is the sieve itself when iterated fully; Jurkat-Richert fails Omega(1) as stated; in the certificate's legal direction F2 beats the trivial cap_K <= cap2 at 0 of 1512930 (q, K) pairs at @23, so the sharp-sieve floor is -1733138 at every K; the transfer stays HEURISTIC, what would move it is a kappa = 2 asymptotic in the open band 2 < sigma < 4.266, and part (b) is scoped and graded, not attacked. | 8 | [attack-0830-buchstab-deep.md](history/staging/attack-0830-buchstab-deep.md) |\n| `Q-buchstab-transfer` | ANSWERED | Is the certificate engine's Buchstab transfer provable in the shallow regime y = T^{o(1)}? | PROVEN conditional on the fundamental lemma and EMPTY at every run level (needs s >= 22.06; available 4.7 @23, 17.1 @97); the engine's B is a dimension-1 object, the survey's pair-Buchstab is dimension 2, the certificate needs a third. | 8 | [thm-buchstab-transfer-shallow.md](history/staging/thm-buchstab-transfer-shallow.md) |\n| `Q-bv-import-survey` | ANSWERED | Which unproven legs of the tile programme become theorems if Bombieri-Vinogradov, Elliott-Halberstam or GRH is imported? | Two legs become provable now, the fixed-modulus tail refinements S1/S2 by Siegel-Walfisz and the full-wheel prime-comb equidistribution in the tail regime by BV; the Buchstab transfer at bounded u and Assumption A for d = 2 are parity-blocked at every one of the four inputs. | none | [bv-import-survey.md](bv-import-survey.md) |\n| `Q-c2prime-drift` | PARTIAL | Why does c2' drift on the 22-term ladder? | Class-count-blind (attack-c2drift-01 §1); on item 1c's own band x >= 41 the ten-point rate is unresolvable: c2' 0.3745 +/- 0.1411 against c1's 0.3344 +/- 0.2358 on the same primes, a difference of 0.0401 = 0.12 of the control's ten-point window sd. Whether the drift is real is NOT closed here: attack-c2drift-01 measured it at p = 0.0053 on x >= 17 and left (i)' and (ii) alive. exponent-control §2/§4/§6 refit at 22 terms. | 1c (retired) | [attack-c2drift-01.md](history/staging/attack-c2drift-01.md), [c2prime-refit-22.md](history/staging/c2prime-refit-22.md) |\n| `Q-cal4-routing` | ANSWERED | Does the standing certificate plan point at the right obstruction, and what is CAL4 worth at @17? | The plan is aimed at the wrong obstruction, but not for partition W's reason: the @13 1e-9 gate is met today only by an assembly containing the brute-force C(990,4) march whose @17 counterpart is 513 days on ten cores and is not codeable here, the @17 requirement is a ladder whose first useful rung is relT4 <= 5.05e-5, a factor of 7.9 rather than six orders, and CAL4 has no correct constant value. | none | [phase1-W2-cal4-routing.md](history/staging/phase1-W2-cal4-routing.md) |\n| `Q-calm-lemma-identities` | PARTIAL | What in the fused window and the anchored calm is proven, exactly? | Three identities and the exact spectral forms are proven and verified as exact integers or floats; the uniform-in-q anticorrelation is REFUTED rather than open, with six counterexample primes across six levels, and the Anchored Typicality Measurement is the anchored-escape wall one level down with no proof mechanism in sight. | none | [natal-cap-19-calm-lemma.md](natal-cap-19-calm-lemma.md) |\n| `Q-calm-vs-kill` | PARTIAL | What does the anchored calm buy against annihilation? | Two theorems, the @11 closure and the X-Limitation Theorem at @11, @13, @17 and @19, and two refutations, calm implying concentration and minimizer loudness; the overlap-floor candidate that would prove non-annihilation dies on the anchor's own drift, with the anchored rotation t = 0 its worst case at @17, leaving the X-floor open. | none | [natal-cap-31-calm-vs-kill.md](natal-cap-31-calm-vs-kill.md) |\n| `Q-capK-bv` | ANSWERED | Is the prime-regime cap_K over the full wheel an unconditional asymptotic via the fundamental lemma over Bombieri-Vinogradov? | PROVEN at short-note grade for q_K = W^{o(1)}, and EMPTY in every computable range (needs s >= 10.82, first cleared at x = 263; the lemma's floor s >= 10 is first reached at x = 239); the deep ladder is untouched. | 11 (retired) | [thm-capK-bv.md](history/staging/thm-capK-bv.md) |\n| `Q-capture-identity` | ANSWERED | Does the transplanted cap family collapse onto a classical object, and what does the collapse say about the depth law and the wall? | PROVEN, elementary: floor_K = T − X(K) on the half-open window with both members in [Q², Q′²), a convention that is load-bearing; the wall is renamed, not weakened; Σ capU counts each member against its own threshold, not against a uniform p_K, the two differing 11% to 37% at K*. | Z2 | [quadpoint-identity-01.md](history/staging/quadpoint-identity-01.md) |\n| `Q-centered-discrepancy-estimate` | PARTIAL | Can the top of D_y be removed using ordinary prime distribution after an exact divisor flip, and what estimate remains? | Equations (3)-(4), the exact split and flip, survive review and finite controls. A repair of the top-range bound T^top=O_(A,eps)(x/log^A x) is DERIVED in section 3a (2026-09-08) with the endpoint atom retained, odd square divisors, the corrected reciprocal-totient local factors with (m',g)=1, explicit truncation powers, a Cauchy multiplicity device, and a uniform Mobius mean proved from the q=1 Siegel-Walfisz statements; its inputs are the terminal-point BV of Tao Notes 3 Theorem 17 with the prefix form derived by rounding. The handler (lane V) read the derivation on 2026-09-08, reconstructed (BV*), (3a.9), (3a.14) and (3a.16), checked the limiting constant of (3a.9) numerically at eight (b,g) pairs and found no defect; it is accepted at its stated scope, with ineffective constants. The payoff is D_y=D^(e_1)+O_(A,eps)(x/log^A x) only, so the handoff consumer is equivalent to D^(e_1)>=-4x/25+o(x). The fixed-endpoint signed discrepancy, D_y>=-4x/25+o(x) and twin-prime infinitude remain OPEN. | C | [centered-discrepancy-estimate.md](centered-discrepancy-estimate.md) |\n| `Q-centered-discrepancy-measurement` | ANSWERED | At reachable x, is the OPEN sufficient input D_y>=-4x/25 numerically violated, is the absolute form (13) numerically plausible, and does D_y carry structure beyond a random-sign model? | MEASURED to x=2^38. Neither pre-registered falsifier fires. D_y/x stays within 0.0043 of zero for the measured j>=26. Over 30<=j<=38, D_y/x differs from -(T1/x-C2) by at most 2e-4, with maximum 1.84401e-4 at j=30; the classical term dominates this finite comparison. The data do not establish an asymptotic fluctuation scale, an impossibility of informative future measurements, or the sufficient signed estimate. No proof status changes. | C | [centered-discrepancy-measurement.md](centered-discrepancy-measurement.md) |\n| `Q-certificate-engine` | PARTIAL | What did natal-cap-28 assemble, and at what calibration does the certificate engine stand? | There is no fully analytic certificate law and nothing here is closed: what reads as one object is nine at five calibrations with one of the nine refuted, the Certified-Head Theorem is PROVEN on 1/3/6 certified primes at @17/@19/@23, and every engine output carries the status of its weakest input, the HEURISTIC Buchstab Transfer Hypothesis. | none | [certificate-engine.md](certificate-engine.md) |\n| `Q-chain-review-0906` | ANSWERED | Do the written derivations from S(x) down to E_dagger hold as stated, with every imported theorem used inside its hypotheses and every discarded term at the claimed O_H(x/log^H x) rate, and where does the chain remain unreviewed? | Three independent adversarial passes found no defect in the six classical contributions from S(x) to E_>, none in the grouped moment (1)-(20) including the E_* to E_dagger step, and none in the residual-coverage link E_> to E_*, whose block-shape derivation was reconstructed and verified exactly. Every imported theorem was confirmed in its primary source except the Mobius Bombieri-Vinogradov citation, which points at an exercise sheet and needs a published replacement. Stale o(x) rates in three note bodies were replaced. A checked argument is not a refereed theorem; the OPEN signed margin is untouched. | C | [chain-review-0906.md](chain-review-0906.md) |\n| `Q-changelog-add-B` | ANSWERED | Which superseded text from wave-2 partition B belongs in the changelog? | The per-document entries for U-FRAME, ATTACKS3 and gate-multiplies, staged for the shepherd to merge in one pass; nothing was written to CHANGELOG.md here. | none | [changelog-add-B.md](history/staging/changelog-add-B.md) |\n| `Q-changelog-add-C` | ANSWERED | What history left wave-2 partition C's paper-suite files, and what has to be staged for the CHANGELOG? | Staged: Door 2's two load-bearing numbers are RETRACTED because the column they came from was disclaimed by its own script's correction banner, the corrected artifact reverses the conclusion, the OEIS term count is corrected to twelve, the matching lower bound is retired, and Zone Equivalence is demoted from spine theorem to framing device. | none | [changelog-add-C.md](history/staging/changelog-add-C.md) |\n| `Q-changelog-add-F` | ANSWERED | Which superseded text from wave-2 partition F, the natal-cap family, belongs in the changelog? | Entries for eleven natal-cap documents and two new files, led by the retirement of the Fused-Window Calm Lemma and the certificate law with it, plus the prose-note index that closes qc-arch E4; staged only, not merged. | none | [changelog-add-F.md](history/staging/changelog-add-F.md) |\n| `Q-changelog-add-G` | ANSWERED | What history left wave-3 partition G's files, and what has to be staged for the CHANGELOG? | Staged verbatim with file and line: the twin-candidate census index is corrected from A059861(n-1) to A059861(n) with four independent confirmations, two script banner titles are retired as contradicted by their own companion prose, and two scripts that had no banner title gained one. | none | [changelog-add-G.md](history/staging/changelog-add-G.md) |\n| `Q-changelog-add-P` | ANSWERED | Which superseded text from wave-4 partition P's three files belongs in the changelog, and what does calibration against the home document find? | Fourteen defects came out of the check wave 3 recorded it had not run, and none of them is reachable by any existing gate check; the removed or rewritten text is reproduced verbatim per file for the shepherd. | none | [changelog-add-P.md](history/staging/changelog-add-P.md) |\n| `Q-changelog-add-Q` | ANSWERED | What history left wave-4 partition Q's files, and what has to be staged for the CHANGELOG? | Staged: the Maier-Pomerance clause in the OEIS draft is RETIRED because it drew a >= from a << (they state an upper bound), and audit-numbers.js gained an oeis part of 39 checks carrying three retired values, including the exponent 1.57 quoted for G2 when 1.57 is A288815's. | none | [changelog-add-Q.md](history/staging/changelog-add-Q.md) |\n| `Q-changelog-wave2-A` | ANSWERED | What changelog entries does wave-2 partition A owe research/history/CHANGELOG.md? | Staged per-document entries for G2-STATE.md, LOCALIZED-GAP.md, maier-matrix.md and origin-excess.md, each naming the claim as it stood, what replaced it and the artifact that forced the change; a staging file for the parent to merge, not an edit to the changelog. | none | [changelog-add-A.md](history/staging/changelog-add-A.md) |\n| `Q-changelog-wave2-D` | ANSWERED | Which changelog entries does wave 2 partition D stage for CHANGELOG.md? | Staged entries in the changelog's house form for research/README.md (repurposed from a summary into the router), README.md, GLOSSARY.md, TODO.md, THE-DIALS.md, ZONE-POSTULATE.md, THE-LENS.md and FOLD-PROFILE.md, for the parent to merge. | none | [changelog-add-D.md](history/staging/changelog-add-D.md) |\n| `Q-changelog-wave2-E` | ANSWERED | What changelog entries does wave-2 partition E owe research/history/CHANGELOG.md? | Staged entries covering covering-dive.md, two-class-lower-bounds.md, PRIOR-ART.md, sift-limit-attack.md, theta-ladder.md, maxgap-law.md and dhr-verification.md, led by the FKMPT constant moved across two files together. | none | [changelog-add-E.md](history/staging/changelog-add-E.md) |\n| `Q-changelog-wave3-H` | ANSWERED | Which changelog entries does wave 3 partition H stage for CHANGELOG.md? | Entries for U-FRAME.md's split, in which sections 10, 11 and 12 keep their numbers and heading text and lose their bodies, plus the three new child documents kappa-not-L.md, operator-and-pair-count.md and f-decays.md. | none | [changelog-add-H.md](history/staging/changelog-add-H.md) |\n| `Q-changelog-wave3-I` | ANSWERED | What changelog entries does wave-3 partition I, the flagship split, owe research/history/CHANGELOG.md? | Staged entries for the split of the flagship's wall chapter into the new paper/wall-note.md and the pointer repairs that split forces, in house form, newest first and grouped by the document changed. | none | [changelog-add-I.md](history/staging/changelog-add-I.md) |\n| `Q-chen-fold-benchmark` | ANSWERED | Can the fold framework reproduce a classical Chen lower bound on long intervals with every imported hypothesis and error budget stated? | The classical implication is derived below using three explicitly imported theorem statements, with the combinatorial minorant proved and its integral margin certified by exact rational arithmetic. This is a benchmark, not a new prime theorem, and it does not prove twins or a short-zone result. | C | [chen-fold-benchmark.md](chen-fold-benchmark.md) |\n| `Q-chen-opportunity` | ANSWERED | Does the signed Chen target identify an approachable proof mechanism, and what should the next research obligation be? | The target is sufficient but subtracts an avoidable odd-composite penalty; even cancellation of its obvious signed components does not close the existing separate bounds. Select a prime-detecting weight against explicitly justified arithmetic input ranges before pursuing a new estimate. The opportunity is a research judgment, not a proved mechanism. | C | [chen-opportunity-audit.md](chen-opportunity-audit.md) |\n| `Q-chen-signed-target` | PARTIAL | What exact additional arithmetic estimate would turn the completed Chen benchmark into a proof of infinitely many twin primes? | An elementary prime minorant gives a conditional twin theorem with all weights, ranges, quantifiers and errors specified. The opportunity audit identifies an avoidable negative-weight penalty and a separate-estimate budget that fails even under component cancellation; this sufficient target remains OPEN and is not the sole next proof obligation. | C | [chen-signed-target.md](chen-signed-target.md) |\n| `Q-coefficient-structure` | ANSWERED | Does the arithmetic structure of the aggregated coefficients reduce the endpoint estimate beyond the previous rectangle, and can smaller coefficient norms alone supply the remaining power saving? | Exact classification gives a nonsquarefree L2 norm of size at most sqrt(D)*W^(1/4) times logarithms, while the squarefree top-band energy is at least a constant times D*W*log(W). At d~x^0.277, e~x^0.467 every endpoint sector except the squarefree-squarefree prime sum has a power saving. This reduces that rectangle to one explicit endpoint correlation; prime-dispersion.md supplies the remaining estimate and controls the full rectangle. Finite algebra, CRT sectors and archived prefixes are checked separately. | C | [coefficient-structure.md](coefficient-structure.md) |\n| `Q-cofactor-progression-transfer` | PARTIAL | Can the corrected full-cofactor kernel be estimated on a growing cofactor range by representing its actual arithmetic on CRT progressions, and does the resulting bound reach the twin consumer? | Derived from named imports: for some positive absolute kappa and d, all prime-r cofactor pairs s,t <= floor((log x)^kappa), including non-squarefree inputs and mixed transition/smoothed profiles, admit a dyadic scale-average O(log^(2-d) X) bound after division by x. The extension uses bounded multiplicative Euler modifications on the progression s\\|n, t\\|n-2 and keeps its density 1/lcm(s,t), so summing cofactors costs only O((log log X)^2). This goes beyond s=t=1 but remains short of o(x). The large-cofactor joint remainder, outside residual and twin margin remain OPEN; the attempted extension to power-sized cofactors fails on source modulus range and accumulated logarithmic cost. | C | [cofactor-progression-transfer.md](cofactor-progression-transfer.md) |\n| `Q-coherence-0828` | ANSWERED | Are the 2026-08-28 notes consistent with each other? | 20 contradictions, 8 convergences, 46 live-doc corrections collected (34 mechanical, 12 need a second reader). | none | [coherence-0828.md](history/staging/coherence-0828.md) |\n| `Q-coherence-0829` | ANSWERED | After the 2026-08-29 edits, does every live document state each changed fact the same way, and do the papers still agree with the notes? | 24 changed facts checked at 63 live-layer sites: 16 live disagreements (11 APPLY, 5 HOLD) plus one count error inside a HELD note; the worst is the localized band 2.9 to 4.2 attributed to \"two engines\" when only one of the two reads it, the other reading 2.14 to 4.39; qc.js 1 finding, in a file another agent holds; audit-numbers 251/251. | none | [coherence-0829.md](history/staging/coherence-0829.md) |\n| `Q-coherence-0830` | ANSWERED | Do the live layer (TODO, README, G2-STATE, REFUTED, anchored-calm, GLOSSARY, CHANGELOG, QUESTIONS) and the eighteen notes landed 2026-08-29 evening and 2026-08-30 morning agree sentence by sentence? | They mostly agree; 27 distinct disagreements found, 15 graded APPLY (both sides quoted, no judgement needed) and 12 ASK, none touching a note's mathematics: the live layer lags the landed notes in six places (a PROPOSAL listed under PROVEN in G2-STATE section 0, 67 for 71 closed routes, the skeleton door still open in README and two anchored-calm sentences, Z5's body contradicting the record-mechanism note, item 9's one-versus-two open steps, a stale Z2 first move), carries four numeric slips (8-of-10 for 10-of-10, 27 for 25 clauses, u* in the seventh digit, nine for ten levels), one rung inflation (a text-layer reading called read at the page), and one landed note (recon-0830-rec-killrun) is itself wrong about the record on the seventy-five count; qc.js --full at 09:23 fails only on two ledger ids from notes that landed during the run. | none | [coherence-0830.md](history/staging/coherence-0830.md) |\n| `Q-comb-discrepancy` | PARTIAL | Can the Comb Discrepancy Lemma's constant 2*3^k be tightened (TODO 8c)? | The lemma IS the trivial per-block bound; the attained optimum is max G - min G, a computed number per level (slack 29x @23, 54x @29, growing); term-by-term pricing lifts the certified head share to about 28-29 percent, not the 50 hoped for. | 8 | [comb-discrepancy-tight.md](history/staging/comb-discrepancy-tight.md) |\n| `Q-comb-tail-0830` | PARTIAL | Can TODO item 8's remaining part (b), prime-comb equidistribution in the tail regime, be proven at the depths the certificate needs, or at least measured and priced at the enumerable levels (8b)? | Not proven and no exponent moves: the tail defect is measured exactly for the first time (signed -0.01% of the tail main term at @23, -0.00% at @29, unsigned 0.60% and 0.25%, smaller than the head's 1.00% in aggregate but 8 to 37% per prime at its worst), the Comb Discrepancy Lemma's method fails in the tail on its MAIN TERM (off by a derived factor e^gamma(1/u - q^(1-u)), measured aggregate 1.14x at @23) before its error term (10^27 x main), the prime-comb Legendre form has 2^(k+2) terms of which the short ones obey the lemma's <1 bound and the long ones are prime-in-AP discrepancies whose term-by-term sum is 11.2% of main at @23 against a signed -0.01%; the all-x form at K = 0 is Theorem C (PROVEN, limit only) and at the certificate's depth K* the non-closing step is a kappa = 1 asymptotic at sifting parameter s < 2, a proof gap on data that show B_tail = 0.998-1.000 at K* through @29; the full-depth half is 8(a), CLOSED. | 8 | [attack-0830-comb-tail.md](history/staging/attack-0830-comb-tail.md) |\n| `Q-consolidation-wave` | ANSWERED | Can the five cost-class scripts be bound to their own output, and can U-FRAME's two lost tables be rebuilt? | All four runnable cost-class embeds are bound and the hand-pasted-tail counter falls 19 to 15 with the gate at TOTAL 0; three needed --force at a cost of 24 tokens out of 211 with no value changed anywhere, and natal-cap-33-overnight.js is a three-run composite that should never have been on the cost list. | 11b (retired) | [consolidation-wave.md](history/staging/consolidation-wave.md) |\n| `Q-constants-audit-2` | ANSWERED | For every load-bearing number that appears in two or more live documents, does it agree everywhere, and does it trace to exactly one custody-bound producer? | 25 findings over 69 of 70 files, 8 rank A, 12 rank B, 5 rank C: 46 named-constant groups carry two or more distinct values across two or more files, and 439 numerals of five or more significant digits in the live layer have no producer printing them at any precision; nothing was fixed and five judgement calls stayed queued. | none | [constants-audit-2.md](history/staging/constants-audit-2.md) |\n| `Q-consumer-comparison` | ANSWERED | How does the sufficient margin C_2 x + E_dagger(x) >= c_0 x/(log x)^K compare logically with the published sufficient routes to twin primes, and what does the literature already own of the corner object? | The sufficient margin remains OPEN. The published conditional routes imply it where their hypotheses and stated lower bounds apply; reverse implications are not established. The dictionary is E_dagger(x)/x = C_2(2 delta_x - delta_{x/2} - 1) + o(1), with K>0 below that normalisation's resolution. Independent review corrects the comparison: cumulative and dyadic consumers on unbounded scales are equivalent at the same fixed K with possibly different positive constants. At K=0 an eventual cumulative lower bound also implies the unbounded-scale dyadic consumer. The nonnegative-weight corner identification applies only to the prime-cofactor subfamily; the full residual retains additional branches. Every surveyed route remains conditional. | C | [consumer-comparison.md](consumer-comparison.md) |\n| `Q-corner-branch-diagnostic` | ANSWERED | Can future experiments enumerate the full coefficients C(n) and C'(n-2) branch by branch, without silently dropping proper prime powers, cofactors s>1, non-squarefree inputs or either gcd branch? | The driver exists and its two independent constructions of each side agree exactly on 8192 retained sides and 1802 fixture sides; five deletion and reconstruction controls are ACTIVE in both runs. Its split by gcd(n,n-2) measures integer parity, not the per-term CRT gcd partition. The fixed-eta corner is empty on the retained prefix, and Elo exceeds E0 across the entire J_x, so the matrix is a proxy window. This is finite algebra and tool preparation, with no asymptotic estimate or twin margin. | C | [corner-branch-diagnostic.md](corner-branch-diagnostic.md) |\n| `Q-corner-coefficient-energy` | ANSWERED | Can the full corner coefficients be studied before splitting their cofactor branches, and what do exact energy and classical smoothed sieve weights supply? | The sharp coefficient energy is an explicit signed quadratic form in short cofactors plus O_epsilon(x^(1/2)K^2*x^epsilon), a power below x at the fixed corner. Logarithmically averaging the divisor cutoff gives Barban–Vehov weights and an O_eta(x log x) squared norm on each side and absolute shifted-product bound. The follow-up sharp-corner-transition.md gives sharp O_eta(x log^2 x) norms and proves a non-negligible norm transition for sufficiently small fixed eta. Signed transition saving and the global complement remain OPEN; no exact residual cut or twin margin changes. | C | [corner-coefficient-energy.md](corner-coefficient-energy.md) |\n| `Q-corner-correlation` | PARTIAL | On the corner S_0 where both cofactors sit just above their own cutoffs, what exactly is the remaining endpoint sum, what does the sufficient consumer need there, and does any reviewed correlation theorem supply it? | The full corner is exactly sum_n C(n)C'(n-2). Proper-prime-power terms above the cutoffs are negligible at fixed eta by §1.1; the remaining prime-r terms with s>1 or s'>1 and non-squarefree inputs remain OPEN. The s=s'=1 piece has a nonnegative Mobius-product weight with exact moving cuts. The multiplicative lift and round-review sampling give small continuous and dyadic scale-average log savings for that subfamily, with no o(x), full-corner control or twin margin. The complement is still open. | C | [corner-correlation.md](corner-correlation.md) |\n| `Q-corner-log-average` | PARTIAL | What do logarithmically averaged correlation theorems and their quantitative successors actually supply for the prime-cofactor corner weight, with exact support, rates and scale quantifiers? | The pure band is invariant under dilation by primes outside it; the exact cofactor window is not, but its support extends to x^(1-2eta) and need not leave the window under a fixed dilation. Uniform-prefix logarithmic bounds imply block bounds by Abel summation; a relative exponent above 3 is one sufficient route to o(x), not a universal necessary threshold. Pilatte's 1/(96e) calculation applies only to his displayed parameter choice. A bounded multiplicative Fourier lift now gives a small continuous scale-average log saving for the prime-cofactor subfamily via Tao-Teravainen v2; see prime-band-transfer.md. No o(x), dyadic pointwise estimate, full-corner estimate or positive twin margin follows. | C | [corner-log-average.md](corner-log-average.md) |\n| `Q-corner-measurement` | PARTIAL | At finite dyadic x, how large is the corner two-point correlation K(x)=sum_{x/2= 1 with the density condition as its only hypothesis, so what beta2-note adds is two parameter choices and one dimension-free observation that is zeb's at kappa = 1; the honest response is to state the k-class family, whose k = 1 row is a known theorem. | none | [attack-dim2-standalone.md](history/staging/attack-dim2-standalone.md) |\n| `Q-discrepancy-two-class` | ANSWERED | What is the two-class analogue of Holt's signed discrepancy DeltaPhi, and do the three candidate growth laws on the table agree? | One object in three norms rather than three agreeing measurements: the proven Level Ledger bound 2*3^(pi(x)-1) and natal-cap-29's spectral level law share the integer 3 provably, since R_k(p) tends to k+1, so the apparent agreement is an identity; the custody gate reproducing Holt's Table 2 passed. | none | [discrepancy-two-class.md](discrepancy-two-class.md) |\n| `Q-dispersion-range` | ANSWERED | How far do the dispersion and coefficient-sector estimates extend across divisor sizes, and does a better orientation or gcd budget enlarge their overlap? | Averaging the nonzero gcd losses over the original divisor gives a different dispersion bound with cross-prime exponent (5/4)a+(1/2)b+3/50, where a=delta+6/25 and b=nu+1/20. Explicit diagonal, prime-cut and sparse-sector inequalities control a region of full rectangles, including d~x^0.282, e~x^0.522 at product scale x^0.804. Its cross-prime and left-sparse budgets are 0.9985 and 0.9988. The supremum of product exponents in this sufficient region is 5397/6700; it is not a uniform product cutoff. Balanced supports separately allow 12/25= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched. | D | [attack-0829n-doubling-bridge.md](history/staging/attack-0829n-doubling-bridge.md) |\n| `Q-doubling-killrun-0830` | PARTIAL | Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN. | D | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n| `Q-embed-backlog-0829` | PARTIAL | How much of the embed backlog (legacy scripts with no OUTPUT block, readings not traceable to their block) could be closed in one pass, and what did the fresh runs contradict? | MEASURED. embed-backlog fell 218 -> 189 findings in one pass: no-output-block 34 -> 5, readings-not-traceable 181 -> 181 (untouched by design), hand-pasted-tail 3 -> 3. Twenty-nine legacy scripts were bound with node research/qc/embed.js, zero --force was used, and one legacy reading is contradicted by its own fresh output (attack-beta2-03-exact-strata reading 8, \"1.04 to 1.07 across y = 7..23\" against a printed 1.102 at y = 7). | none | [embed-backlog-0829.md](history/staging/embed-backlog-0829.md) |\n| `Q-embed-binding` | ANSWERED | What does the embed fingerprint actually bind, and what does it leave loose? | It binds the code to a claim about the output and does not bind the output block to anything: code-sha256 covers every byte above the banner, out-sha256 is only ever compared against another run, timeouts and failures write nothing, a prose line can unbind a tail and one did during this pass, and 37 cited scripts have no output custody at all. | none | [verify-the-verifier-embeds.md](history/staging/verify-the-verifier-embeds.md) |\n| `Q-endpoint-fourier` | ANSWERED | Does a complete Fourier truncation budget and a matched Kloosterman-fraction theorem control any further part of the actual endpoint sum when its small prime-power coefficients are combined first? | A written classical-input derivation controls the rectangle d in (floor(x^(27/100)),2floor(x^(27/100))], e in (floor(x^(46/100)),2floor(x^(46/100))] to O_H(x/log^H x) for every fixed H. Its product is of order x^(73/100), outside the previously controlled region eventually. The aggregated Fourier exponent is 1989/2000; the full Vaaler tail and gcd=2 branch are included. This is a regional estimate, not a full residual bound or twin theorem; finite algebra and saved-factor checks are separate validation. | C | [endpoint-fourier.md](endpoint-fourier.md) |\n| `Q-endpoint-pairing` | ANSWERED | Does retaining the difference of interval endpoints improve the complete Fourier budget, and are the lowest frequencies actually the next obstruction on the squarefree pilot rectangle? | A written derivation controls the full rectangle d~x^(11/40), e~x^(93/200) to O_H(x/log^H x), with product of order x^(37/50). The sufficient first exponent becomes 3/20+(7/10)(a+b)+(1/4)max(a,b), equal to 3999/4000 there. On the a=b=517/1000 pilot, this transition-frequency budget is 20061/20000, not the separate-endpoint 20163/20000; prime-dispersion.md now controls that pilot with a different estimate. Finite identities and exact exponent checks validate the implementation, not the asymptotic theorem. No uniform product cutoff or twin lower bound follows. | C | [endpoint-pairing.md](endpoint-pairing.md) |\n| `Q-endpoint-target-audit` | ANSWERED | Does the endpoint reduction require a fixed positive fraction of the expected twin count, and do recorded uniform-gap theorem failures exclude its weaker consumer? | No fixed fraction is required: for every fixed H the reduction has error O_H(x/log^H x), so C2*x+E_>(x)>=c*x/log^K x on unbounded dyadic scales suffices, as does a stated logarithmically rescaled average. These implications are derived from named inputs; their endpoint hypotheses remain OPEN. The recorded uniform-gap theorem comparison has different quantifiers and does not establish an obstruction for this consumer. | C | [endpoint-target-audit.md](endpoint-target-audit.md) |\n| `Q-erdos-map` | ANSWERED | Does the two-class object already occupy a numbered slot on somebody else's map of open problems? | It has no problem number and no name on erdosproblems.com, Ben Green's list or the OEIS citation graph, but it is not unposed: Erdos posed it himself in one sentence in the same paragraph as the $1000 offer, and our object is the r = 2, difference-2 instance of his own stated extension of #687. | none | [attack-erdos-map.md](history/staging/attack-erdos-map.md) |\n| `Q-excess-chain-c` | CLOSED | Does the excess chain's constant c pin to 1.074 via a compressed-tail max correction? | NO: for any FIXED correlation length the derived family tends to 1 and both named corrections lower the maximum, so 1.074 is not derivable from a compressed-tail max correction; c measures 1.05 +/- 0.07 (sd) over x = 17..31, MEASURED, which does not separate 1.05 from 1.074. | 10 (retired) | [excess-chain-c.md](history/staging/excess-chain-c.md) |\n| `Q-exponent-control` | PARTIAL | What is the growth exponent of G2, measured against a control that knows its own answer? | MEASURED 1.50 +/- 0.05 stat on 22 trusted terms after control correction, systematic unquantified; the raw fit's bias grows and sticks at +0.28, exponent 2 stays disfavoured but is not excluded, and the question is bias-limited rather than data-limited. | none | [exponent-control.md](exponent-control.md) |\n| `Q-external-data-audit` | ANSWERED | Where is the corpus limited by external data it could simply adopt? | Findings are candidates, not verdicts: the highest settles an open reading for free, since dividing the two now-trusted series moves the G2/h ladder maximum from x = 37 to x = 79 and reverses the fall at x = 53, killing \"peaks at x = 37\"; the rest tighten quoted constants or retire stale limitation sentences. | none | [external-data-audit.md](history/staging/external-data-audit.md) |\n| `Q-f-census` | PARTIAL | What does the grain census law give for f, the qualifying-gap fraction, and where does it structurally stop? | DEFECT-carrying: every census point from x = 37 up is aliased, so the 42-point table above x = 31, both regressions, the factor 170 and the x = 1000 extrapolation must be re-read against the corrected law; the staircase theorem (treads are exactly the twin pairs), Lemma B, the comb coefficient and everything at x <= 31 are UNAFFECTED, and the growth law is a fit and not a theorem. | none | [a3-03-f-from-census.md](a3-03-f-from-census.md), [f-decays.md](f-decays.md) |\n| `Q-f4weak` | PARTIAL | What is the weakest sufficient form of F4 that could be proven, given rms <= z^(3+o(1))? | The mode-count/degree bound is NOT the theorem (sqrt(N)*rms grows at z^8.174 +/- 0.249 against the z^4.26645 ceiling and is dead from z = 31); one new PROVEN finite-z clearing survives z = 47 at a 5.0 percent margin but converges onto the trivial bound; the weakest law-shaped form found is MV(alpha), a mean value over modes, MEASURED slope 4.214 +/- 0.304 with beta2 inside the bar. | none | [attack-f4weak-01.md](history/staging/attack-f4weak-01.md) |\n| `Q-fdecay-deep` | ANSWERED | Does the fitted f decay law hold out of sample at deep levels? | It holds as a band, nine of nine deep levels inside the four-specification band, but the residual trends against the central specification at t = -7.08; the test also found what it was not looking for, that the 42-point exact census is wrong from x = 37 upward by a factor rising to 1.63 at x = 199, from a 32-bit shift alias. | none | [fdecay-deep.md](history/staging/fdecay-deep.md) |\n| `Q-fdecay-out-of-sample` | OPEN | Does the 42-point decay law for f, the qualifying-gap fraction, survive out of sample, given that every downstream reading extrapolates it three to thirty times past its range? | Pre-registration only, written before any producer for the pass exists on disk: four specifications are refit on the 42 exact census points as a transcription check and their projections are frozen, and nothing here is measured. | none | [fdecay-deep-prereg.md](history/staging/fdecay-deep-prereg.md) |\n| `Q-fekete-1d-defect47` | PARTIAL | Does the bounded-defect Fekete route survive a probe at 47#? | The defect at 47# is ordinary and the 47# enumeration cannot move item 1d's TPC threshold whatever value it returns; the bounded-defect Fekete lemma is stated exactly and proved with every hypothesis except the candidate itself discharged, so the route reduces to one named inequality and is neither closed nor open beyond that. | 1d | [fekete-1d.md](history/staging/fekete-1d.md) |\n| `Q-fixed-endpoint-discrepancy` | PARTIAL | After the accepted truncation to odd moduli e=-4x/25+o(x)? | Reviewed 2026-09-09 after the coprimality repair: T_I^low=O_(A,eps')(x/log^A x), hence S=C_2x+B+O_A(x/log^A x), with B the exact Type II plus band sum (2.9). The untruncated modulus bound was false; g<=(log x)^(A+13), both tails, the coprime density and the weighted BV multiplicity now pay the estimate. Review corrects harmless log powers and the power-of-two atom over the full eps' range. D^(e_1)>=-4x/25+o(x) is equivalent to B+2C_2M>=-4x/25+o(x); it implies, but is not equivalent to, B>=-(C_2-1/200)x+o(x). The latter and H_B are sufficient OPEN margins. The absolute band statement (4.9) is one stronger sufficient input, not a necessary condition. No inspected source estimates the remaining actual signed B. Twin-prime infinitude remains OPEN. | C | [fixed-endpoint-discrepancy.md](fixed-endpoint-discrepancy.md) |\n| `Q-fkmpt-corrigendum` | ANSWERED | Does the 2023 FKMPT corrigendum change anything the corpus depends on? | Clean bill of health: the corrigendum changes four numerical constants and the parameter M, every one already carried at its corrected value here; the loudest finding is the opposite of the expected one, since the premise that nothing in this repository has read it is false and has been since 2026-08-18. | none | [verify-fkmpt-corrigendum.md](history/staging/verify-fkmpt-corrigendum.md) |\n| `Q-fold-arithmetic-bridge` | PARTIAL | Does one parity-table bridge from the anchored fold ledger yield a sufficient twin lower bound with named arithmetic inputs? | Exact identities retained. The one unread sieve input of the pricing, Bombieri--Vinogradov for k-fold X^(1/u)-rough products, is derived from Wu's Lemma 2.3 (section 3a); the same input, sieved in the composite variable, gives the contamination aggregate constant 4 for each fixed k,u, replacing the displayed 12.86 to 19.72. With these inputs, elementary bounds give Q_cov(u)<1 and c*_real(u)<4 for every u>4 (section 4a, independently reviewed 2026-09-09 with rational certificates), so neither sufficient ratio test succeeds at any depth. This closes the two tests, not the decorrelation hypotheses, and supplies no twin estimate. | C | [fold-arithmetic-bridge.md](fold-arithmetic-bridge.md) |\n| `Q-fold-profile` | ANSWERED | Where does a fold by p land its damage inside the original tile stretch [0, W)? | The counting half is a theorem with an effective constant (Level Ledger PROVEN, Mirror Ledger VERIFIED 45 of 45) and the survival law is scale free (MEASURED), but the quantity controlled here is provably uninformative about L and kappa(m), so it buys nothing against the Zone Postulate route. | none | [FOLD-PROFILE.md](FOLD-PROFILE.md) |\n| `Q-fold-succession` | CLOSED | Does folding in succession damp the multiplier, giving a lower L than the sum of per-fold jumps? | No: the succession-damping route closes empirically at both reachable scales against a calibrated null, the only damping present is what level-tracking forces and the only extra structure present is cooperative, matching the structural closure by super-additivity. | none | [fold-succession-autocorr.md](history/staging/fold-succession-autocorr.md) |\n| `Q-foldL-amortized` | CLOSED | Can the fold multiplier L be bounded by charging kill-runs to the birth of the gaps they consume? | The accounting does not close on the tile: the Consumption Identity makes the charge exact and the bound is then only as good as X = 2Q0 + Q+ + Q-, and supply against demand fails on the tile at every x by exactly the factor ln^2 x; it closes in a localized window from p about 421 on, which is a statement about a bounded population only. | none | [attack-foldL-04-amortized.md](history/staging/attack-foldL-04-amortized.md) |\n| `Q-foldL-bridge` | ANSWERED | Does the bridge from a fold's kill count to L hold, and what is the sharpest transportable ceiling it gives? | The bridge is PROVEN and was already in the corpus, so the job was custody rather than a new theorem; the new pair-window rung is exact at all eight diagonal cells, and the best fully-proven transportable ceiling stays near 0.18p and beats the requirement nowhere. | none | [attack-foldL-02-bridge.md](history/staging/attack-foldL-02-bridge.md) |\n| `Q-foldL-extinction-scaling` | ANSWERED | Does the multi-kill extinction law predict windows it was not fitted on? | CONFIRMED under the pre-registered rule at Y = 2e7, 2e8 and 2e10 from the Y = 2e9 calibration alone, with the run-length extension REFUTED exactly as pre-registered; this promotes a law candidate on measurement, not a proof. | none | [attack-foldL-06-scaling.md](history/staging/attack-foldL-06-scaling.md) |\n| `Q-foldL-maxsum-direct` | CLOSED | Can maxsum_m(T_x), plain and residue-deleted, be bounded above by an argument that never counts kills? | The brief's premise contradicts the corpus's own Bridge Floor (maxsum_k >= maxsum_1 = G2(T_x) for every k), so the bridge cannot convert far enough however good the bound is; all four routes close (R1 partial then closed, R2 tautological and quantitative, R3 busts the budget), and the order-m object is in print, so item 0c's absence sentence has to change. | 0c | [attack-foldL-05-maxsum-direct.md](history/staging/attack-foldL-05-maxsum-direct.md) |\n| `Q-foldL-run-census` | PARTIAL | What ceiling on L does the channel-compatible run census force, and is that ceiling forced or a bridge? | Channel compatibility is exact and cheap but buys little: 3 in 71 at kappa(1) = L, the forced ceiling is a presence-relaxation rather than a multiset-exact bound, exact tiles stop at T_29, and the angle's own verdict sends it to TODO 0c, bounding a residue-deleted maxsum, which this pass did not attempt. | none | [attack-foldL-01-census.md](history/staging/attack-foldL-01-census.md) |\n| `Q-foldL-transport` | ANSWERED | Is there a third invariant of the tile's gap alphabet that provably survives the fold recursion, alongside the sum rules and the maxsum family? | Yes: the tail-count profile transports (the Tail-Count Transport, PROVEN, verified to T29 at 214,708,725 twin slots) and is sharper per fold than the standing route by a factor of three to eight in nats, but it does not chain, dying on the same accumulating index gate-multiplies.md closes. | none | [attack-foldL-03-transport.md](history/staging/attack-foldL-03-transport.md) |\n| `Q-foldL-window5` | MIXED (foldL-window5-prereg.md: OPEN; foldL-window5.md: ANSWERED) | Does the fold extinction law score one decade blind at W = 2e11? | HIT on all four pre-registered criteria (last fold with L >= 2 measured 631 against band [571, 877]; both counts inside their bands), with the hot systematic now confirmed at five of five windows at measured over predicted about 0.82, which by the prereg's own clause belongs in the law as a known overprediction rather than in the acceptance band. | none | [foldL-window5-prereg.md](history/staging/foldL-window5-prereg.md), [foldL-window5.md](history/staging/foldL-window5.md) |\n| `Q-ford-halberstam` | CLOSED | Does Ford and Halberstam's dual decomposition beat Brudern-Fouvry's (2.6), as its authors said it should? | No: the dual is the same inequality, verified to 3.553e-15 at r = 2 and 6.821e-13 at r = 2..7, and their estimation step is better than they claimed, the Rosser boundary layer making their absolute-value bound an identity with loss 0.000000000 at z = 20, 30, 42; the shortfall is the freedom the step gives up, one level per component and no lower sieve. | none | [attack-ford-halberstam.md](history/staging/attack-ford-halberstam.md) |\n| `Q-fractional-retention` | CLOSED | Do Brady and Li's fractional retention rules at kappa = 2 open the adjacent door sift-limit-attack section 7c named? | Do not pursue: the door is real, applies to our system and carries no regress, but half the rule family cannot be applied at kappa = 2 and the applicability window there is empty, both settled from the sources; the unlooked-for find is that Brady's thesis is prior art for our object. | none | [scope-fractional-retention.md](history/staging/scope-fractional-retention.md) |\n| `Q-frontier37` | ANSWERED | What do the fold-L wave's three exact instruments give one level deeper, at fold 37? | The prior-art check moved the target first: the ninth diagonal L(T_31, 37) = 4 and the maxsum_m(T_31) table for m <= 8 were already embedded in the corpus, so this is a re-measurement, not a first; M_alt = G2 is measured at eight folds and proven at none, and the transport ratio's rise 0.8881 to 0.9477 has no mechanism attached. | none | [frontier37.md](history/staging/frontier37.md) |\n| `Q-full-coefficient-average` | PARTIAL | Can aggregating the complete coefficients before a correlation theorem remove the explicit cofactor count, and what additional estimate is needed? | Exact factor and rounded-endpoint Fourier identities retained, with c_(i,0)=3/5 and an explicit composite-filtered weighted sum. The full family is not 1-bounded, but the sufficient phase condition admits at least k=0,+/-1 on the left and l=0,+/-1,...,+/-6 on the right for every Mellin twist; the earlier zero-only claim is corrected. Composite filtering and the required correlation rate remain unmatched. Proposition 6.5, independently reviewed including on 2026-09-09, proves coefficient norm at least (log x)^(2/5) for representations by 1-bounded functions on all smooth inputs. This does not exclude density-one representations, paid growing components or a jointly treated Fourier sum. No sufficient signed twin margin follows. | C | [full-coefficient-average.md](full-coefficient-average.md) |\n| `Q-g2-43-term` | ANSWERED | What is the fourteenth exact term of the G2 ladder, past 41#? | G2(43#) = 618, at least position 830,330,079,152,051 and attained at 8 positions of the period, confirmed by two independent enumerations over disjoint natal masks agreeing on value, multiplicity, position and survivor count; 47# is priced by direct probe at 1.49 days per run and stays out of session reach. | none | [phase1-T2b-exact-ladder.md](history/staging/phase1-T2b-exact-ladder.md) |\n| `Q-g2-falls-decision-rule` | PARTIAL | Does G2(x#)/x^2 fall, and what pre-registered decision rule would settle it? | The instrument is calibrated and sharp, resolving the one-class control at 11.6 sigma on the same nine points where it returns 0.9 sigma on G2, and the honest band on the slope is +/-0.117 at nine terms, so the rule is registered; but the power analysis puts separation at x = 53 only if the falling law is x ln^2 x and at x = 151 if it is x ln^3 x, so phase 1's extra terms settle nothing and no reachable exact ladder does either. | 1d | [phase1-T3prep-decision-rule.md](history/staging/phase1-T3prep-decision-rule.md) |\n| `Q-g2-provenance-x37` | ANSWERED | Does the headline G2 exponent depend on the eight terms this repository has never reproduced, and does any instrument without G2(37#) inside it flag x = 37? | MEASURED, both largely negative: the custody-only refit lands at 1.533 against the headline 1.498 and no provenance-block drop moves the corrected central by more than 0.035 (Ghat(64) alone moves it 0.002), while no G2-free instrument flags 37 in the high direction, the one \\|z\\| past 2 being h(37#) at -2.20 in the low direction and range-dependent; the blind extreme-value forecast of G2(37#) does overshoot at z = +6.58, unexplained. | 0 | [measure-g2-provenance-0829.md](history/staging/measure-g2-provenance-0829.md) |\n| `Q-g2-state` | PARTIAL | What is known about G2, the two-class maximum twin-slot gap, and at what calibration? | The gap is unchanged through roughly fifty recorded passes: the proven upper bound is exponent 4.26645 against a target of 2, and this file consolidates the map rather than computing anything new. | none | [G2-STATE.md](G2-STATE.md) |\n| `Q-gap-spectrum` | ANSWERED | What is the full gap-length distribution of twin slots over one period of the tile, what does the excess functional \\|B_N\\| = sum_{g>N}(g-N) read on an x^s grid, and where does the empirical minimum window count leave zero? | The distribution is exact at nine levels to x = 31 and the pre-registered renewal null FAILS in the light direction at every one: the tail is uniformly steeper than exponential (body slope -1.3302 against -1), no power law survives (the power-law slope moves by a factor 17), the maximum is 2.087 to 2.241 BELOW the renewal maximum, and \\|B_N\\| sits at 0.0245 to 0.7436 of the null and is exactly zero at s = 1.75 where the null predicts 6.5262e+5 empty windows; so no heavy-tail mechanism for a super-linear G2 exponent exists at any computable level, the identity G2 <= N + \\|B_N\\| is proven but degenerates to G2 <= N on this grid, and the sifting onset is flat at 1.63 to 1.70 against a sieve bound f2 that is zero everywhere the grid reaches. | 0 | [gap-spectrum-01.md](history/staging/gap-spectrum-01.md) |\n| `Q-gate-multiplies` | ANSWERED | Does \"the gate multiplies\" close the entire u-frame recursion branch, or only the merge chain? | Only the merge chain and one relative of it: the no-fixed-point argument does not reach TODO 0b at all, though 0b is wrong as stated for an unrelated reason and the error is a factor of ln u; what survives is the copy theorem for maxsum (VERIFIED 40 of 40), which needs a residue-deleted maxsum bound that does not pass through a kill count. | 0b | [gate-multiplies.md](gate-multiplies.md) |\n| `Q-gate-repair` | ANSWERED | Were the verify-the-verifier repairs landed with the gate ending fully green? | COMPLETE: node research/qc.js --full reads FULL GATE PASSED at the close, TOTAL 0 across the 11 checks, selftest 39 known positives firing and 32 controls silent, audit-numbers 246/246, and no bound tail left amber. | none | [gate-repair-finale.md](history/staging/gate-repair-finale.md) |\n| `Q-global-cutoff-averaging` | PARTIAL | Does the wider corpus suggest changing the global decomposition before extending the small-cofactor estimate, and can that change be made without an unpaid transition or outside term? | Derived: independently averaging the two initial Mobius cutoffs over fixed exponent intervals gives S=C2*x+sum G_L(n)G_R(n-2)+O_A(x/log^A x), uniformly on dyadic scales, with all cofactor and prime-power branches included. Each full G has squared norm O(x log x). The existing sharp-corner lower norm then forces cancellation between the corner coefficient and the rest at the same input. This does not estimate their shifted product. The global signed residual was already O(x) by the sieve upper bound and positivity; the new norm representation is not an improved signed bound. Prefer a bounded attempt on this global coefficient pair and a one-sided consumer; the twin margin remains OPEN. | C | [global-cutoff-averaging.md](global-cutoff-averaging.md) |\n| `Q-global-factor-signs` | PARTIAL | Which full factor configurations cause negative global products, can prime-power exceptions be paid, and does a pair-trigger upper bound control the negative part? | Derived: G_i(n)=Lambda_(>W_i)(n)-F_i(s_i(n))*log t_i(n)-E_i(n), with all small-prime factors in s_i and all primes of t_i exceeding W_i. The correction is supported on a small-prime power exceeding W_i; its full shifted effect is O_epsilon(x^(39/40+epsilon)). After also paying proper prime powers, the residual is a composite-filtered signed smooth/rough cofactor sum. A ten-small-prime cell has F=-84 although every pair lies below a, refuting the proposed pair-trigger majorant. Prime filters contribute explicit terms when bounding the negative part; dropping them is an upper bound, not an identity. No scale-x signed improvement or twin margin follows. | C | [global-factor-signs.md](global-factor-signs.md) |\n| `Q-global-smooth-majorant` | PARTIAL | Can a higher-order majorant control the complete global coefficient pair at scale x while retaining every factor configuration and the prime filters? | Derived using the corrected Henriot upper theorem: a C3 probability average of the same admissible initial cutoffs gives a full residual with sum \\|Ghat_L(n) Ghat_R(n-2)\\|=O(x). The three-smallest-prime majorant has bounded harmonic mass and meets the source growth class uniformly, despite not being multiplicative. All prime-power exceptions are paid. This replaces the O(x log x) absolute budget for the earlier logarithmic profile by O(x) for a different admissible profile representing the same signed residual to arbitrary logarithmic precision. The implied constant is not compared with C2 and no improved signed lower bound or twin margin is supplied. | C | [global-smooth-majorant.md](global-smooth-majorant.md) |\n| `Q-greedy-oracle` | ANSWERED | Is the corrected greedy a G2 oracle? | ORACLE ESTABLISHED, 13 of 13 exactly-known terms hit with minimum ratio 1.0000, so the greedy RULE is an exact solver where the answer is checkable at x <= 41; the rider matters more, the search budget needed grows 3.31x per additional prime and two objects whose truth reaches further show the same estimator's fidelity DECAYING, so nothing is established for the greedy AS RUN on the ladder. | 1b (retired) | [greedy-oracle-validation.md](history/staging/greedy-oracle-validation.md), [phase1-T1-greedy-oracle.md](history/staging/phase1-T1-greedy-oracle.md) |\n| `Q-grouped-divisor-moment` | ANSWERED | Does the full gcd-normalized moment proposed by the literature audit hold, and what exact portion of the twin-prime remainder does it control? | The proposed moment is derived from classical completion with all coefficient sectors and uniform twists included. Full rectangles are controlled when delta<19/25 and delta+3nu<161/100, in addition to the preceding region. A concrete extra cut d<=floor(x^(151/200)), de^3<=floor(x^(321/200)) controls the entire d~e~x^(2/5) benchmark and leaves an explicit smaller-domain endpoint remainder. The uniform product threshold stays below 19/25. At delta=8/25,nu=9/20, the next deficit is confined to small-common-divisor nonzero kernels; their required saving and the global twin margin remain OPEN. Finite validation does not prove asymptotic rates. | C | [grouped-divisor-moment.md](grouped-divisor-moment.md) |\n| `Q-growth-law` | ANSWERED | What does G2(x#) actually grow like? | MEASURED about 0.762 * x ln^2 x * lnln x over x = 11..79 (18 terms, ten log-linear families AICc-ranked), with the honest statement being the band and not the winner; the pure power law is excluded against a control that knows its own answer, and G2/h costs one further logarithm. | none | [attack-growth-law.md](history/staging/attack-growth-law.md) |\n| `Q-h2-extension` | CLOSED | Is extending A288815 (h2) past its 21 terms the high-value computation it was taken for? | No, on both halves, and it is recorded in OUTCOMES.md as WITHDRAWN: term 22 is a roughly four-year single-thread computation for the specialists' own tuned code, all three cheaper proxies fail downward and growing (the direction that fakes a smaller exponent), and the control measured one extra term moving a ten-term exponent fit by 0.022. | none | [h2-scoping.md](h2-scoping.md) |\n| `Q-handoff-review-0906` | ANSWERED | Does the handed-back arithmetic campaign survive an independent check of its main regional estimate and the conclusions used to choose the next research direction? | The bounded handoff audit is completed in reports 20 and 21: the checked local reduction and regional mechanisms survive, named source statements were verified, and the consumer, corner support, rate, shrinking-margin and identity-piece overclaims were corrected. Joint Cauchy is now priced and adds no region. The multiplicative band transfer has a separate PARTIAL owner with a weaker continuous-scale payoff. Imported deep theorems remain imports; this is not corpus-wide certification or a twin margin. | C | [handoff-review-0906.md](handoff-review-0906.md) |\n| `Q-hawkins-read` | ANSWERED | Does the Hawkins random-sieve tradition, read at source, hold a two-class variant, a stage-to-stage moment identity, or an answer to the analogue question? | NOT FOUND for a two-class or k-residue variant; the moment identity is found in the null and not in the fold; and the tradition raises the analogue question repeatedly and answers it only as a missing constant. Two primaries stayed paywalled, so the absence claims rest on the rest of the bibliography. | none | [hawkins-read.md](history/staging/hawkins-read.md) |\n| `Q-head-remainder-0830` | PARTIAL | Does the 5.3 percent remainder that Hardy-Littlewood leaves in the head's endpoint deficit Delta = 2 - beta derive by a route that is not HL: the frozen-sieve first-survivor object, a level-of-distribution correction, or the exact tile-ensemble head? | No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2. | Z4 | [attack-0830-head-remainder.md](history/staging/attack-0830-head-remainder.md) |\n| `Q-head-residual` | PARTIAL | What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive? | h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63. | Z4 | [head-residual-factor.md](history/staging/head-residual-factor.md), [head-residual-hl3.md](history/staging/head-residual-hl3.md), [head-residual-null.md](history/staging/head-residual-null.md) |\n| `Q-heath-brown-edges` | ANSWERED | Does the a=1 edge, and hence the corner S_0, come from the particular two-cutoff Vaughan identity in prime-detection-spec.md and shifted-prime-decomposition.md, or does an equivalent edge reappear under Heath-Brown's identity and the other standard decompositions of Lambda? | The exact identities and exponent simplex leave a=1 in separately bounded formal pieces, including Heath-Brown's balanced j=K configuration. This does not prove an intrinsic edge after identity-piece cancellation. The bounded-cofactor object has affine dilations, not literally F(n)F(n-2). Linnik's fixed truncation has a large term-wise absolute tail by an elementary counting proof; its signed tail is not thereby bounded below. Heath-Brown K=3 narrows the classical split band, with coefficient and Type I normalization obligations retained. No full alternative reduction, new region or twin margin follows. | C | [heath-brown-edges.md](heath-brown-edges.md) |\n| `Q-history-dial` | ANSWERED | Does revealing the scour primes' classes concentrate the floor on a bounded set of strike locations, and what is the history dial worth? | Disconfirming: the class axis is linear at 2.90 survivors per prime read, so no bounded set of strike locations carries the floor, and the touch-count ceiling is proven and tight; deliverable (1) of the brief already existed as canonical state (the forcing ladder 16 -> 45 at @11), so nothing new was bought there. | A | [attack-history-dial.md](history/staging/attack-history-dial.md) |\n| `Q-hm-basis` | ANSWERED | Does the u_sup divergence survive the change to the natural (h,m) basis? | It survives: the two bases are nested rather than rivals, the natural one is the outer and weaker member, and the gap between them is a flat factor of 7.26 across nine levels, so the divergence that closed u_sup runs in both bases. | none | [attack-hm-basis.md](history/staging/attack-hm-basis.md) |\n| `Q-holt-2605` | ANSWERED | Does the fifteenth Holt manuscript, arXiv:2605.19165, contain anything that touches our record? | No: it carries no twin, no max-gap bound and no G2, its \\|s\\|/2 threshold restates the 2603.25915 / 1408.6002 inequality, and the interaction check is negative, our extinction law diverging from his by a factor 396 across three decades of W; the sweep is now complete at fifteen of fifteen. | none | [holt-2605-sweep.md](history/staging/holt-2605-sweep.md) |\n| `Q-hsub-reductions` | PARTIAL | Can (H-sub) be proven or refuted, and what does the fold machinery reach? | Neither, but the statement is smaller: three reductions of the hypothesis are proven, the lemma consuming only power pairs so that it weakens to (H-sub-pow) with the conclusion unchanged, the fold machinery's inability to reach any of them is made exact, and the hunt over all 111 reachable pairs found no drifting family and no counterexample. | 1d | [attack-hsub-01.md](history/staging/attack-hsub-01.md) |\n| `Q-hsubpow-K` | CLOSED | Can (H-sub-pow) be proven with an explicit K in the legal zone? | NO by three mechanisms: the CRT lift (K* >= pi(y') - pi(y) diverges), anchored caps (diverge at every base), Iwaniec at two classes (it IS beta2-note); TODO 1d's legal zone is mis-stated, the trusted zone is [1.3946, 11.3568). | 1d | [hsubpow-explicit-K.md](history/staging/hsubpow-explicit-K.md) |\n| `Q-hsubpow-K-0829n` | OPEN | Can (H-sub-pow) be proven with an explicit K inside the trusted legal zone [1.3946, 11.3568) by a mechanism the 2026-08-28 pass did not close? | No K is proven at any base; the single open inequality is the uniform-in-k ratio cap G(b^(k+1))/G(b^k) <= e^K G(b), which is a proof gap at a fixed base and a possible truth gap across bases, since for any law G ~ c n^beta (ln n)^delta the all-bases hypothesis holds with finite K if and only if delta >= 0. | 1d | [attack-0829n-hsubpow-K.md](history/staging/attack-0829n-hsubpow-K.md) |\n| `Q-hybrid-bound` | CLOSED | Does an exactly-handled head of small primes plus a sieved tail improve the certified exponent? | The glue closes and is a real theorem, and it buys one factor of 1.93 in x and nothing asymptotic: the window where the bound beats 4.2665 widens from x <= 227 to x <= 439 and never returns, the head can only reach x0 = O(ln x), and the literal glue the brief named (A144311 as base case) is dead on a type mismatch. | none | [attack-hybrid-bound.md](history/staging/attack-hybrid-bound.md) |\n| `Q-identifications-prior-art` | ANSWERED | Who owns the three identifications that were banked without a prior-art search? | All three are OWNED in their conventions: the complementary-window duality, maxsum_m as the largest m-spacing of a scan statistic, and the alternation language as a textbook charge constraint; the exponent law H = a + b ln D and the H* Shearer-threshold ladder come back NOVEL-SO-FAR on four calibrated channels. | none | [identifications-prior-art.md](history/staging/identifications-prior-art.md) |\n| `Q-import-bfree` | ANSWERED | Does the ergodic theory of B-free systems - Mirsky measures, Toeplitz structure, tautness, heredity, entropy - say anything about the twin comb? | It lands as an exclusion: the comb is exactly the object the field's newest generalisation is built for and that generalisation names the comb's own regime as the one it declines to study, the limit comb is the single point {-1} so every ergodic statement about it is vacuous, and the yield is a corrected address for the walls plus one live external open problem. | none | [import-bfree.md](history/staging/import-bfree.md) |\n| `Q-import-boolean-analysis` | CLOSED | Does the analysis of Boolean functions reach the anchored bias? | Five things that had to hold do not, starting with the product space eating the statement worse than C^pi(x); the forced degree saturates at 2 and the globality hypothesis fails at q1, so the row supplies a wall address rather than a route, and every figure is SCRATCHPAD-GRADE and may not be quoted until re-derived inside an embedded producer. | none | [import-boolean-analysis.md](history/staging/import-boolean-analysis.md) |\n| `Q-import-bridge` | CLOSED | Do Ojaroudi's Bridge and collision lemmas certify a number the corpus lacks? | Both lemmas are true and both proofs go through in three lines here, and the answer to the question the import was raised for is no: the certified-number verdict is zero by an identity rather than by a margin, and the per-prime nature is what stops it. | none | [import-bridge.md](history/staging/import-bridge.md) |\n| `Q-import-bridge-prereg` | SUPERSEDED | Do Ojaroudi's two elementary lemmas, imported onto our tile, beat the incumbent per-prime discrepancy numbers? | Pre-registration only, sealed before any number was computed: the predictions, the incumbents, the win condition and five declared traps are fixed here, and the null result is the expected result because P4 is an identity; the outturn is import-bridge.md. | none | [import-bridge-prereg.md](history/staging/import-bridge-prereg.md) |\n| `Q-import-chaining` | CLOSED | Can Dudley's entropy bound or Talagrand's generic chaining beat the union bound over positions on the maxsum law? | No, and the reason is geometric rather than probabilistic: the entropy integral of the true increment metric is already 1.054-1.099 times rms*sqrt(2 lnW) at its lower branch and 1.484-1.545 at its upper, flat across z = 13..23, so chaining's ceiling with a perfect universal constant sits below the union bound's floor; the honest constant-carrying chain measures 2.878 to 3.027. | 0c | [import-chaining.md](history/staging/import-chaining.md) |\n| `Q-import-distortion` | CLOSED | Does the distortion method of covering systems speak at two classes per modulus, and what does it certify on the window? | It does speak at two classes, and the row's expected blocker was the wrong one: its economy sum 4/p^2 converges (sup 0.364545) where the union bound's sum 2/p dies at x = 13, but it charges in ambient length, its measures living on a CRT product so the certified window is at least a primorial and the only published bridge back to an interval is exponential in the number of progressions. | none | [import-distortion.md](history/staging/import-distortion.md) |\n| `Q-import-distortion-prereg` | ANSWERED | What does the distortion method certify on our window, and does it speak at one class per modulus or at two? | Sealed before any line of the producer existed; scored in import-distortion.md, where the deciding question comes back opposite to the row's expectation: BBMST's criterion carries no distinctness, multiplicity or minimum-modulus hypothesis, so the method speaks at two classes and the one-versus-two-class wall is not its wall. | none | [import-distortion-prereg.md](history/staging/import-distortion-prereg.md) |\n| `Q-import-entropy-decrement` | CLOSED | Does Tao's entropy decrement argument, the one place a parity-type obstruction was circumvented for a two-point correlation, transfer to the tile's census? | It does not: the engine runs on multiplicativity at small primes and the census is defined by the absence of small prime factors, Tao scopes twin-prime sums out himself in print, and the census sits on the structured side of the pretentious dichotomy; all figures SCRATCHPAD-GRADE. | none | [import-entropy-decrement.md](history/staging/import-entropy-decrement.md) |\n| `Q-import-fracparts` | ANSWERED | Does Saffari-Vaughan Theorem 10 cover the branches carrying the Skeleton door's mass? | Prediction HIT: the covered branches carry at most 8 percent of the mass; anchor and a sharper wall-address banked; the THEOREM column is struck, not merely overpriced, because Theorem 10's range condition is x^{6/11+eps} < y, which fails at fixed M; no route; no cap-36 line is upgraded. | 4 (retired) | [import-fracparts.md](history/staging/import-fracparts.md) |\n| `Q-import-hypergraph` | MIXED (import-hypergraph-prereg.md: OPEN; import-hypergraph.md: ANSWERED) | Does hypergraph covering (Pippenger-Spencer / FGKMT) apply to the adversary's construction? | The covering theorem is class-count-agnostic and the analogy is EXACT at the hypothesis level, leaking at exactly one named place, the edges the machine needs as input; Branch A landed a theorem-provenance lower bound G2(x#) >> x ln x (HELD), Branch B died as predicted with a sharper wall than the registered one, and none of the three pre-registered kill lines fired. | none | [import-hypergraph-prereg.md](history/staging/import-hypergraph-prereg.md), [import-hypergraph.md](history/staging/import-hypergraph.md) |\n| `Q-import-interp` | ANSWERED | Does the Bayati-Gamarnik-Tetali interpolation method reach the G2 Fekete object? | No: BGT closes on hypothesis H1, since the constraint count never splits (pi(st) - pi(s) - pi(t) is zero at no pair with st >= 25, minimum 2, maximum 12, VERIFIED on 104 pairs), and the one coordinate that does split has limit +infinity; the row lands as WALL-ADDRESS plus the identity that the submultiplicativity defect is the Overshoot slack. | 1d | [import-interp.md](history/staging/import-interp.md) |\n| `Q-import-interp-prereg` | SUPERSEDED | Does the interpolation method (Bayati-Gamarnik-Tetali, Proposition 5) transfer to the G2 ladder, and in which coordinate? | Pre-registration only, committed alone before any producer existed, with the source verified at page images first (Proposition 5 is a special case of de Bruijn-Erdos, by the authors' own attribution); the predictions and the meaning of each outcome for the map are fixed here, and the outturn is import-interp.md. | none | [import-interp-prereg.md](history/staging/import-interp-prereg.md) |\n| `Q-import-kw-zonegap` | ANSWERED | What does the graded Kourbatov-Wolf row buy the Z2 programme, and does the flagged 0.7574 against 0.7504 agreement corroborate anything? | A split-cell circularity verdict: the trend formula's raw performance is real, G/Tbar inside [0.78, 1.05] over thirteen decades with zero fitted parameters, but the flagged agreement is adjudicated a range accident, and since Theorem occurs zero times in the source the row can only be priced PUBLISHED-ANCHOR plus WALL-ADDRESS, whose wall is a quantifier: an almost-all over a log-sparse record sequence cannot deliver an every-zone statement. | none | [import-kw-zonegap.md](history/staging/import-kw-zonegap.md) |\n| `Q-import-l1l2` | CLOSED | Does an l1 -> l2 conversion on the (e,a) coefficient sum buy the needed sqrt(log)? | The pre-registered kill line (rho >= 0.5 at every level) does NOT fire, rho falling 0.4352 to 0.0645 at z = 13..41, and the programme dies anyway on what the decay measures: \\|\\|Theta\\|\\|_1/\\|\\|Theta\\|\\|_2 grows by 2.01 per added prime against 2.0516 for S_sat, so the l1/l2 gap is not a proxy for the C^{pi(z)} price, it IS that price; rows 5 and 6 retire together. | none | [import-l1l2.md](history/staging/import-l1l2.md) |\n| `Q-import-l1l2-prereg` | CLOSED | Does the l1 to l2 conversion on Theta_e(a) reach the threshold the import map set? | Sealed before any number was computed; scored in import-l1l2.md, where the pre-registered kill does not fire and the programme dies anyway: rho falls monotonically from 0.4352 to 0.0645 over z = 13..41, never reaching the map's 0.5 line, and what the conversion outputs is the sharp maximal law. | none | [import-l1l2-prereg.md](history/staging/import-l1l2-prereg.md) |\n| `Q-import-map` | PARTIAL | Which foreign mathematics is worth aiming at this object, and what did each landed import actually buy? | Nineteen landings, zero routes opened on the exponent; every one banked a proven identity, a derived constant, a published anchor or a wall address, which is why payoff is graded by TYPE rather than by probability, and the map is live with rows still unrun. | none | [IMPORT-MAP.md](IMPORT-MAP.md) |\n| `Q-import-map-construction` | ANSWERED | What was searched, what was rejected, and at what verification level, in building IMPORT-MAP.md? | The reconnaissance record behind the map: candidates rejected with reasons (hypergraph containers for want of a supersaturation input; determinantal processes by a proof-level obstruction, the twin tile failing the pair inequality at d = 6), a per-attribution SOURCED / SOURCED-BIB / MEMORY ledger, and two results derived here and offered for adjudication. | none | [import-map-construction.md](history/staging/import-map-construction.md) |\n| `Q-import-maxplus` | ANSWERED | Do max-plus (tropical) spectral theory and subadditive ergodic theory bound the fold recursion's growth exponent? | The mapping is exact rather than an analogy - the fold is p-fold cyclic duplication followed by max-plus state elimination and the copy theorem is a semiring identity, verified at 6 of 6 folds - but the tropical Perron root of the tile is the mean gap mbar, not G2, so the import delivers a structural negative, a sharpening of A5's Theorem A, and refuses the growth exponent. | none | [import-maxplus.md](history/staging/import-maxplus.md) |\n| `Q-import-proof-complexity` | CLOSED | Does proof complexity supply the barrier that wall-note Face 4 wants? | The row is VOCABULARY-ONLY and is recommended for rejection at the gate: the shared word is parity naming two different objects, a degree bound is a pseudo-expectation whose finite exact instance the corpus already refuted, and any unconditional barrier would imply Siegel-zero finiteness; the payoff is Tao and Brady 2014 read at source as a published anchor and a wall address, not a theorem. | none | [import-proof-complexity.md](history/staging/import-proof-complexity.md) |\n| `Q-import-repulsive` | CLOSED | Does any repulsive point-process model (determinantal, Coulomb gas, hyperuniform) reproduce the twin tile's sub-Poisson counts? | NO, two-sided: g(2) = 0 kills positively-associated models and g(6) = 2.66 (g never in (0,1); support 6 \\| d, g >= 2.38) kills Hermitian determinantal and negatively-associated ones; the Gibbs extension is withdrawn; every fixed level is periodic hence class I hyperuniform and the statement is empty, while along the diagonal family L = y^u no member approaches a hyperuniform limit in Var/E, which is a statement about the family and not a class for any one tile; the determinantal row's quoted product evaluates to 0 and its obstruction distance is 6 not 2. | none | [import-repulsive.md](history/staging/import-repulsive.md) |\n| `Q-import-rough-anatomy` | ANSWERED | Does the analytic theory of rough numbers derive the depth law's drift, and is u = 2 a singular point of the dimension-2 sifting functions? | SCRATCHPAD-GRADE throughout, and leaning on three never-red-teamed premises: the drift is derived to 0.16 per cent by exact Mertens products and NOT by any published next-order term (the one in print is the wrong term for this object), and u = 2 is one identity seen four times rather than a singular point of the dimension-2 sifting functions. | none | [import-rough-anatomy.md](history/staging/import-rough-anatomy.md) |\n| `Q-import-rows-15-17` | ANSWERED | Which three new fields deserve import-map rows, and at what price? | Row 15 is a wall address and a published anchor and NOT a theorem, since Theorem 10 requires x^{6/11+eps} < y and fails at every fixed M; row 16 is stale, its experiment already executed by record-location-null.md and its prior-art half closed by lit-kourbatov-shortfall.md; row 17 lands as priced; six fields rejected with pointers and one promoted to row 17. | none | [import-map-rows-15-17.md](history/staging/import-map-rows-15-17.md) |\n| `Q-import-scanstat` | ANSWERED | Does the extreme-value theory of scan statistics settle the disputed sqrt(m) claim of IMPORT-MAP row 1? | The identity offered for adjudication is true and its conclusion is false - Sum gamma(k) = 0 is trivial while the step to Var(S_m)/m tending to 0 is refuted by a free permutation counterexample - the Leadbetter half of the row is confirmed as written and the pre-registered kill criterion passes at both target levels, one of them blind; the adversary pass corrected the claim that T29 had never been computed here to a reproduction. | none | [import-scanstat.md](history/staging/import-scanstat.md) |\n| `Q-import-scanstat-prereg` | OPEN | What is the maxsum exponent at T_23 and T_29, predicted from a T_13/T_17/T_19 fit before the run? | Machine-written pre-registration only: the extrapolation laws, the grid and the kill criterion (Model A must beat Model B on the ln-RMS of excess_m at T_23) are fixed before any scoring, so part 4 cannot be scored against a prediction chosen after the fact. | none | [import-scanstat-prereg.md](history/staging/import-scanstat-prereg.md) |\n| `Q-import-shearer` | ANSWERED | Where does Shearer's region actually end for the fold read as a repulsive lattice gas? | SURVIVES WITH CORRECTIONS under the 2026-08-19 adversarial pass: the complete-graph identity is verified by independent-set enumeration at n = 2..8, H* = 35..481 reproduce exactly and the 2/sqrt(e) floor is sound, but the tightness witness's disjoint-intervals sentence is false exactly where invoked and the atomicity lemma's hypothesis is load-bearing and not shown, the closure surviving instead on the sequel's gamma_i >= mu(f_i). | none | [import-shearer.md](history/staging/import-shearer.md) |\n| `Q-import-shearer-prereg` | ANSWERED | Where does Shearer's region actually end on the repulsive lattice gas model of our window? | Sealed before any line of the producer existed; scored in import-shearer.md, where the exact criterion says the local lemma is the union bound on a complete dependency graph, and the two levels it buys over the local lemma's own sufficient condition are the only thing it buys. | none | [import-shearer-prereg.md](history/staging/import-shearer-prereg.md) |\n| `Q-import-sofic` | ANSWERED | Does constrained coding and symbolic dynamics identify the Alternation Lemma's shift, and does the import map's shape claim survive? | The identification is exact and better than the map states - the shift is strictly sofic, two states, four edges, Perron root exactly 2, and the graph's own per-step rate is 2/p rather than the 3/p the map divides by - and the pre-registered ratio test then kills the map's literal formula while the graph-corrected one survives only as a small-D transient spent by fold 37; the shape claim does not stand, and it fails in the corpus's favour. | none | [import-sofic.md](history/staging/import-sofic.md) |\n| `Q-import-sofic-prereg` | OPEN | Does the constrained-coding presentation of the fold predict the exact per-fold L, and is the shift sofic? | Pre-registration only, and declared weaker than the G2(41#) case because the nine exact L values were already published in the corpus: what is fixed here is the estimator, the exclusion rule, the trend statistic and the kill thresholds, plus a soficity verdict written before the check, strictly sofic and not of finite type. | none | [import-sofic-prereg.md](history/staging/import-sofic-prereg.md) |\n| `Q-import-stein` | CLOSED | Does Stein's method for Poisson approximation derive the extinction law's constants and the ~3.8 joint deficit? | The pre-registered kill fires at both targets for one structural reason: each object is driven by exactly one shared uniform draw, so the non-neighbourhood indicators reconstruct it and b3 climbs to its own ceiling, measured at 0.850 to 0.9998 of that ceiling and 200 to 800 times b1 + b2; with no error term there is no Stein derivation, and the first-moment arithmetic banks the (A, c) pair anyway, relabelled. | none | [import-stein.md](history/staging/import-stein.md) |\n| `Q-import-stein-prereg` | CLOSED | Does Stein's method for Poisson approximation bound the extinction law or the ~3.8 constant? | Sealed before any producer ran; scored in import-stein.md, where the pre-registered kill criterion fires at both targets for one structural reason, that both objects are driven by exactly one shared uniform draw, which is precisely the dependence the b3 term measures. | none | [import-stein-prereg.md](history/staging/import-stein-prereg.md) |\n| `Q-import-suen` | ANSWERED | Do Suen's inequality, Janson's inequality and the Lovász Local Lemma family supply the missing proof for the anchored delta? | No inequality can: the import lands and what it certifies is that the target was never a lemma, the NOT-REACHED item being the Twin Prime Conjecture wearing a percentage; what it does deliver is the constant in the sharp form and the wall's address in local-lemma coordinates. | none | [import-suen.md](history/staging/import-suen.md) |\n| `Q-import-thinning` | ANSWERED | Do point-process thinning and interval coalescence give H'' a null model? | Yes and exactly: the fold recursion is an exactly solvable thinning whose gap pgf transforms by a Mobius map fixing 0 and 1, so under independent thinning the gap word of T_x is exactly geometric with mean mbar/6 at every rung with no error term, which turns both of the record's fitted parameters into derived ones. | 0b | [import-thinning.md](history/staging/import-thinning.md) |\n| `Q-import-transference` | CLOSED | Does the transference principle and relative Szemeredi theory reach the twin pattern? | VOCABULARY-ONLY and closed by an exclusion in print: the founding paper names our configuration as out of scope in one printed sentence, the theorem degenerates at k = 2 which is the case we want, and the W-trick removes the tile before the argument starts; re-entry costs a finite-complexity system whose solvability implies the Zone Postulate. | none | [import-transference.md](history/staging/import-transference.md) |\n| `Q-import-vc-nets` | CLOSED | Does VC dimension, epsilon-net or set-cover duality bound G2? | VOCABULARY-ONLY, at a self-set 0.2 per cent confidence of opening the 4.2665 -> 2 gap and with every number SCRATCHPAD-GRADE: the range space's VC dimension is small and its growth is O(log log L) (proven), but the dual shatter function is exponential, the interval formulation's hypothesis contains its conclusion, and the full-period formulation is clean, free and on the wrong side of the inequality. | none | [import-vc-nets.md](history/staging/import-vc-nets.md) |\n| `Q-ioslack-survey` | CLOSED | Does any instrument in the corpus carry a sharp-level signature that would let the infinitely-often slack be spent? | None does: 23 instruments surveyed and 19 eligible, smallest per-instrument p_FWE = 0.1082 and 0.8865 after Šidák, so dial 4's fourth channel closes and the dial is finished; the second finding is that maxsum_{L+1} is sharp exactly when L = 1. | 0e (retired) | [ioslack-survey.md](history/staging/ioslack-survey.md) |\n| `Q-joint-correction-source-audit` | ANSWERED | Does completing the supported prime-partner correction yield cancellation beyond the existing Vaughan reduction, and which literature inputs actually justify that completion? | CHECKED prior-art matches for subset convolution, complementary sieve sums and signed smooth-number distribution. DERIVED reconstruction identifies the unrestricted factor weight with an existing short divisor approximant, up to the paid prime-power error. Its supports are x^(12/25) and x^(1/10). Reassembling the entire joint correction returns the already-open Vaughan remainder and supplies no new signed bound. A formal factor-vector control distinguishes the unrestricted logarithmic weight from the selected prime-cofactor branch. The matched general sieve theorems require inputs not supplied here. Literature novelty is unestablished; twin infinitude remains OPEN. | C | [joint-correction-source-audit.md](joint-correction-source-audit.md) |\n| `Q-joint-factor-estimate` | ANSWERED | Can an additional estimate for actual factor configurations control the full signed balance of the C3 residual? | DERIVED: for the single-large-prime delta-rough family F, the residual splits exactly as R_F = C2*x*H_delta - Z_F^p + o(x), where the Type I part C2*x*H_delta is evaluated by ordinary prime BV on each cofactor interval and the twisted Mobius constant 2C2 (corrected 2026-09-08 after V2: Wu Lemma 2.3 is squarefree-only and did not cover the non-squarefree b_R moduli; prime BV covers all moduli), and Z_F^p is the signed prime-partner sum. The complement carries the opposite Type I part -C2*x*H_delta, so grouping by factor configuration transfers Type I mass and leaves the twisted prime correlation B_L unchanged. With the matched upper sieve the family bound is C2*x(1+H_delta-(40/9)H^+), certified below -2/5 C2*x: INSUFFICIENT BOUND. Even a sieve constant 2 in place of 40/9 needs H^abs<1 and leaves the complement unpaid. Independently reviewed 2026-09-09 with the uniform delta-range and complement corrections below. Twin infinitude and every sufficient margin remain OPEN. | C | [joint-factor-estimate.md](joint-factor-estimate.md) |\n| `Q-k4direct-swap` | ANSWERED | Does swapping the shipped Monte Carlo estimator for k4direct meet the @13 gate, and is the x3600 on record a speedup? | The swap meets the gate by x3632, but the margin on record is an ACCURACY margin and not a speedup: k4direct is a 4x to 8x SLOWDOWN, 93.5 s against 11.7 to 23.4 s, and the 198.9 s on record for it is 2.1x too expensive, which drags the @17 extrapolation from 8.5 days on ten cores to about 4.4. | none | [verify-k4direct-swap.md](history/staging/verify-k4direct-swap.md) |\n| `Q-kappa-not-L` | CLOSED | Can L, or its generalisation kappa(m), be bounded well enough to be the route's target? | L is not the target: three bounds on L are PROVEN through the Alternation Lemma and transfer to kappa(m), but the wall is located precisely and the lower bound never becomes exact, so L cannot be made irrelevant; closed 2026-08-19, L has no law of its own, being G2 divided by the block's own spacing and super-additive on disjoint sets. | none | [kappa-not-L.md](kappa-not-L.md) |\n| `Q-kernel-sign-control` | ANSWERED | At delta=8/25, nu=9/20, is the moment Mfrak and its small-common-divisor kernel X_small measurably smaller with the actual coefficient b_u=A_right(gu) than with \\|b_u\\| or with \\|b_u\\| times an independent seeded random sign, and does the actual/random ratio decrease with x over the feasible dyadic range? | MEASURED, negative. Over seven dyadic scales j=18..30 and four boxes, the pre-registered slope of log2(actual/random) for X_small has mean + sd >= 0 in all four families, so the run gives no heuristic support for extra Mobius-sign cancellation in the small-j kernel. The actual coefficient's \\|X_small\\| ranks like one more random draw. The measurement is weak where it matters: the finite moment is 97.66-102.58 percent equal-frequency class, X_small carries 0.02-2.88 percent, J0=floor(x^(1/20)) is 1 at j=18 and 2 at j=20..30, and Z=2 collapses the prime-power sector of (13) to r=2. Equation (21) and the global twin margin remain OPEN and untouched. | C | [kernel-sign-control.md](kernel-sign-control.md) |\n| `Q-kk-substitution` | ANSWERED | Does the Kalmynin-Konyagin construction survive substituting the two-class set Omega_p = {a_p, a_p - 2}, and what lower bound does it give? | STANDS WITH CORRECTIONS: G2(P(y)) >> y (ln y)^3 (lnlnln y)^2 / (lnln y)^4 for y >= y0 survives every attack made here, including an exhaustive brute force of the Proposition itself over four million values of i; five corrections follow and none touches the exponent. | none | [attack-kk-substitution.md](history/staging/attack-kk-substitution.md), [verify-kk-substitution.md](history/staging/verify-kk-substitution.md) |\n| `Q-klz-forward-walk` | ANSWERED | Does the forward citation graph of arXiv:2205.08273 hold a two-class or k-class complexity result, and is Part II out? | The forward graph has exactly one member on three independent indices and it never treats word complexity; no citing work goes beyond one class per prime, Part II is NOT OUT as of 2026-08-19, the owning convention was OEIS A023192 all along, and the comparison is APPLES-TO-APPLES so the exponent-shape sentence needs no heredity caveat. | none | [klz-forward-walk.md](history/staging/klz-forward-walk.md) |\n| `Q-kstar-drift` | ANSWERED | Is the drift in K* across doubling steps structural, and how far past the scannable levels does the certificate reach? | Structural and it lands early: K* is now enumerated at 16 doubling steps against 11, the raw drift slope steepens from 0.6881 +/- 0.1328 to 0.8184 +/- 0.0908, and the period-free certificate touches K*+1 = 18, 93.5% of 2^beta2 = 19.2455, at the base-2 chain step s = 16 itself. | none | [attack-kstar-01.md](history/staging/attack-kstar-01.md) |\n| `Q-kstar-prereg` | OPEN | What is K* at the three next doubling steps, predicted before any period walk? | Pre-registration only, committed alone: the predictions, the scoring rule and the growth-type verdict thresholds are fixed in advance, with the inclusion-exclusion engine validated against an independent scan engine on all eleven known steps first. | D | [attack-kstar-01-prereg.md](history/staging/attack-kstar-01-prereg.md) |\n| `Q-l1-residue` | CLOSED | Is the L = 1 residue count an open counting hypothesis whose proof would deliver the Zone Postulate? | REFUTED as a hypothesis: restore the dropped L >= 2 terms and it IS the Zone Postulate, so the chain is a tautology, and leave them out and what remains is provably no stronger than the target; Lemma A (inside B(p) the residue condition is the kill condition) is PROVEN and VERIFIED at 237 folds, and the route lands back on the residue-deleted maxsum without advancing it. | none | [attack-l1-residue.md](history/staging/attack-l1-residue.md) |\n| `Q-lambda-ledger` | CLOSED | Does parity information survive in the lambda-weighted fold ledger? | REJECT, against a pre-registered threshold fixed before the producer existed: the lambda multiplier exists and is parity-free, so the ledger is blind at its design point rather than at its margins; two columns are pinned by proof, and nothing here is novel mathematics. | Z5b (retired) | [attack-lambda-ledger.md](history/staging/attack-lambda-ledger.md) |\n| `Q-ledger-extraction` | ANSWERED | Can the QC engine's three suppression ledgers be moved out of the checks and into data? | Moved: all three now live in research/qc/ledgers.js, the fast gate and the selftest are byte-identical to their pre-change output, and all 25 entries were verified verbatim against git HEAD by key, order and reason text. | none | [audit-ledger-extraction.md](history/staging/audit-ledger-extraction.md) |\n| `Q-ledger-forced` | ANSWERED | Which properties of the fold ledger's columns are FORCED rather than expected? | Fourteen forced constraints, all identities or wrong-direction bounds; by_new is forced only in the prime gap (its O(1) is MEASURED); nothing forces net from below. | Z5b (retired) | [fold-ledger-forced.md](history/staging/fold-ledger-forced.md) |\n| `Q-left-divisor-signs` | PARTIAL | Can the Möbius structure of the left coefficient A_left(gm) replace the first Cauchy inequality, so that its sqrt(M) loss is not paid, and what does that buy at the target box (delta,nu)=(8/25,9/20) and at the corner a=b=1? | Partly, and not where it is needed. Two lemmas are derived: a Type I bound with no zero-frequency budget, usable at the target box whenever the arbitrary block is shorter than x^(1/4), and a Type II bound that is uniform in the Perron twist heights. Applied to the actual coefficient they confine the target-box deficit to sectors with left prime power r>=x^(43/200) and right prime power q>x^(3/100), and lower the worst block exponent there from 103/100 to 41/40. The corner a=b=1 is untouched: grouped, Type I, Type II, Bettin-Chandee/Wright and even a hypothetical per-block square-root bound all exceed 1 there. No region is added, E_dagger and the consumer (20) are unchanged, and the global twin margin remains OPEN. | C | [left-divisor-signs.md](left-divisor-signs.md) |\n| `Q-lemmaV-meansquare` | PARTIAL | Does the mean-square-in-x form of Lemma V hold, and what does the proof cost? | Proved unconditionally, _H <= B(z,s)*H for every H, z and level s, and the proof stops at exactly one place, B(z,s) bounded: B(z,3.0) measures 1.3833 to 1.4883 at z = 13..37, flat to 8 per cent over the whole computable range, which is a measurement and not a bound. | none | [attack-beta2-01-lemmaV-meansquare.md](history/staging/attack-beta2-01-lemmaV-meansquare.md) |\n| `Q-lemmaV-neighbours` | ANSWERED | What do the five Lemma-V-adjacent instruments give when read at source, and which hypothesis do we violate? | The right instrument is Maynard's Lemma 6.12, owned by Deshouillers-Iwaniec 1982 Theorem 12 and sharpened by Pascadi's Corollary 18 in exactly the term that binds us; the hypothesis violated is narrower and sharper than the corpus expected, since all three papers allow arbitrary rough coefficients in three of five variables and what they require is smoothness where we have none. | none | [lemmaV-neighbours.md](history/staging/lemmaV-neighbours.md) |\n| `Q-lemmaV-usup` | ANSWERED | Does u_sup plateau below beta2, or diverge? | It rises at every added level, 2.0617 at z = 13 to 3.2026 at z = 43: a plateau below beta2 is rejected and so is the fast divergence attack 1 feared, leaving \"plateau above beta2, or divergence\", which for this route is the same verdict (divergence since REFUTED at fixed s by attack-0829n-rml-proof.md section 4.1, adjudicated in verify-0830-usup-convention.md). | none | [lemmaV-sup-extension.md](history/staging/lemmaV-sup-extension.md) |\n| `Q-level-ledger-tight` | PARTIAL | How much of the Level Ledger's 2*3^{pi(x)-1} class-discrepancy bound can be taken back? | The sup-versus-variance gap is not closed, and section 4 shows no L1 Fourier method can close it, since such a bound is already >> 2^{pi(x)} from its own j = 1 term; what replaces the exponent is an exact reduction to one finite quantity, computed by exhaustion to y = 19, and a proven CONSTANT factor 81.0 uniform in x, p and a (53.9 from the cheap y = 17 seed), which does not grow. | none | [level-ledger-tight.md](level-ledger-tight.md) |\n| `Q-lichtman-decomp` | ANSWERED | What is the wall's published constant 3.29956 made of, and is there technique slack a method of this class could spend? | The split is multiplicative, 3.2995525 = 2 x 1.649776 with the second factor an equidistribution deficit, so the brief's \"remaining 1.65 of technique\" has no referent and category (b) is empty; the floor for this class is 2 on Type-I data and still 1.122919 at unlimited level, all arithmetic SCRATCHPAD-GRADE. | none | [attack-lichtman-decomp.md](history/staging/attack-lichtman-decomp.md) |\n| `Q-lit-evans` | ANSWERED | Does Evans, Correlations of almost primes, reach y about x^0.28, does it ever fix h, and is there a secondary term to harvest for the depth law? | None of the three, and the item named the single highest-value unread item in the survey yields nothing for the depth law: over the whole 35-page extraction Buchstab, rough, sifting and omega(u) each occur zero times, so the paper has no sieve-depth coordinate, and its object is E2 numbers, a multiplicative condition rather than a roughness one. | none | [lit-evans.md](history/staging/lit-evans.md) |\n| `Q-lit-fgkt-maier` | ANSWERED | Do the corpus's FGKT and Maier quotations hold against the PDFs of record? | The quotations are VERBATIM where checked, including at the sub/superscript level HTML destroys, and the defects are in the claims built on them: a Buchstab dimension error at four sites, one of them publication-track and self-contradictory, and two provenance errors (the Maier-Pomerance equality form and the FGKT/FGKMT R-statement); Cheer-Goldston was not obtained, so one quotation stays unverified. | none | [lit-pdf-fgkt-maier.md](history/staging/lit-pdf-fgkt-maier.md) |\n| `Q-lit-fkmpt-quotes` | ANSWERED | Do the corpus's FKMPT quotations hold against the journal PDFs of record? | All three quotations are VERBATIM or CONFIRMED and two of the three surrounding claims are supported; the third is not, the cited section 1.3 does not exist (the passage is 1.1) and the connective overreaches, and five corrections are drafted including one silent elision inside a block labelled verbatim. | none | [lit-pdf-fkmpt.md](history/staging/lit-pdf-fkmpt.md) |\n| `Q-lit-halberstam-richert` | ANSWERED | Do the Halberstam-Richert and DHR citations in dhr-verification.md and two-class-lower-bounds.md check out against primary sources? | Mostly reachable, against the brief's expectation: seven claims verbatim against source including beta2 about 4.266 at the book page itself, one UNREACHABLE (HR Corollary 2.4.1), the meaning of DHR and the Friedlander attribution both settled, and 4 defects among 21 further attributions swept. | none | [lit-pdf-halberstam-richert.md](history/staging/lit-pdf-halberstam-richert.md) |\n| `Q-lit-kalmynin-konyagin` | ANSWERED | Do the corpus's Kalmynin-Konyagin citations hold against the PDF of record? | Item 2 is clean, reproducing their Theorem 1 at l_f = 2, h_f = 0, M(f) = 2 exactly; item 1 is MISROUTED, the quote being FKMPT's Definition 1 rather than K-K; and the word twin appears zero times in every version, with the calibration running opposite to expectation, since they delete two or more residue classes per prime and run a dimension-2 Mertens ledger, which our own absence rows still call ABSENT. | none | [lit-pdf-kalmynin-konyagin.md](history/staging/lit-pdf-kalmynin-konyagin.md) |\n| `Q-lit-kourbatov-grob` | ANSWERED | Do the Kourbatov and Grob quotes on which the ZONE-POSTULATE retraction rested hold against the PDFs of record? | They hold: four verification items land VERBATIM against the published article and Grob's three negatives are confirmed, so the retraction was justified and a true claim was not retracted on false evidence; the corpus under-reports Grob in two places. | none | [lit-pdf-kourbatov-grob.md](history/staging/lit-pdf-kourbatov-grob.md) |\n| `Q-lit-pdf-bft` | ANSWERED | Do our Banks-Ford-Tao quotations survive checking against the PDFs of record? | All three quotations VERBATIM, checked by scripted normalised diff rather than by eye; one was misattributed by the brief and not by the document (it is Maier-Pomerance), the demotion resting on their model R stands, and the corrections owed to the record are listed. | none | [lit-pdf-banks-ford-tao.md](history/staging/lit-pdf-banks-ford-tao.md) |\n| `Q-lit-pdf-holt-rudd` | ANSWERED | Do our Holt and Rudd citations survive checking against the arXiv PDFs of record? | Every quotation VERBATIM with no misquotation found, but Lemma 3.1 is not the lemma the demotion needs, the 2p spacing result carries no numbered theorem of that name, several attribution defects and two internal conflicts are ours to settle, and the absence claim remains an absence claim. | none | [lit-pdf-holt-rudd.md](history/staging/lit-pdf-holt-rudd.md) |\n| `Q-lit-scourfield-2008` | ANSWERED | Does Scourfield, Smooth divisors of polynomials (LMS Lect. Note Ser. 352, CUP 2008, 286-311), supply the divisor-distribution estimate that varE-theta2-proof.md section 6 leaves open? | DOES NOT DELIVER, at SECOND-HAND rung, and the chapter is still UNREAD at the page: ten channels were attempted, nine answered, and every one that answered is closed, degraded or paywalled, but the author's own restatement of the 2008 theorem, read at the page image of Scourfield, Funct. Approx. 55.1 (2016) 84 eq. (1.1), counts divisors m <= x of f(n) for n <= x with weight 1, for f a product of pairwise coprime irreducible factors each of degree at least 2, and the open step needs divisors n > 2L above the window, carrying a branch-dependent weight of total mass 4^omega, for the product of three LINEAR factors C(C-2)(C+2). Two gaps each independently fatal, plus a third that is AMBIGUOUS between two author-sourced statements and does not carry the verdict. One correction to lit-smooth-divisors.md is earned: the precision register of the owning convention is not uniformly (log y)^{o(1)} or order-of-magnitude, since (1.1) is an asymptotic with relative error O(1/log x), which is the right register and one epsilon short of the o(1/ln y) the open step needs. Step 1 of Var/E does NOT become conditional on a citation, and no absence may be written, since the chapter's interior lemmas were not read. | 9 | [lit-scourfield-2008.md](history/staging/lit-scourfield-2008.md) |\n| `Q-lit-siebert` | ANSWERED | Is Siebert's 1983 result stated for general sieve dimension kappa, or for kappa = 1 only, and does it therefore already contain the kappa = 2 extremal example that SEARCH-CONVENTIONS section 3 records as not found? | kappa = 1 ONLY, on three independent statements of the theorem (the chapter's own publisher abstract, Granville 2020 section 1, Friedlander-Iwaniec 2022 page 20), all naming the LINEAR sieve and the Jurkat-Richert f and F; the chapter's full text was NOT reached, so this is testimony not primary reading, and the SEARCH-CONVENTIONS section 3 \"no published kappa = 2 extremal example\" row needs no correction. | 0 | [lit-siebert-1983.md](history/staging/lit-siebert-1983.md) |\n| `Q-lit-wu2004` | ANSWERED | What is H_theta(2) in Wu 2004, and what does the source say about theta approaching 1? | The source does not answer it: Wu never parameterises H by a level of distribution at all, so the theta to 1 reading is not in the paper; three defects follow in what attack-lichtman-decomp.md quotes, one of them a wrong inference built on a wrong table row, and the only proven cap is H <= 1. | none | [lit-wu2004.md](history/staging/lit-wu2004.md) |\n| `Q-localized-gap` | CLOSED | Does the Localized Merge Lemma close a chain from the localized twin-slot gap to a bound on the maximal gap? | The chain does not close, and it fails on a one-line averaging argument rather than on any sieve question; what survives is the growth law of maxsum_m and the boundary question, closed at (a)/(b) = (a)/(c) = 1.0000 at every x and every m <= 1024. | none | [LOCALIZED-GAP.md](LOCALIZED-GAP.md) |\n| `Q-lp-push-x43` | ANSWERED | Does the level-D LP's DP1 > DP3 inversion survive being pushed to x = 43? | Yes, and the correction strengthens it: the two statistics still climbing at x = 23 stop climbing, the pooled floor moves UP from 3.1945 (16 readings) to 3.3152 (33 readings), DP1 reads 2.32 of the 3.2665 against DP2+DP3's 0.95, and every one of the 33 pooled readings clears the (1 + beta_2)/2 = 2.6332 the inversion needs, the tightest at 2.6692. | none | [lp-push-x43.md](history/staging/lp-push-x43.md) |\n| `Q-maier-matrix` | CLOSED | Can the Maier matrix transfer exact residue-level knowledge about twin slots into an interval statement, and if not, where does it stop? | It stops at a scale collision: at q = x# the matrix is the identity 0 = 0, at q = y# with y < x the transfer identity is PROVEN and VERIFIED 20 of 20 but is a first-moment identity only, almost-all would need the second moment which is the localized twin-gap problem itself, and Granville-Soundararajan Corollary 1.4 is vacuous at every computable scale. | none | [maier-matrix.md](maier-matrix.md) |\n| `Q-maxgap-law` | ANSWERED | Does maxgap ~ c*mbar*lnD survive far enough to contradict Maier-Pomerance, and why did two agents measure two constants? | It does not, and not because the law breaks late: it was never an extreme-value law but a curve through a two-dimensional surface, and the two agents sat on different curves without recording which; on the diagonal c really is flat over a lever 46 times long with an estimator demonstrably able to see Maier-Pomerance growth, and one repo projection is REFUTED by the audit. | none | [maxgap-law.md](maxgap-law.md) |\n| `Q-maximal-law-tpc` | ANSWERED | Is the SIEVE Gaussian maximal law TPC-implying? | YES in the only form that would deliver anything: stated for the operative remainder R_H, need/z^2 runs 0.49 to 0.61, flat and below the zone budget at every z from 13 to 43, which is the Gap Reformulation, hence the Zone Postulate, hence TPC, so no soft argument can prove it; the published above-2 theta column is not the maximal law's verdict but the law plus two lossy steps. | 0 | [phase1-T4-maximal-law.md](history/staging/phase1-T4-maximal-law.md) |\n| `Q-maxsum-growth-law` | CLOSED | What is the growth law of maxsum_m, and is there a constant C that closes the localized chain? | The chain has no chance, and for a reason cheaper than the sieve wall: the gate grows like ln x per fold while the bound it must stay under grows by at least 2.4 ln^2 x, a deficit that is unconditional in C and in the sifting parameter, and the Deficit Lemma kills the weaken-the-gate repair because the gate feeds back. | none | [localized-04-maxsum.md](localized-04-maxsum.md) |\n| `Q-maxvr-uniform` | CLOSED | Is there a level-uniform bound on max VR, and what would an all-x form need? | No level-uniform bound: all three candidate bounds are killed by the numbers, and the all-x form needs a second ingredient the Status sentence does not name, an analytic lower bound on Sbar, the count of n with both n and n+2 free of prime factors in (x, sqrt(N)]; a max VR bound is in any case not TPC-strength, and no REFUTED.md row covers the route. | none | [attack-maxvr-uniform.md](history/staging/attack-maxvr-uniform.md) |\n| `Q-measure-0904-argmax` | PARTIAL | Where inside the tile is G2(x#) attained, with what multiplicity, and how thick is the near-maximal tail? | The multiplicity half was NOT open, and is reproduced here rather than found: exact-g2-ladder.js, measure-g2z2-0829.js and ATTACKS3.md already carry it at every level to x = 43, so object-g2-read-0829.md:1000's \"unknown\" is wrong. What is new, MEASURED exhaustively over the whole period at x = 11..37 by a third independent engine: the argmax set is tau-invariant with no fixed-point hit at all eight levels and carries ZERO congruence pairs from x = 23 up (refuting this note's own F7 at four scored levels), while 58 to 82 percent of the near-maximal windows ARE exact congruence translates of another by a multiple of W/p, at 10^6 to 10^8 times the uniform null; at x = 37 the maximum is 2 positions of 7,420,738,134,810 and only 6 gaps of 217,929,355,875 sit within 10 percent of it; four of eight pre-registered forecasts failed (F3, F5, F6, F7) and two falsifiers fired (F5, F7), and the exponent is untouched. | none | [measure-0904-argmax.md](history/staging/measure-0904-argmax.md) |\n| `Q-measure-g2-generic` | ANSWERED | Where does G2(x#) sit in the distribution of the same maximum gap taken over other two-class configurations with the same census, and is the constant-shift family generic inside the free-pair family? | G2 is GENERIC in this coordinate on the registered rule, MEASURED: the midrank percentile of G2 in the census-matched two-class ensemble reads 20.00, 18.06, 26.35, 17.14 exhaustively at x = 11..19 and 13.70 sampled at x = 23, all inside the registered [5, 95] band so the falsifier does not fire, while sitting about one ensemble sd below the mean at all five levels; and the free-pair and constant-shift ensembles are PROVEN identical up to translation, so killer 1 gains no target in the class positions at these levels. | 0 | [measure-g2-generic-0829.md](history/staging/measure-g2-generic-0829.md) |\n| `Q-measure-g2z2` | ANSWERED | What is G2(x#)/Z2(x) at every level where both exist, where does the tile's least attaining position sit, and how often does a zone hold exactly two pairs? | MEASURED at 22 levels: G2/Z2 rises 1.00 to 8.1429 with its maximum 8.3214 at x = 71, is lossless only at x <= 7, and no gap of length G2 lies inside the zone for x = 11..79 (PROVEN there from Z2 < G2 plus the Zone Restriction Lemma); R0's tight case k = 2 occurs at 0 of 27,291 zones above the degenerate first one; the fourteen custody ratios reproduce digit for digit and Z2 = env at 27,292 of 27,292 zones; the pre-registration scored three of five with one pre-registered theorem refuted (the Poisson miss is 1.518e-1 over p >= 3, corrected from a mislabelled 4.177e-1); no upper bound on G2/Z2 is claimed or in evidence. | none | [measure-g2z2-0829.md](history/staging/measure-g2z2-0829.md) |\n| `Q-minus-half` | ANSWERED | Is the -1/2 anticorrelation constant of the abutting-window covariance exact, or only equidistribution-conditional? | For the flat spectral functional the -1/2 is EXACT, a two-line consequence of the mod-30 difference set, verified to relerr <= 1e-15 on the full spectrum at x = 7 and 11; the whole equidistribution question compresses exactly into two residue-class correlation sums, and the residual all-x statement reduces to G30_agg(x) < 1/2. | none | [natal-cap-26-minus-half.md](natal-cap-26-minus-half.md) |\n| `Q-mismatch-adjudication` | ANSWERED | What is the true value behind each of readings-traceability's 56 mismatches, and where does each repair land? | All 56 adjudicated with old and new recorded: 33 READING-FIXED, 5 OUTPUT-FIXED-REBOUND, 2 awaiting re-embed, 5 DOC-FIXED, 4 UNTRACED-MARKED and 7 HOLDS-AS-IS; nine were repaired by making a script produce a figure it had only described, and three of those reproductions turned up a second defect. | none | [mismatch-adjudication.md](history/staging/mismatch-adjudication.md) |\n| `Q-mobius-bv-derivation` | ANSWERED | Is there a published theorem statement of Bombieri-Vinogradov for the Mobius function at level T^(1/2)/log^B T with a maximum over coprime classes, and if not, does that estimate follow from published theorems by a derivation whose every hypothesis is checked? | No published theorem statement was located in five channels searched in the owning convention named in research/SEARCH-CONVENTIONS.md; the closest is Granville-Shao's published assertion that the result is known, which carries no proof locator for the Mobius case. The estimate is derived here from four numbered results of Koukoulopoulos, GSM 203 (Corollary 13.4, Theorem 26.2, Theorem 26.6, equation (26.3)) plus Vaughan's identity for mu, with B(A)=A+6 and an ineffective constant. This is a derivation from published theorems, not a refereed theorem, and it is read from the author's preliminary version of that book. | C | [mobius-bv-derivation.md](mobius-bv-derivation.md) |\n| `Q-mod30-tail` | ANSWERED | Are the BV survey's S1 (mod-30 tail) and S2 (fixed truncation and depth) provable as stated? | Both PROVEN at short-note grade (no second reader) once S2's freshness factor is corrected to one class per prime, which needs only P^-(m) >= q > q_i and so holds at every scour prime, not only in the prime regime; tail constant 2 ln 2 -> (ln 2)/2; nothing in the head. | 11 (retired) | [thm-mod30-tail.md](history/staging/thm-mod30-tail.md) |\n| `Q-monotonicity-sweep` | ANSWERED | Does anything in the corpus assume certificate validity is monotone in L? | One unsound artifact and one invalid inference: attack-beta2-04-loss-budget.js section 6 bisects on a predicate measured not upward-closed and is wrong at 3 of 5 levels, true first-crossings 30/72/132/174/210 against the reported 36/72/144/174/354, and redteam-DP1-certificate.js draws a global minimality conclusion from a two-point local check; corrected, worst-casing certifies within 1.00 to 2.00 of true G2 and the exponent penalty runs 0 to 0.27 and falls with x. | 3 (retired) | [monotonicity-sweep.md](history/staging/monotonicity-sweep.md) |\n| `Q-moving-cutoff-parity` | ANSWERED | Does a proof-level reading of the shifted-Mobius sieve give a valid, explicit error-tolerant arithmetic target, and does its divisor switching preserve the moving boundary? | CHECKED prior art: Murty--Vatwani already supplies the conditional squarefree/parity mechanism and fixed-residue reduction. Its printed p. 654 swap omits n+h>ey; an exact finite counterexample verifies failure of that equality. DERIVED dyadic repair keeps the boundary and gives S=C2*x-2*C2*M+D_y+O_A(x/log^A x). A one-sided D_y>=-4*x/25+o(x) on unbounded dyadic scales is sufficient, using the certified margin C2*(1-A2)>33/200. That discrepancy estimate remains OPEN. Vatwani's recovered author preprint clarifies the one-odd-exponent cases and unfilled near-level-one hypotheses. No new signed bound is obtained; literature novelty is unestablished. | C | [moving-cutoff-parity.md](moving-cutoff-parity.md) |\n| `Q-mp-derivation` | ANSWERED | Can the fold-factor field M_p be derived rather than merely measured? | Its comb structure derives: M_p is about k*W1(theta_p)*exp(-delta*theta_p/mbar_p) with W1 the exact endpoint comb at zero parameters, blind-validated at a second fresh anchor; (k, delta) remain fitted, so this is a zero-parameter derivation of the field's comb structure and not of M_p, and nothing here proves H-double-prime or touches the exponent. | none | [mp-derivation.md](history/staging/mp-derivation.md) |\n| `Q-mp-window-prereg` | OPEN | Do the M_p FORMULA bands hold at a second fresh anchor? | Pre-registration only, sealed and committed alone before the measuring producer exists: the window, the population, the zero-new-parameter formula, all 37 band pairs, three scoring criteria and the consequences are fixed here, pinned to the v1 producer's embed fingerprint; nothing is measured. | none | [mp-window-prereg.md](history/staging/mp-window-prereg.md) |\n| `Q-multiplicity3` | CLOSED | Does the m >= 3 multiplicity instrument buy anything for the anchored deficit? | Closed as an instrument: at @17 the m >= 3 statistic sees the anchored deficit worse than the pair statistic it was to replace (anchored z -0.23 against -2.71 for the overlap credit X), the Bonferroni depth ladder buys one place and dies, and multiplicity 3 in moment order buys a factor 1.3 that does not reach the anchor. | none | [attack-multiplicity3.md](history/staging/attack-multiplicity3.md) |\n| `Q-natal-cap-campaign` | ANSWERED | What is the mathematical upper limit on the number of Natal@5 slots a prime q can remove from an X-tile as the Scour drags across it? | Per-prime removal is boxed by four instruments (max overshoot +7.7% over the fair share 2N/q, worst conceivable dilation +0.7% at @17 over 92,160 tuples, certified Selberg caps 1.13-2.5x truth, and a proven prime-counting cap for q > W^(1/3)), but no per-prime cap, even an oracle, closes the first-order union bound for x >= 13 because Sum 2/q crosses 1 between @11 and @13. | none | [NATAL-CAP-CAMPAIGN.md](NATAL-CAP-CAMPAIGN.md) |\n| `Q-natal-cap-overlap-sign` | CLOSED | Is the sub-CRT overlap bound S2 <= sum of 4N/(q q') provable, per pair or in aggregate? | REFUTED as an inequality at every granularity, with 40 to 53 percent of pairs sitting above CRT at x = 11 through 23 and named exhibits at each level; what survives is proven structure, an exact per-pair-computable aggregate deficit, with the remainder a sign-alternating discrepancy at noise scale. | none | [natal-cap-12-overlap-sign.md](natal-cap-12-overlap-sign.md) |\n| `Q-natal-cap-sieve-cap` | ANSWERED | What is the rigorous sieve upper bound on how much a single scour prime can remove, and does it certify the zone? | Certified Selberg and Bonferroni caps run 1.60 to 2.36 times N over x = 7..17 with the fluctuation factor at 1.000, gross(q) hugging 2N/q to three decimals, but from x = 13 the harmonic factor alone exceeds 1, so Sum gross > N and even exact-truth caps fail. | none | [natal-cap-10-sieve-cap.md](natal-cap-10-sieve-cap.md) |\n| `Q-natal-discrepancy-lemma` | PARTIAL | Can the rotation ensemble's class discrepancy be controlled strongly enough to feed Freedman's inequality? | Lemmas 1 to 4 and Theorem 5 are stated and machine-checked (1,954 assertions, zero failures) and Proposition 6's stopped Markov-union-Freedman chain is rigorous, but none of it touches the anchored problem: the anchored path's per-step conditional variances are ensemble-typical (mean ratio 0.93 to 0.99), so the anchored side remains 100 per cent drift against the Mertens/2C2 wall. | none | [natal-cap-14-discrepancy-lemma.md](natal-cap-14-discrepancy-lemma.md) |\n| `Q-natal-onset` | ANSWERED | Does Chris's q^2 destruction-onset staircase hold, and does the onset lens open a mechanism at x = 37? | The staircase is VERIFIED over 1..10000 after aborting-on-mismatch against his three hand anchors, the three onsets collapse to two and the naive 50:50 A/B split is refuted by derivation; the x = 37 fourth lens is a clean negative and the fourth mechanism family closes. | none | [natal-onset-01.md](history/staging/natal-onset-01.md) |\n| `Q-next-correlation-source-map` | ANSWERED | Is there a primary-source statement with stronger scale or coefficient quantifiers than the ones the prime-band transfer actually consumed? | Scoped negative for the inspected statements: function-class and rate mismatches remain. The coordinating review withdraws the all-scales/dyadic-omitting requirement as a necessary gate, since bounded-interval stability yields a weak dyadic scale average from the existing input. No sufficient rate or full-coefficient theorem is matched. Proper-prime-power terms are already negligible on the fixed corner; other prime-r cofactor branches remain open. | C | [next-correlation-source-map.md](next-correlation-source-map.md) |\n| `Q-next-transfer-review` | ANSWERED | Does prime-band-transfer.md (1)-(6) follow at exactly its stated scope, and does any step fail against an adversarial reading of its hypotheses? | The derivation (1)-(6) survives at its stated continuous-average scope. The coordinating round review corrects check l: interval stability additionally gives a dyadic scale average, with a further exponent loss. There is no every-dyadic estimate, o(N), full-corner control or twin margin. Proper-prime-power branches have a separate negligible fixed-corner bound. | C | [next-transfer-review.md](next-transfer-review.md) |\n| `Q-novelty-postaudit` | ANSWERED | Of the ten results never covered by the 2026-08-13 prior-art audit, which are novel? | None survives as fully novel: two are outright prior art (one published thirteen years earlier with its headline claim contradicted by the source's own table), one is a two-line classical theorem mis-calibrated as a measurement, five are restatements or special cases of standard objects, and one names a lemma that does not exist. | none | [audit-novelty-postaudit.md](history/staging/audit-novelty-postaudit.md) |\n| `Q-np-licenses` | ANSWERED | What does NP-completeness license here, and is Brady's Problem 3 the G2 covering problem? | The corpus sentence \"his Problem 3 IS the G2 covering problem\" is false as written and must be withdrawn (one class per prime and an arbitrary finite set, against two classes at locked separation 2 on an interval); NP-completeness licenses four statements about computation and none of the five mathematical ones. | none | [attack-np-licenses.md](history/staging/attack-np-licenses.md) |\n| `Q-null-limsup` | MIXED (null-limsup-prereg.md: OPEN; null-limsup.md: ANSWERED) | Does the thinning null's maximal gap disagree with Neudecker's limsup law, which would retire the extinction half? | The trigger does not fire: the closed form is the exact law, the reduction returns Hawkins' own constant, and the real fold's record gap lands within 2 sigma of the null, so the extinction half survives and the null now supports the ceiling argument rather than threatening it; the limsup itself is not measurable and cannot be. | none | [null-limsup-prereg.md](history/staging/null-limsup-prereg.md), [null-limsup.md](history/staging/null-limsup.md) |\n| `Q-object-bridge-read` | PARTIAL | What sits between Z2(p) and G2(x#), which inequalities between them are proven and in which direction, and is the information the Gap Reformulation discards provably needed? | Map only, nothing computed: the reduction discards the origin to buy rotation invariance at a loss measured at G2/Z2 = 4.12 by p = 43, and the discarded information is PROVABLY not needed for the implication (a rotation-invariant statement, G2 < x'^2 - 2, does reach the zone statement), MEASURED to be worth about one unit of exponent against a deficit of 2.2665, and OPEN as to whether any proof needs it, with no separation theorem on record on either side. | none | [object-bridge-read-0829.md](history/staging/object-bridge-read-0829.md) |\n| `Q-object-g2-read` | PARTIAL | What is actually known about G2, at what calibration, where do the corpus's documents disagree about it, and which questions about it have not been asked? | The band is unchanged: exponent 4.26645 proven above, 2 needed, and the reading found no document that moves it; what this note adds is a variant table, a legal open set for section 4, seven drift items including one live target that is TPC-strength and unlabelled, and eight unasked understanding questions. | none | [object-g2-read-0829.md](history/staging/object-g2-read-0829.md) |\n| `Q-object-models-read` | PARTIAL | For G2(x#) and Z2(p), what does each null model in the corpus predict, which measured deviations from those models are real, and does any of them carry interval-level (wall-relevant) information? | Nothing found that carries interval-level information: seven of the nine real deviations are residue-level by the THE-LENS section 5 rule, Kourbatov's b is interval-level in form but blocked by a log-sparse quantifier and unexplained as a mechanism in both corpora, and the sub-Poisson rough-pair dispersion is classified interval-level in form and elementary in content (division with remainder, not placement) by the independent-thinning null that ran 2026-08-29 (measure-roughpair-null-0829.md), which also weakened the sub-Poisson reading since that null's own chi-squared per degree of freedom is 1 minus p rather than 1. | none | [object-models-read-0829.md](history/staging/object-models-read-0829.md) |\n| `Q-observations` | PARTIAL | Which sightings from the bench survive being stated precisely enough to check, and at what rung? | A running log, each entry carrying its own rung: the mirror-centre and divisor-landmark items stand as VERIFIED, the closed form for the half word is REFUTED as a route (max of the half equals max of the whole at every level), and the compounding window is PROVEN to close only to U = 30. | none | [OBSERVATIONS.md](OBSERVATIONS.md) |\n| `Q-obstruction-audit` | ANSWERED | Is the wall named parity the right name for what blocks G2(x#) < x'^2 - 2? | Read at source, the audit's central reason does not survive: Tao's forbidden is defined extensionally rather than intensionally, so the primality-detection step in the reduction does not put the method class outside the obstruction, and where the wall sits on our own reduction moves accordingly; the proposed text for paper/wall-note.md is left unapplied. | none | [attack-obstruction-audit.md](history/staging/attack-obstruction-audit.md), [lit-tao-parity.md](history/staging/lit-tao-parity.md) |\n| `Q-oeis-G2-submission` | CLOSED | Should the twin Jacobsthal function G2 be submitted to OEIS as a new sequence? | DO NOT SUBMIT: it duplicates A144311 (Carter, September 2008), which is G2 - 1 on the same fixed classes with no free translate and carries 22 terms to our fourteen, all fourteen agreeing; five waves missed it because every search was run on G2 and never on G2 - 1. | none | [oeis-G2-submission.md](oeis-G2-submission.md) |\n| `Q-oeis-g2-absence` | ANSWERED | Is the G2 ladder absent from OEIS at fourteen terms? | Falsified: the ladder has been in OEIS since 2008 in the run-length convention G2 - 1, as A144311 carrying 22 terms to our 14, with the search channel calibrated live in the same session on two known-positive probes. | none | [audit-oeis-14term.md](history/staging/audit-oeis-14term.md) |\n| `Q-oeis-seam-submission` | PARTIAL | Is the seam twin-pair count sequence absent from OEIS, and is the draft ready to submit? | Status DRAFT: the exact-terms absence survives on both range conventions and the 20 terms are cross-checked by two independent Miller-Rabin implementations, but qc-wave6-X section B3 found a concept neighbour, A367739, that the draft's crossrefs do not mention. | none | [oeis-seam-submission.md](oeis-seam-submission.md) |\n| `Q-ojaroudi-read` | ANSWERED | Does Ojaroudi's Zenodo preprint prove an unconditional twin-prime theorem, and is anything in it importable? | No: the fatal step imports a Selberg quadratic-form LOWER bound from Opera de Cribro Chapter 7 where none exists, and a second independent gap leaves the Kloosterman hypothesis never checked; the venue is an unrefereed self-deposit, and the only payoff is two elementary lemmas that are importable onto our tile. | none | [ojaroudi-read.md](history/staging/ojaroudi-read.md) |\n| `Q-omega-floor-blind-0830` | ANSWERED | Does the local log-slope of the pointwise floor Omega(z) of attack-0830-rec-cheapest.md (exact to z = 73, certified 2+4-chain family to z = 5e5), extended blind to new levels under a sealed forecast, behave as the DERIVED growth law Omega >> z^{16s/9}/ln^8 z predicts at s = 2.698721, and at what z would the test be decisive? | MEASURED, blind, on the derived law only: 18 of 22 sealed rows HIT; the certified 2+4-chain family at p* = (47, 43) runs 5e5 -> 1e9 (A1A2 = 8.863e17 -> 9.351e32, exact integers) with its step slope falling 4.85 -> 4.38 through every sealed band onto the law's log-corrected slope, the decisive decade 1e8 -> 1e9 reading 4.410 against 16s/9 - 8/ln z = 4.389 (HIT, kill rule not triggered at 4.452 +/- 0.011); the 4 MISSes are the ratio to z^{16s/9}/ln^8 z sitting at 2.00-2.14 above the sealed cap of 2 at z >= 1e8, the pre-declared non-adverse direction; the exact floor is extended 73 -> 113 (251 -> 1980, equal to the hill-climb floors at 89 and 101), where the law predicts nothing; no exponent moves and the law stays DERIVED and HELD. | 0 | [blind-0830-omega-floor.md](history/staging/blind-0830-omega-floor.md) |\n| `Q-operator-pair-count` | ANSWERED | Can the histogram transfer operator and the pair count be evaluated exactly at any level with no tile in memory? | Both instruments are exact and neither needs a tile resident: the operator is PROVEN and VERIFIED exactly at six folds and the pair count at every fold; the tail carries a FIT beside them that must not be used past the range it was fitted on. | none | [operator-and-pair-count.md](operator-and-pair-count.md) |\n| `Q-origin-excess` | ANSWERED | Can the Origin Excess Lemma be pushed to S = x'^2, and is the scale collision genuine or an artifact of that one argument? | It cannot, and the collision is genuine: the origin's excess is exactly a ratio of two values of the survival curve rho at the same window and two sieving levels, and the Zone Postulate asks for that ratio at u = 2, where rho takes its minimum, so no better lemma moves the boundary; three candidate mechanisms fail, each for a different reason, one of them working against us. | none | [origin-excess.md](origin-excess.md) |\n| `Q-packing-two-class-priorart` | PARTIAL | Does the two-class (twin) analogue of the Hensley-Richards packing function exist in print? | Not found, on an uncalibrated search in our own wording with no owning convention recorded, so this is the reach of the search rather than an absence; the classical one-class theory is well developed, and against A008407 the two-class ladder is bounded below by the minimal admissible 2k-tuple diameter. | none | [natal-cap-04-packing-notes.md](natal-cap-04-packing-notes.md) |\n| `Q-paired-factor-budget` | ANSWERED | Does averaging the proposed two-small-prime loss and three-small-prime gain using existing distribution theorems make their net contribution sufficient for the current twin consumer? | DERIVED from the matched classical inputs, with finite rational enclosures VERIFIED: the explicit positive family has liminf P3/(C2*x)>1, but liminf (N2-P3)/(C2*x)>11/10. Keeping only these families and the main term therefore fails at the current cutoffs. Pan--Ding supplies aggregate level x^(9/20), stronger than the earlier per-cofactor application; the complete signed margin remains OPEN. The aggregation machinery is prior art and literature novelty of this application is unestablished. | C | [paired-factor-budget.md](paired-factor-budget.md) |\n| `Q-paper-iii-restructure` | ANSWERED | Is Paper III restructured around the proven model theorem? | Yes. paper/variance-note.md now carries four new sections in place of its fit narrative: sec.8 the proven spectral form (Var/E = delta X, delta ln^2 W -> 16 C_2 e^{-2gamma}/3 = 1.109905, the Montgomery-Soundararajan main term exactly L prime by prime, so all of Var/E is discrepancy), sec.9 the decoupled model with Theorems 7 and 8 and Lemmas 9-11 written out with proofs and the closed form lambda_2(2) = 1 - e^{-2gamma}(9/2 - 4 ln 2) = 0.45546 plus the theta = 1 identity with Gorodetsky, sec.10 Conjecture 1 (delta(X - X_dec) -> 0) with eight exact ratios, two of three lag groups closed and the third named as a divisor-distribution statement not yet searched, and sec.11 the 0.611 refutation as a short calibration paragraph; sections 1-5 are untouched, the abstract and section 6's open question are rewritten to match, and the \"u = 2 exactly\" defect in section 7 is corrected. | 9 | [paper-iii-restructure.md](history/staging/paper-iii-restructure.md) |\n| `Q-paper-kk-draft` | ANSWERED | Is the K–K two-class lower bound written up as a refereeable draft? | Yes. paper/kk-lower-bound.md, self-contained at INFERRED grade, carrying Theorem B (the substitution), Theorem A (the published-ingredient x ln x chain) and Proposition 2 (the free G2 >= g transfer), with every constant, every consumed hypothesis, the y0 = 10^134.1 floor, the three residuals, and a per-number provenance appendix; nothing in it is new mathematics and nothing in it is refereed. | none | [paper-kk-draft.md](history/staging/paper-kk-draft.md) |\n| `Q-parity-adversary` | ANSWERED | Does a parity adversary built on our own stretches survive at every level, and what precision class does a certificate need? | It does NOT survive: the exact-data adversary dies at D* about Q^1.18 (MEASURED, exact arithmetic, 43 anchors Q <= 200), and the certificate that kills it is itself destroyed by 0.30 of one count per modulus, so Z2's precision class is now measured rather than described; it is PROVEN not to be a proof ingredient. | Z2 | [attack-parity-adversary.md](history/staging/attack-parity-adversary.md) |\n| `Q-parity-dstar-law-0829n` | CLOSED | Does the exact-data parity adversary's killing level D*(Q) follow D* ~ Q^c with a stable c on the decades past Q = 200, and is c distinguishable from the independent-thinning null's? | No law in Q and CLOSED by the sealed kill rule (score 5 HIT, 1 MISS): MEASURED on 271 anchors 211 <= Q <= 13679, the Q-slope moves 1.446 to 1.204 to 0.575 across ranges while ln D* on ln width holds slope 1.097 +- 0.012 with a quarter of the scatter, D*/width about 0.5, and the independent-thinning null reproduces the width law within 0.025 in slope; the mechanism is that D* is where a modulus first reads a single position of the window, which is the wall survey's remainder statement in the stretch coordinate and names nothing new. | Z2 | [attack-0829n-parity-dstar.md](history/staging/attack-0829n-parity-dstar.md) |\n| `Q-perfold-error-model` | ANSWERED | What is the per-fold error model behind the extinction law's +/-3 sqrt(lambda) failure at 43.2 per cent? | X_p ~ Poisson(lambda_model(p, Y) M_p) with M_p a deterministic factor of the fold, the same number at every window length from 2e7 to 2e11 and at every anchor, MEASURED and not derived, and it holds on a sealed blind test at a fresh anchor. | none | [perfold-error-model.md](history/staging/perfold-error-model.md) |\n| `Q-perfold-window` | OPEN | Does the negative-binomial per-fold error model's band hold at a fresh blind anchor, after the extinction law's +/-3 sqrt(lambda) clause failed at the fifth window? | Pre-registration only, committed alone before the producer existed: the population is fixed in advance at the 37 folds p >= 100 with predictive mean or lambda_model at least 1, and the bands are printed verbatim from the model's embedded Stage 4; nothing here is measured. | none | [perfold-window-prereg.md](history/staging/perfold-window-prereg.md) |\n| `Q-phase1-W1b` | ANSWERED | Which unapplied wave-6 findings on the research notes were still live, and what did applying them change? | Most of wave 6 was already applied, so the yield is the residue plus one code defect nobody had fixed: a3-05-bound-L.js's truncated cyclic replay was printing a FALSE PASS on kappa(m) <= L+2 at fold 7, and fixing it kills a claim; the gate reads 0 findings across all seven checks at hand-back. | none | [phase1-W1b-applied.md](history/staging/phase1-W1b-applied.md) |\n| `Q-polylog-fold-transfer` | ANSWERED | Can the fixed-fold calculation be made uniform at growing depth, and transferred to the actual bilinear remainder with an adequate error? | The local bilinear model is O_H(x/log^H x) uniformly for polylogarithmic squarefree moduli. Its absolute reconstruction error is at least (1/2+o(1))*x. The needed signed reconstruction bound remains OPEN, so this model does not establish the twin-prime lower bound. | C | [polylog-fold-transfer.md](polylog-fold-transfer.md) |\n| `Q-prime-band-completion` | ANSWERED | Can the remaining squarefree correlation be localized to simpler prime and harmonic bands, and does completion then permit a direct general bilinear Kloosterman estimate? | The pilot reduces, with power-saving endpoint errors, to p in (x^0.235,x^0.24], q in (x^0.045,x^0.05] and positive h in (x^0.029,T], with T=O(x^0.0342). Both primes exceed 2h eventually. Completion is exact but produces coupled h-dependent coefficients on every dual residue modulo q. Its full-frequency Kloosterman matrix has norm exactly q, so a uniform power saving by an arbitrary-coefficient operator bound is impossible at that scope. This completion alone leaves the 61/20000 budget deficit; prime-dispersion.md controls the pilot using a different second moment. No twin lower bound is established. | C | [prime-band-completion.md](prime-band-completion.md) |\n| `Q-prime-band-transfer` | PARTIAL | Can the nonmultiplicative prime-band weight be represented by bounded multiplicative functions, and what does an available quantitative correlation theorem actually give after all scale and normalization costs? | A smooth Fourier superposition represents mu(n)L_B(n)/log X exactly on n<=2X+2. The quantitative non-pretentious input and a mesh give a continuous scale-average saving for the exact s=s'=1 windows. The round review additionally derives a dyadic scale-average saving by bounded-interval stability, with exponent c_*/2. Neither estimate gives an every-dyadic bound, o(N), full-corner control or a twin margin. The extension in cofactor-progression-transfer.md now estimates a growing polylogarithmic cofactor family; the full remainder remains open. Proper-prime-power branches have the separate bound in corner-correlation §1.1. | C | [prime-band-transfer.md](prime-band-transfer.md) |\n| `Q-prime-detection-inputs` | ANSWERED | Can we give a locally correct positive comparison sequence, justify the ordinary arithmetic inputs, and prove exactly what one additional estimate would buy? | Yes: the comparison sequence and Type I estimates are derived, and a classical Vaughan decomposition gives S(x)=C2*x+B(x)+O_H(x/log^H x) for every fixed H. A fixed one-sided saving over B>=-C2*x+o(x) implies twins on unbounded scales. This is a fully specified classical reduction, not a new cancellation estimate or proof mechanism. | C | [prime-detection-spec.md](prime-detection-spec.md) |\n| `Q-prime-dispersion` | ANSWERED | Can a second moment retaining two right primes control the remaining localized squarefree pilot after its actual conductor and coefficient costs are included? | Yes at this rectangle: aggregation in m=dp before Cauchy gives a logarithmically bounded coefficient on a long interval. The only zero-phase pairs are identical (q,h). Distinct primes give modulus e*q1*q2 with gcd loss at most O(A*Z); completion and Weil bound all off-diagonal terms. The diagonal has exponent 1989/2000 and the largest off-diagonal exponent is 1173/1250 before an arbitrarily small loss. The remaining high-frequency polynomial is O(x^(199/200)); consuming the previous reductions gives R_IJ=O_H(x/log^H x) at D=x^0.277, E=x^0.467. This is a full rectangle at product scale x^0.744, not a uniform product cutoff or a twin lower bound. | C | [prime-dispersion.md](prime-dispersion.md) |\n| `Q-prime-power-dispersion` | ANSWERED | Does the repeated-prime structure control the BB contribution beyond its two-norm bound, and can a prime-power moment include every harmonic uniformly? | The decomposition leaves an exceptional coefficient with norm at most sqrt(D) times logarithms; its odd prime-power core has a derived all-harmonic dispersion bound. The same bound for first powers removes the former left-prime cutoff and unpaired diagonal constraint. Two strict inequalities control a region including d~x^0.247, e~x^0.612 at product scale x^0.859. Their product-exponent supremum is 5757/6700, not a uniform product cutoff or a twin lower bound. Exact finite checks run separately from this classical-input derivation. | C | [prime-power-dispersion.md](prime-power-dispersion.md) |\n| `Q-prior-art-audit` | PARTIAL | What in this programme is rediscovery, and what might be new? | Rediscovery, prolific and correct, spanning 170 years (Smith 1857 to Tafula 2015); three candidate novelties survived the 2026-08-13 audit and item 1 was cut back on 2026-08-18 by OEIS A144311 (Carter 2008), and several negatives were run in our own wording rather than the owning convention, which is worth little. The 2026-09-06 global smooth majorant uses an explicitly matched prior-art finite-difference mechanism; literature novelty of the complete application is unestablished. | none | [PRIOR-ART.md](PRIOR-ART.md) |\n| `Q-prior-art-last-ground` | ANSWERED | Is MathSciNet reachable, and does the two-class upper-bound absence survive a complete title enumeration? | MR Lookup answers author/title/journal/year queries free (bibliographic fields only, no review text or MSC), so SEARCH-CONVENTIONS section 5 needs correcting; the standing sentence survives, since the complete MathSciNet title record for Jacobsthal contains every published upper bound and every one is one class per prime, and Holt's 2022 book is in no bibliographic database. | none | [attack-prior-art-last-ground.md](history/staging/attack-prior-art-last-ground.md) |\n| `Q-proposals-prior-art` | ANSWERED | What is the prior-art risk for the six candidates in the paper-proposals registry? | None is clean: three are ADJACENT with the boundary drawn Holt-style (one of them breaking a sentence the corpus rests on), the thinning null is PRIOR ART FOUND under Hawkins' random sieve with the Fold Moment Identity NOT FOUND, and only the reverse-direction Suen import reads NOVEL-SO-FAR; every verdict names what was not searched. | none | [proposals-prior-art.md](history/staging/proposals-prior-art.md) |\n| `Q-qc-arch` | ANSWERED | Is the corpus's architecture, ordering and file layout readable by a fresh agent at minimum context cost? | Diagnosis only, no existing file edited: the restructure plan of section 2 was accepted over the shepherd's, and the leading verdict is to leave OBSERVATIONS.md exactly as it is, in place, unsplit and off the reading path, taking out only four inbound citations that name it as the home of something it does not own. | none | [qc-arch.md](history/staging/qc-arch.md) |\n| `Q-qc-campaign` | ANSWERED | What did the 2026-08-17 consistency campaign run, find, decide and apply? | The shepherd's ledger: Chris's duplication rule and splitting ruling recorded in his words, the qc framework and the provenance index delivered in wave 1, and every partition's results with the decisions that settled them, including two novelty verdicts flagged as publication-track changes. | none | [qc-CAMPAIGN.md](history/staging/qc-CAMPAIGN.md) |\n| `Q-qc-checks-9-10` | ANSWERED | What do the provenance and search-convention gate checks find, and why are they held out of the default gate? | Both are built, calibrated and in the selftest but deliberately behind --pending because they fire on live claims an attack agent is mid-flight against: provenance reads 8 findings and search-convention 75 on the 2026-08-18 corpus, the flip to default is one line, and what could not be mechanised is stated. | none | [qc-checks-9-10.md](history/staging/qc-checks-9-10.md) |\n| `Q-qc-compound` | ANSWERED | Which named claims are compounds whose parts carry different calibrations, and how should each be decomposed? | Twelve compounds decomposed and eight examined and left whole, with about 90 corpus sites needing rewording; the test each decomposition must pass is that Proven: becomes unwritable rather than merely wrong, and the sharpest finding is that natal-cap-28's fully analytic certificate law has no markdown home at all, which is why its status is unfindable. | none | [qc-compound.md](history/staging/qc-compound.md) |\n| `Q-qc-history-migration` | ANSWERED | Which body text is history and should move to CHANGELOG.md or history/? | The headline is a negative and it is the most useful thing in the report: no body file is a session record that should move wholesale, so what moves is per-section, and the pass leaves an ORPHANED-CLAIM list of live errors plus per-file findings over all 63 body files. | none | [qc-history.md](history/staging/qc-history.md) |\n| `Q-qc-numbers` | ANSWERED | Do two places in the corpus ever give the same number for the same object, and does each remote quotation carry the caveat its home document requires? | 16 findings organised by quantity, led by the rho disagreement between U-FRAME:646 and gate-multiplies:360; diagnosis only, no existing file touched, and arithmetic-per-number is audit-numbers.md's axis rather than this pass's. | none | [qc-numbers.md](history/staging/qc-numbers.md) |\n| `Q-qc-papers2` | ANSWERED | Do the paper suite's five doors and four faces restate their research homes correctly? | Fifteen findings in sections 7 and 7A plus a suite sweep: a door resting entirely on a column its own cited file disclaims as invalid, whose corrected computation reverses the reading; a degree-4 certificate credited with a result needing moments through order 6; and the same paper contradicting itself forty lines apart on the anchored calm. | none | [qc-papers2.md](history/staging/qc-papers2.md) |\n| `Q-qc-queue-9-10` | ANSWERED | Can the provenance and search-convention queues be cleared without suppressing anything? | TOTAL 84 to 0 with nothing suppressed and every finding resolved in the corpus: all six not in OEIS claims were FALSE, since the G2 ladder is A144311 + 1 and PRIOR-ART.md already recorded the find 270 lines further down; the honest remainder is that five of 75 were resolved by rewording a sentence that was never a literature claim. | none | [qc-queue-9-10-worked.md](history/staging/qc-queue-9-10-worked.md) |\n| `Q-qc-refs` | ANSWERED | Are the corpus's external citations and its quotations sound? | Nine dead quotations and eight wrong external citations, the worst being that the corpus sits on the retracted FKMPT constant, an OEIS crossref off by one twice in a document addressed to an OEIS editor, and a false premise (\"Kanold, Stevens and Paseman all give exponent 2 + eps\") under an open TODO item. | none | [qc-refs.md](history/staging/qc-refs.md) |\n| `Q-qc-scope-R` | ANSWERED | Where does the summary layer restate a result with the scope its home document attaches dropped? | Fifteen findings, 2 HIGH, 3 MEDIUM-HIGH, 4 MEDIUM, 6 LOW: one HIGH is a false statement in README.md Status introduced by this campaign's own wave 2, the other is both papers giving a false reason for the X-limitation theorem's scope, and the coverage statement at the end is short and matters. | none | [qc-scope-R.md](history/staging/qc-scope-R.md) |\n| `Q-qc-scope-T` | ANSWERED | Does the surface partition R left unswept carry the campaign's dominant defect, a scope dropped in restatement, or a false absence claim? | Fifteen ranked findings plus the TA, TB and TC blocks: a scoreboard still logging the rich vein as the campaign's one unexplained novelty after a same-day follow-up solved it, a fourth copy of the retired sifting limit, and a largest-single-event superlative refuted by the event log it is read from; adjudication only, nothing edited. | none | [qc-scope-T.md](history/staging/qc-scope-T.md) |\n| `Q-qc-scripts-S1` | ANSWERED | Do the 37 natal-cap scripts' READINGS blocks hold against their own output and against the documents citing them? | Twenty-six of 37 are consistent and eleven carry a defect, none of them contradicting the summary layer on a status claim: a false promise of a record with no READINGS block, a reading refuted by its own printed output, an absence claim at the site a whole wave read as absolute, and a Miller-Rabin bound wrong by nine orders (3.186e14 for 3.186e23) at three sites. | none | [qc-scripts-S1.md](history/staging/qc-scripts-S1.md) |\n| `Q-qc-scripts-S2` | ANSWERED | Do the fold-profile and attack script families say what their own outputs say? | Thirteen defects over 34 scripts and 5,673 lines, five of them HIGH: an untested identification two later scripts had already killed, a printed reading refuted by its own table, a section that has printed only its header since it was written, and a reproduction pointer to a scratchpad that is gone; script-side ones fixed, document-side ones left as evidence, gate 0 on all seven checks. | none | [qc-scripts-S2.md](history/staging/qc-scripts-S2.md) |\n| `Q-qc-scripts-S3` | ANSWERED | Do the 57 non-campaign research scripts' banners, embedded OUTPUT blocks and READINGS agree with each other and with the documents citing them? | Defects ranked by consequence, the leading one a3-02-diagonal-f.js carrying the refuted L scanner while naming as its source the sibling that had been repaired underneath it, the two state machines disagreeing at exactly one cell, L(T23, 29) = 3 against the true 2, now fixed; the partition ends with qc.js at 0 on all seven checks and audit-numbers.js 78/78. | none | [qc-scripts-S3.md](history/staging/qc-scripts-S3.md) |\n| `Q-qc-shepherd` | ANSWERED | What does the wave-1 shepherd find on the corpus's own structure? | The largest structural defect is that U-FRAME is organised by campaign rather than by claim, with five whole sections of process record sitting in working documents, a PROVEN lemma quoted without the hypothesis that makes it non-vacuous, and three documents disagreeing about how many hypotheses that lemma has; the claim-status register across named objects was not covered and is named as the highest-value remaining axis. | none | [qc-shepherd.md](history/staging/qc-shepherd.md) |\n| `Q-qc-slopes-K` | ANSWERED | Are the three fits at slopes 1.062, 1.451 and 1.2992 numerically inconsistent? | There is no numerical inconsistency: the seven tile points are seven of the 42 census points with f agreeing to printed precision, restricting the 42 to the seven's x reproduces 1.062 exactly, and the two estimates are statistically indistinguishable (seven-point 95 per cent interval [0.32, 1.81]); but the corpus's stated reason is wrong, the comb does not explain it, and the coefficient is range-dependent under every specification, so no single slope exists. | none | [qc-slopes-K.md](history/staging/qc-slopes-K.md) |\n| `Q-qc-status` | ANSWERED | Is any named object's claimed status inflated, contradicted or misattributed? | Thirteen findings, 12 with replacement text: the worst scope inflation is the Fused-Window Calm Lemma listed as proven when two of its four legs are not, and \"the matching lower bound\" claims a sharpness the corpus explicitly disclaims; on attribution the corpus is in better shape than the brief assumed. | none | [qc-status.md](history/staging/qc-status.md) |\n| `Q-qc-transfers-J` | ANSWERED | Are the thirteen transfers findings real defects or benign restatements? | Adjudicated by word diff with the diff pasted under each finding: 11 KEEP, 2 DEFECT, both in gate-multiplies.md and both one root cause, 0 false positives, and nothing needing compute or a human decision. | none | [qc-transfers-J.md](history/staging/qc-transfers-J.md) |\n| `Q-qc-wave6-U` | ANSWERED | Do ATTACKS.md and ATTACKS2.md say what the corpus above them says? | Fifteen findings on 57 lines, led by a campaign verdict awarding theorem-grade to a curve its own home marks MEASURED and Hardy-Littlewood-conditional, the rich vein still logged as an unexplained novelty, and the anchored-window programme called unexplored where a research note and a 34 kB paper exist; six of the fifteen turn on a frozen-record-versus-current-state decision nobody has made. | none | [qc-wave6-U.md](history/staging/qc-wave6-U.md) |\n| `Q-qc-wave6-V` | ANSWERED | Do the sixteen fold-profile scripts carry auditable evidence, and what do they show when run? | All sixteen were run and now carry a real OUTPUT block and a numbered READINGS block, each verified by re-running and diffing; eighteen findings follow, the highest being a lemma quoted as proven that is false as written in two documents while three scripts in this partition print the counter-example. | none | [qc-wave6-V.md](history/staging/qc-wave6-V.md) |\n| `Q-qc-wave6-W` | ANSWERED | Do the three expensive natal-cap artifacts reproduce? | All three re-run, after the complete @41 march log turned up on disk outside the repo in a place no wave had cited; a three-way tally per file, with the .md disagreements logged rather than edited and the coverage limits stated. | none | [qc-wave6-W.md](history/staging/qc-wave6-W.md) |\n| `Q-qc-wave6-Y` | ANSWERED | Do the eight run logs, the three committed .txt outputs and the leaf-note residue say what the corpus above them says? | Findings on all three surfaces, including a stated bound on sup\\|R\\|/(H*M) that the log's own full-period block violates by 5.6x, an S6 block produced by a function the repo has since flagged wrong while the log stays unflagged, and a false absence claim in G2-STATE that the same document refutes 162 lines later; line numbers were taken against a tree being modified concurrently. | none | [qc-wave6-Y.md](history/staging/qc-wave6-Y.md) |\n| `Q-qc-wave6-absence` | ANSWERED | Do the corpus's [ABSENT], [INFERRED] and [UNVERIFIED] markers survive a check against fetched primary sources? | First web-enabled pass, no repository file edited: the exact-terms OEIS absence for the seam count sequence survives on both range conventions but a concept neighbour, A367739, goes unmentioned in the draft's crossrefs, and the note closes with an explicit list of what it could not reach, led by the MathSciNet citation graph of Iwaniec 1978. | none | [qc-wave6-X.md](history/staging/qc-wave6-X.md) |\n| `Q-quadpoint-blind-31607-0830` | ANSWERED | Does the zero-parameter depth law y*(Q), stated on the set where T(Q) >= 1 and on both the 1/(2e^gamma) = 0.280730 and the u*omega(u) = 2 (1/u* = 0.280438) forms with and without the finite-size Mertens factor, survive a sealed blind test on the bands past Q = 10007, and can that decade tell the two asymptotes apart? | MEASURED, blind, and it decides nothing asymptotic: on 8363 new anchors 10009 <= Q <= 100003 the 76 sealed rows score 64 HIT and 12 MISS with every MISS on the two naked asymptotes as pre-declared, the two finite-size zero-parameter comparators HIT every row at every band (residual on ln y*/ln h -0.00022 to -0.00002 against C2), K*/pool falls 0.032 -> 0.026 -> 0.020 -> 0.016 -> 0.013 with no bend and a quiet sup, and the band means sit 0.0017 to 0.0037 below both asymptotes, six to twelve times their 0.000291 difference, so which limit the deficit tends to is set by the comparator and not by the data. | Z2 | [blind-0830-quadpoint-31607.md](history/staging/blind-0830-quadpoint-31607.md) |\n| `Q-quadpoint-c1c2-0830` | ANSWERED | Does the fourth decade's post-hoc, unsealed preference for the omega-form comparator C2 over the exact-Mertens comparator C1 (C1 above the data by 3.46 and 8.83 se at B11 and B12, C2 within 2.82 se) survive a sealed blind test at the fifth decade, Q in (100003, 316243], and what does that say about which mechanism explains the depth law's drift? | MEASURED, sealed before the run and scored blind on 17702 new anchors, and it decides nothing asymptotic: the sealed D1 row HITs at both B13 and B14 (C1 above the data by 13.33 and 23.82 se, C2 within 1.26 and 1.82 se), so by the sealed rule the omega-at-finite-u crossing of import-rough-anatomy.md §2.1 is CONFIRMED over the exact-Mertens product of u2-engine-depth.md §5 as the depth law's main term at the sampling scale, while both still HIT every ±0.0015 row, the kill rows on C2 all HIT, K*/pool falls 0.013 -> 0.010 -> 0.008 with no bend, and the band means sit 0.0012 to 0.0018 below both asymptotes, so the two constants 0.280438 and 0.280730 stay unseparated by the pre-declared rule and the run separates two mechanisms, not two limits. | Z2 | [blind-0830-quadpoint-c1c2.md](history/staging/blind-0830-quadpoint-c1c2.md) |\n| `Q-quadpoint-prior-art` | ANSWERED | In the owning conventions, who holds the rough-pair census, the capture identity and the crossing law, and is any of it ours? | The object and the identity are standard (the dimension-2 twin sifting function plus Buchstab's identity; ADJACENT-STANDARD, no verbatim carrier, no novelty language); only the comparison X(y) < T and the crossing law stay ABSENT-PER-CONVENTION, and the Buchstab correction is 6.6% of the top-band residual, not 2%. | Z2 | [quadpoint-prior-art.md](history/staging/quadpoint-prior-art.md) |\n| `Q-quadpoint-transplant` | ANSWERED | Does the anchored-cap family transplanted onto the stretch window S_Q certify every anchor, and what does the depth cost do with height? | Pre-registration for the decade extension, committed ALONE before the segmented producer existed: it fixes the FALL trend line, the registered band readings, the kill rule and a digit-exact calibration gate that must abort before any new figure prints, and states that a falling K*/pool over two decades would still be only a measurement. | Z2, Z1 (retired) | [attack-quadpoint-01.md](history/staging/attack-quadpoint-01.md), [attack-quadpoint-02.md](history/staging/attack-quadpoint-02.md), [quadpoint-decade-prereg.md](history/staging/quadpoint-decade-prereg.md) |\n| `Q-quartic-fourth-moment` | PARTIAL | Can the fourth moment of rho-tilde, attack-rhoms-01's named stopping object, be bounded? | Not yet: the genuine quartic correlation is small (OFF/m2^2 measured -0.0454, -0.2767, +0.0101, -0.0446 at z = 13..23), the resonance condition is proved to be a local covering condition, and the whole question transfers by two exact identities onto a Lambda(4) inequality for one explicit cosecant sum whose constant is flat; the new increment rung clears z = 47. | none | [attack-quartic-01.md](history/staging/attack-quartic-01.md) |\n| `Q-reachability-coverage` | ANSWERED | Which part of the original divisor domain can no improvement to the grouped moment's nonzero kernel reach, in either orientation, and what would a uniform saving on that kernel actually buy? | For a prescribed fixed exponent margin eta0, the zero budgets leave S_0={p<2eta0,q<2eta0} below that required margin regardless of the nonzero-kernel saving. Uniform gamma=2 covers its complement at that prescribed margin. Smaller positive margins can reach fixed interior points of S_0; only p=q=0 remains at zero budget one for every margin. The proposed eta0~loglog x/log x substitution is not justified by estimates carrying x^epsilon losses; its box count is geometry only. The sufficient twin margin remains OPEN. Independent review F3 and F5 correct the quantifiers and the prime-power tail proof; round-review-0906 corrects the diagonal scope, fixed-margin bulk claim and six-cut separation. | C | [reachability-coverage.md](reachability-coverage.md) |\n| `Q-readings-traceability` | ANSWERED | What is the source of each of the 1,592 figures that appear in a script's READINGS and not in its own OUTPUT block? | The running record: nothing in the pass changes a number, 56 mismatches are classified in eight kinds for adjudication elsewhere, and the advisory count rises when the work is done right because a provenance declaration is prose that carries printed values. | none | [readings-traceability.md](history/staging/readings-traceability.md) |\n| `Q-rec-cheapest-0830` | PARTIAL | At the cheapest legal point of REC(s, u0), s -> 1+sqrt(e) and u0 -> beta_2, where the saving asked over the triangle inequality is only z^{1.031}, does any of the five dead routes close, does a mixed mean-square-plus-cap strategy close, and is the failure a proof gap or a truth gap? | No route closes and the failing step is yesterday's statement, so PARTIAL on the routes; but the step is located as a TRUTH gap, not a proof gap, asymptotically: the certificate's own value at a CRT-planted doubly-smooth window is cc(r) = -(A1A2 + A1B2 + B1A2) with every term a count of exit chains of the Rosser supports (PROVEN, checked exhaustively at z <= 73), the window bound T <= cc(r) + H - 1 is exact, and the exit-chain count is DERIVED (held) to grow like z^{16s/9 - o(1)} at four primes and z^{2s - o(1)} in the limit, so REC(s, u0) is false for every u0 < 16s/9 = 4.7088 at s -> 1+sqrt(e), the whole legal band (2, beta_2] included, and RML(alpha) with it; at every computable z it is a proof gap (Omega(z) exact to z = 73 reads 251 against z^{u0} = 1.05e6, and a certified lower bound 8.86e17 at z = 5e5 sits a factor 1.2e6 under z^{u0}); no exponent moved. | 0 | [attack-0830-rec-cheapest.md](history/staging/attack-0830-rec-cheapest.md) |\n| `Q-recon-0828-covering` | ANSWERED | Does the interval-covering, automated-proof or extremal-combinatorics literature hold a method that bounds the length of an interval covered by two residue classes per prime, or that turns the exact G₂ ladder into a statement at all x? | No route. Fifteen angles examined, fourteen dead on arrival or already closed here; the best interval-covering bound in print is Crittenden-Vanden Eynden's own Lemma 2, which reads 1.02e12 against G₂(79#) = 1710 and is 8181x weaker than the corpus's own 4.2665 sieve bound at the same level; the one survivor, transplanting Costello-Watts's recurrent certificate to two classes, is a computation that certifies finitely many levels and whose analytic half is Erdős #970 at one class. | 0 | [recon-0828-covering.md](history/staging/recon-0828-covering.md) |\n| `Q-recon-0828-farfields` | ANSWERED | Do any of the fields still absent from IMPORT-MAP.md hold a theorem whose hypothesis the tile satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | No route from any of the sixteen candidates priced; two reach STRONG-ANALOGY or better and CLEAN and both bank only a closure or a wall address, the Fourier one by a one-line non-vanishing proof that empties the Donoho-Stark/Tao/Meshulam family on this object, and Janson's lower tail by saturating at exp(-1/c) >= 0.0805 against the 1/W a position union bound needs, short by 3.6e2 at x = 11 and 2.8e13 at x = 41. | 0 | [recon-0828-farfields.md](history/staging/recon-0828-farfields.md) |\n| `Q-recon-0828-jacobsthal` | ANSWERED | Does the 1978-2026 literature on upper bounds for Jacobsthal-type functions and maximal gaps in sieved sets hold anything that lowers G2 or Z2? | No route. Thirteen angles graded, ten dead on arrival (eight already closed in this corpus, two on their own structure), three surviving and none of them lowers an exponent: a kappa=2 extremal candidate built from an exceptional character rather than from Liouville, which can only close the band faster; an unread 1983 Siebert chapter that could already contain it; and one published anchor. Z2 has no non-TPC band at all. | none | [recon-0828-jacobsthal.md](history/staging/recon-0828-jacobsthal.md) |\n| `Q-recon-0828-rough` | ANSWERED | Does the 2000-2026 literature on y-rough numbers, sifted sets and short intervals hold any theorem that lowers Z2 or G2, meaning any control on the largest gap or the minimum count of a sifted set in EVERY short interval, or any structure of rough numbers a gap bound could use? | No. Ten angles examined, ten killed for this purpose; the strongest every-interval statement in print for one-class rough numbers is Iwaniec's S(x,y,z) >= (4y/log^2 y)(log(y/z^2) - O(1)) for y >> z^2, uniform in x, giving J(P(z)) << z^2, and it is the linear sieve run exactly at its sifting limit beta_1 = 2 with no slack outside it; no two-class analogue exists in print at any exponent, the corpus's own x^4.2665 is beta_2 by the same mechanism, and every remaining branch of the field (Matomaki-Radziwill, Gorodetsky, Friedlander-Iwaniec Cor 6.28, Gafni-Tao) carries the almost-all quantifier, which a second-moment statement can never convert into a bound on one empty window. | Z2, 0 | [recon-0828-rough.md](history/staging/recon-0828-rough.md) |\n| `Q-recon-0828-sieve` | ANSWERED | Is there anything in the 2008-2026 sieve literature, or in the parity-breaking literature, that lowers beta_2 = 4.26645 or supplies a consumer for a level theta > 1 on the two-class comb? | No route. Twenty-one angles examined, nineteen dead on arrival, nothing in print beats 4.26645 at kappa = 2 at any level on four calibrated channels; the two survivors are an owning-convention row and one unresolved hypothesis in a five-page 1990 announcement whose stated requirement beta < 3 excludes beta_2 = 4.26645. | 0, Z2 | [recon-0828-sieve.md](history/staging/recon-0828-sieve.md) |\n| `Q-recon-0829-escapes` | ANSWERED | Each of the three killers is an obstruction shape that occurs elsewhere in mathematics; where has each shape been beaten in print, by what mechanism, under what hypothesis, and does that hypothesis hold for the tile and zone objects? | Of nineteen escapes read, fourteen fail a hypothesis check (twelve on a fact already in this corpus), four fail some other way and one (the decoupled vector sieve) stays OPEN as the programme's existing road, so no route opens; Granville-Soundararajan's uncertainty principle is NOT killer 3 in print, is adverse-direction, and is already cited here twice. | 0 | [recon-0829-escapes.md](history/staging/recon-0829-escapes.md) |\n| `Q-recon-0829-farfields2` | ANSWERED | Do any of eight fields still absent from IMPORT-MAP.md and from the three 2026-08-28 recon notes hold a theorem whose hypothesis the tile or the zone satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | No route from any of the eight; the pass banks one PUBLISHED-ANCHOR (Holt and Rudd's transfer matrix has its full spectrum in print, second eigenvalue a2 = prod_{17<=q<=p}(q-3)/(q-2), printed 0.10206751799779 at p = 999999999989, decaying only like 2.82/ln p, and this corpus's prior-art record names the eigenstructure and the binomial eigenvectors but carries the per-prime eigenvalue (p-j-1)/(p-2) at lit-pdf-holt-rudd.md line 259 but no product-over-primes closed form, no numerical value and no rate), one CLOSURE with mechanism (Beurling-Selberg is the proof device behind the large sieve, whose constant N-1+1/delta is an l2-to-l2 statement and whose error 1/delta exceeds the window at the operative theta_total > 2, so the whole extremal-function family reproduces a row already rejected), and three wall addresses; two angles are TPC-strength at the form that would pay and are labelled (ii). | 0 | [recon-0829-farfields2.md](history/staging/recon-0829-farfields2.md) |\n| `Q-recon-0830-rec-killrun` | ANSWERED | Does the literature hold, in its own conventions, a theorem whose hypotheses REC(s, u0) (the sup-versus-rms recovery of the level-D signed remainder over all positions, attack-0829n-rml-proof.md section 3) or the weighted kill-run K*(s) (the longest run of level-s slots the primes in (s, 2s] can kill, attack-0829n-doubling-bridge.md sections 0 and 3) satisfies as stated, or a Maier-type theorem that makes REC false for two-class sifted sets at some u0 below beta_2? | No theorem applies to either object as stated, on four calibrated channels searched in the owning conventions; every neighbour is graded NEAREST with its unmet hypothesis named, and neither object is on any refuted row. On the Maier question the answer is negative for REC as stated (the Maier family bounds the COUNT, i.e. the full-level remainder, never a level-D truncation) but carries one calibration: at one class and full level the REC-shaped inequality is FALSE asymptotically, by Buchstab's origin ratio against the Montgomery-Vaughan full-period variance ceiling, and the embedded arithmetic puts the level where that falsity first shows at log10 z between 16 and 141 depending on u0 and epsilon, so a finite-z margin of the kind the corpus measures cannot see a failure of this type; at two classes the same full-level statement is HL-conditional at u0 = 2 and unlocated in print at any u0. No exponent moved. | 0, D | [recon-0830-rec-killrun.md](history/staging/recon-0830-rec-killrun.md) |\n| `Q-recon-0830-smooth-aps` | PARTIAL | Does any theorem on y-friable integers in arithmetic progressions (Granville, Fouvry-Tenenbaum, Soundararajan, Harper, Drappeau, Drappeau-Granville-Shao) supply the uniform o(1) equidistribution that attack-0830-varE-identification.md section 4 leaves open, for moduli up to y^(4/5) with the lam1 weight and the squarefree restriction? | NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength. | 9 | [recon-0830-smooth-aps.md](history/staging/recon-0830-smooth-aps.md) |\n| `Q-recon-0904-sifting-limit-floor` | PARTIAL | What is actually known, in the owning convention and at the page, about LOWER bounds on sifting limits at dimension kappa > 1, and is the class-blind cap at beta_2 = 4.26645 a barrier or a method artefact? | Both. The corpus's [ABSENT] is wrong for lower bounds and right for extremal examples: Selberg's Lectures section 17 and Brady's 2017 Corollaries 1 and 3 ARE lower bounds on beta(kappa) at kappa > 1, invisible because Selberg's convention is the reciprocal a_k = 1/beta_kappa so his lower bounds are titled \"upper bounds for sifting limits\", while no kappa > 1 extremal example exists and Halberstam's own 2003 review says so; the best floor on beta(2) resting on a citation is 1.8394 from Brady's reduction evaluated at kappa = 2, unconditional and below the band, and beta(2) >= 2 follows from monotonicity by a padding argument DERIVED here and probably folklore; the cap at 4.26645 is a METHOD ARTEFACT at rung MEASURED, since the level-D LP is exactly the axiom-only information class and its calibrated floor of 3.3152 sits about 18 per cent below the DHR value and passed, 0 of 15, its first external test against the published beta_3 and beta_4; the band (2, 4.26645] is untouched by anything proven. | 0 | [recon-0904-sifting-limit-floor.md](history/staging/recon-0904-sifting-limit-floor.md) |\n| `Q-reconcile-bind` | ANSWERED | Can the unbound script tails be reconciled against their code and then bound by embed.js? | Six producers came back CLEAN-BOUND and one REBOUND with two documented label supersessions and identical results; nothing was DEFERRED and nothing DRIFTED outside the one pre-registered band move, fdecay-band-01's point 35.5 to 33.9 and band [30.8, 42.9] to [29.6, 38.3]. | none | [reconcile-bind.md](history/staging/reconcile-bind.md) |\n| `Q-record-deficit` | MIXED (lit-kourbatov-shortfall.md: ANSWERED; record-location-null.md: PARTIAL) | Does the 6.0 percent record-location deficit survive the corrected null, and what is it? | Survives (z = -3.3, five window cuts); Z5's premises on 'location' and on n_eff were wrong; corrected-null formula in §4. | Z5 | [lit-kourbatov-shortfall.md](history/staging/lit-kourbatov-shortfall.md), [record-location-null.md](history/staging/record-location-null.md) |\n| `Q-record-mechanism-0830` | PARTIAL | Which of three candidate mechanisms (sub-Poisson gap dispersion, the tile's exact gap law, Kourbatov's k = 1 conspiracy heuristic transported to k = 2) carries the residual 0.78 to 0.97 of Kourbatov's b, at what derived size, and what fraction of b is left? | The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier. | Z5 | [attack-0830-record-mechanism.md](history/staging/attack-0830-record-mechanism.md) |\n| `Q-record-null2` | ANSWERED | How much of Kourbatov's shortfall coefficient b does an inhomogeneous-intensity record null carry, how much does a 6Z-latticed null carry, and what is the residual? | The inhomogeneous null carries essentially none of b (d b_z = -0.0012 +- 0.0001, MEASURED); the 6Z lattice's share is LAW-DEPENDENT, +0.1113 +- 0.0003 under the memoryless rounding-up law against -0.0060 +- 0.0003 under rounding to nearest, so the null side is a bracket of 16.1 to 25.1 percent of b and three quarters or more stays a residual with no mechanism; record-location-null.md section 8's argued 1.7e-4 lattice bound is wrong but no single number replaces it; the 15 percent estimator disagreement is pinned as an exact weighting identity; and the shape assumption behind every b reading is measured at 1.6 sigma and stays open. | Z5 | [measure-record-null2-0829.md](history/staging/measure-record-null2-0829.md) |\n| `Q-records-placement` | ANSWERED | Do the seven unswept twin-gap records 76-82, above 2^53, land uniformly inside their stretches, or is there square-anchor coupling in record-start placement? | Sealed alone before the producer existed: the uniform band, the fixed definitions, the registered readings, the calibration abort gate and the riders are all fixed here and no placement fraction, q or stretch boundary was evaluated; scored in records-placement-01.md. | Z6 (retired) | [records-placement-01.md](history/staging/records-placement-01.md), [records-placement-02.md](history/staging/records-placement-02.md), [records-placement-prereg.md](history/staging/records-placement-prereg.md) |\n| `Q-redteam-0818` | ANSWERED | Do the six headlines of 2026-08-18 survive being checked by someone other than their author? | Four CONFIRMED, two WEAKENED, one REFUTED: the second instrument's independence claim is refuted, the growth law weakens to G2 = x ln^{2+o(1)} x with the o(1) positive, and B is polylog, Brady's Problem 3 and DP1's consumer stand. | none | [redteam-2026-08-18.md](history/staging/redteam-2026-08-18.md) |\n| `Q-redteam-0820-empirical` | ANSWERED | Do the two held empirical headlines, perfold-error-model and item-x-offset, survive an adversarial pass before integration? | Both SURVIVE: every decisive statistic reproduced digit-for-digit on independent code, the blind window was re-sieved and re-scored 33/37 with independently re-derived bands, and the cofactor purity claim is certified; two sentences are weakened (the anchor-direction identical is only bounded at 6-10 per cent, and the @31 sigma calibrated claim outruns its controls) and one sentence is refuted as stated. | none | [redteam-0820-empirical.md](history/staging/redteam-0820-empirical.md) |\n| `Q-redteam-0820-math` | ANSWERED | Do fekete-1d, smoothness-front and import-hypergraph survive an adversarial pass before integration? | Mostly CONFIRMED, with one REFUTED as stated (import-hypergraph's \"the engine can never carry a ln-power\" is false for bounded-size edges, though the row's verdict survives for FGKMT-sized edges) and one WEAKENED (the freeze survives, the frozen value does not, under the trusted ladder). | none | [redteam-0820-math.md](history/staging/redteam-0820-math.md) |\n| `Q-redteam-0820-night` | ANSWERED | Do the night's two staged headlines, mp-derivation.md and rho-maximal-law.md, survive an adversarial re-derivation before integration? | Both survive: every decisive number reproduced on independent code, the fresh window re-sieved with a different engine reproducing all 37 X, the prereg custody at commit 303711b confirmed with the anchor genuinely fresh, and all 37 sealed (mu, lam) values and all 74 band integers reproduced exactly. | none | [redteam-0820-night-empirical.md](history/staging/redteam-0820-night-empirical.md) |\n| `Q-redteam-0820-night-proofs` | ANSWERED | Do the two proof-heavy held headlines of the 0820 night, anchored-01 and hsub-01, survive independent re-derivation? | Both stand: zero refutations and zero corrections to any quoted number, with every digit re-derived from the staircase-note's own lemmas or recomputed from the definitions in independent code; the doubling inequality itself was not attempted and remains posed, open and trap-free. | none | [redteam-0820-night-proofs.md](history/staging/redteam-0820-night-proofs.md) |\n| `Q-redteam-0820-structural` | ANSWERED | Do the Mirror-Sweep Lemma and its palindrome, and the advmin@11 = 16 headline, survive an adversarial replay? | Both CONFIRMED on independent re-derivation with zero shared code, advmin@11 = 16 re-proven end to end so that 16 < 34 kills every class-uniform cap; the correction that matters is one quantifier made explicit in the inversion sentence, since a family whose conclusion reads the chosen classes is not capped by 16 at the anchored point, and two precision defects sit in a Thorne citation. | none | [redteam-0820-structural.md](history/staging/redteam-0820-structural.md) |\n| `Q-redteam-0821-exponent` | ANSWERED | Do attack-rhoms-01's exponent claim and attack-doubling-01's certificates survive independent re-derivation? | No numerical discrepancy anywhere in either target, every re-derived figure reproducing to the printed digit; the 3.5+o(1) cap survives the attack it was most likely to die to but is not an unconditional bound on G2, and two wordings that run ahead of their custody grades are WEAKENED. | none | [redteam-0821-exponent.md](history/staging/redteam-0821-exponent.md) |\n| `Q-redteam-0821-structure` | ANSWERED | Do the W1/HL identity and the anchored-02 ladder survive re-derivation from the definitions on independent code? | Both headlines survive with zero refutations and all ten sub-claims CONFIRMED, carrying two recorded corrections: the -0.33 se figure's sign is presentation-dependent, becoming +0.32 se when duplicate-theta folds are collapsed, and the shadow guarantee is stronger than sold, a one-line theorem rather than a 76/76 empirical. | none | [redteam-0821-structure.md](history/staging/redteam-0821-structure.md) |\n| `Q-redteam-0821-wave2` | ANSWERED | Do the three held analytic attacks, b2mean, f4weak and quartic, survive an adversarial re-derivation? | All three survive with every load-bearing number re-derived independently, including four full N_k curves on a different inclusion-exclusion implementation and a c1 column from a freshly fetched OEIS b-file; two sentences are weakened, the cert/C2 widening being non-monotone, and no claim is refuted. | none | [redteam-0821-wave2-analytic.md](history/staging/redteam-0821-wave2-analytic.md), [redteam-0821-wave2-structural.md](history/staging/redteam-0821-wave2-structural.md) |\n| `Q-redteam-0828-census` | ANSWERED | Do destroyer-census-01.md, stretch-01.md and records-placement-01.md survive an independent re-derivation of every load-bearing claim, and may they leave HELD? | All three survive on arithmetic, every decisive number reproducing exactly on an independent engine; one sealed reading (records READ-3) is REFUTED as vacuous and four sentences need correcting before integration. | Z0, Z4, Z6 (retired) | [redteam-0828-census.md](history/staging/redteam-0828-census.md) |\n| `Q-redteam-0828-closures` | ANSWERED | Do the five 2026-08-28 closure notes stand, and do they stand for the reasons they give? | Three stand on corrected sentences (1d, Z5b, 0); one stands in half (10, the 1.074 counter-claim does not); one does not stand for its stated reason (1c, closed on a narrower window than the prior work's significant one, and its CLOSED has overwritten a PARTIAL in the generated index). | 10 (retired), 1c (retired), 1d, Z5b (retired), 0 | [redteam-0828-closures.md](history/staging/redteam-0828-closures.md) |\n| `Q-redteam-0828-engine` | ANSWERED | Do the five 2026-08-28 certificate-engine notes survive an adversarial re-derivation, and does the one-class freshness factor correction hold before it reaches a live document? | The one-class factor holds and is stronger than either note states; four numbers are refuted (first s>=10.82 is x=263 not 239, first non-empty kappa=1 level is @37 not @53, rho*g_max is off by one gap, the @17 certified share and per-term constant carry the wrong convention) and one proof step needs the max-over-y form of BV; the cluster's shared verdict stands. | 11 (retired), 8 | [redteam-0828-engine.md](history/staging/redteam-0828-engine.md) |\n| `Q-redteam-0828-head` | ANSWERED | Do the three 2026-08-28 head-residual notes survive an adversarial re-derivation of every load-bearing claim on independent code? | Mostly yes on the numbers and no on two framings: \"h/R -> 1 iff beta CV^2 -> 2\" is REFUTED (the limit needs only boundedness, the product controls the RATE), and 9 to 59 percent of the quoted h - R is the choice of comparator, since R is the continuum functional and a discrete uniform origin sees R + 1/2 exactly. | Z4 | [redteam-0828-head.md](history/staging/redteam-0828-head.md) |\n| `Q-redteam-0828-litimports` | ANSWERED | Do the six notes of 2026-08-28 survive an adversarial pass, and which of their load-bearing claims are wrong? | Every measured number reproduces on independent code; Saffari-Vaughan Theorem 10's range exponent is 6/11 not 1/11, which voids import-fracparts's one banked THEOREM at fixed M and corrects row 15 twice; four further weakenings, one refuted verdict line, no note refuted whole. | Z5, 4 (retired) | [redteam-0828-litimports.md](history/staging/redteam-0828-litimports.md) |\n| `Q-redteam-0828-quadpoint` | ANSWERED | Do the four HELD quadpoint notes of 2026-08-22 survive an adversarial pass: the capture identity's proof line by line, the depth law and its asymptote, the sealed prereg scoring, and the prior-art citations at page level? | The identity is PROVEN once its window convention is written down and holds at every K of 50 anchors under an independent implementation; four load-bearing sentences are wrong (section 4's gloss on Sum capU, v1 section 2's limit, the prior-art note's 2%, and the note's unconditional y* sentences), and none of the four defects opens or closes a route. | Z0, Z2 | [redteam-0828-quadpoint.md](history/staging/redteam-0828-quadpoint.md) |\n| `Q-redteam-0828-varE` | ANSWERED | Does the 2026-08-28 chain from the exact comb variance to lim Var/E = Pr[GD(2) > 2] = 0.45546 survive an adversarial re-derivation, and does the refutation of the 0.611 reading hold? | The constant survives at HEURISTIC and the 0.611 refutation is CONFIRMED and strengthened (the frozen out-of-sample half of the protocol also fails on the control); the correction is that TWO steps are open, not one, and that the theta=1 branch is an exact identity with a read theorem rather than a second-hand numerical match. | 9 | [redteam-0828-varE.md](history/staging/redteam-0828-varE.md) |\n| `Q-redteam-0829-measure-a` | ANSWERED | Do the three held measurement notes of 2026-08-29 (g2z2, g2-generic, provenance/x37) survive an independent re-derivation of every load-bearing claim, a custody and pre-registration audit, and a label audit against the wrong-direction scheme? | 96 load-bearing claims checked, 88 CONFIRMED on independent code or by hand, 7 WEAKENED, 1 REFUTED; the one refutation is a label, not a result: the g2z2 note's M2 and its producer's printed block both call 4.177e-1 the summed Poisson probability of a two-pair zone over p >= 3, while the code sums every decade including p = 2, whose single contribution is 2.6586e-1, so the true p >= 3 figure is 1.518e-1 and the MISS verdict is unchanged; no pre-registration in any of the three shows any sign of a prediction edited after its run, and birth-time evidence puts the note file before the producer file in two of the three, with the generic producer's inode anomalous and its claimed timestamps uncorroborated. | none | [redteam-0829-measure-a.md](history/staging/redteam-0829-measure-a.md) |\n| `Q-redteam-0829-measure-b` | ANSWERED | Do the three 2026-08-29 HELD measurement notes (measure-roughpair-null-0829, measure-record-null2-0829, zone-tail-02-0829) survive independent re-derivation of their load-bearing claims, their custody and pre-registration integrity, their (i)/(ii)/(iii) labels, and their proposed edits to other documents? | 59 load-bearing claims checked, 44 CONFIRMED, 13 WEAKENED, 2 REFUTED, no data defect found and all three producers bit-honest under embed --check; the worst finding is custody clerical rather than numerical, measure-roughpair-null-0829.md:161 quoting code-sha256 4813584b against the producer's banner 5caaa5173b4c1561, a hand-transcribed hash that does not bind the artefact it names; the second is zone-tail-02's scope claim that every head bootstrap in the corpus is three times too narrow, REFUTED as written because destroyer-census-01.md publishes no bootstrap at all and head-residual-factor.js bootstraps over gaps rather than zones, while the defect itself is CONFIRMED on an independent engine (1,910 distinct a_first among 17,700 top-band zones reproduced exactly) and is LARGER than stated, a cluster bootstrap giving an inflation factor of 4.10 against the note's implied 3.04; measure-record-null2's exact cov identity reproduces to 1.4e-15 from the OEIS ladder and its lattice arithmetic reproduces at every row, but its headline \"wrong by about three orders in b units\" is unit-inconsistent and contradicts its own section 3e's \"about one order below the effect\"; no pre-registration shows any sign of post-run editing and none of the three can be shown NOT to have been, because all three preregs live inside note files whose mtimes necessarily postdate their producers'. | none | [redteam-0829-measure-b.md](history/staging/redteam-0829-measure-b.md) |\n| `Q-redteam-0829-measure-c` | ANSWERED | Do the load-bearing claims of measure-tail-deficit-0829.md, lit-scourfield-2008.md, recon-0829-farfields2.md and recon-0829-escapes.md survive independent re-derivation at the record, and are their custody, prereg, provenance and (i)/(ii)/(iii) labels intact? | No verdict of the four notes is overturned; of 61 load-bearing claims 38 CONFIRMED, 14 WEAKENED, 6 REFUTED, 3 UNVERIFIED. Worst: lit-scourfield-2008.md line 79 quotes lit-smooth-divisors.md section 6 as saying the convention has \"no asymptotic machinery in this range at all\", a string absent from the repository and contradicted by that section's own words, and uses it to justify a correction; measure-tail-deficit-0829.md section 2 describes a superseded embed and does not disclose the --force the header records, although embed.js --check passes on all three hashes; and note 1's reported M-P1 failure at 19 -> 23 is a single-draw artefact, reversed here on 40 draws (shuffled 296.1 sd 29.1, Markov 264.0 sd 18.4, share 34.9 percent inside the registered band). Note 2's precision correction inverts a quantifier, the open step needing o(1/ln y) against Scourfield's O(1/log x); note 3's corpus does hold the per-prime eigenvalue at lit-pdf-holt-rudd.md line 259; note 3's section 3c re-prices a family already resident as the Vaaler completion of its own Lemma V remainder. Every verdict, and most of the arithmetic, otherwise reproduces on an independently written engine. | none | [redteam-0829-measure-c.md](history/staging/redteam-0829-measure-c.md) |\n| `Q-redteam-0829-objects-gb` | ANSWERED | Does every load-bearing claim of the two 2026-08-29 object reads (G2 and the bridge) survive independent re-derivation at the cited record? | 60 load-bearing claims re-derived at the record: 47 CONFIRMED, 8 WEAKENED, 1 REFUTED, 4 left UNCHECKED and marked so; the refutation is the G2 note's L5 formula, which pairs the corrected trusted zone K in [1.3946, 11.3568) with the superseded single-base expression (ln 66 + K)/ln 16, an expression that evaluates to 5.607 above beta2 at the top of its own stated range, and the three live-layer edits already applied by the orchestrator are correct as written. | none | [redteam-0829-objects-gb.md](history/staging/redteam-0829-objects-gb.md) |\n| `Q-redteam-0829-objects-zm` | ANSWERED | Do the load-bearing claims of z2-state-draft-0829.md and object-models-read-0829.md survive independent re-derivation at the record, and is the Z2 draft fit to become research/Z2-STATE.md? | 96 load-bearing claims re-derived at the record, 84 CONFIRMED and 11 WEAKENED and 1 REFUTED; the one refutation is a custody label, since the Z2 draft grades as unstamped hand arithmetic a table that sits in an embedded producer's OUTPUT block, and the draft is fit to become Z2-STATE only after eight named line fixes. | none | [redteam-0829-objects-zm.md](history/staging/redteam-0829-objects-zm.md) |\n| `Q-redteam-0829-theorem1` | ANSWERED | Is Theorem 1 of attack-AB-bounded.md (B <= 9 A(z)^2 (E(z)-1) = O((log z)^8)) a theorem, and at what rung does the corpus carry it? | PROVEN, and the scope now covers the whole chain: the L1 to L5 mean-square derivation and Theorem 1's bound on B are each re-derived here with no hypothesis, so _H <= 9 A(z)^2 (E(z)-1) H holds for every z, s and H as a mean over one period, the record's [INFERRED] is an under-grade, and the live layer's \"published as Opera de Cribro 6.18\" is wrong on two counts and must be replaced. | none | [redteam-0829-theorem1.md](history/staging/redteam-0829-theorem1.md) |\n| `Q-redteam-0830-doubling` | ANSWERED | Do attack-0829n-doubling-bridge.md and attack-0830-doubling-killrun.md survive an adversarial re-derivation on an engine sharing nothing with their producers, and do REFUTED rows 94 and 98 stand as worded? | The mathematics survives: the maxsum certificate Ghat(2s) <= maxsum_{K*+1}(T_s) and the product composition K*+1 <= prod(1+L_j) are each re-derived here and hold, the second at 21,641,346 nesting links over 6,012,804 killed runs with zero failures including the zero-kill fold, and every quoted figure reproduces digit for digit on a fresh engine (K*(16) = 17; G2(31#) = 348 @ 8813641451 x4 from both base tiles; sup msc 6.6364; the diagonal cells; the 2^N ratios 1.226/1.481/41.348). Row 94 STANDS and is if anything under-claimed, but its attribution is wrong in one direction: Lemma 1 at s = 128 alone clears the whole band, so the s = 16 walk corroborates rather than carries it. One statement is falsified: the bridge note's NOT-REACHED line puts 19#->37# out of reach, but column-major it returns here, reproducing the ladder row x = 37 and adding a FIFTEENTH step at s = 19, 20 (K* = 13, N = 4, C2 3.5200, certificate 3.8000), so the enumerable range ends at s = 20, not s = 18. Row 98 STANDS on its mathematics and is WEAKENED on one clause: \"the truth sits under it everywhere (sup w/a = 0.8295)\" attaches the CERTIFICATE's ratio to the word truth; the truth's sup is 0.6591. | D | [redteam-0830-doubling.md](history/staging/redteam-0830-doubling.md) |\n| `Q-redteam-0830-engine` | ANSWERED | Do attack-0830-buchstab-deep.md, attack-0830-comb-tail.md and attack-0830-anchored-ladder-17.md survive an adversarial re-derivation on code that shares nothing with their producers, and does REFUTED row 97 stand as worded? | Every headline number in the three notes reproduces exactly on independent code (26 of 26 comparisons, including F2/f2 = 3.6682 at sigma = 4.7088 by a near-analytic route, the 0-of-1512930 pair count, the tail defect at five levels, the full 419328-term Legendre split, and the whole @23 anchored ladder including K* = 27, floorU = 5364, truth 597475 and the minimal pool 1543 proven exact); one load-bearing DERIVATION is REFUTED — \"\\|B - 1\\| >= c forces sigma(q) < u_c - 1\" fails at @23 on 21134 (q, K) pairs for the engine's model B at c = 0.1 and on 33875 high-count pairs for the measured B at c = 0.01, because the step bounds every u in a weighted average by the largest one and treats the denominator as e^-gamma, so the \"level-free\" clause of buchstab-deep section 4 and REFUTED row 97's \"\\|B - 1\\| >= 0.01 forces sigma < 1.798\" must be re-graded from DERIVED to MEASURED-at-@23 (where the conclusion survives: the worst sigma is 2.159, still far below beta2 = 4.26645); row 97's \"the best sigma any level has\" is separately WEAKENED, since @29's head sigma is 5.5785 with width 1.5325 and @97's is 17.1422 with width 1.0000; comb-tail derives its main-term factor from prod (1 - 1/q_i) and measures it against prod (1 - 1/(q_i - 1)), which is what natal-cap-28 line 283 computes against its own line 20 and against certificate-engine.md section 1, a 0.9% difference at @23 that moves nothing certified; comb-tail also misquotes its own cited source as F1 in [1.5, 4] where that source says [1.5, 3] and says there is no bound at all at s < 1; four smaller slips are listed and none opens or closes a route. | 8, A | [redteam-0830-engine.md](history/staging/redteam-0830-engine.md) |\n| `Q-redteam-0830-fekete` | ANSWERED | Do the load-bearing claims of attack-0829n-hsubpow-K.md (the sign lemma, the K -> beta_bound map, the zone, the TODO.md base-16 correction) and measure-0830-delta-reader.md (the six pre-registered readers, their kill gates, the joint fit's calibration, the RB circularity argument) survive independent re-derivation, and are the two live-doc corrections they caused the right sentences? | Every number in both notes reproduces on independently written code (all 14 cells of the beta_bound / K_min table, all 48 cells of the reader-calibration table, all 24 figures of the real-control table, the margins, the sups, the 5.607 correction, the 10-of-81 count), and the sign lemma is re-proven as stated for continuous exact laws. Two claims are WEAKENED and one live-doc sentence needs a qualifier: the sign lemma's constant 1.0597 loses 43% of its value if the base floor moves from 2 to 3 and its whole shape fails for the stepped law that a primorial ladder must present, where beta re-enters the sup and a delta = 0 law already needs K = 1.37 at beta = 2, inside the trap; and TODO.md 1d's \"the sign of delta is unreadable for G2 at reach 79 by any instrument tried\" is wrong on the letter, since reader RB passed all four pre-registered criteria and read delta_hat = +0.80 +- 0.09, the note voiding it post-hoc on a circularity the pre-registration flagged but did not make a kill criterion; the honest sentence adds \"non-circular\". No claim in either note is refuted. | 1d | [redteam-0830-fekete.md](history/staging/redteam-0830-fekete.md) |\n| `Q-redteam-0830-floor-growth` | ANSWERED | Does the DERIVED growth half of attack-0830-rec-cheapest.md sec.4.2 (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive an adversarial re-derivation on independent code, does it really make REC(s, u0) false for every u0 < 16s/9, and does the blind slope test of blind-0830-omega-floor.md test the LAW or the CONSTRUCTION? | No break found in six attacks, so the growth half SURVIVES this pass and stays DERIVED (one failed break is not a proof, and the whole thing still rests on the exact half E1-E3 that this pass did not grade); but four claims are corrected - the threshold 16s/9 needs the unstated hypothesis s <= 3 (above it the four-prime LP maximum is 2(2s+2)/3, then 8, both below 16s/9, though the corollary that every legal u0 < beta_2 fails survives at every admissible s because 2 x LP-max > beta_2 for all s > 9beta_2/16 = 2.3999), the 2s - o(1) limit needs 3^k <= ln D / ln 8 so only k = 2 is available at every z below 1.1e9, A_i is >= not ~ the dyadic count, and the certified ratio does NOT rise monotonically (0.0118, 0.0128, 0.0101, 0.0057, 0.0051, 0.0093, 0.0336, 0.0801, 0.1658, 0.3545 on my own recount, which reproduces all ten S4b rows digit for digit); the blind test is ruled a test of the CONSTRUCTION's count and not of the law, since it cannot see E1-E3 or the CRT step; on the ruling Chris asked for, the floor does make the RML route a truth gap asymptotically and conditionally on E1-E4, and changes nothing computable, the literal construction first passing H = z^{u0} at z ~ 5.6e31 on the constant 2.93e-4 measured here; no exponent moved. | 0 | [redteam-0830-floor-growth.md](history/staging/redteam-0830-floor-growth.md) |\n| `Q-redteam-0830-floor-sign` | ANSWERED | Does the EXACT half of attack-0830-rec-cheapest.md sec.4 (E1-E4, the sign facts, the window bound T <= cc(r) + H - 1, the exact Omega, and sec.(d)/(e)'s calibration sentences) survive an adversarial re-derivation on independent code, and does it by itself constrain REC at any u0 without the growth law? | The mathematics STANDS as PROVEN and is stronger in two places than the note claims, but it constrains REC at NO u0 by itself: E3's identity is pure algebra and holds at every position (0 mismatches in 20.5M positions, both s), E2 holds at every divisor n > 1 under three disjoint routes at every s >= 1 and FAILS at s = 0.8, locating a hypothesis D >= z the note omits, E4 has 0 violations at every x over four complete periods with the wrap, and Omega is reproduced by an independent enumeration at all 26 tabled values and EXTENDED to z = 101 (285, 441, 684, 990, 1155 at z = 79, 83, 89, 97, 101), confirming blind-0830's exact 684 and 1155; three sentences are wrong -- E1's \"every pair with gcd \\| 2 is realised\" (exactly half are; the missing half is all those with 2 dividing one side), the ledger's and sec.0's \"251 against z^{u0} = 1.05e6\" (1.05e6 is HM, z^{u0} = 7.19e7, so the gap is understated 68.3x), and sec.4.4's reason for lam+(P(z)) = 0 (0.24 exceeds 1/8; the figure that closes the slab is 0.1199 at z = 89, under 1/8 by 4 percent) -- and sup\\|rho~\\| >= (Omega - M)/2 is loose: sup\\|R_1\\| = Omega + M exactly. Every exactly known log_z Omega is under 2 while REC needs it above u0 > 2, so the exact half touches REC at no u0 and every adverse consequence in the note still rests entirely on the growth half. No exponent moves. | 0 | [redteam-0830-floor-sign.md](history/staging/redteam-0830-floor-sign.md) |\n| `Q-redteam-0830-imports` | ANSWERED | Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | 9, 0, D, 1 | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| `Q-redteam-0830-records` | ANSWERED | Do attack-0829n-parity-dstar.md (CLOSED, HELD) and attack-0830-record-mechanism.md (PARTIAL, HELD) survive an adversarial pass on independent code, does REFUTED row 95 stand as worded, and is TODO Z5's new title supported? | Both notes' measurements reproduce on independent code and neither headline is refuted: D* is confirmed EXACTLY, by a BigInt rational simplex written here, at 299 of 376 anchors with 0 contradictions (the other 77 exceed the exact solver's size cap), the old range's 172-figure gate is re-derived exactly at all 43 anchors with 0 disagreements, and an independent 30-wheel sieve to 1e11 reproduces note (b)'s seven decade gap counts, CV^2 and far-tail slopes to every printed digit, with the counts also matching the published pi_2(10^k). Four sentences are wrong or over-stated and are replaced here: REFUTED row 95, note (a)'s ledger, its section 6 and TODO Z5 all attribute the null's 0.025 agreement to the WIDTH law when 0.025 is the ln Q slope difference (the width-slope difference on the same 84 matched anchors is 0.031); note (a) section 3's \"the threshold sits in a gap of at least 0.25 at every anchor\" is scoped in its own producer to the true arm and the null arm's exact gap is 0.1212; P6's HIT rests entirely on the decade-2 collapse that section 5 discounts as a sampler artefact when it discounts kill clause (a); and note (b)'s \"d b_z = 1.0806 +- 0.0014\" carries only the Monte Carlo pairing error, while moving the far-tail slope by 0.02 (against a spread of 0.0174 across six fit windows on the same decade and 0.1196 across decades) moves d b_z from 0.9888 to 1.1720, and continuing the law at slope 1 above the last resolved point still gives 0.7752. REFUTED row 95's CLOSED verdict stands on kill clause (b), which is better powered than the note presents it (paired s.e. 0.0401 against a 0.15 band), and the row needs two clauses reworded; TODO Z5's title is supported for \"measured and not derived\", and the resolved part of the law carries 72 per cent of the residual on its own with the extrapolation carrying the rest. | Z2, Z5 | [redteam-0830-records.md](history/staging/redteam-0830-records.md) |\n| `Q-redteam-0830-rml` | ANSWERED | Do the three HELD notes of 2026-08-29 night and 2026-08-30 on the RML chain survive an adversarial pass — the six-arrow chain and the term-count cap lemma of attack-0829n-rml-proof.md, the same-object ruling and the applied replacement sentences of verify-0830-usup-convention.md, and the reflection identity, custody, pilot bounds and sealed forecast of measure-0830-rho-sup-z41.md? | The three load-bearing PROVEN claims survive independent re-derivation — the CAP lemma (every step, sine sum at worst ratio 0.585568, the constant 6, 0 per-modulus violations at z = 13, 17), the reflection identity rho~(W-3-y) = -rho~(y) (proved here and its two hypotheses verified at z = 13..37, residual <= 1.7e-10 at every position of z = 13, 17, 19), and the same-object ruling (an independent lattice reproduces the repository's term multiset exactly at z = 13..37 and its {Vabs > 0} set equals LSE's records at all ten levels); five of the seven cited exact sups and three of the five walked sup\\|R_H3\\| reproduce to <= 5.0e-7, and every figure of the sealed z = 41 forecast reproduces from the seven cited sups alone. Fourteen claims do not survive, none of them reopening a route. The load-bearing one is RML sec.2's ms_m/ask column: it measures the PROVEN mean-square BOUND sqrt(B H), not the ^{1/2} that REC names, the two differing by 36.53x to 200.45x on the tabled rows because saturates in H while B H does not, so sec.5's ordering (ask below the Gaussian factor at u0 = 3.0 and 3.5) is an artifact and reverses at every row against the true mean square. \"gauss -> 0\" (sec.5) and \"sup/rms <= sqrt(2 lnW) O(1) = z^{o(1)}\" (sec.3) are the same error twice, against the note's own sec.0: sqrt(2 ln W) = z^{1/2+o(1)}, measured gauss 0.7905 at z = 19 falling to 0.5645 at z = 1e7, limit 1/2. \"the recovery exponent is log_z(2 sup\\|rho~\\|/rms): about 0.99-1.29\" quotes the truth column, which is log_z(2 sup\\|rho~\\|) alone; the quantity named measures 0.5628 to 0.6712. \"REC would be moot rather than false\" should read false. \"u_cap -> 2s + o(1)\" and \"n ~ z^{2s}/polylog\" are asserted where only \"<=\" is proven and the data cannot decide: u_cap is 4.2652 at z = 47, crosses beta_2 only at z = 53, reaches 4.4891 at z = 79, and passes u_triv from z = 53. \"seven points spanning less than one octave\" is 1.509 octaves, still uncorrected in three places including the ledger verdict. verify-0830's applied \"polynomially many from z = 223 on\" is true at every z >= 13, and its z = 331 crossover silently sets A = 1 (A fitted to LSE's own Ssat moves it to 337). No exponent moves, no route opens or closes, and no ledger verdict changes. | 0 | [redteam-0830-rml.md](history/staging/redteam-0830-rml.md) |\n| `Q-redteam-0830-slack` | ANSWERED | Do attack-0830-head-remainder.md, attack-0830-tail-derivation.md and verify-0830-record-defects.md survive an adversarial re-derivation on independent code, and do the five riders the verification put on live notes stand as written? | Arithmetically they survive: every figure of the three notes that this pass could recompute reproduced to the printed digit on code written from the definitions, 0 assertion failures over 58 assertion call sites (most inside per-level loops), including every figure of the verification's three claims and the half-decade Delta_HL it quoted rather than recomputed. Four sentences do not survive. (1) verify-0830-record-defects.md:316, a replacement queued for head-residual-hl3.md sec.0, says the pooled value sits \"0.038 to 0.052 below the sub-window mean at all three decades\"; measured, the two lower decades run to 0.076 and 0.066, and the same note's own falsifier row says 0.038 to 0.076, so the wrong half is the one queued to land. (2) verify-0830-record-defects.md:379's un-measured \"+0.005\" residual inside the eighths is +0.0004 measured at sixteenths, so the de-pooled top-decade value is converged and the caution can be dropped. (3) the ruling that the class null is \"the matched figure\" for the tail is matched on residue class only: p'^2 is coprime to every q <= p', and the ensemble's rough-class offset is E_rc - R = 5.6714 -> 7.5357 over x = 7..29 against the class null's 5.6000 -> 6.0336, giving t/(R_shell + 7.5357) = 1.0123 against t/classNull = 1.0157. (4) attack-0830-head-remainder.md sec.3's top row is not gap-scale matched: E[g] 244.0 against 235.9, y_match capped at 19997, and on the note's own six ensemble points Delta_ens ~ E[g]^-0.312, so meas/ens reads 0.9640 not 0.9539 and the headline \"0.954 to 0.995\" reads 0.964 to 0.995. Three levels the notes recorded as out of reach are run here: the X2 group at x = 23, the tile identities and conditionals at x = 29, and the ensemble ladder at y = 29 (pipe/ens 0.9535, 40 s, against the head note's \"about fifteen minutes\"). No route opens or closes and nothing here touches Z2. | Z4, 9 | [redteam-0830-slack.md](history/staging/redteam-0830-slack.md) |\n| `Q-redteam-0830-zone` | ANSWERED | Do attack-0829n-X-upper.md, blind-0830-quadpoint-31607.md and blind-0830-quadpoint-c1c2.md survive an adversarial re-derivation and an independent re-implementation of their producers, and at what rung does the corpus carry each of their headline claims? | They survive on the numbers and mostly on the wording. On independent code every band sum, tier ratio, sealed forecast, band statistic and z of all three notes reproduces to the printed digit (X-upper 7.82 to 10.13 and the flat 378100.0; the fourth decade's 76 rows at 64 HIT and 12 MISS with the same twelve MISSes; the fifth decade's class A at both bands), and three attacks failed to break them (the paired-se attack on the D rows, a search for a fitted constant in C1, and gap-selection at the band edges). Four defects stand: the X-upper note's \"s_max 1.81 to 1.96\" is wrong in its own arrow convention, which means B3 to B8, since s_max peaks at B4 and reads 1.85 at B8; the c1c2 note's OLD R2 row at B14 is a boundary call that my 1-in-8 subsample scores the other way; the c1c2 note's custody line \"three tails, one code-sha256\" is a tautology of tailfmt.js and is not evidence of a seal; and the unscored y* check carries a Jensen bias of about +0.44 in y, which is the whole size of the C2 gap it is read as corroborating. Nothing here moves 4.2665 to 2, no rung rises, and all three notes stay HELD. | Z2 | [redteam-0830-zone.md](history/staging/redteam-0830-zone.md) |\n| `Q-redteam-0904-argmax` | ANSWERED | Does measure-0904-argmax.md survive an adversarial re-derivation of its positions, its congruence null, its residue chi-square and its own pre-registration scoring? | Every positional number in the note reproduces exactly on an independent fold-replication engine at x = 11..31, including the argmax lists, m(x), the top-K sizes and components, the per-prime pair counts, the tail counts and the F6 drops, so the note's data survive. What does not survive is three things and the largest is the null: two random TWIN SLOTS are congruent modulo W/p with probability (p-3)/(D-1), not 1/M, so the note's \"10^6 to 10^8 times the uniform null\" is inflated by 6.9 to 29.1 at these levels and should read 10^4 to 10^6, and the statistic is not a random variable at all but a deterministic function of each window (translate lemma, proven here and checked against every argmax pair count), which makes a null ratio a category error rather than a small correction; the note's own \"58 to 82 per cent are translates of another\" reports K - components when its wording needs K - isolated, which is 83 to 98 per cent; and the custody table in §2 quotes a code-sha256 (3019147f...) that the producer does not carry (d53a3fd1...), while §2's body and §5(5) still describe a widths annotation the rider says was already deleted. The scoring is faithful in verdict and wrong in arithmetic: F3 and F7 are scored at four levels, not five, so F7's falsifier fired at three scored levels and F3's tally is 2 of 4; the brief's \"three of eight\" does not exist on disk, both the ledger and §0 say four, and four is right. The exponent is untouched and nothing here is a route. | none | [redteam-0904-argmax.md](history/staging/redteam-0904-argmax.md) |\n| `Q-redteam-0904-floor-growth-2` | ANSWERED | Does the growth half of the adverse pointwise floor (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive a SECOND adversarial pass, and does a floor on the certificate at a CRT-planted window make REC(s,u0) false (a truth gap) or only unprovable by that certificate (a proof gap)? | SURVIVES, at the same rung and no higher: four new attacks and two unasked ones found no break, so the growth half stays DERIVED and red-teamed twice, which is two failed breaks on a derivation and not a proof; the proof-gap reading is REFUTED because REC is a statement about R_H, the remainder of the very certificate the floor bounds below, and the chain has no step where a certificate value must become a true remainder, so it is a truth gap for REC as the corpus states it; five corrections are owed to the record -- the REFUTED row is UNSCOPED and should read \"on the Rosser vector-sieve lattice at equal levels\" since only the Rosser instance is derived, the \"falsity beyond z ~ 5.6e31\" is an s = 2.698721 figure quoted without its s and the fitted crossing at the corpus's own measured family s = 3.0 is z ~ 10^15.3, the analytic p* window (4D^{1/27}, D^{1/9}/4) is neither necessary nor sufficient at reachable levels so the exact onset is 4.42e5 at s = 3.0 rather than the quoted 1.055e6, the four-prime construction has NO exit prime below z once s >= 7 so the first pass's \"8 beyond s = 5\" holds only on [5,7), and the first pass's escape-(a) density 1/W understates the planted class by the factor W/(n1n2) though the escape still fails by an exponential; the LP maximum 8s/9 is confirmed as an exact vertex and the corollary crossing reproduces 9beta2/16 to 4.4e-16, the pre-registered slope band held at a new s (top step 4.9025 at s = 3.0 against a model 4.8990), and no exponent moved. | 0 | [redteam-0904-floor-growth-2.md](history/staging/redteam-0904-floor-growth-2.md) |\n| `Q-redteam-0904-item0` | ANSWERED | Do the two HELD notes of 2026-09-04 on item 0, the second adversarial pass on the adverse floor's growth half and the L7 one-class-to-two-class transfer, survive an independent adversarial pass, and do the live-layer changes they propose survive verbatim? | Both notes SURVIVE at their own rungs and neither moves an exponent, but SIX of their proposed live-layer changes need rewording and two of their supporting derivations are wrong; every load-bearing number reproduces on independent code (18 of 18 A1A2 cells digit for digit, the LP maximum 8s/9 at 0 deviations of 16 with residual 4.441e-16, the crossing 2.399878284834 against 9beta2/16 at 1.097e-13, the fitted C = 1.1206e-4 and the s = 3.0 crossing 10^15.30, the onsets 4.390e5 / 1.111e6 / 1.860e6, ln(n1n2) = 7.4993e7, and the L7 CRT counts EQUAL at x = 7, 11, 13), so the truth-gap reading of REC is CONFIRMED and the growth half stays DERIVED and red-teamed twice, not proven; what does not survive is the scoping, the exit-window and the price wording: the proposed clause \"at equal levels D1 = D2 = z^s\" is NARROWER than the derivation supports, since over 1643 admissible upper-and-lower level splits the floor beats the decoupled window at every cell by at least 0.644444, so no level split escapes and the sibling rider \"asymmetric levels give 8s1/9 + 8s2/9 with s1 + s2 pinned\" is REFUTED as written (it holds only while both s_i <= 3); the record's z ~ 5.6e31 is u0-specific as well as s-specific (10^31.68 at u0 = 4.2165 against 10^35.36 at u0 = beta2, same s), so replacing it with a beta2-convention 10^15.30 mixes two conventions; the onset correction is right numerically and wrong in wording, since at the record's own s = 2.698721 the exact onset is 1.875e6, LATER than the quoted analytic 1.055e6, not earlier; the escape-(a) correction is right in substance but its \"(A1A2)^2 / (2 n1n2)\" is a LOWER bound on the split's contribution, and the two-sided version through lambda+(n) <= 2^omega(n) reads 10^{-3.004323e+7} against B ~ 10^{10.1}, still no contradiction; and on the L7 side the union-bound argument and the CRT count are CONFIRMED while the coupled vector-sieve price 2(1 + sqrt e) = 5.297442541400 is the FORCED-equal-level constant, the corpus's live figure being K_BF = 5.158064680330, reproduced here to twelve digits at (a, b) = (2.229949, 2.928115), and the sieve-on-holes is the vector sieve only after the Ford-Halberstam substitution step that sift-limit-attack.md 7b(1b) already owns; the \"no third mechanism excluded\" line is honest but incomplete, since weighted sieves with Chen switching are already priced and closed at sift-limit-attack.md 4.2; scope of death gains one row, L7's mechanism 2, which the growth note's own section 10 calls untouched while its sibling calls it dead; no exponent moved. | 0 | [redteam-0904-item0.md](history/staging/redteam-0904-item0.md) |\n| `Q-redteam-0904-r0-extension` | ANSWERED | Do the seven load-bearing claims of derive-0904-r0-extension.md survive an adversarial re-derivation against Tao's own text, and do its proposed live-layer changes survive? | Six of seven survive at their stated rung and one is refuted: Proposition A, the scope slip, row e'' and the equivariance transfer are CONFIRMED (the slip is strengthened, since Tao's own Example 2 is the target note's missing one-coordinate witness), Propositions B and D are WEAKENED (B's stated mechanism proves too much and its proposed insertion drops the qualifier that saves it; D's \"same trigger\" is near-definitional and its causal reading of the exponent band does not hold), and the claim that no corpus artifact certifies the window-count variance at width p'^2 is REFUTED by research/06-variance-theorem.js, which computes exactly that, brute-force verified at two levels; separately, EXEMPT throughout means \"Claim 1's H5 fails\", which is not the parity statement wall-note Face 1 is priced against, and the note's proposed live-layer text carries no H6 conditional. | Z2 | [redteam-0904-r0-extension.md](history/staging/redteam-0904-r0-extension.md) |\n| `Q-redteam-0904-sifting-limit` | ANSWERED | Do recon-0904-sifting-limit-floor.md's five claims survive adversarial re-derivation at the page, and in particular is the 4.26645 cap a method artefact at rung MEASURED? | Four of five claims survive with corrections and the headline does not. Claim d is REFUTED as stated on four grounds, each sufficient: the level-D LP fixes one omega-profile out of a class Ford defines by a ONE-SIDED inequality, and inside the classical (Omega_2(kappa,L)) budget a legal profile at x = 13 gives a calibrated reading of 5.0113, above beta_2 = 4.26645, which fires the target note's own pre-registered refutation of its floor; the calibration is a 1.72 multiplicative correction fitted at one point and it misses the second proven point beta(1/2) = 1 by 66 to 82 per cent, two and a half times the 28.7 per cent effect the headline rests on; the pooled 3.3152 averages four statistics of which only s* is the definitional analogue of beta, and that route reads 3.4678 here and 3.9487 at x = 43 in the corpus's own data, still climbing at +0.4297 per ln x with the fitted line reaching 4.26645 at x = 104; and 3.3152 is 22.2961 per cent below 4.26645 rather than the 18 per cent the note prints. Claim a is CONFIRMED with a second source off the OCR channel (Ford 2023 p. 37, \"Some authors, e.g. Selberg, refer to 1/beta(kappa) as the sieve limit\"), one page correction owed (Halberstam is p. 117, not p. 116). Claim b is CONFIRMED and strengthened: Brady's class is stated on his p. 10 and IS the axiom-only interval class Face 4 needs, his v_R table is reproduced here, and the identity v_{2d+2} = v_{2d+1} his proof asserts is confirmed at d = 0, 1, 2, so 1.819592 rests on proved facts alone. Claim c is CONFIRMED but demoted: beta(2) >= beta(1) = 2 is two lines from Ford's own one-sided (Omega) plus his own beta(1) >= 2, so the padding construction is correct and unnecessary. Of the eight proposed live-layer changes, two survive verbatim, five need rewording and one is refuted; the new SEARCH-CONVENTIONS row adds exactly three clearing phrases and changes nothing for any existing absence claim. | 0 | [redteam-0904-sifting-limit.md](history/staging/redteam-0904-sifting-limit.md) |\n| `Q-redteam-at37-score` | ANSWERED | Does the @37 scoring record survive an adversarial pass on its prereg re-score, its independence claim, its interpretation table and the cofactor extrapolation? | The empty-survivor scoring holds - every registered figure reproduces from the committed prereg text and the embedded census block, and the four skipped reference-level gates were run here and all pass - with two findings against the held report, neither touching the verdict: the one-level-drop figure is 8.2x rather than 4x, which strengthens the reversal claim, and the cofactor-one surplus sentence oversells. | none | [redteam-at37-score.md](history/staging/redteam-at37-score.md) |\n| `Q-redteam-zonegap-foundation` | ANSWERED | Do natal-onset-01, zonegap-01 and zonegap-prior-art, the three artifacts the Z2 pivot builds on, survive an adversarial pass? | The foundation HOLDS: all four natal-onset claims CONFIRMED, zonegap-01 confirmed at every reachable point by independent code using a different sieve and a different max-gap algorithm, and the prior-art spot checks all confirmed at page image; two prose defects found, both WEAKENED and neither refuted. | none | [redteam-zonegap-foundation.md](history/staging/redteam-zonegap-foundation.md) |\n| `Q-refuted-audit-0829-1` | ANSWERED | Do the closures recorded in REFUTED.md rows 1 to 17 survive re-derivation against the object definitions, the producers' embedded output and the corpus corrections through 2026-08-29? | Ten of the seventeen rows stand as written and seven are SOUND-NARROWER on wording that claims more than the record carries; no row is WEAKENED or UNSOUND, no route reopens, and the sharpest defect is row 16 crediting a published lemma whose own hypothesis excludes this corpus's operative range. | none | [refuted-audit-0829-1.md](history/staging/refuted-audit-0829-1.md) |\n| `Q-refuted-audit-0829-2` | ANSWERED | Do the closures recorded in REFUTED.md rows 17 to 34 survive re-derivation against the object definitions, the producers' embedded output, the 2026-08-29 corrections, and their own quantifiers? | All eighteen closures stand and none reopens; nine rows are SOUND and nine are SOUND-NARROWER, the worst being row 53's \"the search is finished\", which its own record contradicts in two places, and the others splitting into three classes: a mechanism clause that covers half its route (rows 47, 58), a universal quantifier wider than the sweep behind it (rows 49, 59), and a measured number carried without its calibration or its unit (rows 43, 46, 60). | none | [refuted-audit-0829-2.md](history/staging/refuted-audit-0829-2.md) |\n| `Q-refuted-audit-0829-3` | ANSWERED | Do the closure arguments behind REFUTED.md rows 34 to 51 (the greedy oracle through the bounded-differences family) hold when re-derived against the object definitions, the producers' embedded OUTPUT blocks, and the corpus corrections landed through 2026-08-29? | The band holds: 13 of 18 rows SOUND and 5 SOUND-NARROWER, no WEAKENED and no UNSOUND, so no route reopens; the worst finding is a factual inversion in the anchored-delta row, which asserts that delta exceeds the forced scale at 2 of 7 levels when the record's own table has \\|delta\\| < F at 7 of 7, and the same wording has already propagated into a second note. | none | [refuted-audit-0829-3.md](history/staging/refuted-audit-0829-3.md) |\n| `Q-refuted-audit-0829-4` | ANSWERED | Do the closures recorded in REFUTED.md rows 51 to 67 hold when the record is opened and the closing mechanism re-derived against today's corrected corpus? | All seventeen closures stand: 8 SOUND and 9 SOUND-NARROWER, zero WEAKENED and zero UNSOUND, no route reopens; the narrowings are wording that claims more than the record carries, worst of them row 67, whose closing clause quotes a section its own record headed POST HOC and carrying no verdict after the pre-registered primary went VOID on its matched control. | none | [refuted-audit-0829-4.md](history/staging/refuted-audit-0829-4.md) |\n| `Q-refuted-index` | SUPERSEDED | Where do recorded citations to the closed-route index resolve? | The current closed-route records are in OUTCOMES.md. This file is only a compatibility pointer for citations in recorded script output; it contains no separate outcome register. | none | [REFUTED.md](REFUTED.md) |\n| `Q-registry-glossary` | ANSWERED | What does each word of the programme mean, one term per object? | The vocabulary registry; adopted terms with dates, the anchored layer, and the calibrated entries (Var/E, hyperuniformity, the freshness dimension count) as corrected on 2026-08-28. | none | [GLOSSARY.md](GLOSSARY.md) |\n| `Q-registry-outcomes` | ANSWERED | What has each research approach established, where has it failed or stopped, and what evidence or changed input permits reuse or a further attempt? | One outcome register organized by research question and approach. Each record preserves its calibration, established result, limitation or failed step, evidence and reuse or revisit conditions. The closed-route table is part of this register. Git owns revision and authorship history; an open estimate is not a refuted claim. | none | [OUTCOMES.md](OUTCOMES.md) |\n| `Q-registry-research-readme` | ANSWERED | Which file in research/ answers which question, and in what order should a reader open them? | Router only: state lives in ../README.md section Status and G2-STATE.md section 0, the target in ZONE-POSTULATE.md, the queue in ../TODO.md; this file holds no mathematics and no summary of the programme. | none | [README.md](README.md) |\n| `Q-research-execution` | ANSWERED | How should agents use the integrated returns, avoid repeated work and select the next bounded research obligation? | The second dispatch from 1285d47 closed at 46fa948 and was independently reviewed on 2026-09-09. A/A2/B/C/D/E and V/W returns are present and integrated at their owning scopes. A2's corrected Type I estimate is accepted; D's fourth residual cut is retained and its remaining moment saving corrected to 7/200. C's low nonzero modes and E's aggregate scope are corrected. No new assignment is started by this integration; next obligations are candidates, not running work. Twin-prime infinitude and every sufficient signed margin remain OPEN. | C | [RESEARCH-EXECUTION.md](RESEARCH-EXECUTION.md) |\n| `Q-research-handoff` | ANSWERED | What must an incoming research agent understand, verify and return before its work can advance the current twin-prime argument? | Current handoff after the 2026-09-09 independent review of the dispatch ending at 46fa948. The full residual has four simultaneous complement conditions after D's regional estimate. A's centered truncation and A2's repaired low Type I estimate give the alternative S=C2*x+B+O_A(x/log^A x). B and all sufficient signed margins remain OPEN. The C3 absolute bound, family identities and scoped C/E failures retain their owning hypotheses. Execution is owned by RESEARCH-EXECUTION.md. | C | [RESEARCH-HANDOFF.md](RESEARCH-HANDOFF.md) |\n| `Q-research-round-validation` | ANSWERED | Which submitted results from lanes A, A2, B, C, D, E, V and W survive direct review, and what can be integrated or used to choose the next attempt? | Reviewed incoming commits 07ab47f through 46fa948 on 2026-09-09. A's truncation and A2's repaired low Type I estimate are accepted with bookkeeping corrections. B's ordinary-BV family identity survives; its uniform Dickman constant and complement condition are repaired. C's norm obstruction survives on all smooth inputs, but low nonzero Fourier modes are also 1-bounded. D's block estimate and fourth residual cut survive; its next moment saving is 7/200, not 17/200. E's rough-product distribution and aggregate constant 4 are accepted at the stated Wu uniformity reading; rational certificates close the two displayed tests for every fixed u>4. W remains OCR-only at the original 1974 theorem page. All sufficient twin-prime margins remain OPEN. | C | [research-round-validation.md](research-round-validation.md) |\n| `Q-residual-coverage` | ANSWERED | What portion of the full residual is controlled with uniform margins, and can the exceptional first branch improve that coverage rather than just a regional corner? | The first-branch and prime-free moments remove the exceptional norm condition. Full rectangles are controlled when delta+nu<19/25 or 5delta+2nu<123/50. Uniform twists justify exact coupled cuts: every fixed de<=x^theta with theta<19/25, and d^5*e^2<=x^lambda with lambda<123/50, as well as their union, have arbitrary fixed logarithmic savings. A concrete remaining endpoint sum has de>floor(x^(3/4)) and d^5*e^2>floor(x^(49/20)). Its twin margin is OPEN. The right zero-frequency budget, after an extra Cauchy inequality, limits the uniform product range; the left cross moment limits the other edge. Finite checks validate identities and masks, not asymptotic rates. | C | [residual-coverage.md](residual-coverage.md) |\n| `Q-review-0905` | ANSWERED | Does the present programme justify its latest stopping decision, and what is the next useful campaign toward infinitely many twin primes? | The computational checks pass and the DHR application survives this reading, but several summaries overstate the obstruction or misstate an implication. Recommend repairing those claims, retaining the fold framework, and testing it against Chen on long intervals before attempting a specifically stated parity-sensitive estimate. No proof of twin primes or improvement of an exponent is supplied. | none | [review-0905.md](history/staging/review-0905.md) |\n| `Q-review-request-0906` | ANSWERED | Which claims of the arithmetic campaign should an independent reviewer check, in what order, against which records, and what must the review return? | Completed review specification at the bounded scope recorded in handoff-review-0906.md and reports 20 and 21, with the subsequent round reviewed in round-review-0906.md. The dependency list records questions at dispatch, not current unfinished assignments. Imported proofs retain their review limits and the twin margin remains OPEN. Current assignments are in RESEARCH-EXECUTION.md. | C | [REVIEW-REQUEST.md](REVIEW-REQUEST.md) |\n| `Q-review-request-0907` | ANSWERED | Which claims of the 2026-09-07 session should an independent math agent check, in what order, against which records, and what must the review return? | Reviewed 2026-09-08 by an outside reader (history/reviews-0907/10): ranked claims 1 (conditional on the unread 1974 page), 2, 4, 5, 6 verified within stated scope; claim 3 verified with its quoted tolerances corrected (max deviation 1.8e-4, not 1e-4 or 1e-5); the Corollary 1 slip sharpened (fails for every representative other than 1, and mis-signs even then); ASSUMED items 4 and 6 discharged, 2 partially, 1, 3, 5 not. Twin-prime infinitude and every sufficient signed margin remain OPEN. Ranked below: the §6.2 demotion in the two-class manuscript (a change to a proof's dependency), the D_y identity reading (a change to what a census can show), the Erdős #687 attribution, and the two measurement artifacts. Twin-prime infinitude and every sufficient signed margin remain OPEN. | Z0 | [review-request-0907.md](review-request-0907.md) |\n| `Q-rho-maximal-law` | PARTIAL | What is the rho maximal law, what is its weakest sufficient form against the crossing, and where does it sit against print? | The pricing lemma turns any RML(alpha) with alpha < beta_2 = 4.26645 into G2(z#) << z^alpha ln^2 z, every step proven except the law itself; the sufficiency curve lambda_max falls from 2.31949 at z = 13 to 1.78446 at z = 47, the weakest measured point, and whether it ever reaches zero is model-dependent and undecided, so nothing here is an unconditional exponent. | 0 | [rho-exact-z31-01.md](history/staging/rho-exact-z31-01.md), [rho-maximal-law.md](history/staging/rho-maximal-law.md) |\n| `Q-rho-sup-z41-0830` | PARTIAL | What is the exact sup over all positions of the centred sawtooth remainder at z = 41 (period 7.42e12), and of R_H at H = z^3 and z^4, and what does the eighth exact point do to the truth's slope and to the u0 = 3 form of REC(s, u0)? | Not run in full; the exact z = 41 point prices at 4.8 to 5.4 h on this machine from measured per-position costs (naive 69.8, table 23.5, table-plus-windows 36.6 ns per worker; fleet 4.52 ns of wall at z = 41), above the 3.5 h rule, so what exists is a new engine (a PROVEN reflection that halves the walk, a P(29) periodic table worth 2.9x, per-block exact re-seeding) reproducing every cited exact sup at z = 13..37 digit for digit, sup\\|R_H\\| at H = z^3 walked for the first time at z = 19..37 (F3 = 26.4 to 35.9, the factor 2 was 1.5 to 2.2x loose), a sealed pre-registration (forecast sup 60.07, band [47.25, 76.37], kill needs sup\\|R_H3\\| >= 1807.417), one pilot twelfth giving lower bounds sup\\|rho~\\|(41) >= 70.651250 and sup\\|R_H3\\| >= 64.416936, and an eleven-segment plan for the box; no bound-and-prune exists on three routes; nothing asymptotic can move whatever the point turns out to be. | 0 | [measure-0830-rho-sup-z41.md](history/staging/measure-0830-rho-sup-z41.md) |\n| `Q-rho2-bound` | ANSWERED | Is there an analytic upper bound on (z) from its proven closed form, and does it matter for RML? | Already proven 2026-08-21 (attack-rhoms-01); the constant is now named, 170.88 z^{2s} ln^8 z; Chebyshev off any second moment diverges from RML (the true C_L = ms = 1 floor clears at z = 41 and 43 and misses by 2.155x at z = 47), so it is an ingredient, not a route. | 0 | [attack-rhoms-01.md](history/staging/attack-rhoms-01.md), [rho2-analytic-bound.md](history/staging/rho2-analytic-bound.md) |\n| `Q-rml-proof-0829n` | PARTIAL | Starting from Lemma V's PROVEN mean-square bound, what is the exact chain of implications to a two-class exponent below beta_2 = 4.26645, which single arrow is open, and does it close? | The chain from the proven mean square to an exponent below beta_2 has exactly one open arrow, the mean-square-to-sup recovery REC(s,u0): sup_x \\|R_H(x)\\| <= z^{u0/2 - eps} rms(R_H) at H = z^{u0} for one fixed u0 in (2, beta_2); every attempt here dies at a named place (term-by-term accounting is capped at 2s + o(1), the trivial-level exponent; position-union pays e^{theta(z)/q}; window smoothing and the P(y) lever move polylog only; the smooth-profile form is closed on hypothesis and priced above beta_2), the arrow is measured TRUE with certified margin z^1.72 to z^1.92 at u0 = 4 over z = 19..37 and the truth's slope 2.766 +/- 0.212 sits 5.8 se under u0 = 4 on seven points under one octave, so the failure is a proof gap at every computable z and undecided asymptotically; no exponent moved. | 0 | [attack-0829n-rml-proof.md](history/staging/attack-0829n-rml-proof.md) |\n| `Q-roughpair-error` | PARTIAL | How big is the empirical error of the rough-pair census, and is Z2 dead on the numbers? | Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit. | Z2 | [attack-roughpair-error.md](history/staging/attack-roughpair-error.md) |\n| `Q-roughpair-null` | ANSWERED | Does the independent-thinning null named in attack-roughpair-error.md's defects list return chi2/df = 1, and is the measured sub-Poisson dispersion of the rough-pair census error real or a normalisation artefact? | MEASURED, null-side, label (i), no bearing on the certificate: the independent-thinning null is binomial and returns 1 - p (0.8164 to 0.9808), not 1, so attack-roughpair-error.md's \"below 1 everywhere: sub-Poisson\" is WEAKENED and the registered F1 fires at u = 5; the deficit against the mean-matched null survives at pooled z = -5.87, -7.09, -11.39; and a CRT-exact null that only makes each prime's kill count exact in the window predicts 0.33 to 0.56, which the measured value EXCEEDS by 1.26 to 1.40, so D8 is interval-level in form, elementary in content, and not wall-relevant. | Z2 | [measure-roughpair-null-0829.md](history/staging/measure-roughpair-null-0829.md) |\n| `Q-round-review-0906` | ANSWERED | Which conclusions of the completed agent round survive review, and which corrections change the next research specification? | The fixed-band lift and continuous moving-window estimate survive the checked source interface. Interval stability additionally gives a dyadic scale-average logarithmic saving, so the blanket scale exclusion was too strong. The rate and missing prime-cofactor terms with s>1 or s'>1 still prevent a twin margin. Proper-prime-power branches already have a negligible bound on the fixed corner. The driver computes integer parity, not the CRT gcd partition; its total coefficient identities survive. Diagonal lower-bound, reachability and six-cut bookkeeping overclaims are corrected. No region, exact residual cut or twin lower bound changes. | C | [round-review-0906.md](round-review-0906.md) |\n| `Q-row11-closure` | CLOSED | Can the (1 - 1/e) greedy-coverage certificate of IMPORT-MAP row 11 ever fire? | No, and now on a producer rather than on prose: the map's paragraph-only pre-pricing reproduces exactly at all six figures it states and extends to the full ladder x = 5..79 with the certificate silent at every level under every constant that could be used, and the step from a density to an algorithm is proved in one line. | none | [row11-closure.md](history/staging/row11-closure.md) |\n| `Q-row11-closure-prereg` | OPEN | Does IMPORT-MAP row 11's (1 - 1/e) certificate reproduce, and does its test ever fire? | Pre-registration only, hand-written and committed before its producer existed: the claim being reproduced, what the producer must return, the pass criteria and the disclosed leaks are all fixed here, with the killing arithmetic still living only in prose. | none | [row11-closure-prereg.md](history/staging/row11-closure-prereg.md) |\n| `Q-row12-lonely-runner` | CLOSED | Does the lonely runner conjecture, or the Birkhoff and bounded-remainder branch, transfer to the Zone Postulate or to G2? | CLOSED WITH MECHANISM on two independent grounds, either sufficient: the general two-class problem is settled at the trivial bound, and the obstruction Tao names is our own configuration; the Birkhoff branch is subsumed and strictly worse from x = 13, and the row's payoff is a wall address rather than the published anchor the map priced. | none | [row12-recon.md](history/staging/row12-recon.md) |\n| `Q-row7-talagrand` | CLOSED | Does Talagrand's concentration on product spaces (IMPORT-MAP row 7) bound anything the corpus needs? | CLOSED WITH MECHANISM: the structural fit is better than the map wrote, since Theorem 8 needs no dependence structure and the shared-draw mechanism that closed rows 3, 4 and 10 does not close this one, but the per-coordinate effect c exceeds the largest tolerable value by a factor that DIVERGES (174x at @11 to 70,576x at @23), and the target hole is on the wrong side of the ensemble/anchor divide, so even a perfect bound would be inert. | none | [row7-recon.md](history/staging/row7-recon.md) |\n| `Q-scanstat-t37` | ANSWERED | What does the seventh exact level T37 do to the linear-in-ln D rule for H, and to the sqrt(m) refutation? | The sealed prediction H*5(T37) = 0.381254, band [0.369866, 0.392641], misses the measured 0.356548 +/- 0.0068 by 3.63 of its own s.e., so per the seal the linear form was a coincidence of a short ladder; the exponent series still rises but is concave in ln D, and G2(37#) is certified exhaustively over 217,929,355,875 slots. | none | [scanstat-t37.md](history/staging/scanstat-t37.md) |\n| `Q-scanstat-t37-prereg` | OPEN | What is the moving-sum exponent H at T_37, predicted before any producer for the pass existed? | Pre-registration only, sealed and committed alone: the prediction band, the criterion, the weak secondaries, the custody gates the producer must pass before reporting and the compute plan are fixed, and T_31 is explicitly excluded as another pre-registration's verdict. | none | [scanstat-t37-prereg.md](history/staging/scanstat-t37-prereg.md) |\n| `Q-scanstat2` | ANSWERED | Does the scan-statistic exponent law survive a sixth exact level, and is the tail factor the extremal index? | Both follow-ups come back negative: T_31 missed the pre-registered exponent rule from outside its own 95 per cent band, so the linear-in-ln D law describes five points and is not a law, and the tail factor is not the extremal index, its correction pointing the wrong way at seven of nine tested places; the sixth level confirms the kill on sqrt(m) harder, at H = 0.3460 +/- 0.0068 against 0.5. | none | [scanstat2.md](history/staging/scanstat2.md) |\n| `Q-scanstat2-prereg` | CLOSED | Does the linear-in-ln D exponent rule predict H(T31), and is the tail factor the extremal index? | Sealed and committed alone before any producer for the pass was written; scored in scanstat2.md, where both follow-ups come back negative: T31 missed the pre-registered band from outside, so the linear law describes five points and is not a law, and the tail factor is not the extremal index, with the correction pointing the wrong way at seven of nine. | none | [scanstat2-prereg.md](history/staging/scanstat2-prereg.md) |\n| `Q-search-conventions` | ANSWERED | In whose vocabulary do these objects live, and which prior-art searches have already been run in the owning convention? | The owning conventions are tabulated by object and the searches already run are listed so they are not repeated; the rule stands that a clean negative in our own wording proves nothing, and section 5 keeps what is still uncovered separate from what is covered. | none | [SEARCH-CONVENTIONS.md](SEARCH-CONVENTIONS.md) |\n| `Q-self-contradiction` | ANSWERED | Which documents in the corpus contradict themselves? | Twenty findings, two rated HIGH because they change what somebody does: theta-ladder.md's retracted crossing still asserted unmarked in three further sections, and G2-STATE.md's confirmed G2(41#) = 546 against three sections still carrying twelve terms; eight more change a number somebody quotes. | none | [audit-self-contradiction.md](history/staging/audit-self-contradiction.md) |\n| `Q-session-0828` | ANSWERED | What did the 2026-08-28 wave establish? | 21 agents, zero routes, four TODO items closed or answered, one HELD headline (Var/E = 0.45546, heuristic). | none | [session-0828-summary.md](history/staging/session-0828-summary.md) |\n| `Q-session-0829` | ANSWERED | What did the 2026-08-29 session (the Z/G object reads, the measurement wave, the red teams, the refuted-claims audit) establish, and what does it leave open? | Nothing moved an exponent or opened a route; the map moved: a Z2-STATE draft exists, both objects carry labelled legal-open-sets, the Gap Reformulation's discarded origin is proven not needed for the implication and measured worth one unit of exponent against a deficit of 2.2665, all 67 REFUTED rows re-derived with none reopening and 27 clauses corrected, and about forty live-layer and HELD-note defects were applied after verification. | none | [session-0829-summary.md](history/staging/session-0829-summary.md) |\n| `Q-session-0830-summary` | ANSWERED | What did the 2026-08-30 overnight campaign (rolling waves of up to ten agents on the queue rewritten after the 08-29 evening wave) change, and what is still open? | Neither exponent moved; twenty-one staging notes landed, all HELD; four routes closed (the skeleton door, the K*-product and fold-composition doubling bridges, the deep-ladder Buchstab transfer), TODO item 4 deleted and items D and 8 parked, the RML route carries an adverse derived floor whose growth law survived one sealed blind test and awaits a red team only Chris can call, Z2's fifth decade rejected the exact-Mertens main term for the omega-form crossing at 13 to 24 se, three record defects were verified on independent code and applied as riders, and a coherence pass corrected 27 lags in the live layer. | none | [session-0830-summary.md](history/staging/session-0830-summary.md) |\n| `Q-session-0904-summary` | ANSWERED | What did the 2026-09-04 wave (four Opus attacks on wall-facing questions, one orchestrator note, four Opus red teams, all verdicts applied) change, and what is still open? | Neither exponent moved; item 0's growth half survived a second adversarial pass so the route is a truth gap at rung derived-and-red-teamed-twice; Face 4's \"no lower bound on the kappa = 2 sifting limit is known\" was a convention failure and published floors at or below 2 are now cited, while the recon's headline that the cap is a method artefact was refuted by its red team; killer 2's coordinate is measured for the first time (argmax mirror-invariant, zero congruence pairs from x = 23, forced) after the multiplicity half turned out to be on the ladder already; no piece of R0 is both legal and parity-exempt with content; L7 is not a transfer; about thirty live-layer sentences corrected across seven files. | none | [session-0904-summary.md](history/staging/session-0904-summary.md) |\n| `Q-shadow-amplitude` | MIXED (shadow-amplitude-prereg.md: OPEN; shadow-amplitude.md: PARTIAL) | Where does the kill shadow's drift amplitude come from, and does the record's counting floor explain it? | The finite-y correction is an identity with no free parameter and both measurement routes agree 10 of 10, but the record's own counting floor is four to six times too small and its candidate explanation is the wrong half, so the label stays PARTIALLY EXPLAINED. | 5 (retired) | [shadow-amplitude-prereg.md](history/staging/shadow-amplitude-prereg.md), [shadow-amplitude.md](history/staging/shadow-amplitude.md) |\n| `Q-shadow-buchstab` | ANSWERED | Is the kill shadow the band-averaged pair-Buchstab integral? | SURVIVES WITH CORRECTIONS, and under the record's own pre-registration the verdict is SHAPE-ONLY rather than DERIVED, since y ~ 1000 misses D1 at 1.49x tolerance; the drift's amplitude is off by about 2.6x, the coefficient has the closed form 2 - 1/ln 2 = 0.5573049591 that the record missed, and anchored-windows section 5 reproduces 32 of 32 from an instrument sharing no code. | none | [shadow-buchstab.md](history/staging/shadow-buchstab.md) |\n| `Q-shadow-prereg` | ANSWERED | Is the kill shadow's 0.85 the band-average of the Unification-Law survival curve over the post-crystallization window? | Scored in shadow-buchstab.md: SHAPE-ONLY under the original y >= 997 rule; D3 passes in the reported ten clusters but D1 fails near y = 1000 at 1.49 times the 0.011 tolerance. Later finite-y normalisation and counting-floor corrections do not promote this verdict. The pair-Buchstab identification remains conjectural; the pre-registration body is preserved. | 5 (retired) | [shadow-prereg.md](history/staging/shadow-prereg.md) |\n| `Q-sharp-corner-transition` | ANSWERED | What is the energy of the complete sharp corner coefficient, and can the smoothed estimate be transferred through a negligible L2 transition? | DERIVED using named analytic inputs: for each fixed 00 both sharp squared norms and sharp-minus-smoothed squared norms are Theta_eta(x log^2 x) on the actual dyadic intervals. Thus an O_eta(x log x) sharp squared norm or negligible L2 transition fails in that range. Signed transition correlations and the global complement remain OPEN. No region, exact residual cut or twin margin changes. | C | [sharp-corner-transition.md](sharp-corner-transition.md) |\n| `Q-sharp-sieve-range` | CLOSED | Do the sharp sieve functions (Jurkat-Richert, DHR) make the two empty certificate-engine theorems non-empty at run levels? | NO at finite level: DH Thm 9.1 carries no written constant and the crude fundamental lemma is strictly better; as limit statements kappa=1 is first non-empty @37 (a 19.8-wide bracket; @53 is the first narrow one, 1.656) and kappa=2 @23. | 8 | [thm-sharp-sieve-range.md](history/staging/thm-sharp-sieve-range.md) |\n| `Q-shifted-prime-decomposition` | ANSWERED | Does decomposing Lambda(dk-2) give a provable saving on any part of the actual shifted-prime sum, and what exact arithmetic remains outside the imported hypotheses? | Both second Type I terms are O_H(x/log^H x) by classical Mobius BV. The residual is an explicit weighted sum over dk-ev=2, equivalently an average of two-linear-form Mobius correlations with growing coefficients and possibly one-point intervals. Its required one-sided improvement is OPEN. No twin lower bound or novelty is claimed. | C | [shifted-prime-decomposition.md](shifted-prime-decomposition.md) |\n| `Q-shifted-prime-mobius-sums` | ANSWERED | At reachable x, do the shifted-prime Mobius and Liouville sums, the cleanest instance of the parity input the twin reduction lacks, show any size or sign structure that a random-sign model does not, and how loose is the trivial bound on M(x) used for the centered tolerance? | MEASURED to x=2^38 (10.9e9 primes). All four sums sit at random-sign size: \\|U\\|/control rms at most 2.8 at any j, slopes 0.28 to 0.65 against the control's 0.43 to 0.47 with per-draw spread 0.19 to 0.30; the pre-registered structure falsifier did not fire. M(x)/x is at most 8.8e-5 in magnitude for j>=29 against the trivial bound 0.374, so the -4x/25 tolerance in moving-cutoff-parity is loose by four orders at these scales; a proof still needs a bound on M, which is the same parity object. The squarefree density of p+2 among primes is 0.747911 at 2^38 against 2*Artin = 0.7479116. pi(2^j) matches OEIS A007053 at every j. Nothing here bears on the asymptotic conjecture. | C | [shifted-prime-mobius-sums.md](shifted-prime-mobius-sums.md) |\n| `Q-sift-limit-discards` | PARTIAL | Where does the dimension-2 sieve discard our structure, and can any of it re-enter to beat beta2 = 4.2665? | Every asset checked against the five discard points has no known consumer and no entry point, and EH and GRH change nothing here; Lemma V's mean-square form is PROVED and hands back a sup bound, the strata are self-similar and it still does not close, L has no combination law of its own, and the 529 covering route is closed rather than unfinished. | none | [sift-limit-attack.md](sift-limit-attack.md) |\n| `Q-sigma31-calibration` | ANSWERED | Is the sigma behind the @31 X-channel detection calibrated at @31 itself? | Calibrated at its own level for the first time: seven known-truth control draws give sigma_true/sigma_reported = 1.127 at the point, 95 percent bracket [0.745, 2.293] (pooled with the earlier draws, [0.772, 1.664]), which restates the detection at z = -2.06 under the point calibration and closes both T2.b findings; the detection weakens rather than dies. | none | [attack-sigma31-01.md](history/staging/attack-sigma31-01.md) |\n| `Q-signed-divisor-grouping` | ANSWERED | Can grouping different fibers while retaining their Mobius signs control an explicit part of R, and what signed error remains after that grouping? | For every fixed H>0 the actual remainder restricted to de<=x^(7/10) is O_H(x/log^H x), although each sign's mass there is at least c*x*log(x) eventually. This follows from a written classical-input derivation, with finite algebra and archived-factor checks. The remaining de>x^(7/10) contribution reduces to an explicit weighted CRT endpoint discrepancy whose required one-sided improvement is OPEN. | C | [signed-divisor-grouping.md](signed-divisor-grouping.md) |\n| `Q-signed-moment` | PARTIAL | Is there an argument for the block that does not pay sqrt(M) at the first Cauchy inequality or that extracts cancellation from the R=0 class, and what are its budgets at the corner a=b=1 and at the target box (delta,nu)=(8/25,9/20)? | The true diagonal has an upper bound x^(1+o(1)) on the transition band, not a uniform nonzero lower bound. Lemma A controls only u1=u2,h1=h2; unequal proportional R=0 pairs remain outside it. Lemma B and the now-priced joint Cauchy arrangement add no region. The former general Holder floor is valid only under additional coefficient assumptions, not for arbitrary sparse coefficients. Conditional off-diagonal budgets and the random-matrix ceiling remain conditional and heuristic. No necessity of using both signs, full-corner estimate or sufficient twin margin is established. | C | [signed-moment.md](signed-moment.md) |\n| `Q-single-alignment` | CLOSED | Does the head's single-alignment fold recursion for M(x, x^3) give a proven-shaped handle on the per-fold multiplier that the max-over-alignments recursion lacked? | The answer splits: the multiplier IS different in shape, measured - exactly 1 at 225 of 240 folds from x = 53, total spend 1.09 nats against a tile-shaped ladder's 7.12, measured M(1613) = 2220 against a tile-shaped 3.7e5 - but the route to a growth law through the recursion closes anyway, because the growth is initiated by the window's expansion into fresh ground, a boundary term that is the localized gap problem re-posed and that no fold reaches. | 0d (retired) | [localized-single-alignment.md](localized-single-alignment.md) |\n| `Q-singleton-fiber-audit` | ANSWERED | Can the one-point fibers of the coupled remainder be discarded or controlled in absolute value at scale x, and what do the actual weights and archived intervals show? | The grouped coefficient is zero whenever either integer is prime. Each sign's ungrouped singleton mass is at least c*x*log(x) eventually for an absolute c>0, by a written derivation from named classical inputs. Finite full-interval and archived-prefix checks validate the partition. The signed singleton and longer-fiber contributions remain OPEN; no twin lower bound or novelty is claimed. | C | [singleton-fiber-audit.md](singleton-fiber-audit.md) |\n| `Q-skeleton-bound` | PARTIAL | Does the aggregate 30-skeleton bound hold, and can it be certified at every level? | Certified as an exact BigInt inequality at six levels @11 through @29, margins 0.287 to 0.406, with the Skeleton Collapse Theorem proven for all x and all q and an exact exception criterion; the all-x form is open and its blocking term is prime-equidistribution of window residues rather than branch algebra. | none | [natal-cap-30-skeleton-bound.md](natal-cap-30-skeleton-bound.md) |\n| `Q-skeleton-decide-0830` | ANSWERED | Should TODO item 4, \"Skeleton Equidistribution: restate or demote\", be restated around the modulus-W mass or demoted off the board, and what exactly is banked either way? | DEMOTE. Over every scour prime the branches on which the door is a fixed-modulus question carry 9.2, -0.9, 0.2 and 0.5 percent of the skeleton at @13, @17, @19, @23 (the -10.8 and 5.5 percent on record were 9 and 2 percent subsamples), so the door as named removes at most 0.0102 from a G30_agg whose open part is 0.094 to 0.126; on the open side the phase never wraps and no equidistribution statement remains, only the inequality; nothing on the live board consumes G30_agg < 1/2; no first move exists that is not already ANSWERED. Banked regardless: the Skeleton Collapse Theorem (PROVEN, all x, all q) and G30_agg < 1/2 CERTIFIED at six levels @11..@29. | 4 (retired) | [decide-0830-skeleton-door.md](history/staging/decide-0830-skeleton-door.md) |\n| `Q-skeleton-door` | ANSWERED | Is the Skeleton Equidistribution Conjecture the blocker on the anchored calm? | It is not the blocker as far as the door can be seen: Theorem A (Trapezoid Cancellation) is proven for all x, q and branches, @29 is certified as an exact integer inequality at G30_agg = 0.1176 with margin 0.3824 over 7,863 scour primes, and the decay-law shortcut is REFUTED, the six levels being flat within their own spread with every fit made strictly worse by adding @29. | 4 (retired) | [natal-cap-36-skeleton-door.md](natal-cap-36-skeleton-door.md) |\n| `Q-small-divisor-kernel` | ANSWERED | Does reciprocity separate the j<=x^(1/20) kernel of grouped-divisor-moment (21) at delta=8/25, nu=9/20, and do the Duke-Friedlander-Iwaniec / Bettin-Chandee and Kuznetsov interfaces then supply the required saving? | The separation is exact and cheap: reciprocity splits index by index, the correction phase has sup norm and total variation O(A/(MN))=O(1/x) at this box, and Mellin separation of the endpoint weight costs x^epsilon with L1 mass min(1,Ax/(MN)), so the whole block reduces to a pure trilinear Kloosterman fraction with unimodular twists. The interfaces then fail by explicit amounts: Bettin-Chandee Theorem 1 gives block exponent 129/125, above the required 1 by 4/125 and above the classical 103/100; DFI (1.1) gives 1267/1200; every box Bettin-Chandee controls is already controlled, verified on 19005 rational boxes; the audit's spectral diagnostic factor is trivial for all common divisors up to x^(19/50). Closing this box inside the same interface needs the (M+N) exponent below 27/140 or the (AMN) exponent below 9/28. Target (21) and the global twin margin remain OPEN; nothing is added to the controlled region. | C | [small-divisor-kernel.md](small-divisor-kernel.md) |\n| `Q-smooth-sieve-literature` | PARTIAL | Which nearby published results should be imported instead of rediscovered, and do their methods give a more focused next question for the complete global remainder? | Existing sources supply the finite-difference mechanism, one-point concentration and quadratic profile optimization; shifted divisor-sum estimates admit fixed shift two under their own support and smoothness conditions. A derived application of corrected Henriot bounds gives small-prime mass O_sigma(delta^sigma x)+O_epsilon(x^(39/40+epsilon)), uniformly in delta for fixed 0floor(x^(77/100)) as a fourth simultaneous condition of W_dagger through the Perron machinery, changing only the summation domain of E_dagger. The target box (407/400), the corner, the uniform product threshold 19/25, the sign of E_dagger and the global twin margin are unchanged; the margin remains OPEN. | C | [structured-dispersion-estimate.md](structured-dispersion-estimate.md) |\n| `Q-supported-coefficient-dickman` | ANSWERED | Can the whole supported coefficient be priced using existing literature before enumerating its factor cells, and does the resulting separate-sign sieve estimate supply a positive twin margin? | DERIVED from classical inputs: at delta=1/100 the harmonic limit is H_delta=D(25/12)-1+E_delta with 0<=E_delta<=24/22!, hence -13/2, where I is the explicit ordered two-factor integral below. A three-prime left input and rough composite right input suffice; prime partners are subtracted using an upper sieve. The witness survives every fixed delta<1/50 and every averaging profile with the same plateaus. Consequently the negative-only consumer is false, and liminf Phat/(C2*x)>1/2. The signed twin margin remains OPEN; literature novelty is unestablished. | C | [switching-negative-mass.md](switching-negative-mass.md) |\n| `Q-tail-deficit-model` | ANSWERED | Does the exact compound-geometric thinning of the previous level's own gap histogram, with the qualifying-gap constraint g = 0, +/-2 (mod q) carried through the ladder, predict the tile's tail-deficit factor G2/(mbar ln D) at zero parameters, and does that make object-models-read-0829's D5 residue-level classification constructive rather than inferred? | NO. The zero-parameter CRT-constrained thinning predicts a tail HEAVIER than the tile's at every level, delta_M2 = 0.6461, 0.6746, 0.7021 against a measured 0.4577, 0.4463, 0.4791, so the pre-registered \"classification was wrong\" arm fires and D5 returns to OPEN with C3's constructive route REFUTED; the constraint is informative but small, carrying 4.0 to 10.0 percent of ln(null/truth) at the far tail, or 7.7 to 14.4 percent read against a rate-matched control, against the grain's ORDER at 39.4 to 54.6 percent at the deepest abscissa each level resolves; at shallow abscissae the ordering reverses (B 8.7 against C 4.8 at x = 23, u = 4), which the exact operator on a shuffled true grain confirms without any model (maximum 276, 354, 426 against the true 204, 258, 348), and the order effect is now localised (sections 7 and 9): a first-order Markov word from the true adjacent-pair statistics carries 32.3, 34.2 and 60.8 percent of ln(shuffled/truth) at the deepest abscissa of the three folds, and a SECOND-order word from the true adjacent-triple statistics carries 97.3, 97.9 and 102.6 percent there, r = 0.972, 1.061 and 1.000 on draw-mean maxima over 40, 20 and 10 draws, so the folded tile's tail is MEASURED to be a function of the previous grain's three-consecutive-gap statistics and of essentially nothing longer-range; that surrogate is seeded on the true previous grain at one fold, is not iterated, predicts no delta and does not revive C3, and the 348.0 sd 0.0 at 29->31 rests on ten draws. | 0 | [measure-tail-deficit-0829.md](history/staging/measure-tail-deficit-0829.md) |\n| `Q-tail-derivation-0830` | PARTIAL | Does the tail's measured law c = 0.7522 ln^2(p'^2) and its surplus derive, and which part of the coefficient is the tile's own (no prime input) against which part needs Hardy-Littlewood? | PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3. | Z4 | [attack-0830-tail-derivation.md](history/staging/attack-0830-tail-derivation.md) |\n| `Q-tail-maximal` | CLOSED | Is a tail-only maximal inequality a smaller ask than the full one, as attack-AB-bounded section 4.4 supposed? | No: the split is exact but is a reparametrisation rather than a localisation, the tail is maximal and saturates the Gaussian law, a fixed cut buys nothing asymptotically, and the tail is not a smaller ask but the whole ask. | none | [attack-tail-maximal.md](history/staging/attack-tail-maximal.md) |\n| `Q-tailcount-transport` | ANSWERED | Does the Tail-Count Transport survive an independent adversarial re-derivation? | The inequality, the certificates and the NO-CHAIN verdict all STAND on an implementation written from the operator definition, with a seventh fold added exact (31: 348 = 348); three corrections follow, the stated equivalence is false at fold 29, zero loss is exactness-by-relaxation rather than a tail fact, and the measured spends are 1, 1, 2, (1 or 2), 3, 2. | none | [verify-tailcount-transport.md](history/staging/verify-tailcount-transport.md) |\n| `Q-tau-repricing` | CLOSED | Does the tau(m) re-pricing of the x-free bound stand? | The separability claim is true and re-derived four ways, but the re-pricing substitutes one quantity for a different one: summed over the modulus set the tau(m) bound IS the divisor-pair count up to the vector sieve's fixed factor 3, and used as a bound it is 4 to 5x weaker than the exact quantity in the Fourier basis and 23 to 44x weaker in the divisor-pair basis. | none | [attack-tau-repricing.md](history/staging/attack-tau-repricing.md) |\n| `Q-the-dials` | ANSWERED | Which variables can this programme actually push, and which is Chris missing? | The square frontier constrains certification from roughness alone, not every arithmetic method. The current campaign uses long intervals, a classical Chen benchmark and an OPEN signed estimate; uniform maximum-gap control is a sufficient secondary target. Finite slopes do not determine an asymptotic exponent. | none | [THE-DIALS.md](THE-DIALS.md) |\n| `Q-the-lens` | ANSWERED | Why is the tile the right object, and what does the lens buy? | Completeness is PROVEN and elementary (every twin prime above p is a twin slot of T_p) and the recursion is exact; nothing here is claimed as new mathematics, and the triage rule of section 5 states what the lens does not buy. | none | [THE-LENS.md](THE-LENS.md) |\n| `Q-theta-ladder` | CLOSED | Does the all-positions exponent theta turn over below 2, converge to exactly 2, or settle above 2? | The answer is above 2 with an amendment, and the route is retired regardless: theta does not turn over (it dips and comes back, need/z^2 = 0.3550 to 0.6119 at z = 13..31 and rising from 31), convergence to exactly 2 is not supported (e = 1 rejected at 95% in all four fits), point estimates run 2.37 to 2.99 without settling, and OUTCOMES.md records the certificate route as RETIRED because the sharp maximal law it needs is itself TPC-implying. | 0 | [theta-ladder.md](theta-ladder.md) |\n| `Q-theta-last-gap` | CLOSED | Can the last 0.209 of theta_total be recovered by sharper absolute-value accounting? | No: theta_total stays 1 and the obstruction now carries an exponent, the absolute-value ceiling is c*H^theta_total with c > 0 rather than H*polylog, so the shortfall is a power H^0.212 and the entire budget any constant could ever buy is O(lnln H / ln H) against a break-even of 1.208983. | none | [attack-theta-last-gap.md](history/staging/attack-theta-last-gap.md) |\n| `Q-theta-selfconsistent` | ANSWERED | What does the exact-supremum theta ladder give when re-run self-consistently in H? | All five published self-consistent values reproduce exactly from two independent implementations; z = 31 is now measured at nP = 588, nP/z^2 = 0.6119, so the published 1.1776 is overstated by 1.93x, continuing the pattern, and at z = 47 a prefix walk finds the certificate failing at H = 1.0412 z^2, so the self-consistent unconditional requirement leaves the zone budget by z = 47. | none | [theta-selfconsistent.md](history/staging/theta-selfconsistent.md) |\n| `Q-transition-energy-review` | ANSWERED | Does the sharp-energy chain in sharp-corner-transition.md survive an adversarial check, and do the upper norm, the small-fixed-eta lower norm and the failed negligible transition each stand at their stated scope? | All ten assigned rows survive at their stated scope; no counterexample or decisive contradiction was found. The upper norm, the small-fixed-eta lower norm and the refuted negligible L2 transition each stand separately. Two repairs are citation-level only: the integer Barban-Vehov input is Graham 1978 quoted by Chen An, and the note should record why the k=Q constant is absolute. The de la Breteche-Dress-Tenenbaum PDF was refetched and its SHA-256 matches the pinned hash; its (1.5) and Theorem 1.1 supply exactly the imported (3) and (4). eta_0 remains positive and unextracted, and the signed sums, E_out and the twin margin remain OPEN. | C | [transition-energy-review.md](transition-energy-review.md) |\n| `Q-transition-energy-review-spec` | ANSWERED | What independent checks are required before the sharp-energy and non-negligible-transition conclusions can guide the next signed research attempt? | Bounded review assignment with explicit source, algebra, interval, error and quantifier checks; per-claim verdicts and dependency consequences are required. The assignment is specified, not executed. | C | [transition-energy-review-spec.md](transition-energy-review-spec.md) |\n| `Q-transition-joint-budget` | PARTIAL | Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | The exact split, cutoff-average identities and separate upper budgets survive. Averaging cutoff norms after triangle and Cauchy is saturated for sufficiently small fixed eta, but signed cutoff arguments and joint cancellation are not closed. R_00 need not be estimated separately under every grouping. The short-window constraint is corrected with a bounded majorant and a safely reduced lower constant. No consumer input or signed improvement is supplied; E_out and the sufficient twin margin remain OPEN. | C | [transition-joint-budget.md](transition-joint-budget.md) |\n| `Q-transition-joint-budget-spec` | ANSWERED | Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | Bounded assignment to audit the exact four-term decomposition, price a concrete joint treatment, and return a sufficient one-sided or common-scale inequality with all open terms explicit. The decomposition and existing norm budgets are inputs, not new findings. | C | [transition-joint-budget-spec.md](transition-joint-budget-spec.md) |\n| `Q-transition-research-execution` | ANSWERED | How should the core research handler execute and integrate the three bounded transition assignments while retaining the central signed estimate? | Prepared execution contract with a fixed mathematical baseline, three independently assignable specs, handler-owned signed research, dependency checks, shared-file ownership, reporting requirements and stopping rules. Execution is complete; the corrected results are in transition-round-review.md and transition-round-audit.md. The specification itself supplies no arithmetic estimate. | C | [TRANSITION-RESEARCH-EXECUTION.md](TRANSITION-RESEARCH-EXECUTION.md) |\n| `Q-transition-round-audit` | ANSWERED | Which conclusions of the completed transition round survive direct review, which require correction, and what research decisions remain justified? | The sharp upper norms and sufficiently-small-fixed-eta lower norms survive. The integration contained substantive errors: an omitted lower cutoff, an incorrect Mellin formula for the transition, a conflation of singleton divisor fibers with long cofactor fibers, an unpriced source representation and overbroad closures of joint or cutoff arguments. Owning notes and current records are corrected. No signed improvement or sufficient twin margin is established; the corrected cofactor and joint-correlation interfaces remain open. | C | [transition-round-audit.md](transition-round-audit.md) |\n| `Q-transition-round-review` | ANSWERED | What survives the executed transition round after direct review, and what combined estimate is still missing? | The energy chain survives at its original scope; the integration's missing cutoff, Mellin representation, fiber identification, normalization and general closure claims are corrected. The exact cofactor and joint-cutoff formulations remain useful. No signed estimate, controlled region, exact cut or sufficient twin margin changed. Only the stated norm-only procedure and the arbitrary-factor fixed-shift relaxation are refuted at their specified scopes. | C | [transition-round-review.md](transition-round-review.md) |\n| `Q-transition-signed-estimate` | PARTIAL | Can the signed transition kernel (E1) be estimated beyond its absolute norm budget, and if not, what exact input does the consumer need? | No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN. | C | [transition-signed-estimate.md](transition-signed-estimate.md) |\n| `Q-transition-source-match` | ANSWERED | Do the inspected divisor-correlation, shifted-convolution and averaged-Chowla statements directly supply a usable estimate for the exact transition kernel? | No direct supplier was established among the inspected statements. The cofactor exchange and Theta identity are exact, but their scalar coefficient mass is not a full bounded-class representation for T. The transition Mellin kernel requires a sharp subtraction with a 1/s tail. Fixed-divisor singleton fibers differ from potentially long cofactor fibers. The fixed-shift arbitrary-factor relaxation is refuted; broader signed and cutoff methods remain open. | C | [transition-source-match.md](transition-source-match.md) |\n| `Q-transition-source-match-spec` | ANSWERED | What bounded source investigation could supply a usable signed estimate for the transition kernel, and how must its hypotheses and losses be priced? | Specification for up to three detailed source-interface assessments, including coefficient representation, scale quantifiers, normalization, separation errors and exact downstream payoff. No new theorem match or literature-absence result is claimed. | C | [transition-source-match-spec.md](transition-source-match-spec.md) |\n| `Q-twin-reduction` | ANSWERED | What has the arithmetic campaign of 2026-09-05 and 2026-09-06 actually established about the twin sum, at what calibration, what exactly remains, and what would suffice? | Consolidates the checked regional reduction S=C2*x+E_dagger+O_H(x/log^H x), its sufficient unbounded-scale margins, coefficient definitions and source dependencies. Later complete smooth and centered formulations are owned by RESEARCH-HANDOFF.md and their linked derivations. No new arithmetic estimate is supplied. Imported theorem proofs retain their stated review limits; every sufficient twin margin remains OPEN. | C | [TWIN-REDUCTION.md](TWIN-REDUCTION.md) |\n| `Q-two-class-lower-bound` | PARTIAL | What does the two-class LOWER bound on G2 say, and does it conflict with attack E's measured law? | The finite range cannot decide and it is not close: with both constants set to 1 the transferred bound and attack E's measured law do not cross until x = 10^7327 while the exact ladder stops at 79, so neither result refutes the other and no computation ever will. | none | [attack-lower-bound.md](history/staging/attack-lower-bound.md) |\n| `Q-two-class-lower-bounds` | PARTIAL | How large can G2(x#) be FORCED to be? | The best PROVEN lower bound costs nothing, the Kalmynin-Konyagin substitution is carried out here (DERIVED, independently checked, not refereed), and the certificate ladder is MEASURED with an oracle test whose load-bearing caveat is stated on its own; against the target x'^2 and the proven x^(4.2665+eps) upper bound the question stays open. | none | [two-class-lower-bounds.md](two-class-lower-bounds.md) |\n| `Q-two-moire` | ANSWERED | Do the Grain and the Scour, generated by disjoint prime alphabets, force twins to be infinite? | The provable content is exact CRT factorization: over the JOINT period the miss count is guaranteed positive, so aggregate alignment is arithmetically impossible, but that is an aggregate statement over a period vastly wider than the zone and does not reach TPC; the nearest unclaimed theorem is a two-class Jacobsthal upper bound at ANY exponent, and exponent < 2 would prove TPC outright. | none | [two-moire-argument.md](two-moire-argument.md) |\n| `Q-u-frame` | PARTIAL | Does restating the Zone Postulate as one inequality in u, stepping on odd numbers rather than on primes, buy anything against the wall? | It buys form and closes off a class of dead ends, but no difficulty and no slack: the requirement ln c(p) <= 2 ln p/p is exactly what the per-prime analysis already gave and the measured ladders run at about the full rate, so this is a change of coordinates rather than of terrain. | none | [U-FRAME.md](U-FRAME.md) |\n| `Q-u2-engine-depth` | ANSWERED | Is the certificate engine's operative depth heading to u = 2, and does that make TODO item 8's payout form TPC-strength? | It is not: the measured operative depth runs u = 4.191 at @17 down to 3.557 at @97 and is still falling, so the brief's conditional does not fire and item 8 is shown neither TPC-strength nor safe; a WALL-ADDRESS in the weakest sense, every figure SCRATCHPAD-GRADE. | 8 | [u2-engine-depth.md](history/staging/u2-engine-depth.md) |\n| `Q-unreached-sources` | ANSWERED | What is actually in the three sources SEARCH-CONVENTIONS section 5 lists as unreached? | The 2009 SeqFan thread on A144311 does not exist, now a read negative over 19,964 archived messages with zero hits; Paseman's n is the number of distinct prime factors and at that reading his shape is asymptotically weaker than our x^{4.2665}; MathSciNet stays paywalled and unswept. | none | [audit-unreached-sources.md](history/staging/audit-unreached-sources.md) |\n| `Q-usup-convention-0830` | ANSWERED | Are lemmaV-sup-extension.md's u_sup and u_sat and attack-0829n-rml-proof.md sec.4.1's CAP(z) statements about the same object (level D = z^s at s = 3.0, same moduli, weights and normalisation), so that the sec.4.1 correction in passing applies, or does a level-convention mismatch void it? | SAME object, VERIFIED at the code: both notes build the lattice through buildTerms(z, z^3), the modulus sets and Vabs(e) agree to 6.9e-18 at z = 13..23 and the count convention matches at all ten levels, the cited Ssat and u_sat reproduce on the RML lattice to every printed digit at z = 13..19 and the full-level alternative does not (19.544 against 19.602 at z = 13, 45.827 against 50.314 at z = 17); so the PROVEN cap Ssat <= CAP <= z^{2s+o(1)} applies and refutes lemmaV-sup-extension.md's asymptotic prose at lines 485-486 and 508-516 (2^pi(z) moduli, a C^pi(z) theorem as the reachable end), while sec.4.1's attribution sentence overreaches by calling that note's \"reading\" a shape it lists as one of two indistinguishable fits and flags as its likeliest error; neither ledger verdict line changes. | 0 | [verify-0830-usup-convention.md](history/staging/verify-0830-usup-convention.md) |\n| `Q-var41` | OPEN | What does the stable law predict for Var(41), and what can the tenth Var/E point pin? | Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift. | 2, 9 | [var41-prereg.md](history/staging/var41-prereg.md) |\n| `Q-varE-identification-0830` | PARTIAL | Can either open step behind lim Var/E = 0.45546 (the identification delta*(X - X_dec) -> 0, or the theta = 2 mean-coefficient replacement) be proven, and if not, which single inequality does not close? | Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength. | 9 | [attack-0830-varE-identification.md](history/staging/attack-0830-varE-identification.md) |\n| `Q-varE-limit` | PARTIAL | Does lim Var/E on the diagonal window exist, and what is it? | The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open. | 9 | [lit-dickman-variance.md](history/staging/lit-dickman-variance.md), [lit-smooth-divisors.md](history/staging/lit-smooth-divisors.md), [varE-asymptotic.md](history/staging/varE-asymptotic.md), [varE-exact-ladder-01.md](history/staging/varE-exact-ladder-01.md), [varE-limit-theorem.md](history/staging/varE-limit-theorem.md), [varE-spectral.md](history/staging/varE-spectral.md), [varE-theta2-proof.md](history/staging/varE-theta2-proof.md), [varE-theta2-step.md](history/staging/varE-theta2-step.md) |\n| `Q-vc-prior-art` | ANSWERED | Does arXiv:2208.06442 contain or overlap the VC-dimension = 4 finding of import-vc-nets? | DISJOINT at theorem level; not found there nor in the reachable one-hop neighbourhood; Helmbold-Sloan-Warmuth 1992 Thm 3.1 owed (abstract only). | none | [lit-vc-multiples.md](history/staging/lit-vc-multiples.md) |\n| `Q-verify-audit-numbers` | ANSWERED | Is audit-numbers.js circular? | Not circular in the way that would matter most, since it reads no other repo script, but 15 of its 117 checks certify nothing and 17 more are artifact echoes among transcribed constants; the one bug class the charter was written against had nothing in sections A to W to fire against and still has nothing, and one from-scratch re-implementation found a check depending on an unnamed hard-coded phase choice. | none | [verify-the-verifier-numbers.md](history/staging/verify-the-verifier-numbers.md) |\n| `Q-verify-cofactor-convolution` | ANSWERED | Does the cofactor-convolution identity at the anchor hold, and does it test the joint law? | RESTATED with corrections: the arithmetic is right, an independent re-derivation reproducing every figure to the digit at all five levels and confirming the asserted closed-form step, but the framing does not survive, since X is pinned by the identity X = M - Nbar + n_0 so the whole comparison collapses to one cell and the joint is measurably not a product elsewhere; the model error is 0.52 per cent, not 0.050. | X | [verify-cofactor-convolution.md](history/staging/verify-cofactor-convolution.md) |\n| `Q-verify-monotone-depth` | ANSWERED | Does the Monotone Depth obstruction, which retires dial 4, survive an adversarial re-derivation? | NARROWED: every measurement in the record reproduces, several to the last digit, but the mechanism as named is false as a general law and the corpus already holds a counterexample to it; what survives is an accounting of three channels priced in tenths of a nat against a need of 6.700, 8.191 and 9.637 nats, so dial 4 becomes priced slack with one channel open and unpriced. | 0e (retired) | [verify-monotone-depth.md](history/staging/verify-monotone-depth.md) |\n| `Q-verify-record-defects-0830` | ANSWERED | Do the three defect claims of 2026-08-30 (attack-0830-varE-identification.md sec.8 on the doubled X2 column; attack-0830-tail-derivation.md sec.7 on the corpus's \"R + 1/2\"; attack-0830-head-remainder.md sec.1 on the decade-pooled Delta = 0.6214) reproduce on independent code from the definitions, and which of the corrections they list apply? | Claim 1 CONFIRMED: the corpus delta*X2 column is the positive half of the p \\| h-2 pattern doubled, that pattern's mirror is the p \\| h+2 pattern (W-(-h) = W+(h) exactly, W-(h) != W-(-h) at 9 to 900,679 shifts), the group sum 2X2 reads -0.5603 .. 0.1846 at x = 7..19 against 5.7147 .. 5.3266, and Xmix is overstated 2.305x at x = 19 (6.9x at x = 7); X, X1 untouched. Claim 2 AMENDED: R + 5/2 and R + 3 are exact for the tail convention (all and odd origins, asserted at x = 7..23) and t/(R + 3) = 1.0228, but head-residual-factor.md:70 is the HEAD's forward convention where R + 1/2 and R + 1 are exact, so that correction does not apply; and p'^2 is 1 mod 6, where the tail constant is 5 (t/(R + 5) = 1.0181), with the class null (1.0157) the matched figure, so 1.0228 is one unmatched convention replacing another. Claim 3 CONFIRMED as an artefact, AMENDED on mechanism and on the half-decade reading: 0.6214 pooled against 0.6592, 0.6705, 0.6736 at 2, 4, 8 sub-windows; the between-slope (Simpson) piece the note derives is half of the pooling term (0.0187 of 0.0378 at halves, 0.0261 of 0.0522 at eighths), the other half is the within slope's own fall with height weighted by Var(g); and re-reading the halves from their eighths puts HL BELOW the measurement at 5 of 6 half-decades by 2.5 to 3.4 percent at the top decade, so \"within 1.6 s.e., sign alternating\" is itself a pooled statement. | Z4, 9 | [verify-0830-record-defects.md](history/staging/verify-0830-record-defects.md) |\n| `Q-verify-the-verifier` | ANSWERED | Does the QC gate's alarm ring when a defect of each real class is present, rather than merely reading green? | Of the 31 blind mutations the existing selftest covers zero: it is a reachability test proving each alarm can ring, never a sensitivity test asking how far a defect must move before the alarm stops, and its fourteen controls are all obvious silences; the ranked blind spots are listed with a proposed fix each, led by out-sha256 being written and never read. | none | [verify-the-verifier-checks.md](history/staging/verify-the-verifier-checks.md) |\n| `Q-w1-singular-series` | ANSWERED | What is the endpoint comb W1 in the literature's terms? | W1 is exactly the Hardy-Littlewood singular-series ratio for (0, 2, v, v+2) over the twin series squared, truncated to the folded primes and normalised by a v-independent constant, PROVEN algebraically and VERIFIED as exact BigInt-rational equality, so the fold-factor comb is the twin-twin correlation comb evaluated at v = theta_p. | none | [w1-singular-series.md](history/staging/w1-singular-series.md) |\n| `Q-width-repairs` | ANSWERED | Can the five loaded containers found by the width sweeps be guarded without invalidating any embedded figure? | Forward protection only: every repair is a widening or a bound check, storage-only by construction, no corpus figure was retroactively corrupt and none moved, with maxgap-law.js at 0 of 1389 figures unreproduced and attack-foldL-01-census.js byte-for-byte on the same out-sha256. | none | [width-repairs.md](history/staging/width-repairs.md) |\n| `Q-width-sweep` | ANSWERED | Which big-level enumeration and census scripts carry a fixed-width container that is safe at every level run and aliases silently above a threshold? | Three instances: two CORRUPT (the one-word residue mask that corrupted the census from x = 37 up, and a Uint16 index into the scour-prime array in the @37 census, both since fixed) and one that threw rather than aliased; every internal identity in the corrupted producer is a COUNT identity and stayed PASS throughout, because the alias corrupts which prime, not how many. | none | [width-sweep-census.md](history/staging/width-sweep-census.md) |\n| `Q-width-sweep-attacks` | ANSWERED | Does the attack and analysis script family carry the fixed-width-container defect class that corrupted the @37 census? | No live corruption across 123 scripts, every stored value derived at the level actually invoked and fitting its container; one hazard is serious, attack-x-offset-02-profile.js storing an index into the scour-prime array in a Uint16Array, the identical mechanism in the identical role as the census defect fixed at 605ce83, and it fires at @37. | none | [width-sweep-attacks.md](history/staging/width-sweep-attacks.md) |\n| `Q-wrap-identity` | ANSWERED | Can T4 be computed without enumerating quadruples? | Yes: the 4-point wrap identity exists and is verified through @13 against the certified value, turning @17's dead T4 (4.9e16 quadruples) into an 11-minute computation, but at a precision that certifies T4 itself and not yet the quartic bound. | none | [natal-cap-32-wrap-identity.md](natal-cap-32-wrap-identity.md) |\n| `Q-wrongdirection-audit` | ANSWERED | Are any of the ten live targets secretly TPC-strength, before the sessions are spent on them? | The audit closes no target: two of the ten come out TPC-strength and three more carry a TPC-strength face under a quantifier they are likely to drift into, which is a labelling result and not a reason to drop them; item 1e is settled only because the answer was already on disk, and one route-blocking number in it is hand arithmetic and unstamped. | 1e (retired) | [attack-wrongdirection-audit.md](history/staging/attack-wrongdirection-audit.md) |\n| `Q-xchan-at29-prereg` | OPEN | Does the joint-deficit closed form survive a blind test at @29? | Pre-registration only, committed alone before any producer existed: the statistic, the predictions adopted verbatim from the record, two acceptance bands, the validation gate the instrument must clear before any @29 number is reported, and what each verdict does to TODO item X. | X | [xchan-at29-prereg.md](history/staging/xchan-at29-prereg.md) |\n| `Q-xchan-at37-offset` | ANSWERED | Does any registered offset-correction candidate for the ~3.8 law survive at @37? | Sealed and committed alone before any @37 census of any kind existed, fixing the candidates, the sigma model and its projection band, the scoring rule and what each verdict does to item X's offset clause; scored in xchan-at37-score.md, where every registered candidate is killed and the number survives an independent recount. | X | [xchan-at37-offset-prereg.md](history/staging/xchan-at37-offset-prereg.md) |\n| `Q-xchan-at37-score` | ANSWERED | What does the @37 census say about the sealed X-channel offset pre-registration? | The census measured 1 - J = 0.020823, below every registered prediction, so scored exactly as registered every one of the seven candidates dies at \\|z\\| = 104 to 122 and the survivor set is EMPTY, an outcome the sealed prereg has no consequence clause for; the number itself survives an independent recount on a different marking scheme, and the offset question is replaced by a larger one. | X | [xchan-at37-score.md](history/staging/xchan-at37-score.md) |\n| `Q-xchannel-at23` | PARTIAL | What is the fifth point of the X-channel statistic, at @23, and does the monotone rise hold? | The fifth point is +0.2658 at @23, the rise holds at five levels and is larger than the four-point trend predicted, and the deficit has migrated into m >= 3, whose share of the X-gap runs 10.5, 23.5 and 81.1 per cent at @17, @19 and @23; the constant itself is not derived here. | X | [xchannel-at23.md](history/staging/xchannel-at23.md) |\n| `Q-xchannel-closedform` | PARTIAL | Does the zero-parameter closed form for the joint deficit survive its two blind tests at @29 and @31? | 1 - J = 4S2 is the only one of the three pre-registered laws left standing and it is not exact: a clean hit at @29, z = -0.90, and 4.93 sigma low at @31 where sigma_J falls to 0.000024, with the two rivals dying at 6.35 and 20.81 sigma; both blind levels agree on a stable relative offset of about half a percent, -0.41% and -0.48%, whose absolute residuals match to 2%. | X | [xchan-at29.md](history/staging/xchan-at29.md) |\n| `Q-xchannel-offset` | PARTIAL | What produces the ~3.8 law's -0.45% offset, and which candidate correction survives? | The best available description is a finite-level correction of S3's size and sign - 1 - J = 4S2 - S3 scores z = +0.04 at @29 and -0.41 at @31 where the standing law scores -0.43 and -2.32 - but it is POST HOC; two candidate corrections and one shape are refuted on existing data, the sigma behind the @31 detection is calibrated on seven known-truth controls, and the deciding blind test at @37 is pre-registered and committed alone. | X | [item-x-offset.md](history/staging/item-x-offset.md) |\n| `Q-xchannel-triples` | ANSWERED | Does the joint deficit deepen or decay as the mixed super-W triple census is extended past @17? | It decays: J = 0.9025, 0.9599, 0.9659 at @17, @19, @23, so the deficit runs 9.7%, 4.0%, 3.4%, both new points land inside the pre-registered DECAYING FASTER THAN FORCED band, and the DEEPENING instinct is refuted by 3.50 sigma between @17 and @19 and a further 1.68 sigma to @23. | X | [xchannel-triples.md](history/staging/xchannel-triples.md) |\n| `Q-y2-recompute` | ANSWERED | Does the sixteen-level Y2 ladder reproduce on the corrected instrument, and does Y2/x^2 fall? | The ladder reproduces exactly, sixteen of sixteen from sixteen independent processes, digit for digit against the published 2026-08-18 ladder, and Y2/x^2 falls at 15 of the 15 consecutive steps; this does NOT show that G2(x#)/x^2 falls, since the shortfall Y2/(G2-1) is unmeasured above x = 79. | 1d | [y2-recompute.md](history/staging/y2-recompute.md) |\n| `Q-z2-state` | PARTIAL | What is known about Z2, the largest gap between twin openers inside the zone (p, p'^2), and at what calibration? | Draft consolidation only, computes nothing new: the zone statement is an interval statement, the parity obstruction applies to it in full, and no proven statement about Z2 survives past the zone's own width. | none | [z2-state-draft-0829.md](history/staging/z2-state-draft-0829.md) |\n| `Q-z3-immune` | CLOSED | Do the square anchor's immune offset classes (stretch-01 §4) carry a survivor surplus beyond the redistribution-only guardrail, do they attract the floor's first survivor, and does restricting the transplanted caps to them lower K*? | No, on all three. The preregistered surplus test is VOID on its own matched control (a 0.6% ratio-of-means bias present with and without the quadratic point); the preregistered placement test HOLDS at Z = +0.49; the design-free class test reads the guardrail's r/(r-2) over 3.4 million twin openers with a largest per-prime deviation of 0.11% and per-prime Z in -0.48..+1.66; and the restricted certificate, while lowering K* at 61% of anchors, has no certificate at all at 93 of 1219 and is beaten head to head by the QR-BLIND restriction that certifies 1219 of 1219. The refinement is closed. | Z3 (retired) | [attack-z3-immune-01.md](history/staging/attack-z3-immune-01.md) |\n| `Q-zone-postulate` | OPEN | Is every zone occupied by a twin pair, and what is proven toward it? | OPEN: the weak form is PROVEN equivalent to the twin prime conjecture (both directions, elementary), the zone's supply is MEASURED to grow like p^2/ln^2 p with margin about p and verified by segmented sieve to 1e11, and the obstruction is named; none of the four attack routes closes it. | none | [ZONE-POSTULATE.md](ZONE-POSTULATE.md) |\n| `Q-zone-tail` | PARTIAL | What is the tail field of the zone (p, p'^2) - its law against ln^2, its worst case, its share of the R0 width, and is it the frozen-sieve last survivor below p'^2 at the rate the head is the frozen sqrt(p)-level first survivor above p? | The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after. | Z4 | [zone-tail-01.md](history/staging/zone-tail-01.md) |\n| `Q-zone-tail-02` | ANSWERED | On the full zonegap-01 range to 1e11, what is the per-zone tail law in both units, is the renewal surplus t/R real at 27,292 zones, and do the head and the tail of a zone have a joint law? | Resolved DOWN and nothing is derived: zone-tail-01's unresolved t/R = 1.0619 at 782 zones reads 1.0298 on a height-matched comparator at 17,700 zones (bootstrap [1.0156, 1.0443], excluding 1) and 1.0157 against the exactly matched discrete class null (bootstrap [1.0013, 1.0308], clearing 1 by 0.0013), so part of the original figure was the comparator and the pre-registered rule returns MATCH by two parts in ten thousand; c_local = 0.7522 at the top band with bootstrap [0.7410, 0.7630] now CONTAINING HL's 0.7574 and the band drift inside the registered 0.03 per step for the first time but still non-monotone (0.7518, 0.7664, 0.7416, 0.7522), so no convergence is measured; global worst tail/ln^2(p'^2) = 6.840 at p = 15107 with max/mean no longer flat (4.40, 5.36, 8.59, 8.43); Q5 is answered in the negative, head and tail showing no dependence at 27,292 zones (detrended r = -0.0009 against null s.e. 0.0061, permutation p = 0.8920, variance ratio 0.9990, no KS rejection, no chi-square near threshold), so the R0 pieces are a product structure to first and second moments and in the sum's whole law while independence is NOT proven and the simultaneous-extremes regime is untouched; a candidate rough-origin mechanism for the surplus is HEURISTIC and does not fit the head's own excess band by band; the head field's effective sample size is measured at 1,910 distinct a_first among 17,700 top-band zones, so this note's own head interval is priced over draws the field does not hold, a cluster bootstrap over distinct a_first (producer SEC I(a), seed 613009117) measuring the inflation at 4.10 rather than the 3.04 the redundancy alone implies and moving the top-band interval to [0.6848, 0.7692], still inside the registered [0.68, 0.78] (correction originating with redteam-0829-measure-b.md section 1c C15); the scope of that defect is that one interval and not the corpus, since destroyer-census-01.md publishes no bootstrap, head-residual-factor.js bootstraps over gaps, zonegap-01.js has none and zone-tail-01.js bootstraps only tail quantities; ten of ten predictions hit, which is a criticism of the pre-registration; and the R0 shares read 1.40% / 92.80% / 5.81% with the tail's share still falling, so Z2 is more of the obstruction after this pass than before it. | Z4 | [zone-tail-02-0829.md](history/staging/zone-tail-02-0829.md) |\n| `Q-zonegap-01-prereg` | SUPERSEDED | What is Z2(p) in the unswept half-decade p in [1e5, 316228)? | Pre-registration only, committed before the X = 1e11 sweep ran: five predictions are sealed on the per-zone distributional structure the published record ladders do NOT determine, with the records excluded from scoring and used as custody instead; the scoring document is the stage-2 embedded output, in zonegap-01.md. | none | [zonegap-01-prereg.md](history/staging/zonegap-01-prereg.md) |\n| `Q-zonegap-03-prereg` | OPEN | What is Z2(p) in the unswept decade X in (1e11, 1e12]? | Pre-registration only, sealed before any sweep past X = 1e11 exists: five theorem-grade predictions at sigma = 0 (resting on Z2(p) = env(p) identically, a two-line theorem conditional on the adopted ladder being the true running max) and five blind statistical ones with sigma models and kill rules, scored by the stage-3 embedded output with misses stated first. | none | [zonegap-03-prereg.md](history/staging/zonegap-03-prereg.md) |\n| `Q-zonegap-03-score` | ANSWERED | Do the ten predictions sealed in zonegap-03-prereg.md score against the stage-3 sweep at X = 1e12? | All ten sealed rows score HIT and none miss, after a second pass added a band-edge argument to zonegap-01.js and re-ran the decade so the two rows that named an unprinted band could be scored; the four Group T hits are a custody promotion that follows from CUSTODY 1 and 3 passing, one sub-clause of T5 (the full-decade sd) stays unprinted, and the sweep still needs a DERIVED engine because zonegap-01.js's inlined 41-record ladder makes it exit at 1e12. | Z7 | [zonegap-03-score.md](history/staging/zonegap-03-score.md) |\n| `Q-zonegap-Z2` | PARTIAL | What is Z2(p), the largest twin-pair gap inside the zone (p, p′^2), measured at every zone to 1e11? | MEASURED to 1e11 over 27,292 zones: every zone holds at least two twin pairs, Z2 is the record envelope wearing zone coordinates, Z2(p) <= G2(p#) is a one-line theorem with equality only to p = 7, and the zone-local margin runs away like p^2/(3.9 ln^3 p); the pre-registration scored 2 of 5. | none | [zonegap-01.md](history/staging/zonegap-01.md) |\n| `Q-zonegap-model` | ANSWERED | What is Z2 once decomposed, and does the per-zone field carry anything the record ladder does not? | Z2(p) = env(p) with D(p) identically zero (PROVEN conditional on the adopted ladder, VERIFIED 204 ways), so the per-zone field is the record ladder wearing zone coordinates and the u bimodality is closed; the blind tests for the [1e11, 1e12] decade are sealed and the sweep itself is not run. | none | [zonegap-03-model.md](history/staging/zonegap-03-model.md) |\n| `Q-zonegap-prior-art` | ANSWERED | Who owns Z2(p), the maximal twin-prime gap below a quadratic cutoff, in the owning conventions? | Kourbatov (2013) and Kourbatov-Wolf (2019) own maximal twin-prime gaps, with heuristics and records and nothing proven; the zone form (p, p′^2) has five neighbours and no owner, and the per-zone quadratic-cutoff object appears absent on channels calibrated in the same session. | none | [zonegap-prior-art.md](history/staging/zonegap-prior-art.md) |\n| `Q-zonegap-reduction` | PARTIAL | What must be proven for Z2, what already is, and what does the proven head machinery give the zone? | The Zone Restriction Lemma is proven and verified at five levels - the in-zone twin slots of T_p ARE the in-zone twin primes, so Z2(p) IS the whole-tile gap object restricted to the head window - the three-slack chain is graded honestly, the transfer inventory is listed item by item, and the deep end is proven an onset desert over 24 levels; section 5 lists what was not reached. | Z (retired) | [zonegap-02-reduction.md](history/staging/zonegap-02-reduction.md) |\n| `Q-zonegap-witnesses` | ANSWERED | Do independent second witnesses confirm the twin-gap record table, and does the due OEIS flip-search turn anything up? | Both witnesses AGREE at 82/82 rows with no extension and no conflict and the lesser-to-lesser convention verified rather than assumed; the OEIS check returns one loud hit, the per-zone pair-count sequence being A273257 one index over, while the gap objects stay absent, and one literature item, Korevaar 2012, is still walled and read only by arXiv proxy. | none | [zonegap-witnesses.md](history/staging/zonegap-witnesses.md) |\n\n## 3. Unindexed notes (0): title only, until a block is added\n\n*(Legacy notes written before the ledger existed. A grep for the object still\nlands here. Add a block when a note is next touched; `node research/qc.js\nledger-backlog` lists them.)*\n\n","generator":"// ============================================================================\n// QC / QUESTIONS — which questions has this corpus already attacked, and where?\n// ============================================================================\n// Chris, 2026-08-28: \"We keep re-running things. Restructure repo so that does\n// not happen.\" The same day three briefs re-posed questions the corpus had\n// already answered: TODO item 0's first move had run a week earlier\n// (attack-rhoms-01.md), item 1c's refit had run 2026-08-21, and a TODO premise\n// in item 10 had been measured under another name. 316 staging notes answered\n// questions and nothing indexed them BY QUESTION; the router indexes by\n// document and the changelog by claim, and a briefer greps on guessed words.\n//\n// THE MECHANISM. Every note that answers a question carries a machine-readable\n// block at its top, invisible when rendered:\n//\n// \n//\n// THE PARITY GATE (2026-09-05), scoped after the independent review.\n// A note declares its arithmetic inputs and method scope, or `residue-only`.\n// A mathematical obstruction must separately name the retained statistics,\n// error tolerance and quantifiers; the gate does not prove impossibility.\n// Exact residue arrangements encode primality. Merely using residue notation\n// does not put every argument in one sieve-method class.\n// The check rejects a missing or placeholder line on a new attack note whose\n// todo names a live item. Legacy notes are exempt by git's add date; an\n// untracked note is new. `residue-only` remains a supported declaration.\n//\n\n// Several notes may share an id. Their statuses are reported as one status only\n// when they agree; otherwise the index prints MIXED with each note's status.\n// The verdict shown is the last note's in path order; the full chain is listed.\n//\n// research/QUESTIONS.md is GENERATED from these blocks (node research/qc.js\n// --index, or node research/gen-questions-index.js) and is the one place to\n// look before briefing: by TODO item, then by question id. Notes without a\n// block are listed there by title under \"unindexed\", so a grep finds them too.\n//\n// THE GUARD, gated: a TODO item must list, on a line `Ledger: Q-a, Q-b`,\n// every question id whose block names that item. A move cannot be re-briefed\n// without reading, in the item itself, that it has run. The gate says so when\n// a note names an item that does not acknowledge it.\n//\n// The status belongs to the QUESTION, not the note's review grade. An answered\n// specification may still contain an open arithmetic target. Read the owning\n// note and linked reviews for its grade; the generated preamble explains this.\n// ============================================================================\n'use strict';\nconst fs = require('fs');\nconst path = require('path');\nconst C = require('./corpus');\n\nconst STATUSES = new Set(['OPEN', 'PARTIAL', 'ANSWERED', 'CLOSED', 'SUPERSEDED']);\nconst BLOCK_RE = //;\nconst TODO_PATH = path.join(C.ROOT, 'TODO.md');\nconst OUT_PATH = path.join(C.RESEARCH, 'QUESTIONS.md');\n\nfunction indexedFiles() {\n // Staging notes and the working documents under research/. Registries carry\n // a `Q-registry-` block (their question is what they index); generated\n // files (SCRIPTS.md, QUESTIONS.md) carry none and are excluded by corpus.js. History other than staging is never\n // audited (qc/README.md), and that boundary holds here too.\n const staging = C.historyMarkdown.filter(f => /history\\/staging\\//.test(f));\n const body = C.bodyMarkdown.filter(f => /^research\\/[^/]+\\.md$/.test(C.rel(f)));\n return [...staging, ...body].sort();\n}\n\nfunction parseBlock(file) {\n const src = C.read(file);\n const head = src.split('\\n').slice(0, 60).join('\\n');\n const m = BLOCK_RE.exec(head);\n const title = (src.split('\\n').find(l => /^#\\s/.test(l)) || '').replace(/^#\\s*/, '').trim();\n if (!m) return { file, title, block: null };\n const fields = {};\n const problems = [];\n for (const raw of m[1].split('\\n')) {\n const ln = raw.trim();\n if (!ln) continue;\n const km = /^([a-z]+):\\s*(.*)$/.exec(ln);\n if (!km) { problems.push(`unparseable line \"${ln}\"`); continue; }\n fields[km[1]] = km[2].trim();\n }\n for (const k of ['id', 'status', 'question', 'verdict'])\n if (!fields[k]) problems.push(`missing field \"${k}\"`);\n if (fields.status && !STATUSES.has(fields.status))\n problems.push(`status \"${fields.status}\" is not one of ${[...STATUSES].join(' | ')}`);\n if (fields.id && !/^Q-[A-Za-z0-9][A-Za-z0-9-]*$/.test(fields.id))\n problems.push(`id \"${fields.id}\" must look like Q-slug (letters, digits, hyphens)`);\n const todo = (fields.todo || 'none').split(',').map(s => s.trim()).filter(s => s && s !== 'none')\n .map(s => ({ id: s.replace(/\\s*\\(retired\\)\\s*$/, ''), retired: /\\(retired\\)/.test(s) }));\n const line = src.slice(0, m.index).split('\\n').length;\n return { file, title, block: { ...fields, todo, line }, problems };\n}\n\nfunction todoItems() {\n // A corpus without a TODO.md has no items to acknowledge; the block side of the\n // check still runs. The selftest fixture carries its own TODO.md.\n if (!fs.existsSync(TODO_PATH)) return new Map();\n const src = fs.readFileSync(TODO_PATH, 'utf8').split('\\n');\n const items = new Map();\n let cur = null;\n src.forEach((ln, i) => {\n const h = /^\\*\\*([A-Za-z0-9]+)\\.\\s/.exec(ln);\n if (h) { cur = { id: h[1], line: i + 1, ledger: new Set(), ledgerLine: null }; items.set(h[1], cur); return; }\n if (/^##\\s/.test(ln)) { cur = null; return; }\n if (cur) {\n const lm = /^\\s*Ledger:\\s*(.*)$/.exec(ln);\n if (lm) { cur.ledgerLine = i + 1; for (const q of lm[1].matchAll(/Q-[A-Za-z0-9-]+/g)) cur.ledger.add(q[0]); }\n }\n });\n return items;\n}\n\nfunction collect() {\n const rows = indexedFiles().map(parseBlock);\n return { rows, todo: todoItems() };\n}\n\n// ---------------------------------------------------------------------------\n// THE CHECK\n// ---------------------------------------------------------------------------\nfunction ledger() {\n const { rows, todo } = collect();\n const findings = [];\n const byId = new Map();\n for (const r of rows) {\n if (!r.block) continue;\n for (const p of r.problems || [])\n findings.push({ file: C.rel(r.file), line: r.block.line, kind: 'ledger-malformed', detail: p,\n note: 'the block format is documented at the top of qc/questions.js' });\n if (r.block.id) {\n if (!byId.has(r.block.id)) byId.set(r.block.id, []);\n byId.get(r.block.id).push(r);\n }\n for (const t of r.block.todo) {\n if (t.retired) continue;\n const item = todo.get(t.id);\n if (!item) {\n findings.push({ file: C.rel(r.file), line: r.block.line, kind: 'ledger-todo-unknown',\n detail: `todo: ${t.id} names no item heading in TODO.md`,\n note: 'if the item has left TODO.md, write \"todo: ' + t.id + ' (retired)\"; otherwise fix the id' });\n continue;\n }\n if (!item.ledger.has(r.block.id)) {\n findings.push({ file: 'TODO.md', line: item.line, kind: 'ledger-todo-unlisted',\n detail: `item ${t.id} does not list ${r.block.id} (${C.rel(r.file)}, ${r.block.status}) on its Ledger: line`,\n note: 'THE RE-RUN GUARD: the item must acknowledge every question already attacked under it. Add the id to the item\\'s \"Ledger:\" line, and read the note before briefing any move' });\n }\n }\n }\n for (const [id, group] of byId) {\n const qs = new Set(group.map(g => C.norm(g.block.question)));\n if (qs.size > 1)\n findings.push({ file: C.rel(group[1].file), line: group[1].block.line, kind: 'ledger-id-conflict',\n detail: `id ${id} is shared by ${group.length} notes with different question text`,\n note: 'notes sharing an id answer the SAME question; give a different question a different id' });\n }\n for (const [tid, item] of todo)\n for (const q of item.ledger)\n if (!byId.has(q))\n findings.push({ file: 'TODO.md', line: item.ledgerLine || item.line, kind: 'ledger-todo-dangling',\n detail: `item ${tid} lists ${q}, which no note carries`,\n note: 'a Ledger: line points at notes that exist; fix the id or add the block to the note' });\n const indexed = rows.filter(r => r.block).length;\n return {\n name: 'ledger',\n description: `every note that answers a question says which, and every TODO item acknowledges the questions already attacked under it `\n + `(${indexed} of ${rows.length} notes carry a ledger block; ${byId.size} question ids; ${todo.size} TODO items)`,\n findings,\n };\n}\n\n// ---------------------------------------------------------------------------\n// THE PARITY GATE (2026-09-05). See the header.\n// ---------------------------------------------------------------------------\nconst PARITY_CUTOFF = '2026-09-05';\nconst PARITY_EXEMPT = 'residue-only';\nlet addDates = null;\nfunction fileAddDates() {\n // First-commit date of every file under research/, one git call, cached.\n // A corpus without git (the selftest fixture) yields an empty map, and an\n // unknown file counts as NEW, which is the conservative direction: the gate\n // asks a question rather than assuming the answer.\n if (addDates) return addDates;\n addDates = new Map();\n try {\n const out = require('child_process').execFileSync('git',\n ['-C', C.ROOT, 'log', '--diff-filter=A', '--format=%as', '--name-only', '--', 'research'],\n { encoding: 'utf8', stdio: ['ignore', 'pipe', 'ignore'] });\n let date = null;\n for (const ln of out.split('\\n')) {\n if (/^\\d{4}-\\d\\d-\\d\\d$/.test(ln)) { date = ln; continue; }\n const f = ln.trim();\n if (!f || !date) continue;\n // log is newest first; the earliest add wins (a file re-added after a\n // rename keeps its original date)\n addDates.set(f, date);\n }\n } catch (e) { /* no git: every file is new */ }\n return addDates;\n}\n\nfunction parity() {\n const { rows } = collect();\n const dates = fileAddDates();\n const findings = [];\n let attacks = 0, exempt = 0;\n for (const r of rows) {\n if (!r.block) continue;\n const live = r.block.todo.filter(t => !t.retired);\n if (!live.length) continue; // not an attack note\n const rel = C.rel(r.file);\n const added = dates.get(rel);\n if (added && added < PARITY_CUTOFF) continue; // legacy note, exempt\n attacks++;\n const v = (r.block.parity || '').trim();\n if (!v) {\n findings.push({ file: rel, line: r.block.line, kind: 'parity-missing',\n detail: `attack note (todo: ${live.map(t => t.id).join(', ')}) carries no parity: line`,\n note: 'THE PARITY GATE: state the arithmetic inputs and method scope, or write \"parity: residue-only\". This checks documentation, not mathematical feasibility. Format at the top of qc/questions.js' });\n continue;\n }\n if (v.toLowerCase() === PARITY_EXEMPT) { exempt++; continue; }\n if (v.length < 12 || /^(n\\/?a|none|tbd|todo|unknown|\\?+|-+)$/i.test(v)) {\n findings.push({ file: rel, line: r.block.line, kind: 'parity-placeholder',\n detail: `parity: \"${v}\" names no input`,\n note: 'either state the arithmetic inputs and method scope in one line, or write exactly \"residue-only\"' });\n }\n }\n return {\n name: 'parity',\n description: `every attack note added from ${PARITY_CUTOFF} states its arithmetic inputs and method scope, or declares residue-only `\n + `(${attacks} attack notes in scope, ${exempt} declared residue-only)`,\n findings,\n };\n}\n\nfunction ledgerBacklog() {\n const { rows } = collect();\n const missing = rows.filter(r => !r.block);\n const findings = missing.map(r => ({ file: C.rel(r.file), line: 1, kind: 'ledger-missing',\n detail: r.title ? `\"${r.title.slice(0, 90)}\"` : '(no title)',\n note: 'legacy note without a ledger block; it is listed by title in QUESTIONS.md §unindexed until one is added' }));\n return {\n name: 'ledger-backlog',\n description: `notes with no ledger block, listed by title in research/QUESTIONS.md so a grep still finds them (${missing.length} of ${rows.length}; the counter should only fall)`,\n findings,\n };\n}\n\n// ---------------------------------------------------------------------------\n// THE GENERATOR — research/QUESTIONS.md\n// ---------------------------------------------------------------------------\nconst cell = s => String(s || '').replace(/\\|/g, '\\\\|').replace(/\\n/g, ' ').trim();\nconst link = f => { const r = C.rel(f); const p = r.replace(/^research\\//, ''); return `[${path.basename(r)}](${p})`; };\n\nfunction generate() {\n const { rows, todo } = collect();\n const withBlock = rows.filter(r => r.block && r.block.id);\n const byId = new Map();\n for (const r of withBlock) { if (!byId.has(r.block.id)) byId.set(r.block.id, []); byId.get(r.block.id).push(r); }\n const ids = [...byId.keys()].sort();\n const summarise = id => {\n const g = byId.get(id);\n // Deterministic display choice: the last note in path order supplies the\n // verdict. This is NOT chronology or review precedence. List every record\n // and explain the choice in the generated preamble.\n const last = g[g.length - 1].block;\n // A shared id carries one status ONLY when its notes agree. When they do not,\n // the index says MIXED and lists each note's own status, so a reader opens\n // them instead of trusting a rank. (2026-08-28 red team: taking the highest\n // rank showed Q-c2prime-drift as CLOSED while its earlier note reads PARTIAL\n // and the later one closed on a weaker window.)\n const statuses = [...new Set(g.map(x => x.block.status))];\n const status = statuses.length === 1 ? statuses[0]\n : 'MIXED (' + g.map(x => path.basename(x.file) + ': ' + x.block.status).join('; ') + ')';\n return { id, question: last.question, status, verdict: last.verdict, files: g.map(x => x.file), todo: [...new Set(g.flatMap(x => x.block.todo.map(t => t.id + (t.retired ? ' (retired)' : ''))))] };\n };\n const S = ids.map(summarise);\n\n const out = [];\n out.push('# Questions: what has been asked here, what it got, and where the record is');\n out.push('');\n out.push('*(GENERATED from the `` blocks at the top of the notes; never');\n out.push('hand-edited. Regenerate with `node research/qc.js --index` or');\n out.push('`node research/gen-questions-index.js`. The block format and the gate that');\n out.push('enforces it are documented at the top of `qc/questions.js`.)*');\n out.push('');\n out.push('**Before proposing an attack or briefing an agent:** find the TODO item in');\n out.push('section 1, search for the actual object, then read the relevant records and');\n out.push('their decisive dependencies. Use [OUTCOMES.md](OUTCOMES.md) for reuse and');\n out.push('revisit conditions. An item can span many unrelated attempts; loading every');\n out.push('linked note is not the required first step. Verify any conclusion that');\n out.push('determines the next move, including an ANSWERED or CLOSED entry.');\n out.push('');\n out.push('**Status describes the question, not proof strength or review grade.**');\n out.push('OPEN: unresolved. PARTIAL: specified parts are resolved. ANSWERED: the bounded');\n out.push('question has an answer, which may be a negative finding, finite measurement');\n out.push('or completed specification. Its underlying arithmetic target may remain OPEN.');\n out.push('CLOSED: the stated premise or approach is closed at its recorded scope; this');\n out.push('does not refute every related conjecture. SUPERSEDED: another record replaces');\n out.push('this one. Consult the owning note and linked reviews for HELD or other grades.');\n out.push('');\n out.push('**Multiple records:** conflicting statuses are shown as MIXED. The displayed');\n out.push('verdict comes from the last record in path order, not necessarily the newest');\n out.push('or most authoritative review. Read the linked records before resolving a');\n out.push('disagreement; the generator does not adjudicate it.');\n out.push('');\n out.push('## 1. By TODO item: what has already run under each');\n out.push('');\n out.push('| TODO item | question | status | verdict | records |');\n out.push('|---|---|---|---|---|');\n const itemOrder = [...todo.keys()];\n const seen = new Set();\n for (const tid of itemOrder) {\n const here = S.filter(s => s.todo.some(t => t.replace(/ \\(retired\\)$/, '') === tid));\n for (const s of here) { seen.add(s.id); out.push(`| ${tid} | \\`${s.id}\\` ${cell(s.question)} | ${s.status} | ${cell(s.verdict)} | ${s.files.map(link).join(', ')} |`); }\n }\n const retired = S.filter(s => !seen.has(s.id) && s.todo.length);\n for (const s of retired) out.push(`| ${cell(s.todo.join(', '))} | \\`${s.id}\\` ${cell(s.question)} | ${s.status} | ${cell(s.verdict)} | ${s.files.map(link).join(', ')} |`);\n out.push('');\n out.push('## 2. Every question, by id');\n out.push('');\n out.push('| id | status | question | verdict | TODO | records |');\n out.push('|---|---|---|---|---|---|');\n for (const s of S) out.push(`| \\`${s.id}\\` | ${s.status} | ${cell(s.question)} | ${cell(s.verdict)} | ${cell(s.todo.join(', ') || 'none')} | ${s.files.map(link).join(', ')} |`);\n out.push('');\n const missing = rows.filter(r => !r.block);\n out.push(`## 3. Unindexed notes (${missing.length}): title only, until a block is added`);\n out.push('');\n out.push('*(Legacy notes written before the ledger existed. A grep for the object still');\n out.push('lands here. Add a block when a note is next touched; `node research/qc.js');\n out.push('ledger-backlog` lists them.)*');\n out.push('');\n for (const r of missing) out.push(`- ${link(r.file)}: ${cell(r.title)}`);\n out.push('');\n fs.writeFileSync(OUT_PATH, out.join('\\n'));\n return { questions: S.length, notes: withBlock.length, unindexed: missing.length };\n}\n\nmodule.exports = { parity, ledger, ledgerBacklog, generate, collect };\n\nif (require.main === module) {\n const r = generate();\n console.log(`research/QUESTIONS.md: ${r.questions} questions from ${r.notes} indexed notes, ${r.unindexed} unindexed`);\n}\n","notes":{"research/centered-discrepancy-estimate.md":{"lf_sha256":"dd6e1a4c892f4b085400ba36ea81e41d62449563145e9add8ef8c65227c16a90","content":"# Centered discrepancy: exact top-range flip and reviewed truncation\n\n\n\n**Accepted at its stated scope: the top-range truncation\nT^top=O_(A,eps)(x/log^A x) of section 3a, reviewed 2026-09-08. It\nestimates nothing about D^(e_1). Twin-prime infinitude and\nD_y>=-4x/25+o(x) remain OPEN.** Lane A was submitted from fda7b55; its\noriginal text is preserved in a5e1244. The first integration review is\n[research-round-validation.md](research-round-validation.md) section 2;\nthe review of the repair is its section 7. Section 3a is the repair of\n2026-09-08 from 1285d47; it restates the consumer at a fixed endpoint\nwithout estimating it.\n\n## 1. Exact decomposition retained\n\nNotation as in the handoff: x = 2^j, J = (x/2, x], y = ceil(x^(12/25)),\nQ = floor(x/y), f(n) = Lambda(n-2) mu(n) with standard Lambda,\nM = sum_J f(n), a_e = max(x/2, ey), and D_y the finite atomic Stieltjes\nsum (9) of moving-cutoff-parity, equal to\n\n\\[\n \\mathcal D_y=\\sum_{\\substack{e\\le Q\\\\ e\\ \\mathrm{odd}}}\\mu(e)\n \\sum_{\\substack{n\\in(a_e,x]}}\\Bigl(\\mathbf 1_{e\\mid n}-\\frac1{\\varphi(e)}\\Bigr)\n f(n)\\log\\frac en .\n\\]\n\nFix eps with 0 < eps < 1/50 and put e_1 = floor(x^(1/2+eps)). For x large,\ne_1 <= x/(2y), so every odd e < e_1 has ey <= x/2 and a_e = x/2. Define\n\n\\[\n \\mathcal D^{(e_1)}(x)=\\sum_{\\substack{e ey\nis m > y, and e <= Q is then automatic. Hence\n\n\\[\n T^{\\rm top}=-\\sum_{y0 and 00 and every\nfixed 0 n=em is a bijection from {e: [b^2,g] | e, e>=e_1, x/2=8 (validator section 4a);\nthey are excluded here because the reduced-residue hypothesis below\nwould fail for them, which is the actual content of review defect 2.\nThe modulus q=m[b^2,g] is odd, so the class -2 mod q is reduced.\n\n### 3a.2 Step 2: the progression sums, the local factors and the required mean\n\nFor odd q write, for t>=2 and (a,q)=1,\nDelta_q(t;a):=sum_{n<=t, n=a (q)}Lambda(n)-(1/phi(q))sum_{n<=t,(n,q)=1}Lambda(n),\nTao's discrepancy, and D(q):=sup_{(a,q)=1}sup_{2<=t<=x}|Delta_q(t;a)|.\nThe inner sum of (3a.4) equals psi_0(x-2;q,-2)-psi_0(l_m-2;q,-2) with psi_0\nthe Lambda_0 progression sum; psi_0 differs from psi by at most log x per\nprefix (the removed powers of two), and (1/phi(q))sum_{n<=t,(n,q)=1}Lambda(n)\ndiffers from psi(t)/phi(q) by at most log^2 x/phi(q). With\npsi(t)=t+O_{A_3}(t log^-A_3 t) for t>=2 ([Tao, Notes 2, Exercise 64](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/), q=1),\n\n\\[\n \\sum_{\\substack{n\\in I_m\\\\ n\\equiv0\\ (q)}}\\Lambda_0(n-2)\n =\\frac{L(m)}{\\varphi(q)}+\\theta_{m,q},\\qquad\n |\\theta_{m,q}|\\le 2D(q)+O_{A_3}\\Bigl(\\frac{x\\log^{-A_3}x+\\log^2x}{\\varphi(q)}\\Bigr)+O(\\log x). \\tag{3a.5}\n\\]\n\nMain term and its local factors. Fix odd b and odd squarefree g. The odd\nsquarefree m with g | m are m=gm' with m' odd squarefree and (m',g)=1;\nmu(m)=mu(g)mu(m') and mu(g)^2=1. Put r:=g[b^2,g]=b^2g^2/(b,g), so\nq=m'r. Since (m',g)=1 and rad(r)=rad(bg), (m',r)=prod of the primes\np | m' with p | b, and\n\n\\[\n \\frac1{\\varphi(m'r)}=\\frac1{\\varphi(m')\\varphi(r)}\\prod_{p\\mid(m',b)}\\frac{p-1}{p}\n =\\frac{h_{b,g}(m')}{\\varphi(m')\\varphi(r)},\\qquad\n h_{b,g}(p)=\\begin{cases}0,& p\\mid 2g\\\\ (p-1)/p,& p\\mid b,\\ p\\nmid g\\\\ 1,& p\\nmid 2bg,\\end{cases} \\tag{3a.6}\n\\]\n\nwith h_{b,g} multiplicative on squarefree arguments. The value 0 at p | 2g\ncarries the conditions m' odd and (m',g)=1 inside the weight. The factor\nis (p-1)/p, not p/(p-1) (validator section 4b, including m'=3, r=9).\n\nThe actual Dirichlet series of the main term is\n\n\\[\n \\sum_{m'\\ge1}\\frac{\\mu(m')h_{b,g}(m')}{\\varphi(m')\\,m'^{s}}\n =\\prod_{p\\nmid 2bg}\\Bigl(1-\\frac{p^{-s}}{p-1}\\Bigr)\\prod_{p\\mid b,\\ p\\nmid g}\\bigl(1-p^{-1-s}\\bigr)\n =\\frac{H_{b,g}(s)}{\\zeta(1+s)}, \\tag{3a.7}\n\\]\n\\[\n H_{b,g}(s)=\\prod_{p\\nmid 2bg}\\frac{1-p^{-s}/(p-1)}{1-p^{-1-s}}\\prod_{p\\mid 2g}\\frac1{1-p^{-1-s}}\n =\\sum_{k\\ge1}\\eta_{b,g}(k)k^{-s},\n\\]\n\nwith eta_{b,g} multiplicative, eta(p^k)=-1/(p^k(p-1)) for p not dividing\n2bg, eta(p^k)=p^-k for p | 2g, and eta(p^k)=0 for p | b, p not dividing g\n(the local factor at such p is exactly that of 1/zeta(1+s)). The\nconvolution identity mu(m')h(m')/phi(m')=sum_{dk=m'}(mu(d)/d)eta(k) is\nchecked exactly in validator section 4c. Absolute convergence, uniformly\nin b:\n\n\\[\n K_g:=\\sum_{k\\ge1}|\\eta_{b,g}(k)|\\sqrt k\n \\le\\prod_p\\Bigl(1+\\frac1{(p-1)(\\sqrt p-1)}\\Bigr)\\cdot\\frac1{1-2^{-1/2}}\\prod_{p\\mid g}\\frac1{1-3^{-1/2}}\n \\le C_0\\,\\tau(g)^2, \\tag{3a.8}\n\\]\n\nsince (1-3^(-1/2))^-1<2.4<2^2. At s=0, H_{b,g}(0)=2 prod_{p>2, p not\ndividing bg}(1-1/(p-1)^2) prod_{p|g}p/(p-1), and H_{1,1}(0)=2C_2 agrees\nwith moving-cutoff-parity (11).\n\n**Required signed uniform mean (UM).** Let\nP_0(u):=sum_{m'<=u}mu(m')h_{b,g}(m')/phi(m') and\nP_1(u):=sum_{m'<=u}mu(m')log m' h_{b,g}(m')/phi(m'). For every fixed A>0\nthere is C_A such that for all odd b>=1, all odd squarefree g>=1 and all\nu>=2,\n\n\\[\n |P_0(u)|\\le C_A\\,\\tau(g)^2\\log^{-A}u,\\qquad\n |P_1(u)+H_{b,g}(0)|\\le C_A\\,\\tau(g)^2\\log^{-A}u. \\tag{3a.9}\n\\]\n\nUniformity in b, g and the block ends u in [y/G, M] is the whole\nrequirement; the block (y/g, M/g] is the clipped interval of the\nassignment, and both its ends satisfy log u >= (12/25 - o(1)) log x.\n\nProof of (UM). Inputs: (M1) M_1(v):=sum_{d<=v}mu(d)/d satisfies\nM_1(v)<<_A log^-A(2v) for v>=1; (M2) M_2(v):=sum_{d<=v}mu(d)log d/d\nsatisfies M_2(v)=-1+O_A(log^-A(2v)) for v>=1. (M1) follows from\n[Tao, Notes 2, Exercise 66](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/)\nat q=1, M(t):=sum_{n<=t}mu(n)<<_A t log^-A t, by partial summation\nM_1(v)=M(v)/v+int_1^v M(t)t^-2 dt: the integral converges, its limit\nequals the convergent series sum mu(d)/d, which equals lim_{s->1+}1/zeta(s)=0\nby Abel's theorem for Dirichlet series, and the tail int_v^infty is\nO_A(log^(1-A)v). (M2) follows from (M1) by\nM_2(v)=M_1(v)log v-int_1^v M_1(t)t^-1 dt, the same limit argument and\nlim_{s->1+}zeta'(s)/zeta(s)^2=-1. Now\nP_0(u)=sum_{k<=u}eta(k)M_1(u/k). For k<=sqrt u, |M_1(u/k)|<=C'_A 2^A log^-A u;\nfor k>sqrt u, |M_1|<=C'_A and sum_{k>sqrt u}|eta(k)|<=K_g u^(-1/4).\nThis gives the first bound with (3a.8). For P_1 write\nlog m'=log d+log k on dk=m': P_1(u)=sum_{k<=u}eta(k)M_2(u/k)+sum_{k<=u}eta(k)log k M_1(u/k).\nThe first sum is -sum_{k<=sqrt u}eta(k)+O_A(K_g log^-A u)+O(K_g u^(-1/4))\n=-H_{b,g}(0)+O_A(K_g log^-A u); the second is bounded like P_0 using\nlog k<=4k^(1/4). This proves (3a.9).\n\n### 3a.3 Step 3: truncation, tails, multiplicities, endpoint errors\n\nFix L>0 and put B=G=(log x)^L. Split (3a.4) into b<=B, g<=G (body), b>B\n(tail b) and b<=B, g>G (tail g). The count of n in I_m with q | n is at\nmost L(m)/q+1<=x/(2q)+1 when q<=x and 0 otherwise, and q>=mb^2, q>=mbg\n(for squarefree g, [b^2,g]=b^2g/(b,g)>=bg). With Lambda_0<=log x, the\nouter weight log m<=log x, sum_{m<=M}tau(m)/m<G}\\frac1g\\sum_{\\substack{m\\le M\\\\ g\\mid m}}\\frac1m\n +\\sum_{m\\le M}\\tau(m)\\sqrt{x/m}\\Bigr]\n \\ll \\frac{x\\log^3x\\,\\log B}{G}+x^{3/4-\\epsilon/2}\\log^3x. \\tag{3a.11}\n\\]\n\nBody. Every modulus satisfies q=m[b^2,g]<=MB^3<=2x^(1/2-eps)(log x)^(3L)=:Q_0.\nThe multiplicity c(q):=#{(m,b,g): m odd squarefree<=M, b<=B odd, g|m, g<=G, m[b^2,g]=q}\nis at most tau(q)^3: m | q, then b^2 | q/m and g | q/m (validator section 4d).\nSumming (3a.5) with |mu(b)mu(g)|<=1 and the outer weight,\n\n\\[\n T^{\\rm top}=-{\\rm Main}+O\\bigl(E_2+E_b+E_g+E_{BV}+E_{P}\\bigr),\\qquad\n {\\rm Main}:=\\sum_{\\substack{y=phi(m)phi(b^2), sum_{m<=M}tau(m)log m/phi(m)<=2 and any A_2>0, sum_{q<=Q}sup_{a in (Z/qZ)^*}|Delta_q(x;a)|<<_{A_2}x log^-A_2 x\nprovided Q<=x^(1/2)log^-B x with B=B(A_2). This is the terminal-point\nform; the supremum over prefixes t<=x is his Exercise 20 (statement with\na rounding hint, not a proved theorem on that page). The prefix form is\nderived here from Theorem 17. Given A_1, set delta:=x log^-(A_1+10) x and\nfor t<=x let t':=delta floor(t/delta). Then\nDelta_q(t;a)=Delta_q(t';a)+Delta_q((t',t];a), and the short piece is at\nmost 3 log x(delta/phi(q)+1) in absolute value, so its sum over q<=Q_0 is\n<=delta, Theorem 17 at x:=t' with precision\nA_2:=2A_1+12 applies because Q_0<=t'^(1/2)log^-B t' for x>=x_0 (as\nt'>=x log^-(A_1+10)x and Q_0<=2x^(1/2-eps)log^(3L)x), and gives\nsum_q sup_a|Delta_q(t';a)|<=y/G>=x^(12/25)log^-L x, so\n|A(t)|<=2C_A tau(g)^2(1+log g) 3^A log^-A x, because log u>=(log x)/3 there for x>=x_0(L). Since\nL(gm') is positive and nonincreasing in m', Abel summation gives\n|sum a_{m'}L(gm')|<=sup_t|A(t)| max L<=(x/2)sup_t|A(t)|. Finally\nr_{b,g}=b^2g^2/(b,g)>=(bg)^(3/2) and 1/phi(r)<=x^(12/25)log^-L x.\n\n### 3a.4 Step 4: one total error\n\nGiven A and eps, choose L:=A+5, A_3:=A+3 and A_1:=2A+68. Then for x>=x_0(A,eps),\nfrom (3a.2), (3a.10), (3a.11), (3a.13), (3a.14), (3a.16):\n\n\\[\n |T^{\\rm top}|\\ll_{A,\\epsilon}\\ x\\log^{-A}x\n +\\sqrt x\\log x+\\frac{x\\log^4x}{\\log^{A+5}x}+\\frac{x\\log^3x\\log\\log x}{\\log^{A+5}x}\n +x^{3/4-\\epsilon/2}\\log^3x+x\\log^{-A}x+x^{1/2-\\epsilon}\\log^{A+8}x\n \\ll_{A,\\epsilon}x\\log^{-A}x. \\tag{3a.17}\n\\]\n\nThis is (3a.1). Every constant is ineffective. The Mobius sign of the\noriginal f(n)=Lambda(n-2)mu(n) is handled as follows: mu(n)=mu(e)mu(m),\nmu(e) was absorbed into the squarefree filter of e in (4), and mu(m)\nsits on the modulus of an ordinary prime progression; BV is applied with\nabsolute values, so the sign plays no role in E_BV, and it is averaged\nonly in the main term through (3a.9), a q=1 Mobius mean. No estimate for\nthe twisted sequence itself is used, and none is supplied for D^(e_1).\n\n### 3a.5 What this changes and what it does not\n\nWith (3a.1) accepted and the accepted P^top bound,\nD_y=D^(e_1)+O_{A,eps}(x log^-A x): the handoff consumer D_y>=-4x/25+o(x)\nis equivalent to D^(e_1)>=-4x/25+o(x) for any fixed eps<1/50, a\nfixed-endpoint signed discrepancy over odd moduli e=3 is imported. The shift is 2 throughout; no shift\naverage is used, so no transfer is owed by this section.\n\nCustody: the two imported statements were read on 2026-09-08 as\nexercise statements on Tao's pages (Notes 2 Exercises 64 and 66) and as\nTheorem 17 with the proof on the Notes 3 page. Theorem 17 is the\nterminal-point form; the earlier table row describing it as carrying a\nprefix maximum is corrected below. The existing repo import of the\nprefix form for the Mobius case ([mobius-bv-derivation.md](mobius-bv-derivation.md))\nis not used here.\n\n## 4. Prior work and source matrix\n\nThe flip is the reverse of Murty–Vatwani's divisor switch, already read\nin [moving-cutoff-parity.md](moving-cutoff-parity.md). No novelty claim is\nmade. Their freedom to take theta<1/2 motivates this\nattempt. Their all-residue, all-prefix equidistribution assumption is\nstronger than the one-sided signed consumer here; they are not equivalent\nhypotheses. See [consumer-comparison.md](consumer-comparison.md).\n\nThe following table preserves the worker's source-reading scope. No\nlarge-modulus theorem in it is newly imported by this integration.\nThe ordinary-BV application is justified in section 3a.\nClaims of absence concern only the sources inspected.\n\n| Source, version, locator | Statement (hypotheses) | Use here | Unmatched condition |\n|---|---|---|---|\n| [Tao, Notes 3, Theorem 17](https://terrytao.wordpress.com/2015/01/10/254a-notes-3-the-large-sieve-and-the-bombieri-vinogradov-theorem/), read 2026-09-08 with its proof: for x>=2 and any A, sum over q<=Q of the maximum over reduced classes of the terminal-point discrepancy of Lambda 1_[1,x] is O_A(x log^-A x) when Q<=x^(1/2)log^-B x, B=B(A); terminal point only, ineffective constants | ordinary BV import; used in section 3a.3 through (BV*) | moduli m[b^2,g]<=x^(1/2-eps)(log x)^(3L), residue -2 mod odd q, absolute values, weights <=log x through the Cauchy device | none for the terminal point; the supremum over prefixes t<=x is Exercise 20 on the same page (statement with hint), and is derived from Theorem 17 in section 3a.3 by rounding the prefix to multiples of x log^-(A_1+10) x |\n| [Tao, Notes 2, Exercise 64](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/) (Siegel-Walfisz for Lambda; the unconditional form psi(x;q,a)=x/phi(q)+O_A(x log^-A x) for primitive classes, all x>=2), read 2026-09-08 as an exercise statement | q=1 case only, psi(t)=t+O_A(t log^-A t), for the main term in (3a.5) | none | stated as an exercise, not proved on the page; classical theorem |\n| [Tao, Notes 2, Exercise 66](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/) (Siegel-Walfisz for the Mobius function: sum_{n<=x, n=a (q)} mu(n)<<_A x log^-A x, all classes, x>=2, ineffective), read 2026-09-08 as an exercise statement | q=1 case only; (M1) and (M2) of section 3a.2 follow by partial summation and Abel's theorem | none | stated as an exercise, not proved on the page; classical theorem |\n| Murty–Vatwani, JNT 180 (2017) Thm 1.1, PRIMARY in consumer-comparison | EH_Lambda(x^theta log^C x) and EH_{mu_h}(x^(1-theta)) give the squarefree-density lower bound | comparison only | (8) is their hypothesis at theta = 1/2 - eps, restricted to the class -2 and the dyadic prefix |\n| [Maynard, Primes in arithmetic progressions to large moduli I, arXiv:2006.06572v2](https://arxiv.org/abs/2006.06572), 2021-04-05, Theorem 1.1, Corollaries 1.2–1.4; PDF sha256 7732d1c035258ef8946b4720c06b8a6c80b1606f5e82bf97c0590474b412de0c, read in extracted text | fixed a; sum over q_1 <= Q_1, q_2 <= Q_2 of the absolute error of pi(x; q_1 q_2, a), bound x/log^A x, under Q_1 Q_2^2 < x^(1-100 eps), Q_1^12 Q_2^7 < x^(4-100 eps), Q_1^20 Q_2^19 < x^(10-100 eps); Cor. 1.2: moduli q <= x^(1/2+delta) with a divisor in (x^(2 delta+eta), min(x^(1/10-7 delta/5-eta), x^(1/2-19 delta-eta))); Cor. 1.3: all but 18 delta Q phi(a)/a moduli in [Q, 2Q] | matched against the band (section 4.3) | at height x^(1/2+delta') the moduli without a convenient divisor have proportion of order delta' and carry trivial mass of order delta' x log x per dyadic block; absolute values would accept the mu(m) weights, so the exceptional set is the whole obstruction |\n| BFI II, Math. Ann. 277 (1987) Theorems 3, 5*, read only in Maynard I Lemmas 8.4–8.5 (restatements); primary: Springer paywall, GDZ resolver 404 on 2026-09-08 | all q ~ Q with absolute values, x^(1/2) log^(-A) x < Q < x^(2/3-eps), for triple convolutions of the prime variable with range constraints (Q x^eps < KL, K^3 L^2 < x^(3/2-eps), K^3 L^4 < x^(2-2 eps), K^2 L^5 < x^(2-2 eps); or one smooth factor with Q x^eps < KL, K^3 Q < L x^(1-eps), K Q^2 < L x^(1-eps)) | would cover the good Heath-Brown shapes in the band | the bad shapes (four factors near x^(1/4), five near x^(1/5); Maynard I section 3.2) are uncovered and cost of order delta'^3 of the trivial bound per block; primary statements not read |\n| BFI II + BFI III, J. AMS 2 (1989), as Theorem A in Maynard I section 1.1; primary BFI III: AMS returned 403 to two fetchers on 2026-09-08 | fixed a, Q = x^(1/2+delta): sum over q in [Q, 2Q] of (pi(x;q,a) - pi(x)/phi(q)) is O(delta^2 x/log x + x (log log x)^O(1)/log^3 x), without absolute values | matched against the band | constant-factor saving delta^2 only; no absolute values, so the signed weight mu(m) log m is not admitted |\n| BFI I, Acta Math. 156 (1986) Theorem 10 (as Theorem B in Maynard I; Theorem A in Maynard II) | well-factorable lambda_q of level x^(4/7-eps), fixed a | matched | mu(m) log m and its Vaughan pieces are not well-factorable |\n| [Maynard, II: well-factorable estimates, arXiv:2006.07088v1](https://arxiv.org/abs/2006.07088) Theorem 1.1; sha256 04516b141dfac689f317d533189eabf9b50cec200706159aaa3d8dbe1e25bfb4 | triply well-factorable weights, level x^(3/5-eps) | matched | same as the previous row |\n| [Polymath, arXiv:1402.0811v3](https://arxiv.org/abs/1402.0811) Theorem 1.1; sha256 f4b4556f9451ea0524b974376b9dbe4478faf3734847897460274f6bae98b65c | x^delta-smooth squarefree moduli, exponent 1/2 + 7/300, uniform in CRT residue classes | matched | our moduli are arbitrary squarefree |\n| [Drappeau, arXiv:1504.05549v4](https://arxiv.org/abs/1504.05549), 2016-12-11, Theorems 1.1–1.2 and its Theorem A; sha256 7d5b2f3c2dac35f09004f005bfc6de9696979cdf05c4330b25c346a81f4d924f | Titchmarsh sum T(x) = sum Lambda(n) tau(n-1) with error O_A(x/log^A x) (Fouvry 1985, BFI I), power saving under GRH | indicates that an unweighted log-power result at moduli near x^(1/2) exists in the two primaries, which were not opened (Crelle 357: de Gruyter paywall, GDZ 404) | the Titchmarsh average is unweighted in the modulus; at best it would serve the Type I Vaughan pieces of mu(m) over a window x^(1/2) log^(±B) x and lower the level of (8) by a logarithmic power |\n\nThe previous calculation charged an entire power-width band by a bound\nof size O_eps(x log^2 x). That upper bound is insufficient for an O(x)\nallowance; it is not a lower bound on the actual band. Even in this\nmodel, a relative width M_2/M_1 would need\nlog(M_2/M_1)=O(1/log x) to make x log x log(M_2/M_1)=O(x), rather than the\nO(log^(-2) x) condition originally written. No global impossibility or\nclaim about every published route follows.\n\n## 5. Validation and next obligation\n\n[centered-discrepancy-estimate-validation.js](centered-discrepancy-estimate-validation.js)\nchecks 237 exact splits, the flipped sum, endpoint and coprimality\ncontrols, the density subtraction and 3923 finite Vaughan identities.\nIts section 4 (added 2026-09-08) checks the algebra that section 3a\nchanges: 1412 reconstructions (3a.4) with the inclusive endpoint, odd b\nand the single power-of-two atom, the review witness x=16, y=2, e_1=3,\nm=5, the local factors (3a.6) at primes dividing b only, g only, both,\nneither and a shared prime, the failure of the reciprocal 3/2 at m'=3,\nr=9, the convolution identity behind (3a.7) on 8800 cases, and the\nmultiplicity bound c(q)<=tau(q)^3 to 1100.\n[research-round-validation.js](research-round-validation.js) additionally\nchecks the proof's missing atom and incorrect local factor. These are\nfinite checks. They do not test (BV*), (3a.9) or any asymptotic step;\nthe derivation of section 3a carries those. The handler's review\n([research-round-validation.md](research-round-validation.md) section 7)\nreconstructed (BV*), (3a.9), (3a.14) and (3a.16) and added a finite check\nof the limiting constant -H_{b,g}(0) in (3a.9) to\n[research-round-validation.js](research-round-validation.js).\n\nFalsifier for the derivation: an error in the rounding step for (BV*),\nin the uniformity of (3a.9) in g, or in the convergence (3a.16) would\neach break (3a.1); the reviewer should read those three steps first.\nNo finite computation can refute (3a.1).\n\nWith (3a.1) accepted, the handoff consumer may be stated equivalently\nat the fixed endpoint e_1. The fixed-endpoint object D^(e_1) is split in\n[fixed-endpoint-discrepancy.md](fixed-endpoint-discrepancy.md); its\nbelow-level Type I estimate is corrected and accepted after the 2026-09-09 independent reading, and the\nremainder there is the recorded Mobius-weighted shifted-prime bilinear\nfamily, not estimated. A theorem for the actual twisted sequence or another\nsigned estimate can also justify a new attempt. No blanket prohibition on\nrevisiting this lane follows from the present state.\n\nRevision history: research/history/CHANGELOG.md.\n"},"research/chen-signed-target.md":{"lf_sha256":"3afe6eca045454610e041306f9827416beb1c5ba78c3e174b9229223d4be25fb","content":"# After Chen: one signed estimate that would suffice for twins\n\n\n\nInternal research specification, 2026-09-05. Definitions I_x, z, r, χ_z,\nk, b, e, W, Q and c₀=C₂/40 are those of\n[chen-fold-benchmark.md](chen-fold-benchmark.md). The numerical and algebraic\nvalidator is [chen-benchmark-validation.js](chen-benchmark-validation.js).\n\n**Calibration:** the implication below is elementary; its new estimate is\n**OPEN**. It is a sufficient research target, not a claim that a new route\nthrough the parity problem has been found.\n\nThe [opportunity audit](chen-opportunity-audit.md) determines what this fixed\nweight costs and why arithmetic inputs must be matched to a prime-detecting\nweight. Hη is retained as a diagnostic sufficient condition.\n\n## 1. A prime minorant, including the unwanted factor counts\n\nLet λ(m)=(−1)^Ω(m), with multiplicity. For m in the benchmark range,\n\n$$\n V_x(m):={1-\\lambda(m)\\over2}W_x(m)\\le1_{m\\text{ prime}}. \\tag{1}\n$$\n\nProof. For Ω=1, W≤1. For Ω=2, the prefactor is zero. For Ω≥3, the Chen\nlemma gives W≤0 and the prefactor is nonnegative. Thus odd composites with\nthree or more factors never become false positive primes. They can give\nnegative contributions, which must remain in the bound. ∎\n\nDefine the single new signed quantity\n\n$$\n R(x)=\\sum_{n\\in I_x}\\Lambda(n)\\chi_z(n+2)\n \\lambda(n+2)W_x(n+2). \\tag{2}\n$$\n\nIf $T_\\Lambda(x)=\\sum_{p\\in I_x,\\ p,p+2\\text{ prime}}\\log p$, then\n\n$$\n T_\\Lambda(x)\\ge {Q(x)-R(x)\\over2}-E_{\\rm pp}(x),\\qquad\n 0\\le E_{\\rm pp}(x)\\ll\\sqrt x\\log^2x. \\tag{3}\n$$\n\nIndeed (1) bounds the Λ-weighted sum by prime partners; subtract the terms\nwhose opener is a proper prime power. One may take E_pp to be the sum of\nΛ over all proper prime powers in I_x. For actual twin pairs at large x,\nχ_z=1. The benchmark proves Q(x)≥c₀x/log x eventually.\n\n## 2. The additional estimate and its quantifiers\n\n**Hη (OPEN).** There exist a fixed η∈(0,1) and an unbounded set of integers\nJ such that, for x=2^j, j∈J,\n\n$$\n R(x)\\le(1-\\eta)Q(x)+e(x),\\qquad\n |e(x)|=o(x/\\log x)\\quad(j\\to\\infty,\\ j\\in J). \\tag{H}\n$$\n\nAll factor restrictions in (2) remain in force. The small-o is on these\nsame intervals and with the fixed weight W; it cannot be borrowed from an\nunrestricted shifted-prime average or an average over tile phases.\n\n**Conditional theorem.** Hη implies infinitely many twin primes. In fact it\ngives $\\gg_\\eta x/\\log^2x$ twin pairs in I_x along J.\n\nProof. The benchmark and (H) give Q−R≥ηc₀x/log x−|e(x)|. For sufficiently\nlarge x in the selected sequence, |e|≤ηc₀x/(4 log x) and\nE_pp≤ηc₀x/(8 log x). Equation (3) is then at least\nηc₀x/(4 log x). Dividing by log x gives the count. Its openers tend to\ninfinity since n≥x/2. ∎\n\nHη asks for a positive proportion on a subsequence and is stronger than\nmere infinitude requires. A smaller positive defect Q−R exceeding 2E_pp\nwould already give one pair on each successful scale. Neither inequality\nis proved here. Calling a target TPC-strength is not a proof of circularity;\nproposing (H) without an independent derivation also does not advance it.\n\n## 3. The actual factor/cofactor interface\n\nLet\n\n$$\n R_1=\\sum_{n\\in I_x}\\Lambda(n)\\chi_z(n+2)\\lambda(n+2),\\quad\n R_2=\\sum_{n\\in I_x}\\Lambda(n)\\chi_z(n+2)\\lambda(n+2)k_x(n+2),\n$$\n$$\n R_\\square=\\sum_{n\\in I_x}\\Lambda(n)\\chi_z(n+2)\\lambda(n+2)e_x(n+2).\n$$\n\nExactly, including square factors,\n\n$$\n R=R_1-\\tfrac12R_2+\\tfrac12A_3-\\tfrac12R_\\square,\\qquad\n |R_\\square|\\le E_\\square=o(x/\\log x). \\tag{4}\n$$\n\nThe **plus** sign before A₃ matters: on its three-factor support λ=−1.\nThus a proposal to cancel only R₁ must still pay the other terms.\nComplete multiplicativity, including q|v, gives the exact identity\n\n$$\n R_2=-\\sum_{z\\le q\\le r\\atop q\\text{ prime}}\n \\sum_{x/2+2\\le qv\\le x}\n \\Lambda(qv-2)\\lambda(v)\\chi_z(v). \\tag{5}\n$$\n\nHere q is an actual prime factor and v an actual cofactor, not two divisor\nmoduli. For a block q∼M, the range is v∼x/M, with\n\n$$\n x^{1/8}\\lesssim M\\lesssim x^{1/3},\\qquad\n x^{2/3}\\lesssim v\\lesssim x^{7/8},\n$$\n\nand the exact product inequalities in (5) govern the constants and endpoints.\nPrime-restricted unit-weight versions of (4) and (5) are independently\nenumerated by the validator; the general identities follow algebraically.\n\nThis supplies a place to state an arithmetic estimate. It supplies no such\nestimate by itself. In particular:\n\n- Prime BV controls unsigned arithmetic-progression discrepancies. It does\n not assert cancellation of λ(v) against Λ(qv−2) with these restrictions.\n- The switched theorem in the benchmark concerns a nonnegative triple-product\n sequence. Multiplying it by λ on a shifted argument changes its hypotheses.\n- The PNT cancellation of an unweighted one-variable Liouville sum cannot\n discard the shifted-prime weight or the roughness and product constraints.\n- Taking absolute values term by term destroys the sign needed in (4).\n A proof must bound the combined expression at the scale of Q, not merely\n show that some individual correlation tends to zero after normalization\n by a larger mass.\n\nThe earlier [bilinear-transplant audit](history/staging/attack-bilinear-transplant.md)\ntested different certificates and short stretches; its density mismatch is\nnot removed by relabelling those intervals. This benchmark instead uses a\nlong interval from the outset. Likewise the\n[lambda-ledger experiment](history/staging/attack-lambda-ledger.md) tested a\nlarge, shift-specific covariance anomaly. We neither repeat that experiment\nnor infer that small covariance would be useless.\n\n## 4. Choosing the next proof obligation\n\nOn actual prime openers the exact expression Q_P−R_P is twice the weighted\ntwin count **minus** twice a nonnegative odd-composite penalty L. Clipping W\nat zero removes that penalty but leaves an unestimated signed sum. Also,\neven if R₁−R₂/2=o(x/log x), the benchmark's separate estimates in (4) give\na negative lower-bound coefficient for Q−R. These statements are proved in\n[chen-opportunity-audit.md](chen-opportunity-audit.md); they do not refute Hη.\n\nThe resulting [input/weight specification](prime-detection-spec.md) proves the\nordinary progression estimates for a locally correct comparison sequence and\ngives a positive conditional payoff from a specific bilinear bound. The\n[first fold attack](bilinear-fold-attack.md) executes the least-factor and\nsecond-moment calculations without obtaining the missing saving. Its growing-\ndepth joint estimate remains open. These notes supersede the task of choosing\na concrete input package; Hη here remains a valid diagnostic condition.\n\nOnly once such a mechanism makes a testable prediction should a numerical\nexperiment be designed for it. The present computation checks definitions,\nsigns, endpoints and the classical constant. It is not an asymptotic\ncorrelation sweep and supplies no evidence that (H) holds. The immediate\nresearch uncertainty is the estimate itself, not the precision of the old\nG₂ fit or the height of another tile computation.\n"},"research/cofactor-progression-transfer.md":{"lf_sha256":"d40d4b29f3ab8f321d239cf99c3216d9d86726e7fe3a60560f5582f07097083b","content":"# A signed transfer for a growing range of small cofactors\n\n\n\n**The sufficient twin-prime margin remains OPEN.** This attempt obtains a\nsigned estimate for a larger subfamily of the corner, importing a theorem\nfrom the primary preprint cited below. It does not estimate the whole corner or claim novelty\nin the literature. The derivation below, its finite falsifiers and the\nfailed extension are the outcome; a new representation alone would not\nhave supplied an estimate.\n\nStarting checkout: `8edecf0`, clean. Read before this attempt:\n[the corrected review](transition-round-audit.md), the transition reports,\n[prime-band-transfer.md](prime-band-transfer.md), the relevant question and\noutcome entries, and the owning sharp and smoothed coefficient arguments.\nThe earlier transfer covers the prime-cofactor case s=t=1. This attempt\nretains additional cofactor divisibility instead of treating mu(n/s) as\nmu(n) or applying a theorem directly to a nonmultiplicative convolution.\n\n## 1. The estimate and its scope\n\nLet x=2N, J_x=(N,2N], and fix 0=z_i.\nUse any of these three real-argument profiles:\n\n\\[\n v_i(u)=1_{u>D_i},\\qquad\n v_i(u)=\\tau_i(u)=\\rho_i(u)1_{D_i=1 define the prime-r coefficient restricted by the\nremaining cofactor s:\n\n\\[\n A_{i,H}^{v}(m)=\n \\sum_{\\substack{spd=m\\\\p>W_i\\ {\\rm prime}\\\\s\\le H}}\n \\mu(d)\\log p\\,v_i(d). \\tag{1}\n\\]\n\nThis is an actual subfamily, with multiplicity, of the full coefficient.\nThe input m need not be squarefree; no coprimality with s is assumed.\nFor the sharp profile write C_(i,H); for transition and smooth profiles\nwrite T_(i,H) and Ctilde_(i,H). Pointwise C_(i,H)=T_(i,H)+Ctilde_(i,H).\nThus estimating the sharp product already estimates the **joint sum** of\nits four restricted transition pieces.\n\n**Derived transfer, using the imports in section 3.** There exist positive\nabsolute kappa,d such that, with H(x)=floor((log x)^kappa), for any fixed\nchoice of the two profiles above,\n\n\\[\n \\frac1{\\log X}\\sum_{\\sqrt X\\le 2^j\\le X}\n \\frac{\\left|\\sum_{2^j=1 define a multiplicative function F_a by F_a(1)=1. If p does\nnot divide a, let F_a(p^v)=mu(p^v). If p^e exactly divides a, put\n\n\\[\n F_a(p^v)=\n \\begin{cases}\n 1,&v=e,\\\\\n -1,&v=e+1,\\\\\n 0,&v\\ge1,\\ v\\notin\\{e,e+1\\}.\n \\end{cases} \\tag{3}\n\\]\n\nThen |F_a|<=1, and, **on multiples of a**,\n\n\\[\n F_a(n)=\\mu(n/a). \\tag{4}\n\\]\n\nThis follows prime by prime, including the powers of primes dividing a.\nFor example F_4(4)=1 and F_4(8)=-1, although mu(4)=mu(8)=0. Away from\nmultiples of a, (4) is not asserted: F_a(1)=1 is already a counterexample.\n\nReplace mu(m/p) by -mu(m) in (1), with m=n/s, only after accounting for\nits failure when p^2 divides m. Define\n\n\\[\n B_{i,H}^{v}(n)=-\\sum_{\\substack{s\\le H\\\\s\\mid n}}\\mu(n/s)\n \\sum_{\\substack{p\\mid n/s\\\\p>W_i}}\\log p\\,\n v_i\\!\\left(\\frac{n}{sp}\\right). \\tag{5}\n\\]\n\nOff integers divisible by the square of a prime above W_i, (1) and (5)\nare equal: mu(m/p)=-mu(m) whenever p divides m but p^2 does not, even\nif m has a square at another prime. Both coefficients have pointwise\nbound at most a constant times the divisor function times log x. The\nexceptional support has size at most\nx sum_(p>W_i)p^-2 << x/W_i. Consequently, for every fixed epsilon>0,\n\n\\[\n \\sum_{n\\in J_x} A_{L,H}^{v}(n)A_{R,H}^{v'}(n-2)\n =\\sum_{n\\in J_x} B_{L,H}^{v}(n)B_{R,H}^{v'}(n-2)\n +O_\\epsilon(x^{19/20+\\epsilon}). \\tag{6}\n\\]\n\nThe bound is uniform in H; it uses the divisor bound, not an H-dependent\npointwise estimate. Take epsilon<1/20. This error concerns repeated\nlarge primes in n, and is distinct from the already negligible\nproper-prime-power r branch of the full coefficient.\n\nFor fixed s,t the two divisibility conditions are compatible precisely\nwhen g=gcd(s,t) divides 2. If compatible, they give one residue b_(s,t)\nmodulo\n\n\\[\n Q=\\operatorname{lcm}(s,t)=st/g. \\tag{7}\n\\]\n\nOn that progression the two Mobius factors in (5) are F_s(n) and\nF_t(n-2). This is the coefficient class to which the source is applied.\nThe progression, including its density, is part of the application.\n\n## 3. The source match, with its normalization retained\n\nPrimary statements checked on 2026-09-06:\n[Tao–Teravainen, arXiv:2512.01739v2, Theorem 3.1(ii), (3.3)–(3.4)](https://arxiv.org/html/2512.01739v2)\nand [MRT, arXiv:1503.05121v3, (1.12)](https://arxiv.org/html/1503.05121v3).\nTheir proofs are imported, not reproduced. The equidistributed alternative\nand its extra prime-value condition are not used.\n\nFor the former theorem take its parameter mathcal L=(log X)^(1/4).\nFor some sufficiently small absolute c>0 its resulting rate is\n(log X)^(-c), its allowed progression modulus is Q<= (log X)^c,\nand its exceptional N-set in [sqrt X,X] has logarithmic measure\nO(log X (log X)^(-c)). The correlation is normalized by **Q/N**.\nUse h_1=0, h_2=-2 and the representative 0<=b_(s,t)= (7/24)log log X-O(log log log X).\nIt exceeds (1/4)log log X by an unbounded amount. This checks the\nnon-pretentious source hypothesis uniformly for the whole family.\n\nFor any fixed weight pair a,a', inserting (9), applying the source on\nthe progression (7), using the trivial AP count on its exceptional set,\nand then Tonelli gives\n\n\\[\n \\frac1{\\log X}\\int_{\\sqrt X}^{X}\n \\frac{\\left|\\sum_{NW_i(y)}. \\tag{14}\n\\]\n\nThe profile subscript includes D_i(y),z_i(y) and their exact floors.\nThe weights satisfy the hypotheses of section 3. One may use, for example,\nalpha=1/100 and beta=1/3 uniformly over all cells, both sides and\ns<=H_X, for sufficiently large X. The two sides' prime ranges are disjoint,\nand every active prime exceeds H_X.\n\nThere are two comparisons: replacing m=n or n-2 by x=2N in the profile,\nthen replacing x and its cuts by y. A profile jump can only change primes\nin intervals whose log endpoint widths are O_eta(delta log X+1).\nAway from the jumps, rho and h have log-argument slope at most 1/L_i;\nvariation of the denominator L_i as x changes has the same\nO_eta(delta+1/log X) cost. Hence there are nonnegative, n-independent\nprime-weight envelopes for the differences with\n\n\\[\n \\sum_p\\frac{|\\Delta a_i(p)|}{p}\\ll_\\eta\\delta\\log X+1,\n \\qquad \\sum_p\\frac{a_i(p)}p\\ll_\\eta\\log X. \\tag{15}\n\\]\n\nTo obtain (15), use sum_(p<=u)log p/p=log u+O(1) at the interval\nendpoints. Floors are covered by the O(1) widths. The shifted lower\nendpoint n-2>N-2 changes the comparison by a bounded factor as well.\nThe strict lower divisor cut in tau is included among the jumps.\n\nFor fixed s,t and primes p,q in the respective ranges,\n\n\\[\n \\#\\{NH_X and p!=q;\nwithout these facts gcd(sp,tq)=gcd(s,t) would be false.\nAfter (15), (16) and (12), the absolute normalized product error is\n\n\\[\n O_\\eta\\!\\left((1+\\log H_X)^2\n (\\delta+1/\\log X)+X^{-1/10}\\right). \\tag{17}\n\\]\n\nFor the O(1) CRT errors, a crude count suffices: at most H_X^2 times\nO(X^(29/100+4eta+o(1))) prime pairs, each with weight O(log^2 X).\nSince N>=sqrt X and eta<1/400, division by N log^2 X leaves a fixed\npower saving; polylogarithmic factors fit inside X^-1/10. This also\nprices the profile products and exact endpoint rounding.\n\n## 6. Finish the transfer, then attempt the full consumer\n\nFor each frozen cell, the dyadic estimate from section 4 can be bounded\nby its nonnegative sum over the whole outer scale range. The mesh costs\nO(1/delta). Thus the left side of (2), first with B in place of A, is at\nmost\n\n\\[\n O_\\eta\\!\\left((1+\\log H_X)^2\n \\{\\delta^{-1}(\\log X)^{-c/2}+\\delta+1/\\log X\\}\n +X^{-1/10}\\right). \\tag{18}\n\\]\n\nChoose delta=(log X)^(-c/4), decreasing c below 1 if necessary. The\nanswer is O_eta((log log X)^2 (log X)^(-c/4)). Absorb the iterated\nlogarithm by setting d=c/8>0. The repeated-large-prime error (6) is\nsmaller than any fixed logarithmic saving. This proves (2) from the\nnamed imports. The same calculation before sampling gives a continuous\naverage with exponent c/2, up to the iterated-logarithm factor.\n\nThe extension covers s>1, t>1 and nonsquarefree n that the earlier\ns=t=1 transfer did not represent. For the sharp choice it bounds the\njoint restricted corner, so it is not merely a reformulation or a\nseparate norm bound. It also applies to each restricted transition or\nsmoothed profile and their mixed products.\n\n**The attempt to pass to the full corner stops at two priced steps.**\nThe full prime-r cofactor range reaches x/D_iW_i=x^(2eta+o(1)).\nAt that range (s,t)|2 forces Q=st/(s,t), which can be a power of x,\noutside the source's polylogarithmic modulus range. Even granting a\nhypothetical uniform modulus extension with the same rate, (12) would\ncost O_eta(log^2 X), rather than O((log log X)^2). This triangle\nsummation would then supply only an x log^(4-c)-type budget before\nmesh losses, insufficient even to improve the existing x log^2 x norm\nbudget when c is small. Neither failure excludes a method that retains\ncancellation between the cofactor pairs or uses a different theorem.\n\nFor the exact consumer let C_i^P be the full prime-r sharp coefficient,\nU_i=C_i^P-C_(i,H), K_H=sum_J C_(L,H)(n)C_(R,H)(n-2), and put\n\n\\[\n J_H=\\sum_{n\\in J_x}\n \\{C_{L,H}(n)U_R(n-2)+U_L(n)C_{R,H}(n-2)+U_L(n)U_R(n-2)\\}.\n\\]\n\nThe existing proper-power estimate gives, with any fixed H_0>0,\n\n\\[\n E_\\dagger=E_{\\rm out}+K_H+J_H+O_{H_0}(x/\\log^{H_0}x). \\tag{19}\n\\]\n\nEquation (2) does not make K_H negligible at scale x: it gives an\naveraged upper budget growing like log^(2-d) X for |K_H|/N. J_H includes\nboth mixed tails and is unestimated; E_out is also unestimated at the\nrequired one-sided precision. No common-scale positive margin follows.\n\nThe subsequent [global cutoff assessment](global-cutoff-averaging.md)\nrefines the research priority: initial cutoffs can be averaged in the\nwhole identity, representing the full residual with smoother coefficients.\nThe existing norms force same-input cancellation between the corner and\nits complement. This gives a reason to test the complete global pair\nbefore extending individual cofactor terms. No shifted estimate follows.\n\n## 7. Falsifiers, records and the next obligation\n\n[cofactor-progression-transfer-validation.js](cofactor-progression-transfer-validation.js)\nchecks (3)–(7), the cofactor CRT branches, actual sharp/transition/smooth\ncoefficient reconstructions, the exact split and the mixed-tail identity.\nControls exercise nonsquarefree inputs, failure away from s|n, prime\nbands meeting the cofactor, repeated large prime squares of both signs,\nmissing mixed tails, and the Q/N sampling endpoint error. Sharp identities\nuse integer arithmetic for Mobius values; weighted numerical identities\nuse the stated floating tolerance. These are finite checks, not evidence\nfor the imported theorem or the asymptotic rate.\n\nA wrong source normalization, loss of uniform non-pretentiousness in s or\nfrequency, an unpriced profile jump, or a CRT error of size N would break\nthis transfer. Their bounds and hypotheses are written above and checked\nat the source where imported. No large census was run.\n\n**Outcome:** derived signed scale-average control for a growing small\ncofactor subfamily; failed extension to the full signed margin. The\ncurrent first priority is the complete pair in global-cutoff-averaging,\nwhich retains cancellation with the coefficient complement. If pursuing\nthe present cofactor decomposition, J_H and its mixed terms still need\nan estimate, and a faster single-pair rate must be priced against the\nfull cofactor cost. Repeating the same termwise modulus-one lift or\ncalling (2) an o(x) estimate would not advance that question.\n\nRepository verification on 2026-09-06: the linked finite validator passed;\n`node research/qc.js --index --strict` reported zero findings;\n`node research/qc/selftest.js` retained all 58 positive and 47 negative\ncontrols; `node research/audit-numbers.js` passed all 251 checks;\n`git diff --check` was clean. These gates check finite identities, recorded\nnumbers and document consistency. The analytic derivation is a direct\nattempt with a self-audit, not an independent mathematical review.\n"},"research/corner-correlation.md":{"lf_sha256":"e1f5941060c8e1fcbf62afd90883d35f22ccca504f9d0bed4e5835242b19c4c2","content":"# The corner S_0: a weighted two-point Möbius correlation at the fixed shift 2\n\n\n\n**Twin-prime infinitude remains OPEN. The sufficient margin\nC_2 x + E_dagger(x) >= c_0 x/(log x)^K remains OPEN. Nothing below changes\neither, and nothing below is an estimate.** This note is a classification and\na pricing of one region. It supplies no new bound, and its central negative —\nthat the (r,r') average is not a shift average — closes a hoped-for route\nrather than opening one.\n\nBaseline: [RESEARCH-HANDOFF.md](RESEARCH-HANDOFF.md) §3, commit `4edb6ba`.\nThe full-coefficient follow-up is\n[corner-coefficient-energy.md](corner-coefficient-energy.md): an exact\nsharp energy formula, a Graham-based norm for the full smoothed corner,\nand a small-prime cutoff difference. Those auxiliary results leave the\nsharp transition, signed saving and global complement open; the exact\ncorner here is unchanged.\n\nThe corner S_0 is the object of the wave-1 reachability analysis, whose Q1\nderives that **the existing zero-frequency budget fails the prescribed fixed\nmargin on S_0 in either orientation; only the exact a=b=1 endpoint\nfails every positive margin regardless of the cross-kernel saving**. That analysis is the\nreason this note exists; its budget table is used here as given, not\nre-derived.\n\n---\n\n## 0. Coordinates, and one correction to the wave-1 sizing\n\nThroughout x=2^j, J_x=(x/2,x], and, with\nw=6/25, v=1/20,\n\n\\[\n U=V=\\lfloor x^{w}\\rfloor,\\quad Y=Z=\\lfloor x^{v}\\rfloor,\\quad\n D_0=\\Big\\lfloor\\frac{x}{V+1}\\Big\\rfloor,\\quad\n E_0=\\Big\\lfloor\\frac{x-2}{Z+1}\\Big\\rfloor,\n\\]\n\\[\n R(x)=\\sum_{\\substack{d>U,\\ k>V,\\ e>Y,\\ t>Z\\\\ dk-et=2,\\ dk\\in J_x}}\n \\mu(d)\\mu(e)\\beta_V(k)\\beta_Z(t),\\qquad\n \\beta_W(k)=\\sum_{r\\mid k,\\ r>W}\\Lambda(r).\n\\]\n\nFix eta_0 with 03/4, 57/10-14eta_0>49/20, and\n19/25-2eta_0>151/200 exactly when eta_0<1/400), so S_0 ⊂ W_dagger and\nits mass belongs to E_dagger. The third condition is a disjunction; its\nsecond disjunct de^3>floor(x^(321/200)) holds on S_0 with exponent\n361/100-8eta_0, so the inclusion itself holds for every eta_0<13/56.\nThe bound eta_0<1/400 is forced elsewhere, by the single-prime-power\ncofactor statement in section 1.1 and the norm lower-bound range of\n[sharp-corner-transition.md](sharp-corner-transition.md), not by this\ninclusion ([transition-joint-budget.md](transition-joint-budget.md) §1.4).\n\n**Correction to the wave-1 sizing (derived).** That report records the\ne-edge proper-prime-power class, of size O(x^(39/40) log^C x), as \"not\nnegligible against x/log^H x on its own\". It is negligible: for every\nfixed H,\nx^(39/40)log^C x · log^H x / x = log^(C+H)x / x^(1/40) -> 0.\nBoth prime-power classes below are therefore absorbed into the arbitrary\nfixed logarithmic error, and neither has to be carried. One conclusion in\nthat report does depend on the point: its J4 triage against the e-edge\ncites this class as a cost that must be carried. That reason falls away.\nJ4's other two reasons stand — the split (19/20, 1/20) is worse than\n(19/25, 6/25) on every axis, and its clearing price is the larger — so\nthe triage survives with one fewer argument.\n\n---\n\n## 1. The corner sum, written exactly\n\n### 1.1 One prime base on each side, with the s, s' branches kept\n\nOn S_0, kV and Q^b>V\nwith P!=Q would force k>=P^aQ^b>V^2. It does **not** exclude two powers\nof one base, P^a and P^(a+1), both dividing k and both above V; those\nhave a>=1 and P^(a+1)|k, hence lie inside the proper-prime-power class\npriced below. So the correct statement is: **at most one prime base\ncontributes, and up to that class exactly one prime power divides each\ncofactor, with weight (log r)(log r').** The validator counts the\nexceptions explicitly — cofactors with two prime powers above the cutoff:\n2, 0 and 5 in the three cases — and sums over all of them, so the\nidentity checks of §6 are unaffected by this correction. Write\n\n\\[\n k=rs,\\qquad r=P^a>V,\\qquad s=k/rZ,\\qquad s'=t/r'=2,\nsum_(p^j>W,j>=2) p^(-j) << W^(-1/2): split p at sqrt(W).\nFor each smaller p its geometric tail is at most 2/W; for larger p\nsum_(j>=2)p^(-j)<=2/p^2, and summing over integers bounds both ranges.\nCounting multiples costs at most x times this tail. Divisor multiplicity\nand logarithmic weights are absorbed in x^epsilon. Thus the V and Z\nclasses cost O(x^(22/25+epsilon)) and O(x^(39/40+epsilon)), respectively,\nincluding repeated powers of the same base. For fixed sufficiently small\nepsilon these are O_H(x/log^H x) for every fixed H. This does not remove\ns,s'>1 or all non-squarefree n. See [independent review F5](history/reviews-0906/20-independent-handoff-review.md).\n\n*Coprimality of the two band primes.* For eta_0<19/200 the two bands\n(V, V x^(2eta_0)] and (Z, Z x^(2eta_0)] are disjoint, so r≠r' always and\n(r,r')=1 is automatic. It is **not** automatic for the cofactors: with\ns,s'>1 the gcd g=(k,t) may be 2, and g must divide 2 for a solution to\nexist. Both branches are kept below.\n\n### 1.2 The exact corner sum\n\nFor K=rs, T=r's' with g=(K,T)|2, put\nK/g · d_0 ≡ 2/g (mod T/g), 0<=d_00. \\tag{1}\n\\]\n\nI(K,T) is the integer window cut out by max(U,D_1)> gx/(2KT) holds where the two corner cuts\nd>D_1, e>E_1 are already implied by x/2=d>x^(19/25-2eta_0)\nand b>=e>x^(19/20-2eta_0), so\n\n\\[\n q=\\frac{ab}{g}\\ \\ge\\ \\tfrac12\\,x^{171/100-4\\eta_0}\\ \\gg\\ x . \\tag{2}\n\\]\n\nEach compatible congruence class therefore meets J_x in **at most one**\ninteger, and Delta_{a,b} is a difference of two sawtooths at essentially\narbitrary arguments with no complete period available. This is the exact\nlocal form of the wave-1 observation that at the corner \"there is no\ncomplete period to remove\"; Fourier completion buys nothing here.\n\nThe useful consequence is in the other direction. By the exact discrete\npartial summation of signed-divisor-grouping (17)–(18),\nR|_{S_0}=M|_{S_0}+E_dagger|_{S_0} with M the discrete density term (11).\nAt fixed (n,e,r,s) the S_0 condition leaves d in a single interval inside\n[U/2,x], and the excluded-prime Möbius mean\n[signed-divisor-grouping (7)–(8)](signed-divisor-grouping.md), which is\nuniform in the excluded-prime parameter m<=2es<=x^2, applies verbatim.\nHence M|_{S_0}=O_H(x/log^H x) and\n\n\\[\n E_\\dagger\\big|_{S_0}(x)=R\\big|_{S_0}(x)+O_H(x/\\log^H x). \\tag{3}\n\\]\n\nSo the sawtooth weights do **not** simplify into anything summable on\nS_0; what simplifies is that one may discard the sawtooth formalism\nthere and work with the raw signed residual (1). That is a removal of a\nfalse hope, not a saving.\n\n### 1.4 The two-point form\n\nLet C_{U,V}^{S_0}(n)=sum over dk=n with k>V, max(U,D_1)V\\\\ D_1Z\\\\ E_1=2 are included (the\nS11 sub-family of the validator in §6 is this version), the difference\nfrom the right side of (5) also contains the proper-prime-power class of\n§1.1, O(x^(22/25+epsilon)+x^(39/40+epsilon)). That class is not smaller\nthan the one named above: return #58 (job #17) measured its right-side\npart at 0.30 to 0.76 x/sqrt(Z) over x in [2^20,2^26] at proxy cutoffs,\nagainst 0.20 to 0.26 x/Z for the r|d, r'|e class. Both versions are\nO_H(x/log^H x); nothing below depends on which is used.\n\n**The prime-cofactor subfamily is mu(n)mu(n-2) against a\nnonnegative weight with exact cofactor cuts.** No dominance of this\nsubfamily over the full corner is established. On the squarefree class, the general\nfamily (4) has a signed divisor weight. Outside that class it needs a\nseparate remainder and cannot be written as a multiple of mu(n)mu(n-2). Two riders, both derived and both checked\nnumerically in §6:\n\n- *2-adic reduction.* If mu(n)mu(n-2)≠0 then n is odd (n even forces\n 4|n or 4|n-2), so k and t are odd and g=(k,t)=1. The g=2 branch of the\n CRT kernel lives entirely on the class where mu(n)mu(n-2)=0 while\n mu(d)mu(e)≠0.\n- *The non-squarefree class is not small.* Terms with mu(d)mu(e)≠0 but n\n or n-2 non-squarefree arise when a prime dividing s also divides d, and\n those are common. At the finite parameters of §6 they carry the\n majority of the term-wise mass. Isolating (5) first is therefore not a\n cosmetic step.\n\n### 1.5 How much mass is there\n\nAt fixed 0V,rs<=x^(w+2eta_0)) (log r)/(rs) of order\neta_0^2*log^2 x. For a lower bound restrict both prime log-widths and\nsmall-cofactor log-widths to eta_0, with odd coprime s,s', then count\nsquarefree d,e as in the review. No leading Euler-product constant is\nasserted, and these fixed-eta statements cannot be substituted at eta(x).\n\n---\n\n## 2. What the sufficient consumer actually needs on S_0\n\n### 2.1 The conditional requirement\n\nSuppose the complement W_dagger \\ S_0 were controlled to O_H(x/log^H x)\nwith H>K — which is **not** proved. A formal exponent calculation in\nreachability Q3.5 is not a necessity theorem for all ways of estimating\nthat complement. Under this explicit complement hypothesis,\nhandoff §3's consumer becomes exactly\n\n\\[\n E_\\dagger\\big|_{S_0}(x)\\ \\ge\\ -C_2x+c_0\\,\\frac{x}{\\log^Kx}\n \\quad\\text{on an unbounded set of dyadic }x. \\tag{6}\n\\]\n\n### 2.2 (6) is not a lemma; it is the theorem\n\nUnconditionally S(x)=sum_{n in J_x}Lambda(n)Lambda(n-2)>=0, and\nS=C_2x+E_dagger+O_H(x/log^H x). So\n\n\\[\n E_\\dagger(x)\\ \\ge\\ -C_2x-O_H(x/\\log^Hx) \\tag{7}\n\\]\n\nholds with **no further arithmetic input** beyond the reduction itself.\nThe entire content of the sufficient consumer is the margin c_0 x/log^K x.\nConsequently, given the complement hypothesis, (6) implies and is implied\nby S(x) >= c_0 x/log^K x + O_H(x/log^H x). That margin sits between two\nquantitative twin lower bounds differing by log^2 x: it yields\nN_2(x) >= (c_0/2)x/log^(K+2)x (handoff §3), and conversely\nN_2(x) >= c x/log^K x yields a margin of that shape, since each genuine\npair contributes ≍ log^2 x to S. So a one-sided attack on S_0 is not a\nstep towards the theorem; conditionally it is the theorem up to that\nlog^2 x. This is stated flatly because it determines what is worth\nattempting there.\n\nThe absolute route is the one that behaves like a lemma. If\n|E_dagger|_{S_0}|=o(x) then, given the complement,\nC_2x+E_dagger>=(C_2-o(1))x, a fixed-fraction margin, far more than (6)\nasks. By §1.5 the triangle inequality gives ≍ eta_0^4 x log^4 x, so:\n\nA saving of log^(4+eps) x over the full unsigned envelope is sufficient\nfor o(x); for the prime-cofactor subfamily log^(2+eps) x is sufficient.\nThese are sufficient absolute estimates, not necessary rates for every\none-sided argument.\n\n### 2.3 Shrinking eta requires new uniform estimates\n\nThe mass estimates above hold for fixed eta_0. The moment bounds retain\nx^epsilon losses and constants depending on fixed margins. Neither is\nuniform at eta(x) without additional work. In particular the former\ncomparison of eta^4*log^4 x against x^(-c eta+epsilon) does not prove\nthat no eta(x) works. It only diagnoses a tension in an optimistic\nsubstitution that has not been justified. The global shrinking-window\nstrategy remains OPEN; the existing bounds do not establish it.\n\n### 2.4 Is there structural positivity or a sign bias in (1)?\n\nAssessed candidate by candidate. **No bias was found; the sum is\ngenuinely signed.**\n\n| candidate source of a sign | status |\n|---|---|\n| the u_1=u_2, h_1=h_2 diagonal | not present. That diagonal is nonnegative inside the *second moment* after the first Cauchy; (1) is the raw signed sum, before any moment. Reachability Q1.6 item 3 is about the moment, not about R|_{S_0}. |\n| coprimality forced by dr-er'=2 | derived: (d,e)|2, (d,r')=1, (e,r)=1, (n,n-2)|2, and by §1.4 n odd on the squarefree class. Each is a *support* restriction; none biases mu(d)mu(e). singleton-fiber-audit §3 derives that both signs occupy a positive proportion of odd squarefree coprime divisor pairs on a box, and that counting argument transfers verbatim to the corner's boxes. |\n| the density subtraction already performed | removes nothing exploitable: by (3), M|_{S_0}=O_H(x/log^H x), so no positive main term survives on S_0 to be leaned on. |\n| nonnegativity of L, L' in (5) | the weights are nonnegative but the sign is carried by mu(n)mu(n-2), which is exactly the unknown. |\n| S(x)>=0 | gives (7) only, i.e. the trivial direction; see §2.2. |\n| longest-fiber structure | on S_0, kt can range up to x^(29/100+4eta_0), still below x; away from clipping, fibers have many points, while upper-edge clipping can shorten them: S_0 is the *opposite* extreme to the singleton family of singleton-fiber-audit, whose lower bounds are for kv>x. No sign information is transferred either way. |\n\nHeuristically, under a Chowla-type independence model the inner sums in\n(1) are square-root sized and the whole of (1) is O(x^(0.65+eps)), far\ninside (6). That is a heuristic and carries no weight here beyond saying\nthat the obstruction is not expected to be a real main term.\n\n---\n\n## 3. Classification against the literature, in the owning conventions\n\nSearched per [SEARCH-CONVENTIONS.md](SEARCH-CONVENTIONS.md) row\n\"the residual with two signed factors and fixed product difference\"\n(owning words: two-point Möbius correlations, averaged Chowla,\nlogarithmically averaged Elliott, determinant equation). The mismatches\nalready recorded as [F-0905-11](OUTCOMES.md) are not repeated as new\nfindings; what is new here is §3.1, which is structural rather than a\nparameter mismatch.\n\n### 3.1 What averaging our object actually offers — derived negative\n\nThe corner offers x^(29/100+4eta_0+o(1)) pairs of prime dilations\n(r,r') with r ≍ x^(6/25) and r' ≍ x^(1/20), each with an inner sum of\nlength ≍ x/(rr') (so x^(71/100) at the foot of the bands), logarithmic\nweights (log r)(log r'), a fixed interval J_x, and the additional (s,s')\ndivisor sums.\n\n**The map (r,s,r',s',m) ↦ (n, k, t, r, r') with n = d·rs, k = rs,\nt = r's' is a bijection onto\n{(n,k,t,r,r'): k|n, t|(n-2), r in supp beta_V(k), r' in supp beta_Z(t),\ncorner cuts}.** The last two coordinates record which prime power supplies\nthe weight, so this is a bijection with multiplicity rather than onto the\ntriples alone; the s=s'=1 sub-family and the exceptional multi-power\ncofactors of §1.1 are both covered. Summing the weights over the last two\ncoordinates gives (4). Either form supports the conclusion equally:\n\n- the (r,r') average **is** the average over the factorisations of n and\n n-2 at the single fixed shift 2. It is not an independent resource\n sitting outside the correlation; it is the correlation, re-indexed;\n- the change of variables the assignment asks about does exist — fixing r\n and varying r' moves d_0(r,r') = 2·r-bar mod r' over residues — but it\n moves the base point of a progression, **not** the shift of a\n correlation. The shift is invariant at 2. The available additive-shift\n range is zero, at zero cost, because there is nothing to convert;\n- consequently [Matomäki–Radziwiłł–Tao's averaged Chowla](https://arxiv.org/abs/1503.05121),\n whose whole content is an average over additive shifts h_1..h_k<=H with\n H->infinity, has no purchase here. This is stronger than the parameter\n mismatch recorded in F-0905-11: the mismatch is structural.\n\nThe one genuinely relevant reading of the (r,r') average is the opposite\none: the weight \"n has a prime factor in a band\" is exactly the device\nTao's entropy decrement and the Helfgott–Radziwiłł / Pilatte expansion\narguments use *inside* their proofs. Our object arrives with that device\nalready applied, at fixed prime scales x^(6/25) and x^(1/20) rather than\nat the ranges those arguments require.\n\n### 3.2 Sources, statements and hypotheses\n\nStatements below were read at the cited source; \"CHECKED\" means the\nstatement and the listed hypotheses were read there in this session,\n\"ASSUMED\" means it is carried from an existing repository record.\n\n| source | statement read | average | coefficients / shift | saving | why it does not close S_0 |\n|---|---|---|---|---|---|\n| [Tao, *Forum Math. Pi* **4** (2016) e8 = arXiv:1509.05422](https://arxiv.org/abs/1509.05422), Thm 1.2, Thm 1.3 | logarithmically averaged Chowla for **two linear forms** a_1n+b_1, a_2n+b_2 with a_1b_2-a_2b_1≠0; Thm 1.3 the Elliott/nonasymptotic form with a non-pretentiousness hypothesis on g_1 | logarithmic, over (x/omega,x] | a_i, b_i **fixed**; Thm 1.3 has a threshold A=A(eps,a_1,a_2,b_1,b_2) | qualitative o(log omega) | our a_i are r' ≍ x^(1/20) and r ≍ x^(6/25), growing; the threshold is not stated uniformly in them, and a logarithmic-average o(1) is not a natural-average saving. CHECKED (statement and the coefficient-dependent threshold). Already recorded as F-0905-11. |\n| [Matomäki–Radziwiłł–Tao, arXiv:1503.05121](https://arxiv.org/abs/1503.05121) | sum over h_1..h_k<=H of the absolute correlation is o(H^k X), any H=H(X)->infinity | additive-shift average | forms fixed, shifts averaged | ≍ log log H/log H | no shift average exists here, by §3.1. CHECKED (abstract and main statement). |\n| [Helfgott–Radziwiłł, arXiv:2103.06853](https://arxiv.org/abs/2103.06853), Main Theorem | eigenvalues of the centered divisibility operator are O(sqrt(L)) off a density-1 set; consequence (1/log x)sum lambda(n)lambda(n+1)/n = O((log log x)^(-1/2)) | logarithmic | fixed shift 1, lambda not mu, no weights | (log log x)^(-1/2) | wrong average, and the saving is (log log)^(-1/2) against a requirement of log^(4+eps). CHECKED (abstract, main theorem, prime ranges log H_0 >= (log H)^(2/3+eps), log H <= (log N)^(1/2-eps)). Also recorded in structural-literature-audit §3E. |\n| [Pilatte, arXiv:2310.19357](https://arxiv.org/abs/2310.19357), Thm 1.1 | sum_{n<=x} lambda(n)lambda(n+1)/n << (log x)^(1-c), c>0 absolute | logarithmic | fixed shift 1 | (log x)^(-c), c unspecified, described as best possible with current methods | wrong average; c is not claimed to exceed 4, or 2 for the sub-family; no weights, lambda not mu. Abstract CHECKED; the value of c and Theorem 1.1's exact form NOT checked at source. |\n| [Tao–Teräväinen, arXiv:1809.02518](https://arxiv.org/abs/1809.02518), Cor. 1.13 and the Chowla corollary | **unweighted** two-point Chowla/Elliott at all scales X outside a set of logarithmic Banach density zero | natural within a scale; exceptional scale set | shifts h_1,h_2 **fixed**, no uniformity stated | qualitative o(X) | closest interface to the handoff's scale-average consumer, and the only one on a natural average. Two blocks: coefficients fixed, and o(X) applied fibrewise gives o(mass)=o(eta_0^4 x log^4 x), not o(x). CHECKED via the ar5iv text; the proof's uniformity NOT checked. |\n| [arXiv:2608.23500 (2026)](https://arxiv.org/html/2608.23500), Thm 1.1 | (log x)^(1-c) bound on sum_{n<=y} lambda(n)lambda(n+h)/n for every h outside a set E_x with |E_x ∩ [1,H]| <<_A H(log x)^(-A) | logarithmic | fixed forms; h ranges | (log x)^(-c) | wrong average; and h=2 is one shift, which the theorem's exceptional set is not shown to avoid. CHECKED (abstract and theorem statement). |\n| [Tao–Teräväinen, arXiv:2512.01739](https://arxiv.org/html/2512.01739v2), Thm 3.1, Rem. 3.2 | quantitative correlations of 1-bounded multiplicative functions outside a small set of logarithmic scales; moduli and shifts bounded by a small power of a parameter <= log X | logarithmic scales | polylogarithmic coefficients | quantitative | our coefficients are fixed powers of x. ASSUMED from structural-literature-audit §3E; not re-fetched here. |\n| Frantzikinakis; [Frantzikinakis–Host](https://arxiv.org/abs/1611.09338) | ergodic reductions: ergodicity/genericity hypotheses on the Liouville system imply Chowla | — | — | conditional | conditional on an unproved ergodic hypothesis; supplies no unconditional bound. CHECKED at abstract level only. |\n| Klurman, *Compositio* **153** (2017) 1622–1657; [Klurman–Mangerel, *Math. Ann.* **372** (2018) 651–697](https://arxiv.org/abs/1707.07817) | rigidity/converse: if many binary correlations of a 1-bounded multiplicative f match a character's, then f(n)=chi'(n)n^(it) | — | fixed shifts | — | the converse direction. Gives no upper bound for our sum. CHECKED at abstract level only. |\n| [Friedlander–Iwaniec, asymptotic sieve for primes](https://arxiv.org/pdf/math/9811186), Thm 1 with (R),(B) | distribution plus a signed bilinear hypothesis yields a prime asymptotic | — | — | — | hypothesis (B) is itself a signed bilinear axiom; invoking it renames the problem. ASSUMED from structural-literature-audit §3F. |\n\n*Not verified, and not used:* the assignment's remark that Chowla for\nmu(an+b)mu(cn+d) with fixed a,c is equivalent to the two-point case. Tao's\nTheorem 1.2 covers two linear forms directly in the logarithmically\naveraged setting, which is what matters here; a formal equivalence for the\nunaveraged conjecture was not located and is not relied on anywhere above.\n\n### 3.3 Two determinant-equation interfaces, priced at the corner\n\nThese two were checked at source in this session because they attach to the\ndeterminant equation itself rather than to the correlation. Both fail, with\nexplicit exponents. Neither failure is a refutation of the underlying\ntarget.\n\n#### (a) Bettin–Chandee, *Adv. Math.* **328** (2018) = arXiv:1502.00769v1, Corollary 1 — fails on smoothness, and on norms, in mutually exclusive orientations\n\nRead at source (p. 3, eq. (1.4)). For Delta≠0 and\nT = sum over m_1n_2-m_2n_1=Delta of f(m_1)g(m_2)alpha_{n_1}beta_{n_2},\nwith supports [M_i/2,M_i], [N_i/2,N_i], **alpha and beta arbitrary** but\nf, g smooth to all orders,\n\n\\[\n f^{(j)}\\ll\\eta^{j}M_1^{-j},\\qquad g^{(j)}\\ll\\eta^{j}M_2^{-j}\n \\quad(\\forall j\\ge0,\\ \\text{some }\\eta>1),\n\\]\n\nthe asymptotic holds with main term over (n_1,n_2)|Delta and error\n\n\\[\n O\\big((\\eta R)^{3/2}\\,\\|\\alpha\\|\\,\\|\\beta\\|\\,(N_1N_2)^{7/20}(N_1+N_2)^{1/4+\\epsilon}(M_1M_2)^{\\epsilon}\\big),\n \\quad R=\\frac{M_1N_2}{M_2N_1}+\\frac{M_2N_1}{M_1N_2}.\n\\]\n\nMatching our corner equation dk-et=2 (so Delta=2) admits three orientations.\nR ≍ 1 in all three, which is the one hypothesis the corner satisfies\ncomfortably. Exponents of x, with the s=s'=1 scales\nd ≍ x^(19/25), e ≍ x^(19/20), k=r ≍ x^(6/25), t=r' ≍ x^(1/20):\n\n| orientation | (M_1,M_2,N_1,N_2) | smooth weights required on | required eta | error exponent at eta=1 | error exponent at the actual eta | main term |\n|---|---|---|---|---|---|---|\n| A: smooth on the cofactors | (x^(6/25), x^(1/20), x^(19/20), x^(19/25)) | beta_V(k), beta_Z(t) | ≍ M_1 = x^(6/25) | 1691/1000 | 2051/1000 | ≍ x |\n| B: smooth on the divisors | (x^(19/25), x^(19/20), x^(1/20), x^(6/25)) | mu(d), mu(e) | ≍ M_1 = x^(19/25) | 613/2000 | 2893/2000 | ≍ x |\n| C: primes absorbed, smooth on s, s' | (x^(2eta_0), x^(2eta_0), x, x) | the constant 1 | O(1) | 39/20 | 39/20 | ≍ x^(1+2eta_0) |\n\nReadings, all derived from the displayed error term:\n\n- **Orientation B is the only one whose norms work, and it fails exactly on\n smoothness.** At eta=1 the error exponent is 613/2000 against a main\n term of exponent 1 — a saving of x^(1387/2000). The affordable smoothness\n budget is eta=0, with the implied constants\n independent of j, so admitting mu(d) at eta ≍ M_1 presupposes a smooth\n interpolation of mu on [M_1/2,M_1] whose derivative constants are\n uniform in j. No such interpolation is exhibited here or known to the\n author; without one the orientation does not meet the hypothesis at any\n eta, and 2893/2000 is a lower bound on its cost, not its cost. This is the\n coordinator's point, confirmed with the exponents: the corner's weights are\n the least smooth case, and it fails there.\n- **Orientation A puts the arbitrary coefficients on the long variables**,\n where ||alpha||||beta||(N_1N_2)^(7/20)(N_1+N_2)^(1/4) alone is x^(1691/1000),\n already x^(691/1000) above the object before any smoothness cost. The\n corollary saves N^(1/20) when N ≍ M; our box has N_1N_2 = x^(171/100)\n against M_1M_2 = x^(29/100), unbalanced in the direction that hurts.\n- **Orientation C satisfies the smoothness hypothesis** (f=g=1 on a dyadic\n block) but aggregates the primes into the long variables, giving\n ||alpha||,||beta|| ≍ x^(1/2) and error exponent 39/20, x^(19/20) above the\n object.\n\nSo smoothness and the norm budget are satisfiable at the corner only in\nmutually exclusive orientations. A separate agent owns Corollary 1 on the\nbulk; nothing above bears on that.\n\n#### (b) Guria, arXiv:2410.10856v2, Theorems 1.2 and 1.3 — the right prime mechanism, no free variable to apply it to\n\nRead at source. Theorem 1.2 counts (a,b,p,d) in [-X,X]^4 with ad-pb=r,\np prime, one weight alpha(a)=O(a^eps) and b, d free; Theorem 1.3 has two\nprimes p, q with b, d free and gives\nS_r(X) = 8 K_r (li X)^2 + O(X^(1+3/4+eps) + r^(1/5)X^(1+11/20+eps)),\nuniformly for 0<|r|<= q. In her cube, b and d have length X against moduli\n a, p ≍ X, so the dual has length ≍ 1. At the corner the only variables\n not carrying an oscillating weight are the cofactors: k has length\n x^(6/25) against a modulus e ≍ x^(19/20), dual length x^(71/100) — the\n dual sum is longer than the original by x^(47/100), and r' is shorter\n still. Her prime is also comparable to the other variables; ours are\n x^(6/25) and x^(1/20), and the r'-average has only x^(1/20+2eta_0+o(1))\n terms.\n3. **Two Möbius weights, and no main term (structural).** Her theorems allow\n one arbitrary weight; the other three variables are free, which is why\n Poisson applies and why the conclusion is an asymptotic with a genuine\n main term of size ≍ (li X)^2. The corner carries mu(d) *and* mu(e) on the\n two long variables and prime restrictions on both short ones: no free\n variable exists. And by (3) the density on S_0 has already been\n subtracted and is O_H(x/log^H x), so there is no main term to produce —\n the whole object is the fluctuation. A counting theorem transfers to it\n only through its error term, and by item 1 that term already exceeds it.\n\nWhat would have to be proved instead: an analogue of Theorem 1.3 for the\nunbalanced box d ≍ x^(19/25), e ≍ x^(19/20), r ≍ x^(6/25), r' ≍ x^(1/20),\nwith arbitrary bounded coefficients on **both** long variables and error\no(x/log^K x). By §2.2 that statement is, given the complement, at least as\nstrong as a quantitative twin lower bound. That is not a reason to dismiss\nthe mechanism, but it is a reason not to expect it from a parameter\nsubstitution into a counting theorem.\n\n### 3.4 Updated quantitative comparison\n\nThe earlier source table describes the particular versions and direct\nsubstitutions inspected there. It is not an exhaustive current absence\nclaim. [prime-band-transfer.md](prime-band-transfer.md) now consumes\n[Tao-Teravainen v2 Theorem 3.1](https://arxiv.org/html/2512.01739v2)\nthrough an exact bounded multiplicative Fourier lift. Uniformity in its\nparameters and the moving-window mesh are priced there. This gives a\nsmall continuous scale-average log saving for the absolute\nprime-cofactor sum normalized by N*log^2 X, at fixed eta.\n\nThe interval-stability argument in [round-review-0906.md](round-review-0906.md)\n§2 also gives a dyadic scale-average saving, with exponent c_*/2. Neither\nestimate gives o(N) or a bound at every dyadic point. The full C-product\nretains remaining prime-r cofactor and non-squarefree branches; proper\nprime powers are separately negligible by §1.1. The handoff's one-sided\nconsumer needs a stronger rate and the full remainder's accounting.\nNo full-corner estimate follows from these transfers.\n\nAgainst the fixed-eta unsigned envelopes, a saving of more than four\nlog powers for the full corner, or more than two for the subfamily,\nis **sufficient** to reach o(x) by absolute estimation. These are not\nnecessary exponents for every one-sided argument, and a suitable\nlittle-o improvement at equality would also suffice. Any new theorem\ncomparison must price its actual norm, rate, exceptional scales and\ncoefficient class rather than repeat a blanket absence assertion.\n\n---\n\n### 3.6 Prior art for the shape, found after the classification\n\nThe object in (5) is not new as a shape. Tao's 2016 notes on the Bombieri\nasymptotic sieve state that on GEH the twin asymptotic is equivalent to\nsum_{n<=x} mu(n) 1_R(n) mu(n+2) 1_R(n+2) = o(x/log^2 x) for the\nx^alpha-rough indicator 1_R, \"and similarly with 1_R replaced by other\nsieves\", and give the reason recent Chowla progress does not transfer:\nthe weight destroys multiplicativity of mu at small primes. Maynard's\nICM 2022 survey poses the four-variable determinant-2 sum with arbitrary\nbounded coefficients as Question 17 and remarks that the natural\nCauchy-Schwarz argument gains little. The identification in (4)-(5) is\ntherefore an independent rediscovery of a known framing, reached here\nthrough the Vaughan-type remainder rather than the asymptotic sieve; see\n[consumer-comparison.md](consumer-comparison.md) for the sources. Two\ndifferences travel with the attribution: the weight L here restricts a\nlarge prime factor and leaves small primes unrestricted, so Tao's stated\nnon-transfer reason does not apply verbatim and would have to be\nre-argued; and the required relative saving here is log^(4+eps) x against\nhis o(1), because the whole prime band is summed with log r weights. The\none-sided target's equivalence with the twin margin holds for any\nsubregion whose complement is controlled, so it is a property of the\nconsumer, not of S_0.\n\n## 4. The parity input, named\n\n*What this note used.* Exact divisibility and CRT algebra; the classical\nMöbius mean [Tao, Notes 2, Exercise 66](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/)\nthrough signed-divisor-grouping (7)–(8); quantitative PNT\n[Tao, Notes 2, Corollary 39](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/);\nMertens; and counting. Nothing here uses more than residue and density\ninformation plus those classical means. In particular §§1–2 use no\nbilinear estimate, no large sieve and no sieve upper bound beyond\ncounting.\n\n*Does closing S_0 require more?* **Assessment, medium-high confidence,\nnot a theorem.** Yes. Identity (5) says the corner's leading family is\nsum_n mu(n)mu(n-2)L(n)L'(n-2) with L,L'>=0: the corner does not merely\nresemble the parity difficulty, it **is** the two-point Möbius\ncorrelation at shift 2, weighted. Every advance on that object reviewed\nin §3 uses inputs beyond residue counting and sieve upper bounds —\nHalász/pretentious distance, Matomäki–Radziwiłł short-interval averages,\nentropy decrement, expander and non-backtracking estimates. Nothing in\nthe tile framework supplies any of those.\n\n*What is NOT claimed.* No obstruction theorem. Per\n[F-0905-01](OUTCOMES.md) and the parity gate, an obstruction claim must\nname its method class, the statistics it retains, the errors it tolerates\nand its quantifiers, and prove a statement at that scope. This note names\nnone and proves none. What is derived instead is narrower and checkable:\nthe structural negative in §3.1 (no shift average exists), the\nquantitative gap in §2.2 (log^(4+eps) on a natural average), and the\nincompatibility in §2.3 (eta_0 cannot be shrunk).\n\n---\n\n## 5. Payoff, exactly\n\n**What a complete corner estimate would change.**\n\n- The reduction S(x)=C_2x+E_dagger(x)+O_H(x/log^H x) is unchanged. A\n corner estimate changes only the accounting: |E_dagger|_{S_0}|=o(x)\n would give E_dagger=E_dagger|_{W_dagger\\S_0}+o(x), so the sufficient\n consumer of handoff §3 would reduce to a statement about the complement\n alone.\n- It changes **no** budget, region or cut in\n [grouped-divisor-moment (15), (19), (21)](grouped-divisor-moment.md).\n The block budgets (1+a)/2, a/2+3b/2, a are untouched; the added region\n delta<19/25 and delta+3nu<161/100 is untouched; the target (21) and its\n \"more than 3/50\" are untouched.\n- It does **not** raise the uniform product threshold, which stays at\n every fixed exponent below 19/25. The witness (8/25,11/25) is outside\n S_0.\n- It does **not** let the vertical cutoff delta<19/25 in (15) be dropped.\n S_0 is the *intersection* {delta>19/25-2eta_0} ∩ {nu>19/20-2eta_0}; the\n d-edge strip S_R and the e-edge strip S_T of reachability Q3.1 both\n survive. Their clearing prices are not 11/10 and 37/25: those are the\n costs at the *cheapest single points* of the two edges, (19/25,1/20) and\n (6/25,19/20). Clearing either edge apart from the corner drives gamma to\n 2, because along the d-edge the only usable orientation is the left one,\n whose requirement 2-3p-q tends to 2 as q tends to 0, and symmetrically\n on the e-edge. Both strips inherit the corner's own price in the limit.\n\n**What it would not do, and what nothing else does.** Reachability D1\nderives that no nonzero-kernel improvement, of any size, reaches S_0; D2\nderives that reducing the leftover to S_0 alone already needs gamma=2\nuniformly. So the corner cannot be removed by the moment route and the\ncomplement cannot be removed by the corner route: the two halves are\ndisjoint and neither is proved. Even both together would then have to be\ncombined with the still-unproved uniform saving to reach (6).\n\n**Triage opinion (mine, flagged).** The absolute target on the s=s'=1\nsub-family, (5) with a log^(2+eps) saving, is the smallest well-posed\npiece of the corner and the only one whose statement is a recognisable\nopen problem rather than an equivalent of the theorem. I would not spend\nan attempt on the one-sided form (6): §2.2 shows it is the conclusion.\nMedium confidence; this is triage, not a result.\n\n---\n\n## 6. Validation, controls and falsifiers\n\n[corner-correlation-validation.js](corner-correlation-validation.js)\nchecks the algebra of §1 exactly, as integer combinations of\nlog(r)log(r'), at three finite parameter sets. At reachable x the\nasymptotic windows are degenerate (Z=floor(x^(1/20)) is 2 at x=2^22), so\ntwo of the three cases use larger cutoff exponents w, v chosen so that\nthe s>1, s'>1, prime-power and g=2 branches are actually populated; the\ncorner is defined intrinsically as V\n\n**Twin-prime infinitude and the sufficient signed margin remain OPEN.**\nThe previous assessment overstated support, transfer barriers and rate\nnecessity. [Readiness review F6–F7](history/reviews-0906/21-readiness-review.md)\nsupplies the corrections; [prime-band-transfer.md](prime-band-transfer.md)\nowns the resulting weaker arithmetic transfer. Nothing here changes a\ncontrolled region or the full endpoint remainder.\n\n## 1. Objects and support\n\nUse the exact floors and weights L_w,L'_w of\n[corner-correlation (5)](corner-correlation.md). These represent only the\ns=s'=1 prime-cofactor subfamily, up to its proper-square error. The full\ncorner is that note's C(n)C'(n-2) sum, including all other branches.\n\nFor a pure band B=(V,V*x^(2eta)], let L_b(n)=sum_(p|n,p in B) log p.\nFor every prime q outside B, L_b(qn)=L_b(n), exactly. For the window,\na term p*d is retained when D1=x^rho with\nrho>29/100+4eta; for the upper bound use L_b,L'_b<=log x.\nNo sharp uniform eta dependence is asserted for that full average.\n\nAn O_eta(x log x) swap is too costly for an o(x) target, but is affordable\nfor a normalized relative log saving smaller than one log power. The\nlatter distinction is used in prime-band-transfer §3. A moving band is\nnot exactly dilation invariant; that fact alone does not prohibit other\nrepresentations or signed estimates.\n\n## 3. Rates and quantifiers\n\nPut T_x(y)=sum_(n<=y) a_x(n)/n for a family pinned at x. If\nsup_(y<=x)|T_x(y)|<=E_x, Abel summation gives\n|sum_(n in J_x)a_x(n)|<=4xE_x. A bound only at y=x does not suffice.\nAgainst an envelope of order log^3 x, a uniform-prefix bound\nO(log^(3-c)x) with c>3 is sufficient for o(x). So is o(1) at the\nborderline. These are sufficient conditions for this conversion, not\nnecessary conditions for the one-sided consumer or all scale-average\narguments. A qualitative logarithmic theorem alone supplies no useful\npointwise dyadic improvement at this normalization.\n\nThe elementary witness a_x(n)=1_(n in J_x) shows the worst-case loss of\none logarithm between normalized logarithmic and natural averages.\nIt does not rule out a better conversion for an arithmetic family with\nadditional structure. Continuous scale integrals do not automatically\nbound a prescribed discrete dyadic sequence.\n\n## 4. Source interfaces and a corrected open route\n\n[Tao v4](https://arxiv.org/pdf/1509.05422v4) uses bounded multiplicative\nfunctions with fixed affine parameters; its Proposition 2.2 convolution\nreduction and Lemma 2.5 have their stated cutoffs. Substituting a growing\nprime cofactor into a fixed-parameter theorem is unjustified.\n[Helfgott–Radziwill v2](https://arxiv.org/pdf/2103.06853v2) and\n[Pilatte v3](https://arxiv.org/pdf/2310.19357v3) give quantitative\nLiouville results; their statements are not automatically weighted\nMöbius theorems. The earlier four-source search was not exhaustive.\n\nPilatte's Lemma 2.3(d), with the specific choice log x=(log H)^6 in §2.3,\ngives an optimistic exponent c0/12, with\nc0=t^2 log(1/(2t)). Its unrestricted maximum is 1/(96e). The exponential\nO(J) factor is an additional bound cost. This calculation neither\nspecifies the theorem's c nor bounds every possible variant of the\nmethod; changing the x,H relation changes the denominator.\n\n**Nonmultiplicativity of mu L_b does not close the route.**\n[prime-band-transfer.md](prime-band-transfer.md) represents it exactly\nby an integrable Fourier superposition of bounded multiplicative\nfunctions mu(n) exp(it L_b(n)/log X). Their non-pretentiousness survives\nuniformly because changing prime values in a fixed exponent band changes\nthe squared distance by O(1). The non-pretentious case of\n[Tao–Teravainen v2, Theorem 3.1](https://arxiv.org/html/2512.01739v2)\nthen supplies a continuous scale-average saving. Tonelli handles the\nparameter integral, and an explicitly priced mesh handles moving\ncofactor windows. The achieved normalization remains too weak for o(x),\nand the other full-corner branches remain unestimated.\n\nNo universal absence of a suitable theorem is claimed. Revisit a source\nonly for a changed coefficient class, rate, scale quantifier or proof\nstep. A generic repeat of the older direct substitutions adds nothing.\n\n## 5. Validation scope\n\n[corner-log-average-validation.js](corner-log-average-validation.js)\nretains the original finite proxy measurements and their bound output.\nIts T1–T3 divisibility checks and T5 worst-case witness remain useful.\nT4's old edge predictor is a diagnostic, not the corrected natural-average\nconstant or an asymptotic test. T6 checks arithmetic for one parameter\nchoice only. The script's finite proxies are not the fixed-eta asymptotic\nregime. [agent-readiness-validation.js](agent-readiness-validation.js)\nadds active controls for the support and representation corrections.\nNeither producer proves an analytic rate or a twin lower bound.\n"},"research/fixed-endpoint-discrepancy.md":{"lf_sha256":"21dce4f3b3bc36d3fd662a616cc2b6a149ddf67ff79bc71a85f4f7b3c82e46c0","content":"# Fixed-endpoint discrepancy: the split at x^(1/2-eps'), the below-level Type I piece, and the remainder that is left\n\n\n\n**Twin-prime infinitude, D^(e_1)>=-4x/25+o(x) and every sufficient signed\nmargin remain OPEN. This note estimates one piece (the below-level Type I\npiece, corrected and independently reviewed on 2026-09-09)\nand exhibits the rest with exact sums,\ntrivial sizes and the first unmatched hypothesis per source.** It is lane A's\nsecond checkpoint of 2026-09-08, dispatched from e90d49b after the truncation\nT^top=O_(A,eps)(x/log^A x) of\n[centered-discrepancy-estimate.md](centered-discrepancy-estimate.md) section 3a\nwas accepted ([research-round-validation.md](research-round-validation.md)\nsection 7).\n\n Lane / stable question id: A (second checkpoint) / Q-fixed-endpoint-discrepancy\n Starting commit / report commit or shared-checkout paths: e90d49b, shared checkout; research/fixed-endpoint-discrepancy.md, research/fixed-endpoint-discrepancy-validation.js\n Disposition / exact claim / unproved hypotheses: exact three-piece reduction from accepted inputs; T_I^low=O_(A,eps')(x/log^A x), corrected and accepted after the independent 2026-09-09 reading (g truncated at (log x)^L, both tails paid); B (Type II below level plus the band) unestimated: the recorded parity object\n Changed step compared with the reviewed baseline: the fixed-endpoint object is split at e_0=floor(x^(1/2-eps')) and the cofactor Mobius is decomposed by Vaughan's identity; the density projection of both parts is evaluated; the consumer is restated as S=C_2x+B+o(x); after V4, the coprimality expansion in the Type I piece is truncated at g<=(log x)^L so that every BV modulus is at most x^(1/2-eps'/3)(log x)^L, and the two g-tails are bounded in section 4.1\n Source theorem and first unmatched hypothesis, if any: none imported beyond (BV*), (3a.9), PNT; for the band, every source in section 3 fails at absolute values over all moduli near x^(1/2+eps') in one fixed class, or at the signed weight\n Validation command, falsifier, result and compute used: node research/fixed-endpoint-discrepancy-validation.js (0.5 s, one core); exact identities at x=2^10..2^16 pass, deletion controls fire, density and multiplicity formulas checked finitely; no asymptotic step is tested\n Independent reviewer / disposition: the 2026-09-09 integration review reconstructs the repaired tails, density, multiplicity and uniform-mean application; accepts (4.1) with the bookkeeping corrections below. The original q<=e_0UV claim remains refuted by the retained witness. See research-round-validation.md section 12 (consumer in 12a).\n Full-consumer payoff and unpaid complement: none; the unpaid complement is B, of elementary size O(x log^5 x), required >= -(C_2-1/200)x+o(x)\n Proposed shared-record changes / next bounded obligation: section 7; section 8\n\n## 1. Question, disposition and what remains open\n\nQuestion: split D^(e_1) at a level e_0=x^(1/2-eps'), say what estimate the\nbelow-level part needs for f(n)=Lambda(n-2)mu(n) in the progressions\nn=0 (mod e) on the fixed interval, name the piece an existing theorem\nestimates, define the band count with its density and clipped endpoints,\nand give one bounded attempt.\n\nDisposition. The split, the density projections and the Vaughan\nthree-piece decomposition are exact and finitely checked. The below-level\nType I piece is estimated in section 4.1 by the accepted inputs of the\ntruncation proof; second reader V4 found its first version's modulus\nbound false, the correction (truncation of the coprimality divisor with\nboth tails paid) was applied on 2026-09-08, and the corrected derivation\nwas independently reviewed and accepted on 2026-09-09 with the bookkeeping corrections below. Everything else is exhibited: the below-level Type II piece and\nthe band together form one sum B with S(x)=C_2x+B(x)+O_A(x/log^A x). B\nis a shifted-prime bilinear remainder carrying one Mobius factor on a\nlong variable, the same family as B(x) of\n[prime-detection-spec.md](prime-detection-spec.md) (13) and the residual\nof [shifted-prime-decomposition.md](shifted-prime-decomposition.md), with\ndifferent coefficients and ranges. No theorem with matched hypotheses\nestimates any part of it; the stop rule of the assignment applies and the\npass stops at the exact sum.\n\nOpen: D^(e_1)>=-4x/25+o(x), equivalently\nB+2C_2M>=-4x/25+o(x). Using M<=A_2 x/2 and\nC_2(1-A_2)>33/200, this implies B>=-(C_2-1/200)x+o(x).\nThe converse does not follow: a lower value of M can violate the D\nmargin while that B bound holds. Both are sufficient for infinitude on\nunbounded dyadic scales; the general fixed-c_0 consumer (H_B) is also\nOPEN. The regression is a logical counterexample to the claimed\nequivalence, not an arithmetic counterexample to either target.\n\n## 2. Exact statement\n\nNotation of the handoff and of centered-discrepancy-estimate section 1:\nx=2^j, J=(x/2,x], Lambda standard (prime powers included), f(n)=Lambda(n-2)mu(n),\nM=sum_{n in J} f(n), F_1:=sum_{n in J} f(n) log n, C_2 the twin constant,\nfixed 0=(1/2-eps'-o(1))log x, |M|=O(x) and\n|F_1|=O(x log x),\n\n\\[\n Q_{\\rm low}=-2C_2M+O_A(x\\log^{1-A}x),\\qquad Q_{\\rm band}=O_A(x\\log^{1-A}x). \\tag{2.2}\n\\]\n\nHence, exactly up to these accepted errors,\n\n\\[\n \\mathcal D^{(e_1)}=2C_2M+P_{\\rm low}+P_{\\rm band}+O_A(x\\log^{1-A}x). \\tag{2.3}\n\\]\n\n### 2.3 The band count, its density and the clipped endpoints\n\nTwo exact arrangements of P_band, both used in section 4.3.\n\n*Modulus e, cofactor m.* For odd squarefree e in [e_0,e_1) define\n\n\\[\n N(e):=\\sum_{\\substack{n\\in J\\\\ n\\equiv0\\ (e)}}f(n)\\log\\frac ne\n =\\mu(e)\\sum_{\\substack{m\\in I_e\\\\ (m,e)=1}}\\mu(m)\\log m\\,\\Lambda(em-2),\\qquad\n \\kappa(e):=\\frac{F_1-M\\log e}{\\varphi(e)},\n\\]\n\nso that D_band=-sum_{e_0<=e=x+1 and e_0m<=x/2+1. Otherwise use the displayed\nmax/min endpoints, with any empty interval contributing zero. Expanding mu^2(n/m)=sum_{b^2|n/m}mu(b) with b odd and\n1_((n/m,m)=1)=sum_{g|(n/m,m)}mu(g) as in section 3a.1, the inner sum is\nsum_{b,g}mu(b)mu(g) sum_{n in I_m, n=0 (m[b^2,g])}Lambda_0(n-2) plus the\nsingle power-of-two atom, with moduli q=m[b^2,g] up to\n2x^(1/2+eps')(log x)^(3L) after the truncation b,g<=(log x)^L of 3a.3. Its\nmain term is |I_m| sum_{b,g}mu(b)mu(g)/phi(m[b^2,g]), the density of 3a.2;\nthis is the \"kappa\" of the modulus arrangement, and |I_m| is monotone on\neach of the three m-ranges.\n\nTrivial size of the band. Counting multiples in (2.1) and using\nLambda<=log x gives O_(eps,eps')(x log^3 x). Brun–Titchmarsh\nimproves this to O_(eps,eps')(x log^2 x) for fixed eps<1/50, since\ne=1 ([mobius-bv-derivation.md](mobius-bv-derivation.md),\nchecked exactly to 10^5 there and to 4096 here):\n\n\\[\n \\mu=\\mu_{>U}*\\mu_{>V}*1-\\mu_{\\le U}*\\mu_{\\le V}*1+\\mu_{\\le U}+\\mu_{\\le V}.\n\\]\n\nFor ex/(2e_0)>=x^(1/2+eps')/2>max(U,V), so the two\nlinear terms vanish. Put c(r):=sum_{dk=r, d<=U, k<=V}mu(d)mu(k), |c(r)|<=tau(r),\nsupported on r<=UV, and gamma_V(b):=sum_{k|b, k>V}mu(k), |gamma_V(b)|<=tau(b).\nThen exactly\n\n\\[\n P_{\\rm low}=T_I^{\\rm low}+T_{II}^{\\rm low}, \\tag{2.5}\n\\]\n\\[\n T_I^{\\rm low}=\\sum_{\\substack{eU,\\ b>V,\\ ab\\in I_e\\\\ (ab,e)=1}}\\mu(a)\\gamma_V(b)\\log(ab)\\,\\Lambda(eab-2). \\tag{2.7}\n\\]\n\nRanges in (2.7): a in (U, x/(eV)], b in (V, x/(eU)]; so a runs from\nx^(eps'/3) up to x^(1-eps'/3) as e and b vary. Heath-Brown's identity for\nmu (the 1/zeta analogue of his identity for Lambda, K pieces\nmu_{<=Z}^{*j}*1^{*(j-1)}) yields the same two classes with a movable\nboundary; the balanced region, both factors of the cofactor near a\nfixed power, is present under every such identity, as\n[heath-brown-edges.md](heath-brown-edges.md) records for Lambda. It is not\nused further here.\n\n**What the below-level part needs.** In the flipped form, the twisted\nsequence f(n) in the progression n=0 (mod e) on the fixed interval J is\nthe cofactor sum sum_{m in I_e,(m,e)=1}mu(m)log m Lambda(em-2). After (V),\nthe Type I part asks for primes n-2 in the reduced class -2 modulo\ne[r,g]<=e_0UVG=x^(1/2-eps'/3)(log x)^L, after truncating the coprimality\ndivisor at g<=G (section 4.1), with the signs carried by c(r) and evaluated\nthrough Mobius means (section 4.1); the Type II part asks for the\nbilinear sum (2.7). No theorem for f itself in progressions is used.\n\n### 2.5 The reduction and the consumer\n\nCombining (12), (3a.1), (2.3) and (2.5),\n\n\\[\n S(x)=C_2x+T_I^{\\rm low}(x)+\\mathcal B(x)+O_A(x\\log^{1-A}x),\\qquad\n \\mathcal B:=T_{II}^{\\rm low}+P_{\\rm band}, \\tag{2.8}\n\\]\n\nwith the accepted inputs only. Written on n=eab with b=1 in the band,\n\n\\[\n \\mathcal B(x)=-\\sum_{n\\in J}\\Lambda(n-2)\\,W(n),\\qquad\n W(n)=\\sum_{\\substack{eab=n,\\ e\\ \\mathrm{odd},\\ \\mu^2(e)=1\\\\ (ab,e)=1}}\\mu(a)\\log(ab)\n \\Bigl[\\mathbf 1_{eU}\\gamma_V(b)+\\mathbf 1_{e_0\\le e=-4x/25+o(x) is B+2C_2M>=-4x/25+o(x);\n- the direct twin consumer S>=x/200+o(x) is B>=-(C_2-1/200)x+o(x);\n- the first implies the second through 2C_2M<=C_2A_2x+o(x), which is how\n the fixed fraction 4/25 was obtained in moving-cutoff-parity (14)-(16).\n\n**Named hypothesis (H_B), all quantifiers.** With eps, eps', U, V, e_0, e_1\nas fixed above and B as in (2.9): there exist c_0>0 and an unbounded set\nof j such that B(2^j)>=-(C_2-c_0)2^j+o(2^j). This is a conditional\nsufficient statement, not a theorem; under section 4.1 it is equivalent to\nS(x)>=c_0x+o(x) on those scales. The weaker margins of handoff section 3\n(c_0x/log^K x) transfer verbatim.\n\nFor a safe elementary size comparison, (2.9) gives\n|T_II^low|<=log x sum_(n in J) Lambda(n-2)tau_4(n)\n<U; here mu(n)\nis decomposed through its cofactor and Lambda(n-2) is untouched. The two\nremainders B(x) and B differ in coefficients and ranges, not in kind.\n\nLocal records read before this pass: OUTCOMES and QUESTIONS entries for\nQ-centered-discrepancy-estimate, Q-moving-cutoff-parity, Q-consumer-comparison,\nQ-mobius-bv-derivation, Q-shifted-prime-decomposition, Q-prime-detection-inputs,\nQ-heath-brown-edges, Q-shifted-prime-mobius-sums; SEARCH-CONVENTIONS rows\nfor the band of D_y and for the twisted sequence. No new literature search\nwas run; the source matrix of centered-discrepancy-estimate section 4 was\nmatched against the actual band objects of section 2.3 and 4.3 here.\n\n| Source, locator (as read in the existing matrix) | Statement it makes | Band object it is matched against | First unmatched hypothesis |\n|---|---|---|---|\n| Tao, Notes 3, Theorem 17, prefix form (BV*) | absolute values over all q<=x^(1/2)log^-B x, reduced classes, ineffective | modulus arrangement (2.4), moduli m[b^2,g] | level: the band moduli reach 2x^(1/2+eps')(log x)^(3L); below x^(1/2-eps'/3) it is used in section 4.1 |\n| [Maynard I, arXiv:2006.06572v2](https://arxiv.org/abs/2006.06572) Theorem 1.1 | absolute values over q_1q_2 with Q_1Q_2^2x fails; with Q_1 the band factor, Q_1^12>x^6>x^4 fails; Cor. 1.2 admits a divisor in (x^(2eps'+eta), min(x^(1/10-7eps'/5-eta),x^(1/2-19eps'-eta))); both its lower and upper range constraints are required. A lower bound on the smaller factor alone does not establish coverage; outside that sufficient range this corollary supplies no bound |\n| Maynard I, Corollary 1.3 | all but 18·delta·Q·phi(a)/a moduli in [Q,2Q], Q=x^(1/2+delta), absolute values | modulus arrangement, all m in a dyadic block | the exceptional moduli carry, with the log weight, trivial mass of order 18·delta·x per block; summed over the blocks delta in (0,eps'] this is of order eps'^2 x log x, above O(x); the signed weight mu(m) on the exceptional set is the obstruction, as recorded |\n| BFI II Theorems 3, 5* (restated in Maynard I Lemmas 8.4-8.5; primaries unread) | absolute values over q~Q in (x^(1/2)log^-A x, x^(2/3-e)) for triple convolutions of the prime variable with range constraints | (2.9) read as the sequence n=p+2 with a triple-convolution weight e·a·b | the sequence here is Lambda(n-2) itself in the progression, not a convolution; the convolution sits on the modulus side, and the bad shapes of Maynard I section 3.2 are uncovered in any case |\n| BFI II + III Theorem A (as in Maynard I section 1.1; primaries unreached) | no absolute values, Q=x^(1/2+delta), fixed a: sum_{q~Q}(pi(x;q,a)-pi(x)/phi(q))=O(delta^2 x/log x+x(log log x)^O(1)/log^3 x) | modulus arrangement after Vaughan on mu(m): Type I pieces with modulus r·s·b^2g, s unweighted in a block, fixed class -2 | shape matches only for s unweighted and for all q in [Q,2Q], not for multiples of r·b^2g; and a delta^2 saving per block leaves, after the log weight and the (eps+eps')log x/log 2 blocks, order eps'^3 x log x·(log UV)^2 from sum_r tau(r)/r, above O(x); the signed c(r), mu(b), mu(g) are then summed in absolute value |\n| BFI I Theorem 10, Maynard II Theorem 1.1 | well-factorable (triply well-factorable) lambda_q, fixed a, level x^(4/7-e) (x^(3/5-e)) | modulus arrangement: lambda_q=mu(m)log m·1_{m in range} or its Vaughan pieces 1_{r|m}log m | not well-factorable (recorded); the Type I piece 1_{r|m}·1_{m~Q} is a convolution of an indicator with an indicator of a long range, which is not a factorization into 1-bounded pieces of every prescribed pair of supports |\n| [Polymath, arXiv:1402.0811v3](https://arxiv.org/abs/1402.0811) Theorem 1.1 | x^delta-smooth squarefree moduli, level 1/2+7/300 | modulus arrangement | the band moduli m are arbitrary squarefree; the smooth sub-family carries no sign advantage |\n| [Drappeau, arXiv:1504.05549v4](https://arxiv.org/abs/1504.05549), Titchmarsh sum | unweighted modulus average near x^(1/2) with log-power error | Type I pieces on the modulus | window of log-power width around x^(1/2) only; the band has power width |\n| Murty–Vatwani Theorem 1.1, EH_{mu_2}(x^(1/2+eps)) | hypothesis, all classes, all prefixes | D^(e_1) directly | it is a hypothesis; (H_B) is one-sided and one-class, weaker, and unproved |\n\nUNREAD in this pass: BFI I, BFI III, Fouvry 1985 primaries (unreached on\n2026-09-08 per the existing matrix); no new fetch was attempted, since no\nrow's shape matched before its first hypothesis.\n\n## 4. Proof of the Type I estimate and the decisive exhibited remainder\n\n### 4.1 Proposition (corrected and reviewed 2026-09-09)\n\nV4 found that the first version bounded the modulus q=e[r,g] by e_0UV,\nwhich is false for g>1: g runs over every divisor of e and [r,g]>=g, so\nq reaches e^2 at g=e, r=1 (at x=2^16, e_0=212, U=V=3: e=g=209, r=1 gives\nq=43681>1908; validator section 7). The handler's first reading did not\ncatch this. The repair below truncates g at G:=(log x)^L, exactly as 3a.3\ntruncates b and g, and pays both tails. The 2026-09-09 independent reading\naccepts the repair after correcting the log powers and atom bound below.\n\nFor every fixed A>0 and 0=x_0(A,eps'),\n\n\\[\n T_I^{\\rm low}(x)=O_{A,\\epsilon'}\\bigl(x\\log^{-A}x\\bigr). \\tag{4.1}\n\\]\n\nConstants are ineffective (Siegel through (BV*) and (3a.9)).\n\n*Step 1: powers of two and coprimality.* Let Lambda_0 be Lambda with\nLambda_0(2^a)=0. Terms of (2.6) with em-2 a power of two have em=x/2+2=:n_0\n(one value, as in 3a.1). Their total is at most\nlog 2·log x·sum_{e|n_0}sum_{r|n_0/e}|c(r)|tau(e)<=2 log 2·log x·tau(n_0)^3(UV)^(1/2)<<_delta x^(3delta+eps'/3)log x,\nusing |c(r)|<=tau(r)<=2 r^(1/2) and tau(n)<<_delta n^delta; with delta=1/100\nthis is O(x^(1/4)). In the remaining terms em is odd, so e, m, r are odd.\nExpand 1_((m,e)=1)=sum_{g|(m,e)}mu(g); with r|m and g|m the condition is\n[r,g]|m, and [r,g]=rg/(r,g) (validator section 7). Fix L>0, put\nG:=(log x)^L and split the g-sum into the body g<=G and the tail g>G:\n\n\\[\n T_I^{\\rm low}=T_I^{\\rm body}+T_I^{\\rm tail}+E_2,\\qquad\n T_I^{\\rm body}=\\sum_{\\substack{eG. In the body the modulus q:=e[r,g] is odd\n(so the class -2 is reduced) and satisfies, since [r,g]<=rg,\n\n\\[\n q\\le e_0\\,UV\\,G\\le x^{1/2-\\epsilon'/3}(\\log x)^L=:Q_0'. \\tag{4.2'}\n\\]\n\n*Step 1a: the tail on the progression side.* Each term of T_I^tail is at\nmost log x·log x·(number of m in I_e with [r,g]|m)<=log^2x·(x/(2e[r,g])+1),\nand x/(e[r,g])=x(r,g)/(erg). Writing (r,g)=sum_{d|(r,g)}phi(d),\n\n\\[\n \\sum_{r\\le UV}\\frac{\\tau(r)(r,g)}{r}=\\sum_{d\\mid g}\\varphi(d)\\sum_{\\substack{r\\le UV\\\\ d\\mid r}}\\frac{\\tau(r)}{r}\n \\le\\sum_{d\\mid g}\\tau(d)\\sum_{r'\\le UV}\\frac{\\tau(r')}{r'}\\ll\\tau(g)^2\\log^2x,\n\\]\n\nusing tau(dr')<=tau(d)tau(r') and sum_{d|g}tau(d)=tau_3(g)<=tau(g)^2. Then\nsum_{g|e, g>G}tau(g)^2/g<=tau(e)^3/G (tau(g)<=tau(e), tau(e) divisors) and\nsum_{eG}}\\sum_{r\\le UV}\\tau(r)\\Bigl(\\frac{x(r,g)}{2erg}+1\\Bigr)\n \\ll\\frac{x\\log^{12}x}{G}+x^{1/2-\\epsilon'/3}\\log^4x, \\tag{4.2''}\n\\]\n\nFor the weighted count, sum_{r<=UV}|c(r)|<=sum_{r<=UV}tau(r)\n<G}mu(g)/phi(e[r,g]).\nSince phi([r,g])=phi(rg)/(r,g)>=phi(r)phi(g)/(r,g) and phi(e[r,g])>=phi(e)phi([r,g]),\nthe tail density contributes at most, with sum_{n in J}log(n/e)<=(x/2)log x,\n\n\\[\n E_g^{\\rm main}\\le\\frac x2\\log x\\sum_{eG}}\\frac1{\\varphi(g)}\\sum_{r\\le UV}\\frac{\\tau(r)(r,g)}{\\varphi(r)}\n \\ll x\\log^3x\\,(\\log\\log x)^2\\,\\frac1G\\sum_{e=x_0(A_1,eps',L) because\nx^(-eps'/3) dominates every logarithmic power),\n\n\\[\n E_{BV}:=3\\log x\\sum_{q\\le Q_0'}c'(q)D(q)\\le3\\log x\\Bigl(\\sum_{q\\le Q_0'}\\tau(q)^8D(q)\\Bigr)^{1/2}\\Bigl(\\sum_{q\\le Q_0'}D(q)\\Bigr)^{1/2}\n \\ll x\\log^{1+(257-A_1)/2}x. \\tag{4.7}\n\\]\n\n*Step 6: the remaining terms of (4.3).* Using phi(e[r,g])>=phi(e)phi(r),\nsum_{eU}*gamma_V on m) produces the\nshapes in the Maynard and BFI rows of the matrix with the unmatched\nhypotheses recorded there; the accumulated log weight and the\n(eps+eps')log x/log 2 dyadic blocks defeat a constant-factor saving per\nblock, by the count in section 2.3.\n\nIn the cofactor arrangement, the band is the balanced part of B:\nboth e and m within a factor x^(eps+eps') of the square root, one Mobius\nsign on m, a squarefree filter on e. It is the same family as 4.2.\n\n### 4.4 Why the pass stops\n\nEvery piece of D^(e_1) other than T_I^low and the density projections is\nan instance of one family: Lambda(n-2) at shift 2 against a product of a\nMobius factor on a long variable and a divisor-bounded cofactor. That\nfamily is the recorded unfilled input (prime-detection-spec (14),\nshifted-prime-decomposition, consumer-comparison sections 1 and 5). A\nshift average would not select shift 2; a Type I estimate is not the\nconsumer; the stronger absolute-value statement\n(4.9) would pay the band piece P_band, but no inspected source states it, and it does not touch\nthe below-level Type II piece T_II^low of (2.7): with (4.9) the D-margin still requires\n2C_2M+T_II^low>=-4x/25+o(x). A bound for the actual signed weights of B could suffice without (4.9);\n(4.9) cannot replace a signed bound for T_II^low. The exact sum is (2.9) and the required\nrate is (H_B). The pass stops here, as the assignment's stop rule\ndirects.\n\n## 5. Validation, falsifier and outcome\n\n[fixed-endpoint-discrepancy-validation.js](fixed-endpoint-discrepancy-validation.js)\n(0.5 s, one core, output embedded) checks at x=2^10, 2^12, 2^14, 2^16 with\neps=eps'=1/60: the split D^(e_1)=D_low+D_band and D_R=P_R-Q_R with P_R in\nthe flipped form (2.1) against the definition; Q_band against the two odd\nMobius means; the dual divisor identity on odd n,\nP^(e_1)_odd=sum Lambda(n-2)Lambda(n)mu^2(n)+sum Lambda(n-2)mu^2(n)sum_{e'|n, e'<=n/e_1}mu(e')log e',\nwith the even atom bounded; Vaughan's identity (V) at every m<=4096 for\n(U,V)=(3,3),(2,5),(4,6) and the three-piece split (2.5) at each pair; two\ndeletion controls (dropping the coprimality filter, dropping the odd\nrestriction) that change P_low at three or more scales; the density\n(4.4) on 4128 pairs; the multiplicity bound c'(q)<=tau(q)^4 for q<=3000;\nafter V4, the identity [r,g](r,g)=rg for r,g<=200 and the modulus\nwitness at x=2^16: e=g=209, r=1 gives q=43681 above e_0UV=1908, triples\nabove e_0UV are counted, and with g<=G=8 no body modulus exceeds e_0UVG.\nAll pass. These are finite checks of exact algebra; they test no\nasymptotic step, and the derivation of section 4.1 carries (4.1) alone.\n\nFalsifier for (4.1): a defect in (4.4), in the tail bounds (4.2'') and\n(4.4'), in c'(q)<=tau(q)^4, or in the application of (3a.9) at (k,e). The\nfirst version's modulus bound was such a defect, found by V4 and\nwitnessed finitely. Falsifier for (2.8)-(2.9): a finite x at\nwhich the validator's split, dual or three-piece check fails; the four\nscales 2^10..2^16 all pass.\nNo finite computation bears on (H_B), and no census was run (zero\nenumeration, per the contract). The finite ratios printed at x=2^16 are\nnot readings of any asymptotic quantity.\n\n## 6. Payoff for the full twin consumer\n\nNone. The identity (2.8) restates the consumer in the classical Type I/II\nshape; the Type I piece is paid at the reviewed scope and the remainder B is the\nparity object. The regional statement obtained is: the below-level Type I\npiece of the cofactor Mobius is O_(A,eps')(x/log^A x). The conditional\nstatement is: (H_B) implies S(x)>=c_0x+o(x) on unbounded dyadic scales, hence\ntwin-prime infinitude, using the reviewed (4.1). Nothing here narrows the\nunpaid complement: B has elementary size O(x log^5 x) against a required lower\nbound of size -(C_2-c_0)x.\n\n## 7. Validation and integration\n\nThe lane validator remains the finite identity and original modulus-defect\ncheck. The independent 2026-09-09 controls in\n[research-round-validation.js](research-round-validation.js) add exact\nrational checks of (4.4) including nonsquarefree r and of the consumer\nimplication. The proof above, not the finite values of T_I^low, establishes\n(4.1). [research-round-validation.md section 12](research-round-validation.md)\nowns this review; OUTCOMES and the handoff carry its current disposition.\n\n## 8. Next move or reopening condition\n\nThe decompositions inspected here leave the exact B in (2.9) unestimated.\nA useful continuation must supply a bound with its actual coefficients,\nshift 2, growing ranges and a rate that pays (H_B), or a changed\nrepresentation with a quantified saving and its complement paid. Examples\nof stronger sufficient inputs for the band piece are (4.9) or a treatment of the exceptional\nmoduli in the cited Maynard range that admits the Mobius weight; each leaves T_II^low, so\nneither closes the D-margin alone. These\nare not necessary conditions and do not exclude a new decomposition.\nA correctness concern in an accepted step is also a reason to reopen it.\n\nRevision history: research/history/CHANGELOG.md.\n"},"research/fold-arithmetic-bridge.md":{"lf_sha256":"d248928b9cddf5802e64a38f03c77e015a2e6cce7c1eb977820d4213d4514149","content":"# Fold ledger and the parity table: exact identities, checked sieve inputs, all-depth failure of both ratio tests\n\n\n\n**Twin-prime infinitude remains OPEN.** This is the reviewed scope of\nlane E after the second dispatch of 2026-09-08. The integration review\n[research-round-validation.md](research-round-validation.md), section 4,\nidentified the corrections to the first return; section 3a below performs\nthe source check it asked for and section 4a the all-depth analysis. The\noriginal pre-registration, its post-run correction and submitted report\nare preserved in a5e1244. No new novelty claim is made.\n\n## 1. Question and disposition\n\nThe chosen bridge is the odd/even Omega table on pairs surviving a sieve\nto y=X^(1/u). It provides an exact identity and two conditional ratio\ntests. In the first return the tests failed on a sampled grid whose\ninput bounds included one unread theorem and one cofactor-uniformity\nclaim, and the finite grid gave no all-depth statement.\n\nThe second dispatch selected the unread input, Bombieri--Vinogradov for\nproducts of k primes with every factor above X^(1/u), read the primary\nstatement it reduces to (Pan--Ding through Wu's Lemma 2.3, arXiv page\nimage and text layer, hash matched to the repository's custody record),\nand derived the needed distribution statement from it with every error\npaid (Proposition 3). The same statement, fed to the Rosser--Iwaniec upper\nbound in the composite variable, gives the pair contamination constant\n4 after summing the factor tuples (Proposition 4). The displayed constants c_eff\nbetween 12.86 and 19.72 came from sieving in the prime variable and are\nnot what the available level gives; the corrected c_eff is 4 at every\ndepth. With the inputs settled, elementary bounds on the sieve functions\nand on rho_odd give Q_cov(u)<1 and c*_real(u)<4 for every u>4\n(Proposition 5), so both tests fail at every depth, not only on a grid.\n\nDisposition: the two sufficient ratio tests of this note are closed at\nevery depth u>4 under their stated union-bound shape, with all inputs\nnow proven or derived here except the reading of Wu's Lemma 2.3 as\nuniform over bounded coefficients (section 3a.1). This does not show\nthat (Cov_u) or (Dec_1) cannot imply twins by another consumer, that a\nsecond Liouville hypothesis is necessary, or that exact folds are\nparity-blind. No bound for a handoff consumer follows. Propositions 3 to\n5 were independently reviewed on 2026-09-09. Proposition 4 is an\naggregate estimate, not a bound uniform for each factor tuple;\nProposition 5 now has directed rational bounds for all five pieces.\n\n## 2. Exact identities and conditional tests\n\nThroughout X -> infinity through powers of 2, I = (X, 2X] cap Z, u > 4\nfixed, y = X^(1/u), P(y) = product of primes p <= y. Omega counts prime\nfactors with multiplicity, lambda(n) = (-1)^Omega(n). Set\n\n S_X = { n in I : gcd(n(n+2), P(y)) = 1 }\n\nand on S_X\n\n S = #S_X, A = sum lambda(n), B = sum lambda(n+2), C = sum lambda(n) lambda(n+2),\n P_odd = #{ n in S_X : Omega(n) odd }, P'_odd = #{ n in S_X : Omega(n+2) odd },\n N_odd3 = #{ n in S_X : Omega(n), Omega(n+2) both odd, max >= 3 },\n T = #{ n in S_X : n, n+2 both prime } = #{ twin openers in I } for X > y.\n\nThe normalising constants: C_2 = prod_{p>2} (1 - 1/(p-1)^2); M = X/(log X)^2;\nomega is Buchstab's function; D_k(u) is the density constant of products\nof exactly k primes each exceeding X^(1/u), so that #{n ~ X : Omega(n) = k,\nP^-(n) > X^(1/u)} ~ D_k(u) X/log X, with D_1 = 1, D_2(u) = log(u-1) and\nD_k(u) = int_{k-1}^{u-1} D_{k-1}(v) dv/v; rho_odd(u) = sum_{k odd} D_k(u).\nf_1, F_1 are the Rosser-Iwaniec linear-sieve functions; F_2 is any valid\ndimension-2 upper-bound sieve function with F_2 >= 1, here Ankeny-Onishi\n1/sigma_2.\n\n**Proposition 1 (bridge identity, exact).** For every X and u with S>0,\n\n T = P_odd P'_odd / S + (S/4) cov - N_odd3, cov := C/S - (A/S)(B/S),\n\nThe denominator-free identity, valid also at S=0, is 4 T S = 4 P_odd P'_odd + (C S - A B) - 4 N_odd3 S. Also\nS - A - B + C = 4 (T + N_odd3).\n\n*Proof.* (1 - lambda(m))/2 is the indicator of Omega(m) odd. Summing\n(1 - lambda(n))(1 - lambda(n+2))/4 over S_X counts pairs with both\nOmega odd, which is T + N_odd3, and expands to (S - A - B + C)/4. Write\na = A/S, b = B/S. Then (S - A - B + C)/4 = (S/4)((1-a)(1-b) + cov) and\nS(1-a)/2 = P_odd, S(1-b)/2 = P'_odd. The review's four-sign identity\n4T = S - A - B + C is the case N_odd3 = 0, which is guaranteed when y >= (2X+2)^(1/3). With y=X^(1/u),\nfixed u<3 suffices eventually, but u=3 does not guarantee it. QED.\n\n**Proposition 2 (parity content of the anchored fold ledger).** Let X>=4 and\ny_0 = (2X+2)^(1/3) and let p be a prime with y_0 < p <= (2X+2)^(1/2).\nIf the fold at p kills a pair (n, n+2) of I on the n side, meaning p | n\nand n(n+2)/p has no prime factor below p, then n = p m with m prime, so\nOmega(n) = 2 and lambda(n) = +1 exactly; the partner satisfies\nOmega(n+2) in {1, 2}, and lambda(n+2) = -1 if and only if n+2 is prime.\nSymmetrically on the n+2 side.\n\n*Proof.* m = n/p < 2X/p < (2X)^(2/3) < p^2 and m has no prime factor\nbelow p, so m = 1 or m is prime; m > X/p >= 1 excludes m = 1. The partner\nis p-rough and below 2X+2 < p^3, so it has at most two prime factors. QED.\n\nConsequently each such kill determines the parity of its killed member.\nThe partner's primality remains arithmetic information to be estimated.\nThis pointwise statement does not prove that the aggregate (S,A,B,C)\nretains every correlation of the fold ledger. At the cube-root depth,\nthe both-odd count equals T, so estimating that statistic already contains\nthe twin-count problem.\n\n**Two candidate single hypotheses**, each on an unbounded set of dyadic X\nat a fixed u > 4:\n\n- (Cov_u) cov >= 0, i.e. C S >= A B.\n- (Dec_1) sum_{n in S_X, n prime} lambda(n+2) = (B/S) #{n in S_X : n prime} + o(X/(log X)^2):\n the parity of n+2 is asymptotically independent of the primality of n\n on the sifted pair set.\n\n**Input bounds of the pricing, with their status after section 3a.** With Pi := #{p in I : gcd(p+2, P(y)) = 1},\n\n Pi >= f_1(u/2) 2 C_2 e^-gamma u M (1 + o(1)) [linear sieve + prime BV; needs u > 4; proven inputs]\n P_odd >= f_1(u/2) rho_odd(u) 2 C_2 e^-gamma u M (1 + o(1)) [same, summed over odd k <= u; BV for rough P_k is Proposition 3]\n S <= F_2(u) 2 C_2 e^-2gamma u^2 M (1 + o(1)) [dimension-2 upper sieve, level X^(1-eps); only F_2 >= 1 is used below]\n #{n in S_X : Omega(n) = k} <= F_1(u/2) D_k(u) 2 C_2 e^-gamma u M (1 + o(1)) [linear upper sieve; BV from Proposition 3]\n #{p in I : p+2 = q_1...q_k, q_1 > y} <= (4 + o(1)) 2 C_2 D_k(u) M [Proposition 4; replaces the earlier c_pair model]\n\nThe earlier model used c_pair(tau) = min(8/tau, 4 tau/(2 tau - 1)) for\ntau > 1/2 and 8/tau otherwise, tau = log q_k / log X, and integrated it\nagainst the Hardy--Littlewood density; it is retained in the validator's\nsection 3 for reproducibility and is superseded by the constant 4 (section\n3a.3). With c_pair replaced by 1 the same integral is the Hardy--Littlewood\nvalue 2 C_2 D_k(u) M.\n\n**The conditional ratio tests.** If the preceding bounds hold, the\nfollowing are sufficient tests for a positive asymptotic lower bound.\nFailure of a test proves no negative statement about T or about the\nhypothesis alone. Under (Cov_u), with the union bound\nN_odd3 <= sum_{k odd >= 3} (#{Omega(n) = k, n+2 rough} + #{Omega(n+2) = k, n rough}),\n\n T > 0 follows if Q_cov(u) := f_1(u/2)^2 rho_odd^2 / ( 2 e^-gamma u F_1(u/2) F_2(u) (rho_odd - 1) ) > 1.\n\nUnder (Dec_1), with T = #{n prime, Omega(n+2) odd} - #{n prime, Omega(n+2) odd >= 3},\n\n T > 0 follows if c*_real(u) := f_1(u/2)^2 rho_odd / ( F_2(u) (rho_odd - 1) ) > c_eff(u),\n\nwhere c_eff(u) is the contamination constant relative to the\nHardy--Littlewood value; after Proposition 4, c_eff(u) = 4 for every\nu > 4 (the earlier model's contamination-weighted mean of c_pair ran from\n12.86 to 19.72). c*_best(u) := rho_odd/(rho_odd - 1) is the same threshold\nwith every sieve loss at its floor.\n\n## 3. Prior work and source status\n\nThe two-sided indicator is elementary. The earlier four-sign identity is\nin history/staging/review-0905.md, the one-sided minorant in\n[chen-signed-target.md](chen-signed-target.md), and separate-estimate\nfailures in [chen-opportunity-audit.md](chen-opportunity-audit.md).\nThe per-fold kill count is a Buchstab sift of a dilated shifted sequence.\nExact folds retain arithmetic positions; no equivalence between all\ntheir statistics and Type I progression counts has been proved here.\nSieving the composite variable of a shifted-prime count, as in\nProposition 4, is Chen's switching principle; it is classical machinery\nand no novelty is claimed for it.\n\nThe source table. Entries marked UNREAD are not imports. The\ndescriptions of classical constants are not certified uniformly in\nthe growing cofactor merely by evaluating the numerical functions; the\nuniformity used here is stated in Propositions 3 and 4.\n\n| source | version, locator | statement used | hypotheses and how discharged | unmatched |\n|---|---|---|---|---|\n| Wu, Acta Arith. 114 (2004) 215-273 = [arXiv:0705.1652v1](https://arxiv.org/pdf/0705.1652v1) (11 May 2007), pp. 1-4 read as page images | p. 2 (1.2)-(1.4): Selberg 1949 D(N) <= 16 Theta(N), Bombieri-Davenport 8, Chen 7.8342; p. 3 (1.7) and the sentence that the twin constant is half; p. 4 Theorem 3: pi_2(x) <= 3.3996 Pi(x), Pi(x) = 2 C_2 x/log^2 x | history of the pair constant: 8 (Selberg), 4 (B-D), 3.3996 (Wu) in the normalisation where HL is 1; p. 2 states the linear sieve bounds are attained by B_nu = {n : Omega(n) = nu mod 2}, the parity example | Theorem 3 is for the sequence p+2 only | none needed |\n| Wu, same file, p. 6, Lemma 2.2 (Rosser--Iwaniec [17]), (2.4)-(2.6), read 2026-09-08 as page image and text layer; PDF SHA-256 41d432dd63da6d1fe7836ba3beda8b601ce6e64420e50501d26d79f7d971043e, equal to the custody record in [paired-factor-budget.md](paired-factor-budget.md) section 7 | upper bound (2.4): S(A;P,z) <= X V(z){F(log Q/log z) + E} + sum_{l 4 |\n| Wu, same file, p. 6, Lemma 2.3 (Pan--Ding [21] in the form of Pan--Pan [22, Corollary 8.12]), first and second estimates, read 2026-09-08 as page image and text layer | for f(m) << 1, alpha in (0,1], r_1(y) << x^alpha: sum_{q <= sqrt x/(log x)^B} mu(q)^2 3^nu(q) max_{y<=x} max_{(a,q)=1} \\|sum_{m <= x^(1-alpha), (m,q)=1} f(m) E_0(y;q,a,m)\\| << x/(log x)^A and the same with E_0(m r_1(y);q,a,m), where pi(y;q,a,m) = #{p : mp <= y, mp = a (q)} and E_0 = pi - li(y/m)/phi(q) | alpha = 1/u, x = 4X, r_1 = X^(1/u) <= x^alpha, f in {0,1} fixed once y in {X, 2X} is fixed; the implied constant is read as depending on A, alpha and the bound for f only (section 3a.1) | the third estimate's condition line reads \"m r_2(m) << x, m <= x^alpha\" while its sum runs over m <= x^(1-alpha); it is not used. Pan--Ding 1979 and Pan--Pan 1992 UNREAD; the uniformity reading rests on Wu's statement |\n| Halberstam-Richert, Sieve Methods (1974), Theorem 3.12 | UNREAD at the page; the repository reaches HR only through the Dover OCR index (`history/reviews-0907/08-halberstam-richert-thm22-access.md`) | classical Selberg form #{p <= x : ap + b prime} <= 8 prod_{p>2}(1-1/(p-1)^2) prod_{p\\|ab}(p-1)/(p-2) x/log^2 x (1+o(1)); this is the constant-8 branch of the earlier c_pair, not the constant-4 branch as the first return's table said | no longer used: Proposition 4 replaces both branches | uniformity in a, b never verified here |\n| Bombieri-Vinogradov for primes | [Tao, Notes 3, Theorem 17](https://terrytao.wordpress.com/2015/01/10/254a-notes-3-the-large-sieve-and-the-bombieri-vinogradov-theorem/), as in the corpus | level X^(1/2-eps) for the sequence {p+2} in the Pi bound | proven | none |\n| Bombieri-Vinogradov for products of k primes with all factors > X^(1/u) | DERIVED here as Proposition 3 from Wu's Lemma 2.3; Motohashi's induction principle (Proc. Japan Acad. 52, 1976) not needed and UNREAD | level sqrt x/(log x)^B for 1_{set_k} on (X,2X], every fixed k and u | all errors paid in section 3a.2 | the uniformity reading of Lemma 2.3 |\n| Ankeny-Onishi sigma_kappa (HR ch. 5) | not opened; the function is reproduced from its defining delay equation and checked at sigma_2(2) = e^-2gamma/2 and sigma_2 -> 1 | F_2 = 1/sigma_2 as a valid upper function | section 4a uses only F_2 >= 1, which holds for this F_2 and for any upper function bounded below by 1 | none needed for the all-depth bounds |\n| Rosser-Iwaniec linear sieve F_1, f_1 | Wu (2.6) for the definitions; closed forms on [1,3] and [2,4] and the recursion (sF)' = f(s-1), (sf)' = F(s-1); f_1 <= 1 <= F_1 for all s is the standard monotone convergence of both functions to 1 | marginal lower bound, P_k upper bounds, and the inequalities f_1 <= 1 <= F_1 in section 4a | f_1 is optimal for the linear sieve by the parity example (Wu p. 2) | none |\n| Murty, \"Twin primes and the parity problem\" (queensu.ca) | HTTP 404 on 2026-09-08 | possibly the same conditional in print | UNREAD; no import | novelty of Proposition 1 against it unknown |\n| Tao, parity-problem posts (2007, 2014) and Bombieri asymptotic sieve notes (2016) | already read in `review-0905.md` and [consumer-comparison.md](consumer-comparison.md) section 2 | the undetermined scalar delta_x; the parity example | the covariance here is a restriction of that scalar to the sifted set | not re-derived |\n\n## 3a. Source check of the sieve inputs (2026-09-08, second dispatch)\n\n Lane / stable question id: E / Q-fold-arithmetic-bridge\n Starting commit / report commit or shared-checkout paths: 07ab47f (working tree of the shared checkout); this note and fold-arithmetic-bridge-validation.js\n Disposition / exact claim / unproved hypotheses: the unread input is discharged (Proposition 3) and the contamination constant corrected to 4 (Proposition 4); both ratio tests fail for every u > 4 (Proposition 5). Unproved: (Cov_u), (Dec_1); the uniformity reading of Lemma 2.3 in 3a.1\n Changed step compared with the reviewed baseline: the c_pair(tau) model sieved the prime variable with the cofactor in the modulus; the composite variable at level X^(1/2) gives 4 for every tuple\n Source theorem and first unmatched hypothesis, if any: Wu, Lemma 2.3 first and second estimates (Pan--Ding); the dependence of its implied constant on the bound for f is not displayed in the statement\n Validation command, falsifier, result and compute used: node research/qc/embed.js research/fold-arithmetic-bridge-validation.js (1.2 s, one core); falsifier for Proposition 5: any grid point where the analytic bound falls below the model value, or any piece with bound >= 1 or >= 4; result: every piece is below both thresholds and every grid point is dominated\n Independent reviewer / disposition (PENDING until actually reviewed): handler; Propositions 3, 4 and 5 reconstructed 2026-09-08, verified within stated scope conditional on the uniformity reading of Lemma 2.3 (research-round-validation.md section 11)\n Full-consumer payoff and unpaid complement: none; the tests are sufficient conditions and both fail; the identity's other consumers are untouched\n Proposed shared-record changes / next bounded obligation: in the report; next obligation is a joint contamination bound with a named parity input, or nothing\n\n### 3a.1 The imported statement and how it is read\n\nNotation for this section: Y := X^(1/u) (the note's y, renamed because\nWu's y is a prefix variable), x := 4X, alpha := 1/u, and for k >= 0\n\n set_k := { n >= 1 : Omega(n) = k, P^-(n) > Y }, set_0 = {1},\n\nwith prime powers allowed. Write N_k(y; q, a) := #{n <= y : n = a (mod q),\nn in set_k} and N_k^(q)(y) := #{n <= y : (n, q) = 1, n in set_k}.\n\nWu's Lemma 2.3, first and second estimates, transcribed from the page:\nlet f(m) << 1 and alpha in (0, 1]; let r_1(y) be a positive function of x\nwith r_1(y) << x^alpha for y <= x. Then for every A > 0 there is\nB = B(A) > 0 such that\n\n\\[\n \\sum_{q\\le\\sqrt x/(\\log x)^B}\\mu(q)^2 3^{\\nu(q)}\n \\max_{y\\le x}\\max_{(a,q)=1}\n \\Bigl|\\sum_{\\substack{m\\le x^{1-\\alpha}\\\\(m,q)=1}} f(m)\\,E_0(y;q,a,m)\\Bigr|\n \\ll\\frac{x}{(\\log x)^A},\n \\qquad\n E_0(y;q,a,m)=\\pi(y;q,a,m)-\\frac{\\mathrm{li}(y/m)}{\\varphi(q)},\n \\tag{3a.1}\n\\]\n\nwith pi(y;q,a,m) = #{p prime : mp <= y, mp = a (mod q)}, and the same\nbound with E_0(m r_1(y); q, a, m) in place of E_0(y; q, a, m), i.e. with\nthe prime variable cut at p <= r_1(y).\n\nReading adopted. The statement writes f(m) << 1 and displays no\ndependence of the implied constant on f; it is read as: the implied\nconstant depends on A, alpha and the constant in f << 1 only, so the\nbound is uniform over all f with |f| <= 1, including f that depend on X.\nThis is the reading already used by [paired-factor-budget.md](paired-factor-budget.md)\nand it is the content of a mean value theorem for arbitrary bounded\ncoefficients. The Pan--Ding original and Pan--Pan Corollary 8.12 are\nUNREAD; if the constant were allowed to depend on f beyond its bound,\nPropositions 3 and 4 would need another source. The third estimate of\nthe lemma is not used.\n\n### 3a.2 Proposition 3: Bombieri--Vinogradov for k-fold Y-rough products\n\n**Proposition 3.** Fix k >= 1, u >= 2 and A > 0. With Y = X^(1/u) and\nx = 4X there is B = B(A, k, u) such that\n\n\\[\n \\sum_{q\\le\\sqrt x/(\\log x)^B}\\mu(q)^2 3^{\\nu(q)}\\max_{(a,q)=1}\n \\Bigl|N_k(y;q,a)-\\frac{N_k^{(q)}(y)}{\\varphi(q)}\\Bigr|\n \\ll_{A,k,u}\\frac{x}{(\\log x)^A}\n \\qquad(y\\in\\{X,2X\\}),\n \\tag{3a.2}\n\\]\n\nhence the same bound for the counts on (X, 2X] by subtraction.\n\n*Proof.* For every n >= 1,\n\n\\[\n \\sum_{\\substack{mp=n\\\\ p\\ \\text{prime},\\ p>Y}}\\mathbf 1_{set_{k-1}}(m)\n =\\omega(n)\\,\\mathbf 1_{set_k}(n),\n \\tag{3a.3}\n\\]\n\nbecause a pair (m, p) with m in set_{k-1} and p > Y has mp in set_k, and\nconversely each distinct prime factor p of an n in set_k gives one such\npair (n/p has Omega = k-1 and all prime factors above Y). Here omega\ncounts distinct prime factors, so omega(n) = k exactly when n is\nsquarefree.\n\nSum (3a.3) over n <= y, n = a (mod q), with (a, q) = 1. A pair (m, p)\nwith p > Y and mp <= y <= 2X has m < 2X/Y = 2X^(1-1/u) <= (4X)^(1-1/u) =\nx^(1-alpha), since 4^(1-1/u) >= 2 for u >= 2; and (m, q) > 1 is\nincompatible with mp = a (mod q). So\n\n\\[\n \\sum_{\\substack{m\\le x^{1-\\alpha}\\\\(m,q)=1}}\\mathbf 1_{set_{k-1}}(m)\n \\Bigl[\\pi(y;q,a,m)-\\#\\{p\\le Y: mp\\le y,\\ mp\\equiv a\\ (q)\\}\\Bigr]\n = k\\,N_k(y;q,a)-\\sum_{\\substack{n\\le y,\\ n\\equiv a\\ (q)\\\\ n\\in set_k}}(k-\\omega(n)).\n \\tag{3a.4}\n\\]\n\nThe subtracted small-prime count splits at m = y/Y: for m <= y/Y every\np <= Y has mp <= y, so the count is pi(mY; q, a, m); for m > y/Y every p\nwith mp <= y has p < Y, so the count is pi(y; q, a, m). Apply (3a.1)\nthree times, with f = 1_{set_{k-1}} (first estimate), with\nf = 1_{set_{k-1}} 1_{m <= y/Y} and r_1(y) = Y <= x^alpha (second\nestimate), and with f = 1_{set_{k-1}} 1_{m > y/Y} (first estimate). Each\nf has values in {0, 1} and is fixed once y in {X, 2X} is fixed. The\nleft side of (3a.4) therefore equals\n\n\\[\n \\frac1{\\varphi(q)}\\sum_{\\substack{m\\le y/Y\\\\(m,q)=1}}\\mathbf 1_{set_{k-1}}(m)\n \\bigl[\\mathrm{li}(y/m)-\\mathrm{li}(Y)\\bigr]+R(y;q,a),\n \\qquad\n \\sum_{q\\le\\sqrt x/(\\log x)^B}\\mu(q)^2 3^{\\nu(q)}\\max_{(a,q)=1}|R|\\ll\\frac{x}{(\\log x)^A}.\n \\tag{3a.5}\n\\]\n\n(The m > y/Y terms cancel between the first and third applications;\nthe m <= y/Y terms leave li(y/m) - li(Y).)\n\nMain term. Summing (3a.3) over n <= y with (n, q) = 1 gives\nk N_k^(q)(y) - sum_{n <= y, (n,q)=1, n in set_k}(k - omega(n)) =\nsum_{m <= y/Y, (m,q)=1} 1_{set_{k-1}}(m)[pi(y/m) - pi(Y)] - J_q, where\nJ_q counts pairs with p | q, p > Y, so J_q <= nu(q) y/Y. Since y/m >= Y =\nX^(1/u) for m <= y/Y, the prime number theorem with classical error gives\n|pi(t) - li(t)| <<_{A,k,u} t/(log x)^(A+k+4) for t in {y/m, Y}, and\nsum_{m <= y/Y} 1/m <= log x + 1, so\n\n\\[\n \\Bigl|\\frac1{\\varphi(q)}\\sum_{\\substack{m\\le y/Y\\\\(m,q)=1}}\\mathbf 1_{set_{k-1}}(m)\n [\\mathrm{li}(y/m)-\\mathrm{li}(Y)]-\\frac{k\\,N_k^{(q)}(y)}{\\varphi(q)}\\Bigr|\n \\le\\frac{k\\,B^{(q)}(y)+\\nu(q)\\,y/Y}{\\varphi(q)}+O\\Bigl(\\frac{x}{\\varphi(q)(\\log x)^{A+k+3}}\\Bigr),\n \\tag{3a.6}\n\\]\n\nwhere B^(q)(y) := #{n <= y : (n,q)=1, p^2 | n for some prime p > Y}\n<= y/Y bounds the non-squarefree correction on the main-term side.\nSumming with the weights mu(q)^2 3^nu(q)/phi(q), whose sum over q <= sqrt x\nis O((log x)^3), and using nu(q) <= log x, these three contributions are\nO(x (log x)^4/Y) + O(x/(log x)^A), acceptable since Y is a power of X.\n\nNon-squarefree correction on the progression side. The last sum in\n(3a.4) is at most k B(y; q, a), B(y;q,a) := #{n <= y : n = a (mod q),\np^2 | n for some prime p > Y}. For a prime p <= (y/q)^(1/2) the number\nof such n is at most y/(p^2 q) + 1 <= 2y/(p^2 q). For p > (y/q)^(1/2)\nwrite n = p^2 m with m < q; for squarefree q the congruence\np^2 m = a (mod q) has at most 2^nu(q) admissible classes for p modulo\nq, so these n number at most sum_{m= (A + 5)/2, using sum_{q <= Q} 6^nu(q) << Q (log x)^5 and\nsum_{p > Y} p^-2 << 1/Y. Dividing (3a.4) by k and collecting (3a.5),\n(3a.6) and (3a.7) gives (3a.2). QED.\n\nThe statement (3a.2) is a distribution theorem for the indicator of\nk-fold Y-rough products in reduced residue classes. It is not the twin\ncount, an occupancy statement, or a parity statement; it carries no\nsign information about lambda.\n\n### 3a.3 Proposition 4: aggregate contamination constant 4\n\n**Proposition 4.** Fix k >= 1 and u >= 2. Then, as X -> infinity,\n\n\\[\n \\#\\{n\\in(X,2X]\\cap set_k:\\ n-2\\ \\text{prime}\\}\n \\le(4+o(1))\\,\\frac{2C_2\\,\\#(set_k\\cap(X,2X])}{\\log X}\n +O_{A,k,u}(X/\\log^A X).\n \\tag{3a.8}\n\\]\n\nWith #(set_k cap (X,2X]) = (D_k(u) + o(1)) X/log X this is\n(4 D_k(u) + o(1)) 2 C_2 M for every k (the displayed form absorbs the\nO(X/log^A X) remainder only when D_k(u)>0, i.e. k= 2^u every n in set_k is odd, so\nevery element of A is odd and d | n - 2 with d odd is the reduced\ncondition n = 2 (mod d). Put w(d) := d/phi(d) on odd squarefree d, so\nthat (2.2) holds with 0 <= w(p) = p/(p-1) < p, and\n|A_d| = (w(d)/d) X_A + r(A, d) with\n\n r(A,d) = [N_k(2X;d,2) - N_k^(d)(2X)/phi(d)] - [N_k(X;d,2) - N_k^(d)(X)/phi(d)]\n - (1/phi(d)) #{n in set_k cap (X,2X] : (n,d) > 1}.\n\nThe last term is at most (1/phi(d)) sum_{p | d, p > Y} 2X/p, and\nsum_{d <= Q} mu(d)^2 (1/phi(d)) sum_{p|d, p>Y} 2X/p << X (log x) sum_{p>Y} p^-2\n<< X log x/Y. With Proposition 3 for the first two brackets,\nsum_{d <= Q} mu(d)^2 |r(A,d)| <<_{A,k,u} X/(log X)^A for\nQ = sqrt x/(log x)^B. Condition (2.3) holds with an absolute K because\nV(z) = prod_{24, and the marginal\ntest reads c*_real(u) > 4. The Q_cov test is unchanged by this\ncorrection; its inputs are now the proven prime BV, Proposition 3, Wu's\nLemma 2.2, and any F_2 >= 1.\n\n### 3a.4 Revised hypothesis matrix for the two tests\n\n| Input | Status after this pass | Where |\n|---|---|---|\n| Prime Bombieri--Vinogradov at level X^(1/2-eps) | proven (corpus) | Tao Notes 3, Theorem 17 |\n| BV for 1_{set_k}, every fixed k, u | DERIVED from Wu Lemma 2.3 first and second estimates, all errors paid; rests on the uniformity reading of 3a.1 | Proposition 3 |\n| Rosser--Iwaniec bounds (2.4)-(2.5) with well factorable remainder | read at the page | Wu Lemma 2.2 |\n| f_1 <= 1 <= F_1, f_1 closed form on [2,4] | standard properties of the linear sieve functions | section 4a |\n| Dimension-2 upper sieve for S | only F_2 >= 1 used | section 4a |\n| Contamination constant | c_eff = 4 for every u, DERIVED | Proposition 4 |\n| #(set_k cap (X,2X]) ~ D_k(u) X/log X | classical normalisation of section 2, not re-derived | section 2 |\n| (Cov_u), (Dec_1) | OPEN hypotheses, not used beyond the tests | section 2 |\n\nNo input of the matrix is the twin count, an occupancy statement, or a\nrestatement of either hypothesis.\n\n## 4. What the computation establishes\n\n[fold-arithmetic-bridge-validation.js](fold-arithmetic-bridge-validation.js)\nchecks the denominator-free identity exactly in BigInt arithmetic on\n10 intervals, X in {2^16,2^18,2^20,2^22,2^24}, u in {4.5,6}.\nIts section 3 evaluates the first return's model at 16 depths from 4.1\nto 60 on a 0.002 differential-equation grid with quadrature and seeded\nMonte Carlo for the superseded c_pair integrals; it is retained for\nreproducibility. Over that grid, the largest reported Q_cov is 0.4063\nwith the proposed F_2 and 0.4222 with F_2 set to 1; the largest c*_real\nis 1.661, and the superseded c_eff runs from 12.86 to 19.72.\n\nSection 4, added on 2026-09-08, scans the same model at every grid point\nin (4, 64]: max Q_cov(F_2) = 0.4065 at u = 8.120, max Q_cov(F_2 = 1) =\n0.4240 at u = 7.652, max c*_real = 1.6641 at u = 7.732, and no grid\npoint has c*_real >= 2. With c_eff = 4 the marginal ratio is at most\n0.4160. These are measurements of the numerical model. Section 4 also\nevaluates the five piecewise bounds of Proposition 5 and checks at every\ngrid point that the analytic bound dominates the model value, that\nrho_odd lies between 1 + D_3 and (u-1)/2 + 1/(2(u-1)), and that the\nsieve functions satisfy f_1 <= 1 <= F_1 and F_2 >= 1 within the grid's\n1e-6 discretisation tolerance.\n\nThe finite parity identity at u=3 also requires care: on (64,128] with\ny=4, the surviving pair (125,127) has both Omega parities odd but is not\na twin pair. The cutoff (2X+2)^(1/3), rather than X^(1/3), is what\nguarantees the absence of three-factor contamination.\n[research-round-validation.js](research-round-validation.js) checks this\ncounterexample directly.\n\n## 4a. Both tests fail at every depth u > 4\n\n**Proposition 5.** For every u > 4 and every upper function F_2 >= 1,\n\n\\[\n Q_{cov}(u)\\le f_1(u/2)^2\\Bigl[\\frac{e^\\gamma}{4}+\\frac{e^\\gamma(1+1/D_3(u))}{2u}\\Bigr],\n \\qquad\n c^*_{real}(u)\\le f_1(u/2)^2\\Bigl(1+\\frac1{D_3(u)}\\Bigr).\n \\tag{4a.1}\n\\]\n\nConsequently Q_cov(u) < 1 and c*_real(u) < 4 for every u > 4, and\nc*_real(u) < 2 for u in (4, 4.8] and for u > 8.\n\n*Proof.* Inputs. (i) f_1(s) <= 1 <= F_1(s) for all s > 0, and on\n[2, 4] f_1(s) = 2 e^gamma log(s-1)/s, which is increasing there because\ns/(s-1) > log(s-1) for s <= 4. (ii) F_2 >= 1. (iii) rho_odd(u) >= 1 +\nD_3(u) > 1 for u > 4, since D_1 = 1, D_3(u) = int_2^(u-1) log(v-1) dv/v\n> 0 for u > 3, and all D_k >= 0. (iv) D_k(u) <= log^(k-1)(u-1)/(k-1)!\nfor k >= 1: D_1 = 1 and D_2(u) = log(u-1) directly, and for k >= 3 by\ninduction, D_k(u) = int_{k-1}^{u-1} D_{k-1}(v) dv/v <=\nint_2^{u-1} log^(k-2)(v-1)/((k-2)!(v-1)) dv = log^(k-1)(u-2)/(k-1)!,\nusing 1/v <= 1/(v-1) and k-1 >= 2.\nHence rho_odd(u) <= sum_{j even} log^j(u-1)/j! = cosh(log(u-1)) =\n(u-1)/2 + 1/(2(u-1)) < u/2 for u > 2. (v) Writing rho = rho_odd,\nrho^2/(rho-1) = rho + 1 + 1/(rho-1) <= u/2 + 1 + 1/D_3(u) by (iii)\nand (iv). (vi) D_3 is increasing, and D_3(u) >= ((u-2) log(u-2) -\n(u-3))/(u-1) from 1/v >= 1/(u-1) on the range of integration; the\nintegrand log(v-1)/v is unimodal on [2, infinity), so on any cell the\nminimum of its endpoint values times the cell length is a lower bound\nfor the cell's integral.\n\nFrom the definitions, Q_cov = f_1(u/2)^2 rho^2 e^gamma/(2u F_1(u/2) F_2(u)(rho-1))\n<= f_1(u/2)^2 e^gamma (u/2 + 1 + 1/D_3(u))/(2u) by (i), (ii) and (v),\nwhich is (4a.1); and c*_real = f_1(u/2)^2 rho/(F_2(u)(rho-1)) <=\nf_1(u/2)^2 (1 + 1/D_3(u)) by (ii) and (iii). Both right sides are bounded\non a piece (u_0, u_1] by replacing f_1(u/2)^2 with f_1(u_1/2)^2 (or 1\nwhen u_1/2 > 4), D_3(u) with a lower bound at u_0, and 1/(2u) with\n1/(2u_0). Here is a certificate independent of that numerical grid.\nUse e^gamma<9/5. Indeed gamma<=H_100-log 100=((u_0-2)log(u_0-2)-(u_0-3))/(u_0-1). At u_0=8,\nunimodality and the integer cells in [2,7] give\n\n D_3(8) >= log 2/3 + log 3/4 + log 5/6 + log 6/7 > 1.\n\nThe cell [2,3] is discarded; the other four minima are at 3,4,6,7.\nFor f use min(1,2(9/5)log(u_1/2-1)/(u_1/2)) on a finite piece,\nand 1 on the tail. The resulting upward-rounded rational upper bounds\nare as follows (strict comparison with 1 and 4 has positive slack):\n\n| Depth u | Q_cov upper bound | c*_real upper bound |\n|---|---:|---:|\n| (4,22/5] | 216/1000 | 781/1000 |\n| (22/5,24/5] | 420/1000 | 1491/1000 |\n| (24/5,6] | 897/1000 | 3120/1000 |\n| (6,8] | 875/1000 | 2899/1000 |\n| (8,infinity) | 672/1000 | 1971/1000 |\n\nTo certify each logarithm, reduce its rational argument to [1,2] by\npowers of two and put t=(z-1)/(z+1). The first 32 terms of\n2 sum_(j>=0) t^(2j+1)/(2j+1) give a lower bound, with omitted tail at\nmost 2t^65/(65(1-t^2)). The certificate's operations and comparisons in\n[research-round-validation.js](research-round-validation.js) use reduced\nBigInt fractions. The same enclosures check the four endpoint minima,\nD_3(8)>1 and H_100 infinity: a factor 2 from counting both sides and a\nfactor 2 from discarding the partner's parity; that is where the limit\n1/4 of Q_cov comes from.\n\n## 4b. All-depth sub-2 certificate (2026-09-11)\n\n**Proposition 6.** Under the definitions and standard sieve inputs above,\nfor every u>4 and F_2(u)>=1, c*_real(u)<=1973/1000<2.\n\n\nWrite rho=rho_odd(u). The project defines\n\n\\[\nc^*_{real}(u)=\\frac{f_1(u/2)^2\\rho}{F_2(u)(\\rho-1)},\\qquad\nD_3(u)=\\int_2^{u-1}\\frac{\\log(v-1)}v\\,dv.\n\\]\n\nIts nonnegative factor-count terms give rho>=1+D_3(u)>1. Therefore\n\n\\[\nc^*_{real}(u)\\le f_1(u/2)^2(1+D_3(u)^{-1}). \\tag{1}\n\\]\n\nOnly the following standard sieve inputs are imported: f_1(s)<=1 and, for 2<=s<=4, f_1(s)=2 exp(gamma) log(s-1)/s. The latter follows from Wu's defining delay equations (2.6), printed page 6: F(s)=2 exp(gamma)/s extends to s=3 because f(s-1)=0 there; integrating (s f(s))'=F(s-1) from 2 gives the displayed formula through s=4. This is a check of the normalization, not a re-proof of the sieve theorem.\n\nThe closed-form f_1 is increasing on [2,4]: its derivative has the sign of s/(s-1)-log(s-1), which decreases and is positive at s=4. D_3 is increasing. The integrand k(v)=log(v-1)/v has derivative with numerator v/(v-1)-log(v-1); this numerator has derivative -v/(v-1)^2<0. Consequently k increases then decreases, with no interior minimum. On a rational cell [v,v+1/10], its minimum is at an endpoint.\n\nFor an endpoint a in the table below, sum the cell widths times the smaller directed lower bound for their endpoint values, from 2 to a-1, to obtain a rational L(a)<=D_3(a). For a depth cell [a,b] in [4,8], set\n\n\\[\nU(b)=\\min\\left(1,\\frac{2(9/5)\\log_+(b/2-1)}{b/2}\\right),\\qquad\nB(a,b)=U(b)^2(1+1/L(a)). \\tag{2}\n\\]\n\nHere log_+ is an explicit rational upper enclosure. Monotonicity and exp(gamma)<9/5 imply that (1)<=B(a,b) throughout the cell. For u>=8 use f_1<=1 and L(8), giving the constant bound 1+1/L(8).\n\nAll logarithms are certified without floating arithmetic. Reduce the rational argument to z in [1,2] by powers of two, put t=(z-1)/(z+1), and use the first 32 terms of 2 sum t^(2j+1)/(2j+1). This is a lower enclosure; the omitted positive tail is at most 2t^65/(65(1-t^2)). Restore the powers of two using the same enclosure for log 2. Rounding outwards to a denominator of 10^12 keeps subsequent fractions small. The rational comparison H_1004. Inclusion of u=4 in the bound is harmless; the proposition only uses u>4. The maximum is 1973/1000. QED.\n\n\nThe exact-rational implementation and full endpoint output are supplied\nwith the contribution as `subtwo-certificate.py` and\n`subtwo-certificate-output.json`. This certificate is independent of the\nlarge numerical sieve grid; it recertifies the outside ranges as well.\nIt proves neither a twin lower bound nor either open parity hypothesis.\n\n## 5. Payoff and next obligation\n\nThe exact identities can be reused. Propositions 3 and 4 are reusable\nsieve inputs at their stated scope: a level-1/2 distribution theorem for\nk-fold rough products and the constant 4 for shifted-prime contamination\nafter averaging the factor tuples for each fixed k,u. No additional controlled region or signed global\nmargin follows, and no handoff consumer receives a bound.\n\nThe two displayed tests with aggregate constant 4 are closed at every\ndepth by the reviewed Proposition 5. This does not exclude improving\nother inputs or changing the consumer. A useful continuation could retain\nthe partner's parity in the joint contamination count N_odd3, with its\nnon-residue input named before computation, or use a different weight.\nProposition 6 shows that an upper-sieve constant bounded below by 2\ncannot repair this particular marginal test at any depth u>4. This does\nnot exclude changed weights, joint parity inputs, constants below 2,\nor a different consumer.\n\nRevision history for this note is in\n[history/CHANGELOG.md](history/CHANGELOG.md).\n"},"research/full-coefficient-average.md":{"lf_sha256":"0417d46a8433643db450e27379d57e7606a4506b885638e15ce531ab59e072a9","content":"# Complete coefficients: an exact Fourier representation, without a matched estimate\n\n\n\n**Twin-prime infinitude and all sufficient signed margins remain OPEN.**\nSections 1–5 are lane C's retained result after\n[research-round-validation.md](research-round-validation.md), section 3.\nThe original submitted text is in commit a5e1244. Section 6 is the\n2026-09-08 continuation (second dispatch) with the precise weighted sum,\nthe executed source match and a proved norm obstruction; the handler's\nreview of it is [research-round-validation.md](research-round-validation.md)\nsection 8.\n\n## 1. Complete coefficient and exact factor identity\n\nUse the profiles of [global-smooth-majorant.md](global-smooth-majorant.md):\n(a_L,b_L,W_L)=(floor(x^.22),floor(x^.24),floor(x^.24)) and\n(a_R,b_R,W_R)=(floor(x^.04),floor(x^.05),floor(x^.05)).\nWrite rhohat_i(d)=chi(log(d/a_i)/log(b_i/a_i)),\nF_i(s)=sum_(d|s)mu(d)rhohat_i(d), s_i(n) for the W_i-smooth part,\nt_i(n)=n/s_i(n), and\n\\[\n D_i(n)=\\log t_i(n)F_i(s_i(n)),\\qquad\n E_i(n)=\\sum_{\\substack{p\\le W_i,\\ j\\ge2\\\\p^j\\mid n,\\ p^j>W_i}}\n \\log p\\,F_i(n/p^j).\n\\]\nFor n>W_i the exact identity from global-factor-signs (4) is\n\\[\n \\widehat G_i(n)=\\Lambda(n)-D_i(n)-E_i(n). \\tag{1}\n\\]\nIt applies to both arguments n,n-2 on J_x for sufficiently large x.\n\nDefine Rhat=sum_J Ghat_L(n)Ghat_R(n-2),\nX_L=sum_J Lambda(n)D_R(n-2), X_R=sum_J D_L(n)Lambda(n-2), and\nY=sum_J D_L(n)D_R(n-2). The owning exceptional-set budget gives\n\\[\n \\widehat{\\mathcal R}=S-X_L-X_R+Y+O_\\epsilon(x^{39/40+\\epsilon}).\n \\tag{2}\n\\]\nCombining with the existing S=C2*x+Rhat+O_A(x/log^A x) yields\n\\[\n X_L+X_R-Y=C_2x+O_A(x/\\log^A x). \\tag{3}\n\\]\nThis is a consequence of the existing reduction, not a new estimate.\nIt does not rule out new inequalities involving these objects.\n\n## 2. Fourier representation with the actual rounded endpoints\n\nPut w_i(x)=log(a_i)/log x and w'_i(x)=log(b_i)/log x. For sufficiently\nlarge x these endpoints are distinct, lie in (0,1), and their difference\nis bounded below by a positive fixed constant. Define\nh_i(v)=1-chi((v-w_i)/(w'_i-w_i)), and on [0,2) set\nhper_i(v)=h_i(v)-h_i(v-1.2), extended periodically.\n\nIt is C3 and piecewise polynomial; its fourth derivative is integrable\nwith a bound uniform for large x. For\nc_(i,k)(x)=(1/2)int_0^2 hper_i(v)exp(-i*pi*k*v)dv, four integrations\nby parts give |c_(i,k)(x)|<=C(1+|k|)^(-4) with C independent of x.\nConsequently N_i(x)=sum_k|c_(i,k)(x)| is uniformly bounded and the tail\nbeyond K_0 is O(K_0^(-3)). It is not literally independent of x.\n\nAbsolute convergence and finite divisor summation give, exactly for d,s<=x,\n\\[\n 1-\\widehat\\rho_i(d)=\\sum_k c_{i,k}(x)d^{\\,i\\pi k/\\log x},\n \\qquad\n F_i(s)=1_{s=1}-\\sum_k c_{i,k}(x)g_k(s), \\tag{4}\n\\]\nwhere\n\\[\n g_k(s)=\\prod_{p\\mid s}(1-p^{\\,i\\pi k/\\log x}).\n\\]\nThus g_k is multiplicative, has g_k(p^v)=1-p^(i*pi*k/log x), and\n|g_k(s)|<=2^omega(s). The function of n used in the coefficient is\ng_k(s_i(n)): at p>W_i its prime-power value is 1, not 0. The term\n1_(s_i(n)=1) is the W_i-rough indicator and also must be retained.\n\nThis removes an explicit enumeration of smooth cofactors from the\nrepresentation. It does not yet remove any loss from a proved estimate.\nThe measured norms 2.8247 and 3.0963 are finite Fourier sums for the\nvalidator's fixed-exponent, unfloored proxy. They are neither certified\ninfinite norms nor the norms of every rounded profile. The new review\nvalidator tests the endpoint distinction directly.\n\n## 3. What is and is not excluded\n\n**Available class.** The displayed g_k can have prime values of modulus\ngreater than 1, so a theorem restricted to 1-bounded functions does not\napply directly. The 45-prime construction in the original validator gives\nF_L=C(44,10)=2481256778 at all sufficiently large scales with primes in\nfixed strict exponent subintervals of (.24/11,.22/10). It follows that a\nrepresentation by 1-bounded functions needs coefficient norm at least\nthat constant. By itself it does not show that no larger x-independent\nnorm exists; Proposition 6.5 now supplies a sequence with norm tending\nto infinity, at least (log x)^(2/5), on the set of all W_L-smooth inputs.\n\n**Weighted transfer.** Dividing by 2^omega makes a 1-bounded function but\nleaves a nonconstant arithmetic weight in the correlation. An unweighted\nsaving cannot be multiplied by an unsigned envelope to bound the\nweighted signed sum. The previously reported O(x log^(4-c) x) is therefore\nnot an established transfer estimate. The finite envelope computation is\nretained only as a measurement. A valid argument needs weighted\ncorrelation control, or a decomposition of the weight with its costs.\n\n**Main terms and quantifiers.** There is no proved common main-term formula\nfor every component in (4). Some terms, such as the rough indicator, do\nnot fall under a cancellation conclusion. A candidate theorem must match\nthe actual family, its dependence on x, the log t_i factors, shift 2,\ntwists, exceptional scales and complete error budget. A signed lower\nbound might suffice; a full asymptotic is not proved necessary.\n\n**Smooth-part truncation.** For D_i(n) nonzero one has t_i(n)>1 and\ns_i(n)<=x/W_i. The left subfamily s=p_1p_2p_3 with exponents strictly\ninside (.18,.22) has F_L(s)=-2 for sufficiently large x and s>x^.54.\nMertens summation gives limiting harmonic mass\n(1/3)log(.22/.18)^3=0.002694 to the reported precision. Thus a cutoff at\nx^(1/2-eps) omits nonzero coefficients. Harmonic mass alone is not an\nestimate for their signed shifted correlation.\n\nThese facts exclude the direct theorem applications tried here. Together\nwith section 6 they exclude bounded-norm representations by 1-bounded\ncomponents on all smooth inputs; they do not exclude a signed inequality,\na representation with paid growing components, or a future coefficient\nestimate that treats the Fourier sum jointly.\n\n## 4. Prior work and source matrix\n\nThe factor identity and exceptional-set budget belong to\n[global-factor-signs.md](global-factor-signs.md); the smooth profiles and\nmajorant to [global-smooth-majorant.md](global-smooth-majorant.md).\nMellin/Fourier separation is classical; we make no novelty claim.\n\nThe following records the worker's reading scope. The unit-disc\nrestriction in Klurman and the independent-linear-forms restriction in\nMatthiesen were rechecked during integration. The latter excludes the\none-variable pair n,n-2. Other rows are retained as source-search records,\nnot as fresh theorem audits.\n\n| source, version, locator | class and shape | error | first unmatched hypothesis |\n|---|---|---|---|\n| Klurman, arXiv:1603.08453v1 (28 Mar 2016), Compositio 153 (2017) 1622-1657, Theorem 1.3 and Theorem 1.5; PDF SHA-256 `502591fd12faf60e76ce6dc59d931880780cba824fa0ea03765b6bb46d08c43c` | f,g: N -> U (unit disc), fixed, with D(f,n^(it)chi;infinity)=2 variables, pairwise linearly independent over Q; asymptotic with W-trick main term | (kappa(delta)+o(1)) times the divisor-type envelope; qualitative | s>=2 variables. The pair (n,n-2) is one variable with two forms proportional as linear forms, excluded by hypothesis (ii). The functions are also fixed in N except through n^(it) twists. Divisor-bounded growth would otherwise match. |\n| Tao-Teravainen, arXiv:2512.01739v2, Theorem 3.1(ii); MRT arXiv:1503.05121v3 (1.12); already in custody (prime-band-transfer section 4) | 1-bounded multiplicative, non-pretentious, natural average on (N,2N], rate L^(-c) off an exceptional scale set | (log X)^(-c), c absolute and small | 1-bounded; and the conclusion is cancellation, not a main term. g_(i,k) is 2-bounded at primes and has a nonzero mean. Not applicable. |\n| Klurman-Mangerel-Teravainen, arXiv:2304.05344v2 (26 May 2023), abstract read | f: N -> D, non-pretentious; two-point correlation tends to 0 on a set of full upper logarithmic density | none | 1-bounded, non-pretentious, no rate; not applicable. |\n| Mangerel, arXiv:2108.11401v2 (12 Nov 2021), abstract read | divisor-bounded functions with |f(p)| uniformly bounded; short-interval Matomaki-Radziwill extension | not a correlation statement | no two-point or shifted statement in the abstract; not opened further. |\n| arXiv:2603.23250v2 (15 Apr 2026), abstract read | k-divisor-bounded multiplicative functions, ternary correlations on average, conditional on L-function second-moment bounds | conditional | ternary and averaged; not a fixed-shift binary statement. Unrefereed. |\n| Roy-Savalia-Vatwani, \"Divisor-bounded multiplicative functions in arithmetic progressions\", listed as submitted on [Vatwani's publication page](https://sites.google.com/view/akshaa/publications), checked 2026-09-08; no arXiv record under au:Vatwani or au:Savalia | title only | unknown | UNREAD. Not importable. A progression theorem for fixed divisor-bounded functions would not by itself give a fixed-shift correlation. |\n\n## 5. Validation and payoff\n\n[full-coefficient-average-validation.js](full-coefficient-average-validation.js)\nchecks the factor identity on a finite proxy, 27000 Euler identities,\n7862 coprime multiplicativity cases, Fourier reconstruction, the fixed\nbinomial norm lower bound and the three-prime subfamily. Its measurements\nare finite; the proxy does not itself validate the rounded identity.\n[research-round-validation.js](research-round-validation.js) checks that\nusing fixed exponents can differ from the rounded profile, and verifies\nthe corrected normalized endpoints.\n\nNo estimate for Rhat, E_dagger or D_y follows. The next obligation is a\nmatched weighted arithmetic estimate or a rigorously costed alternative\nrepresentation. Repeating this same unweighted import has no payoff.\nSection 6 records the executed weighted attempt, its exact obstructions\nand the proved norm bound that replaces the finite example.\n\n## 6. Continuation 2026-09-08: the actual weights, the rough-pair sub-sum and a proved norm obstruction\n\n Lane / stable question id: C / Q-full-coefficient-average\n Starting commit / report commit or shared-checkout paths: 1285d47, shared checkout; research/full-coefficient-average.md, research/full-coefficient-average-validation.js\n Disposition / exact claim / unproved hypotheses: no weighted transfer; route (i) executed to two exact obstructions (composite filter not multiplicative; rate log^(2-c) above the needed precision for the inspected zero modes; low nonzero modes also meet the unit-disc condition); Proposition 6.5 PROVED (1-bounded representations of F_L have norm >= (log x)^(2/5)); every sufficient margin OPEN\n Changed step compared with the reviewed baseline: the weighted sum (7) is written with its composite filter and log t lift; c_(i,0)=3/5 exactly; the both-rough composite pair sum R_00 is identified with coefficient one in every component; the withdrawn fixed-norm obstruction is replaced by a proved unbounded sequence\n Source theorem and first unmatched hypothesis, if any: Tao–Teravainen 2512.01739v2 Thm 3.1(ii): admits the rough indicators but not the composite filter, and its rate gives x log^(2-c) x; Klurman 1603.08453v1 Thm 1.3/1.5: error term D_P(1,f;log x;x) is unbounded on this family; Matthiesen 1606.04482v4 Thm 2.4: one variable\n Validation command, falsifier, result and compute used: node research/full-coefficient-average-validation.js (2.6 s, embedded); falsifiers in 6.5; all finite checks pass; no enumeration\n Independent reviewer / disposition (PENDING until actually reviewed): handler / verified within stated scope, 2026-09-08 (research-round-validation.md section 8)\n Full-consumer payoff and unpaid complement: none; the whole residual remains unestimated at the signed precision\n Proposed shared-record changes / next bounded obligation: OUTCOMES entry replacing the \"revisit\" line; SEARCH-CONVENTIONS rows; TODO ledger unchanged; next obligation in 6.8\n\n### 6.1 Question, disposition, what remains open\n\nThe question is the lane C text of\n[RESEARCH-EXECUTION.md](RESEARCH-EXECUTION.md) section 2, executed as\nwritten: a weighted estimate for the repaired representation with its\nactual arithmetic weights, or a costed alternative representation.\n\nDisposition. The weighted shifted sum is written exactly in (7) with\nevery weight named. The only weight that is not absorbed into an\nx-dependent multiplicative function is the composite filter on both\narguments. Route (i) was chosen and executed against the sources in\ncustody: no matched theorem, with the first unmatched hypothesis\nrecorded per source in 6.3 and the total cost in 6.4. Route (ii) is\nclosed at one scope by Proposition 6.5: a representation by 1-bounded\nfunctions cannot have bounded norm. Nothing here estimates Rhat,\nE_dagger or D_y. Twin-prime infinitude and every sufficient signed\nmargin of [RESEARCH-HANDOFF.md](RESEARCH-HANDOFF.md) section 3 remain OPEN.\n\n### 6.2 Exact statement\n\nParameters, profiles, s_i, t_i, F_i, D_i, E_i and Ghat_i are those of\nsections 1–2; x is dyadic, J_x=(x/2,x], and every n in J_x and n-2\nexceeds both W_i for large x. Write 1_c(n)=1 if n is not prime and 0\nif n is prime, and D_i^c=1_c D_i.\n\n**Composite filter.** On n>W_i, Lambda(n)-D_i(n)=-D_i^c(n) unless n is\na proper prime power, where the difference is Lambda(n). With (1) and\nthe exceptional budget of [global-factor-signs.md (6)–(7)](global-factor-signs.md),\nwhich already pays proper prime powers and the E_i terms with the\ndivisor bound,\n\n\\[\n \\widehat{\\mathcal R}(x)=\\sum_{n\\in J_x}D_L^c(n)D_R^c(n-2)\n +O_\\epsilon(x^{39/40+\\epsilon}). \\tag{5}\n\\]\n\n**Rough indicator and the constant coefficient.** In (4) put\nc'_(i,0)=1-c_(i,0) and c'_(i,k)=-c_(i,k) for k≠0, and let\ng_(i,k)(n)=g_k(s_i(n)). Then F_i(s_i(n))=sum_k c'_(i,k) g_(i,k)(n) with\ng_(i,0)(n)=1_(s_i(n)=1). The constant coefficient is exact: since\nh_i=0 on (-infinity,w_i] and h_i=1 on [w'_i,infinity) with 0 t_i(n)^(iu/log x) is\nmultiplicative with prime-power values p^(ivu/log x) for p>W_i and 1\nfor p<=W_i. Define the multiplicative function\n\n\\[\n G_{i,k,u}(n)=g_{i,k}(n)\\,t_i(n)^{iu/\\log x},\\qquad\n G_{i,k,u}(p^v)=\n \\begin{cases}1-p^{i\\pi k/\\log x},&p\\le W_i,\\\\ p^{ivu/\\log x},&p>W_i,\\end{cases}\n\\]\n\nso |G_(i,k,u)(n)|<=2^omega(s_i(n)) and |G(p^v)|=1 above W_i. Exactly,\nfor n in J_x,\n\n\\[\n D_i(n)=\\log x\\sum_k c'_{i,k}\\int_{\\mathbb R}\\widehat\\psi(u)\n G_{i,k,u}(n)\\,du .\n\\]\n\n**The weighted shifted sum.** With absolute convergence of every sum,\n\n\\[\n \\widehat{\\mathcal R}\n =(\\log x)^2\\sum_{k,l}c'_{L,k}c'_{R,l}\\iint\\widehat\\psi(u)\\widehat\\psi(u')\n T_{k,l}(u,u')\\,du\\,du' +O_\\epsilon(x^{39/40+\\epsilon}),\n \\quad\n T_{k,l}(u,u')=\\sum_{n\\in J_x}1_c(n)1_c(n-2)G_{L,k,u}(n)G_{R,l,u'}(n-2).\n \\tag{7}\n\\]\n\nThe coefficient budget in front is\n(1+N_L)(1+N_R)||psihat||_1^2 (log x)^2, uniformly bounded apart from\nthe explicit (log x)^2. A termwise estimate reaches o(x) in the S\nnormalization only if T_(k,l)(u,u')=o(x/log^2 x) uniformly in the\nparameters, with at most polynomial growth in k,l to be absorbed by\n|c'_(i,k)|<<(1+|k|)^(-4).\n\n**The rough-pair sub-sum.** On W_i-rough n every g_(i,k)(n)=1 and\nt_i(n)=n, so D_i(n)=log n. Define\n\n\\[\n R_{00}(x)=\\sum_{\\substack{n\\in J_x,\\ n,\\,n-2\\ \\text{not prime}\\\\\n s_L(n)=1,\\ s_R(n-2)=1}}\n \\log n\\,\\log(n-2)\\ \\ge 0 . \\tag{8}\n\\]\n\nThen Rhat=R_00+Rhat_mix+O_epsilon(x^(39/40+epsilon)), where Rhat_mix\nis the sum in (5) over pairs with s_L(n)>1 or s_R(n-2)>1. The\ncoefficient of R_00 is one, not (2/5)^2: in (7) the restriction of\nT_(k,l)(u,u') to both-rough composite pairs equals\nsum n^(iu/log x)(n-2)^(iu'/log x) over those pairs for every (k,l),\nand the outer sum of coefficients is F_L(1)F_R(1)=1. The finite check\n(H) confirms Ghat=-log n at all 8831 W-rough composites of the proxy\nwindow. From [global-smooth-majorant.md (15)](global-smooth-majorant.md),\nR_00<= sum_(p<=W_i)1/p >= log log W_i-1 >= (7/24)log log X for large X, since every summand of the distance is nonnegative and the p<=W_i summands equal 1/p. The moving cutoff W_i(2N) is frozen on a mesh as in prime-band-transfer section 3; two rough sets at cutoffs W,W' with log W'/log W=1+O(delta) differ on a set of density O(delta). | (a) The composite filter is not multiplicative and not admitted; (b) the full Fourier family is not uniformly 1-bounded, although low nonzero modes are (see 6.4(b)); (c) the available rate does not reach the o(N/log^2 N) needed after the log weights. Only an upper bound O(N/log^2 N) for the unfiltered rough pair count is used here; no matching lower bound has been established. |\n| Klurman, arXiv:1603.08453v1, Thm 1.3 and Thm 1.5, p. 4–6; PDF SHA-256 `502591fd…`, reread 2026-09-08 | Multiplicative, unit-disc for (0,0); shift d=2 with res(P,Q)=2≠0. | The error term is << D_P(1,f;log x;x)+D_Q(1,g;log x;x)+1/log log x, with D_P(f,g;y;x)^2=sum_(y<=p<=x)(1-Re f(p)g(p)bar)/p+(prime-power term). For f=1_(s_L=1) this is at least sum_(log x<=p<=W_L)1/p=log log W_L-log log log x+O(1), which tends to infinity. The statement is vacuous on the family, and Theorem 1.5's D(f,n^(it)chi;infinity) 2 boundary of the Buchstab recursion is the twin count. This is a scoped negative in the conventions \"sieve of dimension two\", \"almost-prime twins\", \"Buchstab iteration\", not an absence proof. |\n\nNo novelty claim is made for the identities of 6.2; the lift of log t\nis the one already used in prime-band-transfer (1). The norm obstruction\nof 6.5 is elementary; it was checked against the review's stated gap\nand is not claimed new to the literature.\n\n### 6.4 Route (i): the decisive steps and their total cost\n\n**(a) The composite filter.** For a multiplicative g and primes\np,q>W_i, the function 1_c g has (1_c g)(p)=0 and (1_c g)(pq)=g(pq)≠0\nwhenever g(p)g(q)≠0, so it is not multiplicative and no row of 6.3\nadmits it. Expanding 1_c=1-1_prime in (7) gives, for each component,\n\n\\[\n T_{k,l}=U_{k,l}-V^L_{k,l}-V^R_{k,l}\n +\\sum_{\\substack{n\\in J_x\\\\ n,\\,n-2\\ \\text{prime}}}\n n^{iu/\\log x}(n-2)^{iu'/\\log x},\n\\]\n\nwith U the unfiltered correlation and V^L,V^R the sums over prime n or\nprime n-2. After the u,u' integrals and the (log x)^2 factor the last\nterm is sum_(n,n-2 prime) log n log(n-2)=S(x)+O(\\sqrt x\\,\\log^3 x),\nindependent of (k,l), with outer coefficient sum c'_(L,k)sum c'_(R,l)=1.\nThus the decomposition of the weight returns S itself, that is, the\nreduction identity (3); the remaining three sums are the Fourier forms\nof Y, X_L and X_R, whose combination is already known to arbitrary\nlogarithmic precision. No estimate is gained; this is the review's\npoint for this particular exact reassembly. It does not exclude a joint estimate exploiting the Fourier coefficients.\n\n**(b) The unit-disc condition and the zero-mode rate.** For real u,\n\n |G_(i,k,u)(p^v)| = 2|sin(pi k log p/(2 log x))| <= 1\n\nfor p<=W_i whenever |k|log W_i/log x<=1/3; above W_i the modulus is\none. Therefore at least k=0,±1 on the left and l=0,±1,...,±6 on the\nright are 1-bounded on every integer, for every Mellin twist. This\ncorrects the assertion that only the zero modes qualify. It is a\nsufficient range, not an exhaustive classification of finite aliases.\nThe composite filter and the required correlation rate still need\nseparate checks, including for these modes. The rational phase bounds\nand controls are in research-round-validation.js. For the zero modes, applying Tao–Teravainen to the frozen rough indicators, then the mesh\nand the dyadic sampling of [round-review-0906.md section 2](round-review-0906.md),\ngives on a dyadic scale average\n\n\\[\n \\frac{1}{\\log X}\\sum_{\\sqrt X\\le 2^j\\le X}\n \\frac{\\Bigl|\\sum_{2^j0 inherited from the source. Multiplying by the\nweights log n log(n-2)<=(log x)^2 and by (2/5)^2||psihat||_1^2 gives,\nin the normalization of S(x), a budget O(x (log x)^(2-d)). This is the\nstop rule's case verbatim: a small logarithmic saving in a quantity of\nsize x log^2 x. It is weaker than the sieve upper bound O(x) that the\nsame unfiltered sum already has, and the sum it bounds is\nR_00+P_L+P_R+S(x)+O(sqrt x log^3 x), with P_L the prime–rough and P_R\nthe rough–prime terms. The exceptional scale set depends on the frozen\ncell and, for u,u'≠0, on the twist; Tonelli removes the dependence at\nthe price of an absolute average, which cannot carry a sign. A signed\nstatement would need U_(0,0) to relative precision o(1), which no row\nof 6.3 supplies.\n\n**(c) The remaining components.** When the unit-disc condition fails, dividing G_(i,k,u) by\n2^omega(s_i(n)) produces a 1-bounded multiplicative function and the\nweight 2^omega(s_L(n))2^omega(s_R(n-2)) in the correlation; the review's\ncontrol a=(1,-1), w=(2,1) applies. Decomposing instead\ng_(i,k)(n)=sum_(d|s_i(n))mu(d)d^(i pi k/log x) gives divisor sums to\nmodulus up to x. The cutoff is restored only after the k-sum:\nsum_k c'_(i,k)d^(i pi k/log x)=rhohat_i(d), which vanishes for d>=b_i.\nAny termwise absolute-value step before that sum pays\nsum_(d|s)|mu(d)|=2^omega(s) per component; performing the k-sum first\nreturns the short divisor sum d=2, put n=r-4, J_2=12m, h=35/r,\nq=12/23 and\n\n\\[\n F_r=\\sum_{j=0}^{r}(-1)^j\\binom rj\\,\\chi\\!\\Bigl(\\frac{0.7j/r-0.22}{0.02}\\Bigr),\n \\qquad\n \\kappa=1-\\frac{24q^3}{1+q}=-\\frac{22957}{18515}=-1.23991\\ldots\n\\]\n\nThen F_r=(-1)^(J_2+1) 35 h^4 binom(n,J_2-1)(kappa+O(1/m)), and in\nparticular |F_r|>=2^(0.92 r) for all sufficiently large m.\n\n(ii) For all sufficiently large x there is a squarefree W_L-smooth\ns<=x^(0.71) with |F_L(s)|>=(1/2)|F_r|, r=35 floor(log_2 log x/70).\nConsequently\n\n\\[\n \\sup_{s\\le x/W_L,\\ s\\ W_L\\text{-smooth}}|F_L(s)|\\ \\ge\\ (\\log x)^{2/5}\n \\qquad(x\\ \\text{large}), \\tag{9}\n\\]\n\nand every family of functions f_j with |f_j|<=1 on that set and\nF_L=sum_j lambda_j f_j there has sum_j|lambda_j|>=(log x)^(2/5). The\nsame holds for n in J_x with s_L(n)=s and t_L(n)>1 prime, so\n|D_L(n)|>=(log x)^(2/5) log t_L(n) at such n.\n\n**Proof of (i).** The profile argument at j=J_2-l is\n(0.7(J_2-l)/r-0.22)/0.02=1-lh, so f(j):=chi(35j/r-11) equals 1\nfor j<=J_1=11m, 0 for j>=J_2, and f(J_2-l)=S(lh) for 0<=l<=m.\nWrite Delta f(j)=f(j+1)-f(j). Since\nsum_j(-1)^j binom(r,j)f(j)=(-1)^r Delta^r f(0) and\nDelta^r=Delta^(r-4)Delta^4, Vandermonde gives the exact identity\n\n\\[\n F_r=\\sum_{m'=0}^{n}(-1)^{m'}\\binom n{m'}g(m'),\\qquad\n g(m')=\\sum_{i=0}^{4}(-1)^{4-i}\\binom4i f(m'+i).\n\\]\n\ng vanishes for m'+4<=J_1 and for m'>=J_2. With m'=J_2-k,\ng_k:=g(J_2-k)=sum_(i<=4)(-1)^(4-i)binom(4,i)S((k-i)h), and\n\n\\[\n F_r=(-1)^{J_2+1}\\binom n{J_2-1}\\,35h^4\\,\\sigma_r,\\qquad\n \\sigma_r=\\sum_{k=1}^{J_2}(-1)^{k-1}\\rho_k\\tilde g_k,\\quad\n \\rho_k=\\frac{\\binom n{J_2-k}}{\\binom n{J_2-1}},\\quad\n \\tilde g_k=\\frac{g_k}{35h^4}.\n\\]\n\nThe validator checks this identity in exact rational arithmetic for\nm=2..8. Three bounds finish the proof.\n\n*Binomial ratios.* rho_k=prod_(i=1)^(k-1)(J_2-i)/(n-J_2+i+1), a product\nof decreasing factors, so rho_k<=q_r^(k-1) with\nq_r=(J_2-1)/(n-J_2+2)=(12m-1)/(23m-2), q_r-12/23=1/(23(23m-2)), and\nq_r<=0.523 for m>=2. Since J_2-1>=11m and n-J_2+2>=11m, each factor is\nat least q_r(1-2(i-1)/(11m)), hence rho_k>=q_r^(k-1)(1-2k^2/(11m)).\n\n*Fourth differences.* For 5<=k<=m all five points (k-i)h lie in [0,1],\nwhere S is a polynomial; the mean value theorem for finite differences\ngives g_k=h^4 S''''(xi) with xi in [(k-4)h,kh], and\nS''''(y)=840(1-12y+30y^2-20y^3) satisfies 840(1-12y)<=S''''(y)<=840\non [0,1] (the quadratic 20y^2-30y+12 has negative discriminant and\n10y^2(3-2y)>=0). Thus 24(1-12kh)<=tilde g_k<=24. For k<=4 direct\nexpansion gives tilde g_k=b_k+O(kh) with b=(1,12,23,24) and an\nabsolute constant (400 suffices for h<=1/10). For m=4. Then\nsum_(k>=1)(-1)^(k-1)q^(k-1)b_k=1-12q+23q^2-24q^3/(1+q)=kappa(q), and\nkappa(12/23)=kappa because 12q=23q^2 there. Combining the bounds,\n\n\\[\n |\\sigma_r-\\kappa|\\le\\sum_{k\\le m}q_r^{k-1}\n \\Bigl(\\frac{48k^2}{11m}+\\frac{400k}{m}\\Bigr)\n +|\\kappa(q_r)-\\kappa(12/23)|+O(q_r^m m^4)=O(1/m).\n\\]\n\nThe measured sigma_r/kappa is 1.00408 at m=400, consistent with an\nO(1/m) error. Finally binom(n,J_2-1)>=2^(nH(12/35))/(n+1) with the\nbinary entropy H(12/35)=0.9276..., so\n|F_r|>=35h^4 2^(0.9276(r-4))(r-3)^(-1)(|kappa|-O(1/m))>=2^(0.92r) for\nlarge m. The exact values grow with log_2|F_r|/r=0.888 at r=420.\n\n**Proof of (ii).** Let r=35 floor(log_2 log x/70), so\nr>=(1/2)log_2 log x-35 and 2^r<=(log x)^(1/2). Put P=x^(0.7/r). By the\nprime number theorem ([Tao, Notes 2, Corollary 39](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/))\npi(2P)-pi(P)>=r for large x, since P>=exp(0.7 log x/log_2 log x).\nTake r distinct primes p in [P,2P] and s=their product. Then s is\nsquarefree, each p<=2P<=W_L, and s<=(2P)^r=2^r x^(0.7)<=x^(0.71)<=x/W_L.\nThe exponents e_p=log p/log x satisfy |e_p-0.7/r|<=log 2/log x, so\nevery subset sum differs from the equal-exponent value by at most\nr log 2/log x. The profile is Lipschitz with constant\nmax|chi'|=35/16 in its argument, and the argument is the exponent sum\ndivided by 0.02; the rounded endpoints of section 2 move the argument\nby O(x^(-0.22)) uniformly for d<=x. Hence\n\n\\[\n |F_L(s)-F_r|\\le 2^r\\cdot\\frac{35}{16}\\cdot50\n \\Bigl(\\frac{r\\log2}{\\log x}+O(x^{-0.22})\\Bigr)\n \\le\\frac{76\\,r\\,2^r}{\\log x}+o(1)\\le\\frac12\n\\]\n\nfor large x, using 2^r<=(log x)^(1/2). Since |F_r|>=2^(0.92r)>=1,\n|F_L(s)|>=|F_r|/2>=2^(0.92r-1)>=2^(-34)(log x)^(0.46)>=(log x)^(2/5)\nfor large x. A prime t in (x/(2s),x/s] exists by the same theorem and\ngives n=st in J_x with s_L(n)=s. The norm statement follows because\nsum_j|lambda_j|>=|F_L(s)| at any single s. QED.\n\n**Scope.** (Read twice independently on 2026-09-08, by the handler and by reader V2; V2's exact recomputation of F_r for m<=300 measures the inequality |F_r|>=2^(0.92r) holding at every tested m>=130 and failing at every tested m<=120, so the onset of part (i) is near r=4400 and the threshold of (ii) sits at log_2 log x of order 10^4.) The bound is on the set of all W_L-smooth s<=x/W_L. A\nrepresentation valid only on inputs of density one is not excluded:\nthe witnesses have r~(1/2)log_2 log x prime factors in a short\nmultiplicative range and are sparse. Components bounded by a growing\nfunction are not excluded; the Fourier components g_k are bounded by\n2^omega and that is why (4) has bounded norm. The exponent 2/5 comes\nfrom the Chebyshev-level prime supply used here and is not optimal. The\nthreshold \"x large\" implied by these constants is astronomically large;\nnothing effective is claimed, and none is needed for the norm statement.\nAgainst the only quantitative cancellation rate in custody,\n(log X)^(-c/4) with c small and unspecified, a norm of (log x)^(2/5)\nis a net loss for every c<8/5, so no 1-bounded lift with an\nx-uniform coefficient bound can carry a Tao–Teravainen saving to F_L.\n\n### 6.6 Payoff for the full consumer\n\nNone. Equations (5)–(8) are exact re-expressions of the same residual;\n6.4 shows that estimating the components separately returns (3), and\nthat the only admitted component has an averaged bound of size\nx log^(2-d) x. Proposition 6.5 removes one route (bounded-norm\n1-bounded lifts) rather than adding an estimate. The sufficient\nmargins in the handoff, the moment's regional control and the\ncofactor transfer's restricted rate are unchanged.\n\n### 6.7 Files, commands, records\n\nOwned files: this note and\n[full-coefficient-average-validation.js](full-coefficient-average-validation.js),\nre-embedded with `node research/qc/embed.js research/full-coefficient-average-validation.js --force`\nafter the code change (all 38 previous figures reproduced; 4 lines added;\n2.6 s; no enumeration). New finite checks: c_0=3/5 on both sides and\nsum_k c_k=0; Ghat=-log n on all W-rough composites of the proxy window;\nthe exact junction identity for r=35m, m=2..8; the fourth-difference\nbounds for 5<=k<=m up to m=400; sigma_r/kappa at m=4,20,100,400; the\ngrowth of |F_r| to r=420. These test the ingredients of Proposition\n6.5 and the exact coefficients of 6.2; they do not test any asymptotic\ncorrelation statement. Source rereads: Klurman 1603.08453v1 (PDF\nSHA-256 matches the recorded hash), Theorem 1.3 and the definition of\nD_P on p. 3–4. Proposed shared-record text is in the lane report.\n\n### 6.8 Next move or reopening condition\n\nReopen this question only with one of: (a) a two-point statement for\nx-dependent multiplicative pairs bounded by 2 at primes, or for the\nrough indicators, with a main term and error o(x/log^2 x) under a\ncomposite or prime filter on both arguments; at (k,l)=(0,0) this is an\nasymptotic for both-rough composite pairs at exponents (0.24, 0.05),\nwhich is not a proved theorem in the inspected sources; (b) a\nrepresentation whose components are bounded by a function whose growth\nis paid explicitly against a named rate, since 1-bounded components\nwith bounded norm are excluded by 6.5; (c) an argument that treats the\nk-sum jointly with the correlation and provides an inequality beyond\nthe exact Type I reassembly examined here.\nRepeating any inspected theorem on a single component, or bounding\n|Rhat| termwise, has no payoff.\n\nHistory and superseded wording: research/history/CHANGELOG.md.\n"},"research/global-cutoff-averaging.md":{"lf_sha256":"f8206d9ab5ccab27134736947a4b49fb097a4af8a26b36b7b178b481baabf08f","content":"# Average the whole identity before isolating the corner\n\n\n\n**Twin-prime infinitude remains OPEN.** This is a change of representation\nand a derived one-point cancellation statement, not a signed improvement.\nIt revises the priority of extending the isolated corner. No claim is made\nthat it is the best possible proof route or a novel identity in the literature.\n\nBaseline: clean commit 3a15541, 2026-09-06. The cross-check used the current\nquestion/outcome registers, the arithmetic chain, the earlier\n[cross-campaign review](cross-campaign-synthesis.md), the proposal registry,\nand the owning arguments listed in section 6. It is not a fresh independent\naudit of every archived manuscript, script or imported theorem.\n\n## 1. The distinction that changes the next question\n\nSmoothing only the isolated corner leaves a sharp-to-smooth transition and\nE_out. Both are open at the required signed precision. The sharp transition\nhas a non-negligible squared norm for sufficiently small fixed eta.\n\nInstead, the initial Vaughan cutoffs are choices in an identity for the\n**same** twin count. Average those identities while their already-proved\nType I estimates hold uniformly. The resulting full smooth remainder\nrepresents the original count; there is no need to restore a chosen sharp\ncorner. The arithmetic previously in E_out is included, not discarded.\n\nThis is a different operation from averaging the corner cutoffs\nD_L approximately x^(19/25-2eta) and D_R approximately x^(19/20-2eta).\nThe cutoffs averaged below are the much smaller initial U and Y.\n\n## 2. A uniform family of complete reductions\n\nKeep x dyadic, J_x=(x/2,x], V=floor(x^(6/25)), Z=floor(x^(1/20)),\nand C2 as in [prime-detection-spec.md](prime-detection-spec.md).\nChoose integers\n\n\\[\n a_L=\\lfloor x^{11/50}\\rfloor,\\quad b_L=\\lfloor x^{6/25}\\rfloor,\n \\qquad\n a_R=\\lfloor x^{1/25}\\rfloor,\\quad b_R=\\lfloor x^{1/20}\\rfloor .\n \\tag{1}\n\\]\n\nFor real u in [a_L,b_L] and v in [a_R,b_R], use the exact cuts d>u,\ne>v in the two Vaughan expansions, leaving V,Z fixed. For integer\ndivisors these are the cuts floor(u), floor(v). Define\n\n\\[\n C_{u,V}(m)=\\sum_{\\substack{d\\mid m\\\\d>u}}\\mu(d)\\beta_V(m/d),\n \\qquad\n R_{u,v}(x)=\\sum_{n\\in J_x}C_{u,V}(n)C_{v,Z}(n-2). \\tag{2}\n\\]\n\nThen, for every fixed A>0,\n\n\\[\n S(x)=C_2x+R_{u,v}(x)+O_A(x/\\log^A x), \\tag{3}\n\\]\n\n**uniformly over the whole rectangle of u,v.** Here is the uniformity\ncheck against the owning proofs, rather than an assumption that any\nchoice of cutoff works.\n\n| part of the existing reduction | largest support or smallest length | fixed margin |\n|---|---|---|\n| first prime BV Type I sums | floor(u)V <= b_L V <= x^(12/25) | below x^(1/2) by exponent 1/50 |\n| comparison term with b(n) | nonempty Mobius intervals have length scale T=x/k > a_L | the uniform mean in polylog-fold-transfer section 4 applies at endpoints at least a_L, a fixed power of x |\n| second Mobius BV Type I sums | introduced modulus <= b_R Z <= x^(1/10); T=x/k > a_L | sqrt(T) is at least a constant times x^(11/100), leaving exponent margin 1/100 |\n| nonprimitive congruences | the same gcd 1, gcd 2 and odd-lift cases as before | the bounded parity reduction and intervals T or T/2 leave those fixed margins intact |\n\nThe coefficient bounds used in the first and second Type I sums remain\n|c(d)|<=log d. Their endpoint maxima already include the varying lower\ncuts; summing beta_V(k) x/k costs only fixed logarithms. Thus the arbitrary\nlogarithmic precision of each imported estimate absorbs the same losses\nuniformly, with constants depending on A and the fixed exponents in (1).\nNo x-dependent epsilon or shrinking power margin is used.\n\nThe proofs being extended are\n[prime-detection-spec.md](prime-detection-spec.md) sections 2–4,\n[polylog-fold-transfer.md](polylog-fold-transfer.md) section 4 and\n[shifted-prime-decomposition.md](shifted-prime-decomposition.md)\nsections 2–4. The latter's Mobius BV input has its own owning derivation\nin [mobius-bv-derivation.md](mobius-bv-derivation.md); it is not assumed\nfrom a citation to a prime BV theorem.\n\nThe primary Vaughan identity and prime BV statement were rechecked in\n[Tao, Notes 3, Lemma 18 and Theorem 17](https://terrytao.wordpress.com/2015/01/10/254a-notes-3-the-large-sieve-and-the-bombieri-vinogradov-theorem/).\nTheir complete analytic proofs are not newly audited here.\n\n## 3. The averaged global coefficient and exact bookkeeping\n\nFor i=L,R put L_i=log(b_i/a_i) and\n\n\\[\n \\rho_i(d)=\n \\begin{cases}\n 1,&d\\le a_i,\\\\\n \\log(b_i/d)/L_i,&a_iu) du/u. Independent\nprobability measures on the two cutoff intervals therefore give\n\n\\[\n \\langle R_{u,v}(x)\\rangle_{u,v}\n =\\sum_{n\\in J_x}G_L(n)G_R(n-2)=:\\mathcal R(x). \\tag{5}\n\\]\n\nAveraging (3), using its uniform error, yields\n\n\\[\n \\boxed{S(x)=C_2x+\\mathcal R(x)+O_A(x/\\log^A x).} \\tag{6}\n\\]\n\nThe main term is unchanged because the left side of each averaged identity\nis the same S(x). This is not a positive average over translations of the\nprimes, and it does not assume that good sets of x intersect.\n\nAll divisors, nonsquarefree integers, prime powers inside beta, strict\ncuts and shifted endpoints are retained. There is no separate T or E_out\nin (6). Relative to the existing fixed-cut reduction,\nmathcal R=E_dagger+O_A(x/log^A x); this is a comparison of the complete\nsigned sums, not a termwise deletion of E_out or an extension of the\nprevious controlled geometric region.\n\nFor another exact check, if rho is any cutoff profile, write mu_rho(d)\n=mu(d)rho(d) and mu_h=mu-mu_rho. Dirichlet convolution gives\n\n\\[\n \\Lambda=\\Lambda_{\\le W}+\\mu_\\rho*\\log\n -\\mu_\\rho*\\Lambda_{\\le W}*1\n +\\mu_h*\\Lambda_{>W}*1. \\tag{7}\n\\]\n\nIndeed log=Lambda*1 and mu*1=delta, so the right side collapses to\nLambda_(<=W)+Lambda_(>W). The analytic uniformity above requires the\nspecified profiles and supports; (7) alone proves no estimate.\n\n## 4. What the full coefficient norm buys\n\nPut F_i(m)=sum_(d|m) mu(d)rho_i(d). Exactly,\n\n\\[\n G_i(n)=-\\sum_{\\substack{r\\mid n\\\\r>W_i,\\ r=a_i and L_i>=1,\nsum_(a_ib_i, so the corresponding part of (4) has h_i(d)=1. Thus\n\n\\[\n G_i=C_i+B_i,\\qquad\n B_i(m)=\\sum_{\\substack{d\\mid m\\\\d\\le D_i}}\n \\mu(d)h_i(d)\\beta_{W_i}(m/d). \\tag{10}\n\\]\n\nOn I_L=J_x and I_R=J_x-2 the owning sharp estimate has\n||C_i||_2^2=Theta_eta(x log^2 x), while (9) has\n||G_i||_2^2=O(x log x). Hence, by Cauchy,\n\n\\[\n \\langle C_i,B_i\\rangle\n =-\\|C_i\\|_2^2+\\langle C_i,G_i\\rangle\n =-\\|C_i\\|_2^2+O_\\eta(x\\log^{3/2}x). \\tag{11}\n\\]\n\nIn particular the ratio of this cross term to ||C_i||_2^2 tends to -1.\nMuch of the corner's one-point energy is canceled by the rest of the\nsame full coefficient. Treating the corner as the whole problem can\ndiscard that cancellation.\n\n**This is not a shift-2 assertion.** Neither (11) nor its norm proof\nestimates C_L(n)B_R(n-2), B_L(n)C_R(n-2), or mathcal R. Replacing a\ncommon input by two shifted inputs is precisely the unproved step.\n\n## 5. The next attempt and what would count as success\n\nThe subsequent [smooth-majorant note](global-smooth-majorant.md)\ngives an absolute O(x) bound for a C3 probability profile inside\nthe same uniform rectangle. This is a different admissible pair;\nonly the complete signed residual is transferred to arbitrary\nlogarithmic precision. The signed or sufficient-constant estimate remains OPEN.\n\nResearch judgment: prioritize a bounded signed attempt on the global pair\nG_L(n),G_R(n-2), allowing the two initial profiles to vary within explicitly\nadmissible supports. Keep cofactor sums inside the coefficient until a\njustified inequality is applied. The new small-cofactor transfer remains\na possible ingredient; it is not automatically applicable to G_i, which\nis neither 1-bounded nor multiplicative.\n\nThe consumer is a one-sided lower bound: for some fixed c,K>0 on an\nunbounded common set of dyadic scales,\n\n\\[\n \\mathcal R(x)\\ge -C_2x+\\frac{c x}{\\log^K x}. \\tag{12}\n\\]\n\nEquation (6), with A>K, then implies twins. A justified signed scale\naverage can also serve; retain its rate and positivity implication.\nThe stronger mathcal R=o(x) would give the full weighted main term\nand is not a necessary research requirement.\n\nThe [first factor-sign attempt](global-factor-signs.md) now gives an exact\nsmall-prime formula, pays its exceptional prime-power contribution,\nand refutes a pair-trigger negative-part majorant. Continue from its\nfull signed cofactor sum and explicit prime-filter correction to seek\nan estimate at scale x. The positive part may have to be retained:\nan unsigned negative-part bound is sufficient, not necessary. A norm bound\nof O(x log x), or a relative logarithmic saving too small to reach scale x,\ndoes not meet (12). No choice of profile is certified to do so.\n\nThe immediate falsifiers are a failed uniform BV margin, a changed main\nterm when averaging, an omitted r=n correction, or an unretained piece in\n(10). These have analytic derivations above and finite controls below.\nAn eventual signed attempt must separately test its proposed inequality\non admissible factor configurations and price all its terms.\n\n## 6. Why this precedes the other routes in the current corpus\n\n| candidate | checked reason for its current priority |\n|---|---|\n| Extend small cofactors term by term | The two priced losses in cofactor-progression-transfer remain: power-sized moduli and accumulated cofactor cost; its restricted rate is still weaker than o(x). |\n| Shrink eta with x | reachability-coverage section 2.5 leaves x^epsilon constants unpaid; shrinking geometry does not control its signed mass. No uniform repair is supplied here. |\n| Smooth only the isolated corner | The norm transition is non-negligible; sections 2–4 above instead average the whole identity in an admissible initial-cutoff range. |\n| Use a better prime-detecting weight | chen-opportunity-audit identifies a real removable penalty, already removed in prime-detection-spec. The present use of profile freedom stays within that complete consumer; a generic optimization is not itself a new estimate. |\n| Return to anchored survival or fold transport | The anchored survivor implication is valid, but no new anchor-specific lower bound is supplied. The exact transport evaluator does not supply the missing recurrence. Those missing inputs are not refuted just because this arithmetic route is pursued first. |\n| Demand generic Type I/II control | Ford–Maynard's source theorem concerns specified uniform coefficient classes. The actual-coefficient estimate here does not imply those hypotheses; their prime-free examples are not a universal obstruction to this task. |\n\nSources checked for the last two comparisons: the relevant proofs and\nlimits in [paper/anchored-note.md](../paper/anchored-note.md),\n[the transport proposal](../paper/proposals/prop-tailcount-transport.md),\n[chen-opportunity-audit.md](chen-opportunity-audit.md), and\n[Ford–Maynard v1, Theorem 2.1](https://arxiv.org/html/2407.14368v1).\nNo proposal grade, novelty assessment or publication status is changed.\n\n[global-cutoff-averaging-validation.js](global-cutoff-averaging-validation.js)\nchecks exact finite coefficient identities using integer prime-log vectors,\nindependent cutoff averaging, the complete two-expansion product identity,\nand controls for omitted prime powers, r=n and lower-divisor complements.\nNo finite output is a test of the asymptotic estimates or a twin margin.\n\nThe finite fixture uses rational averages of integer cutoffs, an exact\nfinite counterpart of (5) and (7), rather than pretending to test the\nasymptotic exponent range at a small x. The analytic extension and the\nsame-input comparison have been self-audited here; independent\nmathematical review remains appropriate before relying on them downstream.\n\nVerification on 2026-09-06: the finite validator passed;\nstrict QC with index regeneration reported zero findings; the verifier's\n58 positive and 47 negative controls passed; the numerical audit passed\nall 251 checks; git diff --check was clean. The embedding tool initially\nrequired an output banner; a later descriptive label correction was\nre-embedded with its recorded override and no numerical change. These\nmechanical checks do not certify the analytic derivation.\n"},"research/global-factor-signs.md":{"lf_sha256":"0a4f04bf5337a649add37617cc3189ebeb0327bb4dcd5bc7e0050f7c7c6b678d","content":"# Factor signs in the complete global remainder\n\n\n\n**Twin-prime infinitude remains OPEN; this attempt gives no improved\nsigned bound.** It derives a factor formula and pays its exceptional\nterms, then refutes a particular proposed upper bound on negative mass.\nThe next estimate is stated with the full small-prime sum and the prime\nfilters intact. This is not a novelty claim.\n\nBaseline: commit 689dac9, 2026-09-06. The parameters, uniform global\nidentity and consumer are those of\n[global-cutoff-averaging.md](global-cutoff-averaging.md). In particular\nW_L=b_L=floor(x^(6/25)), W_R=b_R=floor(x^(1/20)), and\nF_i(m)=sum_(d|m) mu(d) rho_i(d). All assertions below concern sufficiently\nlarge x, so both inputs in J_x and J_x-2 exceed both W_i.\n\n## 1. Exact factor formula, including the exceptional term\n\nSuppress the side index. Factor uniquely\n\n\\[\n n=s_W(n)t_W(n),\\qquad\n s_W(n)=\\prod_{p\\le W}p^{v_p(n)},\\qquad\n t_W(n)=\\prod_{p>W}p^{v_p(n)}.\n \\tag{1}\n\\]\n\nWrite s=s_W(n), t=t_W(n), and H_W(n)=log t. Empty products are one.\nSince rho(d)=0 for d>=b=W, no nonzero divisor term in F contains a\nprime exceeding W. Consequently F(n)=F(s), including repeated prime\nfactors, and\n\n\\[\n F(s)=\\sum_{A\\subseteq\\{p:p\\mid s\\}}\n (-1)^{|A|}\\rho\\left(\\prod_{p\\in A}p\\right).\n \\tag{2}\n\\]\n\nThis is the complete subset sum, not a truncation by the number of\nprime factors. F depends only on the radical of s.\n\nThe convolution identity in the preceding note also reads\n\n\\[\n G(n)=\\Lambda_{>W}(n)-\n \\sum_{\\substack{r\\mid n\\\\r>W}}\\Lambda(r)F(n/r).\n \\tag{3}\n\\]\n\nFor r=p^j with p>W, removing any number of copies of p leaves F\nunchanged. The sum of their Lambda weights is log t. Thus exactly,\n\n\\[\n \\boxed{G(n)=\\Lambda_{>W}(n)-H_W(n)F(s)-E_W(n),}\n \\qquad\n E_W(n)=\\sum_{\\substack{p\\le W,\\ j\\ge2\\\\p^j\\mid n,\\ p^j>W}}\n (\\log p) F(n/p^j).\n \\tag{4}\n\\]\n\nNo prime powers inside beta were replaced by primes. The Lambda term\nis the r=n correction; in particular G(p)=0 at every prime.\n\nCall n regular for W when p^(v_p(n))<=W for every p<=W dividing n.\nThen E_W(n)=0. On a regular composite which is not a prime power,\n\n\\[\n G(n)=-(\\log t)F(s). \\tag{5}\n\\]\n\nFor a regular proper prime power n=p^k>W, necessarily p>W, and\nG(n)=-(k-1)log p. Therefore it too has the negative sign of -F(s),\nsince s=1 and F(1)=1. These inputs must not be assigned -k log p\nwithout an error calculation.\n\nThus, on regular composite inputs with t>1, a negative coefficient\nproduct occurs exactly when the two F values have opposite signs.\nThe positive rough weights only change its size. Primes have zero\nG; smooth inputs with t=1 and regularity also have zero G. This\nclassification includes all regular squareful composites.\n\n## 2. The exceptional terms have a power saving on the full pair\n\nFor each prime p<=W let k(p) be the least integer with p^k(p)>W.\nThen k(p)>=2 and every irregular n is divisible by some p^k(p).\nSplit the reciprocal sum at sqrt(W). For p<=sqrt(W), each summand\nis less than 1/W and there are at most sqrt(W) choices. For larger p,\nk(p)=2, and the sum is bounded by the tail of sum_(m>sqrt(W)) m^-2.\nHence, using only the union bound,\n\n\\[\n \\#\\{n\\le x:n\\text{ irregular for }W\\}\n \\le x\\sum_{p\\le W}p^{-k(p)}\\ll xW^{-1/2}. \\tag{6}\n\\]\n\nThere is no squarefree restriction on the remaining integers.\nPointwise beta_W(m)<=log m, |F(m)|<=tau(m), and the definition of G\ngives |G(n)|<=tau(n)log n. Also |H_W(n)F(s)|<=tau(n)log n and\n|E_W(n)|<=tau(n)log n by summing the prime-power Lambda weights.\nThe elementary divisor bound tau(n)<<_epsilon n^epsilon therefore\npays the difference of full products on the union of the two\nexceptional sets:\n\n\\[\n O_\\epsilon\\left(x^{39/40+\\epsilon}\\right). \\tag{7}\n\\]\n\nHere the worse cutoff is W_R approximately x^(1/20); absorb both\npointwise divisor factors and logarithms into the displayed epsilon.\nThe number of proper prime powers up to x is O(sqrt(x) log x),\nby summing the integer bases for exponents at least two. Their\nfull product correction is O_epsilon(x^(1/2+epsilon)), also within\n(7). The same reasoning applies to positive and negative parts,\nsince z -> max(z,0) is Lipschitz with constant one.\n\nFor clarity define the explicit all-input coefficient\n\n\\[\n D_i(n)=H_{W_i}(n)F_i(s_i(n)),\\qquad\n C_i^{\\rm comp}(n)=\\mathbf1_{\\{n\\ {\\rm composite}\\}}D_i(n).\n \\tag{8}\n\\]\n\nThis C^comp is not the sharp corner coefficient C in the previous\nnotes. Equations (4)--(7) give the full statement\n\n\\[\n \\mathcal R(x)=\n \\sum_{n\\in J_x} C_L^{\\rm comp}(n)C_R^{\\rm comp}(n-2)\n +O_\\epsilon(x^{39/40+\\epsilon}). \\tag{9}\n\\]\n\nFix any epsilon<1/40 when consuming this error; it is then smaller\nthan x/log^A x for every fixed A. No irregular, squareful, or\nprime-power term is silently discarded.\n\n## 3. A proposed pair-trigger majorant fails\n\nA natural first attempt was to charge F(s)^-=max(-F(s),0) to pairs\nof small primes whose product crosses the initial cutoff. A concrete\nversion would require some fixed K with\n\n\\[\n F(s)^-\\ \\le\\\n K\\sum_{\\substack{pa\\}}. \\tag{10}\n\\]\n\nEven restricting the individual primes to p<=a does not repair\nthis inequality.\n\nTake ten distinct small primes such that every triple product is\nbelow a and every quadruple product is above b. All the divisor\nprofile values in (2) are then zero or one, and\n\n\\[\n F(s)=1-10+45-120=-84. \\tag{11}\n\\]\n\nEvery pair is below a, so the right side of (10) is zero for every\nK. For n=sq with q>W prime and all ten small primes <=W, (4)\ngives G(n)=84 log q. This is a positive coefficient caused by\nhigher-order subset cancellation, not by a pair crossing a.\n\nThe configuration fits strict margins in the actual left exponent\nranges: choose the ten prime exponents in (.069,.071). Triple\nproducts have exponent at most .213<.22, and quadruple products\nhave exponent at least .276>.24. Their product has exponent in\n(.69,.71), leaving a large prime cofactor near exponent .30,\nabove .24. The usual [prime number theorem, Tao Notes 2, (3)](https://terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/)\nsupplies distinct primes\nin these fixed power intervals and a prime q in\n(x/(2s),x/s] for sufficiently large x. Only this existence statement\nuses that standard input; no shifted occurrence or density is\nclaimed. Floors preserve the strict margins eventually.\n\nAn independent finite integer instance uses the ten primes\n101,103,107,109,113,127,131,137,139,149, with a=4,000,000,\nb=W=6,000,000 and q=10,000,019. The validator checks primality,\nall subsets, (11), and the zero pair count exactly with integer\narithmetic. These finite cutoffs are a proxy; the exponent argument\nabove gives the separate asymptotic admissibility check.\n\nThis refutes (10) and any bound that vanishes whenever all pairs\nare below a. It does not refute a higher-order majorant, a\ndifferent signed inequality, or the use of small-prime structure.\nNor does the single-input cell prove that it occurs together with\na particular factorization of n-2.\n\n## 4. A valid negative-part inequality and its missing estimate\n\nThe [switching follow-up](switching-negative-mass.md) now proves\nthat the negative-only target (15) below is false at the present\ncutoffs: an actual composite-filtered family already has negative\nmass with liminf at least kappa*C2*x, kappa>3/2. This holds for\nboth the linear and C3 profiles. The inequalities and prime-filter\nalgebra here remain valid; use the net consumer retaining P_comp.\n\nLet P_G and N_G be the positive and negative parts of the original\nfull G product. Define D_i^+=max(D_i,0), D_i^-=max(-D_i,0), and\n\n\\[\n N_D(x)=\\sum_{n\\in J_x}\n \\big[D_L^-(n)D_R^+(n-2)+D_L^+(n)D_R^-(n-2)\\big].\n \\tag{12}\n\\]\n\nRemoving the prime inputs in (8) gives the exact correction\n\n\\[\n \\begin{split}\n A_{\\rm pr}(x)={}&\n \\sum_{\\substack{n\\in J_x\\\\n\\ {\\rm prime}}}\n (\\log n)D_R^-(n-2)\\\\\n &+\\sum_{\\substack{n\\in J_x\\\\n-2\\ {\\rm prime}}}\n (\\log(n-2))D_L^-(n).\n \\end{split} \\tag{13}\n\\]\n\nBoth primes exceed the cutoffs, so D_i(p)=log p. A double-prime\ninput contributes zero to (12) and to (13); there is no missing\nintersection correction. Therefore\n\n\\[\n N_G=N_D-A_{\\rm pr}+O_\\epsilon(x^{39/40+\\epsilon}),\\qquad\n N_G\\le N_D+O_\\epsilon(x^{39/40+\\epsilon}). \\tag{14}\n\\]\n\nThis is a valid upper bound, not the desired bound. To use the\nnegative part alone, one would still need, for fixed c,K>0 on\nunbounded common dyadics, for example\n\n\\[\n N_D-A_{\\rm pr}\\le C_2x-cx/\\log^K x. \\tag{15}\n\\]\n\nMore generally retain the corresponding composite positive sum\nP_comp from (9) and prove\nN_D-A_pr-P_comp <= C2*x-c*x/log^K x. Its error is already paid.\nNeither inequality is established here.\n\nThe available linear Type I estimates do not evaluate (12) or\n(13): taking a positive or negative part of a divisor sum is\nnonlinear. Replacing F^- by a short signed divisor polynomial\nrequires a pointwise bound with a stated remainder and support.\nNo such replacement has been supplied. The support of the original\nlinear F cannot simply be assigned to its negative part.\n\n## 5. Full cofactor form and the next bounded question\n\nThe subsequent [smooth-majorant argument](global-smooth-majorant.md)\ncompletes a higher-order bound: a different C3 admissible profile\nhas full absolute O(x) mass. The cofactor formula below remains\nvalid for that profile, with hats; its signed constant is OPEN.\n\nFor any s,t let F_L(s),F_R(t) keep their complete subset sums.\nThe main sum in (9) is exactly\n\n\\[\n \\sum_{\\substack{su-tv=2,\\ su\\in J_x\\\\\n P^+(s)\\le W_LW_i\nis strictly greater than x^(w_i), and the products are at most x.\nThis does not bound the number of prime factors in s or t.\n\nThe remaining signed question is whether a signed Buchstab decomposition\nof the rough factors in (16), or a justified majorant/minorant of\nthe full F sums, can price the mixed-sign mass together with (13)\nand retained positive mass at scale x. Keep the small-cofactor sum\ninside until the new inequality is justified. A calculation on only\ntwo or three small factors is not a full estimate; it needs a\nbound for everything omitted. The subsequent absolute O(x) bound,\nwithout a sufficient constant or signed improvement, does not meet\nthe consumer.\n\nChanging admissible averaging profiles changes this sign\ndecomposition, but their full signed residuals all equal\nS-C2*x+O_A(x/log^A x) by the uniform global reduction. Thus choosing\na profile can facilitate an estimate; it cannot be asserted to\nimprove the underlying signed total.\n\n## 6. Falsification and reproducibility\n\n[global-factor-signs-validation.js](global-factor-signs-validation.js)\nchecks the actual logarithmic ramp using exact integer polynomials\nin formal prime logarithms, after multiplying by log(b/a). It\ncompares the original divisor convolution against (4), checks the\nprime zeros and large-prime-power correction, and tests (9) exactly\noff its explicitly identified exceptional sets. Squareful regular\ninputs are retained. It also exercises active failures when E or\nthe prime correction is omitted. Positive/negative splits in the\nsmall scan use floating evaluation, separately labeled; the\nten-prime counterexample uses exact integers.\n\nThe new algebra would fail on a mismatch in these identities;\nthose finite tests passed. The uniform error claim is supported\nby (6) and the pointwise divisor bounds, not by fitting finite\ncounts. The pair-trigger inequality has an explicit counterexample.\nNo asymptotic sign density, estimate for (15), or sufficient twin\nmargin is tested or claimed by this script.\n"},"research/global-smooth-majorant.md":{"lf_sha256":"a29d64a062cdca5fa5548bc59c037ffb364da27c9f0c2c23f224a5b705ee9bc9","content":"# A full absolute bound with a smoother admissible profile\n\n\n\n**The sufficient twin-prime margin remains OPEN.** This note derives an\nabsolute O(x) bound for a complete global remainder after changing the\nadmissible averaging profile. Its implied constant is not a usable\ncomparison with C2. The signed remainder already had an O(x) bound;\nthe change is that its separate positive and negative masses now have\nthat bound as well, in this representation.\n\nBaseline: commit 204e7e1, 2026-09-06. The first attempt in\n[global-factor-signs.md](global-factor-signs.md) retains all small-prime\nsubsets and pays the exceptional terms. Its pair-trigger majorant fails.\nHere the full factor sum is bounded with three finite differences,\nwithout truncating the number of factors in either input.\nNo novelty or optimality claim is made.\nThe finite-difference mechanism has an explicit prior-art match in\nGranville--Koukoulopoulos--Maynard; see the source comparison in section 7.\n\n## 1. Change the initial probability average, preserving the global identity\n\nKeep exactly the parameters of\n[global-cutoff-averaging.md](global-cutoff-averaging.md):\n\n\\[\n (a_L,b_L,W_L)=(\\lfloor x^{.22}\\rfloor,\\lfloor x^{.24}\\rfloor,\n \\lfloor x^{.24}\\rfloor),\\qquad\n (a_R,b_R,W_R)=(\\lfloor x^{.04}\\rfloor,\\lfloor x^{.05}\\rfloor,\n \\lfloor x^{.05}\\rfloor).\n \\tag{1}\n\\]\n\nLet L_i=log(b_i/a_i), T=log x, and use the decreasing profile\n\n\\[\n \\chi(t)=\n \\begin{cases}\n 1,&t\\le0,\\\\\n 1-35t^4+84t^5-70t^6+20t^7,&0=1 let p_1<...0 and M_0=1. There are 2^(r-k)\nremaining divisors. Since L_L/T tends to .02 and L_R/T to .01,\ntake C_i=max_(0<=k<=3) M_k (T/L_i)^k/2^k with a fixed eventual\nupper bound. This proves (6), including r=0,1,2. When r>3 every\nremaining factor stays in the divisor sum before the inequality.\nPrime divisors above W_i cause no problem in (7); the same derivative\nbound applies even when a step spans the whole taper.\n\nThis argument needs the new smoothness. The earlier logarithmic\nprofile does not have three bounded derivatives. The ten-prime\ncounterexample survives here: its profile samples lie entirely on\nthe constant parts, so Fhat=-84 there too. Smoothness does not make\nFhat nonnegative.\n\n## 3. The majorant has bounded harmonic mass\n\nThe key elementary estimate is\n\n\\[\n \\sum_{m\\le x}\\frac{w_T(m)}m\\ll1,\\qquad T=\\log x. \\tag{8}\n\\]\n\nUse the standard Mertens estimates, in the forms\n\n\\[\n \\sum_{p\\le z}\\frac{\\log p}{p-1}\\ll\\log z,\\qquad\n \\prod_{r=1) p^(-a)=1/(p-1); powers are retained.\n\nFor omega(m)>=3, fix the first three primes p=1.\n\nFor these two irreducible linear forms the corrected theorem gives\n\n\\[\n \\sum_{n\\in J_x}w_T(n)w_T(n-2)\n \\ll x\\prod_{2log 7,\nw_T(210)>w_T(30)w_T(7); the fourth small prime is not another\nsmall ell factor in (5). The source's Euler-product corollaries\nand New Theorem 6 cannot replace the general upper theorem here.\nNo lower estimate is imported.\n\n## 5. Consume the bound on the full global coefficients\n\nThe factor formula and exceptional-set proof in\n[global-factor-signs.md](global-factor-signs.md) use only\n0<=rho<=1, rho(1)=1 and support d<=b=W, all retained by (2).\nThus its complete prime and prime-power accounting applies verbatim\nwith hats. In particular, for C_i^comp(n)=1_(n composite)\nFhat_i(n) log(t_i(n)),\n\n\\[\n \\sum_{n\\in J_x}|\\widehat G_L(n)\\widehat G_R(n-2)|\n \\le \\sum_{n\\in J_x}|C_L^{\\rm comp}(n)C_R^{\\rm comp}(n-2)|\n +O_\\epsilon(x^{39/40+\\epsilon})\n \\le T^2\\sum_{n\\in J_x}|\\widehat F_L(n)\\widehat F_R(n-2)|\n +O_\\epsilon(x^{39/40+\\epsilon})\n \\ll x. \\tag{15}\n\\]\n\nFix epsilon<1/40. The second inequality deliberately enlarges a\nnonnegative sum by dropping the prime filters. It is an upper bound,\nnot an identity and not a sign-preserving replacement. No small\ncofactor, large-factor branch, squareful input or outside residual\nis left unpaid.\n\nWriting Phat and Nhat for the separate positive and negative masses,\n\n\\[\n \\widehat P+\\widehat N\\ll x,\\qquad\n S=C_2x+\\widehat P-\\widehat N+O_A(x/\\log^A x). \\tag{16}\n\\]\n\nThis is the payoff of the attempt. The earlier one-point Cauchy budget\nwas O(x log x), whereas (15) uses a shifted upper theorem and a\ndifferent allowed profile to pay the complete absolute mass at O(x).\nIt gives neither Phat-Nhat=o(x) nor a favorable constant lower bound.\nThe existing signed O(x) estimate is not being claimed again as new.\n\n## 6. What remains, and what not to repeat\n\nRead [smooth-sieve-literature.md](smooth-sieve-literature.md) before the\nnext attempt. It matches the existing concentration, optimization and\nshifted-divisor results and derives a full small-prime tail bound from\nthe corrected upper theorem. That permits a specified factor-family\nattempt with an error budget; it does not supply the signed margin.\n\nThe sufficient next input is still, for some fixed c,K>0 on unbounded\ncommon dyadics,\n\n\\[\n \\widehat N-\\widehat P\n \\le C_2x-cx/\\log^K x. \\tag{17}\n\\]\n\nThe [switching follow-up](switching-negative-mass.md) now derives\nliminf Nhat/(C2*x)>3/2, already on a three-prime/rough-composite\nfamily. Thus a negative-only constant below C2 is impossible for\nthese cutoffs; improving the same upper majorant cannot supply it.\nThe witness also survives every fixed delta<1/50 and every profile\nwith the same plateaus. The full identity forces positive mass\nwith liminf Phat/(C2*x)>1/2, without improving the net margin.\n\nThe next bounded question must compare the signs in (17), retaining\nprime exclusions and the complement. A justified signed scale average\nremains permitted. Repeating the absolute-order estimate, estimating\nall negative terms while discarding positive ones, or replacing the\nenvelope by its prime-value Euler product will not supply (17).\n\nThe previous pair-trigger closure is unchanged. The failed direct\nsmall-cofactor theorem interface is not reopened by this argument:\nwe apply a different upper theorem to an explicitly proved majorant,\nnot a bounded-multiplicative correlation theorem to Ghat.\n\n## 7. Checks and source-search scope\n\n[global-smooth-majorant-validation.js](global-smooth-majorant-validation.js)\nchecks the profile polynomial and density, endpoint derivatives,\nthe full subset-pairing identity, derivative envelope, squareful\ninputs, uniform growth inequality, prime-power convention, the\nnonmultiplicativity witness, a finite first-three-prime Euler grouping,\nand the corrected root-density bound with active controls.\nIt uses integer additive-log proxies for exact finite arithmetic.\nIt does not numerically test real-log asymptotics, the imported theorem,\nthe O(x) constant, or a signed twin margin.\n\nA failure of uniform growth, the harmonic estimate, the source\nhypotheses, or the complete prime-power transfer would invalidate\n(15). Each has a written check above; the finite controls do not\nsubstitute for those arguments.\n\nThe scoped lookup used absolute moments of truncated divisor sums,\nBarban--Vehov weights, sieve-weight smoothings, and Nair--Tenenbaum\nupper bounds. The originality check on 2026-09-06 found a direct match\nin Granville--Koukoulopoulos--Maynard's\n[smoothing paper, section 1.2, equations (1.6)--(1.7)](https://arxiv.org/html/1606.06781v4#S1.SS2):\npairing the smallest prime factors gives iterated finite differences,\nwith an integral formula in terms of the corresponding derivative.\nThese are exact identities, even though that section also discusses\nheuristic consequences.\n\nFor the notation match, set R=b_i and\nf(z)=chi((z log b_i-log a_i)/L_i). Then their M_f(n;R) is exactly\nFhat_i(n). Take r=min(3,omega(n)) in their identities and bound the\nremaining squarefree divisor sum by its number of terms. This recovers\nthe pointwise derivative estimate used in section 2. The derivative\nconstants are uniform because log(b_i)/L_i stays bounded. Thus the\ncore finite-difference mechanism is established prior art.\n\nHenriot's corrected nonmultiplicative upper theorem remains the matched\nshifted import. The bounded harmonic majorant, source-class verification\nand complete Ghat transfer are the application derived here. Their\ncombination is not assigned a literature-novelty grade: this check\nneither establishes that the complete bound (15) is stated elsewhere\nnor that it is absent. The justified assessment is an application of\nestablished techniques with a local improvement over this project's\nearlier absolute budget. The conclusion concerns this remainder\nrepresentation; it supplies no stronger bound on the count of twin primes.\nThe search does not establish exhaustion of signed approaches.\n"},"research/history/staging/attack-0829n-X-upper.md":{"lf_sha256":"7a9c609e31908822b22fab02f183e6066d1c11b48b3ef0dba9f399787d0a168e","content":"# An unconditional upper bound on the rough-pair census X(K) by Selberg's Λ² sieve on the stretch window: a theorem with every constant explicit, loose against exact X(K) by 7.8 to 10.1 at the band depths, and a level the window holds below z² so the sifting parameter never reaches s = 2\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-zone.md` A7, which\n> reproduced every band sum, tier ratio, D_max and the flat 378100.0 digit\n> for digit on independent code).** §0 item 2's and the ledger's\n> \"s_max 1.81 → 1.96\" is REFUTED as written, since the arrow reads B3→B8\n> everywhere else in this note: the values are 1.8106, 1.9612, 1.9538,\n> 1.9288, 1.9149, 1.8542, not monotone, peaking at B4 with B8 at 1.85 (§5\n> here already contradicts §0). Read instead: \"s_max reads 1.81 at B3,\n> peaks at 1.96 at B4 and falls to 1.85 at B8; the maximum over the six\n> bands is 1.96 and the level is below z² at every band.\" The mathematics\n> is unaffected. Also A8: the wrong-direction guard forbids the CLAIM that\n> X < T, not the computation of a crossing quantity, which is why the two\n> blind notes are legal.\n\n*(2026-08-29. Staging note. Producer, formally embedded:\n`research/history/staging/attack-0829n-X-upper.js` (2.8 s; code-sha256\n3272cd0e...; out-sha256 281a529c...; `node research/qc/embed.js --check`\npasses bit-honest). No existing file edited, no git command run. Calibration\nper claim: PROVEN, VERIFIED by exact computation, MEASURED, HEURISTIC, OPEN.\nWrong-direction guard: `attack-wrongdirection-audit.md` §3.1 rules that the\nonly legal half of TODO Z2 is an upper bound on X(K) alone; this note compares\nX(K) against nothing but its own upper bound and the sifting function S(K),\nnever against T. T is computed by the producer only as an engine-identity\ngate against cited band sums and enters no bound and no ratio. The standing\nK* and K*/pool targets (12.20 → 31.22, 0.061 → 0.032, `attack-quadpoint-02.md`\n§2–3) and the main-term K* comparison (3.92 → 31.15, ratio 0.998 at B8,\n`attack-roughpair-error.md` §6) are crossing quantities, i.e. comparisons of\nX against T; they are quoted here as what they are and are NOT recomputed,\nbecause computing them is the comparison the guard forbids. The reproduction\ntarget this note can legally score is exact X(K) itself, per anchor.)*\n\n## 0. Verdict, disconfirming half first\n\n1. **The bound is loose by a factor 7.82 → 10.13 at the band depths, band\n sums B3 → B8, and the factor grows with Q** [MEASURED, SEC 2]. Per anchor\n the median runs 8.78 → 10.75 and the worst anchor is 34.96 (B4) [SEC 3].\n The loss splits into two factors with different owners:\n - a **sieve loss** T1/S = 1.78 → 2.53, the Selberg upper bound against the\n sifting function S(K) it actually bounds;\n - a **structural loss** S/X = 4.39 → 4.01, the sifting function against the\n census: S − X = M + T, and the mixed pairs are M/S = 0.495 → 0.513 of S\n [SEC 5]. This factor is not a sieve deficiency. Removing it needs a LOWER\n bound on M(K), the pairs with one prime member and a p_K-rough partner,\n on a window of length Q′² − Q² = (Q′ − Q)(Q′ + Q), which is h^{1/2}\n times a prime gap at h = Q². That is a lower-bound sieve over the primes\n of the window and needs their distribution in progressions at some\n positive level; no such level is known unconditionally in intervals this\n short (the h^{0.525} of Baker–Harman–Pintz 2001, literature figure, is\n the threshold for the bare count of primes, with no level at all). So\n the structural factor is out of reach of an upper-bound sieve by\n construction, and of any unconditional argument this corpus knows.\n2. **The level the window allows is below z², at every band** [MEASURED,\n SEC 5]. The uniform remainder R_U(z, ξ) stays at or below the sieve main\n term C·V₂(z) only up to D_max = 169, 841, 1849, 3721, 6889, 9409\n (B3 → B8, median C), i.e. s_max = ln D_max/ln p_K = 1.81 → 1.96, never 2.\n The optimal ξ is below p_K at every band (medians 7 → 61 against\n p_K = 17 → 139, s = 1.37 → 1.67), so the weights never see all the primes\n being sifted. In B6 the band sum of the uniform bound is **flat at\n 378100.0 from K = 17 to K = 46** while ΣX falls 41172 → 15540, so T1/X\n climbs 9.18 → 24.33 with depth [SEC 4]. This is the kill condition the\n brief named: the theorem is not vacuous (the bound sits below the trivial\n C at every anchor of B4–B8 and 35 of 40 in B3, SEC 3) but past\n p_K ≈ 31 (B6) and p_K ≈ 61 (B8) deeper sieving buys it nothing.\n3. **The theorem's main term is the sifting function's, not the census's**\n [MEASURED, SEC 5]. C·V₂(z) tracks S(K) to S/(C V₂) = 0.998 → 1.004 at the\n band depths, but it is 5.18 → 5.55 times the census's own naive main term\n C[V₂(K) − 2V₂(K)U(K) + V₂(nR)] of `attack-roughpair-error.md` §2 (and\n X/Xnaive = 1.261 → 1.307 measured). So the brief's aim, \"turn the main\n term into a theorem\", is met for the WRONG main term: the sieve theorem\n carries the first of the census's three terms and cannot carry the\n subtracted two, for the reason in item 1.\n4. **The drift 0.923 → 0.984 is not evaluated, by rule.** It is a property of\n the crossing y*(Q), defined by X(y) < T (`u2-engine-depth.md` §5), outside\n the legal half. What the theorem does carry is the mechanism that note\n names: its main term is the exact partial product, not the Mertens\n asymptotic, and the T-free size of that effect on the theorem's own main\n term is V₂(z) exact/asymptotic = 0.8415 → 0.9591 at the band depths\n [MEASURED, SEC 6]. Whether that produces the crossing's drift remains a\n statement about the crossing (§6).\n5. What is PROVEN: Theorem U of §2, with nothing OPEN in its proof. It is\n classical sieve bookkeeping (Selberg's Λ² inequality, Halberstam–Richert\n Ch. 3; Ford's notes, cited through `quadpoint-prior-art.md` §1.1) applied\n to a standard object; no novelty is claimed for any step. Its value is\n that every constant is explicit and computed, and that the loss factors\n above are now numbers rather than a hardness analogy. It opens no route.\n\n## 1. The object, copied\n\nFrom `quadpoint-identity-01.md` §1, verbatim in substance: fix an anchor Q\n(a prime ≥ 7), Q′ the next prime, the half-open stretch S_Q = [Q², Q′²), the\ncapacity C counting the channel pairs (a, a+2) with BOTH members in S_Q\n(a ≡ 11, 17, 29 mod 30, a ≥ Q², a + 2 < Q′²), twins T, and actives\np₁ < p₂ < ... = 7, 11, 13, .... Then\n\n> X(K) = #{channel pairs with both members composite and\n> min(lpf(a), lpf(a+2)) > p_K}, X(0) = CC.\n\nThe window convention is load-bearing there (the pair (Q′² − 2, Q′²) is\nexcluded) and is implemented identically here: the producer's loop is\n`a + 2 < hi`. Two further counts are used, neither compared to T:\n\n- S(K) = #{channel pairs with (a(a+2), P(z)) = 1}, z = p_K, P(z) = ∏ actives\n ≤ z: the dimension-2 sifting function of Ford §1.7.2. Since a prime member\n has no active factor, S(K) = X(K) + M(K) + T with M(K) the pairs having\n exactly one prime member and the composite member p_K-rough. The producer\n asserts S(full) = T and X(full) = 0 at every anchor [SEC 0].\n- V₂(z) = ∏_{7≤p≤z}(1 − 2/p), the fundamental-lemma density.\n\nEngine identity [VERIFIED, SEC 0]: 1227 anchors; band counts n = 40, 103,\n71, 208, 292, 491 and band sums ΣT = 1017, 7086, 8332, 42495, 101763, 280128\nreproduce `attack-roughpair-error-01.js`; T = 127 and X(0) = 2357 at\nQ = 9281 reproduce `attack-quadpoint-03.js`.\n\n## 2. The statement\n\nNotation, for a fixed anchor Q and depth K ≥ 1 with z = p_K:\n\n- A = the set of openers a of the C channel pairs (an interval\n [Q², Q′² − 3] intersected with three residue classes mod 30).\n- For squarefree d | P(z): A_d = #{a ∈ A : d | a(a+2)}, g(d) = 2^{ω(d)}/d,\n r_d = A_d − C·g(d), h(d) = ∏_{p|d} 2/(p − 2),\n G(ξ) = Σ_{d ≤ ξ, d | P(z)} h(d), and B(1) = 0,\n B(d) = 3·2^{ω(d)}(1 + 1/d) for d > 1.\n- The Selberg weights at level ξ: λ_1 = 1, λ_d = 0 for d > ξ, and for\n 1 < d ≤ ξ, d | P(z),\n λ_d = μ(d)·∏_{p|d}(1 − 2/p)^{−1}·G_d(ξ/d)/G(ξ) with\n G_d(y) = Σ_{m ≤ y, m | P(z), (m, d) = 1} h(m).\n\n**Theorem U.** For every anchor Q, every K ≥ 1 and every real ξ ≥ 1,\n\n> X(K) ≤ S(K) ≤ C/G(ξ) + Σ_{d₁,d₂ ≤ ξ} λ_{d₁}λ_{d₂} r_{[d₁,d₂]} (tier T3, the exact Selberg value)\n> ≤ C/G(ξ) + Σ_{d₁,d₂ ≤ ξ} |λ_{d₁}λ_{d₂}| |r_{[d₁,d₂]}| (tier T2, exact remainders in absolute value)\n> ≤ C/G(ξ) + Σ_{d₁,d₂ ≤ ξ} |λ_{d₁}λ_{d₂}| B([d₁,d₂]) =: C/G(ξ) + R_U(z, ξ) (tier T1, uniform),\n\nwhere the sums run over d₁, d₂ | P(z), and\n\n> 1/G(ξ) = V₂(z)·(1 + E_z(ξ)), E_z(ξ) = (G(P(z)) − G(ξ))/G(ξ) ≥ 0,\n> |λ_d| ≤ 1, so R_U(z, ξ) ≤ Σ_{d ≤ ξ², d | P(z)} 3^{ω(d)} B(d).\n\nTier T1 depends on the anchor only through C: it is a bound\nX(K) ≤ C·V₂(z)(1 + E_z(ξ)) + R_U(z, ξ) with both correction terms functions of\n(z, ξ) alone, uniform over every anchor of every stretch. Tiers T2 and T3 use\nthe anchor's own r_d and are theorem instances rather than a uniform\nstatement. Since each tier is a valid upper bound at every ξ, the minimum\nover any fixed set of ξ is a valid upper bound; the producer takes the\nminimum over a 28-point grid ξ ≤ 701, per anchor and tier. The sifting\nparameter is s = ln(ξ²)/ln z, stated per band in §4.\n\nEvery inequality above runs upward from X(K), which is the direction\n`attack-wrongdirection-audit.md` §3.1 allows; none involves T.\n\n## 3. The proof, step by step\n\nEach step is labelled. Nothing in this section is OPEN.\n\n**Step 1, X(K) ≤ S(K)** [PROVEN, one line]. S(K) counts the channel pairs\nwith both members free of every active ≤ p_K; X(K) counts those among them\nwith both members composite (a composite member is p_K-rough iff its lpf\nexceeds p_K, and a prime member exceeds Q² and so is divisible by no active\n≤ p_K, hence is p_K-rough at every depth reported). Dropping the\n\"both composite\" condition enlarges the set. Direction: upward. What is\ndropped is M(K) + T, and §0 item 1 says why it cannot be recovered.\n\n**Step 2, Selberg's inequality** [PROVEN, classical; Halberstam–Richert\n*Sieve Methods* Ch. 3, Selberg's Λ² method; Ford's notes, the Selberg sieve\nchapter; numbering not verified at page image this session, and the proof\nis reproduced here so nothing rests on the citation]. For any real numbers\nλ_d indexed by d | P(z) with λ_1 = 1,\n\n> 1[(n, P(z)) = 1] ≤ (Σ_{d | (n, P(z))} λ_d)² for every integer n,\n\nbecause the left side is 1 exactly when the only divisor is d = 1 (the\nsquare is then λ_1² = 1) and is 0 otherwise while the right side is a\nsquare. Applying it with n = a(a+2) and summing over a ∈ A:\n\n> S(K) ≤ Σ_{a∈A} (Σ_{d | (a(a+2), P(z))} λ_d)² = Σ_{d₁,d₂} λ_{d₁}λ_{d₂} A_{[d₁,d₂]}.\n\nDirection: upward. Verified by the producer, which computes the left-hand\nquadratic form directly over the window at three anchors and matches\nC/G + Σλλr to 1e-6 relative (128.0930, 1021.5420, 1503.4693) [SEC 1].\n\n**Step 3, the diagonalisation** [PROVEN, classical]. Write\nA_{[d₁,d₂]} = C·g([d₁,d₂]) + r_{[d₁,d₂]}. The main part\nC·Σ λ_{d₁}λ_{d₂} g([d₁,d₂]) is a quadratic form in the λ's; with g\nmultiplicative and g(p) = 2/p < 1 for p ≥ 7 it diagonalises, and the\nchoice of λ_d in §2, supported on d ≤ ξ with λ_1 = 1, minimises it to\nexactly C/G(ξ) (the standard computation; Halberstam–Richert Ch. 3,\nLemma 3.1–Theorem 3.2 in most editions, numbering unverified). The same\ncomputation gives |λ_d| ≤ 1. Both are checked: λ_1 = 1 and\nmax |λ_d| = 1.0000 over 9 depths × 28 levels [SEC 1]. What remains is\nthe remainder Σ λ_{d₁}λ_{d₂} r_{[d₁,d₂]}, which is tier T3 exactly.\n\n**Step 4, the main term as a partial product** [PROVEN, one line]. At\nfull level ξ ≥ P(z), G(P(z)) = ∏_{p≤z}(1 + h(p)) = ∏_{p≤z}(1 − 2/p)^{−1}\n= 1/V₂(z), and G is increasing in ξ, so 1/G(ξ) = V₂(z)(1 + E_z(ξ)) with\nE_z(ξ) ≥ 0 as stated. Checked at K = 3: G(1001)·V₂(13) = 1 to 1e-15\n[SEC 1]. This is the step that makes the theorem's main term the exact\npartial product and not the Mertens asymptotic (§6).\n\n**Step 5, T3 ≤ T2** [PROVEN, triangle inequality]. Direction: upward.\n\n**Step 6, the uniform remainder bound, T2 ≤ T1** [PROVEN, elementary].\nFor squarefree d coprime to 30, a(a+2) ≡ 0 (mod d) holds on exactly\n2^{ω(d)} residues mod d (a ≡ 0 or −2 mod each odd prime p | d, distinct\nresidues), so A_d is a count of integers of an interval of length L in\n3·2^{ω(d)} residue classes mod 30d; each class contributes L/(30d) + θ\nwith |θ| < 1, so A_d = 3·2^{ω(d)}L/(30d) + θ_d, |θ_d| < 3·2^{ω(d)}, and\nC = A_1 = 3L/30 + θ_1, |θ_1| < 3. Hence\nr_d = A_d − C·2^{ω(d)}/d = θ_d − θ_1·2^{ω(d)}/d, so |r_d| < 3·2^{ω(d)}(1 + 1/d)\n= B(d) for d > 1, and r_1 = 0 identically. Checked: max |r_d|/B(d) = 0.4600\nover 3702 moduli × 1227 anchors, at Q = 4111, d = 8137 [SEC 1]. The\nbound uses only that A is an interval in fixed residue classes; no\nequidistribution input of any kind enters, which is what makes T1\nunconditional and uniform.\n\n**Step 7, the tail bound on R_U** [PROVEN, standard]. The number of pairs\n(d₁, d₂) with [d₁, d₂] = d is 3^{ω(d)}, and |λ| ≤ 1, giving the stated\nΣ_{d ≤ ξ²} 3^{ω(d)} B(d). The producer uses the sharper exact-|λ| form of\nR_U, which is what §4's numbers are.\n\nThat completes the proof. Verification of the whole chain: T1 ≥ T2 ≥ T3 ≥\nS(K) ≥ X(K) at all 10908 (anchor, depth) pairs [SEC 1].\n\n## 4. The level the window allows, and the sifting parameter\n\nThe theorem is non-vacuous only where R_U(z, ξ) is below the main term\nC·V₂(z), and C is small: the window has length (Q′ − Q)(Q′ + Q), so\nC ≈ (Q′ − Q)·Q/5 and the median C at the band depths is 184, 714, 1427,\n2922, 5848, 10938 (B3 → B8), with median main term C·V₂(z) = 80.3 → 1793.2\n[SEC 5]. Against that, the uniform remainder at the largest grid level\nwith R_U ≤ C·V₂ gives\n\n| band | K_b | p_K | C med | C·V₂ med | D_max | s_max = ln D_max/ln p_K |\n|---|---|---|---|---|---|---|\n| B3 | 4 | 17 | 184 | 80.3 | 169 | 1.81 |\n| B4 | 8 | 31 | 714 | 221.7 | 841 | 1.96 |\n| B5 | 12 | 47 | 1427 | 363.9 | 1849 | 1.95 |\n| B6 | 17 | 71 | 2922 | 631.7 | 3721 | 1.93 |\n| B7 | 23 | 101 | 5848 | 1097.6 | 6889 | 1.91 |\n| B8 | 31 | 139 | 10938 | 1793.2 | 9409 | 1.85 |\n\n[MEASURED, SEC 5; the p_K column is SEC 6's]. The level the window\nallows is D < z² at every band. In the Selberg sieve the weights live on\nd ≤ ξ = D^{1/2} < z, so at s < 2 the sifting primes between ξ and z carry\nno weight at all: they are sifted only through the inequality\n1[(n,P(z)) = 1] ≤ (Σλ_d)², which does not see them. The producer's\nminimising ξ confirms it: median ξ₁ = 7, 13, 19, 31, 43, 61 against\np_K = 17, 31, 47, 71, 101, 139, s₁ = 1.37, 1.49, 1.53, 1.61, 1.63, 1.67\n[SEC 2]. For comparison, `attack-wrongdirection-audit.md` §3.8 prices the\nLOWER-bound half at s = u*/2 = 1.7829 against β₂ = 4.26645 with the level\ntaken as the window length itself; the upper-bound half measured here sits\nat s = 1.4 to 1.7 with the level the window actually supports, which is\nbelow the window length by the remainder's 3^{ω}·2^{ω} multiplicity.\n\n**Consequence, the saturation** [MEASURED, SEC 4]. Because ξ₁ < p_K, the\nuniform bound at depth K equals the uniform bound at the depth where\np_K first exceeds ξ₁. In B6 the band sum ΣT1 is 557471.0, 478733.8,\n418415.9, 383864.4, 378671.3 at K = 1, 2, 4, 8, 12 and then 378100.0 at\nevery K from 17 to 46, while ΣX falls 41172 → 15540 over the same K; in\nB8 ΣT1 moves from 2840801.7 at K = 17 to 2827497.3 at K = 46, against\nΣX 470118 → 197389. The exact tier T3 does keep falling with K (B6:\n214190.2 → 188361.3; B8: 1890938.5 → 1662685.3) because its remainder\ncarries the signs, but it stays 8.42 to 12.12 above X at K = 46.\n\n**The kill condition, answered with the numbers.** The brief asked\nwhether \"the only sieve that certifies has level below what the window\nallows so the bound is vacuous at the anchors\". The bound is not vacuous:\nT1 < C at 35 of 40 anchors in B3 and at every anchor of B4 through B8\n[SEC 3]. But the level the window allows is below z² at every band, so the\ntheorem cannot follow X(K) down past p_K ≈ 31 (B6) or ≈ 61 (B8), and the\ngap to X opens with depth (T1/X = 9.18 → 24.33 across K = 17 → 46 in B6).\nThat is the honest shape of the result: a theorem at a fixed low level,\nnot a bound that tracks the census.\n\n## 5. The measurement: the bound against exact X(K) at every anchor\n\nAt the fixed band depths K_b = 4, 8, 12, 17, 23, 31 (the cited K* band\nmeans 3.88 → 31.22 rounded, `attack-quadpoint-03.js` SEC 2, used only as\ndepths), band sums [MEASURED, SEC 2]:\n\n| band | n | ΣX | ΣS | ΣT1 | ΣT3 | T1/X | T2/X | T3/X | S/X | T1/S |\n|---|---|---|---|---|---|---|---|---|---|---|\n| B3 | 40 | 891 | 3915 | 6971.3 | 3990.7 | 7.82 | 5.50 | 4.48 | 4.39 | 1.78 |\n| B4 | 103 | 7035 | 28425 | 56241.1 | 30810.4 | 7.99 | 5.72 | 4.38 | 4.04 | 1.98 |\n| B5 | 71 | 7941 | 32194 | 68871.2 | 37753.1 | 8.67 | 6.28 | 4.75 | 4.05 | 2.14 |\n| B6 | 208 | 41172 | 167264 | 378100.0 | 214190.2 | 9.18 | 6.73 | 5.20 | 4.06 | 2.26 |\n| B7 | 292 | 101591 | 407883 | 968355.1 | 571510.6 | 9.53 | 7.00 | 5.63 | 4.01 | 2.37 |\n| B8 | 491 | 279040 | 1119016 | 2827454.6 | 1733352.8 | 10.13 | 7.42 | 6.21 | 4.01 | 2.53 |\n\nPer anchor [MEASURED, SEC 3]: T1/X median 8.78, 8.90, 9.19, 9.77, 10.22,\n10.75 and max 20.00, 34.96, 15.41, 18.78, 16.86, 16.08 (B3 → B8); T3/X\nmedian 4.73 → 6.23. No anchor in any band has X(K_b) = 0, so every ratio\nis defined.\n\n**Reading, flat.** The uniform theorem is loose by 7.82 → 10.13 in band\nsums and the factor rises with Q. The larger part of it is the structural\nS/X = 4.39 → 4.01, fixed by the window (§0 item 1); the\nsieve's own share T1/S = 1.78 → 2.53 rises with Q because the level the\nwindow supports falls relative to z (s_max 1.96 → 1.85 from B4). The\nexact-remainder tier T3 reduces the sieve share (T3/S = 1.00 → 1.75 in\nB8 across K = 1 → 46, SEC 4) and cannot go below S/X.\n\n**On the reproduction target.** `attack-quadpoint-02.md` §4 fixes\nm6/m7/m8 = 0.050/0.040/0.032 and K* = 12.20 → 31.22 as what a proof-side\nbound must hit; `attack-roughpair-error.md` §6 shows a zero-parameter main\nterm hits it to ratio 0.998 at B8 and calls the target necessary and far\nfrom sufficient. This note does not score against it, because K* is the\ndepth where X crosses T and computing it is the comparison §3.1 forbids.\nWhat can be said without T: a bound loose by a factor 7.82 → 10.13 against\nX cannot reproduce any target that the census's own main term reproduces\nto 0.2%, and a bound that cannot follow X below p_K ≈ 31 to 61 cannot\nreproduce a depth statistic that lives at p_K = 139 in B8. So the\ntheorem fails the reproduction target for a reason visible without ever\ncomparing to T, and that failure is the expected outcome the brief named.\n\n## 6. What the theorem does and does not say about the main term and the drift\n\n**The main term** [MEASURED, SEC 5]. The theorem's main term C·V₂(z) is the\nfundamental-lemma main term of the sifting function, and at the band depths\nit is accurate for S: S/(C·V₂) = 0.998, 0.999, 0.998, 0.999, 0.998, 0.998\n(B3 → B8); along the K profile it reaches 1.016 at K = 46 in B6, the\nBuchstab correction beginning to show as u = ln h/ln z falls. The census's\nown zero-parameter main term (`attack-roughpair-error.md` §2, naive form)\nis C[V₂(K) − 2V₂(K)U(K) + V₂(nR)], and V₂(z) exceeds that bracket by\n5.55, 5.19, 5.31, 5.27, 5.18, 5.20; the measured X/Xnaive is 1.261 →\n1.307 (the Buchstab bias of the naive form that note reports for T as\n26%, seen here on X). So the theorem proves the FIRST term of the census's\nmain term as an upper bound with explicit error, and proves nothing about\nthe two subtracted terms, which are lower-bound objects. The brief's\n\"turn the main term into a theorem\" is therefore met only for a main\nterm 5.2 to 5.6 times the one the drift analysis uses. The composite-\nstructure alternative (bound X by switching to the larger prime factor of\na member) is worse before any remainder: its main term multiplier\nΣ_{z= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched.\n-->\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-doubling.md`, a\n> column-major engine sharing no line with this producer; every quoted figure\n> reproduced digit for digit, including K*(16) = 17 and G₂(31#) = 348 @\n> 8813641451 ×4 from BOTH base tiles).** One statement REFUTED: this note's\n> NOT-REACHED line on 19#→37# — that walk runs, reproduces the x = 37 ladder\n> row (528 @ 544899485411 ×2, census 217929355875) and yields a FIFTEENTH\n> step at s = 19, 20: K* = 13, C₂ = 3.5200, certificate 3.8000. (M8) holds at\n> fifteen steps, and K*/N reads 3.25 there, so the \"rising\" reading does not\n> continue. `REFUTED.md` row 94 stands and in fact under-claims: Lemma 1 at\n> s = 128 alone clears the whole legal band.\n\n*2026-08-29 night wave. Producer:\n`research/history/staging/attack-0829n-doubling-bridge.js` (formal embed;\nthe tail carries the hashes). Nothing committed; no git command run; no\nexisting corpus document edited; publication moratorium respected. HELD,\nawaiting the standing one-pass adversarial review. Legend as in\n`research/sift-limit-attack.md`: **[PROVEN]** proof given here or in a cited\ncorpus note; **[VERIFIED]** checked computationally here; **[MEASURED]**\nempirical, finite range; **[INFERRED]** deduction from sourced facts;\n**[CITED]** taken from a corpus artifact, not recomputed; **[OPEN]** not\nproven, not refuted.*\n\n---\n\n## 0. The verdict, up front\n\n> **No uniform bridge is proven. The one bridge the corpus had, the\n> K*-product certificate `Ĝ(2s) ≤ (K*+1)·Ĝ(s)`, is dead at `C₂ = 8` on the\n> chain itself: at `s = 16` the exact walk gives `K* = 17`, so the\n> certificate reads 18 against the target 8 while the true ratio is\n> 5.2727, and by the cited run floor `K* ≥ π(2s) − π(s)` it reads at least\n> 14 at `s = 64` and at least 24 at `s = 128`, past the whole legal band.\n> The sharper bridge `Ĝ(2s) ≤ maxsum_{K*+1}(T_s)` (the corpus's own\n> `G₂(new) ≤ maxsum_{1+L}(old)` shape) is a per-step theorem, stays under 8\n> at all fourteen enumerable steps with sup 6.6364 at `s = 16`, and is the\n> tightest proven object here: slack 1.00 to 1.33 over the truth where the\n> product certificate's runs to 3.27. Its all-s form is the inequality that\n> does not close, and it is located exactly: the longest run of consecutive\n> level-`s` slots the primes in `(s, 2s]` can kill, weighted by the ground\n> it stands on, must stay within 8 records. Nothing proven bounds that run\n> from above; the counting bound needs `θ < 1` and `θ → ∞` (cited); the\n> run's proven floor grows like `s/ln s`. The doubling inequality itself is\n> untouched in both directions. The telescoped chain is a Cesàro mean of\n> `log₂ C₂`, so no rung gains anything and the per-step inequality at every\n> large `s` is the whole content; it is not the closed fold recursion, whose\n> per-block target was exponent 2, and it lands on no refuted row.**\n\nNumbers below are quoted from the producer's bound OUTPUT block\n(`attack-0829n-doubling-bridge.js`, lines 464 to 652) or from cited artifacts\nby file and line; none is typed from a run.\n\n## 1. (a) The statement, quantifiers fixed\n\n**(D8).** For every integer `s ≥ 2`: `Ĝ(2s) ≤ 8·Ĝ(s)`, where\n`Ĝ(t) = G₂(P(t)#)`, `P(t)` the largest prime `≤ t`, and `G₂(p#)` the maximal\ncyclic gap between consecutive twin-admissible slots modulo `p#`\n(`attack-doubling-01.md` §1). Chain form: for every `k ≥ 1`,\n`Ĝ(2^{k+1}) ≤ 8·Ĝ(2^k)`.\n\n- **Quantifier.** ALL `s` (all `k`), including `s = 16`. The eventual form\n `∀k ≥ k₀` is excluded on purpose: it drops the `s = 16` witness and past\n it the chain carries one datum, `1080/348 = 3.1034` at literature grade,\n so every `C₂ ∈ (3.1034, 4)` would be data-consistent and TPC-implying\n (`attack-wrongdirection-audit.md` §3.3). Every statement in this note is\n all-`s`.\n- **Constant.** `C₂ = 8`, inside the legal band `[4, 19.2455)`: the trap is\n `C₂ < 4` (`ln C₂ ∈ [1.1325, 1.3863)`), and 8 sits above the exact sup\n `348/66 = 5.2727` by a factor the data leave open. The exact table has\n every `C₂(s) ≤ 8` for `s = 2..41` (producer, A). **[VERIFIED]**\n- **Direction.** (D8) bounds the level-`2s` record ABOVE by the level-`s`\n record. That is the legal direction: an upper bound on `Ĝ` lowers the\n exponent ceiling and certifies no twin prime; the payout is\n `limsup ln Ĝ(x)/ln x ≤ log₂ 8 = 3.0000 < β₂ = 4.26645` through the\n Cesàro identity of §4 and (H-mono) (`fekete-1d.md` §5, cited). Nothing in\n this note bounds `Ĝ` below except where the bound is the adversary's own\n construction (§3 step 3), which runs in the opposite direction and is\n used only to measure slack.\n\n## 2. (b) The finite-level mechanism, re-derived, and why it is per-level\n\n**The Bridging Lemma [PROVEN, re-derived].** A twin-admissible slot at\nlevel `2s` is an integer `r` with `r` and `r+2` coprime to `P(2s)#`; that\ncondition contains the level-`s` one, so the level-`2s` slots are a\nsub-sequence of the (periodic) level-`s` slots. A level-`2s` gap\n`[a, b]` therefore contains `k ≥ 0` level-`s` slots, each divisible (itself\nor plus 2) by a prime `q ∈ (s, 2s]`, and `b − a` is the sum of the `k+1`\nconsecutive level-`s` gaps it spans. Each of those is `≤ Ĝ(s)` by the\ndefinition of the record, so `Ĝ(2s) ≤ (k+1)·Ĝ(s) ≤ (K*(s)+1)·Ĝ(s)` with\n`K*(s)` the longest run of consecutive level-`s` slots all killed by the\nentering primes, anywhere in the level-`2s` period. This is the certificate\n`C₂ ≤ K*+1` (`attack-doubling-01.md` §3); the producer re-derives it at\nthe eleven enumerable steps digit for digit against that file's own table\n(§5) and adds three steps.\n\n**Why it is per-level and not uniform.** `K*(s)` is defined by a full walk\nof the level-`2s` period, `P(s)#` times the product of the entering primes;\nthe lemma converts one computed quantity into another and carries no\nstatement about `sup_s K*(s)`. A uniform (D8) through it needs\n`K*(s) ≤ 7` for every `s`. That is false, twice over:\n\n- **On the chain, by exact data.** `K*(16) = 17` (13#→31#, walked here for\n the first time; producer line 536), so the certificate is 18 at the very\n rung that carries the sup. The record window there bridges `k = 14`\n killed level-13 slots and does not realize the longest run\n (`k = 14 < K* = 17`, line 618). **[VERIFIED, custody grade]**\n- **For all large `s`, by proof.** Lemma 1 of `hsubpow-explicit-K.md` §2b\n (three lines of CRT; red-team CONFIRMED, `redteam-0828-closures.md`\n row 1b) gives `K*(s) ≥ N(s) := π(2s) − π(s)` whenever `D_s ≥ N`. The\n producer checks `K* ≥ N` at all fourteen walked steps (`K*/N` from 1.00 to\n 3.40, line 547) and the hypothesis at the rungs that matter. `N ≥ 8`\n first at `s = 34`; on the chain `N(64) = 13`, `N(128) = 23`, and\n `N ≥ 8` at every chain rung from 64 to 1024 (lines 548 to 550). So the\n certificate exceeds 8 at `s = 64` and exceeds the entire band\n `[4, 19.2455)` at `s = 128`, and since `N(s) → ∞` it exceeds every\n constant from some `s` on. **[PROVEN, given the cited lemma; VERIFIED the\n rungs]**\n\nThe lemma's second and larger reason for looseness is visible at the sup\nstep: five entering primes deliver 15 strikes on 14 slots inside the record\nwindow (line 613), so a prime kills about three copies, not one, and the\nfloor `N` explains under half of `K*` there.\n\n## 3. (c) The bridge attempted at C₂ = 8, step by step\n\nNotation: `T_s` the level-`s` tile (the slot residues modulo `P(s)#`,\n`D_s = ∏_{3≤p≤s}(p−2)` of them), `ḡ(s) = P(s)#/D_s` its mean gap,\n`maxsum_m(T_s)` the largest sum of `m` cyclically consecutive level-`s`\ngaps (`a3-05-bound-L.md` §5, same definition), `N(s) = π(2s) − π(s)`.\n\n**Step 1 [PROVEN].** Level-`2s` slots are a sub-sequence of level-`s`\nslots (§2).\n\n**Step 2 [PROVEN, an identity].** Call a run of consecutive level-`s` slots\n*killed* if every slot in it is struck by an entering prime, and its *span*\nthe distance from the surviving slot before it to the surviving slot after\nit. Every level-`2s` gap is the span of a killed run (possibly empty) and\nevery killed run lies inside one level-`2s` gap, so\n`Ĝ(2s) = max over killed runs R of span(R)`. This is the object itself\nwritten in level-`s` words; it proves nothing and is where the bridge must\nstart.\n\n**Step 3 [PROVEN, the sandwich].** A killed run of length `k` spans `k+1`\nconsecutive level-`s` gaps, so `span(R) ≤ maxsum_{k+1}(T_s) ≤\nmaxsum_{K*+1}(T_s)` (`maxsum_m` is monotone in `m`; checked at `m ≤ 40`,\nproducer B). And Lemma 1's construction places a killed run of length `N`\non ANY `N` consecutive slots, so placed on the `maxsum_{N+1}` window it\nforces a level-`2s` gap of at least that span. Hence, direction by\ndirection:\n\n maxsum_{N+1}(T_s) ≤ Ĝ(2s) ≤ maxsum_{K*+1}(T_s) ≤ (K*+1)·Ĝ(s).\n\nThe left inequality is the adversary's (a lower bound on `Ĝ(2s)`; the\nclassical CRT family of `two-class-lower-bounds.md` §1, not new); the\nmiddle one is the **maxsum certificate**, the corpus's\n`G₂(new) ≤ maxsum_{1+L}(old)` (`U-FRAME.md` §5a as quoted at `a3-09-histogram-operator.md` line 176;\n`a3-05-bound-L.md` §5 has the same shape for the single-fold `L`), here applied to the doubling block; the right one is the product\ncertificate of §2. Verified at all fourteen steps, and the floor half at\n`s = 19..23` against the exact table (producer E, lines 556 to 586):\n\n| step | s | N | K* | floor | C₂ | msc | K*+1 |\n|---|---|---|---|---|---|---|---|\n| 13#→23# | 13,14 | 3 | 8 | 2.3636 | 3.0909 | 3.6364 | 9 |\n| 13#→29# | 15 | 4 | 10 | 2.5455 | 3.9091 | 4.5455 | 11 |\n| 13#→31# | 16 | 5 | 17 | 2.8182 | 5.2727 | 6.6364 | 18 |\n| 17#→31# | 17,18 | 4 | 13 | 1.9444 | 3.2222 | 4.2778 | 14 |\n\n(`floor = maxsum_{N+1}/Ĝ(s)`, `msc = maxsum_{K*+1}/Ĝ(s)`; the ten earlier\nrows are in the block, lines 562 to 571.) `msc/C₂` runs 1.00 to 1.33 across\nthe fourteen steps and `(K*+1)/msc` 1.00 to 3.27: the product certificate\nloses most of its slack by replacing a sum of gaps with a multiple of the\nlargest one. **[VERIFIED]**\n\n**Step 4 [PROVEN sufficient; OPEN as a statement].** (D8) follows from\n\n (M8) maxsum_{K*(s)+1}(T_s) ≤ 8·Ĝ(s) for every s ≥ 2.\n\n(M8) holds at all fourteen enumerable steps with sup `6.6364` at `s = 16`\n(line 578), and nothing is known about it past `s = 18`. It is sufficient\nand not necessary: the record window need not realize the longest run\n(`s = 16, 17`) and need not stand on the thickest ground (`ρ = 1.147` at\n`s = 16` against the tile mean, line 617). **[VERIFIED the range]**\n\n**Step 5, the split, and the single inequality that does not close.**\nWrite `maxsum_{m}(T_s) = m·ḡ(s)·ρ(s, m)` with `ρ` the thick-ground factor\n(measured `ρ_run` at `m = K*+1`: 1.000 to 1.440 across the fourteen\nsteps, lines 587 to 602). Then (M8) reads\n\n (R) K*(s) + 1 ≤ 8 · [Ĝ(s)/ḡ(s)] / ρ(s, K*+1) for every s.\n\nThe left side is a covering quantity: the longest run the two residue\nclasses of each prime in `(s, 2s]` can jointly cover on the slot sequence.\nThe right side is a record quantity: how far the level-`s` record exceeds\nthe tile's mean gap (`Ĝ/ḡ` measured 1.00 at `s = 2` to 4.71 at `s = 17`,\nsame lines). (R) is the inequality the bridge needs and cannot supply, and\neach of its three pieces is open in the direction needed:\n\n- **Upper bound on `K*(s)`: OPEN.** The only a-priori handle is residue\n counting, which closes iff `θ = 2Ĝ(s)Σ_{q∈(s,2s]} 1/q < 1`;\n `θ ≥ 1.3333` at the first step and `θ → ∞` at every base\n (`attack-doubling-01.md` §3; `hsubpow-explicit-K.md` §3). The proven\n floor `K* ≥ N ~ s/ln s` runs the wrong way. `K*` is the entering primes'\n two-class Jacobsthal problem on the slot sequence: self-similar\n (doubling-01 §3), and the block campaign's combined-`L` object at the\n doubling block (`attack-block-00-ADJUDICATION.md`; its counting bound is\n the same `θ` machinery).\n- **Upper bound on `ρ(s, m)` at `m ≈ K*`: OPEN.** A bound on the largest\n sum of `m` consecutive gaps for `m ~ s/ln s` is a generalized Jacobsthal\n statement; the trivial one, `ρ ≤ Ĝ/ḡ`, returns the product certificate\n and Lemma 1's divergence.\n- **Lower bound on `Ĝ(s)/ḡ(s)`: order proven, constant not in hand.**\n `ḡ(s) ≍ ln² s` (Mertens) and `G₂(x#) ≫ x ln x` from published\n ingredients (`G2-STATE.md` §PROVEN, NOT refereed), so the right side of\n (R) grows at least like `s/ln s`, the same order as the left side's\n floor. A race of constants at exponent one, with the constant on the left\n unproven in any form. **[CITED the bound; INFERRED the comparison]**\n\nSo the bridge at `C₂ = 8` reduces to (R): a run-length upper bound of the\nsame order as the run's proven lower bound, against a record lower bound of\nthe same order. Random-model heuristics put `K*` near `s/ln ln s` and\n`Ĝ(s)/ḡ(s)` near `s ln s`, which would leave (R) room of order `ln s`;\nthat is a heuristic and the fourteen points cannot test it.\n**[HEURISTIC]**\n\n**A shortcut that is not one.** Bridging through the intermediate primes\none fold at a time composes `N(s)` single-fold certificates, one per\nentering prime, and `N(s) → ∞`: a constant per-fold cap compounds to\n`exp(#folds)`, which is `attack-hsub-01.md` §4(i)'s point about (H-sub)\nand applies unchanged to (D8). Not pursued. **[CITED]**\n\n## 4. (d) The kill check against the fold recursion and the refuted registry\n\n**Against the fold recursion `β_{k+1} = (β_k + φ_k)/2` (CLOSED,\n`attack-block-00-ADJUDICATION.md` attack 10).** Telescoping (D8) along the\nchain gives `Ĝ(2^{k+1}) = Ĝ(2)·∏_{j≤k} C₂(2^j)`, hence\n\n β(2^{k+1}) := ln Ĝ(2^{k+1}) / ln 2^{k+1} = (log₂ Ĝ(2) + Σ_{j=1..k} log₂ C₂(2^j)) / (k+1),\n\na Cesàro mean of `log₂ C₂` along the chain (checked at `k = 6`:\n`β(64) = 1.6795` both ways, line 637). It is an averaging and it forgets\nits start, at rate `1/k` rather than the squaring ladder's `2^{−k}`. The\nadjudication's lesson transfers in full: the limsup of `β` is at most the\nlimsup of `log₂ C₂`, no rung contributes anything, and the whole content is\nthe per-step inequality at every large `s`. What does NOT transfer is the\nclosure: attack 10 closed because the per-block exponent to prove equalled\nthe global exponent 2, a TPC-strength requirement. Here the per-step\nrequirement is `C₂ ≤ 8`, that is exponent `log₂ 8 = 3.0000`, legal and\nfinite. The bridge is not that row. **[VERIFIED the identity; INFERRED the\nscoping]**\n\n**Against the refuted registry.** The residue-density closure and every\nconstant-factor sharpening (`attack-doubling-01.md` §3): not re-run; used\nhere only as the reason the `K*` side of (R) has no handle. The block\nladder rows (`REFUTED.md` rows on `L ≤ 62`, the A/B-coupling depth axis,\nthe submodular certificate): the `K*` object is the block campaign's\ncombined `L` at a different block; none of those rows bounds it uniformly,\nand this note reopens none. The localized merge chain and its block\ncomposition (`REFUTED.md` rows 27 and 30): a different object (the merge\nchain's `M`), not touched. The `θ` ladder (row 35): a different `θ`.\n**Verdict: the K*-product bridge is CLOSED at every `C₂ < 19.2455` (by\nexact data at `s = 16` for `C₂ < 18`, by Lemma 1 at `s = 128` for the\nrest); the maxsum bridge is on no refuted row and its all-s form (R) is\nOPEN; the question's status is PARTIAL.**\n\n## 5. (e) Chain of custody: the producer against the exact table\n\nNothing new was trusted before the old was reproduced, in this order\n(producer A to C, lines 464 to 543):\n\n- The two ladders are parsed from their keepers (`exact-g2-ladder.js`,\n `import-interp-01-bgt-defect.js`), never retyped, and agree on the 14\n shared terms.\n- The `C₂` table `s = 2..41` is rebuilt and compared field by field\n (`P(s)`, `P(2s)`, `Ĝ(s)`, `Ĝ(2s)`, exact fraction, four-decimal ratio,\n grade) against the table bound inside `attack-doubling-01.js`'s own\n OUTPUT block, parsed from that file at run time: 40 of 40 rows identical\n (line 469). **[VERIFIED]**\n- Tiles to 23# by fold recursion match the ladder in census, record, least\n argmax and multiplicity at every `p ≤ 23` (lines 474 to 485).\n- A walk engine written fresh for this pass (bitmask over copy residues, no\n shift operator; `qc/widths.js` guards on every wide quantity) re-derives\n at the eleven enumerable steps the record, least argmax, multiplicity,\n census, `k`, `K*` and the certificate, each compared against\n `attack-doubling-01.js`'s F-table and walk rows: all equal (lines 487 to\n 532). **[VERIFIED]**\n- Only then the three new steps: 13#→29#, 13#→31#, 17#→31#. They re-derive\n `G₂(29#) = 258 @ 1205437109 (×2)` and `G₂(31#) = 348 @ 8813641451 (×4)`\n against the exact ladder, the 31# row by two independent base tiles\n (lines 533 to 543). Wall 0.7 s, 26.3 s and 17.6 s. **[VERIFIED]**\n- Self-test failures: 0 (line 652). Fingerprint: `code-sha256 a12d2919`,\n `out-sha256 217204ab`, 190 body lines; written by `embed.js`, no\n `--force`.\n\n## 6. How low can C₂ be pushed while staying ≥ 4\n\n- **The K*-product bridge**: nothing below 18 on the chain (`s = 16`, exact),\n and no constant at all for all `s` (Lemma 1). Lowering `C₂` is moot.\n- **The maxsum bridge**: on the enumerable range it certifies exactly\n `6.6364` (its sup, `s = 16`, line 578) and cannot certify anything lower\n there, since at `s = 16` the certificate is itself 6.6364 while the truth\n is 5.2727. For every `C ∈ [6.6364, 8]` the all-`s` statement is (R) with\n 8 replaced by `C`, the same open inequality with less room; for\n `C ∈ [5.2727, 6.6364)` the bridge is already refuted at `s = 16` as a\n method, though (D8) with that `C` may still be true. Nothing here\n approaches 4, and nothing here is stated for any `C₂ < 4`. The number\n 8 was chosen for margin, and the margin bought no structural relief:\n (R) at 8 and (R) at 19.2455 have the same three open pieces.\n **[VERIFIED the range; INFERRED the rest]**\n\n## 7. NOT REACHED, falsifiers, trap grading\n\n**NOT REACHED.**\n\n- (D8) itself: not proven, not refuted, for any `s > 41`; on the chain the\n next datum is `Ĝ(128) = G₂(127#)`, out of reach of any walk.\n- (R), equivalently (M8), past `s = 18`: `K*` at 19#→37# and beyond needs\n walks over `D_19 = 378675` slots times four or more entering primes,\n hours in this engine rather than seconds; `s = 32` (31#→61#) has\n `D_31 = 6226553025` base slots (line 536) times seven entering primes and\n is beyond any walk.\n- No a-priori bound on `K*(s)`, on `ρ(s, m)`, or on `maxsum_{K*+1}(T_s)`\n is derived. (R) is TODO item 0c's shape at the doubling block (a\n residue-deleted maxsum bounded without a kill count, `U-FRAME.md` §5a),\n which that item records as untried in this repository; this pass did not\n try it either.\n- The constant in `G₂(x#) ≫ x ln x` was not extracted and compared with\n `N(s)·ḡ(s)`; the comparison in §3 step 5 is at the level of orders.\n- Whether `K*/N` (1.00 to 3.40, rising) keeps rising: fourteen points at\n `P(2s) ≤ 31`.\n\n**What would falsify each claim, and whether the check has run.**\n\n| claim | falsifier | has it run |\n|---|---|---|\n| the K*-product bridge fails at `C₂ = 8` on the chain | `K*(16) ≤ 7` | yes: `K*(16) = 17` by an exact walk that also reproduces `G₂(31#)` and its argmax from two base tiles |\n| it fails for all large `s` | a proof that `K*` is bounded | refuted by the cited Lemma 1, checked here at 14 steps and at the chain rungs 64 to 1024 |\n| the sandwich `maxsum_{N+1} ≤ Ĝ(2s) ≤ maxsum_{K*+1}` | one step violating either side | yes: 14 walked steps, plus the floor side at `s = 19..23` against the exact table; none |\n| (M8) holds on the enumerable range | one step with `msc > 8` | yes, 14 steps, sup 6.6364 |\n| (R) is open | a proven upper bound on `K*(s)` of order `s/ln s` with an explicit constant, plus a bound on `ρ` | none exists in the corpus; the counting bound needs `θ < 1` and `θ → ∞` (cited) |\n| the bridge is not the closed fold recursion | a derivation in which the per-step target is exponent 2 | the per-step target here is exponent 3 (`log₂ 8`); the Cesàro identity is verified at `k = 6` |\n| the C₂ table reproduces doubling-01 | any differing field | yes, 40 of 40 rows, 8 fields |\n\n**Trap grading.** `C₂ = 8 ≥ 4` throughout; the all-`s` quantifier is kept\nin (D8), (M8) and (R); no constant below 4 is derived or implied; the only\nlower bounds on `Ĝ` used are the adversary's, in their own direction, for\nslack measurement. Nothing here is TPC-implying, and nothing here is a\nresult: one route is closed by data and a cited lemma, one route is\nsharpened and left open at a named inequality.\n\n## 8. Sources and reproduction\n\n| artifact | what it carries |\n|---|---|\n| `research/history/staging/attack-0829n-doubling-bridge.js` | custody (A), tiles (B), fourteen walks (C), the run floor at the rungs (D), the maxsum sandwich and ground table (E), the sup-step anatomy (F), the Cesàro identity (G) |\n| `research/attack-doubling-01.js`, `attack-doubling-01.md` | the C₂ table, the eleven certificates, the residue-density closure, the mechanism; reproduced here field by field |\n| `research/history/staging/hsubpow-explicit-K.md` §2b, `redteam-0828-closures.md` row 1b | Lemma 1, `K* ≥ π(y′) − π(y)`, proven and red-team confirmed |\n| `research/history/staging/attack-wrongdirection-audit.md` §3.3 | the all-`s` quantifier discipline and the trap window |\n| `research/history/staging/attack-block-00-ADJUDICATION.md` attack 10 | the closed averaging recursion the kill check is run against |\n| `research/a3-05-bound-L.md` §5, `research/U-FRAME.md` §5a, `research/a3-09-histogram-operator.md` line 176 | the maxsum object and the `G₂(new) ≤ maxsum_{1+L}(old)` shape |\n| `research/two-class-lower-bounds.md` §1; `research/G2-STATE.md` §PROVEN | the CRT adversary and the `x ln x` lower bound |\n| `research/history/staging/attack-hsub-01.md` §4(i) | folds compound to `exp(#folds)` |\n| `research/exact-g2-ladder.js`, `research/import-interp-01-bgt-defect.js` | the two ladders, parsed at run time |\n\nReproduce with `node research/qc/embed.js --check --timeout 600\nresearch/history/staging/attack-0829n-doubling-bridge.js` (about 45 s).\n"},"research/history/staging/attack-0829n-hsubpow-K.md":{"lf_sha256":"c416c2d60e688a48095892cb0dc5525e697bb70b0ab6b3357e4f586ff8665913","content":"# TODO 1d: (H-sub-pow) with an explicit K, second pass — the fourth mechanism named and priced, the needed K measured against the one-class control, and the all-bases hypothesis shown to carry a sign condition on the second-order term\n\n\n\n*2026-08-29. Producer: `research/history/staging/attack-0829n-hsubpow-K.js`\n(formal embed; fingerprint checked with `embed.js --check` after writing).\nArithmetic only: no enumeration, no new `G₂` value, every ladder term parsed\nfrom the corpus keepers (`research/import-interp-01-bgt-defect.js` for the\n22-term A144311 column, `research/exact-g2-ladder.js` for the 14 custody terms,\n`research/exponent-control.js` for the 64-term A048670 control). Nothing was\ncommitted, no git command was run, no existing corpus document was edited.\nHELD, awaiting the standing one-pass adversarial review. Legend as in\n`research/sift-limit-attack.md`: **[PROVEN]** proof given here or published;\n**[VERIFIED]** checked computationally here; **[MEASURED]** empirical, finite\nrange; **[INFERRED]** deduction from sourced facts; **[CITED]** taken from a\ncorpus artifact, not recomputed.*\n\n---\n\n## 0. The verdict, up front\n\n> **No K is proven, at any base, by any mechanism, and this pass adds no\n> fourth mechanism that closes. What it adds is the name of the fourth\n> mechanism, its price, and a sign condition the all-bases hypothesis was\n> carrying unstated.** The open inequality is one line: a cap on the ratio\n> of maximal gaps at consecutive levels of a chain, uniform in the rung,\n> `Ĝ(b^{k+1}) ≤ e^K·Ĝ(b)·Ĝ(b^k)` for all `k`. At a fixed base that is a\n> proof gap (every law the corpus entertains satisfies it, and nothing in\n> the corpus or the literature bounds such a ratio uniformly). Across all\n> bases it is a possible truth gap: for any exact law\n> `Ĝ ~ c·n^β·(ln n)^δ` the all-bases hypothesis holds with a finite `K` if\n> and only if `δ ≥ 0`, the `k = 1` rung alone diverging when `δ < 0`, and\n> the sign of `δ` for `G₂` is not known. The one instrument that reads `δ`\n> off the reachable ladder returns the wrong sign on the control.\n\n1. **The map from `K` to the exponent bound is exact and reproduces the\n zone.** Under the hypothesis `β ≤ β_bound(K) := min_b (f(b)+K)/ln b`,\n and on the reachable ladder `β_bound(1.3946) = 2.0000` at `b = 66`,\n `β_bound(11.3568) = 4.2665` at `b = 82`; the trusted legal zone is exactly\n `[K_min(2), K_min(β₂))` with `K_min(β) = max_b (β ln b − f(b))`. The\n argmin base is 16 only at `K = 1.0033`, 66 at `1.3946`, 78 at `2`, and 82\n for every `K ≥ 3`: on this ladder the whole exponent prize of a zone `K`\n above 3 rests on the last trusted term. **[VERIFIED]** (§1)\n2. **What the data needs, with the control beside it.** `max S(n) = 1.3946`\n at `n = 66` and the power-pair sup `1.0033` at `(16,4)` reproduce; custody\n `0.9694` at `(16,2)` reproduces. On the one-class control the same sup is\n `0.6931` at `G₂`'s reach and `0.9478` at its own, `+0.2546` nats for a\n fourfold reach, every record after `n = 8` a `k = 1` rung at a growing\n base. A sup read at reach 82 is a floor on the true constant, and its\n movement lives on the diagonal. **[MEASURED]** (§2)\n3. **The diagonal does not read `δ` at this reach.** The slope of\n `D(b,1) = f(b²) − 2f(b)` on `ln ln b` equals `−δ` for an exact law (the\n synthetic laws return it to `1e−9`); the control, conjectured\n `δ = 2 + o(1)`, reads `+0.5157 ± 0.1969` on 16 bases, the wrong sign by\n more than two standard errors. The `G₂` reading `+0.0961 ± 0.4137` on 8\n bases is therefore void, not evidence for `δ = 0`. **[MEASURED]** (§2)\n4. **The proof attempt, at `K` near the ceiling.** Every tool with the right\n direction is one of the three closed on 2026-08-28 or reduces to the\n two-class window sieve, which is the wall; the two new proven statements\n (the lifting identity and the sign lemma) are necessary conditions, not\n mechanisms. The minimum margin `K − D` on the reachable pairs is\n `10.3535` nats at `K = 11.3568` and `0.3913` at `K = 1.3946`: the data\n falsify nothing and reach no decisive rung. Starting high does not buy a\n cheaper proof: at `K = 11` only 10 of 81 reachable bases (from `b = 72`)\n convert a one-base `K` into `β < β₂`, at `K = 2` all 81 do. **[VERIFIED]**\n (§§3–4)\n5. **A correction to the record.** The corpus sentence \"every power-log law\n has a bounded window-sup defect\" (`fekete-1d.md` §4;\n `attack-fekete-1d-01-defect47.js` reading 7) holds for `δ ≥ 0` only; the\n same texts locate the risk on the diagonal, so the mechanism is right and\n a qualifier is missing. TODO 1d's formula `β ≤ (ln 66 + K)/ln 16` reads\n `5.607` at the corrected ceiling, above `β₂`; base 82 carries the bound\n there, not base 16. **[VERIFIED]** (§5)\n\nNothing here moves the wall. The ledger status is OPEN because the question\nas posed (a proof by a mechanism the last pass did not close) is neither\nanswered nor shown unanswerable; the three closed mechanisms stay closed.\n\n---\n\n## 1. The hypothesis, exactly, and the map from K to the exponent bound\n\n### 1a. The statement, quantifiers included\n\nWrite `Ĝ(n) = G₂(P(n)#)` for `P(n)` the largest prime `≤ n`, `f = ln Ĝ`.\nQuoted from `hsubpow-explicit-K.md` §1a, itself Reduction 1 of\n`attack-hsub-01.md` §1 (**[PROVEN]** there, by inspection of the lemma's proof):\n\n> **(H-sub-pow).** There is a constant `K ≥ 0` such that, for **all** integers\n> `b ≥ 2` and **all** integers `k ≥ 1`,\n> `f(b^{k+1}) ≤ f(b^k) + f(b) + K`.\n\nTwo quantifiers, and they price differently. Write `D(b,k) = f(b^{k+1}) −\nf(b^k) − f(b)` for the defect at base `b`, rung `k`. Then (H-sub-pow) at\nbase `b` with constant `K` is `sup_k D(b,k) ≤ K`, and the all-bases\nhypothesis is `sup_b sup_k D(b,k) ≤ K`.\n\n- **One base** buys only `limsup f(n)/ln n ≤ (f(b)+K)/ln b`\n (`attack-fekete-1d-02-lemma.js` header, the limsup half of the proof;\n `hsubpow-explicit-K.md` §1b P1). **[PROVEN]**\n- **All bases** buys `β = lim f(n)/ln n` exists and\n `β = inf_{n≥2} (f(n)+K)/ln n` (same source, P2). **[PROVEN]**\n\nThe direction of everything below is fixed by this: an upper bound on\n`D(b,k)` is what the hypothesis needs and is the legal direction; a lower bound\non `D` (a floor on `K`) can only make the hypothesis harder and carries no TPC\ncontent of its own. No statement in this note runs the other way.\n\n### 1b. The map, both ways, and the zone reproduced\n\nUnder the all-bases hypothesis, `β ≤ (f(b)+K)/ln b` at every `b`, so\n\n `β ≤ β_bound(K) := min_{2≤b≤82} (f(b)+K)/ln b`,\n\nwhere the minimum over the *reachable* bases is `≥` the infimum over all bases,\nso the tabulated value is an upper bound on `β` in the legal direction and never\na sharper claim. Inverting, if the true exponent is `β` then any `K` for which\nthe hypothesis holds satisfies `f(n) ≥ β ln n − K` for every `n`, hence\n\n `K ≥ K_min(β) := max_{2≤b≤82} (β ln b − f(b))`,\n\na floor on the true constant, again read only on the reachable range.\n\n| `K` | `β_bound(K)` | argmin `b` | | `β` | `K_min(β)` | argmax `b` |\n|---|---|---|---|---|---|---|\n| 1.0033 | 1.8730 | 16 | | 1 | 0.0000 | 2 |\n| 1.3946 | 2.0000 | 66 | | 1.5 | 0.3466 | 2 |\n| 2 | 2.1422 | 78 | | 1.777 | 0.7372 | 16 |\n| 3 | 2.3701 | 82 | | 1.797 | 0.7927 | 16 |\n| 5 | 2.8239 | 82 | | 2 | 1.3946 | 66 |\n| 10 | 3.9586 | 82 | | 3 | 5.7759 | 82 |\n| 11.3568 | 4.2665 | 82 | | β₂ | 11.3568 | 82 |\n\n(producer SEC D; `β₂ = 4.26645028414864191641` quoted from\n`research/dhr-verification.md` row 1a.) Three readings, all **[VERIFIED]**:\n\n- The trusted legal zone `[1.3946, 11.3568)` of `hsubpow-explicit-K.md` §1c is\n exactly `[K_min(2), K_min(β₂))` on the reachable ladder; the check lines\n `beta_bound(1.3946) = 2.0000 at b = 66` and `K_min(beta2) = 11.3568 at b =\n 82` pass. The wrong-direction guard is built into the map: `β_bound(K) ≥ 2`\n for every `K ≥ 1.3946`, by construction, so no `K` in the zone can land the\n conclusion at or below exponent 2.\n- The argmin base moves with `K`: 16 at `K = 1.0033`, 66 at `1.3946`, 78 at\n `2`, and 82 for every `K ≥ 3`. The exponent prize of any `K ≥ 3` in the\n zone rests, on this ladder, on `Ĝ(82) = G₂(79#) = 1710`, a Wang 2024 term\n adopted trusted (`redteam-0820-math.md` §1.2, **[CITED]**). At custody\n grade the ladder stops at 46 and the prize moves with it.\n- `K_min(1.5) = 0.3466` and `K_min(1.797) = 0.7927` (the two measured\n exponents of `exponent-control.md` §5 and `attack-block-01-ladder.md`,\n **[CITED]**) both sit below the measured floor `1.0033`. So the reachable\n pairs already bind harder than the asymptotic need under the measured\n exponent; the floor is set by small-`n` structure, not by the exponent.\n\n## 2. What the data needs: S(n), the power-pair defect, and the control\n\nTwo different objects answer \"what `K` does the data need\", and the brief's\nword \"defect\" covers both. `S(n) = ln(n²/Ĝ(n))` is the slack of P3\n(`hsubpow-explicit-K.md` §1b): `β < 2 ⟺ S(n) > K` at one integer, so `S` is\nthe `K` the data would need for the hypothesis to be TPC-strength. `D(b,k)`\nis the defect of the hypothesis itself: the `K` the data needs for the\nhypothesis to be *true* on the reachable pairs. The control is the one-class\nJacobsthal `ĥ(n) = h(P(n)#)`, A048670, 64 terms to `p = 311`\n(`exponent-control.md` \"The control\"; the last six terms are the\nsingle-witness b-file tail, **[CITED]**), with conjectured order\n`p(ln p)^{2+o(1)}` (Maier and Pomerance, cited there), exponent `1 + o(1)`.\n\n### 2a. The slack, on every step\n\n`S` is a step function rising within each step, so its maximum on a step is\nat the last integer before the next prime. Producer SEC B tabulates both ends\nof every step. `max_n S(n) = 1.3946` at `n = 66` reproduces the trusted trap\nceiling; the next three steps read `1.3393`, `1.3105`, `1.3804` at `n = 70`,\n`72`, `78`, below it. **[VERIFIED]** On the control the same slack reads\n`3.4965` at `n = 66` and `4.4830` at `n = 306`, and it is still rising at the\nend of the ladder: that is what an object whose exponent is below 2 looks like\non this instrument, and `G₂`'s `S` shows nothing of the kind at reach 82.\nThis is consistent with the flat ratio and says nothing about its limit\n(`phase1-T3prep-decision-rule.md`, **[CITED]**). **[MEASURED]**\n\n### 2b. The power-pair defect and its running sup\n\n15 power pairs are reachable at trusted grade (`b^{k+1} ≤ 82`), 9 at custody\n(`≤ 46`). The sup is `1.0033` at `(b,k) = (4,2)`, the pair `(16,4)`, and the\ncustody sup `0.9694` at `(2,4)`, the pair `(16,2)`; both reproduce\n`attack-hsub-01.md` §1 to four places. The running sup `K_run(n)`, the\nlargest defect among pairs with `b^{k+1} ≤ n`, moves at `n = 4, 8, 32, 64`\nand is flat from 64 to 82. **[VERIFIED]** Every pair's margin against both\nzone endpoints is in the SEC C table; the smallest is `0.3913` nats at the\nfloor and `10.3535` at the ceiling.\n\n### 2c. The control, at the same reach and at its own\n\nThe control has 15 reachable pairs at `G₂`'s reach and 29 at its own. Its\nsup is `0.6931` at `(9,1)` on the first and `0.9478` at `(10,1)` on the\nsecond: the sup moved `+0.2546` nats when the reach grew from 82 to 312. The\nrecords, in order, are set at `(2,1)`, `(2,2)`, `(4,1)`, `(6,1)`, `(9,1)`,\n`(10,1)`: after `n = 8` every record is a `k = 1` rung at a growing base. The\nper-base sups (SEC C's last line) are largest at `b = 10, 12, 9, 6` and are\nall `k = 1` or `k = 2`. **[MEASURED]**\n\nRead against `G₂`: the sup at reach 82 is a floor on the true all-bases\nconstant, and on the one control where a larger reach exists the floor moved\nby a quarter nat and moved on the diagonal. The `1.0033` is therefore not an\nestimate of `K_true` and should not be quoted as one; `attack-hsub-01.md` §5\nalready says the diagonal is blind past `√82 ≈ 9`, and the control now puts a\nnumber on what blindness costs at a fourfold reach.\n\n### 2d. The diagonal as a `δ`-meter, and why the reading is void\n\nFor an exact law `Ĝ(n) = c·n^β·(ln n)^δ`,\n\n `D(b,1) = f(b²) − 2f(b) = −ln c + δ ln 2 − δ ln ln b`,\n\nso the slope of `D(b,1)` on `ln ln b` is `−δ` with `β` and `c` both eliminated\n(**[PROVEN]**, one line; the producer's three synthetic laws at\n`δ = 0, 2, −1` return `−0.0000`, `−2.0000`, `1.0000` with zero residual). On\nthe ladders:\n\n| object | bases | slope on `ln ln b` | `δ̂` |\n|---|---|---|---|\n| `G₂` | 2..9 (n = 8) | `+0.0961 ± 0.4137` | `−0.0961` |\n| control | 2..9 (n = 8) | `+0.5298 ± 0.3018` | `−0.5298` |\n| control | 2..17 (n = 16) | `+0.5157 ± 0.1969` | `−0.5157` |\n\nThe control's conjectured `δ` is `2 + o(1)` and the instrument reads\n`−0.5157 ± 0.1969`: the wrong sign, more than two standard errors from zero,\nand much further from `−2`. So at reach 17 the diagonal is not in any regime\nwhere the exact-law formula applies, and the estimator is uncalibrated. The\n`G₂` reading, at eight bases with a standard error four times its value, is\nvoid on that ground and on its own error bar; it is **not** to be read as\n\"consistent with `δ = 0`\". **[MEASURED; the estimator fails its control]**\n\nThis is the campaign rule \"calibrate the estimator before fitting\"\n(`primeoire-campaign-lessons`) doing its job: had the control not run in the\nsame pass, the `G₂` slope would have read as a null result for `δ`.\n\n---\n\n## 3. The proof attempt at the top of the zone, tool by tool, with directions\n\nThe target, at `K = 11.3568` and then downward: for a base `b` and every\n`k ≥ 1`,\n\n **(★)** `Ĝ(b^{k+1}) / Ĝ(b^k) ≤ e^K · Ĝ(b)`,\n\na cap on the ratio of maximal twin gaps at consecutive levels of the chain\n`b, b², b³, …`, uniform in the rung. At `K = 11.3568` the caps are large:\n`1.711e+5` at `b = 2` and `2.566e+6` at `b = 9`, against observed ratios of\n`5.27` to `57.00` on the reachable rungs and a `b^{1.5}` model reading\n`2.83` to `27.00` (SEC G). The inequality is nowhere near tight on any datum.\nThat is the sense in which \"start high\" was the right instruction; what\nfollows is why it does not make the proof cheaper.\n\nEvery tool considered, with its direction and its status. \"Direction ↑\"\nmeans the tool bounds the larger object `Ĝ(b^{k+1})` from above, which is\nwhat (★) needs and is legal; \"direction ↓\" means it bounds from below and can\nonly floor `K`.\n\n| tool | direction | what it gives | status |\n|---|---|---|---|\n| T1 Bridging Lemma, `Ĝ(y′) ≤ (K*+1)Ĝ(y)` | ↑ | (★) iff `K*+1 ≤ e^K Ĝ(b)` uniformly | CLOSED: `K* ≥ π(y′) − π(y)` diverges (`hsubpow-explicit-K.md` §2, Lemma 1) |\n| T2 AP-cap density, `θ_b(y) < 1` | ↑ | (★) if the entering primes cannot kill a full window | CLOSED: `θ_b → ∞` at every base (§3 there) |\n| T3 two power envelopes, `Ĝ ≤ An^γ`, `Ĝ ≥ an^λ` | ↑ on top, ↓ below | defect `≥ (γ−λ)k ln b + O(1)` | CLOSED: `γ − λ = 3.26645` (§4 there, Lemma 2) |\n| T4 (H-mono) alone | ↓ | `D(b,k) ≥ −f(b)` | legal, empty: a floor |\n| T5 the period, `Ĝ(n) ≤ P(n)#` | ↑ | `D ≤ ln P(b^{k+1})# − …`, exponential in the level | legal, empty: diverges in `k` |\n| T6 the lifting identity (§3a, this pass) | neither | `D(b^j,k)` as block sums of `D(b,·)` | PROVEN; converts nothing (§3a) |\n| T7 the sign lemma (§3b, this pass) | ↓ | all-bases `K ≥ 1.0597δ − ln c`, `= ∞` if `δ < 0` | PROVEN for exact laws; a necessary condition |\n| T8 relative window sieve at level `b^{k+1}` over level-`b^k` slots | ↑ | a survivor in every window of length `e^K Ĝ(b) Ĝ(b^k)` | not a mechanism: it is the two-class Jacobsthal problem in the window coordinate; the CRT adversary of Lemma 1 is exactly its uncontrolled remainder |\n\nTwo of these are new and both are proven; neither is a route.\n\n### 3a. The lifting identity, and why one base does not give all bases\n\n> **Identity.** For integers `b ≥ 2`, `j ≥ 1`, `k ≥ 1`,\n> `D(b^j, k) = Σ_{i=jk}^{jk+j−1} D(b,i) − Σ_{i=1}^{j−1} D(b,i)`.\n\n*Proof.* Write `δ_i = f(b^{i+1}) − f(b^i) = f(b) + D(b,i)`. Then\n`f(b^{j(k+1)}) − f(b^{jk}) = Σ_{i=jk}^{jk+j−1} δ_i = j f(b) + Σ D(b,i)` over\nthe same range, and `f(b^j) = f(b) + Σ_{i=1}^{j−1} δ_i = j f(b) +\nΣ_{i=1}^{j−1} D(b,i)`. Subtract. ∎ **[PROVEN]**; checked to `1e−12` on the\nfour reachable instances `D(4,1), D(4,2), D(8,1), D(9,1)` (SEC F).\n\nRead: a bound `sup_i D(b,i) ≤ K` at one base gives, at base `b^j`, only\n`D(b^j,k) ≤ jK − Σ_{i **Lemma (sign).** Let `Ĝ(n) = c·n^β·(ln n)^δ` exactly, `c > 0`. Then\n> `D(b,k) = −ln c + δ[ln((k+1)/k) − ln ln b]`, so\n> `sup_{b≥2, k≥1} D(b,k) = δ(ln 2 − ln ln 2) − ln c = 1.0597δ − ln c`,\n> attained at `(b,k) = (2,1)`, if `δ ≥ 0`; and `= +∞` if `δ < 0`, the\n> `k = 1` rung diverging as `b → ∞`.\n\n*Proof.* `f(b^{k+1}) − f(b^k) − f(b) = −ln c + δ[ln((k+1)ln b) − ln(k ln b) −\nln ln b]`. For `δ ≥ 0` both brackets are maximised at `k = 1`, `b = 2`\n(`ln ln 2 < 0`). For `δ < 0`, `−δ ln ln b → +∞`. ∎ **[PROVEN]** Exhibited in\nSEC E: at `c = 1`, `β = 1.5`, `D(b,1)` runs `0.1409` to `2.3381` from\n`b = 10` to `10⁹` for `δ = −1`, `0.0141` to `0.2338` for `δ = −0.1`, and\n`−0.1409` to `−2.3381` for `δ = +1`.\n\nConsequences, stated in the legal direction only:\n\n- **The all-bases hypothesis is not a regularity assumption on the exponent;\n it is a claim about the sign of the second-order term.** Any decreasing\n correction to a pure power (a `1/ln`, a `1/ln ln`, any `g` with\n `g(b²)/g(b)² → ∞`) makes it false for every finite `K`, while the\n fixed-base hypothesis survives all of them. Where the corpus locates the\n risk on the diagonal (`attack-hsub-01.md` §5; `fekete-1d.md` §4), this\n says what the diagonal is measuring.\n- **What is known about `δ` for `G₂`: nothing two-sided.** If `β = 1`\n exactly (the \"structural, if Q bounded\" row of `exponent-control.md` §5)\n then the FGKMT floor `Ĝ ≥ g ≫ x ln x lnlnln x/lnln x`\n (`two-class-lower-bounds.md` §3, **[CITED]**) forces the correction up from\n below, but nothing bounds it above at any exponent; if `β > 1` nothing\n constrains its sign at all. The corpus's LOG null `1.016·p·ln²p`\n (`attack-fekete-1d-01-defect47.js` SEC F) has `δ = 2` and satisfies the\n lemma with room; the corpus never entertained a `δ < 0` law, which is why\n the qualifier went unstated.\n- **The `K` an exact law needs is priced.** Under `δ = 2`, the log term alone\n contributes `1.0597` per unit `δ` at `(2,1)`; whether that lands in the trap\n `[1.0033, 1.3946)` or the zone depends on `ln c`, which no exact law for\n `G₂` supplies. This is a heuristic pricing on a model, not a bound on\n `K_true`. **[HEURISTIC]**\n\n## 4. The single inequality that does not close, and whether it is a proof gap or a truth gap\n\n### 4a. The inequality\n\n- **needed, one base:** (★) `Ĝ(b^{k+1}) ≤ e^K Ĝ(b) Ĝ(b^k)` for every `k ≥ 1`,\n at some fixed `b`, with `K` in the zone at that base (which, by SEC G, means\n `b ≥ 72` at `K = 11`, `b ≥ 49` at `K = 10`, `b ≥ 16` at `K = 7.6394`, any\n `b` at `K ≤ 2`).\n- **needed, all bases:** (★) at every `b`, which contains the squaring family\n `Ĝ(b²) ≤ e^K Ĝ(b)²` for all `b` (the `k = 1` rungs).\n- **available:** per-instance certificates at eleven doubling steps\n (`attack-doubling-01.md` §3, **[CITED]**) and the 15 reachable pairs, all\n with `D ≤ 1.0033`. No bound on any ratio `Ĝ(by)/Ĝ(y)` that is uniform in\n `y` exists in the corpus or, so far as the corpus's reading of the\n literature goes, outside it: Iwaniec's and the DHR two-class bound are\n absolute power bounds at a single level, and the lower bounds are absolute\n too; T3 shows a pair of absolute bounds never yields a uniform ratio.\n- **gap:** the whole of (★). Nothing narrows it to a constant.\n\n### 4b. Proof gap or truth gap\n\n**At a fixed base, a proof gap.** Every law the corpus entertains satisfies\n(★) at fixed `b` with a finite `K` (the sign lemma at fixed `b` is finite for\nevery `δ`), the reachable rungs carry margins of `0.3913` nats at the floor\nand `10.3535` at the ceiling, and no decisive rung is reachable\n(`hsubpow-explicit-K.md` §1d: the base-16 chain's first instance is\n`G₂(251#)`, unenumerable). What is missing is a method, not a fact. The\nmethod would have to bound the maximal gap at one level by the maximal gap at\nthe level below times a constant, in every window, which is the two-class\nJacobsthal problem in its window coordinate; `hsubpow-explicit-K.md` §5\nprices the legal-zone version at TODO 1b's strength, and this pass refines\nthe pricing: at `K` near the ceiling the bases that convert it into\n`β < β₂` are only the largest reachable ones, so the base at which the proof\nmust be done is large and the `Ĝ(b)` factor in (★) is a number the corpus\nknows only from Wang's terms.\n\n**Across all bases, a possible truth gap.** By the sign lemma the all-bases\nhypothesis is false for every finite `K` under any law with `δ < 0`, and the\nsign of `δ` for `G₂` is unknown (§3b). This is a statement about whether the\nhypothesis is *true*, not about whether it can be proven, and it is the\nfirst place in the 1d route where the answer could be \"no\" for a reason\nunconnected to TPC. It is not a closure: `δ ≥ 0` is what every model in the\ncorpus assumes and what the FGKMT floor supports if `β = 1`.\n\n**What would falsify (H-sub-pow) at a given `K`, and whether the data does.**\nOne pair with `D(b,k) > K`. At `K = 1.3946` none of the 15 reachable pairs\ndoes (largest `1.0033`); at `K = 11.3568` the nearest is `10.3535` nats away.\nThe data falsify nothing at any `K ≥ 1.0033`, and, since the running sup is\nflat from `n = 64` to `82` while the control's moved `+0.2546` nats over a\nfourfold reach, the flatness at `G₂`'s reach is not evidence that the sup has\nconverged. A future exact term at `47#` (priced at 1.49 days per run,\n`phase1-T2b-exact-ladder.md`, **[CITED]**) adds no power pair at all\n(`47² > 82`): the first new rung is `(b,k) = (2,6)`, and the\nfirst new diagonal point is `b = 10` at `n = 100`, which on the control is\nexactly where its record moved.\n\n### 4c. Why the closed routes were not reopened\n\nThe Bridging Lemma, the density caps and the two-envelope shape are cited as\nclosed and were not re-run (`REFUTED.md` carries the certificate route, the\nmaxsum bridge and the block ladder as separate rows; `hsubpow-explicit-K.md`\n§§2–4 carries the three mechanisms). The lifting identity of §3a expresses\nhigher bases through lower ones and is not the squaring-ladder recursion: it\nintroduces no averaging, forgets nothing, and is an exact identity that\nconverts no bound. The squaring family appears in this note only as the\n`k = 1` rung of the hypothesis itself, which is where the sign lemma lives;\nno argument here proceeds by squaring.\n\n---\n\n## 5. NOT REACHED, falsifiers, trap grading\n\n**Not reached.**\n\n- No instance of (H-sub-pow) is proven or refuted, at any base, with any `K`.\n- No fourth mechanism with direction ↑ and a finite output. T8 is the wall\n restated in the window coordinate, not a method.\n- The sign of `δ` for `G₂`. The diagonal instrument fails its control and no\n other instrument for `δ` was built.\n- `Ĝ` past 82 is untouched; no enumeration; the control's b-file tail is\n used as adopted, not re-verified.\n- The sign lemma is proven for *exact* power-log laws. For laws with\n oscillating corrections (`c₁ ≤ Ĝ/(n^β ln^δ n) ≤ c₂`) the same proof gives\n `K ≤ ln(c₂/c₁²) + 1.0597δ` for `δ ≥ 0` and divergence for `δ < 0`; this\n bound is stated, not exhibited numerically.\n\n**Falsifiers, and whether each check has run.**\n\n| claim | falsifier | has it run |\n|---|---|---|\n| the map reproduces the zone | a reachable `b` giving `β_bound(1.3946) < 2` or `β_bound(11.3568) < β₂` | yes, exhaustive over `b ∈ [2,82]`, both checks pass (SEC D) |\n| the sup is a floor that moves | a control whose sup is flat across a fourfold reach | the one control available moved `+0.2546`; a second control (h2, 21 terms) has less reach than `G₂` and was not used |\n| the diagonal estimator is uncalibrated | a control reading with the right sign within its error | the control reads `+0.5157 ± 0.1969` against a conjectured `−2`; the falsifier did not occur |\n| the sign lemma | an exact law with `δ < 0` and bounded all-bases defect | impossible by the proof; numerically `D(b,1)` reaches `2.3381` at `b = 10⁹` for `δ = −1` |\n| the lifting identity | one reachable instance off by more than rounding | four instances, all to `1e−12` |\n| \"no `K` is proven\" | any derivation of an explicit constant | none produced; the trap grading below is therefore vacuous |\n\n**Trap grading.** No explicit `K` was derived. The two proven statements are\nan identity and a necessary condition; both can only raise the `K` a proof\nwould need, never lower it. `β_bound(K) ≥ 2` for every `K ≥ 1.3946` by\nconstruction, so nothing tabulated lands at or below exponent 2. No\ninequality in this note bounds `Ĝ` from above.\n\n**Defects noticed in passing, not edited.**\n\n- `fekete-1d.md` §4 and `attack-fekete-1d-01-defect47.js` reading 7: \"every\n power-log law has a bounded window-sup defect\" needs \"with `δ ≥ 0`\"; the\n same passages correctly place the risk on the diagonal.\n- `TODO.md` item 1d: \"an explicit K inside it gives `β ≤ (ln 66 + K)/ln 16 <\n β₂`\" is true only for `K` below the old ceiling; at the corrected ceiling\n the base-16 bound reads `5.607` and base 82 carries the improvement.\n- The brief for this task quotes the eleven-term flatness figure that\n `hsubpow-explicit-K.md` §7 already flags as a nine-term figure; not\n re-litigated here.\n\n---\n\n## 6. Sources and reproduction\n\n| artifact | what it carries |\n|---|---|\n| `research/history/staging/attack-0829n-hsubpow-K.js` | custody of the three ladders (SEC A); `S` on every step and the control's (B); the 15 + 9 + 29 power-pair defects, running sups, the control at both reaches (C); `β_bound(K)` and `K_min(β)` (D); the diagonal slopes, synthetic calibration, the sign lemma's numbers (E); the lifting identity (F); the caps and margins at the top of the zone and the base-16 formula (G); nine readings |\n| `research/history/staging/hsubpow-explicit-K.md` §§1–5, 9 | the statement, the corrected zone, the three closed mechanisms, the sup-versus-average pricing |\n| `research/history/staging/attack-hsub-01.md` §§1, 5 | Reduction 1, the 1.0033 / 0.9694 floors, the diagonal's blindness past 9 |\n| `research/history/staging/fekete-1d.md` §§4–6 | the lemma, its hypotheses, the power-log sentence corrected above |\n| `research/attack-fekete-1d-02-lemma.js` | the eight-line proof and the LOG / POW controls |\n| `research/exponent-control.md` \"The control\", §5 | the A048670 control, its conjectured order, the measured exponents 1.50 and 1.777 |\n| `research/import-interp-01-bgt-defect.js`, `research/exact-g2-ladder.js`, `research/exponent-control.js` | the three ladders, parsed at run time |\n| `research/dhr-verification.md` row 1a | `β₂` |\n\nReproduce with `node research/qc/embed.js --check\nresearch/history/staging/attack-0829n-hsubpow-K.js`; the fingerprint matches\nas of 2026-08-29 (`code-sha256 50759706…`, `out-sha256 686c9c43…`,\n`body-lines 166`).\n"},"research/history/staging/attack-0829n-rml-proof.md":{"lf_sha256":"a581aa2459597058e65cea8f4efba10a8e9d829f1407e7ed134ff4d09b96b537","content":"# The proof attempt on RML: the chain from the proven mean square to an exponent below β₂, and the one arrow that does not close\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-rml.md`: 12 claims\n> stand, 14 fail at sentence level, none inflating any result — the\n> load-bearing one errs in the CONSERVATIVE direction).** PROVEN under\n> independent code: the whole CAP lemma of §4.1, including the sine-sum step\n> this note checked only numerically (Σ 1/sin(πa/e) ≤ e·H_{⌊(e−1)/2⌋} + 1 ≤\n> e(ln e + 1), violated at no e ≤ 20000), the slope 2.7660 ± 0.2120 with its\n> 1.10 and 5.82 se placements, and the reduction. WHAT FAILS: (i) §2's\n> `ms_m`/`ask` column is log_z √(B·H) with B the PROVEN Lemma V constant, i.e.\n> the exponent of the proven BOUND on the rms, not of the rms ⟨R_H²⟩^{1/2}\n> that REC names; the two part by 36.53× to 200.45× because ⟨R_H²⟩ saturates\n> once H passes the correlation length while B·H grows linearly, so §5's\n> reading \"at u₀ = 3.0 and 3.5 ask does not exceed gauss\" REVERSES at every\n> row when both sides are measured against the same mean square; (ii) \"gauss\n> → 0\" and \"sup/rms ≤ √(2 lnW)·O(1) = z^{o(1)}\" are both wrong (the limit is\n> 1/2, measured 0.5645 at z = 1e7) and contradict this note's own §0; (iii)\n> \"the recovery exponent … 0.99–1.29\" quotes the `truth` column, whose real\n> value is 0.56–0.67; (iv) \"REC would be moot rather than false\" should read\n> false; (v) \"u_cap → 2s\" and \"n ~ z^{2s}/polylog\" are asserted, not proven\n> (`verify-0830-usup-convention.md` §6's \"OPEN in both directions\" is the\n> better-calibrated reading); (vi) the 1.509-octave correction is still\n> unapplied in three places. NEW: u_cap crosses β₂ at z = 53, reaches 4.4891\n> at z = 79, and passes u_triv from z = 53.\n\n*(2026-08-29 night wave, staging. Producer:\n`research/history/staging/attack-0829n-rml-proof.js`, embedded via\n`qc/embed.js`. No existing file edited, no git command run. Every number\nbelow is either in the producer's OUTPUT block or a quotation of an embedded\nartifact cited by file and section. Calibration per claim: PROVEN, MEASURED,\nHEURISTIC, OPEN, REFUTED.)*\n\n## 0. What is open, first\n\n- **RML(α) is open at every α, and so is every form F1–F4. Nothing here\n lowers any exponent.** The deliverable is a location, not a theorem: the\n chain from Lemma V's PROVEN mean-square bound to an exponent below\n β₂ = 4.26645 has one open arrow, written down in §3 with its quantifiers,\n and none of the five attempts in §4 closes it.\n- **The open arrow is Lemma V's sup form (F2 of `rho-maximal-law.md` §1)\n with the proven mean square factored out.** It is not a new statement. What\n is new is the accounting: which part of F2 is proven (the rms), what the\n remainder must supply (a recovery of the sup from the rms by a factor\n z^{u₀/2−ε}), what every proven recovery actually costs (either the\n position-union price e^{θ(z)/q} or the term-count cap z^{2s+o(1)}), and\n what the truth measures (the sup exceeds the rms by about √(4θ(z)), i.e.\n z^{1/2+o(1)} if the Gaussian form persists).\n- **Finite-z sufficiency is calibration, not a result.** At z ≤ 37 even the\n term-count cap reads below β₂ (u_cap 3.4103 → 4.0593, OUTPUT S2), which is\n the Bonferroni-x ≤ 227 phenomenon of `rho-maximal-law.md` reading 4 at yet\n another instrument. No row of any table below is evidence for an asymptotic\n statement; the rows are there to show the arrow is true where it can be\n seen, and by how much.\n- **Asymptotically the arrow is undecided in both directions.** The truth's\n measured slope, 2.7660 ± 0.2120 on seven points spanning less than one\n octave of z (OUTPUT S5), leaves 1.23 exponents of room under u₀ = 4 and\n 0.23 under u₀ = 3; the corpus's standing observation that local slopes here\n rise with z (`rho-maximal-law.md` reading 6; `rho-exact-z31-01.md` §0)\n applies. The u₀ = 3 form could be false; the u₀ = 4 form is 5.8 se clear on\n a fit that cannot refute an asymptotic statement.\n- **What this note did not do.** It ran no new sup over positions (the exact\n points at z = 31, 37 were bought on 2026-08-29 by `rho-exact-z31-01.md`),\n it did not price the smooth-profile form again (CLOSED, `REFUTED.md`\n \"manufacturing the smooth profile\"), and it did not touch ⟨ρ̃⁴⟩, the named\n stopping object of `attack-rhoms-01.md` §3.\n\n## 1. The objects and the direction of every inequality (wrong-direction guard)\n\nFix s = 3.0 (the measured family; any s > 1 + √e = 2.6487 gives M > 0), a\nprime z, W = P(z), D = z^s, the divisor-pair lattice (block, d₁, d₂) with\nq = [d₁, d₂], w = ε μ(d₁)μ(d₂) ∈ {±1}, c the CRT class, n the term count and\nM = Σ w/q > 0 (`rho-maximal-law.md` §1). The potential ρ(y) = Σ_j w_j\nψ((y − c_j)/q_j), the centred ρ̃ = ρ + M/2, and for a window H the certificate\n\n T(x) = H·M + R_H(x), R_H(x) = ρ(x) − ρ(x + H),\n\nwith T(x) ≤ #{twin-admissible r ∈ (x, x+H]} pointwise (Brüdern–Fouvry,\nPROVEN, `rho-maximal-law.md` §2 (iv)). The consumer is min_x T(x) ≥ 1, which\ngives G₂(z#) ≤ H. Every inequality this note uses or asks for, with its\ndirection and why it is legal under `attack-wrongdirection-audit.md`:\n\n| # | inequality | direction | rung | legality |\n|---|---|---|---|---|\n| I1 | ⟨R_H²⟩ ≤ B(z,s)·H, B ≤ 9A²(E−1) = O(ln⁸z) | upper bound on a period mean | PROVEN (`lemmaV-parseval.js` L1–L5; `redteam-0829-theorem1.md`) | no position quantifier; gives only almost-all statements at any H, so it carries no TPC content even at H < z² |\n| I2 | sup_x \\|R_H(x)\\| ≤ H·M − 1 at H = z^{u₀}, ONE fixed u₀ ∈ (2, β₂) | upper bound on the remainder, the direction that bounds G₂ from above | OPEN (= F2 at (s, u₀)) | legal by audit row 10: the band (2, β₂] is exhibited legal, α = β₂ being PROVEN with TPC open. TPC-strength if u₀ ≤ 2 (Gap Reformulation, constant < 1 at exponent 2) or if stated uniformly in u down to 2 (Axis A). This note fixes u₀ and never lets it move |\n| I3 | REC(s,u₀): sup_x \\|R_H(x)\\| ≤ z^{u₀/2−ε}·⟨R_H²⟩^{1/2} at H = z^{u₀} | upper bound on a sup by a multiple of an rms | OPEN, the arrow | implies I2 through I1 and M ≍ 1/ln²z; same legality as I2, same trap at u₀ = 2 (there it would read sup ≤ z^{2−ε}·polylog < z²/ln²z, i.e. o(z²), which is TPC) |\n| I4 | sup\\|R_H\\| ≤ Σ_e Vabs(e)·e·(ln e + 1) =: CAP(z) for every H | upper bound, absolute values across moduli | PROVEN here (§4.1) | harmless: delivers exponent 2s + o(1) ≥ 2(1+√e) = 5.2974 |\n| I5 | M ≥ c(s)/ln²z at s > 1+√e | lower bound on the main term | standard, CITED; MEASURED M·ln²z = 0.3359–0.3772 at z = 13..37 (OUTPUT S0) | no twin content |\n| I6 | the floor: no correct law delivers H below nP(z); th(nP) ≥ 2.0106 at z = 47 | lower bound on any deliverable window | MEASURED (`rho-maximal-law.md` §2, rider 2) | the reverse direction; if it ever exceeded β₂ it would kill the item, and it is undecided asymptotically |\n\nTwo things the table makes explicit. I1 is the strongest possible statement\nabout the remainder on average: at every level D and every H the mean square\nis √H·polylog, square-root cancellation with no level restriction, and it is\nproven. The consumer needs something far weaker in size, H/ln²z, but\npointwise. The whole distance between I1 and I2 is the quantifier over x,\nwhich the corpus has priced before (`sift-limit-attack.md` §7e: \"the price is\nexactly the quantifier\"); what §3 does is write that price as one inequality\nwith its exponent.\n\n## 2. The chain, each arrow graded\n\nThe vector sieve consumes one statement, min_x T(x) ≥ 1 at some H = z^{u₀}.\nRead from the proven end:\n\n```\n (C1) <= B(z,s) H PROVEN L1-L5 (lemmaV-parseval.js); every H, z, s\n (C2) B(z,s) <= 9 A(z)^2 (E(z)-1) = O(ln^8 z) PROVEN redteam-0829-theorem1.md; no hypothesis\n => rms(R_H) <= z^{u0/2} (ln z)^4 O(1) PROVEN composite of C1, C2 at H = z^{u0}\n (C3) sup_x |R_H(x)| <= z^{u0/2 - eps} rms OPEN REC(s,u0), the arrow, sec.3\n (C4) M >= c(s)/ln^2 z (s > 1 + sqrt e) CITED standard linear sieve; MEASURED 0.3359-0.3772 (S0)\n => sup_x |R_H(x)| <= H M - 1, z >= z0 PROVEN from C3 + C2 + C4 (the polylogs are absorbed by z^eps)\n (C5) T(x) = H M + R_H(x) PROVEN exact identity\n (C6) T(x) <= #{admissible r in (x, x+H]} PROVEN Bruedern-Fouvry pointwise, pilot-verified\n => G2(z#) <= H = z^{u0}, z >= z0 PROVEN from C4-C6: exponent u0 < beta_2\n```\n\nBeside the open arrow stand two proven arrows that reach the consumer\nwithout it, and both land above β₂:\n\n```\n (C3-triv) sup|R_H| <= 2 sup|rho~| <= n + M PROVEN triangle inequality over the lattice\n => exponent u_triv -> 2s + o(1) at s = 3: 6; at s -> 1+sqrt e: 5.2974\n (C3-cap) sup|R_H| <= CAP(z) = sum_e Vabs(e) e (ln e + 1) PROVEN sec.4.1, this note\n => exponent u_cap -> 2s + o(1) same asymptote; 3.4103 -> 4.0593 at z = 13..37 (S2)\n (C3-cheb) #{x : |R_H(x)| >= HM-1} <= B H W/(HM-1)^2 PROVEN Chebyshev off C1\n => almost-all exponent 0, sup exponent none attack-beta2-01 item 2; rho2-analytic-bound.md sec.4\n```\n\nAt numbers, s = 3.0, from OUTPUT S1 (exponents base z; rows with H > W\ndropped):\n\n| u₀ | z | need = log_z(HM−1) | ms_m = log_z √(B_meas H) | ask = need − ms_m | union = θ(z)/(2 ln z) | truth = log_z(2 sup\\|ρ̃\\|) |\n|---|---|---|---|---|---|---|\n| 4.00 | 19 | 2.9033 | 2.0613 | 0.8420 | 2.2319 | 0.9873 |\n| 4.00 | 29 | 2.9763 | 2.0568 | 0.9195 | 2.8544 | 1.0626 |\n| 4.00 | 37 | 3.0104 | 2.0551 | 0.9553 | 3.6036 | 1.2874 |\n| 3.00 | 19 | 1.9021 | 1.5613 | 0.3408 | 2.2319 | 0.9873 |\n| 3.00 | 37 | 2.0102 | 1.5551 | 0.4551 | 3.6036 | 1.2874 |\n| 4.25 | 37 | 3.2604 | 2.1801 | 1.0803 | 3.6036 | 1.2874 |\n\nRead across a row: the consumer at (3.0, 4.0), z = 37 needs sup|R_H| under\nz^{3.0104}; the proven mean square hands over an rms of z^{2.0551}; so the\narrow must recover the sup from the rms within a factor z^{0.9553}\n(asymptotically z^{u₀/2 − o(1)} = z^{2−o(1)}, the finite-z figure being\nsmaller because M and the polylogs bite); the only fully proven recovery,\na union over the W positions, charges z^{3.6036} and rises like z/(2 ln z);\nand the truth, certified from the exact sup|ρ̃|, sits at z^{1.2874}. The\narrow is the inequality truth ≤ ask, and at every measured level it holds\nby a wide margin (§5); the union price exceeds the ask at every level from\nz = 19 on and diverges.\n\n**Which arrow is \"the\" open one.** C3 is the only arrow in the first block\nthat is not PROVEN or CITED-standard. C4's citation is standard linear-sieve\nasymptotics at s > 1+√e and is not in doubt; C6 is Brüdern–Fouvry's pointwise\ninequality, verified. So (a) of the brief is answered: one open arrow, C3,\nand everything else in the chain is a theorem.\n\n## 3. The open arrow, isolated, with its quantifiers and its payoff\n\n**REC(s, u₀).** Fix s > 1 + √e and u₀ ∈ (2, β₂). There exist ε > 0 and z₀\nsuch that for every prime z ≥ z₀, with D = z^s, H = ⌊z^{u₀}⌋, W = P(z), the\nsigned sawtooth remainder of the level-D vector-sieve lattice satisfies\n\n sup_{x ∈ ℤ/W} |R_H(x)| ≤ z^{u₀/2 − ε} · ⟨R_H²⟩^{1/2},\n\nthe mean on the right taken over one full period. Quantifier discipline: the\nsup is over ALL W positions; s and u₀ are fixed before z; ε may depend on\n(s, u₀) but not on z; u₀ is never a function of z and is never sent to 2.\n\n**Equivalent forms, so the arrow can be recognised in other clothing.**\n\n- In sieve currency: a level of distribution for the signed two-class\n Rosser comb in short intervals, uniformly in the interval's position. The\n joint level is D² = z^{2s} = H^{θ_total} with θ_total = 2s/u₀; at (3.0, 4.0)\n that is θ_total = 1.5, and the break-even the corpus has already priced is\n θ_total > 1.2090 for Brüdern–Fouvry's asymmetric split\n (`sift-limit-attack.md` §7b) and 5.297442541400/β₂ = 1.241651 for the\n symmetric lattice used here (§7b (1b)). REC is that level statement with\n the remainder's size measured against its own rms rather than against H.\n- In the F-ladder of `rho-maximal-law.md` §1: REC(s, u₀) is F2 at window\n exponent u₀ with the mean square factored out. F2 ⟸ REC, and F3 = RML(α)\n with α < u₀ ⟹ REC (through |R_H| ≤ 2 sup|ρ̃|). F4 (the Gaussian form,\n λ = 0) ⟹ REC with room to spare: it supplies sup/rms ≤ √(2 lnW)·O(1) =\n z^{o(1)}, against an allowance of z^{u₀/2 − ε}.\n- The weakest law-shaped form beneath it is per-position in H: ∀x ∃H ≤ z^{u₀}\n with T_H(x) ≥ 1. It is implied by REC and it is exactly \"every window of\n length z^{u₀} contains a certified survivor\"; no instrument in the corpus\n distinguishes it from F1, and it is listed so the ladder has its bottom.\n\n**What its truth gives, quantified.** REC(s, u₀) ⟹ G₂(z#) ≤ z^{u₀} for all\nz ≥ z₀ (chain C4–C6), an unconditional two-class exponent u₀. At u₀ = 4.0 the\nmovement below β₂ is 0.266 of exponent; at u₀ = 4.25 it is 0.016; at\nu₀ = 3.0 it is 1.266 [ARITHMETIC: β₂ − u₀ on the cited β₂], and the u₀ = 3.0\nform is the one the data leave least room for (§5). Every u₀ here is above the measured floor th(nP) ≥ 2.0106\n(z = 47, I6), so none is excluded by the floor at any measured level.\n\n**What it costs, in the corpus's own currencies.** Against the trivial\naccounting (C3-triv, C3-cap) REC asks for a saving of z^{2s − u₀ − o(1)} over\nthe triangle inequality, uniformly in x: z^{2.0} at (3.0, 4.0), z^{1.75} at\n(3.0, 4.25), and z^{1.031} at the cheapest legal point (s → 1+√e, u₀ → β₂)\n[ARITHMETIC: 2s − u₀, and 5.2974 − 4.2665 on the cited constants], which is\nthe 2(1+√e) − β₂ gap the corpus has carried since `sift-limit-attack.md`\n§4.5. Against the proven mean square it asks for a\nrecovery exponent below u₀/2, where the proven recoveries cost θ(z)/(2k ln z)\nat moment order k (`attack-rhoms-01.md` §3), i.e. diverge. The measured truth\nof the recovery exponent is log_z(2 sup|ρ̃|/rms): about 0.99–1.29 in the\ntable of §2, and if the Gaussian form persists it is 1/2 + o(1).\n\n**Kill checks, run.** (i) Is REC on a REFUTED row? No. The rows nearest it\nare \"Lemma V's mean-square form as the missing factor\" (CLOSED because B was\nnever binding, which is the statement C1–C2 are proven and irrelevant to C3),\n\"u_sup as an unconditional worst-position bound\" (CLOSED; C3-cap is that route\nwith its asymptote named, not the arrow), \"the ℓ¹ → ℓ²√log conversion\"\n(CLOSED because that conversion IS the sharp maximal law; REC asks for\nℓ² × z^{u₀/2}, not ℓ² × √log), \"generic chaining\" (CLOSED; not retried), and\n\"the Kowalski–Michel–Sawin branch\" and \"manufacturing the smooth profile\"\n(CLOSED; §4.5 says why they are not REC). (ii) Is REC TPC-strength? No, at\nfixed u₀ > 2 (§1, I3). (iii) Is it already listed ANSWERED? No: QUESTIONS.md\ncarries Q-rho-maximal-law as PARTIAL with the law itself open, and this note\nis the proof attempt that item calls for, not a re-run of its measurements.\n\n## 4. The attempt, and where it dies\n\nFive routes were tried on REC. One produced a small theorem (4.1, an\nasymptote for a closed route); none produced the arrow. Each is recorded\nwith the exact place it stops.\n\n### 4.1 Term-by-term accounting is capped at 2s + o(1), and the cap is the trivial-level exponent\n\n**Lemma (PROVEN here).** For every H, sup_x |R_H(x)| ≤ CAP(z) :=\nΣ_{e | P(z), e > 1} Vabs(e)·e·(ln e + 1), and CAP(z) ≤ z^{2s}·(2s ln z + 1)·\n6·Π_{p β₂ at every admissible\ns; the divergence disjunct is now refuted at fixed s.\n\n### 4.2 Position-union routes, including hypercontractivity, are dominated by 4.1\n\nChebyshev and the moment ladder are on record: sup ≤ W^{1/2k}·‖R_H‖_{2k}\npays e^{θ(z)/2k} and needs k ≍ z/(1.53 ln z) (`attack-rhoms-01.md` §3;\n`rho2-analytic-bound.md` §4). The one route not on record is the product\nstructure of the positions: x ∈ ℤ/W ≅ Π_{p 2s + log_z\n(#moduli): strictly worse than 4.1. Rung: the negative is elementary; no\nhypercontractive theorem was cited because its best case is already\ndominated. **Where it dies:** the atom √p, i.e. one residue class has no\ncancellation by itself; the saving must come from the signs w_j across\nterms, which no per-term or per-coordinate bound sees.\n\n### 4.3 Window smoothing and the P(y) lever move polylogs, not the exponent\n\nAveraging T_H(x) over H ∈ [H₀, 2H₀) is legitimate for the consumer (an\naverage ≥ 1 forces some T_H(x) ≥ 1, hence a survivor in (x, x + 2H₀]) and it\nreplaces |S_H(a/e)| ≤ 1/(2‖a/e‖) by a Fejér-type kernel ≤ c/(H₀‖a/e‖²),\nwhich cuts the per-modulus ℓ¹ mass from e ln e to about e²/H₀ for e < H₀\nand does nothing for e > H₀. Choosing H ≡ 0 mod P(y) kills every modulus\nall of whose primes are < y exactly (V1). Measured: at u₀ = 4 the moduli\nabove the window carry 0–27.26% of CAP over z = 13..37 (S3), so at\ncomputable z the smoothing would remove most of the ℓ¹ mass, and the P(y)\nlever at y = ⌈4 ln z⌉ removes 31.64% of CAP at z = 13 falling to 1.713% at\nz = 37 (S4). Neither touches the asymptote: **the part of CAP below\nz^{u₀ − δ} is at most z^{u₀ − δ}·polylog (PROVEN, from the second\ninequality of 4.1 applied to e ≤ z^{u₀ − δ}), so it is below HM − 1 for\nlarge z at any fixed δ > 0, and REC needs proving only for the moduli in\n(z^{u₀ − δ}, z^{2s}]**. At (u₀, δ) = (4, 0.5) that part reads 0.3948, 0.3884,\n0.5067, 0.5346 of HM − 1 at z = 19, 29, 31, 37, already below 1 but rising\n(the polylog dominates the z^{−δ} at these z), and the remaining moduli carry\n24.45–56.84% of CAP (S3). **Where it dies:** the moduli above the window\nare exactly the terms whose class hits the window at most once, so the\nreduced arrow is a bound on the signed count of large-modulus hits,\nΣ_{r ∈ (x, x+H]} Σ_{d₁ | r, d₂ | r+2, [d₁,d₂] > z^{u₀−δ}} w(d₁,d₂) = o(H/ln²z)\nfor every x — the definition of the problem with the easy part removed, and\nno instrument for it.\n\n### 4.4 The mean square is not improvable into the arrow\n\nI1 is already square-root cancellation at every level, uniform in s\n(B ≤ 9A²(E−1) with no s in it, `redteam-0829-theorem1.md` §1). Improving B\nto O(1) (measured flat 1.3833–1.4883, `attack-AB-bounded.md` §1.4) would\nchange ms_m by O(ln ln z/ln z) and nothing in the ask column of §2. The\ncorpus's row \"Lemma V's mean-square form as the missing factor — CLOSED\" is\nconfirmed from this side: C1–C2 are a theorem, and they are not where the\nexponent is lost.\n\n### 4.5 The fixed-smooth-profile form is not the arrow, from both ends\n\nWritten in the form the Kloosterman-fraction instruments prove: for smooth\ncompactly supported g₁, g₂ and arbitrary 1-bounded α, β,\nΣ_{d₁, d₂} g₁(d₁/D₁) g₂(d₂/D₂) α(d₁) β(d₂) e(−2h d̄₁/d₂) e(−hx/(d₁d₂)) ≪\n(D₁D₂)^{γ}·H^{o(1)}, uniformly in x, with γ ≤ 0.827142 needed against\nBettin–Chandee's 0.970624 (`rho-maximal-law.md` §5; `sift-limit-attack.md`\n§7b). It is disconnected from REC at both ends. (i) The instruments need a\nsmooth factor in the modulus and the inverted variable; the Rosser weight\nμ(d)·1_{S^±}(d) has none and cannot be decomposed into any: its\nlow-frequency share sits at the random-sign noise floor at 31 of 31 slices\n(`smoothness-front.md` §4.3; `REFUTED.md` \"manufacturing the smooth\nprofile\", CLOSED). (ii) The consumer cannot take a smooth g either:\nBrüdern–Fouvry's pointwise inequality needs λ⁻ ≤ 1_{rough} ≤ λ⁺, which\nMöbius-signed Rosser supports supply and a smooth profile does not. (iii)\nGranting the smoothness anyway, the published bound prices at exponent\n5.0907 > β₂ and holds for x ≪ H^{1.21} against a period of exp(H^{0.2344})\n(`rho-maximal-law.md` §5). So \"at a fixed smooth profile\" the statement is\na different statement with a closed hypothesis, not REC in other clothing.\nRung: CITED throughout; nothing re-priced here.\n\n## 5. Proof gap or truth gap: the arrow against the data\n\n**Against the sharp form first, as the brief asks.** The TPC-implying sharp\nlaw is sup|R_H| ≤ √⟨R_H²⟩·√(2 ln W) at the operative window H ≈ 0.5 z², with\nconstant 1; it fails at z = 19 by 0.6% and on 528 of 640 windows at z = 31\n(`rho-maximal-law.md` §4; `rho-exact-z31-01.md` §4.5). REC is at H = z^{u₀}\nwith u₀ > 2 and allows a factor z^{ask} in place of √(2 ln W): in the table\nof §2 the allowance ask exceeds the Gaussian factor gauss = log_z(2√(2 ln W))\nat every level from z = 19 at u₀ = 4.0 (0.8420 against 0.7905 at z = 19,\n0.9553 against 0.7392 at z = 37) and at u₀ = 4.25, while at u₀ = 3.0 and 3.5\nit does not (0.3408–0.4551 and 0.5918–0.7053 against 0.7392–0.7905). So at\ncomputable z the u₀ ≤ 3.5 forms ask for less than Gaussian recovery and are\nthe forms a sharp-law failure could touch; the u₀ ≥ 4.0 forms sit above the\nGaussian line there, and the sharp law's death at z = 19 says nothing about\nthem. Asymptotically ask → u₀/2 − o(1) while gauss → 0, so every form ends\nabove the Gaussian line; the finite-z ordering is a statement about where\nthe polylogs bite.\n\n**At every computable level the arrow holds, with a certified margin.**\nSince sup|R_H| ≤ 2 sup|ρ̃| (exact), F(z, u₀) = (HM − 1)/(2 sup|ρ̃|) is a lower\nbound on the true margin. From S1 (rows with H < W only):\n\n| u₀ | F at z = 19, 29, 31, 37 | log_z F |\n|---|---|---|\n| 3.00 | 1.478e+1, 2.166e+1, 1.548e+1, 1.360e+1 | 0.9148, 0.9134, 0.7977, 0.7228 |\n| 3.50 | 6.462e+1, 1.168e+2, 8.625e+1, 8.276e+1 | 1.4157, 1.4137, 1.2980, 1.2230 |\n| 4.00 | 2.819e+2, 6.290e+2, 4.803e+2, 5.035e+2 | 1.9160, 1.9137, 1.7980, 1.7230 |\n| 4.25 | 5.885e+2, 1.460e+3, 1.133e+3, 1.242e+3 | 2.1660, 2.1637, 2.0480, 1.9730 |\n\nThe margin in exponent falls with z at every u₀, by 0.19 from z = 19 to 37\nat u₀ = 3.0 and 4.0 alike: in the §2 table the truth column rises from\n0.9873 to 1.2874 while need rises only from 2.9033 to 3.0104 (u₀ = 4.0), and\nu₀ enters need as an additive constant, so the fall is the same at every\nu₀. Rung: MEASURED on the cited exact suprema; the factor 2 in\n|R_H| ≤ 2 sup|ρ̃| is up to 2× conservative and was not tightened (sup|R_H|\nat H = z^{u₀} was not walked).\n\n**Proof gap, not truth gap, at every z where the question can be put.** No\ncomputable level contradicts REC at any u₀ ≥ 3, and the sharp-form failure\nis at a window two exponents below the legal band. Asymptotically: the\ntruth's slope is 2.7660 ± 0.2120 (S5, seven points, estimator returns\n2.500000 on a synthetic z^{2.5} truth), leave-one-out 2.6180 ± 0.2601, and\nthe room under u₀ reads 0.2340 (1.10 se) at u₀ = 3.0, 0.7340 (3.46 se) at\n3.5, 1.2340 (5.82 se) at 4.0, 1.4840 (7.00 se) at 4.25. The F4 envelope\n2√⟨ρ̃²⟩√(2 ln W) itself has slope 2.5111 ± 0.1775 on the same points (S5),\nso the measured truth is tracking the Gaussian envelope, not outrunning it.\nTwo honest limits on that reading: seven points under one octave decide no\nasymptote, and the corpus records local slopes here rising with z\n(`rho-exact-z31-01.md` §0). The u₀ = 3.0 form is therefore the one that\ncould be false; the u₀ = 4.0 form is measured true with 1.2 exponents to\nspare and no known mechanism against it. Neither is a theorem, and the\ndistance from measured truth to proof is the whole of §4.\n\n## 6. What would falsify the arrow, and whether it has run\n\n- **REC(3.0, u₀) false at a computable z**: an exact sup|ρ̃|(z) with\n 2 sup|ρ̃| ≥ HM − 1 at H = z^{u₀}, or, sharper, a walked sup|R_H| at that H\n above HM − 1. RUN at z = 13..37 through the cited exact suprema (S1): no\n failure at any u₀ ≥ 3.0; margins in §5. NOT RUN for sup|R_H| directly at\n H = z^{u₀} (the factor 2 stands in), and NOT RUN at z ≥ 41 (the z = 31, 37\n walks cost 6928 s, `rho-exact-z31-01.md`; z = 41 is a period of 7.4e12\n positions, well above the four-hour rule, so it is an ask).\n- **The truth's slope reaching u₀**: the seven-point slope 2.7660 ± 0.2120\n (S5) against u₀. RUN. Decides nothing asymptotically; u₀ = 3.0 is 1.10 se\n away and u₀ = 4.0 is 5.82 se away. The next exact point moves this more\n than anything else here.\n- **A worst-position construction**: a position x with a large-modulus\n hit count of order H/ln²z (the §4.3 reduced form). The corpus's closest\n test is `sift-limit-attack.md` §7b (3): at a CRT-planted doubly-smooth\n position the absolute sum reaches 0.978 of the trivial bound while the\n signed sum stays about H (max 6 over 20,000 positions at pair count\n 588). RUN at one level; it passed; it is one level.\n- **The floor crossing β₂**: if th(nP(z)) ever exceeded β₂, no law of any\n strength could deliver and REC would be moot rather than false. MEASURED\n ≥ 2.0106 at z = 47 (prefix bound); undecided asymptotically\n (`rho-maximal-law.md` reading 6, two models, neither called).\n- **The cap lemma of 4.1 wrong**: a modulus e with Σ*_a |Θ_e(a)||S_H(a/e)|\n above Vabs(e)·e(ln e + 1), or u_cap below the cited u_sup at some z. RUN\n at z = 13, 17 over every primitive frequency (no violation) and at seven\n levels against the cited column (u_cap ≥ u_sup at all seven, S2).\n- **The reduction of 4.3 wrong**: CAP_{≤ z^{u₀−δ}} not below HM − 1 for\n large z. The inequality is a one-line consequence of 4.1's second bound\n and cannot fail asymptotically; at (4, 0.5) it reads 0.39–0.53 and rising\n over z = 19..37 (S3), so at computable z it is the polylog, not the\n exponent, that is being watched.\n\n## 7. Readings\n\n1. **STATED, one open arrow.** From Lemma V's proven mean square to an\n exponent below β₂ the chain is C1–C6 of §2; C1, C2, C5, C6 are PROVEN,\n C4 is standard and measured (M ln²z = 0.3359–0.3772 at z = 13..37, S0),\n and C3 = REC(s, u₀) is the only open arrow. Every proven substitute for\n C3 lands at exponent 2s + o(1) or pays e^{θ(z)/q}.\n\n2. **ISOLATED.** REC(s, u₀): for fixed s > 1 + √e and fixed u₀ ∈ (2, β₂),\n sup_x |R_H(x)| ≤ z^{u₀/2 − ε}·⟨R_H²⟩^{1/2} at H = z^{u₀} for all large z.\n Its truth gives G₂(z#) ≤ z^{u₀}. It is F2 with the rms factored out, a\n level-of-distribution statement at θ_total = 2s/u₀ measured against the\n remainder's own rms, legal at fixed u₀ > 2 and TPC-strength at u₀ = 2\n or uniformly down to it. It is on no REFUTED row (§3, kill checks).\n\n3. **PROVEN, small, an asymptote for a closed route.** Every absolute-value\n accounting across the lattice is capped by CAP(z) ≤ z^{2s}(2s ln z + 1)·\n 6Π(1 + 2/p)², so u_sup ≤ 2s + o(1), which at s ↓ 1 + √e is 5.2974, the\n trivial-level exponent. Measured u_cap 3.4103 → 4.0593 against the cited\n u_sup 2.0617 → 3.0125 (S2); the cap is loose by 28.62–36.94× against the\n exact Fourier ℓ¹ sum at z = 13, 17. `lemmaV-sup-extension.md`'s\n asymptotic prose at lines 485-486 and 508-516 (2^{π(z)} moduli; a\n C^{π(z)} theorem as the reachable end) cannot hold at fixed s; its\n verdict does (`verify-0830-usup-convention.md` §3).\n\n4. **PROVEN, a reduction.** REC needs proving only for moduli in\n (z^{u₀ − δ}, z^{2s}]; the rest is ℓ¹-controlled below HM − 1 for large z.\n At (4, 0.5) the controlled part reads 0.3948–0.5346 of HM − 1 over\n z = 19..37, rising (S3). The reduced arrow is a bound on the signed count\n of large-modulus lattice hits in every window, with no instrument.\n\n5. **NEGATIVE, each at a named place.** Term-by-term accounting dies at the\n term count (4.1); position-union and hypercontractive routes die at the\n atom √p and the union price e^{θ/q} (4.2); window smoothing and the P(y)\n lever move 0–27% and 1.7–32% of CAP at computable z and no exponent\n (4.3, S3, S4); B is not where the exponent is lost (4.4); the\n smooth-profile form is disconnected from the consumer at both ends and\n priced at 5.0907 even if granted (4.5).\n\n6. **MEASURED: proof gap, not truth gap, at every computable z.** Certified\n margin F = (HM − 1)/(2 sup|ρ̃|) at u₀ = 4: 2.819e+2, 6.290e+2, 4.803e+2,\n 5.035e+2 at z = 19, 29, 31, 37 (log_z F 1.9160 → 1.7230); at u₀ = 3.0:\n 1.478e+1 → 1.360e+1 (log_z F 0.9148 → 0.7228). The truth's slope 2.7660 ±\n 0.2120 sits 1.10 se under u₀ = 3.0 and 5.82 se under u₀ = 4.0 (S5); the\n F4 envelope's slope is 2.5111 ± 0.1775 on the same points. Seven points\n under one octave; asymptotically undecided, with the u₀ = 3.0 form the\n one the data could yet refute.\n\n7. **UNCHANGED.** RML(α) open at every α; no exponent moved; the item's\n named riders (\"Lemma V re-enters as ASK not import; fixed-smooth-profile\n binds\") stand, and §4.5 says why the second is not a property of the\n working point.\n\n## 8. Not reached\n\n- sup|R_H| walked directly at H = z^{u₀} (the factor 2 in |R_H| ≤ 2 sup|ρ̃|\n stands in; at most 2× conservative).\n- Any exact point at z ≥ 41 (period 7.4e12; above the four-hour rule).\n- ⟨ρ̃⁴⟩, the named stopping object of `attack-rhoms-01.md` §3; a\n sub-Gaussian fourth moment (measured m₄/m₂² = 2.32–2.92 there) would cut\n the union price to e^{θ/4}, which still diverges, so it was not pursued.\n- The s-freedom: everything is s = 3.0. The cap's asymptote 2s says a\n smaller s is cheaper for the trivial accounting; whether REC is easier at\n s near 1 + √e was not measured.\n- The u₀-dependence of the reduced arrow's mean square (the sub-lattice\n B_big ≤ 9A²(E−1) holds by the same proof, since dropping terms only lowers\n T(e); its measured size was not tabled).\n- Re-pricing the Kloosterman imports at the ρ-configuration (carried over\n from `rho-maximal-law.md` §5 with its caveat).\n\n*Gate: `node research/qc.js --full` result recorded in the closing report;\nthe producer's tail verifies under `qc/embed.js --check` (code-sha256\nmatches, out-sha256 matches, body bit-honest).*\n"},"research/history/staging/attack-0830-comb-tail.md":{"lf_sha256":"e40b8251f329407ad94677a24fdc9e8f231488e9a3e90b1a4d9914f8c892d40f","content":"# Prime-comb equidistribution in the tail regime: the defect measured exactly at @11..@29, and what the Comb Discrepancy Lemma's own method says there\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-engine.md`, which\n> reproduced the tail defect at @11–@23 and the 419,328-term Legendre split\n> with zero exactness failures).** Two corrections: the main-term factor is\n> DERIVED from ∏(1 − 1/q_i) but MEASURED against ∏(1 − 1/(q_i − 1)) — which is\n> also what `natal-cap-28…js`:283 and `certificate-engine.md` §1 compute\n> against — a 0.9% difference at @23 that moves nothing certified; and §30's\n> \"F₁ ∈ [1.5, 4]\" misquotes its source, which says [1.5, 3] and makes no\n> statement at s < 1.\n\n**2026-08-30. TODO item 8, remaining part (b). Staging note, HELD, no\nadversarial pass. Producer: `attack-0830-comb-tail.js`, embedded (121 output\nlines), every anchor asserted before a new number prints. No live file was\ntouched. Every number below is quoted from that OUTPUT block or from an\nembedded artifact cited by file, and every inequality's direction is stated.**\n\n## 0. What is open, and only then what moved\n\n- **Nothing is proven here and no exponent moves.** The deliverable is a\n finite-level table with the tail's defect measured for the first time, a\n derivation of why the Comb Discrepancy Lemma's method cannot be carried\n into the tail, and a located non-closing step. That is the base rate the\n brief named, and it is what happened.\n- **The head is still the only certified region.** The tail's mass is 30.16%\n of Σcap₂ at @23 and 25.56% at @29 (OUTPUT, SUMMARY column 4), falling with\n x; certifying it would lift the certified share from the engine's 22.93%\n to at most 53.09% at @23 [ARITHMETIC on two OUTPUT figures]. No instrument\n in this corpus delivers that certificate at any finite level: the tightest\n legal upper bound in the tail at the certificate's depth is loose by\n F₁ ∈ [1.5, 4] (`attack-0830-buchstab-deep.md` §6 [CITED], re-derived in §5\n below), against a budget of 0.34% of the tail's own mass at @23.\n- **Part (b) splits three ways and two of the three are already settled\n elsewhere.** At K = 0 and shallow K in the limit it is Theorem C\n (`thm-capK-bv.md` §2, PROVEN, empty at every run level). At full depth in\n the tail (q_K → q) the naive statement with main term δ_K is FALSE on the\n record (B_true = 0.9044 at q = 4001, `attack-0830-buchstab-deep.md` SEC 3\n [CITED]) and its corrected form is 8(a), CLOSED as a sieve route on\n 2026-08-30. What is left to (b), and is measured here, is the finite-level\n form at K = 0 and at the certificate's own depth K*. §6.\n- **What moved.** (i) The tail defect E(q) = cap₂(q) − s − dP·(π(A) + π(B)\n − 2π(q−1)) is computed exactly at every tail prime at @11..@29 (9 to 7589\n primes per level), together with its Legendre decomposition over the mids\n into 2^{k+2} prime-in-AP terms, split by modulus range. (ii) The same at\n depth K* against the δ_{K*} main term. (iii) The engine's head-share and\n tail-envelope figures reproduce to the printed digit as custody. §3.\n\n## 1. The statement, as `attack-0830-buchstab-deep.md` §6 scopes it (deliverable a)\n\nLevel x, W = x#, mids 7 ≤ p ≤ x, k = #mids, scour primes x < q ≤ √W. Tail:\nq³ > W + 1, where every admissible cofactor m of a fresh victim v = qm is\nprime with m ≥ q (`thm-mod30-tail.md` §2(a) via `staircase-note.md` Lemma 1,\n[CITED]). With A = ⌊(W−1)/q⌋, B = ⌊(W+1)/q⌋ and T for either,\n\n cap₂(q) − s(q) = #{m prime, q ≤ m ≤ A, qm ≡ 11,17 (30), qm ≢ −2 (p) ∀ mids}\n + #{m prime, q ≤ m ≤ B, qm ≡ 13,19 (30), qm ≢ +2 (p) ∀ mids},\n\nand at depth K the K freshness classes m ≢ ∓2q⁻¹ (mod q_i), i ≤ K, are\nadded (one class per prime, `thm-capK-bv.md` §1 [CITED]). **Statement\n(b), K = 0:** cap₂(q) − s = dP·(π(A) + π(B) − 2π(q−1))·(1 + η(q)) with\ndP = (1/4)∏_{mids}(1 − 1/(p−1)), and Σ_{tail}(cap₂ − s)·|η| small against\nthe floor N − Σ_q cap_{K*}(q), uniformly in the tail. **At depth K:** the\nsame with dP replaced by δ_K = dP·∏_{i≤K}(1 − 1/(q_i − 1)). The quantifier\nthe certificate needs is **for every x** at **K = K*(x)**, and only the\n**upper** half, cap_K(q) ≤ main·(1 + η), enters the pigeonhole floor\nN − Σ cap_K (the legal direction, `attack-wrongdirection-audit.md` §1\n[CITED]; an upper bound on a cap is a lower bound on survivors).\n\n**Rung.** At K = 0 and q_K = W^{o(1)}: PROVEN in the limit, ineffective,\nempty below x = 263 (Theorem C, `thm-capK-bv.md` §4 [CITED]). At K = K*\nwith q_{K*} a power of T: OPEN, HEURISTIC in the engine. At full depth:\nthe δ_K form is REFUTED on the data and the B-corrected form is 8(a), CLOSED.\nFinite level, any K: MEASURED only (this note and the Tail Envelope\nMeasurement).\n\n**What it would buy the engine, from the engine's own ledger.** The certified\nhead carries 9.69 / 17.40 / 22.93% of Σcap₂ at @17 / @19 / @23\n(`natal-cap-28` OUTPUT [CITED], reproduced here to the digit). The tail\ncarries 43.32 / 35.81 / 30.16% of Σcap₂ and 42.65 / 33.61 / 26.70% of\nΣcap_{K*} at the same levels, 25.56% and 21.06% at @29 (OUTPUT SUMMARY). A\nproven tail bound with error η would add the tail's share to the certified\nshare at that level, so at most 22.93 + 30.16 = 53.09% at @23, and the\nbudget it must meet is floor / Σ_{tail}(cap_{K*} − s) = 4841 / 1413605 =\n0.34% at @23 and 31327 / 30129475 = 0.10% at @29 [ARITHMETIC on OUTPUT\nfigures]. The tail's share falls with x (75% at @11 to 25.56% at @29), so\nthis is a finite-level gain that shrinks, not a route.\n\n## 2. Legality and direction\n\nEvery statement attacked below is a finite computation or a per-prime\nasymptotic for a κ = 1 sifted prime count; none is a window statement, so\nAxis A of the wrong-direction test does not apply. The all-x K = 0 form is\nalready a theorem in the limit, hence not TPC-strength. The full-depth\nform is a count of primes m ≤ T with qm ± 2 ∈ P₂, parity-blocked\n(`bv-import-survey.md` §3.3 [CITED]); whether it is TPC-strength is NOT\nDETERMINED here and it is not attacked here. The only inequality used in\nthe certificate's direction is cap_K(q) ≤ main·(1 + η): an upper bound on\nthe cap, which lowers Σcap and raises the floor, legal.\n\n## 3. The finite-level measurement (deliverable b)\n\nCustody first, all asserted in the producer before any new figure prints:\nΣcap₂ = 56 / 880 / 16135 / 308401 / 7034588 at @11..@23 (cap-08, cap-28\nCHECK); tail counts and tail Σcap₂ = (9, 42) / (29, 485) / (105, 6989) /\n(396, 110439) / (1638, 2121291) / (7589, 51660643) at @11..@29 (cap-08\nbands, cap-11, cap-18 OUTPUT); CERT n = 0/1/3/6 with shares 0.00 / 9.69 /\n17.40 / 22.93%, PRIME agg π-form −1.05 / −0.49 / 0.01 / 0.01% and maxrel\n8.33 / 15.26 / 26.31 / 26.59% (cap-28 OUTPUT, matched as printed strings);\nthe nine @11 per-prime tail rows (cap-08); floors 34 / 110 / 82 / 1877 /\n4841 at K* = 0/0/2/10/27. All pass. At @29 the head is not enumerated (the\nlpf array would be 2.1·10⁸ entries) and Σcap_{69} = 143107823 is cited from\ncap-18's floor.\n\n**The tail defect at K = 0** (OUTPUT, SUMMARY; percentages of the tail main\nterm Σ dP·(π(A) + π(B) − 2π(q−1))):\n\n| level | tail n | E signed | Σ\\|E\\| | max \\|E\\|/cap₂ at cap₂ ≥ 20 | sign split +/− | head Σ\\|cap₂ − mainC\\| (all head q) |\n|---|---|---|---|---|---|---|\n| @11 | 9 | −6.03% | 14.92% | 0.00% (no q with cap₂ ≥ 20) | 4/5 | 5.744% |\n| @13 | 29 | 1.09% | 6.50% | 8.33% | 16/13 | 1.252% |\n| @17 | 105 | 0.50% | 2.85% | 15.26% | 54/51 | 0.694% |\n| @19 | 396 | −0.01% | 1.42% | 26.31% | 183/213 | 0.911% |\n| @23 | 1638 | −0.01% | 0.60% | 26.59% | 813/825 | 0.999% |\n| @29 | 7589 | −0.00% | 0.25% | 37.41% | 3772/3817 | not enumerated |\n\n**Reading, calibrated MEASURED.** Per prime the tail defect is LARGER than\nthe head's: its worst relative error grows with level (8.33% to 37.41%,\nattained at small caps of order 20 where a prime count fluctuates by\nits own square root) against 0.01 to 0.40% at the certified head (cap-28\nOUTPUT). In aggregate it is SMALLER from @23 on: Σ|E| is 0.60% of main at\n@23 and 0.25% at @29 against the head's 1.00% at @23, and it falls roughly\nby half per fold while the head's holds near 1%. The signed aggregate is\nbelow 0.01% from @19 on, the sign split is even at every level, and the\nsigned value is inside the floor's budget of §1 at @19, @23 and @29 while\nthe unsigned one is not (0.60% against 0.34% at @23, 0.25% against 0.10%\nat @29). So an aggregate certificate is consistent with the data and a\nper-prime one is not, at every level that exists.\n\n**At depth K*** (OUTPUT, \"tail K=K*\" lines): Σ_{tail}(cap_{K*} − s) against\nthe δ_{K*} main term reads −6.03 / 1.09 / 0.39 / −0.19 / 0.00 / −0.07%\nsigned and 14.92 / 6.50 / 3.33 / 2.42 / 1.08 / 0.54% unsigned at @11..@29,\nand the engine's product form (cap₂ − s)·∏_{i≤K*}(1 − 1/(q_i − 1)) gives\nB_tail = 1.0000 / 1.0000 / 0.9989 / 0.9983 / 1.0001 / 0.9994. At K* the\ntail is in the regime where the Buchstab factor is 1 to four digits,\nalthough Theorem C's hypothesis q_K = T^{o(1)} is formally violated there\n(ln q_{27}/ln T = ln 131/ln T runs 0.38 to 0.51 across the @23 tail\n[ARITHMETIC]).\n\n## 4. The Comb Discrepancy Lemma's method in the tail (deliverable c)\n\n**4.1 The lemma as the engine uses it, carried into the tail, is true and\nsays nothing, and it fails on the main term before the error term.** The\nCertified-Head Theorem's bound |cap₂(q) − mainC(q)| ≤ 2^{j+1}(2·3^k + 1),\nmainC = s + (A + B)·(N/W)·∏_{i 2, and\nan asymptotic only as s → ∞ (the fundamental lemma, whose factor is below 1\nfirst at x = 263 even at K = 0, `thm-capK-bv.md` §4 [CITED]). The\ncertificate's budget is 0.34% at @23 and 0.10% at @29 (§1), against a\nloss factor of 1.5 at best.\n\n**Grade: a proof gap, not a truth gap, on the data.** At K* the δ_{K*} main\nterm matches the tail to 0.00% signed at @23 and −0.07% at @29 with\nB_tail within 0.002 of 1 at every level (§3), so the asymptotic the step\nwould prove is consistent with everything measured; what is missing is an\ninstrument for a κ = 1 asymptotic at bounded s below the sifting limit,\nwhich the corpus has searched for at κ = 2 (`REFUTED.md`, β₂ row) and which\ndoes not exist at κ = 1 either below s = 2 (Iwaniec's linear sieve is the\nsharp instrument, and its f₁(s) = 0 for s ≤ 2 is the statement). It becomes\na truth gap only at full depth, where the δ_K form is refuted by B_true =\n0.9044 (q = 4001, @23 [CITED]); that is 8(a)'s object and is CLOSED. Whether\nthe certificate's depth stays at ρ ≈ 0.42 to 0.56 for all x, or drifts\ntoward the full-depth regime, is the open question of `u2-engine-depth.md`\n(measured u = 4.191 → 3.557 and falling, ANSWERED as not yet at 2 [CITED]).\n\n## 6. Kill check: does (b) reduce to 8(a) or to a REFUTED row\n\nPartly, and the note marks it. (i) The full-depth tail statement IS 8(a)'s\nobject at tail q (the Buchstab factor between the product and the count),\nCLOSED as a sieve route, 2026-08-30; nothing here reopens it. (ii) The\nshallow-K limit statement IS Theorem C, PROVEN and empty. (iii) The\nfinite-level and K* form measured here is neither: it is what\n`certificate-engine.md` §2 calls the Tail Envelope Measurement, now with the\nper-prime defect, its Legendre anatomy and its K* form on the record. No\n`REFUTED.md` row covers it; none is proposed, since a measurement is not a\nroute. Status of 8(b): PARTIAL, and the part that is still open is a proof\ngap at bounded sifting parameter that no instrument in the corpus addresses.\n\n## 7. Brief errors and defects noticed in passing\n\n- \"the tail regime's blocks are longer and fewer\": fewer holds, longer does\n not (§4.2).\n- \"head share is certified at 28-29%\": that is `comb-discrepancy-tight.md`\n §5's per-dilation figure, scratchpad-grade with no embedded OUTPUT; the\n engine's embedded figure is 22.93% at @23, and the sum 53.09% in §1 uses\n the embedded one.\n- `certificate-engine.md` §2 says the K = 0 tail statement \"is exactly the\n statement above\" of Theorem C; at finite level the statement the engine\n uses is at K = K*, where q_{K*} is already T^{0.38..0.51} at @23 and\n Theorem C's hypothesis does not hold. Wording; nothing downstream moves.\n- The engine's tail envelope quotes \"aggregate |err| 0.0-1.1% of tail mass\":\n that is the signed aggregate. The unsigned one is 6.50 / 2.85 / 1.42 /\n 0.60% at @13..@23, and it is the unsigned one a per-prime certificate\n would have to pay.\n\n## 8. What would falsify this, and whether the check has run\n\n| claim | falsifier | check |\n|---|---|---|\n| the per-prime defect E(q) is computed correctly | a mismatch with cap-08's @11 rows, the tail Σcap₂ anchors, or cap-28's PRIME agg and maxrel strings | RUN, all asserted, six levels |\n| the Legendre decomposition is exact | signed term sum ≠ cap₂ − s, or signed defect sum ≠ E(q) | RUN, asserted at every tail prime, tolerance 10⁻⁶ |\n| short terms obey the lemma's < 1 bound | any short term with \\|Δ\\| ≥ 1 | RUN, asserted at every short term |\n| the main-term factor e^γ(1/u − q^{1−u}) | the exact ratio departing from it by more than the finite corrections | PARTIALLY: measured 10-12% above at @23-@29 with the corrections named, not separately computed |\n| B_tail = 1 at K* | a level where Σ_{tail}(cap_{K*} − s) departs from the product by > 1% | RUN at six levels, worst 0.0017 |\n| the non-closing step is a proof gap | a tail prime at K* where the δ_{K*} main term is off by an amount a sieve constant could not absorb | NOT RUN per prime at K*; only the aggregates are on the record |\n| no @29 head figure | none computed | flagged, not a claim |\n"},"research/history/staging/attack-0830-doubling-killrun.md":{"lf_sha256":"07e0863cb68747ae14118ae4db5c54eed51eb3cb9fb2a5ebacee6837dd57e2fe","content":"# The weighted kill-run computed exactly at fourteen steps, and the per-fold composition across one doubling step ruled out: it is a product, it is dominated by yesterday's certificate at every step, and it exceeds the allowance from s = 9 on and for all large s\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-doubling.md`).** Both\n> proofs re-derive and the product theorem was stressed far past what this\n> note ran: 21,641,346 nesting links over 6,012,804 killed runs, 0 failures,\n> with the zero-kill fold fired on 5,909,600 runs (it is the trivial case,\n> not an exception). One clause WEAKENED: \"the truth sits under it everywhere\n> (sup w/a = 0.8295)\" attaches the CERTIFICATE's ratio to the word truth; the\n> truth's own sup is 0.6591. `REFUTED.md` row 98 is corrected.\n\n*2026-08-30 wave. Producer:\n`research/history/staging/attack-0830-doubling-killrun.js` (formal embed; the\ntail carries the hashes; run 423 s under `embed.js`, timing on stderr only).\nNothing committed; no git command run; no existing document edited;\npublication moratorium respected. HELD, awaiting the standing one-pass\nadversarial review. Legend as in `research/sift-limit-attack.md`:\n**[PROVEN]** proof given here or in a cited corpus note; **[VERIFIED]** checked\ncomputationally here; **[MEASURED]** empirical, finite range; **[INFERRED]**\ndeduction from sourced facts; **[CITED]** taken from a corpus artifact, not\nrecomputed; **[OPEN]** not proven, not refuted.*\n\n---\n\n## 0. The verdict, up front\n\n> **The composition does not close and cannot be made to close. Inside one\n> doubling step the `N = π(2s) − π(s)` folds compose as a product: a killed\n> level-`s` run of length `K` satisfies `K + 1 ≤ ∏_j (1 + L_j)` with `L_j` the\n> exact per-fold run length on the `j`-th intermediate tile (proof in §2, an\n> instance at every one of the fourteen enumerable steps). The product is\n> never below yesterday's certificate `maxsum_{K*+1}(T_s)`, so it cannot\n> improve on it; it exceeds the allowance `8·Ĝ(s)` at eight of fourteen steps,\n> first at `s = 9`, by a factor 20.83 at the sup step `s = 16`; and because\n> every fold kills at least one slot, the composed index is at least `2^N`,\n> so the composed certificate is at least `2^N·ḡ(s)`, which already exceeds\n> `8·Ĝ(s)` at the chain rungs 16, 32 and 64 without any walk and beats the\n> corpus's proven polynomial ceiling on `Ĝ` for all large `s`. That is a\n> truth gap on the fourteen points and a proven divergence past them, not a\n> proof gap. The sum form `K* + 1 ≤ 1 + Σ L_j` is false at seven of fourteen\n> steps; the max form is a floor. The weighted kill-run itself, defined in\n> yesterday's notation and computed exactly, sits at 0.8295 of its allowance\n> at `s = 16` and lower everywhere else on the range, so (M8) holds where it\n> can be seen and is untouched past `s = 18`. The composition is not the\n> closed fold recursion (no exponent is averaged; the per-step target stays\n> `log₂ 8 = 3`); it is the Tail-Count Transport chain with the window index\n> forced to grow, and it fails at the opposite end of the index dial from the\n> closed fixed-index version. Nothing here bounds `K*` or `C₂` for any\n> `s > 18`.**\n\nNumbers below are quoted from the producer's bound OUTPUT block\n(`attack-0830-doubling-killrun.js`, lines 516 to 735) or from cited artifacts\nby file and line; none is typed from a run.\n\n## 1. (a) The weighted kill-run, defined exactly, and its table\n\nNotation as in `attack-0829n-doubling-bridge.md` §3: `T_s` the level-`s` tile,\n`D_s` its census, `ḡ(s) = P(s)#/D_s` its mean gap, `Ĝ(s) = G₂(P(s)#)`,\n`maxsum_m(T_s)` the largest sum of `m` cyclically consecutive level-`s` gaps\n(for `m ≥ D_s` the window wraps `⌊m/D_s⌋` full periods), `Q = {q prime : s <\nq ≤ 2s}`, `N = |Q|`, `K*(s)` the longest run of consecutive level-`s` slots\nall killed by `Q`. Yesterday's step 2 is the identity `Ĝ(2s) = max over\nkilled runs R of span(R)`; yesterday's (R) weights the run by the ground it\nstands on. Written out in mean-gap units, the three objects are:\n\n- **the weighted kill-run (truth)** `w_true(s) := Ĝ(2s)/ḡ(s)`, the span of\n the longest killed run in units of the level-`s` mean gap;\n- **the weighted kill-run (certificate)** `w(s) := maxsum_{K*(s)+1}(T_s)/ḡ(s)\n = (K*+1)·ρ(s, K*+1)`, yesterday's maxsum certificate in the same units;\n- **the allowance** `a(s) := 8·Ĝ(s)/ḡ(s)`.\n\nThen `(D8)` at step `s` is `w_true(s) ≤ a(s)` and `(M8)` is `w(s) ≤ a(s)`;\n`w/a = msc/8` exactly. The sandwich `w_true ≤ w ≤ a` is yesterday's step 3\nrestated. Computed at all fourteen enumerable steps (producer F, lines 641\nto 675):\n\n| step | s | ḡ | w_true | w | a | w_true/a | w/a |\n|---|---|---|---|---|---|---|---|\n| 7#→17# | 9 | 14.00 | 7.71 | 7.71 | 17.14 | 0.450 | 0.450 |\n| 11#→23# | 12 | 17.11 | 11.92 | 12.27 | 19.64 | 0.607 | 0.625 |\n| 13#→29# | 15 | 20.22 | 12.76 | 14.84 | 26.11 | 0.489 | 0.568 |\n| 13#→31# | 16 | 20.22 | 17.21 | 21.66 | 26.11 | 0.659 | 0.830 |\n| 17#→31# | 17,18 | 22.92 | 15.18 | 20.16 | 37.70 | 0.403 | 0.535 |\n\n(the other nine rows are in the block, lines 646 to 672). `w_true ≤ w ≤ a`\nat all fourteen; sup of `w/a` is `0.8295` at `s = 16` (line 675), which is\n`6.6364/8`. So the weighted run stays within its allowance with a margin of\n17 percent at the worst enumerable step, and the truth with a margin of 34\npercent. **[VERIFIED]** This is the item's stated first test and it is\npassed on the range; it says nothing about `s > 18`.\n\n## 2. (b) The per-fold composition: it is a product, and here is why\n\n**Setting.** Order `Q = {q_1 < … < q_N}` and fold in prime order:\n`T^(0) = T_s`, `T^(j) = T^(j−1)` folded by `q_j`, `T^(N) = T_{2s}`. In prime\norder `T^(j−1)` is `T_{q_{j−1}}`, the tile one prime below `q_j`, so every\nintermediate tile is a diagonal tile of the ladder. Let `L_j = L(T^(j−1),\nq_j)` be the longest run of consecutive `T^(j−1)` slots killed by `q_j`,\nscanned on the big tile of period `P(s)#·q_1⋯q_j` (the implementation trap\nof `prop-exact-fold-L.md` §3: a cyclic scan of one copy is wrong). The\nproducer computes each `L_j` by direct streaming enumeration, not through the\nalternation-window statistic, so nothing below depends on the equality lemma\nof `prop-exact-fold-L.md`; that lemma enters only in §3 as the reason no\nsharper per-fold input exists.\n\n**Theorem (product composition) [PROVEN].** Let `R` be a run of `K`\nconsecutive level-`s` slots all killed by `Q`, and let `m_j` be the number of\nslots of `R` surviving `q_1, …, q_j` (`m_0 = K`, `m_N = 0`). Then for each\n`j`, `m_{j−1} + 1 ≤ (m_j + 1)(1 + L_j)`, hence `K + 1 ≤ ∏_{j=1}^{N} (1 + L_j)`,\nand in particular `K*(s) + 1 ≤ ∏_j (1 + L_j)`.\n\n*Proof.* The `m_{j−1}` survivors of `q_1..q_{j−1}` inside `R` are consecutive\nslots of `T^(j−1)`, because every level-`s` slot between two of them lies in\n`R` and is killed by one of `q_1..q_{j−1}`. Among these `m_{j−1}` consecutive\n`T^(j−1)` slots, those killed by `q_j` form at most `m_j + 1` maximal\nstretches, one before each of the `m_j` survivors of `q_j` and one after the\nlast, each stretch being a run of consecutive `T^(j−1)` slots killed by\n`q_j`, hence of length at most `L_j`. So `m_{j−1} ≤ m_j + (m_j + 1)·L_j`,\nwhich is the link. Multiply the links from `j = N` (where `m_N + 1 = 1`)\ndown to `j = 1`. ∎\n\n**The two companion facts [PROVEN].** (i) `K* ≥ max_j L_j`: a run of `L_j`\nconsecutive `T^(j−1)` slots killed by `q_j` spans a stretch of level-`s`\nslots every one of which is killed by some `q_i`, `i ≤ j`. (ii) The maxsum\ntransport across one fold: `maxsum_m(T^(j)) ≤ maxsum_{m(1+L_j)}(T^(j−1))`,\nbecause `m` consecutive `T^(j)` gaps are spanned by `m + 1` consecutive\n`T^(j)` slots with at most `L_j` killed `T^(j−1)` slots between each adjacent\npair, hence by at most `m(1 + L_j)` consecutive `T^(j−1)` gaps. Composing (ii)\nfrom `T^(N)` down to `T^(0)` with `m = 1` at the top gives the **composed\ncertificate**\n\n (C) Ĝ(2s) ≤ maxsum_{M(s)}(T_s), M(s) := ∏_{q ∈ (s, 2s]} (1 + L(T_{q⁻}, q)),\n\n`q⁻` the prime below `q`. Since `K* + 1 ≤ M` and `maxsum_m` is monotone in\n`m`, `maxsum_{M}(T_s) ≥ maxsum_{K*+1}(T_s)`: **the composed certificate is\nnever tighter than yesterday's maxsum certificate, at any `s`.** [PROVEN]\n\n**Which rule: product, not sum, not max.** The sum form `K* + 1 ≤ 1 + Σ_j\nL_j` is not a theorem and is false on the data at seven of fourteen steps\n(`18 > 14` at `s = 16`, `14 > 12` at `s = 17`; line 586); as a certificate\n`maxsum_{1+ΣL_j}(T_s)` even falls below the truth `Ĝ(2s)` at `s = 4` and\n`s = 10` (line 700). The max form is fact (i), a floor on `K*`, not a\ncertificate. **[VERIFIED]**\n\n**The table (producer C, D, E, G).** Per-fold `L_j` in prime order, the\nproduct `M`, the certificate, against the truth:\n\n| step | s | L_1..L_N | M = ∏(1+L_j) | K*+1 | 1+ΣL_j | M/(K*+1) | w_prod = maxsum_M/ḡ | a | w_prod/a |\n|---|---|---|---|---|---|---|---|---|---|\n| 7#→13# | 7,8 | 1 2 | 6 | 4 | 4 | 1.50 | 7.71 | 17.14 | 0.450 |\n| 7#→17# | 9 | 1 2 2 | 18 | 6 | 6 | 3.00 | 19.71 | 17.14 | 1.150 |\n| 7#→19# | 10 | 1 2 2 2 | 54 | 9 | 8 | 6.00 | 55.71 | 17.14 | 3.250 |\n| 11#→23# | 12 | 2 2 2 3 | 108 | 11 | 10 | 9.82 | 110.45 | 19.64 | 5.625 |\n| 13#→29# | 15 | 2 2 3 2 | 108 | 11 | 10 | 9.82 | 112.75 | 26.11 | 4.318 |\n| 13#→31# | 16 | 2 2 3 2 4 | 540 | 18 | 14 | 30.00 | 543.86 | 26.11 | 20.830 |\n| 17#→31# | 17,18 | 2 3 2 4 | 180 | 14 | 12 | 12.86 | 188.76 | 37.70 | 5.007 |\n\n(all fourteen rows: lines 541 to 580, 624 to 638, 679 to 695). The per-fold\nvalues are the diagonal cells of `a3-05-bound-L.md` §4's table, `7:2 11:1\n13:2 17:2 19:2 23:3 29:2 31:4`, reproduced consistently wherever a cell\nrecurs across steps (line 587). `K* + 1 ≤ M` holds at all fourteen steps and\nin reverse fold order too (producer D); order changes `M` both ways (864\nagainst 540 at `s = 16`, 72 against 108 at `s = 12`, lines 609 to 615) and no\norder can go below `K* + 1` or below `2^N`. The composed certificate exceeds\nthe allowance at 8 of 14 steps, first at `s = 9`, and is under it only at\n`s ≤ 8` (line 697). **[VERIFIED]**\n\n**Where the product loses.** The nesting chain along the actual longest run\n(producer E) shows the links `(m_{j−1}+1)/((m_j+1)(1+L_j))` running 0.34 to\n1.00; at `s = 16` the chain is `17 13 10 7 4 0` with links `0.43 0.42 0.34\n0.53 1.00` (line 637). A fold's kills inside the run are not maximal runs\nbetween every pair of survivors, and the number of stretches the next fold\nmay fill is the next level's own run length: the self-similarity yesterday\nnamed, here as the reason the composition is multiplicative. **[MEASURED]**\n\n## 3. (c) The single inequality that does not close, and that it is a truth gap\n\nFor the composition to deliver (M8) it needs\n\n (C8) ∀ s ≥ 2: maxsum_{M(s)}(T_s) ≤ 8·Ĝ(s), M(s) = ∏_{q∈(s,2s]} (1 + L(T_{q⁻}, q)).\n\n(C8) is false, in three ranges, all in the same direction:\n\n- **On the fourteen points, exactly.** False at `s = 9, 10, 11, 12, 13, 15,\n 16, 17` (line 697); at `s = 16` the left side is 20.83 times the right\n (line 699). **[VERIFIED]**\n- **On the chain rungs with a known `Ĝ(s)`, by a floor and no walk.** Every\n fold kills at least one slot (`T^(j−1)` is non-empty and its period is\n coprime to `q_j`, so the copies of any slot meet every class mod `q_j`,\n class 0 included), so `L_j ≥ 1` and `M(s) ≥ 2^N`. And `maxsum_m(T_s) ≥\n m·ḡ(s)` for every `m` (the average over the `D_s` cyclic starting positions\n of an `m`-window sum is exactly `m·ḡ`; checked to `m = 200` at seven tiles,\n line 537). So the left side of (C8) is at least `2^N·ḡ(s)`. That floor\n alone exceeds `8·Ĝ(s)` at `s = 16, 32, 64` by factors 1.226, 1.481 and\n 41.348 (lines 710 to 718; the `s = 64` term is Wang's literature-grade\n `G₂(61#) = 1080`). **[PROVEN the floor; VERIFIED the rungs]**\n- **For all large `s`, by the cited ceiling.** `N(s) ~ s/ln s` and\n `Ĝ(s) ≪_ε s^{β₂+ε}` with `β₂ = 4.26645` (`G2-STATE.md` line 426, PROVEN\n there, `paper/beta2-note.md`), so `2^{N(s)} ḡ(s)/(8·Ĝ(s)) → ∞`. The crude\n count `N(s) > 3 + β₂ log₂ s` first holds at `s = 217` (line 720). The\n polynomial ceiling is load-bearing: the trivial `Ĝ(s) < P(s)#` does not\n suffice against `2^{s/ln s}`. **[PROVEN given the cited ceiling]**\n\nSo (C8) is a **truth gap**, not a proof gap: the composed inequality (C) is a\ntheorem and its right side is genuinely above `8·Ĝ(s)` from `s = 9` on and\nasymptotically. The gap is exponential against polynomial: `M(s) ≥ 2^{N(s)}`\nwhile the allowance `8·Ĝ(s)/ḡ(s)` is at most polynomial in `s`. No\nsharpening of the per-fold input can repair this, for two independent\nreasons: the per-fold `L_j` used here are exact (direct enumeration; and by\n`prop-exact-fold-L.md`, at its PROPOSAL grade, no re-derivation of the\nalternation automaton moves them, the `3/2` constant being a min-plus Perron\nroot), and the floor `L_j ≥ 1` already forces `2^N`. The only inequality\nthat would close a fold-by-fold route is one in which the folds compose\nadditively, and §2 shows the composition is multiplicative because of the\nnesting of survivors. **[INFERRED from the two PROVEN facts]**\n\nWhat remains open is exactly yesterday's (R), equivalently (M8), for\n`s > 18`: `K*(s) + 1 ≤ 8·[Ĝ(s)/ḡ(s)]/ρ(s, K*+1)`, with `K*` bounded above by\nnothing proven except the divergent product `M(s)`, and below by `N(s)` and\nby `max_j L_j`. **[OPEN]**\n\n## 4. (d) Kill check against the two closed chains\n\n**Against the fold recursion `β_{k+1} = (β_k + φ_k)/2` (CLOSED,\n`attack-block-00-ADJUDICATION.md` attack 10).** That recursion averages\nexponents block by block and forgets its start at rate `2^{−k}`, so the\nper-block exponent to prove equals the global exponent 2. Nothing here\naverages an exponent: the composition lives inside one doubling step, its\ntarget stays `C₂ = 8`, exponent `log₂ 8 = 3`, and its output is an index\n`M(s)` in a maxsum, not an exponent. The failure mode is different too: the\nrecursion's requirement was exponent-invariant; the composition's requirement\nis violated by a superpolynomial factor. It is not that row.\n**[INFERRED]**\n\n**Against the Tail-Count Transport chain (CLOSED, `REFUTED.md` row 67,\n`attack-foldL-03-transport.md` §4).** Fact (ii) of §2, `maxsum_m(T^(j)) ≤\nmaxsum_{m(1+L_j)}(T^(j−1))`, is the transport of a maxsum window family\nacross a fold, and composing it across the `N` folds of a step is the\ntransport chain. The closed version held the window index fixed and\ncertified a constant (108, 180, 240, 330) against a truth that diverges\n(66 to 258); that note priced the cure as \"the index must grow with the\nlevel\". Here the index grows at the rate the fold forces, `m ↦ m(1 + L_j)`,\nand the certificate diverges past the truth by a factor that itself\ndiverges (`M/(K*+1)` runs 1.00 to 30.00 on the range, line 637; `2^N`\nagainst polynomial in the limit). The same chain fails at both ends of the\nindex dial, and no index law between \"fixed\" and \"multiplied by `1 + L_j`\nper fold\" is a theorem; the exact rate is the nesting chain `m_j`, which is\n`K*`'s own decomposition and is not known a priori. This is\n`attack-hsub-01.md` §4(i)'s `exp(#folds)` compounding, made exact with the\nconstants `1 + L_j ∈ {2, 3, 4, 5}` on the range. It lands on no refuted row\nas stated (the transport row is about a fixed index; the localized-merge\nblock rows 27 and 30 concern `M` of the merge chain, a different object) and\nreopens none. **Verdict: the per-fold composition is CLOSED as a route to\n(M8) by §3; it is a new row for the registry, not a reopening.**\n\n## 5. (e) How the composed bound sits at the largest enumerable s\n\nIt sits above, not below. At `s = 17, 18` (`17#→31#`) the composed certificate\nreads `w_prod/a = 5.007`, that is 5.01 times the allowance, and 12.43 times\nthe truth `w_true`, with `M = 180` against `K* + 1 = 14` (line 698). At the\nsup step `s = 16` it reads 20.83 times the allowance and 31.60 times the\ntruth, `M = 540` against 18 (line 699). Yesterday's certificate at the same\ntwo steps reads 0.535 and 0.830 of the allowance (§1). The slack a reader\nshould carry is therefore the ratio of the composed index to the true run,\n`M/(K*+1)`: 12.86 and 30.00 at the two largest steps, rising with `N`\n(line 624 to 638). **[VERIFIED]**\n\n## 6. Chain of custody, and the brief checked\n\nIn this order, nothing new trusted before the old was reproduced (producer A\nto C, lines 516 to 585):\n\n- The two ladders parsed from their keepers; the `C₂` table `s = 2..41`\n rebuilt and compared field by field against the table bound in\n `attack-doubling-01.js`'s OUTPUT block: 40 of 40 rows, 8 fields (line 521);\n sup `58/11 = 5.2727` at `s = 16`, chain rows `3.0000 5.0000 2.2000 5.2727\n 3.1034` (line 522).\n- Yesterday's OUTPUT block parsed at run time from\n `attack-0829n-doubling-bridge.js`: 14 sandwich rows and 14 walk rows (line\n 524); its fourteen maxsum-certificate values `3.0000 2.0000 5.0000 2.5000\n 3.5000 2.6000 3.6000 5.0000 4.0000 5.0000 3.6364 4.5455 6.6364 4.2778`\n (line 525).\n- A fold-chain engine written fresh for this pass (one streaming pass per\n entering prime, survivors by bitmask, the last pass carrying the level-`2s`\n data) re-derives at all fourteen steps `G₂(2s)`, least argmax,\n multiplicity, census, `k`, `K*`, `N` against yesterday's walk rows, and\n `floor`, `C₂`, `msc`, `K*+1` against yesterday's sandwich rows, digit for\n digit (the `ok` lines under each step, sections C and F). `G₂(31#) = 348 @\n 8813641451 (×4)` again by two base tiles. **[VERIFIED]**\n- Self-test failures: 0 (line 735). Fingerprint `code-sha256 61578274`,\n `out-sha256 abb986f9`, 220 body lines, written by `embed.js`, no `--force`.\n One reading figure was corrected after the embed (a rounding, `41.35` to\n the printed `41.348`); the readings sit below the banner and are outside\n the code hash.\n\n**The brief's claims, checked at their records.** `sup 6.6364 at s = 16 over\nfourteen steps`, `C₂ = 8`, the band `[4, 19.2455)`, the trap at `C₂ < 4`,\n`K* ≥ π(2s) − π(s)`, the floor's order `s/ln s`, and `θ → ∞`: all as stated\nin `attack-0829n-doubling-bridge.md` and `attack-wrongdirection-audit.md`\n§3.3, and reproduced or re-read here. One calibration to record: the brief\ncalls the per-fold statement \"PROVEN\"; `prop-exact-fold-L.md` §2 grades\nitself PROPOSAL, with the equality lemma proven in a staging record, verified\nat 36 cells and nine diagonal folds, and never through the live layer or a\nsecond reader. This note does not use the equality lemma for any number (the\n`L_j` are enumerated directly) and cites it only for sharpness, at its own\ngrade. The \"`3/2` constant\" is the proposal's own phrase for the min-plus\ncycle mean `3p` relative to the single-gap floor `2p ∓ 2`; no arithmetic here\ndepends on it. No error in the brief's numbers was found.\n\n## 7. NOT REACHED, falsifiers, trap grading\n\n**NOT REACHED.**\n\n- (D8), (M8), (R) for any `s > 18`: untouched in both directions.\n- The minimum of `M` over all `N!` fold orders: only prime order and reverse\n order were run; the minimum is bounded below by `K* + 1` and by `2^N`\n regardless, so it cannot change §3.\n- An additive composition law: none was found and §2 gives the reason none\n exists through nested survivors; whether a different decomposition of a\n killed run (by killer rather than by fold) admits one was not attacked.\n- The nesting chain `m_j` as an a-priori object: measured only along the\n longest run at fourteen steps.\n\n**What would falsify each claim, and whether the check has run.**\n\n| claim | falsifier | has it run |\n|---|---|---|\n| `K* + 1 ≤ ∏(1 + L_j)` | one step, one order, with `K* + 1 > M` | yes: 14 steps, two orders, none |\n| the composed certificate never beats yesterday's | one step with `maxsum_M < maxsum_{K*+1}` | yes: dominance at 14 of 14 (line 696) |\n| (C8) fails from `s = 9` on the range | a step `s ≥ 9` with `w_prod ≤ a` | yes: 8 of 8 steps at `s ≥ 9` exceed (line 697) |\n| `M ≥ 2^N` | a fold with `L_j = 0` | impossible by the class argument; `L_j ≥ 1` at all 117 fold passes run (39 in each order, 39 direct) |\n| the floor beats `8Ĝ` at rungs 16, 32, 64 | arithmetic | yes (lines 710 to 718) |\n| the sum form is not a theorem | one violating step | yes: seven (line 586) |\n| the composition is not the closed recursion | a derivation averaging an exponent | none appears; the target exponent stays 3 |\n| the weighted run is within its allowance on the range | one step with `w > a` | yes: 14 of 14 within, sup 0.8295 |\n\n**Trap grading.** `C₂ = 8 ≥ 4` throughout; the all-`s` quantifier is kept in\n(D8), (M8) and (C8); nothing here derives or implies any constant below 4;\nthe only lower bounds used are on the certificate side (`M ≥ 2^N`,\n`maxsum_m ≥ m·ḡ`, `K* ≥ N`, `K* ≥ max L_j`), each bounding a certificate or\na run from below, which closes a route and proves nothing about `Ĝ` in the\nTPC-relevant direction. Nothing here is a result on the doubling inequality:\none route is closed by an exact table and a proven divergence, and the open\ninequality is where it was.\n\n## 8. Sources and reproduction\n\n| artifact | what it carries |\n|---|---|\n| `research/history/staging/attack-0830-doubling-killrun.js` | custody (A), tiles (B), the fold chains and diagonal cells (C), order control and direct folds (D), the nesting chain (E), the weighted run (F), the composition (G), the all-`s` floor (H) |\n| `research/history/staging/attack-0829n-doubling-bridge.md`, `.js` | the notation, (R), (M8), the sandwich, the fourteen rows reproduced here |\n| `research/attack-doubling-01.js`, `attack-doubling-01.md` | the `C₂` table reproduced field by field |\n| `paper/proposals/prop-exact-fold-L.md`; `research/a3-05-bound-L.md` §1, §4, §5; `research/kappa-not-L.md` | the per-fold `L`, the diagonal table, the alternation lemma and its sharpness grade |\n| `research/history/staging/hsubpow-explicit-K.md` §2b | Lemma 1, `K* ≥ N` |\n| `research/history/staging/attack-hsub-01.md` §4(i) | folds compound to `exp(#folds)` |\n| `research/history/staging/attack-foldL-03-transport.md` §4; `research/REFUTED.md` row 67 | the fixed-index transport chain the kill check is run against |\n| `research/history/staging/attack-block-00-ADJUDICATION.md` attack 10 | the closed averaging recursion |\n| `research/G2-STATE.md` line 426; `paper/beta2-note.md` | `Ĝ(s) ≪_ε s^{β₂+ε}`, the polynomial ceiling §3 needs |\n| `research/history/staging/attack-wrongdirection-audit.md` §3.3 | the all-`s` quantifier discipline |\n| `research/exact-g2-ladder.js`, `research/import-interp-01-bgt-defect.js` | the two ladders, parsed at run time |\n\nReproduce with `node research/qc/embed.js --check --timeout 900\nresearch/history/staging/attack-0830-doubling-killrun.js` (173 s standalone,\n423 s under a loaded machine).\n"},"research/history/staging/attack-0830-head-remainder.md":{"lf_sha256":"79f877575974c4d6a0dbb6282f7476a96d103d319499ce951332ead41bc36c71","content":"# The head's HL remainder, split: the 5.3 percent was a pooling artefact of the decade-wide OLS, the ensemble half derives by a finite count and has the opposite sign to the one guessed, and the anchoring half is Hardy-Littlewood restated\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-slack.md`, independent\n> code, 0 assertion failures).** Two corrections, both narrowing: §3's top row\n> is NOT gap-scale matched (E[g] 244.0 against the ensemble's 235.9, y_match\n> capped), and on its own points Delta_ens ∝ E[g]^{−0.31}, so meas/ens reads\n> 0.9640 there and the headline \"0.954 to 0.995\" should read \"0.964 to\n> 0.995\"; and the y = 29 tile, recorded here as not enumerated, was\n> enumerated in about 40 s (pipe/ens 0.9535), giving the 3.6-to-4.9% band an\n> exact endpoint of 4.65% at y = 29, the ladder not being monotone across the\n> two regimes.\n\nSTATUS: HELD, staging. Not integrated, not red-teamed. Companion producer\n`research/history/staging/attack-0830-head-remainder.js` (embedded, about\nfour minutes, seeded Monte Carlo, `--check` green). Its SEC 0 re-walks\n[1e5,1e8) on independent code and reproduces `head-residual-hl3.js` SEC 0 and\nSEC 3 and `redteam-0828-head.js` SEC 1 to the printed digit before anything\nnew is computed: Delta_meas 0.6899, 0.6862, 0.6214; Delta_HL 0.7914, 0.7124,\n0.6545; R 223.5196, h − R 5.680 (the record's 5.679, tolerance 0.001),\ncoprime-30 offset 2.7541, coprime-210 offset 3.3395. If that gate had failed\nnothing below would stand (twelve figures asserted).\n\nTask: TODO Z4, head half, continuing `Q-head-residual` (PARTIAL). The item's\nremaining task on the head is \"a derivation of that remainder that is not HL\".\n\nThe head field is a slack field of R0 (head + Z2 + tail ≤ width, exact per\nzone, `zonegap-02-reduction.js` SEC B); its share of the width is 1.40% at the\ntop band (`zone-tail-02-0829.md`). Nothing below touches Z2 or the exponent's\ncritical path, no head is bounded from above anywhere here, and every\ninequality used is listed in §5 with its direction.\n\n---\n\n## 0. What is still open, and what failed\n\n**No derivation of the anchoring part was reached, and none is available\nbelow HL.** The remainder splits into an ensemble part and an anchoring part\n(§3); the ensemble part is a finite count at every level and derives; the\nanchoring part is the statement that the phase-zero window of the tile\nrealises the tile ensemble's pair-endpoint correlation, which is a three-point\nprime correlation in a short window. Sieve upper bounds reach it to a constant\nfactor and never as an asymptotic, and level-of-distribution results average\none-point counts over moduli, not three-point correlations. Kill condition met:\nevery route reduces to an HL-strength assumption on the two openers. PARTIAL.\n\n**The remainder the item names is not the remainder that exists.** The record's\n0.6214 pools 381,331 gaps over a decade across which the prime density falls\nten percent. The OLS of n on g over that pool mixes a between-height slope of\nabout λ/2 (E[n] ∝ ln p while E[g] ∝ ln²p) into a within-height slope of about\nλ, the line pivots about the mean, the intercept rises and Delta = 2 − β falls\n[MEASURED, mechanism derived in §1]. The 5.3 percent, same-sign miss that\n`head-residual-hl3.md` §0 and §6, `redteam-0828-head.md` row 6 and TODO Z4\ncarry is that pooling; at half-decade resolution the miss is 1.2 and 0.4\npercent at the top two windows and its sign alternates across six windows. The\ncorrection is owed to those documents and is not made here (fenced).\n\n**The one HEURISTIC sign in the record is wrong.** hl3 §2 guessed that the\nnon-uniform part of the no-interior-opener conditioning flattens the comb and\nso has \"the right sign to explain a five percent over-prediction\". The exact\nensemble says the opposite: the conditioning raises the deficit, so the\npipeline under-predicts by four percent (§2c, §3).\n\n**The tile at y = 29 was not enumerated.** The segmented walk over 6.47e9\npositions was timed at about fifteen minutes on this machine and dropped; the\n`--level29` flag exists and has no embedded output.\n\n---\n\n## 1. The remainder, as hl3 defines it, reproduced, and then measured at three window widths\n\nhl3 defines the remainder as the miss of its zero-parameter pipeline on the\nendpoint deficit: Delta_meas = 2 − β with β the OLS intercept of prime count on\ntwin-gap length, against Delta_HL from E[n | g] = 2 + κ W(g), W(g) = Σ_t\nρ(t,g), κ fixed by E[n] = 2 + λ_s E[g]. Producer SEC 0 (custody, convention A of\nhl3: both openers inside the window):\n\n| window | gaps | Delta_meas ± se | Delta_HL | ratio | eps = HL − meas |\n|---|---|---|---|---|---|\n| [1e5,1e6) | 6944 | 0.6899 ± 0.0355 | 0.7914 | 1.147 | 0.1015 |\n| [1e6,1e7) | 50810 | 0.6862 ± 0.0148 | 0.7124 | 1.038 | 0.0263 |\n| [1e7,1e8) | 381331 | 0.6214 ± 0.0060 | 0.6545 | 1.053 | 0.0330 |\n\nEvery figure matches the record to the printed digit (asserted at 1e-4).\n\n**The same statistic on narrower windows [MEASURED, SEC 0].** Half-decades of\nthe top window: [1e7, 10^7.5) 0.6848 ± 0.0111 on 101,137 gaps; [10^7.5, 1e8)\n0.6500 ± 0.0070 on 280,193. Quarter-decades: 0.7203 ± 0.0176, 0.6842 ± 0.0142,\n0.6677 ± 0.0113, 0.6565 ± 0.0089. Pooled minus the gap-weighted mean of the two\nhalves: −0.0378 at [1e7,1e8), −0.0455 at [1e6,1e7), −0.0524 at [1e5,1e6). The\npooled decade sits below every one of its own sub-windows.\n\n**Why, with the sign derived [PROVEN, order of magnitude ARITHMETIC].** Within\na sub-window at height p the line is n ≈ β + α g with α ≈ λ(p). Across\nsub-windows E[n] = λ E[g] with λ ∝ 1/ln p and E[g] ∝ ln²p, so E[n] ∝ √E[g]\nand the between-window slope dE[n]/dE[g] is λ/2, half the within slope. Pooling\nmixes the two in proportion to the between-group share of Var(g). Group means\nrun 204 to 250 across the decade against a within sd of about 0.945 × 236 =\n223, a share of about (15/223)² = 0.0045; the slope drops by about 0.0045 × α/2\n≈ 1.2e-4 and the intercept rises by that times E[g] = 236, about +0.03. The\nmeasured pooling term is −0.038 in Delta. Same sign, same order. HL's pipeline\ndoes not carry the bias, since W(g) knows nothing about height: its pooled\nvalue 0.6545 IS the gap-weighted mean of its half-decade values 0.6768 and\n0.6472. So the comparison in the record put a biased measurement against an\nunbiased prediction and read the bias as a miss.\n\n**Half-decade resolution, HL against measured [MEASURED, SEC 3 table]:**\n\n| window | E[g] | Delta_meas ± se | Delta_HL | (HL − meas)/meas |\n|---|---|---|---|---|\n| [1e5, 10^5.5) | 113.1 | 0.8239 ± 0.0625 | 0.8298 | +0.007 |\n| [10^5.5, 1e6) | 135.8 | 0.7114 ± 0.0419 | 0.7786 | +0.094 |\n| [1e6, 10^6.5) | 157.4 | 0.7705 ± 0.0268 | 0.7385 | −0.042 |\n| [10^6.5, 1e7) | 184.4 | 0.7172 ± 0.0174 | 0.7039 | −0.019 |\n| [1e7, 10^7.5) | 213.8 | 0.6848 ± 0.0111 | 0.6768 | −0.012 |\n| [10^7.5, 1e8) | 244.0 | 0.6500 ± 0.0070 | 0.6472 | −0.004 |\n\nEvery row inside 1.6 standard errors, sign alternating, the top two rows at\n0.7 and 0.4 s.e. \"Measured consistent with HL to 5 percent\" becomes \"to 1\npercent at the top, with the 5 percent an artefact of the window\". The\nhalf-decade values still carry a residual of the same bias (the quarter-decade\npairs sit about 0.01 above them), so even these rows are slightly low.\n\n---\n\n## 2. The three candidates, each named for what it is\n\n### 2a. The frozen-sieve first survivor (candidate i): an exact tile object, and it is the ensemble\n\nThe head at origin p is the first twin slot of the frozen √p-level sieve above\np in 96.65% of zones (`destroyer-census-01.md` §6(a)). In the tile T_y that is\nthe forward distance from a HOLE (a position coprime to y#) to the next twin\nslot, whose mean over all holes is a finite count. Producer SEC 1 enumerates it\nat y = 11, 13, 17, 19, 23: the hole-origin head is R + 3.2524, 3.4903, 3.6719,\n3.8263, 3.9604 against the continuum functional R of the tile's own gaps, the\nuniform-integer origin is R + 1/2 exactly at every level (asserted), and\nthe identity h − R = A + B with A = A_forced + D holds with D = −0.4375 to\n−0.5642. This is `redteam-0828-head.md`'s comparator ladder (R + 1/2, R + 1,\nR + 2.754, R + 3.340) continued to full levels, and it is exact [PROVEN at each\nlevel, by enumeration]. Sampled by CRT at the number line's own levels (SEC 3)\nit reads R + 5.98 at y = 3137, R + 6.24 at y = 9973, R + 6.37 at y = 19997,\nagainst the number line's prime-origin h − R = 5.680 at [1e7,1e8). So the\nfrozen-sieve object is not a derivation route separate from (iii): it is the\nensemble head, and its comparison with the number line is the anchoring\nquestion. Not a re-fit, not HL; a finite count whose relation to the number\nline is the open step.\n\n### 2b. The level-of-distribution correction (candidate ii): the residue effect is real, and it is the ensemble's\n\nThe natural form of a residue correction is the wheel ladder: the origin\npopulation coprime to y# for y = 2..31, measured against the CRT prediction\nunder equidistribution of the openers' residue pairs (r, r + g) mod y#. On the\nnumber line at [1e7,1e8) the measured rungs exceed the residue-uniform\nprediction by +0.0208 (y = 7), +0.0451 (11), +0.0612 (13) [MEASURED, SEC 0];\nthe mod-30 rung sits at −0.0006. The openers are NOT equidistributed among the\nadmissible residue pairs given g, and the reason is the gap's defining\ncondition: configurations with fewer interior twin-slot residues are\nover-represented among gaps with no interior opener. That is not a property of\nprimes: the rotation ensemble of T_9973 shows +0.0256, +0.0604, +0.0709 on the\nsame rungs, T_19997 shows +0.0226, +0.0540, +0.0680 [MEASURED, SEC 3]. The\nnumber line's deviations are 75 to 86 percent of its ensemble's. No\nBombieri-Vinogradov-type input bears on this: it is a conditioning effect inside\nthe tile, and the ladder's approach to the prime origin (cop31 reaches 5.009 of\nthe 5.680, 88.2%) is the y → √p limit of a CRT object. Candidate (ii) is the\nensemble in disguise, with a residual that is the anchoring part again.\n\n### 2c. The exact tile ensemble (candidate iii): derives, splits the remainder, and gets the sign hl3 guessed wrong\n\nTwo facts make the ensemble the right comparator and make HL's pipeline an\nensemble computation. First, at [1e7,1e8) the largest prime entering ρ is\ng_max + 2 = 2870 < √(1e7) = 3162.3 (asserted), so hl3's singular-series ratio\nρ(t,g) is, without truncation, the exact CRT density of holes of T_y at offset\nt given holes at 0, 2, g, g+2, for every y ≥ √p. The producer asserts the CRT\nidentity as integers at 16 offsets t at each enumerated level (16/16 at y = 11\nto 23). Second, each decade [lo, hi) is a window of T_y at phase zero for\ny = 313, 997, 3137, 9973 (hi ≤ y′², asserted), by the Zone Restriction Lemma:\nthe primes there are the holes and the twin primes the twin slots. So the\nnumber line's decade is one member of the rotation ensemble of that tile, and\n\"HL prices Delta\" means \"the pipeline's five-point conditioning, run on the\nanchored member's gap law, lands near the anchored member's Delta\".\n\n**The pipeline inside the ensemble [MEASURED, exact at y ≤ 23 by enumeration,\nsampled at y ≥ 313 by CRT with seed 20260830, 300 to 400 windows of 2^22].**\nDelta_pipe / Delta_ens = 1.0492, 1.0134, 0.9842, 0.9711, 0.9584 at y = 11, 13,\n17, 19, 23; 0.9511, 0.9594, 0.9615, 0.9630 at y = 313, 997, 3137, 9973; 0.9591\nto 0.9636 at the six gap-scale-matched levels 941 to 19997. Replacing W(g) by\nthe tile's exact E[n | g] − 2 returns the OLS Delta to 1e-9 (asserted), so the\npipeline's whole error is its treatment of the no-interior-opener condition as\nuniform thinning λ → λ_s. Above y = 17 that error is a four percent\nUNDER-prediction, slowly closing. The exact E[n | g] rows (SEC 1) show where:\nat y = 23 the pipeline is +0.0760 high at g = 18 and −0.3064, −0.3497, −0.5170\nlow at g = 66, 90, 108. hl3 §2 argued the conditioning flattens the comb and\nlowers the deficit; the enumerated tile says it raises it. Mechanism, stated\nwithout proof: forbidding interior twin slots removes mass at t ≡ 0, 2 mod 6,\nwhich are the comb's live positions, and near an opener those positions are\nalready depleted by the endpoint's own exclusions, so the thinning bites the\nbulk harder than the ends and the end deficit grows relative to the bulk\n[HEURISTIC, direction only; the number is the enumeration's].\n\n---\n\n## 3. The split, with the numbers\n\nPer half-decade, against an ensemble whose level is chosen so that its E[g]\nmatches the window's (ln y = √(E[g]/2.41); the ensemble's E[g]/ln²y reads\n2.405 to 2.46 across levels, printed as the check), SEC 3:\n\n| window | y_match | E[g] line / ens | Delta_meas | Delta_HL | Delta_ens ± se | pipe/ens | meas/ens | (HL − ens)/meas | (ens − meas)/meas |\n|---|---|---|---|---|---|---|---|---|---|\n| [1e5, 10^5.5) | 941 | 113.1 / 113.6 | 0.8239 | 0.8298 | 0.8537 ± 0.0008 | 0.9591 | 0.9651 | −0.029 | +0.036 |\n| [10^5.5, 1e6) | 1811 | 135.8 / 136.2 | 0.7114 | 0.7786 | 0.8100 ± 0.0010 | 0.9585 | 0.8783 | −0.044 | +0.139 |\n| [1e6, 10^6.5) | 3229 | 157.4 / 157.5 | 0.7705 | 0.7385 | 0.7742 ± 0.0011 | 0.9598 | 0.9953 | −0.046 | +0.005 |\n| [10^6.5, 1e7) | 6287 | 184.4 / 184.3 | 0.7172 | 0.7039 | 0.7364 ± 0.0013 | 0.9607 | 0.9740 | −0.045 | +0.027 |\n| [1e7, 10^7.5) | 12301 | 213.8 / 213.4 | 0.6848 | 0.6768 | 0.7012 ± 0.0014 | 0.9636 | 0.9766 | −0.036 | +0.024 |\n| [10^7.5, 1e8) | 19997 | 244.0 / 235.9 | 0.6500 | 0.6472 | 0.6814 ± 0.0016 | 0.9605 | 0.9539 | −0.053 | +0.048 |\n\nRead column by column. **(HL − ens)/meas, the pipeline part**: −0.029 to −0.053,\nsteady, the ensemble's own property, derivable at any level by finite count or\nby sampling to any precision, no prime input. **(ens − meas)/meas, the\nanchoring part**: +0.005 to +0.139 with the big value on a window of 5,035 gaps\n(se 0.042 on Delta, so 2.4 s.e.), and +0.024, +0.048 at the two best-measured\nrows (1.5 and 4.5 s.e. on the measurement's own error; the quarter-decade\nreadings say the half-decade values are themselves about 0.01 low from residual\npooling, which would bring the top row's anchoring part to about +0.03). The\ntwo parts cancel to the ±1 percent that column (HL − meas)/meas of §1 shows.\n\nAt the decade level, against the tile the decade is a window of (y = √hi),\nthe anchoring part reads larger because the comparison is not gap-scale\nmatched: Delta_meas/Delta_ens = 0.8121, 0.8860, 0.8736, with E[g] 129.6/115.5,\n177.1/156.3, 236.0/204.3. That mismatch is the Mertens factor (the anchored\nwindow's twin density is e^{2γ}/4 of the ensemble's at u = 2,\n`origin-excess.md`), a known anchoring effect; the matched comparison strips\nit, and what is left, 2 to 5 percent at the top, is anchoring beyond Mertens.\nThe gap-scale-matched level y = 19997 also matches the hole density: 0.05666\nagainst 1/ln(5e7) = 0.05641, so both first moments agree and the residual is\nin the pair-endpoint correlation itself: β 1.3786 line against 1.3186\nensemble, CV² 0.8941 against 0.8823, β CV² 1.2326 against 1.1634, (h − R)/E[g]\n0.0241 against 0.0270.\n\n**The head at small levels, anchored zone against ensemble [MEASURED, SEC 2].**\nAt y = 11..23 the zone (y, y′²) holds 34, 55, 65, 91, 137 prime origins; the\nnumber-line head equals the tile head at 30, 55, 62, 91, 135 of them (the\nmisses are origins whose next tile slot sits at or past y′² − 2). Anchored mean\nagainst ensemble hole-origin mean: 14.353/14.387, 14.655/17.181, 18.615/19.773,\n22.132/22.383, 29.985/24.741, a naive z of −0.02, −1.63, −0.66, −0.14, +3.21.\nOne contiguous stretch per level, so z is a scale and not a test; the y = 23\nvalue is one 148-long twin gap (661 to 809). No sign is stable and nothing is\nconcluded from this table except that the small levels cannot see the\nanchoring part.\n\n---\n\n## 4. The single step that does not derive\n\n**Statement.** For the anchored window [lo, hi) of T_y and the ensemble of T_y\nat matched gap scale, Delta_anchored / Delta_ens → 1, or to any specific\nconstant. Equivalently: Σ over twin openers a in the window of 1_prime(a + t),\nfor t up to the gap scale, follows the ensemble's CRT density ρ(t, g) after\nconditioning on no interior opener.\n\n**What it is.** A three-point (and with the right opener, five-point) prime\ncorrelation asymptotic in a window of length ln²p about each opener, averaged\nover openers at height p. HL for the tuple (0, 2, t) gives it with an\nunquantified 1/ln x error, which at ln x = 17.7 is the size of the effect.\nBelow HL: Selberg-sieve upper bounds for the triple count carry a constant of\nat least 2 to 4 times the truth and no lower bound at all (a lower bound on\ntriples would be a prime-triple existence statement). Level-of-distribution\ntheorems (Bombieri-Vinogradov, its extensions) average |π(x; q, a) − x/(φ(q)\nln x)| over q and say nothing about the joint event that a + t is prime given\na and a + 2 are. Every route named in the brief lands here.\n\n**Is it TPC-strength?** No, and it is not TPC-implying either: Delta is\ndefined on the twin-gap process and the statement is conditional on that\nprocess existing in the window. It is HL-strength in the weaker sense that\nonly HL supplies it, and it is off the exponent's critical path. The head is a\nslack field; a derivation here would move the item and nothing else.\n\n**What would falsify the split.** A Monte Carlo at an ensemble level matched to\n[10^7.5, 1e8) with pipe/ens outside [0.95, 0.97]; or a quarter-decade\nmeasurement of Delta at 1e12 (TODO Z7 item (3)'s pass, this file's engine\nreused) landing at its matched ensemble's value to within 1 percent, which\nwould put the anchoring part at zero and leave only the pipeline part, all of\nit derivable.\n\n---\n\n## 5. Inequalities used, with direction\n\n- g_max + 2 = 2870 < √(1e7) = 3162.3 at [1e7,1e8): needed so that the\n singular-series product over q ≤ g + 2 equals the CRT product over q ≤ y for\n every y ≥ √p. Direction: the product must include every prime that can\n collide with an offset t ≤ g + 2; primes above g + 2 contribute the\n t-independent factor GTOT that cancels in the pipeline. Asserted true.\n- hi ≤ y′² for the four decade levels: needed so that the decade is a window\n of T_y at phase zero (Zone Restriction, `GLOSSARY.md` \"Zone\"). Direction: a\n hole below y′² is prime; above it, not necessarily. Asserted true.\n- The pooling sign: between-window slope λ/2 < within-window slope λ, so the\n pooled slope is below the within slope and the pooled intercept above it,\n hence pooled Delta below the sub-window mean. Derived in §1; measured\n −0.038, −0.046, −0.052.\n- No head is bounded above or below anywhere. Nothing here is used against\n Z2 or the width.\n\n---\n\n## Defects noticed in passing\n\n- `head-residual-hl3.md` §0, §3, §6 and its ledger verdict; `head-residual-null.md`\n §2, §3; `redteam-0828-head.md` rows 6 and 22; TODO Z4's head paragraph: the\n measured Delta = 0.6214 at [1e7,1e8) (and 0.6862, 0.6899) is a decade-pooled\n OLS intercept carrying a −0.04 to −0.05 Simpson-type bias; the \"5.3 percent\n over-prediction, same sign at three windows\" is that bias. At half-decade\n resolution the miss is 1.2 and 0.4 percent with alternating sign. The\n correction is owed to all four documents and to `destroyer-census-01.md`'s\n reading of the record.\n- `head-residual-hl3.md` §2's HEURISTIC sign for the no-interior-opener\n conditioning is the wrong way round: the exact ensemble's Delta is above the\n pipeline's by four percent, not below.\n- `head-residual-null.js` SEC 2 and `head-residual-hl3.js` SEC 0 compute β and\n the profile on decade pools; every β-derived figure in those files (β, Delta,\n the 72/28 and 81/19 splits, β CV²) inherits the pooling term. The identity\n h − R = A + B and B's regression form are unaffected (they are identities in\n whatever pool is used); the numbers read off them are pooled numbers.\n- `head-residual-factor.md` §3's β CV² = 0.7993 → 1.2326 and its rate argument\n are built on the same pooled β; the half-decade β's are lower (Delta higher),\n so the product is lower than quoted and further from 2. The direction of the\n rate conclusion is unchanged; the values are not the local ones.\n- The producer's SEC 2 z-scores are labelled naive in the output and should not\n be quoted as tests.\n\n---\n\n## What would falsify this, and whether that check has run\n\n| Claim | Rung | Falsifier | Run? |\n|---|---|---|---|\n| Custody: every record figure reproduces on an independent walk | MEASURED | any of the nine asserted figures missing at 1e-4 (h − R at 1e-3) | YES, all pass |\n| The pooled decade Delta sits below its sub-windows by a Simpson-type term | MEASURED, sign PROVEN, size ARITHMETIC | a decade whose pooled Delta is at or above the gap-weighted mean of its halves | YES, three of three decades below by 0.038 to 0.052; quarter-decades monotone above the halves |\n| HL's pipeline pools linearly (no gradient bias) | PROVEN (W(g) is height-free) | pooled Delta_HL differing from the gap-weighted mean of the halves | YES, 0.6545 against 0.6768 and 0.6472 weighted by 101,137 and 280,193 |\n| At half-decade resolution HL is within 1.6 s.e. at every window, sign alternating | MEASURED | a window outside 2 s.e., or a stable sign | YES, six windows; the top two at 0.7 and 0.4 s.e. |\n| ρ(t,g) is the exact CRT hole density of T_y for y ≥ g + 2 | PROVEN (CRT) and asserted as integers | any of 16 offsets at any of 5 levels disagreeing | YES, 80/80 |\n| Each decade is a window of T_{√hi} at phase zero | PROVEN (Zone Restriction) | hi > y′² | YES, asserted at four levels |\n| The pipeline under-predicts its own ensemble by 3.6 to 4.9 percent for y ≥ 17 | MEASURED (exact at y ≤ 23, sampled above) | pipe/ens crossing 1 at some y ≥ 313, or the exact-W control failing | PARTIAL: exact to y = 23, sampled at ten levels to 19997 with se on Delta_ens ≤ 0.0016; y = 29 not enumerated |\n| The exact ensemble Delta is above the pipeline's, contradicting hl3 §2's sign | MEASURED | the enumeration at y ≥ 17 showing Delta_ens < Delta_pipe | YES at y = 17, 19, 23 and at every sampled level; NO at y = 11, 13 where the ratio is above 1 and gaps average 17 to 20 |\n| The anchoring part is +2 to +5 percent at the top after gap-scale matching | MEASURED | a matched ensemble landing on Delta_meas within 1 s.e. | PARTIAL: six windows, the top at 4.5 s.e. on the measurement's error but with a residual pooling term of about 0.01 in the half-decade value itself; not run at 1e12 |\n| The wheel-ladder deviation from residue-uniformity is an ensemble effect | MEASURED | the ensemble showing no deviation, or one of the opposite sign | YES, ensemble +0.023 to +0.071 against the number line's +0.021 to +0.061 on the same rungs |\n| No route below HL reaches the anchoring part | ARGUED, not proven | an unconditional asymptotic for Σ_a 1_prime(a + t) over twin openers in a short window | NO, and none is known to this corpus |\n\nThe cheap check not run: the half-decade and quarter-decade Delta at 1e12 on\nthe box, which every note in this chain queues, now with the specific\nprediction that the anchored value lands 2 to 5 percent below the matched\nensemble's, the ensemble's value being computable to 0.001 by this file's SEC 3\nat any level in seconds.\n"},"research/history/staging/attack-0830-rec-cheapest.md":{"lf_sha256":"15d3ee8e20010554550f9ad969c137dada5997fe090532bc2338164ecc89996c","content":"# REC at its cheapest legal point: the saving asked is z^{1.031}, and the pointwise floor of the certificate says no accounting can supply it\n\n\n\n> **RIDER 2026-09-04 (orchestrator, from `redteam-0904-floor-growth-2.md` §5\n> and `redteam-0904-item0.md`).** §4.2's p* window (4D^{1/27}, D^{1/9}/4) is\n> a convenience bound, neither necessary nor sufficient for family membership\n> at reachable levels: on exact integers the construction's onset is\n> z = 1.875e6 at this note's s = 2.698721 (the analytic 1.055e6 is early by\n> 1.78×) and 4.39e5 at s = 3.0. The floor's crossing of H = z^{u₀} depends on\n> both s and u₀ (5.6e31 is the (2.698721, 4.2165) cell; 10^15.3 at (3.0, β₂)).\n> The growth half survived a second adversarial pass at every admissible\n> level split (1643 splits, minimum margin 0.64); rung unchanged, DERIVED.\n\n> **RIDER 2026-08-30 (orchestrator; both halves red-teamed on independent\n> code).** EXACT half (`redteam-0830-floor-sign.md`): STANDS as PROVEN and is\n> stronger than stated in two places (E3's identity holds at every position,\n> 0 mismatches in 20.5M, not only at doubly non-rough points; sup|R₁| = Ω + M\n> exactly, so sup|ρ̃| ≥ (Ω + M)/2, not (Ω − M)/2); E2 needs the hypothesis\n> D ≥ z this note omits (it fails at s = 0.8; free in the legal band); Ω\n> reproduced at all 26 tabled values and extended to 285, 441, 684, 990,\n> 1155 at z = 79, 83, 89, 97, 101. Three sentences REFUTED as written: E1\n> (L164) \"every pair with gcd | 2 is realised\" — exactly half are, the\n> missing half being the pairs where 2 divides one side only; the ledger's\n> and §0's \"251 against z^{u₀} = 1.05e6\" — 1.05e6 is HM(u₀), z^{u₀} at\n> z = 73 is 7.188e7, so the gap is 68.3× larger than stated; §4.4's reason\n> for λ⁺(P(z)) = 0 (0.24 exceeds 1/8; the closing figure is 0.1169–0.1199,\n> under 1/8 by 4–7%, a near-miss). The exact half constrains REC at NO u₀ by\n> itself, every exactly known log_z Ω being below 2. GROWTH half\n> (`redteam-0830-floor-growth.md`): six attacks, no break, stays DERIVED;\n> hypothesis s ≤ 3 added to the 16s/9 threshold; \"0.012 → 0.35, rising\" is\n> the wrong description (falls 2.5× first); q ≈ z^{5.00} not z^{4.8}; the\n> blind slope test tests the construction, not the law. Ruling: REC, F1, F2\n> and RML below β₂ are false at rung derived-and-red-teamed-once, the route a\n> truth gap at that rung (`REFUTED.md`, 2026-08-30), its falsity beyond\n> z ≈ 5.6e31.\n\n*(2026-08-30 wave, staging. Producer:\n`research/history/staging/attack-0830-rec-cheapest.js`, embedded via\n`qc/embed.js`. No existing file edited, no git command run. Every number\nbelow is in the producer's OUTPUT block or is quoted from an embedded\nartifact cited by file and section. Calibration per claim: PROVEN, MEASURED,\nDERIVED (a written argument not yet adversarially checked), HEURISTIC, OPEN,\nREFUTED. HELD: no adversarial pass has run on §4.)*\n\n## 0. What is open, first\n\n- **Nothing here lowers any exponent, and no route closes.** At the cheapest\n legal point the five routes of `attack-0829n-rml-proof.md` §4 die at the\n same statement they died at yesterday (§2), and the mixed strategy of the\n brief is worth z^{0} (§3). On the brief's kill rule this is PARTIAL.\n- **The new part is adverse to the item.** §4 shows the absolute-value\n accounting is sharp up to a polylog at one window that can be written\n down, so the saving REC asks for, z^{1.031} at the cheapest point and\n z^{2s − u₀} anywhere, is not a saving a proof has failed to find but a\n saving that is not there. The exact half of that (E1–E4 of §4.1) is\n PROVEN and machine-checked at z ≤ 73; the growth half (§4.2, exponent\n 16s/9 − o(1), and 2s − o(1) in the limit) is DERIVED and HELD for one\n adversarial pass. If it stands, REC(s, u₀) is false at every u₀ < 16s/9,\n which at s ↓ 1+√e is 4.7088 > β₂, so no legal point survives; F1, F2 and\n RML(α) at every α < β₂ go with it, and rider 2's floor th(nP) exceeds β₂\n asymptotically. That is the event yesterday's §6 listed under \"the floor\n crossing β₂: REC would be moot rather than false\".\n- **At every computable z it remains a proof gap.** Ω(z), the pointwise\n floor, is exact to z = 73 and reads 251 against z^{u₀} = 1.05e6 (S3); the\n certified lower bound at z = 5e5 is 8.86e17 against 1.07e24 (S4b), a\n factor 1.2e6 short, with the deficit falling 3.01 → 1.65 exponents over\n 601..5e5 and needing to reach 0.58 before any window fails. No computation\n in reach falsifies REC; the falsity is a statement about the limit.\n- **What was not done.** No exact sup at s near 1+√e beyond z = 29 (S2), no\n exact Ω beyond z = 73, no six-prime chains in the certified family (they\n would raise the exponent toward 2s and are dormant below z ≈ 1e5), no\n literature search for the pointwise-size fact, which is standard.\n\n## 1. The cheapest point, written out (deliverable a)\n\nFix η > 0 and set s = 1 + √e + η, u₀ = β₂ − η, D = z^s, H = ⌊z^{u₀}⌋,\nW = P(z). REC(1+√e+η, β₂−η) reads: there are ε > 0 and z₀ with\n\n sup_{x ∈ ℤ/W} |R_H(x)| ≤ z^{(β₂−η)/2 − ε} · ⟨R_H²⟩^{1/2} for all z ≥ z₀,\n\ns and u₀ fixed before z, u₀ never a function of z (the quantifier discipline\nof `attack-0829n-rml-proof.md` §3, unchanged). Its truth gives G₂(z#) ≤\nz^{β₂−η}, an exponent movement of exactly η. The point is legal for every\nη ∈ (0, β₂ − 2): u₀ − 2 = 2.2165 at the working η (S0), fixed and never sent\nto 2 (`attack-wrongdirection-audit.md` §3.10, row 10). It is the cheapest\npoint in one currency and the dearest in the other, and both are read off\nS0 (constants 1+√e = 2.648721270700, β₂ = 4.26645028414864, difference of\nthe doubles 2(1+√e) − β₂ = 1.030992):\n\n| η | s | u₀ | cap-currency ask 2s − u₀ | rms-currency ask u₀/2 | bought |\n|---|---|---|---|---|---|\n| 0 (limit, illegal: M → 0) | 2.6487 | 4.2665 | 1.0310 | 2.1332 | 0.00 |\n| 0.01 | 2.6587 | 4.2565 | 1.0610 | 2.1282 | 0.01 |\n| 0.05 (working point) | 2.6987 | 4.2165 | 1.1810 | 2.1082 | 0.05 |\n| 0.10 | 2.7487 | 4.1665 | 1.3310 | 2.0832 | 0.10 |\n| 0.35 (≈ yesterday's s = 3) | 2.9987 | 3.9165 | 2.0810 | 1.9582 | 0.35 |\n\n- **Cap currency.** Against any absolute-value accounting (C3-triv, C3-cap of\n yesterday's §2, both PROVEN at exponent 2s + o(1)) the saving asked is\n z^{2s − u₀ − o(1)} = z^{1.030992 + 3η}. At η → 0 this is the\n 2(1+√e) − β₂ gap of `sift-limit-attack.md` §4.5 and §7b (K_FH =\n 5.297442541400 against β₂), the brief's z^{1.031}: correct to the digits\n the brief gives. It is the smallest saving any legal point asks for, and it\n buys the least, η.\n- **Rms currency.** Against the PROVEN mean square (C1–C2) the recovery\n asked, sup/rms ≤ z^{u₀/2 − ε}, is LARGEST here: u₀/2 = 2.1332 − η/2 against\n 1.5 at u₀ = 3. Cheap in one accounting is dear in the other, and the\n routes of §2 live in different currencies, which is why they have to be\n priced separately.\n- **Main term at the point.** M ln²z is MEASURED 0.3332 → 0.2715 at z = 13..47\n at s = 2.698721 (S2, S3; the s = 3 family reads 0.3359–0.3772, S1), falling:\n the linear-sieve main term ln(s−1)² − 1 vanishes at s = 1+√e, so the\n consumer's HM − 1 is itself thinner here than anywhere else in the band.\n\n## 2. The five routes at a demand of z^{1.031} (deliverable b)\n\nEach route is re-priced at (s, u₀) = (2.698721, 4.216450) and at η → 0.\n\n1. **Term-count cap (yesterday §4.1).** The cap delivers exponent 2s + o(1)\n by taking absolute values across the lattice, so its saving over itself\n is identically 1 at every (s, u₀). A demand of z^{1.031} is smaller than\n the z^{2.0} demand at (3, 4), but the route supplies zero saving at any\n positive demand, so it does not close and cannot close by lowering the\n demand. Measured at the point: u_cap is not re-tabled; §4 shows the cap\n is sharp up to a polylog, which is stronger than \"not improved\".\n2. **Position union and moments (yesterday §4.2).** Price e^{θ(z)/q} at\n moment order q. Against the rms-currency ask z^{u₀/2}: with Gaussian-shaped\n moments ‖R‖_q ≤ C√q · rms the route needs e^{θ(z)/q}·√q ≤ z^{u₀/2 − ε},\n i.e. q ≥ θ(z)/((u₀/2) ln z)(1 + o(1)). The cheapest point asks the largest\n u₀/2, so the moment order needed is the SMALLEST of the band, z/(2.1332\n ln z) against z/(1.5 ln z) at u₀ = 3: a constant factor 1.42 on an order\n that still diverges. The only proven moment is q = 2 (I1); the failing\n step is a moment bound of unbounded order, the same step as yesterday.\n Against the cap-currency figure z^{1.031} the comparison is not even the\n right one: e^{θ(z)/q} ≤ z^{1.031} needs q ≥ z/(1.031 ln z) and then\n ‖R‖_q is unproven for every q > 2.\n3. **Window smoothing and the P(y) lever (yesterday §4.3).** Polylog movers;\n at the cheapest point the reduced range of moduli (z^{u₀−δ}, z^{2s}] is\n only 1.181 + δ exponents wide, so there is less to remove, and the\n removed part was never the exponent. §4.3 below shows the counterexample\n window lives entirely inside the reduced range.\n4. **The mean square (yesterday §4.4).** I1 is square-root cancellation at\n every level, s-uniform; not where the exponent is lost. Unchanged.\n5. **The smooth-profile form (yesterday §4.5).** Disconnected at both ends;\n nothing at the point changes the hypothesis. Unchanged.\n\n**The single failing step, at the cheapest point:** a bound on the signed\ncount of large-modulus lattice hits in one window, uniform in the window's\nposition, by o(H/ln²z), with H = z^{β₂−η} and the moduli up to z^{2s}. That\nis the statement of yesterday's §4.3, the reduced arrow, at the point where\nthe modulus range is narrowest. It is the same statement, so by the brief's\nkill rule the routes verdict is PARTIAL. §4 then says the statement is false.\n\n## 3. The mixed strategy, with the arithmetic (deliverable c)\n\nSplit the moduli at z^{u₀−δ}. Below it, the ℓ¹ accounting is PROVEN to sit\nunder HM − 1 for large z (yesterday reading 4). Above it, the only two\ninstruments are the cap (sup ≤ CAP_big ≤ z^{2s} polylog, PROVEN) and the mean\nsquare (⟨R²_big⟩ ≤ B_big H, PROVEN, almost-all only). A sup bound from the\npair {sup ≤ A, rms ≤ B} is exactly A: with no moment above the second, the\nmean square contributes nothing to a bound at one position (Axis C of\n`attack-wrongdirection-audit.md` §1: the density of bad positions it\ncontrols is W·B²/λ², never zero). So every mixture \"part from the mean\nsquare, part from a cap over a restricted range\" reduces to the cap on the\nbig moduli:\n\n saving = CAP_big / z^{2s} = z^{o(1)}, for every split point δ,\n\nbecause the ℓ¹ mass sits at the top of the modulus range (yesterday S3:\nthe share of CAP above z^{3.5} at s = 3 reads 0.5684 at z = 37 and rising).\nThe mixed strategy reaches z^{0}, not z^{1.031}. There is no arithmetic to\ndo beyond this, and §4 makes the zero structural: the cap's exponent is the\ntrue exponent of the certificate at a planted window.\n\n## 4. The pointwise floor of the certificate (deliverable e, the new part)\n\nEverything in §§2–3 dies at the same statement as yesterday. What is new is\nthe reason: the absolute-value accounting is not loose. Its exponent, up to a\npolylog, is the true size of the certificate at one window, and the window\ncan be written down.\n\n### 4.1 Four exact facts\n\nWrite λ^±(n) = Σ_{d | n, d ∈ D^±} μ(d) for the Rosser weights of level D\n(`sift-limit-lemmaV.js` `rosserSupport`, the pilot's own support), P = P(z),\nand for a position r let n₁ = gcd(r, P), n₂ = gcd(r+2, P). Then:\n\n- **(E1) cc(r) is a function of (n₁, n₂) alone**, cc(r) = λ⁻(n₁)λ⁺(n₂) +\n λ⁺(n₁)λ⁻(n₂) − λ⁺(n₁)λ⁺(n₂), and every pair (n₁, n₂) of divisors of P with\n gcd(n₁, n₂) | 2 is realised by some r in ℤ/W (CRT: r ≡ 0 mod n₁,\n r ≡ −2 mod n₂, r ≢ 0, −2 mod every other odd prime). PROVEN, one line.\n- **(E2) λ⁺(n) ≥ 0 and λ⁻(n) ≤ 0 at every n | P with n > 1.** The Buchstab\n boundary identity: for a prefix-closed support D, Σ_{d | n, d ∈ D} μ(d) =\n 1_{n = 1} − Σ μ(d₀)·1[(n, P(p_m)) = 1], the sum over first-exit chains\n d₀ = p₁ ⋯ p_m | n (p₁ > ⋯ > p_m, p₁ ⋯ p_{m−1} ∈ D, d₀ ∉ D). D⁺ exits only at\n odd m (its conditions are p₁ ⋯ p_{m−1} p_m³ ≤ D at odd m; the size cap is\n implied at even m), so every boundary term has μ(d₀) = −1 and λ⁺(n) is a\n count; D⁻ exits only at even m, so λ⁻(n) is minus a count. Checked\n exhaustively over every divisor of P(z) at z = 13..73 (S3, `viol` = 0 at\n every level, both s). PROVEN.\n- **(E3) At a doubly non-rough point, cc(r) = −(A₁A₂ + A₁B₂ + B₁A₂) with\n A_i = λ⁺(n_i) ≥ 0, B_i = −λ⁻(n_i) ≥ 0**, so cc(r) ≤ −A₁A₂. From (E1),\n (E2). PROVEN. (Where r+2 is rough, cc(r) = λ⁻(n₁) = −B₁; the S3\n maximisers at z ≤ 19 are of that kind, B₂ printed as −1.)\n- **(E4) For every window (x, x+H] containing r: T(x) ≤ cc(r) + (H − 1)**,\n because cc(r′) ≤ θ(r′)θ(r′+2) ≤ 1 pointwise (Brüdern–Fouvry, PROVEN,\n `rho-maximal-law.md` §2 (iv)). PROVEN.\n\nDefine **Ω(z, s) = −min_r cc(r) = max over splits of (A₁A₂ + A₁B₂ + B₁A₂)**.\nThen, for every H ≤ Ω(z, s): the window starting at r − 1 has T ≤ −1, so\n**nP(z) > Ω(z, s)** (rider 2's floor), **F1 fails at H**, and since\nR_1(x) = cc(x+1) − M, **sup|ρ̃| ≥ (Ω − M)/2**. Direction guard: every one of\nthese is a lower bound on a remainder or an upper bound on the certificate,\nthe adverse direction; none says anything about G₂ itself and none has TPC\ncontent.\n\n### 4.2 The exit-chain count, and its size\n\nBy the boundary identity, for n = P₁ with smallest prime p*,\n\n λ⁺(P₁) = #{ d′ ∈ D⁺ : d′ | P₁/p*, ω(d′) even, d′ > D/p*³ },\n\nthe chains that exit D⁺ exactly when p* is appended (the odd-m condition\nd′·p*³ ≤ D fails). Take the sub-family ω(d′) = 4, d′ = p₁p₂p₃p₄ with\np₁³ ≤ D and p₁p₂p₃³ ≤ D (the two D⁺ conditions, both prefix conditions\nimplied). At the extremal exponent pattern (s/3, s/3, s/9, s/9) the product\nreaches D^{8/9}, and it exits at any p* > (D/d′)^{1/3} ≈ D^{1/27}. Dyadic\nranges p₁ ∈ (D^{1/3}/2, D^{1/3}], p₂ ∈ (D^{1/3}/4, D^{1/3}/2], p₃ ∈\n(D^{1/9}/2, D^{1/9}], p₄ ∈ (D^{1/9}/4, D^{1/9}/2] satisfy both conditions\nidentically, give d′ ≥ D^{8/9}/64, and exit at every p* > 4D^{1/27}. Split\nthe primes in each range by index parity into two halves and give each half\nits own p*: two disjoint sets P₁, P₂, each with A_i ≍ D^{8/9}/ln⁴D by\nChebyshev's bounds on the four dyadic prime counts, whence\n\n Ω(z, s) ≥ A₁A₂ ≫ z^{16s/9} / ln⁸ z (DERIVED, HELD).\n\nThe same construction with 2k primes at the pattern (s/3, s/3, s/9, s/9, …,\ns/3^k, s/3^k) gives exponent 2s(1 − 3^{−k}), so **Ω(z, s) ≥ z^{2s − o(1)}**\nfor fixed s as z → ∞, the o(1) being O(3^{−k}) at the cost of a polylog\nln^{−4k} z. The 4-chain exponent already suffices for what follows.\n\nWhat this is not: it is not new mathematics. That combinatorial sieve weights\ntake polynomially large values at smooth integers, and that absolute\nremainder accounting is therefore sharp for sifting short intervals, is the\nstandard reason a level of distribution is needed at all. The corpus measured\nthe absolute side of this on 2026-08-18 (`sift-limit-attack.md` §7b (3), the\nplanted doubly-smooth n₀ at 0.978 of the trivial bound) and read the signed\nside as small because at z = 13 it is: Ω(13) = 1 (S3). The signed side grows,\nand the reason is (E2): at a planted point every term of cc has the same\nsign, because both weights are counts of exit chains.\n\n### 4.3 What it does to REC, F1, F2, RML and the floor\n\n- **REC(s, u₀) is false for every u₀ < 16s/9, if §4.2 stands.** REC implies\n min_x T(x) ≥ 1 at H = z^{u₀} for all z ≥ z₀ (chain C3–C6, PROVEN), and\n (E4) with Ω ≥ z^{16s/9 − o(1)} gives a window with T ≤ −1 for all large z\n once u₀ < 16s/9. At s = 1+√e+η the threshold is 16s/9 = 4.7088 + 1.78η\n and the cheapest point u₀ = β₂ − η sits 0.4424 + 2.78η below it (S0);\n at s = 3 the threshold is 5.3333. So the whole legal band (2, β₂] is\n below the threshold at every admissible s, and the \"cheapest\" point is\n not cheaper in the only currency that turns out to matter.\n- **F1 and F2 (`rho-maximal-law.md` §1) fail at every H < Ω(z)**, including\n the per-position form ∀x ∃H: the window starting at r − 1 has T ≤ −1 for\n every H ≤ Ω. **RML(α) fails for every α < 16s/9** through sup|ρ̃| ≥\n (Ω − M)/2, which is above β₂: the named legal target of item 0 cannot be\n true at any sufficient α. **Rider 2's floor th(nP) ≥ log_z Ω → ≥ 16s/9 >\n β₂**: the deliverable band [th(nP), β₂) is asymptotically empty. This\n decides the \"two models, neither called\" of `rho-maximal-law.md` reading 6\n in the direction of the room closing, not by either model but by a\n construction.\n- **Where the counterexample lives.** The pairs (d₁, d₂) = (d′p*₁, d″p*₂)\n have q = d₁d₂ ≈ D^{16/9}·p*₁p*₂ ≈ z^{4.8}, inside yesterday's reduced\n range (z^{u₀−δ}, z^{2s}] and above the window: the reduced arrow of §4.3\n there is exactly where the certificate is negative.\n- **What is NOT claimed.** Nothing about G₂(z#) itself moves: a certificate\n failing at one window says nothing about the count of admissible r in\n that window (the measured G₂ exponent stays ~1.5). Nothing about the mean\n square moves (planted windows are a vanishing fraction of the W\n positions; I1 stands). The Gaussian ρ law measured TRUE at z ≤ 37\n (`rho-maximal-law.md` §4) is a finite-z fact in the regime where the\n chains are dormant (Ω(37, 3.0) = 21 against 2 sup|ρ̃| − M = 104.410, S3).\n\n### 4.4 The numbers behind §4.2\n\n**Exact, both s (S3).** Ω(z, 2.698721) = 1, 2, 3, 6, 10, 18, 22, 30, 45, 63,\n86, 111, 134, 168, 205, 251 at z = 13..73, log_z Ω from 0 to 1.2878; the\nsplit enumeration reproduces the walked min cc at z = 13..29 (five MATCH\nlines), λ⁺(P(z)) = 0 at every level (the D/8 slab is empty: max d/D ≤ 0.24\neverywhere, so the two-prime and four-prime chains cannot reach it at these\nz), and the maximisers are one band of middle primes with p* = 5 or 7\nagainst the top three to five primes. At s = 3.0, Ω = 1, 2, 3, 3, 3, 9, 21,\n36, 63, 100 at z = 13..47 and Ω − M ≤ 2 sup|ρ̃| holds at all seven cited\nlevels (`ok` at 13..37), the control that ties the enumeration to the\ncorpus's exact suprema. Against the consumer, Ω/HM reads 6.4e−5 to 3.8e−4\nat s = 3 and 2.1e−4 to 4.0e−4 at the cheapest s: three and a half orders\nshort of a failing window.\n\n**Hill-climb lower bounds (S4a).** Ω ≥ 6.840e2 at z = 89 rising to 2.108e6\nat z = 601, log_z from 1.4543 to 2.2757, against z^{u₀}: ratio 3.7e−6 to 6.8e−6, no trend.\nThe maximisers switch from band splits to interleaved splits at z ≥ 151\n(A₁, B₁, A₂ all in the hundreds by z = 601).\n\n**Certified sub-family (S4b).** With the primes above 47 split by index\nparity and the best p* ≤ 47 per side, exact counting of 2- and 4-chains\ngives Ω ≥ 9.000e4 at z = 601 (control: the family count 300 equals the\nexact λ⁺ of the same set, so no chain is double-counted) and 8.863e17 at\nz = 5e5, log_z 1.7828 → 3.1493. Four-prime chains take over from z = 2e4\n(1.56e5 of 2.29e5 at z = 2e4; all of it at 5e5, where the two-prime family\nis empty because p* is capped at 47). The deficit 16s/9 − log_z Ω falls\n3.0149 → 1.6485 across 601..5e5, and the bound tracks z^{16s/9}/ln⁸z at\n0.012 of it at z = 601 and 0.35 at z = 5e5, rising: consistent with the\nChebyshev-count derivation and its ln⁸ z, and not decisive for it.\n\n**Fits (S5).** ln Ω on ln z: 3.2825 ± 0.1205 on the exact points z = 29..73,\n4.1394 ± 0.0898 on the hill-climb points 89..601 (4.1033 ± 0.1272 on\n251..601), estimator returning 2.500000 on a synthetic z^{2.5}. The slopes\nrise with z, as the corpus records for every sup-type instrument here\n(`rho-exact-z31-01.md` §0), and the certified family is what the slope is\nrising toward. At s = 3.0 the exact slope over 29..47 is 6.7327 ± 0.5818 on\nsix points, above the cited sup|ρ̃| slope 2.766 ± 0.212 on 13..37: the\npointwise floor is growing faster than the sup it sits under, as it must if\nit is to become the sup.\n\n## 5. The arrow where it can be seen (deliverable d)\n\n**At the cheapest s, exact (S2).** s = 2.698721, H = ⌊z^{4.216450}⌋, full\nperiod, R_H walked directly (no factor 2):\n\n| z | H > W? | sup\\|R_H\\| | rms(R_H) | sup/rms | log_z(sup/rms) | allowance u₀/2 | log_z F |\n|---|---|---|---|---|---|---|---|\n| 13 | yes | 3.312 | 1.0567 | 3.134 | 0.4453 | 2.1082 | 2.5865 |\n| 17 | yes | 5.996 | 1.9121 | 3.136 | 0.4034 | 2.1082 | 2.4801 |\n| 19 | no | 9.649 | 2.4586 | 3.925 | 0.4644 | 2.1082 | 2.3114 |\n| 23 | no | 14.334 | 3.1119 | 4.606 | 0.4871 | 2.1082 | 2.2563 |\n| 29 | no | 27.971 | 5.8294 | 4.798 | 0.4657 | 2.1082 | 2.1679 |\n\nThe recovery the arrow asks for is z^{2.1082}; the measured recovery is\nz^{0.40–0.49}, and min_x T runs 2517 → 41384 against HM 2520 → 41411: every\nwindow certifies, by a margin F = (HM−1)/sup of z^{2.59} falling to z^{2.17}.\nThe z = 13, 17 rows have H > W and are calibration only.\n\n**At s = 3.0, cited (S1).** need − ms = 0.9200 → 1.0765 over z = 13..47\n(the rms-currency ask at these z, smaller than the asymptotic 2.1082 because\nM and the polylogs bite), truth log_z(2 sup|ρ̃|) = 0.6458 → 1.2874 over\nz = 13..37, log_z F = 2.4457 → 1.9394. No exact sup exists at z = 41, 43,\n47 (only ⟨ρ̃²⟩; `rho-exact-z31-01.md` §0 prices those walks at 37× to\n65,232× the z = 37 cost), so the brief's \"z = 13..47\" is 13..37 for the\nsup and 13..47 for the rms. Margins fall with z at both s, by about 0.42 of\nexponent from 13 to 29 at the cheapest s and 0.51 from 13 to 37 at s = 3,\nthe same drift as yesterday's table.\n\n## 6. Proof gap or truth gap, and the falsifiers\n\n**Proof gap at every computable z; truth gap in the limit, on §4.2.** The\ntwo are not in tension: the exact Ω at z ≤ 73 is three and a half orders\nunder HM, the certified bound at z = 5e5 is six orders under z^{u₀}, and the\nstatement REC makes is about all z ≥ z₀, where the construction wins by a\npower of z once the deficit 16s/9 − log_z Ω (1.65 at z = 5e5, falling)\ndrops below 16s/9 − u₀ = 0.5812. What would settle it, and whether it ran:\n\n- **(E2) wrong: a divisor n of P(z) with λ⁺(n) < 0 or λ⁻(n) > 0.** RUN\n exhaustively over all 2^{π(z)} divisors at z = 13..73 (cheapest s) and\n 13..47 (s = 3): zero violations. A failure at larger z would break §4.1\n and the standard theory of the Rosser sieve with it.\n- **(E4) wrong: a window containing r with T > cc(r) + H − 1.** Cannot\n happen while Brüdern–Fouvry's pointwise inequality holds; checked\n implicitly by the S2 walks (min T ≥ Ω-consistent at five levels).\n- **The split enumeration wrong.** RUN: it reproduces the walked min cc at\n z = 13..29 and respects Ω − M ≤ 2 sup|ρ̃| at the seven cited exact levels;\n the certified family at z = 601 equals the exact λ⁺ of its own set.\n- **§4.2 wrong: the 4-chain count in the top slab not ≫ D^{8/9}/ln⁴D.** NOT\n proven here beyond the written argument; the certified counts rise from\n 0.012 to 0.35 of z^{16s/9}/ln⁸z over 601..5e5 (S4b), consistent and not\n decisive. An adversarial re-derivation of the dyadic-range construction\n (the p* > 4D^{1/27} exit, the two prefix conditions, the parity split) is\n the pass this note is HELD for. The claim needs only Chebyshev-type\n bounds on prime counts in dyadic ranges.\n- **A computable failing window.** Would need Ω(z) > z^{u₀}: out of reach at\n any z this producer or the box can hold (the deficit must fall by another\n 1.07 exponents from z = 5e5). NOT RUN and not runnable; this is why the\n verdict is asymptotic.\n- **Against the item's own instruments.** th(nP) measured 1.5963 → 1.8569 at\n z = 13..31 and ≥ 2.0106 at 47 (`rho-maximal-law.md` §2 rider 2) is\n consistent: nP > Ω ≥ 100 at z = 47, s = 3 (S3), far below the measured\n floor z^{2.0106} = 2.3e3, so the floor is not yet set by the chains.\n\n## 7. Readings\n\n1. **STATED (deliverable a).** REC(1+√e+η, β₂−η): cap-currency ask\n z^{1.030992 + 3η}, rms-currency ask z^{2.1332 − η/2}, exponent bought η;\n M ln²z measured 0.3332 → 0.2715 at z = 13..47 there (S0, S2, S3). The\n brief's z^{1.031} verifies.\n2. **PARTIAL (deliverable b).** None of the five routes closes at the\n smaller demand: the cap supplies zero saving at any demand, the union\n route needs a moment of order z/(2.1332 ln z), a factor 1.42 smaller than\n at u₀ = 3 and still divergent, the rest are unchanged. The failing step is\n yesterday's reduced arrow, verbatim.\n3. **ZERO (deliverable c).** A mixed mean-square-plus-cap strategy delivers\n the cap on the large moduli, z^{2s − o(1)}, at every split point: with no\n moment above the second the mean square adds nothing at one position.\n4. **PROVEN, small, and machine-checked.** cc(r) at a doubly non-rough\n point is minus a sum of three products of exit-chain counts, every\n window containing r has T ≤ cc(r) + H − 1, and so nP > Ω, F1 fails below\n Ω, and sup|ρ̃| ≥ (Ω − M)/2; Ω exact at z ≤ 73 (251 at 73, cheapest s) and\n z ≤ 47 (100 at 47, s = 3), controls all pass (S3).\n5. **DERIVED, HELD (deliverable e).** Ω(z, s) ≫ z^{16s/9}/ln⁸z by a dyadic\n four-prime construction, and z^{2s − o(1)} in the limit; then REC is\n false for every u₀ < 16s/9 (4.7088 at s ↓ 1+√e), the cheapest point and\n the whole band with it, RML(α) is false at every α < β₂, and rider 2's\n band is asymptotically empty. Certified lower bounds reach 8.863e17 at\n z = 5e5 (log_z 3.1493), 0.35 of the model and rising (S4b).\n6. **MEASURED: proof gap at every computable z.** Ω/HM ≤ 4.0e−4 at z ≤ 73,\n Ω/z^{u₀} ≤ 8.3e−7 certified at z = 5e5; sup/rms at the cheapest s reads\n z^{0.40–0.49} against an allowance z^{2.1082} at z = 13..29 (S2). The\n slopes of ln Ω rise with z: 3.28 ± 0.12 exact (29..73), 4.14 ± 0.09 on the\n hill-climb range (S5).\n7. **UNCHANGED.** No exponent moved; RML(α) stays OPEN as a question until\n the adversarial pass on §4.2 runs, at which point the item's named target\n is REFUTED rather than open.\n\n## 8. Not reached, and corrections to the record\n\nNot reached: an exact Ω past z = 73 (3^{π(z)} splits; z = 79 is 3× the\nz = 73 cost and z = 89 27×); six-prime chains in the certified family (they\ncarry the 2s − o(1) limit and are empty below z ≈ 1e5 at this s); the\nexact sup|R_H| at s near 1+√e beyond z = 29; a literature citation for the\npointwise size of Rosser weights at smooth integers (standard, not searched\nunder `SEARCH-CONVENTIONS.md`); the s-dependence of Ω beyond the two values\nrun; any re-pricing of the u₀ = 3 and u₀ = 4 forms, which §4.3 covers\nwithout new numbers.\n\nCorrections to the record (proposed, no live file edited):\n\n- Brief, deliverable (d): \"z = 13..47 where the data exist\" — the exact\n sup|ρ̃| exists at z = 13..37 only; 41..47 carry ⟨ρ̃²⟩ alone\n (`rho-exact-z31-01.md` §0, §4.6).\n- Brief, deliverable (b): \"the position-union route, whose price e^{θ(z)/q}\n may or may not beat z^{1.031}\" compares a rms-currency price with a\n cap-currency ask; the union route's ask is z^{u₀/2}, largest at the\n cheapest point (§2 item 2).\n- `attack-0829n-rml-proof.md` §5 and reading 6, \"proof gap, not truth gap\":\n correct at every computable z, and to be read with §4 here for the limit.\n- `rho-maximal-law.md` reading 6, \"two models, neither called\": §4.3 calls\n the room closing, conditional on §4.2 surviving its pass.\n- `REFUTED.md`: a candidate row, HELD until the pass: \"REC(s, u₀), F1, F2 and\n RML(α) below 16s/9 on the Rosser vector-sieve lattice — REFUTED (planted\n exit-chain window: cc(r) = −(A₁A₂ + A₁B₂ + B₁A₂), T ≤ cc(r) + H − 1,\n Ω ≥ z^{16s/9 − o(1)})\".\n\n*Gate: `node research/qc.js --full` result recorded in the closing report;\nthe producer's tail verifies under `qc/embed.js --check`.*\n"},"research/history/staging/attack-0830-record-mechanism.md":{"lf_sha256":"bc0ae810afdc8ab2eeefdabcf42dd0e5c1e05b5ffcd43a4ae36fd7633f49a432","content":"# A mechanism attack on the residual of Kourbatov's b: sub-Poisson dispersion, the tile's gap law, and Kourbatov's own k = 1 heuristic, each pre-registered and scored\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-records.md`).** An\n> independent 30-wheel sieve to 1e11 returns this note's seven decade counts\n> to the unit and its CV² and far-tail slopes to four decimals, and those\n> counts match the published π₂(10^k) — an external check neither corpus had\n> run. The record null rebuilt with a different generator gives d b_z =\n> 1.0375 / 1.0818 against this note's 1.0370 / 1.0806. Two corrections: the\n> ±0.0014 is Monte-Carlo error ONLY, and a ±0.02 shift in the far-tail slope\n> moves d b_z from 0.9888 to 1.1720, so the systematic dwarfs the quoted\n> interval; and the note's kill rule could not fire, the flagship band's\n> floor 0.5 exceeding the kill threshold 0.4343. TODO Z5's title is supported\n> — the resolved range alone carries 72% of the residual.\n\n*(2026-08-30. Staging note, HELD; nothing here is integrated into a live\ndocument. Producer: `research/history/staging/attack-0830-record-mechanism.js`,\nto be formally embedded by `node research/qc/embed.js`. Custody: section 2 is\nwritten and saved to disk BEFORE the producer exists; disk order only, not a\nseal, the same weaker custody `measure-record-null2-0829.md` §1 discloses. No\ntwin data beyond `research/a113274-gap-records.js`, except that section 2d\nregisters a NEW sieve of twin primes to a stated height whose only purpose is a\ngap histogram at height; it is priced there. Calibration marked per claim.\nCategory (i) throughout, self-assigned as in `measure-record-null2-0829.md`:\n`attack-wrongdirection-audit.md` §5 records Z5 as not audited. Nothing below is\na statement about T, the tile's G2 exponent, or the Zone Postulate, and Z5 is\noff the exponent's critical path; every inequality used here is a statement\nabout a simulated record process and is labelled with its direction where it\nappears.)*\n\n## 0. What is still open, and what this note is\n\nRead before the numbers.\n\n- **The mechanism is now located, not derived.** [MEASURED on a model] The\n residual of `b` sits in the twin-prime gap law at height, which this note\n measures directly for the first time in the corpus (§3b) and which, fed\n into the record null with no parameter, reproduces the data's `b_z` to\n 0.3 to 4 per cent of the residual (§3c). Why twin gaps at height are\n under-dispersed with a tail 6 per cent steeper than exponential is a\n question about the correlation structure of twin primes that nothing in\n either corpus derives. The item's coordinate moves from \"records sit low\n and nothing carries it\" to \"the gap law at height carries it and nothing\n derives the gap law\".\n- **The transport is height-stationary in `abar` units, and the law is not\n stationary.** `CV^2` rises from 0.7276 at `[1e4, 1e5)` to 0.9295 at\n `[1e10, 1e11)` (§3b), so the law measured at one decade and applied at all\n 72 record heights is a hypothesis. Its visible cost is the height profile:\n the transported law predicts `b_z` rising to 1.90 to 1.98 in the top band\n where the data read 0.937 on 17 records (§3d). Not resolved here.\n- **The far tail in the record regime is extrapolated.** The measured law is\n resolved to `u = 12.85` (tail count 30) and records sit at `u` of 15 to 35,\n so the load-bearing assumption is that the `[4, 12]` log-slope of 1.0649\n continues. A sieve to 1e12 would push the resolved range to about `u = 19`\n and is priced in §7.\n- **Kourbatov-Wolf's second-order scale is a fit that tracks, not a\n derivation.** `CV^2 = a_c(x)/abar(x)` matches the measured `CV^2` to within\n 0.04 at all seven decades with no parameter (§3b), and as a gap law it\n carries 115 per cent of the residual (§3c), slightly over. HEURISTIC.\n- **Two of the brief's three candidates overshoot by 4 to 7x and are closed\n as posed** (§3c): the tile's period-wide law and the `k = 1` bin-count\n heuristic. The brief's claim that the sub-Poisson effect is \"computable\n from the measured Var/E\" is false as stated: the same `CV^2` gives 0.62 or\n 1.06 depending on the family (§6).\n- **The whole family is a comparison against a conjectural null**, unchanged\n from all three predecessors, and category (i) throughout.\n\n## 1. b, defined exactly, and the in-house values (deliverable a)\n\n[VERIFIED by citation; the producer gates on reproducing every figure here]\n\nKourbatov's definition, JIS 16 (2013) 13.5.2 eq. (1), page-verified in\n`lit-kourbatov-shortfall.md` §7 and re-read from the arXiv v3 text this\nsession (sha256 `08c584de...`, matching that note's §2 table): the estimator\n`E_1(G_k(p)) = max(a, a log(p/a) - ba)` with `a = C_k log^k p`, `C_2 = 0.75739`\n(his reciprocal Hardy-Littlewood constant; the repo's `1/(2C2)`). So `b` is the\nnumber of average gaps by which the record gap sits below the EVT trend\n`a log(p/a)`. In the repo's variables, with `abar(x) = ln^2 x/(2C2)`,\n`T(x) = abar(x) ln(x/abar(x))` and `z_k = (g_k - T(e_k))/abar(e_k)` at each\nrecord's end `e_k = s_k + g_k + 2`:\n\n- `b_z = -mean_k z_k` over the window `e in [1e4, 7.05e16]`, `n = 72`: this is\n Kourbatov's mean-unbiased `b`;\n- `b_med = -median_k z_k`, his median-unbiased `b` (2013 §5.1 footnote 5);\n- `b_A = (1 - A)/mean_k(1/L_k)` with `A = mean_k g_k/T(e_k)` and\n `L_k = ln(e_k/abar(e_k))`, the repo's trend-load summary, which\n `measure-record-null2-0829.md` §1b proves is the `1/L`-weighted mean of the\n same `-z_k` and therefore a poor estimator of a constant `b`.\n\nThe in-house values are cited from the embedded block of\n`research/measure-record-null2-0829.js` (S1, S5, S6; file lines 690-706 and\n738-786): `b_A = 1.1251`, `b_z = 1.2981`, `b_med = 1.3159`,\n`mean_k(1/L_k) = 0.06269`, `b_med = 1.2597` at Kourbatov's own cut `e < 1e15`\non `n = 71`, and the published null's own `b_z = 0.2147 +- 0.2350` (ensemble\nsd; standard error 0.0053). The producer reproduces all of these digit for\ndigit before it runs anything new, including the null at the same seeds; the\nreproduction is printed in its S1.\n\n**The residual this note attacks.** [cited] After the fullest null of the\npredecessor (C12, both nulls), the residual is 0.8367 (A), 0.9732 (z), 0.7824\n(median), at 3.16 to 4.19 ensemble sd. After the published null alone it is\n`1.2981 - 0.2147 = 1.0834` in the z normalisation, which is the baseline every\ndelta below is measured against, because each candidate below replaces the\ngap law and is run against the same N0e baseline on common random numbers.\n\n## 2. Pre-registration: three candidates, each a model with a derived d b, written before the producer exists\n\n*(Saved to disk before `attack-0830-record-mechanism.js` was created. Every\nband below is a declared band, not a measurement; the producer prints the\nformula evaluations and the ensemble readings, and section 3 scores them.)*\n\n### 2a. The transport, common to all candidates, and its direction\n\nThe null draws gaps at height `x` from a law with mean `abar(x)` and measures\nrecords at their end. Replacing the exponential by a law with survival\n`S(u)`, `u = g/abar`, changes the record at `n = e^L` gaps to the `u*` with\n`S(u*) = e^{-L}`, so the shift is `d z = u*(L) - L` and `d b = -d z`, averaged\nover the null's own record heights. Direction, stated once: a law whose tail\nis LIGHTER than `e^{-u}` at the relevant `u` has `u* < L`, records fall,\n`d b > 0`, and the null moves TOWARD the data. A candidate with `d b` larger\nthan the residual has overshot and is closed as posed, not counted as a hit.\nThe residual is the target: `1.08` on the z route against N0e (section 1).\nEvery ensemble is 2,000 replicates on the predecessor's two seeded streams\n(`0x7E5100 + r`, `0x9B1000 + r`), exact regime below `1e7`, block regime\nabove, so every delta is PAIRED against N0e exactly as in\n`measure-record-null2-0829.md` §3a.\n\n### 2b. Candidate (i): sub-Poisson dispersion\n\n**The derivation.** A body dispersion `CV^2 = Var(g)/E(g)^2 < 1` constrains\nthe far tail only inside a parametric family, so the transport is\nfamily-dependent and two families are run to bracket it.\n\n- Gamma family, `Gamma(alpha, s)` with `alpha s = abar`, `alpha = 1/CV^2`.\n Its survival is `Q(alpha, u alpha) ~ (u alpha)^{alpha-1} e^{-u alpha}/Gamma(alpha)`,\n so `u* alpha = L + (alpha-1) ln(u* alpha) - ln Gamma(alpha)` and\n `d b = (1 - CV^2) L - CV^2 [(alpha - 1) ln L - ln Gamma(alpha)]` to first\n order, growing linearly in `L`.\n- Shifted-exponential family, `g = delta + Exp(abar - delta)`,\n `delta = abar(1 - CV)`: `u* = (1 - CV) + CV L`, `d b = (1 - CV)(L - 1)`.\n\n**Which CV^2.** The brief names \"Var/E below 1 on the tile\". The tile's own\nnumber is `gap-spectrum-01.md` §3a: `sd/mean = 0.7270` at @31, i.e.\n`CV^2 = 0.5285`, over the WHOLE period at mean gap 32.2, which is not the\nheight object. The height object's dispersion is in the corpus under another\nname: `zone-tail-02-0829.md`'s renewal comparator `R = E[g^2]/(2E[g])` over the\nmeasured twin-gap process at the top band reads `R_shell = 434.31` against a\nmean tail of `447.26 = 0.9931 abar` (that note's tables at lines 310 and\n375), so `R/abar = 0.9643` and, since `R/abar = (1 + CV^2)/2` for a renewal\nlaw with mean `abar`, `CV^2 = 0.93` at heights near 1e11 [ARITHMETIC on cited\nfigures; the local `E[g]` is not printed there, so this carries a few per cent\nof slack, band `[0.88, 0.98]`]. A second reading, the tail field itself\nagainst the exponential, `0.9931 = (1 + CV^2)/2`, gives `CV^2 = 0.986`\n(bootstrap `[0.957, 1.015]` from `c_local in [0.7410, 0.7630]`).\n\n**Predictions, z route, paired against N0e, over the null's record heights\n(mean `L` about 17).**\n\n| model | CV^2 | predicted d b_z | band | reading if inside band |\n|---|---|---|---|---|\n| gamma, tile period-wide | 0.5285 | about 6 | `[4, 10]` | OVERSHOOT by 4 to 10x: the tile's period-wide law is not the height law; closed as posed |\n| gamma, height (R route) | 0.93 | about 1.0 | `[0.6, 1.4]` | the right order for the residual, family-dependent |\n| shifted exp, height (R route) | 0.93 | about 0.6 | `[0.4, 0.8]` | the lower end of the family bracket |\n| gamma, height (tail-field route) | 0.986 | about 0.2 | `[0.05, 0.35]` | a fifth of the residual |\n| gamma, `CV^2(x) = a_c(x)/abar(x)` (section 2e) | 0.76 to 0.95 across the window | about 1.2 | `[0.9, 1.6]` | lands on the residual with no free parameter, no derivation |\n\n**Falsifier for the sub-Poisson story as a whole:** the direct height\nhistogram of section 2d shows a far-tail log-slope in `u` of `-1.02` or\nshallower over `u in [4, 12]` while `CV^2 < 0.95`; then the dispersion sits\nin the body and cannot move the records, and (i) is closed at height too.\n\n### 2c. Candidate (ii): the tile's exact gap law replacing the exponential\n\n**The law.** `gap-spectrum-01.js`'s embedded @31 tail table (file lines\n815-831; 15 points, `u = t/mbar` from 0.5 to 12, `D = 6,226,553,025`),\nrescaled to mean `abar(x)` at height, log-linear in `-ln S(u)` between\npoints, and beyond `u = 10` extrapolated with that table's last-decade slope\n`-1.9126` (file line 895); a second variant hard-caps the law at the tile's\nown `max/mean = 10.804`.\n\n**The derivation.** From the table, `-ln S(u)` reads about 7.3 at `u = 5`,\n10.1 at 6, 12.6 at 7, 14.9 at 8, 17.2 at 9, 18.9 at 10. A record needs\n`-ln S(u*) = L`, so `u* = 7.2` at `L = 13` where the exponential has 13, and\n`u* = 11` at `L = 21`. **Predicted `d b_z` about 6, band `[4, 10]`, and\nlarger under the hard cap.** That is an overshoot by 4 to 10x, so the\nreading registered in advance is: the tile's period-wide gap law is far\nlighter than the twin-prime gap law at height; the data's own records reach\n`g/abar = 18.6` at 1e8 and `34.7` at the top of the ladder\n(`4770/257`, `35640/1028`, cited arithmetic on the ladder), where the tile at\n6.2e9 gaps never exceeds 10.8 means. Candidate (ii) is expected to close\nbefore it runs, and it runs so that the size is a measurement.\n\n### 2d. Candidate (ii'), the corrected object: the twin-prime gap law AT HEIGHT, measured by a new sieve\n\nNo histogram of twin-prime gaps at height exists in the corpus (checked:\n`gap-spectrum-01`, `measure-tail-deficit-0829`, `operator-and-pair-count` are\nall tile objects; `zone-tail-02` carries only `R`). **Price:** a segmented\nsieve to `X_s = 1e10`, twin gaps lesser-to-lesser, each gap normalised by\n`abar` at its own start, histogrammed in `u` at width 0.05 per decade of\nheight; estimated 5 to 20 minutes single-thread, under the 4-hour rule.\nCustody: the pair count per decade is checked against `2C2 Li_2` and the\nper-decade maximum against the adopted ladder before any reading.\n\n**Predicted [registered]:** top decade `[1e9, 1e10)`: `CV^2 in [0.88, 0.98]`;\nfar-tail OLS slope of `ln S(u)` against `u` over `u in [4, 12]` in\n`[-1.15, -1.00]`; the ratio `S(u)/e^{-u}` monotone decreasing above `u = 2`.\nThen that decade's `S(u)` (extrapolated beyond its last resolvable `u` by its\nown far-tail slope) replaces the exponential in the record null: **predicted\n`d b_z` in `[0.5, 1.5]`, point 1.0.** If it lands inside and the shape checks\nhold, the honest label is MEASURED-on-a-model with the height-stationarity\nof `S(u)` in `abar` units as the unproven hypothesis.\n\n### 2e. Candidate (iii): Kourbatov's own mechanism, transported\n\n**What the source says.** Kourbatov-Wolf, Mathematics 7 (2019) 400 §2.3.2,\neqs (22)-(33), read from the arXiv text this session (sha256 `7d69b356...`,\nbyte-identical to the corpus's record): for `k = 1` only, \"primes conspire\ntogether\", each prime lowering the maximal gap by about `p^{-1} log x`,\n`sum 1/p ~ log log x`. Mechanism: the gap histogram\n`tau(d, x) ~ P(d) B(x) e^{-d A(x)}` with `A, B` fixed by the count (24) and\nthe total length (25), giving `A = pi/x`, `B = c pi^2/(sx)` (29), and the\nmaximal gap read off as the `d` where `tau(d, x) = 1` (31), so\n`G ~ (x/pi)(log(pi^2/x) + log c)` (32). Two ingredients, separable:\n\n- (iii-S) the histogram's scale is the AVERAGE gap below `x`, `x/pi`, the\n lower-trend `a_c` of their Definition 2, which by their eq (10) sits\n `k/log x` below the local `abar`; this is the only Hardy-Littlewood\n second-order term in the source;\n- (iii-B) the bin-count criterion `tau = 1`, which sits `a log(a/c)` below\n the EVT maximum `a log n` of an exponential sample, because it asks where\n the histogram bin of width `c` holds one gap rather than where the number\n of gaps above `d` is one.\n\nFor `k >= 2` the source says the EVT formulas \"work well\" and fits `b`\nempirically; it offers no mechanism at `k = 2`.\n\n**Predictions.** (iii-B) transported to `k = 2` with `c = 6`:\n`d b = mean_k ln(abar_k/6)`, about 2.4 at 1e4 rising to 5.1 at 1e16,\n**mean about 4.2, band `[3.5, 5.5]`**: overshoot by 3 to 5x, closed as\nposed, and the data's band profile of `b` (`lit-kourbatov-shortfall.md` §5:\n0.713, 1.816, 1.620, 0.937) does not rise by 2.7 across the window.\n(iii-S) as a trend swap, `T_c` for `T-bar_c`: not a mechanism, because the\nresidual is data minus a simulated null under the SAME trend and is\ninvariant up to a composition term `mean_null(Delta/abar) - mean_data(Delta/abar)`,\n**predicted `|composition| < 0.10`**. (iii-S) as a gap-law statement, mean\n`abar` (forced by the pair count, calibrated to 3e-5) with tail scale\n`a_c(x)`: this is the last row of 2b's table, `CV^2(x) = a_c/abar`,\n`d b = mean_k eps_k (L_k - ln L_k - gamma)` with `eps = 1 - a_c/abar`,\n**about 1.2, band `[0.9, 1.6]`**.\n\n### 2f. Deliverable (d), the shape statistic, and the kill rule\n\n`D = mean(z) - median(z)` reads 0.0179 in the data against 0.2108 +- 0.1179\nin N0 (cited). Under a gamma law the record's `z` is compressed by `CV^2`\nwith its skew unchanged, so **predicted `D` about `0.21 CV^2`, i.e. 0.19 to\n0.20 for the height candidates and no candidate below 0.10**, except possibly\nthe truncated tile law, for which no prediction is made. Kill rule, fixed:\nif the candidates with a derivation together leave more than half of `b`\nunexplained, the item's coordinate is \"b has no mechanism in any model this\ncorpus can build\". A candidate counts toward the explained fraction only if\nits `d b` lands inside its band AND it does not overshoot the residual.\n\n## 3. Results\n\n*(Producer embedded 2026-08-30: code-sha256 `b6119e50...`, out-sha256\n`72394a91...`, 120 body lines, two hashed inputs (`a113274-gap-records.js`,\n`gap-spectrum-01.js`). Disclosure: a smoke test at 1e9 and 40 replicates ran\nbefore the embedded run; §2 was saved before the producer existed and was not\nedited after either run. The sieve ran to 1e11, above the registered 1e10,\nbecause the timing test showed it affordable; the registered predictions are\nscored on the registered decade `[1e9, 1e10)` and `[1e10, 1e11)` is reported\nas an extension.)*\n\n### 3a. Custody [VERIFIED, 12/12 and 7/7]\n\nS1 reproduces, digit for digit and at the predecessor's seeds, the data's\n`b_A = 1.1251`, `b_z = 1.2981`, `b_med = 1.3159`, `mean(1/L) = 0.06269`,\n`b_med = 1.2597` at the `e < 1e15` cut on `n = 71`, and the N0e null's\n`0.1639 / 0.2147 / 0.4255` with ensemble sd 0.235 and `N = 68.4`, through the\ngeneralised law `U(v) = v`; the baseline residual is 1.0833. S3's sieve\nmatches the adopted ladder's running maximum at all seven decade ends\n(630, 1452, 1722, 2868, 4770, 6030, 8040) and its pair counts sit at\n0.98502 to 1.00604 of `2C2 Li_2` per decade, 1.00003 at the top. S2's trend\narithmetic reproduces `lit-kourbatov-shortfall.md` §5's scratchpad-grade\n`mean T_c/T-bar = 0.9114`, `mean (T-bar - T_c)/abar = 1.483` and \"32 of 72\nbelow `T_c`\", which puts those three figures inside output custody.\n\n### 3b. The twin-prime gap law at height [MEASURED, sieve to 1e11]\n\n| decade of `p` | gaps | mean `u` | `CV^2` | `a_c/abar` (ansatz) | `1 - 6/abar` (lattice) | slope `[4,12]` | `u_last` |\n|---|---|---|---|---|---|---|---|\n| `[1e4, 1e5)` | 1,019 | 1.0170 | 0.7276 | 0.7674 | 0.9262 | n/a | 3.10 |\n| `[1e5, 1e6)` | 6,945 | 1.0077 | 0.8091 | 0.8207 | 0.9506 | 1.0829 | 4.85 |\n| `[1e6, 1e7)` | 50,811 | 0.9940 | 0.8381 | 0.8531 | 0.9646 | 1.1834 | 6.55 |\n| `[1e7, 1e8)` | 381,332 | 1.0007 | 0.8852 | 0.8750 | 0.9734 | 1.0935 | 8.95 |\n| `[1e8, 1e9)` | 2,984,194 | 1.0002 | 0.9037 | 0.8910 | 0.9793 | 1.0661 | 10.70 |\n| `[1e9, 1e10)` | 23,988,173 | 0.9999 | 0.9173 | 0.9033 | 0.9834 | 1.0649 | 12.85 |\n| `[1e10, 1e11)` | 196,963,368 | 1.0000 | 0.9295 | 0.9131 | 0.9864 | 1.0638 | 14.70 |\n\nRegistered checks on `[1e9, 1e10)`: `CV^2 = 0.9173` in `[0.88, 0.98]` HIT;\nfar-tail slope 1.0649 in `[1.00, 1.15]` HIT; `S(u)/e^{-u}` monotone\ndecreasing above `u = 2` HIT (1.01429 at 1, then 0.96541, 0.91437, 0.85749,\n0.80306, 0.74733, 0.69657, 0.65887, 0.59215, 0.57297, 0.56160, 0.49529 at\n`u = 2..12`, resolved to tail counts of 73 at `u = 12`). The falsifier for the\nsub-Poisson story (slope at or above `-1.02` with `CV^2 < 0.95`) did not fire.\n\nThree readings, caveat first. (1) The law is not height-stationary: `CV^2`\nrises monotonically through the seven decades and is still rising at the top,\nand the `[4, 12]` slope falls from 1.18 to 1.06; whether `CV^2 -> 1` is not\nsettled by this range. (2) The `CV^2 = 0.93` this note read from\n`zone-tail-02-0829.md`'s `R` before the sieve (§2b) is confirmed by the direct\nmeasurement at `[1e10, 1e11)`, 0.9295. (3) Kourbatov-Wolf's second-order\nscale `a_c/abar` tracks the measured `CV^2` at every decade: measured minus\nansatz reads `-0.040, -0.012, -0.015, +0.010, +0.013, +0.014, +0.016`\n[ARITHMETIC on the table], with the 6Z lattice's geometric `CV^2` accounting\nfor only 0.01 to 0.07 of the shortfall from 1. That is a zero-parameter\nagreement of a heuristic with a measurement, HEURISTIC, and it says nothing\nabout why. The top decade's slope 1.0638 against `1/CV^2 = 1.076`\n[ARITHMETIC] says the far tail is close to a gamma of that `CV^2`.\n\n### 3c. The candidates scored [MEASURED, 2,000 paired replicates; `d b_z` against N0e, s.e. 0.0003 to 0.0095]\n\n| candidate | registered `d b_z` | measured `d b_z` | share of the residual 1.0833 | verdict |\n|---|---|---|---|---|\n| (i) gamma, tile period-wide `CV^2 = 0.5285` | about 6, `[4, 10]` | 7.2268 | 667.1% | inside band, OVERSHOOT 6.7x: closed as posed |\n| (i) gamma, height `CV^2 = 0.93` | about 1.0, `[0.6, 1.4]` | 1.0573 | 97.6% | HIT, no overshoot (0.0261 left) |\n| (i) shifted exp, `CV^2 = 0.93` | about 0.6, `[0.4, 0.8]` | 0.6223 | 57.4% | HIT, the lower end of the family bracket |\n| (i) gamma, tail-field `CV^2 = 0.986` | about 0.2, `[0.05, 0.35]` | 0.2111 | 19.5% | HIT |\n| (i)/(iii-S) gamma, `CV^2(x) = a_c/abar` | about 1.2, `[0.9, 1.6]` | 1.2479 | 115.2% | inside band, overshoots the residual by 0.1646 (0.7 ensemble sd of a single `b_z`) |\n| (ii) tile @31 law, extrapolated | about 6, `[4, 10]` | 8.0960 | 747.3% | inside band, OVERSHOOT 7.5x: closed as posed |\n| (ii) tile @31 law, hard cap 10.804 | larger | 16.9085 | 1560.8% | pathological (`N = 1449.8` records per replicate): closed |\n| (ii') HEIGHT law `[1e9, 1e10)`, registered | `[0.5, 1.5]`, point 1.0 | 1.0370 | 95.7% | HIT, no overshoot (0.0464 left) |\n| (ii') HEIGHT2 law `[1e10, 1e11)`, extension | as above | 1.0806 | 99.8% | HIT, no overshoot (0.0027 left) |\n| (iii-B) KW bin-count at `k = 2`, `c = 6` | 4.2, `[3.5, 5.5]` | 4.2037 (arithmetic) | 388% | OVERSHOOT 3.9x: closed as posed |\n| (iii-S) trend swap `T_c` for `T-bar` | composition `< 0.10` | `-0.0190` | n/a | not a mechanism, as registered |\n\nEnsemble means of `b_z` for the two height laws are `1.2517 +- 0.2324` and\n`1.2954 +- 0.2336` against the data's 1.2981; the `b_A` and `b_med` routes\nland at `0.9718 / 0.9878` against 1.1251 and `1.4036 / 1.4407` against 1.3159,\ni.e. the height law reproduces the z-route exactly and the other two routes\nto within 0.15, which is the estimator-weighting spread `measure-record-null2-0829.md`\n§1b pinned. All eleven registered bands held; the two candidates registered\nas overshoots overshot, and the three registered to land landed. That every\nband held is a criticism of the bands' width, not evidence of anything.\n\n### 3d. The height profile, the open falsifier [MEASURED, 400 replicates per band, means only]\n\n| law | `[1e4, 1e8)` | `[1e8, 1e11)` | `[1e11, 1e14)` | `[1e14, 8e16)` |\n|---|---|---|---|---|\n| data (n = 16, 15, 24, 17) | 0.713 | 1.816 | 1.620 | 0.937 |\n| N0e | 0.081 | 0.162 | 0.194 | 0.252 |\n| gamma 0.93 | 0.519 | 1.048 | 1.496 | 1.969 |\n| shifted exp 0.93 | 0.366 | 0.694 | 0.950 | 1.229 |\n| gamma `a_c/abar` | 1.106 | 1.403 | 1.556 | 1.694 |\n| HEIGHT `[1e9, 1e10)` | 0.537 | 1.049 | 1.461 | 1.896 |\n| HEIGHT2 `[1e10, 1e11)` | 0.491 | 1.124 | 1.548 | 1.978 |\n\nEvery candidate predicts `b_z` rising with height, because under a fixed\nsub-exponential law the shortfall grows like `(1 - CV^2) L`; the data's top\nband falls to 0.937. No band sigma is printed by this producer (owed). Scaling\nthe printed 72-record ensemble sd of `b_z`, 0.2336, by `sqrt(72/17)` gives\nabout 0.48 for a 17-record band [ARITHMETIC, a rough guide only], so the top\nband sits about 2 sd below the stationary transport and about 1.6 below the\n`a_c/abar` law, and the `[1e8, 1e11)` band about 1.5 above. This is the\ndiscriminator between \"the height law carries `b`\" and \"it carries the low\nand middle bands only\", and 17 records cannot settle it; it is the same\nquestion `zonegap-03-model.md` §5 and both predecessors leave NOT REACHED.\n\n## 4. Attribution bracket (deliverable c)\n\n[MEASURED on models; the bracket is over which stated model is believed]\n\nOf `b_z(data) = 1.2981`:\n\n- 0.2147 is the published null's own level, calculus on the trend\n (predecessor, cited).\n- The 6Z lattice's `[-0.006, +0.111]` (predecessor, law-dependent) is NOT\n additive with the height law: real gaps are on 6Z, so the sieve's law\n already contains whatever the lattice does, and the geometric lattice\n `CV^2` column of §3b shows it is 0.01 to 0.07 of the shortfall from 1.\n- The height gap law carries `1.0370` to `1.0806` of the 1.0833 residual, as\n the measured law; `0.6223` to `1.0573` as a bare `CV^2 = 0.93` transported\n through two families; `1.2479` as Kourbatov-Wolf's `a_c/abar` ansatz.\n\nSo the fraction of `b` carried by a stated, checkable model runs from 64 per\ncent (`0.2147 + 0.6223` over 1.2981, the shifted-exponential transport of the\ndispersion alone) to 99.8 per cent (`0.2147 + 1.0806`, the measured law).\nWhat no model carries with a derivation is the gap law itself: the corpus can\nmeasure that twin gaps at height have `CV^2 = 0.93` and a far tail 6 per cent\nsteeper than exponential, and can note that `a_c/abar` predicts that `CV^2`\nto 0.04 with no parameter, but it cannot derive either. **The kill rule of §2f\ndoes not fire**: the candidates with a stated model leave 0.3 to 36 per cent\nof `b` unexplained depending on the model, not more than half. The item's\ncoordinate is therefore not \"b has no mechanism in any model this corpus can\nbuild\" but \"b is the finite-height gap law of twin primes, which this corpus\ncan measure to 1e11 and cannot derive; the top height band is the open\nfalsifier\".\n\n## 5. Shape (deliverable d)\n\n[MEASURED, 2,000 replicates] Data `D = 0.0179`, `sd(z) = 1.0213`,\n`skew(z) = 0.5446`.\n\n| law | `D`, mean +- sd | `z_D` | `sd(z)` | `skew(z)` |\n|---|---|---|---|---|\n| N0e | 0.2108 +- 0.1179 | -1.64 | 1.2487 +- 0.1771 | 1.0415 +- 0.5158 |\n| gamma 0.93 | 0.1469 +- 0.1302 | -0.99 | 1.2979 +- 0.1751 | 0.7743 +- 0.4714 |\n| gamma `a_c/abar` | 0.1647 +- 0.1107 | -1.33 | 1.1563 +- 0.1575 | 0.9350 +- 0.5040 |\n| HEIGHT `[1e9, 1e10)` | 0.1519 +- 0.1288 | -1.04 | 1.2877 +- 0.1749 | 0.8010 +- 0.4777 |\n| HEIGHT2 `[1e10, 1e11)` | 0.1453 +- 0.1317 | -0.97 | 1.3041 +- 0.1740 | 0.7664 +- 0.4685 |\n\nThe height candidates move `D` a third of the way toward the data and the\ncontrast from `-1.64` to about `-1.0` sigma; skew falls from 1.04 to about\n0.78 against the data's 0.54; `sd(z)` does not move. §2f's registered point\n(`D` about 0.19 to 0.20 under the height laws) MISSED by 0.05, inside the\nensemble sd; its floor (\"no candidate below 0.10\") held. The shape exposure\nof the predecessor's §8d is eased, not closed: with the height law as the\nnull the data's shape sits at 1 sigma, which is nothing.\n\n## 6. Brief errors recorded\n\n- The brief's \"(iii) a Cramér-model correction with the Hardy-Littlewood\n second-order term (Kourbatov's own conjectured source)\". Checked at the\n source, section 2e: Kourbatov-Wolf's only mechanism is stated for `k = 1`,\n its second-order ingredient is `a_c = x/pi` against `abar` (their eq (10)),\n and for `k >= 2` the source offers no mechanism. The brief's description is\n not what the source says at `k = 2`; the candidate is run in the two forms\n the source actually contains.\n- The brief's \"(ii) the exact gap-length distribution of the tile ... the\n tile's gap law is NOT exponential at finite level and its tail is lighter\n or heavier by a computable amount\". True of the tile, but the tile's\n period-wide law is not the object the record process samples; section 2c\n registers the expected overshoot and section 2d supplies the corrected\n object.\n- The brief's \"(i) ... a record process over a sub-Poisson point process has\n smaller extremes than the Poisson-matched one, and the size of that effect\n is computable from the measured Var/E\". The direction is right and the size\n is NOT computable from `Var/E`: at the same `CV^2 = 0.93` the gamma\n transport gives `d b_z = 1.0573` and the shifted-exponential transport\n 0.6223 (§3c), because a body dispersion fixes the far tail only inside a\n family. What is computable is the effect of the measured law, which is what\n §3c then does.\n- Every other number in the brief was verified at its record before use\n (`measure-record-null2-0829.js` embedded block; `lit-kourbatov-shortfall.md`\n §5; `record-location-null.md` §2), and none was found wrong.\n\n## 7. What would falsify this, and whether the check has run\n\n- **The height law's match is an artefact of the extrapolated tail.**\n PARTIALLY RUN. Records sit at `u` of 15 to 35; the law is resolved to\n `u = 12.85` (tail count 30) and extrapolated at the `[4, 12]` slope. The\n gamma of the same `CV^2` (a different extrapolation) lands within 0.02 of\n it, and the `[4, 12]` slope agrees with `1/CV^2` to 0.012, so the two\n descriptions of the tail agree where both are measured. Settling it needs\n the tail one or two decades deeper: a sieve to 1e12 (about 2 hours on this\n machine by the 1e11 timing, under the 4-hour rule, NOT RUN) resolves to\n about `u = 19`.\n- **The law is not height-stationary and the match is a coincidence of the\n window's mean height.** NOT SETTLED, and it is the live exposure. `CV^2`\n rises 0.7276 to 0.9295 over seven decades; the top band's data `b_z`\n (0.937) sits about 2 rough sd below every transported profile (§3d). The\n check that would settle it, records past 1e17, is unreachable; the cheaper\n check, per-band sigmas from the ensemble, is owed and is a 20-minute\n re-embed.\n- **The sieve law contains the data's own records, so the match is\n circular.** RUN, in the negative: the histogram's resolved range stops at\n `u = 12.85` in the registered decade while that decade's own record\n (6030 at `abar` near 330, `u` about 18 [ARITHMETIC]) lies beyond it, and 63\n of the 72 window records lie outside `[1e9, 1e11)` altogether. The match\n is out of sample in both `u` and height.\n- **The transported `CV^2` was read wrongly from `zone-tail-02-0829.md`.**\n RUN: the direct measurement at `[1e10, 1e11)` reads 0.9295 against the\n 0.93 read from that note's `R` (§2b). Consistent.\n- **The two overshooting candidates were mis-scaled.** RUN by construction:\n every law is mean-normalised (`mean u` is 0.9940 to 1.0170 raw and\n rescaled to 1 before use; the tile table is parsed from its embedded\n block). The overshoot is the tail, not the mean.\n- **The whole comparison is against a conjectural null.** Standing and\n unfalsifiable here, as in every predecessor.\n- **Someone has already measured the twin-gap law at height and its `b` in\n the owning convention.** NOT CHECKED beyond the four Kourbatov papers on\n disk; Wolf's 1990s preprints, which `lit-kourbatov-shortfall.md` §9 names\n as the standing hole, model exactly this histogram for `k = 1` and were\n not fetched. Nothing here is claimed as novel; the `a_c` scale is theirs.\n\n---\n\n*History layer: process record, staging. See `research/history/CHANGELOG.md`\nfor the corpus rule.*\n"},"research/history/staging/attack-0830-tail-derivation.md":{"lf_sha256":"055e8e4b4cff2509077b595828e21f576a312395f5f1860743e78c41b4d6857a","content":"# The tail's derivation: the ensemble half derives exactly, and the anchored coefficient is Hardy-Littlewood in disguise\n\n\n\nSTATUS: HELD, staging. Not integrated, not red-teamed. Producer\n`research/history/staging/attack-0830-tail-derivation.js`, embedded\n(`node research/qc/embed.js research/history/staging/attack-0830-tail-derivation.js`),\nverdict line `0 assertion failures`, levels x = 7, 11, 13, 17, 19, 23, 29.\nThis note edits nothing; the proposed TODO text is in §8, HOLD.\n\nLabel: **(i) throughout.** Every statement is either an identity about an exact\nperiodic object, an exact number at one level, or a distributional statement\nabout a measured field. No bound on any tail at any p is claimed. The tail is a\nslack field of R0 (`zonegap-02-reduction.md` §2, (R0), `:62`), it sits off the\nexponent's critical path, and nothing here touches Z2 or moves the wall.\n`attack-wrongdirection-audit.md:548` records Z4 as not audited; this note does\nnot audit it either. Inequality directions are stated where an inequality\nappears (§2a, §3); none is load-bearing for a bound because no bound is made.\n\n---\n\n## 0. What is still open, and what failed\n\n**The anchored coefficient does not derive, and the kill clause fires.** Every\nroute from the tile to the measured 0.7574-sized coefficient passes through two\ninputs: ρ(2) = e^{2γ}/4, the origin's survival density against the ensemble at\nu = 2, whose exact value is HL-conditional (`origin-excess.md:36`, `:433`) and\nwhose limit is the sharp form of Assumption A, \"algebraically equivalent to HL\non the 11/17 comb\" (`GLOSSARY.md:328-329`); and CV² → 1 for the zone's own\ntwin gaps, \"a Hardy-Littlewood statement for twin gaps\"\n(`head-residual-factor.md:166`). So the anchored coefficient is Hardy-Littlewood\nin disguise. Status PARTIAL with that as the coordinate; nothing beyond HL is\nderived on the tail, exactly as nothing beyond HL was derived on the head.\n\n**What derives, exactly and with no prime input, is the ensemble half.** The\ntail functional averaged over all p# translates has a one-line expectation,\nR + 5/2 over all integer origins and R + 3 over odd origins, R = Σg²/2W over\nthe tile's twin-slot gaps; it is asserted by direct summation at every level\nwith W ≤ 2²⁸ and its Mertens constant is e^{2γ}/(8 C₂) = 0.6007 [PROVEN]. What\ndoes NOT settle inside the ensemble is the tile's own gap-shape factor\n(1 + CV²)/2, which reads 0.6306 → 0.7532 over x = 7..29, rising at every step\nand nowhere near a plateau [MEASURED exact per level, limit OPEN].\n\n**The rough-origin candidate is not identified.** Its exact ensemble\ncounterpart, E_rc/E_cls (an origin coprime to p# and in the classes p'² occupies,\nagainst every integer in those classes), reads 1.0050 → 1.0523 over x = 7..29,\nrising; the record's anchored surplus is 1.0157 [1.0013, 1.0308] at sieve\nlevel 1e5 to 3.2e5. Same sign, wrong size, and a trend the record's three bands\n(1.0452, 1.0053, 1.0157, `zone-tail-02-0829.md:432`) do not show. The two sit\nfour orders of magnitude apart in p and cannot be compared at one level.\nHEURISTIC stays HEURISTIC.\n\n**One number derives that the record had measured and mis-explained.** The\nclass-null offset, classNull − R, is an exact ensemble quantity: E_cls − R =\n5.600, 5.709, 5.833, 5.913, 5.973, 6.008, 6.034 over x = 7..29, rising slowly.\nThe record measured 440.36 − 434.31 = 6.05 at the top band\n(`research/zone-tail-02.js:796`) and explained it once as 0.5 (the prereg, §1\n(P4)) and once as 7.5 (§3, `zone-tail-02-0829.md:407`); `redteam-0829-measure-b.md:153`\n(C17) flagged both. The ensemble's exact offset is the ground P4 lacked.\nCalibration: exact at x ≤ 29; its agreement with an anchored measurement at\nheights 1e10 to 1e11 is CONSISTENT WITH, one number at one band, not a\nderivation across the level gap.\n\n**A convention clarification, owed to two live files and stated here.**\n\"A discrete uniform integer origin sees R + 1/2 exactly\"\n(`head-residual-factor.md:70`; `research/zone-tail-02.js:799`) is the constant\nfor the convention a ≤ o. Under the tail's own convention, a + 2 < o strict\n(`zone-tail-01.md` §1, `:83-86`), the constants are 5/2 for all integer\norigins and 3 for odd origins [PROVEN, §2a; asserted numerically]. Re-read\nagainst the odd-origin constant the record's t/R_shell = 1.0298 becomes\nt/(R_shell + 3) = 1.0228; the class-null figure 1.0157 was computed in the\nstrict convention and is unaffected.\n\n**No error in the brief was found.** Every figure the brief carries (0.7522,\n[0.7410, 0.7630], 0.7574, 1.0619, 1.0298, [1.0156, 1.0443], 1.0157,\n[1.0013, 1.0308], the detrended r = −0.0009, 27,292 zones, the 0.03 per-step\nregistration) reproduces from `research/zone-tail-02.js`'s bound block or\n`zone-tail-02-0829.md`, and the producer parses the top-band rows from the\nbound block rather than typing them (SEC 1).\n\n---\n\n## 1. The object, pinned against the record\n\n**The tail as the record defines it.** A pair is named by its opener a; it is\nin zone p iff p < a and a + 2 < p'², both strict; a_last(p) is the largest such\nopener; tail(p) = p'² − a_last(p) (`zone-tail-01.md:80-86`;\n`research/zone-tail-02.js:41-44`). The top-band figures, parsed by the\nproducer from `research/zone-tail-02.js:766` and `:796-798` and printed in\nSEC 1: 17,700 zones, mean tail 447.26, c_local 0.7522 [0.7410, 0.7630],\nR_shell 434.31, t/R_shell 1.0298 [1.0156, 1.0443], classNull 440.36,\nt/classNull 1.0157 [1.0013, 1.0308]. The zone tails at p = 7, 11, 13, 17, 23\n(14, 20, 8, 14, 14) are parsed from `research/zonegap-02-reduction.js:409-413`\nand the max tail 80 at p = 29 from `research/zone-tail-02.js` SEC D; all six\nreproduce from the tile with no prime table (SEC 3, IDENTICAL).\n\n**The ensemble object.** T_x is the twin-slot tile, period W = x#, D =\n∏_{5≤q≤x}(q − 2) openers, gaps summing to W. For an integer origin o mod W,\n\n τ(o) = o − max{ a opener : a + 2 < o }.\n\nBy the Zone Restriction Lemma (`zonegap-02-reduction.md:27`, PROVEN) the\nin-zone twin slots of T_p are the in-zone twin primes, so tail(p) = τ(p'²)\nread on T_p at phase zero, exactly. The record's tail is one member of the\nensemble {τ(o) : o mod W}; the ensemble mean over all o is the object whose\nexpectation derives.\n\n---\n\n## 2. The ensemble derivation\n\n### 2a. The identities [PROVEN, one line each; asserted by direct summation at x ≤ 23]\n\nLet the openers be a₁ < … < a_D with gaps g_i = a_{i+1} − a_i (the last gap\nwraps). Origin o has last opener a_i iff a_i + 2 < o ≤ a_{i+1} + 2, so the\norigins served by gap i are the g_i integers a_i + 3, …, a_i + 2 + g_i, at\ndistances 3, …, g_i + 2. Hence\n\n E_all[τ] = Σ_i g_i(g_i + 5)/2 / W = Σg²/2W + 5/2 = R + 5/2,\n E_odd[τ] = Σ_i g_i(g_i + 6)/4 / (W/2) = R + 3,\n\nusing Σg_i = W and, for odd origins, that every a_i and every g_i is even-offset\nconsistent (a_i odd, g_i ≡ 0 mod 6 for x ≥ 5). Under the convention a ≤ o the\ndistances are 1, …, g_i and the constant is 1/2; that is the corpus's\n\"R + 1/2\". Direction of the only inequality in this section: E_odd > E_all >\nR, trivially, because the constants are positive; nothing rests on it.\n\nThe producer asserts both closed forms against the per-gap sums at every level\nand against a direct sum over every one of the W origins at x ≤ 23\n(`direct all-origin sum = closed form`, `direct origin count = W`), 0 failures.\nD = ∏(q − 2), holes = φ(W), rough origins = φ(W), square units = ∏(q − 1)/2 are\nasserted per level; D, mbar and G₂ are asserted against\n`research/gap-spectrum-01.js:601-637`.\n\n### 2b. The numbers, exact (producer SEC 2)\n\n| x | mbar | E[g²] | CV² | R | E_all = R + 5/2 | E_odd = R + 3 | (1 + CV²)/2 |\n|---|---|---|---|---|---|---|---|\n| 7 | 14.0000 | 247.200 | 0.2612 | 8.8286 | 11.3286 | 11.8286 | 0.6306 |\n| 11 | 17.1111 | 381.067 | 0.3015 | 11.1351 | 13.6351 | 14.1351 | 0.6508 |\n| 13 | 20.2222 | 553.721 | 0.3540 | 13.6909 | 16.1909 | 16.6909 | 0.6770 |\n| 17 | 22.9185 | 738.019 | 0.4051 | 16.1009 | 18.6009 | 19.1009 | 0.7025 |\n| 19 | 25.6148 | 950.646 | 0.4489 | 18.5566 | 21.0566 | 21.5566 | 0.7244 |\n| 23 | 28.0543 | 1165.953 | 0.4814 | 20.7803 | 23.2803 | 23.7803 | 0.7407 |\n| 29 | 30.1324 | 1367.674 | 0.5063 | 22.6944 | 25.1944 | 25.6944 | 0.7532 |\n\nReading: R/mbar = (1 + CV²)/2 rises 0.6306 → 0.7532 across seven levels with\nno sign of settling; the tile's gaps are far from exponential at every\ncomputable level, which is `gap-spectrum-01.md`'s \"uniformly steeper than\nexponential\" read at the second moment. Nothing here says where CV² goes.\n\n### 2c. The asymptotic form, and what in it is proven\n\nmbar = W/D = 2 ∏_{2 THE TAIL'S DERIVATION RAN 2026-08-30 (`attack-0830-tail-derivation.md`,\n> HELD; `Q-tail-derivation-0830` PARTIAL). The ensemble half derives exactly:\n> the tail functional averaged over all p# translates has expectation R + 5/2\n> (R + 3 over odd origins), R = Σg²/2W over the tile's gaps, asserted by\n> direct summation, with Mertens constant e^{2γ}/(8 C₂) = 0.6007 = HL × ρ(2);\n> the tile's own shape factor (1 + CV²)/2 reads 0.6306 → 0.7532 over x = 7..29\n> and does not settle. The anchored coefficient does not derive: every route to\n> 0.7574 passes through ρ(2) → e^{2γ}/4 (the sharp form of Assumption A, HL)\n> and CV²_zone → 1 (HL), so it is HL in disguise; the record's 0.7522 = HL ×\n> 0.9644 × 1.0298 is two non-HL-sized factors cancelling. The rough-origin\n> candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 → 1.0523,\n> right sign, wrong size and trend against the anchored 1.0157; not identified.\n> One number derives that the record measured: the class-null offset\n> E_cls − R = 6.034 at x = 29 against the measured 6.05, replacing P4's 0.5 and\n> 7.5. The corpus's \"R + 1/2\" is the a ≤ o convention; under the tail's own the\n> constants are 5/2 and 3.\n\nLedger line: add `Q-tail-derivation-0830`.\n"},"research/history/staging/attack-0830-varE-identification.md":{"lf_sha256":"c950983f8593aab33cd960e0b7d1f0385723d1b20a9de29e0cac74c918e39b3c","content":"# The identification step of lim Var/E, attacked: one open step and not two, its remainder re-split by branch type and modulus band, a mis-doubled group in the record, and the inequality that does not close relocated to friable integers in progressions\n\n\n\n*Staging note, 2026-08-30. TODO item 9, the \"prove either step\" move. Producer:\n`research/history/staging/attack-0830-varE-identification.js` (embedded by\n`node research/qc/embed.js`; PARTS A-G; no timing figure printed). Reads\n`varE-theta2-step.md` sections 4-5 for the six-level group columns and\n`variance-note.md` section 7 for the nine exact points; recomputes none of the\nnine `Var/E` readings. Every number below is from the producer's embedded\nblock or is cited to the artifact that carries it. Nothing here is on the\ncritical path and nothing here is TPC-strength (section 7).*\n\n## 0. Verdict, the part that did not move first\n\n**Neither step closes.** No proof of `delta*(X - X_dec) -> 0` is given, and the\none inequality this pass carries the attempt to (section 4) is stated with its\nquantifiers and left open. `lim Var/E = lambda_2(2) = 0.45546` stays HEURISTIC\non exactly the step it rested on before.\n\n**The brief's two open steps are one.** The brief asks for \"either of the two\nopen steps\": the identification half of `varE-spectral.md` and \"separately\" the\ntheta = 2 mean-coefficient step. They are the same statement. The\nidentification of the true variance with the model is Conjecture 1 of\n`paper/variance-note.md` section 10, `delta*(X - X_dec) -> 0`, and\n`varE-theta2-step.md` section 1 proves that `X - X_dec` is exactly the\nmean-coefficient replacement error written in real space. The record's SECOND\nopen step, the model's own limit theorem, is PROVEN (unreviewed) in\n`varE-limit-theorem.md` and is not \"in varE-spectral.md\" as the brief has it:\n`varE-spectral.md`'s ledger still says \"TWO open steps\" and has not been\nupdated to cite the sibling. Three more brief errors are logged in section 8.\n\n**One record defect, PROVEN by rebuild (section 2).** The `delta*X2` column of\n`varE-theta2-step.md` section 5, carried into `varE-theta2-proof.md` sections 3\nand 7 (\"measured `2X2 = 5.3`, flat near 5.3\") and `paper/variance-note.md`\nsection 10 (\"loose by a factor 14 to 48 against the measured `2X2 = 5.3`\"), is\nnot the shift group it names: the producer doubles the positive-`h` half of the\n`h = 2 (mod p)` pattern, and that pattern is the mirror image of the\n`h = -2 (mod p)` pattern, not an even function of `h`. The group sum is\n`2X2 = -0.56, 0.53, 0.27, 0.23, 0.18` at `x = 7..19` (PART F) against the\ncolumn's `|2X2| = 5.715, 5.628, 5.333, 5.352, 5.327` (`varE-theta2-proof.md` section 3, PART D). Since `X = X1 + 2X2 + Xmix` holds by\ndefinition, the corpus's `Xmix` absorbs the difference: `delta*Xmix` is\n`-0.034971, -0.046368, -0.025439, -0.020542, -0.016835` (this pass) against the\nrecord's `-0.241840, -0.133037, -0.076748, -0.053095, -0.038804`. The bound\n`|2X2| = O(ln y)` of `varE-theta2-proof.md` section 3 is unaffected, since it\nbounds the group and the group is smaller than the column. No live file is\nedited; the correction list is section 8.\n\n**Nothing here touches the conjecture.** `variance-note.md` section 4 records\nthat `Var/E` over a uniformly random window says nothing about the one anchored\nwindow the twin problem needs. Section 7 runs the wrong-direction test anyway.\n\nWith that said, what the pass produced:\n\n- **PROVEN, elementary, checked on 3000 random coprime triples (PART A).** The\n CRT class of a mixed lag with parts `(n0, n+, n-)` is the Kloosterman\n fraction `c/n = 2( inv(n0 n-, n+)/n+ - inv(n0 n+, n-)/n- ) mod 1`, and\n `c = 2 n0 v` with `v^2 = inv(n0)^2 (mod n+ n-)`. With `n- = 1` it is\n `2 inv(n0)/n+`, the phase of the additive divisor problem (section 3).\n- **PROVEN, checked on 2000 random `(L,n)` (PART B).** `sum_{c mod n} R_n(c) = 0`:\n the main term `L w/n` of every lag is the average of its count over the `n`\n classes, so the whole remainder `X` is a discrepancy of CRT classes against\n interval bumps, at every modulus, above and below `2L` alike.\n- **MEASURED, exact, five levels, reproducing the corpus `X` to `6.4e-8` relative or better\n (PART C).** `X` split by branch type (`c0`, pure shift, two-branch with the\n `0` branch, two-branch without it, three-branch) and by modulus band\n (`n <= 2L`, `2L..8L`, `8L..L ln^2 y`, above). The mixed remainder is\n `-1.06, -2.73, -2.51, -3.23, -3.94` at `x = 7..19`, i.e.\n `-0.41, -0.71, -0.49, -0.49, -0.49` times `ln y` (PART E): consistent with\n `O(ln y)` and settling near `-0.49 ln y` on the top three levels. Of it,\n `82 %` sits at `n <= 2L` at `x = 19` (`0.986, 0.916, 0.844, 0.826, 0.818`\n across the levels) and essentially all of it in the two-branch type carrying\n the `0` branch (`-3.94` of `-3.94`; the other two types read `-0.003` and\n `-0.0002`).\n- **PROVEN, checked at `x = 7, 11` to `4.2e-17` (PART D).** Above `2L` the mixed\n count equals the mass of the root measure inside the window bump,\n `sum w (L - ||c'||_{30n})^+/L`, summed over 16,763,694 (modulus, pattern)\n pairs at `x = 11`.\n- **MEASURED, exact (PART G).** The dominant cell (two-branch with the `0`\n branch, `n <= 2L`) split by balance: the pairs with `min(d, e) <= L^(2/5)`\n carry `95.7, 93.2, 94.4, 98.7, 99.7 %` of the cell's remainder at\n `x = 7..19`; the balanced pairs' remainder reads `-0.0087` at `x = 19`. The\n obstruction is unbalanced, and unbalanced is exactly where no Kloosterman-\n fraction bound in print reaches (section 4).\n- **PROVEN given a theorem read at the page (section 5).** Henriot's Corollary 2\n (`arXiv:1102.1643v1`, page 7; erratum MPCPS 157 (2014) 375-377 read: \"the\n upper bounds in Theorem 5 and Corollaries 1-2 are not sharp as claimed\n (although they are still valid)\") applies to `F_0(h) F_1(h-2) F_1(h+2)` with\n its hypotheses met as stated, and gives\n `sum_{|h| L ln^2 y * phi(y)`, any `phi -> infinity`, contribute `o(ln^2 y)` to\n both the count and the main term. The open estimate's range shrinks from\n `n in (2L, L^3)` to `n <= L ln^(2+o(1)) y`. Measured share of the mixed\n remainder above `L ln^2 y`: `0.014, 0.016, 0.014` at `x = 11, 13, 17`.\n- **The record's named estimate is not the whole open step.** The divisor-\n distribution statement of `varE-theta2-proof.md` section 6 is for `n > 2L`\n only. The band `n <= 2L` carries `82 %` of the measured mixed remainder and\n the same one-logarithm gap under the kernel bound `|R_n(c)| <= n/L`. A proof\n of the section 6 display would leave the larger part of Conjecture 1 open.\n\n## 1. The open step, stated once, with what stands on either side\n\n**Objects.** `L = x#`, `y` the largest prime `<= sqrt L`, `K_L` the Fejer\nkernel, `delta = prod_{p<=y} alpha_p/p`. `varE-theta2-step.md` section 1\n(PROVEN, six levels): `X = sum_{|h| 0` there is `y_0` such that for every level `x` with `y > y_0`,\n\n | X(L) - X_dec(L) | <= eps / delta, equivalently | X - X_dec | <= eps * 3.6 ln^2 y (1 + o(1)).\n\n**What stands on each side of it.**\n\n| piece of `X - X_dec` | statement | rung | where |\n|---|---|---|---|\n| `X1 - X_dec` (`c0` type: `n+ = n- = 1`) | `delta*(X1 - X_dec) -> 0`, rate `O((ln ln y)^{-1/4})` | PROVEN, unreviewed, numerically vacuous at all levels | `varE-theta2-proof.md` sec.4 |\n| `2X2` (pure shift: exactly one of `n+, n-` nontrivial, `n0 = 1`) | `\\|2X2\\| <= 60 prod p(p-3)/(p-2)^2 = O(ln y)` | PROVEN | `varE-theta2-proof.md` sec.3; measured group sum `0.18` at `x = 19`, PART F |\n| `Xmix` (at least two parts nontrivial) | `Xmix = o(ln^2 y)` | OPEN | this note, sections 3-5 |\n| the model's limit `E[g] -> Pr[GD(2) > u]` | no correction term; bands `O(1/ln y)` | PROVEN, unreviewed | `varE-limit-theorem.md` Thms A-C |\n\nSo the open step is `Xmix = o(ln^2 y)`, and by PART C it is, at the computed\nlevels, `Xmix = X_{mix2a} + X_{mix2b} + X_{mix3}` with the first of the three\ncarrying all of it.\n\n**The record's statement of the open step (`varE-theta2-proof.md` section 6,\nquoted in `lit-scourfield-2008.md` section 1 with quantifiers):** the weighted\ncount of `y`-smooth divisors `n > 2L` of `C(C^2-4)` over `|C| < L` equals its\nexpected count to `o(ln^2 y)`. That is the `n > 2L` band of `Xmix` only. The\nquantities `MAIN` and `COUNT` of PART C are exactly that display's two sides,\nband by band, and PART C reads the `n <= 2L` band of the mixed remainder at\n`-3.22` against `-0.72` above `2L` at `x = 19`. Both bands are one logarithm\nshort under the kernel bound (`sum_{n<=2L} W_mix(n) n/L` and\n`sum_{n>2L} W_mix(n)` are both `O(ln^3 y)` by the `4^omega` count), so the\n`n <= 2L` band is not a smaller problem; it is the same problem at a different\nscale, `r_n/n` with `r_n = x# mod n` in place of `L/n`.\n\n## 2. The mis-doubled group, and what it changes\n\n`varE-theta2-step.js` computes the group `X2` as\n`[h = 0 term] + 2 sum_{k>=1} (1 - 6k/L)(6 f_5 D_y PM[k] - 6 b_2)` with\n`PM[k] = prod_{p | 6k-2}(p-3)/(p-4)`: the `h = 2 (mod p)` pattern on `h > 0`,\ndoubled. The pattern function `W_-(h) = 6[6|h] f_5(h) D_y prod_{p|h-2}(p-3)/(p-4)`\nsatisfies `W_-(-h) = W_+(h)`, the mirror pattern, so the doubled half is\n`sum_{h>0} W_- + sum_{h<0} W_+`, neither group. PART F rebuilds both:\n\n| `x` | corpus column `delta*X2` | reproduced by the asymmetric formula | group sum `delta*X2` | `X2c` | `X2` |\n|---|---|---|---|---|---|\n| 7 | 0.094199 | 0.094199 | -0.009235 | 2.8574 | -0.2801 |\n| 11 | 0.047843 | 0.047843 | 0.004509 | 2.8140 | 0.2652 |\n| 13 | 0.027019 | 0.027019 | 0.001365 | 2.6666 | 0.1347 |\n| 17 | 0.017012 | 0.017012 | 0.000736 | 2.6760 | 0.1157 |\n| 19 | 0.011379 | 0.011379 | 0.000394 | 2.6633 | 0.0923 |\n\nThe group sum equals PART C's pure-type remainder to `1e-6` by an independent\nenumeration (the per-`h` divisor expansion against the sieve), and PART C's\ntotal reproduces the corpus `X` at every level, so the split is right and the\ncolumn is wrong. Consequences, each a correction owed to a live or HELD file\n(section 8): `2X2` is not \"flat near 5.3\", it is `0.18` and falling; `Xmix` is\nnot `-9.78` at `x = 23` (\"the truth is of order `ln y`\", `varE-theta2-proof.md`\nsection 5), the true mixed remainder is `-3.94` at `x = 19`, still of order\n`ln y` but with coefficient `-0.49`, not `-1`; and the sentence \"`Xmix` the slow\nhalf\" survives with the halves renamed. `X1`, `X`, `X_dec`, every `X/X_dec` ratio\nand every `delta*(X - X_dec)` in the corpus are untouched, since none of them\npasses through the `X2` column.\n\n## 3. Attempt on the identification step: the remainder as a discrepancy of Kloosterman fractions\n\n**The reduction, PROVEN (PART A, PART B, PART D).** By PART B,\n`R_n(c) = phi_n(c) - (1/n) sum_{c'} phi_n(c')` with\n`phi_n(c) = sum_{h = c (n), |h| (M+N)^{1/4}`. With `A ~ MN/L` (the frequencies the kernel\n weights) and `MN ~ L` this is `M > L^{2/5}` when `M <= N` [ARITHMETIC,\n mine, unstamped, first term only]. Two things are NOT done and are owed\n before any block is called closed: the kernel `(1/n) K_L(nu/n)` couples `nu`\n to `de` and is not of the form `nu_a alpha_m beta_n`, so it must be separated\n (Mellin in `nu/(de)`, at a logarithmic cost); and the three-branch type has\n two coupled inverses (PART A's fraction form) and is not bilinear in any\n pair of its parts without a further reciprocity step. PART G measures the\n balanced cell's remainder at `-0.0087` at `x = 19`, so a power saving there\n is at least consistent with the data.\n5. *The unbalanced range, which is the obstruction.* PART G: `99.7 %` of the\n dominant cell sits at `min(d, e) <= L^{2/5}`, and no bound in print for\n `e(a inv(m)/n)` with arbitrary coefficients saves anything when one variable\n is below the `2/5`-power of the other in this configuration. Section 4\n states what is needed there.\n\n## 4. The single inequality that does not close\n\nTake the dominant cell: two parts `(d, e)`, `d | h`, `e | h -+ 2`,\n`de in (L^{1-eta}, 2L]`, `min(d, e) <= L^{2/5}`, and say `d` is the small one\n(the mirror case swaps the roles). Then `h = 2 + e j`, `|j| <= L/e < d L^{eta}`,\nand `d | h` says `j = -2 inv(e) (mod d)`. For fixed `d`, the cell's remainder is\n\n E_d := sum_{e ~ L/d, e y-smooth squarefree, (e, 30d) = 1} lam1(e)\n [ sum_{j = -2 inv(e) (d), |2 + ej| < L} (1 - |2 + ej|/L) - L/(de) ],\n\nthe discrepancy of the class of `e` modulo `d` (through its inverse, which\npermutes the reduced classes) against a bounded-variation window of the `j`\nline, weighted by `lam1(e) = (1/e) prod_{p|e} p/(p-4)`. Trivially\n`|E_d| = O(1)` [ARITHMETIC: `|R| <= min(1, de/L)` summed over `e <= 2L/d`],\nand `sum_{d <= L^{2/5}} lam0(d) = O(ln^2 y)`, so the cell is trivially\n`O(ln^2 y)` with an explicit constant, and PART G reads it at `-3.27`, i.e.\n`0.05 ln^2 y`, at `x = 19`.\n\n**What would close the cell.** For every `eps > 0` there is `y_0` such that for\n`y > y_0`, uniformly in `y`-smooth squarefree `d <= L^{2/5} = y^{4/5 + o(1)}`\ncoprime to 30,\n\n | E_d | <= eps * (L/d) * sum_{e <= 2L/d} lam1(e)/e * (1/phi-share) (*)\n\nthat is, the `y`-friable squarefree integers `e` in `(L^{1-eta}/d, 2L/d]`,\nweighted by `lam1(e)`, are equidistributed among the reduced classes modulo `d`\nagainst bounded-variation test functions, to relative precision `o(1)`\nUNIFORMLY in `d` up to `y^{4/5}`, in the friability range `u = ln e/ln y in\n(1.2, 2]`. Then `sum_d lam0(d) |E_d| <= eps * O(ln^2 y)` and the cell is\n`o(ln^2 y)`. The direction is legal: it is an upper bound on the absolute value\nof a signed discrepancy; nothing lower-bounds a count, and no window is anchored.\n\n**Why it does not close here.** It is a level-of-distribution statement for\nfriable integers, at modulus `y^{4/5}` against sampling range `L/d >= y^{6/5}`,\nwith a multiplicative weight and a squarefree-coprimality restriction on top.\nThe owning convention is \"entiers friables en progressions arithmetiques\" /\n\"smooth numbers in arithmetic progressions\", `Psi(x, y; a, q)`, and the\nBombieri-Vinogradov-type theorems for it. That convention is NOT the one the\ncorpus searched for this step (`lit-smooth-divisors.md` searched divisors of\npolynomial values; `lit-scourfield-2008.md` the friable divisor sum), and it\nwas NOT searched at the page in this pass. Candidate sources, from memory and\nUNVERIFIED (confirm every locator before quoting): Fouvry-Tenenbaum,\nProc. LMS (3) 63 (1991); Granville, Acta Math. 170 (1993); Harper,\narXiv:1208.5992; Drappeau, Compos. Math. 151 (2015). Whether any of them gives\n`(*)` with the uniformity in `d` up to `y^{4/5}`, the `1/e`-type weight, and the\nsquarefree restriction is the question item 9 should ask next; the honest\nprior is that the range is inside what those theorems reach and the weight and\nrestriction are bookkeeping, and that prior is worth nothing until a page is\nread.\n\n**What `(*)` does not cover.** The mirror case (`e` small, `d` large: friable\n`d` in classes modulo `e`, same shape); the balanced cell (section 3, item 4,\nowed the kernel separation); the three-branch and `(+,-)` types (measured\n`-0.0002` and `-0.003` at `x = 19`, PART C, so numerically nothing, but their\n`o(ln^2 y)` is not derived: the trivial bound is `O(ln^3 y)` for them too); and\nthe `n > 2L` band, `18 %` of the measured remainder, which is the record's\nsection 6 display with its moduli now confined to `(2L, L ln^{2+o(1)} y]` by\nsection 5, hence with the bump width `L/n >= 1/ln^{2+o(1)} y`, a logarithmic\nscale and not a power scale.\n\n## 5. The toolkit, theorem by theorem, with hypotheses checked\n\nThe brief's list: Shiu, Henriot, Nair-Tenenbaum, the Erdos-Hooley `Delta`\nliterature, Tenenbaum's book. Every entry below is an UPPER bound for a\nnonnegative sum; none supplies the cancellation of section 4. One of them\napplies as stated and earns a lemma.\n\n| source | statement as read | hypothesis against our sum | verdict |\n|---|---|---|---|\n| Shiu 1980, Crelle 313 | quoted at second hand from Nair-Tenenbaum p.119 (read at the text layer of the Acta Math. PDF, sha256 `3a2caa93...`): `sum_{x= y >= x^alpha`, `q <= y^{1-beta}` (the last range read through OCR damage; not load-bearing) | one multiplicative function of one variable; ours is a product of three functions on three shifted arguments | HYPOTHESIS UNMET as stated; superseded by the next two rows |\n| Nair-Tenenbaum 1998, Acta Math. 180, Theorem 1 (p.125, read) | `sum_{x= c_0 \\|\\|Q\\|\\|^delta`: `<< Delta_{D*} y prod_{g T` and\n`sum_{n0 | h} n0 lam0(n0) = F_0(h)`, `sum_{n+ | h-2} n+ lam1(n+) = F_1(h-2)`,\n\n COUNT(n > T) <= (15 D_y / T) sum_{|h| T) = L sum_{n>T} W_tot(n)/n << L ln^3 T / T,\n\nthe second by partial summation off `sum_{n<=t} 4^{omega(n)} mu^2(n) << t ln^3 t`.\nWith `T = L ln^2 y * phi(y)`, `phi -> infinity` arbitrarily slowly, both are\n`o(ln^2 y)`. Every inequality is an upper bound on a nonnegative quantity.\n[The exponent bookkeeping is mine; the theorem's constants depend on\n`g, alpha, delta, A, B` only, all fixed here, so the bound is uniform in `y`.]\n\n## 6. Falsifiers, and whether each check has run\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| the mixed class is `2( inv(n0 n-, n+)/n+ - inv(n0 n+, n-)/n- )` | PROVEN | a coprime triple where it fails | YES, 3000 triples, residual 0 (PART A) |\n| `sum_c R_n(c) = 0` | PROVEN | an `(L, n)` where it fails | YES, 2000 pairs, `1.9e-12` (PART B) |\n| the type x band table reproduces `X`, `X1`, `X - X1` | PROVEN (exact arithmetic) | a level off the corpus | YES, five levels, worst `6.4e-8` relative (PART C) |\n| the corpus `X2` column doubles a positive half | PROVEN | the asymmetric formula not reproducing the column, or the group sum not matching PART C | YES, both, five levels (PART F) |\n| the mixed remainder is `~ -0.49 ln y` | MEASURED, 5 exact levels | growth at a new level | NO beyond `x = 19`; `x = 23` costs the descent to `4.5e8` and was not run |\n| `82 %` of it is below `2L`, `99.7 %` of the dominant cell is unbalanced | MEASURED, `x = 19` | the shares moving at a new level | NO beyond `x = 19` |\n| Henriot Cor. 2 applies and cuts the moduli at `L ln^{2+o(1)} y` | PROVEN given the theorem as read at the text layer of arXiv v1 plus the erratum | a hypothesis of Theorem 5 I misread, or the published version differing from v1 in the statement | PARTLY: v1 and the erratum read; the MPCPS published text NOT read |\n| `(*)` closes the dominant cell | STATED, not proven | nothing yet; it is the target | NO. Not searched in its owning convention |\n| any of this closes Conjecture 1 | NOT CLAIMED | | the step stands open |\n| this reduction is novel | NOT CLAIMED | the additive-divisor / sieve-remainder literature stating it | NO. The two-branch cell IS a truncated additive divisor problem, which is a hundred-year-old shape; do not call it new |\n\n## 7. Wrong-direction guard\n\nPer `attack-wrongdirection-audit.md` section 1: `Var/E` is a second moment of\nthe count in a UNIFORMLY random window; its limit constrains no single window,\nso it is Axis-D capacity counting and not `min_x N(x) >= 1`. Every inequality\nin this note is an upper bound on the absolute value of a signed remainder or\non a nonnegative sum, and none lower-bounds a count anywhere. The Kloosterman-\nfraction shape shared with Lemma V (section 3) is an obstruction family, not a\nbridge: closing `(*)` gives `lim Var/E`, which `variance-note.md` section 4\nalready says is not a statement about the anchored window; and Lemma V closing\nwould not close `(*)`, since Lemma V's coefficients are 1-bounded sieve weights\non a different index set. Verdict (i) of the audit's scale: strictly weaker than\nTPC, and it stays there.\n\n## 8. Corrections owed, and brief errors\n\n**HOLD for the orchestrator; no file is edited here.**\n\n1. `varE-theta2-step.js` PART 3 and `varE-theta2-step.md` section 5: the\n `delta*X2 (each)` and `delta*Xmix` columns. Replacement values at `x = 7..19`\n in PART F and PART C; `x = 23` not recomputed here (the descent is priced\n above the session, the sieve half is cheap and the fix is one line: sum\n `PM[k] + PP[k]` in place of `2 PM[k]`).\n2. `varE-theta2-proof.md` sections 0, 3, 5, 7: \"measured `2X2 = 5.3`\", \"flat\n near 5.3\", \"loose by 14 to 48\", \"`Xmix = -9.78` against `ln y = 9.611`\":\n the bound holds with more room, the measured group is `O(1)` and falling\n toward 0, and the mixed remainder is `-0.49 ln y`.\n3. `paper/variance-note.md` section 10: \"loose by a factor 14 to 48 against the\n measured `2X2 = 5.3`\" and the section 6 display's `n > 2L` restriction\n presented as the estimate \"that would close Conjecture 1\": it would close\n `18 %` of the measured remainder.\n4. `lit-scourfield-2008.md` section 1 and `research/SEARCH-CONVENTIONS.md`\n row 69: the moduli range `(2L, L^3)` (corrected once already to the upper\n endpoint by `redteam-0829-measure-c.md` E23) is now `(L^{1-eta}, L ln^{2+o(1)} y]`\n and includes the band below `2L`; the owning convention for the dominant\n part is friable integers in arithmetic progressions, not divisors of\n polynomial values.\n5. `varE-spectral.md` ledger and section 0: \"TWO open steps\" should cite\n `varE-limit-theorem.md` for the second.\n\n**Brief errors, each verified at its record.** (a) \"either of the two open\nsteps\" and \"separately the theta = 2 mean-coefficient step\": one statement\n(section 0). (b) \"the MODEL half is a theorem ... (`varE-spectral.md`)\": the\ntheorem is in `varE-limit-theorem.md`; `varE-spectral.md` says two steps are\nopen. (c) The path `research/varE-theta2-proof.md` is\n`research/history/staging/varE-theta2-proof.md`. (d) TODO item 9's\n\"residuals <= 0.002 at nine exact points from x = 13\" is the Monte-Carlo-model\nresidual; against the exact model the `x = 13` residual is `+0.00291`\n(`varE-theta2-step.md` section 6, `redteam-0828-varE.md` section 6). Everything\nelse in the brief checked out: the `0.45546` closed form, the two-of-three\ngroups closed, the CRT-mixed reduction, the Scourfield verdict, the `x = 41`\nsentence.\n\n**Channels.** arXiv API answered HTTP 429 on two queries (a claim about the\nfetcher, per the campaign rules); the arXiv PDF endpoints, Project Euclid's\nActa Math. download and Cambridge Core's erratum PDF answered 200 with a\nbrowser user agent, so no source is recorded unreachable. Nair-Tenenbaum was\nread at the text layer of a scanned PDF with OCR damage in the displays; the\ntwo statements quoted from it (Theorem 1's fixed-prime-divisor hypothesis, and\nShiu's theorem) were checked against Henriot's restatement of both on his\npages 1-2, which is typeset and clean.\n"},"research/history/staging/attack-c2drift-01.md":{"lf_sha256":"2462c9e26796b6bd054298f4c355abe185fb3242d3b7ab9831cf1ae042843bf8","content":"# The c2' drift is a diagonal-frame property, not a G2 anomaly — and its shape splits two survivors\n\n\n\n*(2026-08-21. Producer `research/attack-c2drift-01.js`, embedded (1.5 s,\n`--check` passes, 11 self-tests). Every number below is in its OUTPUT block.\nInstrument-first per `exponent-control.md`: every p-value is a rank in a\n4000-replicate null ensemble generated in the same pass on the same grid from\na truth whose answer is known, never a textbook standard error.)*\n\n## 0. The question\n\nThe A144311 adoption left a new open question: c2' = G2/(m·lnD) runs\n[0.4463, 0.5004] on the custody band x = 11..31 and [0.4842, 0.5337] on the\ntrusted tail x >= 41. Why does it drift upward? Three candidates: (i) a\nconstant plus a slowly-vanishing finite-size correction, (ii) genuine growth\nlike a power of lnD or of lnlnD, (iii) the maxgap-law §7a ledger's own\nnext-order term r(x)·ln₃x/(ln₂x)², scored zero-parameter. And the cheapest\ndecisive discriminator, run first: does the one-class column c1 = h/(m1·lnD1)\nover A048670's 64 published terms drift the same way?\n\n## 1. The h-side discriminator: YES — the drift is a property of the diagonal frame\n\nc1 has the same signature as c2', point for point in shape: a high head\n(0.4712 at x = 11), a dip (minimum 0.3359 at x = 59), then a slow rise to\n0.3756 at x = 311. Post-dip the rise is decisive and survives both noise\nmodels:\n\n| window (c1) | n | b per ln ln x | p (lognormal null) | p (Gumbel/lnD null) |\n|---|---|---|---|---|\n| x >= 11 | 60 | −0.1091 ± 0.0335 | 0.9968 | 0.9527 |\n| x >= 17 | 58 | +0.0238 ± 0.0256 | 0.1790 | 0.3643 |\n| x >= 59 | 48 | **+0.1553 ± 0.0261** | **0.0000** | **0.0000** |\n| x >= 101 | 39 | +0.1524 ± 0.0182 | 0.0000 | 0.0000 |\n| x >= 179 | 24 | +0.2187 ± 0.0442 | 0.0000 | 0.0000 |\n\n(The negative full-range slope is the x = 11..13 head, maxgap-law §6's known\noutlier structure.) This independently confirms maxgap-law's (log p)^0.12 with\na different regressor and the full 64 terms, and it settles the question's\nshape: **whatever drives the drift acts on one class and two classes alike.\nEvery twin-specific explanation of \"why does c2' drift\" is dead on arrival**;\nthe object under study is the diagonal law's constant in both sieve\ndimensions, and the c2' version is just the shorter, noisier copy (post-head\nrates: c2' 0.23–0.43 per ln ln x against c1's 0.16–0.22 — same direction,\nsame order, wide errors on the short ladder).\n\n## 2. The instrument, calibrated before the data was read\n\n- **Deterministic recovery** (rounding-only, real 18-term grid): a flat truth\n reads b_PLNX = −0.0140 (no spurious drift from discretisation); a true\n (ln x)^1.0 reads 0.9903; the ledger shape reads b_LEDG = 0.9956. The\n estimator sees what is there.\n- **The bias runs DOWN here, not up.** A pure Gumbel finite-size truth\n (c ∝ 1 + γ/lnD) reads b_PLNX = −0.1341: a Gumbel head term biases the drift\n estimator negative, so the measured drifts are conservative. (The corpus's\n one-class lesson — positive log inside the truth biases a power fit up —\n applies to exponent fits on g itself; on the ratio column the danger\n inverts, and it is now priced.)\n- **Cross-talk, load-bearing:** ln lnD and ln ln x are nearly collinear\n on-range (lnD ≈ θ(x) ≈ x). A true (lnD)^0.12 reads as (ln x)^0.50, a true\n (ln x)^0.30 reads as (lnD)^0.07. **Candidate (ii)'s two subforms cannot be\n separated by shape on any reachable range; only the per-frame rate is\n measurable.**\n- **Power:** against a true (ln x)^0.30 drift at the 5% level, the c2' grid\n (n = 18) has 92.8% power, the c1 grid (n = 60) has 100.0%. Nothing weaker\n than s ≈ 0.3 was detectable on the c2' side — the h-side is where the power\n lives, which is why §1 leads.\n\n## 3. The calibrated verdict on the three candidates\n\n**c2's own drift is real:** x >= 17 slope 0.3351 ± 0.1098 with p_logn =\n0.0053 and p_EV = 0.0075 (significant under both noise models); full-range\nn = 18 is noise-model-dependent (0.0092 vs 0.1737 — the EV null's slope sd is\n0.2056 at that n, honestly reported, not resolved). Deleting the x = 37\noutlier leaves b = 0.2219 ± 0.0578: the outlier does not carry the drift.\n\n| candidate | verdict | the numbers |\n|---|---|---|\n| (i) EV/Gumbel finite-size, c∞·(1 + γ/lnD) | **SIGN-REFUTED** | predicts b_FS = +0.577 (falling column); every fitted b_FS is negative (−0.597 c2' full, −3.52 c1 long lever) |\n| (i)' empirical mirror: negative deficit, c → c∞ from below | **ALIVE, narrowly ahead on the longest lever** | on c1 x >= 59, FS beats both powers (ΔAICc 1.1 vs 6.3–7.2); implied limits c1∞ = 0.3799, c2'∞ = 0.5345, i.e. G2 → 1.28·x·ln²x |\n| (ii) genuine polylog growth | **ALIVE, wins the c2' table** | COMP (γ-term fixed + (ln x)^s) is AICc-best on c2' x >= 17 at s = 0.4335; post-head windows s = 0.23–0.43 ≡ (lnD)^{0.05–0.08}; subforms unresolvable (§2) |\n| (iii) ledger shape, zero-parameter | **REFUTED globally, wins one deep window** | anchored on the custody band it overshoots the trusted tail 5.5× (rms(ln) 0.5874 vs 0.1066 flat; predicts +13.2% over 41→79 against +3.1% observed); fitted shape exponent 0.0894 (c2') and −0.0574 (c1) against the required 1 — yet on c1 x >= 59 the same k = 1 anchored shape is the outright AICc winner (−392.1) |\n\nThe ledger reading deserves its sentence: it fails exactly where its own\nderivation warns (the shape vanishes at x = e^e = 15.15 and is steepest just\nabove), and becomes the best zero-shape-parameter description precisely in\nthe deep window — maxgap-law §7a's \"the flatness is a property of where the\ndata sits on ln₃x/(ln₂x)²\" survives in exactly the regime it claims.\n\nBetween (i)' and (ii) this data cannot decide (1.1 AICc units on the best\nlever). The cheapest future discriminator is on the ONE-CLASS side, not ours:\nunder (i)' c1 saturates at its fitted 0.3799 (c1(311) = 0.3756 is already\n99% of the way); under (ii) it climbs through it.\n\n## 4. The 1d compatibility algebra, exact\n\nG2/x² = c2'·(m·lnD/x²) identically. Measured over the ladder 11 → 79:\n\n Δln(G2/x²) = Δln c2' + Δln(m·lnD/x²)\n −0.2365 = +0.0540 + (−0.2905)\n\nThe drift consumes 18.6% of the frame factor's fall. Since d(ln lnD)/d(ln x)\n≈ 1 on the diagonal, the PLND slope IS the per-ln-x growth rate of c2', and\nG2/x² keeps falling exactly while b_PLND < −dln(m·lnD/x²)/dln x — a threshold\nmeasured at 0.147 on-range and rising to 1 − 2·lnln x/ln x → 1 asymptotically\n(m·lnD → 2.40·x·ln²x). Measured b_PLND = 0.052: a third of the on-range\nthreshold, far below the asymptotic one. Consequences:\n\n- **Every fixed polylog drift keeps G2/x² → 0** — c2' ~ (ln x)^s gives\n G2 ~ x·ln^{2+s}x for any s, the full Maier-Pomerance s = 1 included.\n- **The two trusted drifts are in no tension anywhere in candidate space.**\n They jointly pin the correction between m·lnD and x² to polylog size,\n ln^{2+s}x with s between 0.23 and 0.43 on this range; only a near-unit\n POWER of lnD ≈ x could reverse 1d's lean, and the measured lnD-exponent is\n 0.05–0.08, two orders of structure away.\n- Under candidate (i)' the correction CONVERGES: G2 → 0.5345·m·lnD ≈\n 1.28·x·ln²x, a constant diagonal law with a vanishing deficit — the\n strongest possible \"G2/x² falls\" reading. Under (ii) the polylog compounds\n without limit and still never reaches x². 1d's central question is\n narrowed, not settled: the correction is polylog either way; whether it\n saturates is exactly the (i)'-vs-(ii) split.\n\n## 5. What was NOT reached\n\n- **(i)' vs (ii) is undecided** — 1.1 AICc units on the best lever; the\n designed test (does c1 pass 0.3799?) needs A048670 terms past p = 311,\n which no one has computed.\n- **(ii)'s subforms (lnD-power vs lnlnD-power) are unresolvable on-range** by\n the collinearity of §2 — this is an instrument ceiling, not a data\n shortfall; no reachable ladder length fixes it.\n- **Full-range c2' significance stays noise-model-dependent** (p_EV = 0.17 at\n n = 18); the x >= 17 window verdict (significant under both) is the honest\n quotable.\n- **The ledger's r-driven growth was never testable:** r(x) = 2 everywhere\n reachable (checked at every grid point to 311), so only its T1 shape was\n scored; the r-ladder's predicted breaks live at x ~ 1e6 and beyond.\n- **Mechanism.** Nothing here says WHY the frame drifts — only that the why\n must be class-count-blind, that it is not the Gumbel mean, and that its\n size sits at a tenth of Maier-Pomerance's requirement on both columns.\n- 8 of the 18 c2' terms and the last 6 c1 terms are single-witness\n (Alekseyev/Wang; Bozek); in-house verification remains the paper-phase\n deliverable it already was.\n\n---\n\n*This is a history/staging record: a process document, superseded-in-place by\nlater work. The live claims travel with the producer's READINGS block.*\n"},"research/history/staging/attack-doubling-01.md":{"lf_sha256":"37e50b61756ba29c77420266f9907f30eebbb06f52053aa7d5c72f42d32ea495","content":"# The doubling attack's first move: the C₂ table complete, the mechanism named, eleven proven certificates, and two closures refuted\n\n\n\n*2026-08-21. Producer: `research/attack-doubling-01.js` (0.3 s, `code-sha256\n50418c06`, `out-sha256 b0ba3bd8`, formal embed with input hashing, eight\nnumbered readings; fingerprint verified with `embed.js --check` after\nwriting). One re-embed used `--force` (the tool's corrected-code path — a\nhand-typed summary line was replaced by the computed value; 0 of 195 figures\nin the replaced block changed); the override is stamped in the tail. A predecessor agent's session died mid-task; its orphaned draft was\nsalvaged CODE-first — every algorithm re-audited against the definitions\n(fold kill classes r ≡ 0, −2 mod p; Ĝ(t) = G₂(P(t)#), P(t) the largest prime\n≤ t; the bridging decomposition), its silent `Number()` conversion of BigInt\nladder positions replaced by a loud 2^53 width guard (`qc/widths.js`, the\nWIDTH RULE class), and the file rebuilt fresh with three instruments the\ndraft did not have (overlap multiplicity, ground-density ρ, K* drift). All\nof the draft's overlapping numbers reproduce. Nothing was committed or\npushed; no existing corpus document was edited. HELD, not integrated —\nawaiting the standing one-pass adversarial review. Legend as in\n`research/sift-limit-attack.md`: **[PROVEN]** proof given here or published;\n**[VERIFIED]** checked computationally here; **[MEASURED]** empirical,\nfinite range; **[INFERRED]** deduction from sourced facts.*\n\n---\n\n## 0. The verdict, up front\n\n> **The doubling inequality is not proven and not refuted. What this pass\n> adds: the complete exact C₂ table (sup 5.2727 at s = 16, on the chain,\n> custody-only); the mechanism a proof must bound, seen exactly at all\n> eleven enumerable steps — the level-2s record is a run of k = 1..10\n> consecutive level-s slots killed by the entering primes, assembled at\n> ~98% covering efficiency on near-average ground; eleven proven\n> finite-level bounds C₂ ≤ K*+1, tight to a factor ≤ 2.91; and two\n> first-class refutations — the residue-density closure fails from the\n> very first step and takes every constant-factor sharpening (unified-cap\n> style included) down with it, and the \"record sits over the old record\"\n> strategy is false at two steps. The honest alarm: the certificate\n> quantity K* drifts up (slope 0.6881 ± 0.1328 in the level) while C₂\n> does not (0.2018 ± 0.1412) — the bridging certificate route needs K*\n> proven sublinear, or a bound that does not pass through K*.**\n\n## 1. (a) The C₂ table, complete and exact\n\nEvery reachable integer s = 2..41 (trusted 22-term ladder; custody grade iff\n2s ≤ 46), exact fractions in the producer. Headlines:\n\n- **Range [2.0000, 5.2727]**: inf 12/6 = 2 at s = 3; sup **348/66 = 5.2727\n at s = 16 — ON the base-2 chain**, both terms corpus-exact, and the\n custody sup equals the trusted sup (no literature term carries it).\n Confirms redteam-0820-night §2b's \"sup over the whole data range\" claim\n from a third independent code path. **[VERIFIED]**\n- The base-2 chain reads **3.0000, 5.0000, 2.2000, 5.2727, 3.1034**\n (s = 2, 4, 8, 16, 32): increments alternate + − + −, the sup is interior,\n the last trusted step falls (s = 32 rests on Wang's a(18)). **[VERIFIED]**\n- Landing zone unchanged: any proven all-s C₂ must be ≥ 5.2727, and every\n C₂ ∈ [5.2727, 19.2455) gives limsup ≤ log₂C₂ ∈ [2.3985, 4.2665).\n **[VERIFIED, arithmetic]**\n\n## 2. (b) The hood open: the mechanism is bridged kill-runs\n\nTiles to 13# materialized by fold recursion; 17#/19#/23# reached by kill-run\nwalks over base-tile copies (both paths re-derive G₂, least argmax and\nmultiplicity for all eight levels p ≤ 23, digit-for-digit against the parsed\nladder). At every one of the eleven distinct enumerable doubling steps:\n\n- **The maximal window at level 2s is exactly a run of k consecutive\n level-s slot copies killed by the primes entering in (s, 2s]** (k = 1 at\n 3#→5# up to k = 10 at 11#→23#), bridging k+1 consecutive level-s gaps;\n the length decomposition closes to the digit at every step, and every\n bridged copy is killed by an entering prime only. **[VERIFIED]**\n- **Assembled, not inherited.** The largest single spanned level-s gap\n carries only 0.20 to 0.50 of the window's length — half to four fifths of\n every level-2s record is new damage. **[VERIFIED]**\n- **Ordinary ground.** The spanned gaps average ρ = 1.000 to 1.461 times\n the tile's mean gap (nine of eleven steps below 1.2): the record is made\n by run-covering on near-average terrain, not by landing on pre-thinned\n terrain. **[MEASURED]**\n- **Overlap-free zones.** Across all eleven argmax windows the entering\n primes spend 52 strikes for 51 kills — exactly one multi-killed copy\n (779 at 7#→19#, struck by 11 and 19). The corpus's global salvation\n mechanism (capacity exceeds census; survival rides on forced overlap\n credit) is precisely what is absent locally at a record: records are\n where the covering runs at ~98% efficiency. **[VERIFIED the count]**\n- **The record does not anchor on the record.** At 8 of 11 steps the window\n contains a copy of the level-s record gap; at 11#→19# and 13#→23# it does\n NOT (max spanned 36 < 42, and 42 < 66) — the new record can assemble\n entirely from mid-size gaps, refuting any proof strategy that locates the\n new record over the old one. And the same physical window\n [76166567, 76166771] is the argmax against both 11# (C₂ = 4.8571, k = 10)\n and 13# (C₂ = 3.0909, k = 8): C₂ is a property of the pair of levels, not\n of the window. **[VERIFIED; refutation first-class]**\n\n## 3. (c) The bound attempted: what is proven, what leaks\n\n**Bridging Lemma [PROVEN, three lines].** Level-2s slots are a sub-pattern\nof the (periodic) level-s slots, so every level-2s gap is a sum of k+1\nconsecutive level-s gaps, each ≤ Ĝ(s); hence **Ĝ(2s) ≤ (K*+1)·Ĝ(s)** with\nK* the longest run of consecutive level-s slots all killed by the entering\nprimes.\n\n- **Eleven proven certificates.** K* computed exactly (full cyclic walk):\n C₂ ≤ K*+1 = 3, 2, 5, 3, 4, 4, 6, 9, 7, 11, 9 across the steps — the first\n proven doubling bounds the corpus has, every one under 19.2455. Tight:\n cert/C₂ = 1.00 at the first three steps (equality — all bridged gaps are\n records) and never worse than 2.91; at 10 of 11 steps the argmax window\n realizes the longest run (exception 11#→19#: K* = 6 vs k = 5). Per-step\n facts only; no all-s statement follows. **[PROVEN per instance]**\n- **REFUTED: the residue-density closure, from the first step.** The AP cap\n (an entering prime kills ≤ 2(⌊(L−2)/q⌋+1) copies in a window of length L;\n proven, never violated) closes the Bridging Lemma iff\n θ = 2Ĝ(s)·Σ_{q∈(s,2s]} 1/q < 1. Measured: θ = 1.3333 at 2#→3#, rising to\n 20.45 at 13#→23#, growing like Ĝ(s)/s — fails everywhere, worsening\n polylogarithmically. **[VERIFIED]**\n- **REFUTED with it: every constant-factor sharpening.** A density-cap\n refinement by constant factor c closes only where c < 1/θ = 0.750 at the\n first step, 0.049 at 13#→23#, → 0. Since θ → ∞ along s, no\n bounded-strength discount — unified-cap freshness conditions, overlap\n credits, anything of that family — proves any all-s C₂ through this\n route. The unified caps additionally bound kill COUNTS per level,\n history-blind, while the window needs kill PLACEMENT; their localized\n content is exactly the AP spacing already spent. Mirror-Sweep is symmetry\n (halves fingerprints, pairs a ↔ w−a) and carries no magnitude bound by\n its own statement. **[PROVEN the corollary given θ's growth; INFERRED\n the tool assessment]**\n- **The self-similarity, named.** An a-priori K* bound is the entering\n primes' two-class covering-run problem on the level-s slot sequence — the\n same two-class Jacobsthal problem one level up. The doubling inequality\n is self-similar under its own natural decomposition; a proof must break\n the self-similarity with placement structure (mirror, seam, fold\n recursion), and no proven corpus tool does. **[INFERRED]**\n\n## 4. (d) The drift hunt: C₂ flat, K* rising\n\n- **C₂: no drift.** Against the in-pass constant-C₂ null (POW ladder\n 1.84·p^1.546 on the same primes, whose continuous-limit C₂ is exactly\n 2^1.546 = 2.9201): G₂-minus-POW slope reads **−0.0336 ± 0.0596** (full,\n s = 2..41 — reproducing hsub-01's (s,2)-family statistic digit for digit\n from independent code) and **0.0090 ± 0.1129** (custody, s ≤ 23). Both\n consistent with constant C₂. The moving null (LOG) reads −0.1313 ±\n 0.0481, so the instrument is not pinned. **[MEASURED]**\n- **K*: drifts up.** ln(K*+1) on ln P(2s) reads **0.6881 ± 0.1328** (raw —\n no null exists for K*; a POW ladder has no slot sequence) against C₂'s\n 0.2018 ± 0.1412 on the same 11 points; cert/C₂ runs 1.00 → 2.91. The raw\n fit crosses 19.2455 near P(2s) ~ 69 (illustration, not a claim). The\n certificate route cannot land by computing K*: it needs K* proven\n sublinear in the level, or a C₂ bound that does not pass through K*.\n **[MEASURED]**\n\nNo reachable family shows C₂ growing; growth beyond s = 41 is neither seen\nnor excluded.\n\n## 5. Trap grading\n\nNothing here derives an explicit all-s constant, so nothing trips the\nexplicit-constant trap; the slice remains trap-free (TPC through it needs\nC₂ < 4, excluded by the s = 16 datum 5.2727). The eleven K*+1 certificates\nare finite-level theorems and imply nothing about limsup by themselves.\n\n## 6. NOT REACHED\n\n- **No all-s bound on C₂.** The inequality stands open in both directions\n past s = 41.\n- **K* beyond 23#** is unenumerated: the next distinct steps need 29# and\n 31# walks, orders of magnitude beyond this pass's 0.3 s budget (and 31#\n likely needs a streaming walk, not a materialized one).\n- **The successor target is posed, not attacked**: bound the longest\n entering-prime covering run on the level-s slot sequence by PLACEMENT\n structure, or bound the local overlap deficit of §2 (records as\n overlap-free zones — the X-channel question at window scale).\n- **Rows s ≥ 24 of the table** rest on A144311 literature terms\n (floor-certified only at 47..61); the chain rows s ≤ 16 are custody-exact\n and s = 32 rests on Wang's a(18).\n- Whether the ρ and overlap-efficiency readings persist at 29#+ — the two\n new instruments have eleven points each, all at small levels.\n\n## 7. Sources and reproduction\n\n| artifact | what it carries |\n|---|---|\n| `research/attack-doubling-01.js` | everything above: the C₂ table, the walks, the decompositions, the certificates, the closures, the drift fits (§§1–4) |\n| `research/history/staging/attack-hsub-01.md` Reduction 3; `redteam-0820-night-proofs.md` §2 | the doubling window's trap-free status and the verified endpoints this pass extends |\n| `research/attack-fekete-1d-01-defect47.js` | the Ĝ instrument convention and the step-sampling artifact the nulls answer |\n| `research/history/staging/attack-anchored-01.md` §2, §4 | the unified-cap machinery assessed in §3 |\n| `research/history/staging/attack-0c-holesweep.md` §4 | the Mirror-Sweep Lemma assessed in §3 |\n| `research/exact-g2-ladder.js`, `research/import-interp-01-bgt-defect.js` | the two ladders, parsed at run time, input-hashed by the embed |\n| `research/dhr-verification.md` row 1a | β₂ = 4.26645…, the proven ceiling the landing zone lowers |\n\nReproduce with `node research/qc/embed.js --check research/attack-doubling-01.js`;\nthe fingerprint matches as of 2026-08-21.\n"},"research/history/staging/attack-hsub-01.md":{"lf_sha256":"03626860c502880baeb35c7b9da215c69310749eecc29257717b2806ffd6d8d4","content":"# TODO 1d: (H-sub) attacked — three proven reductions, the fold verdict, and no counterexample\n\n\n\n*2026-08-20. Producer: `research/attack-hsub-01.js` (0.1 s,\n`code-sha256 f14f5789`, `out-sha256 ee4e9643`, formal embed with input\nhashing, seven numbered readings; fingerprint verified with `embed.js\n--check` after writing). One defect was found in the producer's own first\nrun and repaired before this report's numbers were read: the proven-floor\ncheck's slack accumulator initialized at 0, capping its printed minimum —\nthe could-not-fail class. The re-embed used `--force` (the tool's\ncorrected-code path); the override is stamped in the tail. Nothing was\ncommitted or pushed; no existing corpus document was edited. HELD, not integrated — awaiting the standing one-pass\nadversarial review. Legend as in `research/sift-limit-attack.md`: **[PROVEN]**\npublished theorem or a proof given here; **[VERIFIED]** checked\ncomputationally here; **[MEASURED]** empirical, finite range; **[INFERRED]**\ndeduction from sourced facts.*\n\n---\n\n## 0. The verdict, up front\n\n> **(H-sub) is not proven and not refuted, but it is now a smaller statement\n> aimed at a wider window, and the pass found one target the trap cannot\n> touch. Three reductions of the lemma's hypothesis are proven; the fold\n> machinery's inability to reach any of them is made exact; and the hunt\n> over all 111 reachable pairs found no drifting family and no\n> counterexample.**\n>\n> 1. **The lemma consumes only power pairs.** Its own eight-line proof uses\n> (H-sub) at the pairs `(b^k, b)` and nowhere else, so the hypothesis\n> weakens to (H-sub-pow) with the conclusion unchanged. The record\n> defects 1.0761 at (4,10) and 1.0330 at (4,12) are not power pairs and\n> stop constraining the route: the trap window widens from\n> `[1.0761, 1.3946)` (0.3185 nats) to **`[1.0033, 1.3946)` (0.3913 nats,\n> trusted)** and `[0.9694, 1.3555)` (0.3861, custody-only). **[PROVEN /\n> VERIFIED]**\n> 2. **One chain carries the TPC face; no chain carries existence.** A single\n> base `b₀` with chain defect `K < S(b₀)` forces `limsup < 2`; limit\n> existence needs chains at inf-realizing bases. And the chains that\n> decide the trap (bases 16 and 66) have **zero reachable pairs** — the\n> decisive family is dataless. **[PROVEN / VERIFIED]**\n> 3. **The doubling slice is trap-free and prize-bearing.** `Ĝ(2s) ≤ C₂·Ĝ(s)`\n> gives `limsup ≤ log₂C₂`; its TPC line `C₂ < 4` is already excluded by\n> custody data (`C₂ ≥ 348/66 = 5.2727`), so no provable doubling constant\n> is TPC-implying through the slice's own conclusion — and every\n> `C₂ ∈ [5.2727, 19.2455)` lowers the proven\n> exponent ceiling 4.2665 to `log₂C₂ ∈ [2.3985, 4.2665)`. A 1.29-nat\n> landing zone with no trap in it. **[PROVEN the implication; VERIFIED\n> the window]**\n> 4. **The fold machinery cannot reach (H-sub), exactly.** The fold step is\n> `×p_next/p ≤ 5/3 < 2` in Ĝ's argument coordinate — below the integer\n> floor `t ≥ 2` — so every admissible pair is multi-fold; (H-sub) is\n> identically a head-dominance statement about the nonnegative\n> fold-budget sequence, and the proven tools bound the defect from the\n> side it does not need. **[PROVEN / VERIFIED]**\n> 5. **No counterexample.** Max `D = 1.0761` at (4,10), min `−0.2400` at\n> (7,7); the (4,t), (s,2) and diagonal families all read bounded against\n> the in-pass constant-defect null. **[MEASURED]**\n\n---\n\n## 1. Reduction 1: the hypothesis shrinks to power pairs, and the floor drops\n\nRe-reading the proof in `attack-fekete-1d-02-lemma.js`: the limsup half\niterates `f(b^{k+1}) = f(b^k·b) ≤ f(b^k) + f(b) + K` — the pair `(b^k, b)` —\nthen bridges intervals with the proven (H-mono); the liminf half uses only\nthe definition of the inf. No other pair is ever consumed. So\n\n> **(H-sub-pow)** `f(b^{k+1}) ≤ f(b^k) + f(b) + K` for all integers `b ≥ 2`,\n> `k ≥ 1`\n\nimplies the full conclusion — `lim f(n)/ln n = inf_n (f(n)+K)/ln n` exists,\nand `β < 2 ⟺ S(n) > K at one integer` — by the existing proof, character for\ncharacter. **[PROVEN, by inspection of the existing proof]**\n\nThe consequence is a data statement. Only 15 power pairs are reachable\n(9 custody), and the family's sup defect is\n\n| grade | floor | at | rests on |\n|---|---|---|---|\n| trusted | **1.0033** | (16,4) — base-4 chain, k = 2 | `Ĝ(64) = G₂(61#) = 1080` (Wang 2024 a(18) — the same term as the 1.3946 ceiling) |\n| custody | **0.9694** | (16,2) — base-2 chain, k = 4 | `G₂(31#) = 348`, `G₂(13#) = 66`, corpus-exact |\n\n(4,10) and (4,12) are not of the form `(b^k, b)` (verified), so the two\nworst defects on the 111-pair table no longer bound the constant the route\nneeds. **The trap window is now `ln C ∈ [1.0033, 1.3946)` at trusted grade —\n0.3913 nats, 23% wider than the standing 0.3185 — and `[0.9694, 1.3555)`,\n0.3861 nats, on custody terms alone.** Ceilings are unchanged: they belong\nto the conclusion formula (`max_b S(b)`), not to the pair family.\n**[VERIFIED]**\n\n## 2. What a cofinal chain buys — the exact answer to the composition question\n\nThe task asked whether a proof on a cofinal sub-family, composed along the\nladder, feeds the lemma. Split by face:\n\n- **Limsup face (which is the TPC face).** (H-sub-pow) at ONE base `b₀`\n gives `limsup f(n)/ln n ≤ (f(b₀)+K)/ln b₀`; so `K < S(b₀)` on one\n geometric chain forces `limsup < 2`. More generally a cofinal chain with\n two-sidedly pinned steps `a·n_j ≤ n_{j+1} ≤ b·n_j` (`a > 1`) and\n `f(n_{j+1}) ≤ f(n_j) + f(b) + K` gives `limsup ≤ (f(b)+K)/ln a`. Steps\n pinned only from above lose the denominator and give nothing. **[PROVEN]**\n- **Existence face.** No single chain, and no base subset `B`, gives limit\n existence: `limsup ≤ inf_{b∈B}(f(b)+K)/ln b` but `liminf ≥ L` takes the\n inf over ALL `n`, and the two close only when `B` realizes the inf —\n unknowable in advance, so the clean sufficient family is all-bases power\n pairs (Reduction 1) and nothing smaller. **[PROVEN]**\n- **The decisive chains are dataless.** No base `b ≥ 10` has a single\n reachable pair (`b² > 82`), so the chains at the threshold bases 16 and 66\n — the ones whose `K < S(b₀)` would be TPC — are constrained by no\n measurement the corpus owns; the trap-window floor comes entirely from\n bases 2..9. **[VERIFIED]**\n- **The \"fold-step family\" (s a primorial level, t the next prime) does not\n exist inside the candidate.** See §4(i): the fold step is a sub-integer\n multiplier, and the corpus's own domain correction (real bases die at\n `ln C ≥ 2.01`, `import-interp.md` §4) forbids restating the candidate\n down there. **[INFERRED, from verified ingredients]**\n\n## 3. The slice ladder: per-slice traps, and the doubling window\n\nFixing `t₀` and quantifying over `s` (the slice contains its own base chain\n`(t₀^k, t₀)`) gives `limsup ≤ (f(t₀)+K_{t₀})/ln t₀`: TPC-implying iff\n`K_{t₀} < S(t₀)`; improves the proven `β₂ = 4.26645` (`dhr-verification.md`\nrow 1a) iff `K_{t₀} < β₂ ln t₀ − f(t₀)`. Measured floors against both lines\n(full table in the producer):\n\n| t₀ | reachable sup D | S(t₀) | trap | improvement ceiling |\n|---|---|---|---|---|\n| 2 | 0.9694 (custody) | 0.6931 | **closed by data** | 2.2641 |\n| 3 | 0.5810 | 0.4055 | closed | 2.8954 |\n| 4 | 1.0761 | 0.9808 | closed | 4.1228 |\n| 5 | 0.7697 | 0.7340 | closed | 4.3817 |\n| 6 | 1.0415 (custody) | 1.0986 | **OPEN, width 0.0572** | 5.1595 |\n| 7..13 | — | — | all OPEN, wider | — |\n\nTwo headlines fall out:\n\n**The doubling window (t₀ = 2) — the pass's sharpest find.** In constant\nform the slice is `Ĝ(2s) ≤ C₂·Ĝ(s)` and the conclusion is\n`limsup ln G₂(x#)/ln x ≤ log₂C₂`. Custody data already force\n`C₂ ≥ Ĝ(32)/Ĝ(16) = 348/66 = 5.2727 > 4`, so **no provable doubling constant\ncan be TPC-implying — the explicit-constant trap that guards every other\nface of this route is void on the doubling slice**, and a soft proof is not\nexcluded by trap logic. Simultaneously every `C₂ ∈ [5.2727, 2^{β₂} =\n19.2455)` lowers the proven exponent ceiling: `limsup ≤ log₂C₂ ∈ [2.3985,\n4.2665)`. One inequality — a per-doubling growth cap on the twin-gap ladder\n— with a 1.29-nat-wide landing zone in which every point is consistent with\nall data, non-TPC, and an unconditional improvement of the corpus's\nstrongest proven upper bound. **[PROVEN the implication; VERIFIED the\nwindow; the inequality itself is OPEN]**\n\n**The t₀ = 6 slice trap is nearly shut.** Any explicit\n`K₆ ∈ [1.0415, 1.0986)` — 0.0572 nats, floor at the custody-exact (4,6) —\nis TPC-implying, with implied bound 1.9681 at the floor. This does not\ndisplace the general trap window; it records that a single fixed-t\ninequality at t = 6 is already TPC-strength on a margin five times thinner\nthan the general one. **[VERIFIED]**\n\n## 4. Structure first: the exact reason the fold machinery falls short\n\n**(i) The fold step is not an integer pair.** In Ĝ's argument coordinate the\nfold `G₂(p_n#) → G₂(p_{n+1}#)` is multiplication by `p_{n+1}/p_n ≤ 5/3 < 2`\n(max at 3→5; verified at all 21 steps). The candidate's floor `t ≥ 2` —\nforced when real bases died at `ln C ≥ 2.01` — sits strictly above the\none-fold regime, so every admissible pair crosses\n`π(st) − π(s) ≥ π(2s) − π(s) ≥ 1` folds (Bertrand), unboundedly many as `s`\ngrows (the (4,10) pair already spans 10 folds; verified minimum 1, at\n(2,2)). A constant per-fold cap compounds to `exp(#folds)`: no one-fold\ntheorem composes into (H-sub). **[VERIFIED on the range; the Bertrand floor\nis PROVEN]**\n\n**(ii) (H-sub) in fold coordinates is head dominance.** With\n`r_1 = ln G₂(2#)` and `r_i = ln[G₂(p_i#)/G₂(p_{i−1}#)] ≥ 0` — nonnegative\nby the PROVEN (H-mono) — the identity\n`f(st) − f(s) = Σ_{π(s) < i ≤ π(st)} r_i` holds (verified to max dev\n1.78e−15 at all 111 pairs), so (H-sub) is exactly: **the budget spent in the\nwindow `(s, st]` never exceeds the budget of the first `π(t)` folds\nplus K.** The window holds ~`st/ln st` folds against the head's `π(t)`; the\ncandidate is a statement that late fold budgets thin out, which is global\nregularity, not local structure. The three worst pairs decompose cleanly\n(e.g. (4,10): 10-fold window budget 4.4773 vs 4-fold head 3.4012, excess =\nD = 1.0761). **[PROVEN the identity; VERIFIED]**\n\n**(iii) The proven tools point the wrong way.** The copy theorem and\n(H-mono) (folding deletes slots, deletion merges gaps) and the block-ladder\nrecord's disjoint-set super-additivity all give LOWER bounds on `Ĝ(st)` —\nthey prove `D(s,t) ≥ −min(f(s), f(t))` (one line from (H-mono); holds at\nevery pair with strictly positive slack, minimum 0.6931 at (2,3), and the\nmeasured min D −0.2400 sits far above its floor −3.4012 at (7,7)). The\nMirror-Sweep Lemma is symmetry structure within ONE fold\n(alignment `a` and `w−a` degrade equally); it halves fingerprints and\nlocates seam anomalies but carries no magnitude bound and nothing that\ncomposes across folds. No named sub-family of (H-sub) is provable with the\ncorpus's current machinery, and this pass proves none. **[PROVEN the floor;\nINFERRED the assessment]**\n\n## 5. The hunt: no counterexample, no drift\n\nOver all 111 reachable integer pairs (`st ≤ 82`, trusted 22-term ladder,\ncross-checked against `attack-fekete-1d-01`'s headline numbers to four\nplaces):\n\n- **Extremes.** Max `D = 1.0761` at (4,10); the next four are (4,6) 1.0415,\n (4,12) 1.0330, (6,12) 1.0202, (4,16) 1.0033. Min `D = −0.2400` at (7,7);\n 7 of 111 pairs are negative (the super-multiplicative side). **[VERIFIED]**\n- **The (4,t) family** — carrier of both record defects — peaks at t = 10\n (the 37-spike) and every `t ≥ 13` sits below the peak. Slope against\n `ln t`: `+0.0808 ± 0.0957` raw, `−0.0020 ± 0.1143` against the in-pass\n constant-defect null (POW, same primes, same step construction).\n **Consistent with bounded; no drift.** **[MEASURED]**\n- **The doubling family (s,2)**, s = 2..41: `−0.0336 ± 0.0596` against the\n null. Consistent with bounded. **[MEASURED]**\n- **The diagonal (b,b)**, b = 2..9 — the one place an unbounded defect could\n live under a power-log law: reads `−0.5188 ± 0.3966` BELOW the\n constant-defect null (1.3 σ, 8 points), i.e. leaning toward the\n decreasing-defect (super-multiplicative) side. The diagonal remains blind\n past `√82 ≈ 9`, exactly as `attack-fekete-1d-01` reading 7 recorded; this\n pass adds data consistent with \"not growing\" and cannot exclude growth.\n **[MEASURED]**\n\nAn honest \"the defect grows along family F\" would have killed the route; no\nreachable family shows it.\n\n## 6. Trap grading of everything this pass produced\n\nNo explicit K was derived (nothing here proves an instance of (H-sub)), so\nnothing trips the trap. What moved are the WINDOWS, graded per the standing\nrule against `[1.0761, 1.3946)` trusted / `[1.0761, 1.3555)` custody:\n\n| object | window | grade | status vs trap |\n|---|---|---|---|\n| power-pair candidate (Reduction 1) | `ln C ∈ [1.0033, 1.3946)` | floor rests on Wang a(18); ceiling likewise | trap WIDENED 0.3185 → 0.3913 nats |\n| power-pair candidate, custody | `ln C ∈ [0.9694, 1.3555)` | fully custody | 0.3861 nats |\n| single-chain TPC face (base 16 / 66) | any `K < 1.3555 / 1.3946` | custody / trusted | TPC-implying; family dataless |\n| t = 6 slice | `K₆ ∈ [1.0415, 1.0986)` | custody | TPC-implying, width 0.0572 |\n| doubling slice | `C₂ ∈ [5.2727, 19.2455)` | custody floor | **trap-free**: TPC needs `C₂ < 4`, excluded by data; every point improves 4.2665 |\n\n## 7. NOT REACHED\n\n- **No instance of (H-sub) proven, for any family.** The three reductions\n are quantifier surgery on the lemma — they change what must be proven, not\n what is proven. The route's gap is smaller and better lit, still open.\n- **The doubling inequality `Ĝ(2s) ≤ C₂·Ĝ(s)` is posed, not attacked.** It\n is the natural next target (trap-free, prize-bearing); this pass did not\n attempt a proof and does not know whether one is soft.\n- **No new defect data.** The reachable pair set is capped at `st ≤ 82`\n until the ladder grows; the first riser enumeration (61#) remains\n ~146,969× the 43# run.\n- **The diagonal stays invisible past b = 9.** Growth of the true defect on\n the diagonal is neither seen nor excluded; the -01 blind spot stands.\n- **de Bruijn–Erdős Theorem 22 remains unopened**, consistent with the\n bounded reading; nothing here cites its content.\n- **Whether the reductions compose** (e.g. power pairs at prime bases only,\n giving the prime-base threshold `max_q S(q) = 1.2946` trusted) was\n computed in exploration but not carried into the producer; the all-bases\n form of Reduction 1 is the operative statement.\n\n## 8. Sources and reproduction\n\n| artifact | what it carries |\n|---|---|\n| `research/attack-hsub-01.js` | everything above: the three reductions (proofs in the header), the power-pair table, the slice ladder, the fold-budget identity, the traces with in-pass nulls (§§1–6) |\n| `research/attack-fekete-1d-02-lemma.js` | the lemma whose proof Reduction 1 inspects; (H-mono) proven + verified |\n| `research/attack-fekete-1d-01-defect47.js` | the 111-pair table this pass cross-checks; the threshold freeze |\n| `research/history/staging/fekete-1d.md`, `redteam-0820-math.md` §1 | the route's state and the trusted-ladder trap window this pass widens |\n| `research/history/staging/import-interp.md` §§3–4 | the defect identity; the real-base death that forces `t ≥ 2` |\n| `research/history/staging/attack-0c-holesweep.md` §4 | the Mirror-Sweep Lemma assessed in §4(iii) |\n| `research/dhr-verification.md` row 1a | `β₂ = 4.26645028414864191641`, the proven ceiling the doubling window lowers |\n| `research/exact-g2-ladder.js`, `research/import-interp-01-bgt-defect.js` | the two ladders, parsed at run time, input-hashed by the embed |\n\nReproduce with `node research/qc/embed.js --check research/attack-hsub-01.js`;\nthe fingerprint matches as of 2026-08-20.\n"},"research/history/staging/attack-kstar-01-prereg.md":{"lf_sha256":"99c6918bddf77ab273acc2fb9461ae436b6820c548b0addf546bef22391ed1f5","content":"# Pre-registration: K* at the three next doubling steps, predicted before any period walk\n\n\n\n*2026-08-21. Committed ALONE, before the first scan of any of the three\nperiods below was run. Producer of the predictions:\n`research/attack-kstar-01.js` sections A–F (tile-only: fold-recursion tiles\nto 23#, the inclusion–exclusion N_k engine, the smooth HL models M0/M1 —\nno walk over any of the three target periods is executed by those\nsections). The I–E engine was validated first against an independent scan\nengine on the eleven known steps of `attack-doubling-01.md`: K* equal at\nall eleven and the exact window count N_k equal to the scan's run-length\ncensus at all 63 (step, k) cells. Nothing below was measured on the target\nperiods at commit time.*\n\n## The object\n\nK* at doubling step P#→P′# = the longest run of consecutive level-P slots\n(cyclic) all killed by the primes entering (P, P′]; Bridging-Lemma\ncertificate C₂ ≤ K*+1. N_k = the number of windows of k consecutive\nlevel-P slots, per period of P′#, with all k slots killed — an integer,\ncomputed here on the tile alone as\nN_k = Σ_shapes Σ_{J ⊆ window} (−1)^|J| Π_{q∈Q} (q − ν_q(J)),\nν_q(J) = #distinct residues of {x_j, x_j+2 : j ∈ J} mod q (the HL local\ncount of the 2|J|-tuple — W1's ν-case table one level up). K* = max{k :\nN_k ≥ 1}; N_k = 0 at k = K*+1 is the certificate.\n\n## Predictions\n\n**Exact route (integer, falsifiable against the scan census):**\n\n| step | s | Q | predicted K* | cert C₂ ≤ | predicted N_k curve (k = 1..K*+1) |\n|---|---|---|---|---|---|\n| 13#→29# | 15 | 17,19,23,29 | **10** | 11 | 105221160, 29114520, 6942634, 1470674, 285422, 52048, 9456, 1712, 270, 36, 0 |\n| 13#→31# | 16 (chain, the sup row) | 17,19,23,29,31 | **17** | 18 | 3691273410, 1208132640, 357506328, 98048374, 25570726, 6426266, 1601992, 403958, 103170, 25738, 5568, 1180, 296, 80, 18, 6, 2, 0 |\n| 17#→31# | 17, 18 | 19,23,29,31 | **13** | 14 | 2524470300, 607806150, 128515868, 25793636, 5037414, 929548, 167144, 29148, 4894, 710, 138, 22, 6, 0 |\n\nDerived (second difference of N_k): the census of maximal killed runs of\nlength exactly ℓ is hist[ℓ] = N_ℓ − 2N_{ℓ+1} + N_{ℓ+2}. In particular the\nscan must find exactly **2 maximal 17-runs** in the 31# period against base\n13, exactly **2 maximal 13-runs** against base 17, and exactly **6 maximal\n10-runs** in the 29# period against base 13.\n\n**Smooth HL models (scored by crossing − K*):** M0 (iid density product)\ncrossings 17.61 / 23.29 / 18.42; M1 (pairwise singular-series corrected)\ncrossings 12 / 16 / 13. On the eleven known steps M0 overshoots K* by\n+4.02 mean and M1 by +1.00 mean; the model claim carried into this test is\nthat **M1 lands within ±2 of K* at all three new steps** while M0 keeps\novershooting by ≥ +3 at the |Q| ≥ 4 steps.\n\n**Custody expectations (not discoveries):** the scans must re-derive\nG2(29#) = 258 @ 1205437109 (×2) and G2(31#) = 348 @ 8813641451 (×4) from\nscratch, matching `exact-g2-ladder.js`.\n\n## Scoring rule, fixed now\n\n- The exact route PASSES iff the scan's K* equals the predicted K* at all\n three steps and the scan's run census reproduces every predicted N_k\n value (linear check N_k = Σ_{ℓ≥k} (ℓ−k+1)·hist[ℓ]). Any single-cell\n mismatch fails the route and flags one of the two engines defective.\n- M1 PASSES iff |crossing − K*| ≤ 2 at all three steps.\n- The growth-type verdict (the deliverable of task (b)) will be stated\n from the 14-point ladder: I_eff = ln(D·M)/K* per step. The HL first\n moment predicts I_eff bounded (hence K* near-linear in P(2s), the\n alarm's drift structural); a log-type K* requires I_eff to grow like\n P/ln P, i.e. roughly double from P(2s) = 23 to 31. Predicted I_eff at\n the new steps: 1.96, 1.35, 1.76 — inside the eleven-step range\n [0.55, 2.56], not doubled. If the scans confirm the predicted K*, the\n verdict is **near-linear (alarm structural)** and is so pre-registered.\n\n## Stakes\n\nIf confirmed, the certificate at the chain step s = 16 is C₂ ≤ 18 — a\nfactor 3.41 above the true C₂ = 348/66 = 5.2727 and within 1.25 of the\n19.2455 ceiling: the K*-certificate route's crossing, extrapolated at\n0.6881 slope from eleven points to \"P(2s) ~ 69\" by the alarm, would in\nfact be nearly consumed already at P(2s) = 31.\n"},"research/history/staging/attack-roughpair-error.md":{"lf_sha256":"355b328db92152ba35546dccdfa0aee469df26e87fe39e74bc986350330db4bf","content":"# Truth-side vs proof-side on the fourth naming: the empirical error of the rough-pair census is sub-Poisson and 2.6% of the twin count at the top band, so Z2 is not dead on the numbers — and the same run moves the wall off the error term onto the DEPTH, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit\n\n\n\n*(2026-08-23. Staging note; nothing here is integrated into a live document.\nHELD for the end-of-day adversarial roundup. Producer, formally embedded:\n`research/attack-roughpair-error-01.js` (0.8 s; code-sha256 c33973ff...;\nout-sha256 7fd82f32...; `node research/qc/embed.js --check` passes\nbit-honest — code, body and out-sha all match). Calibration marked per\nclaim: MEASURED, HEURISTIC, DERIVED-FROM-MEASURED, OPEN. Nothing here is\nPROVEN and nothing here is a TPC claim. This executes TODO Z2 first move\n(b), the half of it that was not asked: Z2 states what a PROOF needs from\nthe error term; this asks how big the error term actually is.)*\n\n---\n\n## 0. The premise this rests on, flagged before anything else\n\nEverything below reads the census `X(y)` as \"the certificate\", and that\nreading is the **capture identity** `floor_K = T − X(K)` from\n`quadpoint-identity-01.md`. That note is **HELD and has never been\nred-teamed** — Z0's standing debt names it explicitly as load-bearing and\nasks for the proof to be checked line by line. So:\n\n> **UNVERIFIED PREMISE.** `floor_K = T − X(K)`, and with it the statement\n> \"the certificate at (Q, y) is `X(y) < T`\". Not verified in this session.\n> `attack-quadpoint-01.md`, `-02.md` and `stretch-01.md` are HELD and\n> un-red-teamed on the same footing.\n\nWhat was verified here instead, cheaply and directly, is the narrower thing\nthis file actually needs — that its own window engine is the same engine.\nSEC 0 asserts and reproduces, from an independently written sieve loop: the\n25 cited `K*` values, `max K* = 46` at `Q = 9281`, the `K = 0` certificate\nlist `{7, 11, 13, 19, 23, 31, 37, 43}`, `X(full) = 0` at every one of the\n1,227 anchors, and Z1's band means. It **does not** re-verify the identity\n(cited from `attack-quadpoint-03.js`, standing compute rule). If the\nidentity falls, the census measured below is still the census; only its\nreading as a certificate falls with it.\n\n**REFUTED.md collision check: none.** All 83 rows were read. The nearest\nneighbours are row 68 (the one-parameter extinction-density law, refuted as\na *fitting model*) and rows 74/75 (the tail factor and the linear exponent\nrule, both refuted fits). Those are cautions about method, not collisions —\nthey are why every exponent below is quoted with its calibration control\nbeside it and why the split-half is reported even where it fails. No row\ncovers \"the empirical size of the error term of a rough-pair count\".\n\n---\n\n## 1. Disconfirming evidence first\n\n**The error is not small at every anchor, and the certificate must hold at\nevery anchor.** At the crossing depth `u* = 3.5658`, over all 1,206 anchors\nwhere the depth is defined:\n\n- sup `|E|/T = 0.5628`, at `Q = 269`. At `u = 3` the sup is `0.5190`, same\n anchor.\n- band maxima of `|E|/T` at `u*` run `0.5628, 0.4792, 0.2818, 0.3271,\n 0.1949, 0.2054` across B3..B8 — **not monotone**: B6's `0.3271` is above\n B5's `0.2818`, and B8's `0.2054` is above B7's `0.1949`. The band *means*\n fall cleanly; the sup does not.\n\n**One exponent control fails.** The split-half of the `rms(E)` fit at `u*`\ngives low half `0.381 ± 0.051`, high half `0.535 ± 0.032` — a 2.5 s.e.\ndisagreement across the range. The `u = 3` split-half passes (`0.387 ±\n0.073` vs `0.366 ± 0.051`). **So the `u*` exponent is a range summary and\nmust not be quoted as a law**, exactly the failure mode that killed the\nlinear exponent rule (REFUTED.md, refuted twice blind).\n\n**The fit pipeline itself carries a bias.** On synthetic noise of known\n`sqrt(Xmain)` scale the same binning and OLS returns `0.479 ± 0.024`\nagainst a truth of `0.5`. Every measured exponent below inherits that\n≈ `−0.02`.\n\n**Two decades decide nothing asymptotic.** `Q ≤ 10007`, `h ≤ 10⁸`. Every\nnumber below is a range summary. The relevant `ln h` here is about 18; the\nquantities that decide the route go like `1/ln²h`, and 18 is not large.\n\n---\n\n## 2. The main term, its source, and its calibration\n\n`X(y)` is not a sifting function. Inside a stretch, \"prime\" and \"`Q`-rough\"\ncoincide (finality, `stretch-01.md` §1 S2), so `X` is an exact\ninclusion–exclusion of four of them:\n\n> `X(y) = S(y,y) − S(y,Q) − S(Q,y) + S(Q,Q)`\n\nThe main term used is the **classical dimension-2 sifting main term**,\n`|A| · ∏_{p≤z}(1 − ρ(p)/p)` with `ρ(2) = 1, ρ(p) = 2` — Ford's *Sieve\nmethods lecture notes, Spring 2023*, §1.7.2, cited through\n`quadpoint-prior-art.md` §1.1, which is the owning convention for this\nobject. On the wheel-30 channel with `C` openers this is exactly\n`S_main(A;y,y)/C = V₂(y) = ∏_{7≤p≤y}(1 − 2/p)`, and the four-term\ncombination gives the zero-parameter naive form\n\n> `Xnaive(K)/C = V₂(K) − 2·V₂(K)·U(K) + V₂(nR)`, `U(K) = ∏_{i>K}(1 − 1/p_i)`\n\nwhich vanishes identically at `K = nR`, matching `X(Q) = 0` exactly.\n\n**The naive product is the fundamental-lemma main term and is known to be\nbiased at finite `u = ln h / ln y`** by the Buchstab factor `ω(u)e^γ` per\nmember (Ford §1.7.1's `w(c)`; `quadpoint-prior-art.md` §2.2's coordinate).\nApplying it per member gives `Xcorr`, which at full depth is\n`C·V₂(Q)·ρ(2)` with `ρ(2) = e^{2γ}/4 = 0.79305` — the Hardy–Littlewood twin\nmain term. `ω` is integrated here from the delay equation on a `10⁻⁴` grid\nand gated against `ω(2) = 1/2`, `3ω(3) = 1 + ln 2 = 1.69315`, and\n`ω(12) = 0.56146` against `e^{−γ} = 0.56146`; the root of `uω(u) = 2` comes\nout `u* = 3.565847`, `1/u* = 0.280438`, matching the prior-art note's\nscratchpad root to 6 digits (an independent reproduction of a\nscratchpad-grade figure, not a repo number until now).\n\n**Calibration at the one point where the truth of a pair count is known\n[MEASURED]:**\n\n| band | Q-range | n | ΣT | ΣTmain(corr) | T/Tmain | T/Tnaive |\n|---|---|---|---|---|---|---|\n| B3 | [101, 313] | 40 | 1017 | 1006 | 1.0109 | 0.8017 |\n| B4 | [317, 997] | 103 | 7086 | 7036 | 1.0072 | 0.7987 |\n| B5 | [1009, 1499] | 71 | 8332 | 8119 | 1.0262 | 0.8138 |\n| B6 | [1500, 3163] | 208 | 42495 | 42115 | 1.0090 | 0.8002 |\n| B7 | [3164, 5623] | 292 | 101763 | 101524 | 1.0024 | 0.7949 |\n| B8 | [5624, 10007] | 491 | 280128 | 279608 | 1.0019 | 0.7945 |\n\nThe corrected form is right to 0.19% at B8; the naive form misses by\nexactly the `ρ(2)` factor it is supposed to miss by (`0.7945` against\n`1/ρ(2) = 1.2609`). **Only the corrected form is used to price `E`.** The\nnaive form is reported so the size of the fundamental-lemma bias is on the\nrecord: it is 26%, which is two orders of register above the error being\nmeasured, and any proof-side argument that stops at the naive main term is\nalready 26% wrong before it starts.\n\n---\n\n## 3. The measurement: how big is `E = X(y) − Xmain(y)` against `T`?\n\nAt the crossing depth `u* = 3.5658` [MEASURED, 1,206 anchors]:\n\n| band | n | ⟨X/T⟩ | ⟨Xmain/T⟩ | ΣE/ΣXmain | ⟨\\|E\\|⟩/⟨T⟩ | max \\|E\\|/T | χ²/df = ⟨E²/Xmain⟩ |\n|---|---|---|---|---|---|---|---|\n| B3 | 40 | 0.7467 | 0.7903 | −0.0311 | 0.0934 | 0.5628 | 0.627 |\n| B4 | 103 | 0.8734 | 0.8819 | −0.0089 | 0.0759 | 0.4792 | 0.785 |\n| B5 | 71 | 0.9054 | 0.9044 | +0.0056 | 0.0462 | 0.2818 | 0.546 |\n| B6 | 208 | 0.9115 | 0.9115 | −0.0044 | 0.0401 | 0.3271 | 0.665 |\n| B7 | 292 | 0.9209 | 0.9268 | −0.0051 | 0.0298 | 0.1949 | 0.578 |\n| B8 | 491 | 0.9486 | 0.9491 | −0.0012 | 0.0255 | 0.2054 | 0.718 |\n\nThree readings, each MEASURED on this range and nothing more:\n\n1. **The systematic part is a tenth of a percent at the top band and has\n the favourable sign.** `ΣE/ΣXmain = −0.0012` at B8: the census sits\n *below* its zero-parameter main term. The same at every other depth\n tested (`−0.0158` at `u = 2.5`, `−0.0046` at `u = 3`, `−0.0015` at\n `u = 4`, `−0.0013` at `u = 5`, all B8). There is no sign of a systematic\n excess that would eat the margin.\n2. **The scatter is 2.6% of the twin count and falling** — `⟨|E|⟩/⟨T⟩` runs\n `0.0934 → 0.0255` across the six bands.\n3. **The dispersion is at or below Poisson scale, fit-free.**\n `χ²/df = ⟨E²/Xmain⟩` is `0.546..0.785` at `u*`, `0.667..0.803` at\n `u = 3`, and never exceeds `0.931` at any band or depth in the run.\n Below 1 everywhere, but 1 is the WRONG REFERENCE: the matched\n independent-thinning null is binomial and returns `1 - p` exactly with\n `p = Xmain/C`, which is 0.9519 to 0.9808 at `u = 3`, 0.9099 to 0.9609 at\n `u*` and 0.8164 to 0.8792 at `u = 5`\n (`measure-roughpair-null-0829.md` §3a, RED-TEAMED and the identity\n re-derived). Against that reference the dispersion is still below at all 17\n band-depth cells, pooled `z = -5.87`, `-7.09`, `-11.39`, so sub-Poisson\n stands as a direction and its size is smaller than this sentence implies: of\n the 0.711 shortfall at B5, `u = 5`, 0.176 is the normalisation.\n This is the strongest single statement\n in the file because it needs no fit and no exponent.\n\n**And 0 of 1,206 anchors at `u*` — and 0 of 1,216 at `u = 3` — have\n`|E| ≥ T`.**\n\n**The error term barely moves the crossing [MEASURED].** Main-term-predicted\n`K*` band means `3.92, 8.27, 12.10, 16.82, 23.30, 31.15` against measured\n`3.88, 8.42, 12.20, 16.88, 23.34, 31.22`; mean signed difference `+0.09` at\nB8; a fraction `0.902` of B8 anchors lands within 2 of the prediction that\nuses the true `T`. The depth cost is a main-term phenomenon.\n\n---\n\n## 4. The exponent, with its control, and the gap as a number\n\nPipeline: bin the 1,194 anchors with `W ≥ 1000` by `ln W` into 10\nlog-spaced bins, take `rms` per bin, OLS `ln rms` on `ln W`. The identical\npipeline is run first on synthetic noise of **known** scale, because this\ncorpus has been burned by fits at small n.\n\n| quantity | `u = 3` | `u = u*` |\n|---|---|---|\n| measured exponent of `rms(E)` in `W` | **0.405 ± 0.022** | **0.413 ± 0.022** |\n| CONTROL: synthetic `sqrt(Xmain)`-scale noise (truth 0.5) | 0.479 ± 0.024 | 0.483 ± 0.025 |\n| CONTROL: synthetic `Xmain`-scale noise (truth = Xmain's) | 0.823 ± 0.026 | 0.832 ± 0.025 |\n| reference: exponent of `rms(T)` in `W` | 0.812 ± 0.018 | 0.812 ± 0.018 |\n| reference: exponent of `rms(Xmain)` in `W` | 0.839 ± 0.015 | 0.847 ± 0.014 |\n| SPLIT-HALF on measured `E` (low / high) | 0.387±0.073 / 0.366±0.051 | 0.381±0.051 / **0.535±0.032** |\n| **gap: exponent(T) − exponent(E)** | **0.407** | **0.399** |\n\nThe two synthetic classes are cleanly separated by the pipeline, so the\nestimator can tell \"error grows like the square root of the count\" from\n\"error grows like the count\" at this n. The measured value sits in the\nPoisson class and about 3 s.e. below even the Poisson control, consistent\nwith the fit-free `χ²/df < 1`.\n\n**The gap a proof must close, as a number: 0.40 in the exponent.** Over two\ndecades of window width, the true error grows at roughly the square root of\nthe rate the twin count grows. The bolded caveat from §1 applies to the\n`u*` column: its split-half fails, so `0.413` there is a range summary, and\nthe `u = 3` column (`0.405`, split-half consistent) is the one to lean on.\n\n---\n\n## 5. The proof side, where the numbers turn — and the wall moves off the error term\n\nDefine `slack(y) = T / Xmain(y)`: the multiplicative looseness an upper\nbound on `X` may carry at depth `y` and still certify `X(y) < T`. Reported\nagainst the sieve's own coordinate `s = ln W / ln y`, because a bound at\ndepth `y` has to be produced by sifting an interval of length `W`.\n\n| band | n | ⟨lnW/lnh⟩ | min | slack at `u*` | `s` at `u*` | ⟨u⟩ where slack = 3.29956 | ⟨s⟩ there |\n|---|---|---|---|---|---|---|---|\n| B3 | 40 | 0.709 | 0.621 | 1.310 | 2.608 | 2.792 | 1.980 |\n| B4 | 103 | 0.691 | 0.602 | 1.154 | 2.514 | 2.786 | 1.924 |\n| B5 | 71 | 0.669 | 0.595 | 1.118 | 2.419 | 2.770 | 1.855 |\n| B6 | 208 | 0.665 | 0.586 | 1.102 | 2.388 | 2.758 | 1.833 |\n| B7 | 292 | 0.653 | 0.580 | 1.084 | 2.350 | 2.750 | 1.797 |\n| B8 | 491 | 0.647 | 0.575 | **1.056** | 2.317 | 2.747 | 1.778 |\n\nand, at the dimension-2 sifting limit itself:\n\n| band | n | ⟨u⟩ at `s = β₂ = 4.2665` | ⟨Xmain/T⟩ | certificate needs |\n|---|---|---|---|---|\n| B5 | 1 | 5.607 | 3.054 | < 1 |\n| B6 | 43 | 6.098 | 4.032 | < 1 |\n| B7 | 149 | 6.481 | 4.924 | < 1 |\n| B8 | 399 | 6.733 | **5.631** | < 1 |\n\nFour readings:\n\n1. **The slack at the crossing is 1.056 and falling toward 1**\n (`1.310 → 1.056` across B3..B8). At the depth the census actually\n crosses, a proof-side bound may be 5.6% loose and no more, on this\n range, with the allowance shrinking.\n2. **Lichtman-grade looseness suffices only at `s = 1.778`.** Lichtman\n 2025's `π₂ ≲ 3.29956·𝔖` is the standing distance (CITED,\n `quadpoint-prior-art.md` §1.2: a factor 3.3 after 106 years, thirteen\n recorded improvements, the last worth 2.94%). Buying that much slack\n here means going to `⟨u⟩ = 2.747`, which is sifting parameter\n `⟨s⟩ = 1.778` at B8 and falling with the band.\n3. **At the sifting limit the certificate fails on the main term alone.**\n Set `s = β₂ = 4.2665` — comfortable territory for a dimension-2 sieve —\n and `Xmain/T` is already `5.631` at B8 and **rising** across bands\n (`3.054 → 4.032 → 4.924 → 5.631`). No control of the error term reaches\n that; the main term itself is on the wrong side.\n4. **So the certificate lives only in a narrow, shrinking `s`-window.**\n `s = u·(lnW/lnh)`, and the main term permits `X < T` only for `u < u*`,\n so the window is `s < u*·(lnW/lnh)` = `2.317` at B8 measured, drifting\n toward `u*/2 = 1.783` as `lnW/lnh → 0.5` (the band minima `0.621 →\n 0.575` are the twin-`Q` minimal-width stretches, `W = 4Q + 4`).\n [DERIVED-FROM-MEASURED: the identity `s = u·(lnW/lnh)` is arithmetic;\n the numbers in it are measured.]\n\n**This is a correction to Z2's own statement of the wall, and it is the\nmain thing this run buys.** Z2 says: \"beat the twin density in the error\nterm of a rough-pair count on a short interval.\" On this range **the error\nterm is not the binding constraint.** It is sub-Poisson, its systematic part\nis a tenth of a percent, it never reaches `T` at any of 1,206 anchors, and\nits exponent sits 0.40 below the twin count's. What binds is the **depth**:\nthe certificate is a statement about a dimension-2 sifting function at\nsifting parameter `s ≲ 2.3` on an interval of length `h^{0.575..0.65}`,\nwith permitted multiplicative looseness between `1.056` and `3.3` depending\nwhere in that window you stand, and `β₂ = 4.2665` is nowhere near it.\n\nNo claim is made here about the value of any dimension-2 upper-bound sieve\nfunction at `s ≈ 1.8`; that number was not looked up and is not invented.\nWhat is measured is the configuration a proof would have to work in.\n\n---\n\n## 6. Consistency with Z1's reproduction target — checked, no flag\n\nZ1 (`attack-quadpoint-02.md`, HELD) fixed `m6/m7/m8 = 0.050/0.040/0.032`\nand the `K*` growth `12.20 → 31.22` as the target any analytic bound must\nhit. Both are reproduced here twice: once as an **engine gate** (asserted\ndigit-for-digit in SEC 0, from an independently written sieve loop), and\nonce **from the zero-parameter main term alone**:\n\n| band | measured K* | main-term K* | measured K*/pool | main-term K*/pool | ratio |\n|---|---|---|---|---|---|\n| B3 | 3.88 | 3.92 | 0.093 | 0.093 | 1.013 |\n| B4 | 8.42 | 8.27 | 0.075 | 0.074 | 0.983 |\n| B5 | 12.20 | 12.10 | 0.061 | 0.060 | 0.992 |\n| B6 | 16.88 | 16.82 | 0.050 | 0.050 | 0.996 |\n| B7 | 23.34 | 23.30 | 0.040 | 0.040 | 0.998 |\n| B8 | 31.22 | 31.15 | 0.032 | 0.032 | 0.998 |\n\n**No inconsistency to flag.** The two readings agree to 0.2% at B8. An\nanalytic bound that hits the main term computed here hits Z1's target\nautomatically — which also says Z1's target is a weaker test than it looks,\nsince a zero-parameter main term passes it.\n\n**A by-product for the depth law [MEASURED, not a resolution].**\n`quadpoint-identity-01.md` §6 lists the finite-size drift of `ln y*/ln h`\n(band means `0.935 → 0.984` of the candidate `1/(2e^γ)`) as unmodelled. The\nmain term used here — exact partial products in place of the Mertens\nasymptotic, plus the per-member Buchstab factor — reproduces the measured\n`K*` band means to within 1.7% (0.2% at B8), which is where that drift\nlives. That is evidence the drift is a finite-size artefact of the Mertens\nasymptotic rather than structure. The direct check at the level of\n`ln y*/ln h` band means was not run; until it is, this stays a by-product,\nnot a closure of §6's first bullet.\n\n---\n\n## 7. The verdict, stated as the two situations the question posed\n\n- **Not situation (ii).** The route is **not** dead on the numbers. The\n empirical error sits well below `T` at every one of 1,206 anchors, its\n scatter is sub-Poisson, its systematic part is 0.1% at the top band with\n the favourable sign, and its exponent is 0.40 below the twin count's.\n **Z2 should not be closed on truth-side grounds.**\n- **Situation (i), with a correction.** The truth is favourable and the\n obstruction is entirely technique — but the technique that is missing is\n **not** error-term control, which is where Z2 currently points. It is a\n main-term-grade dimension-2 upper bound at `s ≲ 2.3` on an interval of\n length `h^{0.575..0.65}`, with 5.6% of looseness at the crossing.\n- **Net for Z2's first move (b).** The honest answer to \"decide whether any\n machinery reaches that precision class\" is: **the precision class was\n misidentified**. Nothing in sight reaches the *depth* class either, and\n that is a harder statement, not a softer one, because the shortfall is\n now visible in the main term (`Xmain/T = 5.631` at `β₂`) rather than\n hidden in an error term nobody had measured. **The deliverable of this\n frame is the wall's fourth naming with coordinates**, exactly as Z2's own\n alternative anticipated — and the coordinates are `s`, not `E`.\n\nNo route is opened. No TPC claim. Route B closed; `ρ(2)` adverse; occupancy\non this range was never in doubt.\n\n---\n\n## 8. NOT REACHED\n\n- The capture identity is not verified here (Z0's debt stands).\n- No value for any dimension-2 upper-bound sieve function at `s` in the 1.8 to 2.3 range\n was obtained; the literature was not searched for one this session, and\n `SEARCH-CONVENTIONS.md` discipline would be owed before quoting one.\n- Nothing past `Q = 10007`. The `u*` exponent's split-half failure would be\n the first thing a decade extension resolves.\n- The sub-Poisson dispersion (`χ²/df` as low as 0.289) had no mechanism\n offered here. THE CONTROL RAN 2026-08-29\n (`measure-roughpair-null-0829.md`, HELD, red-teamed): the matched\n independent-thinning null returns `1 - p`, not 1, and neither guess above is\n needed. A second null that gives each prime an exact kill count in the window\n predicts 0.33 to 0.56 and the measured value sits 1.23 to 1.42 times ABOVE\n it, so the mechanism is elementary equidistribution of residue classes in an\n interval and it over-explains the deficit; the residual excess is\n unattributed and prime-prime dependence is a candidate, not a\n demonstration.\n- `E` was not split by side (A/B), carried from v1's NOT REACHED, and the\n QR refinement (Z3) stays unused.\n- No prereg. Nothing here is a blind test; the depth-law forecast test\n (`y* ≈ 336` at 31607) is untouched.\n\n---\n\n*Producer and custody: `research/attack-roughpair-error-01.js`, embedded,\n`--check` bit-honest. CITED, never recomputed: the capture identity\n(`attack-quadpoint-03.js`), the 25 `K*` values and Z1's band means\n(`attack-quadpoint-01/02.js` embedded OUTPUT, asserted here as an engine\ngate), Lichtman 2025's 3.29956 and Ford's §1.7.2/§1.7.1 through\n`quadpoint-prior-art.md`, `β₂ = 4.2665`, and the prior-art scratchpad root\n`3.565845`. History layer: process record, staging. See\n`research/history/CHANGELOG.md` for the corpus rule.*\n"},"research/history/staging/c2prime-refit-22.md":{"lf_sha256":"1ed07f6258acee6cc233187e162e07397ed60e65b864e3417b48913503d70c56","content":"# The 22-term refit, and why c₂′ drifts: the control drifts the same way, and ten points cannot measure the rate\n\n\n\n*(2026-08-28. Producer `research/history/staging/c2prime-refit-22.js`, embedded\n(0.1 s, `--check` passes, 12 custody guards). Every number below is in that\nfile's OUTPUT block. Scratchpad-grade: no ensemble nulls are run here, and the\nspreads quoted are the control column's own sliding-window distribution, not\np-values. TODO item 1c, first move.)*\n\n## 0. First: the brief is partly wrong, and the corrections come before the work\n\nThree premises of item 1c do not survive contact with the repo.\n\n**The 22-term refit is not entirely undone.** `exponent-control.md` §5 was\nalready refit on the trusted A144311 ladder on 2026-08-21 (script S11): raw\nx-frame 1.777 ± 0.029, θ-frame 1.647 ± 0.021, control-corrected central 1.498,\nbracket 1.3 to 1.8. Those are the file's headline numbers and they are 22-term\nnumbers today. What was still at ten terms is narrower and is what this file\nrefits: the §2 model-discrimination table for G₂ (quoted again in §7 item 1),\nthe §4 structural column Qg, and the §6 G₂ margin trend.\n\n**c₂′ is not a coefficient in a fitted exponent model.** It is a per-x ratio\ncolumn, c₂′ = G₂(x#)/(m·lnD) with D = ∏_{2\n\n**TODO item 8(c), \"tighten 2·3^k (~30× slack)\". 2026-08-28.\nScript: `research/history/staging/comb-discrepancy-tight.js`, 27.7 s, all asserts\npassed. SCRATCHPAD-GRADE: the script carries no embedded OUTPUT block, so every\nnumber below is quoted as a measurement of a finite deterministic quantity, with\nthe command that produced it, and not as a custody artifact.**\n\n```\nnode --max-old-space-size=4096 research/history/staging/comb-discrepancy-tight.js\n```\n\n## 0. What is open, and what failed\n\n**The engine channel is where the item lives, and it is the channel that moved\nleast.** The certificate engine (`natal-cap-28-analytic-certificate.js` RESULT 1)\nprices *dilated* combs, so it needs a constant uniform over the dilation family.\nThe construction proven below, maximised over that family, is **worse** than the\nstanding seeded transfer of `level-ledger-tight.md` §6c: 91.79 against 26.68 at\n@17, a factor 3.44 in the wrong direction. The grouping gain is a property of the\nα = 1 classes, not of the family. Recorded as a negative.\n\n**No exponent moves.** Every bound here still costs a factor near 3 per added\nmid in the worst case; the measured per-fold step of the blocked bound at fixed\nY is about 2.4, and of the sharp constant about 1.82. Nothing here bears on\n`REFUTED.md`'s discrepancy-theory rows, which are closed as routes; this is a\nfinite lemma's constant and stays that.\n\n**The \"~30×\" in the item's title is now an exact number and it is level-dependent,\nnot a constant.** The slack 2·3^k / D_x reads 2.68 / 4.29 / 6.61 / 12.36 / 16.41 /\n28.99 / 53.64 at @7..@29. The 30 that item 8(c) quotes is the @23 value and it is\ngrowing, so \"the slack\" is not a single factor to be taken back once.\n\n**Not evaluated.** The sharp per-dilation constant at @19 and @23 (the exact range\nper dilation) is not computed: at @23 that is 14.9 M candidate steps per dilation\nagainst about 1000 dilations. The blocked bound is used instead, so the engine\nnumbers in §5 are floors.\n\n## 1. The lemma as proven, and where the 2 and the 3^k come from\n\nProducer: `research/natal-cap-25-excess-law.js` header, lines 25-29, restated in\n`certificate-engine.md`'s status table and cited in `level-ledger-tight.md` §6c.\n\nThe natal comb at level x is\n\n C_x = { r : r ≡ 11 or 17 (mod 30); r ≢ 0 and r ≢ p−2 (mod p) for every mid 7 ≤ p ≤ x },\n\nwith W = x#, N = 2·∏(p−2), density ρ = N/W, and k = #mids = π(x) − 3.\n\n**Comb Discrepancy Lemma (PROVEN).** For every integer s and every integer ℓ,\n|#(C_x ∩ [s, s+ℓ)) − ρℓ| ≤ 2·3^k.\n\n*Proof, reconstructed.* Expand ∏_p (1 − [r≡0] − [r≡p−2]) into 3^k signed terms,\none per pair (d, c) with d | M = ∏mids squarefree and c a choice from {0, p−2}\nfor each p | d, with sign (−1)^{ω(d)}. Each term, intersected with one of the two\nunit classes mod 30, is a single arithmetic progression of modulus 30d by CRT,\nso the comb's indicator is a signed sum of 2·3^k progression indicators. An AP\ncount in an interval is off its density share by less than 1. The shares sum to\nρℓ exactly, since Σ_{d,c} (−1)^{ω(d)}·2/(30d) = (2/30)·∏(1 − 2/p) = ρ. ∎\n\n**So the 2 is the mod-30 unit pair and the 3 is the three terms 1, −[≡0],\n−[≡p−2] per mid.** The 2 is *not* the two excluded classes: those are the second\nand third term inside each factor of 3. The exponent is k = π(x) − 3, not\nπ(x) − 1, because 2, 3 and 5 are already spent on the mod-30 pair, which is why\n`level-ledger-tight.md` §6c found this bound the tighter of the two to start with.\n\n## 2. The constant has an exact optimum, and it is computable\n\nWrite G(u) = #(C_x ∩ [0,u)) − ρu on integers u ∈ [0, W]. G is W-periodic, since\nG(0) = G(W) = 0.\n\n**Theorem A (Sharp Window Constant, PROVEN).** For all integers s, ℓ,\n#(C_x ∩ [s, s+ℓ)) − ρℓ = G(s+ℓ) − G(s), hence\n\n sup over integer s, ℓ of |#(C_x ∩ [s, s+ℓ)) − ρℓ| = max G − min G =: D_x,\n\nand the supremum is attained with ℓ ≤ W: take s at the argmin and ℓ reaching the\nargmax, or the reverse for the negative sign.\n\nTheorem A is one line and it says the lemma's constant is not open-ended. D_x is\nthe floor under every bound of this shape, so the only questions left are its\nvalue and whether a formula for it exists.\n\n**Theorem B (Blocked Legendre Bound, PROVEN).** Group the expansion of §1 by the\ndivisor d. For fixed d all 2^{ω(d)} class terms carry the same sign (−1)^{ω(d)},\nand their supports are distinct residues mod d, hence disjoint. They therefore\nmerge into a single periodic set A_d of period 30d carrying exactly 2^{ω(d)+1}\npoints, and\n\n D_x ≤ Σ_{d | M} range(A_d),\n\nwith range taken over integer u. More generally, for any subset Y of the mids\nkept unexpanded,\n\n D_x ≤ Σ_{d | M∖Y} range(A_{d,Y}),\n\nwhere A_{d,Y} has period 30·W_Y·d and N_Y·2^{ω(d)} points, N_Y = 2·∏_{p∈Y}(p−2).\n\nTwo consequences worth stating. First, **bounding each block's range by its own\npoint count 2^{ω(d)+1} returns 2·3^k exactly**, since Σ_{d|M} 2^{ω(d)+1} = 2·3^k.\nThe standing lemma *is* the trivial per-block bound, and the whole of the\navailable gain is the difference between a block's point count and its actual\nrange. Second, the bound costs N_Y·3^{k−|Y|} point-operations, not O(W), so it is\nevaluable at levels no tile enumeration reaches, and it is exact when Y is the\nwhole mid set.\n\nTheorem B works entirely in the original coordinate and never rescales an\ninterval, which is why the integer-u range is the right quantity. That\ndistinguishes it from `level-ledger-tight.md` Theorem 2, whose sub-intervals have\nrational endpoints and which therefore needs the continuous-u range; the two\ndiffer by up to one block density (1.6 against 1.5333 at y = 5).\n\n## 3. Avenue (c), the maximal empty run, is a lower bound and it is weak\n\nA run of length g with no comb member gives a window with count 0 against share\nρg. The quantity that run measures is the maximal *empty* run, one less than the\nmaximal member-to-member gap g_max, since a window of length g_max contains one\nmember and not none: at @7 the comb is {11, 17, 41, 71, 101, 107, 137, 167, 191,\n197}, the maximal gap is 30 and the maximal empty run is 29. So the valid bound\nis **D_x ≥ ρ·(g_max − 1)**, exactly. Measured: ρ·(g_max − 1) = 1.381 / 2.299 /\n2.934 / 4.509 / 5.596 / 7.676 at @7..@23 against D_x = 2.238 / 4.195 / 8.165 /\n13.102 / 29.619 / 50.295; at @29 the corrected value is one ρ (0.0221) below the\n9.425 the ρ·g_max form gives and it is not re-derived here. The maximal empty run\nexplains 61.7% of D_x at @7 and about 11.5% at @29, falling at every level. As a\nroute to the constant it is dominated; as a certificate that D_x cannot be small\nit is cheap and it holds. The overstatement is one ρ and the slack is large, so\nthe printed inequality held numerically at every level and no downstream number\nmoves; the derivation and the percentages do.\n\n## 4. The table\n\nMeasured, `comb-discrepancy-tight.js` Parts 1, 2, 4. \"cap-25 maxE\" is the\nembedded grid maximum from `natal-cap-25-excess-law.js`'s OUTPUT block, which is\na maximum over a scour-length grid and so is a *floor* under D_x; the script\nasserts that ordering at all six levels where it exists.\n\n| level | k | 2·3^k | ET(x) | blocked Y≤5 | blocked Y≤13 | blocked Y≤19 | **D_x (sharp)** | cap-25 maxE | 2·3^k / D_x |\n|---|---|---|---|---|---|---|---|---|---|\n| @7 | 1 | 6 | 9.919 | 3.3 | - | - | **2.2381** | 1.2 | 2.68 |\n| @11 | 2 | 18 | 26.590 | 7.4 | - | - | **4.1948** | 2.7 | 4.29 |\n| @13 | 3 | 54 | 64.948 | 18.3 | 8.2 | - | **8.1648** | 5.9 | 6.61 |\n| @17 | 4 | 162 | 162.044 | 41.0 | 17.1 | - | **13.1021** | 10.1 | 12.36 |\n| @19 | 5 | 486 | 398.659 | 110.3 | 49.0 | 29.6 | **29.6189** | 21.5 | 16.41 |\n| @23 | 6 | 1,458 | not run | 247.7 | 110.1 | 61.2 | **50.2952** | 34.4 | 28.99 |\n| @29 | 7 | 4,374 | not run | 578.9 | 249.4 | 140.9 | **81.5492** | - | 53.64 |\n| @31 | 8 | 13,122 | not run | 1,333.0 | 555.6 | 328.8 | out of reach | - | - |\n| @37 | 9 | 39,366 | not run | 3,246.5 | 1,384.6 | 832.5 | out of reach | - | - |\n\n**Sharpest at every level where it exists: D_x**, by Theorem A, and there is\nnothing below it. Where D_x is out of reach the sharpest is the blocked bound at\nthe deepest affordable Y: 328.8 at @31 and 832.5 at @37 with Y ≤ 19, gains of\n39.9 and 47.3 over 2·3^k. The largest level with an exact answer is **@29:\nD_29 = 81.5492 against 2·3^7 = 4374, a factor 53.64, with the blocked Y ≤ 19\nbound at 140.9, itself 1.73× above sharp.**\n\nRemaining slack of the best *formula-free but computable* bound against sharp:\n1.00× at @19, where Y ≤ 19 is already the whole mid set, 1.22× at @23, 1.73× at\n@29. Remaining slack of the\nsharp constant against the strongest lower bound available, ρ·(g_max − 1): 5.3×\nat @19, 6.5× at @23, 8.7× at @29, widening.\n\n**Avenue (b), Erdős-Turán with the exact Fourier coefficients, loses on both\naxes.** ET(x) is *worse* than the standing lemma up to @17 (ratios 0.60, 0.68,\n0.83, 1.00) and only ×1.22 better at @19; its per-fold step is about 2.45 against\n3, so it crosses late, and it costs O(W) to evaluate against the blocked bound's\nN_Y·3^{k−|Y|}. This is the natal-object analogue of `level-ledger-tight.md`\n§4(c), which found the same shape on the twin tile and the same L¹ floor beneath\nthe whole family. Consistent with that file; it is not independent evidence.\n\n**Growth, measured, not derived.** D_x steps by 1.874, 1.946, 1.605, 2.261,\n1.698, 1.621 over @7 → @29, geometric mean 1.8208 against √3 = 1.7321. That sits\nabove √3 in the same direction and by about the same margin as\n`level-ledger-tight.md`'s R\\*(19) surprise, and for the same unseparated reason:\nD_x is a maximum, and no closed form for it is offered here.\n\n**A measured regularity with no proof attached.** sup|G| / D_x reads 0.5106,\n0.5046, 0.5020, 0.5011, 0.5004, 0.5002, 0.5001 at @7..@29, so the anchored\n(one-endpoint) channel is half the two-endpoint one to four digits and\ntightening. G is antisymmetric about its own centre to that precision. No\nderivation is offered and none was attempted; flagged as measured only.\n\n## 5. What the tighter constant buys the certificate engine\n\n`natal-cap-28-analytic-certificate.js` RESULT 1 certifies a prime q, of index\nj = idx(q), when 2^{j+1}·(2·3^k + 1) ≤ ½·(main − s). The 2^{j+1} is two sides\ntimes 2^j divisors d | P_j, and each term is a count of the comb dilated by\n(q·d)^{−1}. Replacing the universal 2·3^k by a per-dilation blocked bound gives\n\n | cap₂(q) − main | ≤ Σ_{sides} Σ_{d | P_j} ( B(α_{side,q,d}) + 1 ),\n\nwhich is the same theorem with a computed constant per term. Running cap-28's own\ncertification test against it, with Σcap₂ taken from cap-28's embedded K0 anchors\nand the old counts and shares asserted to reproduce:\n\n| level | certified primes, old | share of Σcap₂, main-term mass, old | certified primes, new | share, main-term mass, new | mean per-term constant, max over certified primes |\n|---|---|---|---|---|---|\n| @17 | 1 | 9.69% | **4** | **28.14%** | 17.4 against 2·3^4 = 162 |\n| @19 | 3 | 17.37% | **6** | **27.97%** | 47.9 against 2·3^5 = 486 |\n| @23 | 6 | 22.88% | **9** | **29.40%** | 112.1 against 2·3^6 = 1458 |\n\nBoth column labels say what the producer computes, and neither is the thing its\nold label named. The share column accumulates `cap = main + s` with\n`main = (A+B)·NW·Pj`, the analytic main term, not the exact cap₂: on exact cap₂\nmass the new share at @17 is **28.21%**, and the old column is 9.693% either way,\nwhich is why the custody assert against cap-28's 9.69% passes and hides the\ndifference (`redteam-0828-engine.md` §6.4, exact cap₂ counts). The constant\ncolumn is `errNew/2^{j+1} − 1`, an average over the `2^{j+1}` terms, so it is the\nmaximum over certified primes of the *mean* per-dilation constant; at @17 that\nmaximum is 17.41, at `q = 23`, while the maximum single-dilation range is 18.369,\nat `q = 31`. Both are far below `2·3^4 = 162` and the reading is unchanged.\n\nThe old shares reproduce cap-28's embedded 9.69 / 17.40 / 22.93% to 0.05\npercentage points, which is the custody check on the main-term arithmetic; the\nold counts 1 / 3 / 6 are asserted exactly.\n\nRead this at the right register. The certified head quadruples in count at @17,\nfrom 1 to 4, doubles at @19, and moves from 22.88% to 29.40% at @23. cap-28's own next-step\n(iii) predicted that a proven sub-3^k bound would push the certified share \"past\n50% at @29+\"; at the three levels reachable here it does not reach 50%, and the\ngain at @23 is the smallest of the three. The counts are floors: at @19 and @23\nthe per-dilation constant used is the blocked bound with Y ≤ 13, above the sharp\nper-dilation range, and at @17 alone the two coincide. Nothing here touches the\nengine's two unproven ingredients, so the engine's outputs keep the status of\ntheir weakest input, which remains the Buchstab Transfer Hypothesis, HEURISTIC.\n\n## 6. Status of item 8(c)\n\n**Partly answered, and not in the channel that pays.** For the α = 1 window\nchannel the constant is now exact at @7..@29 and computable at any level, with a\ngain over 2·3^k that grows rather than staying flat. For the dilation-uniform\nchannel, which is the one the certificate engine consumes, the best proven bound\nis still `level-ledger-tight.md` §6c's 3^{k−4}·26.682612, a constant gain of\n6.07, and the construction here does not improve it. What the engine actually\ngains, §5, comes from pricing each of its own finitely many dilations rather than\nfrom a better uniform constant, and that is a computation at each level, not a\nformula.\n\n## Defects noticed in passing\n\n- `certificate-engine.md`'s status table gives the Comb Discrepancy Lemma the\n scope \"every Legendre term is off its share by at most 2·3^k\". Each term is off\n by less than 1; the sum of the 2·3^k terms is off by at most 2·3^k. Wording,\n one cell, no downstream number affected.\n- `natal-cap-28-analytic-certificate.js`'s embedded OUTPUT at @13 prints\n \"agg NaN%\" for the certificate line, a 0/0 when cert.n = 0. Cosmetic.\n\n## What would falsify this, and whether that check has run\n\n- **Theorem A is false if some window beats D_x.** The check is the assertion\n that cap-25's six embedded grid maxima all sit at or below D_x. RUN, passes at\n all six.\n- **Theorem B is false if the blocked bound ever falls below D_x.** The check is\n the identity blocked(Y = all mids) = D_x, since a Y that keeps everything has\n the single block d = 1. RUN and asserted to 1e−9 at @7..@23; not run at @29,\n where W_Y = W is not enumerable by that path.\n- **The census could be wrong, making every D_x wrong.** The check is that the\n ascending pass counts exactly N = 2·∏(p−2) members. RUN, asserted at all seven\n levels.\n- **§5's arithmetic could be wrong.** The checks are that the old certified\n counts reproduce cap-28's 1 / 3 / 6 exactly and the old shares reproduce\n 9.69 / 17.40 / 22.93% within 0.6 points. RUN, both pass.\n- **The new counts in §5 could be capped rather than real.** The check is whether\n the divisor walk stopped on a certification failure or on the search cap\n JCAP. RUN: it stopped on a failure at all three levels, so JCAP was not\n binding.\n- **Unchecked, and flagged as such.** No independent re-derivation of D_x by a\n second method exists at @29; the α = 1 pass is the only witness there. At\n @7..@23 a second, independently written pass reproduces every D_x, the census\n and the sup|G|/D_x column (`redteam-0828-engine.md` §6.1), and it also\n reproduces the §5 @17 row with exact cap₂ counts and sharp per-dilation ranges\n (§6.4 there); @29 was outside that pass's compute budget too. The\n sup|G| / D_x → ½ regularity of §4 has no proof and no control. The per-dilation\n §5 constants are not compared against the sharp per-dilation ranges at @19 and\n @23, so the true engine gain at those two levels is larger than reported by an\n unmeasured amount.\n"},"research/history/staging/derive-0904-L7-transfer.md":{"lf_sha256":"c60a250dfa9e633058aeb0ae7f31f2b24eb79c2419ca90f8a2a0a41c23d16712","content":"# The one-class to two-class transfer G₂ ≪ g·(ln x)^A (legal target L7): both transfer mechanisms the corpus holds are already priced, and neither reaches it\n\n\n\n> **RIDER 2026-09-04 (orchestrator, from `redteam-0904-item0.md`).** The\n> union-bound argument and the CRT count are CONFIRMED on independent code.\n> Three rewordings: §2's \"certifies nothing in the period average\" needs \"and\n> hence not at every position\" (the certificate is ≤ 0 at 25,386 of 30,030\n> positions at x = 13, the period mean exact); §3's \"exactly the\n> Brüdern–Fouvry decomposition\" reads \"reduces to it once the hole indicator\n> is replaced by a sieve minorant\", the Ford–Halberstam substitution step\n> that `sift-limit-attack.md` §7b(1b) owns; and the price 2(1+√e) = 5.2974 is\n> the forced-equal-level constant, the corpus's live figure being\n> K_BF = 5.158064680330 at free levels (reproduced to twelve digits), so read\n> \"5.158 at free levels, 5.297 with the levels forced equal\", both above β₂.\n> §6's \"no third mechanism excluded\" is honest but incomplete: weighted sieves\n> with Chen switching on the hole set are already priced and closed at\n> `sift-limit-attack.md` §4.2. Mechanism 2 is dead as a route to L7 by the\n> growth half's second pass; L7 stays OPEN as a statement.\n\n*(2026-09-04, orchestrator's note, staging, HELD like every staging note. One\nproducer, `research/history/staging/derive-0904-L7-transfer.js`, embedded via\n`qc/embed.js`, which enumerates the periods at x = 7, 11, 13 and checks §2's\nCRT count and budget; every other number is quoted from the record it names. Calibration per `CLAUDE.md`.\nWritten while the day's four agents ran, on a target the G₂ object read listed\nas legal and unasked: `object-g2-read-0829.md` §4b row L7 and §8 Q3.)*\n\n## 0. What is open first\n\nL7 is still open. Nothing here closes the statement `G₂(x#) ≪ g(x#)·(ln x)^A`;\nwhat this note settles is narrower: the two ways the corpus could try to\nDERIVE L7 from the one-class bound both reduce to objects already priced, and\nboth prices are above β₂ or dead. So L7 is not a cheap corollary waiting to be\nwritten; it is the κ = 2 positivity problem wearing one-class clothing. That\nis DERIVED for the two mechanisms named and for no other; a third mechanism,\nif one exists, is not excluded by anything here.\n\nThe truth-side reading is unchanged: three independent routes say the second\nclass costs one logarithm (`G2-STATE.md` §3d, MEASURED and INFERRED), which is\nthe conjectural A = 1. Truth-side evidence is not a mechanism.\n\n## 1. The statement and why it is legal\n\n`g(x#)` is the one-class Jacobsthal function of the primorial, `g(x#) ≪ x²`\nby Iwaniec 1978 with an inexplicit constant (`covering-dive.md`, entry point 2;\nVaughan 1977 has `x^{2+ε}`). `G₂(x#) ≥ g(x#)` pointwise is PROVEN and one\nline (twin slots are a subset of the holes). L7 asks for the reverse\ncomparison up to a fixed power of `ln x`. If it held, `G₂ ≪ x² ln^A x`, which\nis exponent 2 + o(1): below the proven 4.26645, above the TPC line at\nexponent 2 with constant below 1 (`ZONE-POSTULATE.md` §2, the tile form\n`G₂ < x′² − 2`), so verdict (i) on the wrong-direction audit's scheme, as the\nobject read records. No `Q-` id posed it before today; `REFUTED.md` closes no\nrow of that name.\n\n## 2. Mechanism 1: the union bound over the second class, vacuous in the period average from x = 11 [DERIVED, exact arithmetic]\n\nThe natural transfer: in a window of length `H`, the one-class bound gives\nholes; a hole `h` fails to be a twin slot only if `h + 2` is not a hole, i.e.\nonly if `h ≡ −2 (mod p)` for some prime `3 ≤ p ≤ x` (the class `2` never\nkills, since every hole is odd and so is `h + 2`; this is Fact B's class pair\n`{0, −2}`, `G2-STATE.md` §4a). Bound the failures by the union over `p`.\n\nOver the full period `W = x#` the count is exact by the Chinese remainder\ntheorem: the holes are the residues coprime to `W`, and those in the class\n`−2 (mod p)` number `φ(W)/(p − 1)`, because `−2 ≢ 0 (mod p)` for odd `p`\nleaves `p − 1` admissible classes at `p` and the other primes are unaffected.\nSo the union bound's budget, as a fraction of the holes, is\n\n B(x) = Σ_{3 ≤ p ≤ x} 1/(p − 1).\n\nExactly: `B(7) = 1/2 + 1/4 + 1/6 = 0.9167`, `B(11) = 0.9167 + 1/10 = 1.0167`,\n`B(13) = 1.1000`. The budget passes 1 at `x = 11`. From there the union bound\ncertifies nothing in the period average, and a bound that is vacuous on\naverage over positions cannot be non-vacuous at every position. The corpus's\ncovering economy reaches the same wall in its own accounting, `Σ 2/p` crossing\n1 at `x = 13` with `β_pure` diverging like `7.182 lnln x`\n(`REFUTED.md`, the covering-economy row; `sift-limit-attack.md` §7). The\ndivergence is the point: `B(x) ~ lnln x`, so the failure is not a constant\nthat a better window would recover; the crude transfer loses a factor that\ngrows.\n\nInclusion–exclusion over the same classes is not a repair. Written out, it is\nthe dimension-2 sieve on the pair `(h, h + 2)`, which is the theorem the\nprogramme already has at `β₂`.\n\n## 3. Mechanism 2: the one-class sieve run on the set of holes is the vector sieve, and its price is on record [DERIVED, prices quoted]\n\nThe second way to read L7: fix the holes `h` of a window as a set `A`, and\nsieve the shifted set `A + 2` by one class per prime. That is a κ = 1 sieve on\na set whose distribution in residue classes is not that of the integers: its\ndivisor counts `|(A + 2)_d|` are counts of holes in the class `−2 (mod d)`,\nwhich is a two-class-type count, and their remainders are the tile's own\ndiscrepancies at modulus `d`, not the `|r_d| ≤ 1` of an interval of integers.\nSo the one-class sieve on `A + 2` has a level of distribution set by the\ntwo-class remainder, and the linear sieve's positivity at `u > 2` is then\npaid twice, once per class. This is exactly the Brüdern–Fouvry vector-sieve\ndecomposition of the two-class condition into two coupled linear sieves, which\n`sift-limit-attack.md` §7b prices against the source: joint positivity at\n`1 + √e = 2.6487` per component, coupled component levels `D₁D₂ ≤ H`\nunconditionally, landing at `2(1 + √e) = 5.2974`, above `β₂`. Its two\nside-condition re-splits are CLOSED (`REFUTED.md`, the two Brüdern–Fouvry\nrows). Decoupling the levels needs signed cancellation of the bilinear\ninterval remainder uniformly in window position, the sup-over-positions law;\nthat family (REC, RML(α)) was ruled a truth gap on 2026-08-30 at rung\nderived-and-red-teamed-once (`REFUTED.md`, the ρ maximal law row), and a\nsecond adversarial pass on its growth half is running today\n(`redteam-0904-floor-growth-2.md`, HELD). If that pass breaks the growth half,\nmechanism 2 reopens as a proof gap at the decoupled price `1 + √e ≈ 2.649`,\nstill above 2 and hence still legal; if it survives, mechanism 2 is dead as a\nroute to L7.\n\n## 4. What is left of L7, and what it is not\n\n- **L7 as a statement**: legal (i), OPEN, no mechanism in the corpus. Not a\n corollary of the one-class theorem by either transfer.\n- **What a proof would have to be**: an argument that keeps the class\n positions or the pair structure through the first discard point, which is\n the same requirement `object-g2-read-0829.md` §4a states for any exponent\n below `β₂`. L7 does not evade killer 1; it restates it with a smaller ask.\n- **What L7 is not**: not TPC-strength (exponent 2 + o(1) with an inexplicit\n constant says nothing about `G₂ < x′² − 2`), and not novel to pose: the\n one-class analogue of the sharp question is Erdős's problem on\n `Y(x) = o(x²)` (`covering-dive.md`, entry Q1), open with a bounty.\n\n## 5. What this note contradicts in the live layer\n\nNothing. `object-g2-read-0829.md` §4b row L7 says \"not asked\"; after this\nnote it is asked and PARTIAL, which is the `Q-` id above. `TODO.md` item 0's\n`Ledger:` line needs the id added (orchestrator, at integration).\n\n## 6. What would falsify this note, and whether that check ran\n\n- A transfer argument that is neither the union bound nor a sieve on the hole\n set. None is known to this note; not searched in the literature beyond the\n corpus's own `recon-0828-jacobsthal.md` and `covering-dive.md`, which report\n no published two-class upper bound at any exponent. Not run.\n- An error in the CRT count `φ(W)/(p − 1)`: RAN, the producer's OUTPUT block.\n Every per-prime count is EQUAL to `φ(W)/(p − 1)` at x = 7, 11, 13, and the\n budget reads 0.9167, 1.0167, 1.1000, passing 1 at x = 11 (VERIFIED). The\n same block prints the exact fraction of holes that are not twin slots\n (0.6875, 0.7188, 0.7422), so the bound exceeds its own target from x = 11.\n- The vector-sieve price `5.2974` or the side-condition closures being wrong:\n those are the records' claims, quoted, not re-derived here.\n"},"research/history/staging/engine-0830-at43-bigint.md":{"lf_sha256":"fe2fff95ebc754eb6ec5ee326998c3e42c434f76fd0e9bc0b4b68e17974dac78","content":"# The @43 arithmetic ceiling: which paths leave 2^53, a BigInt-promoted K-30 engine gated against the record, and the price of the sixth residual collapse\n\n\n\n*(2026-08-30. Staging note; nothing here is integrated into a live document.\nHELD. Producer, formally embedded with both streams:\n`research/history/staging/engine-0830-at43-bigint.js`. Calibration marked per\nclaim: PROVEN, VERIFIED (exact computation), MEASURED, HEURISTIC, OPEN,\nREFUTED. Every figure below sits in that producer's OUTPUT block or is quoted\nfrom `research/natal-cap-37-at41-march.js`'s embedded OUTPUT by line; nothing\nis transcribed by hand. This note edits no other file.)*\n\n---\n\n## 0. What is open first\n\n- **beta(43) is not measured.** Nothing below scores the forecast on record.\n The producer can run @43 (modes `shard` and `combine`, positions in BigInt)\n and was not asked to, because the measured price is far above the 3.5 h\n rule of the brief: 579 h wall on this machine's eight shards, MEASURED by\n extrapolation from a slice (section 4), against the record's 6.035 h for\n @41. The decision the brief wanted is therefore made by the price, not by\n a result.\n- **S(41) still has one witness.** The record says so\n (`natal-cap-37-at41-march.js` reading 5, 10(a)); this note reproduces 0.248%\n of the @41 tile on the new path and nothing more of it. A full second\n march of @41 is 6 h of eight cores and was not run.\n- **The per-cell cost at @43 is 2.23x the @41 cost and is not decomposed.**\n The cursor scan is the obvious suspect (3.12 scour cursor entries per\n block cell at @43 against 0.53 at @41, printed in PART 3) and the record's\n own reading names the ring-bucket sieve as the fix that was not built; the\n number here is a MEASURED ratio on interleaved equal spans under a shared,\n heavily loaded machine, not a profile.\n- **No box conversion rate exists on disk.** `bench/README.md` carries laptop\n reference numbers and no box result file; the plan in section 6 prices in\n laptop core-hours and says so.\n\n## 1. The object, the engine, and the forecast on record\n\nThe object is beta(x) = S(x)/E(x) of the natal march: S(x) is the exact\nnumber of positions r = 11, 17 (mod 30) in [0, x#) surviving the strikes\nr = 0, -2 (mod p) for every prime 7 <= p <= x and every scour prime\nx < q <= floor sqrt(x#); E(x) is the independence value\n(2/30) x# prod(1 - 2/p) prod(1 - 2/q). The engine of record is the K-30\nengine in `research/natal-cap-37-at41-march.js`, whose header (lines 7-31)\nstates the question, the zero-knob classical curve\nbeta = (e^{2 gamma}/4)(1 + 2/ln W + 6/ln^2 W), and the ceiling. Rung:\nevery beta on the ladder is MEASURED (an exact integer S over a double E).\n\nThe record's last point is beta(41) = 0.8455 at S(41) = 256,725,962,834,\nE(41) = 303,627,067,641.7 (`natal-cap-37-at41-march.js`:825), the fifth\nconsecutive collapse of the classical residual, +0.0046, +0.0026, +0.0016,\n+0.0010, +0.0006 at @23..@41 (line 847). The forecast the TODO item quotes\nis the record's own last printed line (line 851): \"forecast @43\n(W = 1.308e16, BEYOND 2^53 — needs a different engine): classical-raw 0.8393\n(+persisted residual 0.8399)\". PART 4 of the producer re-derives both from\nthe formula: classical(43) = 0.8393 at W = 43# = 13082761331670030, and\npersisted = classical(43) + residual(41) = 0.8399, with residual(41) =\n+0.0006 from S(41)/E(41) = 0.8455 against classical(41) = 0.8449. So the\n@43 level extends beta, the natal survival ratio, at the MEASURED rung, and\nthe forecast is a HEURISTIC (a fitted-free curve plus the last residual). No\nband was registered for either forecast, in the record or in TODO item 1;\nthe two differ by 0.0006, which PART 4 prints as 6.4 units of the fourth\ndecimal beta is quoted in.\n\n## 2. The overflowing path, isolated\n\nPART 0 recomputes the record's fourteen-path audit at @43 with every worst\ncase formed in BigInt. Five paths exceed 2^53 = 9007199254740992 in\nmagnitude: A (W = 43# = 1.4525 x 2^53), B (the bracket (sq+1)^2), C (the\ny-depth product q^2 with q = 114379879), F (the CRT anchor, worst\n13082756491294884), and M (the position 30k + 17, worst 13082761331670017).\nThe other nine stay below 2^53: M = W/30 = 436092044389001, N = 2 prod(p-2)\n= 232312693362750, the shard anchor kA mod q, the cursor kb + i, and the\nInt32 paths (block offset 118574183 and stride 114379879, 5.5% and 5.3% of\n2^31). The extended-Euclid path E is bounded by 2q, not q^2, because each\ncoefficient is bounded by the modulus; the record's audit listed q^2 as its\nworst case, which was safe at @41 and is over-conservative.\n\n**The brief's premise is wrong in a way that matters for @47 and not for\n@43.** TODO item 1 says \"one line blocks it: W = 1.308e16 > 2^53 in the CRT\nanchoring product\", following the record's line 683 (\"@43 dies at path A\nfirst\"). PART 0 re-runs the record's path F in the record's own double\narithmetic, `(((a-b) mod q) * inv30(q)) mod q`, on all 26,157,448 scour\nclasses at @43 (both lanes): 644256 of the products exceed 2^53 in\nmagnitude, and 0 disagree with BigInt. The reason is parity: a - b is q - 11, q - 13, q - 17 or q - 19,\neven for every odd q, so each product is an even integer below\n2^54 = 18014398509481984 and is exactly representable in a double. The same\nparity makes W = 43# (even, below 2^54) exact as a double, which the block\nconfirms (\"double(W) exact: YES\"). The record's path F is exact at @43 by\naccident, and the accident ends at @47, where 47# = 614889782588491410 lies\nabove 2^54. What actually breaks the record engine at @43 is (i) its own\nguard `assert(W < 2**53)` in `levelSpec`, and (ii) path M: an odd position\n30k + 17 above 2^53 rounds to an even double, and PART 0 shows the first\nsuch k = 300239975158033 (BigInt 9007199254741007, double 9007199254741008,\noff by -1), over 31.2% of the @43 tile, so every sampled survivor there would fail its twin check. VERIFIED\n(exact computation, printed). The correction to the record is listed in\nsection 7.\n\n## 3. The BigInt path and its chain of custody\n\nThe producer copies the record's march kernel (wheel prefix, strike loop,\nSWAR census, survivor sampling) unchanged, and promotes exactly the five\npaths above: W and the primorial ladder are BigInt (the double copy is\nchecked exact and its exactness printed); the square-root bracket is a\nBigInt integer root; the y-depth assert is BigInt; the CRT anchor is a\nBigInt product mod q whose result, below q < 2^31, is stored as a double\nfor the cursor arithmetic; every position that leaves the march is a\nBigInt (`30n k + b`), and the 13-base Miller-Rabin plus strong-Lucas layer\nalready accepts BigInt. The class tables at @43 are 26,157,492 entries\nbuilt in BigInt in 6.41 s on the stderr line, a one-off per shard and not\na march cost. The march's per-strike cost is untouched: the\nrecord's PART 0.5 measured a blanket BigInt cursor at 30x slower, and this\npath keeps the cursors Float64 because at @43 they stay below 2^53 (paths G,\nH).\n\nCustody, PART 1, all on this code path, all VERIFIED against the record:\n\n- Gate 0: @7..@29 serial. S, N, E, beta, scour census and y match at all\n seven levels.\n- Gate 1: @31 serial. S(31) = 283449187, N = 4151035350, E = 328601798.6,\n beta = 0.8626, scour 37534 (37..447829), first survivor 448157, last\n 200560488827; 36 sampled survivors are twins.\n- Gate 2: @37 through eight shards, and per shard: all eight (np, S) pairs\n equal the record's shard lines (`natal-cap-37-at41-march.js`:784-791),\n S(37) = 7998394865, N = 145286237250, E = 9377228928.8, beta = 0.8530,\n first 2725001, last 7420738134527; 84 sampled survivors are twins. The\n eight shards took 1003.4 s wall here against the record's 437.0 s (line\n 795), the machine being shared with the other agents of the wave.\n- Gate 3: a slice of @41, shard 0's first 6000 blocks of 302246 at blockK\n 2^22, against the three progress ticks the record embeds (lines 803-805):\n blk 2000 np=4686722957 S=349203305, blk 4000 np=9373445779 S=661452618,\n blk 6000 np=14060168660 S=961752168, all three matched, and the first five\n @41 survivors (17442827, 17443091, 17443301, 17443661, 17443961; line 828)\n matched. This is 0.248% of the @41 tile.\n\nThe brief asked for @37 and @41 \"digit for digit\". @37 is met in full. @41\nis met on the slice the record makes checkable; the whole @41 tile is 6.035 h\nof eight cores (line 820) and is outside this note's budget. What the slice\nestablishes is that the promoted path is the same deterministic function of\nk as the record's on the region tested; it does not add a second witness to\nS(41).\n\n## 4. The price of @43, measured on a slice\n\nPART 3 prints the exact strike budgets 4 M sum 1/q: @41 5.9157e+13 (M =\n10141675450907, 1117909 scour primes, sum 1/q = 1.458276) and @43 2.6896e+15\n(M = 436092044389001, 6539362 scour primes, sum 1/q = 1.541874). The ratio\nis 45.465, of which 43.000 is the tile and the rest the longer scour sum.\n**TODO item 1's \"~13x the @41 runtime\" is not the strike budget and is not\nthe measured cost.** No derivation of 13 was found in the record; it is\nrecorded as a brief error in section 7.\n\nThe measured part: equal spans of 2^27 k-cells at k = M/3 were marched at\n@41 and @43 back to back, three interleaved repetitions, blockK 2^22. Per\nspan the block prints the counts (np and S on the span at each level) on\nstdout and the seconds on stderr: @41 2.33, 2.19, 2.17 s and @43 5.24,\n4.89, 4.87 s, medians 2.19 s and 4.89 s, a per-cell cost ratio @43/@41 of\n2.230 (per strike 2.109). The load average at probe time is printed beside\nit (7.6, 66.9, 124.9 on 10 cpus), since this machine was shared with the\nother agents of the wave. The extrapolation, printed on stderr, is 6.035 h\n(the record's eight-shard wall for @41) x 43.00 (tile) x 2.230 (per cell) =\n579 h wall = 24.1 days on this machine's eight shards; the brief's 13x would\nhave been 78 h. A single serial span at blockK 2^24 came out at 3.65 s\nagainst 4.89 s at 2^22, which is the same serial-versus-concurrent\ninversion the record's cost log found at @41 (line 742 and reading 3), so\nthe block size for a real run has to be re-probed under concurrency on the\nmachine that runs it.\n\nCalibration: MEASURED, one machine, loaded, three repetitions, a single\nspan position. The 2.23 factor is the least certain input; the 43x tile is\nexact. Even at a per-cell factor of 1.0 the run is 6.035 h x 43 = 260 h\nhere (arithmetic on printed values). Nothing\nunder this heading is under the 3.5 h rule.\n\nThe residual-collapse question priced: the sixth collapse is the whole\npayoff of the run, and it is one number to four decimals. The residual\nsequence +0.0046, +0.0026, +0.0016, +0.0010, +0.0006 has ratios near 0.6;\na sixth term of that size sits between the two forecasts, 0.8393 and\n0.8399, which differ by 0.0006. So the point would distinguish raw from\npersisted only if it lands near one of them, and a landing between them\nscores as the nearer one under the record's own rule (line 846,\n\"closest = ...\") without a registered band.\n\n## 5. What the @43 point would decide\n\nOne calibrated sentence: the @43 point would add a sixth MEASURED term to\nthe classical residual series and score the HEURISTIC forecast pair\n0.8393/0.8399, and it cannot move any proof, because beta is the knob whose\nheadroom \"has no consumer\" (TODO.md:562, `sift-limit-attack.md`:689) and\nthe fifth collapse already leaves the classical curve without a rival\ndescription at any computed level (`paper/anchored-note.md`:527-533). The\nrun's value is calibration of a curve, at weeks of box time.\n\n## 6. The box plan\n\nGiven only if Chris wants the point. Everything is script-only: the\nproducer is one file with no repo dependency; ferry it, run, ferry the JSON\nback, `combine` on the laptop.\n\n1. **Convert first.** Run `bench/bench.sh` on the box for the Node\n single-core rate, and this producer's `probe 43 22 32`, `probe 43 23 32`,\n `probe 43 24 32` as 16 concurrent copies each (a shell loop), to pick the\n block size under concurrency on the 5950X's two 32 MB CCDs. The record's\n @41 finding was that the serial optimum (2^24) loses under eight shards;\n the box may differ. The producer's `BLOCKK` is a constant and must be\n edited on the ferried copy if 2^22 loses; say so in the returned log.\n2. **Segment.** `shard 43 i 128 ` for i = 0..127, 16 at a time under\n `nohup nice`, each writing `e0830-x43-of128-i.json` with np, S, first and\n last survivors and samples as decimal strings, plus its own seconds and\n the box's node version and CPU model. A segment is the checkpoint: a\n crash loses at most one segment. At the laptop rate each segment is\n 579 h x 8 / 128 = 36 core-hours (arithmetic on the printed 579 h); at 16 concurrent that is 8 rounds of\n 36 h = 12 days if the box matches this machine per core, and unknown\n until step 1 has run. Memory per shard is about 0.6 GB (26M-entry class\n tables plus cursors), 16 shards under 10 GB.\n3. **Fold and score.** `combine 43 128 ` on the laptop: asserts the\n partition is contiguous and exact, N = 2 prod(p-2), sums np and S,\n cross-checks E against the 2^256 fixed-point reference, BPSW-checks every\n sampled survivor as a BigInt, and prints the misses against 0.8393 and\n 0.8399 with the sign. Bind the box stdout/stderr by the declared-provenance\n path with the node version and CPU in the tail; never hand-paste.\n4. **Custody on return.** Before trusting S(43): re-run `quick` and the\n gates on the box's copy of the file (the `full` mode does this; its\n embedded elapsed here is 1621.4 s on the loaded laptop), and compare a segment boundary against a laptop\n re-run of the same k-range (`shard 43 i 128` for one i, about 36\n core-hours, or a narrower range via `probe`).\n\n## 7. Corrections to the record and to the brief\n\n- **Brief and record, the blocking path.** TODO item 1 line 554 and\n `natal-cap-37-at41-march.js`:683 say the CRT anchoring product / path A is\n where @43 breaks. PART 0 shows path F and path A are exact at @43 by\n parity (0 disagreements on 26,157,448 classes; W even and below 2^54);\n the breaks are the engine's own guard and path M (survivor positions\n above 2^53, 31.2% of the tile). The brief's fix (BigInt on \"that single\n path\") would have been insufficient without path M and unnecessary for\n path F at @43; it becomes necessary for F at @47. The producer promotes\n all five.\n- **Brief, the cost factor.** \"~13x the @41 runtime\" has no source found in\n the record; the strike budget ratio is 45.465 and the measured per-cell\n extrapolation is 579 h against the record's 6.035 h, about 96x.\n- **Record, the audit's path E bound.** `natal-cap-37-at41-march.js` PART 0\n lists invMod's worst case as q x q; the extended-Euclid coefficients are\n bounded by the modulus, so the true worst case is 2q. Harmless at @41 and\n at @43.\n- **Brief, the reading of TODO's forecast.** The brief guessed the forecast\n was for \"the anchored bias beta or the anchored calm\"; it is beta = S/E of\n the natal march, and not the anchored calm of `research/anchored-calm.md`,\n which is a different object.\n\n## 8. Honesty\n\nThe engine claim is narrow and checked: the promoted path reproduces the\nrecord wherever the record can be checked without a six-hour run. It has not\nproduced a number the record does not already hold. The cost claim rests on\none loaded machine and three interleaved spans; it is good to perhaps a\nfactor of 1.5 on the per-cell factor and exact on the 43x, and no reading of\nit brings @43 under the run-it-now rule. The @43 forecast is unscored and\nstays so until someone spends the box time; this note's recommendation is\nthat the point be scheduled only if a sixth term of the residual series is\nwanted for its own sake, since no live target consumes it.\n"},"research/history/staging/fekete-1d.md":{"lf_sha256":"33657acd3ed1b3d6fd7abcea6aa2a379cc97830027c40c63899743a411f24a98","content":"# TODO 1d: the bounded-defect Fekete route, probed at 47#\n\n\n\n*2026-08-20. Producers: `research/attack-fekete-1d-01-defect47.js` (0.1 s,\n`code-sha256 45554df4`, `out-sha256 afc6d190`, formal embed, seven numbered\nreadings) and `research/attack-fekete-1d-02-lemma.js` (0.2 s,\n`code-sha256 62cb37d9`, `out-sha256 1c99d42b`, formal embed, six numbered\nreadings). Both fingerprints verified with `embed.js --check` after writing.\nNothing was committed or pushed; no existing corpus document was edited.\nLegend as in `research/sift-limit-attack.md`: **[PROVEN]** published theorem or\na proof given here; **[VERIFIED]** checked computationally here; **[MEASURED]**\nempirical, finite range; **[INFERRED]** deduction from sourced facts;\n**[CERTIFIED]** follows from a replay-verified corpus certificate.*\n\n---\n\n## 0. The verdict, up front\n\n> **The defect at 47# is ordinary, the one unverified term cannot move any 1d\n> reading, and — the sharpest thing this pass found — the 47# enumeration\n> cannot move 1d's TPC threshold either, whatever value it returns. The\n> bounded-defect Fekete lemma is stated exactly, proved, and every hypothesis\n> except the candidate itself is now discharged. The route is reduced to one\n> named inequality.**\n>\n> 1. **The defect at 47#, exactly.** Ten integer pairs land in `[47, 53)`. The\n> largest defect is `D = 1.0330` nats at `(4,12)` — second largest on the\n> whole 111-pair table, 0.0431 under the global sup `1.0761` at `(4,10)` —\n> and the all-prime pair `(7,7)` reads `−0.2400`. The 47-window ranks 3rd of\n> 21 windows. Nothing about it is extreme. **[VERIFIED]**\n> 2. **The 704-vs-708 discrepancy is immaterial.** The greedy's replay-verified\n> covering gives `G₂(47#) ≥ 705`; A144311 says 708. The worst shift any\n> defect reading can take from that bracket is `ln(708/705) = 0.00425`\n> nats — 66× below the smallest margin in play. A144311 would have to be low\n> by ≥ 32 (4.5%) before the reachable sup C moved. **[VERIFIED]**\n> 3. **REFUTATION: 1c's \"each new ladder-known x raises 1d's TPC threshold\" is\n> false at 47#, and certified false — no enumeration outcome can change\n> it.** The custody integer threshold is `S(16) = ln(256/66) = 1.3555`, a\n> 13#-fact. The 47-window's best is `S(52) = ln(2704/G₂(47#)) ≤\n> ln(2704/705) = 1.3443 < 1.3555`, capped from above by the certified\n> greedy floor. Same freeze at 53# (cap 1.3524) and 59# (cap 1.3280). The\n> first term that can raise it is x = 61, and a 61# enumeration is\n> ~146,969× the 43# run. **[CERTIFIED]**\n> 4. **The defect reads BOUNDED on a second instrument, and custody-only.**\n> Per-window sup slopes: G₂ minus the constant-defect null =\n> `−0.0414 ± 0.0846` (22 terms) and `−0.0188 ± 0.1466` (14 custody terms) —\n> consistent with bounded both times, and the verdict does not lean on the\n> eight literature terms. **[MEASURED]**\n> 5. **What a bounded defect buys, exactly.** The multiplicative Fekete lemma\n> (stated and proved in `attack-fekete-1d-02-lemma.js`, eight lines):\n> conditional on the candidate with ANY constant, `β = lim ln G₂(x#)/ln x`\n> **exists** and equals `inf_n (ln Ĝ(n) + K)/ln n`; and\n> `β < 2 ⟺ S(n) > K at a single integer`. Existence is the honest prize;\n> the explicit-constant version is TPC-strength. **[PROVEN, given the\n> candidate]**\n\n---\n\n## 1. What \"probe 47#\" can and cannot mean, priced\n\nThe exact enumeration at 47# is already priced by direct probe: **1.49 days per\nrun, two disjoint-mask runs required** (`phase1-T2b-exact-ladder.md`), so it was\nnot launched here — that is 1c's task, with 1c's Poisson-window\npre-registration discipline. What the corpus already holds at 47# is a bracket:\n\n| source | value | grade |\n|---|---|---|\n| greedy covering of `[1, 704]`, replay-verified | `G₂(47#) ≥ 705` | CERTIFIED (`greedy-oracle-validation.md` §3) |\n| OEIS A144311 a(15), Alekseyev 2009 | `G₂(47#) = 708` | literature, unverified here |\n\nEvery reading below is taken at both endpoints of that bracket, which is what\nmakes this a probe rather than a wait.\n\n## 2. The defect at the 47-window\n\n`D(s,t) = ln[Ĝ(st)/(Ĝ(s)Ĝ(t))] = S(s)+S(t)−S(st)` (the identity, PROVEN in\n`import-interp.md` §3, re-verified here to `5.6e−16` at all pairs). The ten\npairs with `st ∈ [47, 53)`, at the published 708:\n\n| pair | st | R | D (nats) |\n|---|---|---|---|\n| (4,12) | 48 | 2.8095 | **1.0330** |\n| (5,10), (6,8) | 50, 48 | 1.9667 | 0.6763 |\n| (3,16), (4,13) | 48, 52 | 1.7879 | 0.5810 |\n| (2,24), (2,25), (2,26) | 48, 50, 52 | 1.7353 | 0.5512 |\n| (3,17) | 51 | 1.0926 | 0.0886 |\n| (7,7) | 49 | 0.7867 | −0.2400 |\n\nThe window's sup ranks **3rd of 21 windows** (behind p = 37's 1.0761, which is\nthe global sup, and p = 71's is 1.0202 just below); the running per-window sup\nlast rises at the p = 37 window and is flat over the ten windows after it.\n**[VERIFIED]**\n\n**Sensitivity.** At `G₂(47#) = 705` and at 708 alike: sup C stays 2.9333 at\n(4,10), every threshold stays put, and the maximal shift of any D is 0.00425\nnats. The flip value is `G₂(47#) ≥ 740` — pair (4,12) would then overtake\n(4,10) — i.e. A144311 low by ≥ 32. Below 705 is excluded by the certificate.\n**[VERIFIED]**\n\n## 3. The threshold freeze, which corrects two records\n\nTPC-implication for an explicit constant is `ln C < S(b)` at a ladder-known\ninteger base `b` (`import-interp.md` §4). The threshold column, recomputed:\n\n| ladder | threshold `max_b S(b)` | at base |\n|---|---|---|\n| full 22-term (8 literature terms) | 1.3946 | b = 66 — **rests on Wang 2024's a(18), `G₂(61#) = 1080`** |\n| custody-only, 14 exact terms | **1.3555** | b = 16 — rests on `G₂(13#) = 66` |\n| custody + 47# verified (at 708 or 705) | 1.3555 | b = 16, unchanged |\n\nBecause `S(b) = ln(b²/Ĝ(b))` **falls** as `Ĝ` rises, a certified lower bound on\n`G₂` is a certified **upper** bound on the window's best S. The greedy floors\ntherefore freeze the next three windows below the standing custody max:\n\n| window | best base | cap `ln(b²/floor)` | can raise 1.3555? |\n|---|---|---|---|\n| [47,53) | 52 | 1.3443 | no, certified |\n| [53,59) | 58 | 1.3524 | no, certified |\n| [59,61) | 60 | 1.3280 | no, certified |\n| [61,67) | 66 | 1.3992 | **yes** — fires iff verified `G₂(61#) ≤ 1123` (published: 1080) |\n\n**Two corrections follow.** (i) TODO 1c's stated win \"each new ladder-known x\nraises 1d's TPC threshold, directly loosening the constraint\" is wrong at 47#\n— and not merely at the published value: **certified wrong for every possible\nenumeration outcome**, and equally at 53# and 59#. The first riser is x = 61,\nwhose enumeration is `47·53·59 = 146,969×` the 43# run (~1 h on ten cores) —\nout of reach by ~5 orders of magnitude. (ii) The corpus's quoted integer\nthreshold 1.3946 is a **literature-conditional** number (Wang 2024's a(18));\nthe custody-grade threshold is 1.3555 and is effectively frozen there.\n**[CERTIFIED / VERIFIED]**\n\n**The 1d position now stands on custody terms alone.** The reachable sup\n`C = 2.9333` is attained at (4,10) from `G₂(7#) = 30` and `G₂(37#) = 528`, both\ncorpus-exact; the threshold 1.3555 is a 13#-fact. The candidate's TPC window is\n`C ∈ [2.9333, 3.8788)`, `ln C ∈ [1.0761, 1.3555)` — 0.2794 nats wide — with no\nliterature term anywhere in it. Any proof of the candidate with a constant in\nthat window is a proof of `β < 2`. **[VERIFIED]**\n\n**One domain-cap artifact repaired in passing:** the recorded integer floor-7\nsup 1.5533 (`import-interp.md` §4) was taken under `st ≤ 79`; `Ĝ` is known on\n`[2, 83)`, and the widest legal domain admits (8,10), st = 80, with\n`R = 1.9000` — equal to the recorded real-form sup, so the real/integer split\nat floor 7 was the cap, not structure. No verdict changes. **[VERIFIED]**\n\n## 4. Is the defect bounded?\n\n**Second instrument, same verdict as `import-interp.md` §5.** Per-window sup\n`Wmax(p) = max{D(s,t) : st ∈ [p, p_next)}`, slope against `ln p`, nulls sampled\nat the same primes and stepped the same way in the same pass:\n\n| ladder | slope ± se | G₂ − POW contrast |\n|---|---|---|\n| G₂ full (22) | +0.1661 ± 0.0637 | **−0.0414 ± 0.0846 → consistent with bounded** |\n| POW null, constant defect | +0.2075 ± 0.0558 | (the calibration: this IS what bounded looks like here) |\n| LOG null, decreasing defect | −0.2415 ± 0.0554 | (the instrument is not pinned positive) |\n| G₂ custody-only (14) | +0.2526 ± 0.1094 | **−0.0188 ± 0.1466 → consistent with bounded** |\n\nG₂ reads *less* growing than the constant-defect null on both ranges, and the\ncustody-only row shows the bounded verdict does not lean on the eight\nliterature terms. **[MEASURED]**\n\n**The instrument's blind spot, stated as a limit.** Every power-log law\n`Ĝ ~ c·x^β (ln x)^δ` **with δ ≥ 0** has a bounded window-sup defect\n(continuous limit `δ·ln(1/ln 2) − ln c`; for δ < 0 the k = 1 rung diverges\nand the defect is unbounded, sign lemma PROVEN in\n`attack-0829n-hsubpow-K.md` §3b, qualifier added 2026-08-29), because the\nsup is driven by small-s pairs; an\nunbounded defect would live on the diagonal, where the largest `√x` any ladder\noffers is ~9. So \"bounded\" is the supported reading under every law the corpus\nentertains, and is **not** a demonstrated fact about the true defect — which is\nexactly why the honest Fekete target carries an unnamed constant.\n**[INFERRED]**\n\n## 5. The exact lemma, hypotheses discharged\n\n> **Lemma (multiplicative Fekete with bounded defect).** Let\n> `f : {2,3,4,…} → [0,∞)` satisfy **(H-sub)** `f(st) ≤ f(s) + f(t) + K` for all\n> integers `s,t ≥ 2` and some constant `K ≥ 0`, and **(H-mono)** `f`\n> nondecreasing. Then `lim f(n)/ln n` exists and equals\n> `L = inf_{n≥2} (f(n)+K)/ln n ∈ [0, ∞)`.\n\nProved in eight lines in `attack-fekete-1d-02-lemma.js`'s header (liminf from\nthe definition of inf; limsup by iterating (H-sub) on powers of an arbitrary\nbase and bridging with (H-mono)). de Bruijn–Erdős Theorem 22 — the\ngrowing-defect version — is **not needed**: the measured defect reads bounded\nand plain-Fekete shape suffices, exactly as `import-interp.md` §6 anticipated.\n**[PROVEN]**\n\n**Why BGT's obstruction does not apply here:** the lemma never asks an integer\nto factor. BGT's machine died on H1 (`π(st) ≠ π(s)+π(t)`, the ground set does\nnot split); this lemma uses (H-sub) on products only, and (H-mono) replaces the\nadditive ground set in the between-powers bridge. **[INFERRED]**\n\nHypotheses, for `f = ln Ĝ`:\n\n| hypothesis | status |\n|---|---|\n| `f ≥ 0` | trivial, `Ĝ ≥ 2` |\n| (H-mono) | **PROVEN one line + VERIFIED seven folds**: the twin-slot set of `T_next` is a subset of the periodized slot set of `T_x` (folding only deletes slots; deletion only merges gaps, so `G₂` is nondecreasing). Checked literally by direct sieve at every fold `2→3→…→19`, periods to `9,699,690 = 19#`, reproducing the exact ladder term by term; monotone at all 22 ladder terms |\n| (H-sub) | **OPEN — the candidate itself.** Holds at all reachable pairs with `K = 1.0761`; unproven beyond; the route's entire remaining content |\n\n**The conclusion formula, calibrated on known-truth controls** (campaign rule:\nestimator on a control in the same pass). On `POW` (true β = 1.546, constant\ndefect) the finite-range inf reads 1.5901 at n = 10⁶, +2.9% and falling from\nabove; on `LOG` (true β = 1, δ = 2) it reads 1.5335, **+53%**, with its K\ndriven by the (2,2) pair. Both approach from above, as the inf-over-a-subset\nargument requires. **So the lemma's value output is unquotable at any reachable\nrange; what it delivers is existence.** **[MEASURED]**\n\n## 6. What a bounded defect buys, and the two faces\n\nConditional on (H-sub) with **some** constant, never named:\n\n- `β = lim ln G₂(x#)/ln x` **exists** — along integers, hence along reals,\n since `Ĝ` is a step function. 1d's central question becomes well-posed:\n `β < 2` forces `G₂(x#)/x² → 0`, `β > 2` forces it to ∞, and only `β = 2`\n leaves the sublinear part to decide. **[PROVEN, given (H-sub)]**\n- `β < 2 ⟺ S(n) > K` at a single integer. This one equivalence is the trap and\n the prize at once: an explicit `K < 1.3555` is TPC-implying (no soft proof\n should be expected), an unnamed `K` buys existence without touching TPC. The\n corpus's `1.8992` at base 16 (`import-interp.md` §4) is this formula at the\n reachable K, reproduced exactly. **[PROVEN given (H-sub); cross-check\n VERIFIED]**\n\nNot bought: any value of β, any movement on `4.2665 → 2`, any unconditional\nstatement.\n\n## 7. NOT REACHED\n\n- **The 47# enumeration itself.** Priced at 1.49 days per run, two runs\n (`phase1-T2b-exact-ladder.md`); not launched. The bracket `[705, ∞) ∩\n {published 708}` is what this pass used, and §2-§3 show nothing 1d needs\n from the enumeration beyond what the bracket already certifies.\n- **No proof of (H-sub), no counterexample, no bound on the true K.** The\n pairs that would decide it need both arguments large; the ladder has none\n (largest `√x` ≈ 9).\n- **No exclusion of a growing defect.** §4's verdict is consistency with\n bounded, on an instrument blind to diagonal growth; a non-power-log law\n could hide there.\n- **de Bruijn–Erdős Theorem 22 remains unopened** (as in `import-interp.md`\n §9); it is not needed for the bounded shape, and nothing here cites its\n content.\n- **The real-base form of the candidate** was not re-examined; the corpus\n instruction to state the candidate on integer bases stands\n (`import-interp.md` §4).\n- **Whether 61# could ever be reached by a smarter engine** than direct\n enumeration (the only riser base in reach of the freeze analysis) was not\n investigated; at direct-enumeration scaling it is ~146,969× the 43# hour.\n\n## 8. Sources and reproduction\n\n| artifact | what it carries |\n|---|---|\n| `research/attack-fekete-1d-01-defect47.js` | the 47-window pairs, sensitivity at 705/708, flip values, the threshold freeze, the per-window boundedness instrument with nulls (§§2-4) |\n| `research/attack-fekete-1d-02-lemma.js` | the lemma with proof, (H-mono) verified at seven folds, the control calibration, the conditional application (§§5-6) |\n| `research/exact-g2-ladder.js` | the 14 custody terms, parsed at run time |\n| `research/import-interp-01-bgt-defect.js` | the corpus's A144311 copy, parsed at run time; the headline numbers cross-checked here |\n| `research/history/staging/greedy-oracle-validation.md` §3 | the replay-verified greedy floors 705/870/954/1075 |\n| `research/history/staging/phase1-T2b-exact-ladder.md` | the 47# price: 1.49 days per run |\n| `research/history/staging/import-interp.md` §§3-7 | the identity, the trap statement, the slice-instrument boundedness reading this pass confirms |\n\nReproduce with `node research/qc/embed.js --check\nresearch/attack-fekete-1d-01-defect47.js` and `node research/qc/embed.js\n--check research/attack-fekete-1d-02-lemma.js`; both fingerprints match as of\n2026-08-20.\n"},"research/history/staging/head-residual-factor.md":{"lf_sha256":"3a106c183747e1b7b19ada4b34455f0cae8361f3331afb205d24a903dbadfcc8","content":"# The head's prime-origin factor: one third of it derives, the mod-30 answer is no, and the rate stays open\n\n\n\nSTATUS: HELD, staging. Not integrated, not red-teamed. Companion script\n`research/history/staging/head-residual-factor.js` (embedded, 1.5 s, seeded\nbootstrap, `--check` green). It reproduces every figure of\n`research/destroyer-census-01.js` SEC 6(b) from an independent segmented sieve\nbefore it computes anything new; if that control had failed nothing below would\nstand.\n\nTask: TODO Z4, head half. The question asked was whether the residual\nprime-origin factor 1.09 → 1.03 of `destroyer-census-01.md` §6(b) is the mod-30\nsmall-h class correlation of §6(c), and whether it has a derivable form.\n\n---\n\n## 0. What is still open, and what failed\n\n**No derivation of the residual was reached.** The residual is still MEASURED.\nWhat changed is that it is now an exact algebraic identity in three parts, one\nof which has a closed form and two of which do not.\n\n**The RATE is not settled and the measurement cannot settle it.** h/R → 1\nfollows from β CV²(g) staying bounded, which is far weaker than the product\nreaching 2 (§3). What the product decides is how fast h/R − 1 falls: like\n1/ln²p if it tends to 2, like 1/ln p if it settles anywhere else. Over 1e4 to\n1e8 it runs 0.7993 → 1.2326: rising, still short, and with no argument here\nthat it arrives.\n\n**The competing description is excluded by §3's identity, not by the fit.** A\ntwo-parameter law with a negative plateau, h/R − 1 = −0.0315 + 1.036/ln p, fits\nthe six half-decade windows better (χ²/df 0.762) than the one-parameter law\n(0.883). Sustaining that plateau needs β CV² = 2.713 at ln p = 17.9, 3.208 at\n27.6 and 6.633 at 100, against a measured 0.7993 → 1.2326, so it is\nstructurally unavailable unless β diverges [MEASURED, `redteam-0828-head.js`].\nIt fits better on six points and is not a live description.\n\n**One prior candidate was checked and does not apply.** `origin-excess.md`'s\nρ(2) → e^{2γ}/4 = 0.79305 is the origin's survival density against the ensemble\nof translates at sieve level u = 2. It is a different object from the forward\nrecurrence residual here: R is built from the window's own MEASURED twin gaps,\nso every Mertens-to-HL constant, e^{2γ}/4 included, is already inside R. The\nresidual sits on top of a calibrated baseline. Reading `origin-excess.md` first\nwas the right instruction and the answer is that it does not carry over.\n\n---\n\n## 1. The objects, pinned against the embedded data\n\nDefinitions taken from `research/destroyer-census-01.js` (lines 368–445, SEC 6)\nand re-implemented independently:\n\n- **twin opener** a: a and a+2 both prime.\n- **F(p)** for a prime p: the first twin opener strictly above p, minus p. A\n prime that is itself an opener therefore takes the full forward gap. This is\n the census's `head`, and the same object as `zonegap-01.js`'s zone head\n a_first − p, since every prime is a zone origin.\n- **h**: the mean of F over all primes ≥ 7 in the window (5,096,856 of them in\n [1e7,1e8), the whole prime count of the decade less 20 censored at the range\n end).\n- **g_i**: the gaps between consecutive twin openers; **R = Σg²/(2Σg)**, the\n CONTINUUM inspection-paradox functional of the same window's twin gaps. A\n discrete uniform integer origin sees R + 1/2 exactly, an odd origin R + 1,\n and an origin drawn from the coprime-to-30 residues that primes ≥ 7 occupy\n sees R + 2.754 at [1e7,1e8) [MEASURED, `redteam-0828-head.js`, five decades].\n Read h − R against whichever null population is meant; against the\n coprime-to-30 one it is 2.925, not 5.679.\n\nThe five windows and their measured ratios, quoted from the census's embedded\nblock and reproduced byte-identically by the companion script's SEC 0:\nh/R = 1.0924, 1.0780, 1.0416, 1.0347, 1.0254 over [11,1e4), [1e4,1e5),\n[1e5,1e6), [1e6,1e7), [1e7,1e8). In absolute terms, with gaps binned by their\nleft opener, SEC 1 gives h − R = 4.001, 6.007, 4.932, 5.696, 5.679, all\nagainst R as written. Against the discrete nulls of the bullet above the top\nwindow reads 5.179, 4.679 and 2.925. The ratio falls because R grows, not\nbecause the excess shrinks.\n\n---\n\n## 2. The identity, and the one piece with a closed form\n\nBin the primes by the twin gap that contains them. Gap i runs [a_i, a_{i+1}),\nholds n_i primes, and its primes' forward distances sum to S_i. Then\n\n h − R = A + B, exactly, asserted to 1e-9 at every window\n A = Σ(S_i − n_i g_i/2) / Σ n_i within-gap placement\n B = Σ n_i g_i /(2 Σ n_i) − R length-versus-count coupling\n\nB is exactly one half of (mean containing gap seen by a PRIME) minus (mean\ncontaining gap seen by an INTEGER). It vanishes when n_i is proportional to g_i.\n\n**The derived part [PROVEN, conditional on PNT and Hardy-Littlewood].** Split\nA = A_forced + D. Every twin gap contains its own left opener a_i and a_i + 2,\nboth prime, both at the extreme left of the gap, so both carry near-maximal\nforward distance; the right opener's forced pair belongs to the NEXT gap. That\nasymmetry is worth, against the uniform-within-gap surrogate, exactly g_i − 2 per\ngap, so\n\n A_forced = (E[g] − 2)/E[n] = 1/λ − 2λ₂/λ = ln p − 4C₂/ln p + o(1)\n\nusing λ = 1/ln p and λ₂ = 2C₂/ln²p. Measured against the closed form at the six\nhalf-decades: 11.998 against 11.971, 13.157/13.142, 14.313/14.310,\n15.480/15.475, 16.639/16.638, 17.802/17.800. The agreement tightens with height,\nas an o(1) error term should. This is the piece that derives.\n\n**The remainder of A [MEASURED, no derivation].** D = A − A_forced runs −0.661,\n−0.906, −0.987, −0.860, −0.919, −0.955 across the same windows. The non-forced\nprimes sit very slightly late inside their gap, worth about one unit, flat. Not\nderived, and small enough that it does not drive anything.\n\n---\n\n## 3. B, and where the limit question actually lives\n\nB is not a residue effect and not a small correction. It is the largest single\nterm after A_forced: −3.119, −4.303, −7.085, −8.594, −10.883 across the decades.\n\n**B is an exact identity in a regression coefficient [PROVEN, algebra].** Let α\nand β be the OLS slope and intercept of a gap's prime count n_i on its length\ng_i. Then\n\n B = Var(g)(α − λ)/(2 E[n]) = − β Var(g) / (2 E[g] E[n]) ≈ − (β CV²(g)/2) ln p\n\nasserted to 1e-9 at every window, with the ln p form matching to four figures\n(−10.882 against −10.883 at [1e7,1e8)). So the sign of the whole prime-origin\nexcess is decided by one question: does a twin gap hold more or fewer primes\nthan its length alone predicts.\n\n**β is measured, not derived [MEASURED].** β = 1.028, 1.079, 1.310, 1.314,\n1.379 across the decades, against a null of 2 − 2λ_bulk = 1.898 at [1e7,1e8),\nthe density-consistent discrete value in the convention this β uses; the\ncontinuum value is 2 exactly. Putting the two forced left-end primes on a\nfull-density λ interior instead gives 2 − 2/ln p = 1.887 and over-counts the\ngap's primes. The measured value is well below either null throughout,\nwhich is the expected direction: a twin gap is defined by the ABSENCE of an\nopener inside it, and suppressing openers suppresses primes. Expected direction\nis not a derivation, and no derivation of β is offered here.\n\n**The limit question, stated so it can be attacked.** Putting the three parts\ntogether,\n\n h − R = [ln p − 4C₂/ln p] + D − (β CV²(g)/2) ln p\n\nso h − R is bounded iff β CV²(g) → 2. The limit h/R → 1 needs much less,\nnamely β CV² = o(ln p) and D = o(ln²p), because R grows like ln²p while h − R\nis O(ln p); the measured R/(1/λ) runs 7.15, 9.07, 10.68, 12.66 up the decades.\nWhat β CV² → 2 decides is the RATE: 1/ln²p if it holds, 1/ln p if the product\nsettles anywhere else.\n\nThat correction bites once more. Under β CV² → 2 with D → −0.95 the identity\nsends h − R to D, so h falls BELOW R and h/R − 1 approaches 0 from the negative\nside: at ln p = 27.6 the limit form gives −1.69e-3 while the accepted fit\n+8.4661/ln²p gives +1.11e-2. The accepted law is a local fit whose coefficient\nmust change sign under this file's own conjecture, not a candidate limit law\n[MEASURED, `redteam-0828-head.js`].\n\nMeasured β CV² = 0.7993, 1.0849, 1.1193, 1.2326 over the four decades above\n1e4. Both factors are rising (CV² 0.7406 → 0.8941, β 1.079 → 1.379) and\nCV² → 1 is a Hardy-Littlewood statement for twin gaps, so β → 2 is what would\nbe needed. Nothing here shows it. This is the sharpest form of Z4's open half,\nand what is open in it is the rate.\n\n---\n\n## 4. Z4's specific question: is it the mod-30 class correlation? NO\n\nThe like-for-like excess is h − R_cop30 = 2.9253 at [1e7,1e8), the origin\npopulation being the coprime-to-30 residues primes ≥ 7 occupy (§1). Against it:\n\n1. The residue marginal's own mean shift, Σ_c c·(P_meas(c) − P_null(c)) over the\n full 5,761,432-head ensemble, is **−0.0854** (companion script SEC 4). Wrong\n sign, and 2.9% of the magnitude to be explained.\n2. Binning heads by the origin's class mod 30 and subtracting the per-class\n marginals first, h − R_cop30 = 2.9253 = 2.9254 within-class + **−0.0001**\n class-reweighting. The class correlation carries −0.0001 of the excess,\n 0.002 percent [MEASURED, `redteam-0828-head.js`, one window].\n\nThat is four orders of magnitude short, and the answer to Z4's question as\nposed is no. The class correlation is real and it is a separate O(0.1) effect.\n\nTwo earlier routes to the same answer are dropped because neither is a bound.\nA total-variation bound of 0.563 and a small-h confinement bound of 0.522 both\nassume the mod-30 histogram constrains where the mass sits in h: mass moved\nfrom h = 2 to h = 302 shifts the mean by 300 and leaves the histogram\nunchanged, and the same holds in reverse. The verdict was right and the route\nwas invalid.\n\n---\n\n## 5. What a derived head law would buy, and how close this gets\n\nThe R0 decomposition is head + Z₂ + tail ≤ width (`zonegap-02-reduction.js` SEC\nB, exact per zone). Z4 asks for one of the three pieces with a derived law. This\ngets the head to a product of three factors, each separately measured:\n\n c_h = c_g × (1 + CV²(g))/2 × (h/R)\n\nwhere c_h and c_g are the window's head and twin-gap coefficients against ln²p.\nMeasured ratio of that product to the measured c_h: 0.9953, 0.9956, 0.9967,\n0.9977 on the four decades above 1e4 (0.9603 on [11,1e4), whose ln²p average\nspans three decades). At [1e7,1e8) the product gives 0.7360 against a measured\n0.7344.\n\nSo the head coefficient's derivation reduces to CV²(g) → 1 and\nc_g → 1/(2C₂), both Hardy-Littlewood. h/R → 1 needs only that β CV² stays\nbounded. Granted the two HL limits, c_h → c_g → 1/(2C₂) = 0.7574 and the head\nhas a zero-parameter law. Neither is established here, and neither is something\nthis programme is going to prove: HL is doing more work in this file than it is\ncredited with, since A_forced's 4C₂/ln p term rests on it too.\n\nNothing in this file touches Z₂, and nothing in it bears on the conjecture.\n\n---\n\n## Defects noticed in passing\n\n- `destroyer-census-01.md` §6(b) quotes head coefficients \"0.7064 → 0.7344\n across windows\" while §6(a) of the same file quotes 0.6693 on band\n [3163,1e4). Both are correct for their own ensemble (zone origins in a narrow\n band against all primes in a decade window), but the file does not say so, and\n a reader lands on an apparent inconsistency.\n- `destroyer-census-01.md` §6(b) calls R the mean forward recurrence a uniform\n origin would see and reads h/R = 1.09 → 1.03 against it. R is the continuum\n functional; a discrete integer origin sees R + 1/2 and a coprime-to-30 origin\n R + 2.754 at [1e7,1e8), so the ratio there is quoted against a population no\n prime belongs to. That file is owned elsewhere and the correction is owed\n there.\n- `research/GLOSSARY.md` has no entry for **head** or **tail**, though both are\n load-bearing in Z4 and in the R0 chain. They are defined only in the\n `zonegap-01.js` / `zonegap-02-reduction.js` headers.\n- `attack-02-head-bias.js` uses \"head\" for the head of a primorial period, a\n different object from the zone head. Vocabulary collision, currently\n unmarked.\n\n---\n\n## What would falsify this, and whether that check has run\n\n| Claim | Rung | Falsifier | Run? |\n|---|---|---|---|\n| h − R = A + B, and B = −βVar(g)/(2E[g]E[n]) | PROVEN (algebra) | any window where the assertion misses at 1e-9 | YES, asserted at all five decades and all six half-decades, green |\n| A_forced = ln p − 4C₂/ln p + o(1) | PROVEN cond. on PNT+HL | the measured (E[g]−2)/E[n] departing from ln p − 4C₂/ln p by more than o(1) | YES, six half-decades, agreement tightening to 0.002 at the top |\n| The residual is not the mod-30 class correlation | MEASURED | the class-reweighting term carrying a sizeable share of the like-for-like excess | YES, one window: the term is −0.0001 against h − R_cop30 = 2.9253, 0.002% |\n| D ≈ −0.9, flat | MEASURED | growth with ln p over a longer lever arm | PARTIAL, six half-decades only, 1e5 to 1e8 |\n| β CV² → 2, hence h − R bounded | CONJECTURED | β CV² stalling below 2 above 1e8 | NO. Needs the 1e12 pass; this is the check to queue |\n| h/R → 1 | PROVEN from §3's identity, given β CV² = o(ln p) and D = o(ln²p) | R failing to grow like ln²p, or D growing like ln²p | PARTIAL. R/(1/λ) is measured rising 7.15 → 12.66; D is measured flat at −0.9 over six half-decades and is not derived bounded |\n| h/R − 1 falls like 1/ln²p, not 1/ln p | MEASURED | the 1/ln p law fitting | YES, 1/ln p rejected at χ²/df 8.127 on 5 df; 1/ln²p accepted at 0.883 |\n| The N4 plateau h/R − 1 → −0.0315 is not available | PROVEN from §3's identity, unless β diverges | β CV² reaching 2.713 at ln p = 17.9 and 6.633 at 100 | YES, from the identity. The fit alone does not discriminate: 0.762 against 0.883 on the same six points, and those data discriminate the RATE, not the LIMIT |\n\nThe one cheap check not run: the same decomposition at 1e12 on the box, which\nwould extend the β CV² lever arm from ln p ≤ 17.9 to ≤ 27.6 and separate the two\nmodel families. It reuses this script's engine unchanged and is a one-number\naddition to TODO Z7's item (3).\n"},"research/history/staging/head-residual-hl3.md":{"lf_sha256":"691b5ea985ae609fce750f301781cd24d996aec06d94561eda6d66f394c9b031","content":"# The head residual against Hardy-Littlewood: the endpoint deficit prices to five percent with no fitted parameter, the miss sits inside HL's own error term, and the head half of Z4 reduces to a conjecture strictly stronger than the one it was meant to help\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `verify-0830-record-defects.md` §3, CONFIRMED as an artefact and\n> AMENDED on mechanism, independent code).** Delta_meas = 0.6214 ± 0.0060 at\n> the pooled decade [1e7, 1e8) is a decade-pooling artefact: the sub-window\n> means read 0.6592, 0.6705, 0.6736 at 2, 4, 8 splits (halves 0.6848 ± 0.0111\n> and 0.6500 ± 0.0070; quarters 0.7203, 0.6842, 0.6677, 0.6565), the pooling\n> term being −0.0378, −0.0491, −0.0522 AT THIS DECADE ONLY (corrected\n> 2026-08-30 per `redteam-0830-slack.md` row 9: the queued sentence's range\n> \"0.038 to 0.052 at all three decades\" is the top decade's; the others are\n> −0.0455, −0.0592, −0.0655 at [1e6, 1e7) and −0.0524, −0.0706, −0.0757 at\n> [1e5, 1e6), so the effect is LARGER at lower height, and the residual term\n> inside the eighths, estimated at +0.005, measures +0.0004 at sixteenths),\n> of which the between-slope (λ/2)\n> piece is 46 to 50% and the rest is the within slope's own fall with height\n> weighted by Var(g). The 5.3% remainder with \"the same sign across three\n> decades\" is therefore an estimator artefact, and the half-decade reading in\n> `attack-0830-head-remainder.md` (\"HL within 1.6 se, alternating sign\") is\n> itself pooled: halves re-read from eighths (0.7005, 0.6638) put HL 2.5 to\n> 3.4% BELOW the measurement at about 2 se in 5 of 6 half-decades. See §3.3\n> there for the sentence-level replacements of §0 and §6.\n\nSTATUS: HELD, staging. Not integrated, not red-teamed. Companion script\n`research/history/staging/head-residual-hl3.js` (embedded, 1.6 s, no random\nnumbers, `--check` green). Its SEC 0 re-sieves [1e5,1e6), [1e6,1e7) and\n[1e7,1e8) independently and reproduces `head-residual-null.js` SEC 2 in that\nfile's own convention, including the four-row left/right deficit profile to the\nprinted digit, before anything below is computed. If that control had failed\nnothing here would stand.\n\nTask: TODO Z4, head half, sitting on `research/history/staging/head-residual-factor.md`\nand `research/history/staging/head-residual-null.md`. Their per-window numbers\nare the control targets, not inputs to be trusted.\n\n---\n\n## 0. What is still open, and what failed\n\n**Hardy-Littlewood over-predicts the deficit, and the miss does not shrink.**\nThe zero-parameter HL prediction for Delta = 2 - beta at [1e7,1e8) is 0.6545\nagainst a measured 0.6214 +- 0.0060, a ratio of 1.053, so HL over-predicts by\n5.3 percent. The two lower decades give 1.038 (+- 0.022) and 1.147 (+- 0.059).\nFour to five percent of Delta is not accounted for, the sign of the miss is the\nsame at every window and at every cut of the profile, and nothing here derives\nit [MEASURED, script SEC 3]. The statistical size of the miss is not the\nbinding number and is not reported as one: it is 5.49 OLS standard errors, 6.51\nunder an interleaved jackknife and 3.31 under a contiguous-block jackknife\n[MEASURED, `redteam-0828-head.js`]. The miss is a 0.276 percent discrepancy in\nalpha amplified 19.29x by the near-cancellation in\nDelta = E[g](alpha - lambda_s), and it sits inside HL's own unquantified\n1/ln x term at ln x = 17.7 (§6). It is not evidence against HL.\n\n**The prediction is not a derivation of anything, because HL is stronger than\nwhat it is being used to support.** The prime k-tuple conjecture implies the\ntwin prime conjecture. Anything this file establishes about beta is conditional\non a statement that already settles the question the programme is attacking. The\nuseful content is negative and structural, not evidentiary [PROVEN, by\ninspection of what is assumed].\n\n**The one-opener sum the task asked for does not converge, so the question as\nposed has no answer.** Summing (1 - S(0,2,2+d)/S(0,2)) over d does not converge\nand Cesaro averaging does not rescue it: the Cesaro mean of the ratio is 0.9999\nby T = 1e5, so the leading term cancels and a logarithm survives. The partial\nsums run 3.429, 5.688, 8.475, 12.924 at T = 30, 120, 1000, 100000, fitting\nc ln T + C with c = 0.844 over six points in [1e3, 2e5]; a four-point subset of\nthe same points gives 0.722, so c is pinned to about 15 percent [MEASURED,\n`redteam-0828-head.js`]. This is Montgomery-Soundararajan behaviour\ntransposed to a triple. What makes the deficit finite is the gap\nlength, which cuts the sum off, so the cutoff is the model and cannot be\nfinessed away [MEASURED, script SEC 1].\n\n**Two of `head-residual-null.md` §3's three readings do not survive.** Its\nreading 2, that the left-heavy profile is \"the mechanism naming itself\", is\nwrong: the HL correlation around a twin pair is exactly reflection-symmetric, so\nit cannot produce a physical left-right asymmetry at all, and it still\nreproduces the measured 4.079 ratio (predicting 4.232) out of a binning\nartefact. Its reading 3 over-prices the opener pair's two slots by 3.19x in that\nfile's own convention. Both corrections are in §4 below.\n\n---\n\n## 1. The conditional density, exactly [PROVEN, given HL]\n\nFor an admissible k-tuple H, S(H) = prod_q (1 - nu_q(H)/q)/(1 - 1/q)^k with\nnu_q(H) the number of distinct residues of H mod q. HL k-tuple gives\n#{n <= x : n + h prime for all h in H} ~ S(H) x / (ln x)^k.\n\n**One opener.** Given (a, a+2) a twin pair, the conditional density of a prime\nat a + t is psi(t)/ln x with psi(t) = S(0,2,t)/S(0,2). Its local factors:\n\n- q = 2: nu_2({0,2,t}) is 1 on even t and 2 on odd t, so psi = 0 on odd t.\n- q = 3: a twin opener has a = 2 mod 3, so {0,2,t} covers Z/3 exactly when\n t = 1 mod 3, so psi = 0 there.\n- q >= 5: nu_q = 2 iff q | t(t-2), else 3.\n\nDividing out S(0,2)'s own local factors leaves, on live t (t even, t not 1 mod 3,\nwhich is t = 0 or 2 mod 6, one third of all t),\n\n psi(t) = 3 * P5 * prod_{q >= 5, q | t(t-2)} (q-2)/(q-3),\n P5 = prod_{q >= 5} (1 - 2/((q-1)(q-2))).\n\nComputed, 3*P5 = 2.164809083 against the independent route through the published\nprime-triplet constant, S(0,2,6)/S(0,2) = 2.858248596/(2 C2) = 2.164809087\n[MEASURED, agreement to 4e-9, script SEC 1]. The live set is exactly the\n\"d = 0, 2 mod 6\" the sibling names in its reading 3.\n\n**The right opener is the same function.** For m = b - u below a pair (b, b+2)\nthe tuple is {0, u, u+2}, whose reflection is {0, 2, u+2}, and the singular\nseries is invariant under reflection. So the density there is psi(u+2). **HL\nmakes the depletion around a twin pair exactly reflection-symmetric in the\ndistance from the pair, with no free parameter to break it** [PROVEN, given HL].\n\n**A gap is bounded by two pairs, so psi is the wrong object for it.** The\nconditioning set is {0, 2, g, g+2}, and the exact conditional density at a + t is\n\n rho(t,g) = S(0,2,t,g,g+2) / S(0,2,g,g+2).\n\nEvery twin gap above 3 has 6 | g, both openers being odd and 2 mod 3, checked on\nall 439,085 gaps of the three windows with zero exceptions. The local factors:\n\n- q = 2: factor 2 on even t, 0 on odd t.\n- q = 3: factor 3/2 on t = 0, 2 mod 3, 0 on t = 1 mod 3.\n- q >= 5: nu_4 = 2 if q | g, 3 if q | g-2 or q | g+2, else 4;\n nu_5 = nu_4 if q | t(t-2)(t-g)(t-g-2), else nu_4 + 1;\n factor = (1 - nu_5/q) / ((1 - nu_4/q)(1 - 1/q)).\n\nTwo things follow that the product psi(t) psi(u+2) gets wrong, so the\nfactorized form is not used anywhere below. First, the product double-counts\nq = 2 and q = 3 by a factor 3. Second, at q = 5 with nu_4 = 4 the four endpoints\nalready occupy four of the five classes mod 5, so one residue class of t is\nbarred outright and the factor is zero; the product cannot see that. The second\ncheck on the local factors is rho's own mean. Nothing forces it to 1 at finite\ng: it is a Gallagher-type average that 1 is approached by, and the measured\n0.9582, 0.9760, 0.9827, 0.9910 over the interior at g = 300, 606, 1002, 2010 is\nthat approach, not a check that passed [MEASURED, script SEC 2].\n\nNothing in this section is new. It is the standard conditional singular series;\nthe repo's own `research/history/staging/w1-singular-series.md` already\nidentifies S(0,2,v,v+2)/S(0,2)^2 as the fold comb W1. rho is one point larger\nthan that object and is used here for a different purpose.\n\n---\n\n## 2. What beta's intercept actually measures, and what the gap conditioning does\n\n**The identity.** E[n] = 2 + lambda_s E[g] holds exactly in the data, since\nE[n] = lambda E[g], E[g] = 1/lambda_2 and lambda_s = lambda - 2 lambda_2. So\nwriting the OLS line as E[n | g] = beta + alpha g,\n\n Delta = 2 - beta = E[g] (alpha - lambda_s)\n\nis the part of the prime count that does NOT scale with the gap length: the\ntotal endpoint deficit per gap, measured against the bulk density far from\neither opener [PROVEN, algebra; it is `head-residual-null.md` §3's identity\nread the other way round].\n\nThe consequence matters. Any part of the deficit that grows with g, and §0 says\nthe HL part grows like c ln g, is split by the OLS between alpha and beta rather\nthan landing wholly in beta. So the comparison cannot be made by summing a\nprofile. It is made here by pushing the model through the same OLS the sibling\nruns: E[n | g] = 2 + kappa W(g) with W(g) = sum_{t=3}^{g-1} rho(t,g), then\nalpha_HL = kappa Cov(W,g)/Var(g) and beta_HL = E[n] - alpha_HL E[g]. **kappa is\nnot fitted**: the identity above fixes it at kappa = lambda_s E[g]/E[W], giving\n0.05136 against the measured lambda_bulk = 0.05101 and alpha = 0.05079.\n\n**The gap's own conditioning is already in lambda_s, and its non-uniform part is\nthe leading omission.** A gap is defined by no interior position being an\nopener. Under the programme's null that condition is exactly the thinning\nlambda to lambda_s, which kappa carries. Two local consequences that might have\nneeded adding do not: a+4 and b-2 must be composite or the gap would end early,\nand both are already zero in rho by the mod-3 factor. What is not carried is the\ncorrelation between where rho peaks and where an interior opener is likely,\nwhich thins the comb's peaks harder than its floor and so flattens it. That has\nthe right sign to explain a five percent over-prediction and it is not priced\nhere [HEURISTIC, direction only, no number].\n\n---\n\n## 3. The comparison [MEASURED against HEURISTIC]\n\nAll numbers from the script's embedded block. HL's column has no fitted\nparameter in it.\n\n**Delta = 2 - beta.**\n\n| window | Delta measured | Delta HL | ratio |\n|---|---|---|---|\n| [1e5,1e6) | 0.6899 +- 0.0355 | 0.7914 | 1.147 |\n| [1e6,1e7) | 0.6862 +- 0.0148 | 0.7124 | 1.038 |\n| [1e7,1e8) | 0.6214 +- 0.0060 | 0.6545 | 1.053 |\n\nSwapping the measured gap-length law for an exponential law of the same mean\nmoves the top window's prediction from 0.6545 to 0.6463, so the miss is not the\ngap law. The bulk slope by contrast is priced to 0.3 percent: alpha_HL = 0.05093\nagainst a measured 0.05079.\n\n**The d-profile, in the sibling's exact binning convention.**\n\n| cut | left meas | left HL | right meas | right HL | sum meas | sum HL |\n|---|---|---|---|---|---|---|\n| d < 30 | 0.4626 | 0.4838 | 0.1134 | 0.1143 | 0.5761 | 0.5981 |\n| d < 60 | 0.4929 | 0.5049 | 0.1557 | 0.1641 | 0.6486 | 0.6690 |\n| d < 90 | 0.4966 | 0.5185 | 0.1421 | 0.1577 | 0.6388 | 0.6762 |\n| d < 120 | 0.5295 | 0.5623 | 0.1942 | 0.2241 | 0.7236 | 0.7864 |\n\nPoisson standard deviation is 0.0053 on one 30-wide shell and 0.0107 on a d<120\ncumulative, so the d<120 sum's miss of 0.063 is about four standard deviations.\nShare of the d<120 total sitting inside d<30: measured 0.796, HL 0.761, against\nthe sibling's stated 80 percent. Left-to-right ratio at d<30: measured 4.079, HL\n4.232.\n\n**The shell structure the sibling could not place is in the comb.** Its reading\n1 recorded shells beyond d=30 contributing 0.0725, -0.0098, 0.0849, non-monotone\nand unlike the Montgomery-Soundararajan shape it was tested against. HL gives\n0.0709, +0.0072, 0.1102 for the same three. Across the eight shell deficits, four\nleft and four right, measured against HL correlates at r = 0.9989, and still at\n0.9518 with the two dominant d<30 shells dropped. The sign of the [60,90) shell\nis missed, measured -0.0098 against HL +0.0072, which is within two standard\ndeviations of zero either way. **rho is not smooth in t, and a 30-wide shell\nsamples it unevenly. That, not a mechanism, is what the non-monotonicity is.**\n\n---\n\n## 4. Two corrections to `head-residual-null.md` §3\n\n**The left-heaviness is a binning artefact.** rho is exactly reflection-symmetric\nabout a pair, so HL has no way to make the deficit physically left-heavy, and it\npredicts 4.232 against the measured 4.079 anyway. The whole of it comes from two\nplaces. First, the script's cntL skips the forced pair, so d = 0 and d = 2 read\nas empty slots and contribute 2 lambda_bulk = 0.1020 to the left column and\nnothing to the right. Second, the left column's 30-shell runs over\ndistance-from-pair t = 3..29 while the right column's runs over t = 3..32,\nbecause the right index is offset by the two positions b-1 and b; t = 30 and\nt = 32 are both live and carry large rho, so they subtract about three units\nfrom the right column's first shell. The sibling's sentence \"the asymmetry is\nthe mechanism naming itself\" is withdrawn there. The symmetry also holds\nwithout HL: measured over 381,332 pairs, the prime count per pair at\ncentre-distance +s and -s agrees to 0.70 Poisson sd out to s = 199, 11.9752\nagainst 11.9807 [MEASURED, `redteam-0828-head.js`, no model].\n\n**The \"two live positions\" bracket is the d = 0, 2 term of this expansion, and\nit is over-priced by 3.19x.** The sibling puts the opener pair's two slots at\n6 lambda_s = 0.289 to 7.5 lambda_s = 0.361, about half of Delta, by charging\neach occupied slot the per-LIVE-slot density (30/8) lambda_s. Its own statistic\nsums (lambda_bulk - count_d/gaps) over ALL d, which is a flat baseline in which\ntwo excluded slots are worth exactly 2 lambda_bulk = 0.1020, sixteen percent of\nDelta rather than fifty-two. The anatomy at the mean gap g = 234, in lambda_bulk\nunits: pair slots 2.000, the |d| < 30 field 5.495, everything beyond 6.192,\ni.e. 0.1020 + 0.2803 + 0.3158 of the measured 0.6214.\n\n---\n\n## 5. The rate, which is the one thing that moves\n\nHL's comb sums to c ln T and the gap cuts it off at T of order\nE[g] = ln^2 p/(2 C2), so Delta should vanish like lnln p / ln p rather than like\n1/ln p. Measured on the prediction: Delta_HL * ln p / lnln p = 4.022, 4.005,\n4.025 across the three windows, flat to 0.5 percent, which is a property of the\nprediction and not a measurement, since the log divergence is built into the\nmodel that produces it. The measured version, 3.506, 3.857, 3.822, is flat only\nover the top two windows.\n\n**`head-residual-null.md` §3's closing line, \"everything in Delta is O(1/ln p)\",\nis one lnln p too fast** if HL is right, and it is the same lnln p that §0 of\nthat file could not separate from a constant on the h - R fit over the available\nlever arm. The two statements are the same ambiguity seen twice.\n\n---\n\n## 6. What closes, and what HL leaves\n\n**HL prices the head's residual to within five percent, so Z4's head half\nreduces to HL and does not close.** Granting the prime k-tuple conjecture,\nDelta = 2 - beta is the correlation of primes with the two twin pairs bounding\ntheir gap, it vanishes like lnln p/ln p, hence beta tends to 2; with CV^2 tending\nto 1 that gives beta CV^2 tending to 2 and h/R tending to 1, which is\n`head-residual-factor.md` §3's open question answered conditionally on a\nconjecture that already implies twin primes. **The correct summary of the head\nhalf is now \"measured consistent with HL to five percent, nothing derived beyond\nHL\"** [CONJECTURED on HL; the consistency is MEASURED].\n\n**What HL leaves is 0.033 out of 0.621 at [1e7,1e8), 5.3 percent, same sign at\nthree windows and at four cuts.** The same-sign pattern is the honest content;\nthe standard-error framing is dropped, running 3.31 to 6.51 depending on the\nerror model and attaching a significance to a 5 percent agreement with a\nzero-parameter conjecture. Named candidates, none priced: the\nnon-uniform part of the no-interior-opener conditioning (§2, right sign); HL's\nown error term, which at ln x = 17.7 could carry a 1/ln x correction of about\n0.06 in relative terms and so is the right order; and the factorization-free but\nstill five-point truncation of the conditioning set, which ignores that the\nneighbouring gaps' openers also sit at known distances.\n\nNothing in this file touches Z2, and nothing in it bears on the conjecture.\nIt makes the head half smaller and more clearly conditional, which is a\nreduction in what is claimed, not an advance.\n\n---\n\n## Defects noticed in passing\n\n- `head-residual-null.md` §3 reading 2's \"the asymmetry is the mechanism naming\n itself\" is not supportable: HL is reflection-symmetric and predicts the\n asymmetry from binning alone. §4 above.\n- `head-residual-null.md` §3 reading 3's bracket [0.289, 0.361] is computed in a\n per-live-slot baseline while the statistic it is compared against uses a flat\n one. Same object, 3.19x apart. §4 above.\n- `head-residual-null.md` §3's closing \"everything in Delta is O(1/ln p)\" is\n O(lnln p/ln p) under HL. §5 above.\n- `head-residual-null.md` §3 reading 1 rejects the MS shape on the grounds that\n the shells are non-monotone. The shells are non-monotone in HL too, at\n r = 0.9518, so non-monotonicity was never evidence against a singular-series\n account; only the accrual RATE was.\n- `research/GLOSSARY.md` still has no entry for **opener**, **head** or\n **tail**. Flagged by both siblings, still true.\n\n---\n\n## What would falsify this, and whether that check has run\n\n| Claim | Rung | Falsifier | Run? |\n|---|---|---|---|\n| psi and rho's local factors are right | MEASURED (two independent routes) | 3*P5 differing from the published triplet-constant route; rho's interior mean not approaching 1 | YES. 2.164809083 against 2.164809087; rho's mean 0.9582 to 0.9910 over g = 300 to 2010 |\n| every twin gap has 6 \\| g | PROVEN (openers are odd and 2 mod 3) | one gap in the data with 6 not dividing g | YES, 439,085 gaps, zero exceptions |\n| the one-opener deficit sum diverges | MEASURED | D(T) flattening above T = 2e5 | PARTIAL. T <= 2e5 only, and D(T) is noisy: D(T)/ln T swings 0.95 to 1.23, and c = 0.844 reads 0.722 on a four-point subset of the same points, so c is pinned to about 15% |\n| Delta = 2 - beta is the g-independent endpoint deficit | PROVEN (algebra) | E[n] = 2 + lambda_s E[g] failing in the data | YES, it is an identity, and alpha, beta reproduce the sibling at three windows |\n| HL prices Delta to about 5%, over-predicting | MEASURED against HEURISTIC | the ratio crossing 1 at greater height, or the miss vanishing inside HL's own error term | YES at three windows, ratios 1.147, 1.038, 1.053, a 5.3% miss at the top (3.31 to 6.51 s.e. by error model, and inside HL's 1/ln x term at ln x = 17.7). NO above 1e8 |\n| the miss is not the gap-length law | MEASURED | a different gap law moving the prediction by more than the miss | YES. Exp law of the same mean moves 0.6545 to 0.6463, a quarter of the miss |\n| the left-heaviness is binning, not mechanism | PROVEN (rho's reflection symmetry) + MEASURED | a measured L/R ratio that HL cannot reach | YES, HL gives 4.232 against 4.079 |\n| the pair's two slots are worth 2 lambda_bulk, not 6 to 7.5 lambda_s | PROVEN (the statistic's own baseline) | the sibling's statistic using a per-live-slot baseline after all | YES, read from `head-residual-null.js` SEC 2's accumulator |\n| Delta vanishes like lnln p/ln p under HL | HEURISTIC | the MEASURED Delta * ln p/lnln p drifting over a longer lever arm | PARTIAL, and weak. The prediction's own 4.022, 4.005, 4.025 is flat by construction; the measured 3.506, 3.857, 3.822 is flat only over the top two windows, ln p in [13.1, 17.7] |\n| the residual 5% is the no-opener conditioning | CONJECTURED | an exact treatment of that conditioning giving the wrong sign or the wrong order | NO. Not attempted; only the sign is argued |\n| beta -> 2 and hence h/R -> 1 | CONJECTURED on HL | nothing available below the k-tuple conjecture | NO, and it cannot be run: HL implies the conjecture the programme is attacking |\n\nThe cheap check not run is the siblings': the same three quantities at 1e12,\nwhich would take the lever arm from ln p <= 17.7 to <= 27.6 and say whether the\nfive percent miss is a 1/ln p error term or a floor. This file adds one number\nto want from that pass, Delta_HL/Delta_meas, and one shape, the eight shell\ndeficits against rho.\n"},"research/history/staging/head-residual-null.md":{"lf_sha256":"f369c54712f2795d9710293c363ae59332a28961ee88df44d72becf5fdce3e73","content":"# The head residual against the programme's own null: the null settles the direction and misses the rate by a power of ln p, and beta carries the miss\n\n\n\nSTATUS: HELD, staging. Not integrated, not red-teamed. Companion script\n`research/history/staging/head-residual-null.js` (embedded, 1.6 s, seeded\nsimulation, `--check` green). Its SEC 2 re-sieves [1e7,1e8) independently and\nreproduces the sibling's E[g], E[n], beta and CV^2 for that window to 1e-3\nbefore it measures anything new; if that control had failed nothing below would\nstand.\n\nTask: the null half of TODO Z4's head question, sitting on top of\n`research/history/staging/head-residual-factor.md`, whose measured per-window\nnumbers are quoted here from its embedded block and are nowhere recomputed.\n\n---\n\n## 0. What is still open, and what failed\n\n**The null does not reproduce the measured residual, and the miss is not\nsubtle.** Under the programme's standard Poisson-Hardy-Littlewood null for\ntwin gaps the residual is\n\n h - R = -4 C2 / ln p, h/R - 1 = -8 C2^2 / ln^3 p\n\nwhich is NEGATIVE and one power of ln p faster than the measured\n+8.4704/ln^2 p (8.4661 under the sibling's own error model; the two refits use\nthe same six points and differ only in how the errors are estimated). That\nfitted law is local, not a limit law: under beta CV^2 -> 2 with D -> -0.95 the\nsibling's identity sends h - R to D, so h/R - 1 approaches 0 from BELOW and the\ncoefficient has to change sign. On the sibling's six half-decade points the\nzero-parameter null sits at chi2/df = 1362 (script SEC 3). Ratio of measured\nto null runs -14.0, -27.7, -26.5, -36.0, -40.1 up the five decades, widening. **The head's residual\nis not a renewal artefact** [MEASURED, script SEC 1].\n\n**The composed rate is not separable on this lever arm.** Both null-deviation\nfactors carry O(lnln p / ln p) corrections, so the composed prediction is\nh - R ~ ((b+2c)/2) lnln p rather than a constant. Over the six half-decades\nlnln p moves only 15.5%, and h - R = 6.008 constant (chi2/df 1.295) against\nh - R = 2.126 lnln p (0.887) is not a discrimination [MEASURED, script SEC 3].\nThe sibling's 8.4661/ln^2 p and a lnln-p-modulated version of it are the same\nfit at this height.\n\n**The variance note's sub-Poisson constant does not transport, so TODO item 9's\n[0.46, 0.72] is not an input here.** The renewal identity\nVar N(L) / E N(L) -> CV^2(g) requires an L-plateau. The twin-candidate process\non the wheel has none: `paper/variance-note.md` §6 shows Var/E falling\nmonotonically in the window exponent u (0.845 at u = 0.6 down to 0.076 at\nu = 3), and §2's sum rule forces it to 0 at L = P exactly. So the u = 2\ndiagonal value 0.3958 of §7, and with it the intercept `varE-asymptotic.md`\nleaves unpinned across [0.46, 0.72], are a different object from CV^2(g) and\nneither predict nor bound it [PROVEN that the identity fails, from the note's\nown §2 sum rule; the numbers are the note's].\n\n**No derivation of the excess was reached.** What follows names the object that\ncarries it and prices it, at MEASURED and HEURISTIC.\n\n---\n\n## 1. Fixing the null [PROVEN, given the stated model]\n\nThe null R = E[g^2]/(2E[g]) presumes is a **renewal** process on the twin\nopeners, which is what makes R the inspection-paradox functional at all. The\nmatching structural null in this corpus is `zonegap-03-model.md` §3's matched\npure-Exp / Kourbatov-Wolf process, exponential gaps at mean ln^2 x / (2 C2).\nStated so it also fixes the prime count inside a gap:\n\n- primes near p are Poisson at rate lambda = 1/ln p;\n- a fraction theta = lambda_2/lambda = 2 C2 / ln p of them are twin openers,\n the marking independent of everything else.\n\nWritten as a **cluster** process so the prime density stays honest: a cluster is\neither a twin pair (an opener, two primes 2 apart) or a solitary prime; cluster\nrate lambda_c = lambda(1 - theta), a cluster is an opener with probability\nq = theta/(1 - theta), solitary rate lambda_s = lambda_c(1 - q) =\nlambda - 2 lambda_2.\n\n**CV^2_null = 1 exactly.** An independent q-thinning of a Poisson process is\nPoisson, so the opener gaps are Exp(lambda_2) and CV^2 = 1 with no correction\nterm at all.\n\n**beta_null = 2 in the continuum, 1.898 discrete.** Splitting a marked Poisson\nprocess leaves the opener and solitary processes independent, so given a gap\n[a, a+g) the interior solitary primes are Poisson(lambda_s) on it. With\nn = 2 + K counting the opener a and its partner a+2,\n\n E[n | g] = 2 + lambda_s g, so alpha_null = lambda_s and beta_null = 2,\n\nwhere the interior is charged over the full length g. That is the continuum\nvalue; the discrete-consistent version, and the convention the measured beta\nlives in, is 1.898, worked out in the next paragraph.\n\n**The sibling's quoted null 2 - 2/ln p puts the two forced primes on a\nfull-density interior** [DEFECT, see §5], which over-counts primes by\n2 - 2/ln p per gap, about 14% of E[n] at [1e7,1e8). Thinning the interior to\nlambda_s over the g - 2 positions the pair does not occupy gives\nbeta = 2 - 2 lambda_bulk = 1.898 in the convention the measured beta uses; 2\nexactly is the continuum value, reached by letting the interior run over the\nfull length g. The sibling's 1.887 is off by 0.011, not by 0.113, and the 0.102\nbetween 1.898 and 2 is the same object §3 reading 3 prices as the pair's two\nslots. The limit is the same either way, so the sibling's §3 conclusion is\nunaffected.\n\n**D_null = 0 exactly.** The interior primes are uniform given their count, so\nS - n g/2 = g - 2 identically and A = A_forced with no remainder.\n\n**Hence the null's residual.** With E[g] = 1/lambda_2, E[g^2] = 2E[g]^2,\nE[n] = 1/theta,\n\n h - R = -2 / E[n] = -2 theta = -4 C2 / ln p\n h/R - 1 = -2/(E[n] E[g]) = -8 C2^2 / ln^3 p = -3.4865 / ln^3 p.\n\nEquivalently beta_null x CV^2_null = 2 exactly, so the two ln p terms of the\nsibling's identity h - R = [ln p - 4C2/ln p] + D - (beta CV^2/2) ln p cancel\nidentically. **Under the null, h/R -> 1.** That is not what the null buys: the\nsibling's identity gives h/R -> 1 for any bounded beta CV^2, and what the null\nadds is the rate, which it gets wrong by a power of ln p, and the sign, which\nit gets wrong too.\n\nAll six statements are checked in the continuum convention by direct\nsimulation at 4,000,000 seeded gaps matched to [1e7,1e8) (script SEC 0):\nCV^2 = 0.9998, beta = 1.9984,\nalpha = 0.04816 against lambda_s = 0.04817, D = -0.0103, h - R = -0.1424\nagainst -2/E[n] = -0.1497.\n\n## 2. Where the discrepancy sits: beta, by about 5 to 2 and widening [MEASURED]\n\nSplit the shortfall exactly: 2 - beta CV^2 = (2 - beta) CV^2 + 2(1 - CV^2).\nScript SEC 1, on the sibling's decade numbers:\n\n| window | beta | CV^2 | shortfall | beta's share | CV^2's share |\n|---|---|---|---|---|---|\n| [11,1e4) | 1.028 | 0.7436 | 1.2356 | 0.7228 (58%) | 0.5128 (42%) |\n| [1e4,1e5) | 1.079 | 0.7406 | 1.2009 | 0.6821 (57%) | 0.5188 (43%) |\n| [1e5,1e6) | 1.310 | 0.8281 | 0.9152 | 0.5714 (62%) | 0.3438 (38%) |\n| [1e6,1e7) | 1.314 | 0.8520 | 0.8805 | 0.5845 (66%) | 0.2960 (34%) |\n| [1e7,1e8) | 1.379 | 0.8941 | 0.7670 | 0.5552 (72%) | 0.2118 (28%) |\n\nbeta is the larger carrier at every window and its share is rising. CV^2 is\nclosing on 1 faster than beta is closing on 2. The 72/28 split is one of two\nexact decompositions of 2 - beta CV^2; taking the factors in the other order,\n2 - beta CV^2 = (2 - 2 CV^2) + CV^2(2 - beta), reads 81/19 at the same window.\nThe rise survives both orders, the split level does not.\n\n## 3. What beta's deficit is, as an object [MEASURED]\n\nE[n] = 1/theta is an identity, not a model claim, so\n\n beta = 2 - (alpha - lambda_s)/lambda_2 exactly.\n\nA beta below 2 is therefore not an abstraction: it is a deficit of\nDelta = 2 - beta primes near the two openers that bound a gap, paid for by a\nbulk interior density above lambda_s. Measured: Delta = 0.972, 0.921, 0.690,\n0.686, 0.621 up the decades, with the bulk excess +24%, +15%, +9%, +7%, +5%.\n\nScript SEC 2 measures the interior-prime density profile against distance from\nan opener, on the 107,722 gaps of [1e7,1e8) with g >= 300, shells aligned to 30\nso the mod-30 house structure averages out inside each shell:\n\n| d | left | right | sum |\n|---|---|---|---|\n| < 30 | 0.4626 | 0.1134 | 0.5761 |\n| < 60 | 0.4929 | 0.1557 | 0.6486 |\n| < 90 | 0.4966 | 0.1421 | 0.6388 |\n| < 120 | 0.5295 | 0.1942 | 0.7236 |\n\nThree readings, all with the caveat that this is band-restricted (28% of the\nwindow's gaps) and its baseline lambda_bulk = 0.05101 exceeds the global OLS\nslope alpha = 0.05079 by 0.4%, so 0.7236 against 2 - beta = 0.621 is agreement\nto 16%, not an identity.\n\n1. **The deficit is local, not log-divergent.** 0.5761 of 0.7236, 80%, sits\n within d < 30. The shells beyond contribute 0.0725, -0.0098, 0.0849\n (+-0.0053 Poisson), non-monotone, against the steady 0.11 per nat a\n Montgomery-Soundararajan singular-series-average deficit would give. **The\n MS shape is not what the profile shows** [MEASURED, and it refutes this\n pass's own first guess]. The MS bracket does land on the right size, 0.446\n for one-prime conditioning and 0.892 for pair conditioning against measured\n 0.621, but a bracket that wide and a shape that wrong is not a derivation.\n2. **The left-heavy column, 0.5295 against 0.1942, is a binning artefact and\n not a mechanism.** The prime field around a twin pair is symmetric: measured\n over 381,332 pairs, the prime count per pair at centre-distance +s and -s\n agrees to 0.70 Poisson sd out to s = 199, 11.9752 against 11.9807 primes per\n pair [MEASURED, `redteam-0828-head.js`, no model]. Hardy-Littlewood says the\n same without measuring, the conditional density being exactly\n reflection-symmetric about the pair centre, and it reproduces the 4.079 ratio\n at 4.232 out of the binning alone (`head-residual-hl3.md` §4). The two causes\n are this script's skipped pair slots and the right column's 30-shell running\n over t = 3..32 against the left's t = 3..29.\n3. **About a sixth of it is the two live positions the opener pair occupies.**\n The statistic above sums lambda_bulk - count_d/gaps over every d, a flat\n baseline, so the two excluded slots are worth 2 lambda_bulk = 0.1020 against\n the d < 120 profile total 0.7236, 14.1 percent, and 2 lambda_s = 0.0963\n against Delta = 0.621, 15.5 percent [MEASURED, `head-residual-hl3.md` §4,\n confirmed on independent code]. The per-live-slot conversion 30/8 does not\n belong here: the continuum null charges 2 units of LENGTH at density\n lambda_s, not two live slots at the per-live-slot density.\n\nEverything in Delta is O(1/ln p) in this reading, so beta -> 2 follows from\nit, and slowly. Under Hardy-Littlewood the rate is one lnln p slower,\nO(lnln p/ln p) (`head-residual-hl3.md` §5), and the available lever arm does\nnot separate the two. Neither is a proof: this is the shape of one measured\nprofile at one height, and the residual 20% beyond d = 30 is not accounted\nfor.\n\n## 4. CV^2, and what the variance note can and cannot say [HEURISTIC]\n\nCV^2_null = 1 exactly (§1). The measured deficit 1 - CV^2 = 0.2564, 0.2594,\n0.1719, 0.1480, 0.1059 is not derived here.\n\nThe variance note's numbers are the right kind of object at the wrong scale.\nGap scale is L = E[g] with sieve level y = sqrt(x), so the window exponent is\nu = 2 ln E[g] / ln x, which runs 0.846, 0.779, 0.704, 0.642, 0.593 up the five\ndecades and tends to 0 like 4 lnln x / ln x. Evaluated there, §6's empirical\nshape ln(Var/E) ~ -(0.24 u^2 + 0.13 u) at y = 401 gives 0.7544, 0.7813, 0.8101,\n0.8332, 0.8508 against measured CV^2 0.7436, 0.7406, 0.8281, 0.8520, 0.8941.\nRight size, right drift direction, and CV^2 -> 1 follows from u -> 0. Three\nreasons this is HEURISTIC and not more: the renewal identity that would license\nreading a count-variance ratio as CV^2(g) fails for this process (§0); the\nfit is at y = 401 and the note's own §6 point 2 says the ratio at fixed u\ndrifts upward with y; and the two middle windows sit on the wrong side.\n\n## 5. What this buys, and what it does not\n\nThe head coefficient still does not derive. The sibling reduced it to\nCV^2 -> 1 and h/R -> 1; this pass shows both hold **under the null**, exactly,\nand that the null is wrong about the residual by a factor 40 and a sign at\n[1e7,1e8). So the reduction survives but the null cannot close it, and the\nobject left standing is beta's endpoint deficit: local, symmetric about the\npair once the binning is fixed, about a sixth of it priced by the discreteness\nthe continuum null drops, and O(1/ln p) here against O(lnln p/ln p) under\nHardy-Littlewood.\n\nNothing in this file touches Z2, and nothing in it bears on the conjecture.\n\n## Defects noticed in passing\n\n- `head-residual-factor.js` SEC 2b's stated null \"beta = 2 - 2 lambda (the two\n forced left-end primes on an interior Poisson process of rate lambda)\" is not\n density-consistent: that model has E[n] = lambda E[g] + 2 - 2 lambda, which\n over-counts primes by 14% at [1e7,1e8). The density-consistent value in that\n script's own convention is 2 - 2 lambda_bulk = 1.898, and 2 exactly is the\n continuum value; the script's 1.887 is off by 0.011. Its §3 conclusion is\n unaffected because every version tends to 2.\n- `head-residual-factor.md` §5 calls CV^2 -> 1 \"the standard Poisson-limit\n statement for twin gaps\" and §3 calls it \"a Hardy-Littlewood consequence\".\n Neither is cited to a source in the corpus, and this pass did not find one;\n it is CONJECTURED here, not PROVEN.\n- `paper/variance-note.md` §6's table is at fixed y = 401 while §6 point 2\n records that the ratio at fixed u drifts with y. Any use of the (c_1, c_2)\n fit away from y = 401, including §4 above, is an extrapolation the note does\n not license and does not flag.\n- `research/GLOSSARY.md` still has no entry for **opener**, **head** or\n **tail**, all three load-bearing here and in Z4. The sibling flagged the last\n two.\n\n---\n\n## What would falsify this, and whether that check has run\n\n| Claim | Rung | Falsifier | Run? |\n|---|---|---|---|\n| beta_null = 2, CV^2_null = 1, D_null = 0, h - R = -2/E[n], all exact in the continuum convention | PROVEN (given the stated null) | the seeded simulation missing any of them | YES, 4e6 gaps, all five inside tolerance. The discrete-consistent beta_null is 1.898, not 2 |\n| the null's h/R - 1 = -8 C2^2/ln^3 p is refuted by the data | MEASURED | the null fitting the six half-decade points | YES, chi2/df = 1362, zero parameters, and the sign is wrong at every window |\n| beta carries 72% of the shortfall at [1e7,1e8), rising | MEASURED | the split reversing at greater height | NO. Five decades only, the split is a decomposition of one identity rather than two independent measurements, and the other exact order of the same identity reads 81/19 at that window |\n| Delta = 2 - beta is an endpoint prime deficit, localized within d < 30 | MEASURED | the profile flattening only past d = 120, or the deficit continuing to accrue at 0.11 per nat | PARTIAL. One window, one band (g >= 300), d <= 120 only; 20% of the total is unexplained beyond d = 30 |\n| the deficit is not the MS singular-series-average shape | MEASURED | shell contributions turning steady at 0.11 per nat over a longer d range | PARTIAL, d <= 120, and the non-monotone shells are not the evidence: Hardy-Littlewood's own shells are non-monotone too and correlate with the measured ones at r = 0.9518 with the two dominant shells dropped (`head-residual-hl3.md` §3). Only the accrual RATE separates them |\n| about a sixth of Delta is the opener pair's two live positions | MEASURED (from the statistic's own flat baseline) | the accumulator using a per-live-slot baseline after all | YES. 2 lambda_bulk = 0.1020 and 2 lambda_s = 0.0963, 14 to 16 percent; the earlier [0.289, 0.361] bracket was the per-live-slot conversion applied to a flat-baseline statistic |\n| the variance note's u = 2 number does not bound CV^2(g) | PROVEN (from the note's own §2 sum rule) | a renewal-plateau in L for the twin-candidate process | YES, by the sum rule: Var/E -> 0 at L = P |\n| note §6's shape at u_gap predicts CV^2 | HEURISTIC | the prediction missing beyond its two-window spread at 1e12 | NO. Two of five windows already sit on the wrong side |\n| beta -> 2 and CV^2 -> 1, hence beta CV^2 -> 2 and h - R bounded | CONJECTURED | Delta or 1 - CV^2 stalling above 1e8 | NO. Same 1e12 pass the sibling queues; this file adds beta's profile as a second thing to measure there. h/R -> 1 itself needs only that beta CV^2 stays bounded |\n\nThe cheap check not run, and it is the sibling's: the same decomposition at\n1e12, which would take the lever arm from ln p <= 17.9 to <= 27.6. Two\nadditions this file wants from it: the endpoint profile of §3 at that height\n(does Delta fall like 1/ln p?), and the shell contributions past d = 30 over a\nlonger range.\n"},"research/history/staging/item-x-offset.md":{"lf_sha256":"56b36842f16025a152ab819929ff445179bb8a7b09ee063bf059198b25cfe867","content":"# The ~3.8 law's −0.45% offset: the candidate family priced, two mechanisms tested, and the @37 discriminator\n\n\n\n*(2026-08-20. TODO item X, after both blind tests: `1 − J = 4S₂` is the last\nlaw standing and is NOT exact — a relative offset of −0.41% (@29) and −0.48%\n(@31), the same absolute residual ≈ 1.19e−4 at both sharp levels, detected at\nz = −2.32 on the corrected slot-clustered σ (@31) and only consistent at −0.43\n(@29). The open analytic target must now produce the offset, not just the law.\nThis file prices the finite-level-correction family against the exact\nresiduals, measures where the deficit lives, and pre-registers the @37 test\nthat separates the survivors. Producers, all three formally embedded:\n`research/attack-x-offset-01-terms.js` (170 s),\n`research/attack-x-offset-02-profile.js` (2948 s),\n`research/attack-x-offset-03-cofactor.js` (117 s). Pre-registration for @37:\n[xchan-at37-offset-prereg.md](xchan-at37-offset-prereg.md), committed alone.\nCalibration is marked on every claim: MEASURED, DERIVED, REFUTED, POST HOC.)*\n\n## Verdict\n\n**The offset's best available description is a finite-level correction of S₃'s\nsize and sign — `1 − J = 4S₂ − S₃` scores z = +0.04 (@29) and −0.41 (@31)\nwhere the standing law scores −0.43 and −2.32 — but it is POST HOC, and the\nblind test that decides it is @37, pre-registered and committed alone**\n([xchan-at37-offset-prereg.md](xchan-at37-offset-prereg.md), commit `0a7dd73`).\nWhat this pass settles outright, at high significance:\n\n1. **The σ behind the @31 detection is calibrated.** Seven known-truth control\n draws land inside 1.9σ; the instrument does not manufacture a −0.45%-scale\n offset (§4).\n2. **Two candidate corrections and one shape are REFUTED on existing data**:\n `4S₂ − 4S₃` (5.3σ), `4Σ1/(q(q+2))` (12.4σ), and the locality shape\n `1−J ∝ E_super[Σ_{q∈Q} q⁻²]`, whose constant would have to grow 120 → 572\n (§2).\n3. **The marginal-discrepancy mechanism does not carry the offset**: re-basing\n the denominator on measured per-prime strike counts moves the residual by\n +118% at @29 but by −55% at @31 (and −145%/−224% at the noisy levels) —\n sign-erratic where a real mechanism must be stable (§5).\n4. **The raw 11/17 line is itself biased**, J_line − 1 = +4.03e−3 at @31\n (z = 147.6), positive and decaying across four levels: the natal J that\n `4S₂` fits to half a percent is the NET of a positive lattice bias and a\n deeper sieve deficit, 1 − J/J_line = 1.15–1.18 × 4S₂ (§3).\n5. **The far-super-W surplus component is now DERIVED**: on the strips where\n the scour pair's only eligible cofactor is 1, the natal count is\n pairs·(1/4)·∏_{7≤p≤x}(p−2)/(p−1) — verified to 0.001% over 5.05e8 pairs at\n @31 — an enrichment over the smooth model of exactly ∏_{p≤x} p/(p−1)\n → e^γ ln x (§6b).\n6. **The deficit is a structured profile, not a constant** — octave deficits\n spanning 0.006 to 0.059 with sign flips, each bin hundreds of σ from the\n aggregate (§6a). Any derivation of the ~3.8 constant, and of its offset,\n must produce this profile; an aggregate-only argument cannot be checked\n against it and should not be believed.\n\n## 1. Units, and what the offset is\n\nEverything here is in J-units: `J = obs/CRT` is a dimensionless ratio of\ncounts, `obs` the mixed super-`W` triple census over the natal set of `[0,W)`\nand `CRT` the smooth model's expectation `6·N̄·Σ_{∏Q>W} 1/∏Q`\n(`research/xchan-at29-01-segmented.js`, whose embedded OUTPUT is the source of\nevery measured input below). Three different numbers describe the same\nmismatch and are not interchangeable:\n\n- **Δ = 4S₂ − (1−J)_meas**, the ABSOLUTE residual in J-units. Positive means\n the closed form predicts a deeper deficit than measured. Δ = **+1.201e−4**\n at @29 and **+1.185e−4** at @31 — the same number to 1.3%.\n- **d = (1−J)_meas/4S₂ − 1**, the RELATIVE offset, σ-free: **−0.41%** and\n **−0.48%**.\n- **z = −Δ/σ_slot**, the significance on the slot-clustered σ of the\n pooled-floor fix (`defect-repairs.md` item 3): **−0.43** (@29, a\n non-detection) and **−2.32** (@31, the one detection).\n\nSo the offset is one 2.3σ detection plus one consistent non-detection, and\nany model of it is a model of essentially one measured number. That is why\nthis file prices a FAMILY against exact arithmetic, tests mechanisms that are\nmeasurable at high significance today, and pushes the decision to @37.\n\n## 2. The candidate ladder against the exact residuals (producer 01)\n\n`research/attack-x-offset-01-terms.js` computes the correction sums exactly\n(S₃ = Σ_{x W, not about the sieve).\n\n## 5. The marginal-corrected denominator (producer 02, measurement 3)\n\nThe census accumulates the exact per-prime strike counts n_q^L, n_q^R over\nnatal slots and rebuilds the denominator from them:\n`CRT' = N̄·Σ_{i **#{natal r in the strip} = #pairs · (1/4)·∏_{7≤p≤x}(p−2)/(p−1)** —\n\nan enrichment over the smooth model of exactly **∏_{p≤x} p/(p−1) → e^γ ln x**\n(Mertens). **[MEASURED, DERIVED]** Verified per strip at four strips per\nlevel: aggregate relative deviation +0.191% (@19, n = 10,134), +0.026%\n(@23), +0.006% (@29), **+0.001% (@31, n = 68,409,827 natal points over\n5.05e8 pairs)**. Measured enrichment 6.5423 against derived 6.5423 at @31.\n\nThis is the mechanism of the far-octave and near-√W surpluses in §6a, on the\nline (enrichment 30/8 = 3.75, no base factors) and amplified on the natal\nset (∏ p/(p−1), growing like e^γ ln x) — the first exactly-derived component\nof the joint census. It is a SURPLUS component: it pushes J up, against the\nbulk deficit, and its weight is concentrated where the profile's sign flips.\nDeriving the full small-cofactor contribution (cofactors that are scour\nprimes and semiprimes, and the b-side divisor coupling) is the natural\ncontinuation of the item's analytic target, and it is a closed-form\ncomputation over prime sums, not a census.\n\n## 7. What this does not show\n\n- **No derivation of 4S₂, and none of the offset.** The candidate C1 = 4S₂ − S₃\n is a POST HOC scale match; the cofactor-layer law (§6b) derives a COMPONENT\n of the census, not the law. The open analytic target of TODO item X is\n narrowed, not met.\n- **The offset is still one detection.** Nothing here adds a sharp level; @37\n is where the family separates, and its pre-registration is committed.\n- **The fitted members are two-point descriptions** with ~40% parameter error\n bars; no shape claim is made from them.\n- **The multiplicative line/sieve split is a model.** J = J_line·(J/J_line) is\n arithmetic; reading J/J_line as \"the sieve-only deficit\" assumes the natal\n mask samples the line's lattice bias neutrally. The random-mask control\n supports that for random masks; the natal mask is not random.\n- **j = 4 remains untouched**, as in the record.\n\n## 8. Files touched\n\n- `research/attack-x-offset-01-terms.js`: new, embedded (170.2 s), READINGS\n appended below the OUTPUT banner, binding re-checked.\n- `research/attack-x-offset-02-profile.js`: new, embedded, READINGS appended,\n binding re-checked.\n- `research/attack-x-offset-03-cofactor.js`: new, embedded (116.8 s),\n READINGS appended, binding re-checked.\n- `research/history/staging/xchan-at37-offset-prereg.md`: new, committed\n **alone** before any @37 census of any kind exists.\n- `research/history/staging/item-x-offset.md`: this file.\n\nNo live document was edited. The TODO item X update is proposed in §10 and\nnot applied.\n\n## 9. Gate\n\n**Before:** `node research/qc.js` TOTAL = 2, both pre-existing and neither\nthis session's: the documented `natal-cap-27-t4-at13.js` embeds finding, and\nan `uncited-script` on another live session's `attack-advmin-1113.js`.\n\n**After:** `node research/qc.js` TOTAL = **0** — all eleven checks clean,\nincluding `scripts` (all three producers are cited by this file) and `embeds`\n(the three OUTPUT bindings verify with the READINGS appended). The two\npre-existing findings cleared under the shared tree while this session ran;\nnone of this session's files ever appeared in the finding set.\n\nAll three producers are formally embedded; READINGS were appended below the\nOUTPUT banners. `embed.js --check` re-verified code-sha256 and out-sha256 on\nproducers 01 and 03 by full re-execution; producer 02's binding is verified\nby the static `embeds` check above (its own `--check` is a second 2948 s\ncensus execution and was left running when this file was written — its\nverdict, PASS or FAIL, belongs to the session record, and a FAIL would be a\nreproducibility finding against a file whose two prior executions agreed).\n\n## 10. Proposed update to TODO item X (report only, not applied)\n\nReplace the clause *\"the derivation stays the open analytic target and must\nnow produce the offset too\"* with:\n\n> The offset now has a priced candidate family\n> (`research/history/staging/item-x-offset.md`): `4S₂ − S₃` fits both sharp\n> levels inside 0.5σ (POST HOC — found against the known residuals), the\n> ≥ 4S₃-sized corrections and the per-triple locality shape are REFUTED, the\n> marginal-discrepancy and instrument/σ mechanisms are closed by measurement,\n> and the @37 blind test that separates {no correction | shrinking S₃-scale |\n> constant absolute} at 4.8–9.1σ is pre-registered\n> (`xchan-at37-offset-prereg.md`, committed alone at `0a7dd73`; the @37\n> natal census is an overnight run on the existing segmented instrument).\n> Two structural facts now constrain the derivation itself: the natal J is\n> the net of a POSITIVE line-lattice bias (J_line − 1 = +4.03e−3 at @31,\n> z = 148, decaying) and a deeper sieve deficit (1.15–1.18 × 4S₂ under the\n> multiplicative split); and the deficit is a structured profile (octave\n> bins 0.006 to 0.059 with a sign flip, each 100σ+ from the aggregate) whose\n> far-super-W surplus component is exactly derived: the cofactor-one layers\n> are natal-enriched by ∏_{p≤x} p/(p−1) → e^γ ln x, verified to 0.001% at\n> @31 (`research/attack-x-offset-03-cofactor.js`). An aggregate-only\n> derivation of the ~3.8 constant is no longer checkable-complete: it must\n> reproduce the profile tables.\n"},"research/history/staging/lit-dickman-variance.md":{"lf_sha256":"116d227b8666ba4bb5da4b08a3a60c70e767cbce40dc60ca69d6c63d7f1a1d7c","content":"# The two-class short-interval variance in the literature: Gorodetsky read at source, the k-tuple object located, its asymptotic absent\n\n\n\n*Staging note, 2026-08-28. Prior-art pass on `varE-spectral.md` §5 and §9, run\nunder the fence \"one new file, no edits, no git\". This note edits nothing and\nproposes rows for other files without applying them. Every artifact named in §7\nwas fetched this session and carries its sha256. Numbers marked\n`[SCRATCHPAD-GRADE]` come from an unembedded script in the session scratchpad\nand may not be quoted elsewhere until they are produced inside an embedded\nproducer.*\n\n---\n\n## 0. Verdict, disconfirming half first\n\n**The claim that `varE-spectral.md` §9 was told not to make is still not\navailable.** Nothing found in six channels states `λ₂`, states `λ_θ` for any\n`θ > 1`, or computes the short-interval variance of a two-class sifted set to an\nasymptotic. So the honest verdict is **PARTIAL, leaning ABSENT**, and the\nabsence is worth less than it looks, for three reasons stated before the rest:\n\n1. **The object is not absent. Only its asymptotic is.** Aryan, *Mathematika*\n **61** (2015) 72–88, defines exactly the corpus's statistic, at general\n tuple size, six years before Gorodetsky. He proves an upper bound on it and\n no asymptotic. So this is not virgin ground; it is ground somebody walked\n across without stopping.\n2. **The generalized Dickman law `GD(θ)` is published probability**, with the\n density and delay equation `varE-spectral.md` §5 writes down. Calling\n `λ_θ(u) = Pr[GD(θ) > u]` a new function would be wrong. What is not in print\n is the identification of that tail with a sieve variance at `θ > 1`.\n3. **One channel that should have decided this is dead by emptiness rather than\n by search.** Gorodetsky's paper has, across three citation indexes, exactly\n one citing work, and it is a statistics paper about bootstrap diagnostics.\n A citation graph with one edge cannot rule out a successor; it can only fail\n to find one. The MathSciNet leg is bibliographic-only and cannot see review\n text, and Google Scholar was never reachable. Both legs are owed.\n\n**A correction this pass owes back to the corpus, and it is the one thing here\nthat moves a number.** `import-rough-anatomy.md` §0.6 compares the corpus's\nmeasured census dispersion against `λ(s) = e^{−γ}∫_s^∞ρ`, Gorodetsky's `λ`, and\nrecords a factor of 12 to 23. That comparison uses the wrong member of the\nfamily. Gorodetsky's `λ` is `λ₁`, the one-excluded-class case; the corpus's\ncensus counts rough **pairs**, which is two excluded classes per prime, so its\ncomparand is `λ₂`. Evaluated at the corpus's own band coordinates\n`s = 2.317` and `s = 2.608`, `λ₂` reads **0.3403** and **0.2508**\n`[SCRATCHPAD-GRADE]` against the cited `χ²/df = 0.718` at B8, a factor of\n**2.11 to 2.86**. The like-for-like `λ₁` figures at the same 0.718 are 13.9\nand **25.2**; `import-rough-anatomy.md` §0.6's 22.7 is the top of a six-band\nrange and attaches to a different band's `χ²/df`, so it is not the second\ncomparand (`redteam-0828-varE.md` §7). The mismatch shrinks by a factor of\nabout 6.6 to 8.8 and does not close. Nothing here says the residual factor of\ntwo is explicable; it may be a hypothesis violation, a difference between a census\nerror statistic and a uniform-window variance, or a real disagreement. Two\nchecks that would separate those are named in §9 and neither has run.\n\n---\n\n## 1. Gorodetsky at source: the exact scope, in one paragraph and then in detail\n\nOfir Gorodetsky, *The variance of integers without small prime factors in short\nintervals*, **Math. Z. 308 (2024) no. 4, Paper No. 59**, DOI\n`10.1007/s00209-024-03601-w`, preprint arXiv:2111.00853v3 (21 Oct 2024, 24 pp),\nMR4812487, MSC 11N25. **[SOURCED, verbatim, full PDF read this session]**.\n\n**Scope in one sentence.** The paper computes the asymptotic short-interval\nvariance of the indicator `α_y` of a **single** integer free of prime factors\n`≤ y`, that is, one excluded residue class per prime, and it never forms,\nstates, conjectures or names the two-class or `k`-tuple sifted set as an object\nof study.\n\nThe detail that matters here:\n\n- **The object.** `V(X,H,y) = (1/X)∫₀^X (Σ_{x 1` result found, and what it does and does not give\n\n**Farzad Aryan, *The distribution of `k`-tuples of reduced residues*,\nMathematika 61 (2015) no. 1, 72–88, MR3333962, MSC 11N36 / 11N69, preprint\narXiv:1302.2296v2. [SOURCED, verbatim, full PDF read this session].**\n\nThis is the closest thing in print to a `θ > 1` version of the object, and it\nwas reached through the \"reduced residues\" convention rather than through\nanything containing the word \"rough\".\n\n- **It forms the object exactly.** His Lemma 1.2 defines, for `q` squarefree and\n `D = {h₁,…,h_s}` admissible,\n `M_k^D(q,h) = Σ_{n=0}^{q−1} | Σ_{m=1}^{h} k_q(n+m+h₁)···k_q(n+m+h_s) −\n h ∏_{p|q}(1 − ν_p(D)/p) |^k`,\n where `k_q` is the coprimality indicator; the paper writes that bracket\n without absolute-value bars, which is the same object at the even `k` used\n here. At `k = 2`, `s = 2`, `D = {0,2}` and\n `q = q_y` this is `q_y` times the corpus's variance of the twin-rough count in\n a window of length `h`, with the corpus's own main term. The excluded-class\n count `ν_p(D)` is the corpus's `θ` and his Remark 1.1 records `ν_p(D) = s` for\n `p > h_s − h₁`, which is the corpus's `α_p = p − 2` for `p ≥ 7`.\n- **What he proves is an upper bound only.** `M_k^D(q,h) ≪ q h^{k/2}\n P^{−2^{ks}+ks}` with `P = φ(q)/q`, the implied constant depending on\n `k` and `s`. The exponent is nested, read on a rendered page image of page 5\n (`redteam-0828-varE.md` §7). There is no\n main term, no asymptotic, no `u = log h/log y` coordinate, and grep over the\n full text returns zero hits for `variance`, `Dickman`, and `ρ`. The bound's\n `h^{k/2}` shape is the naive probabilistic one, so at `k = 2` it says the\n variance is `O(h)` and says nothing about the constant, which is the entire\n content of `λ_θ(u)`.\n- **His target is a different theorem.** Theorem 0.1 is the `s`-tuple analogue\n of the Erdős–Hooley–Montgomery–Vaughan conjecture on moments of **gaps**\n between reduced residues, `V_λ^D(q) ≪ φ_D(q)P^{−sλ}`. The interval moment is\n machinery, not the result.\n- **Nobody followed it.** Two citing works on OpenAlex (`Distribution of Squares\n Modulo a Composite Number`, 2015; `Lemke Oliver and Soundararajan bias for\n consecutive sums of two squares`, 2021), neither on this object.\n\n**Reading.** The `θ = 2` variance has been bounded above with the right main\nterm subtracted, in a paper from 2015 that Gorodetsky does not cite and that\ndoes not cite anything Dickman-shaped. It has not been evaluated. The gap\nbetween Aryan's `≪ qh` and a constant is the same gap `varE-spectral.md` §2\nnames as its unproven decoupling step, seen from the other side.\n\n---\n\n## 3. The pieces of a general-`θ` framework that do exist\n\nStated so the note does not read as \"nothing exists\", which would be false.\n\n| piece | status | where | what is missing for `θ = 2` |\n|---|---|---|---|\n| the local densities `∏(1 − ν_p(h)/p)` for arbitrary tuples, with a fundamental-lemma error term | **published, general `k`** | Gorodetsky Lemma 1.4, via Friedlander–Iwaniec Thm 6.12 **[SOURCED, verbatim]** | nothing; this is usable as stated |\n| the tuple second moment as an object, with an upper bound | **published, general `s`** | Aryan Lemma 1.2, Mathematika 61 (2015) **[SOURCED, verbatim]** | the asymptotic |\n| the exact closed form that makes the primorial case computable at `θ = 1` | **published** | Hausman–Shapiro, *Comm. Pure Appl. Math.* **26** (1973) 539–547, formula (1.21) as quoted by Gorodetsky §1.6.1 **[SOURCED-BIB**, quoted through Gorodetsky, not read**]**; Montgomery–Vaughan, *Ann. of Math.* **123** (1986) 311–333 **[SOURCED-BIB]** | **the `s`-tuple analogue. Not found. This is the single missing identity.** |\n| the law `GD(θ)` with density `e^{−θγ}ρ_θ/Γ(θ)` and `xρ_θ'(x) + (1−θ)ρ_θ(x) + θρ_θ(x−1) = 0` | **published probability** | Pinsky, *On the strange domain of attraction to generalized Dickman distributions*, arXiv:1611.07207; Penrose–Wade 2004; Bhattacharjee–Goldstein, *Bernoulli* 25 (2019); Arratia–Barbour–Tavaré tradition **[SOURCED-BIB**, abstracts and secondary statements only**]** | nothing; `varE-spectral.md` §5's `f_θ` is this density verbatim, and its mean `θ` is the published mean |\n| sums of a dimension-`κ` multiplicative function over smooth integers, which is what the `θ = 2` decoupled sum is | **published, general `κ`** | Tenenbaum–Wu, *Compos. Math.* **144** (2008) 339–376 and the I/II/IV papers; Hanrot–Tenenbaum–Wu, *Proc. LMS* **96** (2008) 107–135; Smati–Wu 1999; Naimi 2003 **[SOURCED-BIB**, zbMATH review text only**]** | the identification is this note's, and it is untested. See §9 |\n| an upper bound on the variance of sieve weights in short intervals at general dimension | **published, unquantified here** | Friedlander–Iwaniec, *Opera de Cribro* §6.10, Prop. 6.26 and Cor. 6.28 **[SOURCED-BIB**, known only through Gorodetsky §1.2's description; the book was not opened**]** | whether it is dimension-general at all is **NOT CHECKED** |\n\nThe last row is the one a future pass should open first, because if Prop. 6.26\nis stated for a general sieve dimension then the `θ = 2` upper bound is in a\ntextbook and Aryan is not the nearest neighbour.\n\n---\n\n## 4. Channels, queries, calibration\n\nPer `SEARCH-CONVENTIONS.md`, a negative counts only from a channel calibrated\nin the same session on a known positive.\n\n| channel | calibration probe, same session | result | negatives usable |\n|---|---|---|---|\n| **arXiv abs pages** (`export.arxiv.org/abs/…`) | `2111.00853` returns the Math. Z. journal reference | HTTP 200, correct record | yes |\n| **arXiv PDF** (`arxiv.org/pdf/…`) | three PDFs fetched, all `application/pdf`, sha256 in §7 | live | yes |\n| **arXiv API** (`export.arxiv.org/api/query`) | not reached | **HTTP 429 \"Rate exceeded\" on every attempt, `http` and `https`, curl and urllib** | **no. This leg is owed** |\n| **arXiv web search** (`arxiv.org/search/`) | `maximal gaps between twin primes` returns exactly arXiv:1901.03785 | 1 of 1, correct | yes, with the caveat below |\n| **zbMATH** (`api.zbmath.org`) | `Jacobsthal function primorial` returns 4 records including Ziller–Morack; `variance integers without small prime factors short intervals` returns exactly Gorodetsky | correct on both | yes, remembering that HTTP 404 is a zero and that long queries return unreliable zeros |\n| **MathSciNet** (`POST mathscinet.ams.org/mrlookup`) | `au=Gorodetsky, ti=variance` returns MR4812487, MR4349131, MR4244849; `ti=tuples reduced residues` returns MR3333962 (Aryan) | correct on both | yes, **title fields only**; no review text, no abstract, no MSC search |\n| **OpenAlex, `cites:` filter** | `cites:W3171452153` returns 23 | live | yes |\n| **OpenAlex, topic/title search** | `title.search:reduced residues` does **not** return Aryan's paper in 50 results, though its title contains the phrase | **calibration FAILED** | **no. Count no negative from OpenAlex search** |\n| **OpenCitations v2** | `citation-count/doi:10.4007/annals.2015.181.1.7` returns 168 | live | yes |\n| **Semantic Scholar graph API** | `/citations` on an unrelated arXiv id returns a populated list; the `/paper` endpoint returned HTTP 429 once | partially live | citations endpoint yes, metadata endpoint owed |\n| **WebSearch** | `variance of k-tuples of integers free of small prime factors in short intervals Dickman` returns Gorodetsky's Springer and arXiv pages first | correct | yes |\n| **Google Scholar** | not attempted | unreachable by design here | **owed** |\n\n**A caveat that voids several zeros.** The arXiv web search treats a multi-word\nquery as a conjunction over metadata only, so long queries return zero for\ntrivial reasons and short ones return noise. `variance rough numbers short\nintervals` returns **0** while `variance integers without small prime factors\nshort intervals` returns exactly Gorodetsky. The word \"rough\" is in his\nintroduction, not his abstract. Any negative from this channel on a query\ncontaining \"rough\" is worthless, and that is a convention lesson, not a\nfinding.\n\n**Citation graph on Gorodetsky, three channels, calibrated:** OpenAlex 1,\nOpenCitations 0, Semantic Scholar 1. The one citing work in both nonzero\nchannels is Sanyal–Pillai, *Bootstrap Diagnostics for Fixed Factored Integers*,\n*Sankhya A* (2026), DOI `10.1007/s13171-026-00450-z`, which is not on this\nobject.\n\n**Queries run, with their answers.** All 2026-08-28.\n\n| query | channel | answer |\n|---|---|---|\n| `variance integers without small prime factors short intervals` | arXiv, zbMATH | exactly Gorodetsky, both |\n| `variance rough numbers short intervals` / `\"rough numbers\" variance` | arXiv | 0, and void, see the caveat |\n| `rough numbers short intervals variance` | zbMATH | exactly Gorodetsky |\n| `variance sifted set short intervals` | zbMATH | 0 (HTTP 404) |\n| `variance sifted integers short intervals` | arXiv | 0 |\n| `sifted numbers short intervals` | zbMATH | 1, Maier–Sankaranarayanan on exponential sums, not the object |\n| `ti = variance sifted` | MathSciNet | 0 records |\n| `variance prime k-tuples short intervals` | arXiv | 0 |\n| `variance prime tuples short intervals singular series` | zbMATH | 0 |\n| `variance coprime tuples short intervals` | zbMATH | 0 |\n| `moments of sifted sets short intervals` | arXiv | 0 |\n| `generalized Dickman distribution` | arXiv, zbMATH | 18 and 30 records, all probability or smooth-number, none a sieve variance |\n| `generalized Dickman function sieve dimension` | zbMATH | 0 |\n| `Dickman distribution sieve dimension` | arXiv | 0 |\n| `Dickman function generalization` | zbMATH | 3, Smati–Wu 1999, Naimi 2003, Covo 2009 |\n| `Poisson approximation rough numbers intervals` | arXiv | 0 |\n| `distribution of k-tuples of reduced residues` | zbMATH, MathSciNet | **Aryan 2015**, the §2 hit |\n| `Hausman Shapiro reduced residues` | zbMATH | 2, Diamond–Vaaler 1985 and Aryan |\n| `distribution of reduced residues Montgomery Vaughan` | zbMATH | 3, none with a tuple asymptotic |\n| `twin smooth numbers` | zbMATH | 15, all the cryptographic Prouhet–Tarry–Escott convention. **A false friend: \"twin smooth\" is owned by isogeny cryptography, Costello–Meyer–Naehrig 2021 and successors, and returns nothing about sieves** |\n| `pairs of rough numbers` | zbMATH | 12, all rough-set theory and fluid dynamics. Another false friend |\n| `ti = rough numbers intervals` | MathSciNet | 3, all fuzzy-set decision theory |\n| `Kuperberg Lalin` | arXiv | 4, all divisor-function symplectic variances, not sifted sets |\n| `Montgomery Soundararajan primes in short intervals` | arXiv | located math/0409258, read, see below |\n| `Variance of B-free integers in short intervals` | WebSearch, arXiv | Avdeeva arXiv:1512.00149, read, see below |\n\n**Two named checks the brief asked for, both negative at source.**\n\n- **Montgomery–Soundararajan, *Primes in short intervals*, Comm. Math. Phys.\n 252 (2004) 589–617, arXiv:math/0409258 [SOURCED, full PDF read].** Grep over\n the full text returns **zero** hits for `sifted`, `sieve`, `Dickman`, `rough`,\n `small prime factors` and `free of prime`. The paper computes moments of\n `ψ(x+h) − ψ(x)` under Hardy–Littlewood and supplies no sieve-level analogue.\n The singular-series moment machinery is there; the sifted-set instance is not.\n- **Avdeeva, *Variance of `B`-free integers in short intervals*,\n arXiv:1512.00149 [SOURCED, full PDF read].** Asymptotic variance for `B`-free\n integers, one condition per modulus, `B` a multiplicative semigroup. Grep\n returns zero for `Dickman`, `residue class`, `classes`, `tuple`. Adjacent\n convention, not the object.\n- Bloom–Kuperberg, arXiv:2312.09021, *Odd moments and adding fractions*, is odd\n moments of coprime residues in short intervals and averages of the refined\n singular series for **odd** `k`. The variance is the even case they do not\n treat, and the object is coprimality to a general `q`, not `θ` classes per\n prime. **[SOURCED, abstract only]**.\n\n---\n\n## 5. Independent check of `varE-spectral.md` §5's table\n\nThe delay equation `xρ_θ'(x) + (1−θ)ρ_θ(x) + θρ_θ(x−1) = 0` with\n`ρ_θ(x) = x^{θ−1}` on `(0,1]`, as published for `GD(θ)`, was integrated\nnumerically at `θ = 2` on a grid of 200000 points to `t = 8`\n`[SCRATCHPAD-GRADE]`. Total mass 0.99999078 and mean 1.99992259 against the\npublished 1 and `θ = 2`. The tail reproduces the note's own table at every\nentry: 0.943257, 0.842382, 0.657116, 0.455456, 0.282040, 0.157654 at\n`u = 0.6, 1.0, 1.5, 2.0, 2.5, 3.0`, and the closed form\n`1 − e^{−2γ}(9/2 − 4 ln 2)` agrees with the numeric `λ₂(2)` to eight decimals.\n\nThis is a reproduction, not a validation of the physics. It confirms that the\nnote's `f₂` is the published `GD(2)` density and that its arithmetic is right.\nIt says nothing about whether `λ₂` is the limit of the corpus's variance ratio,\nwhich is exactly the step `varE-spectral.md` §2 leaves unproven.\n\nTwo further values, for §0's correction: `λ₂(2.317) = 0.340295` and\n`λ₂(2.608) = 0.250829` `[SCRATCHPAD-GRADE]`. Both\nreproduce in the red team's independent re-derivation (`redteam-0828-varE.md`\n§7), so they carry a second witness; the tag stays until they are produced\ninside an embedded producer.\n\n---\n\n## 6. Drafted rows, NOT APPLIED\n\n### 6.1 `research/SEARCH-CONVENTIONS.md` §1\n\n| object | our name | canonical | **OWNING convention — search THIS** | where it lives |\n|---|---|---|---|---|\n| the variance of a `θ`-class sifted count in a window | `Var/E`, `X(L)`, `λ₂(u)`, the twin-rough census dispersion | short-interval variance of a `κ`-dimensional sifted set | **at `θ = 1`: \"the variance of integers without small prime factors in short intervals\"**, coordinate `u = log H/log y`. **At `θ ≥ 2` the owning convention is not the rough-number one at all: it is \"the distribution of `k`-tuples of reduced residues\"**, `ν_p(D) = #{h_i mod p}`, `φ_D(q) = ∏_{p|q}(p − ν_p(D))`, and the statistic to search for is the `k`-th moment `M_k^D(q,h)` of the count in an interval of length `h`. Do **not** search \"sifted\", \"sub-Poisson\", \"dispersion\", or \"rough\". \"rough numbers\" is in nobody's abstract and \"twin smooth\" belongs to isogeny cryptography | `θ = 1`: Gorodetsky, *Math. Z.* **308** (2024) Paper 59, Thms 1.1, 1.3. `θ = s`: Aryan, *Mathematika* **61** (2015) 72–88, Lemma 1.2 and Thm 0.1; behind it Montgomery–Vaughan, *Ann. of Math.* **123** (1986) 311–333 and Hausman–Shapiro, *CPAM* **26** (1973) 539–547 |\n| the limit law of `log n` for the decoupled divisor | `GD(θ)`, the generalized Dickman law | generalized Dickman distribution | **\"generalized Dickman distribution `GD(θ)`\"**, density `e^{−θγ}ρ_θ/Γ(θ)`, delay equation `xρ_θ' + (1−θ)ρ_θ + θρ_θ(x−1) = 0`, mean `θ`; the arithmetic-side name is the **dimension-`κ` smooth sum** `Ψ_f(x,y)` with `F(s) = ζ(s)^κ G(s)` | Pinsky arXiv:1611.07207; Penrose–Wade, *Ann. Appl. Probab.* 14 (2004); Bhattacharjee–Goldstein, *Bernoulli* **25** (2019); arithmetic side Tenenbaum–Wu, *Compos. Math.* **144** (2008) 339–376 and Hanrot–Tenenbaum–Wu, *Proc. LMS* **96** (2008) 107–135 |\n\n### 6.2 `research/SEARCH-CONVENTIONS.md` §3 \"searches already run\"\n\n| question | answer | do not redo |\n|---|---|---|\n| Is the `θ = 2` short-interval sifted variance asymptotic in print? | **No, in six calibrated channels.** The object is in print with an **upper bound only** (Aryan 2015, Lemma 1.2, general tuple size); the asymptotic and its constant are not. Gorodetsky's Lemma 1.4 supplies the general-`k` local densities but he uses `k = 1, 2` and his stated future work is higher moments of the one-class count | settled at this level; **owed**: the arXiv API leg (429 all session), Google Scholar, MathSciNet review text, and *Opera de Cribro* §6.10 Prop. 6.26's dimension |\n| Does Gorodetsky name `GD(θ)`, sieve dimension, or tuples? | **No.** Zero hits for `tuple`, `twin`, `admissible`, `generalized`, `dimension`, `Poisson` in the full text of arXiv:2111.00853v3 | settled, grep over the read PDF |\n| Do Montgomery–Soundararajan (CMP 252, 2004) give a sieve-level analogue? | **No.** Zero hits for `sifted`, `sieve`, `Dickman`, `rough` in math/0409258 | settled |\n| Has anyone cited Gorodetsky's variance paper on this? | **One citing work across three calibrated citation indexes**, and it is a statistics paper on bootstrap diagnostics | re-run in 12 months, not sooner |\n| Is \"twin smooth\" or \"pairs of rough numbers\" a usable search term? | **No, both are false friends.** \"Twin smooth\" is isogeny cryptography (Costello–Meyer–Naehrig 2021); \"rough numbers\" in a title is fuzzy-set decision theory | never search either again |\n\n### 6.3 The rough-anatomy note's own drafted map row, proposed amendment sentence\n\n**Which row this is.** Not the live map's row 15. `research/IMPORT-MAP.md` row\n15 is the fractional-parts row (Saffari–Vaughan, the branch phase\n`⌊W/q⌋ mod M_T`), landed 2026-08-28, and it carries no Gorodetsky sentence at\nall. The row meant here is the one numbered 15 in\n`history/staging/import-rough-anatomy.md` §8.1, DRAFTED there and never applied\nto the live map, whose number was taken by the fractional-parts row instead.\nIts status cell says \"Gorodetsky owns the sub-Poisson convention and shares the\ncoordinate `s = ln W/ln y` and the factor `∏(1−2/p)` but his `λ(s)` is 12–23×\nbelow the measured `χ²/df`\", and the same figure sits in that note's §0.6,\nin its §8.4 drafted `SEARCH-CONVENTIONS.md` §3 row, and in the §9 bullet that\npoints back at §0.6. **All four places were corrected in place on 2026-08-28**\n(`history/staging/applied-0828-registries2.md`), so the amendment below is\nspent and is kept only as the wording that was applied. The proposed amendment\nwas: append\n\"**Corrected 2026-08-28**: his `λ` is the `θ = 1` member of a family and the\ncorpus's census is a two-class count, so the comparand is `λ₂`, which reads\n0.3403 to 0.2508 across the corpus's band coordinates against `χ²/df = 0.718`,\na factor of 2.11 to 2.86 against the like-for-like `λ₁` figures 13.9 and 25.2\nat the same `χ²/df = 0.718`; §0.6's 22.7 is a six-band maximum on a\ndifferent band and is not the comparand. The mismatch shrinks by 6.6 to 8.8×\nand does not close, and the `λ₂` values are `[SCRATCHPAD-GRADE]`.\"\n\n---\n\n## 7. Artifacts fetched this session\n\n| artifact | source | sha256 | how much was read |\n|---|---|---|---|\n| Gorodetsky, *The variance of integers without small prime factors in short intervals*, arXiv:2111.00853v3, 24 pp | `arxiv.org/pdf/2111.00853v3` | `069d1a4cd91db35c3ef618c5b64a16ea30e33fe2773d844383f4bb84360ca7a8` | full text extracted; §§1–2 read line by line, remainder grepped |\n| the same paper's arXiv abstract page, carrying the Math. Z. journal reference and DOI | `export.arxiv.org/abs/2111.00853` | `33239b4b6a55b40d61caba1c232cc82038719cdedb2a51095598a5af94a9aa8f` | full |\n| Aryan, *The distribution of `k`-tuples of reduced residues*, arXiv:1302.2296v2 | `arxiv.org/pdf/1302.2296` | `4a45903af6c1671554fa8c8a89d53640975085db47cf7b2241533ed83e258ae5` | full text extracted; Introduction and §1 read, remainder grepped |\n| Montgomery–Soundararajan, *Primes in short intervals*, arXiv:math/0409258 | `arxiv.org/pdf/math/0409258` | `4814387da412faf35d86f7e5d84a789cfa6743b08a6dff1e47fbc7632d7a8176` | full text extracted, grepped for the sieve-analogue question |\n| Avdeeva, *Variance of `B`-free integers in short intervals*, arXiv:1512.00149 | `arxiv.org/pdf/1512.00149` | `bba657edf393998a0b9aae1d3d80158d78e442161f233a5894274654ab87df7d` | full text extracted, grepped |\n\nRead as metadata or review text only, never at page image: Aryan's zbMATH\nreview (Zbl record 6417230, journal and MSC confirmed), Tenenbaum–Wu III and IV\nreviews, the OpenAlex and MathSciNet records named above.\n\n**Formula check.** Gorodetsky's `M(H,y)`, `g_y`, `λ(u)` and Theorem 1.3(1) were\nread from the `pdftotext -layout` extraction of the PDF, and cross-checked\nagainst the second extraction of the same equations in the arXiv abstract page's\nlisting and against the independent quotation of `M(H,y)` and `λ` already in\n`import-rough-anatomy.md` §6, which was taken from the arXiv HTML. Three\nrenderings agree. No page image was inspected, which is the residual risk on\nsubscripted ranges such as `2 < p ≤ y`.\n\n---\n\n## 8. Not reached\n\n- **The arXiv API was 429 for the entire session**, on both schemes and both\n clients. Every arXiv negative here comes from the web search interface, whose\n conjunctive behaviour voids long queries. The API leg is owed.\n- **Google Scholar was never attempted**, so the strongest full-text citation\n channel is absent and the \"one citing work\" figure is a floor, not a count.\n- **MathSciNet review text is unreachable** through `mrlookup`, which is\n bibliographic only. A successor stating `λ_θ` in a paper whose title does not\n say so is invisible to every channel used here except WebSearch.\n- **Hausman–Shapiro 1973 was not opened.** Formula (1.21) is quoted through\n Gorodetsky §1.6.1. Whether an `s`-tuple analogue of it is derivable, or was\n derived by Montgomery–Vaughan 1986 in passing, is **NOT CHECKED**, and\n Montgomery–Vaughan 1986 was not opened either.\n- **Friedlander–Iwaniec, *Opera de Cribro* §6.10 Prop. 6.26** is known here only\n through Gorodetsky's one-sentence description. Whether it is stated at general\n sieve dimension is the cheapest unopened question in this note.\n- **Tenenbaum–Wu and Hanrot–Tenenbaum–Wu were not opened.** §3's claim that the\n `θ = 2` decoupled sum is an instance of their dimension-`κ` framework is this\n note's identification from a zbMATH review, and it is untested.\n- **The corpus's census convention was not checked against Gorodetsky's.**\n §0's factor 2.11 to 2.86 assumes the corpus's `χ²/df` is a variance-to-mean\n ratio of the same statistic, in the same coordinate, with the same\n normalisation. That assumption is unverified, and if it is wrong the whole\n correction in §0 evaporates.\n- **Gorodetsky's hypotheses were still not evaluated at the corpus's `(W, y*)`**,\n which `import-rough-anatomy.md` §9 already recorded as owed. Reading his\n Theorem 1.1 this session does not discharge it, because the corpus's numbers\n were not substituted into `y ≥ (2+ε)log H` and (1.7).\n\n---\n\n## 9. What would falsify this, and whether that check has run\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| Gorodetsky's scope is one excluded class per prime, `k = 1`, second moment | PROVEN from the source | a `k`-tuple or two-class theorem anywhere in arXiv:2111.00853v3 | YES. Full text read, and `tuple`, `twin`, `admissible`, `dimension`, `generalized` return zero hits |\n| his `λ(u) = e^{−γ}∫_u^∞ρ` and `M(H,y) ∼ HP_yλ(u)` are as the corpus quotes them | PROVEN from the source | a mismatch against eqs (1.5), (1.10), (1.14) | YES, at three independent renderings; **NO** at page image |\n| the `θ = 2` asymptotic is not in print | CONJECTURED, at the strength of a calibrated multi-channel negative | any paper stating `λ_θ`, `GD(θ)` as a sieve variance limit, or an asymptotic for `M_k^D(q,h)` | PARTLY. Six channels calibrated, four legs owed (arXiv API, Google Scholar, MathSciNet reviews, *Opera de Cribro*) |\n| Aryan's `M_k^D(q,h)` at `k = s = 2`, `D = {0,2}`, `q = q_y` is the corpus's variance numerator | MEASURED by inspection of two definitions | a normalisation or main-term discrepancy between his `h∏(1−ν_p(D)/p)` and the corpus's `E` | NO. The two definitions were compared by eye, never by evaluating both at one level |\n| Aryan supplies no asymptotic | PROVEN from the source | a main term in his Lemma 1.2 or §3 | YES. Full text read; `variance`, `Dickman`, `ρ` return zero hits |\n| the corpus's comparand is `λ₂`, not `λ₁` | HEURISTIC | the corpus's census turning out to count single rough integers, or to normalise its `χ²/df` differently | NO. The census's definition was taken from `import-rough-anatomy.md` §6's phrase \"rough-pair census\" and was not read at its producer |\n| `λ₂` at the corpus's bands is 0.3403 to 0.2508, giving a factor 2.11 to 2.86 | MEASURED, `[SCRATCHPAD-GRADE]` | an embedded producer disagreeing | PARTLY. The red team reproduces both values (`redteam-0828-varE.md` §7); this note's own delay-equation integration is an unembedded scratchpad script, and only its `u = 2` value is checkable against a closed form, which it matches to 8 decimals |\n| `GD(θ)` is published and `varE-spectral.md` §5's `f_θ` is its density | PROVEN from secondary statements | a discrepancy in the delay equation or the `Γ(θ)` normalisation | YES against two independent secondary statements of the density and the mean; **NO** against a primary |\n| the `θ = 2` decoupled sum is a dimension-`κ` smooth sum in Tenenbaum–Wu's sense | CONJECTURED | their hypothesis class excluding `g` with `g(p) ≈ 2/p` | NO. Neither paper opened |\n| there is no successor to Gorodetsky on this | MEASURED, weakly | one paper in a full-text index | PARTLY. Three citation indexes calibrated, all returning the same single irrelevant citing work; no full-text index reached |\n| this route is novel | **NOT CLAIMED, and it should not be claimed** | Aryan already owns the object; the constant is what is open | the object question is answered NO. The constant question is answered \"not found\", which is weaker |\n\n*History layer: process record, staging. See `research/history/CHANGELOG.md` for\nthe corpus rule. This note applied no edit and ran no git command.*\n"},"research/history/staging/lit-smooth-divisors.md":{"lf_sha256":"975711a742532dd043a57ba36e8bf9693fef80776eb40e20919d45d410cfcc1d","content":"# The divisor-distribution estimate behind lim Var/E, searched in the Ford/Hooley convention: the machinery is in print, the statement is not\n\n\n\n*Staging note, 2026-08-28. Literature scout for the one open step of\n`varE-theta2-proof.md` §6. Nothing computed; nothing in this repository is\nrecomputed. Search log below, with sha256 and full-text/abstract status per\nartifact.*\n\n## 0. Verdict, the weak half first\n\n**No absence is asserted, and one artifact could overturn the reading.**\nScourfield, *Smooth divisors of polynomials* (LMS Lect. Notes 352, CUP 2008,\n286-311) is **abstract-only** here: her own summary claims an asymptotic with a\ngood error term for the number of divisors `m <= x` of `f(n)` summed over\n`n <= x`, and for those divisors free of large prime factors, with `f` monic\nsquarefree and not necessarily irreducible. That is four of our statement's\nfeatures at once. Until it is read at the page, this note supports no sentence\nof the form \"not in print\", and `varE-theta2-proof.md` §6's warning stands: the\nreduction may **not** be called new.\n\n**One channel of four never answered.** Semantic Scholar returned HTTP 429 on\nits own calibration query, and MathSciNet was not run. Forward-citation walks on\nFord 2008 and on Tenenbaum I/II were **not run**, so a 2008-2026 successor\nsupplying the missing asymptotic would not have been seen by this pass.\n\n**Nothing here moves either open step, and nothing here touches the\nconjecture.** `variance-note.md` §4 already records that `Var/E` over a\nuniformly random window says nothing about the one anchored window the twin\nproblem needs.\n\nWith that said: **PARTIAL.** The convention that owns the object was found and\nsearched, the tools in it are real, and the exact statement is not in it.\n\n- The owning convention is `H_F(x,y,z)`, Hooley's `Delta`-function, and\n localized factorizations `H^{(k+1)}`; the smoothness word is **friable**, and\n `\"smooth divisors\"` as a title phrase is algebraic geometry (§2).\n- Every located theorem counts integers with **at least one** divisor in an\n interval, at a divisor range **strictly below** the sampling range — Ford\n `y <= sqrt x`, Tenenbaum I `y <= x^{1-eps}`, Tenenbaum II `y <= x/2`,\n Scourfield `m <= x` — while our divisors satisfy `n > 2L`. **Above the range,\n not inside it.** (§3, §5)\n- Precision in that convention is order of magnitude (Ford, Koukoulopoulos) or\n `(log y)^{o(1)}` (Tenenbaum's Théorème A). Our statement needs relative error\n `O(1/ln y)`. Scourfield 2008, read second-hand through her 2016 restatement\n (`lit-scourfield-2008.md`, 2026-08-29), carries relative error `O(1/log x)`\n for the divisor-sum object under a friability restriction: the right\n register, one epsilon short of the `o(1/ln y)` the open step needs, and at a\n divisor range `m <= x` below ours. **Ford's own §1.6 open problem (i) is \"Strengthen Theorem 1 to an\n asymptotic formula.\"** (§3.1)\n- The one theorem that reaches `y <= x/2` requires `F` **irreducible**; ours is\n the reducible cubic `(C-2)C(C+2)`. The one that allows reducible `F` is the\n one with the weakest range and the weakest precision. (§3.7, read at page\n images)\n- **Friability does not change the answer.** The friable literature either\n bounds `Delta`, a maximum and never a cancellation, or restricts to\n positive-relative-density prime sets, which `y`-smooth is not. (§4)\n- The missing lemma is named in §5, with the six axes on which it differs from\n what is in print, and a route through the complement `sum_{all n} - sum_{n<=2L}`\n that is **suggested and not costed**.\n\n## 1. The statement being searched, quoted, not paraphrased\n\n`varE-theta2-proof.md` §6 states the object. Quoted verbatim from that note so\nthat nothing is lost in restatement: for\n`w(n,C) = D_y prod_{p|n} (2 or 1)/(p-4)` according as `p | C` or `p | C -+ 2`,\n\n sum_{0<|C| 2L, P^+(n) <= y} w(n,C)\n = L sum_{n > 2L} sum_{c != 0} w(n,c)/n + O(ln y * (something o(ln y))),\n\nthat is: **the weighted count of large `y`-smooth divisors of `C(C^2-4)` agrees\nwith its expected count to one logarithm better than trivially, on average over\na window of length `L = y^2`.**\n\nFour features of that sum decide every translation below, and three of them are\neasy to lose:\n\n1. **It is a divisor SUM, not a set count.** Every divisor `n` of `C(C^2-4)`\n above `2L` is counted, with a weight. The owning literature's headline\n object, `H(x,y,z)` and `H_F(x,y,z)`, counts the integers that have **at\n least one** divisor in the interval. Those are different functions and the\n set count is the harder of the two.\n2. **The divisor is LARGER than the sampling range.** `|C| < L` and `n > 2L`.\n In the literature's coordinates that is `y_lit > x_lit`, and §3 shows that\n every polynomial-value theorem located here stops at `y_lit <= x_lit/2` or\n `y_lit <= x_lit^c, c < 1`.\n3. **The weights are branch-dependent.** `w(n,c)` depends not only on `n` but\n on which of the three roots `0, +2, -2` is taken at each `p | n`, through\n the factor `2/(p-4)` against `1/(p-4)`. Unweighted divisor counts and\n `omega(m)`-weighted root counts are both in print; this weighting is not the\n same object.\n4. **What is needed is an asymptotic with a one-logarithm saving.** The main\n term is of size `ln^3 y` (`varE-theta2-proof.md` §5, measured, local\n exponent 2.6 then 2.5 over six levels), the admissible error is\n `o(ln^2 y)`, so the relative precision required is `O(1/ln y)`. The owning\n literature's results in this range are **orders of magnitude**, and where\n asymptotics exist they are for a different range.\n\n**The convention flip, spelled out**, because our letters and theirs collide:\n\n| ours | theirs | note |\n|---|---|---|\n| `L = y^2`, the window over which `C` runs | `x`, the sampling range | our `y` is a smoothness bound, theirs is a divisor size |\n| `n`, the divisor, `n > 2L` | `d in (y_lit, z_lit]` with `y_lit = 2x_lit` | **above** the range, not inside it |\n| `C(C^2-4) = (C-2)C(C+2)` | `F(n)`, monic, squarefree, degree 3, reducible | reducible is allowed by Tenenbaum I, excluded by Tenenbaum II |\n| `P^+(n) <= y = L^{1/2}` | friability of the divisor at `u = ln n/ln y in (2, 6]` | a real restriction: `C, C+-2 < y^2` may each carry a prime `> y` |\n| `w(n,c)`, branch-dependent | at best `omega(m)`, the root count | the literature weights roots equally |\n\n## 2. Channels, and the calibration each carries\n\nEvery channel below was calibrated on a known positive **in the same session**,\nper `research/SEARCH-CONVENTIONS.md`. A negative on an uncalibrated channel is\nnot recorded.\n\n| channel | calibration positive, same session | result |\n|---|---|---|\n| arXiv API, `https://export.arxiv.org` | `all:\"divisor in a given interval\"` returns Ford math/0401223 and math/0607473 | PASS. **`http://export.arxiv.org` 301s and returns nothing** — the `https` gotcha of `SEARCH-CONVENTIONS.md` §3 is live and cost a query here |\n| zbMATH open API | `ti:\"divisor in a given interval\"` returns Ford, *Ann. Math.* (2) 168 | PASS. Its \"conflicting licenses\" placeholder hides some summaries; a review is often present where the summary is not |\n| OpenAlex, comma-conjunction | `distribution of integers with a divisor in a given interval` returns Ford 2008 first | PASS, but its relevance ranking degrades badly on conjunctive queries and no negative rests on it alone |\n| Google Scholar via WebSearch | see §3.6 | used for the asymptotic question only |\n\n| Semantic Scholar graph API | none — **HTTP 429 on the calibration query itself** | **UNREACHED.** No negative rests on it; owed |\n| MathSciNet `mrlookup` | not run this pass | **UNREACHED**; owed, and it is bibliographic-only anyway (`SEARCH-CONVENTIONS.md` §5) |\n\nTwo false friends found and recorded, so they are not searched again:\n\n- **\"smooth divisors\"** as a title phrase is algebraic geometry. Seven of the\n nine zbMATH hits on `ti:\"smooth divisors\"` are about divisors on\n hypersurfaces and hyperkähler manifolds. The arithmetic word is **friable**,\n or the phrase **\"divisors free of large prime factors\"**. The one arithmetic\n hit is Scourfield (§3.7), and it is the most relevant item in this note.\n- **\"divisors of polynomial values\"** as a phrase returns one arXiv record and\n it is over function fields. The literature says **`H_F(x,y,z)`**, \"la\n localisation des diviseurs de `F(n)`\", and, for the tool, **Hooley's\n `Delta`-function**.\n\n## 3. What is in print, read, and translated onto the statement\n\n### 3.1 Ford, *The distribution of integers with a divisor in a given interval*, Ann. of Math. (2) **168** (2008) 367-433\n\nRead in full, arXiv:math/0401223v5,\n`sha256 4d88888aeeb4c8fb6079309908c01914ca12fc2e21a76c57525b8e5242eb7d98`.\n\n**What it proves.** Theorem 1 gives the **order of magnitude** of\n`H(x,y,z) = #{n <= x : n has a divisor in (y,z]}` for all `x, y, z`; the\nheadline case is `H(x,y,2y) asymp x/((log y)^delta (log log y)^{3/2})` for\n`100 <= y <= sqrt x`, `delta = 1 - (1+log log 2)/log 2 = 0.086071...`. Also\n`H_r` for `r >= 2` in a stated range.\n\n**Translation onto our sum.** Nothing, and for four independent reasons, any\none of which is fatal: (i) it counts integers with **at least one** divisor in\nthe interval, ours sums over **every** divisor with a weight; (ii) `F` is the\nidentity, ours is a cubic; (iii) `y <= sqrt x`, ours needs the divisor above\n`x`; (iv) no smoothness. And the one thing our statement needs above all is an\nasymptotic: **Ford's own §1.6, open problem (i), reads \"Strengthen Theorem 1 to\nan asymptotic formula.\"** That is a statement about a different and harder\nfunction, so it does **not** by itself close our route; what it does establish\nis that the owning convention has, as of its own author's list, no asymptotic\nmachinery in this range at all.\n\n### 3.2 Ford, *Integers with a divisor in (y,2y]*, arXiv:math/0607473v5\n\nRead in full, `sha256 557728b84918d0e1082536d380bfc03bc1e69e2144eefd627dd2a5dd98f776b0`.\nA short proof of the central case of 3.1. Same order-of-magnitude status,\nsame four mismatches. Nothing.\n\n### 3.3 Ford, *Rough integers with a divisor in a given interval*, J. Aust. Math. Soc.; arXiv:1901.02548v2\n\nRead in full, `sha256 f667e9d2402b725fff486cc8ced724cf2f94f3fb695d1fa480de48561aef9184`.\nCounts `n <= x` with no prime factor `<= w` and a divisor in `(y,2y]`, \"up to\nmultiplicative constants\", uniformly in `x,y,w`.\n\n**Translation.** The prime-factor restriction is on the **integer `n`**, ours\nis on the **divisor**. That is the opposite axis, and the paper is order of\nmagnitude besides. Nothing. Worth naming explicitly because the title is the\nclosest false match in the corpus to what our §6 needs.\n\n### 3.4 Koukoulopoulos, *Localized factorizations of integers*, Proc. LMS (3) **101** (2010) 392-426\n\nzbMATH review read (`id 5788157`), full text not retrieved. Bounds\n`H^{(k+1)}(x, ybar, 2ybar)`, the count of `n <= x` admitting a factorization\n`d_1 ... d_k | n` with each `d_i in (y_i, 2y_i]`. Upper bound\n`<<_{k,delta} (log y_k/log y_1)^{k+1} x/((log y_1)^{Q(1/log rho)}(log log y_1)^{3/2})`\nwith `rho = (k+1)^{1/k}`, `Q(u) = u log u - u + 1`, valid when\n`2^{k+1} y_1...y_k <= x/y_1^delta`; matching lower bound only when\n`y_k <= y_1^c`.\n\n**Translation.** This is the **structurally closest** published object: our\n`n | C(C^2-4)` with `n` squarefree and coprime to 30 factors uniquely as\n`n = n_0 n_+ n_-` with `n_0 | C`, `n_+ | C+2`, `n_- | C-2`, so we are asking a\n`k = 2`, three-factor localization question about the shifted triple\n`(C-2, C, C+2)`. Three mismatches: (i) the hypothesis\n`2^{k+1}y_1 y_2 <= x/y_1^delta` puts the **product of the parts below the\nsampling range**, and our product is `> 2L`; (ii) set count, not weighted\ndivisor sum; (iii) order of magnitude with an unmatched\n`(log y_k/log y_1)^{k+1}`. Nothing for the saving; useful as the right name for\nthe shape.\n\n### 3.5 Koukoulopoulos, *On the number of integers in a generalized multiplication table*, J. reine angew. Math. **689** (2014) 33-99\n\nzbMATH record read (`id 6296365`); its summary is withheld by the licence\nplaceholder, and the full text was not retrieved. Same family, same\norder-of-magnitude register per the citing literature. Nothing.\n\n### 3.6 Koukoulopoulos, *Divisors of shifted primes*, IMRN **2010** no. 24, 4585-4627\n\nAuthor summary read at zbMATH (`id 5841659`). Lower bounds for the number of\n`p + s <= x` with a divisor in `(y,z]`, complementing Ford's §14.\n\n**Translation.** The shifted-prime axis replaces our arithmetic input with\nprimes in progressions. Our `C` runs over **all** integers of a window; the\npaper's difficulty (level of distribution for primes) is not our difficulty and\nits conclusion is a one-sided bound. Nothing.\n\n### 3.7 Tenenbaum, *Sur une question d'Erdős et Schinzel* I and II — the owning result for polynomial values\n\n**II read at page images**, GDZ scan of *Invent. Math.* **99** (1990) 215-224,\n`sha256 75676b53ce6fe3812aa5910d5822bf3c84cf96fff338b80d3335e39f1acddcef`\n(GDZ `PPN356556735_0099/LOG_0023`; the file carries no text layer, so pages 216\nand 217 were read as images. **The neighbouring `LOG_0021` is a Kleinian-groups\npaper** — the GDZ log numbers are not article numbers and the first guess\nretrieved the wrong article; check the page range on the header line before\nquoting.) **I read only through E. J. Scourfield's zbMATH review** (`id 4173122`);\nthe volume is *A Tribute to Paul Erdős*, CUP 1990, 405-443, and no open copy was\nlocated.\n\nWith `H_F(x,y,z) := #{n <= x : exists d | F(n), y < d <= z}`, the two statements\nthat matter, transcribed from the page:\n\n- **Théorème A** (= Part I, quoted in II as ref. [11]): with\n `delta := 1 - (1+log_2 2)/log 2 = 0.08607`, for each fixed `eps > 0`,\n `H_F(x, y, 2y) = x(log y)^{-delta + o(1)}` as `x, y -> infinity` in the domain\n **`y <= x^{1-eps}`**. Part I determines `H_F(x,y,z)` \"sans restriction de\n primalité concernant le polynôme `F(X)`\" for `z = y(1+(log y)^{-beta})`,\n `0 <= beta = beta(y,z) << 1`, **with an uncertainty factor `(log y)^{o(1)}`.**\n- **Théorème 1** (Part II): `eta > log 4 - 1`; for each `F` **irreducible** in\n `Z[X]`, `H_F(x,y,2y) > x(log x)^{-eta}` in the domain **`y <= x/2`**.\n- **Théorème 3** (Part II, the key step): for `F` irreducible and each `t >= 1`,\n `sum_{n<=x} Delta(F(n))^t <<_t x(log x)^{beta(t)-1} L(log x)^{sqrt(2t)+o(1)}`\n with `beta(t) = 2^t - t`, `L(z) = exp{sqrt(log z log_2 z)}`.\n- **Lemme 2.1**: with `rho(n)` the number of roots of `F` mod `n`,\n `sum_{n<=x} rho(n) = A x + O(x^{1-a})`, `A, a > 0` depending on `F`, via\n `sum rho(n)n^{-s} = zeta_K(s)Phi(s)`.\n\n**Translation onto our sum, and it fails on three axes at once.**\n\n1. **Range.** Ours needs divisors `n > 2L` of `F(C)` with `|C| < L`, i.e.\n `y_lit >= 2 x_lit`. Théorème A reaches `y <= x^{1-eps}`; Théorème 1 reaches\n `y <= x/2`. **Both stop strictly below the sampling range and ours starts\n strictly above it.** This is not a technical eps: for a cubic, divisors above\n `x` are the regime where the \"expected count\" heuristic our §6 writes down is\n exactly what is unproven.\n2. **Reducibility.** `C(C^2-4) = (C-2)C(C+2)` is reducible. Part I explicitly\n allows that; Part II's Théorème 1 and Théorème 3 both require `F` irreducible,\n and Théorème 1 is the only one that reaches `y <= x/2`. So the one statement\n that gets near our range excludes our polynomial.\n3. **Precision.** Théorème A carries `(log y)^{o(1)}`, weaker than an order of\n magnitude. We need a relative error `O(1/ln y)`. That is two registers away.\n\n**What Part II does give us that is worth carrying:** Lemme 2.1's shape. The\n\"expected count\" side of our §6 identity is exactly a `rho`-type root count, and\nTenenbaum's proof of Lemme 2.1 is a Dedekind-zeta argument with a power-saving\nerror. That is the right technique for the **main term** of our statement; it\nsays nothing about the window, which is where our difficulty is (see §5).\n\n### 3.8 Scourfield, *Smooth divisors of polynomials*, LMS Lecture Note Series **352** (CUP 2008) 286-311 — the closest match found\n\n**Author summary read at zbMATH (`id 6093091`); full text NOT obtained.** The\nvolume is *Number Theory and Polynomials* (McKee et al., eds.), CUP; no open\ncopy was located on any calibrated channel, and the only full-text hits were\nbook-piracy mirrors, which were not used. So this item is **ABSTRACT-ONLY** and\nnothing below is a page reading.\n\nThe summary, in the author's words: `f` monic over `Z`, not necessarily\nirreducible, **no repeated factor**; `omega(m)` the number of solutions of\n`f(n) = 0 mod m`. She establishes an asymptotic formula with a good error term\nfor `sum_{m<=x} omega(m)`, and derives asymptotic formulae for **the number of\npositive divisors `m <= x` of `f(n)` summed over `n <= x`**, and, using\nHanrot-Tenenbaum-Wu (*Proc. LMS* (3) **96** (2008) 107-135), **for the number of\nthese divisors `m` with no large prime factors**.\n\n**Translation.** This is the only item located that is simultaneously (a) a\n**divisor sum**, not a set count, (b) over **polynomial values** of a squarefree\nreducible `f`, (c) **with a friability restriction on the divisor**, and (d) an\n**asymptotic with an error term**. On all four features it matches our §6\nstatement, and it is the item that would have to be read at the page before any\nabsence is asserted. It nevertheless does not close the step, on two mismatches\nthat the summary itself makes explicit:\n\n- **Range, again.** Divisors `m <= x` of `f(n)` for `n <= x`. Ours are `n > 2L`\n with `|C| < L`: above the range, not below it. Whether the method transfers is\n not decidable from an abstract.\n- **Weights.** Her divisors are counted with weight 1 (equivalently, roots with\n weight 1 through `omega(m)`). Ours carry `w(n,c) = D_y prod_{p|n} (2 or 1)/(p-4)`,\n a **branch-dependent** multiplicative weight of size `4^{omega(n)}` in total\n mass. Nothing in the summary suggests the weighted version.\n\n**Status of this item: OWED.** It is the single highest-value unread artifact\nfor this question.\n\n### 3.9 The upper-bound toolkit: Hooley's `Delta`, Nair-Tenenbaum\n\n- Hooley's `Delta(n) = max_u #{d | n : e^u < d <= e^{u+1}}`; Hall-Tenenbaum,\n *Divisors*, Cambridge Tracts **90** (1988) — Theorem 21 there is the `F(X)=X`\n case that Tenenbaum I generalizes (per Scourfield's review of I).\n- Nair-Tenenbaum, *Short sums of certain arithmetic functions*, Acta Math. **180**\n (1998) 119-144 (zbMATH `id 1172070`): the standard uniform upper bound for\n `sum_{x= (log log n)^{0.3533...}` for almost all `n`, disproving the\n Maier-Tenenbaum conjectured optimality).\n\n**Translation.** Every one of these bounds `Delta` or a moment of it, i.e. the\n**maximum** number of divisors in a window. `varE-theta2-proof.md` §5 already\nrecords that the maximum-versus-mean gap is precisely the missing logarithm\n(`4^omega` against `2^omega`), and that taking absolute values after the one\nsplit the kernel offers is **measured lossy** at all six levels. So an upper\nbound on `Delta` cannot produce the cancellation our §6 needs — it is the wrong\nkind of statement, not a weak version of the right one. This is the same trap\n`SEARCH-CONVENTIONS.md` §1 records for `level of distribution`: a guaranteed and\nworthless negative if searched as if it were the right tool.\n\n## 4. The smoothness axis: does friability change the answer?\n\nOur divisors satisfy `P^+(n) <= y` with `n > 2L = 2y^2` and\n`n <= |C(C^2-4)| < L^3 = y^6`, so `u = ln n/ln y` runs over `(2, 6]`. This is\nthe moderately-friable regime, not an extreme one; and it is a **real**\nrestriction, since each of `C, C+2, C-2` is below `y^2` and may carry a prime\nfactor above `y`.\n\nFour items read, and the answer is that friability does **not** rescue the step.\n\n- **Martin-Tenenbaum-Wetzer, *On the friable mean-value of the Erdős-Hooley\n delta function*, Indag. Math. (N.S.) 2024 = arXiv:2307.05530v5.** Read in full,\n `sha256 0022dac29c7d9a1295654ccc7f3ad0c9b4c2197a0d2f053d457541d9511b47da`.\n Uniform upper **and** lower bounds for the mean value of `Delta(n)` over\n friable integers. **Translation:** the friable version of §3.9, and it inherits\n §3.9's verdict — `Delta` is a maximum, our need is a cancellation. Nothing.\n- **Schlitt, *Multiplication Tables for Integers with Restricted Prime Factors*,\n arXiv:2603.19212v2.** Read in full,\n `sha256 8b862a95cc64887be7b4cf40588822065bcb0ce50f1768b05ec70759c4e564c8`.\n Counts `n <= x` with all prime factors in a set `Q` and a divisor in `(y,2y]`,\n order of magnitude for all relative densities `delta in (0,1]`, with a phase\n transition at `delta = 1/log 4`. **Translation: the restriction is the wrong\n one.** His hypothesis (1.2) is `|#(Q ∩ [1,x]) - delta x/log x| <= kappa x/(log x)^2`,\n a **positive-relative-density** prime set. The primes `<= y` are not such a set,\n so `y`-smoothness is outside his family; and the result is order of magnitude.\n Nothing. Worth naming because the title is the nearest miss on this axis.\n- **Drappeau-Tenenbaum, *Distribution laws of divisors of friable integers*,\n Math. Z. **288** (2018) 1299-1326 (zbMATH `id 6860658`); Basquin, *Mean\n distribution law for the divisors of friable integers*, JTNB **26** (2014)\n 281-305 (`id 6431207`).** Records read, summaries withheld by the licence\n placeholder, full texts not retrieved. **Translation: the quantifiers are\n inverted.** These describe how the divisors of a **friable integer** are laid\n out. Ours are the friable **divisors of a value of a cubic** whose own large\n prime factors are unrestricted. Nothing, and the inversion is the kind of\n near-miss `SEARCH-CONVENTIONS.md` exists to catch.\n- **Hanrot-Tenenbaum-Wu, *Averages of certain multiplicative functions over\n friable integers, II*, Proc. LMS (3) **96** (2008) 107-135 (zbMATH\n `id 5248998`).** Record read only. This is the machinery Scourfield's summary\n names as the input to her smooth-divisor asymptotic. **Translation:** it is a\n friable mean-value theorem for multiplicative functions, i.e. the right kind\n of input for the **main term** of our statement, and it is stated over friable\n integers, not over friable divisors of polynomial values.\n\n**Verdict on axis 2: friability changes nothing about the obstruction.** It is\nhandled in print, by Hanrot-Tenenbaum-Wu through Scourfield, at the level of the\nmain term. It does not supply, and no friable-divisor result located supplies, a\nsaving in the window.\n\n## 5. The lemma the literature does not state\n\nStated so it can be checked, disputed, or found.\n\n**What is missing.** An asymptotic, with a relative error `O(1/ln y)`, for\n\n N(L, y) := sum_{0<|C| 2L, P^+(n) <= y, (n,30)=1, n squarefree} w(n,C),\n w(n,C) = D_y prod_{p|n} (2 or 1)/(p-4) as p | C or p | C -+ 2,\n\nagainst its CRT-expected value `L sum_{n>2L} sum_{c != 0} w(n,c)/n`, at\n`L = y^2`.\n\n**Why nothing in §3 covers it, in one sentence per axis.**\n\n| axis | what the literature has | what the statement needs |\n|---|---|---|\n| object | `H_F`: integers with **at least one** divisor in an interval | a **weighted sum over every** large divisor |\n| divisor range | `y <= x^{1-eps}` (Tenenbaum I), `y <= x/2` (Tenenbaum II), `m <= x` (Scourfield) | `n > 2x` |\n| polynomial | reducible allowed only where the range is weakest (Tenenbaum I) | reducible cubic `(C-2)C(C+2)`, at the strongest range |\n| weight | 1, or `omega(m)` roots equally | branch-dependent `w(n,c)`, total mass `4^{omega}`-sized |\n| precision | `(log y)^{o(1)}` (Tenenbaum A), `asymp` (Ford, Koukoulopoulos) | asymptotic with relative error `O(1/ln y)` |\n| smoothness | friable **integers** (Hanrot-Tenenbaum-Wu, Martin-Tenenbaum-Wetzer), positive-density prime sets (Schlitt) | friable **divisors** of a polynomial value at `u in (2,6]` |\n\n**The precise character of the obstruction, restated in the owning convention.**\nFor `n > 2L` a residue class mod `n` meets the window `|C| < L` at most once, so\nthe sum is not an average of a divisor function at all: it is the count of\n**incidences** between a window of length `L` and the CRT-combined root classes\nof `(C-2)C(C+2)` modulo the friable moduli `n > 2L`, weighted, compared against\nthe expected density `L/n` which is `< 1/2` for every modulus in play. Every\ntheorem in §3 averages over a range **longer** than the divisors it counts;\nours averages over a range **shorter** than every modulus. That is the same\nstructural wall the corpus has hit before, and stating it in the owning\nconvention does not lower it.\n\n**A route the literature does leave open, and it is not costed here.** The\ncomplement `sum_{n > 2L} = sum_{all n} - sum_{n <= 2L}` moves the difficulty to\ntwo sums each of which is an average over a range **at least as long** as the\nmoduli, which is the regime Scourfield's summary claims an asymptotic in. What\nthat route needs is (i) Scourfield's theorem read at the page, (ii) the same\ntheorem with the branch-dependent weight `w(n,c)` in place of the plain divisor\ncount, and (iii) enough uniformity in the friability parameter at `u in (2,6]`\nto survive the subtraction of two quantities of size `ln^3 y` down to `o(ln^2 y)`.\nNone of (i)-(iii) has been done. **This is a suggestion, not a plan, and the\nhonest prior stated in `varE-theta2-proof.md` §6 stands: a one-logarithm gap in\na divisor problem of this shape is usually the whole difficulty.**\n\n## 6. Verdict, and the draft `SEARCH-CONVENTIONS.md` §1 row\n\n**PARTIAL.** The owning convention was identified and searched on three\ncalibrated channels; the machinery exists and the exact statement does not.\nSpecifically:\n\n- **Not PUBLISHED.** No theorem located bounds the residual with the needed\n saving. The nearest results are order of magnitude (Ford; Koukoulopoulos) or\n `(log y)^{o(1)}` (Tenenbaum), for a different function (`H_F`, a set count),\n in a divisor range strictly below ours, without our weights, and Ford's own\n §1.6 open problem (i) is that an asymptotic is missing even in the plainest\n case. So `varE-theta2-proof.md` step 1 does **not** become PROVEN CONDITIONAL\n on a citation.\n- **Not ABSENT-PER-CONVENTION either**, and this is the half a negative would\n have hidden: **Scourfield 2008 is an asymptotic, with an error term, for a\n friability-restricted divisor sum over values of a squarefree reducible\n monic polynomial.** That is four of our statement's features at once. It is\n abstract-only here, and until it is read at the page no absence may be\n written and no claim that the §6 reduction is new is available.\n\n**Draft row for `research/SEARCH-CONVENTIONS.md` §1** (proposed; this note edits\nno existing file):\n\n| object | our name | canonical | **OWNING convention — search THIS** | where it lives |\n|---|---|---|---|---|\n| weighted count of large `y`-smooth divisors of `C(C^2-4)`, averaged over a window `\\|C\\| < L = y^2` (the CRT-mixed lag residual of the `theta = 2` decoupling step) | the mixed lags, `Xmix`; \"the divisor-distribution statement\" | distribution of divisors of polynomial values in a range | **`H_F(x,y,z) = #{n <= x : exists d \\| F(n), y < d <= z}`**, \"la localisation des diviseurs de `F(n)`\"; the tool is **Hooley's `Delta`-function**, `Delta(n) = max_u #{d\\|n : e^u < d <= e^{u+1}}`; the three-factor shape is **`H^{(k+1)}(x, ybar, zbar)`, \"localized factorizations\"**; the smoothness word is **friable**, never \"smooth\" (`ti:\"smooth divisors\"` is algebraic geometry, 7 of 9). **Our range `y_lit > x_lit` is outside every located theorem**, and \"asymptotic\" is outside the whole convention: Ford's own open problem (i) | Ford, *Ann. of Math.* (2) **168** (2008) 367-433, Thm 1 and §1.6(i); Tenenbaum, *A Tribute to Paul Erdős* (CUP 1990) 405-443 (reducible `F`, `y <= x^{1-eps}`, `(log y)^{o(1)}`) and *Invent. Math.* **99** (1990) 215-224, Thms 1 and 3 (irreducible `F`, `y <= x/2`); Hall-Tenenbaum, *Divisors*, Cambridge Tracts **90** (1988) Thm 21; Koukoulopoulos, *Proc. LMS* (3) **101** (2010) 392-426 and *Crelle* **689** (2014) 33-99; Ford, arXiv:1901.02548 (roughness of the **integer**, the opposite axis). **Friable side**: Hanrot-Tenenbaum-Wu, *Proc. LMS* (3) **96** (2008) 107-135; Martin-Tenenbaum-Wetzer, arXiv:2307.05530; Schlitt, arXiv:2603.19212 (positive-density prime sets, **not** friability). **OWED and highest value: Scourfield, *Smooth divisors of polynomials*, LMS Lect. Notes **352** (CUP 2008) 286-311** — abstract-only, claims an asymptotic with error term for friable divisors `m <= x` of `f(n)`, `f` squarefree monic reducible. `history/staging/lit-smooth-divisors.md` |\n\n## 7. What would falsify this, and whether that check has run\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| the owning convention is `H_F(x,y,z)` / Hooley `Delta` / localized factorizations, not our wording | MEASURED (search) | a theorem on this object living under wording not in §6's row | PARTLY. Three channels calibrated in session (arXiv `https`, zbMATH, OpenAlex); Semantic Scholar 429 on its own calibration query, MathSciNet not run |\n| Ford 2008 gives order of magnitude only, and names the asymptotic as open | PROVEN (read) | a later paper supplying the asymptotic for `H(x,y,2y)` | PARTLY. Read at §1.6 of arXiv:math/0401223v5. Forward-citation walk on Ford 2008 **NOT RUN**; a 2008-2026 successor would not have been seen |\n| Tenenbaum I reaches only `y <= x^{1-eps}` and II only `y <= x/2`, and II needs `F` irreducible | PROVEN (read) | a stated range above `x`, or a reducible-`F` version of II's Thm 1 | YES for II, read at the page images of pp. 216-217. NO for I: **review only**, the CUP volume was not obtained |\n| our range `n > 2L` is outside every located theorem | PROVEN, conditional on the readings above | any theorem with `y_lit > x_lit` | YES against what was read; NO against Scourfield, which is abstract-only |\n| Scourfield 2008 does not close the step | **CONJECTURED, and this is the weak point of the note** | the paper covering divisors above the range, or extending to branch-dependent weights | **NO. Abstract-only.** No page was read. Any claim of absence here is not yet earned |\n| friability does not change the answer | MEASURED (search) | a friable-divisor-of-polynomial-value result with a window saving | PARTLY. Four items; two read in full, two records only |\n| the `Delta` toolkit cannot supply the saving | PROVEN, by the corpus's own measurement | a `Delta` bound that yields cancellation rather than a maximum | YES, and it is `varE-theta2-proof.md` §5's measured flat/active loss, not a search result |\n| `lim Var/E = 0.45546` | HEURISTIC | either open step failing | NO. This note moves neither step; it prices the search around one of them |\n\nThe one line worth carrying out of this pass: the reduction in\n`varE-theta2-proof.md` §6 lands in a convention that is well developed and that\nstops, uniformly, one range short of where our sum lives — divisors below the\nsampling range, not above it — and stops one register short of the precision we\nneed, since the convention has no asymptotics at all in this range by its own\nauthors' accounting. Whether the reduction is **new** remains unanswerable until\nScourfield 2008 is read at the page.\n"},"research/history/staging/measure-0830-rho-sup-z41.md":{"lf_sha256":"94bcbc9c74bd98fff95d5d7b09783e0522e814a2b8283ae024925cc29e22ec76","content":"# The exact sup at z = 41: sup|ρ̃| over 7.42e12 positions and sup|R_H| at H = z³, z⁴, TODO item 0's first move (b), run\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-rml.md`).** The\n> reflection identity ρ̃(W−3−y) = −ρ̃(y) is PROVEN under independent code,\n> together with the two hypotheses it needs (the three-entry COMB list closed\n> under swap with the weight fixed; the swapped class −2 − c mod q), verified\n> at every term of z = 13..37. The sealed forecast's arithmetic and the cost\n> extrapolation reproduce. Two custody limits, disclosed: the independent walk\n> reaches only z = 29, so sup|ρ̃|(31) = 28.122062, sup|ρ̃|(37) = 52.219092 and\n> sup|R_H3| at 31 and 37 are NOT re-derived (five of seven and three of five\n> is what the custody claim rests on after that pass); and the seal's TIMING\n> cannot be verified by any method available — every sealed number reproduces\n> from the seven cited sups alone, which is consistent with pre-registration\n> and is not evidence of when it was written (an out-sha256 binds content, not\n> the clock).\n\n*(2026-08-30, staging. Producer:\n`research/history/staging/measure-0830-rho-sup-z41.js`, a four-tail file\nembedded tail by tail with `qc/embed.js --streams both` (stdout is the\ndeterministic record; every timing figure is on stderr, by rule). No existing\nfile edited, no git command run. Every number below is in one of the four\nOUTPUT blocks or is quoted from an embedded artifact cited by file and\nsection, except the arithmetic named in §8. Calibration per claim: PROVEN,\nMEASURED, HEURISTIC, OPEN, REFUTED.)*\n\n## 0. What is open, first\n\n- **RML(α) is open at every α, REC(s, u₀) is open at every (s, u₀), and no\n exponent moves here.** One more exact point on a measured curve cannot\n decide a statement quantified over all z ≥ z₀. Whatever the eighth point\n does to the seven-point slope 2.7660 ± 0.2120\n (`attack-0829n-rml-proof.md` OUTPUT S5), it moves a fit. A point that\n lands the slope at or above 3.0 within one standard error refutes nothing\n asymptotic, and a point that lands it below 3.0 by two standard errors\n proves nothing. That was written before the run (§5).\n- **The only kill on the table is finite-z**: REC(3.0, 3.0) is false AT\n z = 41 iff the walked sup|R_H| at H = 41³ reaches HM − 1\n (`attack-0829n-rml-proof.md` §6, first bullet). Its forecast margin is a\n factor above ten (§5), and the expected outcome, stated in advance, was\n \"not killed\".\n- **The exact z = 41 point does NOT exist after this note.** The run that\n answers the question priced at 4.8 to 5.4 h of wall clock on this machine\n from measured per-position costs (§4), above the 3.5 h rule, so it was\n not run; what exists is the engine, its custody at every lower level, the\n pre-registration, one pilot segment of twelve (tail 2, a lower bound), and\n the segmented plan for the compute box. The eleven remaining segments are\n an ask.\n- **The sup at z = 41, when it exists, will be one number from one engine.** The engine is new in\n three places (§2), each proven to compute the same object, and each checked\n against the old engine at every level where both can run (§3). There is no\n independent second implementation at z = 41 itself; the O(n) recomputation\n at the argmax is a self-check, not an independent one.\n- **z = 43 and 47 stay out of reach for the exact sup** by the same\n accounting as before (`rho-exact-z31-01.md` §6): 41× and 1763× the z = 41\n work respectively, and nothing in §2 changes the linear-in-W law.\n- **The brief carried one error, recorded in §7 (checks): the seven exact\n points do not span \"less than an octave\" of z.** log₂(37/13) = 1.509, so\n they span one and a half octaves; the phrase is the corpus's own\n (`attack-0829n-rml-proof.md` §0, §5; `rho-exact-z31-01.md` §0) and it is\n wrong there too. Adding z = 41 extends the span to log₂(41/13) = 1.657\n octaves, not to two.\n\n## 1. The object, unchanged\n\ns = 3.0, D = z^s, terms from `sift-limit-lemmaV.js`'s `buildTerms(z, D)`,\nthe identical call at every exact level; ρ(y) = Σ_j w_j ψ((y − c_j)/q_j),\nψ(t) = t − ⌊t⌋ − 1/2, period W = P(z) = ∏_{p seg-k.out 2> seg-k.err` (segment 12 is done); each segment is ~3.09e11\npositions and independent; the table (6.47 GB shared) is rebuilt per\nsegment. On this machine a segment is ≈ 3.09e11 × 4.89 ns + 453 s ≈ 33 min;\non the box, per-core Zen 3 against M1 P-core is unmeasured (run `bench/`\nfirst per the box protocol), and with 16 cores at 0.7× per core the eleven\nsegments price at roughly 11 × 33 × (10/16)/0.7 ≈ 5.4 h, overnight class,\nnice-able, 7 GB resident. Ferry the 22 output files back; bind each as a\ntail via the declared-provenance path with the box's node version and\nhardware recorded; combine by max (sup|ρ̃|, sup|R_H3|, sup|R_H4|) and by sum\n(Σ R_H², positions) over the twelve tails, and check Σ positions =\n3,710,374,718,933. Nothing in this plan changes the object.\n\n## 5. Pre-registration, written to tail 1 before any z = 41 segment ran\n\nTail 1, S4, embedded (out-sha256 78984bb6…) before tail 2 was launched.\n\n- **(i) The seven-point slope** recomputed on this file's own S1 column:\n 2.7660 ± 0.2120, matching `attack-0829n-rml-proof.js` S5. Span: 1.509\n octaves of z, not \"less than one\".\n- **(ii) OLS forecast** of sup|ρ̃|(41): 60.07; 1-se prediction band\n [47.25, 76.37]; 2-se band [37.16, 97.11].\n- **(iii) Gaussian-law forecast:** C_true(41) inside the seven-point range\n [0.6044, 0.8412], i.e. sup|ρ̃|(41) in [55.83, 77.69]; F4 (C_true ≤ 1) is\n false at z = 41 iff sup|ρ̃|(41) > 92.36. sup/rms forecast for ρ̃:\n [4.653, 6.476]; for R_H3, from the five-point trend (vi): 5.646, band\n [4.869, 6.546].\n- **(iv) Kill rule for the u₀ = 3 form, finite-z:** REC(3.0, 3.0) is FALSE\n AT z = 41 iff sup|R_H3|(41) ≥ HM − 1 = 1807.417. Forecast: not killed,\n with F3 ≥ 9.31 even at the 2-se top of the band; the kill needs\n sup|ρ̃|(41) ≥ 903.71, fifteen times the forecast.\n- **(v) What the eighth point does to the fit:** on the forecast, the\n eight-point slope is 2.7660 ± 0.1656; at the 1-se band ends 2.6562 /\n 2.8757; at the 2-se ends 2.5465 / 2.9855. The eight-point fit excludes\n u₀ = 3.0 from below (slope − se ≥ 3.0) iff sup|ρ̃|(41) ≥ 343.0, and from\n above (slope + se ≤ 3.0) iff sup|ρ̃|(41) ≤ 68.9. Forecast: neither. Either\n way it moves a fit and refutes nothing asymptotic.\n- **(vi) sup|R_H3|** five-point slope 2.4522 ± 0.2095; forecast at 41:\n 58.26, band [50.24, 67.56].\n- **(vii)** The allowance REC(3,3) grants at z = 41 is 41^{1.5} = 262.53\n against a forecast ratio of 5.6; no ε is in force, so only (iv) is a kill.\n\n**Scoring rule, fixed here:** the pilot segment (tail 2) covers a twelfth of\nthe half range and so yields LOWER BOUNDS only; none of (ii)–(vi) can be\nscored against it, and the note will not score them. They are scored when\nthe twelve tails exist.\n\n## 6. The pilot segment at z = 41 (tail 2): lower bounds, the fleet rate, and nothing scored\n\nTail 2, S5: segment 12 of 12, 101 of the 1201 chunks (every twelfth plus\nthe wrap chunk), 309,200,483,133 positions, the count matching the plan;\nworst block drift 6.0e-9; the sup's argmax recomputed exactly in O(n) to\n5.7e-9. What it measured, every figure a bound on the full-period value\nand none of them the value:\n\n- **sup|ρ̃|(41) ≥ 70.651250**, attained at position 1,704,538,822,781. That\n lower bound already sits inside the pre-registered 1-se band\n [47.25, 76.37] and above 68.9, the level below which the eight-point fit\n would exclude u₀ = 3.0 from above (§5 (v)); so that exclusion is already\n impossible, and no other forecast is scored here (§5's scoring rule).\n- **sup|R_H|(41) ≥ 64.416936 at H = z³ and ≥ 97.905636 at H = z⁴.** The\n segment's F3 = 28.058 is an UPPER bound on the full-period margin; the\n kill (sup|R_H3| ≥ 1807.417) is not reached in this twelfth and cannot be\n ruled out from it.\n- The segment's m2 = 144.009169 against the full-period closed form\n 143.927339 (S2), 0.06% apart on one twelfth of the range [ARITHMETIC];\n the segment mean 8.96e-4 against the proven 0.\n- **The fleet rate at z = 41 itself** (stderr): 3.092e11 positions in\n 1398.6 s = 4.52 ns/position of wall with 10 workers, and the table build\n 164.6 s. [ARITHMETIC] The remaining eleven segments price at 11 ×\n (1398.6 + 164.6) s = 4.8 h on this machine, which confirms the §4\n decision from the z = 41 rate rather than the z = 37 one; one segment is\n 26 min.\n\nRung: MEASURED, one twelfth of the half range, lower bounds only.\n\n## 7. Brief-claim checks\n\n| brief claim | record | verdict |\n|---|---|---|\n| period P(41) = 7.4e12 | W = 7,420,738,134,810 (S3; `scanstat-t37.md` header) | holds |\n| existing exact points z = 13..37, seven | `rho-exact-z31-01.js` S2, seven rows | holds |\n| slope 2.766 ± 0.212, 1.1 se under u₀ = 3, 5.8 se under u₀ = 4 | `attack-0829n-rml-proof.js` S5: 2.7660 ± 0.2120, 1.10 se, 5.82 se | holds |\n| \"seven points spanning less than an octave\" | log₂(37/13) = 1.509 | WRONG, in the brief and in the corpus (§0) |\n| z = 31, 37 walks cost 6928 s | `rho-exact-z31-01.md` §4: 6928.4 s for the whole producer, Λ included | holds as stated there |\n| `scanstat-t37.md` found G₂(37#) over 7.4e12 positions \"in minutes\" | 5 shards × 35.2 min in lockstep over 2.18e11 slots | 35 min wall, a different object (gaps between survivors) |\n| compute box 5950X, 16 cores, 128 GB | memory file; not verified here | not verified |\n\n## 8. Readings\n\n1. **MEASURED, custody.** The new engine (reflection, P(29) table, per-block\n re-seeding) reproduces the cited exact sup|ρ̃| at all seven levels\n z = 13..37 to the cited six decimals in legacy mode and to 1.2e-7 in\n half-range reseed mode, and the three engines agree at z = 41 on three\n sample chunks to 1.4e-7. The reflection identity is PROVEN (§2(a)) and\n checked at every position of z = 13, 17, 19. Tail 1, S0, S2.\n2. **MEASURED, new columns at the old levels.** sup|R_H| at H = z³ walked\n for the first time: 8.600331, 15.737099, 21.611574, 29.537383, 47.838730\n at z = 19..37, between 0.92 and 1.30 times sup|ρ̃|, so the factor 2 that\n `attack-0829n-rml-proof.md` §5 stood in with was 1.5 to 2.2× loose; the\n certified margin at u₀ = 3 is F3 = 26.4 to 35.9 over five levels and is\n not falling. sup|R_H3|/rms runs 3.39 → 5.68 (log_z 0.41 → 0.48). Tail 1, S1.\n3. **MEASURED, the price.** Naive 69.8, table-legacy 23.5, table-reseed\n 36.6 ns/position per worker at z = 41; fleet 4.89 ns/position of wall at\n z = 37 in the mode the falsifier needs; the half range plus wrap is\n 3,710,374,718,933 positions, so the exact point is ≈ 5.4 h here, over the\n rule, and was not run. The obtained speed-ups are 2× (PROVEN reflection)\n and 2.9× (table); no bound-and-prune exists on the routes tried (§2(d)).\n Tail 1 stderr, S2, S3.\n4. **PRE-REGISTERED, unscored.** Forecast sup|ρ̃|(41) = 60.07, 1-se band\n [47.25, 76.37]; kill of REC(3,3) at z = 41 needs sup|R_H3| ≥ 1807.417,\n fifteen times the forecast; the eight-point fit cannot exclude u₀ = 3\n from below unless sup|ρ̃|(41) ≥ 343.0. Scored only when all twelve\n segments exist. Tail 1, S4.\n5. **MEASURED, lower bounds from the pilot twelfth.** sup|ρ̃|(41) ≥\n 70.651250, sup|R_H3|(41) ≥ 64.416936, sup|R_H4|(41) ≥ 97.905636; the\n fleet rate at z = 41 is 4.52 ns/position of wall, so the eleven unrun\n segments are 4.8 h here or an overnight run on the box. The one\n pre-registered outcome already decided is negative: the eight-point fit\n cannot exclude u₀ = 3 from above (needs sup ≤ 68.9). Tail 2, S5.\n6. **Corrected, not applied.** \"Seven points spanning less than an octave\"\n (brief; `attack-0829n-rml-proof.md` §0, §5; `rho-exact-z31-01.md` §0) is\n arithmetically wrong: log₂(37/13) = 1.509 octaves. Recorded here for the\n adjudicator; no live file edited.\n\n## 9. Not reached\n\n- **The exact sup|ρ̃|(41), sup|R_H3|(41), sup|R_H4|(41):** eleven of twelve\n segments unrun; plan in §4. Until then nothing in §5 is scored.\n- **z = 43, 47:** 41× and 1763× the z = 41 work; a different object is\n needed, not a faster walk (`rho-exact-z31-01.md` §6, unchanged).\n- **A bound-and-prune certificate:** not found; §2(d) is a negative on\n three routes, not a theorem.\n- **sup|R_H| at u₀ = 3.5 and 4.25:** dropped from the trackers to buy\n speed; only u₀ = 3 and 4 are walked.\n- **An independent second implementation at z = 41:** none; the argmax\n recomputation is a self-check.\n\n## 10. Custody and gate\n\nProducer `research/history/staging/measure-0830-rho-sup-z41.js`, four\ndeclared tails. Tail 1 (stage A) bound by `node research/qc/embed.js\n--streams both --tail 1 … -- --stage A`, code-sha256 61af2c79…, out-sha256\n78984bb6…, 201 body lines, elapsed 2554.6 s. Tail 2 (stage B, segment\n12/12) bound the same way; its fingerprint is in the file. Tails 3 and 4\nare reserved and unbound (the segments belong on the box). A `--check`\nre-run of tail 1 costs 43 minutes and was not bought. Derived arithmetic in\nthis note, done on embedded columns and not by the script: the ratios and\n\"×\" factors in §3, every wall-clock extrapolation in §4, and the octave\ncounts. `node research/qc.js --full` was run at the end; its result is in\nthe final report. The ledger gate requires TODO.md item 0 to list\n`Q-rho-sup-z41-0830`; this note may not edit TODO.md, so that line is the\norchestrator's.\n"},"research/history/staging/phase1-T3prep-decision-rule.md":{"lf_sha256":"08ab2b2be95121ef00cd99a0455ccc633bbb0088e436683822b4faa6afc94170","content":"# T3-prep: the pre-registered decision rule for \"does G2(x#)/x² fall?\"\n\n\n\n*(2026-08-18, phase 1. Read-only on the corpus; no repo file edited. Scratch\ncode lives outside the repo. Every number below was recomputed here from\nscratch and the calibration reproduces attack 1 digit for digit.)*\n\n**HEADLINE.** The instrument is calibrated and sharp (it resolves the one-class\ncontrol at 11.6 σ on the same nine points where it returns 0.9 σ on G2), the\nhonest band on the slope is **±0.117 at nine terms**, and the decision rule\nbelow is therefore pre-registered; but the power analysis says the two live\nhypotheses separate at **x = 53** only if the falling law is x·ln²x, and at\n**x = 151** if it is the repo's own conjectural x·ln³x, so **phase 1's extra\nterms at 43 and 47 cannot settle anything, and no reachable exact ladder can\nsettle the version of the question the repo actually believes.**\n\nThe reason is one number: on x ∈ [11, 41] the noiseless log-log reading of\n**c·x·ln³x is −0.009** where flat reads 0.000. The conjectured truth and the\nthing it is being tested against are the same measurement on this range. That\nis not a limitation of the estimator. It is a property of the interval.\n\n---\n\n## 1. THE RULE. Apply this mechanically; nothing below is needed to use it.\n\n### 1.1 Inputs\n\n- A set of **exact** G2(x#) values at primes x. Nothing else. Greedy Y2 values\n are excluded here and handled separately in §1.5.\n- The primary window is **x ∈ [11, X₁]**, all primes in it, no gaps, minimum\n **n = 9**. X₁ is the largest x with an exact term.\n- x_min = 11 is frozen. It is not a tuning knob. See §1.6 for why, and for the\n mandatory robustness row at x_min = 5.\n\n### 1.2 The estimator\n\nLet `b` = the OLS slope of `ln(G2(x#) / x²)` against `ln x` over the window,\nand `se_nom` its residual standard error, `se_nom = sqrt(RSS/(n−2)/Sxx)` with\n`Sxx = Σ(ln x − mean ln x)²`.\n\n**The denominator is x², and x is the same variable used as the regressor.**\nNot x′² (nextprime), not x² − x. Those are legal as *levels* and forbidden as\n*trends*: see §5.1, where the artifact is computed exactly and is 0.199.\n\nEquivalently `b = a − 2` with `a` the fitted exponent of G2. Report both.\n\n### 1.3 The band\n\n```\nse_honest = max( 1.55 * se_nom , 1.052 / n )\n```\n\nBoth terms are measured on the 58-term control, not assumed (§4). At n = 9 they\nagree: 0.116 and 0.117. Use the larger. **Never quote se_nom alone**; on the\ncontrol it covers the true error in only 8 of 14 nested designs, while\n1.55·se_nom covers 14 of 14.\n\nFor n > 40 the inflation factor 1.55 is too small. The control's own\nsliding-window table gives 2.0 at width 15, 2.2 at width 25 and 2.3 at width\n30. Re-measure it before applying the rule at n > 40; do not extrapolate.\n\n### 1.4 The verdict\n\n| condition | verdict |\n|---|---|\n| `b + 3·se_honest < 0` | **FALLS** |\n| `b − 3·se_honest > 0` | **RISES** |\n| otherwise | **FLAT / UNRESOLVED** |\n\nThree gates must all pass before FALLS or RISES may be reported:\n\n1. **n ≥ 9** and the window contains every prime in [11, X₁].\n2. **Sign agreement.** The same fit over x ∈ [5, X₁] must have the same sign as\n the primary fit. It need not be significant. If the signs differ the verdict\n is FLAT / UNRESOLVED whatever the primary says.\n3. **The verdict names its window.** \"G2/x² falls\" is not a sentence. \"b =\n −0.31 ± 0.06 over x ∈ [11, 97], n = 21\" is.\n\nThreshold justification: 3 σ with this band gives a measured false-positive\nrate of 0.000 under the flat law at every n ≤ 58 in a 20,000-replicate Monte\nCarlo with the control's own residual structure (§6). Yesterday's failure was a\nfalse positive. The rule is deliberately asymmetric against that failure.\n\n### 1.5 Greedy / certificate values: the one inference they license\n\nY2 is a **lower** bound: `G2(x#) ≥ Y2(x) + 1`.\n\n- **Y2 values may never appear in the same fit as exact values.** Pooling the\n four published Y2 levels onto the nine exact terms moves the slope from\n −0.069 to −0.498, which is **5.7 times the object's own standard error**, and\n turns FLAT into a 14.7 σ \"FALLS\". That is a manufactured verdict.\n- A Y2 ladder fitted alone may be reported, with this sentence attached at the\n point of use: *a falling lower bound is consistent with the truth falling,\n being flat, or rising, and therefore carries no verdict.*\n- **The one exception, and it is one-directional.** If a certified Y2 ladder\n ever satisfies `Y2/x² − 3·se_honest > 0` with Y2/x² growing without bound,\n the truth rises too, and the Zone Postulate is refuted. **A lower-bound\n ladder can produce a RISES verdict and can never produce a FALLS verdict.**\n\n### 1.6 Forbidden operations\n\n- **No slot-unit ratio across natals.** At fixed b = 37 the quantity L·m̄/G2\n runs 0.985, 0.907, 0.804, 0.695, 0.631, 0.531 across natals 5, 11, 13, 17,\n 19, 23 while the object is byte-for-byte identical. A ladder that changes\n natal as it climbs manufactures a 46% fall out of tile geometry. Every fit\n must be at one natal, and the natal must be stated. Working in G2/x² directly\n avoids this entirely, which is the main reason the rule is written in G2 and\n not in combined L.\n- **No control-corrected reading as a verdict.** Subtracting the control's bias\n assumes G2 has the control's shape, which is the question. Report it as a\n sensitivity, never as the verdict.\n- **No bisection on feasibility unless monotonicity is proved.** For the exact\n covering formulation it *is* provable and here is the proof: if a choice\n (a_p) covers [0, L) then the same choice covers [0, L−1), a subset, so\n feasibility is monotone decreasing in L. A greedy predicate has no such\n proof, which is exactly why `two-class-lower-bounds.js`'s `maxM` is unsafe.\n- **No verdict from a comparison of means.** The rule takes a slope and a band.\n\n### 1.7 What the rule returns today\n\nn = 9, x ∈ [11, 41]: b = **−0.0694**, se_nom 0.0747, se_honest **0.1169**,\n|b|/se_honest = **0.59 σ**. Sign gate: the [5, 41] fit is −0.2025, same sign,\npasses. **Verdict: FLAT / UNRESOLVED.**\n\n---\n\n## 2. The question, restated so it is answerable\n\nThe criterion \"combined L against the window in slot units\" was shown by attack\n1 §5 to be G2(x#)/x² at natal 5 to within 1.1% by b = 41, and §7 showed that\ncriterion is TPC-equivalent. So \"does it fall below the threshold\" is not\navailable. The answerable question is:\n\n> **Over the exactly-known range, what is the local logarithmic slope of\n> G2(x#)/x², and is it distinguishable from zero at the measured band?**\n\nThat is an estimate, not a limit. What each answer licenses:\n\n| verdict | licensed |\n|---|---|\n| FALLS | \"G2/x² is measurably decreasing over [11, X₁].\" Nothing about the limit. |\n| RISES | The same, upward. If sustained and unbounded this refutes the Zone Postulate, which is the one direction where finite data can be decisive. |\n| FLAT | \"Over [11, X₁] the object is within the band of x². The asymptotic exponent is untouched.\" |\n\n**No verdict of this rule is evidence about the asymptotic exponent.** The\ncontrol proves the point at full strength: 58 terms of an object whose exponent\nis 1 return 1.282 with white residuals and no drift\n(`research/exponent-control.md` §1). A clean fit at these sizes carries no\nasymptotic information, and no reachable ladder length changes that.\n\n### 2.1 The better parametrisation, and the number to quote\n\nWrite the truth as `G2 = c·x·ln^k x`. On design points with\n`s = OLS slope of ln ln x on ln x`, the noiseless reading is `b = k·s − 1`. So\n\n```\nk_hat = (b + 1)/s se_k = se_honest/s k_flat = 1/s\n```\n\n`k_flat` is the log-power at which the law is numerically **identical to x²**\non that range. It is the resolving power of the range, in one number.\n\n| range | n | s | k_flat | k_hat measured |\n|---|---|---|---|---|\n| [11, 41] | 9 | 0.3302 | **3.028** | **2.82 ± 0.35** |\n| [5, 41] | 11 | 0.3863 | 2.589 | 2.06 ± 0.26 |\n\nRead the top row. **The repo's conjectural truth k = 3 sits 0.51 σ from the\nmeasurement, and \"flat\" sits 0.59 σ from it, on the same side.** The two are\nnot rival readings of this data. They are the same reading.\n\nThe bottom row is why x_min is frozen: moving it from 11 to 5 moves k_hat by\n0.76 and moves k = 3 from 0.5 σ to 3.65 σ. The range choice is worth more than\nthe answer, so it must be chosen before the data and never afterwards.\n\n---\n\n## 3. Calibration: the instrument reproduces, term for term\n\nWritten from scratch, no repo code reused.\n\n| quantity, x ∈ [11, 41], n = 9 | here | attack 1 |\n|---|---|---|\n| control h/x², slope | **−0.8209 ± 0.0709** | −0.821 ± 0.071 |\n| object G2/x², slope | **−0.0694 ± 0.0747** | −0.069 ± 0.075 |\n| control detection | **11.6 σ** | 11.6 σ |\n| object detection | **0.9 σ** | 0.9 σ |\n| separation | **7.3 σ** | 7.3 σ |\n| d ln G2/d ln x | **1.9306 ± 0.0747** | 1.931 ± 0.075 |\n| control h/x² on [5, 41], n = 11 | **−0.8163 ± 0.0397** | −0.816 ± 0.040 |\n\n**CALIBRATION VERDICT: PASS.** The instrument resolves a genuine fall at 11.6 σ\non nine points. The absence of signal on G2 is a measurement, not a lack of\npower, at any effect size down to about 0.35 in slope units.\n\n### 3.1 Data custody, three independent recomputations\n\n- **The control h(x#) = A048670, eleven terms recomputed from scratch** by\n direct segmented sieve over the whole period, x = 2 to 31 (31# = 2.01·10¹¹).\n Survivor count matched the closed form φ(x#) exactly at every level, and all\n eleven maxima match the repo array `research/exponent-control.js:const H`.\n h(37#) = 66 and h(41#) = 74 are the repo/OEIS values only and are flagged as\n such; they are two of the eleven points in the [11, 41] control fit.\n- **G2 itself recomputed by exact covering search**, ten terms, x = 2 to 29:\n 2, 6, 12, 30, 42, 66, 108, 150, 204, 258. Every one matches. This is a third\n independent route to the ladder (enumeration, bit-parallel, covering) and it\n is also a direct check of the brief's CRT identity `G2(x#) − 1 = the maximum\n coverable interval`, which the search uses as its definition.\n- The sliding-window band constant reproduces the repo's stated 1.05/width at\n **1.052** from a twelve-width least-squares fit.\n\n---\n\n## 4. The band, determined from the data\n\nFour independent routes, all measured.\n\n**(a) Point scatter of the ratio, x ∈ [11, 41].** G2/x²: mean 0.3658, sd\n0.0344, **cv 9.4%**, range 0.3068 to 0.4155. This is the level band, not the\nslope band, and it is not what a trend must beat.\n\n**(b) Residual scatter about the log-log line**, which is what the slope sees:\nobject rms(ln) 0.0858, control 0.0814 on the same nine x. The two objects have\nthe same scatter where both are known, which is what licenses using the\ncontrol's long baseline as G2's noise model.\n\n**(c) Sliding-window scatter on the 58-term control**, the honest\nbetween-window band:\n\n| width | windows | sd(win) | mean se_nom | VIF |\n|---|---|---|---|---|\n| 7 | 50 | 0.1644 | 0.1064 | 1.54 |\n| 9 | 48 | 0.1091 | 0.0771 | 1.41 |\n| 11 | 46 | 0.0884 | 0.0585 | 1.51 |\n| 13 | 44 | 0.0827 | 0.0458 | 1.81 |\n| 19 | 38 | 0.0575 | 0.0275 | 2.09 |\n| 30 | 27 | 0.0366 | 0.0158 | 2.32 |\n\nFit: `sd(win) = 1.052/width`. Detrending against the control's own smooth shape\nbarely changes it (K goes 1.05 to 1.10), so **the between-window scatter is\nnoise, not the drift of the local exponent.** The nominal se understates by\n1.4 to 1.6 at the widths that matter and by more than 2 at width 30.\n\n**(d) Jackknife on the object**, n = 9: se 0.0885 against nominal 0.0747, ratio\n1.19. The most influential term is x = 11; dropping it moves the slope to\n−0.139.\n\n**(e) How the noise scales with x, measured.** Leave-one-out local residuals of\nthe control, in four blocks: rms 0.098 at x ≈ 20, 0.049 at 78, 0.024 at 144,\n0.018 at 226. Power fit **sd(x) = 0.894·x^−0.711**. Extreme-value theory\npredicts 1.2825/θ(x), which decays faster, so the fitted law is the\nconservative one. The practical consequence is large and favourable: the\nper-point noise at x = 113 is a third of what it is at x = 41.\n\n### 4.1 How many terms for a fall of a given size\n\n`n ≥ 3K/effect` with K = 1.052, where \"effect\" is the noiseless slope the law\nwould read on that range.\n\n| effect \\|b\\| | n for 3 σ | n for 5 σ | a law with that effect |\n|---|---|---|---|\n| 0.60 | 6 | 9 | k = 1 on [11, 41] |\n| 0.34 | 10 | 16 | k = 2 on [11, 41] |\n| 0.20 | 16 | 27 | k = 3 on [11, 180] |\n| 0.16 | 20 | 33 | k = 3 on [11, 113] |\n| 0.05 | 64 | 106 | k = 3 on [11, 55] |\n| 0.01 | 316 | 526 | **k = 3 on [11, 41], i.e. today** |\n\nThe last row is the whole problem stated as an arithmetic fact. Detecting the\nrepo's conjectured law against flat on today's range would need 316 exact\nterms. There are thirteen.\n\n---\n\n## 5. Trap defences, with the artifacts computed exactly\n\n### 5.1 Trap: the denominator convention. Artifact = 0.199, exactly.\n\nSame nine terms, three denominators:\n\n| quantity | slope | σ from 0 |\n|---|---|---|\n| G2/x² | **−0.0694** | 0.93 |\n| G2/(x² − x) | −0.1216 | 1.66 |\n| G2/x′² (nextprime) | **+0.1297** | 1.75 |\n\n**The sign flips.** The cause is exact and needs no statistics: the OLS slope of\nln x′ on ln x over these nine points is **0.9004**, not 1, so using x′² as the\ndenominator while regressing on ln x subtracts 2 × 0.9004 instead of 2. The\nartifact is `2(1 − 0.9004) = 0.199`, and −0.0694 + 0.199 = +0.1296 against the\nmeasured +0.1297, agreeing to one part in 10⁴. The artifact is **1.7 times the\nhonest band**. This is the same index-convention effect `exponent-control.md` §6\nrecords as flipping the h2 margin trend from −0.084 to +0.154.\n\nRule: the denominator's variable must be the regressor. x′² is the right\n*threshold* for the Zone Postulate and the wrong *denominator* for a trend.\n\n### 5.2 Trap: a falling lower bound. Artifact = 5.7 standard errors.\n\nY2/x² over the four published levels x = 37, 229, 1009, 4001 falls at\n−0.5242 ± 0.0458, an 11.5 σ detection. Pooling those onto the nine exact terms\ngives −0.4978 ± 0.0340, 14.7 σ, \"FALLS\". The pool moves the answer by 0.4284,\n**5.7 times the object's own nominal se**. §1.5 forbids it.\n\n### 5.3 Trap: slot units across natals. Artifact = 46%.\n\nReproduced from attack 1 §5 at fixed b = 37: L·m̄/G2(37#) = 0.985, 0.907,\n0.804, 0.695, 0.631, 0.531 at natals 5, 11, 13, 17, 19, 23. The object does not\nchange. The rule works in G2/x², which has no natal at all.\n\n---\n\n## 6. Power: where the two hypotheses separate\n\nMonte Carlo, 20,000 replicates per cell, noise = the measured heteroscedastic\nlaw `sd(x) = 0.894 x^−0.711` applied to a stationary block bootstrap of the\ncontrol's own standardised residuals (mean block 5, lag-1 autocorrelation 0.47\nin the standardised residuals, so the correlation structure is real and\ncarried). Rule as pre-registered in §1: BAND-A, 3 σ.\n\n**P(rule says FALLS), by truth and by largest exact term X₁:**\n\n| X₁ | n | flat | k=2 | k=2.5 | k=2.8 | k=3 | k=3.5 |\n|---|---|---|---|---|---|---|---|\n| **41 (today)** | 9 | 0.000 | 0.442 | 0.068 | 0.003 | **0.000** | 0.000 |\n| **43** | 10 | 0.000 | 0.585 | 0.090 | 0.011 | 0.000 | 0.000 |\n| **47 (end of phase 1)** | 11 | 0.000 | 0.699 | 0.137 | 0.019 | **0.000** | 0.000 |\n| 53 | 12 | 0.000 | **0.823** | 0.220 | 0.050 | 0.004 | 0.000 |\n| 71 | 16 | 0.000 | 1.000 | 0.690 | 0.235 | 0.072 | 0.000 |\n| 89 | 20 | 0.000 | 1.000 | 0.957 | 0.651 | 0.243 | 0.000 |\n| 113 | 26 | 0.000 | 1.000 | 1.000 | **0.980** | 0.742 | 0.011 |\n| 151 | 32 | 0.002 | 1.000 | 1.000 | 1.000 | **0.987** | 0.138 |\n| 251 | 50 | 0.000 | 1.000 | 1.000 | 1.000 | 1.000 | **0.952** |\n\n**First X₁ reaching 80% power: k = 2 → 53. k = 2.5 → 79. k = 2.8 → 113.\nk = 3 → 151. k = 3.5 → 251.**\n\nFalse positive under flat: at most **0.003** at every n ≤ 58, and exactly 0.000\nat every n ≤ 21, which is the regime phase 1 lives in. At n = 165 it reads 0.025,\nbut that row recycles a 56-term residual pool through the bootstrap and its\ncorrelation structure is not trustworthy; treat n > 56 as unvalidated.\n\n### 6.1 The forecast for phase 1's own terms, and it is negative\n\nAppending noiseless model values at 43 and 47 to the nine real terms, rescaled\nthrough the real x = 41 point, the rule returns:\n\n| truth | b at n = 11 | se_honest | verdict |\n|---|---|---|---|\n| c x² | −0.0997 | 0.0872 | FLAT / UNRESOLVED |\n| c x ln²x | −0.1202 | 0.0925 | FLAT / UNRESOLVED |\n| c x ln³x | −0.1086 | 0.0891 | FLAT / UNRESOLVED |\n| c x^1.8 | −0.1084 | 0.0891 | FLAT / UNRESOLVED |\n\nThe five hypotheses tested span **0.033 in the fitted slope**, against an\nhonest band of 0.089. **The two new terms move the answer by a third of the\nnoise, and they move it by the same amount whatever the truth is.** G2(43#) and\nG2(47#) are worth having for the ladder and for the OEIS submission. They\ncannot move this question, and the rule above will say so.\n\nThis confirms `exponent-control.md` §8's measurement from the other direction:\nadding an eleventh term to a ten-term control fit moves the exponent by 0.022\non average and 0.078 at worst.\n\n### 6.2 The largest k a range can call falling\n\n| X₁ | n | s | k_flat | largest k callable at 3 σ |\n|---|---|---|---|---|\n| 41 | 9 | 0.330 | 3.028 | **1.97** |\n| 47 | 11 | 0.322 | 3.106 | 2.22 |\n| 53 | 12 | 0.317 | 3.151 | 2.32 |\n| 71 | 16 | 0.302 | 3.307 | 2.63 |\n| 113 | 26 | 0.279 | 3.578 | 3.11 |\n| 151 | 32 | 0.269 | 3.721 | 3.32 |\n| 1009 | 165 | 0.202 | 4.943 | 4.80 |\n\n**x = 113 is the first range that can call k = 3 falling at all**, and 151 is\nthe first that does it with 80% power.\n\n### 6.3 What it costs to get there. Measured, not assumed.\n\nTrap 5 says cost estimates here err cheap, so both routes were probed.\n\n**Enumeration.** Attack 1's measured throughput is 1.188·10¹³ natal-19 slots in\n151 s on ten cores, i.e. 7.9·10¹⁰ slots/s, and the slot count is 0.0390·x#. The\nperiod multiplies by x each term:\n\n| x | x# | projected wall, 10 cores |\n|---|---|---|\n| 43 | 1.31·10¹⁶ | 1.8 h |\n| 47 | 6.15·10¹⁷ | 3.5 days |\n| 53 | 3.26·10¹⁹ | 186 days |\n| 59 | 1.92·10²¹ | 30 years |\n\n**Covering search**, which does not scale with the period. Measured here, naive\nimplementation, single core, \"cover the first uncovered point\" branching with\nan exact per-prime capacity bound:\n\n| x | wall | nodes to prove the maximum | ratio to previous |\n|---|---|---|---|\n| 17 | 0.004 s | 137,008 | |\n| 19 | 0.060 s | 1,532,047 | 11.2 |\n| 23 | 0.882 s | 20,052,980 | 13.1 |\n| 29 | 18.8 s | 323,924,673 | 16.2 |\n| 31 | **> 390 s, killed unfinished** | — | **> 21** |\n\nPer-term cost ratio **15 to 21 in wall, 11 to 16 in nodes**, and the x = 31\nstep passed 21 without finishing and was killed, against\nenumeration's factor of x. Ziller and Morack's optimised adversarial search\nachieves 6.7 per term (`h2-scoping.md` §3, digitised from their figure). Our\nfixed pair {0, −2} has p choices per prime rather than ~p²/2, so it should be\nstrictly cheaper than theirs. `h2-scoping.md` §2's structural finding also\nreproduces here independently, and sharper: **almost all of the cost is proving\nthat no longer interval exists**, not finding the optimum. At x = 23 that is\n35,232 nodes to find against 20,052,980 to prove, i.e. 0.18% against 99.8%,\nwhere `h2-scoping.md` measured 2.5% against 97.5% on the h2 solver. The\nasymmetry deepens with x in my run, which is the direction that matters: a\nlower-bound ladder for G2 stays cheap long after the exact one stops.\n\nReading, stated as a bracket because the extrapolation is four terms long:\n**x = 47 is easy by enumeration, x = 53 is a serious but real commitment,\nx = 59 needs the covering route with ZM-quality code, and x = 113 is not\nreachable by anything** (113# ≈ 10⁴⁶; ZM's own curve prices their term 30 at\n5.6·10⁵ machine-years).\n\n**So the separation point for the repo's own conjecture lies past the end of\nevery route that exists.** That is the finding this task was built to produce.\n\n---\n\n## 7. Two numbers now in circulation that need correcting\n\n**7.1 \"+0.05 ± 0.11 over eleven exact terms\" is a nine-term figure.**\n`attack-block-00-ADJUDICATION.md`:153-154 and the phase-1 shared brief both\ncarry that label. Attack 1's own text is explicit: \"the fitted slope … over the\n**nine** exact levels b = 11 to 41\" (`attack-block-01-ladder.md`:22-23), and its\nsummary table row reads \"b >= 11, nine terms\". The distinction is not cosmetic.\nFor the closest computable quantity, G2/x², the nine-term fit is −0.069 ± 0.075\nand the eleven-term fit is **−0.203 ± 0.064**, which is 3.2 σ on the nominal se\nand 2.0 σ on the honest band. A reader who applies the \"eleven terms\" label\nliterally gets a different verdict from the one the sentence reports.\n\n**7.2 \"the ratio bounces between roughly 0.24 and 0.32\" is G2/x′², not G2/x².**\nOver the thirteen exact terms: G2/x′² runs 0.222 to 0.314, G2/x² runs 0.307 to\n0.667, and restricted to x ≥ 11 it runs 0.307 to 0.416. The quoted band belongs\nto the nextprime convention, which §5.1 shows must not be used for a trend.\nStating a band without its denominator is the same class of slip the campaign's\ntrap 2 records.\n\n---\n\n## COVERAGE\n\n**What I did not reach.**\n\n- **h(37#) and h(41#) were not recomputed.** Direct sieving stops being cheap\n above 31# (2·10¹¹ in 7 minutes; 37# is 7.4·10¹² and 41# is 3.0·10¹⁴). Those\n two points are two of the eleven in the control fit that produces the 11.6 σ\n calibration, and they come from the repo array and OEIS. Nine of eleven are\n mine. If A048670 is wrong at n = 12 or 13 the calibration figure moves, and I\n did not check it independently.\n- **The covering search was not pushed past x = 29 to completion.** The 31 run\n was killed after 390 s without finishing. The per-term ratio is therefore\n measured over four steps and extrapolated over four more. Four-term\n extrapolations of cost curves are exactly what trap 5 is about, and mine is\n no better protected than the ones it corrects. The ratio is *rising*\n (11.2, 13.1, 16.2), which makes my x = 53 and x = 59 figures optimistic.\n- **The 1.55 inflation factor is not validated above n = 40.** I say so in the\n rule, but a rule with an unvalidated regime is a rule with a hole in it, and\n the hole is exactly where a future x = 100 campaign would live.\n- **No G2 term was computed above 41.** The forecast in §6.1 uses noiseless\n continuations, so it shows where the rule's centre lands, not the spread.\n\n**What I suspect but could not prove.**\n\n- The heteroscedastic noise law sd ∝ x^−0.711 is fitted on four blocks of the\n control and is well below the extreme-value prediction 1.2825/θ(x) ∝ 1/x.\n I think the truth is closer to 1/θ and that my power figures are therefore\n pessimistic, perhaps by one or two primes in X₁. I could not separate the\n two laws on 56 points.\n- The covering route probably reaches further than enumeration from x ≈ 47\n onward, but my implementation is naive by a factor I did not measure. A\n faithful reimplementation of the ZM branching is the single highest-value\n engineering item I can see for extending the exact ladder, and **no\n optimality-proving covering search for G2 exists in the corpus to price it\n against.** That absence is calibrated: `research/` was listed (132 scripts),\n the known positive `h2-scoping.md` hits on the ZM cost-curve query, and the\n two candidates are both explicitly lower-bound machinery\n (`two-class-lower-bounds.js` is the greedy; `h2-lower-ladder.js` states in its\n own header that it drops the optimality proof, which is 97.5% of the run, and\n therefore returns a certified lower bound). The cost curve in §6.3 is the\n first one measured for our object, and it is four steps long.\n\n**Where I am most likely wrong.**\n\n1. **The choice of x_min = 11 is the weakest load-bearing decision in the\n rule.** It moves k_hat by 0.76 and it is defended on grounds (band tightness,\n number of folded primes, consistency with attack 1) that are reasonable and\n not decisive. Someone could pre-register x_min = 5 with equal honesty and get\n \"falling at 2.0 σ\" instead of \"flat at 0.6 σ\". I have frozen it and stated\n the sensitivity rather than resolved it, and a rule whose answer depends on a\n frozen arbitrary choice is only half a rule.\n2. **The k parametrisation assumes the truth is c·x·ln^k x.** If the truth has a\n different shape (a genuine power, a log-log correction, a turnover) then\n k_flat is not the right resolving-power statistic and §6.2 is decoration.\n The family is the repo's own conjecture, which is a reason to use it and not\n a reason to believe it.\n3. **The 3 σ threshold buys its zero false-positive rate with power.** Under\n k = 2 at X₁ = 47 the rule fires only 70% of the time; a real fall of that\n size present in the data would be reported as unresolved three times in ten.\n That is the deliberate trade after yesterday, but it is a trade and it should\n be re-argued, not inherited, if the programme's cost of a missed detection\n ever rises above its cost of a false one.\n\n---\n\n*Scratch code: `verify-control.c` (control sieve), `g2cover.c` (exact covering\nsearch), `instrument.js`, `noise.js`, `power.js`, `power2.js`. None is in the\nrepo. No repo file was edited by this task.*\n"},"research/history/staging/recon-0830-smooth-aps.md":{"lf_sha256":"c46652549a48911dc650da39aac60a91c15095e3d52f94103df8581b2c7199c5","content":"# Friable integers in arithmetic progressions, searched in the owning convention: what the equidistribution literature gives the identification step of lim Var/E, and what it does not\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `redteam-0830-imports.md`).** This\n> note's clause that the weight is unmet in print is REFUTED: Harper, JLMS 112\n> (2025) e70293 = arXiv:2412.19644 proves the BDH asymptotic for an arbitrary\n> complex sequence on the same dyadic all-classes object, and its footnote 1\n> addresses the missing maximum over x′ ≤ x. The NEAREST citation is that\n> paper, not arXiv:1208.5992; the step still does not close, on the range\n> (√(2x) < Q ≤ x) and because its Thm 2 route bars sieved sets by name. Two\n> misquotes of Thm 1/Thm 2 are recorded there, and this note's four channels\n> did not surface the 2025 paper.\n\n*Staging note, 2026-08-30. TODO item 9, the \"smooth-numbers-in-APs search\"\nmove named in `attack-0830-varE-identification.md` section 4. Recon and one\ndeduction. Producer: `research/history/staging/recon-0830-smooth-aps.js`\n(embedded by `node research/qc/embed.js`; PARTS A-C; no timing figure\nprinted), which checks the two elementary identities of section 3.2 and the\nkernel bound numerically and measures nothing of the programme's objects.\nEvery locator below is one this pass fetched; what was read of each\n(abstract, full text, page image) is stated beside it.*\n\n## 0. Verdict, the open part first\n\n**The identification step does not close here.** No theorem read at the page\nsatisfies the hypotheses of the inequality `(*)` of\n`attack-0830-varE-identification.md` section 4 as that inequality is written:\nuniform in the modulus `d` up to `y^{4/5}`, with the weight `lam1(e)`, on\n`y`-friable SQUAREFREE `e` coprime to 30, at friability `u = ln e / ln y` in\n`(1.2, 2]`. `lim Var/E = 0.45546` stays HEURISTIC on the step it rested on.\n\n**The quantifier the record asks for is not in print, and it is also more than\nthe step needs.** Every pointwise asymptotic in the owning convention is either\n`O(log q / log y)`-precise (Granville 1993 Theorem 1, page 256, read), which is\n`O(1)` at `q = y^{4/5}`, or is stated \"as `log x / log q -> infinity`\"\n(Soundararajan 2008 Conjecture I(A) and Theorem 1, page 1-2, read; Harper 2012\nTheorem 1, page 2, read), which our `log x / log q >= 3/2` does not supply. But\nthe cell's sum is `sum_d lam0(d) E_d`, and section 3 shows an AVERAGE over `d`\nagainst the weight `lam0(d)` suffices: the Barban-Davenport-Halberstam form,\nwhich sums the squared discrepancy over all classes `a`, is exactly what the\nCauchy-Schwarz step consumes. That is a refinement of the record's statement,\nnot a closure.\n\n**NEAREST theorem, hypothesis unmet: Harper, arXiv:1208.5992v1 (2012),\nTheorem 2, page 3, read at the text layer; a preprint, no journal-ref as of\nthis pass.** Its range covers ours: `log^K x <= y <= x` includes `u in (1, 2]`,\nits moduli reach `Q <= Psi(x, y)`, non-trivially `Q <= Psi(x, y)/log^A x`,\nwhich on the dyadic block `d ~ D` of the cell is `D <= L^{1/2} / log^{A/2}`\n[ARITHMETIC, mine, unstamped], containing `y^{4/5}` and the balanced blocks\ntoo; and its ineffective form saves `log^{-A} x` for every `A` with `u`\nbounded. What it does not have: it counts `1_{n in S(y)}` with weight one, not\n`mu^2(e) 1_{(e,30)=1} prod_{p|e} p/(p-4) / e`, and it carries no maximum over\n`x' <= x` inside the sum. Section 3.4 outlines the elementary reduction of the\nweighted statement to Harper's and names the two places where the tail\nestimates need care; that reduction is NOT written out and NOT claimed.\n\n**PROVEN given the weighted statement `(H_w)` of section 3.1, derivation mine\nand unreviewed (section 3.2-3.3):** the two-branch cells of `Xmix`, both\nmirror cases, at every modulus band `n in (L^{1-eta}, L ln^{2+o(1)} y]`, are\n`o(ln^2 y)`. The balanced blocks are inside `(H_w)`'s range and the band above\nit is trivial, so the Bettin-Chandee kernel separation the record names as the\nnext step is not on this path. What the deduction does NOT cover is the\nthree-branch type: its class map is a function of two of the three parts and is\nnot an arithmetic progression in one variable (section 3.5); its trivial bound\nis `O(ln^3 y)`, and its measured value is `-0.0002` at `x = 19`\n(`attack-0830-varE-identification.md` line 79, PART C).\n\n**Beyond the square root, nothing reaches `u <= 2`.** Fouvry-Tenenbaum 1996\nTheorems 2-3, Drappeau 2015 Theorem 1, Drappeau-Granville-Shao 2017 Theorem\n1.2 and Pascadi 2025 Theorem 1.5 all hypothesise `y <= x^{delta}` or\n`y <= x^{1/C}` with `delta` small or `C` large, that is `u -> infinity`, and\nall fix the residue. NOT APPLICABLE, on a hypothesis and not on a precision.\n\nNothing here is TPC-strength; the wrong-direction guard of the parent note's\nsection 7 applies unchanged (every inequality below is an upper bound on the\nabsolute value of a signed remainder).\n\n## 1. The object, restated in the literature's notation\n\nFrom `attack-0830-varE-identification.md` section 4 (lines 253-299), with\n`L = x#`, `y` the largest prime `<= sqrt L`, so `L = y^{2+o(1)}`. The dominant\ncell is the two-branch type with parts `(d, e)`, `d | h`, `e | h - 2`,\n`n = de in (L^{1-eta}, 2L]`, `d` the smaller part, `d <= L^{2/5} = y^{4/5+o(1)}`\n(line 271). Writing `h = 2 + ej`, the constraint `d | h` is `j = -2 inv(e) (mod d)`,\nand for fixed `d`\n\n E_d = sum_{e} lam1(e) [ sum_{j = -2 inv(e) (d), |2+ej|= y^{6/5 - 2 eta}` and `x <= 2L = y^{2+o(1)}`; its `y` is our `y`; its\nmodulus `q` is our `d`; its class `a` is the class of `e` mod `d` (the map\n`e -> -2 inv(e)` is a permutation of the reduced classes, `d` odd); its\n`Psi(x, y; a, q)` is the weight-one count our `lam1`-weighted count replaces;\n`u = log x / log y in (1.2 - 2 eta, 2 + o(1)]`; and `log x / log q >= 3/2` at\nthe top of the `d`-range, unbounded only as `d -> 1`. Two features have no\ncounterpart in `Psi`: the weight `lam1`, whose `1/e` is partial summation and\nwhose `prod p/(p-4)` is a multiplicative twist with `g(p) = p/(p-4) > 1`; and\nthe restriction to squarefree `e` coprime to 30.\n\n**What the step needs, stated at the weakest rung that closes it (section 3).**\nNot `(*)` uniform in `d`, but: for each `M >= 1/2` dyadic and each dyadic\n`D <= L^{1/2}/log^C L`, with `E = L/(DM)`,\n\n sum_{d ~ D} lam0(d) sum_{a mod d, (a,d)=1} max_{t in [E, 2E]} | S_a(t; d) - S*(t; d) | = o(1) * log D,\n\n`S_a(t; d) = sum_{e <= t, e = a (d)} lam1(e)` over friable squarefree `e`\ncoprime to 30, `S*(t; d) = (1/phi(d)) sum_{e <= t, (e,d)=1} lam1(e)`. That is a\nBombieri-Vinogradov-type average over `d` with the sum over ALL classes `a`\ninside, i.e. the `L^1`-in-`a` form, which the `L^2`-in-`a`\n(Barban-Davenport-Halberstam) form implies through Cauchy-Schwarz at a cost of\n`phi(d)^{1/2}`. This is the statement searched below.\n\n## 2. The sources, read at the page\n\nEvery PDF below was fetched by `curl` with a browser user agent, answered HTTP\n200, and was read at the text layer (`pdftotext`) except where a page image is\nnamed; sha256 of each PDF is in the scratchpad log of this pass. \"Range of q\"\nis the theorem's, \"ours\" is the dictionary of section 1. The verdict is against\nthe statement of section 1, not against `(*)`.\n\n| source | statement as read | range against ours | uniformity in `a` | weight, squarefree | verdict |\n|---|---|---|---|---|---|\n| Granville, *Integers, without large prime factors, in arithmetic progressions, I*, Acta Math. 170 (1993) 255-273, DOI 10.1007/BF02392787, Project Euclid PDF, **page image of pp. 255-256 read** | Thm 1 (1.4)-(1.5): `Psi(x,y;a,q) = Psi_q(x,y)/phi(q) {1 + O(log q / log y)}` uniformly for `(a,q)=1`, `x >= y >= 2`, `q <= min{x, y^N}`. Thm 2 (1.6)-(1.7): `sum_{q<=Q} max_{x'<=x} max_{(a,q)=1} |Psi(x',y;a,q) - Psi_q(x',y)/phi(q)| <<_A Psi(x,y)/log^A y` for `y >= 100`, `Q <= exp(C log y log log y / log log log y)`, `x >= Q^2 log^B Q`. Thm 3: `Psi(x,y;a,q) asymp Psi_q(x,y)/phi(q)` for `q <= y^N`, `N < 4/3`, `x >= max{y^{3/2+eps}, q y^{3/4+eps}}` | Thm 1: relative error `O(log d / log y)`, i.e. `O(1)` at `d = y^{4/5}`, `o(1)` only for `d = y^{o(1)}`. Thm 2: `x >= Q^2 log^B Q` with `x = L/(dM)` gives `D <= L^{1/3}/log^{B/3}` = `y^{2/3-o(1)}` [ARITHMETIC, mine]; `y >= 100` with no relation to `x`, so `u in (1.2, 2]` is inside. Thm 3: order of magnitude only | Thm 1 pointwise; Thm 2 max over `a` AND over `x' <= x` inside the sum | weight 1, all friable `n` | Thm 1: NOT APPLICABLE at the top of the `d`-range (precision `O(1)`). Thm 2: NEAREST for `d <= y^{2/3-o(1)}` with the max over `x'` we need; weight unmet |\n| Granville, *... II*, Philos. Trans. Roy. Soc. London A 345 (1993) 349-362, DOI 10.1098/rsta.1993.0134 (OpenAlex; Drappeau's bibliography prints no. 1676) | NOT READ: royalsocietypublishing.org and doi.org both answered 403 to two `curl` attempts with a browser UA (a claim about the fetcher). Soundararajan p.1 (read): \"In [5], [6] Granville established this Conjecture when A < 1\", i.e. equidistribution for `q <= y^A`, `A < 1`, as `log x / log q -> infinity` | quantifier `log x / log q -> infinity` not ours | pointwise | weight 1 | NOT APPLICABLE as restated second-hand; page unread |\n| Fouvry-Tenenbaum, *Entiers sans grand facteur premier en progressions arithmetiques*, Proc. LMS (3) 63 (1991) 449-494, DOI 10.1112/plms/s3-63.3.449 | NOT READ: Wiley and OUP answered 403 (browser UA). Restated at Granville I p.255-256 (page image): (1.2) `Psi(x,y;a,q) = Psi_q/phi(q){1 + O(exp(-c sqrt(log y)))}` for `x >= y >= exp(c (log log x)^2)`, `q <= log^N x`, and a similar estimate for `q <= exp(c sqrt(log y))`; and at Harper 2012 p.4 (read): their Theoreme 1 is the max-over-`a` Bombieri-Vinogradov bound `<< Psi e^{-c_1 u/log^2(u+1)}/log^A x + sqrt x Q u^{u(1+o(1))} log^{A+5} x` on `exp(log^{2/3+eps} x) <= y <= x` | pointwise: `d <= exp(c sqrt(log y))`, far below `y^{4/5}`. Average: level `x^{1/2}`, i.e. `D <= L^{1/3-o(1)}` | pointwise and max over `a` | weight 1 | NOT APPLICABLE pointwise at our `d`; the average form is superseded by Harper Thm 1 in our range |\n| Fouvry-Tenenbaum, *Repartition statistique des entiers sans grand facteur premier dans les progressions arithmetiques*, Proc. LMS (3) 72 (1996) 481-514, DOI 10.1112/plms/s3-72.3.481 | NOT READ (403). Restated as Theoreme A at Drappeau 2015 p.3 (read): for `1 <= y <= x^delta`, fixed `a != 0`, `sum_{q <= x^{3/5-eps}, (q,a)=1} |E(x,y;a,q)| <<_A x / log^A x` (`|a| <= x^delta`), and level `6/11` for `|a| <= x` | **`y <= x^delta` is `u >= 1/delta`; ours is `u <= 2`** | fixed `a`, absolute values | weight 1 | NOT APPLICABLE, hypothesis `u -> infinity` unmet |\n| Soundararajan, *The distribution of smooth numbers in arithmetic progressions*, Anatomy of Integers, CRM Proc. Lect. Notes 46 (2008) 115-128; arXiv:0707.0299v1, pp. 1-4 read | Thm 1: for `q <= y^{4 sqrt e - eps}` and `exp(y^{1-eps}) >= x >= y^{(log log y)^4}`, `Psi(x,y;q,a) ~ Psi_q(x,y)/phi(q)`; Conjecture I(A) is the same as `log x / log q -> infinity` | `x >= y^{(log log y)^4}` is `u >= (log log y)^4`; ours is `u <= 2` | pointwise | weight 1 | NOT APPLICABLE, hypothesis unmet |\n| Harper, *On a paper of K. Soundararajan on smooth numbers in arithmetic progressions*, J. Number Theory 132 (2012) 182-199; arXiv:1103.2106v1, pp. 1-3 read | Thm 1: `y <= x`, `2 <= q <= y^{4 sqrt e - delta}`, `y` large in `delta`: `Psi(x,y;q,a) ~ Psi_q(x,y)/phi(q)` \"as `log x / log q -> infinity`\"; the smoothed error (p.2) carries the term `(log q)/(u log y)` and the term in `w = min{v, y}`, `v = log x / log q` | at `d = y^{4/5}`, `x = L/d`: `v = log x / log d <= 3/2 + o(1)` on the top block, so the asymptotic is not asserted; the error term `(log q)/(u log y)` reads `(4/5)/u` there | pointwise, all `(a,q)=1` | weight 1 | NOT APPLICABLE at the top of the `d`-range; APPLIES for `d = y^{o(1)}` (same as Granville Thm 1) |\n| **Harper, *Bombieri-Vinogradov and Barban-Davenport-Halberstam type theorems for smooth numbers*, arXiv:1208.5992v1 (2012), 33 pp., no journal-ref on the arXiv abstract page (fetched); cited as \"preprint\" by Drappeau-Granville-Shao 2017 [7] and as \"pre-publication\" by Drappeau 2015 [Har12b]; pp. 1-5 and 17-19 read** | Thm 1 (p.3): `log^K x <= y <= x`, `1 <= Q <= sqrt(Psi(x,y))`: `sum_{q<=Q} max_{(a,q)=1} |Psi(x,y;q,a) - Psi_q(x,y)/phi(q)| << Psi(x,y)(e^{-cu/log^2(u+1)} + y^{-c}) + sqrt(Psi(x,y) Q) log^{7/2} x`, and for any `A` the ineffective `<<_A Psi(x,y)(e^{-cu/log^2(u+1)}/log^A x + y^{-c}) + sqrt(Psi Q) log^{7/2} x`. **Thm 2 (p.3): `log^K x <= y <= x`, `1 <= Q <= Psi(x,y)`: `sum_{q<=Q} sum_{(a,q)=1} |Psi(x,y;q,a) - Psi_q(x,y)/phi(q)|^2 << Psi(x,y)^2 (e^{-2cu/log^2(u+1)} + y^{-c}) + Psi(x,y) Q`, and ineffectively `<<_A Psi(x,y)^2 (e^{-2cu/log^2(u+1)}/log^A x + y^{-c}) + Psi(x,y) Q`.** Proof of Thm 2: conductors `<= x^eta` by the arguments of section 3.3 (\"we merely insert the squares of all our bounds\", p.18), the ineffective factor from Siegel's theorem (p.18); conductors `> x^eta` by the multiplicative large sieve, needing only `y >= log^K x` (p.19) | `y <= x` and `y >= log^K x` hold for `x = L/(dM) >= y^{1+o(1)}` [when `x < y` the count is all integers and the bound is trivial]; `u` bounded is allowed, at the price of the ineffective constant. Thm 1 non-trivial for `Q <= sqrt(Psi)/log^{7+2A}`: `D <= L^{1/3-o(1)}`. Thm 2 non-trivial on a dyadic block `d ~ D` when `D << Psi(x,y)/log^A x`: `D <= L^{1/2}/(M log^A)^{1/2}` [ARITHMETIC, mine, section 3.3] | Thm 1 max over `a`; Thm 2 sum over ALL `a` of the square | weight 1 on `1_{n in S(y)}`; no max over `x' <= x` | **NEAREST.** Thm 2's range and quantifier match section 1's statement; the weight and the squarefree restriction are unmet; the reduction is section 3.4 |\n| Drappeau, *Theoremes de type Fouvry-Iwaniec pour les entiers friables*, Compos. Math. 151 (2015); arXiv:1307.7554v3, pp. 1-4 read | Thm 1: for `(log x)^c <= y <= x^{1/c}`, `sum_{q <= x^{3/5-eps}, (q, a1 a2)=1} |E(x,y; a1 inv(a2), q)| <<_A Psi(x,y)(H(u)^{-delta} log^{-A} x + y^{-delta})`, `|a1|, |a2| <= x^delta`; Cor. 1 adds `max_{z<=x}`. The author's own remark (p.4): a weight `lambda(q) = q^{o(1)}` on the moduli \"n'est pas etudie ici\" | **`y <= x^{1/c}` is `u >= c`, `c` \"pouvant dependre de eps\"; ours is `u <= 2`** | fixed residue `a1 inv(a2)` | weight 1 | NOT APPLICABLE, hypothesis unmet |\n| Drappeau-Granville-Shao, *Smooth-supported multiplicative functions in arithmetic progressions beyond the x^{1/2}-barrier*, Mathematika 63 (2017) 895-918; arXiv:1704.04831v2, pp. 1-4 read | Thm 1.2: `f` in the class `C` (`|Lambda_f(n)| <= Lambda(n)`, hence `|f| <= 1`), supported on `y`-smooth, `x^delta > y >= exp(C' sqrt(log x log log x)/log log log x)`: `sum_{q <= x^{3/5-eps}, (q,a1a2)=1} |Delta_Xi(f,x;q,a1 inv(a2))| << Psi(x,y)/log^A x`, and the same without `Xi` under a Siegel-Walfisz criterion | `y <= x^delta` unmet (`u <= 2`); and our twist `g(p) = p/(p-4) > 1` has `Lambda_g(p) = g(p) log p > Lambda(p)`, outside `C` | fixed residue | multiplicative, `|f| <= 1` | NOT APPLICABLE, two hypotheses unmet |\n| Granville-Shao, *When does the Bombieri-Vinogradov theorem hold for a given multiplicative function?*, Forum Math. Sigma 6 (2018) e15; arXiv:1706.05710v1, pp. 1-5 read | Thm 2.2: `f in C` supported on `y`-smooth, `y = x/log^gamma x`, `Q = x^{1/2}/log^B x`: `sum_{q<=Q} max_a |Delta_A(f,x;q,a)| << x/log^A x` with `A` the characters of conductor `<= log^B x` in the main term | level `x^{1/2}`: `D <= L^{1/3-o(1)}`; `y = x/log^gamma x` is `u = 1 + o(1)`, our `u` up to 2 not covered as stated | max over `a` | `|f| <= 1`; ours outside `C` | NOT APPLICABLE as stated; the class and the level both fall short |\n| Pascadi, *On the exponents of distribution of primes and smooth numbers*, arXiv:2505.00653v2, pp. 1-3 read; and *Smooth numbers in arithmetic progressions to large moduli*, arXiv:2304.11696v3 (abstract via the arXiv API, \"to appear in Compos. Math.\") | Thm 1.5: fixed `a`, `y in [(log x)^C, x^{1/C}]`, `Q <= x^{5/8-eps}`: `sum_{q<=Q, (q,a)=1} |Psi(x,y;a,q) - Psi_q/phi(q)| << Psi/log^A x`; the 2023 paper is the `66/107` exponent | `y <= x^{1/C}`, `C = C(a, A, eps)` \"large enough\": `u -> infinity` | fixed `a` | weight 1 | NOT APPLICABLE, hypothesis unmet |\n| de la Breteche-Fiorilli, *Entiers friables dans des progressions arithmetiques de grand module*, Math. Proc. Cambridge Philos. Soc. 169 (2020) 75-102; arXiv:1506.03268v1, pp. 1-3 read | Thm 1.3: the SIGNED average `sum_{q <= x/M, (q,a)=1} E*(x,y;a,q)` for fixed `a`, `y <= x^{1/C}`, is `-x phi(|a|) rho(u_a)/... + O(...)`: a secondary main term, not a bound | `y <= x^{1/C}`; signed, fixed `a` | fixed `a`, no absolute values | weight 1 | NOT APPLICABLE; different question (the bias), recorded so it is not re-fetched |\n| de la Breteche-Tenenbaum, *Proprietes statistiques des entiers friables*, Ramanujan J. 9 (2005) 139-202; Tenenbaum-Wu, *Moyennes de certaines fonctions multiplicatives sur les entiers friables*, Crelle 564 (2003) | NOT FETCHED this pass; cited from memory as the mean-value (no progressions) literature for multiplicative weights on friable integers; locators UNVERIFIED | no progressions | none | multiplicative weight, no `q` | NOT APPLICABLE by object (mean values, not progressions); unverified |\n\n**Channel calibration.** OpenAlex `search=` on \"Barban-Davenport-Halberstam\nsmooth numbers\" (91 hits) and on \"Bombieri-Vinogradov smooth numbers\" (357)\nboth returned Harper's preprint as the top record, the known positive; neither\nlist, nor \"friable progressions arithmetiques fonction multiplicative\" (6 hits,\nall off-object), nor the arXiv API title sweeps `ti:\"smooth numbers\" AND\nti:\"arithmetic progressions\"` (3 records: Pascadi 2023, Soundararajan 2007,\nHarper 2011) and `ti:friables AND ti:progressions` (1 record: de la\nBreteche-Fiorilli), surfaced a Barban-Davenport-Halberstam or\nBombieri-Vinogradov theorem for a MULTIPLICATIVELY WEIGHTED friable sequence\nat bounded `u`. That is a negative in the owning convention on four calibrated\nchannels (this file, sections 1-2, names the convention); the arXiv API\nanswered 200 on every query this pass, the earlier 301 was the http-to-https\nredirect and not a rate limit. A weighted theorem may exist under wording not\ntried; the negative is recorded with that expiry.\n\n## 3. Deduction, or the nearest theorem and its unmet hypothesis\n\nEverything in this section is mine, written this pass, with no adversarial\npass and no producer; nothing is computed. Every inequality is an upper bound\non the absolute value of a signed sum or on a nonnegative sum. Constants\n`C, C_0, C_1, K_1` are absolute unless subscripted by `A`.\n\n### 3.1 The hypothesis `(H_w)`, the weighted Barban-Davenport-Halberstam form\n\nLet `w` be either of the two weights of the cell, `w = lam1` or `w = lam0`\n(`lam0(e) = (1/e) prod_{p|e} 2p/(p-4)`), supported on `y`-friable squarefree\n`e` coprime to 30. For `E >= 2`, `Q >= 1`, `d` running over `y`-friable\nsquarefree moduli coprime to 30, write\n\n Delta_a(t; d) = sum_{e <= t, e = a (d)} w(e) - (1/phi(d)) sum_{e <= t, (e,d)=1} w(e).\n\n`(H_w)`: for every `A > 0` there is `C_A` with\n\n sum_{d <= Q} sum_{(a,d)=1} max_{t in [E, 2E]} |Delta_a(t; d)|^2 <= C_A ( log^{-A} E + Q/E )\n\nfor all `E >= y`, `Q <= E`. [This is Harper's Theorem 2, ineffective form,\ndivided by `E^2` (the `1/e` in `w` costs a factor `1/E` on the block), with a\nmaximum over `t` inside and `1_{S(y)}` replaced by `w`. For `E < y` every\ninteger is `y`-friable and the statement is the trivial one.]\n\n### 3.2 Lemma A: the cell's remainder at one modulus is an `L^1`-in-`a` discrepancy\n\nFix `M >= 1/2` dyadic and `D`, and put `E = L/(DM)`; the sub-cell is `d ~ D`,\n`e ~ E`, so `n = de asymp L/M`. For `d` fixed, group the `e` by their class\n`a` mod `d`. With `G(a, e) := R_{de}(c(a, e))`,\n\n E_d^{(M)} = sum_{(a,d)=1} sum_{e ~ E, e = a (d)} lam1(e) G(a, e).\n\n(i) `|G(a, e)| <= 2/M` on the block (the bound `|R_n(c)| <= 2n/L`).\n(ii) `G(a, .)` has total variation `<= C` on `e ~ E`, uniformly in `a, d`:\nwriting `theta = c/n = j_0/d + 2/(de)` with `j_0 = -2 inv(e) mod d`, which is\nCONSTANT on the class `a`, and `rho = (L mod n)/n = {L/n}`, the closed form\nreads `R_n(c) = (n/L) F(rho, theta)`, `F(rho, theta) = (rho - theta)^+ + (rho + theta - 1)^+ - rho^2`,\n`|F| <= 1`, `F` Lipschitz in `rho` with constant `<= 4`, and `F(0, theta) = F(1, theta) = 0`\nso `F` is continuous across the wrap of `rho`. As `e` runs through the class,\n`L/(de)` falls from `M` to `M/2`, so `rho` winds at most `M/2 + 1` times, each\nwinding contributing variation `<= 4` to `F`; the prefactor `n/L in [1/(2M), 2/M]`\nhas variation `<= 2/M`. Product rule: `Var G <= (2/M)(4(M/2 + 1)) + 1 * (2/M) <= 14`.\n[ARITHMETIC, mine, unstamped; the variation count is the load-bearing line of\nthis section.]\n(iii) Partial summation in `e` on the class, against `Delta_a`:\n\n | sum_{e ~ E, e = a (d)} lam1(e) G(a,e) - (1/phi(d)) sum_{e ~ E, (e,d)=1} lam1(e) G(a,e) |\n <= (2 sup|G| + Var G) max_{t in [E,2E]} |Delta_a(t; d)| <= C_1 max_t |Delta_a(t; d)|.\n\n(iv) The main term. `sum_{(a,d)=1} G(a, e) = sum_{j in (Z/d)^x} R_{de}(2 + ej)`,\nand by Mobius over `g | d`, `sum_{j = 0 (g)} phi_{de}(2 + ej) = phi_{eg}(2)`\n(the classes `2 + egj'` mod `de` are exactly the classes `= 2 mod eg`) with\nmean `(d/g) L/(de) = L/(eg)`, so\n\n sum_{(a,d)=1} G(a, e) = sum_{g | d} mu(g) R_{eg}(2), |.| <= sum_{g|d} min(1, 2eg/L) <= 2^{omega(d)}.\n\nHence, with `S_d := sum_{e ~ E, (e,d)=1} lam1(e) <= C_0` (the mean value of\n`prod_{p|e} p/(p-4)` over squarefree `e` converges, since `sum_p 4/(p(p-4))` does),\n\n |E_d^{(M)}| <= C_1 sum_{(a,d)=1} max_t |Delta_a(t; d)| + C_0 2^{omega(d)}/phi(d).\n\nThe second term summed against `lam0(d)` over ALL `d` is `<= C_0 sum_d (14/3)^{omega(d)} 2^{omega(d)} / (d phi(d)) = O(1)`.\n\n**Checked numerically (producer, PARTS A-C, OUTPUT lines 140-146).** The\nkernel bound holds with ratio at most `0.656563` on 1200 random `(L, n, c)`\nand the closed form agrees with the direct sum to `1.25e-14` (line 140); the\nidentity (iv) holds to `1.33e-12` on 180 random `(L, d, e)` (line 142); on 600\nrandom blocks `(L, M, d, a)` with classes of up to 6674 terms, the total\nvariation of `G(a, .)` is at most `0.4576` against the claimed 14 and\n`M sup|G|` at most `0.4658` against the claimed 2 (lines 144-146). The claimed\nconstants are loose upper bounds; the loose direction is the safe one here.\n\n### 3.3 Lemma B: the block sum, and the two-branch cell under `(H_w)`\n\nCauchy-Schwarz over `d ~ D`, then `(H_w)` with `Q = 2D`:\n\n sum_{d ~ D} lam0(d) |E_d^{(M)}|\n <= C_1 ( sum_{d ~ D} lam0(d)^2 phi(d) )^{1/2} ( sum_{d <= 2D} sum_a max_t |Delta_a|^2 )^{1/2} + O(main)\n <= C_1 ( C log^{K_1} D )^{1/2} ( C_A ( log^{-A} E + 2D/E ) )^{1/2} + O(main),\n\nusing `lam0(d)^2 phi(d) <= c^{omega(d)}/d` with `c = (14/3)^2` and\n`sum_{d ~ D} c^{omega(d)}/d << log^{c-1} D =: log^{K_1} D`. With `D/E = D^2 M/L`\nand `A > K_1 + 4`:\n\n- for `D <= D_max(M) := L^{1/2} / (M log^{K_1+2} L)^{1/2}`, the block is\n `<< log^{(K_1 - A)/2} L + (D^2 M/L)^{1/2} log^{K_1/2} L`; summed over the\n `<= log L` dyadic `D`, `<< log^{1 + (K_1-A)/2} L + 2 log^{-1} L = o(1)`;\n- for `D in (D_max(M), (2L/M)^{1/2}]`, the band of `<= ((K_1+2)/2) log log L + 1`\n dyadic blocks, the trivial bound `|E_d^{(M)}| <= (2/M) S_d <= 2C_0/M` gives\n `<< (1/M) log L log log L` (each dyadic block of `d` carries\n `sum_{d ~ D} lam0(d) << log D`).\n\nSumming over dyadic `M` from `1/2` to `M_0 = log L`: `o(log log L) + O(log L log log L)`;\nthe tail `M > M_0` is trivially `<= (2C_0/M_0) sum_d lam0(d) << log L`.\nFor the band `n > 2L`, i.e. `M' = n/L in (2, log^{2+o(1)} y]` (the parent\nnote's section 5 cut), the same argument runs with `E = LM'/D`, `|G| <= 1`,\n`Var G <= 2` (there `phi_n(c) = (1 - ||c||_n/L)^+` is monotone in `e` on a\nclass), and no `1/M` gain in the band, over `<= 2 log log L` dyadic `M'`:\n`o(1) + O(log L (log log L)^2)`. Altogether\n\n X_{mix2a}(n in (L^{1-eta}, L log^{2+o(1)} y]) = O(log L (log log L)^2) = o(ln^2 y) given (H_w) for w = lam1.\n\nThe mirror case (`e` the smaller part) is the same with `lam0` as the summed\nweight and `lam1` on the modulus, and needs `(H_w)` for `w = lam0`. The\n`(+,-)` type (`d | h-2`, `e | h+2`) has class map `j = -4 inv(d) (mod e)`, a\npermutation of the units mod `e`, and runs identically. So under `(H_w)` for\nboth weights, EVERY two-branch cell of `Xmix` is `o(ln^2 y)`, at every band,\nbalanced blocks included; the kernel separation of the parent note's section\n3 item 4 is not needed on this route.\n\n### 3.4 From `(H_w)` to Harper's Theorem 2: an outline, NOT a proof\n\nWrite `f(e) = e w(e) = mu^2(e) 1_{(e,30)=1} 1_{S(y)}(e) prod_{p|e} g(p)`,\n`g(p) = p/(p-4)` (or `2p/(p-4)`). (a) The `1/e` is partial summation on\n`[E, 2E]` against `f`, costing the maximum over `t` that `(H_w)` already\ncarries. (b) `prod_{p|e} g(p) = sum_{m | e} h(m)`, `h(m) = mu^2(m) prod_{p|m}(g(p)-1)`,\nwith `sum_m h(m)/m^{1/2} = prod_p (1 + (g(p)-1)/p^{1/2}) < infinity`; so\n`sum_{e<=t, e=a(d)} f(e) = sum_{(m,d)=1} h(m) sum_{e'<=t/m, e'=a inv(m)(d), (e',m)=1} mu^2(e') 1_{(e',30)=1} 1_{S(y)}(e')`.\nTruncate at `m <= T = log^B t`; the class map `a -> a inv(m)` permutes the\nunits, so Cauchy-Schwarz over `m` costs `sum_{m<=T} h(m) tau(m) << log^8 T`.\n(c) `mu^2(e')` and `(e', 30m) = 1` by Mobius over `p <= P` exactly, `P` a\nconstant, and the primes `p > P` with `p^2 | e'` left in a tail. (d) The\ntails. Uniformly in `a` they FAIL beyond `d asymp t^{2/3}`: the count of\n`e <= t`, `e = a (d)` with `p^2 | e` for some `p > P` is, term by term,\n`<= sum_p (t/(p^2 d) + 1)`, and the `+1`'s cost `t^{1/2}`, which exceeds the\nclass mass `t/d` once `d > t^{1/2}`; a sharper count by `n = e/p^2` gives\n`2^{omega(d)}(t/(Pd) + t/P^2)`, fine only for `P^2 >> 2^{omega(d)} d`, whose\n`sum_{p<=P} 1` then exceeds `t/d` at `d > t^{2/3}`; `t = L/d` makes that\n`d > L^{2/5}`, the parent note's own balance threshold, reappearing as the\nlimit of uniform-in-`a` bookkeeping. On AVERAGE over `a` they do not fail:\n`sum_a (tail_a)^2 <= max_a tail_a * sum_a tail_a <= (t/d + 1)(t/P)`, which is\n`<= eps^2 t^2/d` for `P >= 2/eps^2` and `d <= t`; the same shape handles the\n`m > T` tail of (b) with `sum_{m>T} h(m)/m << T^{-1/2}`. (e) The maximum over\n`t` inside Harper's sum, which his statement lacks: split the coefficients by\nsign, so each partial count is monotone in `t`, and interpolate on a grid of\nratio `1 + log^{-B'} t`, costing `log^{B'}` applications of the theorem plus\nincrements of relative size `log^{-B'}`. (f) The `A` of Harper's theorem must\nthen beat `K_1 + 4` (section 3.3) plus the `log^8 T`, `log^{B'}` and grid\ncosts; since `A` is arbitrary in the ineffective form, this is a choice, not a\nconstraint, and the price is that `C_A` is not computable.\n\nNone of (a)-(f) is written out; (d) is where a write-up could go wrong, and\nit is exactly the balanced range. The calibration is: `(H_w)` is a plausible\ncorollary of Harper's Theorem 2 by elementary means, UNPROVEN here, and\nHarper's theorem is a 2012 preprint that this pass found no journal version\nof (section 2).\n\n### 3.5 What the deduction does not touch: the three-branch type\n\nFor `(n0, n+, n-)` all nontrivial, fix any two parts as the modulus and sum\nover the third: with `n+` summed and `q = n0 n-`, `h = 2 + n+ j`,\n`j = inv(n+) b (mod q)` for a `b` depending on `(n0, n-)` only, a permutation\nof the summed variable's class; the argument of 3.2-3.3 then needs\n`q <= (n/q) / log^A`, i.e. the summed part above `(n log^A)^{1/2}`. Triples\nwith all three parts `<= sqrt n` are outside, and they carry a positive\nfraction of the `4^{omega}`-weighted three-branch mass at `n asymp L` (the\nweight favours many small prime factors, whose three-way split lands each\npart near `n^{1/3}`) [HEURISTIC, mine: the fraction is not computed]. On that\nset the trivial bound is `O(ln^3 y)` and no one-variable progression\nstatement reaches it; the class map in two summed variables is the\nKloosterman-fraction shape of the parent note's section 3. OPEN; measured\n`-0.0002` at `x = 19` (`attack-0830-varE-identification.md` line 79).\n\n### 3.6 Falsifiers\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| `Var_e G(a, .) <= 14` on a block, uniformly | ARITHMETIC, mine, checked | a `(d, a, E)` with larger variation, e.g. from a non-continuity of `F` at the wrap I missed | YES, 600 random blocks at three `L`, worst `0.4576` (producer PART C, OUTPUT line 145); not a proof of the constant |\n| `sum_{a unit} R_{de}(c(a,e)) = sum_{g|d} mu(g) R_{eg}(2)` | ARITHMETIC, mine, checked | one `(d, e)` where it fails | YES, 180 random `(L, d, e)`, residual `1.33e-12` (PART B, line 142) |\n| the two-branch cells are `o(ln^2 y)` given `(H_w)` | PROVEN given `(H_w)`, unreviewed | an error in 3.2-3.3, most likely the log-power accounting | NO adversarial pass |\n| `(H_w)` follows from Harper Thm 2 | OUTLINED, not proven | step (d) failing on average, or a hypothesis of Thm 2 I misread | NO |\n| Harper Thm 2 holds with `u` bounded in its ineffective form | READ at the statement (p.3) and at the two proof remarks (p.18-19); the proof not verified | a hidden `u -> infinity` in section 3.3 of the preprint | PARTLY |\n| the three-branch type is `o(ln^2 y)` | NOT CLAIMED | | |\n\n## 4. Proposed SEARCH-CONVENTIONS rows (NOT applied)\n\nTwo rows for section 1 of `research/SEARCH-CONVENTIONS.md`, in its column\norder (object, our name, canonical, owning convention, where it lives). Not\napplied; the orchestrator edits live files.\n\n**Row A.**\n| the class discrepancy of the summed part of a two-branch mixed lag, `sum_{e = a (d)} lam1(e) R_{de}(c)` | the dominant cell of `Xmix`; inequality `(*)` of `attack-0830-varE-identification.md` sec.4 | equidistribution of `y`-smooth integers in arithmetic progressions | **\"smooth numbers in arithmetic progressions\" / \"entiers friables en progressions arithmetiques\", `Psi(x, y; a, q)` against `Psi_q(x, y)/phi(q)`.** Four quantifier registers, and they do not substitute for each other: (i) POINTWISE asymptotics carry either the precision `O(log q / log y)` (Granville 1993 Thm 1) or the hypothesis `log x / log q -> infinity` (Granville 1993 II; Soundararajan 2008; Harper JNT 2012, `q <= y^{4 sqrt e - eps}`), so at `q = y^{theta}` with `x = y^{O(1)}` none asserts `o(1)`; (ii) BOMBIERI-VINOGRADOV with max over `a`, level `x^{1/2}` (Fouvry-Tenenbaum 1991 Thm 1; Granville 1993 Thm 2, which also carries `max_{x' <= x}`; Harper arXiv:1208.5992 Thm 1) on `log^K x <= y <= x`, bounded `u` allowed; (iii) BARBAN-DAVENPORT-HALBERSTAM, sum over all `a` of the square, `Q <= Psi(x,y)/log^A x` (Harper arXiv:1208.5992 Thm 2, a PREPRINT with no journal version found 2026-08-30), bounded `u` allowed in the ineffective form; (iv) BEYOND THE SQUARE ROOT, fixed residue, levels `3/5` (Fouvry-Tenenbaum 1996; Drappeau 2015), `66/107` (Pascadi 2023), `5/8` (Pascadi 2025), ALL under `y <= x^{delta}`, i.e. `u -> infinity`: NOT AVAILABLE at `u <= 2`. Trap: a modulus `q ~ y^{theta}` with `theta` fixed and `x = y^{u}`, `u` bounded, is register (ii)/(iii) territory only; the word \"level of distribution of smooth numbers\" in a title means register (iv) and does not reach it | Granville, Acta Math. 170 (1993) 255-273 (page image of pp. 255-256 read); Harper, arXiv:1208.5992 (2012) Thms 1-2 p.3; Soundararajan, CRM Proc. 46 (2008) 115-128, arXiv:0707.0299; Harper, JNT 132 (2012) 182-199, arXiv:1103.2106; Drappeau, Compos. Math. 151 (2015), arXiv:1307.7554; Pascadi arXiv:2304.11696, arXiv:2505.00653. `history/staging/recon-0830-smooth-aps.md` |\n\n**Row B.**\n| the same, with the weight `lam1(e) = mu^2(e) prod_{p|e} p/(p-4) / e` and coprimality to 30 | the `lam1`-weighted count | multiplicative functions supported on friable integers, in arithmetic progressions | **\"smooth-supported multiplicative functions in arithmetic progressions\"**, the class `C` of `f` with `|Lambda_f(n)| <= Lambda(n)` (hence `|f| <= 1`). Two traps: (a) our twist `g(p) = p/(p-4)` exceeds 1, so `g` is OUTSIDE `C` and every theorem in this convention (Drappeau-Granville-Shao 2017 Thm 1.2, level `3/5` at `u -> infinity`; Granville-Shao 2018 Thm 2.2, level `1/2` at `y = x/log^gamma x`) fails on the class before it fails on the range; the route is the convolution `g = 1 * h`, `h(p) = 4/(p-4)`, back to weight one, which is bookkeeping and is NOT in print for this object; (b) the mean-value literature for multiplicative weights on friable integers (de la Breteche-Tenenbaum, Ramanujan J. 9 (2005); Tenenbaum-Wu, Crelle 564 (2003); locators unverified) has no modulus and is a false friend for a progression search | Drappeau-Granville-Shao, Mathematika 63 (2017) 895-918, arXiv:1704.04831; Granville-Shao, Forum Math. Sigma 6 (2018) e15, arXiv:1706.05710. `history/staging/recon-0830-smooth-aps.md` sec.2-3 |\n\nAlso owed to section 3 of that file (\"searches already run\"): one line, \"Is a\nBarban-Davenport-Halberstam or Bombieri-Vinogradov theorem in print for a\nmultiplicatively weighted friable sequence at bounded `u`? None found on\nOpenAlex (two queries, calibrated on Harper's preprint) and the arXiv API\n(two title sweeps, calibrated on Soundararajan/Harper/Pascadi and on de la\nBreteche-Fiorilli); expiry: any wording of \"weighted smooth numbers in\nprogressions\" not tried, and Google Scholar and MathSciNet review text not\nreached.\"\n\n## 5. Brief errors and channel log\n\n**Brief claims, each verified at its record.** (a) \"uniform o(1)\nequidistribution of y-friable squarefree integers in arithmetic progressions\nto moduli up to y^{4/5}, weighted\": matches `attack-0830-varE-identification.md`\nlines 269-279 (`d <= L^{2/5} = y^{4/5+o(1)}`, `lam1` weight, `u in (1.2, 2]`).\n(b) \"PART A/B reduction\": PART A is the Kloosterman-fraction class, PART B is\n`sum_c R_n(c) = 0` (lines 61-69). (c) \"Henriot's Cor. 2 applies as stated and\ncuts the moduli to n <= L ln^{2+o(1)} y\": lines 91-100. (d) The brief's source\nlist: every locator checked out except two that the brief left to me to fix:\nGranville II's DOI is `10.1098/rsta.1993.0134` (OpenAlex), and Harper's\nBombieri-Vinogradov paper is an arXiv preprint with no journal version found,\nnot \"(arXiv 2012)\" as a stage on the way to print. (e) The brief's \"Fouvry-Tenenbaum\n(1996)\" title is right; it is Proc. LMS (3) 72 (1996) 481-514 per Harper's\nbibliography [7]. (f) One refinement, not an error: the brief and the record\nask for UNIFORMITY in `d`; the deduction needs the `lam0`-weighted average\nover `d` only (section 1), which is why register (iii) of row A is the nearest\nand register (i) is not.\n\n**Numbers in this note.** `82 %`, `99.7 %`, `-3.27`, `0.05 ln^2 y`, `-0.0002`,\n`-0.003` are the parent note's (lines 77, 87, 266-267, 79); `4 sqrt e`,\n`3/5`, `6/11`, `66/107`, `5/8`, `log^K x`, `(log log y)^4` are the sources'\n(section 2 table, page cited per row); `L^{1/3}`, `L^{1/2}/log`, `t^{2/3}`,\n`14`, `K_1 = (14/3)^2 - 1` are mine, marked ARITHMETIC where they occur.\n\n**Channels.** arXiv PDF endpoints: 200 on all nine fetches; arXiv API: 200 on\nall three queries after the http-to-https 301; Project Euclid (Granville I):\n200, page images rendered with `pdftoppm`; OpenAlex: 200; royalsocietypublishing.org,\ndoi.org (rsta), Wiley (plms, both papers) and OUP: 403 to `curl` with a\nbrowser UA, so Granville II and both Fouvry-Tenenbaum papers are UNREAD AT THE\nPAGE and quoted through Granville I p.255-256 (page image), Harper 2012 p.4\nand Drappeau 2015 p.3, all read. Springer (Ramanujan J.) and De Gruyter\n(Crelle) not attempted. No source is recorded unreachable.\n"},"research/history/staging/recon-0904-sifting-limit-floor.md":{"lf_sha256":"9d72ab020b25333bf6405ecdb9388526ae8463cf6fff051b2620f5a684cd1db4","content":"# The sifting limit floor at kappa = 2: what a lower bound on beta(kappa) would have to be, and why the corpus already owns a measured barrier inside the band\n\n\n\n> **RIDER 2026-09-04 (orchestrator, from `redteam-0904-sifting-limit.md`).**\n> Four of five claims survive with corrections; the headline does not. The\n> \"METHOD ARTEFACT at rung MEASURED\" verdict is REFUTED as stated on four\n> grounds, each sufficient: the level-D LP fixes one ω-profile out of a class\n> Ford defines by a one-sided inequality, and a legal profile inside the\n> classical budget at x = 13 reads 5.0113 calibrated, above β₂, firing this\n> note's own pre-registered refutation; the 1.72 calibration is fitted at one\n> point and misses the second proven anchor β(1/2) = 1 by 66 to 82 per cent;\n> the pooled 3.3152 averages four statistics of which only s* is the\n> definitional analogue, and that route reads 3.9487 at x = 43 and is still\n> climbing (+0.43 per ln x, reaching 4.26645 at x ≈ 104 on the fit); and\n> 3.3152 is 22.3 per cent below 4.26645, not 18. The calibrated sentence: no\n> barrier theorem, no exhibited axiom-only argument inside the band, the LP\n> number is a finite-level measurement for one profile. Claim a CONFIRMED with\n> a second source off the OCR channel (Ford 2023 p. 37); Halberstam is p. 117,\n> not 116. Claim b CONFIRMED and strengthened: Brady's class (his p. 10) is the\n> axiom-only interval class Face 4 needs, and 1.819592 rests on proved facts\n> alone; quote it, not 1.8394. Claim c CONFIRMED but demoted: β(2) ≥ 2 is two\n> lines from Ford's one-sided (Ω) plus β(1) ≥ 2, so the padding construction is\n> correct and unnecessary. Of the eight live proposals two survived verbatim,\n> five were reworded and one (the LP floor as a statement about the class) was\n> refuted; the applied versions are in the live layer dated 2026-09-04.\n\n*(2026-09-04. Recon note, HELD. No existing file edited, no git command run\nbeyond read-only status and log. Proposed live-layer changes are listed in the\nlast section and are NOT applied. Legend as in `research/covering-dive.md`:\n**[PROVEN]** published theorem with source; **[VERIFIED]** checked\ncomputationally here; **[MEASURED]** empirical, finite range; **[DERIVED]**\nthis note's own deduction from sourced facts, not reviewed; **[CONJ]**\npublished conjecture; **[ABSENT]** searched and found nothing, with the\nconvention named.)*\n\n---\n\n## 0. Verdict\n\n**The disconfirming half first, and it is most of the note.** Nothing here moves\nan exponent. The open band `(2, 4.26645]` is untouched: no proven statement,\nlocated or derived, reaches into it from below, and the strongest thing that\nsits inside it is still the corpus's own calibrated LP floor, which is a\nfinite-`x` measurement with a wide reading range and not a theorem. The one\nderivation in this note that reaches the value `2` reaches the band's endpoint\nand stops there, and it is almost certainly folklore rather than anything new.\n\n**The corpus's `[ABSENT]` on this face is wrong as written, and wrong in a way\n`SEARCH-CONVENTIONS.md` predicts.** `research/sift-limit-attack.md`:143 records\n`[ABSENT — in sieve-theory vocabulary]` for the whole object and\n`SEARCH-CONVENTIONS.md`:162 records \"None found\" for a `κ = 2` extremal example.\nThe second is right and is now calibrated by a better source than our own\nsearch. The first is not: **lower bounds on `β(κ)` for `κ > 1` are in print, and\nhave been since 1991.** They were invisible because of a convention inversion.\nSelberg's *Lectures on Sieves* works with the reciprocal `a_k = 1/β_κ`, so his\n§17 is titled **\"Some upper bounds for sifting limits for constant sifting\ndensity\"** and its content is a **lower** bound on `β_κ`. A search for \"lower\nbound for the sifting limit\" is therefore a guaranteed clean negative against a\nsection whose title says the opposite. That is exactly the failure mode\n`SEARCH-CONVENTIONS.md` exists to name, and §1's table carries no row for this\nobject.\n\n**What is actually proven, and the best floor on `β(2)`.**\n\n| statement | value at `κ = 2` | rung |\n|---|---|---|\n| Selberg, *Lectures on Sieves* §17, in the reciprocal convention | `β_2 > 1.213` | **[PROVEN]** in print; read only through Google Books OCR snippets, constant uncertain |\n| Brady 2017 Cor. 1, `β_κ ≥ (1+o(1))·2κ/e` | `1.472` asymptotically, nothing effective at `κ = 2` | **[PROVEN]** in a deposited thesis, read at the page |\n| Brady 2017 Cor. 3, effective, stated for `κ ≥ 3` | vacuous at `κ = 3` (`0.6196`), first exceeds 1 at `κ = 4` (`1.1157`) | **[PROVEN]**, read at the page |\n| **Brady's own reduction evaluated at `κ = 2`, which he does not do** | **`β_2 ≥ 3e^{-1/2} = 1.81959`** from his Theorem 22 at `R = 1`; **`5/e = 1.83940`** using his computed `v_3 = 2` | **[DERIVED]** here, one step from his printed proof, unreviewed |\n| monotonicity of `β` in `κ`, by padding a `κ = 1` extremal problem | **`β(2) ≥ β(1) = 2`** | **[DERIVED]** here, §2; hypotheses listed, almost certainly folklore |\n| Granville's exceptional character, interval form | `β_interval(2) ≥ 2` | **[CONDITIONAL]** on Siegel zeros, `attack-barrier-kappa2.md` |\n| the corpus's calibrated one-point LP floor | `3.3152` pooled, individual readings `2.669` to `3.949` | **[MEASURED]**, `lp-push-x43.md`, and independently re-run here |\n\nSo the best **unconditional** floor on `β(2)` is `2`, and it rests on a\nderivation in this note rather than on a citation; the best floor resting on a\ncitation alone is `1.8394`, which is below the band. Under a Siegel-zero\nhypothesis the floor is also `2`, and that hypothesis implies the target.\n\n**Is the cap at 4.26645 a barrier or a method artefact? Method artefact, at\nrung MEASURED, with the class's own floor unknown.** The level-`D` linear\nprogram is the exact information-theoretic limit of every argument that reads\nonly the divisor-class counts, which is exactly what \"axiom-only\" means, and\nthis note's independent re-implementation of it reproduces all twelve of the\ncorpus's published cells to `4.23e-5` and then puts the calibration through a\ntest it had never faced: the calibrated reading must not exceed the published\nDHR value at its own `κ`, because the DHR sieve is itself inside the class.\n**0 of 15 readings exceed it**, and the headroom ratio at `κ = 2` is `0.7442` to\n`0.8344`. So `4.26645` sits about 18 per cent above the one-point floor at the\nlevels reachable, and is not the limit of what the axioms permit. What the\nclass's own limit **is** remains open: measured at about `3.3` with readings\nfrom `2.669` to `3.949`, proven only to be at least `2`.\n\n**The band that matters, restated.** `(2, 4.26645]` is the open band for a\ntheorem. `(2, ~3.3)` is the band in which the measured one-point floor and the\ntruth cannot be told apart on present evidence, and inside which any axiom-only\nargument would have to beat the corpus's own LP measurement to exist at all.\n\n---\n\n## 1. Sub-question 1: lower bounds on `β(κ)` for `κ > 1`, in the owning convention\n\n**The convention, first, because it decides the answer.** Selberg's sifting\nlimit is written `a_k` and is the **reciprocal** of `β_κ`: `a_{1/2} = 1`,\n`a_1 = 1/2`. An upper bound on `a_k` is a lower bound on `β_κ`. His table of\ncontents, read at a Google Books snippet of *Collected Papers* II\n(vol. id `JswcQj2B1HIC`, ISBN 9783540506263), lists\n\n> \"14. The sifting limit for constant sifting density … 16. Two examples in\n> connection with the B2R method 17. Some upper bounds for sifting limits for\n> constant sifting density 18. A historical digression, the parity principle\n> and a further example\"\n\nso the lower-bound content of the *Lectures* lives in a section whose title\nreads as its opposite in our convention. §16 is the examples section and its\nown opening sentence, read at a snippet, scopes it: \"We shall in this Section\nconstruct some particular examples or models in connection with the sifting\nproblem for constant density **when k = 1/2 and when k = 1**.\" **[PROVEN scope,\nread at OCR snippet]**\n\n**The bound itself.** §17 p. 201, at an OCR-degraded snippet in which the\nfraction bars are lost, reads `a_k < e^{(h-1)/k}/h`, optimised at `h = k` for\ninteger `k` to `a_k < e^{1-1/k}/k`, that is `β_κ > κ·e^{1/κ-1}`, and a variant\n\"for all `k > 1`\". At `κ = 2` that is `β_2 > 2e^{-1/2} = 1.213`. **[PROVEN in\nprint; the constant is OCR-uncertain, the direction and the `k > 1` scope are\nnot, and the asymptotic size `κ/e` is corroborated independently below.]**\n\n**The corroboration, and the effective form, read at the page.** Brady's 2017\nStanford dissertation (*Sieves and iteration rules*, Stanford Digital\nRepository `druid:gk881hk9239`, PDF text layer, and an identical copy at\n`notzeb.com/phd-thesis.pdf`) says at printed p. 11, immediately after his\nTheorem 7:\n\n> \"From this, one can improve a lower bound Selberg gave for the sifting limit\n> β_κ by a factor of 2. **Corollary 1.** β_κ ≥ (1 + o(1)) 2κ/e.\"\n\nand at printed p. 51:\n\n> \"**Corollary 3.** If β_κ is the sifting limit of a sieve of dimension κ ≥ 3,\n> then β_κ > (2⌊κ − √κ⌋ + 1) / e^{1 + 1/√κ}.\"\n\nEvaluated: `0.6196` at `κ = 3` (vacuous), `1.1157` at `κ = 4`, `1.1761` at\n`κ = 5`, `1.7120` at `κ = 6`, `3.4859` at `κ = 10`. So a bound above 1 is in\nprint for every `κ ≥ 4`. **[PROVEN, read at the page; a deposited dissertation,\nnot a refereed journal paper, and the derivation was read but not re-derived\nindependently here.]**\n\n**The mechanism, which is the part that matters for this programme.** Neither\nbound is an exhibited arithmetic sequence. Both come from Selberg's **model\nproblem** (*Lectures* §13, described in Brady's §1.3), in which all sifting\nprimes are assumed the same size, so a sieve depends only on the number of\nprime factors and the whole question collapses to: for which `v` does there\nexist `λ_0 = 1, …, λ_R` with `θ(n) = Σ λ_i C(n,i) ≤ 0` at every positive\ninteger `n` and `Σ_n θ(n) v^n/n! > 0`? `v_R` is the largest such `v`. Brady's\nTheorem 22, `v_R ≤ d + 2√d + 1` for `R = 2d+1`, is an upper bound on `v_R`, and\nan upper bound on `v_R` is a lower bound on `β_κ`. **This is the LP/obstruction\nroute of §3 in a different notation, and it is why no `κ > 1` example exists\nwhile `κ > 1` lower bounds do: at `κ > 1` the field bounds the sieve, not the\nsequence.**\n\n**Brady's reduction, evaluated at `κ = 2`, which he does not do.** His proof of\nCorollary 3 runs: suppose `β_κ < 2d+3`; take `P` the primes between `y^{1/(2d+3)}`\nand `y^{1/β_κ}`; then `v = Σ_{p∈P} κ/p = (κ+o(1))log((2d+3)/β_κ)`; the product of\nany `2d+3` of them exceeds the level, so a nontrivial lower bound sieve forces\n`κ·log((2d+3)/β_κ) ≤ v_{2d+2} = v_{2d+1}`. For each `d` this gives\n`β_κ ≥ (2d+3)·exp(-v_{2d+1}/κ)` whether or not the supposition holds, since if\n`β_κ ≥ 2d+3` the conclusion is stronger still. At `κ = 2`:\n\n- `d = 0`, `v_1 ≤ 1` by his Theorem 22: `β_2 ≥ 3e^{-1/2} = 1.81959`.\n- `d = 1`, `v_3 = 2` from his computed `v_R` table, printed p. 46:\n `β_2 ≥ 5/e = 1.83940`.\n- `d = 2`, `v_5 = 3.11714` from the same table: `β_2 ≥ 1.4730`, worse.\n\nThe `d = 1` and `d = 2` values rest on a table Brady computes by his Algorithm 1\nrather than on a theorem, so only the `d = 0` value `1.81959` rests on a proved\ninequality (his Theorem 22 at `R = 1`).\n\n**[DERIVED]**, one substitution from a printed proof, not reviewed. Corollary 3\nis stated for `κ ≥ 3` only because its optimised `d = ⌊κ−√κ⌋−1` is negative at\n`κ = 2`; the underlying inequality has no such restriction. Neither value\nreaches 2, so **nothing in print, and nothing one step from print, enters the\nband or even reaches its lower endpoint.**\n\n**What is genuinely absent, now calibrated by a better source than our own\nsearch.** No extremal example at any `κ > 1`. The best evidence for that is not\nour negative but Halberstam's own, in his review of Greaves, *Bull. AMS* **40**\n(2003) p. 116, read at the PDF text layer:\n\n> \"Concrete examples like Selberg's when κ = 1 and Iwaniec's when κ = ½ are not\n> known and greatly to be desired.\"\n\n**[PROVEN as a statement of the field's own state as of 2003; nothing located\nafter 2003 changes it.]** The DHR book states the `Ω(n) mod 2` example only in\nits `κ = 1` chapter (p. 95, Google Books snippet), and its index lists \"sieving\nlimit\" at pp. 79, 135, 144, 226, 228 with no lower bound and no optimality claim\nabove `κ = 1`.\n\n**Two published statements that look like lower bounds and are not.**\nGrupp–Richert's `ν(κ) > 2κ + 1` for `κ ≥ 7/2` (zbMATH review) bounds the\n**Ankeny–Onishi sieve's own** limit, and the DHR book's `α_κ > β_κ > 2` bounds\n**its own** delay-differential parameters. Both say a particular method cannot\ndo better. Neither is a statement about the axiom class. The corpus already uses\n`α_2 ≥ β_2 + 1` correctly in that method-specific sense\n(`sift-limit-attack.md`, the fractional-retention entry) and must not promote it.\n\n**Ford's notes, re-read for this question.** `sieve2023.pdf` from\n`ford126.web.illinois.edu`, §3.1 p. 37, text layer and rendered page agreeing.\nHis Definition 2 gives the class-level `β(κ)` this note uses. His Table 1 is\ncaptioned **\"Known upper bounds on the sieving limit β(κ)\"**, and the only lower\nbound anywhere in the 129 pages is `β(1) ≥ 2`. He also prints \"Selberg [137,\neq. (14.40)] showed that β(κ) ⩽ 2κ + 0.4454 for sufficiently large κ\", a\nconstant the corpus does not carry: `sift-limit-attack.md` §2 quotes Franze's\n`2κ + 19/36 = 2κ + 0.5278` for the same Selberg result. Both are at source; they\nare not the same number and the corpus should carry both or neither.\n**Ford does not say that no lower bound is known. He is silent, and the corpus\nhas been reading that silence as an absence.**\n\n**One quotation correction owed to Franze.** `sift-limit-attack.md` §2 reports\nFranze as recording \"Selberg's asymptotic `β_κ ≲ 2κ + 19/36`, approached rapidly\nfrom below: two independent technologies plateau near 2κ\". Read at the arXiv\nv1 PDF text layer and confirmed in the TeX source (`siftinglimitspaper.tex`,\nthe only version), Franze's line 73 is `\\beta_\\kappa \\lesssim 2\\kappa + 19/36`\nand his \"approached rapidly from below\" refers to **his own Λ²Λ⁻ table**\napproaching that asymptotic, not to the truth. His line 272 writes\n`\\beta_{\\kappa}\\gtrsim2u+1=2\\kappa+\\frac{19}{36}`, which contradicts his line 73\nand his abstract and is an apparent typo for `\\lesssim`; **it must not be\nquoted as a lower bound.** Also at source, and not in the corpus: \"The\ncalculations in Chapter 17 of [4] show that for the DHR sieves, `β_κ ≲ 2.44κ`.\"\nThe DHR table itself confirms the growth: `β_κ − 2κ` runs `0.266, 0.641, 1.072,\n1.535, …, 6.453` at `κ = 2 … 15`, so the DHR values do **not** plateau near `2κ`\nand the corpus's \"two independent technologies plateau near 2κ\" holds at small\n`κ` only.\n\n---\n\n## 2. Sub-question 2: is `β(κ)` non-decreasing, and does that give `β(2) ≥ 2`?\n\n**Not stated in any source read for this note.** Ford, Franze, Blight, Brady,\nthe DHR book and Halberstam's review all define `β` and none of the six asserts\nmonotonicity in `κ`. **[ABSENT in the six sources read; a weaker claim than\n\"absent from the literature\", and it should be read as the reach of this\nsearch.]**\n\n**The argument, attempted here.** Take a dimension-`κ` sieve problem `A` with\nlevel `y`, sifting parameter `z`, `s = log y/log z`, and normalised sifted\ndensity `S(A,z)/(|A|V_κ(z)) → 0`. Take an auxiliary sequence `B` of dimension\n`κ_B` with level at least `y`, and form the product sequence\n`A' = {ab : a ∈ A, b ∈ B}` with multiplicity. Then:\n\n1. **Dimension adds.** For squarefree `d`, `p | ab` iff `p | a` or `p | b`, so\n `ω'(p)/p = ω_A(p)/p + ω_B(p)/p − ω_A(p)ω_B(p)/p²`, giving\n `Σ_p ω'(p) log p / p = (κ + κ_B) log z + O(1)`. The one-sided `Ω(κ,L)`\n envelope follows from `ω'(p) ≤ ω_A(p) + ω_B(p)`.\n2. **The sifted count multiplies.** `ab` is `z`-rough iff both `a` and `b` are,\n so `S(A',z) = S(A,z)·S(B,z)`, and since `V_{κ+κ_B} = V_κ V_{κ_B}` the\n normalised densities multiply. A factor tending to 0 times a factor bounded\n by 1 tends to 0.\n3. **The level survives.** `|A'_d| = Σ` over the at most `3^{ν(d)}` ways of\n splitting `d` across the two factors, each term `|A_e||B_f|` with `ef | d`.\n So `Σ_{d ≤ y} 4^{ν(d)}|r'_d|` is controlled by the corresponding sums for\n `A` and `B` with a divisor-function weight, which the DHR Theorem 9.1\n remainder condition already carries.\n4. **`s` is unchanged**, because `s = log y / log z` makes no reference to `|A|`.\n\nSo `β(κ + κ_B) ≥ β(κ)` whenever an auxiliary sequence of dimension `κ_B` with\nlevel at least `y` exists, and `B = {m ≤ M}` with `M = y^{1+ε}` supplies\n`κ_B = 1` with a trivial remainder. **Hence `β(κ+1) ≥ β(κ)` and in particular\n`β(2) ≥ β(1) = 2`.** **[DERIVED. Unreviewed. Almost certainly folklore: the\nconstruction is three lines and the padding idea is standard, so this must not\nbe recorded as new, only as located nowhere in the six sources read.]**\n\n**Instantiated, so the hypotheses are visible.** Take `A⁺ = {n ≤ x : λ(n) = +1}`,\nFord §1.7.4 pp. 7–8: `X = x/2`, `g(d) = 1/d`, level `x^{1−o(1)}`, and\n`S(A⁺, √x) = 1`. The level is not a Bombieri–Vinogradov statement: writing\n`n = dm` gives `r_d = (λ(d)/2)L(x/d)` with `L` the Liouville summatory function,\nand the prime number theorem for `λ` alone gives\n`Σ_{d ≤ x^{1−ε}}|r_d| ≪ x/log^A x`. Pad with `B = {m ≤ x}`. Then `A'` has\ndimension 2, level `x^{1−ε}`, `z = √x`, `u = 2 − 2ε`, and normalised sifted\ndensity `≪ log z / x → 0`. So `β(2) ≥ 2`.\n\n**Where it could fail, stated rather than hidden.** (a) The remainder bookkeeping\nin step 3 is sketched, not written out; the `3^{ν(d)}` splitting count and the\ncross terms `|A_e||B_f|` need the two remainder sums to be uniform in the\nsplitting, which is routine but is not checked here. (b) Some conventions tie\nthe level to `|A|` rather than to `z`; under such a convention padding dilutes\n`θ` and the argument gives nothing. Ford's Definition 2 does not, and it is the\ndefinition this note uses. (c) The conclusion is about the class-level `β(κ)`,\nnot about Brady's `inf{s : f_κ(s) > 0}`, which is a property of the DHR\ndelay-differential pair; the two share a symbol and are different objects.\n\n**What it buys, which is little.** `β(2) ≥ 2` is the band's lower endpoint. It\nsays the Zone Postulate's target exponent of 2 sits **exactly at** the axiom\nclass's floor, so no axiom-only argument can go below 2, and an axiom-only\nargument that reached 2 would be attaining the class limit exactly. It says\nnothing about `(2, 4.26645]`.\n\n---\n\n## 3. Sub-question 3: the LP dual, written out, and its finite barrier\n\n### 3.1 The primal, the dual, and what each one is\n\nFix sifting primes `p < z` with `ω(p)` residue classes removed per prime\n(`κ = 2` interval problem: `ω(2) = 1`, `ω(p) = 2` for `2 < p < z`, the classes\nbeing `0` and `−2`). For a sequence `A`, let `y_S` be the density of elements\nwhose prime support below `z` is exactly `S`. Then\n\n- **primal:** `min y_∅` subject to `Σ_{S ⊇ T} y_S = g(T)` for every `T` with\n `∏T ≤ D`, and `y ≥ 0`, where `g(T) = ∏_{p ∈ T} ω(p)/p`.\n\n`y` ranges over non-negative measures on divisor patterns that satisfy every\naxiom the sieve can read at level `D`. **That is precisely the abstract extremal\nproblem the brief describes, and no integer set need realise it.**\n\n- **dual:** `max Σ_{T : ∏T ≤ D} π_T g(T)` subject to `Σ_{T ⊆ S, ∏T ≤ D} π_T ≤ [S = ∅]`\n for every `S`.\n\nSetting `λ_d = π_T` for `d = ∏T`, the dual constraint is exactly the minorant\ncondition `Σ_{d | n, d ≤ D} λ_d ≤ [n = 1]` and the dual objective is exactly the\nmain term `Σ_{d ≤ D} λ_d ω(d)/d`. **So the dual of the abstract extremal problem\nis the general lower-bound sieve, with no restriction to `Λ²` form, to\ncombinatorial weights, or to any construction at all**, and strong duality says\nthe two values coincide: the best main term any level-`D` lower-bound sieve can\ncarry equals the least sifted density consistent with the level-`D` data. A\nvalue of 0 is a barrier for the whole class; a positive value is a sieve.\n\nThis is not new and must not be presented as such: it is the linear-programming\nformulation of the sieve, and Selberg's model problem of §1 is the same object\nwith all primes assumed the same size.\n\n### 3.2 Has anyone computed it at `κ = 2`? Yes, in this corpus, and it was not recorded as a barrier\n\n`research/attack-beta2-04-loss-budget.js` §7 and `research/lp-push-x43.js` solve\nexactly this program at `κ = 1` and `κ = 2` out to `x = 43`, with duality gaps\nto `3.7e-13`, and turn it into the DP1 line of `sift-limit-attack.md` §7d: the\ncalibrated one-point floor **3.3152**, individual readings **2.669 to 3.949**\n(`lp-push-x43.md` §4). In the literature: nothing. `recon-0828-sieve.md` §2\nsearched zbMATH for *sifting limit best possible*, *lower bound for the sifting\nlimit* and *optimality of the combinatorial sieve* and found the only optimality\nstatement in print to be at `κ = 1`. This note adds Halberstam's 2003 review as\nthe authority for that, and Selberg's §17 and Brady's Corollaries as the\nmodel-problem analogue of the LP at large `κ`.\n\n**The point this section exists to make.** `paper/wall-note.md`:429 says \"Inside\n`(2, 4.2665]` there is still no barrier result.\" The corpus's own LP floor at\n`3.3152` **is** a barrier statement inside the band, for exactly the class Face 4\nnames (\"an axiom-only argument\"), and `recon-0828-sieve.md` §5 already uses it as\none: \"Any method reading only `|A_d|` is bounded below by the LP floor 3.3152\".\nFace 4 and that row disagree. The reconciliation is that one is a theorem-level\nclaim and the other is a finite-`x` measurement with a calibration, and Face 4's\nsentence is true of theorems and silent about the measurement it should mention.\n\n### 3.3 Pre-registration, sealed before the companion script was written\n\n*(Written 2026-09-04 before `recon-0904-sifting-limit-floor.js` existed, and\nplaced in this note before the script was written. The script's own output is\nembedded by `research/qc/embed.js`; the scoring sits in section 3.4.)*\n\nThe companion re-implements, in independent code, the level-`D` linear program\nthat `research/lp-push-x43.js` solves, and extends it along one axis that\nprogram never ran: the dimension `kappa` itself.\n\n- **P1, the control.** The independent solver reproduces the twelve published\n raw `s*` cells of `lp-push-x43.js` section 1 (`x = 7, 11, 13, 17, 19, 23` at\n `kappa = 1` and `kappa = 2`) to within `5e-4`, which is the printing\n precision there. A miss on any cell means my implementation, not theirs, and\n nothing below may be quoted.\n- **P2, monotonicity at the LP level.** The raw threshold `s*(kappa)` is\n **strictly increasing** in `kappa` across `kappa in {0.5, 1, 1.5, 2, 3, 4}`\n at every `x in {11, 13, 17, 19, 23}`, with no exception. A single inversion\n is a finding against the LP analogue of \"beta is non-decreasing in kappa\" and\n must be reported as such.\n- **P3, the hard consistency test, and the one that can refute the corpus's\n floor.** DHR's own sieve reads only divisor-class counts, so it lives inside\n the LP's information class, so the calibrated LP reading at any `kappa`\n **must not exceed** the DHR value `beta_kappa` at that `kappa`. Booker and\n Browning's rigorous table gives `beta_3 = 6.64085945080065843931` and\n `beta_4 = 9.07224868172113415960`. Forecast: the `beta_1 = 2` calibrated\n `s*`-route reading lands in `[4.5, 6.0]` at `kappa = 3` and in `[5.5, 8.0]`\n at `kappa = 4`, that is below the DHR value with margin at both. **If any\n calibrated reading exceeds the DHR value at its own `kappa`, the calibration\n that produces the 3.3152 floor is refuted and that floor may not be quoted\n again in this corpus.**\n- **P4, the calibration reproduced.** The calibrated `kappa = 2` reading via\n `s*` at `x = 23` reproduces `lp-push-x43.md` section 3's `3.4889` to within\n `0.01`.\n\n\n### 3.4 Scoring\n\nCompanion: `research/history/staging/recon-0904-sifting-limit-floor.js`, output\nembedded by `research/qc/embed.js`, 458.4 s, 343 LP solves, worst primal\nresidual `1.51e-14`, zero solves failing to certify.\n\n- **P1, the control: PASS.** All twelve published raw `s*` cells reproduced,\n worst disagreement `4.23e-5` against a printing precision of `1e-4`. The two\n solvers share no code.\n- **P2, monotonicity in `κ`: PASS, 25 of 25 strict increases**, zero inversions,\n zero ties, across `κ = 0.5, 1, 1.5, 2, 3, 4` at `x = 11, 13, 17, 19, 23`.\n **[MEASURED]** at five small levels. It is the LP-class analogue of §2's\n derivation and it is not a proof of anything about `β`.\n *A first pass reported one inversion, `s*(1.5) = 6.1308` at `x = 23`. It was a\n solver failure silently read as a zero. The harness now retries under Bland's\n rule and reports failures; the embedded run has none. The first pass's number\n is recorded here because a defect found and fixed is part of the reading.*\n- **P3, the calibration scored against DHR: PASS, and this is the load-bearing\n one.** 0 of 15 calibrated readings exceed the published `β_κ` at their own\n `κ`. Headroom ratio reading/DHR: `0.7442`–`0.8344` at `κ = 2`,\n `0.5813`–`0.7159` at `κ = 3`, `0.4844`–`0.6613` at `κ = 4`. The test could\n have refuted the 3.3152 floor outright and did not.\n- **P4, the published cell: PASS.** `3.4889` at `x = 23` via `s*`, exactly.\n\n**The disconfirming reading inside P3.** The ratio **falls** with `κ`. A floor\nthat tracked the truth would hold its ratio; one that drifts down with `κ` is\na floor that is loosening, which means the instrument is conservative and the\none-point limit could be higher than 3.3152, not lower. That direction is the\none that helps the corpus's inversion claim and hurts any hope of the band.\n\n### 3.5 The barrier made explicit\n\nAt `x = 7`, `κ = 2`, level `D = 21`, `s = 1.5646`, the LP returns a\nnon-negative measure on ten divisor patterns, total mass `1.0000000000`,\nmatching every axiom the sieve can read at that level, with\n`0.000000000000` on the empty pattern. One constraint higher the same program\nreturns `0.004761904762`. So at that level **no argument reading only the\ndivisor-class counts can prove a survivor exists**, and the certificate is a\nten-line table rather than an abstraction. **[VERIFIED]**, and it is a barrier\nfor the method at that finite level, not for the truth: `G₂(7#) = 30` is known\nexactly and the phantom does not contradict it.\n\n---\n\n## 4. Sub-question 4: the best unconditional interval barrier\n\n**Answer: nothing above `β_interval(2) ≥ 3e^{-1/2} = 1.81959`, and that number\nis below 1 only in the sense that it is below 2 and therefore below the band.**\n\n**The route the brief proposes, priced, and it lands at 1.** Take\n`A = {n(n+2) : n ≤ x, λ(n) = +1}`. Two classes per prime, so `ω(p) = 2` and the\ndimension is 2. Level: `#{n ≤ x : λ(n) = +1, n ≡ a mod d}` for `a ≠ 0` is a\nLiouville-in-progressions count, and Bombieri–Vinogradov for `λ` gives level\n`x^{1/2−ε}`, not more. Sifted count: a survivor needs `n` and `n+2` both\n`z`-rough and `λ(n) = +1`, and a `z`-rough integer with `λ = +1` is `1` or\nexceeds `z²`, so the set is empty once `z² ≥ x`, that is `u ≤ 2`. But\n`s = log y / log z = u/2 < 1`. **So the construction gives `β(2) ≥ 1`, which is\ntrivial.** **[DERIVED]** The level is the binding constraint, and it is the same\nconstraint that made the corpus's \"product example, half level\"\n(`sift-limit-attack.md` §2) land outside the operative regime.\n\n**Why the `n ≡ 0` half is not the obstruction.** For `d | n` the count is\n`#{m ≤ x/d : λ(m) = λ(d)}` and the prime number theorem for `λ` alone gives\nlevel `x^{1−o(1)}`, as in §2. It is the second class, `n ≡ −2 mod p`, that needs\n`λ` in a progression to a modulus coprime to `n`, and that is where\nBombieri–Vinogradov caps the level at `1/2`. **The two-class structure is\nexactly what halves the level here**, which is a cleaner statement of the same\nobstruction the corpus records at `sift-limit-attack.md` §2's mixed-sign sketch.\n\n**What would lift it.** An Elliott–Halberstam-strength level for `λ` in\nprogressions, `x^{1−ε}`, would give `s = u < 2` and hence `β(2) ≥ 2`\nunconditionally on intervals. Granville's exceptional character replaces `λ` by\na periodic `χ`, which is why `attack-barrier-kappa2.md` reaches `θ → 1` and\n`β_interval(2) ≥ 2` under a Siegel-zero hypothesis. Neither is unconditional and\nboth stop at 2.\n\n**The only unconditional interval barrier located is method-side, not\nsequence-side.** Brady's model-problem reduction bounds any lower-bound sieve\nregardless of which `A` it is applied to, so `β_interval(2) ≥ 3e^{-1/2}` holds\nunconditionally with no distributional input at all. It is below 2 and therefore\nbelow the band, and it is weaker than §2's padding derivation, which is\nconditional on nothing but is unreviewed. **Neither reaches into `(2, 4.26645]`.**\n\n---\n\n## 5. Sub-question 5: the proposed SEARCH-CONVENTIONS row and the corrections\n\n### 5.1 Proposed §1 row (text only, not applied)\n\n| object | our name | canonical | **OWNING convention, search THIS** | where it lives |\n|---|---|---|---|---|\n| a floor on what any lower-bound sieve of dimension `κ` can do | \"the barrier on Face 4\", \"is 4.2665 a method artefact\" | lower bound on the sifting limit `β_κ` | **Selberg's RECIPROCAL convention `a_k = 1/β_κ`**, in which a lower bound on `β` is titled an **\"upper bound for the sifting limit\"**: search `a_k`, *\"upper bounds for sifting limits\"*, *\"sifting density\"*; and the mechanism convention **\"Selberg's model problem\"**, all sifting primes the same size, parameters `v = Σ_{p∈P} κ/p` and `R`, the quantity to search being **`v_R`**. NOT \"extremal example\", which at `κ > 1` does not exist and is a guaranteed clean negative | Selberg, *Lectures on Sieves*, Collected Papers II (Springer 1991) §§13, 14, 17; Brady, *Sieves and iteration rules*, Stanford PhD 2017, `purl.stanford.edu/gk881hk9239`, Thm 7 and Cor. 1 (p. 11), Thm 22 and Cor. 3 (p. 51), the `v_R` table (p. 46). Ford's 2023 notes Table 1 is captioned \"**Known upper bounds**\" and carries no lower bound. Method-specific limits that must NOT be counted: Grupp–Richert's `ν(κ) > 2κ+1` (Ankeny–Onishi's own), DHR's `α_κ > β_κ > 2` (its own DDE pair) |\n\nA companion line for §3's table: the \"`κ = 2` extremal example\" row's \"None\nfound\" should gain its authority, Halberstam's *Bull. AMS* **40** (2003) p. 116.\n\n### 5.2 Proposed corrections, listed, not applied\n\n1. **`paper/wall-note.md`:422–429, Face 4.** Current: \"no barrier theorem in the\n corpus or in print … **Inside (2, 4.2665] there is still no barrier result.**\"\n Proposed insertion after that sentence: *\"No barrier theorem. The corpus's own\n level-`D` LP does put a measured floor inside the band, at 3.3152 with\n individual readings 2.669 to 3.949 (`lp-push-x43.md` §4), and that floor is a\n statement about exactly this class, so the honest reading of the face is that\n the band is open to a theorem and already contested by a measurement.\"*\n2. **`paper/wall-note.md`:419–421.** Current: \"`β(κ) is unknown in all cases\n κ > 1/2 except κ = 1` … and no such lower bound is known.\" Proposed: *\"…and no\n lower bound on `β(2)` above 2 is known. Lower bounds below 2 are in print:\n Selberg's *Lectures* §17 in his reciprocal convention, and Brady 2017 Cor. 1\n and Cor. 3, giving `β_2 ≥ 1.8394` when his reduction is evaluated at `κ = 2`.\n `β(2) ≥ 2` follows from monotonicity in `κ` by a padding argument\n (`recon-0904-sifting-limit-floor.md` §2), which is unreviewed and probably\n folklore.\"*\n3. **`research/sift-limit-attack.md`:143.** The `[ABSENT — in sieve-theory\n vocabulary]` marker currently covers the whole object. Proposed: keep it for\n the **extremal example**, cite Halberstam 2003 as its authority, and remove it\n for **lower bounds on `β(κ)`**, which are in print under the reciprocal\n convention.\n4. **`research/sift-limit-attack.md`:169.** \"No published example blocks any\n exponent in (2, 4.2665]\" is correct as written; propose adding *\"and no\n published lower bound on `β(2)` reaches 2 either, the best located being\n 1.8394\"*, so the sentence stops being read as \"nothing is known in that\n direction\".\n5. **`research/sift-limit-attack.md` §2, the Franze paragraph.** Add that\n Franze's \"approached rapidly from below\" describes his own Λ²Λ⁻ table, not the\n truth; that his line 272 `\\gtrsim` contradicts his line 73 `\\lesssim` and is an\n apparent typo; that his printed \"`β_κ ≲ 2.44κ` for the DHR sieves\" is the\n growth rate the corpus lacks; and that Ford's notes give the same Selberg\n asymptotic with the constant `0.4454` rather than `19/36 = 0.5278`.\n6. **`research/history/staging/object-g2-read-0829.md`:532–534.** Same edit as\n item 2, since the paragraph reproduces Face 4 verbatim.\n7. **`research/SEARCH-CONVENTIONS.md` §1.** Add the row in 5.1. §1 is parsed at\n run time by the `search-convention` check, so this is a live change to what\n clears the gate and should be reviewed as such.\n\n---\n\n## 6. Provenance\n\n| source | what was read | how | what it carried |\n|---|---|---|---|\n| Booker–Browning ancillary `dhr.html`, arXiv:1511.00601v2/v3 | the `α`, `β` table, full | HTML text layer, `curl` with a browser user agent, and independently by a second fetcher | `β_2 = 4.26645028414864191641`, `β_3 = 6.64085945080065843931`, `β_4 = 9.07224868172113415960` |\n| Franze, arXiv:1012.3809**v1** | introduction, §3, and the LaTeX source `siftinglimitspaper.tex` | PDF text layer via `pdftotext -layout`, plus the e-print source | `β_κ ≲ 2κ + 19/36` for Λ²Λ⁻; \"for the DHR sieves, `β_κ ≲ 2.44κ`\"; the `\\gtrsim`/`\\lesssim` contradiction; no lower bound anywhere |\n| Brady, *Sieves and iteration rules*, Stanford 2017 | pp. 3, 11, 46, 51 and the model-problem chapter | PDF text layer of the Stanford Digital Repository deposit `druid:gk881hk9239`, and a second identical copy at `notzeb.com` | Cor. 1 `β_κ ≥ (1+o(1))2κ/e`; Cor. 3; Thm 22 `v_R ≤ d+2√d+1`; the computed `v_R` table (p. 46) `v_1 = 1`, `v_3 = 2`, `v_5 = 3.11714`; \"It is currently not known whether there is any κ > 1 with β_κ < 2κ\" |\n| Ford, *Sieve Methods Lecture Notes*, `ford126.web.illinois.edu/sieve2023.pdf` | §1.7.4 pp. 7–8, §3.1 p. 37, §4.2 pp. 46–47 | PDF text layer and a rendered page image, agreeing | Definition 2 of `β(κ)`; Table 1 captioned \"Known **upper** bounds\"; `β(κ) ≤ 2κ + 0.4454`; the Liouville example at dimension 1 with level `x^{1−o(1)}` |\n| Blight, Rutgers PhD 2010, RUcore 27420 | printed pp. 6–7, §2.6 pp. 28–29 | PDF text layer, page-isolated | \"a lower bound sieve with a sieving limit of 2κ has not been found for κ > 1\"; `β_κ ∼ cκ`, `c = 3.591…`; upper bounds only |\n| Selberg, *Lectures on Sieves*, Collected Papers II | table of contents p. 65, §14 pp. 165, 179–180, §16 p. 183, §17 p. 201 | **Google Books OCR snippets only**, vol. id `JswcQj2B1HIC`; no page images; fraction bars lost in OCR | §17's title; `a_k = 1/β_κ`; `β_κ = 2κ` as a **conjecture** he himself doubted for large `κ`; §16's examples scoped to `k = 1/2` and `k = 1`; `a_k < e^{1−1/k}/k` |\n| Halberstam, review of Greaves, *Bull. AMS* **40** (2003) | p. 116 | PDF text layer, `curl` with a browser user agent after a 403 to a plain fetch | \"Concrete examples like Selberg's when κ = 1 and Iwaniec's when κ = ½ are not known and greatly to be desired\" |\n| Diamond–Halberstam(–Galway), *A Higher-Dimensional Sieve Method* | pp. 79, 95, 228, index p. 266 | Google Books snippets, vol. id `vnG0S7jMjeYC` | the p. 79 \"trivial lower bound\" sentence verified verbatim; the `Ω(n) mod 2` example stated in the `κ = 1` chapter only |\n| Halberstam–Richert, *Sieve Methods*, Dover reprint | pp. 238–239, 269 | Google Books snippets, vol. id `keKvAAAAQBAJ` | the corpus's p. 239 citation sits in the Notes to Ch. 8, \"The linear sieve\", i.e. `κ = 1`; p. 269 \"When κ > 1 we have at our disposal no result that compares in quality with the main results of Chapter 8\" |\n| Grupp–Richert, *Analysis* **8** (1988) 1–23 | zbMATH review abstract only | zbMATH open API | `ν(κ) > 2κ + 1` for `κ ≥ 7/2`, for the **Ankeny–Onishi** sieve |\n| `research/lp-push-x43.js`, `lp-push-x43.md` | §§0–4 and the embedded output block | in-repo, read | the twelve control cells; the pooled floor 3.3152; readings 2.669–3.949 |\n\n**Channels that failed, exactly.** Selberg's *Collected Papers* Vol. II full\ntext was not reached: `publications.ias.edu/selberg` returns 403 to both a plain\nfetch and `curl` with a desktop Chrome user agent; archive.org's\n`collectedpapers0001selb` is Vol. 1 and lending-restricted; Google Books\n`VgzmnQEACAAJ` (ISBN 9783642410222) has no preview. The working channel was ISBN\n9783540506263, snippet view with search-inside. **Every Selberg quotation in this\nnote is an OCR snippet and none is a page image.** Halberstam–Richert p. 239\nitself was not surfaced: the archive.org item `sievemethods0000halb` is\nlending-restricted and its search-inside endpoint answered 403; about eighteen\ntargeted phrase queries against the Dover volume on Google Books did not reach\nthe page. The Google Books JSON API answers 429 with `quota_limit_value 0`\nwithout a key; the `books.google.dk/books?jscmd=SearchWithinVolume` endpoint\nworks. arXiv's API searches titles and abstracts only, and `all:\"sifting limit\"`\nreturns exactly one paper, Franze.\n\n---\n\n## 7. What this note contradicts in the live layer\n\n1. **`research/sift-limit-attack.md`:143**, the marker `[ABSENT — in sieve-theory\n vocabulary, which is where this object lives]`. **Contradicted for lower\n bounds.** Selberg's *Lectures* §17 and Brady's Corollaries 1 and 3 are lower\n bounds on `β_κ` at `κ > 1`, in print. The absence survives for the extremal\n example only. The search that produced the `[ABSENT]` did read Selberg\n \"through Franze's account\" and did read Brady, so this is not a reach failure\n but a convention failure and a page failure: Brady p. 11 and p. 51 were never\n opened, though pp. 1, 3, 12 and 133 were.\n2. **`research/SEARCH-CONVENTIONS.md`:162**. The row's answer, \"None found. The\n band is a proof gap, not a truth gap\", is right about the example and about\n the band, and its \"what was actually searched\" column lists Brady 2017. It\n should record that Brady contains a lower bound and that the searched\n vocabulary was ours, not Selberg's.\n3. **`paper/wall-note.md`:429**, the sentence \"Inside (2, 4.2665] there is still no barrier\n result.\" **In tension with `recon-0828-sieve.md` §5's last table row**, which\n uses the corpus's own LP floor of 3.3152 as a barrier for exactly this class.\n Both can stand only if \"barrier result\" is read as \"theorem\"; the sentence\n should say so and should name the measurement.\n4. **`research/history/staging/object-g2-read-0829.md`:532–534** reproduces\n Face 4's sentence and inherits both issues.\n5. **`research/sift-limit-attack.md` §2, the Franze paragraph.** \"Two independent\n technologies plateau near 2κ, the community's implicit guess for the\n axiom-class truth at integer κ\" is `[INFERRED]` and is now contradicted by the\n DHR table itself: `β_κ − 2κ` grows without bound over `κ = 2 … 15`, and\n Franze's own printed reading of Chapter 17 is `β_κ ≲ 2.44κ`. The plateau\n holds at small `κ` and the inference does not generalise.\n6. **`research/THE-DIALS.md`:276–279.** The table's `sieve limit β_κ` column\n prints `2` and `4.2665` without saying that the first is a proven two-sided\n value and the second an upper bound only. A footnote is owed.\n\nNothing in this note contradicts `README.md` §Status or `research/G2-STATE.md`\n§0, which were re-read and which do not speak to this face.\n\n---\n\n## 8. What would falsify this note\n\n1. **A published extremal example at `κ = 2`.** It would turn the band from a\n proof gap into a truth gap and would falsify §1's absence. The check that ran\n is Halberstam's 2003 review plus the four theses and note sets of §6; the\n check that has **not** run is the post-2003 literature searched in the\n reciprocal convention, and Selberg's *Lectures* at anything better than OCR\n snippets.\n2. **The Selberg §17 constant being different from `e^{1−1/k}/k`.** Every\n Selberg quotation here is an OCR snippet with the fraction bars lost. The\n direction and scope are corroborated by Brady's sentence; the constant is not.\n A page image of *Lectures* pp. 199–203 settles it and was not obtained.\n3. **An error in the padding argument of §2.** The remainder bookkeeping in step\n 3 is sketched. If the `3^{ν(d)}` splitting cannot be absorbed uniformly, or if\n the intended convention ties the level to `|A|`, `β(2) ≥ 2` falls back to the\n `1.8394` that rests on Brady. Nobody has reviewed step 3.\n4. **The `κ = 2` evaluation of Brady's reduction being outside its hypotheses.**\n His Corollary 3 is stated for `κ ≥ 3`. This note re-runs his own displayed\n chain at `d = 0` and `d = 1`, which requires `v_2 = v_1` and `v_4 = v_3`, an\n identity he asserts inside the proof and this note does not verify.\n5. **The LP calibration failing at a `κ` not tested.** P3 passed at `κ = 3` and\n `κ = 4` at `x ≤ 23`. It has not been run at `κ = 5` or above, where the DHR\n values are larger and the primorial gives the LP less room, nor at `x` beyond\n 23 where the corpus's own solver reaches 43. A calibrated reading above\n `β_κ` at any `(x, κ)` refutes the 3.3152 floor.\n6. **The falling headroom ratio in P3 turning out to be a finite-`x` artefact.**\n If it is, the `κ`-dependence of the calibration is not evidence about the\n floor's tightness in either direction and §3.4's disconfirming reading is\n void.\n"},"research/history/staging/rho-exact-z31-01.md":{"lf_sha256":"65e1451499d19e095bd0c14591f3c9493276666fbea3e98f79800a2e6cba3398","content":"# Exact Λ and sup|ρ̃| at z = 31 and z = 37: TODO item 0's named cheap data, run\n\n\n\n**Caveats first. Nothing here bounds G₂(z#) and RML(α) is open at every α.**\nWhat ran is two exact points on a measured curve, at a cost of 6928 s, with\nevery control passing. The one verdict-shaped result is a **1.38-standard-error**\nexclusion of β₂ from a seven-point slope fit over less than one octave of z,\nwhich survives neither a two-se bar nor the removal of z = 37, and which cannot\nrefute an asymptotic statement in any case. Four things came out.\n\n**One: the two levels TODO item 0 named, exact (§4.1).** Λ(31) = **476.314**\nand Λ(37) = **1286.338**; sup|ρ̃|(31) = **28.122062** over the complete period\nof 6,469,693,230 positions and sup|ρ̃|(37) = **52.219092** over 200,560,490,130.\nThe first suprema measured past z = 29 in this corpus. ⟨ρ̃²⟩ at both levels\nreproduces the cited column digit for digit by two independent routes, so the\ntwo genuinely new numbers sit on a confirmed lattice.\n\n**Two: MV(α) loses its standing, weakly (§4.2).** The slope moves 4.2144 ±\n0.3039 (5 pts) → **4.5656 ± 0.2173** (7 pts) and β₂ = 4.26645 leaves the 1se bar\nfrom below. Before tonight MV(α) was, in `attack-f4weak-01.md`'s own words, the\nonly form here \"whose truth the measurements do not already decide against\"; it\nnow sits with √N·rms, Λ_V and CH as an instrument measured above β₂ in growth.\nThe exclusion is 1.38 se, inside the 2se bar, and reverses if z = 37 is dropped\n(leave-one-out slope 4.365). It is a MEASURED tension, never a refutation.\n\n**Three, and more useful: the truth has 1.50 exponents of room, and the ℓ¹\naccounting is what spends them (§4.3).** d ln sup|ρ̃| / d ln z = **2.766 ±\n0.212** on seven points against β₂ = 4.26645. The instrument's own loss,\nΛ/sup|ρ̃| running 3.74 → 24.63 across z = 13..37, is an endpoint z^1.802, and\n2.766 + 1.802 = 4.568 recovers the Λ slope to three digits. MV exceeds β₂\nbecause absolute-value accounting over modes bleeds 1.8 exponents, not because\nthe object RML must bound is large.\n\n**Four: the legal law survives at both new levels and the TPC-implying one is\ndestroyed at both (§§4.4–4.5).** The Gaussian ρ law (F4, λ = 0, C = 1) holds\nwith C_true = **0.8412** and **0.7820**, 16% and 22% of margin, extending the\n\"true at every exactly measurable level\" column to seven points. S-sharp fails\non **528 of 640** integer H at z = 31 (worst ratio 7.02) and on **all 26** grid\nvalues to 2048 at z = 37 (worst 15.89). One incidental finding, recorded and not\napplied: the dense scan reproduces `phase1-T4-maximal-law.md` §4's last-failure\nH exactly at z = 13, 17, 19, 23 and finds 201 failures at z = 29 where that note\nrecords **none** — a disagreement with a cited number whose producer was never\ncommitted.\n\n---\n\n## 0. WHAT IS OPEN, FIRST\n\n- **RML(α) is open at every α, and nothing here can close it.** This note buys\n two exact points on a measured curve. A measured slope over seven levels\n spanning less than one octave of z is not a theorem about any exponent, and\n the corpus has already recorded (`rho-maximal-law.md` reading 6,\n `attack-f4weak-01.md` §5) that local slopes in this corpus RISE with the\n window at every instrument looked at. Rung: OPEN, unchanged.\n- **Both new levels are single measurements.** sup|ρ̃| at z = 31 and z = 37 is\n one number each, exact over the complete period to the walker's stated drift,\n with no independent second implementation. The controls below are what stands\n between them and a transcription error, and they are named in advance.\n- **The MV(α) slope is a two-point extension of a five-point fit.** If β₂ leaves\n the bar it is because two points moved a short-window OLS, not because\n anything about the law was proven or refuted. §1 pre-registers what each\n outcome may and may not be said to mean.\n- **z = 41, 43, 47 stay out of reach for the exact sup.** The walk is linear in\n W = P(z), and W = 7.42e12, 3.04e14, 1.31e16 there against 2.01e11 at z = 37:\n 37×, 1517× and 65,232× the level this note reached.\n- **The sharp form's check is dense to z = 31 and a GRID at z = 37.**\n `phase1-T4-maximal-law.md` §4 scanned integer H densely and reports \"last H\n at which S-sharp fails\". This note scans EVERY integer H in 1..640 wherever that is affordable\n (z ≤ 31, which contains T4's 451-value scan and the windows nP = 60..588), and\n falls back to a 26-value grid to 2048 at z = 37, where the dense scan prices\n at ~12 h. A grid that finds no failure has not proven S-sharp holds at every\n H; the z = 37 row is therefore weaker evidence than the others and says so.\n The z = 13..29 rows are carried precisely so the scan can be judged against\n T4's recorded failures at 1, 35, 227, 197.\n\n## 1. PRE-REGISTRATION (written before Λ(31) and Λ(37) existed)\n\n**State of knowledge at the moment this section was written.** Λ(z) =\nΣ_{e,a}|Θ_e(a)|/(2 sin(πa/e)) is exact in the corpus at five levels only:\n9.801, 25.157, 60.031, 121.250, 261.555 at z = 13, 17, 19, 23, 29\n(`attack-f4weak-01.md` §2/S3), OLS slope d lnΛ/d lnz = 4.214 ± 0.304 against\nβ₂ = 4.26645, β₂ inside the bar. Λ(31) and Λ(37) have never been computed; the\nonly figures for them in the corpus are the FLAGGED constant-share model\nΛ-hat = 4.369e+2 and 1.101e+3, which `attack-f4weak-01.md` states leans LOW.\nThis session has NOT computed Λ at 31 or 37 at the time of writing.\n\n**Disclosed, so the blindness claim is exact:** scratchpad pricing probes for\nthis note walked PARTIAL periods and so already produced lower bounds on\nsup|ρ̃| — ≥ 24.7168 at z = 31 (5% of the period) and ≥ 43.4377 at z = 37 (1%).\nThe sup pre-registration below is therefore only partly blind and is written\nknowing those two floors. The Λ pre-registration is fully blind.\n\n**Outcome A — β₂ stays inside the seven-point bar.** Reading: the measured\ngrowth of the ℓ¹ mean value over modes remains statistically indistinguishable\nfrom the sifting-limit exponent on the available window. What follows: nothing\nabout MV(α)'s truth. What does NOT follow: any claim that MV(α < β₂) is\nplausible, likely, or supported. Rung: MEASURED, seven points, one octave.\n\n**Outcome B — the bar excludes β₂ from ABOVE (slope + 1se < β₂).** Reading: a\nmeasured tension in MV(α)'s FAVOUR — the weakest sufficient form's own growth\nsits below the proven sieve limit on this window. What follows: the object\nworth an analytic attempt is named and its target exponent is quantified. What\ndoes NOT follow: any exponent for G₂(z#). A slope is not a bound; MV(α)\nrequires a uniform constant C and a proof for all z, and a fitted slope over\nz ≤ 37 supplies neither. Rung: MEASURED tension, never evidence for a theorem.\n\n**Outcome C — the bar excludes β₂ from BELOW (slope − 1se > β₂).** Reading: a\nmeasured tension AGAINST the weakest sufficient form. What follows: MV(α) joins\nthe instruments this corpus has already watched die by exceeding β₂ in growth\n(√N·rms at 8.174 ± 0.249, Λ_V at 5.230 ± 0.186, CH at 5.214 ± 0.151). What does\nNOT follow: refutation. MV(α) is an asymptotic statement; a finite-z slope that\nexceeds β₂ over one octave does not contradict it, exactly as the Bonferroni\nx ≤ 227 and the trivial-ℓ¹-suffices-to-z~64 phenomena in this corpus do not.\nRung: MEASURED tension, never a refutation.\n\n**In every outcome the standing rider holds:** local slopes in this corpus rise\nwith the window at every instrument measured so far, so a seven-point slope is\nan upper-biased estimate of nothing in particular and quoting a single power is\nrefused (`attack-f4weak-01.md` §5's own instruction).\n\n**Pre-registered on the Gaussian ρ law** (F4 at λ = 0, C = 1: sup|ρ̃| ≤\n√⟨ρ̃²⟩·√(2 lnW)). Measured TRUE at all five exact levels with C_true =\n0.6362, 0.6044, 0.8022, 0.7554, 0.7830. If C_true < 1 at 31 and 37, the law\nsurvives two more levels and the C_true column becomes seven points; that is\nMEASURED and is not evidence the law holds for all z. If C_true > 1 at either,\nthe legal law is FALSE as literally stated at a computable level, which would\nbe the first such reading and would demote F4 from \"measured true everywhere\ncheckable\" to \"false at z = 31 (or 37)\" — a real correction to\n`rho-maximal-law.md` reading 3 and to `rho2-analytic-bound.md` §4's F4 row.\n\n**Pre-registered on the sharp form** (S-sharp: sup_x|R_H(x)| ≤\n√(2 lnW)·√(⟨R²⟩_H), TPC-implying, violated by 0.6% at z = 19, H = 191). If\nS-sharp fails somewhere on the H grid at z = 31 or 37, the \"already false as\nliterally stated\" reading extends past z = 23. If it holds on the whole grid at\nboth, that is a NULL on a coarse grid and says nothing beyond the grid, since\nT4 already records that z = 29 has no failure at any of 451 scanned H.\n\n## 2. THE PRICE, WRITTEN BEFORE THE RUN\n\nPriced from measured neighbours, not from guesses, per the standing compute\nrule. Every figure below is a scratchpad measurement on this machine\n(10 cores, 8 performance) taken before the producer was written:\n\n| piece | measured basis | price |\n|---|---|---|\n| exact Λ, z = 29 | re-ran `attack-f4weak-01.js`'s `l1exact` verbatim: 261.555 in **4.9 s** | — |\n| exact Λ, z = 31 | inner work Σ_e φ(e)·\\|m1\\|/2 = 4.31e8 vs 1.15e8 at z = 29, ×3.75 | **~18 s** |\n| exact Λ, z = 37 | inner work 3.55e9, ×31 over z = 29 | **~155 s** |\n| full-period walk, z = 29, 26-value H grid | measured, 8 workers | **6 s** |\n| full-period walk, z = 29, dense H = 1..640 | measured | **57 s** |\n| full-period walk, z = 31, dense H = 1..640 | measured on 2% of the period, ×50 | **~1750 s (29 min)** |\n| full-period walk, z = 37, 26-value H grid | measured on 1% of the period, ×100 | **~4600 s (77 min)** |\n| closed-form ⟨ρ̃²⟩ and ⟨R²⟩_H | measured: 9.0 s at 29, 28.4 s at 31, O(n²) → ~130 s at 37 | **~180 s** |\n| **total** | | **~113 min, under the 4 h ceiling** |\n\n**What the engine could NOT reach, and what would be needed.** The single-thread\nwalker of `attack-f4weak-01.js` prices z = 37 at 899 × 17.2 s ≈ 4.3 h before any\nH tracking, i.e. OVER the ceiling; that is why `rho-maximal-law.md` §7 lists\nonly z = 31 as the next exact point. What buys z = 37 is not a new\nnormalisation but the same walk cut into re-seeded chunks: ρ̃(a) is computable\nexactly at any a in O(n) from the terms, so the period splits into independent\nblocks with no accumulated drift across them, and the block width was dropped\nfrom 2²² to 2²⁰ so the stamping array is L2-resident (measured 2.2× on its own,\nbefore any parallelism). Together: 4.3 h → 75 min. **z = 47 remains out of\nreach by the same accounting: W = 1.31e16 is 65,232 times z = 37's period, so\nthe exact sup there is ~10⁵ core-hours on this engine and no reorganisation of\nit changes that; it needs a different object, not a faster walk.**\n\n## 3. DEFINITIONS (unchanged from the existing exact levels)\n\ns = 3.0, D = z^s, terms from `sift-limit-lemmaV.js`'s `buildTerms(z, D)` —\nidentical call, identical lattice, identical weights. ρ(y) = Σ_j w_j ψ((y−c_j)/q_j),\nψ(t) = t − ⌊t⌋ − 1/2, period W = P(z) = ∏_{p exact max drift\n 31 6,469,693,230 28.122062 476.314 24.738489 9.9e-8\n 37 200,560,490,130 52.219092 1286.338 85.677253 2.5e-7\n```\n\n⟨ρ̃²⟩ at both levels reproduces the cited column digit for digit (24.738487 in\n`attack-rhoms-01.md` S1; 9.25620² = 85.6772 from `theta-ladder.md` §2), by two\nindependent routes here — Parseval over the modes and the O(n²) closed form —\nso the two genuinely new numbers, sup|ρ̃| and Λ, sit on a lattice whose second\nmoment is confirmed three ways.\n\n### 4.2 MV(α): the slope, and what it does to β₂\n\n```\n window slope 1se 1se bar beta_2 2se bar\n 5 pts, 13..29 (standing) 4.2144 0.3039 [3.9105, 4.5183] INSIDE [3.6066, 4.8223] INSIDE\n 6 pts, 13..31 4.3651 0.2411 [4.1239, 4.6062] INSIDE [3.8828, 4.8473] INSIDE\n 7 pts, 13..37 (this file) 4.5656 0.2173 [4.3482, 4.7829] OUTSIDE [4.1309, 5.0002] INSIDE\n```\n\n**This is pre-registered Outcome C, and it is weak.** β₂ = 4.26645 leaves the\none-standard-error bar from BELOW, by **1.38 standard errors** — it stays\ncomfortably inside the two-se bar. Two further reasons to hold it lightly, both\nin the producer's own output:\n\n- **The exclusion is not robust to dropping one level.** Leave-one-out slopes on\n the seven points read 4.701, 4.476, 4.613, 4.566, 4.672, 4.561, **4.365**;\n the last is the fit with z = 37 removed, and 4.365 puts β₂ back inside.\n One level carries the sign of the verdict.\n- **The local slopes are not a power law and never have been.** 3.51, 7.82,\n 3.68, 3.32, **8.99**, **5.62** across the six consecutive gaps. The 29 → 31\n local slope of 8.99 is the largest in the corpus for this object; ln(31/29) is\n a 0.067 lever, so a single level's jump reads as an enormous local exponent.\n `attack-f4weak-01.md` §5's instruction to quote no single power stands.\n\n**One prior prediction scored.** `attack-f4weak-01.md` S3's flagged\nconstant-share model Λ-hat put z = 31 at 4.369e+2 and z = 37 at 1.101e+3, with\nits own rider that the falling a ≤ 3 share makes it lean LOW. Measured: 476.314\nand 1286.338, so the truth came in **9.0% and 16.8% above the model** and its\nrider was right in direction and roughly right in size. That is a scored forecast, not a\ncontrol, and it is recorded because the model is still cited at z = 41..47 where\nnothing has been measured: it should be read as a lower bound drifting further\nlow with z, and the 5.649 ± 0.227 slope that model carries at 31..47 is\ncorrespondingly biased.\n\nPer §1's Outcome C: this is a MEASURED tension against the weakest sufficient\nform, on a one-octave window, and it is **not a refutation**. MV(α) is an\nasymptotic statement; a finite-z slope above β₂ over z ≤ 37 contradicts nothing,\nand this corpus has watched the trivial ℓ¹ law \"suffice\" to z ~ 64 and the\nBonferroni bound \"hold\" to x ≤ 227 for exactly this reason.\n\n**What DID change, and it is the substantive reading.** Before tonight MV(α) was\n\"the only form here whose truth the measurements do not already decide against\"\n(`attack-f4weak-01.md` §2). It no longer holds that position: it now sits with\n√N·rms (8.174 ± 0.249), Λ_V (5.230 ± 0.186) and CH (5.214 ± 0.151) as an\ninstrument measured ABOVE β₂ in growth, differing from them only in how far\nabove and in how weak the exclusion is.\n\n### 4.3 Why MV moved: the ℓ¹ instrument's loss, not the truth\n\nThe truth and the instrument are now both measured at seven levels, and they\nseparate:\n\n```\n d ln sup|rho~| / d ln z = 2.497 +/- 0.346 (5 pts) -> 2.766 +/- 0.212 (7 pts)\n d ln Lambda / d ln z = 4.214 +/- 0.304 (5 pts) -> 4.566 +/- 0.217 (7 pts)\n Lambda / sup|rho~| = 3.74, 5.80, 6.56, 10.02, 14.61, 16.94, 24.63 at z = 13..37\n```\n\nThe last row is arithmetic on the two measured columns. Its endpoint ratio is\nz^1.802 across z = 13 → 37 (two-endpoint, NOT a fit), and 2.766 + 1.802 = 4.568\nrecovers the Λ slope to three digits. **So the ℓ¹ mean value exceeds β₂ because\nof its own accumulating loss against the truth, not because the object it bounds\nis growing fast.** The object RML(α) actually has to bound grows at **2.766 ±\n0.212**, which is **1.50 exponents below β₂** and leaves the pricing lemma\nenormous room. Rung: MEASURED, seven levels, one octave; the same short-window\nrider applies to the 2.766 as to the 4.566, and the two riders do not cancel.\n\n### 4.4 The Gaussian ρ law at the new levels: still true\n\n```\n z sup|rho~| sqrt sqrt(2 lnW) C_true alpha_true theta_true theta_G\n 31 28.122062 4.97378 6.7217 0.8412 0.9716 2.2071 2.25232\n 37 52.219092 9.25620 7.2144 0.7820 1.0954 2.2797 2.34513\n```\n\n**F4 at λ = 0, C = 1 holds at both new levels**, with 16% and 22% of margin.\nThe C_true column is now seven points: 0.6362, 0.6044, 0.8022, 0.7554, 0.7830,\n**0.8412, 0.7820**. z = 31 is the highest value the column has ever taken and\nz = 37 falls back below z = 29, so the column is NOT monotone and the fitted\ndrift (0.255 ± 0.099 per ln z, crossing C_true = 1 at z ~ 75) is a straight line\nthrough a non-monotone seven-point column. **That crossing is a fit artefact\nquoted for scale, not a prediction that the law breaks near z = 75**, and no\nweight should be put on it; the corpus has no mechanism that says C_true must\ndrift at all.\n\nθ_true, the exponent the truth actually delivers under the strict T ≥ 1\naccounting, is 2.2071 and 2.2797 — BELOW the Gaussian law's θ_G at the same\nlevels (2.25232, 2.34513), by 0.045 and 0.065 of exponent, which is exactly\nC_true < 1 restated. And sup|ρ̃| ≤ smax holds at both levels with room:\n28.12 ≤ 3.372e+4 and 52.22 ≤ 6.881e+4.\n\n### 4.5 S-sharp: dead at both new levels, and a candidate correction at z = 29\n\n```\n z scan #H failing worst ratio (at H) LAST H failing T4 sec.4 records\n 13 dense 1..640 1/640 1.1147 (H=1) 1 1\n 17 dense 1..640 35/640 2.4812 (H=3) 35 35\n 19 dense 1..640 153/640 3.3245 (H=3) 227 227\n 23 dense 1..640 90/640 3.0812 (H=3) 197 197\n 29 dense 1..640 201/640 2.9648 (H=3) 221 none\n 31 dense 1..640 528/640 7.0169 (H=1) 629 —\n 37 grid to 2048 26/26 15.8889 (H=1) 2048 —\n```\n\n**At z = 31 and z = 37 the TPC-implying sharp form is not \"transiently violated\"\n— it is broken across the whole scan.** At z = 31, 528 of 640 integer H fail and\nthe worst ratio is 7.02; at z = 37 every one of the 26 grid values fails,\nincluding H = 2048, with a worst ratio of 15.89. Reading: S-sharp as literally\nstated is FALSE at these levels, which is what `phase1-T4-maximal-law.md` §5\nalready concluded structurally (a form that would imply TPC cannot be a\ngenerous hypothesis) and what its z = 19 row showed at 0.6%. Rung: MEASURED,\nexact sup over complete periods. What does NOT follow: nothing about the LEGAL\nρ law, which forfeits exactly the lag cancellation S-sharp keeps; §4.4 above is\nthe relevant column and it holds.\n\n**Two caveats on the two new rows, both structural.** At z = 31 the last failing\nH, 629, sits 11 short of the top of the dense range, so \"last H failing\" there\nis a lower bound on the truth, not the truth. At z = 37 the scan is a 26-value\ngrid and finding all 26 failing is not the same statement as a dense scan; the\nnumber to quote is \"every grid value to 2048 fails\", not \"every H fails\".\n\n**The candidate correction.** The dense scan reproduces T4 §4's last-failure H\nEXACTLY at z = 13, 17, 19 and 23 (1, 35, 227, 197 — four for four, an engine\ncalibration against a known failure, not a null). At z = 29 it finds 201 failing\nH with the largest at 221, where T4 records **none**. Given four-for-four\nagreement below it, the most likely reading is that T4's z = 29 row is wrong or\nthat its scan range at z = 29 did not include H ≈ 221. It cannot be diagnosed\nfrom here: `phase1-T4-maximal-law.md` §0 lists its producers (`t4-sup.js` et al.)\nas **uncommitted scratch scripts**, so there is nothing to re-run. Rung: a\nMEASURED disagreement with a cited number that has no reproducible producer.\nThis note does not edit that file; the discrepancy is recorded here for\nadjudication.\n\n### 4.6 The second moment against the proven bound: nothing moves\n\nThe bound/exact ratio table now carries own exact values at 31 and 37 in place\nof cited ones:\n\n```\n z FORM I* I*/exact R1f/smax (cited) (3W)^{1/3}/smax (cited)\n 29 13.595974 2.3728e+15 1.745e+14 0.076 0.076 0.032 0.032\n 31 24.738489 4.0882e+15 1.653e+14 0.232 0.232 0.080 0.080\n 37 85.677253 1.7123e+16 1.999e+14 0.541 0.541 0.123 0.123\n 47 360.901967 1.1597e+17 3.213e+14 15.343 15.346 2.155 2.155\n```\n\nEvery cited figure reproduces, including the corrected absolute-floor row from\n`redteam-0828-closures.js` R5 (clears at 41 and 43, misses at 47 by 2.155×) and\nthe I*/exact endpoint control at z = 13 (2.535e+12, MATCH). The non-monotonicity\n`rho2-analytic-bound.md` §0 flags is confirmed on own numbers: 1.745e+14 at\nz = 29 EXCEEDS 1.653e+14 at z = 31. **Nothing here moves any exponent**, and the\nstanding verdict is unchanged: the mean-square lemma is an ingredient of RML,\nnever a route, because Chebyshev off any second moment cannot reach a sup law.\n\n## 5. READINGS\n\n1. **MEASURED, new.** Exact Λ at the two levels TODO 0 named:\n **Λ(31) = 476.314, Λ(37) = 1286.338**, each Parseval-controlled against the\n PROVEN closed-form ⟨ρ̃²⟩ (rel 1.8e-11 and 6.0e-10) and produced by\n `attack-f4weak-01.js`'s recursion unaltered, which reproduces all five cited\n values at the levels where they exist. Producer S1.\n\n2. **MEASURED, new.** Exact sup|ρ̃| over complete periods:\n **28.122062 at z = 31** (W = 6.47e9) and **52.219092 at z = 37**\n (W = 2.01e11), the first supremum measured past z = 29 in this corpus.\n Period mean 0 to 1.2e-7, walked m2 against the closed form to 3.8e-12, worst\n chunk drift 2.5e-7. Producer S2.\n\n3. **MEASURED tension, pre-registered Outcome C, WEAK.** MV(α)'s slope moves\n 4.2144 ± 0.3039 → **4.5656 ± 0.2173**, and β₂ = 4.26645 leaves the 1se bar\n from below by **1.38 se**. It stays inside the 2se bar, and dropping z = 37\n alone returns 4.365, which puts it back inside at 1se. What this is: the\n weakest sufficient form is no longer the only instrument the measurements do\n not decide against. What this is NOT: a refutation of MV(α), which is\n asymptotic and untouched by any finite-z slope. §4.2.\n\n4. **MEASURED, and the more useful half of reading 3.** The truth's own growth\n is **d ln sup|ρ̃| / d ln z = 2.766 ± 0.212** on seven points, **1.50\n exponents below β₂**. The ℓ¹ instrument's slope is the truth's plus its own\n measured loss: Λ/sup runs 3.74 → 24.63 across z = 13..37, an endpoint z^1.802,\n and 2.766 + 1.802 = 4.568 recovers the Λ slope. MV exceeds β₂ because the ℓ¹\n accounting bleeds 1.8 exponents, not because the object is large. §4.3.\n\n5. **MEASURED.** The Gaussian ρ law (F4, λ = 0, C = 1) **holds at both new\n levels**: C_true = 0.8412 (z = 31) and 0.7820 (z = 37), margins 16% and 22%.\n Seven-point column, non-monotone; the fitted crossing at z ~ 75 is an\n artefact of fitting a line to a non-monotone column and is quoted for scale\n only. §4.4.\n\n6. **MEASURED.** S-sharp, the TPC-implying form, is **broken across the whole\n scan at both new levels**: 528 of 640 integer H fail at z = 31 (worst ratio\n 7.02) and all 26 grid values to 2048 fail at z = 37 (worst 15.89). The\n asymmetry `rho-maximal-law.md` reading 3 records — the legal law true, the\n TPC-implying law false — widens rather than closes at the new levels. §4.5.\n\n7. **MEASURED disagreement with an uncustodied cited number.** The dense scan\n reproduces T4 §4's last-failure H exactly at z = 13, 17, 19, 23 and finds\n 201 failing H at z = 29 with the largest at 221, where T4 records \"none\".\n T4's producers are uncommitted scratch scripts, so this cannot be diagnosed\n from the repository. Recorded, not applied. §4.5.\n\n8. **MEASURED, confirmatory only.** ⟨ρ̃²⟩ at 31 and 37 reproduces the cited\n column digit for digit by two independent routes; the FORM I*/exact ratio\n table, the R1f floor and the corrected absolute floor all reproduce, and the\n ratio's recorded non-monotonicity (1.745e+14 at 29 > 1.653e+14 at 31) is\n confirmed on own numbers. Nothing about any exponent moved. §4.6.\n\n9. **ENGINE, auditable.** z = 37's exact supremum was reached inside the compute\n ceiling by chunking the same walk with exact O(n) re-seeding and an\n L2-resident Int32 stamping block, not by changing any definition; the old\n single-thread walker and the new one agree at z = 19 and z = 29 to inside the\n old one's own drift. z = 47 stays out of reach by a factor 3.1e6 in W and no\n reorganisation of this engine reaches it. §2.\n\n## 6. NOT REACHED\n\n- **sup|ρ̃| at z = 41, 43, 47.** W = 7.42e12, 3.04e14, 1.31e16 against 2.01e11\n at z = 37, and the walk is linear in W: **z = 41 prices at ~48 h** on this box\n (37 × the 77-minute z = 37 walk, over the 4 h ceiling but not absurd),\n z = 43 at ~81 days, z = 47 at ~9 years. These need a different object, not a\n faster walk.\n- **A dense H scan at z = 37**, priced at ~12 h; the 26-value grid stands in for\n it and the row is labelled accordingly.\n- **The last failing H at z = 31 beyond 640.** 528 of 640 fail and the largest\n failure is at 629, so the recorded value is a lower bound.\n- **Any adjudication of the z = 29 S-sharp disagreement**, which needs a decision\n about a cited number whose producer was never committed.\n- **The s-freedom.** Everything here is s = 3.0, as at every existing exact level.\n\n## 7. CUSTODY AND GATE\n\nEvery measured figure in this note is in `research/rho-exact-z31-01.js`'s OUTPUT\nblock, written by `node research/qc/embed.js --timeout 14000` — the tool ran the\nscript and wrote the block, so nothing was transcribed by hand\n(code-sha256 `433689f5…`, out-sha256 `b0519fcd…`, 108 body lines, elapsed\n6928.4 s, embedded 2026-08-28). A `qc/embed.js --check` re-run costs another\n115 minutes and was not bought; the block is bound by construction because the\ntool produced it in the same invocation that ran the code.\n\n**Derived arithmetic in this note, done on the embedded columns and not by the\nscript:** the Λ/sup|ρ̃| row (3.74, 5.80, 6.56, 10.02, 14.61, 16.94, 24.63), its\ntwo-endpoint exponent 1.8020, and the 1.377 standard errors by which β₂ sits\nbelow the seven-point slope. Nothing else in §§4–5 is computed outside the\nproducer.\n\n**Cited, custody-bound, reproduced in-pass rather than trusted:** Λ at\nz = 13..29 (`attack-f4weak-01.md` S3), sup|ρ̃| at z = 13..29 (`rho-maxlaw-01`\nS1), θ_G at all ten levels (`theta-ladder.md` §2 via `rho-maxlaw-01` S3, worst\n|recomputed − cited| = 4.2e-5), C_true at z = 13..29, rmsr at 41..47, the\nFORM I*/exact endpoint (`rho2-analytic-bound.md` S1), both Chebyshev floor rows\nincluding `redteam-0828-closures.js` R5's correction, and T4 §4's last-failure H\ncolumn. β₂ = 4.26645 per `paper/beta2-note.md`.\n\n**Gate: `node research/qc.js` was NOT run** (out of scope for this pass by\ninstruction). No existing file was edited by this session: the producer and this\nnote are both new, and the two things this note argues bear on other files —\nT4 §4's z = 29 row and MV(α)'s standing in `attack-f4weak-01.md` and TODO 0 —\nare recorded here for adjudication and applied nowhere.\n"},"research/history/staging/rho-maximal-law.md":{"lf_sha256":"4d279bd7860f8f08c113f2bf0cee74c5d9acbedfa49d04eb087e0e6f0404a515","content":"# The rho maximal law: the statement, the sufficiency curve, the literature position\n\n\n\n**TODO item 0's named first move, executed: the law is stated, its weakest\nsufficient form is priced against the (31, 47] crossing, and the position\nagainst print is settled. Producer: `research/rho-maxlaw-01-sufficiency.js`\n(all controls pass; output embedded). Four things came out.**\n\n**One: the statement, and a ladder of five forms from tautology to Gaussian\n(§1).** The clean absolute form is RML(α): `sup_y |ρ̃_z(y)| ≤ C·z^α` uniformly\nin z, for the H-free sawtooth potential of the Brüdern–Fouvry certificate at\ns = 3.0. The pricing lemma (§2) turns any RML(α) with α < β₂ = 4.26645 into\n`G₂(z#) ≪ z^α ln²z` — an unconditional two-class exponent below 4.2665, the\nfirst movement of β₂ since 2008. Every step of the lemma is a proven identity\nor standard linear-sieve asymptotics except the law itself; the T ≥ 1\naccounting demanded by the fixed-point rider is built in and costs 1/M =\nO(ln²z), i.e. at most 0.045 of exponent at z = 13 falling to 0.0008 at z = 47.\n\n**Two: the sufficiency curve (§3).** In Gaussian units the allowed looseness is\n`λ_max(z) = β₂ − θ_G(z)`, measured 2.31949 at z = 13 falling to **1.78446 at\nz = 47, the weakest measured point**: a maximal law weaker than the Gaussian\nform by a factor z^1.78 — about 963 at z = 47 — still beats β₂. The curve\nfalls at the crude column's drift rate (0.3909 ± 0.0363 per ln z over ten\npoints); whether it ever reaches zero is model-dependent and undecided — the\nlinear-drift model closes the room at z ~ 5·10³, the power-law model leaves\n1.53 ∓ 0.14 of exponent forever, and ten points over one octave cannot\nseparate them (§6, neither called). The (31, 47] crossing raises the FLOOR\npast the zone budget (th(nP) ≥ 2.0106 at z = 47) and kills only the\nTPC-grade deliverable: against β₂ it consumes 0.5% of the room, leaving a\nband 2.256 exponents wide for a provable law to land in.\n\n**Three, a new measurement: the Gaussian ρ law is TRUE at every level it can\nbe checked, with 20–40% of margin.** `C_true = sup|ρ̃|/(√⟨ρ²⟩·√(2 lnW))` =\n0.6362, 0.6044, 0.8022, 0.7554, 0.7830 at z = 13..29, exact over complete\nperiods — the first direct measurement of sup|ρ| in the corpus (everything\nprior measured sup|R_H|). Unlike the sharp R_H law, which is TPC-implying and\nalready violated by 0.6% at z = 19, the ρ law is legal, looser, and so far\ntrue.\n\n**Four, the literature verdict: the sufficiency curve's weakest point is ABOVE\npublished strength — no headline, the theorem is genuinely open.** The\nstrongest published instrument for this remainder (Bettin–Chandee 2015,\ntrilinear Kloosterman fractions, priced 2026-08-19 at our configuration)\ndelivers exponent 5.0907, i.e. 0.824 of exponent ABOVE the 4.26645 ceiling\n(θ_total 1.0303 in print against 1.2090 needed). Nothing in print bounds the\ntwo-class object at any exponent (ABSENT, owning convention, re-verified\n2026-08-18). One held reframing finding: at the sufficiency ceiling the\nworking point is s/u = 0.703, INSIDE Lemma V's stated range — the β₂ target,\nunlike the TPC target, is Lemma-V territory (§5, HELD).\n\n---\n\n## 0. CUSTODY\n\nEverything measured tonight is in `research/rho-maxlaw-01-sufficiency.js`\n(embedded tail, `qc/embed.js --check`: code-sha256 matches, out-sha256\nmatches). Division of labour, per the standing compute rule:\n\n- **Recomputed** (cheap): the conditional Gaussian-ρ column at z = 13..31 from\n the repo's own `row(z, ·, 3.0)` — all six rows MATCH the embedded tables\n digit for digit at printed precision (`theta-ladder.md` §2 at z = 19..31;\n `phase1-T4-maximal-law.md` §2 at z = 13, 17). The column is H-free and is\n NOT touched by the u = 3.2 defect, which lives only in §5b's old\n `need_true`; nothing from the refuted §5b column is used anywhere here.\n- **Cited** (expensive, custody-bound): the z = 37..47 conditional rows from\n `theta-ladder.md` §2 (independently reproduced by T4's custody block;\n re-running them is ~2800 s at z = 47). Their cheap fields (n, M, lnW) were\n recomputed from `buildTerms` and MATCH exactly.\n- **Cited**: the corrected self-consistent windows `nP(z)` from\n `history/staging/theta-selfconsistent.md` (exact 60, 126, 198, 258, 390,\n 588 at z = 13..31; prefix lower bound 2301 at z = 47), post-rewrite\n instrument only.\n- **New measurement**: sup|ρ̃| exact over complete periods at z = 13..29.\n Walker controls in-pass: brute force at z = 13 (identical to 1e-8), period\n mean = −M/2 at every z, walked variance against the PROVEN closed-form\n ⟨ρ²⟩ to 1.2e-8 %, period-closure drift ≤ 4.3e-7.\n- **Estimator control**: the OLS fitter returns slope 2.500000 on a known\n z^2.5 truth at the same ten z before any fit is quoted, and the nine-point\n θ_G drift refit reproduces T4 §2b's 0.3746 ± 0.0404 as 0.3747 ± 0.0405.\n\nβ₂ = 4.26645 per `paper/beta2-note.md` / `SEARCH-CONVENTIONS.md` §4 (four-\ndecimal rounding of Diamond–Halberstam's twenty-decimal value; unattributed\nper the citation discipline there). Units: windows in positions (integers);\nevery comparison of strengths is stated in exponents base z, dimensionless.\n\n---\n\n## 1. THE STATEMENT\n\n**The object.** Fix the family parameter s = 3.0 (any s > 1+√e = 2.6487 gives\na positive main term; 3.0 is the measured family). For a prime z let\nW = P(z) = ∏_{p 0 the position-free main density. The\n**potential** is\n\n ρ_z(y) = Σ_j w_j · ψ((y − c_j)/q_j), ψ(t) = t − ⌊t⌋ − 1/2,\n\nperiodic mod W with exact period mean −M/2 (each ψ term averages −1/(2q));\nwrite ρ̃ = ρ + M/2 for the centered potential, and ⟨ρ²⟩ for its period\nvariance, which has a PROVEN closed form (`sift-limit-lemmaV.js` S2). The\ncertificate identity, also proven, is T(x) = H·M + R_H(x) with\nR_H(x) = ρ(x) − ρ(x+H).\n\n**The law — five forms, weakest sufficient upward** (each implies the win of\n§2 when its parameter clears the stated threshold):\n\n- **F0 (tautological floor, not a law):** nP(z) ≤ z^{β₂−ε}. This is the win\n restated; pricing stops being informative here. Listed so the ladder has\n its bottom.\n- **F1 (one-sided, single-window):** ∃ε > 0, z₀: for every z ≥ z₀ there is an\n H ≤ z^{β₂−ε} with min_x R_H(x) ≥ 1 − H·M. Only the lower deviation of R_H\n matters; upper deviations are harmless. This is the literal weakest\n law-shaped form.\n- **F2 (sup-norm Lemma V at the ceiling):** at s = 3.0, for H ≍ z^{β₂−ε}:\n sup_x |R_H(x)| ≤ H·M − 1. Note s/u = 3/4.26645 = 0.703, INSIDE Lemma V's\n stated range s ≥ (0.63+δ)u (see §5; every delivered exponent in (3, β₂)\n keeps the working point inside that range, and only exponents ≤ 3 leave\n it). Lemma V's own conclusion ≪ H/log³H is strictly stronger than needed.\n- **F3 (the ρ maximal law, absolute form — THE NAMED TARGET):** **RML(α):\n ∃C, z₀ such that for every prime z ≥ z₀, sup_{y∈ℤ/W} |ρ̃_z(y)| ≤ C·z^α.**\n Sufficient whenever α < β₂ = 4.26645. Via |R_H| ≤ 2 sup|ρ̃| this implies F2\n and F1 at every window and needs no per-H information.\n- **F4 (Gaussian-units form):** RML_G(λ, C): sup|ρ̃_z| ≤ C·z^λ·√⟨ρ²⟩·√(2 lnW).\n λ = 0, C = 1 is the corpus's Gaussian maximal law\n (`sift-limit-lemmaV.js`:466), the form measured TRUE at z = 13..29 (§4).\n Sufficient whenever λ < λ_max(z) uniformly (the §3 curve).\n\nQuantifier discipline: the sup is over ALL W positions of the complete period\n(equivalently all y ∈ ℤ); one constant uniform in z; s fixed. **What this law\nis NOT:** the sharp maximal law for R_H at the operative (~0.5 z²) lag, which\nis TPC-implying and therefore not a legal target\n(`phase1-T4-maximal-law.md` §2); the entire difference between the two is the\nlag-H cancellation between ρ(x) and ρ(x+H), and the fact V1 (`g | H` kills a\npair's contribution) says that is where all the cancellation lives. RML prices\nthe certificate with that cancellation FORFEITED, which is exactly why it is\nlegal and why it can only reach exponents, never TPC.\n\n**The owning-convention statement (per `SEARCH-CONVENTIONS.md` §1).** For the\ntwo-class rough set {n : n(n+2) coprime to P(z)} — OEIS A144311's object, the\n\"bounded number of residue classes per prime\" convention of MO 88323 — RML is\na position-uniform sup-norm bound on the signed remainder of the linear-sieve\nupper/lower approximants composed over the divisor-pair lattice: the κ = 2\nanalogue of the error analysis that powers Iwaniec's Jacobsthal bound\n(g(q) ≪ log²q, exponent 2 at primorials, κ = 1; Iwaniec 1978, carried per\n`sift-limit-attack.md` §4.5's account of the 1971/1980 engine). The statement\nclass it would strengthen: **Jacobsthal-type upper bounds for integers\navoiding two residue classes per prime**, where the only standing exponent is\nβ₂ = 4.26645 (DHR 2008 sifting limit, composition `paper/beta2-note.md`),\nunimproved since 2008 and with NO published bound at any exponent for the\ntwo-class case. For a proof attempt, the estimate's own owning convention is\n**bilinear/trilinear forms with Kloosterman fractions** (§1 row: DFI 1997;\nBettin–Chandee 2015).\n\n---\n\n## 2. THE PRICING LEMMA, WITH THE RIDERS PAID\n\n**Lemma (schema).** Assume RML(α) with α < β₂. Set H(z) = ⌈(2C·z^α + 1)/M⌉.\nThen for every z ≥ z₀ and every position x, T(x) ≥ 1, hence every window of\nlength H contains a twin-admissible r, hence\n\n G₂(z#) ≤ H(z) ≪ z^α · ln²z ≪ z^{α+ε}.\n\nChain, graded: (i) T = HM + R_H is a PROVEN identity; (ii) |R_H(x)| =\n|ρ̃(x) − ρ̃(x+H)| ≤ 2 sup|ρ̃| — the mean cancels exactly in the difference, so\nthe centered sup is the right object; (iii) HM − 2 sup|ρ̃| ≥ 1 by the choice\nof H; (iv) the Brüdern–Fouvry pointwise inequality makes T(x) a lower bound\non the twin-admissible count in (x, x+H] [PROVEN, pilot-verified]; (v)\nM ≥ c(s)/ln²z for s = 3.0 > 1+√e [standard linear-sieve asymptotics; measured\nM·ln²z = 0.34–0.37 flat across z = 13..47, consistent]. The only unproven\ningredient is the law itself.\n\n**Rider 1 — T ≥ 0 vs T ≥ 1, paid explicitly.** The fixed point of\n`f(H) = ⌈sup|R_H|/M⌉` certifies T ≥ 0, which certifies nothing\n(`theta-selfconsistent.md` reading 8; the operative window is the last fixed\npoint plus one). The lemma therefore uses the strict form throughout: the +1\nin (2S+1)/M is the certificate-side transplant of `--strict`'s\n`g(H) = ⌈(sup|R_H|+1)/M⌉`. Its price is Δneed = 1/M = O(ln²z), measured\n17.9 → 43.2 positions across z = 13..47, i.e. d_strict = 0.04467 → 0.00079 in\nexponent: carried, and never the difference between verdicts.\n\n**Rider 2 — the floor.** Positivity is observed only from nP(z) onward, so no\ncorrect law delivers a window below nP: the deliverable exponent band at z is\n[th(nP), β₂). With the corrected instrument's values the floor is 1.5963,\n1.7070, 1.7960, 1.7710, 1.7718, 1.8569 at z = 13..31 (exact) and ≥ 2.0106 at\nz = 47 (prefix bound). **The (31, 47] crossing is the floor passing the z²\nzone budget: it removes the TPC-grade deliverable and consumes 0.5% of the\nband against β₂** — at z = 47 the band is still 2.256 exponents wide. The\ncrossing is a fact about what a PERFECT law could deliver, not about whether\na weak law exists; for this item it prices the bottom of the band, and the\ntop (β₂) is untouched.\n\n---\n\n## 3. THE SUFFICIENCY CURVE\n\nFrom the producer's S3 (exponents base z; d_strict included above):\n\n```\n z theta_G lambda_max factor z^lam alpha_max th(nP) floor\n 13 1.94696 2.31949 383.5 2.8712 1.5963\n 17 2.01948 2.24697 581.8 2.9425 1.7070\n 19 2.15885 2.10760 495.6 2.9344 1.7960\n 23 2.18269 2.08376 687.9 2.9685 1.7710\n 29 2.15889 2.10756 1208.1 3.0369 1.7718\n 31 2.25232 2.01413 1008.8 3.0361 1.8569\n 37 2.34513 1.92132 1030.4 3.0848 —\n 41 2.38567 1.88078 1079.7 3.0995 —\n 43 2.43473 1.83172 981.9 3.0954 —\n 47 2.48199 1.78446 963.4 3.1085 ≥2.0106\n```\n\nReading the columns: `theta_G` is what the Gaussian law (F4 at λ = 0) buys —\nTODO 0's \"measured at 2.43 at z = 43 and rising\", reproduced here (2.43473).\n`lambda_max = β₂ − theta_G` is the curve itself: **how much weaker than\nGaussian, in z-exponent, a provable law may be at that z and still beat β₂.**\n`alpha_max = log_z((z^{β₂}M − 1)/2)` is the finite-z absolute ceiling on\nsup|ρ̃| with constant 1 (asymptotically it tends to β₂; at measured z it reads\n~3.1 because the ln²z and the constants bite at small z). The weakest measured\npoint is z = 47: λ_max = 1.78446, a factor of 963.\n\n**Calibration of how much room that is.** The trivial ℓ¹ law\nsup|ρ̃| ≤ (n+M)/2 — no cancellation at all, pure triangle inequality —\nalready suffices at every measured z ≤ 47 (need_triv/z^{β₂} = 0.27 rising to\n0.9323 at 47) and dies at z ~ 64 on the window fit\n(d ln need_triv/d ln z = 5.1178 ± 0.2161). This is the Bonferroni x ≤ 227\nphenomenon at a new instrument: at small z the β₂ comparison flatters any\nbound, so finite-z sufficiency is a calibration and NOT a result. What it\ncalibrates: near the measured range the asymptotic ask over\nabsolute-value accounting is under one unit of exponent, while the Gaussian\ntruth (if it persists) leaves ~2.3 units of measured cancellation — the\ntheorem's whole difficulty is asymptotic, and the window between \"trivially\ntrue at finite z\" and \"provable for all z\" is where every route here has\ndied.\n\n**Between Gaussian and sufficient, the measured margin.** The new S1\nmeasurement puts the truth at C_true = 0.60–0.80 of the Gaussian form at\nz = 13..29 (full periods; the walker verified four ways). So at measured z the\ndistance from TRUTH to the sufficiency ceiling is the full λ_max plus the\n20–40% Gaussian margin; a law loose by three orders of magnitude at z = 47\nstill finishes. Nothing about that margin is asymptotic; it is stated to\nshow the target's slack is enormous where it can be seen at all.\n\n---\n\n## 4. WHAT IS NEW IN THE MEASUREMENT COLUMN\n\nsup|ρ̃| itself had never been measured (every prior supremum in the corpus is\nof R_H at some window). Exact over complete periods:\n\n```\n z W sup|rho~| sqrt sqrt(2lnW) C_true\n 13 2,310 2.62013 1.04645 3.9357 0.6362\n 17 30,030 4.33665 1.58005 4.5409 0.6044\n 19 510,510 9.15247 2.22539 5.1270 0.8022\n 23 9,699,690 12.10617 2.82533 5.6723 0.7554\n 29 223,092,870 17.90249 3.68727 6.2005 0.7830\n```\n\nThe Gaussian ρ maximal law holds at every measured level, margin 20–40%, no\ntrend a five-point column can call. Contrast: the SHARP law (same template on\nR_H at the operative window) is violated at z = 19 by 0.6% (T4 §4). The legal\nlaw is, so far, true; the TPC-implying law is, already, false as literally\nstated. That asymmetry is consistent with T4's diagnosis that the sharp form\nis \"the wall wearing a different hat\" while the ρ form genuinely forfeits the\nlag cancellation.\n\nz = 31 was not walked (W = 6.47e9, ~500 s by the theta-selfconsistent rate;\nthe machine stays light tonight). It is the next exact point.\n\n---\n\n## 5. THE LITERATURE POSITION\n\nPosition assembled from the standing registries (`SEARCH-CONVENTIONS.md`\n§§1, 3, 4; `PRIOR-ART.md`; `REFUTED.md`). **No new literature search was run\ntonight**; every row below carries its own prior verification date, and\nabsences are quoted with where the corpus looked.\n\n**The object has no published bound.** No published upper bound on the\ntwo-class Jacobsthal function exists at ANY exponent, conditional or not —\nsearched in the owning convention (A144311's wording; MO 88323's \"bounded\nnumber of residue classes per prime\"), 2026-08-18, re-verified independently\nthe same day (`SEARCH-CONVENTIONS.md` §3; `sift-limit-attack.md` §5). β₂\nitself is unimproved since DHR 2008 and everything published after is worse\nat κ = 2 (Blight 4.45, Franze 4.516, Opera de Cribro 4.83; §4 table). So any\nRML(α<β₂) proof would not strengthen a published two-class statement — it\nwould create the first one below the sifting-limit default.\n\n**The one-class lineage the law parallels.** Iwaniec's g(q) ≪ log²q — at\nprimorials, exponent 2 — is the κ = 1 instance of exactly this pipeline:\nlinear sieve plus remainder control uniform in position. At κ = 1 the trivial\nremainder accounting already suffices for exponent 2+ε (level below window);\nat κ = 2 the coupled accounting gives 5.2974 > β₂, which is WHY a genuine\ncancellation law is the ask. The MO 37679/52890 route (zeb 2011) derives\nj(x#) ≪ x^{4.032} from a sieve error exponent at dimension one — the shape of\nour pricing lemma, one dimension down; per §5's discipline its 4.032 is never\ntabled beside 4.2665.\n\n**The strongest print for the operative remainder, priced.** The remainder\nreduces exactly (BigInt-verified, 2655 pairs) to trilinear forms with\nKloosterman fractions; the published estimates read γ = 1.009638 (DFI 1997,\nworse than trivial at our level split) and γ = 0.970624 (Bettin–Chandee\n2015) against a needed 0.824975 — in θ_total currency 1.0303 delivered\nagainst 1.2090 needed, returning exponent **5.0907, i.e. 0.824 of exponent\nABOVE the sufficiency ceiling** (`sift-limit-attack.md` §4.5;\n`history/staging/attack-sqrt-cancellation.md`). The position-uniformity gap is\nstructural on top of that (their Remark 1's charge is O(1) only for\nx ≪ H^{1.21} while our x reaches exp(H^{0.2344})). Caveat, stated rather than\nhidden: that pricing was computed at the R_H/Lemma-V decoupled configuration;\nthe ρ-potential configuration was not separately priced tonight (NOT\nREACHED), and nothing suggests the sup over a full period is cheaper — it is\nthe same lattice with a longer position range.\n\n**Verdict for (c): the sufficiency curve's weakest point is ABOVE published\nstrength everywhere.** Published instruments deliver 5.09+ where the ceiling\nis 4.26645; published two-class bounds do not exist; the smooth-modulus and\nalgebraic-geometry branches are CLOSED on hypotheses (`REFUTED.md` rows,\n2026-08-20); the field's special-level constructions certify nothing on the\nsmallness side (`special-levels-recon.md`). **No headline: nothing in print\nimplies even the weakest sufficient form.** The quantified distance from the\nprint frontier to the ceiling is 0.1787 of θ_total (1.2090 − 1.0303), the\nsame frontier gap already recorded for Lemma V — the ρ reframing does not\ncheapen the estimate; what it changes is the LEGALITY (not TPC-implying) and\nthe win condition (any α < 4.26645, rather than the zone budget).\n\n**HELD, one adversarial pass wanted before this moves anywhere live:** at the\nsufficiency ceiling the working point is s/u = 3/4.26645 = 0.703, inside\nLemma V's stated range s ≥ (0.63+δ)u — and every delivered exponent in\n(3, β₂) stays inside it. TODO 0's \"moot and moving further away, s/u =\n1.62–1.72\" is a statement about TPC-grade windows and is correct there; for\nthe β₂ target the working point RE-ENTERS the range Lemma V was posed for.\nIf the pass confirms, the Lemma V sub-question is un-mooted FOR THIS ITEM\n(in its weakest F2 form, at u near β₂ only), and the κ = 1 precedent\n(Iwaniec 1980) plus the Kloosterman toolbox are pointed at the right ask for\nthe first time: a 0.18-of-θ_total improvement, not a factor-2 miracle.\n\n---\n\n## 6. READINGS\n\n1. **STATED.** The ρ maximal law in five forms (F0–F4), quantifiers explicit,\n in corpus vocabulary and the owning convention; the pricing lemma\n RML(α<β₂) ⟹ G₂(z#) ≪ z^α ln²z with only the law unproven; both riders\n (T ≥ 1 accounting; the nP floor) paid explicitly. §§1–2.\n\n2. **MEASURED.** The sufficiency curve λ_max(z) = β₂ − θ_G(z) runs 2.31949 →\n 1.78446 across z = 13..47; weakest point z = 47, allowed looseness factor\n 963 over the Gaussian form. The strict accounting costs 0.04467 → 0.00079\n in exponent and never a verdict. Producer S3.\n\n3. **MEASURED, new.** The Gaussian ρ law is true at every exactly measurable\n level: C_true = 0.6362, 0.6044, 0.8022, 0.7554, 0.7830 at z = 13..29 over\n complete periods, walker verified against brute force, closed-form\n variance (1.2e-8 %), period mean, and period closure. First direct sup|ρ|\n in the corpus. Producer S1.\n\n4. **MEASURED, finite-z calibration only.** The trivial ℓ¹ law already\n suffices at every z ≤ 47 (ratio 0.27 → 0.9323) and dies at z ~ 64 on the\n window fit (slope 5.1178 ± 0.2161, estimator calibrated in-pass). The\n Bonferroni-x≤227 phenomenon; explicitly NOT a route and NOT a headline.\n Producer S4.\n\n5. **MEASURED / CITED.** The floor: th(nP) = 1.5963..1.8569 exact at\n z = 13..31, ≥ 2.0106 at z = 47. The (31, 47] crossing kills the exponent-2\n deliverable and consumes 0.5% of the room to β₂, leaving a 2.256-wide\n band. The crossing prices the floor, not the ceiling. Producer S5.\n\n6. **MEASURED, two models, NEITHER CALLED.** Where the room closes: linear\n drift (slope 0.3909 ± 0.0363; nine-point control reproduces T4's 0.3746)\n says z ~ 5·10³ [2.4·10³, 1.2·10⁴]; the ⟨ρ²⟩ power model (slope 2.2355 ±\n 0.1418 here, 2.4625 ± 0.2184 on theta-ladder §3's window) says θ_∞ =\n 2.74 ± 0.14 and the room never closes. Ten points over one octave decide\n nothing between them. Producer S6.\n\n7. **INFERRED from the standing registries (no new search).** Nothing\n published implies any sufficient form: best print delivers exponent\n 5.0907 against the 4.26645 ceiling (gap 0.1787 of θ_total), and no\n two-class bound exists in print at any exponent. The sufficiency curve\n sits above published strength at every point — the theorem is open in the\n honest direction, with the truth (measured) two exponents below the\n ceiling. §5.\n\n8. **HELD (one adversarial pass wanted).** The β₂-target working point\n s/u = 0.703 is inside Lemma V's stated range, for every delivered\n exponent in (3, β₂): the \"Lemma V is moot\" verdict is TPC-specific and\n does not transfer to this item. §5.\n\n## 7. NOT REACHED\n\n- **sup|ρ̃| at z = 31** (W = 6.47e9, ~500 s): the next exact point of the\n C_true column, deferred under tonight's compute ceiling.\n- **The conditional row at z = 47 recomputed** rather than cited (~2800 s\n O(N²)); the cited row is custody-bound and its cheap fields verify, but a\n full local reproduction was not bought.\n- **An analytic upper bound on ⟨ρ²⟩(z)** from its own closed form (a proven\n z^c would turn the F4 curve into an unconditional F3 statement and pin\n θ_∞); not attempted, and it is the natural next lemma-shaped object.\n- **Pricing the Kloosterman import at the ρ-potential configuration**\n (position range e^{θ(z)} instead of the Lemma-V window); the recorded\n pricing is at the R_H configuration and was carried over with that caveat\n stated.\n- **The s-freedom.** Everything here is s = 3.0. The crude column is nearly\n s-insensitive (`theta-ladder.md` §5a) but the sufficiency curve's s\n dependence — in particular whether some s < 3 lowers θ_G at large z — was\n not measured.\n- **The adversarial pass on the HELD s/u finding** (reading 8).\n\n## 8. GATE\n\n`node research/qc.js` after the producer and this report were written:\n**TOTAL 0** — no check names `research/rho-maxlaw-01-sufficiency.js` or this\nfile. The producer's tail verifies: `qc/embed.js --check` reports code-sha256\nmatches, out-sha256 matches, body bit-honest. (The standing advisories —\nembed-backlog, sourcing-backlog — are pre-existing and not part of TOTAL.)\n"},"research/history/staging/shadow-prereg.md":{"lf_sha256":"ae3a10ece08ff99607dff4ab9661d3f9042f46a7d8dd360eee931cef1fd9b3c8","content":"# Pre-registration — the kill shadow as a band-averaged pair-Buchstab integral\n\n\n\n**Written 2026-08-19, TODO item 5, BEFORE any measurement was run and before any\ncomparison to a measured depth.** The candidate numbers below come from\n`research/shadow-buchstab-01-candidate.js` (embedded output, pure computation,\nno data in it). The instrument that will score them,\n`research/shadow-buchstab-02-instrument.js`, did not exist when this file was\nwritten.\n\n## What is being tested\n\n`research/anchored-windows.md` §5 records the **kill shadow**: the window just\npast a level's crystallization edge holds ≈ 0.85 of the tile's fair twin-slot\nshare, at every level it measured. `attack2-05-07-integral-ladder.js` reading\nA5-2 asserts — without computing it — that this 0.85 **is** the average of the\nUnification-Law survival curve over that window:\n\n rho(u) = e^{2gamma}/u^2 on 1 <= u <= 2 (exact under HL)\n rho(u) = (e^{gamma} omega(u))^2 on 2 <= u <= 3 (independence\n conjecture)\n\nwith `u = ln x / ln y`, `omega` Buchstab's function, and the band\n`[y^2, 2y^2]` equal to `u ∈ [2, 2 + ln2/ln y]`. The claim under test is that\nthe measured shadow depth equals the x-weighted average `B_x(y)` of `rho` over\nthat band.\n\n## The candidate values (computed, then frozen)\n\nBand anchored at the level's own square, `[y², 2y²]`, x-weighted:\n\n| y | w = ln2/ln y | **B_x(y)** | B_u (flat in u) |\n|---|---|---|---|\n| 23 | 0.221065 | **0.873491** | 0.865981 |\n| 97 | 0.151517 | **0.851659** | 0.846009 |\n| 401 | 0.115641 | **0.839217** | 0.834695 |\n| 997 | 0.100387 | **0.833670** | 0.829665 |\n| 2999 | 0.086578 | **0.828512** | 0.824994 |\n| 10007 | 0.075252 | **0.824182** | 0.821079 |\n| y → ∞ | 0 | **0.793055** | 0.793055 |\n\nBand anchored at the *next* prime's square (the configuration\n`anchored-windows.md` §5 actually used — sieve level `p`, window\n`[p'², 2p'²]`): 0.943056 (p=23), 0.862697 (97), 0.843619 (401), 0.836045 (997),\n0.828629 (2999), 0.824213 (10007).\n\nPredicted octile profile inside the band, normalised to the band mean (this\ndivides out any level-wide finite-size factor): rise from first to last octile\n= **1.0769 at y = 997** and **1.0596 at y = 10007**.\n\n## Scoring rules, fixed in advance\n\nThe scoring target is a **fresh measurement**, not the §5 table: that table's\nproducer (`scratchpad/anchored-check.js`) no longer exists, and\n`anchored-windows.md`'s own header forbids quoting §5 without recomputation. The\n§5 numbers (0.834 @ p=23, 0.850 @ 97, 0.853 @ 401, 0.856 @ 997) are used here\nfor one purpose only — to set the tolerance — and are declared read before this\nfile was written.\n\n**Tolerance.** `tol = 0.011` absolute, on the ratio-to-fair-share scale. Reason:\nhalf the spread of the four recorded depths (0.856 − 0.834 = 0.022). A candidate\nthat cannot resolve the levels better than the levels differ from each other has\nnot explained the levels; half the spread is the coarsest tolerance under which\n\"derived\" still means something.\n\n**Counting-noise floor, declared in advance.** Each band holds\n`N ≈ delta(y)·y²` slots; the Poisson-scale relative error `1/sqrt(N)` is\n≈ 17% at y = 23, ≈ 8% at y = 97, ≈ 3.5% at y = 401, ≈ 1.1% at y = 997,\n≈ 0.15% at y = 10007. **Levels with `1/sqrt(N)` above the tolerance\n(y = 23, 97, 401) cannot decide anything and are scored as INFORMATIVE ONLY.**\nThe verdict rests on y ≥ 997.\n\n**D1 (magnitude).** `|B_x(y) − measured(y)| ≤ 0.011` at every deciding level.\n\n**D2 (level trend).** The candidate is strictly decreasing in y (the band\nnarrows like `1/ln y`, so any average over it falls toward 0.793055). D2 holds\niff the measured band ratio also falls with y, by more than the noise floor.\nThis is a sign test the candidate cannot avoid: it does not depend on the value\nof any constant.\n\n**D3 (band shape).** Measured last-octile/first-octile ratio within\n`±0.020` of 1.0769 at y = 997 and of 1.0596 at y = 10007. D3 is the sharp test:\nit is insensitive to every level-wide normalisation, including whatever\nfinite-size factor separates measured `rho(2)` from 0.793055.\n\n**Verdicts.**\n- **DERIVED** — D1 and D2 and D3 all hold. The shadow is the band average and\n the object is closed.\n- **SHAPE-ONLY** — D3 holds, D1 or D2 fails. The Buchstab curve governs the\n band's interior but not the shadow's level-dependence or its level; the\n residual is then a normalisation, not a mechanism.\n- **MISS** — D3 fails. The shadow carries structure the band average does not\n know, and the residual's shape names it.\n\nNo other statistic will be promoted to a verdict after the fact.\n"},"research/history/staging/var41-prereg.md":{"lf_sha256":"f14244190e1ac88aef914d133c1b2a9288ef06c7ac09b72c1e2e269141b221a6","content":"# Pre-registration: Var(41), the tenth Var/E point and the z column's last entry\n\n\n\n**Sealed before any producer for this pass was written, and committed alone**, with\nmessage `prereg: var41` and nothing else in that commit. `git log --stat` is the\nproof. Every number in sections 1 to 4 was computed from **already embedded** corpus\nfigures by a throwaway script kept outside the repository. The producer\n`research/var41-price.js` recomputes each of them from the same published inputs\nand aborts on any mismatch, so the freeze is machine-checkable after the fact as\nwell as commit-ordered.\n\n## 0. What this pass registers\n\nTODO item 2 asks for Var(41) so that the anchored note's section 3 z column runs\nthe full ten levels, and so that TODO item 9's `lim Var/E = 0.611` question gets a\ntenth separation point. This file registers, before any Var(41) engine exists:\n\n1. the stable law's prediction for Var(41)/E(41), with u at z = 41 stated exactly;\n2. a band for that prediction, taken from the law's own residuals at z <= 37;\n3. what the new point does to item 9 under each outcome, including the honest\n statement that one more point **cannot** separate a limit from a drift, and\n what it can pin instead;\n4. the derived z(41) prediction, and the precision each of the two consumers needs.\n\n## 1. Inputs, all embedded, none recomputed\n\nThe nine diagonal points are the embedded output of\n`research/natal-cap-16-fast-variance.js` (PART 3, levels 7..31) and\n`research/natal-cap-33-overnight.js` (RUN 3, level 37), reproduced in\n`paper/variance-note.md` section 7:\n\n| x | W = x# | y = maxprime <= sqrt(W) | E[N_W] | Var | r = Var/E |\n|---|---|---|---|---|---|\n| 7 | 210 | 13 | 6.92 | 1.05 | 0.1521 |\n| 11 | 2,310 | 47 | 39.27 | 10.06 | 0.2563 |\n| 13 | 30,030 | 173 | 304.28 | 91.13 | 0.2995 |\n| 17 | 510,510 | 709 | 3,245.51 | 1,060.54 | 0.3268 |\n| 19 | 9,699,690 | 3,109 | 41,441.19 | 14,392.59 | 0.3473 |\n| 23 | 223,092,870 | 14,929 | 669,028.80 | 243,740.37 | 0.3643 |\n| 29 | 6,469,693,230 | 80,429 | 14,063,617.40 | 5,307,862.63 | 0.3774 |\n| 31 | 200,560,490,130 | 447,829 | 328,601,798.62 | 127,363,168.00| 0.3876 |\n| 37 | 7,420,738,134,810 | 2,724,079 | 9,377,228,928.76| 3,711,451,136 | 0.3958 |\n\nAt z = 41: W = 41# = 304,250,263,527,210, and y = 17,442,769, the largest prime\nbelow floor(sqrt(W)) = 17,442,771. E(41) = 303,627,067,641.7 and\nS(41) = 256,725,962,834 are the embedded output of\n`research/natal-cap-37-at41-march.js`, quoted in `paper/anchored-note.md` section 3.\n\n## 2. The stable law, evaluated the way the note evaluates it\n\n`paper/variance-note.md` section 6 states the empirical law\n\n ln(Var/E) ~= -(c2 u^2 + c1 u), c2 = 0.24, c1 = 0.13, L = y^u,\n\nfitted at sieve level y = 401. The note evaluates it in u = ln L / ln y, and the\ndiagonal of section 7 is the case L = W with y = maxprime <= sqrt(W). At z = 41\nthat gives\n\n u(41) = ln(304,250,263,527,210) / ln(17,442,769) = 33.34886 / 16.67443\n = 2.0000005,\n\nso **u = 2 to seven digits**. The same evaluation at the nine computed levels gives\nu = 2.08468, 2.01161, 2.00065, 2.00235, 2.00043, 2.00010, 2.00001, 2.00000,\n2.00000: the diagonal is the u = 2 line from z = 13 upward, and z = 7 and z = 11\nare the only levels where the integrality of y moves u at all.\n\n**Literal prediction.** At u = 2 the law gives\n\n Var(41)/E(41) = exp(-(0.24*4 + 0.13*2)) = exp(-1.22) = 0.29523.\n\n**This literal reading is registered as wrong, and registered as wrong in advance.**\n\n## 3. The band, from the law's own residuals at z <= 37\n\nThe law is frozen at y = 401; section 6 point 2 of the note already records that at\nu = 2 the ratio rises with level, so on the diagonal the law carries a level-dependent\nresidual rather than a scatter. Its residuals against the nine measured points are\n\n| x | r measured | law (0.29523) | residual | increment |\n|---|---|---|---|---|\n| 7 | 0.1521 | 0.29523 | -0.1431 | |\n| 11 | 0.2563 | 0.29523 | -0.0389 | +0.1042 |\n| 13 | 0.2995 | 0.29523 | +0.0043 | +0.0432 |\n| 17 | 0.3268 | 0.29523 | +0.0316 | +0.0273 |\n| 19 | 0.3473 | 0.29523 | +0.0521 | +0.0205 |\n| 23 | 0.3643 | 0.29523 | +0.0691 | +0.0170 |\n| 29 | 0.3774 | 0.29523 | +0.0822 | +0.0131 |\n| 31 | 0.3876 | 0.29523 | +0.0924 | +0.0102 |\n| 37 | 0.3958 | 0.29523 | +0.1006 | +0.0082 |\n\nThe residual is monotone with a smoothly shrinking increment, ratio 0.78 to 0.80 per\nlevel over the last four steps. Carrying the increment forward at 0.0066 (the 0.80\ncontinuation) and bracketing it by the last measured increment 0.0082 above and by a\ntwo-step continuation 0.0055 below:\n\n**REGISTERED PREDICTION: Var(41)/E(41) = 0.4024, band [0.4013, 0.4040].**\n\nEquivalently Var(41) = 1.2218e11 with band [1.2185e11, 1.2267e11], against\nE(41) = 303,627,067,641.7.\n\nFor reference, the two diagonal fits of variance-note section 7 evaluated at\nlnW(41) = 33.34886 and lnlnW(41) = 3.50702:\n\n| fit | fitted on | value at z = 41 |\n|---|---|---|\n| 0.4435 - 1.509/lnW | 8 points, frozen pre-@37 | 0.3983 |\n| 0.6106 - 0.729/lnlnW | 8 points, frozen pre-@37 | 0.4027 |\n| 0.4454 - 1.534/lnW | 9 points, refit | 0.3994 |\n| 0.6108 - 0.729/lnlnW | 9 points, refit | 0.4029 |\n\nThe registered band brackets both lnlnW values and excludes both lnW values. That\nis not an independent vote: the residual-extrapolation of section 3 and the lnlnW\nfit are two descriptions of the same monotone shrinkage, so they agree by\nconstruction. It is recorded here so that a measured r(41) near 0.399 falsifies the\nregistered prediction outright rather than being absorbed.\n\n## 4. What the tenth point does to TODO item 9, stated honestly\n\n### 4a. What it cannot do\n\nThe two live functional forms separate at z = 41 by **0.0035** (refit-9 pair) or\n**0.0044** (frozen-8 pair). That is a decidable gap only if the measurement is good\nto about 5e-4, and it is a *model comparison*, not a measurement of a limit.\n\nThe abscissa argument is the binding one. Over the nine computed points 1/lnlnW runs\n0.59646 down to 0.29508; z = 41 adds a single point at 0.28514. From z = 13 upward,\nwhere the fits are actually taken, the span is 0.42861 down to 0.29508, and z = 41\nextends it by 0.00994, that is by **7.4% of the existing lever arm**. Extrapolating\nthat line to the intercept means going from 0.285 to 0.000, which is thirty times\nthe range that all ten points together will cover.\n\n**Registered in advance: one more point cannot discriminate drift from limit.** No\noutcome of this computation entitles the corpus to say that lim Var/E = 0.611 is\nmeasured, and any write-up that upgrades the 0.611 hypothesis on the strength of\nz = 41 alone is overclaiming. The reading of variance-note section 7 stands: what\nsettles this is a derivation, not a level.\n\n### 4b. What it can pin\n\n1. **The z column.** The anchored note's section 3 table has \"not yet\n (Var@41 uncomputed)\" in its last row and nothing else missing: S(41) and E(41)\n are already exact. Var(41) alone completes the ten-level ladder. Registered\n prediction, from the band of section 3:\n\n sigma(41) = sqrt(Var) = 349,540, band [349,140, 349,880]\n z(41) = (256,725,962,834 - 303,627,067,641.7)/sigma(41) = -134,180,\n band [-134,310, -134,030],\n\n a factor 5.93 on z(37) = -22,632.9, which continues the measured 5.3 to 5.7\n per-level ratio and slightly extends it.\n2. **A fifth consecutive frozen-forecast test of the lnlnW form**, at a 0.0035\n separation. A hit inside 5e-4 makes it five in a row; a miss on the lnW side\n would be the first evidence against the current reading since z = 37.\n3. **The intercept's stability**, refit on ten points. The lnlnW intercept has gone\n 0.6106 -> 0.6108 across the ninth point; the tenth either keeps that stability or\n breaks it, and \"the intercept stopped drifting\" is a genuine, if weak, fact about\n the fit that the analytic hunt of item 9 can be calibrated against.\n\n### 4c. The precision split, registered because it changes the price\n\nThe two consumers do not need the same accuracy.\n\n- **z(41) needs about 1%.** z scales as Var^(-1/2), so a 1% error in Var moves z by\n 0.5%, that is by 670 units on -134,180, which is far inside the 5.93 per-level\n ratio being reported. A Var(41) good to 1% closes the z column completely.\n- **Item 9 needs about 0.1%.** Separating 0.0035 on r = 0.402 at 5:1 needs r to\n 7e-4, that is Var to 0.17%.\n\nAny pass that delivers only the first is still a full answer to TODO item 2 as\nwritten, and is not an answer to item 9.\n\n## 5. Adjudication rule, fixed now\n\nLet r = Var(41)/E(41) as measured, with its certified roundoff bar b.\n\n- **PREDICTION HELD** if |r - 0.4024| <= 0.0016 (the registered band).\n- **PREDICTION FAILED, lnW direction** if r < 0.4000. Then the 1/lnW form scores its\n first hit since z = 31, the 0.611 hypothesis is demoted back to a tie, and\n variance-note section 7 must be rewritten before it is quoted again.\n- **PREDICTION FAILED, other direction** if r > 0.4048. Then the residual increments\n stopped shrinking, which no current model predicts, and the fit family itself is\n the thing under suspicion.\n- **INDECISIVE** if b >= 0.0009, whatever r is. A certified bar that large cannot\n resolve a 0.0035 separation at better than 4:1, and the run is then reported as a\n z-column closure only, with the item 9 consumer explicitly left open.\n\nThe `b >= 0.0009` clause is registered because it is the likely outcome for the\nexisting engine: the bar of `natal-cap-16`'s `fastVariance` is\n`u*(C*2*S2 + 2*d2W2 + 2*E)` with a worst-case patch constant C, and since\n2*S2 ~= d2W2 = E^2 the bar grows in proportion to E, that is by a factor of about\n32 per level. Reproducing the published @37 bar from that formula with C = 40 gives\n8.20e5 against the published 8.2e5, so the model is calibrated; carried to z = 41\nwith C = 36 (the primorial patch bound at 41#, 11 mid-primes per factor of\nd(d-2)(d+2) since 7*11*...*43 = 2.5e14 < 41# < 7*11*...*47) it gives\n\n Var(41) = 1.22e11 +/- 7.8e8, relative 6.4e-3, that is r = 0.402 +/- 0.0026.\n\n**Registered in advance: with the engine as it stands, the tenth point is\nINDECISIVE for item 9 by rule, and closes the z column only.** A tighter bar\nrequires charging each term its actual patch count rather than the worst case; the\nmean count is 3*sum_{7<=p<=y} 1/p + 3 = 9.1 rather than 36, which would give\n+/- 2.3e8, relative 1.9e-3, r = 0.402 +/- 0.00075, and that is the only version of\nthis run that adjudicates item 9. Whether the run is launched at all is a separate\nquestion of price, settled in `research/var41-price.js` and not prejudged here.\n\n---\n\n## CORRECTION (2026-08-19, from `research/var41-price.js` PART 0)\n\nThe producer's freeze check recomputed every number above from the published\ninputs and found two arithmetic slips, both in quantities **derived from** the\nregistered prediction rather than in the prediction itself. The text above is left\nexactly as sealed; the corrections are here.\n\n1. **Section 4b, sigma(41).** Written as 349,540. The exact value at r = 0.4024\n and E(41) = 303,627,067,641.7 is **349,542**.\n2. **Section 4b, the z band.** Written as [-134,310, -134,030]. That interval was\n formed from the wrong r endpoints. The registered band r in [0.4013, 0.4040]\n implies **z(41) in [-134,363, -133,913]**, half-width 225 rather than 140. The\n central forecast z(41) = -134,180 is unchanged (exactly -134,179), as is the\n ratio 5.93 on z(37).\n3. **Section 3, the frozen-8 separation.** Written as 0.0044, which is the\n difference of the two endpoints after each is rounded to four places\n (0.4027 - 0.3983). The direct difference is 0.00448, which rounds to 0.0045.\n Both readings are recorded; the adjudication rule of section 5 uses neither.\n\n**The registered prediction is untouched:** Var(41)/E(41) = 0.4024, band\n[0.4013, 0.4040], and the adjudication rule of section 5 stands as written. The\nwidened z band makes no difference to any rule, since section 5 adjudicates on r.\n\n## OUTCOME OF THE PRICING PASS (2026-08-19)\n\n`research/var41-price.js` priced the run and it was **declined, not launched**.\nThe engine is 2.183e+14 elementary ops at SEG = 2^26, which is 239.7 h on one core\nat the throughput its own two recorded wall times establish (508 s at @31, 18288 s\nat @37, agreeing on throughput to 10%). Sharded over all ten cores that is 24.0 h,\non a machine already carrying seven heavy jobs. Section 5's INDECISIVE clause also\nfires in advance: the engine's certified bar at @41 is dr = 0.00256 against a\n0.0035 separation, so the run as it stands would have closed the z column and left\nitem 9 exactly where it is. The census in that file measured the fix (mean patch\ncount 4.958 at @29 against a worst case of 29, a 3.05x bar tightening) which would\nbring the bar to dr = 0.00075 and make the point decisive. Any future @41 run\nshould carry it.\n"},"research/history/staging/varE-asymptotic.md":{"lf_sha256":"d867cbc8f3a606cc4d60a8a159590c63e8e958fad75f6be74501d05f2492dc9e","content":"# The Var/E limit on the comb diagonal: the derivation attempted, and where it stops\n\n\n\n*Staging note, 2026-08-28. TODO item 9. Producer:\n`research/history/staging/varE-asymptotic.js` (embedded, `--check` clean).\nTarget: `paper/variance-note.md` §6 open question and §7 diagonal. The nine\nexact diagonal points are read from §7 and are not recomputed anywhere in this\npass.*\n\n## 0. Verdict, and what failed\n\n**No closed form reached.** Nothing here produces a candidate value for\n0.6106, and nothing here should be read as evidence that 0.6106 is the limit.\n\nThree things failed, in order of how much they cost:\n\n1. **The Montgomery–Soundararajan route does not transfer as named.** Its\n engine is an asymptotic for a singular-series average whose main term is the\n thing being extracted. Here the main term is not asymptotic, it is *exact*:\n §3 below shows the leading term of the correlation sum is exactly $L$, with\n the cancellation holding prime by prime, so every bit of Var/E is a\n discrepancy term and the MS main-term machinery has nothing to compute.\n PROVEN (§3, one-line identity).\n2. **The obvious replacement, a sharp cutoff of the conductor sum at $q\\approx L$,\n is refuted by the data.** It predicts $X \\asymp \\ln^3 W$; measured\n $X/\\ln^3 W$ falls by a factor 2.7 across the nine levels and is still\n falling. HEURISTIC prediction, REFUTED by measurement (reading 5).\n3. **The one $\\ln\\ln$ mechanism this pass found does not pin the constant.**\n On the diagonal every prime $p \\le x$ divides $L = x\\#$ exactly and is inert\n (§4). Those primes carry 0.539 of the Mertens mass at $x = 37$, falling like\n $(\\ln\\ln x + B)/(\\ln\\ln y + B)$, and $\\ln\\ln x \\approx \\ln\\ln\\ln W$. That is\n a genuine slowly-decaying correction of roughly the right size. Fitted as a\n drift law it gives intercept 0.7198, not 0.611. MEASURED (reading 6, §5).\n\nWhat did move, all of it calibration rather than progress on the constant:\n\n- **PROVEN.** $\\delta \\ln^2 W \\to 16 C_2 e^{-2\\gamma}/3 = 1.109905$ on the\n diagonal, so $\\lim \\mathrm{Var}/\\mathbb{E}$ exists **iff**\n $\\lim X/\\ln^2 W$ does, with the two limits differing by exactly that factor.\n Measured 1.109803 at $x = 37$, relative gap $9.2\\times10^{-5}$.\n- **PROVEN.** Two exact facts about which Fourier conductors can contribute:\n $\\sum_{\\nu \\ne 0 \\bmod q} K_L(\\nu/q) = r_q(q - r_q)/L$ with $r_q = L \\bmod q$,\n hence every conductor dividing $L$ contributes exactly zero, and the whole\n single-prime band is $1.1\\times10^{-11}$ at $x = 37$ against Var/E = 0.3958.\n- **DEFECT, in the note.** §7's \"fitted to the first eight points\" and\n \"refitting on all nine points\" do not describe the fits it publishes. The\n published numbers are the six points $x = 13..31$ and the seven points\n $x = 13..37$. On the eight points §7 names, the $1/\\ln\\ln W$ form is the\n *worse* of the two it compares. Reproduced below.\n- **CALIBRATION.** On the set §7 actually used, two further two-parameter forms\n fit at least as well as $1/\\ln\\ln W$, with intercepts 0.5366 and 0.7198; a\n three-parameter member of the $1/\\ln W$ family fits better than all of them\n with intercept 0.4642. §7's reading that \"the open question is now a problem\n about one number\" stands; its reading that the number is near 0.611 rests on\n a two-way comparison that a wider family does not respect. That second reading\n is REFUTED as an inference and not merely widened: run on a model sequence\n whose limit is 0.455456 by construction, the same protocol returns 0.6164\n in-sample and wins the frozen $x = 37$ forecast by a factor 7\n (`varE-spectral.md` §7, `redteam-0828-varE.md` §4), so neither half of §7's\n protocol estimates a limit.\n\n## 1. The object, restated and checked\n\nNotation follows `paper/variance-note.md` §7 (Corollary 3), not §2. Sieve level\n$y$; modulus $M = \\prod_{p \\le y} p$; the comb\n\n$$A_5 = \\{\\, r \\in \\mathbb{Z}_M : r \\equiv 11, 17 \\ (30),\\ r \\bmod p \\notin \\{0,-2\\},\\ 7 \\le p \\le y \\,\\},$$\n\ndensity $\\delta = \\tfrac{2}{30}\\prod_{7\\le p\\le y}(1 - 2/p)$, pair correlation\n$J_5(d) = \\frac{\\rho_{30}(d)}{30}\\prod_{7\\le p\\le y}\\frac{\\rho_p(d)}{p}$ with\n$\\rho_{30} \\in \\{2,1,0\\}$ on $d \\equiv 0, \\pm 6, \\text{else} \\pmod{30}$ and\n$\\rho_p(d) = p-2,\\, p-3,\\, p-4$ on $p \\mid d$, $d \\equiv \\pm2$, generic.\nWrite $W(d) = J_5(d)/\\delta^2$, and $L = W = x\\#$ with $y$ the largest prime\n$\\le \\sqrt{L}$, so that $u = \\ln L/\\ln y = 2$ in the limit, and $2.0847$,\n$2.0116$, then $2.000x$ from $x = 13$ up, at the computed levels\n(`redteam-0828-varE.md` §2). Everything below is evaluated at the true $L$ and\n$y$, so no number moves; from $x = 13$ up the coordinate error moves\n$\\lambda_2$ by less than 0.001.\n\nTheorem 2 of the note gives\n$\\operatorname{Var}[N_L] = \\sum_{|d|2}(1 - (p-1)^{-2}) = 0.6601618$\nthe twin prime constant, by Mertens. The comb's small primes give\n$\\delta = \\tfrac13\\prod_{2L} u(q)/q^2$, and since $\\sum_{q\\le Q}u(q) \\asymp Q\\ln^3 Q$ this gives\n$X \\asymp \\ln^3 W$. HEURISTIC. It is refuted by the exact points: measured\n$X/\\ln^3 W$ = 0.0324, 0.0270, 0.0226, 0.0195, 0.0171, 0.0151, 0.0134, 0.0120\nacross $x = 11..37$, falling by 2.7 and still falling, while\n$X/(\\ln^2 W \\cdot \\ln\\ln W)$ also falls (0.1228 to 0.1052) and $X/\\ln^2 W$\nrises. So $X$ sits strictly between $\\ln^2 W$ and $\\ln^2 W \\ln\\ln W$, and the\nsharp cutoff overshoots by a full log. Recovering $\\ln^2 W$ from $\\ln^3 W$\nrequires the signs, which the positive expansion above has thrown away. That is\nthe second place the route stops.\n\n**The signed expansion, for whoever picks this up.** The cancellation is\nrecoverable in the Ramanujan basis. With $c_p(m)$ the Ramanujan sum,\n\n$$W(d) - 1 = \\sum_{q>1} \\prod_{p\\mid q} G_p(d),\n\\qquad G_p(d) = \\frac{2c_p(d) + c_p(d+2) + c_p(d-2)}{(p-2)^2},$$\n\nverified case by case: $G_p = 2/(p-2)$ on $p \\mid d$, $(p-4)/(p-2)^2$ on\n$d \\equiv \\pm2$, $-4/(p-2)^2$ generic, which reproduce $f_p - 1$ exactly. The\ngeneric term is negative at every prime, and that is where the missing log\nlives. Carrying this through needs the joint discrepancy\n$\\Delta_e(a) = \\sum_{|d|\n\n*Staging note, 2026-08-28. TODO item 9. Producer:\n`research/varE-exact-ladder-01.js` (embedded, `code-sha256` and body verified\nstatic, 2510.3 s; the run-side `embed.js --check` needs `--timeout 2700`).\nReads `varE-spectral.md`, `varE-theta2-step.md`, `redteam-0828-varE.md` and\n`paper/variance-note.md` sections 3 and 7. It edits nothing. Every figure below\nis labelled with the producer section that printed it; figures marked DERIVED\nare arithmetic performed in this note on that block's own columns, not by the\nproducer.*\n\n---\n\n## 0. Verdict, the part that did not move first\n\n**Neither open step is closed, and nothing here attempts either.**\n`redteam-0828-varE.md` section 0 names the two: the theta = 2 decoupling\nreplacement, and the model's own limit theorem. This pass adds levels and\nsizes. It derives no inequality.\n\n**The two new levels do not sharpen the step-1 reading.** The extra data are\nconsistent with the error being `O(1/ln y)` and equally consistent with its\nbeing smaller. `varE-theta2-step.md` section 5 said four levels exclude growth\nand nothing finer; six levels exclude growth and nothing finer.\n\n**One half of the near-cancellation is drifting, which makes the net worse, not\nbetter.** `delta*(X1 - X_dec)*ln y` is settled at 0.13342, 0.13344, 0.13347 over\nx = 23, 29, 31, but `delta*(X - X1)*ln y` reads -0.12883, -0.13035, -0.13109 on\nthe same three levels and is still moving in the third decimal (SEC 1). The net\n0.00238 at x = 31 is a difference of two numbers fifty times its size, one of\nwhich has not stopped moving. Do not quote a coefficient for it.\n\n**Nothing here touches the conjecture.** `variance-note.md` section 4 already\nrecords that Var/E over a uniformly random window says nothing about the one\nanchored window the twin problem needs.\n\nWith that said, what the pass produced:\n\n- **MEASURED, exact, two new levels.** `X/X_dec` = 1.000725 at x = 29 and\n 1.000471 at x = 31; `delta*(X - X_dec)` = 0.000273 and 0.000183;\n `delta*(X - X_dec)*ln y` = 0.00309 and 0.00238. `delta*X` reproduces\n `variance-note.md` section 7's measured 0.3774 and 0.3876 (SEC 1).\n- **MEASURED, exact, nine levels, and it is the number section 4 left blank.**\n The model's `n <= L` conductor band is 0.012344728, 0.009853657, 0.008044066,\n 0.006640313, 0.005616554, 0.004855050, 0.004252203 at x = 13..37, and its\n product with `ln y` is 0.06362, 0.06468, 0.06469, 0.06382, 0.06344, 0.06317,\n 0.06301: constant to three figures over a factor 500 in y, still creeping\n down (SEC 2, SEC 4B).\n- **PROVEN, and it needed no enumeration.** `E[1/n] = delta` exactly for the\n model's conductor law, the dual of `varE-spectral` section 3's\n `E[n] = 1/delta`. That is what turns the infinite `n > L` band into a\n by-product of the finite `n <= L` descent, and it is why x = 37's model value\n is reachable at all (producer header; the identity is checked against\n `variance-note.md` section 7's `E[N_W]` column at nine levels in SEC 2).\n- **MEASURED, exact.** The `n | L` band is 0.000000000 at every level, and it\n is not a small set: it carries 7.8 % of the conductor mass at x = 31 and\n 6.4 % at x = 37 (SEC 2).\n- **MEASURED.** The model at x = 37 is 0.395667 by the exact identity route and\n 0.395728 +- 3.34e-5 by Monte Carlo at N = 1e8 on two seeds. At x = 41 it is\n 0.402368 +- 3.36e-5 (SEC 2, SEC 3).\n- **Two levels NOT computed, with their prices.** x = 37's ratio `X/X_dec`\n needs the real-space sieve, priced at 21656 s of wall clock, over the 4-hour\n rule. x = 41's exact model needs 5.3e12 descent nodes (section 5).\n\n## 1. The step-1 ladder, now eight exact levels\n\n`delta*X` is Var/E. Both columns are exact arithmetic, no Monte Carlo (SEC 1).\n\n| x | ln y | delta*X | delta*X_dec | delta*(X - X_dec) | X/X_dec | * ln y |\n|---|---|---|---|---|---|---|\n| 7 | 2.565 | 0.152075 | 0.178193 | -0.026118 | 0.853427 | -0.06699 |\n| 11 | 3.850 | 0.256267 | 0.266839 | -0.010572 | 0.960382 | -0.04070 |\n| 13 | 5.153 | 0.299499 | 0.296592 | +0.002907 | 1.009802 | +0.01498 |\n| 17 | 6.564 | 0.326772 | 0.325504 | +0.001268 | 1.003895 | +0.00832 |\n| 19 | 8.042 | 0.347302 | 0.346800 | +0.000502 | 1.001448 | +0.00404 |\n| 23 | 9.611 | 0.364320 | 0.363842 | +0.000477 | 1.001312 | +0.00459 |\n| 29 | 11.295 | 0.377418 | 0.377144 | +0.000273 | 1.000725 | +0.00309 |\n| 31 | 13.012 | 0.387588 | 0.387405 | +0.000183 | 1.000471 | +0.00238 |\n\nThe last column is bounded on every level computed and falls at every step\nabove x = 23. The ratio column is monotone from x = 17 up. Neither fact\nseparates `O(1/ln y)` from anything faster: multiplying by `ln^2 y` instead\ngives 0.0772, 0.0546, 0.0325, 0.0441, 0.0349, 0.0310 at x = 13..31 [DERIVED,\narithmetic on the two columns above], which also falls and is also\nnon-monotone. Eight levels exclude growth. That is the whole of it.\n\nThe engine is a rewrite: `varE-theta2-step.js` held four `Float64Array`s of\n`L/6` entries and said x = 29 would need 35 GB. The producer here blocks the\nsame sieve into 2^17 positions, carrying each prime's next-hit index across\nblocks, so the working set is 4 MB at every level. It reproduces theta2's six\nlevels to 1e-6 (SEC 0) and costs 12.0 to 16.3 s per 1e9 positions (SEC 1).\n\n## 2. The model's conductor bands, exact\n\n`varE-spectral.md` section 3 collapses the decoupled sum to\n`delta*X_dec = E[(n/L){L/n}(1 - {L/n})]` with `p | n` independently at\n`pi_p = (p - alpha_p)/(p - 1)`, so `n` is always a multiple of 6. Section 4\nthen splits the conductors into three groups and evaluates one of them.\n\nTwo observations make all three exactly computable up to x = 37.\n\n**The band below L is finite.** Every conductor there is a squarefree y-smooth\ninteger `<= L`, so it is enumerable by descent over the primes with the running\nproduct as the state, each conductor visited once. The cost is about 0.0167\nnodes per unit of L, against the sieve's L/6 positions.\n\n**The band above L needs no enumeration.** For the model's law,\n\n E[1/n] = (1/6)(1 - pi_5 + pi_5/5) prod_{7<=p<=y} (1 - pi_p + pi_p/p)\n = (1/6)(2/5) prod_{7<=p<=y} (p-2)/p = delta,\n\nbecause `1 - 2/(p-1) + 2/(p(p-1)) = (p-2)/p` prime by prime. That is the dual\nof section 3's `E[n] = 1/delta`, and it gives\n\n band(n > L) = (1 - P[n <= L]) - ( delta*L - L*E[(1/n) 1{n <= L}] ),\n\nwhose three ingredients are all by-products of the same descent. `delta*L` is\nformed exactly in BigInt and printed against `variance-note.md` section 7's\n`E[N_W]` column, which it reproduces at all nine levels (SEC 2).\n\nThe bands, exact (SEC 2):\n\n| x | n \\| L | n < L | n > L | of which L < n < 4L | n > 4L |\n|---|---|---|---|---|---|\n| 7 | 0 | 0.003056943 | 0.175135975 | 0.075485625 | 0.099650350 |\n| 11 | 0 | 0.012367138 | 0.254471738 | 0.063202354 | 0.191269383 |\n| 13 | 0 | 0.012344728 | 0.284246894 | 0.041699091 | 0.242547803 |\n| 17 | 0 | 0.009853657 | 0.315650254 | 0.034339926 | 0.281310328 |\n| 19 | 0 | 0.008044066 | 0.338755481 | 0.028190788 | 0.310564693 |\n| 23 | 0 | 0.006640313 | 0.357202109 | 0.023927028 | 0.333275081 |\n| 29 | 0 | 0.005616554 | 0.371527981 | 0.020542354 | 0.350985627 |\n| 31 | 0 | 0.004855050 | 0.382548799 | 0.017963073 | 0.364585726 |\n| 37 | 0 | 0.004252203 | 0.391414298 | 0.015868 (MC) | 0.375609 (MC) |\n| 41 | 0 | 0.003769 (MC) | 0.398599 (MC) | 0.014177 (MC) | 0.384422 (MC) |\n\nThe x = 37 sub-split and the whole x = 41 row are Monte Carlo at N = 1e8 on two\nseeds, standard error 3.4e-5 on a total and 1.3e-6 on the `n < L` band (SEC 3);\nthe x = 41 `n > L` entry is DERIVED as 0.014177 + 0.384422. The descent to 4L\nat x = 37 is 1.8 h and was declined; the descent at x = 41 is 19 h and was\ndeclined.\n\n**The check that could have failed.** The descent and the sieve of section 1\nshare no code path, and their totals differ by -1.17e-15, -1.25e-14, -1.58e-13,\n-6.17e-12, -1.79e-10, -9.50e-10, +4.16e-8, -1.12e-6 over x = 7..31 (SEC 2). The\ngrowth is the descent's own cancellation floor, about `6e-18 * L`, since\n`band(n > L)` subtracts two quantities of size `delta*L` (9.4e9 at x = 37) to\nleave 0.39. That is why the x = 37 total is quoted to five decimals and no\nfurther. The `n < L` band does not pass through that cancellation: it is a sum\nof positive terms with `sum|terms| <= 0.013`, so Kahan bounds its error by\n3e-18 at every level, x = 37 included.\n\n## 3. The n <= L band: the coefficient section 4 did not have\n\n`varE-spectral.md` section 4 records the middle band as \"`O(1/ln W)`: moves the\ndrift, not the limit\" and states, in its own words, that it is **not** evaluated\nthere; section 5 and the note's own falsification table both carry that gap, and\n`redteam-0828-varE.md` section 0 names it as half of the second open step. Here\nit is, exact (SEC 4B):\n\n| x | n < L band | share of delta*X_dec | band * ln y |\n|---|---|---|---|\n| 13 | 0.0123447 | 4.162 % | 0.06362 |\n| 17 | 0.0098537 | 3.027 % | 0.06468 |\n| 19 | 0.0080441 | 2.320 % | 0.06469 |\n| 23 | 0.0066403 | 1.825 % | 0.06382 |\n| 29 | 0.0056166 | 1.489 % | 0.06344 |\n| 31 | 0.0048550 | 1.253 % | 0.06317 |\n| 37 | 0.0042522 | 1.075 % | 0.06301 |\n| 41 | 0.0037694 | 0.937 % | 0.06285 (MC) |\n\nRead it at its rung. The band is **MEASURED** to behave as `c/ln y` with\n`c` near 0.063, on nine levels, with no derivation, and the last column is\nstill creeping down rather than settling, so 0.063 is an upper reading of a\nconstant that may not exist. What the table does establish, at the level of\ndata, is that the band vanishes and vanishes at the rate section 4 guessed:\nin `ln W` units it is `0.126/ln W`, since `ln W = 2 ln y` on the diagonal.\n`varE-limit-theorem.md`, the sibling pass of the same day, states the same band\nas `O(1/ln y)` and proves it; these are the sizes that claim has to match.\n\n**The other two corrections, for the same sibling.** Writing the model as\n`delta*X_dec = P[n > L] - E[(L/n) 1{n > L}] + band(n < L)` splits its distance\nfrom `lambda_2(2) = 0.45545648` into three measured pieces [DERIVED, arithmetic\non SEC 2's mass and band columns; `P[n > L]` is the sum of that table's last\ntwo mass entries, printed directly only at x = 37]:\n\n| x | P[n > L] | lambda_2(2) - P[n>L] | * ln y | E[(L/n) 1{n>L}] | * ln y |\n|---|---|---|---|---|---|\n| 13 | 0.350726 | 0.104730 | 0.5397 | 0.066479 | 0.3426 |\n| 17 | 0.368117 | 0.087339 | 0.5733 | 0.052467 | 0.3444 |\n| 19 | 0.382620 | 0.072836 | 0.5858 | 0.043865 | 0.3528 |\n| 23 | 0.394437 | 0.061019 | 0.5865 | 0.037235 | 0.3579 |\n| 29 | 0.403580 | 0.051876 | 0.5860 | 0.032052 | 0.3620 |\n| 31 | 0.410608 | 0.044848 | 0.5836 | 0.028059 | 0.3651 |\n| 37 | 0.416225 | 0.039231 | 0.5813 | 0.024811 | 0.3676 |\n\nThe three add up: `0.039231 + 0.024811 - 0.004252 = 0.059790`, against\n`lambda_2(2) - 0.395667 = 0.059789` at x = 37 [DERIVED]. So of the model's whole\ndistance from the limit at that level, the convergence of `P[n > L]` to the\nDickman tail supplies 0.039231, or 66 %, and the two band corrections supply a\nnet +0.020559, or 34 %. The largest of the three is the one the limit theorem\ncannot avoid. Their coefficients against `1/ln y` are 0.58 (settled to three\nfigures over four levels), 0.37 (rising) and 0.063 (falling), so none of the\nthree is an established constant and only their sum is checked.\n\n## 4. x = 37 and x = 41\n\n**x = 37, exactly.** The model is 0.395667 (SEC 2, identity route, +- ~5e-5 from\nthe cancellation floor of section 2) and 0.395728 +- 3.34e-5 (SEC 3, Monte\nCarlo, N = 1e8, two seeds). The two agree to 6.15e-5 against a combined bar of\nabout 6e-5. Against that, `varE-spectral.md` section 6a's model column reads\n0.39643, which is 7.6e-4 high and is Monte Carlo at N = 4e5;\n`redteam-0828-varE.md` section 4's 0.395567 +- 0.000106 is 1.0e-4 low, inside\nits own bar. The measured Var/E at x = 37 is 0.3958 with a +-5e-5 quantisation\nfrom `variance-note.md` section 7's four printed decimals, so the residual\nthere is +0.00013 +- 0.00005 against the exact model rather than the -0.0006\nthe note carries. **That correction is not applied to any file by this pass.**\n\n**x = 41.** 0.402368 +- 3.36e-5 (SEC 3), against `redteam-0828-varE.md`\nsection 4's 0.402364 +- 0.000075: a difference of 4e-6, and a five-fold\ntightening of the same number by the same method at five times the sample. It\nsits inside `var41-prereg.md`'s registered [0.4013, 0.4040] and 0.053 below the\nclosed form 0.455456, so the tenth level still does not test the constant, which\nis what `varE-spectral.md` section 8 already says.\n\n## 5. What was priced and declined\n\nChris's rule is that anything under four hours is simply run. Three things were\npriced out of it (producer header and SEC 1):\n\n| object | method | price | verdict |\n|---|---|---|---|\n| `X` and `X/X_dec` at x = 37 | real-space sieve, 1.237e12 positions | 21656 s of wall clock, 6.02 hours | DECLINED, over the rule |\n| the L < n < 4L band at x = 37 | descent to 4L, 5.2e11 nodes | 1.8 h | DECLINED, MC used instead |\n| the exact model at x = 41 | descent to L, 5.3e12 nodes | 19 h | DECLINED, MC used instead |\n| Var(41) itself | `var41-price.js` | ~40x the x = 37 point | not attempted, TODO item 2 |\n\n**No cheaper exact route to `X` was found, and the reason is structural.** The\nconductor sum works for `X_dec` because `V(h)` depends on `h` only through\n`prod_{p|h}`, one linear form. `W(h)` depends jointly on the factorisations of\n`h`, `h - 2` and `h + 2` restricted to primes `<= y`, which is three linear\nforms and no multiplicative structure over conductors; the frequency-side\nversion of the same sum is `varE-theta2-step.md` section 2's `3^omega(n)` lag\nexpansion, which has more terms than the sieve has positions. So the ratio\nladder stops at x = 31 until someone finds a different identity, not a faster\nmachine.\n\n## 6. What would falsify this, and whether that check has run\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| `X` and `X_dec` at x = 29 and 31, six figures | MEASURED, exact arithmetic | a second implementation disagreeing | PARTLY. SEC 0 reproduces theta2's six lower levels to 1e-6 in a rewritten engine, and SEC 2's descent reproduces `X_dec` at x = 29 and 31 to 4.2e-8 and 1.1e-6 by an unrelated route. `X` itself has one implementation family at the two new levels |\n| `delta*X` matches the measured column at x = 29, 31 | MEASURED | disagreement with `variance-note.md` section 7 | YES, 0.377418 vs 0.3774 and 0.387588 vs 0.3876 |\n| the decoupling error is `O(1/ln y)` or better | MEASURED, 8 exact levels | `delta*(X - X_dec)*ln y` growing at a new level | PARTLY. Falling on x = 13..31; the levels exclude growth and nothing finer, exactly as at six levels |\n| the net coefficient of the decoupling error | NOT CLAIMED | nothing; one half of the cancellation is still drifting | Do not quote a value |\n| `E[1/n] = delta` for the model's law | PROVEN | a prime where `1 - 2/(p-1) + 2/(p(p-1)) != (p-2)/p` | YES, algebra, plus `delta*L` against `E[N_W]` at nine levels |\n| the `n < L` band is `0.063/ln y` to three figures | MEASURED, 9 exact levels | a level where `band * ln y` leaves [0.062, 0.065] | NO for x > 41. The column is still falling, so 0.063 is an upper reading |\n| the `n \\| L` band is exactly 0 | PROVEN | Fact B failing | YES, it is Fact B, and the descent prints 0.000000000 |\n| the model at x = 37 is 0.395667 | MEASURED, exact to ~5e-5 | a third route outside 0.39567 +- 1e-4 | YES, MC at N = 1e8 gives 0.395728 +- 3.3e-5 |\n| the model at x = 41 is 0.402368 | MEASURED, MC | a value outside +- 1e-4 | YES, `redteam-0828-varE.md` section 4's independent 0.402364 |\n| x = 37's ratio is out of reach | MEASURED price | a route to `X` that is not a position sum | NO. Section 5 argues one does not exist; it is an argument, not a proof |\n| any of this closes either open step | NOT CLAIMED | — | Both steps stand open |\n\nThe one line worth carrying out of this pass: the middle conductor band, the\none `varE-spectral.md` section 4 declined to evaluate, is `0.063/ln y` on nine\nexact levels and 1.1 % of the model at x = 37, and the decoupling error above\nit is still a near-cancellation whose second half has not settled.\n"},"research/history/staging/varE-limit-theorem.md":{"lf_sha256":"29a5224af13c8097ca1cea669f8b71fdbd10e43213506054db11fd2ff1e7eb8b","content":"# The decoupled model's own limit theorem, proven: the limit is Pr[GD(2) > u] with no correction term, and the n <= L band is O(1/ln y)\n\n\n\n*Staging note, 2026-08-28. TODO item 9. Attacks the SECOND of the two open\nsteps named in `redteam-0828-varE.md` §0: the limit theorem for the decoupled\nmodel of `varE-spectral.md` §§3-5, whose `n <= L` band that note's §4 states as\n`O(1/ln W)` and does not evaluate. The first step, the theta = 2 decoupling\nreplacement, is untouched here and stays open;\n`research/varE-exact-ladder-01.js` is the sibling that prices it, and its band\nnumbers are an independent witness to §6 below. Producer:\n`research/history/staging/varE-limit-theorem.js` (embedded, `code-sha256` and\n`out-sha256` verified statically; 4929.5 s, of which 4792 s is the `x = 37`\nlevel). Nothing from `paper/variance-note.md` is recomputed; the nine diagonal\nlevels and the exact `delta*X_dec` column are read from `variance-note.md` §7\nand `varE-theta2-step.md` §4.*\n\n## 0. Verdict, disconfirming half first\n\n**This does not close the question, and the constant stays HEURISTIC.**\n`varE-spectral.md` §2's decoupling replacement, the first of that note's two\nopen steps, is untouched here and stays open; the whole chain from the exact\ncomb variance to any constant rests on it. What this pass removes is the\nsecond step. The count goes from two open steps to one.\n\n**Nothing here touches the conjecture.** `variance-note.md` §4 already records\nthat Var/E is a statement about a uniformly random window and says nothing\nabout the one anchored window the twin problem needs. This note asks only\nwhether a stated limit is the limit of a stated model.\n\n**The rate is not proven, only the limit.** Theorem C bounds the two\ntransition bands at `O(1/ln y)`, elementarily and uniformly. It does **not**\nbound the model's distance from `GD(2)`'s tail; that needs an Esseen-type\nconversion of Theorem A's transform rate, and it is NOT DONE. So\n`varE-spectral.md` §4's \"the drift family is a series in `1/ln W`\" is still\nnot derived. It is now measured for the model: `(lambda_2(2) - E[g]) ln y`\nreads 0.817373, 0.847013, 0.872474, 0.880131, 0.884491, 0.885452, 0.886133 at\n`x = 13..37`, settling on 0.886, which is a measurement and not a derivation.\n\n**And a fresh derivation is a fresh derivation.** Everything below is written\nout and checkable, and none of it has had an adversarial pass. The four notes\nthis one builds on were all corrected by one\n(`redteam-0828-varE.md`, `applied-0828-varE.md`, forty-two edits), so PROVEN\nhere means \"the argument is on the page and can be checked\", not \"the argument\nhas been checked by someone else\". This note is HELD like the rest.\n\nWith that said, what the pass produced:\n\n- **PROVEN. The decoupled model's limit is exactly `Pr[GD(2) > u]`, and there\n is no correction term.** `ln n/ln y -> GD(2)` with an explicit\n Laplace-transform rate `O_s(lnln y/ln y)` (Theorem A, §2), the conductors\n dividing `L` contribute exactly zero (§3), and the transition region\n `n asymp L`, where `g` is neither 0 nor 1, is killed by the boundedness of\n `GD(2)`'s density alone (Theorem B, §4). So `varE-spectral.md` §5's closed\n form omits nothing: `lambda_2(2) = 1 - e^{-2gamma}(9/2 - 4 ln 2) =\n 0.45545648` is the model's limit as written.\n- **PROVEN, elementary. The `n <= L` band `varE-spectral.md` §4 declined to\n evaluate is `O(1/ln y)`.** The proof is a block bound for a\n dimension-2 multiplicative function (Lemma C1), which gives a local bound\n `Pr[ln n in (T-1,T]] = O((1+T)/ln^2 y)` uniform in `y` (Lemma C2), which\n bounds both transition bands (Theorem C, §5). No local limit theorem and no\n equidistribution is used.\n- **MEASURED, exact, nine levels, no Monte Carlo.** The band the red team\n flagged is `B*ln y = 0.063616, 0.064678, 0.064691, 0.063820, 0.063440,\n 0.063175, 0.063008` at `x = 13..37`, bounded and settling on 0.0630, against\n the local-density prediction `f_2(2) I = 0.062729`. The producer also\n supplies three exact model values where the corpus had Monte Carlo,\n `0.3771445`, `0.387405` and `0.39566` at `x = 29, 31, 37`, each now with two\n or three independent witnesses (§6a).\n- **CORRECTIONS to `varE-spectral.md`.** Its two-open-step count becomes one,\n in five places and in its ledger verdict; its §4 `n <= L` row can carry a\n proof and a coefficient instead of an assertion; and its §6a model value at\n `x = 37`, `0.39643`, is `0.0008` high against the exact `0.39565`, which is\n larger than the residual that column is used to discuss. Full list in §10.\n\n## 1. The model, stated exactly\n\nNotation follows `varE-spectral.md` §3. Fix a sieve level `y` and a window\nlength `L`. For a prime `p <= y` let `alpha_p` be the number of comb classes\nsurviving at `p`:\n\n alpha_2 = alpha_3 = 1, alpha_5 = 2, alpha_p = p - 2 for 7 <= p <= y,\n\nso that the comb density is `delta = prod_{p <= y} alpha_p/p`.\n\n**The probability space.** `Omega = {0,1}^{P(y)}`, `P(y)` the primes up to `y`,\nwith the product measure `Pi` under which the coordinate at `p` is 1 with\nprobability\n\n pi_p = (p - alpha_p)/(p - 1),\n\nindependently: `pi_2 = pi_3 = 1`, `pi_5 = 3/4`, `pi_p = 2/(p-1)` for `p >= 7`.\nThe **random conductor** is `n = prod_{p : coordinate 1} p`, a squarefree\n`y`-smooth integer, always divisible by 6.\n\n**The functional.** `g(n) = {L/n} (1 - {L/n}) n/L`, and the model's value is\n`E_Pi[g(n)]`. `varE-spectral.md` §3 proves, given its decoupling step, that\nthis equals `delta * X_dec`, the decoupled spectral sum after normalisation.\n\n**The diagonal.** `L = W = x#` and `y` is the largest prime `<= sqrt(L)`, so\nthe window exponent is `u_y = ln L / ln y`. Bertrand alone gives\n`y > sqrt(L)/2`, hence `ln y >= (ln L)/2 - ln 2` and `u_y -> 2`; no prime-gap\ninput is needed for that. At the computed levels `u_y` reads 2.0847, 2.0116,\nthen 2.000x from `x = 13` up (`redteam-0828-varE.md` §2), which this note's\nproducer reproduces.\n\n**Two exact identities, both one line.** First, the size-bias dual of\n`varE-spectral.md` §3's `E_Theta[n] = 1/delta`:\n\n E_Pi[1/n] = prod_{p <= y} (1 - pi_p + pi_p/p)\n = prod_{p <= y} (1 - pi_p (p-1)/p)\n = prod_{p <= y} (1 - (p - alpha_p)/p)\n = prod_{p <= y} alpha_p/p = delta.\n\nPROVEN, and checked to `2.4e-15` at every level (PART 0). It is what makes the\nband decomposition below computable without enumerating `n > L`. Second,\n`Pr[n | L] = C_y prod_{5 <= p <= x} (1 + rho_p)` with `rho_p = pi_p/(1-pi_p)`\nand `C_y = prod_{5 <= p <= y} (1 - pi_p)`, since on the diagonal `L = x#` is\nthe primorial and `n | L` says exactly that every prime factor of `n` is\n`<= x`. Checked against the enumerated `r_n = 0` nodes at every level, to the\nprinted digit (PART 1).\n\n## 2. Theorem A: the limit law of ln n / ln y\n\nWrite `D_y = ln n / ln y = sum_{p <= y} 1_p (ln p / ln y)`.\n\n**Theorem A.** For every fixed `s > 0`,\n\n ln E[e^{-s D_y}] = 2 int_0^1 (e^{-sw} - 1)/w dw + O_s( lnln y / ln y ),\n\nequivalently `E[e^{-sD_y}] = exp(2 int_0^1 (e^{-sw}-1)/w dw)(1 + O_s(lnln y/ln y))`,\nand consequently `D_y -> GD(2)` in distribution, `GD(2)` the generalized\nDickman law of index 2.\n\n*Proof.* Put `w_p = ln p / ln y in (0,1]` and `phi_p = e^{-s w_p} - 1`, so\n`E[e^{-sD_y}] = prod_{p<=y} (1 + pi_p phi_p)`, every factor positive.\n\n(i) *Linearisation.* `|pi_p phi_p| <= 1/3` for `p >= 7` because `pi_p <= 1/3`\nthere and `|phi_p| <= 1`; and for `p in {2,3,5}`, `|pi_p phi_p| <= s ln 5/ln y\n<= 1/2` once `ln y >= 2 s ln 5`. So all factors admit\n`ln(1+z) = z + O(z^2)`, and\n\n sum_p (pi_p phi_p)^2 <= 3 (s ln 5/ln y)^2\n + (s^2/ln^2 y) sum_{p >= 7} 4 ln^2 p/(p-1)^2\n = O_s(1/ln^2 y),\n\nthe tail sum converging. Hence `ln E[e^{-sD_y}] = sum_p pi_p phi_p + O_s(1/ln^2 y)`.\n\n(ii) *The exact `pi_p` against the rate 2/p.* Write `pi_p = 2/p + eps_p`. For\n`p >= 7`, `eps_p = 2/(p(p-1))`; for `p in {2,3,5}`, `|eps_p| <= 1`. Since\n`|phi_p| <= min(1, s w_p) <= s ln p/ln y`,\n\n | sum_p eps_p phi_p | <= (s/ln y) sum_p |eps_p| ln p = O_s(1/ln y),\n\nbecause `sum_{p>=7} 2 ln p/(p(p-1))` converges. **This is where the exact\n`pi_p` is spent, and it is spent as a convergent sum**: the deviation of the\nmodel's inclusion rate from `2/p` is summable against `ln p`, so it moves the\ntransform by `O(1/ln y)` and cannot move the limit. It is the only place the\nvalue 2 in `theta = 2` enters.\n\n(iii) *Mertens.* Fix `t_0 = 3`. The primes below `t_0` contribute\n`O(s ln t_0/ln y) = O_s(1/ln y)` to `sum_{p<=y} 2 phi_p/p`, again by\n`|phi_p| <= s ln p/ln y`. Above `t_0`, write\n`A(t) = sum_{p<=t} 1/p = lnln t + M + r(t)` with `|r(t)| <= c/ln t`\nunconditionally for `t >= t_0` (Mertens 1874), and `phi(w) = e^{-sw} - 1`:\n\n sum_{t_0 < p <= y} phi(ln p/ln y)/p = int_{t_0}^y phi(ln t/ln y) dt/(t ln t)\n + int_{t_0}^y phi(ln t/ln y) dr(t).\n\nThe substitution `w = ln t/ln y` turns `dt/(t ln t)` into `dw/w`, giving\n`int_{w_0}^1 phi(w) dw/w` with `w_0 = ln t_0/ln y`; since `|phi(w)| <= sw` near\n0, extending the integral down to 0 costs `O(s/ln y)`. Integration by parts on\nthe second integral, with `d phi(ln t/ln y) = -s e^{-s ln t/ln y} dt/(t ln y)`,\ngives boundary terms `O(1/ln y)` and\n\n (s/ln y) int_{t_0}^y (c/ln t) dt/t = O(s lnln y/ln y).\n\nCollecting, `sum_p pi_p phi_p = 2 int_0^1 (e^{-sw}-1)/w dw + O_s(lnln y/ln y)`,\nwhich is the display.\n\n(iv) *Identification and convergence.* `exp(theta int_0^1 (e^{-lambda x}-1)/x dx)`\nis the Laplace transform of `GD(theta)`, whose density is\n`p_theta = e^{-theta gamma} rho_theta/Gamma(theta)` with\n`rho_theta(x) = x^{theta-1}` on `(0,1]` and\n`x rho_theta' + (1-theta) rho_theta + theta rho_theta(x-1) = 0` beyond, and\nwhose mean is `theta` (Pinsky, arXiv:1611.07207v3, pp. 2-3, read at the page\nthis session; §8 below). Convergence of Laplace transforms of non-negative\nrandom variables on `s > 0` gives convergence in distribution. `[]`\n\nTwo remarks worth keeping.\n\n- **The rate is measured, not only asserted.** PART 4 evaluates the model's\n transform exactly against `GD(2)`'s at `s = 0.5, 1, 2, 4` on all nine levels;\n the error times `ln y/lnln y` is bounded and settles, which is the predicted\n shape.\n- **`GD(2)`'s density is bounded and its law is continuous**, which is what\n §4 uses: `p_2(t) = e^{-2gamma} t` on `(0,1]`, and `p_theta(x) <=\n C_theta/Gamma(x+1)` for `x >= 1` (Pinsky p. 2), so `sup p_2 < infinity` and\n the distribution function is continuous everywhere.\n\n## 3. The three bands\n\n`g(n) = {L/n}(1 - {L/n}) n/L`, and `{L/n} = r_n/n` with `r_n = L mod n`. Read\nthe three bands straight off.\n\n**(a) `n | L`: exactly zero.** `n | L` gives `r_n = 0`, so `g(n) = 0` and the\nwhole conductor contributes nothing. This is the model-side face of\n`varE-asymptotic.md` Fact A, `sum_{nu != 0 mod q} K_L(nu/q) = r_q(q - r_q)/L`,\nwhose right side vanishes precisely when `q | L`; and the converse holds too,\n`g(n) = 0` **iff** `n | L`, since `{L/n}(1-{L/n}) = 0` forces `{L/n} = 0`. On\nthe diagonal `L = x#` this is exactly the inert set of `varE-asymptotic.md`\nFact B. Its probability is not merely inert but vanishing:\n`Pr[n | L] = prod_{x < p <= y}(1 - pi_p) asymp (ln x/ln y)^2`, and\n`x ~ ln W` on the diagonal, so `Pr[n|L] asymp (lnln W/ln W)^2 -> 0`. Measured:\n0.666666667 at `x = 7` falling to 0.063810103 at `x = 37` (PART 1).\n\n**(b) `n < L`, `n` not dividing `L`.** Here `L/n > 1` and\n`0 < g(n) <= n/(4L)`, since `t(1-t) <= 1/4`.\n\n**(c) `n > L`.** Here `0 < L/n < 1`, so `{L/n} = L/n` and\n\n g(n) = (L/n)(1 - L/n)(n/L) = 1 - L/n, exactly.\n\nSo, with `P_> = Pr[n > L]`, `R = E[(L/n) 1_{n>L}]` and `B = E[g(n) 1_{n - R + B, all four quantities exact.\n\nThe producer computes all four at nine levels; `P_>` and `R` come from the\n`n <= L` enumeration and the closed form `E[1/n] = delta` of §1, so nothing\nabove `L` is ever enumerated. **The decomposition is what makes the `n <= L`\nband evaluable at all**, and it is the piece `varE-spectral.md` §4 did not\nwrite down: that note bounded the band by `n^2/4L` summed against\n`2^omega(n)`, got `O(ln W)` before the `delta`, and stopped.\n\n## 4. Theorem B: the limit, and there is no correction term\n\n**Theorem B.** Let `y -> infinity` with `u_y = ln L/ln y -> u > 0`. Then\n\n E[g] -> Pr[GD(2) > u] = lambda_2(u).\n\nIn particular the transition region `n asymp L`, where `g` is neither 0 nor 1,\ncontributes nothing in the limit, and `lambda_2(u)` is the whole answer.\n\n*Proof.* Since `n > L` iff `D_y > u_y`, and `GD(2)` has a continuous\ndistribution function (§2), Theorem A plus Polya's theorem give\n`P_> = Pr[D_y > u_y] -> lambda_2(u)`.\n\nFor the two remainders, both are dominated by\n`M := E[min(n/L, L/n)] = E[exp(-ln y |D_y - u_y|)]`, because\n`R <= M` and `0 <= B <= M/4`. Fix `eps > 0` and split. On\n`|D_y - u_y| > eps` the integrand is at most `e^{-eps ln y} = y^{-eps} -> 0`.\nOn `|D_y - u_y| <= eps` the integrand is at most 1, and\n\n limsup_y Pr[|D_y - u_y| <= eps] = Pr[|GD(2) - u| <= eps] <= 2 eps sup p_2,\n\nagain by Theorem A and the continuity of the limit law. So\n`limsup M <= 2 eps sup p_2` for every `eps > 0`, hence `M -> 0`, hence\n`R -> 0` and `B -> 0`. `[]`\n\nFour things this settles, in the order they matter.\n\n1. **`Pr[GD(2) > u]` already includes the transition.** The question the brief\n asks is whether the note's closed form omits a correction from `n asymp L`.\n It does not. The transition band is a two-sided window of width `O(1/ln y)`\n in `D_y`, and it is killed by the boundedness of `GD(2)`'s density alone.\n No term is added to `lambda_2(u)` and none is subtracted.\n2. **The limit needs no local limit theorem.** Weak convergence and a bounded\n limiting density suffice. That matters, because the *rate* does need\n something local (§5) and the rate is not what the constant depends on.\n3. **Nothing in the proof uses `theta = 2`.** Step (ii) of Theorem A is the\n only place the value enters, and it enters as \"`pi_p - theta/p` is summable\n against `ln p`\". Any excluded-class count `theta` gives `lambda_theta(u)` by\n the same two proofs. At `theta = 1` that is\n `lambda_1(u) = e^{-gamma} int_u^infty rho`, Gorodetsky's function, and\n `varE-spectral.md` §9 already checks the corresponding decoupled sum against\n his (1.5)/(1.6) to relative `1.7e-16`. So the `theta = 1` branch is a check\n on this proof and not only on the arithmetic: a published theorem sits at\n `theta = 1` on the same object, and the limit this note proves for the model\n agrees with it there.\n4. **The `n | L` band is doubly harmless.** It contributes exactly zero at\n every finite level, and its probability tends to zero, so it is not even a\n `1/ln y` correction. `varE-asymptotic.md` §6 item 4 warned that treating\n `{L/e}` as equidistributed would be wrong by the inert share, 0.539 of the\n Mertens mass at `x = 37`; that warning is about the arithmetic side, and on\n the model side the inert conductors are handled exactly rather than\n approximated.\n\n## 5. Theorem C: the rate, from an elementary local bound\n\nTheorem B says the bands vanish. How fast is a separate question, and it is\nthe one `varE-spectral.md` §4 answered by assertion (`O(1/ln W)`, not\nevaluated). It is provable, elementarily.\n\n**Lemma C1 (block bound).** Let `h` be multiplicative, supported on squarefree\nintegers whose prime factors lie in `[5, y]`, with `h(5) = 3` and\n`h(p) = 2/(p-3)` for `7 <= p <= y`. Then for every `N >= 1`,\n\n sum_{N < m <= eN} h(m) <= K (1 + ln 2N),\n\nwith `K` absolute, in particular uniform in `y`.\n\n*Proof.* `h(m) <= c(m)/m` with `c(m) = m h(m)` multiplicative, squarefree\nsupported, `c(5) = 15` and `c(p) = 2p/(p-3) = 2 + 6/(p-3)` for `7 <= p <= y`.\nSo the block is at most `N^{-1} sum_{m <= eN} c(m)`. Let\n`q_y(m) = mu^2(m) 2^{omega(m)} 1[m is y-smooth and coprime to 6]`. Then\n`sum_{m <= M} q_y(m) <= sum_{m <= M} mu^2(m) 2^{omega(m)} <= M(1 + ln M)`,\nbecause for squarefree `m` the ordered coprime factorisations `m = ab` number\n`2^{omega(m)}`, so `mu^2(m) 2^{omega(m)} = sum_{ab=m} mu^2(a) mu^2(b)` and\n`sum_{m<=M} <= sum_{a<=M} floor(M/a)`.\n\nWrite `c = q_y * b` (Dirichlet). Locally, `sum_k b(p^k) z^k = (1 + c(p)z)/(1 + 2z)`,\nso `b(p^k) = (-2)^{k-1}(c(p) - 2)` for `k >= 1`. For `p < 5` or `p > y` both\n`c(p)` and `q_y(p)` vanish and `b(p^k) = 0`. For `7 <= p <= y`,\n`|c(p) - 2| = 6/(p-3)`, and\n\n sum_k |b(p^k)|/p^k = |c(p) - 2|/(p - 2) = 6/((p-3)(p-2)),\n\nsummable over primes; the single prime 5 contributes the finite factor\n`1 + 13/3`. Hence `sum_m |b(m)|/m <= K_0 < infinity`, absolute. Then\n\n sum_{m<=M} c(m) = sum_{d<=M} b(d) sum_{e <= M/d} q_y(e)\n <= sum_{d<=M} |b(d)| (M/d)(1 + ln M)\n <= K_0 M (1 + ln M). []\n\nThe `1 +` is bookkeeping: only `N >= 1` occurs in Lemma C2, because the\nsupport satisfies `6 | n`.\n\n**Lemma C2 (local bound).** Uniformly in `T > 0` and `y`,\n\n Pr[ ln n in (T-1, T] ] <= K' (1 + T)/ln^2 y.\n\n*Proof.* The support is `n = 6m` with `m` as in Lemma C1, and the weight is\n`w(6m) = C_y h(m)` with `C_y = prod_{5<=p<=y}(1 - pi_p) = (1/4) prod_{7<=p<=y}(p-3)/(p-1)`.\nSince `(p-3)/(p-1) = (1-1/p)^2 (1 - (3p-1)/(p-1)^3)` and\n`sum_p (3p-1)/(p-1)^3` converges, Mertens gives `C_y asymp 1/ln^2 y`. Lemma C1\nwith `N = e^{T-1}/6` gives the claim. `[]`\n\n**Theorem C.** With `L = y^{u + o(1)}` and `u` fixed,\n\n R = E[(L/n) 1_{n>L}] = O_u(1/ln y),\n B = E[g 1_{n L] + O_u(1/ln y)`.\n\n*Proof.* Bin by `j >= 0`. For the lower band,\n`E[(n/L)1_{nL}] <= sum_j e^{-j} Pr[ln n in (ln L + j, ln L + j + 1]]\n<= (K'/ln^2 y) sum_j e^{-j}(2 + ln L + j) = O_u(1/ln y)`, the `j` sum\nconverging. `[]`\n\n**What is still not proven.** Theorem C bounds the two transition bands at\n`O(1/ln y)`. It does not bound `|Pr[D_y > u_y] - lambda_2(u)|`. Theorem A\ngives a rate for the Laplace transform, `O_s(lnln y/ln y)`, and Lemma C2 gives\nthe modulus of continuity a smoothing argument needs, so an Esseen-type\ninequality would convert one into the other; that conversion is **NOT DONE\nhere**. So the model's own rate of approach to `lambda_2(2)` is measured (§6)\nand not derived, while the model's *limit* is proven.\n\n## 6. The bands, measured exactly at nine levels\n\nEvery column below is exact arithmetic over the model's own support: the\nconductors `n <= L` are enumerated one at a time by descent over the primes,\nKahan-summed, and the two quantities above `L` come from the closed form\n`E[1/n] = delta` of §1. There is no Monte Carlo anywhere in the producer. The\nlevels are `variance-note.md` §7's nine, and the deepest costs 4792 s and\n121,901,832,970 enumerated conductors.\n\n**6a. The recomposition, and the model against the corpus.**\n\n| `x` | `Pr[n\\|L]`, closed form | `Pr[n\\|L]`, enumerated | `P_>` | `R` | `B` | `E[g]` exact | corpus |\n|---|---|---|---|---|---|---|---|\n| 7 | 0.666666667 | 0.666666667 | 0.283333333 | 0.108197358 | 0.003056943 | 0.178192918 | 0.178193 |\n| 11 | 0.417387328 | 0.417387328 | 0.335525028 | 0.081053290 | 0.012367138 | 0.266838875 | 0.266839 |\n| 13 | 0.296671934 | 0.296671934 | 0.350725586 | 0.066478692 | 0.012344728 | 0.296591623 | 0.296592 |\n| 17 | 0.212414912 | 0.212414912 | 0.368116926 | 0.052466671 | 0.009853657 | 0.325503912 | 0.325504 |\n| 19 | 0.160547361 | 0.160547361 | 0.382620145 | 0.043864663 | 0.008044066 | 0.346799547 | 0.346800 |\n| 23 | 0.123952461 | 0.123952461 | 0.394436926 | 0.037234816 | 0.006640313 | 0.363842423 | 0.363842 |\n| 29 | 0.096758571 | 0.096758571 | 0.403580143 | 0.032052128 | 0.005616554 | 0.377144569 | 0.37695 (MC) |\n| 31 | 0.078138150 | 0.078138150 | 0.410607924 | 0.028055939 | 0.004855050 | 0.387407034 | 0.38740 (MC) |\n| 37 | 0.063810103 | 0.063810103 | 0.416225089 | 0.024823834 | 0.004252203 | 0.395653458 | 0.39643 (MC) |\n\nFour readings, the disconfirming ones first.\n\n- **The deepest levels carry a float floor, and the printed digits overstate\n them.** `R` is `L(E[1/n] - sum_{n<=L} w(n)/n)`, a difference of two\n quantities of size `L delta = E[N_W] = 9.38e9` at `x = 37`\n (`variance-note.md` §7), and PART 0's `E[1/n]/delta - 1` column measures the\n two products' mutual inconsistency at `-1.25e-14` there, which bounds `R`'s\n absolute error by about `1e-4`. The independent descent of\n `research/varE-exact-ladder-01.js` SEC 2, whose `delta*L` is BigInt-exact,\n reads `0.377144535`, `0.387403848`, `0.395666501` at `x = 29, 31, 37`, and\n its SEC 1 sieve reads `0.377144494` and `0.387404967`. So the witness spread\n is `7.5e-8`, `3.2e-6`, `1.3e-5`, the honest quotes are `0.3771445`,\n `0.387405` and `0.39566`, and the sibling's `x = 37` value is the better of\n the two. `B`, `P_>` and `Pr[n|L]` are direct sums with no cancellation and\n agree with the sibling to every printed digit, including the `x = 37` band\n `0.004252203` and mass `0.063810`.\n- **`varE-spectral.md` §6a's model column is `0.0008` high at `x = 37`.** It\n quotes `0.39643`, Monte Carlo at `N = 4e5`, against `0.39566`;\n `redteam-0828-varE.md` §4's Monte Carlo at `N = 2e7` reads\n `0.395567 +- 0.000106`. `0.0008` is larger than every residual that column is\n used to discuss.\n- **The recomposition is exact.** `P_> - R + B` returns `E[g]` with residual\n `0.0e+0` at all nine levels, and `E[g]` reproduces `varE-theta2-step.md` §4's\n exact `delta*X_dec` at `x = 7..23` to every printed digit. Two independent\n routes to the same six numbers, three counting the sibling.\n- **Against the true variance.** `research/varE-exact-ladder-01.js` SEC 1\n computes the exact `delta*X = Var/E` at `x = 29, 31`, reading `0.377418` and\n `0.387588`, so the decoupling error of link 2 is `+0.000273` and `+0.000183`\n with `delta(X - X_dec) ln y = 0.00309` and `0.00238`, extending\n `varE-theta2-step.md` §5's six levels to eight and continuing to fall. That\n is the sibling's finding, cited and not recomputed here. At `x = 37` no exact\n `Var/E` exists; `variance-note.md` §7's `0.3958` carries `+-5e-5` from its\n own rounding, and against `0.39566` that leaves `+0.00014`.\n\n**6b. The two transition bands against `1/ln y`.**\n\n| `x` | `ln y` | `u_y` | `R ln y` | `f_2(u_y)` | `B ln y` | `f_2(u_y) I` | `B/(R I)` | `Bmax ln y/4` |\n|---|---|---|---|---|---|---|---|---|\n| 7 | 2.5649 | 2.0847 | 0.277521 | 0.375559 | 0.007841 | 0.060886 | 0.17427 | 0.157459 |\n| 11 | 3.8501 | 2.0116 | 0.312067 | 0.385490 | 0.047615 | 0.062496 | 0.94114 | 0.108935 |\n| 13 | 5.1533 | 2.0007 | 0.342584 | 0.386845 | 0.063616 | 0.062716 | 1.14540 | 0.105435 |\n| 17 | 6.5639 | 2.0024 | 0.344384 | 0.386638 | 0.064678 | 0.062682 | 1.15844 | 0.100464 |\n| 19 | 8.0421 | 2.0004 | 0.352762 | 0.386872 | 0.064691 | 0.062721 | 1.13115 | 0.099629 |\n| 23 | 9.6111 | 2.0001 | 0.357866 | 0.386913 | 0.063820 | 0.062727 | 1.10001 | 0.098267 |\n| 29 | 11.2951 | 2.0000 | 0.362033 | 0.386924 | 0.063440 | 0.062729 | 1.08086 | 0.097716 |\n| 31 | 13.0122 | 2.0000 | 0.365069 | 0.386925 | 0.063175 | 0.062729 | 1.06740 | 0.097314 |\n| 37 | 14.8176 | 2.0000 | 0.367831 | 0.386925 | 0.063008 | 0.062729 | 1.05658 | 0.097069 |\n\n`I = int_1^infty {v}(1-{v}) v^{-2} dv = 0.162122045`.\n\n**This is the answer to the brief's question about the `n < L` band.** It is\n`O(1/ln y)`, proven in §5 and bounded on nine levels here, with\n`B ln y` settling on `0.0630` over the top five levels. Its size at the exact\nlevels is `0.0124` at `x = 13` down to `0.00425` at `x = 37`, against an\n`E[g]` of `0.297` and `0.396`: between 1.1% and 4.2% of the model's value at\nevery level from `x = 13` up, and shrinking like `1/ln y`.\n\n**The two bands are the same local density, measured.** If the distribution of\n`ln n` has a local density `f_2(u)/ln y` near the threshold, then\n`R ln y -> f_2(u)` and `B ln y -> f_2(u) I`, `I` the average of\n`{v}(1-{v})` against `v^{-2} dv`. `R ln y` climbs to `0.367831` against\n`f_2(2) = 0.386925`, and `B/(R I)` falls to `1.05658` against 1. Both are\nconsistent and neither has arrived; the local density itself is not proven\nhere, only the upper bound of Lemma C2 is.\n\n**The analytic bound is within a factor 1.5.** Theorem C bounds `B` by\n`(1/4) E[(n/L) 1_{n` against `GD(2)`'s tail.**\n\n| `x` | `u_y` | `lambda_2(u_y)` | `P_>` | `lambda_2 - P_>` | `(lambda_2 - P_>) ln y` | `lambda_2(u_y) - E[g]` |\n|---|---|---|---|---|---|---|\n| 7 | 2.0847 | 0.423157222 | 0.283333333 | 0.139823889 | 0.358641 | 0.244964 |\n| 11 | 2.0116 | 0.450971828 | 0.335525028 | 0.115446800 | 0.444487 | 0.184133 |\n| 13 | 2.0007 | 0.455203553 | 0.350725586 | 0.104477967 | 0.538405 | 0.158612 |\n| 17 | 2.0024 | 0.454545812 | 0.368116926 | 0.086428886 | 0.567307 | 0.129042 |\n| 19 | 2.0004 | 0.455288498 | 0.382620145 | 0.072668353 | 0.584403 | 0.108489 |\n| 23 | 2.0001 | 0.455417153 | 0.394436926 | 0.060980227 | 0.586085 | 0.091575 |\n| 29 | 2.0000 | 0.455451877 | 0.403580143 | 0.051871735 | 0.585898 | 0.078307 |\n| 31 | 2.0000 | 0.455455045 | 0.410607924 | 0.044847122 | 0.583558 | 0.068048 |\n| 37 | 2.0000 | 0.455456016 | 0.416225089 | 0.039230928 | 0.581310 | 0.059803 |\n\nThe delay-equation solution returns total mass `0.999990778` and\n`lambda_2(2) = 0.455456480` against the closed form\n`1 - e^{-2gamma}(9/2 - 4 ln 2) = 0.455456480`, a third witness to\n`redteam-0828-varE.md` §1's three.\n\n`(lambda_2 - P_>) ln y` is bounded and near 0.58 over the top five levels; no\nbound on it is proven here, which is the gap §5 names. Adding it to `R ln y`\nand subtracting `B ln y` gives the model's whole distance from its limit,\n`(lambda_2(2) - E[g]) ln y = 0.817373, 0.847013, 0.872474, 0.880131, 0.884491,\n0.885452, 0.886133` at `x = 13..37`, settling on `0.886`. Two consequences,\nboth consistency checks rather than new information: it explains\n`varE-spectral.md` §5's \"at `x = 41` it is still 0.053 short\" as\n`0.886/16.674 = 0.0531`, and extrapolated it predicts the model at `x = 41` to\nbe `0.40231`, against `redteam-0828-varE.md` §4's Monte Carlo\n`0.402364 +- 0.000075`.\n\n**6d. The local bound of Lemma C2, measured.**\n\n| `x` | `ln y` | `sup_T ln y Pr[ln n in (T-1,T]]` | at `T` | top full bin |\n|---|---|---|---|---|\n| 7 | 2.5649 | 0.997480 | 4 | 0.128247 |\n| 11 | 3.8501 | 0.749935 | 4 | 0.430153 |\n| 13 | 5.1533 | 0.594548 | 4 | 0.388697 |\n| 17 | 6.5639 | 0.474950 | 10 | 0.395823 |\n| 19 | 8.0421 | 0.439211 | 11 | 0.394282 |\n| 23 | 9.6111 | 0.439692 | 13 | 0.390114 |\n| 29 | 11.2951 | 0.427448 | 17 | 0.393066 |\n| 31 | 13.0122 | 0.420507 | 19 | 0.384880 |\n| 37 | 14.8176 | 0.417147 | 23 | 0.390133 |\n\nLemma C2 says this column is bounded by an absolute constant. It is, and it\nfalls, from `0.997480` to `0.417147`. The top full bin, which sits at the\nthreshold `ln L`, reads `0.390133` at `x = 37` against `f_2(2) = 0.386925`,\nwhich is the local density the two transition bands are governed by, appearing\ndirectly.\n\n**The transform's rate (PART 4).** `err ln y/lnln y` is bounded at all four\n`s` on all nine levels. At `s = 0.5` and `s = 1` it rises then falls,\n`0.12758 -> 0.10285` and `0.10494 -> 0.09450`; at `s = 2` and `s = 4` it is\nstill rising at `x = 37`, `0.05696` and `0.02199`. Bounded is what Theorem A\npredicts and what the levels show. Settled they are not, so nothing here pins\nthe rate's constant.\n\n## 7. What this does to 0.45546\n\n**The number does not move, and there is no correction to state.** The brief\nallowed for a second outcome, \"PROVEN WITH A CORRECTION, state the corrected\nlimit to six digits\". That outcome does not arise. Theorem B gives the model's\nlimit as `Pr[GD(2) > u]` exactly: the inert band contributes exactly zero at\nevery finite level, and the transition region contributes zero in the limit.\nSo `varE-spectral.md` §5's\n\n lambda_2(2) = 1 - e^{-2 gamma}(9/2 - 4 ln 2) = 0.45545648\n\nstands unchanged as the decoupled model's limit at `u = 2`.\n\n**What moves is the step count.** The chain, link by link, with each link's\nrung:\n\n| link | statement | rung |\n|---|---|---|\n| 1 | `Var/E = delta X` exactly, `X = sum_{|h| Pr[GD(2) > u]` | **PROVEN here** (Theorems A, B). Was open |\n| 5 | `Pr[GD(2) > 2] = 1 - e^{-2gamma}(9/2 - 4 ln 2) = 0.45545648` | PROVEN, confirmed to `2.9e-11` by three routes (`redteam-0828-varE.md` §1) |\n\nExactly one link is unproven. Everything the corpus says about `0.45546`\nshould now name that one link rather than two, and the corpus's own narrowing\nof it stands: `varE-theta2-step.md` §3 shows the `c = 0` shift group survives\nthe replacement exactly, so what is open is the single statement that the\nCRT-mixed lags of `|Ehat_n(t)|^2` contribute `o(1/delta)`.\n\n**One tool this pass leaves behind for that link.** Lemma C2 is a bound on the\nmodel's conductor distribution, `Pr[ln n in (T-1,T]] = O((1+T)/ln^2 y)`,\nuniform in `y`, proved from a block bound for a dimension-2 multiplicative\nfunction and nothing else. Whether it helps with the shift groups is untested\nand is not claimed.\n\n**The rung of the constant is unchanged.** `lim Var/E = 0.45546` stays\nHEURISTIC. A proven limit for the model is not a limit for `Var/E`, and link 2\nis what separates them.\n\n**And there is still no measurement of the constant to check against.** The\nbrief asks to check any corrected value against \"the measured 0.455 +- 0.002\".\nNo such measurement exists. The bias-corrected intercept cluster\n`[0.4471, 0.4546]` of `varE-spectral.md` §7 reading 3 is bounded a priori by\n`||c||_1 max|data - model|` and restates that the model tracks the data\npointwise; `redteam-0828-varE.md` §4 says so. The nine measured levels reach\n`0.3958`, and §6 above measures the model's own approach to its limit at `0.886/ln y`,\nso no level of the present kind comes near `0.4555`. Extrapolating that drift,\nwhich is a measurement and not a law, `E[g] = 0.45` needs `ln y` near 162, that\nis `W` near `e^325`.\n\n## 8. Prior art: what is quoted, what is derived, and one hypothesis that fails\n\n**Quoted, read at the page this session.** Ross G. Pinsky, *On the strange\ndomain of attraction to generalized Dickman distributions for sums of\nindependent random variables*, arXiv:1611.07207v3 (4 Jan 2017), sha256\n`0faf7919f6ca02429751cdba1d1ec48f701b78dc926dba5b19c0c2d2c6305d71`, pp. 2-3:\n`GD(theta)` is the law with Laplace transform\n`exp(theta int_0^1 (e^{-lambda x} - 1)/x dx)`, it is infinitely divisible, its\ndensity is `p_theta = e^{-theta gamma} rho_theta/Gamma(theta)` with (1.1)\n`rho_theta(x) = x^{theta-1}` on `(0,1]` and\n`x rho_theta' + (1-theta) rho_theta + theta rho_theta(x-1) = 0` for `x > 1`,\nits mean is `theta`, and `p_theta(x) <= C_theta/Gamma(x+1)` for `x >= 1`. This\nis `varE-spectral.md` §5's `f_theta` verbatim, now against a primary source\nrather than `lit-dickman-variance.md` §3's secondary statements, and it\nsupplies the two properties §4 needs: continuity of the law and boundedness of\nthe density.\n\n**A hypothesis that fails, and why the proof above is not a citation.**\nPinsky's Theorem 1(ii) (p. 6) and Theorem 2 (p. 7) are domain-of-attraction\ntheorems for exactly the shape of sum studied here,\n`W_n = M_n^{-1} sum_k B_k X_k` with `B_k` Bernoulli. Taking `X_k = mu_k = ln p_k`\nand `p_k = pi_{p_k}` gives `M_n ~ 2 ln y` and `W_n = D_y/2`, and the conclusion\n`W_n -> D_theta/theta` at `theta = 2` is exactly Theorem A. **But hypothesis\n(1.14) is not satisfied.** It requires `p_k mu_k/(mu_{k+1} - mu_k) -> theta`,\nand here that ratio is `2 ln p_k/(p_{k+1} - p_k) (1 + o(1))`, which oscillates\nwith the prime gaps and has no limit: it is `ln p_k` across a twin pair, where\nthe gap is 2, and near zero across a gap much longer than `ln p_k`. Theorem 2's `mu_{k+1} - mu_k ~ mu'(k)` fails for\nthe same reason. The aggregate Mertens behaviour is right and the pointwise\nspacing behaviour is not, which is why §2 proves the transform directly, using\nonly `sum_{p<=t} 1/p = lnln t + M + O(1/ln t)`. The citation is for\n`GD(theta)`'s definition and properties; the limit theorem for this particular\nBernoulli array is derived here.\n\n**Not novel, and not claimed as such.** `lit-dickman-variance.md` §0 records\nthat `GD(theta)` is published probability and that calling `lambda_theta(u) =\nPr[GD(theta) > u]` new would be wrong. Theorem A is the standard\nDickman/Goncharov convergence for an independent-prime model; the only thing\nspecific to this corpus is that the array's inclusion rate is `pi_p` rather\nthan `2/p`, and step (ii) of the proof shows the difference is summable.\nTheorem B and Theorem C are about `E[g]`, not about `D_y`, and whether either\nis in print at `theta = 2` was **not searched** in this pass;\n`lit-dickman-variance.md` §4's six calibrated channels found the `theta = 2`\nshort-interval variance asymptotic absent, with four legs owed, and that\nfinding is not extended here.\n\n## 9. What would falsify this, and whether the check has run\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| `E_Pi[1/n] = delta` | PROVEN, one line | a level where the product and `delta` differ | YES, nine levels, `<= 2.4e-15` relative (PART 0) |\n| `g(n) = 0` iff `n \\| L`; the `n \\| L` band is exactly inert and its mass vanishes | PROVEN | a nonzero `g` at `n \\| L`, or a non-vanishing `Pr[n\\|L]` | YES; the closed form and the enumerated `r_n = 0` nodes agree to the printed digit at nine levels (PART 1) |\n| `E[g] = P_> - R + B`, all four exact | PROVEN | a level where the recomposition misses `E[g]` | YES, nine levels, residual `0.0e+0` (PART 1) |\n| `ln n/ln y -> GD(2)`, transform rate `O_s(lnln y/ln y)` (Theorem A) | PROVEN | the exact transform failing to approach `GD(2)`'s, or the scaled error growing | YES, four `s` values on nine levels, error times `ln y/lnln y` bounded (PART 4) |\n| `E[g] -> lambda_2(u)` with **no** correction term (Theorem B) | PROVEN | an unbounded `GD(2)` density, or a transition contribution surviving the `eps` split | The density bound is Pinsky p. 2, read at the page. The numerical column of PART 3 is consistent and is not a proof of a limit |\n| `R` and `B` are `O(1/ln y)`, uniformly (Lemma C1, C2, Theorem C) | PROVEN, elementary | a level where `R ln y` or `B ln y` grows, or a local-bound constant that grows with `y` | YES on nine levels for all three: PART 2's `R ln y` and `B ln y`, PART 5's `sup_T ln y Pr[.]` |\n| the model's rate of approach to `lambda_2(2)` | MEASURED, NOT derived | nothing; no bound is claimed | The Esseen conversion of Theorem A's transform rate into a CDF rate is NOT DONE |\n| the exact model column at `x = 29, 31, 37` | PROVEN (exact enumeration) to the stated float floor | an independent computation disagreeing by more than that floor | YES. It agrees with the corpus's exact `delta*X_dec` at `x = 7..23` to every printed digit, and with `research/varE-exact-ladder-01.js`'s two independent routes at `x = 29, 31, 37` to `7.5e-8`, `3.2e-6`, `1.3e-5`, which is the floor and not a disagreement |\n| `lim Var/E = lambda_2(2) = 0.45546` | HEURISTIC, **one** open step | the decoupling replacement shifting the limit | NO. Step 1 is open; `varE-theta2-step.md` §5 measures it `O(1/ln y)` or better on six exact levels, which excludes growth and nothing finer |\n| Theorems A, B, C are novel | NOT CLAIMED | any statement of `lambda_theta` as a sifted-window limit at `theta > 1` | NO. Not searched in this pass. `lit-dickman-variance.md` §4's six channels found the `theta = 2` asymptotic absent with four legs owed, and that finding is not extended here |\n| the derivation has survived review | NO | an adversarial pass | NOT RUN. Written this session, HELD |\n\n## 10. Defects noticed in passing\n\nNothing below is applied; this note edits no other file.\n\n- `varE-spectral.md` §0's \"Two steps are unproven, and together they are the\n gap\", its §5 paragraph \"The passage above is the second open step\", its §8\n \"item 9 needs both closed\", its §11 limit row \"HEURISTIC, two open steps\",\n and its ledger `verdict:` field all count two open steps. One is left.\n Replacement wording is in §7 above.\n- `varE-spectral.md` §4's conductor table gives the `n <= L` row as\n \"`O(1/ln W)`: moves the drift, not the limit\" with the note's own text saying\n it is \"**not** evaluated here\". It is proven `O(1/ln y)` in §5 above and\n measured in §6, so the row can carry a proof and a coefficient instead of an\n assertion.\n- `varE-spectral.md` §11's row \"the drift family is a series in `1/ln W` |\n HEURISTIC | ... | NO. The `n <= L` band that carries the `1/ln W` coefficient\n is not evaluated\" needs splitting: the band **is** now evaluated, and the\n drift-family claim is **still** not derived, because the rate at which\n `Pr[D_y > u_y]` approaches `lambda_2(u)` is not bounded here.\n- `varE-spectral.md` §6a's model column is Monte Carlo at every level. Exact\n values now exist at all nine; §6 above prints them.\n- `lit-dickman-variance.md` §9's row \"`GD(theta)` is published and\n `varE-spectral.md` §5's `f_theta` is its density | PROVEN from secondary\n statements | ... | YES against two independent secondary statements of the\n density and the mean; **NO** against a primary\" can be raised: Pinsky\n arXiv:1611.07207v3 pp. 2-3 was read at the page this session and states the\n Laplace transform, the density `e^{-theta gamma} rho_theta/Gamma(theta)`, the\n delay equation (1.1), the mean `theta`, and the decay bound. The sha256 is in\n §8.\n- `research/QUESTIONS.md` item 9's row says the limit \"stays HEURISTIC with\n varE-spectral's second step, its own limit theorem, still open\". It is\n generated from the ledger blocks, so it takes no hand edit; regenerate.\n- The TODO item 9 brief drafted in `applied-0828-varE.md` §5 says \"TWO open\n steps: the theta = 2 mean-coefficient replacement and the model's own limit\n theorem\". One.\n\n---\n\n*History layer: process record, staging. See `research/history/CHANGELOG.md`\nfor the corpus rule. This note edited no other file and ran no git command.*\n"},"research/history/staging/varE-spectral.md":{"lf_sha256":"6e35cd6ebe08bdd3ed57429ea88c40363b47a95558e65799beaccc7b6a67c70b","content":"# The spectral form pushed to a limit: two unproven steps, a closed constant, and why 0.611 was an artefact\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `verify-0830-record-defects.md` §1.3 item 5 and\n> `attack-0830-varE-identification.md`).** \"TWO open steps\" in this note's\n> ledger and §0 reads ONE: `varE-limit-theorem.md`'s ledger states \"Step 2 of\n> the two is CLOSED: the decoupled model's limit is exactly Pr[GD(2) > u] with\n> NO correction term\", and the identification step IS the θ = 2 replacement\n> error (`varE-theta2-step.md` §1). Whether that theorem survives review is\n> its own HELD status.\n\n*Staging note, 2026-08-28. TODO item 9, second pass. Producer:\n`research/history/staging/varE-spectral.js` (embedded, `--check` clean, 3.2 s).\nReads `research/history/staging/varE-asymptotic.md` (the sibling pass of the\nsame day) and `paper/variance-note.md` §§6-7. The nine exact diagonal points\nare read from `variance-note.md` §7 and are recomputed nowhere here.*\n\n## 0. Verdict, disconfirming half first\n\n**Two steps are unproven, and together they are the gap.** The evaluation below\nreplaces the local Fourier coefficient $\\hat f_p(\\nu)$ by its mean over the\n$p-1$ nonzero frequencies, which is an identity at one excluded class and false\npointwise at two, which is the comb's case; where the error can be computed\nexactly it is 15% at $x = 7$ and 4% at $x = 11$ (reading 1), and nothing here\nproves it shrinks. Separately, the passage from the decoupled sum to\n$\\Pr[GD(2) > u]$ is a limit theorem about the model that is asserted and not\nderived here: it needs the convergence of $\\ln n/\\ln y$ to $GD(2)$, which is\nroutine and unwritten, and it needs the $n \\le L$ band to vanish, which §4\nstates as $O(1/\\ln W)$ and does not evaluate. Everything downstream is\nHEURISTIC and stands or falls with both.\n\n**And no computed level reaches the constant.** The model itself sits at 0.402\nat $x = 41$ against its own limit 0.4555, so the constant rests on the second\nstep above and not on data.\n\n**Nothing here touches the conjecture.** Var/E is a statement about a uniformly\nrandom window. `variance-note.md` §4 already records that this says nothing\nabout the one anchored window the twin problem needs.\n\nWith that said, what the pass produced:\n\n- **PROVEN, and newly checked.** The spectral form\n $X = \\sum_{\\nu \\ne 0 \\bmod M} \\hat W(\\nu) K_L(\\nu/M)$ reproduces the sibling's\n brute-forced $X(210) = 4.612929$ to $2.9\\times10^{-7}$, but only with the CRT\n twist $\\nu_p = \\nu\\,(M/p)^{-1} \\bmod p$. Without it the sum is 4.441347 while\n the total-mass check $\\sum_{\\nu\\ne0}\\hat W = 1/\\delta - 1$ still passes, so\n that check does not catch the omission (§1, reading 2).\n- **PROVEN given the decoupling step.** The decoupled spectral sum collapses to a\n single expectation over a random divisor,\n $\\delta X = \\mathbb{E}\\big[\\{L/n\\}(1-\\{L/n\\})\\,n/L\\big]$ with each prime\n $p \\le y$ present independently with probability $(p-\\alpha_p)/(p-1)$ (§3).\n Fact B falls out of it, not into it.\n- **HEURISTIC.** $\\lim \\operatorname{Var}/\\mathbb{E} = \\lambda_2(u)$, the tail of\n the generalized Dickman law $GD(2)$, and at the diagonal $u = 2$\n $$\\lambda_2(2) \\;=\\; 1 - e^{-2\\gamma}\\Big(\\tfrac92 - 4\\ln 2\\Big) \\;=\\; 0.45545648,$$\n equivalently $\\lim X/\\ln^2 W = \\lambda_2(2)/\\kappa = 0.410$ (§5).\n- **MEASURED, 22 points, no fitted parameter.** The model reproduces the nine\n diagonal points to $\\le 0.0029$ for $x \\ge 13$, §6's six-point $u$-sweep at\n $y = 401$ to $\\le 0.018$, and §6's seven-point $u = 2$ level sweep to\n $\\le 0.005$ (§6). The §6a model column is Monte Carlo; against an exact model\n column the residuals at $x = 13..23$ are $+0.00291$, $+0.00130$, $+0.00050$,\n $+0.00063$ (`redteam-0828-varE.md` §6), all positive, and at $x \\ge 29$ they\n sit at the quantisation floor of the measured column. The model is close and\n is not exact.\n- **REFUTED, as an inference, on both halves of the protocol.** §7's argument\n that the limit is near 0.611 because $a + b/\\ln\\ln W$ beats $a + b/\\ln W$ does\n not survive a control. Run on the model, a sequence that tracks the measured\n data to 0.003 and whose limit is 0.455456 by construction, the same in-sample\n protocol returns intercept 0.6164 from $1/\\ln\\ln W$ and 0.4468 from $1/\\ln W$\n on an exact model column (`redteam-0828-varE.md` §4): same winner, same\n margin, same two numbers the data give (0.6108 and 0.4454). The frozen\n out-of-sample half, which this note's own control does not run, fails on the\n control too: fitted on $x = 13..31$ and frozen, $1/\\ln\\ln W$ forecasts the\n model at $x = 37$ with residual $-0.00039$ against $1/\\ln W$'s $+0.00276$.\n Neither the in-sample winner nor the forecast separation is evidence about\n the limit on this range (§7).\n\n## 1. The spectral form, restated exactly, and checked\n\nNotation as in `variance-note.md` §7 (Corollary 3). Let $\\alpha_p$ be the number\nof comb classes surviving at $p$: $\\alpha_2 = \\alpha_3 = 1$, $\\alpha_5 = 2$ (the\nteeth 11, 17 mod 30 are 1, 2 mod 5), $\\alpha_p = p-2$ for $7 \\le p \\le y$; so\n$\\delta = \\prod_{p\\le y}\\alpha_p/p$. Write $W(d) = \\prod_{p \\le y} f_p(d)$ with\n\n$$f_p(d) \\;=\\; \\frac{p\\,\\rho_p(d)}{\\alpha_p^{2}},\\qquad\n\\hat f_p(0) = 1, \\qquad\n\\hat f_p(\\nu \\ne 0) \\;=\\; \\frac{\\big|\\sum_{a \\in E_p} e(\\nu a/p)\\big|^{2}}{\\alpha_p^{2}} \\;\\ge\\; 0,$$\n\nwhere $E_p$ is the excluded set: $E_p = \\{0,-2\\}$ for $p \\ge 7$, giving\n$\\hat f_p(\\nu) = (2 + 2\\cos(4\\pi\\nu/p))/(p-2)^2$, which is the sibling's §4\nlocal factor. Then, with $K_L$ the Fejér kernel,\n\n$$\\boxed{\\ X(L) \\;=\\; \\sum_{\\nu \\ne 0 \\bmod M} \\hat W(\\nu)\\,K_L(\\nu/M),\n\\qquad \\hat W(\\nu) = \\prod_{p \\le y} \\hat f_p\\big(\\nu\\,(M/p)^{-1} \\bmod p\\big). \\ }$$\n\n**The twist is not decoration.** Coding $\\hat W(\\nu)$ as $\\prod_p \\hat f_p(\\nu \\bmod p)$\ngives 4.441347 at $x = 7$ against the true 4.612929, a 3.7% error, while leaving\n$\\sum_{\\nu\\ne0}\\hat W(\\nu) = 29.333333 = 1/\\delta - 1$ intact, because the twist\npermutes frequencies within each conductor. With the twist the sum agrees with\nthe sibling's brute force to $2.9\\times10^{-7}$ (PART 0). Any future spectral\ncomputation in this corpus should carry this check.\n\nThe two exact facts the sibling proved are used unchanged:\n$\\sum_{\\nu \\ne 0 \\bmod q} K_L(\\nu/q) = r_q(q-r_q)/L$ with $r_q = L \\bmod q$\n(Fact A), hence $q \\mid L$ contributes exactly zero (Fact B).\n\n## 2. The decoupling step, named and priced\n\nDefine the mean local coefficient\n\n$$\\gamma_p \\;:=\\; \\frac{1}{p-1}\\sum_{\\nu \\ne 0} \\hat f_p(\\nu)\n\\;=\\; \\frac{p/\\alpha_p - 1}{p-1} \\;=\\; \\frac{p-\\alpha_p}{\\alpha_p\\,(p-1)},$$\n\nso $\\gamma_p = 2/((p-1)(p-2))$ for $p \\ge 7$, $\\gamma_5 = 3/8$, $\\gamma_2 = \\gamma_3 = 1$.\n\n**DECOUPLING (unproven).** Replace $\\hat f_p(\\nu_p)$ by $\\gamma_p$ at every\n$\\nu_p \\ne 0$.\n\nTwo things are worth saying about this step before anything is built on it.\n\n1. **It is exact at one excluded class.** If $|E_p| = 1$ then\n $\\hat f_p(\\nu \\ne 0) = 1/\\alpha_p^2$, a constant, and the replacement changes\n nothing. That is the rough-integer case, and it is why the corresponding\n asymptotic is a theorem in print (§9). At $|E_p| = 2$ the coefficient\n $(2+2\\cos(4\\pi\\nu/p))/(p-2)^2$ ranges over $[0, 4/(p-2)^2]$ with mean\n $2/((p-1)(p-2))$, a factor $(p-2)/(2(p-1)) \\approx 1/2$ below its maximum at\n every prime. **This one factor per prime is the missing log** the sibling's\n §3 could not find: bounding by the maximum gives the weight $4^{\\omega(q)}$\n and $\\sum_{q\\le Q}4^{\\omega} \\asymp Q\\ln^3 Q$, hence the refuted\n $X \\asymp \\ln^3 W$; using the mean gives $2^{\\omega(q)}$ and\n $\\sum_{q \\le Q} 2^{\\omega} \\asymp Q \\ln Q$, hence $\\ln^2 W$.\n2. **Its error is measured only twice.** Full divisor enumeration (PART 2) gives\n $X_{\\rm dec} = 5.405185$ against $X = 4.612929$ at $x = 7$, and\n $15.694986$ against $15.0751$ at $x = 11$: true/model $= 0.8534$ and\n $0.9605$. Two points, both at the bottom of the range, both with the model\n *above* the truth. At $x \\ge 13$ the model sits slightly *below* the measured\n data (§6), so the error changes sign somewhere in $11 < x < 13$ and no\n monotone statement about it is available.\n\nThe heuristic reason to expect the step to be harmless asymptotically: the\nFejér weight concentrates on $|\\nu| \\lesssim M/L$, and the conductors carrying\nthe mass have $\\ln q \\approx \\ln L$ (§4), while $M/L$ has 194188 digits at\n$x = 31$ (`natal-cap-16` reading 2). Equidistribution of $\\nu \\bmod q$ over a\nrange astronomically longer than $q$ is exactly what the step needs. It is not\nproven, and no attempt is made here to prove it.\n\n## 3. What the decoupled sum evaluates to\n\nUnder the replacement, $\\prod_p \\hat f_p$ becomes\n$\\prod_p\\big[\\gamma_p + (1-\\gamma_p)\\mathbf 1[\\nu_p = 0]\\big]$. Expanding over\nthe subset $e$ of primes where the second term is taken and using Fact A with\n$n = M/e$,\n\n$$X_{\\rm dec} \\;=\\; \\frac{1}{L}\\,\\mathbb{E}_\\Theta\\big[\\,r_n(n-r_n)\\,\\big],\n\\qquad r_n = L \\bmod n,$$\n\nwhere $\\Theta$ makes each prime $p \\le y$ a factor of $n$ independently with\nprobability $\\gamma_p$. Two exact consequences:\n\n- $\\mathbb{E}_\\Theta[n] = \\prod_{p\\le y}\\big(1+\\gamma_p(p-1)\\big) = \\prod_{p\\le y} p/\\alpha_p = 1/\\delta$,\n checked at $x = 7$ (PART 1).\n- Size-biasing by $n$ preserves independence and turns $\\gamma_p$ into\n $\\pi_p = \\gamma_p \\alpha_p = (p-\\alpha_p)/(p-1)$, the number of excluded\n classes divided by $p-1$. Hence\n\n$$\\boxed{\\ \\frac{\\operatorname{Var}}{\\mathbb{E}} \\;\\approx\\;\n\\mathbb{E}\\Big[\\Big\\{\\tfrac{L}{n}\\Big\\}\\Big(1-\\Big\\{\\tfrac{L}{n}\\Big\\}\\Big)\\frac{n}{L}\\Big],\n\\qquad \\Pr[\\,p \\mid n\\,] = \\pi_p = \\frac{p-\\alpha_p}{p-1}\\ \\text{independently}. \\ }$$\n\nFact B is now automatic: $n \\mid L$ forces $\\{L/n\\} = 0$. The diagonal's\narithmetic input is inside the formula rather than a correction to it.\n\n## 4. The conductor groups, and where the growth lives\n\nRead off the three groups directly from $r_n(n-r_n)/L$:\n\n| group | value of the statistic | total after $\\times\\,\\delta$ |\n|---|---|---|\n| $n \\mid L$ (all prime factors $\\le x$, since $L = x\\#$) | exactly 0 | 0, exactly |\n| $n \\le L$, $n \\nmid L$ | $\\le n^2/4L$ | $O(1/\\ln W)$: moves the drift, not the limit |\n| $n > L$ | $r_n = L$, statistic $= n - L$ | the whole limit |\n\nThe task's guess for the third row is right: for $n > L$ the statistic is\nexactly $n - L$, which after size-biasing is $(1 - L/n)$. The second row is the\nband near $L$; bounding it by $n^2/4L$ and summing $2^{\\omega(n)}$ gives\n$O(\\ln W)$ before the $\\delta$, so it is a $1/\\ln W$ correction and is **not**\nevaluated here. That is the reason the drift *coefficient* below is not derived\neven though the limit is.\n\nThe growth rate follows without any further work. Because\n$\\mathbb{E}_\\Theta[n] = 1/\\delta$ exactly and $\\delta \\ln^2 W \\to \\kappa = 1.109905$\n(sibling §2, PROVEN), and because the fraction of that expectation sitting above\n$L$ is bounded away from 0 and 1, $X$ is $\\asymp \\ln^2 W$ with an order-one\nconstant. So of the three shapes the task asks about, the answer is the first:\n$X = c\\ln^2 W\\,(1 + O(1/\\ln W))$, never $\\ln^2 W \\ln\\ln W$ and never\n$\\ln^3 W$. The corrections enter through $\\ln y$-sized offsets in $\\ln n$\nagainst $\\ln L$, all of relative size $1/\\ln y = 2/\\ln W$, so **the drift family\nis a series in $1/\\ln W$**, which is the principled reason the sibling's §8 row\nrecorded as missing.\n\n## 5. The limit, and the constant\n\n$\\ln n = \\sum_{p \\le y}\\mathbf 1_p \\ln p$ with $\\Pr = \\pi_p$. Since\n$\\pi_p = 2/(p-1)$ for $p \\ge 7$, Mertens gives\n$\\mathbb{E}[\\ln n] = 2\\ln y + O(1)$ and $\\operatorname{Var}[\\ln n] = \\ln^2 y\\,(1+o(1))$:\nthe threshold $\\ln L = u \\ln y$ sits at the mean when $u = 2$, and the\ndistribution does not concentrate. Its Laplace transform is\n\n$$\\mathbb{E}\\big[e^{-s\\ln n/\\ln y}\\big] \\;\\longrightarrow\\;\n\\exp\\Big(\\theta\\!\\int_0^1 \\frac{e^{-sw}-1}{w}\\,dw\\Big),\\qquad \\theta = |E_p| = 2,$$\n\nthe **generalized Dickman law** $GD(\\theta)$, with density $f_\\theta$ satisfying\n$f_\\theta(t) = e^{-\\theta\\gamma}t^{\\theta-1}/\\Gamma(\\theta)$ on $(0,1]$ and\n$t f_\\theta'(t) = (\\theta-1)f_\\theta(t) - \\theta f_\\theta(t-1)$ beyond. And\n$(1 - L/n)^{+} \\to \\mathbf 1[\\ln n > \\ln L]$. Hence\n\n$$\\lim \\frac{\\operatorname{Var}}{\\mathbb{E}} \\;=\\; \\lambda_\\theta(u) \\;:=\\; \\Pr\\big[GD(\\theta) > u\\big],\n\\qquad u = \\frac{\\ln L}{\\ln y},\\ \\ \\theta = \\text{excluded classes per prime}.$$\n\nFor $\\theta = 2$, $f_2(t) = e^{-2\\gamma}t$ on $(0,1]$ and\n$f_2(t) = e^{-2\\gamma}\\big[t(3-2\\ln t) - 2\\big]$ on $(1,2]$, so\n\n$$\\lambda_2(2) \\;=\\; 1 - e^{-2\\gamma}\\Big(\\tfrac12 + 4 - 4\\ln 2\\Big)\n\\;=\\; 1 - e^{-2\\gamma}\\Big(\\tfrac92 - 4\\ln 2\\Big) \\;=\\; 0.45545648,$$\n\nclosed form and numeric delay-equation solution agreeing to $10^{-8}$ (PART 3),\nwith $\\int f_2 = 1$ and mean $= 2$ to eight decimals as they must be. Equivalently\n$\\lim X/\\ln^2 W = 0.45545648/1.109905 = 0.410$.\n\nThe tail at the other exponents, which §6 of the note can test:\n\n| $u$ | 0.6 | 1.0 | 1.5 | 2.0 | 2.5 | 3.0 |\n|---|---|---|---|---|---|---|\n| $\\lambda_2(u)$ | 0.9433 | 0.8424 | 0.6571 | 0.4555 | 0.2820 | 0.1577 |\n\n**The passage above is the second open step.** Both arrows are asserted rather\nthan derived here: the convergence of $\\ln n/\\ln y$ to $GD(2)$ is routine and is\nnowhere written down in this note, and $(1 - L/n)^{+} \\to \\mathbf 1[\\ln n > \\ln L]$\nneeds §4's $n \\le L$ band to vanish, which §4 states as $O(1/\\ln W)$ and does\nnot evaluate. The constant is no stronger than that step\n(`redteam-0828-varE.md` §0).\n\n**Convergence, checked.** The model's leading part at $u = 2$ climbs\n0.32116, 0.35378, 0.37271, 0.38660, 0.39357, 0.39838 over\n$\\ln y = 6.9 \\ldots 16.7$, and its own $a + b/\\ln y$ fit returns 0.45285 against\nthe closed form 0.455456 (PART 4b). So the model does converge where it is\nclaimed to, and it does so slowly: at $x = 41$ it is still 0.053 short.\n\n## 6. Against the data: 22 points, no fitted parameter\n\nThe model has no free parameter. Its inputs are $\\alpha_p$, $y$ and $L$.\n\n**6a. The nine diagonal points** (`variance-note.md` §7), model by Monte Carlo,\n$N = 4\\times10^5$, s.e. $\\approx 7\\times10^{-4}$:\n\n| $x$ | 7 | 11 | 13 | 17 | 19 | 23 | 29 | 31 | 37 |\n|---|---|---|---|---|---|---|---|---|---|\n| measured | 0.1521 | 0.2563 | 0.2995 | 0.3268 | 0.3473 | 0.3643 | 0.3774 | 0.3876 | 0.3958 |\n| model | 0.17850 | 0.26744 | 0.29750 | 0.32579 | 0.34637 | 0.36214 | 0.37695 | 0.38740 | 0.39566 |\n| residual | $-0.0264$ | $-0.0111$ | $+0.0020$ | $+0.0010$ | $+0.0009$ | $+0.0022$ | $+0.0005$ | $+0.0002$ | $-0.0006$ |\n\nLead with the bad part: at $x = 7$ and $x = 11$ the model is wrong by 17% and\n4% relative, exactly the decoupling error of §2, and at $x \\ge 13$ the seven\nresiduals average $+0.0009$, roughly 3 sigma of the pooled MC noise. The model\nis not exact anywhere. It is within 0.0022 everywhere from $x = 13$ up.\n\n**6b. §6's $u$-sweep at $y = 401$**, a different object (set $A$, all three\nmod-30 houses, $\\alpha_5 = 3$) and a different question. Model against the note:\n\n| $u$ | 0.6 | 1.0 | 1.5 | 2.0 | 2.5 | 3.0 |\n|---|---|---|---|---|---|---|\n| note §6 | 0.845 | 0.685 | 0.477 | 0.290 | 0.157 | 0.076 |\n| model | 0.8543 | 0.7025 | 0.4842 | 0.2927 | 0.1576 | 0.0764 |\n\nThe note's empirical regularity 1, $\\ln(\\operatorname{Var}/\\mathbb{E}) \\approx -(0.24u^2+0.13u)$,\nis a two-parameter fit to a curve the model returns with none, and the model's\nnormalization $\\lambda_2(0) = 1$ is the note's own observed $\\to 1$ as $u \\to 0$.\n\n**6c. §6's $u = 2$ level sweep**, model against the note:\n\n| $y$ | 97 | 199 | 401 | 797 | 1009 | 1499 | 2003 |\n|---|---|---|---|---|---|---|---|\n| note §6 | 0.251 | 0.281 | 0.290 | 0.303 | 0.307 | 0.317 | 0.321 |\n| model | 0.2541 | 0.2810 | 0.2944 | 0.3061 | 0.3095 | 0.3196 | 0.3232 |\n\n## 7. What this does to the 0.611 reading\n\n`variance-note.md` §7 concludes that the limit is near 0.611 because, on the\nfrozen-coefficient forecast at $x = 37$, $a + b/\\ln\\ln W$ beat $a + b/\\ln W$ by\na factor ten, and because it refits with a stable intercept. The sibling's §5\nalready showed the fit sets are misdescribed and that two more forms fit as\nwell with intercepts 0.5366 and 0.7198, and recorded that no principled reason\nto prefer one intercept was known.\n\nHere is one, and it is a control rather than an argument. The nine model values\nof §6a form a sequence whose limit is $0.455456$ **by construction**, and which\ntracks the measured data to 0.003 over the range where the data live. Running\nthe note's own protocol on it (fits on $x = 13..37$), with the model column\nrebuilt exactly at $x = 13, 17, 19$ and by Monte Carlo at $N = 2\\times10^{7}$\nelsewhere (`redteam-0828-varE.md` §4; this note's own PART 6b column is Monte\nCarlo at $N = 4\\times10^{5}$ and reads 0.6151 and 0.4463, inside its own noise):\n\n| form | intercept on the model | bias vs 0.455456 | intercept on the measured | measured minus bias | $\\|c\\|_1$ | gap vs its bound |\n|---|---|---|---|---|---|---|\n| $a + b/\\ln W$ | 0.4468 | $-0.0086$ | 0.4454 | 0.4540 | 2.60 | $0.0014 \\le 0.0076$ |\n| $a + b/\\ln\\ln W$ | 0.6164 | $+0.1609$ | 0.6108 | 0.4499 | 6.91 | $0.0056 \\le 0.0201$ |\n| $a + b/\\sqrt{\\ln W}$ | 0.5402 | $+0.0848$ | 0.5366 | 0.4518 | 4.96 | $0.0036 \\le 0.0144$ |\n| $a + b/\\ln W^{1/3}$ | 0.6337 | $+0.1783$ | 0.6279 | 0.4496 | 7.43 | $0.0059 \\le 0.0216$ |\n| $a + b\\cdot$(inert Mertens share) | 0.7281 | $+0.2727$ | 0.7198 | 0.4471 | 9.83 | $0.0083 \\le 0.0286$ |\n| $a + b/(\\ln W\\ln\\ln W)$ | 0.4219 | $-0.0336$ | 0.4211 | 0.4546 | 2.03 | $0.0008 \\le 0.0059$ |\n| $a + b/\\ln\\ln^2 W$ | 0.4833 | $+0.0278$ | 0.4809 | 0.4531 | 3.48 | $0.0023 \\le 0.0101$ |\n\n**The frozen half, run on the same control.** `variance-note.md` §7 leans\nhardest on the other protocol: fit on the early points, freeze the\ncoefficients, forecast $x = 37$. The control above does not run it;\n`redteam-0828-varE.md` §4 does, fitting on $x = 13..31$:\n\n| form | model forecast at $x = 37$ | model residual | data forecast | data residual |\n|---|---|---|---|---|\n| $a + b/\\ln W$ | 0.39281 | $+0.00276$ | 0.39259 | $+0.00321$ |\n| $a + b/\\ln\\ln W$ | 0.39596 | $-0.00039$ | 0.39567 | $+0.00013$ |\n\nThe model's own value at $x = 37$ is $0.395567 \\pm 0.000106$, so the $-0.00039$\nis resolvable. On a sequence whose limit is 0.455456 by construction the frozen\n$1/\\ln\\ln W$ forecast beats $1/\\ln W$ by a factor 7, in the same direction and\nat the same ordering as the data's factor 25. So §7's out-of-sample argument\ncarries no information about the limit either, and the refutation covers both\nhalves of the protocol rather than one.\n\nThree readings, in order of how much they are worth.\n\n1. **The winner is the same and the intercept is wrong.** On the control,\n $1/\\ln\\ln W$ wins in-sample (rms $8.99\\mathrm{e}{-4}$ against\n $2.26\\mathrm{e}{-3}$) and its intercept misses the known limit by $+0.161$.\n So on data of this shape and this range, \"the $1/\\ln\\ln W$ form fits best\"\n carries no information about the limit. This is MEASURED, and it refutes the\n §7 inference as a method, not the number 0.611 as a fact.\n2. **Every form's bias transfers.** Each form's intercept on the model sits\n within 0.009 of its intercept on the measured data, across a range of\n intercepts from 0.42 to 0.73. That is the sense in which the control is the\n right control.\n3. **Bias-corrected the seven forms agree, and the agreement is mostly forced.**\n Removing each form's control bias from its measured intercept gives 0.4540,\n 0.4499, 0.4518, 0.4496, 0.4471, 0.4546, 0.4531: a spread of 0.0075 around\n $\\lambda_2(2) = 0.455456$, against an uncorrected spread of 0.3062. That\n spread is not evidence for the constant. The intercept is a linear functional\n $a = \\sum_i c_i y_i$ with $\\sum_i c_i = 1$, so the corrected column is\n $0.455456 + (a_{\\rm data} - a_{\\rm model})$ and its width is bounded a priori\n by $\\|c\\|_1 \\cdot \\max_i |{\\rm data} - {\\rm model}|$. With\n $\\max|{\\rm data} - {\\rm model}| = 0.00291$ and $\\|c\\|_1$ between 2.03 and\n 9.83 that bound runs 0.0059 to 0.0286, and every observed gap sits inside it\n (`redteam-0828-varE.md` §4). So the last column restates that the model\n tracks the data pointwise, and it is neither an independent measurement of\n the constant nor a check that could have failed.\n\n## 8. Item 9, and the registered $x = 41$ forecast\n\n**What item 9 gets.** A candidate limit with a mechanism and a closed form,\n$\\lambda_2(2) = 1 - e^{-2\\gamma}(9/2 - 4\\ln 2) = 0.45546$, at HEURISTIC rung; a\nderived reason the drift family is $1/\\ln W$ and not $1/\\ln\\ln W$; an\nexplanation of the sibling's refuted $\\ln^3 W$ as the mean-versus-maximum of one\nlocal coefficient; and a control that explains where 0.611 came from. What it\ndoes not get is a proof: §2's replacement is open and so is §5's limit theorem\nfor the model, and item 9 needs both closed.\n\n**$x = 41$.** The model predicts $0.402364 \\pm 0.000075$ (MC, $N = 2\\times10^{7}$,\ntwo seeds, `redteam-0828-varE.md` §4). `var41-prereg.md` registers\n$[0.4013, 0.4040]$; the model is inside it and near its middle. So the tenth\npoint does not test the model either, and the sibling's finding stands\nunchanged: $x = 41$ retires the one-term $1/\\ln W$ form (0.39941) and separates\nnothing else. The surviving forecasts 0.40296, 0.40309, 0.40408, 0.40500 are now\njoined by a fifth, 0.40236, which is the only one carrying a derivation rather\nthan a fit.\n\n## 9. Prior art: this is Gorodetsky's convention at two classes\n\nRun the same construction with **one** excluded class per prime and it gives\n$\\lambda_1(u) = e^{-\\gamma}\\int_u^\\infty \\rho$, numerically 0.663124, 0.438541,\n0.218559, 0.093970, 0.035636, 0.012095 at $u = 0.6 \\ldots 3$ (PART 3). That is\nGorodetsky's $\\lambda(u)$ for the variance of $y$-rough integers in short\nintervals (*Math. Z.* **308** (2024) no. 4, Paper 59, arXiv:2111.00853, Thms\n1.1/1.3), and $\\mathbb{E}[\\{L/n\\}(1-\\{L/n\\})\\,n/L]$ is his\n$\\sum_n g_y(n)\\{H/2n\\}(1-\\{H/2n\\})$ in the corpus's variables.\n\nTwo consequences, one of them a caution.\n\n- The $\\theta = 1$ case of §5 is **published and proven, and the identification\n is an exact identity rather than a numerical match.** Every $n$ is even, since\n $\\pi_2 = 1$; writing $n = 2n'$ turns the decoupled sum into his (1.5) and (1.6)\n term by term, checked at $(y,H) = (13,210), (13,2310), (29,30030)$ to relative\n $1.7\\times10^{-16}$. His Lemma 1.5 gives $V_{q_y}(H) = M(H,y)$ exactly for a\n primorial window, which is this corpus's window, with no hypotheses, and his\n Theorem 1.3(1) then gives $M \\sim H P_y \\lambda(u)$ for\n $y \\ge \\exp((\\log\\log H)^{5/3+\\varepsilon})$, which the diagonal satisfies\n (`lit-dickman-variance.md` §1, `redteam-0828-varE.md` §3). So at $\\theta = 1$\n the whole chain from the exact finite-level variance to $\\lambda_1(u)$ is a\n published theorem about exactly this object. Its value to $\\theta = 2$ is\n limited and should be stated as such: the reason §2's step is invisible at one\n class is that the local coefficient is constant there,\n $\\hat f_p(\\nu \\ne 0) = 1/(p-1)^2 = \\gamma_p$ identically, and that says\n nothing about $\\theta = 2$, where the step is the gap.\n- **This route is not novel.** The owning convention is\n \"the variance of integers without small prime factors in short intervals\" with\n coordinate $u = \\log H/\\log y$, exactly as `research/SEARCH-CONVENTIONS.md`\n records it via `import-rough-anatomy.md` §8. What is not in print, as far as\n this pass knows, is the two-class value $\\lambda_2$, and this pass did not\n search for it. The Gorodetsky paper has since been read at source\n (`lit-dickman-variance.md` §1, `redteam-0828-varE.md` §7): it is $\\kappa = 1$\n only, with zero occurrences of `tuple`, `twin`, `admissible`, `generalized`,\n `dimension` and `Poisson` in its full text. Whether a successor states the\n $k$-tuple version is still **NOT CHECKED**, with four channels owed, and it\n should be checked before anything is claimed as new. Aryan\n (arXiv:1302.2296) is the nearest neighbour found so far: his Lemma 1.2 is this\n object at general tuple size, with an upper bound and no asymptotic\n (`lit-dickman-variance.md` §2).\n\n## 10. Defects noticed in passing\n\n- `paper/variance-note.md` §7's closing sentence (\"the live hypothesis is\n $\\lim = 0.611$ ... the 0.44 reading is demoted\") rests on a model comparison\n that returns 0.6164 on a control whose limit is 0.455456, and on a frozen\n forecast separation that the same control reproduces while missing its own\n limit. The §7 sentence should be reversed, not softened. Its replacement\n sentence is drafted in `applied-0828-varE.md` §5; the live document is\n unedited.\n- `paper/variance-note.md` abstract (\"reduces the open question to the value of\n a single constant, near 0.611\") carries the same claim into the abstract.\n- The sibling's `varE-asymptotic.md` §8 row \"the intercept is not localized to\n 0.611 ... a principled reason to exclude ... NO. No such reason is known\" now\n has a reason on both halves of the protocol, and that note carries it.\n- Any spectral computation in this corpus that indexes $\\hat W$ by\n $\\nu \\bmod p$ rather than $\\nu (M/p)^{-1} \\bmod p$ is wrong by a permutation\n and will still pass a total-mass check. `natal-cap-29-sigma-plateau.js` STEP 2\n was **not** audited for this here.\n\n## 11. What would falsify this, and whether the check has run\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| $X = \\sum_{\\nu\\ne0}\\hat W(\\nu)K_L(\\nu/M)$ with the CRT twist | PROVEN | disagreement with brute force | YES, $x = 7$, $2.9\\mathrm{e}{-7}$ |\n| $\\delta X_{\\rm dec} = \\mathbb{E}[\\{L/n\\}(1-\\{L/n\\})n/L]$, $\\pi_p = (p-\\alpha_p)/(p-1)$ | PROVEN given decoupling | a level where the divisor sum disagrees with the MC | YES, $x = 7$ and 11, exact enumeration vs MC inside 1 s.e. |\n| the decoupling step is asymptotically harmless | CONJECTURED | a level where true/model stays away from 1 | PARTLY. Exact only at $x = 7$ (0.8534) and $x = 11$ (0.9605); at $x \\ge 13$ only indirectly, against the measured data, at $\\pm 0.002$ |\n| $\\lim \\operatorname{Var}/\\mathbb{E} = \\lambda_2(u)$, $\\lambda_2(2) = 0.45546$ | HEURISTIC, two open steps (§2's replacement, §5's limit theorem) | the model failing at a new level, or a proof that either step shifts the limit | NO. No level beyond $x = 37$ exists, and the model is 0.053 short of its own limit at $x = 41$ |\n| $\\lambda_1 = $ Gorodetsky's $\\lambda$ | PROVEN: an exact identity with his (1.5)/(1.6), and Lemma 1.5 makes the primorial window his own case | a $(y,H)$ where the two sums differ | YES, three pairs to relative $1.7\\mathrm{e}{-16}$, and the paper is read at source (`redteam-0828-varE.md` §3) |\n| the drift family is a series in $1/\\ln W$ | HEURISTIC | a derived $\\ln\\ln$ term in the model's expansion | NO. The $n \\le L$ band that carries the $1/\\ln W$ coefficient is not evaluated |\n| §7's fit-comparison does not estimate the limit, on either half of its protocol | MEASURED (control) | a control matching the data as well and reproducing its own limit in-sample AND on the frozen forecast | YES; in-sample PART 6b, the control matches to 0.003 and misses by $+0.161$; frozen forecast `redteam-0828-varE.md` §4, residual $-0.00039$ on a sequence whose limit is known |\n| the model's $x = 41$ value 0.402364 | MEASURED (forward, MC) | a measured $r(41)$ outside $0.4024 \\pm$ a few $10^{-3}$ | NO. Var(41) priced and declined, TODO item 2 |\n| this is novel | NOT CLAIMED | Gorodetsky or a successor stating the $k$-class $\\lambda_k$ | NO. Not searched. Do not call it new before that search |\n\nThe one line worth carrying out of this pass: the corpus should stop quoting\n0.611 and start quoting $\\lambda_2(2) = 0.45546$ as a **heuristic** candidate\nwith two open steps, together with the control that shows why 0.611 appeared,\non both halves of the protocol that produced it, and why no amount of further\nlevels of the present kind will settle it.\n"},"research/history/staging/varE-theta2-proof.md":{"lf_sha256":"8a4a3df5d6616b995824bedced5fd0f46b2fac90516b6044783ef6e77b939aea","content":"# The mixed lags, priced exactly: half the decoupling error is now unconditional, the other half is one logarithm short and the missing logarithm is named\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `verify-0830-record-defects.md` §1.3 item 2).** Where this note\n> reads \"loose by a factor 14 to 48 against the measured 2X2 = 5.3\" (§0, §3,\n> §5, §7), the measured group sum is 2X2 = 0.2694, 0.2314, 0.1846 at x = 13,\n> 17, 19 (the 5.3 was a doubled half-pattern), so the looseness is a factor\n> 511 to 1148; \"flat near 5.3, so the truth is O(1)\" reads \"O(1) and falling,\n> 0.27 → 0.18 over x = 13..19\"; and \"Xmix = −9.78 against ln y = 9.611\" reads\n> \"Xmix = −3.94 at x = 19 against ln y = 8.042, coefficient −0.49 on three\n> levels; x = 23 not recomputed\". The PROVEN status of the bound is untouched.\n\n*Staging note, 2026-08-28. Forward work on the first of the two open steps in\n`varE-spectral.md`, as narrowed by `varE-theta2-step.md`: does the decoupling\nerror `delta*(X - X_dec)` vanish on the diagonal. The second step, the model's\nown limit theorem, is a sibling's and is not touched here. Producer:\n`research/history/staging/varE-theta2-proof.js`. Reads\n`varE-theta2-step.md` for the six exact levels and the group split, and\n`varE-spectral.md` sections 1-3 for the model. Recomputes none of the six\n`Var/E` readings.*\n\n## 0. Verdict, the open half first\n\n**The mixed lags are still open, and this pass does not bound them.** No\ninequality below covers `Xmix`. What it does is price the obstruction: the only\nsplit the exact kernel offers, flat against active, has `delta*|flat|` rising\non every one of six levels (0.559, 0.912, 0.960, 1.087, 1.188, 1.301) against a\ntarget of zero, so every absolute-value route through that split is already\nlost at the levels that can be computed, and the derivation says it is lost by\none logarithm asymptotically.\n\n**The frequency-side hope is closed by identity, not by failure.** Every lag's\nphase sum, mixed or not, is exact and elementary: `R_n(c)` is a difference of\ntwo interval-overlap counts, with no error term and no equidistribution\nanywhere. Re-summing the surviving pieces returns the real-space sum term by\nterm. So the CRT-mixed lags carry no phase that \"averages out over `t`\", and\nthere is no exponential sum to estimate. Weil does not apply here and is not\nneeded; the residual difficulty is a counting statement about divisors, not an\noscillation statement.\n\n**The two propositions proved here have had no adversarial pass.** They are\nthis pass's own derivations, elementary, machine-checked only where a number is\nprinted. The campaign ledger's standing rate is four of five same-day\nintegrations needing correction within twelve hours. Treat them accordingly,\nand see the named weak steps in sections 3 and 4.\n\n**Nothing here touches the conjecture.** `variance-note.md` section 4 already\nrecords that `Var/E` over a uniformly random window says nothing about the one\nanchored window the twin problem needs.\n\nWith that said, what the pass produced:\n\n- **PROVEN, checked to 1.71e-13 on 4000 random triples.** The Fejer-weighted\n contribution of every lag is\n `R_n(c) = [(r-c)^+ + (r+c-n)^+ - r^2/n]/L` with `r = L mod n`; Fact A is its\n `c = 0` case; `|R_n(c)| <= min(1, n/L)`; and for `n > 2L`,\n `R_n(c) = (L - ||c||_n)^+/L - L/n` (section 1). The whole object rebuilds at\n `x = 7` from 192 (modulus, class) pairs to 4.612929 against the corpus\n 4.612929 (PART B).\n- **PROVEN, unconditional, no hypothesis.**\n `|2 X2| <= 60 prod_{7<=p<=y} p(p-3)/(p-2)^2 = O(ln y) = o(1/delta)`. The two\n pure `+-2` shift groups therefore leave the open list. The bound is loose by\n 14 to 48 against the measured `2X2 = 5.3` at six levels (section 3, PART D).\n- **PROVEN here, unreviewed, and numerically vacuous at every computed level.**\n `delta*(X1 - X_dec) -> 0` unconditionally, at rate `O((ln ln y)^{-1/4})`, by\n the monotone coupling of the two product measures, `A_tot = B_tot` exactly,\n and Kolmogorov-Rogozin anti-concentration for `ln n`. This removes the `c = 0`\n half's dependence on `varE-spectral` section 5's own unproven limit theorem.\n The rate factor is 0.815 at `x = 23`, so the proposition explains none of the\n six measured rows (section 4).\n- **MEASURED, exact, six levels.** The flat/active split of `X`:\n flat -16.970 to -433.802, active +21.583 to +555.281, against `X` 4.61 to\n 121.48, with `|flat|/X` between 3.21 and 3.68 and `delta*|flat|` rising\n throughout (section 2, PART C2).\n- **MEASURED, exact, six levels.** The equidistribution-free flat half of the\n mixed group, `Phi`, runs 0.3765 to 6.3689 with local exponent 2.6 then 2.5 in\n `ln y`: consistent with `ln^3 y` approached slowly, not with `ln^2 y`\n (section 5, PART C).\n- **NOT CHECKED.** Whether the divisor-distribution estimate of section 6 is\n available in the literature. No search has been run. Do not call this\n reduction new.\n\n**Where that leaves 0.45546.** Still HEURISTIC, and still resting on both open\nsteps, but the first step is now smaller than it was. Of the three groups the\ndecoupling error splits into, two are closed unconditionally and one, the\nCRT-mixed lags, is open with the obstruction named. The sibling's attack on the\nsecond step, the model's own limit theorem, is what the *value* 0.45546 needs;\nthis note's remaining gap is what the *vanishing* of the replacement error\nneeds. Both are required, and neither is finished.\n\n## 1. The exact lag kernel\n\n`varE-theta2-step.md` section 2 leaves the object in the form: the exact\nconductor-`n` term is `sum_{r,r' in E_n} T_n(r-r')`, a sum over `3^omega(n)`\nlags of the Fejer autocorrelation `T_n(d)`, of which two are the clean\n`d = +-2` shifts and the rest are CRT-mixed. The first thing this pass does is\nevaluate `T_n(d)` in closed form. It is elementary and it is exact.\n\nWrite the shift sum in the form the lag expansion needs. For a modulus `n`, a\nclass `c` mod `n`, and the triangular window of half-length `L`,\n\n S_n(c) := sum_{|h| < L, h = c mod n} (1 - |h|/L),\n R_n(c) := S_n(c) - L/n.\n\n`L*(1 - |h|/L)` counts the pairs `(u,v)` in `[0,L)^2` with `u - v = h`, so\n`L*S_n(c)` counts the pairs with `u - v = c mod n`. Splitting `L = qn + r`,\n`r = L mod n`, each class `a` mod `n` holds `q + [a < r]` of the `u`, and\n\n L*S_n(c) = sum_b (q + [b+c < r])(q + [b < r]) = n q^2 + 2qr + I_n(c,r),\n I_n(c,r) = #{b in [0,r) : (b+c) mod n in [0,r)} = (r-c)^+ + (r+c-n)^+,\n\nfor `c` taken in `[0,n)`, while `L^2/n = n q^2 + 2qr + r^2/n`. Subtracting,\n\n **R_n(c) = [ (r - c)^+ + (r + c - n)^+ - r^2/n ] / L, r = L mod n.**\n\nPART A tests this against brute force on 4000 random triples `(L, n, c)`: worst\nabsolute error 1.71e-13, machine noise. At `c = 0` it returns\n`R_n(0) = r(n-r)/(nL)`, which is `varE-spectral`'s Fact A, so Fact A is the\n`c = 0` case of a formula that covers every lag.\n\nTwo consequences used throughout:\n\n- `|R_n(c)| <= min(1, n/L)`, since `I_n` and `r^2/n` both lie in `[0, r]` and\n `r <= min(n, L)`.\n- For `n > 2L`, with `||c||_n` the least absolute representative,\n **`R_n(c) = (L - ||c||_n)^+/L - L/n`.**\n\nPART B rebuilds the whole spectral object at `x = 7` from this formula alone:\n192 (modulus, class) pairs, summed as `sum w(m,c) R_m(c)`, give 4.612929\nagainst the direct real-space sum 4.612929 and the corpus 4.612929. So the lag\nexpansion, the CRT bookkeeping and the kernel are all correct as coded.\n\n## 2. Which lags average out, and which do not\n\nThe task asks which lags carry phases `e(2t/n)` that average out over `t` and\nwhich do not. The closed form answers it, and the answer is not the hoped-for\ndichotomy.\n\nEvery lag's phase sum is **exact**. The sum over `t` (here `nu`) of\n`e(-nu c/n) K_L(nu/n)` is not estimated at all: it is `n R_n(c)`, and\n`R_n(c)` splits into two pieces with no error term,\n\n R_n(c) = -r^2/(nL) the FLAT piece, identical for every class c\n + I_n(c,r)/L the ACTIVE piece, nonzero only if ||c||_n < r.\n\nSo the correct statement is: **the oscillating part of every lag, mixed or not,\ncancels completely and elementarily; what survives is not a phase but an\ninterval overlap.** For `n > 2L` the active piece is nonzero exactly when the\nCRT-combined shift satisfies `||c||_n < L`. Since `n` is squarefree and `c` is\n`0` or `+-2` at each `p | n`, that condition is\n\n n | C(C^2 - 4) for the integer representative C with |C| < L.\n\nwhich is the real-space sum again. Summing the active pieces over `(n, c)` and\nre-indexing by `C` returns `sum_{|C|= 7` takes `p | h-2` or every prime\ntakes `p | h+2`, come off the open list with a two-line argument.\n\nIn the lag expansion the group carries weight `G(n) = D_y prod_{p|n} 1/(p-4)`\nat modulus `n` (times the `p <= 5` lag weights, which total 30 including the\nfactor 6 from `p = 2, 3`). Its total mass is a closed product:\n\n sum_n G(n) = D_y prod_{7<=p<=y} (p-3)/(p-4) = prod_{7<=p<=y} p(p-3)/(p-2)^2,\n\nand `p(p-3)/(p-2)^2 = 1 + (p-4)/(p-2)^2 = 1 + 1/p + O(1/p^2)`, so the product is\n`asymptotic to c ln y`. With `|R_m(c)| <= 1` from section 1,\n\n **|2 X2| <= 60 prod_{7<=p<=y} p(p-3)/(p-2)^2 = O(ln y) = o(1/delta).**\n\nPROVEN, no hypothesis. PART D prints the bound and the measured value:\n\n| x | bound on \\|2X2\\| | \\|2X2\\| measured | ratio | B_2/ln y |\n|---|---|---|---|---|\n| 7 | 78.44 | 5.715 | 13.7 | 0.5097 |\n| 11 | 106.82 | 5.628 | 19.0 | 0.4624 |\n| 13 | 137.73 | 5.333 | 25.8 | 0.4454 |\n| 17 | 173.68 | 5.352 | 32.5 | 0.4410 |\n| 19 | 211.82 | 5.327 | 39.8 | 0.4390 |\n| 23 | 252.81 | 5.314 | 47.6 | 0.4384 |\n\nThe bound is not violated at any level and is loose by a factor 14 to 48, which\ngrows: the measured `2X2` is flat near 5.3, so the truth is `O(1)` and the\nbound gives `O(ln y)`. `O(ln y)` is what the verdict needs, so the looseness\ncosts nothing. The measured column is `2*delta*X2` from\n`varE-theta2-step.md` section 5 divided by this run's `delta`, not a\nrecomputation of `X2`.\n\n## 4. The c = 0 half, bounded unconditionally\n\n`varE-theta2-step.md` section 3 leaves `X1 - X_dec` resting on a HEURISTIC: the\ntwo carry `pi_p = 2/(p-2)` and `pi_p = 2/(p-1)`, their `E[ln n]` differ by\n`O(1)` against `ln L`, so they were said to share a `GD(2)` limit and therefore\nto inherit `varE-spectral` section 5's own unproven limit theorem. That\ndependence can be removed. The argument below is elementary and does not need\neither measure to converge to anything.\n\n**Setup.** Both halves are the same functional against two product measures.\nWith `K = L/6` the half-length in `k = h/6` coordinates, put\n`F_m(c) := R_m(c)` from section 1. Then\n\n X1 = A_tot * sum_{c5} w5(c5) E_A[ F_{5n}(c(n,c5)) ],\n X_dec = B_tot * ( 3.75 E_B[ F_n(0) ] + 11.25 E_B[ F_{5n}(0) ] ),\n\nwhere `n` is squarefree with prime factors in `[7,y]`, drawn with each `p`\npresent independently, `pi_p = 2/(p-2)` under `E_A` and `pi'_p = 2/(p-1)` under\n`E_B`, and `w5` is `15` at the `5 | k` lag and `7.5` at each of the two\n`k = +-1 mod 5` lags. `A_tot = D_y prod (p-2)/(p-4) = prod p/(p-2)` and\n`B_tot = C_y prod (p-1)/(p-3)`, and\n\n **A_tot = B_tot exactly**,\n\nwhich is the sibling's PART 1 identity restated; PART F checks it to 5.6e-15 at\nsix levels. `A_tot` is measured at `0.24066 ln^2 y` and settling (PART E).\n\n**Step 1, the shape of F.** As a function of `z = ln n`, `F_m(0)` splits as\n`F_mono + F_osc`, where `F_mono = (1 - K/m) 1[m > K]` is monotone with total\nvariation 1, and `F_osc = F 1[m <= K]` satisfies `0 <= F_osc <= m/(4K)`. The\n`k = +-1 mod 5` lags give `||c||_{5n} = jn`, `j in {1,2,3,4}`, and by section 1\ntheir `F` is a sum of three monotone pieces of total variation at most 3, plus\nthe same `m <= K` remainder.\n\n**Step 2, the oscillating remainder is a concentration function.** For either\nmeasure,\n\n E[F_osc] <= (1/4) E[ e^{-(ln K - ln m)} 1[m <= K] ]\n <= (1/4) sum_{j>=0} e^{-j} Pr[ ln K - ln m in [j, j+1) ]\n <= 0.40 * Q(1),\n\nwith `Q(T) := sup_t Pr[ln n in [t, t+T]]` the Levy concentration function of\n`ln n = sum_p xi_p ln p`. The same bound covers `E[K/(5n); n > K]`, which is\nwhat the `+-1` lags leave above `K`.\n\n**Step 3, anti-concentration.** Kolmogorov-Rogozin with all `lambda_p = T`,\nkeeping only the primes with `ln p > T` (for those, `1 - Q(xi_p ln p; T) = pi_p`),\ngives\n\n Q(T) <= C ( sum_{e^T < p <= y} pi_p )^{-1/2}, sum_{e^T= pi'_p` with\n`pi_p - pi'_p = 2/((p-1)(p-2))`, so the two measures admit the monotone\ncoupling `n' | n`, and `Delta := ln n - ln n' >= 0` has\n`E[Delta] = mu = sum_p 2 ln p/((p-1)(p-2))`, a convergent sum, measured\n`mu = 0.3518` at `y = 14929` and still rising in the fourth decimal (PART F).\nHence the Kolmogorov distance obeys\n`d_K(ln n, ln n') <= Pr[Delta > T] + Q(T) <= mu/T + Q(T)`, and for a function of\nbounded variation vanishing at `-infinity`,\n`|E_A[G] - E_B[G]| <= TV(G) * d_K`.\n\n**Step 5, assembling.** Applying steps 2-4 to each of the five terms above, and\nusing that `E_B[F_{5n}(0)]` and `E_B[F_n(0)]` differ only by the deterministic\nshift `ln 5` in `ln n` (Kolmogorov distance `<= Q(ln 5)`), the `15`-weighted\n`5 | k` lag of `X1` pairs against `3.75 + 11.25 = 15` of `X_dec`, the two\n`+-1` lags contribute `O(Q(2) + Q(1))`, and\n\n **|X1 - X_dec| <= A_tot * O( mu/T + Q(T) ) = O( ln^2 y * (ln ln y)^{-1/4} )**\n\non taking `T = (ln ln y)^{1/4}`. Since `1/delta` is `asymptotic to ln^2 y / 0.2775`,\nthis is `o(1/delta)`: **`delta*(X1 - X_dec) -> 0`, unconditionally, at rate\n`O((ln ln y)^{-1/4})`.**\n\n**Three caveats, ahead of the claim.** First, the rate is vacuous at every\ncomputed level: `(ln ln y)^{-1/4}` is 1.015 at `x = 7` and 0.815 at `x = 23`\n(PART F), so this proposition explains none of the six measured rows and cannot\nbe checked against them except for consistency of order. The measured\n`delta*(X1 - X_dec) * ln y = 0.1334` is `O(1/ln y)`, far stronger than what is\nproved. Second, the derivation is this pass's own and has had **no adversarial\npass**; the campaign ledger records four of five same-day integrations needing\ncorrection within twelve hours. The step most likely to break is step 5's\nbookkeeping of the `p = 5` lag weights, where `X1` carries three lags of total\nweight 30 and `X_dec` carries two of total weight 15, and only the\nlarge-modulus limits of the weights agree (15 against 15); the pairing is\nargued, not machine-checked. Third, `A_tot = B_tot` is exact and is doing real\nwork: without it the two halves would differ at order `ln^2 y` and nothing\nbelow would matter.\n\nWhat this buys: the `c = 0` half no longer inherits `varE-spectral` section 5.\nThe sibling's limit theorem is still needed for the *value* 0.45546, but not\nfor the *vanishing* of this half of the decoupling error.\n\n## 5. The mixed lags: the size of the obstruction, measured\n\nWhat is left is `Xmix`, the `3^omega(n) - 3` CRT-mixed lags. Sections 3 and 4\nhave removed everything else, so `delta*(X - X_dec) -> 0` now holds if and only\nif `Xmix = o(1/delta) = o(3.6 ln^2 y)`.\n\n**How big is it.** From the sibling's embedded columns, `delta*Xmix` runs\n-0.241840 at `x = 7` to -0.029342 at `x = 23`, so at `x = 23`,\n`Xmix = -9.78` against `ln y = 9.611`: the truth is of order `ln y`, one\nlogarithm below the target. Nothing in this section disputes that; the question\nis only whether it can be derived.\n\n**The three bounds available, and what each gives.**\n\n1. *Absolute values on the lag expansion.* `|R| <= 1` and the total mixed mass\n `sum_n W_tot(n) = prod p^2/(p-2)^2` measured at `0.0579 ln^4 y` (PART E)\n give `O(ln^4 y)`. Three logarithms short.\n2. *Absolute values with the kernel bound `|R| <= min(1, n/L)`.* This is the\n step that recovers the first logarithm and is the same phenomenon as\n `varE-spectral` section 2's \"mean gives `2^omega`, maximum gives `4^omega`\".\n It is not computable at the top levels here, but at `x = 7` PART B prints\n `sum |w R| = 13.99` against `|X| = 4.61`, a loss factor 3.03 at one level.\n3. *The flat/active split of section 2.* Measured at all six levels, and it is\n the decisive negative: `delta*|flat|` runs 0.559, 0.912, 0.960, 1.087,\n 1.188, 1.301, **rising on every level**, against a target of `-> 0`. The\n active half is its near-mirror. So the one split the exact kernel hands over\n for free is already lossy, at every computed level, by a factor that is not\n settling.\n\n**The flat half of the mixed group alone.** PART C isolates the piece with no\nequidistribution in it whatsoever:\n\n Phi := K * sum_{n > 2K} (W_tot - A)(n)/n,\n W_tot(n) = D_y prod 4/(p-4), A(n) = D_y prod 2/(p-4),\n\ncomputed exactly by enumerating every squarefree `y`-smooth `n <= 2K` with\nprime factors `>= 7` (5.3 million of them at `x = 23`) against the closed forms\n`sum_n W_tot(n)/n = 1` and `sum_n A(n)/n = prod(1 - 2/(p-2)^2)`, both checked to\n1e-12:\n\n| x | ln y | Phi | Phi/ln^2 y | Phi/ln^3 y | delta*Phi |\n|---|---|---|---|---|---|\n| 7 | 2.565 | 0.3765 | 0.0572 | 0.0223 | 0.0124 |\n| 11 | 3.850 | 0.5678 | 0.0383 | 0.0099 | 0.0097 |\n| 13 | 5.153 | 1.2697 | 0.0478 | 0.0093 | 0.0129 |\n| 17 | 6.564 | 2.3840 | 0.0553 | 0.0084 | 0.0152 |\n| 19 | 8.042 | 4.0592 | 0.0628 | 0.0078 | 0.0173 |\n| 23 | 9.611 | 6.3689 | 0.0689 | 0.0072 | 0.0191 |\n\n`delta*Phi` rises on four of the five steps, falling only from `x = 7` to `x = 11`. The local exponent of `Phi` in `ln y`\nover the top three levels is 2.62 then 2.53, so the data are consistent with\n`ln^3 y` approached slowly and are not consistent with `ln^2 y`. The\ncorresponding derivation is standard but is **not verified here**: with\n`n^2 W_tot(n)/n = prod_{p|n} 4p/(p-4)`, a `4^omega`-type weight, partial\nsummation off `sum_{n <= T} 4^{omega(n)} = c T ln^3 T (1+o(1))` gives\n`Phi = O(ln^3 K)`, and the missing check is that restricting `n` to\n`y`-smooth, squarefree, `(n,30) = 1` costs only a bounded factor.\n\n**So the obstruction, stated exactly.** The mixed-lag sum is a difference of\ntwo explicit halves each of size at least `ln^2 y` and plausibly `ln^3 y`, whose\ndifference is `ln y`. Nothing in the lag expansion, the kernel, or the\n`p <= 5` bookkeeping produces that cancellation; it is a statement about how the\nCRT-combined shifts `c` mod `n` distribute relative to the window, i.e. about\nhow the large `y`-smooth divisors of `C(C^2 - 4)` distribute as `C` runs over\n`|C| < L`. **OPEN.**\n\n## 6. The named estimate that would close it, and why Weil does not apply\n\nThe task asks, if a cancellation over `t` is needed that cannot be proved here,\nfor the exact exponential sum (modulus, length, phase) and the known bound that\nwould suffice.\n\n**There is no such exponential sum.** That is the finding, and it is negative\nin a useful direction. The complete sum is\n\n sum_{nu != 0 mod n} e(-nu c/n) K_L(nu/n), K_L the Fejer kernel,\n\na **linear** phase against a kernel that is itself the square of a geometric\nsum. Section 1 evaluates it in closed form with no error term. So:\n\n- **Weil does not apply and is not needed.** No nontrivial algebraic character\n sum appears anywhere. The phase is additive and linear in `nu`; the local\n factor `2 + 2 cos(4 pi nu_p/p)` is `|1 + e(2 nu_p/p)|^2`, a squared linear\n phase, not a curve. There is nothing for a square-root cancellation bound to\n bite on. Quoting Weil here would be a category error.\n- **Ramanujan-sum orthogonality is already used, and used exactly.** It is what\n produces the flat piece `-r^2/(nL)`, identical across classes. It is the\n content of the closed form, not an estimate on top of it.\n- **The large sieve is the right shape but the wrong variable.** The residual\n after orthogonality is the active piece, and it is a counting statement, not\n an oscillation statement.\n\n**The estimate that would suffice.** Re-indexing the active pieces by the\ninteger representative `C` (section 2), what is needed is: for\n`w(n,C) = D_y prod_{p|n} (2 or 1)/(p-4)` according as `p | C` or `p | C -+ 2`,\n\n sum_{0<|C| 2L, P^+(n) <= y} w(n,C)\n = L sum_{n > 2L} sum_{c != 0} w(n,c)/n + O(ln y * (something o(ln y))),\n\nthat is: **the weighted count of large `y`-smooth divisors of `C(C^2-4)` agrees\nwith its expected count to one logarithm better than trivially, on average over\na window of length `L = y^2`.** The owning conventions for that are the\ndistribution of divisors of a polynomial value in a dyadic range (Ford's\n`H(x,y,z)`, Hooley's `Delta`-function, Erdos's multiplication-table problem),\napplied to the reducible cubic `C(C-2)(C+2)` with a smoothness constraint at\n`u in (2, 6]`, since `n in (2L, L^3)` and `ln y = (1/2) ln L` (range corrected 2026-08-29, redteam-0829-measure-c.md E23; the earlier text named only the lower endpoint). `research/SEARCH-CONVENTIONS.md` applies: the words to search are\n\"divisors of `n(n+2)` in intervals\", \"Hooley Delta function polynomial values\",\n\"Ford divisors in intervals\", and Montgomery-Soundararajan / Gorodetsky for the\nsingular-series side that `varE-theta2-step.md` section 7 already flags. **That\nsearch has NOT been run here**, and until it is, no claim that this reduction is\nnew is available.\n\nWhether such a statement is available in the literature at the precision needed\n(one logarithm below the trivial bound, with the `y`-smoothness constraint and\nthe `4^omega`-sized weights) is not known to this pass, and the honest prior is\nagainst it: the same one-logarithm gap in divisor problems of this shape is\nusually the whole difficulty.\n\n## 7. Checked against the six measured ratios\n\nA bound the data violate is wrong, so every bound stated above is put against\nthe six exact levels of `varE-theta2-step.md` section 4.\n\n| claim | at x = 23 | measured | violated |\n|---|---|---|---|\n| `\\|2 X2\\| <= 60 prod p(p-3)/(p-2)^2` | 252.81 | 5.314 | no, loose by 47.6 |\n| `\\|X1 - X_dec\\| = O(ln^2 y (ln ln y)^{-1/4})` | 18.1 times an unnamed constant | 4.63 | no, and vacuous: the rate factor is 0.815 |\n| `X = flat + active`, exact | -433.802 + 555.281 | 121.479 | no, identity |\n| `X` from the lag expansion at `x = 7` | 4.612929 | 4.612929 | no |\n| `Phi` grows faster than `ln^2 y` | `Phi/ln^2 y` = 0.0689 | rising on 4 of 5 steps | no |\n| `delta*(X - X_dec) -> 0` | not proved | 0.000477 | open |\n\nTwo checks that the run also passes and that would have caught a wrong\nframework: `sum_n W_tot(n)/n = 1` and `sum_n A(n)/n = prod(1-2/(p-2)^2)` hold to\n1e-12 at all six levels, and `A_tot = B_tot` to 5.6e-15. The first two are what\nmakes the main term cancel against the `-L` in `X = sum (1-|h|/L)(W(h)-1)`; if\neither failed, every number in this note would be wrong by an amount of order\n`L`.\n\nThe one number this note does **not** support: the coefficient. Nothing here\nimproves on the sibling's reading that the net `delta*(X - X_dec) * ln y` is a\ndifference of two terms thirty times larger, so 0.0046 remains a number not to\nquote as a constant.\n\n## 8. What would falsify this, and whether that check has run\n\n| claim | rung | falsifier | has the check run |\n|---|---|---|---|\n| `R_n(c) = [(r-c)^+ + (r+c-n)^+ - r^2/n]/L` | PROVEN | one `(L,n,c)` where it disagrees with the shift sum | YES, 4000 seeded random triples, worst error 1.71e-13 (PART A) |\n| the lag expansion with that kernel reproduces `X` | PROVEN | a level where the rebuilt sum misses the corpus `X` | YES at `x = 7` only, to 1e-9 against the direct sum and 2e-4 against the corpus. NO at `x >= 11`: the modulus exceeds 2^53 and exact CRT would need BigInt |\n| every lag's phase sum is exact, so no exponential-sum estimate is needed | PROVEN | an oscillating factor surviving the closed form | YES, by construction; the closed form has no error term |\n| `\\|2 X2\\| = O(ln y)`, unconditional | PROVEN | a level where the measured `\\|2X2\\|` exceeds `60 prod p(p-3)/(p-2)^2` | YES, six levels, loose by 14 to 48 (PART D) |\n| `delta*(X1 - X_dec) -> 0`, unconditional | PROVEN here, UNREVIEWED | an error in step 5's `p = 5` weight pairing, or a misapplication of Kolmogorov-Rogozin | NO. Derived this pass, no second reader, no machine check of the pairing. The rate is vacuous at all six levels so the data cannot test it |\n| `A_tot = B_tot` exactly | PROVEN | a prime where `(p-1)(p-4) + 2 != (p-2)(p-3)` | YES, six levels to 5.6e-15 (PART F); it is the sibling's PART 1 identity |\n| the flat/active split is lossy: `delta*\\|flat\\|` does not vanish | MEASURED, 6 exact levels | a level where `delta*\\|flat\\|` turns and falls | PARTLY. Rising on five of five steps, 0.559 to 1.301; `x = 29` not computed |\n| `Phi = O(ln^3 K)` and not `O(ln^2 y)` | HEURISTIC | the `y`-smooth, squarefree, `(n,30)=1` restriction costing more than a bounded factor in `sum_{n<=T} 4^{omega(n)}` | NO for the derivation. The six measured levels give local exponent 2.6, 2.5, consistent but not decisive |\n| `Xmix = o(1/delta)`, hence `delta*(X - X_dec) -> 0` | OPEN | nothing proved either way; measured `delta*Xmix` = -0.0293 at `x = 23` and falling | NO. This is the whole remaining gap in step 1 |\n| the divisor estimate of section 6 is not already in print | NOT CLAIMED | Ford, Hooley, Montgomery-Soundararajan or Gorodetsky supplying it | NO. Not searched. Do not call this reduction new before that search |\n| `lim Var/E = 0.45546` | HEURISTIC | either open step failing | NO. Step 1 is reduced but open here; step 2 is the sibling's |\n\nThe one line worth carrying out of this pass: the open step is no longer about\nFourier coefficients and is no longer about equidistribution of phases, because\nevery phase sum here is exact. It is a divisor-counting statement, and the two\nhalves it must balance are each at least a logarithm larger than the answer.\n"},"research/history/staging/varE-theta2-step.md":{"lf_sha256":"f4986f1223106894080d230b14002f5a88f54ebdb670989c2aad052e66053569","content":"# The decoupling step at two excluded classes: what it actually is, what it costs, and the part of it that needs no proof\n\n\n\n> **RIDER 2026-08-30 (orchestrator, from `verify-0830-record-defects.md` §1, CONFIRMED to every digit on\n> independent code at x = 7..19).** PART 3 of `varE-theta2-step.js` builds the\n> shift group X2 by doubling the positive-h half of one pattern that is a\n> mirror image, not even. The corrected reading of §5 (lines 222-225): the\n> group sum δ·X2 reads −0.009235, 0.004509, 0.001365, 0.000736, 0.000394 at\n> x = 7..19 (2X2 = −0.5603 .. 0.1846, O(1) and falling; the column first\n> carried here, 0.094199 .. 0.007968, is withdrawn); δ·Xmix runs −0.034971\n> .. −0.016835 over the same levels, Xmix = −0.49 ln y on the top three, the\n> slower of the two. **Applied 2026-09-05: the producer now sums both mirror\n> patterns, is re-embedded, and reproduces these values with x = 23 added\n> (δ·X2 = 0.000236, δ·Xmix = −0.013876); §5 above carries the corrected\n> numbers.** X, X1, X_dec and all ratios\n> are untouched; the §8 row's rung (MEASURED) is unchanged.\n\n*Staging note, 2026-08-28. Forward work on `varE-spectral.md` §2, one of the two\nopen steps in that note; the other is its §5 limit theorem for the model, which\nthis pass does not touch. Producer:\n`research/history/staging/varE-theta2-step.js` (embedded, `--check` clean,\n1.7 s). Reads `varE-spectral.md` and its `.js` for the nine diagonal points,\nthe exact `X_dec` at x = 7 and 11, and the level table (L = x#, y the largest\nprime below sqrt(L)). Recomputes nothing from `paper/variance-note.md`.*\n\n## 0. Verdict, the open half first\n\n**The step is not proven and not bounded here.** No inequality is derived. What\nreplaces it is a smaller open statement plus four new exact data points, and\nthe smaller statement is still open.\n\n**The frequency-side hope in the task brief fails.** The local coefficients do\nnot recombine into one shifted Fejer term. They recombine into\n`|Ehat_n(t)|^2` with `E_n = {r : n | r(r+2)}`, which expands into `3^omega(n)`\ndistinct shifts carrying `4^omega(n)` total weight. Exactly two of those shifts\nare the clean `d = +-2` terms the brief predicted, and those two are indeed\nharmless. The remaining `3^omega(n) - 3` are CRT-mixed, and they are where the\ndifficulty lives.\n\n**The measured coefficient is a near-cancellation.** The decoupling error, after\nthe `delta` normalisation, is the sum of a `+0.1334/ln y` term and a\n`-0.1288/ln y` term (reading 4). The net `0.0046/ln y` is a difference of two\nnumbers thirty times larger, so its value is not established even though its\norder is.\n\n**Nothing here touches the conjecture.** `variance-note.md` §4 already records\nthat Var/E over a uniformly random window says nothing about the one anchored\nwindow the twin problem needs. This note is about whether a stated limit is the\nlimit of the stated object, not about primes.\n\nWith that said, what the pass produced:\n\n- **PROVEN, elementary, and checked at six levels.** The spectral sum is a\n real-space shift sum: `X = sum_{|h|= 7` the exact `W` splits into `3^omega` groups indexed\n by which of `p | h`, `p | h-2`, `p | h+2` each prime takes. The group where\n every prime takes `p | h` is the only one whose CRT class is 0, so Fact A\n evaluates it verbatim, with no equidistribution and no replacement. Its\n weight is the model's weight with `pi_p = 2/(p-2)` in place of `2/(p-1)`,\n because `(p-1)(p-4) + 2 = (p-2)(p-3)` exactly (§3, PART 1).\n- **MEASURED, exact, six levels, no Monte Carlo.** `X/X_dec` = 0.853427,\n 0.960382, 1.009802, 1.003895, 1.001448, 1.001312 at x = 7, 11, 13, 17, 19,\n 23. The corpus had the first two. `delta*(X - X_dec)` = -0.026118, -0.010572,\n +0.002907, +0.001268, +0.000502, +0.000477 (§4).\n- **MEASURED.** `delta*(X - X_dec)*ln y` is bounded on every level computed,\n and falling rather than settling: 0.01498, 0.00832, 0.00404, 0.00459 at\n x = 13..23. Bounded implies the error vanishes, so on this evidence the limit\n 0.45546 is not moved by the replacement (§5), and the evidence is for\n `O(1/ln y)` or better. Four levels exclude growth and nothing finer.\n- **Correction to `varE-spectral` §6a.** The model column there is Monte Carlo\n and is off by up to 0.0017 at x = 23, which is larger than any residual the\n note reports at x >= 13 (§6).\n\n## 1. The replacement, restated in real space\n\n`K_L(t) = sum_{|h| < L} (1 - |h|/L) e(ht)` is the Fejer kernel, so\n\n X = sum_{nu != 0 mod M} What(nu) K_L(nu/M)\n = sum_{|h| < L} (1 - |h|/L) W(h) - L\n = sum_{|h| < L} (1 - |h|/L) (W(h) - 1),\n\nusing `sum_{|h| 0` there, and that\ngap does not shrink with y. On `p >= 7` the ratio `W/V` is a convergent product\ntimes `prod_{p | h^2-4} (p-3)/(p-4)`, which is order one but not one. Whatever\nmakes the totals agree is cancellation in the h-sum, not closeness of the\nsummands.\n\n## 2. What the frequency side actually gives\n\nWorking the brief's step 1 through: with `nu_p = t (n/p)^{-1} mod p` the local\ncoefficients multiply to\n\n prod_{p | n} hat f_p(nu_p) = |Ehat_n(t)|^2 / prod_{p|n} (p-2)^2,\n Ehat_n(t) = sum_{r in E_n} e(tr/n), E_n = {r mod n : n | r(r+2)},\n\nso the exact conductor-n sum is `sum_{r, r' in E_n} T_n(r - r')` with\n`T_n(d) = sum_{|j| 2L` and `d = +-2`,\n`T_n(+-2) = T_n(0) - 2n/L + O(L)`, so those two lags each contribute a\n`(1 - 2/L)`-type copy of the unshifted term. They are the groups called `X2`\nbelow, and they are measured harmless. The clean recombination the brief hoped\nfor does not extend past them: the remaining lags are CRT-mixed residues whose\nleast representative is generically of size n, so their `T_n` values are not a\nfixed multiple of `T_n(0)` and their sum is exactly the equidistribution\nquestion the replacement was standing in for. Decoupling is not repaired by\nevaluating a shifted Fejer kernel.\n\n## 3. The group that needs nothing\n\nExpanding the `p >= 7` product over the three cases gives\n\n X = X1 + 2*X2 + Xmix,\n\nwith `X1` the group where every prime takes `p | h`, `X2` each of the two\ngroups where every prime takes `p | h-2` or `p | h+2`, and `Xmix` the rest.\nOnly `X1` has CRT class 0 at every prime, so only `X1` is a sum of `A_q(0)`\nterms and Fact A applies to it with nothing assumed.\n\nIts weight relative to the model's is fixed by one identity:\n\n (D_y / C_y) * prod_{7 <= p <= y} (1 + 2/((p-1)(p-4))) = 1,\n D_y = prod_{7 <= p <= y} p(p-4)/(p-2)^2,\n\nwhich holds prime by prime because `(p-1)(p-4) + 2 = (p-2)(p-3)`. PART 1 prints\n1.00000000000000 at all six levels. Size-biased, `X1` carries\n`pi_p = 2/(p-2)` where the model carries `2/(p-1)`; the two differ in\n`E[ln n]` by `sum 2 ln p/((p-1)(p-2))`, which is O(1) against\n`ln L = 2 ln y`. So `X1` and the model share a `GD(2)` limit law at the same\nrung the model has it, HEURISTIC, inheriting `varE-spectral` §5's own unproven\nlimit theorem, which is that note's second open step, rather than adding a new\nassumption.\n\n**What that buys.** The open statement is no longer \"the local coefficients may\nbe replaced by their means\". It is \"the shift groups `2*X2 + Xmix` contribute\n`o(1/delta)`\". That is a statement about two explicit sums over shifts\n`h = +-2 mod q`, not about frequencies.\n\n## 4. The error, exact, at six levels\n\n`delta*X` is Var/E. Both columns below are exact arithmetic, Kahan-summed, no\nMonte Carlo anywhere.\n\n| x | ln y | delta*X | delta*X_dec exact | corpus model (MC) | delta*(X - X_dec) | X/X_dec |\n|---|---|---|---|---|---|---|\n| 7 | 2.565 | 0.152075 | 0.178193 | 0.1785 | -0.026118 | 0.853427 |\n| 11 | 3.850 | 0.256267 | 0.266839 | 0.26744 | -0.010572 | 0.960382 |\n| 13 | 5.153 | 0.299499 | 0.296592 | 0.2975 | +0.002907 | 1.009802 |\n| 17 | 6.564 | 0.326772 | 0.325504 | 0.32579 | +0.001268 | 1.003895 |\n| 19 | 8.042 | 0.347302 | 0.346800 | 0.34637 | +0.000502 | 1.001448 |\n| 23 | 9.611 | 0.364320 | 0.363842 | 0.36214 | +0.000477 | 1.001312 |\n\nThe sign change `varE-spectral` §2 inferred indirectly, from the model sitting\nabove the data at x = 7 and 11 and below it from x = 13, is now direct: it sits\nbetween x = 11 and x = 13. The last two rows are 0.000502 and 0.000477, so the\nsequence is not monotone at the top; these are exact numbers, so that is\narithmetic fluctuation between levels and not noise.\n\nx = 29 is out of reach for this method: `L/6 = 1.1e9` array entries, roughly 35\nGB in the present layout. A segmented sieve would fit the memory and cost\nminutes, not seconds.\n\n## 5. The 1/ln y split, and why the net coefficient is not established\n\n| x | delta*(X1 - X_dec)*ln y | delta*(X - X1)*ln y | sum |\n|---|---|---|---|\n| 7 | 0.07008 | -0.13708 | -0.06699 |\n| 11 | 0.10310 | -0.14381 | -0.04070 |\n| 13 | 0.13201 | -0.11703 | +0.01498 |\n| 17 | 0.13350 | -0.12518 | +0.00832 |\n| 19 | 0.13308 | -0.12905 | +0.00404 |\n| 23 | 0.13342 | -0.12883 | +0.00459 |\n\nBoth halves settle. The group-1 excess settles near +0.1334 and the shift-group\ndeficit near -0.1288, each stable in the third decimal over the top three\nlevels, and each therefore consistent with an exact `c/ln y`. Their sum is the\ndecoupling cost, and it is the difference of two quantities thirty times its\nown size. A one percent systematic error in either half would change it by half\nits value.\n\nSo the defensible reading is the order, not the constant: the replacement error\nis `O(1/ln y) = O(2/ln L)` on every level computed, the same order as the\nmodel's own drift, hence it does not move the limit. Whether the net\ncoefficient is 0.0046 or 0.002 or 0.008 is not settled by six levels, and\nnothing here needs it to be. The order is also the weaker of the two readings\navailable: over x = 13..23 the net runs 0.01498, 0.00832, 0.00404, 0.00459,\nwhich falls rather than settles, so the evidence is for `O(1/ln y)` or better\nand the only failure mode these four levels exclude is growth\n(`redteam-0828-varE.md` §6).\n\nThe two shift groups separately: `delta*X2` (each group, both mirror halves\nsummed) reads -0.009235, 0.004509, 0.001365, 0.000736, 0.000394, 0.000236 at\nx = 7..23, so `2*X2` is `O(1)` and falling, and `delta*X2 = O(1/ln^2 y)`, one\norder better than needed. `delta*Xmix` runs -0.034971 .. -0.013876 and is the\nslower of the two, about `-0.49 ln y` in `Xmix` on the top levels. So the open\nstatement narrows once more: it is about `Xmix`, the CRT-mixed lags, alone.\n\n## 6. Two corrections this forces on `varE-spectral.md`\n\n- **§6a's model row is Monte Carlo.** Exact against quoted: 0.178193/0.1785,\n 0.266839/0.26744, 0.296592/0.2975, 0.325504/0.32579, 0.346800/0.34637,\n 0.363842/0.36214. The x = 23 gap is 0.0017, larger than any residual the note\n reports at x >= 13, so the residual column there is partly MC noise in the\n model, not structure in the data. With the exact model the residuals at\n x = 13..23 read +0.00291, +0.00127, +0.00050, +0.00048, all positive, where\n the note's read +0.0020, +0.0010, +0.0009, +0.0022. An independent rebuild\n reads +0.00291, +0.00130, +0.00050, +0.00063 at the same four levels\n (`redteam-0828-varE.md` §6). The last-digit differences are the measured\n column's own quantisation: `variance-note.md` §7 prints Var/E to four\n decimals, so that column carries +-5e-5, comparable to the residuals at\n x >= 29 (+0.00036, +0.00025, +0.00023). Residual structure at the top three\n levels is at the quantisation floor and is not signal. The same MC caution\n applies to the x = 41 forecast, which the exact method cannot reach and which\n a two-seed rerun at N = 2e7 puts at 0.402364 +- 0.000075 rather than\n 0.40184 +- 0.00075 (`redteam-0828-varE.md` §4).\n- **§2's framing.** \"Replace `hat f_p(nu_p)` by `gamma_p`\" overstates what has\n to be true. The `c = 0` group survives the replacement exactly, by PART 1's\n identity. What needs an argument is only the CRT-mixed lags.\n\n`variance-note.md` §7's X column agrees with exact recomputation to about five\nsignificant figures (4.6137 against 4.612929, 51.4047 against 51.400255,\n121.4787 against 121.485245). Those trailing digits are rounding, not exactness,\nand the column should not be quoted past five figures.\n\n## 7. Where the exact object sits in the literature\n\n`X = sum_{|h|\n\n*Written 2026-08-19 and committed alone, before any producer script for this run\nexisted. Everything below is fixed in advance: the predictions, the acceptance\nbands, the validation gate the instrument must clear before any @29 number is\nreported, and what each verdict does to `TODO.md` item X. No @29 census exists at\nthe time of writing; `xchannel-triples.md` §7 names @29 as the level that would\ndecide R3 and prices it out of reach in memory.*\n\n## 1. The statistic, stated so the new instrument is provably the same one\n\n`research/natal-cap-39-triple-census.js` defines, for a level `x` with\n`W = ∏_{p≤x} p`, natal set `N = {r ∈ [0,W) : r ≡ 11,17 (mod 30), p ∤ r, p ∤ r+2\nfor 7 ≤ p ≤ x}`, and scour primes `qs = {q prime : x < q, q² ≤ W}`:\n\n- for a triple `Q = {q₁ W, mixed} c(Q,ε)) / (6·N̄·Σ_{∏Q > W} 1/∏Q)`.**\n\nThe in-memory instrument reaches the super-`W` part by the bridge\n`mixed super-W obs = Σ_{r∈N}[C(a,2)b + a·C(b,2)] − (sub-W mixed obs)` with\n`a(r) = #{q ∈ qs : q | r}` and `b(r) = #{q ∈ qs : q | r+2}`, and it materialises\nthree arrays of width `W` (`A`, `a`, `b`, 5 bytes per slot). At @29,\n`W = 6,469,693,230`, so that is 32 GB for this instrument and 162 GB for\n`natal-cap-35`'s 25-byte slot. That price, not the arithmetic, is what stopped\nthe series at @23.\n\n**The identity the segmented instrument will use instead**, exact and with no\nestimator, obtained by exchanging the order of summation in the bridge:\n\n> `mixed super-W obs = Σ_{r∈N} #{(q₁ W}`\n> ` + Σ_{r∈N} #{(q₁ ∈ D_a(r), q₂ W}`\n\nwith `D_a(r) = {q ∈ qs : q | r}`, `D_b(r) = {q ∈ qs : q | r+2}`. Each `r`\ncontributes only through its own two divisor lists, `|D_a| ≤ 6` and `|D_b| ≤ 6`\nat @29, so the sum is computable one segment of `[0,W)` at a time in memory\nbounded by the segment. The denominator's second factor,\n`Σ_{∏Q>W} 1/∏Q`, is a tail sum over the prime list alone and is computed\ndirectly as a tail (not as `e₃` minus the sub-`W` sum), so no cancellation\nenters it.\n\nAligned super-`W` obs must be exactly 0 at every level (P1, a theorem). It is\ncarried as an instrument check, not as a result.\n\n## 2. The predictions, adopted verbatim from the record\n\n`research/history/staging/import-stein.md` §3.2, \"Forward prediction, on the\nrecord before the level exists\", gives the zero-parameter closed form\n`1 − J = 4S₂`, `S₂ = Σ_{x 6`\n\nTest 1 is primary because it is exactly the test that produced the +2.87, −0.29\nand +0.60 already on the record, and changing yardsticks between the fitted\nlevels and the blind one is how a candidate gets promoted by its scorer rather\nthan by the data.\n\n**TEST 2 (SECONDARY — scale accuracy, which is what a MARGINAL result means).**\n`d = (1−J)_meas/0.028943 − 1`.\n\n- **TIGHT**: `|d| ≤ 1.25%` — at @29 the closed form is at least as accurate as\n it was at @23 (+1.25%).\n- **CONSISTENT**: `1.25% < |d| ≤ 2.5%` — at least as accurate as at @19\n (−2.49%), the worse of the two scored levels.\n- **DRIFTING**: `2.5% < |d| ≤ 5%` — worse at @29 than at either scored level,\n by up to a factor of two.\n- **REFUTED AS THE CONSTANT**: `|d| > 5%`.\n\n**COMBINED VERDICT, fixed now.**\n\n| Test 1 | Test 2 | verdict written in the report |\n|---|---|---|\n| HIT | any | **HIT** — the closed form survives its first blind level |\n| MARGINAL | TIGHT or CONSISTENT | **SURVIVES WITH A MEASURED OFFSET** — right to `d`, not right |\n| MARGINAL | DRIFTING | **WEAK** — the scale law holds, the closed form is not the constant |\n| MISS | DRIFTING or worse | **MISS** |\n| MISS | TIGHT or CONSISTENT | impossible by construction; if it occurs the instrument is at fault |\n\n**A fourth band on `J` itself, to catch the case where the object changes rather\nthan the constant.** If `J(29) < 0.94` or `J(29) > 1.00`, the report leads with\nthat and not with the score: the deficit would then have left the track it has\nheld since @19 (`J` = 0.9599, 0.9659), and the closed form's failure would be a\nsymptom rather than the finding.\n\n## 4. What this test cannot do, registered before it runs\n\nThe candidate is **not separable at @29 from its two nearest rivals**, and the\nnumbers saying so are computed here, before the run:\n\n| law | prediction for `1 − J` at @29 | distance from the candidate |\n|---|---|---|\n| **N1, the candidate** `4S₂` | **0.028943** | — |\n| N2, constant multiple of `F`, `c` = @23's measured 3.8667 | 0.029145 | +0.70%, **1.6σ_J** |\n| N3, `1 − J ∝ 1/lnW` anchored at @23 (lnW: 19.223 → 22.590) | 0.028990 | +0.16%, **0.4σ_J** |\n\n**So a HIT at @29 confirms that the ~3.8 law continues past the in-memory\nceiling and fixes its scale to about half a percent. It does not single out\n`4S₂`, and no claim that it does may be written.** Any of the three laws passing\nmeans all three pass.\n\n**@31 is where they separate, and that is registered too.** At @31 the candidate\npredicts 0.024784, N2 predicts 0.024818 (+0.14%) and N3 predicts **0.025165**\n(+1.54%), against `σ_J ≈ 2.3·10⁻⁵` ≈ 0.09%. N3 is therefore **≈ 16σ** from the\ncandidate at @31 while being 0.4σ from it at @29. If @31 is affordable it is run\nand scored by the same two tests against 0.024784, with the added clause:\n`(1−J)_meas` inside `0.024784 ± 3σ_J` **refutes N3**; inside\n`0.025165 ± 3σ_J` refutes N1. N2 stays inseparable at @31 and is not tested.\n\n## 5. The validation gate, which comes before any @29 number\n\nThe segmented instrument is a new instrument. Before @29 is computed it must\nreproduce, **exactly and to the unit**, the embedded output of\n`research/natal-cap-39-triple-census.js` at @17, @19 and @23 on every one of:\n\n| quantity | @17 | @19 | @23 |\n|---|---|---|---|\n| `W` | 510510 | 9699690 | 223092870 |\n| `N̄` | 14850 | 252450 | 5301450 |\n| `K` | — | 435 | 1739 |\n| `B₃` split (3,0)/(2,1)/(1,2)/(0,3) | 848/2729/2713/847 | 27377/85713/85449/27391 | 879225/2779604/2779107/879385 |\n| sub-`W` triples `∏Q < W` | 5246 | 162982 | 4517592 |\n| sub-`W` mixed obs | 2243 | 97097 | 3751046 |\n| `Σ_{∏Q>W} 1/∏Q` | 0.039784 | 0.050943 | 0.058834 |\n| **mixed super-`W` obs** | **3199** | **74065** | **1807665** |\n| by orientation (2,1)/(1,2) | 1622/1577 | 37139/36926 | 904409/903256 |\n| CRT denominator | 3544.79 | 77162.70 | 1871421.20 |\n| **`J`** | **0.9025** | **0.9599** | **0.9659** |\n| aligned super-`W` obs (P1) | 0 | 0 | 0 |\n\n**If any integer-valued row differs by one unit at any of the three levels, no\n@29 value is reported at all**, and the run is written up as an instrument\nfailure. This is the gate `natal-cap-39` itself used when a `Uint8Array` wrap\nmoved `X̄` by 13.33, and it is the reason that defect was caught.\n\nAt @29 the instrument's own internal identities are also checked and must hold:\n`Σ_{r∈N} 1 = N̄ = 2∏_{7≤p≤29}(p−2) = 143,139,150`; `B₃` from the `(a,b)` counts\nequals sub-`W` plus super-`W` from the divisor lists, class by class; aligned\nsuper-`W` obs `= 0`; and the two orientations `(2,1)` and `(1,2)` agree to\nwithin their own Poisson scale.\n\n## 6. What each verdict does to TODO item X\n\nItem X currently reads, on this point: *\"the ~3.8 constant now has a\nZERO-PARAMETER closed-form candidate ... landing at −0.29σ (@19) and +0.60σ\n(@23) with asymptote exactly 4 ..., and blind values pre-computed at @29 ... and\n@31 .... It is a candidate, NOT a derivation ... so the derivation stays the\nitem's open analytic target, now with a target formula and two blind tests\nwaiting.\"* Its Named gaps carry *\"@23 is the in-memory instrument's last level\n(@29 needs 162 GB)\"*, and its first move defers *\"any segmented @29 rewrite\"*.\n\n- **HIT.** The first of the two waiting blind tests is spent and passed. Item X\n gains a fourth scored level and its first out-of-sample one; the phrase \"two\n blind tests waiting\" becomes \"one blind test waiting, @31\". The closed form\n stays a **candidate, not a derivation** — §4 forbids any promotion on @29\n alone, since N2 and N3 pass with it. The Named gap \"@23 is the in-memory\n instrument's last level (@29 needs 162 GB)\" is **closed by the instrument**:\n the level is reachable in bounded memory, and the item's deferral of \"any\n segmented @29 rewrite\" is spent. The item's open analytic target (derive the\n constant) is unchanged and is worth more, because the thing to be derived is\n now confirmed at a level the fit never saw.\n- **SURVIVES WITH A MEASURED OFFSET.** Same as HIT on the instrument and the\n Named gap, but the item must carry the offset `d` in print beside the\n closed form, and \"landing at −0.29σ and +0.60σ\" must be extended with the @29\n z. A closed form claimed to have asymptote exactly 4 that drifts at the level\n where the test is sharpest is a weaker object than the record currently\n describes, and the item says so.\n- **WEAK or MISS.** `4S₂` is struck from item X as the constant's closed form.\n What survives is only what the measured ratio series says: the item's ~3.8\n reverts to a measured multiple with a fourth point, and the sentence \"its\n asymptote is exactly 4, which is AGG's neighbourhood count\" loses its support\n and must be marked as an @11–@23 reading that the first blind level refused.\n The `import-stein.md` §3.2 prediction block is annotated in place, not\n deleted. The Named gap on the in-memory ceiling still closes: a MISS is a\n measurement, and it needed the same instrument.\n- **The `J`-band clause fires (`J < 0.94` or `J > 1.00`).** The headline is the\n joint deficit's own trend, not the closed form. `xchannel-triples.md` R1's\n band classifier is re-applied to `J(29)` and the pre-registered bands there\n (DEEPENING / FLAT / DECAYING ON THE FORCED TRACK / DECAYING FASTER THAN FORCED\n / GONE OR REVERSED) decide what item X's \"monotone DECAY\" clause becomes.\n- **The validation gate fails.** Nothing is reported about @29, item X is\n untouched, and the note records which row failed.\n\n## 7. Scope\n\nProducers: `research/xchan-at29-*.js`, embedded with\n`node research/qc/embed.js`. Report: `research/history/staging/xchan-at29.md`.\nThis file. No live document is edited by this run; `TODO.md`, `IMPORT-MAP.md`\nand the changelog are out of scope, and the item X update is **proposed in the\nreport, not applied**.\n"},"research/history/staging/xchan-at29.md":{"lf_sha256":"e9ea5a647477176be2851a5c0162079e52a56db8a226d1c9225b900033e1fc64","content":"# The blind @29 test of the joint-deficit closed form, and the segmented census that made it possible\n\n\n\n*(2026-08-19. TODO item X's `~3.8` constant had a zero-parameter closed-form\ncandidate with blind values pre-computed at two levels that did not exist, and a\ncensus instrument that stopped at @23 for want of 162 GB. This file builds the\nsegmented instrument, validates it against the in-memory one at five levels to\nthe unit, and spends both blind tests. Pre-registration, written and committed\nalone before any producer script existed:\n[xchan-at29-prereg.md](xchan-at29-prereg.md). Producer, formally embedded:\n`research/xchan-at29-01-segmented.js`. Every figure below is from that file's\nOUTPUT block, or is one-line arithmetic on figures in it, shown with its inputs.\nCalibration is marked on every claim: PROVEN, MEASURED, DERIVED, REFUTED.)*\n\n## Verdict\n\n**The closed form `1 − J = 4S₂` is the only one of the three pre-registered laws\nleft standing, and it is not exact.** At @29 it scores a clean HIT\n(`z = −0.90`); at @31, where the count is 1.65 billion and `σ_J` falls to\n`0.000024`, it is 4.93σ low. The two rivals the pre-registration fixed before the\nrun die at @31 at 6.35σ and 20.81σ. What the two blind levels agree on is a\n**stable relative offset of about half a percent**, `d = −0.41%` at @29 and\n`−0.48%` at @31, and the corresponding absolute residuals\n`0.028943 − 0.028823 = 0.000120` and `0.024784 − 0.024666 = 0.000118` are the\nsame number to 2%.\n\n**And the memory ceiling is gone.** The census now costs **62.0 MB of arrays at\nevery level**, and the level enters only the clock: @23 in **0.56 s** against the\nin-memory instrument's 169.89 s, @29 in **15.07 s**, @31 in **596.78 s**. The\nNamed gap \"@23 is the in-memory instrument's last level (@29 needs 162 GB)\" is\nclosed by construction, not by buying memory.\n\nFive things the run settles that the record could not:\n\n1. `J` is now measured at **seven levels** and is monotone from @17 through @31:\n 0.902452, 0.959855, 0.965932, **0.971177**, **0.975334**. Both new levels sit\n in `natal-cap-39`'s pre-registered DECAYING FASTER THAN FORCED band, so\n `xchannel-triples.md` R1's verdict rests on five points rather than three.\n2. **P1 is directly tested two and three levels beyond where it had ever been\n tested.** Aligned super-`W` obs is exactly 0 at @29 and at @31.\n3. The `1/lnW` reading of the decay, which was indistinguishable from the closed\n form at @23 and 0.4σ from it at @29, is **REFUTED at 20.81σ at @31**.\n4. The \"asymptote is exactly 4\" reading gains nothing. The measured ratio\n `(1−J)/F` runs **7.0401, 3.6905, 3.8630, 3.8240, 3.8427** over @17..@31: it\n does not rise, while the closed form's own ratio rises monotonically\n 3.7245 → 3.8612 over the same span.\n5. The candidate's residual, invisible at every level that scored it, is now\n **measured**: one detection at 4.93σ (@31) and one consistent non-detection\n at 0.90σ (@29).\n\n---\n\n## 1. What the in-memory instrument measures, and why @29 cost 162 GB\n\n`research/natal-cap-39-triple-census.js` defines, at level `x` with\n`W = ∏_{p≤x} p` and natal set `N = {r ∈ [0,W) : r ≡ 11,17 (mod 30), p ∤ r,\np ∤ r+2 for 7 ≤ p ≤ x}` and scour primes `qs = {q : x < q, q² ≤ W}`:\n\n> `J(x) = (Σ_{∏Q > W, mixed} c(Q,ε)) / (6·N̄·Σ_{∏Q > W} 1/∏Q)`,\n> `c(Q,ε) = #{r ∈ N : r ≡ −ε_q (mod q) ∀q ∈ Q}`, `ε ∈ {0,2}^Q`,\n\nwith `cls = #{q : ε_q = 0}`, `cls ∈ {0,3}` ALIGNED and `cls ∈ {1,2}` MIXED. It\nreaches the super-`W` part by the bridge\n`mixed super-W obs = Σ_{r∈N}[C(a,2)b + a·C(b,2)] − (sub-W mixed obs)`, with\n`a(r) = #{q | r}` and `b(r) = #{q | r+2}` carried as two `Uint16Array(W)` beside\na `Uint8Array(W)` natal mask. That is **5 bytes per slot of `[0,W)`**, and\n`natal-cap-35`'s version of the same pass is 25. At @29,\n`W = 6,469,693,230`, so 32 GB and 162 GB respectively — the number\n`xchannel-triples.md` §7 records, and the reason the series stopped.\n\nThe bridge's second term is the other half of the price: the sub-`W` census\nenumerates 4,517,592 triples at @23 and scans `A` at stride `∏Q` across the\nwhole of `[0,W)`, which is random access over the resident array by\nconstruction.\n\n## 2. The segmented instrument, and its two levers\n\n`research/xchan-at29-01-segmented.js`. Two changes, and neither approximates\nanything.\n\n**(L1) Exchange the order of summation.** Summing over `r` on the outside\ninstead of over triples:\n\n> `mixed super-W obs = Σ_{r∈N} #{(q₁ W}`\n> ` + Σ_{r∈N} #{(q₁ ∈ D_a(r), q₂ W}`\n\nwith `D_a(r) = {q ∈ qs : q | r}` and `D_b(r) = {q ∈ qs : q | r+2}`. Every `r`\ncontributes through its own two divisor lists and nothing else, so the census is\na sum of a bounded function of the local factorisation over a sieved interval —\nexactly the shape the corpus's segmented-sieve lever handles, and the same shape\n`research/import-scanstat-04-score.js` streams over these same 6.47e9 positions\nfor T₂₉ with a depth-64 ring buffer and no materialised gap word.\n**[MEASURED] The lists are short**: `max |D_a| = 5, max |D_b| = 6` at @29 and\n`6, 6` at @31, against the code's capacity of 7, which it checks.\n\n**(L2) Sieve the compressed slot line.** Every `r ∈ N` is `≡ 11` or `17`\n(mod 30), so only `W/15` of the line can matter. Indexing slots by `s = 2k + t`\nwith `r = 30k + (t ? 17 : 11)`, a scour prime `q` marks one class on one side at\n`r ≡ CRT(class, side) (mod 30q)` — every `2q`-th slot. The marking cost falls by\nthe full factor 15. At @29 that is **431,312,882 slots and 994,345,351 scour\nmarks** where the uncompressed line would need 1.49e10.\n\n**Exactness at the one inequality.** The kernel compares `q₁q₂q₃` to `W`. At @31\nthat product reaches 9.0e16 and is not exact in a double, so it is never formed:\n`U[m] = ⌊W/q_m⌋` is precomputed with an integer correction (the division is not\ntrusted), and the test is `q₁q₂q₃ > W ⟺ q₁q₂ > U[m]`, valid because every scour\nprime exceeds `x` so `q_m ∤ W` and `W/q_m` is never an integer. `q₁q₂ ≤ 2.0e11`\nis exact.\n\n**The denominator is computed as a tail, never as a difference.**\n`Σ_{∏Q>W} 1/∏Q` is accumulated directly over the super-`W` triples by a monotone\npointer on the third prime, so no cancellation enters it. Its consistency with\nthe other route is printed anyway: `miss + sub = e₃` agrees with the elementary\nsymmetric function to eight decimals at every level (0.25113952 at @29,\n0.33095269 at @31), and the triple counts sum to `C(K,3)` exactly\n(80,993,070,011 at @29; 8,812,286,043,484 at @31).\n\n**Memory.** `A` (1 byte) + `a` (1) + `b` (1) + two `Uint16` divisor lists of\ncapacity 7 (28) = **31 bytes per slot on 2²¹ slots = 62.0 MB, at every level**.\nThe level enters only the segment count: 206 at @29, 6,376 at @31.\n\n## 3. The validation gate — the instrument reproduces the in-memory one exactly\n\nPrereg §5 fixed this before the producer was written: no @29 number is reported\nunless the new instrument reproduces `natal-cap-39`'s embedded OUTPUT to the\nunit at @11, @13, @17, @19 and @23. Fourteen integers and three rounded reals per\nlevel, 85 comparisons in all.\n\n| level | `N̄` | `B₃` split (3,0)/(2,1)/(1,2)/(0,3) | sub-`W` triples | sub-`W` mixed | **mixed super-`W`** | (2,1)/(1,2) | `Σ_{∏Q>W}1/∏Q` | `J` |\n|---|---|---|---|---|---|---|---|---|\n| @11 | 90 | 0/2/0/0 | 0 | 0 | **2** | 2/0 | 0.006909 | 0.536070 |\n| @13 | 990 | 12/89/70/11 | 71 | 16 | **143** | 77/66 | 0.023518 | 1.023632 |\n| @17 | 14850 | 848/2729/2713/847 | 5246 | 2243 | **3199** | 1622/1577 | 0.039784 | 0.902452 |\n| @19 | 252450 | 27377/85713/85449/27391 | 162982 | 97097 | **74065** | 37139/36926 | 0.050943 | 0.959855 |\n| @23 | 5301450 | 879225/2779604/2779107/879385 | 4517592 | 3751046 | **1807665** | 904409/903256 | 0.058834 | 0.965932 |\n\n**[MEASURED] GATE: 5 reference levels checked, 0 mismatches.** Every integer,\nand `Σ_{∏Q>W}1/∏Q`, the CRT denominator and `J` at the record's own printed\nprecision. The two instruments share no data structure: one enumerates triples\nand scans a resident `W`-wide mask, the other sieves a compressed slot line in\n62 MB segments and never enumerates a triple in the numerator at all.\n\nTwo further identities hold at every level including the two new ones:\n`sub + sup = B₃` class by class (INTERNAL IDENTITY PASS), and the counted `N̄`\nequals `2∏_{7≤p≤x}(p−2)` (143,139,150 at @29; 4,151,035,350 at @31).\n\n## 4. The price, and what it now costs to go up a level\n\n| level | slots | scour marks | segments | census | level total |\n|---|---|---|---|---|---|\n| @23 | 14,872,858 | 30,527,907 | 8 | 0.55 s | **0.56 s** (natal-cap-39: 169.89 s) |\n| @29 | 431,312,882 | 994,345,351 | 206 | 13.02 s | **15.07 s** |\n| @31 | 13,370,699,342 | 33,742,377,278 | 6,376 | 544.68 s | **596.78 s** |\n\nWhole file, seven levels: **612.6 s**. The difference between the census column\nand the level column is the denominator's `K²` pass, 2.05 s at @29 and 52.10 s\nat @31.\n\n**[MEASURED] The factor at @23 is 303.** The in-memory census needed 169.89 s and\n1.203 GB there (`xchannel-triples.md` §3); this one needs 0.56 s and 62.0 MB, and\ngets the same integers. The @31 leg cost 596.78 s, which is why the prereg's\nconditional @31 clause was executed rather than deferred.\n\n**Timings are the only thing here that moves.** The file was run twice end to end\non a machine shared with four concurrent siblings, and the two runs have the\n**same normalised output hash** (`out-sha256 0c5f57087dd86f49…`): every integer,\nevery ratio and every verdict is identical, and only the wall clock differs.\n\n## 5. @29 and @31, scored against the pre-registration\n\nThe predictions are `import-stein.md` §3.2's, adopted verbatim in prereg §2 and\nhard-coded in the producer. **[MEASURED] Custody first:** `4S₂` recomputed here\nfrom the level's own prime list is **0.028943** at @29 and **0.024784** at @31,\nagreeing with the record's blind values to the printed digit. The prime lists are\n`K = 7863` and `K = 37534`, which are the record's own counts, running 31..80429\nand 37..447829 inside the intervals (29, 80429] and (31, 447829] it names, and\n`F` likewise reproduces at 0.7537% and 0.6419%.\n\n| level | mixed super-`W` obs | CRT | `J` | `1 − J` | `σ_J` | predicted `1−J` | **z** | **d** |\n|---|---|---|---|---|---|---|---|---|\n| @19 | 74,065 | 77,162.70 | 0.959855 | 0.040145 | 0.003527 | 0.041122 | −0.28 | −2.38% |\n| @23 | 1,807,665 | 1,871,421.20 | 0.965932 | 0.034068 | 0.000718 | 0.033678 | +0.54 | +1.16% |\n| **@29** | **53,660,192** | **55,252,747.16** | **0.971177** | **0.028823** | **0.000133** | **0.028943** | **−0.90** | **−0.41%** |\n| **@31** | **1,653,241,687** | **1,695,051,393.52** | **0.975334** | **0.024666** | **0.000024** | **0.024784** | **−4.93** | **−0.48%** |\n\n(The @19 and @23 rows are this instrument's own reproduction of the record; the\nrecord scores them −0.29 and +0.60 from its rounded `1−J`.)\n\n**PRE-REGISTERED VERDICTS, printed by the producer's own classifier.**\n\n- **@29: TEST 1 `z = −0.90` → HIT. TEST 2 `d = −0.41%` → TIGHT.** Combined\n verdict, prereg §3: **HIT**. The J-band clause does not fire.\n- **@31: TEST 1 `z = −4.93` → MARGINAL. TEST 2 `d = −0.48%` → TIGHT.** Combined\n verdict, prereg §3: **SURVIVES WITH A MEASURED OFFSET — right to `d`, not\n right.** The J-band clause does not fire.\n\n**[MEASURED] R1 — the offset is the finding, and it is one detection, not two.**\n`d` is −0.41% at @29 and −0.48% at @31, and the absolute residuals\n`0.028943 − 0.028823 = 0.000120` and `0.024784 − 0.024666 = 0.000118` agree to\n2%. But `σ_J` is 0.000133 at @29, so **@29 does not detect the offset** — it is\nconsistent with it at 0.90σ and equally consistent with zero. The detection is\n@31's alone, at 4.93σ. The honest statement is: *one level measures a residual\nof 1.18e−4, a second level is consistent with the same residual and cannot\nresolve it, and the two levels that fitted the closed form had error bars\n0.003527 and 0.000718, respectively 30 and 6 times too wide to have seen it.*\nNo closed form is proposed for the residual here; two points, one of them a\nnon-detection, do not license one.\n\n**[REFUTED] R2 — the two rival laws, fixed in prereg §4 before the run.**\n\n| law | @29 prediction | z at @29 | @31 prediction | z at @31 |\n|---|---|---|---|---|\n| N1, the candidate `4S₂` | 0.028943 | **−0.90** | 0.024784 | **−4.93** |\n| N2, constant multiple of `F` fixed at @23 | 0.029145 | −2.43 | 0.024818 | −6.35 |\n| N3, `1 − J ∝ 1/lnW` anchored at @23 | 0.028990 | −1.26 | 0.025165 | −20.81 |\n\nPrereg §4 registered in advance that @29 could not separate these — N3 sits 0.4σ\nfrom the candidate there — and that @31 could. It did. **N3 is refuted at 20.81σ\nand N2 at 6.35σ, and the candidate is nearer than either at both blind levels.**\nThe closed form is the last law standing, and it is also refuted as exact.\n\n**[MEASURED] R3 — the ratio does not rise, and \"asymptote exactly 4\" gets no\nsupport.** The measured `(1−J)/F`, on the producer's own `F`:\n\n| x | 17 | 19 | 23 | **29** | **31** |\n|---|---|---|---|---|---|\n| measured `(1−J)/F` | 7.0401 | 3.6905 | 3.8630 | **3.8240** | **3.8427** |\n| `4S₂/F` | 3.7245 | 3.7804 | 3.8189 | **3.8399** | **3.8612** |\n\nThe closed form's ratio rises monotonically toward 4 by construction; the\nmeasured one falls from @23 to @29 and rises again to @31, inside a spread of\n0.04. **None of that shape is resolved**: the @23 ratio's own bar is ±0.081\n(`xchannel-triples.md` R3), which swallows the whole spread. What IS resolved is\nthe vertical offset at the two sharp levels, where `σ_J/F` is\n0.000133/0.007537 = 0.018 and 0.000024/0.006419 = 0.0037: the measured ratio sits\n0.0159 below the formula's at @29 and 0.0185 below it at @31, which is the\nprimary test's 0.90σ and 4.93σ read in another column. So the \"asymptote\nexactly 4\" clause in `import-stein.md` §3.2 is a property of the formula and not\na measured trend, and the one thing the measurement does say about it is that\nthe formula runs high.\n\n**[MEASURED] R4 — `J` itself, seven levels, monotone from @17.** 0.536070,\n1.023632, 0.902452, 0.959855, 0.965932, **0.971177**, **0.975334**, with\nincrements from @17 of +0.057403, +0.006077, **+0.005245**, **+0.004157**. Both\nnew levels classify DECAYING FASTER THAN FORCED under `natal-cap-39`'s\npre-registered bands (0.945 < J ≤ 0.995), and the monotonicity clause holds. The\ndeficit is still large in its own units: at @31 the shortfall is\n1,695,051,393.52 − 1,653,241,687 = **41,809,706.52 coincidences, more than\n1,000 σ_J from zero**. Decaying is not absent, and two more levels do not make\nit absent.\n\n**[PROVEN, now MEASURED twice more] R5 — P1 holds at @29 and @31.** Aligned\nsuper-`W` obs is **exactly 0** at both, by direct enumeration of the divisor\nlists rather than by the bridge subtraction that produced the @19 and @23 zeros.\n\n**[MEASURED] R6 — the two orientations stay symmetric.** (2,1) and (1,2) split\n26,827,582 / 26,832,610 at @29 (0.019% apart) and 826,645,240 / 826,596,447 at\n@31 (0.006% apart), against 27,626,373.58 and 847,525,696.76 each. The deficit\nis not carried by one orientation at either new level.\n\n## 6. What this does not show\n\n- **No derivation.** `import-stein.md` §3.3 killed the Chen–Stein route\n (`b₃/(b₁+b₂) = 73.4` at @23) and §3.4 refuted the super-`W` decomposition\n route. Nothing here revives either. The closed form is still a formula that\n fits, now known to be accurate to about half a percent and no better.\n- **The residual is not identified.** One 4.93σ detection at one level. Any\n closed form fitted to it now would be fitted to a single number.\n- **N2 is not fully separated from N1 by structure, only by value.** A constant\n multiple with the constant re-fitted at @29 or @31 rather than at @23 would\n track the measurements as well as `4S₂` does; what @31 refutes is the specific\n constant the prereg fixed at @23.\n- **The `σ_J` error model is inherited, not derived.** These counts are exact\n arithmetic; `√obs/CRT` is the record's own Poisson proxy for their\n fluctuation, and every z here depends on it. A different fluctuation model\n moves the 4.93σ.\n- **`j = 4` is still untouched**, and the steelman is stated at `i + j ≥ 3`.\n Its missing mass at @23 is 0.040035, and the same instrument would reach it.\n- **No σ_X, no rotation ensemble, no `m`-decomposition.** This file computes the\n joint census and nothing else; `natal-cap-39`'s other columns are not\n reproduced here and are not claimed.\n- **No live document carries any of this.** `TODO.md` item X, `paper/anchored-note.md`,\n `research/moire-theorems.md`, `import-stein.md` and `xchannel-triples.md` were\n not touched. §7 proposes the item X edit; it is not applied.\n\n## 7. Proposed update to TODO item X (report only, not applied)\n\nThree edits, and one Named gap to close.\n\n**(a) The closed-form clause.** Replace *\"the `~3.8` constant now has a\nZERO-PARAMETER closed-form candidate ... landing at −0.29σ (@19) and +0.60σ\n(@23) with asymptote exactly 4 ..., and blind values pre-computed at @29 ... and\n@31 .... so the derivation stays the item's open analytic target, now with a\ntarget formula and two blind tests waiting\"* with:\n\n> **BOTH BLIND TESTS SPENT, 2026-08-19** (`research/history/staging/xchan-at29.md`,\n> pre-registered in `xchan-at29-prereg.md` and committed alone before the\n> producer existed). `1 − J = 4S₂` measures **0.028823 at @29 against the\n> predicted 0.028943 (z = −0.90, HIT)** and **0.024666 at @31 against 0.024784\n> (z = −4.93, d = −0.48%)**. It is the **only survivor of the three laws the\n> prereg fixed**: a constant multiple of the forced scale fixed at @23 dies at\n> 6.35σ and `1 − J ∝ 1/lnW` at 20.81σ, both at @31. It is also **refuted as\n> exact** — the two blind levels share a relative offset of −0.41% and −0.48%,\n> absolute residuals 1.20e−4 and 1.18e−4, detected at 4.93σ at @31 and only\n> consistent at 0.90σ at @29. **\"Asymptote exactly 4\" is untested and gains\n> nothing**: the measured ratio runs 7.0401, 3.6905, 3.8630, 3.8240, 3.8427 over\n> @17..@31 and does not rise, while the formula's rises 3.7245 → 3.8612. The\n> derivation remains the item's open analytic target and now has to produce the\n> half-percent offset as well as the leading term.\n\n**(b) The `J` series.** *\"the mixed super-W joint deficit runs J = 0.9025,\n0.9599, 0.9659 at @17/@19/@23\"* becomes *\"...0.9025, 0.9599, 0.9659, 0.9712,\n0.9753 at @17/@19/@23/@29/@31, monotone at all five, all three post-@17 levels\nin the DECAYING FASTER THAN FORCED band, and P1 (aligned super-W ≡ 0) now\ndirectly enumerated at @29 and @31 as well.\"*\n\n**(c) Named gaps.** Strike *\"@23 is the in-memory instrument's last level (@29\nneeds 162 GB)\"* and replace with:\n\n> The census is segmented (`research/xchan-at29-01-segmented.js`): **62.0 MB of\n> arrays at every level**, @23 in 0.56 s against the in-memory instrument's\n> 169.89 s and to the same integers, @29 in 15.07 s, @31 in 596.78 s. The memory\n> ceiling is gone and the clock is what is left: @29 → @31 cost a factor of 40\n> for a factor of 31 in `W`, so @37 is an overnight run rather than an\n> impossibility (extrapolated, not priced).\n\n**(d) The first move.** *\"decide whether δ's sign flip is finite-size or\nstructure before any segmented @29 rewrite\"* is spent: the rewrite exists and\nwas cheaper than the decision it was gated behind. The cheap next instrument\nnamed there, *\"j = 4's own census, missing mass 0.040 at @23\"*, is unchanged and\nis now reachable at @29 and @31 by the same code path.\n\n## 8. Files touched\n\n- `research/history/staging/xchan-at29-prereg.md`: new, committed **alone**\n before the producer existed (`27dc709`, \"prereg: xchan-at29\").\n- `research/xchan-at29-01-segmented.js`: new. Tail embedded with\n `node research/qc/embed.js --timeout 1800 research/xchan-at29-01-segmented.js`.\n **The file carries a PRESENTATION NOTE in its header and the reason is on the\n record inside it.** Each blind level was computed once before the canonical\n embed run, with these predictions and these bands already hard-coded and the\n pre-registration already committed, so neither figure was ever produced by an\n unclassified run. @29 was first computed on a revision differing only in two\n OUTPUT lines (the custody line, and a corrected scour-mark work count, which is\n printed and not used); @31 was first computed on the present revision, before\n the default level list gained 31. No band, rule, threshold, prediction or\n computed quantity changed at any point, and the embedded block reproduces both\n first runs digit for digit. The file was embedded twice: the first embed's\n header quoted the @31 probe's own census time, which the canonical run does not\n reproduce because the machine is shared with four concurrent siblings, so the\n figure was replaced by a pointer to the block's own price and the file re-ran.\n- `research/history/staging/xchan-at29.md`: this file.\n\nNo live document was edited.\n\n## 9. Gate\n\n**Before:** `node research/qc.js` TOTAL = **0**.\n\n**After:** the count **oscillates between 0 and 6** depending on the minute it\nis read, and every finding in it is `uncited-script`. `node research/qc.js\n--full` reports **117/117 checks passed** and fails the gate only on whatever\nthat TOTAL happens to be.\n\n**Reporting \"0 before, 0 after, unchanged\" would be true of a number and false\nof the fact.** The tree is shared with four concurrent siblings, as\n`xchannel-triples.md` §9 describes, and the finding set moved four times while\nthis ran: six (five siblings' scripts and this session's\n`research/xchan-at29-01-segmented.js`, waiting for the report that cites it),\nthen four (one sibling's `fdecay-deep` family), then zero, then four again as\nthat sibling's tree changed under the reading. **Since this file was written,\nnone of the findings has been this session's**: it cites its own producer, and\nthe `refs`, `quotes`, `crosslinks`, `scripts`, `transfers`, `calibration`,\n`absence`, `sourcing`, `embeds`, `provenance` and `search-convention` checks are\nall clean on both files this session wrote. `embeds` in particular is clean\nafter the numbered READINGS were appended below the OUTPUT banner, which is what\nconfirms the `code-sha256` binding was not disturbed by them.\n\n`node research/qc/embed.js --check --timeout 1800\nresearch/xchan-at29-01-segmented.js`: **code-sha256 matches, out-sha256\nmatches**, on a third full execution of the file.\n"},"research/history/staging/xchannel-at23.md":{"lf_sha256":"eaa77c372bdfe928858a8a00144aa45ec71e760fd5e2542eb3e47d67b35fe086","content":"# The X-channel at @23: the fifth point of (X̄−X(0))/S̄\n\n\n\n*(2026-08-19. TODO item X's named first move, carried out. Every figure below\ncomes from `research/natal-cap-35-x-multiplicity.js` as re-embedded today, or\nfrom the two scratch instruments named in §2, which are not repo files.\nCalibration is marked on every claim: MEASURED, DERIVED, INFERRED, REFUTED.)*\n\n## Verdict\n\n**The fifth point is `(X̄−X(0))/S̄ = +0.2658` at @23. The monotone rise holds at\nfive levels, and the rise is larger than the four-point trend predicted.**\nThe price was 18.9 s and 5.69 GB for the @23 level, 94.6 s for the whole file,\nagainst a 4-hour ceiling: affordable by a factor of about 760.\n\nThree things the run settles that four points could not:\n\n1. **The deficit has migrated into m ≥ 3 and is now dominant there.** The\n m ≥ 3 share of the X-gap runs 10.5%, 23.5%, **81.1%** at @17, @19, @23. The\n file header's warning that the anchored deficit lives at m ≥ 3 was formed\n at @17, where the m = 2 cell was in fact carrying 89.5% of the gap. At @23\n the warning is true of the gap itself for the first time.\n2. **The m ≥ 3 mechanism candidate is REFUTED as separate structure.** At the\n anchor, `ω_s(r)` and `ω_s(r+2)` are independent to 0.05% on X. There is no\n room left for \"coincidences at multiples of products, dense at the origin\"\n as a distinct effect: the one-sided cofactor law already carries 84% of the\n m ≥ 3 gap, and part4 gives that law in closed form.\n3. **@23 is this instrument's last level, and the blocker is memory.** 25 bytes\n per slot × W. @29 would need 162 GB. A sixth point needs a rewrite, not a\n bigger budget.\n\n---\n\n## 1. Assignment\n\nExtend `(X̄−X(0))/S̄` from four levels to five. TODO item X names the edit\n(`for(const x of [11,13,17,19])`) and the discipline (\"Price the run, not the\nplumbing\"). Standing state before the run:\n\n| x | (X̄−X(0))/S̄ | X(0)/X̄ | S(0)/S̄ | β | S_CRT/S̄ |\n|---|---|---|---|---|---|\n| 11 | −0.2287 | 1.4541 | 1.1768 | 1.1458 | 1.0271 |\n| 13 | +0.0134 | 0.9908 | 0.9875 | 1.0089 | 0.9788 |\n| 17 | +0.1568 | 0.9482 | 0.8573 | 0.9549 | 0.8978 |\n| 19 | +0.2225 | 0.9558 | 0.7795 | 0.9261 | 0.8416 |\n\nAssumption A, in the channel it actually lives in: *the anchored overlap-credit\ndeficit stays below (1−ε)·S̄*, which is the first column staying below 1.\n\n## 2. Instrument\n\n`research/natal-cap-35-x-multiplicity.js`, one line changed:\n`for(const x of [11,13,17,19,23])`. Tail re-embedded with\n`node research/qc/embed.js research/natal-cap-35-x-multiplicity.js --streams\nboth --timeout 600`; `--check` reconfirms both hashes. The file's previous tail\nwas a real embed, not a legacy hand-paste: `qc.js embed-backlog` classed it\n`readings-not-traceable` (advisory, 5 of 73 figures, all prose arithmetic), not\n`hand-pasted-tail`.\n\nTwo scratch instruments, in the session scratchpad and deliberately not repo\nfiles, since the task's edit budget is one line:\n\n- `xchan-price-params.js` counts the work each leg does at each level, and\n `xchan-probe.js` times the two dominant kernels at @19 and @23 array sizes.\n Both are pricing tools; §3 is their output.\n- `xchan-m3-closedform.js` runs the anchored-independence test of §7. It\n rebuilds the level from the same definitions rather than importing them, so\n its S(0) and X(0) are an independent recomputation, and they agree with the\n embedded block at all five levels.\n\n**What the instrument computes at @23 and what it does not.** `part0`, the\nfull W-rotation custody sweep, is gated on cap-31 having published a reference\nfor the level, which it did only for x ∈ {11,13,17}. So @23, like @19, gets no\nsweep: no per-rotation variances, **no σ_X**, every `z(anch)` NaN, no CUSTODY\nline. `part5(·,3)`, the j = 3 coincidence census, is gated at x ≤ 17, so the\ndirect aligned-versus-mixed test of P1 is not extended either.\n\n## 3. The price, derived before the run\n\nThe only superlinear leg is the custody sweep, O(W·N̄·H). At @23 that is\n2.23e8 rotations × 5.30e6 slots and is dead by roughly fourteen orders. It does\nnot run, so the price is the u-form path, whose legs and their exact work\ncounts fall straight out of the code:\n\n| leg | what it counts | @19 | @23 | ratio |\n|---|---|---|---|---|\n| `level` | O(W) sieve + comb build | 9.70e6 | 2.23e8 | 23.0 |\n| `uform` | `W·H` strided increments | 1.73e7 | 4.58e8 | 26.4 |\n| `part3` | O(W) + subsets with ∏Q < W | 261,332 | 6,385,817 | 24.4 |\n| `part4` | `W·Σ(1/q)` + a sieve to W | 8.66e6 | 2.29e8 | 26.4 |\n| `part5` j=2 | `4·W·Σ_{pairs}1/(q₁q₂)` | 1.53e7 | 4.66e8 | 30.6 |\n\nW goes ×23, and every leg goes ×23 to ×31 because H = Σ2/q grows from 1.7857 to\n2.0526 and the pair sum from 0.39343 to 0.52243 on top of W. K goes 435 → 1739,\nwhich touches only the O(K²) legs, and those are milliseconds. DERIVED.\n\nMeasured @19 per leg on the timed scratch copy: `level` 0.03 s, `part0` 0.00,\n`uform` 0.14, `part2` 0.01, `part3` 0.04, `part4` 0.32, `part5j2` 0.16, total\n0.70 s. Work-scaled to @23 leg by leg: 0.69 + 3.70 + 0.98 + 8.45 + 4.90 =\n**18.7 s**. MEASURED, then DERIVED.\n\nWork-scaling is only honest if the memory hierarchy does not punish the larger\narrays, which grow from about 240 MB at @19 to 5.6 GB at @23. The probe timed\nthe two dominant kernels at both sizes: the u-form increment goes 3.9 → 5.9\nns (×1.5) and the part4 factor-extraction iteration goes 21.7 → 23.9 ns (×1.1).\nConstant-stride access stays prefetcher-friendly, so the penalty is small.\nPredicted window **19 to 28 s**, ceiling with a 3× safety factor 75 s. Peak\nmemory from the array inventory, 25 bytes per slot × W, **5.58 GB** on a 64 GB\nmachine. MEASURED.\n\n**Verdict: affordable, by a factor of about 760 against the 4-hour ceiling.**\n\n**Outturn.** @23 level time **18.878 s**, peak RSS **5.69 GB**, whole file\n**94.6 s**. The derivation was out by 1%, the memory inventory by 2%. MEASURED.\n\nThis also grades reading 10 of the file's 2026-08-18 tail, which estimated\n\"tens of seconds, not hours\" before the array was edited. CONFIRMED.\n\n## 4. Pre-registration\n\n**Honesty note first, because the campaign rule exists for this.** The headline\nnumber printed on the pricing run before this file was written, so the bands\nbelow are a stated criterion, not a blind forecast. What can be checked is that\nthe arithmetic producing them uses only the four points on record and cannot\nhave been steered by the answer; it is reproduced in full so a reader can\nverify that.\n\nFrom the four points, with lnW = 7.745, 10.310, 13.143, 16.088 and lnW(23) =\n19.223:\n\n- increments +0.2421, +0.1434, +0.0657; ratios 0.592, 0.458\n- slope per unit lnW 0.09439, 0.05062, 0.02231; ratios 0.536, 0.441\n\nContinuing the increment geometrically at the last ratio gives +0.0301 and a\nfifth point of 0.2526; continuing the *ratios'* own decay gives +0.0233 and\n0.2458. The slope route gives 0.2533 and 0.2478 the same two ways. So a\nsaturating four-point extrapolation lands in **0.246 to 0.253**.\n\n| band | fifth point | reading |\n|---|---|---|\n| BROKEN | ≤ +0.2225 | the monotone rise ends |\n| FLATTENING | +0.2225 to +0.2450 | increment below the geometric continuation |\n| LEAD CONTINUES, ON TREND | +0.2450 to +0.2550 | the extrapolation's own window |\n| LEAD CONTINUES, SATURATION NOT BITING | > +0.2550 | increment above the continuation |\n\nThe monotone lead predicts a fifth point above +0.2225. Anything at or below\nthat would be the first turn in the statistic since @11.\n\n## 5. Readings\n\n**R1 [MEASURED] The fifth point is +0.2658.** Band four: the lead continues and\nsaturation is not yet biting. The increment is +0.0433 against the predicted\n+0.023 to +0.030.\n\nFull row, from the embedded block:\n\n| x | lnW | S(0) | S̄ | S_CRT | β | S_CRT/S̄ | S(0)/S̄ | X(0)/X̄ | (X̄−X(0))/S̄ | classical |\n|---|---|---|---|---|---|---|---|---|---|---|\n| 23 | 19.223 | 597,475 | 815,732.55 | 669,028.80 | 0.8930 | 0.8202 | 0.7324 | 0.9661 | **+0.2658** | 0.8884 |\n\nwith X(0) = 6,179,192, X̄ = 6,395,995.55, X_CRT = 6,249,291.79, N̄ = 5,301,450,\nK = 1739 (29..14929), H = 2.0526, W = 223,092,870.\n\n**R2 [MEASURED] The increment ratios are not monotone, so no saturating law\nfits.** 0.592, 0.458, **0.659**. Per unit lnW the slope ratios read 0.536,\n0.441, **0.619**. The four-point sequence invited a clean geometric decay and\nthe fifth point refuses it. \"The lead continues\" and \"the lead is decaying to a\nlimit near 0.26\" are different claims, and only the first survives.\n\n**R3 [MEASURED] X(0)/X̄ rises for the second consecutive level.** 1.4541,\n0.9908, 0.9482, 0.9558, **0.9661**. P5 predicted this flattening back toward 1\nand now has two rises rather than one. The paper's §10 sentence about a\ncrossing followed by a turn has a second point of turn and can drop its\n\"one turning point on four points\" hedge.\n\n**R4 [MEASURED] The factorisation closes and the truncation factor keeps\nfalling.** S_CRT/S̄ = 1.0271, 0.9788, 0.8978, 0.8416, **0.8202**, monotone at\nfive points. β·(S_CRT/S̄) = 0.8930 × 0.8202 = 0.7324 = S(0)/S̄ exactly as\nprinted. The classical column reads 0.8884 against β = 0.8930, residual\n+0.0046.\n\n**R5 [MEASURED] The @23 β leg is a reproduction gate, and it passed.**\nS(0) = 597,475, S_CRT = 669,028.80, β = 0.8930 match `paper/anchored-note.md`\n§3's @23 row and `research/OBSERVATIONS.md`'s exact table (0.8930483 against\nclassical 0.8884421, residual 4.606e−3). So @23's survivor leg was already on\nrecord and this run recomputes it by a different path. **What is new at @23 is\nthe rotation-ensemble side**, S̄ = 815,732.55 and X̄ = 6,395,995.55, which no\nother instrument computes.\n\n**R6 [MEASURED] σ_X is not computed at @23.** Nor is any z-score, nor a custody\nline. Same gate as @19: `part0` runs only for x ∈ {11,13,17}. Reading 7 of the\nfile's tail now covers two levels. The 8-to-15-σ_X framing of the annihilation\nrequirement is still a @13-and-@17 measurement and has never been extended.\n\n**R7 [MEASURED] The m-multiplicity decomposition, and the migration.**\n\nX-gap anchored − ensemble = **−216,803.55** = m=2 cell **−40,916.72** + m≥3\ncells **−175,886.83**. Per cell, (k−1)·[anchored − ensemble]:\n\n| k | anchored | ensemble | ratio A/E | (k−1)·[A−E] |\n|---|---|---|---|---|\n| 2 | 1,369,538 | 1,410,454.72 | 0.971 | −40,916.72 |\n| 3 | 817,704 | 1,063,505.93 | 0.769 | −491,603.86 |\n| 4 | 678,479 | 575,779.43 | 1.178 | +308,098.70 |\n| 5 | 152,659 | 223,074.25 | 0.684 | −281,660.99 |\n| 6 | 90,320 | 45,135.78 | 2.001 | +225,921.08 |\n| 7 | 12,301 | 2,159.12 | 5.697 | +60,851.26 |\n| 8 | 393 | 25.32 | 15.52 | +2,573.79 |\n| 9 | 2 | 0.03 | 66.7 | +15.79 |\n\nThe m ≥ 3 share of the gap runs **10.5% @17, 23.5% @19, 81.1% @23** (at @11 and\n@13 the two channels have opposite signs and a share is meaningless). The k=3,\n4, 5 ratios are stable across two levels, 0.789/1.185/0.698 at @19 against\n0.769/1.178/0.684 at @23, while the tail excess grows without bound.\n\n**R8 [MEASURED] P4's surviving half fails at @23.** At @17 the m ≥ 3 cells were\n\"large gaps that mostly cancel\": −59.24 left of a −751.28 largest cell, 8%. At\n@23 they leave −175,804 of a −491,604 largest cell, 36%. Cancellation is\nweakening as the channel takes over.\n\n## 6. The candidate mechanism at m ≥ 3, tested\n\nTODO item X names the candidate: *anchored classes {0, −2} put multi-prime\ncoincidences at multiples of products, which are dense at the origin*. Read\nliterally that is a claim of **dependence between the two strike orientations\nat the anchor**: a product q₁q₂q₃ that sits near the origin should show up in\nboth the r class and the r+2 class together, and the anchored spectrum should\nthen carry excess at large k beyond what its own two marginals allow.\n\nThe test is the anchored analogue of part3's convolution test, which the file\nonly ever runs on the ensemble. Build the anchored joint law over the natal set,\ncnt(i, j) = #{r ∈ N : ω_s(r) = i, ω_s(r+2) = j}, take its marginals, and compare\nthe true anchored spectrum n_k(0) against the independent product of those\nmarginals.\n\n| x | X(0) exact | X from independent marginals | rel err | m=2 residual | m≥3 residual |\n|---|---|---|---|---|---|\n| 11 | 28 | 27.09 | −3.254% | +7.29 | −6.38 |\n| 13 | 452 | 453.31 | +0.290% | +26.90 | −28.21 |\n| 17 | 10,381 | 10,390.29 | +0.089% | +277.90 | −287.19 |\n| 19 | 236,625 | 236,515.60 | −0.046% | +2,461.98 | −2,352.58 |\n| 23 | 6,179,192 | 6,182,284.06 | **+0.050%** | +25,287.24 | −28,379.29 |\n\n**[REFUTED] The candidate is not there, at the resolution X can see.** At @23\nthe independent-marginal model reproduces X(0) to 0.050%, against the ensemble's\n3.39% miss: a factor of 68 better. Of the −175,887 the m ≥ 3 channel loses\nagainst the ensemble, only −28,379 survives against the anchor's own marginals,\nso **84% of the m ≥ 3 gap is the one-sided cofactor law and not a coincidence\nstructure at the origin**. The two orientations at the anchor are, if anything,\n*more* independent than the ensemble's are: on n_0 at @23 both models\nover-count, the ensemble's by +0.81% and the anchor's by +0.52%.\n\n**[MEASURED] What the closed form actually is.** Part4's one-sided law already\nhas one: #{r ∈ N : ω_s(r) = i} = p_nat·(Π_i + room_i), with ratios 0.999, 1.001,\n1.000, 0.998 at i = 1..4 at @23 and p_nat = 0.14526. Convolving that law with\nitself gives X(0), and hence (X̄−X(0))/S̄, without any m ≥ 3 coincidence input.\nThat is a composite closed form for the channel, and it is the cofactor\ntrichotomy read twice rather than new arithmetic at the origin.\n\n**[INFERRED] Where the candidate could still be hiding.** X is a\nfirst-moment-weighted statistic and it weights the bulk. In the extreme tail\nthe independent model is visibly worse than in the bulk: k = 7, 8, 9 read\n0.938, 0.750, 1.340 against 0.98 to 1.02 at k = 2..5. Two of those cells hold\n393 and 2 slots. If the origin-density mechanism exists, that is where to look,\nand X will not find it.\n\n## 7. What this does not show\n\n- **Five points is still not a law.** The increment ratios are non-monotone\n (R2), so nothing here fits a limit, and Assumption A needs the statistic below\n 1−ε at *every* level. Five values below 0.27 is a lead with one more point on\n it, and the value is still rising.\n- **No σ_X, no z-scores, no custody sweep at @23** (R6). Anyone quoting @23 as a\n fifth point of cap-31's \"pair statistics cannot see this\" argument would be\n quoting a number that was never computed. That argument remains @17-only.\n- **The @23 ensemble column is unverified against brute force.** The u-form is\n checked against the sweep at @11, @13 and @17 and rests on the identity\n holding below at @19 and @23. Its survivor leg is separately confirmed (R5);\n its X̄ and S̄ are not.\n- **P1 is not tested at @23.** `part5(·,3)` is gated at x ≤ 17, so the anchored\n aligned-versus-mixed j = 3 census, which is the direct instrument for the\n origin-density claim, has no @23 row. §6 refutes the candidate through\n independence, which is a different and weaker cut than the census would be.\n- **The refutation in §6 is about X, not about the spectrum.** Individual cells\n still miss the independent model by ±25,000 to ±29,000; what cancels is the\n total. A statistic weighting the cells differently would see structure X does\n not.\n- **No sixth point from this instrument.** The per-slot array inventory is 25\n bytes (A 1, a and b 2 each, C 4, om 2, sp 8, isP and its sieve 2, piC 4). @23\n needs 5.58 GB and measures 5.69 GB. @29 has W = 6,469,693,230 and needs\n **162 GB**; its CPU cost would be about ten minutes. The wall is memory, and\n a segmented or streaming rewrite clears it.\n\n## 8. Files touched\n\n- `research/natal-cap-35-x-multiplicity.js`: levels array `[11,13,17,19]` →\n `[11,13,17,19,23]`; tail re-embedded via `research/qc/embed.js --streams both\n --timeout 600`; a dated READINGS ADDENDUM appended below the block (it sits\n after the OUTPUT banner, so the `code-sha256` binding is untouched, and\n `--check` confirms both hashes still match).\n- `research/history/staging/xchannel-at23.md`: this file.\n\nNo live document was edited. TODO.md item X, `paper/anchored-note.md` §10 and\n`research/moire-theorems.md` all carry four-point sequences that R1 to R4\nsupersede, and none of them were touched.\n"},"research/history/staging/zone-tail-01.md":{"lf_sha256":"995fa66bf4492efc853fa9fab8d888359890f0c867e805d5a35e79b7b0933cda","content":"# The zone's tail field: first per-zone dataset, the law in local units, and the mirror of the half-level head\n\n\n\nSTATUS: HELD, staging. Not integrated, not red-teamed. Producer\n`research/zone-tail-01.js`. No commits this session, so §1 is timestamped and\nNOT sealed by a git object: its only custody is that it was written to disk\nbefore the producer existed, and a reader who does not trust that should read\n§1 as a hypothesis list rather than a pre-registration.\n\nTask: TODO Z4, tail half. `zonegap-02-reduction.md` §2 lists the tail as the\n\"unstudied (cheapest piece)\" of the R0 decomposition, with one number to its\nname: band means 0.58..0.77 in ln^2(p'^2) units, from\n`research/zonegap-01.js`'s `tailM: mean(z.tail / l2(z.bound))` at X = 1e11.\nThere is no per-zone tail dataset in the corpus (greped: `zonegap-01*`,\n`zonegap-02*`, `zonegap-03*`, `destroyer-census-01*`, `ZONE-POSTULATE.md`,\n`QUESTIONS.md` sections 1 and 2, `TODO.md` Z4 - the only tail figures anywhere\nare those six band means). This note produces one.\n\n---\n\n## 0. What is still open, and what failed\n\n**Nothing is derived.** Every coefficient below is MEASURED on 1,225 zones to\n1e8. The tail's 0.7771 ln²(p'²) at [3163,1e4) has no zero-parameter derivation,\nexactly as the head's 0.6693 ln²p has none, and Hardy-Littlewood's 0.7574 sits\n2.6% below one and 11.6% above the other with nothing proven about either gap.\n\n**The band drift does not settle, so there is no law here yet.** 0.7518,\n0.7288, 0.7771 across B2, B3, B4: down then up, missing this note's own\npre-registered ≤ 0.03 per-step drift on the second step. Three non-monotone\npoints over two decades are band composition. The corpus's existing sentence\nabout the head's 0.669..0.753 spread applies verbatim.\n\n**One pre-registered prediction is refuted, and it is mine.** §1 (E4b) said the\nhead's frozen √p level would identify the tail in at most 5 of 1,225 zones. It\nidentifies it in 280 (22.86%). The registered number came from pricing the\nevent at a fixed tail instead of averaging over the tail's distribution; the\ncorrected Mertens price is 15.21%, the right order, and the registered figure\nwas never defensible.\n\n**The one interesting number is unresolved.** The tail runs 6.19% above the\nrenewal functional R at B4 (t/R = 1.0619) and 6.19% above an exhaustively\ncomputed class-matched origin null over 5,962,057 origins — but the bootstrap\nover the 782 zones is [0.9937, 1.1321] and contains 1, and the pre-registered\nSURPLUS rule required the interval to clear +0.03. It does not. NOT RESOLVED,\nand what it needs is 27,292 zones at 1e11 (315.7 s by zonegap-01's embed), not\nmore analysis of these 782.\n\n**The mirror question does not have the answer its phrasing expects.** The\nfrozen-sieve last-survivor test reads 100% at the zone's own level p — but that\nis the Zone Restriction Lemma restated, a theorem, not a rate, and it must not\nbe quoted beside the head's 96.65% as though the two were the same measurement.\nThe comparable measured rate is one fold back: 98.69%.\n\n**The control saw nothing, which is the result.** Three matched non-square\nendpoints of the same width give sign tests z = 0.14, −0.54, +0.66 and six\npaired-difference bootstrap intervals that all contain zero. Nothing measured\nhere is a property of the endpoint being a prime square.\n\n**What moved.** The tail field exists, one number per zone on the head census's\nown 1,225 zones, on an engine that reproduces zonegap-01's three published\ndecade means and the census's head coefficient to three decimals. Z4's tail\nhalf now has data where it had six band means. The R0 shares are filled in and\nthey say the tail does not matter: 1.82% head, 89.72% Z2, 8.46% tail at B4,\nwith the tail's share falling and Z2's rising. Z4's \"win\" clause — two of three\npieces with derived laws — is NOT met; the tail has a measured law with an\nunsettled coefficient, and nothing here is a bound.\n\n---\n\n## 1. PRE-REGISTRATION (written 2026-08-28 14:53Z, before `research/zone-tail-01.js` was written and before any number was computed)\n\n**The statistic.** Conventions are `zonegap-01.js` section 0's verbatim, as\n`zonegap-02-reduction.md` restates them: a pair is named by its opener a; the\npair is IN ZONE p iff `p < a` and `a + 2 < p'^2`, both strict, so both members\nlie strictly inside the open interval (p, p'^2); `a_last(p)` is the largest\nsuch opener; and\n\n tail(p) = p'^2 - a_last(p).\n\nThe tail is measured to the OPENER, exactly as head(p) = a_first(p) - p is.\nThat is the mirror-consistent choice and it is not the mirror-symmetric one:\nthe head's window has slack 0 at its own end (a_first can be p + 1 in\nprinciple) while the tail's has slack 2 forced by `a + 2 < p'^2`, so the tail\ncarries a deterministic +2 the head does not. Stated, not corrected; at the\npredicted scale (hundreds) it is below the third digit.\n\n**The range.** `destroyer-census-01.js`'s zone list verbatim: primes p >= 7\nwith `p'^2 - 1 <= 1e8`. Expected 1,225 zones, p = 7 .. 9967. The producer\nASSERTS the count is 1225; if it is not, this is not the head census's range\nand every comparison below is void.\n\n**Bands.** The census's own head bands, so the head numbers are quotable\nwithout re-banding: B1 [7,100), B2 [100,1000), B3 [1000,3163), B4 [3163,1e4).\nSecondary, for continuity with `zonegap-01`: decades of p, 10^0..10^3.\n\n**Estimator.** Ratio of sums, `sum(tail) / sum(ln^2(p'^2))`, which is\n`destroyer-census-01.js` SEC 6(a)'s `hZoneSum / hZoneLn2` estimator with the\nhead's arguments replaced by the tail's. Reported in BOTH units: local\n`ln^2(p'^2)` and `ln^2 p`. Interval: seeded bootstrap over zones within band,\n2000 resamples, 2.5/97.5 percentiles.\n\n**(E1) The law - what symmetry with the head predicts.** The head is the\nforward recurrence time of the twin-gap process at height p; the tail is the\nbackward recurrence time of the same process at height p'^2. For a renewal\nprocess the two have the same mean, R = E[g^2] / 2E[g]. Hardy-Littlewood puts\nthe mean twin gap at height n at ln^2(n) / (2 C2) = 0.7574 ln^2 n, so the\nHL-referenced coefficient at the tail is the SAME 0.7574 the head is referenced\nto. **Prediction: c_tail = 0.72 +- 0.05 in ln^2(p'^2) units at B4 - the head's\n0.72 ln^2 p coefficient reappearing verbatim once the units are local.** In\nln^2 p units the same prediction reads about 4 x 0.72 = 2.9, because\nln^2(p'^2) = 4 ln^2 p' ~ 4 ln^2 p. That factor of four is units and not\nphysics, and any statement of the form \"the tail is four times the head\" that\ndoes not say so is wrong.\n\n**(E2) The prime-origin factor - the mirror of the head's residual.** The head\ncarries h/R = 1.09 -> 1.03 (`destroyer-census-01.md` section 6(b)), read as an\nexcess from the origin p being PRIME. The tail's origin p'^2 is not prime.\n**Prediction: t/R_tail = 1 to within 0.03 at B4, against the head's +0.09 ->\n+0.03.** Verdict rule, fixed now: SURPLUS if `t/R - 1 >= +0.03` at B4 with the\nbootstrap interval excluding +0.03; DEFICIT if `<= -0.03` likewise; MATCH\notherwise. Comparator caveat registered in advance, from\n`redteam-0828-head.md`: R is the CONTINUUM functional and a discrete integer\norigin sees `R + 1/2` exactly, so the discrete-consistent comparator for the\ninteger origin p'^2 is R + 1/2 and both are reported. p'^2 is confined to\nresidues {1, 19} mod 30 for p' >= 7, so a class-matched comparator (origins\ndrawn from {1,19} mod 30) is reported as well; on the head that choice of\npopulation moved the residual by a factor of two.\n\n**(E3) Band drift.** Prediction: |c_tail(B4) - c_tail(B3)| <= 0.03 in local\nunits, with the B2..B4 spread <= 0.05. A larger spread will be called band\ncomposition and not a law, exactly as the census called the head's\nnon-monotone 0.669..0.753 half-decade spread.\n\n**(E4) The frozen-sieve identification, mirroring section 6(a).** The head test\nfreezes the sieve at level sqrt(p) - the level that certifies primality at the\nhead's own height - and asks whether the first frozen-survivor above p is the\nhead pair. It is, in 1,184 of 1,225 zones (96.65%), the failures being treads\nq^2 with q in (sqrt(p), sqrt(a_first+2)] landing in the head window. The tail's\nown certifying level at height p'^2 is p'. Three tests, at three levels:\n (a) **Level p.** Predicted 1225/1225 = 100%, and this is a THEOREM, not a\n measurement: the Zone Restriction Lemma (`zonegap-02-reduction.md`\n section 1) says the level-p rough numbers in (p, p'^2) are exactly the\n primes there. Asserted; one failure is an engine bug, not a finding. The\n registered reading of a 100% here is therefore \"the mirror at the zone's\n own level is exact where the head's is 96.65%, and the asymmetry is\n structural, not statistical\" - the head sits at height p where the zone's\n level p is quadratically over-strong, the tail at height p'^2 where it is\n exactly right.\n (b) **Level sqrt(p) - the literal mirror, the head's own frozen level applied\n at the deep end.** Predicted 0 of 1225 for p >= 100; registered band\n [0, 5] zones over the whole range.\n (c) **Level p^- (the prime preceding p), one fold back - the non-vacuous\n mirror.** This is the tail's analogue of \"does the newest sieve activity\n move the boundary slack\": the survivors level p^- keeps and level p does\n not are exactly the n = p*m in [p^2, p'^2) with m p-rough, of which the\n whole zone holds O((p' - p)/ln p) against a tail window of length ~3\n ln^2 p. **Prediction: >= 99%, strictly above the head's 96.65%.**\n Registered band [98%, 100%]. Below 96.65% the mirror is INVERTED and this\n prediction is refuted.\n\n**(E5) The worst case.** max tail per band against ln^2(p'^2) and against the\nwidth. Prediction: max tail / ln^2(p'^2) in [2.5, 6] at B4, and\nmax tail / width <= 1e-3 at B4. Registered falsifier: max tail/ln^2(p'^2) > 8,\nor any zone with tail >= width (impossible by R0; an engine bug).\n\n**(E6) The R0 accounting.** `head + Z2 + tail <= width` at every zone, with\nequality iff the zone holds exactly 2 pairs - a THEOREM\n(`zonegap-02-reduction.md` (R0)), ASSERTED per zone here, not measured. Shares\nof width per band reported for all three pieces. Prediction: the three pieces\ntogether take < 1e-3 of the width at B4.\n\n**(E7) The matched control.** For each zone, a right endpoint at the same\nheight and the same width that is NOT a prime square:\n`E(p) = p'^2 - h(p)`, with `h(p)` a deterministic seeded offset in\n[W/4, 3W/4], W = p'^2 - p; the control window is (E - W, E) and\n`ctrl(p) = E - (largest opener a with a + 2 < E and a > E - W)`. The producer\nasserts E is not a perfect square. Comparison follows the repo's pooling rule\n(`record-location-null.js` N3): each side is divided by ln^2 of ITS OWN right\nendpoint before anything is pooled, the per-zone paired ratio distribution and\na sign test are reported FIRST, and only then the band means.\n**Prediction: no difference - median paired ratio in [0.95, 1.05] and the sign\ntest not significant at 1,225 zones, |z| <= 2.6.** A significant surplus at the\nsquare endpoint would be a real finding and is registered here as needing its\nown pass before it is believed, not as a result of this one.\n\n**Price.** Neighbours' embedded `elapsed`: `destroyer-census-01.js` 2.0 s at\nthe same 1e8 range and the same zone list; `zonegap-01.js` 315.7 s at 1e11;\n`zonegap-03-model.js` 1.2 s. This pass is 1e8 with per-zone local window work,\npriced at under 60 s, which is under the 4-hour rule and so is simply run.\n\n---\n\n## 2. The pre-registered scorecard\n\nEvery row was fixed in §1 before `research/zone-tail-01.js` existed. Figures\nare from that file's embedded OUTPUT block (`node research/qc/embed.js --check`\nreads `body matches out-sha256 — the pasted block is bit-honest`; 1.0 s).\n\n| # | pre-registered | measured | verdict |\n|---|---|---|---|\n| E1 | c_tail = 0.72 ± 0.05 in ln²(p'²) units at B4 | 0.7771, bootstrap [0.7301, 0.8271] | **MISSED**, narrowly — the point estimate sits above the band's top, the interval straddles it |\n| E2 | \\|t/R − 1\\| ≤ 0.03 at B4 (MATCH), ≥ +0.03 with the interval clear of it (SURPLUS) | t/R = 1.0619, bootstrap [0.9937, 1.1321] | **NOT RESOLVED** — point estimate is a surplus, the interval is not |\n| E3 | \\|c(B4) − c(B3)\\| ≤ 0.03; B2..B4 spread ≤ 0.05 | 0.0483 and 0.0483 | **step MISSED, spread HIT** |\n| E4a | level p identifies the tail at 1225/1225 (a theorem) | 1225/1225 | **HIT** (asserted, not measured) |\n| E4b | level √p identifies it in ≤ 5 zones | 280 zones (22.86%) | **REFUTED — the prediction, not the data** |\n| E4c | level p⁻ identifies it at 98–100%, above the head's 96.65% | 98.69% | **HIT** |\n| E5 | max tail/ln²(p'²) ∈ [2.5, 6] at B4; max tail/width ≤ 1e-3 | 3.664 and 2.00e-5 | **HIT** |\n| E6 | head + Z2 + tail < 1e-3 of width at B4 | 8.20e-5 | **HIT** |\n| E7 | control median paired ratio ∈ [0.95, 1.05], sign test \\|z\\| ≤ 2.6 | median 1.0102, z = 0.14 (control A, the pre-registered one) | **HIT** |\n\nSix hits, one narrow miss, one split, one unresolved, one prediction refuted.\nThe refuted one is mine: §1 (E4b) priced P(no √p-rough pair above a_last) at a\nfixed tail instead of averaging over the tail's own distribution. Averaged, the\nsame Mertens price reads 15.21% against the measured 22.86% — the right order,\nand the registered [0, 5] zones was never a defensible number.\n\n## 3. The law, and what the factor of four is\n\n| band | zones | mean tail | c = Στ/Σln²(p'²) | bootstrap | in ln²p units | head c, same zones |\n|---|---|---|---|---|---|---|\n| [7,100) | 22 | 33.64 | 0.5740 | [0.4315, 0.7423] | 2.4277 | 0.8530 |\n| [100,1000) | 143 | 113.65 | 0.7518 | [0.6490, 0.8545] | 3.0220 | 0.9863 |\n| [1000,3163) | 278 | 167.56 | 0.7288 | [0.6443, 0.8135] | 2.9185 | 0.7494 |\n| [3163,1e4) | 782 | 237.26 | 0.7771 | [0.7301, 0.8271] | 3.1096 | 0.6693 |\n\n**The caveat first: the coefficient does not settle.** B2 → B3 falls 0.0230,\nB3 → B4 rises 0.0483, and the pre-registered ≤ 0.03 per-step drift is missed on\nthe second step. Three points that go down then up over 1,203 zones are band\ncomposition on a range two decades wide, not a measured convergence to\nanything. The same sentence stands in `destroyer-census-01.md` §6(b) about the\nhead's own 0.669..0.753 half-decade spread (cited, not recomputed here), and it\nis not weaker here.\n\n**The unit is the whole story of \"four times\".** `c_p / c_local = 4.0013` at\nB4, which is `ln²(p'²) = 4 ln²p'` and nothing else. The tail is 3.1096 ln²p\nwhere the head is 0.6693 ln²p; those two numbers describe the same renewal\nfunctional evaluated at heights p and p², and a report of \"the tail is four\nand a half times the head\" without the unit would be an artefact quoted as a\nfinding.\n\n**In local units the two are close and the tail is the larger.** 0.7771 against\nthe head's 0.6693 at the same 782 zones with the same estimator, both\nreferenced to HL's 1/(2 C₂) = 0.7574 — the head 11.6% below it, the tail 2.6%\nabove. That is the row `zonegap-02-reduction.md` §2's scale table did not have.\n\n**Custody.** This is an independent engine, and it reproduces to three decimals\nthe only tail figures the corpus already held: zonegap-01.js's decade means\n0.578 / 0.768 / 0.766 (its mean-of-ratios estimator, its X = 1e11 sweep), and\n`destroyer-census-01.js` SEC 6(a)'s head coefficient 0.6693. It also\nrecomputes 164 zones below 1e6 and zonegap-02's five hand-verified levels by\nbrute force, and asserts π₂(1e8) = 440,312 against A007508. A miss on any of\nthose would have voided the file.\n\n## 4. The frozen-sieve mirror: 100%, and it is a theorem, not a rate\n\n`destroyer-census-01.md` §6(a) reads: head(p) IS the first survivor of the\nfrozen √p-level sieve above p in 1,184 of 1,225 zones (96.65%). The task asked\nfor the mirror at the deep end. It measures 100%, and the reason it does is\nstructural, so the two numbers must not be quoted side by side as if they were\nthe same kind of thing.\n\n| frozen level | identifies a_last | price |\n|---|---|---|\n| p — the zone's own level | **1225 / 1225 (100%)** | a THEOREM: the Zone Restriction Lemma |\n| p⁻ — one fold back | 1209 / 1225 (98.69%) | exact: 88 extra survivors, 18.18% of them bite |\n| √p — the head's own level | 280 / 1225 (22.86%) | Mertens, averaged over the tail: 15.21% |\n\n**(a) The level-p row is not a measurement.** For n < p'² with no prime factor\n≤ p, n is prime (`zonegap-02-reduction.md` §1). So the last level-p-rough pair\nbelow p'² is the last twin pair below p'², identically, at every zone and at\nevery p. The producer checks it by trial division rather than by reading the\nsieve array that produced a_last, so the row is an independent verification of\nthe lemma; it is not evidence about the tail. **The honest statement of the\nasymmetry: the head's certifying level at its own height p is √p, which is the\nsquare root of the zone's level, so a whole half-ladder of folds is still to\ncome and treads can still arrive; the tail's certifying level at height p'² is\np', which the zone's level p already covers, and the deep end is besides a\nproven onset desert (`zonegap-02-reduction.md` §4, (D1)). The head is a\nhalf-level object and the tail is a full-level one.** That is a restatement of\nthings already proven in the corpus, not a new fact; what is new is the\nmeasurement that the corresponding rate is 100% and not 99-point-something.\n\n**(b) One fold back is where the mirror becomes non-vacuous, and it is priced\nexactly.** Freezing at p⁻ keeps exactly the n < p'² with lpf(n) = p. Counted\nin the 1,225 tail windows: 88 of them, 0.0718 per zone, of which 16 (18.18%)\nactually move a_last — the rest have no level-p⁻ rough partner two away. So\n98.69%, above the head's 96.65%, with the residual accounted for integer by\ninteger rather than modelled. This is the one row that is a genuine\nmeasured mirror, and it went the way §1 registered.\n\n**(c) The head's own frozen level fails at the deep end, and §1's number for it\nwas wrong.** 280 zones, not ≤ 5. §1 priced the event at a fixed tail; the tail\nis roughly exponential with mean 237 at B4 and the √p-rough pair spacing is\nabout 44, so the average of exp(−tail/44) is near 1/(1 + 237/44) ≈ 16%, and the\nproducer's zone-by-zone Mertens price reads 15.21% against a measured 22.86%\n(Mertens under-counts here, u = ln(p'²)/ln √p ≈ 4, where the Buchstab\ncorrection is not negligible). Registered band [0, 5]: refuted, by my\narithmetic and not by the data.\n\n## 5. The renewal comparator and the control: a surplus the data cannot resolve\n\n| band | height range | mean gap g | R = E[g²]/2E[g] | mean tail t | t/R | t/(R+½) | class-origin null | t/null |\n|---|---|---|---|---|---|---|---|---|\n| [7,100) | [1.2e2, 1.0e4] | 49.94 | 42.90 | 33.64 | 0.7841 | 0.7751 | 49.77 | 0.6759 |\n| [100,1000) | [1.1e4, 1.0e6] | 124.43 | 114.64 | 113.65 | 0.9913 | 0.9870 | 120.75 | 0.9412 |\n| [1000,3163) | [1.0e6, 1.0e7] | 177.30 | 164.11 | 167.56 | 1.0210 | 1.0179 | 170.15 | 0.9848 |\n| [3163,1e4) | [1.0e7, 9.9e7] | 235.93 | 223.42 | 237.26 | **1.0619** | 1.0595 | 229.46 | 1.0340 |\n\n**The caveat first: the B4 bootstrap is [0.9937, 1.1321] and contains 1.** The\npre-registered SURPLUS rule required the interval to clear +0.03, and it does\nnot. The verdict is NOT RESOLVED at 1,225 zones, and the correct next move is\nmore zones, not more analysis of these.\n\n**The class-matched null is exact and says the same thing.** Every p'² with\np' ≥ 7 lies in {1, 19} mod 30 (asserted over all 1,225 zones), so the exactly\nmatched comparator is the mean backward distance from *every* integer of that\nclass at the same heights. Computed exhaustively — 5,962,057 origins at B4 —\nand under the pooling rule (each unit divided by ln² of its own height before\npooling) the zones read 0.7793 against the null's 0.7339, a ratio of 1.0619.\nThe null's own sampling error is negligible at six million origins; all of the\nuncertainty is in the 782 tails, which is exactly what the bootstrap says.\n\n**Three matched controls see nothing.** The pre-registered control (E7) puts a\nnon-square endpoint of the same width at a seeded offset; two more match the\nresidue class and the height (the height-matched one within 0.033% in ln,\nNOT pre-registered and labelled so in the producer).\n\n| control | median paired ratio | sign test z | paired difference at B4, mean [bootstrap] |\n|---|---|---|---|\n| A — free endpoint (pre-registered) | 1.0102 | +0.14 | 0.0623 [−0.0151, 0.1374] |\n| B — class-matched, E ≡ p'² mod 30 | 0.9687 | −0.54 | 0.0402 [−0.0329, 0.1140] |\n| C — height-matched to 0.033% (not pre-registered) | 1.0826 | +0.66 | 0.0652 [−0.0012, 0.1286] |\n\nAll six paired-difference intervals contain zero and all three sign tests are\nunder one sigma. **Nothing measured here is a property of the endpoint being a\nprime square.** The band-mean ratios do run 1.05..1.09 at B3 and B4 in all\nthree controls, the same direction and the same size as the class-origin\nsurplus — which is consistent with a real few-per-cent effect and equally\nconsistent with none, and the paired test at this n cannot tell them apart.\nReported as an open direction, not as a finding.\n\nTwo more things the head's own residual work forces to be said here. R is the\nCONTINUUM functional (`redteam-0828-head.md`), so `t/(R + ½)` is the\ndiscrete-consistent column and it is the smaller one; and the class-origin null\nis the comparator that removes both corrections at once, which is why it is\ncomputed exhaustively rather than modelled. The head's comparable figure is\nh/R = 1.09 → 1.03 across its five windows, with the same objection standing\nagainst it.\n\n## 6. The worst case, and the R0 accounting\n\n| band | max tail | at p | /ln²(p'²) | /width | max/mean |\n|---|---|---|---|---|---|\n| [7,100) | 80 | 29 | 1.696 | 8.58e-2 | 2.38 |\n| [100,1000) | 500 | 743 | 2.851 | 8.88e-4 | 4.40 |\n| [1000,3163) | 938 | 2203 | 3.956 | 1.93e-4 | 5.60 |\n| [3163,1e4) | 1172 | 7643 | 3.664 | 2.00e-5 | 4.94 |\n\nGlobal maximum of tail/ln²(p'²) is 4.007, at p = 4943 (tail 1160, width\n24,507,458). The ratio max/mean is 4.4, 5.6, 4.9 over B2..B4 — flat, with no\ngrowth visible, which is what a light-tailed extremal law would look like and\nalso what 143, 278 and 782 draws from a heavier one would look like. No\nextremal analysis is offered; this is four order statistics.\n\n**R0 is asserted, never measured.** `width = head + Σgaps + tail` holds\ndigit-exactly at all 1,225 zones (it telescopes: Σgaps = a_last − a_first), and\n`head + Z2 + tail ≤ width` at all 1,225. The equality clause of\n`zonegap-02-reduction.md` (R0) is vacuous on this range: no zone here holds\nexactly 2 pairs, all 1,225 hold ≥ 3 and all 1,225 are strict.\n\n| band | head/width | Z2/width | tail/width | sum/width | head / Z2 / tail share of the sum |\n|---|---|---|---|---|---|\n| [7,100) | 9.97e-3 | 8.64e-2 | 2.79e-2 | 1.24e-1 | 6.26% / 75.94% / 17.81% |\n| [100,1000) | 2.32e-4 | 5.38e-3 | 1.16e-3 | 6.77e-3 | 3.84% / 84.39% / 11.77% |\n| [1000,3163) | 1.23e-5 | 4.83e-4 | 5.22e-5 | 5.47e-4 | 2.52% / 87.69% / 9.80% |\n| [3163,1e4) | 1.46e-6 | 7.31e-5 | 7.53e-6 | 8.20e-5 | 1.82% / 89.72% / 8.46% |\n\n**The reading that matters for Z4's \"win\" clause.** The tail is between four\nand five times the head and an order of magnitude below Z2, and its share of\nthe three-piece sum is FALLING with height, 17.81% → 8.46%. Z2 takes 89.72% at\nB4 and is rising. Filling in the tail row does not move the decomposition's\ndifficulty anywhere: the ln³ piece was the obstruction before this pass and it\nis more of the obstruction after it. Nothing here weakens the standing grade\nthat the chain is TPC-strength end to end (`zonegap-02-reduction.md` (R1)); the\nmargin p²/(3.9 ln³p) is not evidence and was never counted as any.\n\n## 7. NOT REACHED\n\n- **No derivation.** Every coefficient here is MEASURED. The 0.7771 at B4 has\n no zero-parameter derivation any more than the head's 0.6693 does, and the\n same HL constant 0.7574 sits above one and below the other with nothing\n proven about either gap.\n- **The +6% is unresolved and needs zones, not thought.** The single decisive\n next measurement is the same statistic to 1e11 — `zonegap-01.js`'s own range,\n 27,292 zones instead of 1,225, priced at 315.7 s by its embed. That is the\n one thing that would turn reading 7 into a verdict, and it was not run here\n because §1 fixed the range at the head census's 1,225 for comparability.\n- **The tail's DISTRIBUTION is untouched.** Only means, one worst case per band\n and a sign test. No shape, no extremal law, no comparison against the\n Kourbatov ceiling that the head's worst case is quoted against\n (`zonegap-02-reduction.md` §2, \"worst 0.72 of the Kourbatov ceiling at height\n p\"); the tail has no such comparator here.\n- **No proven bound on the tail at the window scale**, which is the only thing\n that would be progress on the chain. This note produces a field, not a bound.\n- **Band [7,100) is 22 zones** and every figure in that row should be read as\n noise; it is carried only because the census carries it.\n- **The height-matched control C is not pre-registered** and must be read as a\n robustness check that was chosen after seeing A and B, not as a test.\n\n---\n\n*Producer and custody: `research/zone-tail-01.js`, embedded\n(`node research/qc/embed.js --check` reads code-sha256 matches, body matches\nout-sha256, out-sha256 matches; one advisory, the figure 0.753, which is cited\nfrom `destroyer-census-01.md` §6(b) and not computed here). 1.0 s. Seeds:\n20260828 (band bootstrap), 555000111 (t/R bootstrap), 917234561 (controls A\nand B), 220044660 (control C), 31415926 (paired differences); the control\nstreams are separate so that adding control C could not move the\npre-registered control A, which it did once and was fixed. Cited, never\nrecomputed: `zonegap-01.js`'s decade tail means and the 0.7229 head\ncoefficient at its own higher levels, `destroyer-census-01.md` §6(a)'s\n1184/1225 = 96.65% and §6(b)'s h/R = 1.09 → 1.03 and 0.669..0.753 spread,\n`zonegap-02-reduction.md` §1 (Zone Restriction Lemma), §2 (R0) and §4 (D1),\n`redteam-0828-head.md`'s continuum-versus-discrete R, π₂(1e8) = 440,312\n(A007508). History layer: process record, staging. See\n`research/history/CHANGELOG.md` for the corpus rule.*\n"},"research/history/staging/zonegap-02-reduction.md":{"lf_sha256":"3f35bdaea5d8835e15c85c66218220deb02028059a60e5a9f0dbf11ee2d66e40","content":"# The Z2 reduction: the Zone Restriction Lemma, the three-slack chain graded honestly, the head machinery's transfer inventory, and a proof that the deep end is an onset desert\n\n\n\n*(2026-08-21. Staging note; nothing here is integrated into a live document.\nProducer, formally embedded: `research/zonegap-02-reduction.js` (0.1 s;\ncode-sha256 ed74bb89..., out-sha256 a278320d...); every identity below is\nverified there exactly, at 5 levels for the lemma and chain, 24 levels for the\ndeep end, abort-on-mismatch, calibrated first against the G2 ladder\n(`G2-STATE.md` §2) and zonegap-01's Z2 values. This is the PROOF-TARGET\ndocument for TODO item Z: what must be proven, what already is, and what the\nproven head machinery does and does not give the zone. Calibration marked per\nclaim: PROVEN, VERIFIED by exact computation, MEASURED, OPEN, REFUTED.\nConventions are zonegap-01's throughout\n(`research/history/staging/zonegap-01.md` §0): pairs named by opener a; in\nzone p iff p < a and a+2 < p'^2, both strict; gaps opener-to-opener; Z2 their\nmax, defined when the zone holds >= 2 pairs (it does, at every zone to 1e11);\nhead = a_first - p and tail = p'^2 - a_last, counted separately, never inside\nZ2.)*\n\n## 1. The Zone Restriction Lemma [PROVEN; VERIFIED at p = 7, 11, 13, 17, 23]\n\n> **Lemma A.** Fix a prime p, let p' be the next prime, W = p#, and let the\n> boundary conventions be zonegap-01 §0's. Then the in-zone twin-slot openers\n> of T_p and the in-zone twin-prime openers are the SAME SET:\n>\n> { a : p < a, a+2 < p'^2, gcd(a(a+2), W) = 1 }\n> = { a : p < a, a+2 < p'^2, a and a+2 prime }.\n>\n> Consequently every zone statistic — the gap multiset, Z2(p), head, tail,\n> the pair count — has two readings, prime-side and slot-side, and they are\n> equal numbers, not analogous ones: **Z2(p) IS the whole-tile gap object\n> restricted to the head window (p, p'^2).**\n\n*Proof.* (⊇) A prime exceeding p is coprime to W. (⊆) A hole n of T_p with\n1 < n < p'^2 has no prime factor ≤ p; if n were composite its least prime\nfactor would exceed p, forcing n ≥ p'^2. So both members of an in-zone slot\npair are prime. ∎\n\nTwo supporting clauses, each one line, both verified per level (SEC A):\n**the first hole of T_p above 1 is exactly p'** (any n in (1, p') is either a\nprime ≤ p, dividing W, or composite with least factor ≤ √n < p), and **every\nhole in (p, p'^2) is prime**. Producer check: sets equal at all five levels\n(8, 9, 16, 17, 29 in-zone pairs), and Z2/head/tail identical computed either\nway.\n\nOne convention caveat, carried explicitly: \"head\" presupposes an in-zone\nfirst slot, i.e. occupancy. The tile's first twin-slot opener above p equals\nthe zone's first pair opener PROVIDED its closer lands below p'^2 — which is\nthe postulate at p. Measured standing: every zone to 1e11 holds ≥ 2 pairs\n(zonegap-01 §2), so head, tail and Z2 are all defined on the entire measured\nrange.\n\n## 2. The reduction chain, exact and graded\n\n**(R0) Partition identity [PROVEN; VERIFIED SEC B].** When the zone holds\nk ≥ 1 pairs, width = head + Σ gaps + tail exactly; for k ≥ 2, Z2 ≤ Σ gaps,\nhence\n\n head + Z2 + tail ≤ width, with equality iff k = 2, strict iff k ≥ 3.\n\nVerified digit-exact at all five levels (e.g. p = 23: 818 = 6 + 798 + 14;\nhead + Z2 + tail = 170 < 818).\n\n**(R1) The chain as tasked [PROVEN, with its circularity stated].**\n\n> Z2(p) + head(p) + tail(p) < p'^2 − p for infinitely many p\n> ⟹ infinitely many zones occupied ⟺ TPC.\n\nThe second equivalence is ZONE-POSTULATE.md §2 (PROVEN, both directions,\nelementary — cited, not re-proven). The first implication is immediate but\nmust be read honestly: the premise's three objects are DEFINED only when the\nzone holds ≥ 2 pairs, so the premise already contains occupancy, and by (R0)\nthe strict inequality is exactly \"≥ 3 pairs\". The implication is trivially\nPROVEN; the entire difficulty is producing the premise — an a-priori bound on\nthe tile's window-restricted slot structure that forces the objects to be\ndefined. That step is TPC-strength and no wording of the chain evades it\n(zonegap-01 §5: the max is the wall; first-moment arguments closed,\n`REFUTED.md` Route B; the residue form of the same statement is the postulate\nitself, `attack-l1-residue.md`).\n\n**(R2) The non-circular sufficient form [PROVEN].** Occupancy at p needs one\npair, so the minimal premise is a first-slot bound: if F(p) denotes the\ndistance from p to the tile's first twin-slot opener above p, then\n\n F(p) < p'^2 − p − 2 for infinitely many p ⟹ weak Zone Postulate ⟺ TPC,\n\nand the currently proven instrument for F is §3.1's Euclid anchor:\nF(p) ≤ G2(p#) − p − 1 — which, with G2 ≪ (ln W)^{4.2665+ε} = p^{4.2665+ε}\n(paper/beta2-note.md), misses the needed p^2 by exactly the programme's open\nexponent band (2, 4.2665].\n\n**The honest grade.** The chain is TPC-strength end to end; its value is the\nDECOMPOSITION, not a weakening. The three pieces have separately measured\nscales and separately attackable mechanics, against a width that grows like\np^2 [all MEASURED, zonegap-01]:\n\n| piece | scale (measured) | its machinery |\n|---|---|---|\n| head | mean 0.7229 ln²p (HL coefficient 0.7574); worst 0.72 of the Kourbatov ceiling at height p | anchored/origin, first-passage |\n| Z2 | ln³ family, band constants c3 = 3.43..4.02, drifting; record envelope | Kourbatov / A113274 literature, record staircase |\n| tail | band means 0.58..0.77 in ln²(p²) units | unstudied (cheapest piece) |\n| width | p'^2 − p ~ p² | free |\n\nEach piece is polylog against a quadratic width; the margin diverges like\np²/(3.9 ln³p) and none of that divergence is evidence (square-window lesson,\nZONE-POSTULATE.md §5a). What would count as progress is a PROVEN bound on any\npiece at the window scale — and §3 inventories exactly what is proven today.\n\n## 3. The transfer inventory: what the proven head machinery gives the zone\n\n### 3.1 Euclid-in-moiré (the edge pair)\n\n- **[PROVEN; VERIFIED SEC C1]** The tile carries the twin slot (W−1, W+1) at\n its edge — cyclically the opener a₀ = −1 — so the cyclic gap to the first\n opener a₁ above the origin gives **F(p) ≤ G2(p#) − p − 1**, and hence\n **head(p) ≤ G2(p#) − p − 1 wherever head is defined** (only the F form is\n unconditional; §2's (R2) uses F, and the two symbols name one inequality,\n clarified 2026-08-29 per redteam-0829-objects-zm.md H1): the Gap\n Reformulation localized to the head slack. Checked with ladder G2 at\n p = 7..17 (anchor gaps 12, 18, 18, 30 against G2 = 30, 42, 66, 108). This\n is the ONE proven head bound, and its shortfall is the whole open band:\n p^{4.2665+ε} against a needed p².\n- **[PROVEN]** Inside the zone, Euclid-type guarantees give SINGLES only:\n the first hole above 1 is p', so the zone always holds the hole p' — and\n π(p'^2) − π(p) holes total, all prime — but no guaranteed pair. The only\n construction-guaranteed pair in the whole tile is the edge, and it lies in\n no zone: it sits W − p'^2 beyond the frontier, a factor ~e^{(1+o(1))p}/p².\n The pair guarantee inside the zone IS the postulate; ±1-type slots do not\n approach it.\n\n### 3.2 Mirror-Sweep (σ(a) = W−2−a)\n\n- **[PROVEN; VERIFIED SEC C2]** σ maps in-zone openers bijectively onto the\n tile openers of the co-edge window (W−p'^2, W−p−2), reversing the gap\n multiset: **Z2 is σ-invariant, and the zone's entire gap structure is\n copied to within p² of the tile's edge.** The edge W−1 is σ-fixed with\n two-sided isolation exactly a₁+1 = p + head + 1 (verified: nearest opener\n below W−1 is W−2−a₁ at every level) — the birth canal appears twice,\n mirror-symmetrically, and G2 ≥ p + head + 1 is the same fact as 3.1's.\n- **[REFUTED as a transfer channel; VERIFIED SEC C2]** Certification does\n not survive the mirror: the image window carries composite-membered slots\n at every level (1 of 16 members at p = 7 — the slot pair (167, 169),\n 169 = 13² — rising to 21 of 34 at p = 17). The mechanism is structural:\n the frontier p'^2 is not a mirror-covariant object (W − p'^2 is nobody's\n frontier), and the zone's defining property — sitting BELOW the frontier —\n is precisely what a tile symmetry cannot preserve. This is the\n origin-local shadow of \"the mirror cannot conjugate time order\"\n (natal-onset-01 §2) and is consistent with the mirror-symmetrization zero\n (`REFUTED.md`, attack-anchored-01 §3).\n- What survives is bookkeeping, free and so far unused: the tile's last p²\n of slot structure is fully known (it is the zone's, reversed).\n\n### 3.3 The unified-cap / anchored floors\n\n- Setting recalled (paper/staircase-note.md; attack-anchored-01/02): the\n caps bound fresh strikes of the scour primes q > x on the Natal@5 comb\n over the WHOLE tile; the unified floors are 36 @11, 115 @13, 108 @17,\n 1987 @19, anchored-point quantifier.\n- **[PROVEN; VERIFIED SEC C3]** Restricted to the zone the machinery\n degenerates completely: Cofactor Rigidity's protection radius q₁² − 2 —\n q₁ = p' the first scour prime — IS the zone frontier, so **every strike by\n a prime q > p on an in-zone slot is a self-strike** (verified: strike\n count = 2 per pair at all five levels, each pair struck exactly by its own\n two members), and a self-strike is a twin found, not a candidate\n destroyed. Inside the zone the whole cap ledger reduces to the\n certification identity of §1, read from the kill side. It adds zero\n information there.\n- **Where the transfer fails, named exactly.** The floors are\n location-blind pigeonhole counts over width W: the certified survivors\n carry no position, and a windowed pigeonhole is vacuous because in-window\n survival ⟺ primality is already known (§1). What the floors do give the\n zone is only a mean statement (tile slot count ≥ floor ⟹ average slot gap\n ≤ W/floor) — and mean/first-moment routes to the zone are CLOSED (Route B,\n `REFUTED.md`). The staircase certifies twins in a tile, not in a zone\n (ZONE-POSTULATE.md §3 already carries this sentence; it is now verified\n mechanically).\n\n### 3.4 The onset shell: the zone's exact per-prime destruction ledger\n\n- **[PROVEN]** The active strikers of the zone are exactly the primes\n q ≤ p. A prime q ≥ p' touches an in-zone slot only as itself — the self\n case m = 1, a twin found, not a kill; any non-self slot multiple q·m has\n m's prime factors > p, hence q·m ≥ p'^2 — and it makes no fresh kill on\n any in-zone integer (a composite multiple q·m < q² has lpf(q·m) =\n lpf(m) ≤ m < q, so a smaller prime struck first).\n- **[PROVEN; VERIFIED SEC C4 at p = 7, 11, 13, every q]** The exact\n per-prime fresh-kill count inside the zone, in staircase-note notation:\n\n freshZone(q) = Φ*(⌊(p'^2−1)/q⌋, q) − Φ*(⌊p/q⌋, q),\n\n with the prime-regime simplification whenever q³ > p'^2 − 1:\n freshZone(q) = π(⌊(p'^2−1)/q⌋) − π(q−1) — pure prime count, every kill\n q × prime. The load as a function of q: mature primes (q² ≤ p) subtract\n the lower Φ* term and carry ~2(p'^2−p)/q-scale counts; young primes\n (q² > p) have their entire zone activity above q², counted by primes in\n [q, p'^2/q]; and the youngest, q = p, makes only 2..4 fresh kills in its\n whole zone (SEC D3, all 24 levels to 97). **This is Theorem 3's staircase\n transplanted to the zone with W ↦ p'^2: the zone is itself a tile-like\n window whose scour is its own young primes** — the same Φ* cap shape the\n staircase note proves for the tile, now at thousands of measurable levels.\n What it bounds: the zone's destruction ledger per prime, exactly; what it\n does not bound: where the misses (the survivors) sit, which is the wall.\n\n## 4. The deep end is an onset desert [PROVEN; VERIFIED, 24 levels]\n\nThe measured binding gap sits just under p'^2 (u = 0.9992..1.0000 on the last\n15 envelope steps; zonegap-01 §3). The natural suspicion — the deep end is\nwhere primes q with q² ∈ (p'^2−δ, p'^2) have JUST onset, and fresh-onset\nstrike patterns carve the gap — is REFUTED by exact counting, and the truth\nis sharper in the opposite direction:\n\n- **(D1) Tread-free tail [PROVEN; VERIFIED, 24 levels].** Consecutive onset\n treads near the frontier are p'^2 − p² ≥ 4p + 4 apart, so the zone's last\n p'^2 − p² − 1 ≥ 4p + 3 contains NO onset tread at all. The whole stretch\n (p², p'^2) is p's own onset shell: the influencer set is frozen at\n {q ≤ p} (GLOSSARY \"Onset shell\"). There are no fresh onsets in the deep\n end — a desert, not sparse activity.\n- **(D2) The frontier stride bound [PROVEN; VERIFIED, 1,084 (p, δ)\n cells].** For 1 ≤ δ ≤ p'−3, the primes with treads in the CLOSED stretch\n (p'^2−δ, p'^2] are exactly {p'} — uniqueness is forced by square spacing,\n and the count bound #{q : q² ∈ (p'^2−δ, p'^2]} ≤ δ/(2√(p'^2−δ)) + 1 holds\n with room — and p' strikes exactly the two integers p'^2−2 and p'^2 there\n (one multiple of p' in reach, since the stretch is shorter than the\n stride). Of these only p'^2 − 2 lies in the zone (open top). **So the\n total just-onset contribution to the zone's last δ is exactly ONE struck\n integer**, the B-side natal strike p'^2 − 2 (q² ≡ 1 or 19 mod 30, always\n a closer class — natal-onset-01 §1). The general stride lemma behind it:\n any prime q ≥ δ+2 strikes at most 2 integers in any window of length δ.\n- **(D3) Youngest-active load [PROVEN; VERIFIED, 24 levels].** The youngest\n active prime q = p makes exactly π(⌊(p'^2−1)/p⌋) − π(p−1) fresh kills in\n its WHOLE zone — the primes in an interval of length (p'^2−p²)/p ~ 4\n above p: measured 2, 3 or 4 at every level to 97. The youngest K primes\n contribute O(K) kills zone-wide.\n- **Consequence.** The deep-end loading of Z2 is NOT an onset-front effect:\n fresh onsets are proven absent from the deep end, and the young primes'\n total contribution anywhere in the zone is a handful of kills. What\n remains as the mechanism is zonegap-01 §3's: gap scale grows like ln² of\n height and the top of the zone owns nearly all its length. The\n alternative mechanism is now eliminated by proof, not by measurement.\n Additionally Z2 < p'^2 − p² at all five exact levels [VERIFIED]: the\n binding gap FITS inside the tread-free tail (whether the binding gap's\n interval always lies wholly inside (p², p'^2) is OPEN — u-deciles say\n usually, not always).\n\n## 5. NOT REACHED\n\n- The chain's premise-producing step — any a-priori bound on head, Z2 or\n tail at the window scale — is untouched and is TPC-strength; this note\n aims the target, it does not fire at it.\n- The Φ* transplant (§3.4) is verified at three levels and stated for\n general p without a written general proof of the regime boundaries; the\n proof is Theorem 3's verbatim with W ↦ p'^2 and deserves five lines in a\n future pass, not a claim here.\n- The co-edge window bookkeeping (§3.2) is derived and unused; whether an\n edge-isolation bound could run the head inequality in the OTHER direction\n was not attempted.\n- Deep-end verification stops at p = 97 and δ ≤ p'−3 (LIGHT budget); the\n desert statement (D1) is fully general by the square-spacing argument,\n but δ beyond ~p' needs the stride lemma's window condition re-examined.\n- No statement anywhere about WHERE survivors sit; every proven item here\n bounds destruction or restates certification. The supply question is the\n postulate, unchanged.\n\n---\n\n*Producer and custody: `research/zonegap-02-reduction.js`, embedded\n(`node research/qc/embed.js --check` passes bit-honest). Calibration inside\nthe run: G2(p#) recomputed by full cyclic tile scan at p = 7..17 and asserted\nagainst the G2-STATE §2 ladder (30/42/66/108); Z2(11) = 30 and Z2(13) = 30\nasserted against zonegap-01 §5's ratios; abort on any mismatch before any new\nfigure is produced. Cited figures: G2 at 19, 23 (ladder, 150/204), the\nunified floors (attack-anchored-01/02), the measured scales in §2's table\n(zonegap-01 §§3-6), 4.2665 (beta2-note via ZONE-POSTULATE §3) — none\nrecomputed here, per the standing compute rule.*\n"},"research/left-divisor-signs.md":{"lf_sha256":"6ecf59407efe64bf22422c17acede20c77f3193b0d8ee983311369ff9d1e0805","content":"# Möbius structure of the left divisor instead of the first Cauchy inequality\n\n\n\n**Twin-prime infinitude and the sufficient signed margin of\n[RESEARCH-HANDOFF §3](RESEARCH-HANDOFF.md) remain OPEN. Nothing here\nchanges the controlled region, W_dagger, E_dagger or the consumer\n[grouped-divisor-moment (20)](grouped-divisor-moment.md).** What follows\nis a derived reduction of one block exponent at one box, a set of failed\nupper bounds with their exact failed steps, and a sharper localization of\nthe remaining deficit. A smaller deficit at one rectangle is not evidence\nthat the global estimate will follow.\n\nEverything is derived once, by me, in one pass. It has not been\nindependently reviewed. It inherits the unreviewed upstream dependency\nlisted in the wave-1 review of grouped-divisor-moment: that the residual's\nexpanded blocks really have the shape `sum_m A_left(gm) Y(m)` with a\nseparate left coefficient in m, a separate right coefficient in u and a\nharmonic weight depending only on h. If that reduction is wrong every\nnumber below changes.\n\n## 0. What is being replaced\n\n[grouped-divisor-moment §4](grouped-divisor-moment.md) bounds each block by\nCauchy in the expanded left variable m,\n\n\\[\n \\left|\\sum_{m\\in I_m}A_{\\rm left}(gm)Y(m)\\right|\n \\le F\\cdot\\mathfrak M^{1/2},\\qquad\n F=\\Big(\\sum_m|A_{\\rm left}(gm)|^2\\Big)^{1/2}\\ll\\sqrt M\\log x,\n\\]\n\nwith the moment (2)-(3). The wave-1 reachability report records that F is\nsharp and that the moment's diagonal `u1=u2, h1=h2` is nonnegative of exact\norder `f^2 MN/A`, so the zero-frequency budget `(1+a)/2` cannot be improved\ninside that shape; at `a=1` it equals one. Its judgement was that the loss\nis Cauchy itself, which discards the correlation between the Möbius signs\nof `A_left(gm)` and `Y(m)`. This note prices the two standard ways of not\npaying it.\n\n## 1. The left coefficient, exactly, and its three sectors\n\nBy [grouped-divisor-moment (13)](grouped-divisor-moment.md) and\n[endpoint-fourier §2 (4)-(5)](endpoint-fourier.md), for `Re(s)>=0` and an\noriginal divisor interval `I` contained in `(D,2D]`,\n\n\\[\n A_0^{(s)}(\\ell)=\\mu(\\ell)\\ell^{-s}1_I(\\ell),\\qquad\n A_1^{(s)}(\\ell)=-\\mu(\\ell)\\ell^{-s}1_I(\\ell)\\log\\ell\n -\\sum_{r\\mid\\ell,\\ 2\\le r\\le W}\\mu(\\ell/r)(\\ell/r)^{-s}1_I(\\ell/r)\\Lambda(r),\n\\]\n\nwith `W=V=floor(x^(6/25))` on the left and `Z=floor(x^(1/20))` on the\nright. Three observations, all immediate from the display and all checked\nfinitely in the validator:\n\n1. **`A_0` and the first term of `A_1` are supported inside `I`.** Only\n the prime-power term reaches beyond it, to `l<=2DW`. The interval\n indicator sits on the *original* divisor `d`, and so does the twist:\n in the prime-power term the original divisor is `l/r`, not `l`.\n2. **The prime-power term is exactly a Dirichlet convolution**\n `(mu(.).^{-s}1_I) * (Lambda 1_{[2,W]})`. Writing `d=l/r` it is\n `-sum_{d in I} sum_{r<=W} mu(d)d^{-s}Lambda(r)` over `l=dr`. No\n coprimality between `d` and `r` is imposed and none is needed.\n3. **`g=2` costs a relabelling only.** With `l=gm` and `g=2`, split the\n prime-power term by whether `r` is a power of 2. If `r=2^k` then\n `m=d*2^(k-1)` with `2^(k-1)` fixed, so the second block has O(1)\n elements and the piece is linear in `d`; if `r` is odd then `2|d`,\n write `d=2d'` and `m=d'r` with `d'` in an interval and\n `|mu(2d')|<=1`. Both stay inside the lemmas below.\n\nConsequently, parametrise every block by two sector exponents: the left\nprime power `r ~ x^rho` with `0<=rho<=6/25` and the right one `q ~ x^sigma`\nwith `0<=sigma<=1/20`. The expanded lengths are then\n\n\\[\n M\\asymp x^{\\delta+\\rho},\\qquad N\\asymp x^{\\nu+\\sigma},\n \\qquad\\text{i.e. } a=\\delta+\\rho,\\quad b=\\nu+\\sigma,\n\\]\n\nrather than the uniform top values `a=delta+6/25`, `b=nu+1/20` used in\ngrouped-divisor-moment (14). Each dyadic `m`-box receives O(1) values of\n`R=x^rho` (since `d` is confined to one dyadic interval), so the split is\ninto O(log^2 x) sectors and the triangle inequality across them is free.\nUsing the top support for every sector, as (14) does, is a valid\nover-estimate; the sector split is a refinement of that bookkeeping, not\na defect in it.\n\n## 2. Type I: no zero-frequency budget, but a twist-height obligation\n\n**Lemma I (derived).** Let the left coefficient factor as `m=ab` with\n`a ~ A_1` carrying divisor-bounded coefficients `c_a` and `b` carrying a\nweight of bounded variation in `b` (coefficient 1, or `log b`). With the\nhypotheses and notation of [grouped-divisor-moment §1](grouped-divisor-moment.md),\n\n\\[\n \\Big|\\sum_{a}c_a\\sum_{b}\\;Y(ab)\\Big|\n \\ll_\\epsilon x^\\epsilon f(1+v)\\,BC\\Big[A_1N^{3/2}\n +M\\,\\mathbf 1_{M\\ge N/2}\\Big].\n\\]\n\n*Proof.* For fixed `a`, `u`, `h`, the inner sum is\n`sum_{b in J_a,(b,u)=1} e_u(k bbar) Phi_{u,h}(ab)` with `k=sigma theta h abar`,\n`J_a` an interval of length `<=2M/a`. The single endpoint factor obeys\n`|Phi|<> |Im s|`, and the partial summation step then costs `x^10`.\nSubdividing into `|Im s|` pieces costs the same. So **any route that\nreplaces the first Cauchy by cancellation in a smooth `m`-variable must\nfirst redo the cut separation with twist heights `x^(o(1))`**, or work\nonly on boxes that do not straddle a cut. That is a real additional\nobligation and it is not discharged here. Lemma II below does not have it.\n\n### 2.1 Vaughan and Heath-Brown on `mu(m)`, and what the combinatorics leave\n\nVaughan's identity for the Möbius function,\n`mu = mu_{<=U} + mu * (delta - 1*mu_{<=U})`, produces only Type II pieces:\nboth factors carry non-smooth coefficients. Heath-Brown's identity does\nproduce smooth variables: with `z=M^(1/K)`,\n`mu = sum_{j=9/50=0.18`;\n* on the surviving set the block exponent is\n `min(167/200+rho/2+3sigma/2, 289/400+rho+5sigma/4)`, whose supremum is\n attained at `(6/25,1/20)` and equals **41/40**, versus **103/100** from\n the grouped moment alone.\n\nSo the target-box deficit in block exponent falls from `3/100` to `1/40`.\nIn the moment-exponent currency of\n[grouped-divisor-moment (21)](grouped-divisor-moment.md) the analogous\nrequirement drops from \"more than 3/50\" to \"more than 1/20\", but the\ncomparison is only indicative: Lemma II is not a second moment and (21)\nremains stated for the moment route.\n\nLemma I removes a further sub-family of the surviving sector — those `d`\nwith a single 1-variable factor above `x^(31/100)`, for which the\narbitrary block is `r=1` | `>= 3/2` (`N^(3/2)`), plus `1` from the periods |\n| Lemma II, best split | `15/8` |\n| Bettin-Chandee / Wright Thm 2.1 | `15/8` |\n| hypothetical per-block square-root cancellation in `m`, summed trivially over `u,h` | `3/2` |\n\nThe last row is the decisive one. Trivially summing over `u ~ N` and `h`\ncosts `N`, and `u^(-eta')=x^(-eta' b)` because `u ~ x^b`, so a per-block\nbound `M f u^(-eta')` yields total exponent `a+b-eta' b`; sufficiency is\n\n\\[\n \\eta'>\\frac{a+b-1}{b},\n\\]\n\nwhich is `3/25` at the target box (`b=1/2`, so `2(a+b-1)` there) and\n**`1` at the corner** (`b=1`). Full square-root cancellation in `m` is\n`M u^(-a/(2b))`, i.e. `eta'=a/(2b)`: `14/25` at the target box and `1/2`\nat the corner. **The corner therefore needs twice the square-root ceiling\nfrom a per-block argument: it cannot be reached by any bound that treats\nthe `u`-sum absolutely, however strong the `m`-cancellation.** At the\ntarget box the requirement `3/25` sits inside the ceiling `14/25` with a\nfactor 4.7 of room; the gap there is proof strength, not a ceiling. (The\nceiling itself is heuristic; the exponent arithmetic is derived.)\n\n**Level of distribution.** At the target box `M=x^(14/25)`, `u ~ x^(1/2)`:\nthe `m`-sum has `~x^(3/50)` complete periods modulo `u`, so completion is\nmarginally effective, and `u = M^(25/28)`. At the corner `M ~ u ~ x`:\n`u=M^(1+o(1))`, there is not one complete period, and Weil's `sqrt u`\nper `(u,h)` pair already totals `N sqrt u = x^(3/2)`. Every method priced\nhere obtains its saving from completing the `m`-sum; when the modulus\nequals the length there is nothing to complete.\n\n**Left budgets recomputed (item 4 of the brief).** Swapping `a,b` gives\n`(1+b)/2, b/2+3a/2, b`. At the target box: `3/4, 109/100, 1/2` — the cross\nterm is worse than the right orientation's `103/100`. At the corner:\n`1, 2, 1` — *identical* to the right orientation. The asymmetry\n`U=V=x^(6/25)` against `Y=Z=x^(1/20)` enters only through\n`a=delta+6/25`, `b=nu+1/20`; at the corner both equal one by definition\nand the asymmetry is invisible. Lemma II in the left orientation (Cauchy\nin `e`, second moment over `q`, modulus `m`) gives `207/200, 39/40, 39/50`\nat the target box: the `q_1=q_2` diagonal alone is `1.035`, worse than\n`41/40`, because `Q<=x^(1/20)` is too short to pay for the diagonal.\n**Neither the swap nor the asymmetry helps at either place.**\n\n## 6. Algebraic twists and the two new primary sources\n\nThe trivial-summation route needs a per-`(u,h)` saving\n`u^(-eta')` with\n\n\\[\n \\eta'>\\frac{a+b-1}{b}\n =\\begin{cases}3/25&\\text{at the target box }(b=1/2),\\\\\n 1&\\text{at the corner }(b=1).\\end{cases}\n\\]\n\n* **Fouvry-Kowalski-Michel, *Algebraic trace functions over the primes*,\n Duke Math. J. 163 (2014) = arXiv:1211.6043v3 (31 Mar 2014), Theorem 1.7**\n (read at source, PDF text extracted 2026-09-06):\n `sum_{n<=X} mu(n)K(n) << X(1+p/X)^(1/12) p^(-eta/2)` for any `eta<1/24`,\n for `K` an isotypic trace weight modulo a **prime** `p`, non-exceptional\n (not proportional to `chi(n)psi(n)`), of bounded conductor; the constant\n depends polynomially on the conductor.\n *Hypotheses checked:* our kernel `K(m)=e_u(sigma theta h mbar)` is the\n Artin-Schreier sheaf pulled back by inversion, of conductor O(1), and is\n not of the form `chi psi` (its singularity is at 0, not at infinity), so\n it is non-exceptional. `X=M=p^(28/25)>p`, so the factor `(1+p/X)^(1/12)`\n is O(1) and the range condition `X>=p^(3/4+eps)` holds with room.\n *Hypothesis that fails:* `p` prime. Our `u` is an arbitrary expanded\n right divisor.\n *Pricing even granting prime `u`:* the ceiling is `eta'<1/48`, against\n the required `3/25`. Short by a factor `144/25 = 5.76`. It removes\n `1/96` of the `3/50` deficit, leaving `119/2400`.\n Remark 1.9 of the same paper (attributed to Bourgain) gives\n `sum_{n<=X}mu(n)K(n)=o(X)` for `X>=p^(1/2+eps)` with **no power saving**;\n a `o(1)` factor cannot pay a fixed power deficit.\n* **Wu-Xi (with an appendix by Sawin), *Arithmetic exponent pairs for\n algebraic trace functions*, arXiv:1603.07060v5 (19 Apr 2021)**, read at\n source: the moduli are required **squarefree with all prime factors below\n `q^eta`**, the sums are **short** (`|I|3/25` at the target box and `eta'>1` at the corner,\n and the observation that the corner requirement is twice the\n square-root ceiling `1/2` there.\n\n### 6.1 Wright, *Trilinear Kloosterman fractions II*, arXiv:2608.27732v1 (27 Aug 2026)\n\nTheorem 2.1, read at source (HTML rendering, 2026-09-06). With\n`B(M,N,A) = sum_{a in A, m in M, n in N, (m,n)=1} alpha_m beta_n gamma_a e(theta a mbar/n)`\nand `A ⊂ [A,2A]`, `M ⊂ [M,2M]`, `N ⊂ [N,2N]`, each set an interval **or\nconsecutive elements of a congruence class**, with `|M| << M X^(-eta)`\n**and** `|N| << N X^(-eta)` for some `eta>0`:\n\n\\[\n \\mathcal B\\ll\\|\\alpha\\|\\|\\beta\\|\\|\\nu\\|X^\\epsilon\n \\Big(1+\\tfrac{|\\vartheta|A}{NM}\\Big)^{1/2}\n \\Big[A^{1/2}\\big(M^{1/2}N^{3/8}+M^{3/8}N^{1/2}\\big)\n +A^{7/20}\\big(M^{3/5}N^{7/20}+M^{7/20}N^{3/5}\\big)X^{-2\\eta/5}\\Big].\n\\]\n\nThe norms used below are `||alpha||_2 << M^(1/2)log x`,\n`||beta||_2 << B N^(1/2)log x` and `||nu||_2 << C A^(-1/2)` (since\n`|c_h|<=C/A` on a band of at most `A+1` harmonics), evaluated on the top\nband `A ~ MN/x`, where `f=1` and `(1+|theta|A/(NM))^(1/2)=O(1)`. At the\ntarget box that prefactor is `x^(1/2)`; at the corner (`M=N=A=x`) it is\nalso `x^(1/2)`. At `eta=0` the display is exactly Bettin-Chandee\nTheorem 1 rewritten\n(`(AMN)^(7/20)(M+N)^(1/4) = A^(7/20)M^(3/5)N^(7/20)` for `M>=N`, and\nsimilarly for the other bracket), which reproduces the wave-1 pricing:\nprefactor `x^(1/2)`, first term `399/400`, second term `129/125` — the\nsecond term is the whole failure, and it is exactly the term the `eta`\nsaving attacks. Required: `X^(-2eta/5)<=x^(-4/125)`, i.e.\n`X^(-eta)<=x^(-2/25)` with `X=MN=x^(53/50)`.\n\n**Why it does not apply.** The subdyadic hypothesis is on the two\n*inverted* variables `m` and `u`, not on the harmonic band; the short\nharmonic band `A ~ x^(3/50)` is irrelevant to it. Our `m`-support is the\nfull dyadic box and so is our `u`-support, so `eta=0`. The only structure\nthat makes them subdyadic in the required \"congruence class\" sense is\nfixing the prime-power variables: for fixed `r`, `m=dr` runs over\nconsecutive multiples of `r`, of size `M/r`; for fixed `q`, `u=eq` runs\nover consecutive multiples of `q`, of size `N/q`. A common `eta` is then\nlimited by the *smaller* shortening, `X^(-eta)=1/q>=x^(-1/20)`, and the\nouter sum over the `R=x^(6/25)` values of `r` and `Q=x^(1/20)` values of\n`q` costs `RQ=x^(29/100)` while the norms only drop by\n`(RQ)^(1/2)=x^(29/200)`. The block exponent goes from `129/125=1.032` to\n\n\\[\n \\underbrace{29/100}_{\\text{count}}+\\underbrace{71/200}_{\\text{norms}}\n +\\underbrace{133/250-1/50}_{\\text{bracket}}=1157/1000,\n\\]\n\ni.e. **strictly worse**. Generally, manufacturing `X^(-eta)` by cutting\nboth supports into `K` pieces costs `K^2` applications against `K^(-1)`\nin the norms and `K^(-2/5)` in the bracket: a net loss `K^(3/5)`.\n*Failed step:* the subdyadic gain `X^(-2eta/5)` is smaller than the\n`X^(eta)` price of creating the shortness. What would change this: a\nnatural sub-dyadic support on both `m` and `u` simultaneously, arising\nfrom the arithmetic rather than from subdivision, with `X^(-eta)` below\n`x^(-2/25)`. Our supports are dyadic boxes of the original divisor\ndomain, so none is present.\n\nAt the corner Wright/BC gives `15/8` (first bracket `11/8` over a\nprefactor `1/2`; second `9/5`), far above 1, and no `eta` is available\nthere either.\n\nThe scout's confirmation of Wright v2 of arXiv:2604.25177 Theorem 2.1 at\nbyte level is consistent with the earlier pricing recorded in\n[small-divisor-kernel.md](small-divisor-kernel.md) and\n[SEARCH-CONVENTIONS.md](SEARCH-CONVENTIONS.md); nothing in this note\ndepends on it.\n\n### 6.2 Guria, arXiv:2410.10856v2 (19 Dec 2024), Theorems 1.2-1.3\n\nRead at source (PDF text, 2026-09-06). Theorem 1.2: for arbitrary\n`alpha(n)=O(n^eps)` and nonzero `r`,\n\n\\[\n S_r(X)=\\sum_{|a|,|b|,|p|,|d|\\le X,\\ ad-pb=r}\\alpha(a)\n = 8\\sum_{a\\le X}\\frac{\\alpha(a)}{a}\\sum_{p\\le X}\\int_1^X\n w\\Big(\\frac{|r|+px}{a}\\Big)dx\n +O\\big(X^{7/4+\\epsilon}+r^{1/5}X^{1+11/20+\\epsilon}\\big),\n\\]\n\nwith `p` prime and `b,d` integers; Theorem 1.3 is the specialisation with\n`alpha` the prime indicator, giving `8K_r li(X)^2 + O(X^(7/4+eps))` for\n`r<=X`. The mechanism is Poisson summation in the unweighted variables\nplus averaging Kloosterman fractions over the prime `p` — the item-3\nalternative to Cauchy.\n\n**What fails when both remaining weights are Möbius.** Our determinant\nequation `dk-et=2` is (1.6) with `r=2`, but:\n\n1. **Guria has two variables of weight exactly 1** (`b` and `d`), and it\n is on those that Poisson summation is run; the single arbitrary weight\n is on `a` and the prime is `p`. Our four weights are `mu(d)`,\n `beta_V(k)`, `mu(e)`, `beta_Z(t)` — **no variable carries weight 1**.\n Attaching `mu(e)` to the Poisson variable turns the theorem's main\n term into a Möbius sum over an interval in a progression, which is\n precisely the untwisted density\n [signed-divisor-grouping](signed-divisor-grouping.md) already\n subtracts. The theorem's main term corresponds to the part of our\n problem that is done; the part that is open is its error term.\n2. **The prime variable is not ours.** Guria averages over `p` prime,\n `p<=X`. Our analogous variable is the cofactor `k=n/d` carrying\n `beta_V(k)=sum_{r|k,r>V}Lambda(r)`, supported on integers with a large\n prime-power divisor, not on primes, and its range is coupled to `d` by\n `dk in J_x`. A Poisson-plus-prime-average argument would have to be\n redone for that weight and that coupling; nothing in the paper does it.\n3. **The error is far too large in our normalisation.** Her box is\n `[-X,X]^4` with `~X^(2+eps)` solutions and error `X^(7/4+eps)`, a\n relative saving `X^(1/4)`. Our residual lives on a thin sub-box with\n total mass `~x` (times logarithms) and needs an absolute error\n `O(x/log^K x)`. Taking `X=x` so that our four variables fit gives\n `x^(7/4)`, useless by `x^(3/4)`.\n\n**Reusable, not imported:** the direction \"average the Kloosterman\nfraction over one prime variable rather than Cauchy it away\" is exactly\nthe resource Lemma II throws away (it sums `u` and `h` absolutely) and the\ngrouped moment spends on a second moment. A version of Guria's Poisson\nstep adapted to `beta`-weighted cofactors, with a Möbius weight on a\nsecond variable, is an open direction, not a bound. This is a failed\nimport, not a refutation.\n\n## 7. Region of validity and effect on the global consumer\n\nLemmas I and II hold on every box of the original domain, with constants\ndepending only on `epsilon` and the fixed power bounding the lengths, and\nuniformly over: both gcd branches `g in {1,2}`, both endpoint conventions\n(native `x/2,z` with `sigma=-1`, reciprocal `x/2-2,z-2` with `sigma=+1`),\narbitrary harmonic subsets `H ⊆ [A,2A]`, all four coefficient sectors, the\nlow, squarefree, repeated-prime and prime-2 classes, and — for Lemma II —\nthe independent divisor twists at all Perron heights. Lemma I is uniform\nin the twists only at heights `x^(o(1))` (§2).\n\n**Effect on (20): none.** A whole box is controlled by Lemma II only if\nits worst sector is, i.e. only if, with `a=delta+6/25`, `b=nu+1/20` and\n`s_A=delta`,\n\n\\[\n b+a-\\tfrac{1}{2}(a-\\delta)<1,\\quad\n \\tfrac54 b+a-\\tfrac{\\delta}{2}<1,\\quad a+\\tfrac b2<1 .\n\\]\n\nLemma II also carries the hypothesis `B_219/100`; the target box `nu=9/20` satisfies\nit with room, so the `41/40` headline of §4 is unaffected. On a\n`191 x 191` rational grid over the full domain `delta in [6/25,19/25]`,\n`nu in [1/20,19/20]`, the three displayed inequalities hold on 9943\nboxes, of which **5153 also satisfy `nu>19/100`** and so are genuinely\ncontrolled by Lemma II. **0 boxes of either count lie outside the region\nalready controlled** by `delta+nu<19/25`, `5delta+2nu<123/50`, or\n`(delta<19/25 and delta+3nu<161/100)`; the larger count ignores the\nhypothesis and is therefore the conservative one for that conclusion. So\n`W_dagger`, `E_dagger`, the\nexact cuts (19) and the reduction (20) are unchanged, and so is the\nuniform product threshold (every fixed exponent below 19/25). The only\nmovement is the local one of §4.\n\n**What would need to change, term by term.**\n\n| failed step | what would fix it |\n|---|---|\n| Lemma I on the balanced Heath-Brown piece (`m=n_1n_2`, both `~x^(7/25)`) | a Type II estimate for two arbitrary sequences of length `x^(7/25)` against `e_u(theta h mbar)` with the `u,h` average retained, saving more than `x^(1/40)` over `41/40` |\n| Lemma II's Weil term `A_2^(1/2)B_2N^(1/4)` at `A_2=x^(8/25)`, `B_2=x^(6/25)` | either cancellation over `u` (Lemma II sums it absolutely) or a bound better than `sqrt(u)` for the completed `d`-sum with a fixed nonzero numerator |\n| Lemma I's twist-height dependence | a cut separation with twists of height `x^(o(1))`, or a boxwise argument that avoids straddling the cuts |\n| Bettin-Chandee/Wright first bracket term at `eta=0` | a genuinely subdyadic support on both `m` and `u`, `X^(-eta)3/25` for composite `u`; a factor `5.76` in the exponent, plus the composite extension |\n| everything, at the corner `a=b=1` | cancellation in the `u`-aggregate: no per-block bound suffices, since `eta'>1` is twice the square-root value `1/2` |\n\nNone of these is an obstruction. Each is a failed upper bound with a\nnamed missing input. The signed target\n[grouped-divisor-moment (21)](grouped-divisor-moment.md), the complement\n`E_dagger`, and the sufficient margin `C_2x+E_dagger>=c_0x/(log x)^K`\nremain exactly as open as before.\n\n## 8. Validation, falsifiers, limits\n\n[left-divisor-signs-validation.js](left-divisor-signs-validation.js)\n(deterministic, 2.1 s, output embedded by `node research/qc/embed.js`)\nchecks, in exact BigInt rationals, all block exponents quoted above; the\nclosed forms (1) and (2) against a `201 x 201` sector lattice; the crossing\nat `sigma=3/100`; the Type I threshold `1/4` against the Cauchy exponent\n`7/25`; the corner table; the required `eta'` values against the\nsquare-root ceilings and the FKM ceiling; the Bettin-Chandee/Wright\npricings; and the global grid, under both the plain and the `nu>19/100`\ncounts, showing no added region. It also verifies\nfinitely the three elementary inputs of the lemmas: the identity\n`(bbar_1-bbar_2,u)=(b_1-b_2,u)` and the majorant\n`G'<=2(h,u)(b_1-b_2,u)`; the averaged gcd bound over a difference range;\nthe completion bound including its complete-period term; and the exact\nconvolution identity of endpoint-fourier (5) together with the support\nclaim that only the prime-power term of `A_1` reaches beyond the original\ninterval.\n\nNegative controls, all firing: pricing every sector at the top support\n(`droppedSectorSplit`); dropping the complete-period term\n(`droppedPeriodTerm`); dropping the harmonic gcd factor from `G'`\n(`wrongGcdBranch`, 59660 detected violations); dropping Lemma II's\ndiagonal in the left orientation, which would wrongly look sufficient\n(`typeIIWithoutDiagonal`); claiming a corner asymmetry between the two\norientations (`claimedCornerAsymmetry`); and claiming the corner is\nreachable (`cornerReachable`).\n\n**Falsifiers, and whether they have run.** (a) An error in Lemma I's or\nLemma II's derivation — the exponent arithmetic has been checked\nmechanically, the analytic steps have not been independently reviewed;\nthis check has NOT run. (b) A sector of the target box outside the\nparametrisation `(rho,sigma)` — the support claim was checked finitely\nfor four `(D,W)` pairs only, not proved for all; the proof is the two\ndisplays in §1 and is one line, but it is mine. (c) A box where Lemma II\nadds region — searched on the rational grid of the validator, with zero\nsuch boxes returned (this is a finite grid search over our own budget\ninequalities, not a literature claim); a grid is not a proof, and\nthe boundary strips were not examined separately. (d) The upstream\nreduction to `sum_m A_left(gm)Y(m)`, unreviewed here and in the wave-1\nreview.\n\nFinite checks certify their stated finite scope. They cannot establish an\nasymptotic rate, an effective onset, a percentage of completion, or any\nlower bound on twins.\n"},"research/prime-band-transfer.md":{"lf_sha256":"6e89bb839f4048d075f7030fd4d82139968a22d76172c859b8785a3c90511b6b","content":"# A multiplicative lift for the prime-cofactor subfamily\n\n\n\n**Twin-prime infinitude and the sufficient signed margin remain OPEN.**\nThis is a derived transfer conditional on a named imported theorem,\nnot a novelty claim or a replacement for the full corner. The elementary\nsteps and their losses are completed here for the next local campaign.\n\n**Extension:** [cofactor-progression-transfer.md](cofactor-progression-transfer.md)\nnow treats all remaining cofactors s,t<=(log x)^kappa for some kappa>0,\nincluding nonsquarefree inputs, by modifying Euler factors and keeping\nthe density of the CRT progression. It gives a signed dyadic average\nfor exact sharp, transition and smoothed profiles. That restricted rate\nis still weaker than o(x); the full cofactor remainder and twin margin\nremain OPEN. The s=t=1 derivation here remains its first special case.\n\n## 1. Fixed-band representation\n\nLet X grow, and let B,B' be prime bands with endpoints between X^alpha\nand X^beta, for fixed 0= (1/3-epsilon) log log Y+O(1) at scale Y,\nfor conductors at most log^(1/125)Y. Use Y=X^2 and, for instance,\nepsilon=1/24. It does **not** supply exp M>>log X. These analytic\nstatements are imported dependencies, not reproduced here.\n\nAt primes mu and lambda coincide. For any Dirichlet character chi\nand any frequency u in the source's infimum,\n\n\\[\n |\\mathbb D(g_{B,t},\\chi n^{iu};X^2)^2\n -\\mathbb D(\\mu,\\chi n^{iu};X^2)^2|\n \\le 2\\sum_{p\\in B}1/p=O_{\\alpha,\\beta}(1). \\tag{2}\n\\]\n\nThis is uniform for every real t; no bound on t is needed. Taking\ninfima preserves the inequality. Therefore the required lower bound\nfor exp M holds uniformly for g_{B,t}, with a fixed constant. Take\nL=(log X)^(1/4): the exponent 7/24 from the preceding input exceeds\n1/4 and absorbs all fixed constants for sufficiently large X. If the\nsource theorem's saving exponent is c_src, write c=c_src/4 from now\non, so L^(-c_src)=(log X)^(-c). The source's real-valued\nequidistribution alternative is not used.\n\nWrite A_(t,s)(N)=N^(-1)sum_(N0,\n\n\\[\n \\boxed{\\frac1{\\log X}\\int_{\\sqrt X}^{X}\n \\frac{|A_w(N)|}{N\\log^2 X}\\frac{dN}{N}\n \\ll_\\eta (\\log X)^{-c_*}.} \\tag{6}\n\\]\n\nAll constants may depend on the fixed eta and the imported theorem.\nNo eta(x) limit is taken. The proper-square error in converting A_w\nto the s=s'=1 raw corner piece is a fixed power below N and is\nabsorbed in (6). The same is true of bounded endpoint rounding.\n\n## 4. Exact payoff and limits\n\n(6) gives a small relative logarithmic saving over the unsigned\nprime-cofactor envelope on **continuous scales**. It is not o(N):\nthe scale-averaged bound on |A_w|/N is only\nO_eta(log^(2-c_*)X), with c_* small and unspecified. The integral alone\ndoes not control all dyadic points. However, the bounded interval sums\nalso satisfy a stability inequality: §6 records the resulting dyadic\nscale-average saving. No every-dyadic estimate or positive margin follows.\n\nThe full corner is sum C(n)C'(n-2). Formula (1) does not represent its\nprime-r branches with s>1 or s'>1 and their non-squarefree inputs. Terms\nwith a proper prime power above a cutoff already have the separate\nnegligible bound in corner-correlation §1.1. The complement of S0 is still\nuncontrolled at the global precision. No divisor region or cut changes.\n\n**What is reusable:** the exact multiplicative lift, its uniform\nnon-pretentiousness comparison, Tonelli instead of an invalid common\nexceptional set, and the explicit mesh cost for a moving band.\n**What would change the global assessment:** a proved estimate with\nthe full coefficients and the actual one-sided consumer; or a stronger\nrate/scale statement whose complete errors reach that consumer.\nRecomputing (6), treating c_* as known numerically, or calling it a proof\nat every prescribed dyadic point is not a new attempt.\n\nSource custody: arXiv:2512.01739v2, PDF SHA-256\n`ce10e83b10c6544e1dbff037a5e4efa0e387892e0fc596ae09dce76025d7b41e`.\nThe MRT source is arXiv:1503.05121v3, equation (1.12), PDF SHA-256\n`8a2633b1594615fe0c340bbca01ad059be5bd66d3495bd028e7e9d2264f1e688`.\nBoth primary statements were read on 2026-09-06. No search-result summary is used as\nan analytic input; no assertion of an exhaustive literature search or\noriginality is made.\n\n## 5. Verification and falsifiers\n\nThe local audit checked (1)--(6), including source hypotheses, the\npositive integral order and the count of mesh intervals. The\n[adversarial review](next-transfer-review.md) of 2026-09-06 found no\nload-bearing gap at this scope and supplied the four unstated steps\nnow written above. The source\nproof is not independently reproduced. The finite validator\n[agent-readiness-validation.js](agent-readiness-validation.js) checks\nadditivity/multiplicativity ingredients and active counterexamples to\nthe discarded support and completeness claims. It does not prove (6).\n\nA failure of uniformity in (2), a nonintegrable Fourier majorant, or\na CRT error of size N in (5) would invalidate the transfer. The above\nproof supplies their bounds. A future use on the full corner needs\na new identity and error bound; no implied extension is authorized by\nthis note's PARTIAL ledger status.\n\n## 6. Dyadic scale-average consequence after review\n\n[round-review-0906.md §2](round-review-0906.md) supplies the missing\nsampling argument. For a fixed bounded sequence, moving (N,2N] to\n(t,2t], N<=t<=(1+h)N, changes its normalized sum by O(h+1/N).\nIntegrating on disjoint neighborhoods of dyadic points converts the\nfixed-band saving c in (4) into a dyadic saving c/2. Applying the same\nmoving-band mesh with delta=(log X)^(-c/4) gives\n\n\\[\n \\frac1{\\log X}\\sum_{\\sqrt X\\le2^j\\le X}\n \\frac{|A_w(2^j)|}{2^j(\\log X)^2}\n \\ll_\\eta (\\log X)^{-d},\\qquad d=c/4=c_*/2>0. \\tag{7}\n\\]\n\nThe top endpoint is charged O(1/log X); no exceptional set is required\nto omit every dyadic point. Since x=2N, these are campaign dyadic\nscales as well. The proof includes the exact cofactor windows at fixed\neta and the proper-square conversion error. This is an average over\ndyadic scales, not a bound at every such scale. It still gives only\nan averaged O(log^(2-d) X) bound on |A_w|/N, and no full-corner or\ntwin margin. The finite sampling validator belongs to the review.\n"},"research/signed-moment.md":{"lf_sha256":"f83eb30929ecdfffa484af3e0d0e6cce07f08418e063155a8089abce1bfe2222","content":"# The block without the first Cauchy: where the corner's loss actually sits\n\n\n\n**Twin-prime infinitude remains OPEN, and the sufficient margin\n`C_2 x + E_dagger(x) >= c_0 x/(log x)^K` remains OPEN. Nothing here changes\nthe controlled region, `W_dagger`, `E_dagger`, the consumer\n[grouped-divisor-moment (20)](grouped-divisor-moment.md), or the uniform\nproduct threshold.** What follows is one exact expansion, two derived\nelementary lemmas, one conditional budget, one heuristic ceiling, and a set of\nfailed upper bounds with their exact failed steps. A smaller block exponent at\none point of the domain is not a lower bound on twins.\n\nIndependent reviews 20 and 21 check the displayed block shape and\nlocal upper-bound arguments, with the corrections below. Imported\nupstream theorems remain named dependencies. The exact coefficient,\nendpoint and twist restrictions still matter for every application.\n\nCompanion validator: [signed-moment-validation.js](signed-moment-validation.js),\nexact BigInt rationals plus small finite integer and analytic identities. It\nvalidates no imported estimate and establishes no rate.\n\n## 0. The object, and what the block has to beat\n\nNotation follows [grouped-divisor-moment §1](grouped-divisor-moment.md) and\n[RESEARCH-HANDOFF §4](RESEARCH-HANDOFF.md). Let `I_m` be an integer\nsubinterval of `(M,2M]`, `H` any subset of the integers in `[A,2A]`,\n`|b_u| <= B` on `(N,2N]`, `|c_h| <= C/A` with `C` fixed, `g in {1,2}`,\n`theta = 2/g`, `sigma in {-1,1}`,\n\n\\[\n \\Phi_{u,h}(m)=e\\Big(\\frac{hz_0'}{gmu}\\Big)-e\\Big(\\frac{hz'}{gmu}\\Big),\n \\qquad v=\\frac{Ax}{MN},\\qquad f=\\min(1,v),\n\\]\n\nwith `|z0'|, |z'|, |z'-z0'| <= x`. Set\n\n\\[\n Y(m)=\\sum_{u\\sim N}b_u\\sum_{h\\in H}c_h\\,1_{(m,u)=1}\\,\n e_u(\\sigma\\theta h\\bar m)\\,\\Phi_{u,h}(m),\\qquad\n T=\\sum_{m\\in I_m}A_{\\rm left}(gm)\\,Y(m),\n\\]\n\nwith `|A_left| << log x` by [grouped-divisor-moment (13)](grouped-divisor-moment.md).\nFor `d ~ x^delta`, `e ~ x^nu` the expanded lengths are `M << x^a`, `N << x^b`\nwith `a = delta + 6/25`, `b = nu + 1/20`; the domain is\n`delta in [6/25,19/25]`, `nu in [1/20,19/20]`, so `a, b <= 1` with equality on\nthe two edges. **The block must satisfy `|T| << x^(1-eta)` for a fixed\n`eta>0`.** The top harmonic band is `A ~ MN/x`, where `f = 1` and `v ~ 1`;\nthis is the band that binds, and every displayed number below is on it unless\nsaid otherwise.\n\nThe single useful abbreviation is\n\n\\[\n G(u,h)=\\sum_{m\\in I_m,\\ (m,u)=1}A_{\\rm left}(gm)\\,\n e_u(\\sigma\\theta h\\bar m)\\,\\Phi_{u,h}(m),\n \\qquad T=\\sum_{u\\sim N}\\sum_{h\\in H}b_uc_h\\,G(u,h). \\tag{1}\n\\]\n\n## 1. The expansion with no Cauchy inequality, and the true diagonal\n\nSquaring (1) and expanding both `G`'s:\n\n\\[\n |T|^2=\\sum_{\\substack{m_1,m_2\\in I_m\\\\ u_1,u_2\\sim N,\\ h_1,h_2\\in H}}\n A_{\\rm left}(gm_1)\\overline{A_{\\rm left}(gm_2)}\\,\n b_{u_1}\\overline{b_{u_2}}c_{h_1}\\overline{c_{h_2}}\\,\n e\\big(\\sigma\\theta[\\tfrac{h_1\\bar m_1}{u_1}-\\tfrac{h_2\\bar m_2}{u_2}]\\big)\n \\Phi_{u_1,h_1}(m_1)\\overline{\\Phi_{u_2,h_2}(m_2)} . \\tag{2}\n\\]\n\nSplit (2) three ways:\n\n| piece | index restriction | name |\n|---|---|---|\n| `(a)` | `m1=m2`, `u1=u2`, `h1=h2` | the true diagonal |\n| `(b)` | `m1!=m2`, `u1=u2`, `h1=h2` | the `m`-off-diagonal |\n| `(c)` | `(u1,h1) != (u2,h2)` | the `(u,h)`-off-diagonal |\n\n`(a)` is real and nonnegative, and exactly\n\n\\[\n (a)=\\sum_{u\\sim N}|b_u|^2\\sum_{h\\in H}|c_h|^2\n \\sum_{m\\in I_m,(m,u)=1}|A_{\\rm left}(gm)|^2|\\Phi_{u,h}(m)|^2.\n \\tag{3}\n\\]\n\nThe available sup bound |A_left|<=sqrt(M)||Y||_2 is false for\narbitrary A_left. For example, with M=4, p=1, a supported on one point\nwith value 1 and Y supported on a different point with value 1, its\nleft side is 1 and its right side is 2. With constant |A_left|=D on\nall M points, norm monotonicity does give the analogous lower bound\nD*sqrt(M)||Y||_2 for p<=2. This restricted comparison is not a\nuniversal Holder or first-Cauchy ceiling for the actual coefficients.\n\n## 2. Lemma A: the whole `(u,h)`-diagonal, by completing the harmonic band\n\nThe step that makes the rest of this note work is elementary and is used\ntwice: **`(a)+(b)` and the Lemma B moment are sums of nonnegative terms in\n`h`, so the arbitrary harmonic subset `H` may be replaced by the full band\n`[A,2A]` before anything else is done.** Once the band is complete, and\nbecause `Phi_{u,h}(m)` is a difference of two *pure exponentials in `h`*, the\n`h`-sum is a geometric series after the small-v integral and Abel step stated\nbelow. There is no modular completion in these two lemmas.\n\n**Lemma A (derived).** With the hypotheses of\n[grouped-divisor-moment §1](grouped-divisor-moment.md), for every fixed\n`epsilon>0`,\n\n\\[\n (a)+(b)=\\sum_{u\\sim N}|b_u|^2\\sum_{h\\in H}|c_h|^2|G(u,h)|^2\n \\ \\ll_\\epsilon\\ B^2C^2x^\\epsilon f^2(1+v)\n \\left[\\frac{MN}{A}+\\frac{M^2}{A}\n +\\frac{M^2N+MN^2}{A^2}\\right]. \\tag{4}\n\\]\n\n*Proof.* All terms are nonnegative, so extend `H` to `[A,2A]` and replace\n`|b_u|^2, |c_h|^2` by `B^2, C^2/A^2`. Fix `u`. Expanding `|G(u,h)|^2` and\n`Phi(m_1)\\overline{Phi(m_2)}` into its four exponential terms, the summand is\n`e(h beta)` with\n\n\\[\n \\beta=\\frac{\\sigma\\theta\\,(\\bar m_1-\\bar m_2)}{u}\n +\\frac{z_i}{gm_1u}-\\frac{z_j}{gm_2u},\\qquad i,j\\in\\{0,1\\},\n\\]\n\nso `sum_{A<=h<=2A} e(h beta) << min(A, ||beta||^(-1))`, and the perturbation\nobeys `|z_i/(gm_1u) - z_j/(gm_2u)| <= 2x/(gMN) = 2v/(gA)`. Group the pairs by\n`r = \\bar m_1 - \\bar m_2 mod u`. For fixed `m_1` and `r`, `m_2` lies in one\nresidue class mod `u`, so each `r` receives at most `M(M/u+1)` pairs. Summing\nover `r`: the `O(1 + uv/A)` residues with `||theta r/u|| <= 2(1+2v)/A` give\n`A` each, contributing `O(A + uv)`; the rest give\n`sum_r ||theta r/u||^(-1) << u log(2A)`. Hence\n\n\\[\n \\sum_{h\\sim A}|G(u,h)|^2\\ll x^\\epsilon f^2\n \\Big(\\frac{M^2}{u}+M\\Big)\\big(u(1+v)+A\\big),\n\\]\n\nand multiplying by `B^2C^2/A^2` and summing over `u ~ N` gives (4). QED\n\nThe small factor f needs a step not supplied by expanding four pure\nexponentials alone. If v<=1, write each endpoint difference as the\nintegral of its endpoint derivative, extracting v(h/A) times a uniformly\nbounded m,u-dependent factor. In the product, (h/A)^2 has bounded\nvariation on [A,2A], so Abel summation preserves the same geometric-series\nbound and supplies f^2. If v>=1, expand directly and f=1. The same repair\napplies in Lemma B below. No Weil or Ramanujan input is required.\n\n**Scope correction:** this lemma bounds u1=u2,h1=h2 only. The R=0 class\nalso contains unequal proportional pairs, for example (u1,h1)=(6,3) and\n(u2,h2)=(10,5), in common dyadic bands. Those pairs remain in piece (c).\nNeither this lemma nor its positivity completion controls that whole\nclass. See [independent review F4](history/reviews-0906/20-independent-handoff-review.md).\n\n**On the top band `A ~ MN/x`** the bracket in (4) is\n`x + Mx/N + x^2/N + x^2/M`, and `Mx/N <= x^2/N` since `M << x`, so\n\n\\[\n (a)+(b)\\ \\ll_\\epsilon\\ x^{2-\\min(a,b)+\\epsilon}. \\tag{5}\n\\]\n\nThat is a power below `x^2` at *every* box of the original domain (36481 of\n36481 grid boxes). As a bound on `|T|` it would permit `x^(1-min(a,b)/2)`:\n`x^(1/2)` at the corner, `x^(3/4)` at the target box, `x^(31/40)` at the\nbenchmark. **The true diagonal and the u1=u2,h1=h2 contribution have been bounded\nbelow x^2.** Piece (c), including the remaining equal-frequency pairs,\nis uncontrolled by this lemma.\n\n## 3. Lemma B: Cauchy in the harmonic variable, with no zero-frequency budget\n\nThe same positivity step supports a complete alternative to the first Cauchy.\nWrite `T = sum_{h in H} c_h W(h)` with `W(h) = sum_u b_u G(u,h)` and apply\nCauchy in `h`.\n\n**Lemma B (derived).** With the hypotheses of grouped-divisor-moment §1, for\nevery fixed `epsilon>0`,\n\n\\[\n |T|\\ \\ll_\\epsilon\\ BC\\,x^\\epsilon f(1+v)^{1/2}\n \\left[\\frac{MN}{\\sqrt A}+M\\sqrt N+N^{3/2}\\sqrt{M/A}+N\\sqrt M\\right].\n \\tag{6}\n\\]\n\n*Proof.* `|T| <= (sum_{h in H}|c_h|^2)^(1/2)(sum_{h in H}|W(h)|^2)^(1/2)`, and\n`sum_{h in H}|c_h|^2 <= C^2/A`. The second factor has nonnegative terms, so\nextend `H` to `[A,2A]`. Expand; the summand is again `e(h beta)`, now with the\ntwo inverses taken to different moduli. With `j=(u_1,u_2)`, `u_i=j ell_i`,\n`(ell_1,ell_2)=1`, `c=j ell_1 ell_2 = [u_1,u_2]`, and `c/u_1 = ell_2`,\n`c/u_2 = ell_1`, the two phases combine exactly as in\n[structural-literature-audit §2 (1)](structural-literature-audit.md):\n\n\\[\n e_{u_1}(\\sigma\\theta h\\bar m_1)\\overline{e_{u_2}(\\sigma\\theta h\\bar m_2)}\n =e_c(\\sigma\\theta h\\,P),\\qquad\n P=\\bar m_1\\ell_2-\\bar m_2\\ell_1 \\bmod c, \\tag{7}\n\\]\n\nso `beta = sigma theta P/c + (endpoint perturbation)` is again a fixed number\ngiven `(m_1,m_2,u_1,u_2)` and the `h`-sum is a geometric series. Fix\n`u_1,u_2,m_1` and let `t = \\bar m_2 mod u_2` range over `[0,u_2)`, which\nover-counts and is admissible because the summand is nonnegative. Then\n`P = P_0 - t ell_1 mod c` runs bijectively over the coset\n`P_0 + ell_1 Z/cZ`, of size `c/ell_1 = u_2`, whose nonzero elements are spaced\n`ell_1 g'` apart with `g' = (theta, j ell_2) <= 2`. Consequently\n\n\\[\n \\sum_{t 1` norm, `||G||_(∞->1) ≍ ||G||_F(\\sqrt N + \\sqrt A)`. Then\n\n\\[\n \\sup_{|b_u|\\le B,\\ |c_h|\\le C/A}|T|\n \\ \\asymp\\ BC f\\big[N\\sqrt{M/A}+\\sqrt{MN}\\big]\n \\ =\\ x^{(1+b)/2}\\ \\hbox{on the top band,}\n\\]\n\nand the reciprocal orientation ([small-divisor-kernel §4](small-divisor-kernel.md))\nexchanges the roles of `m` and `u`, giving `x^((1+a)/2)`. So the ceiling is\n`x^((1+min(a,b))/2)`, which is **exactly the better of the two zero-frequency\nbudgets**: below one at every box of the domain except the corner, where it is\nexactly one. Rigorously available is only the Khintchine half,\n`sup |T| >= c B(C/A) sum_u (sum_h |G(u,h)|^2)^(1/2)`; the missing input is a\nlower bound on `sum_{u,h}|G(u,h)|^2`, and Lemma A's upper bound on the\n`m_1!=m_2` part is of the same order as the `m_1=m_2` part at the corner, so\nno lower bound follows from anything derived here. On the grid the ceiling\nnever exceeds the best proven bound at its box (36481 of 36481), which is the\nactive consistency control; it would be refuted outright by any proven bound\nbelow it.\n\nIf the model is right, the corner is out of reach for *every* argument that\nuses only `|b_u| <= B` and `|c_h| <= C/A`, however organised, and reorganising\nthe Cauchy step can at best reach `x^1`, never `x^(1-eta)`. That is a sharper\nstatement than reachability's, and it is heuristic; its scope is\narbitrary-coefficient arguments, and it asserts no obstruction to arguments\nthat use the actual coefficients.\n\n## 6. The other arrangements, priced\n\n| arrangement | what it is | corner | target box | comment |\n|---|---|---|---|---|\n| Cauchy in `m` | grouped moment (14), right orientation | 2 (zero term exactly 1) | 103/100 | the current shape |\n| Cauchy in `u` | the left orientation, by reciprocity | 2 (zero term exactly 1) | 109/100 | already in the corpus; not a new arrangement |\n| **Cauchy in `h`** | **Lemma B (6)** | **3/2** | **103/100** | no zero-frequency term; adds no region |\n| Cauchy in `(m,h)` jointly | completed in [readiness review C](history/reviews-0906/21-readiness-review.md): budgets a+b/2, a/2+3b/2, a | 2 | 103/100 | incomplete intervals can be completed even when c>M; no added region |\n| Hölder in `m`, `p<=2` | coefficient-dependent norm product | not priced for actual sparse coefficients | not priced | the comparison with Cauchy needs constant-modulus or equivalent norm hypotheses; see §1 |\n| Hölder in `m`, `p>2` | same | — | — | would need `Y` concentrated on a sparse set of `m`; heuristic, nothing suggests it |\n| no Cauchy, `L^1` over `(u,h)` | the `L^1` norm of `G` over `(u,h)`, Cauchy–Schwarz against Lemma A's second moment | 3/2 | 103/100 | identical numbers to Lemma B, as it must be |\n| Type I / Type II on `mu(m)` | [left-divisor-signs](left-divisor-signs.md) Lemmas I, II | `>= 3/2`, `15/8` | 41/40 (best at that box) | still the best available at the target box; Lemma B does not improve it |\n\nNothing here beats `41/40` at the target box, and the deficit there remains\n`1/40` in block exponent, i.e. more than `1/20` of moment-exponent saving in\nthe currency of [grouped-divisor-moment (21)](grouped-divisor-moment.md).\n\n**Lemmas A and B import no literature.** The linked joint-Cauchy follow-up\nuses the classical completion inputs of grouped-divisor-moment. The two\nelementary lemmas here use no named theorem, so\nno literature search was run for them and none is claimed; the conventions\nthat would own such a search are listed in\n[SEARCH-CONVENTIONS.md](SEARCH-CONVENTIONS.md). The pricings quoted in the table for Bettin–Chandee/Wright, FKM,\nWu–Xi and Guria are those already recorded in\n[left-divisor-signs §6](left-divisor-signs.md),\n[small-divisor-kernel §5](small-divisor-kernel.md) and\n[structural-literature-audit §3D](structural-literature-audit.md); **they were\nnot re-verified at source here**, and nothing in Lemmas A or B depends on\nthem. A consequence worth stating: because Lemma A and Lemma B avoid\ncompletion entirely, the composite-modulus hypothesis that blocks the\ntrace-function inputs is simply absent from them — and that is also why they\nare weak, since they extract no square-root cancellation from the `m`-sum.\n\n## 7. Effect on the global consumer\n\n**None.** No budget in (6) or (8) falls below one outside the region already\ncontrolled, so the sufficient region of\n[RESEARCH-HANDOFF §4](RESEARCH-HANDOFF.md) is unchanged, `W_dagger` and its\nconcrete cuts are unchanged, `E_dagger` is the same exact sum, the reduction\n`S(x) = C_2 x + E_dagger(x) + O_H(x/log^H x)` is unchanged, and the sufficient\nmargin `C_2 x + E_dagger(x) >= c_0 x/(log x)^K` remains OPEN. The rescaled\naverage and the dyadic-block form of the consumer are equally unchanged.\n\n## 8. Validation, falsifiers, limits\n\n[signed-moment-validation.js](signed-moment-validation.js) (deterministic,\n0.4 s, output embedded by `node research/qc/embed.js`) checks in exact BigInt\nrationals: the block exponents of (5), (6), (8) and (9) at six named boxes;\nthat all four Lemma B terms equal `3/2` at the corner and that the grouped\nzero budget is exactly `1` there; the `191 x 191` region comparison, including\nthe 0 boxes added and the 16173 boxes where Lemma B beats both grouped\norientations; that (9) is below one on exactly the 36100 interior boxes; and\nthat the heuristic ceiling never exceeds a proven bound. It checks finitely\nthe four elementary inputs of the lemmas: the phase combination (7) on 995328\nconfigurations of `(u_1,u_2,m_1,m_2,h,theta,sigma)`; the coset structure of\n`P` on 3481 modulus pairs, both its size `c/ell_1 = u_2` and its membership in\n`P_0 + ell_1 Z/cZ`; the geometric-series sum bound with an absolute constant\nbelow 2 over 8192 configurations; the per-residue inverse count\n`<= |I|/u + 1`; and that `Phi` is a difference of pure exponentials in `h`\nwith `|Phi| <= 2 pi min(1, h|z-z_0|/(gmu))`.\n\nNegative controls, all firing: dropping the `h` geometric series returns the\ntrivial bound `a+b = 2` at the corner (`D1`); \"Lemma B adds region\" is false\n(`D2`); \"the corner is reachable by Lemma B\" is false (`D3`); reading Lemma\nA's `x^1` at the corner as a bound on `|T|` rather than on `|T|^2` (`D4`);\n\"the saving comes from somewhere other than completing the band by positivity\"\n(`D5`); and ignoring the `ell_1` spacing of the frequency coset (`D6`).\n\n**Falsifiers, and whether they have run.**\n(a) An error in the derivation of Lemma A or Lemma B — the exponent arithmetic\nand the four elementary inputs are checked mechanically, the analytic steps were checked in independent reviews 20 and 21,\nwith the scope and endpoint-factor corrections recorded there.\n(b) Formula (3) is exact and its upper bound is sufficient for the\ndiagonal assessment. The formerly unconditional lower bound and general\nHolder ceiling have been withdrawn; see readiness review F9.\n(c) The heuristic ceiling of §5 — falsified immediately by any proven block\nbound below `x^((1+min(a,b))/2)` at any box; the grid check confirms none of\nthe currently proven bounds is, but that is consistency, not confirmation.\n(d) The `(m,h)`-Cauchy row of §6 is now priced in readiness review C; if a stronger bound for its `u_1!=u_2` part turns out\nto be estimable for large `j`, its floor `M sqrt N` is `81/100` at the target\nbox, below `41/40`, and that row would have to be worked out.\n(e) The upstream block shape and its coefficient/twist dependence were\nchecked in review 20; the named imported theorems remain dependencies.\n\n**Limits.** Finite checks certify their finite scope. They establish no\nasymptotic rate, no effective onset, no percentage of completion and no lower\nbound on twins. A failed upper bound here is a failure of the stated estimate;\nit says nothing about the sign or the size of the correlation it fails to\nbound.\n\n**Integration:** TODO C, OUTCOMES, the router and generated QUESTIONS\nnow carry this note and the review corrections. Current downstream\nbriefs are in AGENT-START.md.\n"},"research/smooth-sieve-literature.md":{"lf_sha256":"c2e34c3e54f758f4429f1570253a51f3dcd5655e92824ab98877937d7e527e20","content":"# Smooth sieve literature: existing results and the next signed question\n\n\n\n**The sufficient twin-prime margin remains OPEN.** This is a bounded\nsource audit and one application of the matched upper-bound machinery,\nnot an originality claim. The source-informed priority is now to estimate\nthe signed contribution of specified factor configurations with a paid\ntail. Further generic moment calculations or profile optimization must\nname what they buy for that signed estimate.\n\nUse the exact C3 profile, floors and notation of\n[global-smooth-majorant.md](global-smooth-majorant.md):\nT=log x, J_x=(x/2,x], L_i=log(b_i/a_i),\n(a_L,b_L)=(floor(x^.22),floor(x^.24)),\n(a_R,b_R)=(floor(x^.04),floor(x^.05)), W_i=b_i.\nThe complete identity is\n\n\\[\n S(x)=C_2x+\\widehat{\\mathcal R}(x)+O_A(x/\\log^A x),\\qquad\n \\widehat{\\mathcal R}(x)=\\sum_{n\\in J_x}\n \\widehat G_L(n)\\widehat G_R(n-2). \\tag{1}\n\\]\n\n## 1. What the sources already do\n\n| Source and inspected location | Reusable content | Limit for this campaign |\n|---|---|---|\n| Granville--Koukoulopoulos--Maynard (GKM), [v4](https://arxiv.org/html/1606.06781v4), section 1.2, Theorems 1.3--1.4 and 10.4, Lemma 10.3 | Finite differences; moment and small-prime concentration estimates; integral transfer between profiles | One-point even moments do not determine the signed shifted pair. Smoothness requirements depend on the moment. |\n| Carneiro--Chirre--Helfgott--Mejia-Cordero (CCHM), [v6](https://arxiv.org/html/2005.03162v6), Theorem 1.2, Corollary 1.3 | Two-parameter quadratic main term and profile optimality | Optimizes the one-point quadratic form, not the full absolute pair or its sign. |\n| Green--Tao, [Appendix D](https://arxiv.org/html/math/0606088), Lemma D.2, Theorem D.3 and proof | Smooth shifted divisor correlations; explicit sieve factors | Its divisor theorem allows infinite-complexity systems; its prime theorem does not thereby apply to twins. Smoothness and support must still match. |\n| Goldston--Yildirim III, [section 8](https://arxiv.org/html/math/0209102), (8.1)--(8.10) | Different truncation levels, constants and product-of-levels error | The displayed theorem concerns truncated Lambda sums, not prime-filtered Ghat. Uniformity must be proved before integrating a family of cutoffs. |\n| Henriot, [original](https://arxiv.org/html/1102.1643v1) and [2014 erratum](https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B0BD208D979495FE06B8192209E710EA/S0305004114000280a.pdf/nair-tenenbaum-uniform-with-respect-to-the-discriminant-erratum.pdf), corrected New Theorem 5 | Upper bound for a nonnegative function in a uniform growth class, without multiplicativity | Not a signed theorem or a sharp constant. New Theorem 6 has additional hypotheses. |\n\nThe source convention and lookup scope are recorded in\n[SEARCH-CONVENTIONS.md](SEARCH-CONVENTIONS.md). Searches used smooth\nsieve weights, smallest prime factors, shifted divisor correlations and\nNair--Tenenbaum bounds. This is not a complete citation-tree review.\n\n## 2. Profile optimization already has an answer for the quadratic norm\n\nSet h(t)=chi(1-t), D_1=a_i and D_2=b_i in CCHM. The source hypotheses\nhold: h is absolutely continuous, constant outside [0,1], and h' has\nbounded variation. Expanding the finite divisor sum and counting\nmultiples gives an O(b_i^2) error since |rhohat_i|<=1. Consequently,\n\n\\[\n \\sum_{n\\in J_x}\\widehat F_i(n)^2\n =\\frac{|J_x|}{L_i}\\int_0^1|\\chi'(t)|^2\\,dt\n +O(x/L_i^2+b_i^2)\n =\\frac{700|J_x|}{429L_i}+O(x/L_i^2+b_i^2). \\tag{2}\n\\]\n\nHere chi'(t)=-140t^3(1-t)^3, so the integral is\n19600 B(7,7)=700/429. The\n[validator](smooth-sieve-literature-validation.js) checks it separately\nby polynomial integration and the factorial beta formula.\n\nFor every absolutely continuous transition with the same endpoint values,\nintegral |chi'|^2 >= |integral chi'|^2=1. The linear taper attains one.\nThus our C3 choice increases this norm's leading constant. Its purpose\nwas to enable a different shifted absolute estimate. Smoother does not\nmean better under every objective, and the quadratic optimization problem\nshould not be reassigned without changed constraints or a changed objective.\n\nEquation (2) concerns Fhat, not Ghat. It does not identify the implicit\nconstant of the Henriot majorant or compare that constant with C2.\n\n## 3. GKM suggests localization, but its one-point bound is not enough\n\nGKM Theorem 10.4(a) bounds the moment weighted by the number of small\nprime factors; Theorem 1.4(a) gives the corresponding exceptional-set\nbound. With the exact profile map in global-smooth-majorant section 7,\nthe C3 hypothesis admits second and fourth moments: 3>1 and 3>6/4.\nIt does not meet the general-profile sixth-moment condition 3>20/6.\nThe proof via Lemma 10.3 exposes bounded derivative norms, which stay\nbounded for our family because log(b_i)/L_i stays bounded.\n\nFor 0=2,\nthe second-moment source bound reads\n\n\\[\n \\sum_{\\substack{n\\le x\\\\P^-(n)\\le x^\\delta}}\n \\widehat F_i(n)^2\\ll \\delta x/T. \\tag{3}\n\\]\n\nApplying Cauchy to (3) and the other side's full second moment only\ngives O(sqrt(delta) x/T) for the absolute Fhat pair. Multiplication by\nthe two rough-part logarithms then gives O(sqrt(delta) x T).\nThat calculation loses a logarithm relative to the required scale.\nIt is not the shifted localization result below.\n\n### 3.1. A symmetry condition needed when reusing the prime integrals\n\nGKM Lemma 10.5 is stated for general C1 functions, but replaces an\nordered prime sum by 1/m! times a full-cube integral. The proof's\nfirst equality needs permutation symmetry. This omission is present\nin v4, pp. 68--69, and in the\n[journal version, pp. 1158--1159](https://smf.emath.fr/system/files/filepdf/ens_ann-sc_54_1089-1177.pdf).\n\nHere is an asymptotic counterexample to the unrestricted statement.\nTake m=2 and the fixed bounded C1 function\ng(t_1,t_2)=tanh(t_2-t_1), with y=exp(Y), z=exp(2Y).\nThe cube integral is zero by antisymmetry. Every ordered summand\nis positive. Restrict p to (exp(Y),exp(5Y/4)] and q to\n(exp(7Y/4),exp(2Y)]; then g(log p,log q)>=tanh(Y/2).\nMertens' prime harmonic asymptotic therefore gives a positive\nliminf at least log(5/4)log(8/7) as Y tends to infinity.\nThe displayed lemma's error tends to zero, since g and its gradient\nare bounded and both harmonic interval factors remain bounded.\nThus the unrestricted statement is false.\n\nThe paper's ensuing integrand g_m^(2k), built from all subset sums,\nis symmetric. This defect does not invalidate that application or\nthe moment statements used above. For a weight that privileges the\nsmallest prime, retain the ordering, or establish an ordered-domain\nintegration formula with its own error; do not import the cube/m!\nformula unchanged. Our harmonic proof in section 5 uses ordered\nsums and inequalities and does not use Lemma 10.5.\n\n## 4. What shifted divisor correlations do and do not reopen\n\nGreen--Tao Theorem D.3 requires that the affine forms are not rational\nmultiples. The forms n and n-2 qualify; only p=2 is exceptional.\nThe theorem explicitly does not require finite complexity. Lemma D.2\ngives c_(f,1)=-f'(0) and c_(f,2)=integral_0^infinity |f'|^2.\nThus a smooth plateau at zero has zero first-order sieve factor.\nThis explains why cancellation in an unweighted short-divisor surrogate\ncan be classical even at a fixed shift.\n\nA direct import for our exact C3 profile is not asserted. The theorem\nuses smooth compactly supported functions and a sufficiently small\ncutoff exponent. A compact extension on the negative axis is harmless\nfor positive divisors, but it does not turn C3 into C-infinity. The proof\nuses rapid Fourier decay; replacing it by finite regularity requires\nits own error check. Nor may a fixed exponent .24 be called sufficiently\nsmall without examining the support calculation.\n\nThere is a useful changed support fact. Direct CRT expansion of pure\nF_L^r F_R^s has a counting error O(b_L^r b_R^s), for fixed nonnegative\nintegers r,s and bounded divisor coefficients. Each compatible system\nhas one residue class modulo the lcm and hence an O(1) interval error.\nFor r=s=1 the exponent is .29; for r=s=2 it is .58. Both are below\none. The earlier transition calculation had a product above x.\nIts failed raw-support import does not exclude these smaller objects.\nThis counting observation alone does not evaluate the main form.\n\nFor the earlier linear taper there is the exact identity\n\n\\[\n F_i^{\\rm lin}(n)=\\frac{\\Lambda_{b_i}(n)-\\Lambda_{a_i}(n)}{L_i},\n \\qquad\n \\Lambda_R(n)=\\sum_{d\\mid n}\\mu(d)\\log(R/d)_+. \\tag{4}\n\\]\n\nGoldston--Yildirim's unequal-level theorem is therefore the existing\ntool for this surrogate. Its singleton constant C_1=1 makes the four\nleading terms cancel for two distinct shifts and fixed exponents.\nFor our smoother profile, two integrations by parts give instead\n\n\\[\n \\widehat F_i(n)=\\frac1{L_i}\\int_0^1\n \\chi''(u)\\Lambda_{a_i e^{L_i u}}(n)\\,du,\\qquad\n \\int_0^1\\chi''(u)\\,du=0. \\tag{5}\n\\]\n\nIndeed chi(v)=integral_0^1 chi''(u)(u-v)_+ du for v>=0; for v<0\nthe right side is one because integral chi''=0 and integral u chi''=1.\nThis also covers d=1 and both constant portions of the profile.\n\nUniform source errors on the compact exponent rectangles, interval\nendpoints and floors must be handled before consuming (5). Even a\ncompleted pure-F calculation omits H_L H_R and the prime exclusions.\nNeither paper supplies those extra weights by allowing arbitrary\nbounded multipliers. The actual signed Ghat consumer remains open.\n\n## 5. A shifted small-prime bound from the matched upper theorem\n\nThis is a derived application, motivated by section 3. It changes the\nmajorant, not the profile or identity (1).\n\nFix 00, partial summation of\nthe Mertens prime sum gives\n\n\\[\n \\sum_{p\\le z}\\frac{(\\log p)^b}{p-1}\\ll_b(\\log z)^b. \\tag{8}\n\\]\n\nThis pays the omega(m)=1 and 2 terms in sum_(m<=x) v(m)/m;\ntheir normalization powers are T^(1-sigma) and T^(2-sigma).\nFor omega(m)>=3, fix its first three primes p0.\nThis retains all additional factors and their powers, rather than\ntruncating them. Together with m=1 it proves sum v(m)/m=O_sigma(1).\n\n**Shifted import.** Reuse Henriot's corrected New Theorem 5 with\nX=Y=x/2, Q_1(t)=t, Q_2(t)=t-2, alpha=1/2, delta_source=1,\nepsilon_source=1/1200. The polynomial-size and degree hypotheses,\nfixed resultant and corrected density bound <=2/(ab) are unchanged.\nThe latter follows from the compatible congruences a|n, b|n-2,\nwhose density is gcd(a,b)/(ab), with gcd(a,b)|2.\nEquations (7)--(9) and the harmonic bound for w therefore give\n\n\\[\n \\sum_{n\\in J_x}\\bigl(v(n)w(n-2)+w(n)v(n-2)\\bigr)\n \\ll_\\sigma x/T^2. \\tag{10}\n\\]\n\nIf P^-(m)<=x^delta, then w(m)=ell_1^sigma v(m)<=delta^sigma v(m).\nApplying this on either side of the pair, with a union bound, yields\n\n\\[\n \\sum_{\\substack{n\\in J_x\\\\P^-(n(n-2))\\le x^\\delta}}\n |\\widehat F_L(n)\\widehat F_R(n-2)|\n \\ll_\\sigma\\delta^\\sigma x/T^2.\n \\tag{11}\n\\]\n\nThe constants are independent of delta. If x^delta<2, the set is\nempty. The prime two, both possible marked sides, m=1 in the source\nclass, and squareful integers have all been accounted for.\n\nThe absolute exceptional-set proof of\n[global-factor-signs.md](global-factor-signs.md) section 2 also bounds\nthe error on any subset. Since each H_i=log t_i is at most T and\ndropping composite filters enlarges a nonnegative sum, it gives\n\n\\[\n \\boxed{\\displaystyle\n \\sum_{\\substack{n\\in J_x\\\\P^-(n(n-2))\\le x^\\delta}}\n |\\widehat G_L(n)\\widehat G_R(n-2)|\n \\ll_\\sigma\\delta^\\sigma x\n +O_\\epsilon(x^{39/40+\\epsilon}).} \\tag{12}\n\\]\n\nFix epsilon<1/40. No signed improvement or explicit small constant is\ninferred from (12). It is a localization of the existing absolute budget.\n\n## 6. The remaining factor problem and the prime-filter trap\n\nLet R_delta be the Ghat pair restricted to P^-(n(n-2))>x^delta.\nFor sigma fixed, (12) implies\n\n\\[\n |\\widehat{\\mathcal R}-R_\\delta|\n \\le K_\\sigma\\delta^\\sigma x\n +O_\\epsilon(x^{39/40+\\epsilon}). \\tag{13}\n\\]\n\nAt fixed delta, each remaining integer has Omega(n)<=1/delta,\ncounting multiplicity. Thus the full remainder can be approximated\nto any fixed multiple of x by finitely many prime-factor types.\nThis is not a density theorem for those types: their prime variables\nstill satisfy the coupled equation n-(n-2)=2.\n\nFor delta<.04, primes in these configurations can still lie on both\nsides of each a_i,b_i boundary. The ten-prime negative Fhat cell has\nnot disappeared. Its sign must be retained whenever its factors lie\nabove the new cutoff.\n\nRemoving prime exclusions is particularly dangerous here. Put\nA_i(m)=Fhat_i(m)H_i(m) and P(m)=1_(m prime)log m. On the present\ndyadic interval A_i(p)=log p for primes, so\nC_i^comp=A_i-P exactly. Consequently\n\n\\[\n \\begin{aligned}\n C_L^{\\rm comp}(n)C_R^{\\rm comp}(n-2)\n ={}&A_L(n)A_R(n-2)-P(n)A_R(n-2)\\\\\n &-P(n-2)A_L(n)+P(n)P(n-2). \\tag{14}\n \\end{aligned}\n\\]\n\nThe last term is the weighted twin count itself. Accounting for proper\nprime powers converts it to S with the existing negligible correction.\nHence evaluating unfiltered surrogates and then treating all filter\nterms as already known would assume the problem being investigated.\nThis is a specific algebraic warning, not a theorem excluding every\nuse of a filtered or signed sieve.\n\nThere is also an essential quantifier limit. A fixed delta gives a\nfixed error K_sigma delta^sigma x. It cannot automatically absorb\ncx/log^K x as x grows. A proof retaining only this error would need\na sufficient fixed linear surplus, or a uniform analysis with\ndelta=delta(x) shrinking, or a sharper signed estimate of the tail.\nWhen delta shrinks the number of allowed prime factors grows.\nWe have neither a numerical K_sigma nor evidence that exhaustive\nenumeration at a useful delta would be computationally practical.\n\n## 7. Revised next step and conditions for reuse\n\nThe [executed switching match](switching-negative-mass.md) prices a\nthree-prime/rough-composite family using ordinary BV and the linear\nsieve, including an upper bound for the excluded prime partners.\nIt derives liminf Nhat/(C2*x)>3/2. A negative-only upper bound below\nC2*x is therefore refuted for the current cutoff exponents, including\nthe localized remainder at fixed delta<1/50. The next comparison\nmust retain positive mass; the net signed margin is still OPEN.\n\n1. Keep (2), the source moment thresholds and the pure-divisor\n correlation formulas as imported background. Do not spend another\n attempt deriving their orders without a new signed consumer.\n2. Use (13) to write the actual opposed-sign factor contribution,\n retaining the positive part and prime exclusions. Match each proposed\n estimate to classical Buchstab decomposition, switching or\n almost-prime sieve results before inventing a replacement. Read\n [chen-opportunity-audit.md](chen-opportunity-audit.md) first: finite\n factor count and a clipped weight were already insufficient there.\n3. The next bounded output should be a matched comparison of positive\n and negative families, with its constant and complement budget.\n State which joint prime-factor density remains an open input.\n If the computed or derived bounds leave a deficit, record that\n scoped failure instead of enlarging an unvalidated computation.\n\nFor example, a fixed-delta estimate\nR_delta >= (-C2+K_sigma delta^sigma+c)x for some c>0 would\nsuffice via (1), (13). It is stronger than necessary and is presently\nOPEN. Merely restating it is not progress. PNT estimates for individual\nprime variables do not supply the coupled factor density.\n\n## 8. Source custody and validation\n\nRead on 2026-09-06: the locations in section 1, GKM's section 10.3\nproof and Green--Tao's Fourier/Euler-product argument in Appendix D.\nThis is not a claim to have independently re-proved all imported\ntheorems or read every section of every paper. The theorem pages and\ntheir continuations were inspected as rendered PDFs as well as text.\nThe existing Henriot correction and source-class match were reused\nand checked against the new weights in section 5.\n\n| PDF | SHA-256 | Principal page locators checked |\n|---|---|---|\n| GKM v4 | 67feecce65ced4250aa046d6e0c36300744eb84358d21d53409a512d1649e34d | PDF pp. 9, 66--68; source equations (1.6)--(1.7), Theorems 1.4, 10.4 |\n| GKM published version | 287f0f9953370ff5dc874217babdd6679619951bc005ab4c95fb84425a94765d | Printed pp. 1158--1160, PDF pp. 72--74; symmetry check for Lemma 10.5 and its application |\n| CCHM v6 | 0bd3729efe1c89edf14c1ca22240af8362d6375397505cbcbb557dfe296eb309 | PDF pp. 4--5, Theorem 1.2 and Corollary 1.3 |\n| Green--Tao published PDF | ec126f9c9e189cc0308b83fb4f9f93c29a47d11ad875391aff4ce4c42aef1001 | Printed pp. 1828--1835, PDF pp. 78--85 |\n| Goldston--Yildirim III | 6be1422119bf78f43ea265da70bc73ce6b952ca07560f80b5105d96a81eca66f | PDF pp. 30--31, section 8 |\n| Henriot erratum | bd56f8f411457549c5cc53f9b24bbdec68544dca09cfe0836e35cc1b25677d6f | Printed pp. 375, 377; custody in global-smooth-majorant section 4 |\n\n[smooth-sieve-literature-validation.js](smooth-sieve-literature-validation.js)\nchecks the rational derivative constant, squared v-envelope growth at\nsigma=1/2, small-prime suppression with exact ordered proxies, squareful\ninputs and (14). Controls reject the same growth argument with a\nnegative first-coordinate exponent, a C3 sixth-moment import and the\nomission of the twin term. An antisymmetric control detects the\nordered/unordered substitution in Lemma 10.5, while a symmetric\ncontrol verifies its permitted use. The first filter check used JavaScript\nnumbers and tripped over signed zero; using BigInt makes that integer\nidentity exact without a signed-zero convention.\n\nA failure of uniform growth, (9), the corrected theorem hypotheses or\nthe absolute exceptional-set transfer would invalidate (12).\nThose are written arguments; the finite validator does not establish\nan asymptotic, an effective onset, a useful constant or a twin margin.\n"},"research/structured-dispersion-estimate.md":{"lf_sha256":"10da6db188a50eb57a45efedd139ce29883a7004d50bd6ed205af02748c23516","content":"# Cauchy in (m,q): the right prime-power factor kept outside the moment\n\n\n\n Lane / stable question id: D / Q-structured-dispersion-estimate\n Starting commit / report commit or shared-checkout paths: 1285d47, shared checkout; this note and structured-dispersion-estimate-validation.js\n Disposition / exact claim / unproved hypotheses: (D1), Lemma H and the fourth residual condition are accepted at stated scope after the independent 2026-09-09 reading. Completion (7), the required separate coefficients and the Perron/density application were checked. No sufficient global signed margin follows.\n Changed step compared with the reviewed baseline: the first Cauchy inequality is taken over (m,q) with q the right prime power, not over m; the moment is over pairs of the original right divisor e with the same q. The structure-discarding step (R,q)<=q returns exactly the old 103/100.\n Source theorem and first unmatched hypothesis, if any: no new import. grouped-divisor-moment (7) (Pascadi Lemmas 3.2-3.3) reused at its recorded scope; Lemma H is elementary and proved here.\n Validation command, falsifier, result and compute used: node research/structured-dispersion-estimate-validation.js (1.1 s, one core, embedded); Lemma H exact on 62832 configurations, pair algebra and direct moment expansion exact, region grid 245 new boxes with closed form matching, six negative controls fire. Falsifiers in section 5. Zero enumeration.\n Independent reviewer / disposition (PENDING until actually reviewed): handler (first reading, research-round-validation section 10, committed 013f0dc) and reader V3 (independent proof of Lemma H, reconstruction of (D1), about 270k finite configurations): verified within stated scope. Section 6 as now written (fourth condition, lower product cut, inclusion-exclusion): PENDING.\n Full-consumer payoff and unpaid complement: none for the global margin. Regional only: a fourth simultaneous condition for W_dagger (section 6), derived through the existing Perron machinery; the target box stays uncontrolled by 7/400 in block exponent.\n Proposed shared-record changes / next bounded obligation: section 7; section 8.\n\n**Twin-prime infinitude and the sufficient signed margin of\n[RESEARCH-HANDOFF section 3](RESEARCH-HANDOFF.md) remain OPEN. This note\nchanges the summation domain of E_dagger by one added cut (section 6) and\nnothing else: not the sign of E_dagger, not any signed margin, not the\ntarget box, not the corner.** What follows is one derived block bound, its\nelementary lemma, the exact rational bookkeeping of what it buys, the\nstep at which the generic exponent reappears when the structure is\ndiscarded, and the application of the bound as a fourth condition of\nW_dagger. The bound and the lemma were read by the handler and by reader\nV3 on 2026-09-08 and verified within stated scope; the application in\nsection 6 was corrected then and independently re-read on 2026-09-09\nwith completion, coefficient separation and density inputs checked. A smaller deficit at one box and a strip of new region are not\nevidence about the sign or size of the signed remainder.\n\n## 1. Question, disposition and what remains open\n\nThe lane asks whether retaining the structure of b_u=A_right(gu) through\none further factorization improves the small-common-divisor cross term of\n[grouped-divisor-moment (21)](grouped-divisor-moment.md) at\n(delta,nu)=(8/25,9/20), where the generic top-moment exponent is 3/2 and the\nsufficient target needs an exponent strictly below 36/25.\n\nDisposition. The only factorization the actual right coefficient carries\nis u=eq: by [endpoint-fourier (4)-(5)](endpoint-fourier.md) and\n[grouped-divisor-moment (13)](grouped-divisor-moment.md), the prime-power\nterm of A_1 is exactly the Dirichlet convolution of mu(.)(.)^(-s)1_J with\nLambda 1_[2,Z], Z=floor(x^(1/20)). Keeping that factorization and taking\nthe first Cauchy inequality over (m,q) rather than over m gives the block\nbound (D1) below. At the target box it lowers the worst sector exponent from\n41/40 ([left-divisor-signs section 4](left-divisor-signs.md)) to 407/400;\nthe box is not controlled. Regionally, (D1) controls the strip\ndelta<71/100, delta+3nu<327/200 outside the previous region, and section\n6 adds the corresponding cut to W_dagger.\n\nOpen. Target (21) at the target box; every sufficient signed margin; the\ncorner a=b=1, where (D1) is worse than the grouped bound. The variant that\ndiscards the structure, (R,q)<=q in the Weil term, returns exactly the\ngeneric 103/100; that is the step identified by the stop rule, and it is\nnot taken here.\n\n## 2. Exact statement\n\nNotation follows [grouped-divisor-moment section 1](grouped-divisor-moment.md)\nand [RESEARCH-HANDOFF section 4](RESEARCH-HANDOFF.md). Let x>=8; all lengths\nare at most a fixed power of x and the constants may depend on that power\nand on epsilon. Let M,E,Q,A>=1, let I_m be an integer subinterval of (M,2M],\nH a subset of the integers in [A,2A], g in {1,2}, theta=2/g, sigma in\n{-1,1}, and Phi_{u,h}(m), v=Ax/(MN), f=min(1,v) as in that section, with\nN:=EQ. Let\n\n\\[\n \\mathcal Q\\subseteq[Q,2Q)\\ \\text{a set of prime powers},\\qquad\n 0\\le\\lambda(q)\\le\\log(2Q),\\qquad\n \\beta:(E,2E]\\cap\\mathbb Z\\to\\mathbb C,\\ |\\beta|\\le1,\n\\]\n\nand define the structured right coefficient and the block\n\n\\[\n b_u=\\sum_{q\\in\\mathcal Q,\\ q\\mid u}\\beta(u/q)\\lambda(q),\\qquad\n T=\\sum_{m\\in I_m}a_m\\sum_{u}b_u\\sum_{h\\in H}c_h1_{(m,u)=1}\n e_u(\\sigma\\theta h\\bar m)\\Phi_{u,h}(m), \\tag{1}\n\\]\n\nwith |a_m|<=log x and |c_h|<=C/A, C fixed. The support of b_u lies in\n(N,4N]. In the application a_m=A_left(gm) and, for g=1, u=eq with\nbeta(e)=-mu(e)e^{-s}1_J(e), lambda=Lambda; the g=2 branch is the relabelling\nof [left-divisor-signs section 1, item 3](left-divisor-signs.md), which\nkeeps the same shape with beta bounded by one and lambda(q)=log 2 on powers\nof two. The sectors of A_right without a prime power (A_0 and the -mu log\nterm) are not of the form (1) with Q>1; they are handled by the grouped\nbound with b=nu and are already controlled at every box considered below.\n\n**Lemma H (harmonic gcd average with a fixed prime-power factor; derived\nhere).** Let q=p^k be a prime power, l_1,l_2>=1 coprime integers, A>=1,\nH a subset of the integers in (A,2A] or in [A,2A] (the counts in the\nproof hold on either interval with the same constants; section 2 above\nand grouped-divisor-moment section 1 use the closed one). For h_1,h_2 in\nH put R=h_1l_2-h_2l_1 and read (0,q)=q. Then\n\n\\[\n \\sum_{h_1,h_2\\in H}(R,q)^{1/2}(h_1,l_1)^{1/2}(h_2,l_2)^{1/2}\n \\le(k+1)\\tau(l_1)\\tau(l_2)\\bigl[4A^2+2^{3/2}A^{3/2}q^{1/2}\\bigr]. \\tag{2}\n\\]\n\n**Block bound (D1; derived here).** Under the hypotheses above, for every\nfixed epsilon>0,\n\n\\[\n |T|\\ll_\\epsilon x^\\epsilon f\\Bigl[M\\Bigl(\\frac{NQ}{A}\\Bigr)^{1/2}\n +(1+v)^{1/2}\\Bigl(M^{1/2}N^{3/2}\\bigl(Q^{-1/4}+A^{-1/4}\\bigr)+MQ\\Bigr)\\Bigr].\n \\tag{3}\n\\]\n\nFor comparison, [grouped-divisor-moment (14)](grouped-divisor-moment.md)\nwith the first Cauchy in m gives, in the same normalisation,\nx^epsilon f[M(N/A)^(1/2)+(1+v)^(1/2)(M^(1/2)N^(3/2)+M)]. So (3) multiplies\nthe zero term by Q^(1/2), the period term by Q, and the cross term by\nQ^(-1/4)+A^(-1/4).\n\n**Exponents.** Write M=x^a, N=x^b, Q=x^sigma and alpha=a+b-1 for the top\nharmonic band A=MN/x, where f=1 and v=1. The band that binds is the top one\n(section 4, step 6). The block exponents of (3) are\n\n\\[\n \\frac{1+a+\\sigma}{2},\\qquad\n \\frac a2+\\frac{3b}2-\\frac{\\min(\\sigma,\\alpha)}4,\\qquad a+\\sigma. \\tag{4}\n\\]\n\nAt the target box (delta,nu)=(8/25,9/20), top sector a=14/25, b=1/2,\nsigma=1/20, alpha=3/50: the exponents are 161/200, 407/400, 61/100. The\ncross exponent is 407/400 against 103/100 from the grouped moment, a saving\nof exactly 1/80. The box is not controlled: the deficit is 7/400.\n\n**Sector union at the target box.** With a=8/25+rho, b=9/20+sigma for the\nleft prime power r~x^rho, 0<=rho<=6/25, and the right one q~x^sigma,\n0<=sigma<=1/20, and using for each sector the best of the grouped bound,\nLemma II of left-divisor-signs and (D1), the worst surviving sector\nexponent is 407/400, attained at (rho,sigma)=(6/25,1/20); before this note\nit was 41/40. The survivor set shrinks from 885 to 730 of the 40401 lattice\nsectors and is nonempty.\n\n**Region.** For a box (delta,nu) with delta+nu>=19/25 (every box outside\nthe existing region), alpha>=sigma=1/20 in the top sector, and (3)\ncontrols the box, in the sense max of (4) below one with fixed margin,\nexactly when\n\n\\[\n \\delta<\\tfrac{71}{100}\\qquad\\text{and}\\qquad\\delta+3\\nu<\\tfrac{327}{200}.\n \\tag{5}\n\\]\n\nThe existing region is delta+nu<19/25, or 5delta+2nu<123/50, or\n(delta<19/25 and delta+3nu<161/100). On the 191 x 191 rational lattice of\nthe validator, (5) minus the existing region has 245 boxes, for instance\n(1/2,93/250) with (D1) exponents 179/200, 1981/2000, 79/100. The product\nwitness (8/25,11/25) has (D1) cross exponent 401/400 and stays\nuncontrolled, so the uniform product threshold remains every fixed\nexponent below 19/25. At the corner a=b=1 the (D1) zero budget is 41/40,\nworse than the grouped value 1.\n\n## 3. Prior-work and novelty check; source hypothesis matrix\n\n**Local prior work read.** [grouped-divisor-moment](grouped-divisor-moment.md)\nsections 1-6 (the moment, its proof, (12), (21));\n[small-divisor-kernel](small-divisor-kernel.md) (reciprocity separation,\nBettin-Chandee 129/125, DFI 1267/1200, the coprime-pair localisation of the\ndeficit); [left-divisor-signs](left-divisor-signs.md) (sector split of the\nLEFT coefficient, Lemma I, Lemma II, 41/40, the right-orientation Lemma II\nat 207/200); [signed-moment](signed-moment.md) sections 0-6 (Lemmas A, B,\nthe arrangement table); [readiness review C](history/reviews-0906/21-readiness-review.md)\n(joint Cauchy in (m,h) priced at 103/100, no region);\n[structural-literature-audit](structural-literature-audit.md) sections 2-4;\nthe OUTCOMES entries for those five ids and for reachability-coverage.\n\n**Why this variant.** The first-dispatch memory named joint Cauchy in\n(m,h) as unpriced; readiness review C has since priced it at a+b/2,\na/2+3b/2, a, so 103/100 at the target box with no region, and the\nsigned-moment OUTCOMES entry says a new attempt must change an estimate or\nhypothesis, not reprice joint Cauchy. The arrangement table of\nsigned-moment section 6 lists Cauchy in m, u, h, (m,h), Holder, and Type\nI/II on mu(m); left-divisor-signs uses the convolution structure of the\nLEFT coefficient only, and its right-orientation Lemma II is a Cauchy in e\nwith modulus m, a different object. No note in the corpus takes the first\nCauchy over (m,q) with q the right prime power while keeping the modulus\nu=eq and the second moment over e. The deficit sector is exactly\nq>x^(3/100) (left-divisor-signs section 4), so the factor is present with\na fixed positive exponent where the deficit sits. That is the reason for\nthe choice; it was fixed before any calculation.\n\n**Technique provenance.** Applying Cauchy-Schwarz with a short factor of\nthe modulus held outside, so that the resulting moment runs over pairs\nsharing that factor, is a standard device of the dispersion method and is\nnot claimed as new. The owning convention is the dispersion-method rows of\n[SEARCH-CONVENTIONS section 1](SEARCH-CONVENTIONS.md) (Cauchy-Schwarz,\ngcd sums, completion, composite-modulus Weil bound). No web search was run\nin this pass and no locator for the device is recorded; the claim of this\nnote is only that the arrangement is new to this corpus and that its\npricing at this block is as stated.\n\n**Source matrix.**\n\n| Import | Source, version, locator | Hypotheses | Discharge | Unmatched |\n|---|---|---|---|---|\n| Completion bound (7) of grouped-divisor-moment, for every subinterval, composite modulus c, any numerator r, G=(r,c) | [Pascadi, Lemmas 3.2-3.3](https://link.springer.com/article/10.1007/s00039-026-00746-0), read 2026-09-06 and re-read in the primary text on 2026-09-09 | complete Kloosterman sums S(t,r;c) with the Ramanujan and Weil bounds; finite Fourier completion of an interval | modulus c=qj l_1l_2 and numerator sigma theta R are integers, c polynomially bounded; same use as (7) | none; reuse at the recorded scope |\n| Endpoint variation (6) | grouped-divisor-moment section 2, derived there | Phi as in (1), endpoints at most x | unchanged | none |\n| Harmonic and common-divisor gcd averages (9) | grouped-divisor-moment section 3, derived there | alpha in [0,1], R nonzero for the j-average | used for the j_e average only; the q factor is handled by Lemma H | none |\n| Collision count (4) of structural-literature-audit | derived there | u_i in (N,2N], h_i in (A,2A] | applied with e_i in (E,2E] | none |\n| Lemma H | this note, section 4 | q prime power, (l_1,l_2)=1, H in (A,2A] | proved below; checked finitely | none |\n| Chebyshev bound sum_{q<2Q}Lambda(q)<=4Q | elementary (psi(y)<=2y for y>=1, Rosser-Schoenfeld range not needed at this crudeness) | none | used once | none |\n\nNo modern bilinear, spectral or trace-function theorem is imported.\n\n## 4. Proof of Lemma H and of (D1)\n\n**Lemma H.** Write (R,q)^(1/2)<=sum_{0<=i<=k}p^{i/2}1_{p^i|R}: for R\nnonzero with (R,q)=p^{i_0} the term i=i_0 alone is p^{i_0/2}, and for R=0\nthe term i=k is q^(1/2). Likewise (h,l)^(1/2)<=sum_{d|l, d|h}d^(1/2).\nHence the left side of (2) is at most\n\n\\[\n \\sum_{i\\le k}\\ \\sum_{d_1\\mid l_1}\\ \\sum_{d_2\\mid l_2}(p^id_1d_2)^{1/2}\n \\,\\mathcal N(i,d_1,d_2),\\qquad\n \\mathcal N=\\#\\{(h_1,h_2)\\in H^2:\\ d_1\\mid h_1,\\ d_2\\mid h_2,\\ p^i\\mid R\\}.\n\\]\n\nSince (l_1,l_2)=1, p divides at most one of l_1,l_2. Suppose p does not\ndivide l_1 (the other case is symmetric under 1<->2, R->-R). For each h_1\nthe condition p^i | h_1l_2-h_2l_1 puts h_2 in one residue class modulo p^i,\nbecause l_1 is invertible modulo p. Together with d_2 | h_2 the solutions\nh_2 form one class modulo lcm(d_2,p^i) or none; an interval of length A\ncontains at most 2A/lcm(d_2,p^i)+1<=2A/max(d_2,p^i)+1 of them. The number\nof h_1 in (A,2A] divisible by d_1 is at most 2A/d_1 (zero when d_1>2A, at\nmost A/d_1+1<=2A/d_1 when d_1<=A, at most 1<=2A/d_1 otherwise). If d_2>2A\nthere is no h_2, so d_2<=2A may be assumed. Therefore the contribution of\n(i,d_1,d_2) is at most\n\n\\[\n (p^id_1d_2)^{1/2}\\frac{2A}{d_1}\\Bigl(\\frac{2A}{\\max(d_2,p^i)}+1\\Bigr)\n \\le\\frac{4A^2}{d_1^{1/2}}+\\frac{2A\\,q^{1/2}(2A)^{1/2}}{d_1^{1/2}},\n\\]\n\nusing (p^id_2)^(1/2)<=max(d_2,p^i), p^i<=q and d_2<=2A. Summing\nd_1^(-1/2) over the divisors of l_1 gives at most tau(l_1), summing 1 over\nthe divisors of l_2 gives tau(l_2), and there are k+1 values of i. This is\n(2). The case p | l_1 exchanges the roles of the indices and gives the same\nbound. QED.\n\n**(D1).** Step 1, the Cauchy inequality over (m,q). By (1) and the\ndefinition of b_u,\n\n\\[\n T=\\sum_{m\\in I_m}\\sum_{q\\in\\mathcal Q}a_m\\lambda(q)Y_q(m),\\qquad\n Y_q(m)=\\sum_{e\\sim E}\\beta(e)\\sum_{h\\in H}c_h1_{(m,eq)=1}\n e_{eq}(\\sigma\\theta h\\bar m)\\Phi_{eq,h}(m).\n\\]\n\nThe map (e,q)->u=eq need not be injective; that is immaterial, because the\ninner expression depends on (e,q) only through u=eq and the double sum\nequals the u-sum with coefficient b_u. Cauchy with the nonnegative weights\nlambda(q) gives\n\n\\[\n |T|^2\\le\\Bigl(\\sum_{m,q}|a_m|^2\\lambda(q)\\Bigr)\n \\Bigl(\\sum_{q\\in\\mathcal Q}\\lambda(q)\\,\\mathfrak M_q\\Bigr),\\qquad\n \\mathfrak M_q=\\sum_{m\\in I_m}|Y_q(m)|^2, \\tag{6}\n\\]\n\nand the first factor is at most M log^2 x times sum_q lambda(q), at most\nMQ log^2 x log(2Q) since [Q,2Q) holds at most Q prime powers; the\nlogarithms are absorbed in x^epsilon.\n\nStep 2, the moment for fixed q. Expand |Y_q(m)|^2 over ordered pairs\n(e_1,h_1),(e_2,h_2). Put j=(e_1,e_2), e_i=jl_i, (l_1,l_2)=1, and\nc=q j l_1 l_2=lcm(qe_1,qe_2). Since c/(qe_1)=l_2 and c/(qe_2)=l_1, the two\ninverse phases combine exactly as in\n[structural-literature-audit (1)](structural-literature-audit.md):\n\n\\[\n e_{qe_1}(\\sigma\\theta h_1\\bar m)\\overline{e_{qe_2}(\\sigma\\theta h_2\\bar m)}\n =e_c(\\sigma\\theta R\\bar m),\\qquad R=h_1l_2-h_2l_1, \\tag{7}\n\\]\n\nwith the inverse of m modulo c, valid for (m,c)=1, which is the\ncoprimality condition of both terms. Checked exactly in the validator (B1)\ntogether with the direct expansion (B3). The pair kernel is\nK=sum_{m in I_m,(m,c)=1}e_c(sigma theta R mbar)F(m) with\nF=Phi_{qe_1,h_1}conj(Phi_{qe_2,h_2}), and by grouped-divisor-moment (6)\nand (7), for R nonzero,\n\n\\[\n |K|\\ll_\\epsilon x^\\epsilon f^2(1+v)\\bigl[\\sqrt{cG}+\\tfrac Mc G\\bigr],\n \\qquad G=(\\sigma\\theta R,c)\\le2(R,q)(R,j)(h_1,l_1)(h_2,l_2). \\tag{8}\n\\]\n\nThe gcd bound uses (R,ab)<=(R,a)(R,b) and (R,l_i)=(h_i,l_i), the latter\nbecause (l_1,l_2)=1; prime powers shared by q, j and an l_i are covered\n(validator B2).\n\nStep 3, the R=0 class. By structural-literature-audit (4) with N replaced\nby E, the number of ordered pairs with h_1e_2=h_2e_1 is at most\n8EA H_{floor(2 min(E,A))}, and each contributes at most (C/A)^2 f^2 M\ntimes an absolute constant. So the R=0 part of M_q is\nO(f^2 (ME/A) log x), for every q, including unequal proportional pairs\nsuch as (e_1,h_1)=(6,3),(e_2,h_2)=(10,5).\n\nStep 4, the Weil part on a band j~J, for fixed q. With L=E/J and (8), the\nabsolute sum over the pairs of |beta beta c c| sqrt(cG) is at most\n\n\\[\n \\frac{C^2}{A^2}\\sum_{l_1,l_2\\le2L}\\sqrt{2q\\,l_1l_2}\n \\sum_{h_1,h_2\\in H,\\ R\\ne0}(R,q)^{1/2}(h_1,l_1)^{1/2}(h_2,l_2)^{1/2}\n \\sum_{j\\sim J}\\sqrt{j\\,(R,j)}.\n\\]\n\nFor fixed (l_1,l_2,h_1,h_2) the integer R does not depend on j, so\ngrouped-divisor-moment (9) with alpha=1/2 gives\nsum_{j~J}sqrt(j(R,j))<=2^(3/2)J^(3/2)tau(|R|)<=x^epsilon J^(3/2), R being\nnonzero and polynomially bounded. Lemma H bounds the harmonic double sum by\nx^epsilon A^2(1+(q/A)^(1/2)). The l-sum of sqrt(l_1l_2) over l_i<=2L is\nO(L^3). Dropping the coprimality and interval restrictions only enlarges a\nsum of nonnegative terms. Hence the Weil part of M_q on the band is\n\n\\[\n \\ll_\\epsilon x^\\epsilon f^2(1+v)\\,q^{1/2}\\bigl(1+(q/A)^{1/2}\\bigr)\n \\frac{E^3}{J^{3/2}}, \\tag{9}\n\\]\n\nand the geometric sum over J gives the same with J=1.\n\nStep 5, the period part. Use (R,q)<=q in (8): then\nMG/c<=2M(R,j)(h_1,l_1)(h_2,l_2)/(j l_1l_2), the factor q cancels, and the\nargument of grouped-divisor-moment (11) applies verbatim: the j-average\nby (9) at alpha=1, the harmonic averages by (9) at alpha=1, and\nsum 1/(l_1l_2)=O(1) per dyadic band. The period part of M_q is\nO(x^epsilon f^2(1+v)M) for every q.\n\nStep 6, assembly. Summing over q in Q with weights lambda(q), and using\nsum_q lambda(q)<=4Q log(2Q) (there are at most 2Q prime powers below 2Q;\nChebyshev is not even needed at this crudeness), together with\nsum_q lambda(q)q^(1/2)(1+(q/A)^(1/2))<=19/25 (0 mismatches, 245 new boxes); and the 201 x 201\nsector lattice at the target box (worst 41/40 -> 407/400, survivors 885\n-> 730).\n\nNegative controls, all firing: Lemma H without its q^(1/2) tail (3\nviolations, from q>A with R=0 pairs); the structure-discarding step\nreturns exactly 103/100; the black-box (12) variant gives 417/400;\ndropping the first-Cauchy factor Q would add 277 boxes instead of 245;\ndropping the delta<71/100 cut would add 329; the target box is not\ncontrolled. Section E of the validator checks the four-condition domain\nof section 6: it is contained in the old domain, misses every box of the\ncut set C', has fixed slack at least 1/500 under (D1) and under the\ngrouped bound for the non-prime-power sectors on every grid box meeting\nC' (minimum slacks 77/38000 and 273/9500), and the substitution the\nfirst draft proposed would have re-admitted the witness (73/100,29/100)\ntogether with 1543 grid boxes (928 under V3's region definition).\n\nThese finite checks certify the elementary inputs and the arithmetic. They\ndo not test the completion bound (7), which is reused, and they establish\nno asymptotic rate, no effective onset and no lower bound on twins.\n\nFalsifiers and review scope. The 2026-09-09 independent review\nreconstructs Lemma H, the order of summation in step 4, completion (7),\nthe first Cauchy factor and the cut application. The factorization\non (m,q) is a_m lambda(q); a general jointly dependent coefficient would\nnot justify that step. The application has its joint dependence in the\nphase and Phi through u=eq, with separate original divisor coefficients\nas checked in endpoint-fourier (4)–(9). All eight cut intersections are\nseparated by the fixed-margin Perron construction; their untwisted density\nuses the excluded-prime mean over clipped d intervals. An error in one\nof these steps would invalidate its stated downstream scope. The finite\nvalidator checks algebra and budgets, not those analytic theorems.\n\n## 6. Payoff for the full twin consumer, or the regional limit\n\n**Global margin: none.** (3) is an upper bound for a block; it says\nnothing about the sign of E_dagger. The sufficient margin\nC_2x+E_dagger>=c_0x/(log x)^K, the rescaled average and the dyadic-block\nform remain OPEN exactly as in RESEARCH-HANDOFF section 3.\n\n**Target box: not controlled.** The worst sector exponent is 407/400. In\nthe currency of a moment, a sufficient budget through (6) is\nsum_q Lambda(q) M_q^x <= x^(139/100-2eta) for the nonzero-R, small-j_e\npart, against the present bound x^(57/40): a deficit of 7/200 in that\nmoment's exponent, 7/400 in the block. Indeed Q^(3/2)E^3 has exponent 3(1/20)/2+3(1/2-1/20)=57/40,\nand the Cauchy factor MQ has exponent 14/25+1/20=61/100. Their\nhalf-sum is 407/400. By (9), restricting to j_e>x^(7/300+epsilon)\nwith fixed epsilon>0 pays this deficit with positive slack. The\nremaining small-gcd range includes coprime e-pairs inside a common q, the\nsame shape as small-divisor-kernel section 1 one level down. The\nfactorization does not remove the coprime-pair deficit; it shrinks it.\n\n**Regional gain: a fourth simultaneous condition for W_dagger.** Fix\n\n\\[\n \\kappa'=\\tfrac{141}{200},\\qquad\\lambda'=\\tfrac{1631}{1000},\\qquad\n \\mu'=\\tfrac{77}{100},\n\\]\n\nand define, inside the full original domain U\\lfloor x^{\\mu'}\\rfloor\\}. \\tag{10}\n\\]\n\nThe new W_dagger is the set of original divisor pairs satisfying all four\nof\n\n\\[\n \\begin{gathered}\n de>\\lfloor x^{3/4}\\rfloor,\\qquad d^5e^2>\\lfloor x^{49/20}\\rfloor,\\\\\n d>\\lfloor x^{151/200}\\rfloor\\ \\text{or}\\ de^3>\\lfloor x^{321/200}\\rfloor,\\\\\n d>\\lfloor x^{141/200}\\rfloor\\ \\text{or}\\ de^3>\\lfloor x^{1631/1000}\\rfloor\n \\ \\text{or}\\ de\\le\\lfloor x^{77/100}\\rfloor,\n \\end{gathered} \\tag{11}\n\\]\n\nand E_dagger is the exact weighted compatible CRT endpoint sum of\n[residual-coverage (16)](residual-coverage.md) over (11), with every\nweight, compatibility test and endpoint convention unchanged. The fourth\ncondition is added alongside the third, not substituted for it:\nkappa'<71/100<151/200, so C' is not a superset of the existing cut C, and\nsubstituting would re-admit the boxes 71/100<=delta<151/200,\ndelta+3nu<321/200, for instance (delta,nu)=(73/100,29/100), which lies in\nC, outside A and B, and outside C', with no estimate controlling it. On\nthe validator's grid the substitution re-admits 1543 boxes of C minus\n(A union B) outside C'; under V3's definition, boxes controlled only by\nthe third region condition and not by the strip, the count is 928. The\nfirst draft of this note proposed that substitution; the handler and\nreader V3 caught it.\n\nWhy the lower product cut mu'. The (D1) cross budget on a box meeting C'\nwith delta+nu near 3/4 has min(sigma,alpha)=alpha=delta+nu-71/100, and at\n(31/100,11/25) it equals exactly 1; the old first condition de>floor(x^(3/4))\ndoes not by itself leave a fixed slack. With de>floor(x^(77/100)) every\nbox meeting C' has alpha>=sigma up to the dyadic slop, and on every grid\nbox meeting (10) the maximum of (4) is at most 1-77/38000 (grid maximum); on the continuous set the fixed slack is 1/500 (cross term, on de^3=x^(lambda')) and alpha-sigma>=1/100, so min(sigma,alpha)=sigma throughout C' (reader V3).\nThe boxes with 19/25<=delta+nu<77/100, delta<71/100, delta+3nu<327/200\noutside the previous region (50 grid boxes) are controlled by (D1) but\nare not removed by (10); they stay in W_dagger. This is a choice of\nconcrete constants, not a limit of the estimate.\n\n**Claim.** For every fixed H>0, with E_dagger now over (11) and E_* the\nsum of [residual-coverage (16)](residual-coverage.md),\n\n\\[\n E_*(x)-E_\\dagger(x)=O_H(x/\\log^Hx),\\qquad\n \\sum_{x/2floor(x^(mu')) is 1 minus such an indicator. The\n monomials d, de^3, de, d^5e^2 give twists d^(-s), (de^3)^(-t),\n (de)^(-w), (d^5e^2)^(-r) with nonnegative real parts, which sit on the\n original divisors d and e and multiply A_left(gm) and beta(e) by\n factors of modulus at most one; input 1 is uniform in them. The\n indicators are separated on each dyadic box meeting C' intersect S;\n boxes not meeting it contribute zero exactly, so the \"1\" term of the\n lower cut never runs over boxes without slack. An\n intersection of at most seven threshold conditions costs at most seven\n Perron integrals, O(log^7 x). The pointwise indicator errors are\n O(x^(kappa')/T_P), O(x^(lambda')/T_P), O(x^(mu')/T_P) and the older\n ones; the absolute mass of the unaggregated endpoint terms is\n O(x^2 log^C x) by residual-coverage section 4, so the total separation\n error is O(x^(2+49/20-10) log^C x), negligible.\n\n3. Density part. At fixed e, the admissible d for C' intersect S form\n one interval per S (reader V3) with lower endpoint at least\n max(U/2, x^(mu')/e) and upper endpoints among floor(x^(kappa')),\n floor(x^(lambda'))/e^3 and the older thresholds, clipped with U, D_0.\n The uniform excluded-prime Mobius lemma of\n [signed-divisor-grouping](signed-divisor-grouping.md) applies on each\n interval, as in residual-coverage section 4 and grouped-divisor-moment\n section 5, and the outer harmonic sums cost fixed logarithms. Each\n untwisted density is O_H(x/log^H x); no twisted Mobius estimate at\n large height is used.\n\nCombining inputs 1-3 gives R(C' intersect S)=O_H(x/log^H x) for each of\nthe eight S, hence for W_3 intersect C', hence (12). The scope statement\nof grouped-divisor-moment section 5 carries over unchanged: this is a\nsmaller summation domain for E_dagger, not a monotonicity statement about\nits signed value, and the sufficient margins of RESEARCH-HANDOFF section 3\nremain OPEN with the new E_dagger substituted. The uniform product\nthreshold stays at every fixed exponent below 19/25, because (8/25,11/25)\nremains uncontrolled at 401/400, and the corner is untouched. The target\nbox stays at 407/400.\n\n\n## 7. Validation and integration\n\nThe owning validator is\n[structured-dispersion-estimate-validation.js](structured-dispersion-estimate-validation.js).\nIt checks Lemma H, pair algebra, moment expansion, rational regional\nbudgets and the fourth-condition correction with negative controls.\nThe independent exponent regression is in\n[research-round-validation.js](research-round-validation.js). No research\ncensus or new data is needed. The 2026-09-09 review and source scope are\nin [research-round-validation.md section 10](research-round-validation.md).\nOUTCOMES and the handoff now use the four-condition domain and corrected\nsmall-gcd target; there is no outstanding documentation dispatch.\n\n## 8. One justified next move, or the reopening condition\n\nThe 2026-09-09 independent reading accepts (D1) and the fourth condition\nat their stated scope: Lemma H, completion (7), the separate divisor\ncoefficients in endpoint-fourier (4)–(9), Perron separation of the eight\nintersections and the untwisted density intervals were checked. The\nexact exponent control in research-round-validation.js checks the\ncorrected target below. A future attempt must name a mechanism that\nsaves this remaining exponent before another region scan.\n\nReopening condition for the target box: an estimate for the coprime\ne-pair class inside a common prime power q, with j_e<=x^(7/300+epsilon), saving\nmore than x^(7/200) over the majorant Q^(3/2)E^3 of (9) in the moment\nsum_q Lambda(q)M_q; equivalently more than 7/400 in the block exponent at\nthe top sector (rho,sigma)=(6/25,1/20). The left Mobius signs mu(d), the\nright signs mu(e) and the left Lambda(r) are still used only through\nabsolute values here; any of them is an unexploited input.\n\nHistory of this note: research/history/CHANGELOG.md.\n"},"research/transition-joint-budget.md":{"lf_sha256":"6174e20b929178c0e97922532f83cabf2a6698cc57a5b4642388e1c495935fc1","content":"# Joint budget for the four transition pieces\n\n\n\n**The sufficient twin margin remains OPEN, and nothing below estimates\nit.** The outside remainder E_out has no derived bound at all here beyond\nthe tautology inherited from S(x)>=0. The one analytic attempt made below\ndoes not improve the joint budget; it is a scoped negative for a named\nmechanism, and its own decisive input, the norm lower bound of\n[sharp-corner-transition.md](sharp-corner-transition.md) section 4, is\nretained at its stated scope by transition-round-audit.md. No novelty is claimed.\n\nBaseline: mathematical commit `0292082`, working checkout at\n`cb51292` (clean at launch). Definitions, cutoffs and equations (E1),\n(E2) are those of\n[TRANSITION-RESEARCH-EXECUTION.md](TRANSITION-RESEARCH-EXECUTION.md)\nsection 2. Owning derivations:\n[corner-correlation.md](corner-correlation.md),\n[corner-coefficient-energy.md](corner-coefficient-energy.md),\n[sharp-corner-transition.md](sharp-corner-transition.md). Consumer:\n[RESEARCH-HANDOFF.md](RESEARCH-HANDOFF.md) section 3 and\n[endpoint-target-audit.md](endpoint-target-audit.md).\n\n## 1. The decomposition, its supports, and what it does not touch\n\n### 1.1 The split is exact and pointwise\n\nWith rho_i and h_i=1-rho_i as in the contract, for every m,\n\n\\[\n 1_{d>D_i}-h_i(d)=\\rho_i(d)1_{D_i=z_i, and\nrho_i(d)=1-h_i(d) on the transition band. Hence, on the interval I_i\nwhere the upper divisor cut is redundant,\n\n\\[\n T_i(m)=C_i(m)-\\widetilde C_i(m)\n =\\sum_{\\substack{d\\mid m\\\\ D_iW_i with r | m/d, so\nm/d>=W_i+1 and d<=m/(W_i+1). On I_L=J_x this gives d<=floor(x/(V+1))\n=D_L^+, and on I_R=(x/2-2,x-2] it gives d<=floor((x-2)/(Z+1))=D_R^+.\nSo the upper cut may be written or omitted in C_i, \\widetilde C_i and\nT_i without changing any of the four sums. The finite check in section 6\nalso exhibits terms outside I_L for which the cut is **not** redundant,\nso the hypothesis is not treated as free.\n\nBoth h_i and rho_i 1_{(D_i,z_i)} vanish for d<=D_i, so every one of the\nfour pieces is supported on the same divisor rectangle\nD_Lx^{19/25-2eta} and e>x^{19/20-2eta}, so\n\n\\[\n de>x^{171/100-4\\eta},\\quad d^5e^2>x^{57/10-14\\eta},\\quad\n de^3>x^{361/100-8\\eta}.\n\\]\n\nAgainst floor(x^{3/4}), floor(x^{49/20}) and floor(x^{321/200}) these\nhold for all sufficiently large x when eta<6/25, eta<13/56 and\neta<401/1600 respectively. The third W_dagger condition is a\ndisjunction, and its **second** disjunct de^3>floor(x^{321/200}) is\nsatisfied with a margin of about x^2. [corner-correlation.md](corner-correlation.md)\nsection 0 verifies the inclusion through the first disjunct\nd>floor(x^{151/200}), which needs eta<1/400. That check is correct, but\nthe inclusion S_0 subset W_dagger is not what forces eta<1/400: at fixed\neta the binding constraints are elsewhere, namely etaS}\\,dS/S. Write, for\nD_i<=S<=z_i,\n\n\\[\n C_i^{(S)}(m)=\\sum_{\\substack{d\\mid m\\\\ d>S}}\\mu(d)\\beta_{W_i}(m/d),\n \\qquad\n G_i^{(S)}(m)=\\sum_{\\substack{d\\mid m\\\\ D_i_{S,T}, then apply Cauchy in\nn at each fixed (S,T). The signed quantity actually bounded at fixed\n(S,T) is the short-window sharp corner correlation\nsum_n G_L^{(S)}(n)G_R^{(T)}(n-2), with divisor windows (D_L,S] and\n(D_R,T], both shifted endpoints, all prime powers r inside beta with\nweight Lambda(r)=log p, the (d,e)|2 compatibility and both gcd branches\nretained. Two operations discard cancellation: the triangle inequality\non the (S,T) average discards sign variation in the cutoffs, and Cauchy\nin n discards the shift-2 sign structure.\n\n### 3.3 The cost: the route cannot beat the direct Cauchy bound\n\nWrite nu_L(S)=||G_L^{(S)}||_{I_0} and nu_R(T)=||G_R^{(T)}||_{I_2}. The\nmechanism outputs\n\n\\[\n \\mathcal M=\\langle\\nu_L(S)\\rangle_S\\cdot\\langle\\nu_R(T)\\rangle_T .\n\\]\n\nBoth averages are against probability measures, so Minkowski's integral\ninequality applied to (5) gives ||T_L||<=_S and\n||T_R||<=_T, hence\n\n\\[\n \\mathcal M\\ \\ge\\ \\|T_L\\|\\cdot\\|T_R\\| . \\tag{7}\n\\]\n\nInequality (7) is unconditional. It compares the exact norm output of\nthis average-triangle-Cauchy procedure with the exact product of transition\nnorms. It does not compare arbitrary upper constants, and does not apply\nto an argument that retains signed cancellation before these inequalities. The finite check in section\n6 confirms the direction and finds it strict on the proxies, so (7) is\nnot an equality being read as a loss.\n\nCombining (7) with the derived lower bound\n||T_i||^2>=(L_0w_i eta/64)x log^2 x, valid for sufficiently large x\nat each fixed 0=1**,\n\n\\[\n \\Sigma_{(D,S]}(N)=\\sum_{m\\le N}\\Big(\\sum_{d\\mid m,\\ D=(L_0 w_i eta/64)x log^2 x gives\n\n\\[\n \\liminf_{x\\to\\infty}\\frac1{L_i}\\int_{D_i}^{z_i}\n \\sqrt{\\theta_{\\rm eff}(S)}\\,\\frac{dS}{S}\n \\ \\ge\\sqrt{L_0w_i/128}>0. \\tag{9}\n\\]\n\nThis is along the fixed-eta dyadic sequence, for each side. The bounded\ncap makes it legitimate to exclude uniform o(1) outside a vanishing\nlogarithmic proportion: a bounded exceptional part then has vanishing\nintegral too. Without boundedness or uniform integrability that inference\nwould not follow. The exact constants in the two sides' L_i retain floors;\nL_i=eta log x+o(1) is used only in taking the limit.\n\nA bound valid only on a restricted N-range must be combined with a bound\nfor the omitted part. The crude upper budget there does not establish its\nactual size or make every restricted-range theorem unusable. Nor does (9)\npreclude localized improvements; it constrains this averaged norm procedure.\n\n### 3.5 What the reformulation does leave\n\nTwo consequences of (6) are worth keeping, since they replace three\nseparate norm bounds by one quantity and one obligation.\n\nFirst, because the averages in (6) are against probability measures,\n\n\\[\n |R_{10}+R_{01}+R_{11}|\\ \\le\\\n \\sup_{\\substack{D_L\\le S\\le z_L\\\\ D_R\\le T\\le z_R}}\n \\big|\\Phi(D_L,D_R)-\\Phi(S,T)\\big| . \\tag{10}\n\\]\n\nA modulus of continuity for Phi in its two cutoff parameters bounds the\nwhole non-smoothed part. Present knowledge supplies only the trivial\nsup<=2sup|Phi|, which returns the budget of section 2.1.\n\nSecond, R_cor=R_00+(R_cor-R_00), so with (10),\n\n\\[\n |R_{\\rm cor}|\\ \\le\\ |R_{00}|+\\sup|\\Phi(D_L,D_R)-\\Phi(S,T)| . \\tag{11}\n\\]\n\nIn the particular triangle bound (11), improving the continuity term\nalone leaves the available 2Ax log x bound for |R_00|. That separate\nbudget is insufficient. It does not follow that every grouping requires\nan individual R_00 estimate: the terms can cancel before taking absolute\nvalues. Its coefficient 1 in (2) proves no such necessity.\n\nIf one chooses to require |R_00|=o(x) by a fixed-power logarithmic saving\nfrom x log x, a saving exponent greater than one would suffice. That is\none sufficient target, not a necessary global proof obligation. A suitable\nconstant-sized one-sided O(x) bound may already fit an allocated budget;\na joint estimate may bypass the individual term altogether.\n\n## 4. Sufficient consumer, stated with every term\n\nThe template of the assignment is B_mix=R_00+R_10+R_01 and, on a common\nunbounded set of dyadic x,\n\n\\[\n R_{11}\\ge-F_{11},\\quad B_{\\rm mix}\\ge-F_{\\rm mix},\\quad\n E_{\\rm out}\\ge-F_{\\rm out},\\qquad\n F_{11}+F_{\\rm mix}+F_{\\rm out}\\le C_2x-2cx/\\log^Kx,\n\\]\n\nwith fixed c,K>0 and fixed H>K in the remaining error. What the present\nstate actually supplies:\n\n| term | sign | scale set | best available F | status | F/x |\n|---|---|---|---|---|---|\n| R_11 | unknown | every sufficiently large dyadic x, fixed eta=0, namely\nE_out>=-C_2x-R_cor-O_H(x/log^Hx), which is the tautology identified in\n[corner-correlation.md](corner-correlation.md) section 2.2 and carries no\ninformation. **Absence of an estimate for E_out is not evidence that the\ncorner method fails**, and nothing here converts it into one.\n\nA rescaled-average or cumulative consumer is equally admissible\n(endpoint-target-audit sections 2 and 3, consumer-comparison). The four\nbudgets above are uniform in x, so they average to the same orders; no\nsampling or exceptional-set argument improves them. Averaging is\ntherefore not a way around section 2.1 for these pieces, though it may\nbe for a future signed estimate.\n\n## 5. Reusable statements and limits\n\nRetain the exact split (1)–(2), the cutoff averages (5), the mixed finite\ndifference (6), the norm-output comparison (7), its small-fixed-eta\nsaturation (8), the corrected bounded-average constraint (9), and the\nconditional modulus bounds (10)–(11). None supplies a signed estimate.\nThe complete joint consumer in section 4, or an admissible averaged\nalternative, remains the criterion for a proof payoff.\n\n## 6. Verification and falsifiers\n\n[transition-joint-budget-validation.js](transition-joint-budget-validation.js)\nchecks, on two finite fixtures with proxy cutoffs and both shifted\nendpoints: the pointwise split C_i=T_i+\\widetilde C_i; the four-piece\nidentity (2); the reconstruction of R_11 from the determinant-2 kernel\n(E1) with the (d,e)|2 test and the gcd 2 branch present; the redundancy\nof the upper divisor cut on the interval, together with witnesses off\nthe interval where it fails; the moving-cutoff representation (5),\ncomputed by exact piecewise integration over integer breakpoints; the\ncutoff averages and the mixed second difference (6); and the direction\nof the Minkowski step (7). Eight controls are active and each changes\nthe answer: exchanging rho and h, using the complementary window\n(S,z] instead of (D,S], replacing Lambda(r) by log r, dropping the\nlower cut in the smoothed weight, evaluating the right factor at n\ninstead of n-2, dropping the compatibility test, using the upper cut\noff its interval, and reading (7) as an equality.\n\nThese are finite identity checks with proxy cutoffs. They certify no\nasymptotic norm order, no sign, no saving and no twin margin. The\nimported mean squares and the derived lower bound (16) are not tested by\nthem.\n\n## 7. Research use\n\nThe norm obstruction applies only after the stated inequalities lose the\nsigns. A signed estimate for the cutoff correlation or its joint average\nremains open. A lower smoothed norm or a local window refinement could be\nsupporting information, but neither is a required prerequisite for a joint\nproof. See [transition-round-audit.md](transition-round-audit.md) for the\nscope corrections and finite countermodels. No region, exact cut or\nsufficient twin margin has changed.\n"},"research/transition-signed-estimate.md":{"lf_sha256":"1ea003db19f8cee76f5fa6b134769feb54814f097f8565bfc629849ac5066eb9","content":"# Signed transition kernel: fiber form, cutoff-difference interface and the missing input\n\n\n\n**The twin-prime margin remains OPEN.** This note records the core\nhandler's bounded attempt on the central kernel (E1) of\n[TRANSITION-RESEARCH-EXECUTION.md](TRANSITION-RESEARCH-EXECUTION.md).\nIt produces no signed saving. What it produces is exact structure,\ntwo absolute budgets with explicit constants, the identified but still unpriced obligations of\nthe small-prime cutoff-difference route, and the missing input written\nwith its quantifiers. Launch commit\n`cb51292c7635c3b75540ab5f2ac5b8a9e40eaa2d`, clean working tree;\nmathematical baseline `029208295099b60d7a8b837d19eb361cfc12e6b1`.\n\nNotation follows the contract: x=2^j, J_x=(x/2,x], fixed\n0W\nhave one prime base p. If moreover p>W then p divides k exactly once\nand beta_W(k)=log p. Otherwise p<=W=2.\n\nTwo prime powers above W with distinct bases dividing k would have coprime product greater than W^2, contradicting k<=W^2. If p>W and\np^2|k then k>=p^2>W^2. Both checked finitely, with a control fixture\nwhere k>W^2 and two bases occur.\n\nSplit beta_W=beta^P+beta^Q, where beta^P(k)=log p when k=ps with p>W\nprime and p not dividing s, and beta^Q collects the proper-power case.\nCorrespondingly T_i=T_i^P+T_i^Q with\n\n\\[\n T_i^P(n)=\\sum_{p\\mid n,\\ p>W_i}\\log p\\ g_i(n/p),\\qquad\n g_i(m)=\\sum_{d\\mid m,\\ D_i0 and either\nactual interval I_i=(x/2-b_i,x-b_i],\n\n\\[\n \\sum_{n\\in I}|T_i^Q(n)|^2\\ll_\\epsilon x^{1-w_i/2+\\epsilon}.\n\\]\n\nThe coefficient T_i^Q is supported on n divisible by a proper prime\npower above W_i (checked finitely: every nonzero value found has such a\ndivisor). Its size is at most tau(n)log n. The support has at most\nx*sum_(p^a>W,a>=2)p^(-a)<2 whose true fiber is\nempty (90 such pairs in the finite fixtures). Equation (3)–(4) is\nchecked exactly against the direct sum over n.\n\nAt fixed eta the fiber parameters are, for large x,\n\n| Quantity | Range |\n|---|---|\n| v' | greater than Z/2 and at most R_R=x/D_R |\n| k' | greater than V/2 and at most R_L=x/D_L |\n| number of active fibers | at most (4eta^2/(w_Lw_R))x^(29/100+4eta)(1+o(1)) |\n| cardinality of T_kv | at most x/(kv)+1 << x^(71/100-2eta)+1; no uniform positive lower bound after clipping |\n\nThese are fixed-cofactor fibers, which can be long. They differ from\nfixed-divisor fibers (d,e), which are empty or singleton at these cuts.\nThe raw t-interval has length gx/(2kv); the band intersection can shorten\nit arbitrarily. In particular there is no uniform conversion from the\ncoefficient powers of x to powers of the clipped interval length.\n[The review](transition-round-audit.md) gives explicit controls for this\ndistinction. This exact regrouping adds no controlled region.\n\n## 3. Two absolute budgets with explicit constants\n\n**(a) Cauchy at n.** Depends on the uniform input (3) of\nsharp-corner-transition and on its A2/A3 review. From (5) there, with\nR_i=x/D_i and Mertens' sum_(r<=t)Lambda(r)/r=log t+O(1),\n\n\\[\n \\sum_{n\\le x}|C_i(n)|^2\\le Bx\\log x\\bigl(\\log(R_i/W_i)+O(1)\\bigr)\n =2B\\eta\\,x\\log^2x\\,\\bigl(1+O(1/(\\eta\\log x))\\bigr).\n\\]\n\nWith ||C_tilde_i||^2<<_eta x log x and the triangle inequality,\n\n\\[\n |R_{11}|\\le\\|T_L\\|_{I_0}\\|T_R\\|_{I_2}\n \\le 2B\\eta\\,x\\log^2x\\,(1+o_\\eta(1)). \\tag{5}\n\\]\n\nHere B>=1 is the de la Breteche–Dress–Tenenbaum constant, not\nnumerically extracted. This is the current absolute budget with its\nconstant made explicit; it is linear in eta.\n\n**(b) Triangle inequality inside fibers.** From (3)–(4), with\n|mu|,rho<=1,\n\n\\[\n |R_{11}^{PP}|\\le x A_LA_R+\\sum_{k,v}\\beta^P_V(k)\\beta^P_Z(v),\n \\qquad\n A_i=\\sum_{k\\le x/D_i}\\frac{\\beta^P_{W_i}(k)}{k}.\n\\]\n\nBy Lemma 1, A_i<=sum_(W_i=-F_11 and compatible mixed/outside estimates\nwhose total fits below C_2x on a common unbounded set. A joint estimate\ncould instead exploit cancellation between pieces. Section 5 separates\nthe local hypothesis from the global obligation.\n\n## 4. The cutoff-difference interface\n\n**Lemma 3 (exact).** Let p<=W_i be prime, p not dividing n, and\npn<=x. Then\n\n\\[\n T_i(pn)=\\sum_{d\\mid n}\\mu(d)\\{\\rho_{T,i}(d)-\\rho_{T,i}(pd)\\}\\beta_{W_i}(n/d),\n \\qquad \\rho_{T,i}=\\rho_i1_{(D_i,z_i)}. \\tag{7}\n\\]\n\nIf p=z_i/D_i,\n\n\\[\n T_i(pn)=T_i(n)-\\sum_{\\substack{d\\mid n\\\\ D_i/pW. Here z_i/D_i=x^eta(1+o(1)) on both sides, so (8) applies for\np=0\nand an unbounded set X_eta of dyadic x on which\n\n\\[\n \\sum_{\\substack{k,v\\\\(k,v)\\mid2}}\\beta^P_V(k)\\beta^P_Z(v)\n \\sum_{t\\in\\mathcal T_{kv}}\\mu(v't+c_0)\\mu(k't+c_1)\n \\tau_L(v't+c_0)\\tau_R(k't+c_1)\\ \\ge -Ax. \\tag{11}\n\\]\n\nAll cutoffs and the full clipping in T_kv are as in section 2. Equation\n(2) would then give R_11>=-Ax-o(x/log^H x) for every fixed H. This is a\nlocal sufficient input for a one-sided bound, not by itself a twin theorem.\n\nTo use the separate-budget global template, on the SAME unbounded set\none also needs B_mix=R_00+R_10+R_01>=-F_mix and E_out>=-F_out, with\n\n\\[\n Ax+F_{\\rm mix}(x)+F_{\\rm out}(x)\\le C_2x-2cx/\\log^Kx\n\\]\n\nfor fixed c,K>0, and H>K in the reduction error. Then the error can be\nabsorbed to yield the sufficient margin C_2x+E_dagger>=cx/log^Kx.\nNo such mixed or outside budgets are supplied here. A direct joint\nestimate, a weaker lower bound adequate to a different allocation, or an\nadmissible averaged consumer could replace this particular template.\n\nThe cofactor formulation has prescribed residues, variable leading\ncoefficients, exact interval clipping and beta weights. A source must\nmatch those features and its aggregate cost. It need not control every\nfiber separately. Fixed-form or freely shift-averaged results cannot\nsimply be substituted without pricing the missing uniformity or sampling.\n[transition-source-match.md](transition-source-match.md) records the\ninspected statement mismatches without excluding the broader methods.\n\n## 6. Verification\n\n[transition-signed-estimate-validation.js](transition-signed-estimate-validation.js)\nchecks Lemma 1 with a failing control fixture, the support of T^Q, and\nthe equality of the corrected (3)–(4), implemented with rhoT and explicit cuts, with the direct sum over n in J_x on two\nfixtures, the progression structure of every nonempty fiber including\nthe g=2 branch, the parity-rule control, and (7)–(9) on both p-ranges\nwith p|n and p>W controls. Proxy cutoffs satisfy x/D<=W^2 so that\nLemma 1 applies. These are finite identities; they certify no asymptotic\nrate, sign or correlation saving.\n\n## 7. Outcome, dependencies and next move\n\nOutcome: no signed improvement for R_11. Derived: (2), (3)–(4), (5)\nwith its constant, (6), Lemma 3 with (8)–(10). Failed steps: the\nentropy-decrement route stops at boundedness, at the short-interval\none-point input for T, and at the log-weighted consumer. The absolute\nbudget of R_11 is unchanged; no region, exact cut or twin margin\nchanges.\n\nDependencies: (5) and the o(1) terms in section 3(a) rest on\nsharp-corner-transition (3)–(6) and therefore on the reviewer's A2 and\nA3. Lemma 1, Lemma 2, (3)–(4) and Lemma 3 do not.\n\nThe subsequent [cofactor progression transfer](cofactor-progression-transfer.md)\nderives a signed dyadic scale-average estimate for the actual restricted\nprofiles with s,t<=(log x)^kappa, including nonsquarefree inputs. It does\nnot improve the full R_11 budget or establish Input M. Its full extension\nfails at the theorem's modulus range and accumulated cofactor cost.\nNext move: estimate the remaining cofactor sum with both mixed tails,\nor a joint cutoff expression, with a complete common-scale consumer. These are\nresearch candidates, not necessary forms of a proof. Repeating the same\nnorm-only inequality cannot improve its saturated order for small fixed eta;\na new signed mechanism or a concrete correctness concern can justify further work.\n"}},"archived_15":[{"row":23,"id":"Q-transition-signed-estimate","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/transition-signed-estimate.md","sha256":"1ea003db19f8cee76f5fa6b134769feb54814f097f8565bfc629849ac5066eb9","ledger":{"id":"Q-transition-signed-estimate","status":"PARTIAL","todo":"C","parity":"Exact divisor and CRT identities, the uniform DBDT mean-square input through sharp-corner-transition (5), Mertens and a divisor bound. Both Mobius factors, both gcd branches, all prime powers and small cofactors are retained. No cancellation at shift 2 is obtained; the one-sided input is written with its quantifiers and left OPEN.","question":"Can the signed transition kernel (E1) be estimated beyond its absolute norm budget, and if not, what exact input does the consumer need?","verdict":"No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN."}}],"registry_verdict":"No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN."},{"row":24,"id":"Q-recon-0830-smooth-aps","todo":"9","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/recon-0830-smooth-aps.md","sha256":"c46652549a48911dc650da39aac60a91c15095e3d52f94103df8581b2c7199c5","ledger":{"id":"Q-recon-0830-smooth-aps","status":"PARTIAL","question":"Does any theorem on y-friable integers in arithmetic progressions (Granville, Fouvry-Tenenbaum, Soundararajan, Harper, Drappeau, Drappeau-Granville-Shao) supply the uniform o(1) equidistribution that attack-0830-varE-identification.md section 4 leaves open, for moduli up to y^(4/5) with the lam1 weight and the squarefree restriction?","verdict":"NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength.","todo":"9"}}],"registry_verdict":"NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength."},{"row":25,"id":"Q-varE-identification-0830","todo":"9","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-varE-identification.md","sha256":"c950983f8593aab33cd960e0b7d1f0385723d1b20a9de29e0cac74c918e39b3c","ledger":{"id":"Q-varE-identification-0830","status":"PARTIAL","todo":"9","question":"Can either open step behind lim Var/E = 0.45546 (the identification delta*(X - X_dec) -> 0, or the theta = 2 mean-coefficient replacement) be proven, and if not, which single inequality does not close?","verdict":"Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength."}}],"registry_verdict":"Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength."},{"row":26,"id":"Q-varE-limit","todo":"9","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/lit-dickman-variance.md","sha256":"116d227b8666ba4bb5da4b08a3a60c70e767cbce40dc60ca69d6c63d7f1a1d7c","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"Prior art: not in print at theta = 2 (Gorodetsky is kappa = 1 only, confirmed at source; Aryan 2015 Lemma 1.2 is an upper bound with our main term, its exponent the nested P^{-2^{ks}+ks}); arXiv API, Scholar and Opera de Cribro Prop 6.26 owed."}},{"path":"research/history/staging/lit-smooth-divisors.md","sha256":"975711a742532dd043a57ba36e8bf9693fef80776eb40e20919d45d410cfcc1d","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"PARTIAL, and not ABSENT. The owning convention is H_F(x,y,z) (Tenenbaum's localisation des diviseurs de F(n)), Hooley's Delta-function, and Koukoulopoulos's localized factorizations, searched on three channels each calibrated in session; no theorem in print bounds the residual with the needed saving, because every located result is a SET count (integers with at least one divisor in an interval) at a divisor range strictly BELOW the sampling range (y <= x^{1-eps}, Tenenbaum I with reducible F; y <= x/2, Tenenbaum II with F irreducible only; y <= sqrt x, Ford), at order-of-magnitude or (log y)^{o(1)} precision, while the statement needs a weighted sum over EVERY divisor ABOVE the range with relative error O(1/ln y) — and Ford's own 2008 open problem (i) is that no asymptotic exists even for H(x,y,2y). Friability changes nothing: the friable literature bounds Delta (a maximum, never a cancellation) or restricts to positive-density prime sets. ONE artifact could still change the answer and was not obtained: Scourfield, Smooth divisors of polynomials, LMS Lect. Notes 352 (2008) 286-311, whose author summary claims an asymptotic with error term for friable divisors m <= x of f(n) with f squarefree monic reducible — abstract-only here, so no absence is written and the reduction may NOT be called new."}},{"path":"research/history/staging/varE-asymptotic.md","sha256":"d867cbc8f3a606cc4d60a8a159590c63e8e958fad75f6be74501d05f2492dc9e","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"No closed form reached; Var/E = delta X exactly with delta ln^2 W -> 1.109905 and the MS main term exactly L, so all of Var/E is discrepancy; the fitted intercept is unpinned in [0.46, 0.72], and the 0.611 reading is refuted as an inference on both halves of its protocol, the bias-corrected intercepts clustering in [0.4471, 0.4546] around the sibling's heuristic 0.455456."}},{"path":"research/history/staging/varE-exact-ladder-01.md","sha256":"3bf27af9858e86cbd205ee9c3bbf3504fb456ce701044d1dbb34132ffe002a73","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"Neither open step closes here: x = 29 and 31 add two exact levels on which the decoupling error stays bounded and keeps falling (X/X_dec 1.000725 and 1.000471, delta(X - X_dec) ln y 0.00309 and 0.00238) without separating 1/ln y from anything faster, and the group-1 half of the near-cancellation is settled at 0.13347 while the other half is still drifting through the third decimal; the model's n <= L band, which varE-spectral section 4 states as O(1/ln W) and does not evaluate, is now EXACT at nine levels and reads 0.063/ln y to three figures with its share of delta*X_dec falling 4.16 % to 0.94 %; the n | L band is exactly zero and carries 6.4 % of the conductor mass at x = 37; the model itself is exact at x = 37 (0.395667) and 0.402368 +- 3.4e-5 at x = 41; the limit 0.45546 stays HEURISTIC with both steps open."}},{"path":"research/history/staging/varE-limit-theorem.md","sha256":"29a5224af13c8097ca1cea669f8b71fdbd10e43213506054db11fd2ff1e7eb8b","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"Step 2 of the two is CLOSED: the decoupled model's limit is exactly Pr[GD(2) > u] with NO correction term (ln n/ln y -> GD(2) proven with rate O(lnln y/ln y); n | L inert exactly; both transition bands O(1/ln y) by an elementary block bound), so lambda_2(2) = 0.45545648 is unchanged and lim Var/E now rests on ONE open step, the theta = 2 decoupling replacement; the n < L band varE-spectral sec.4 left unevaluated is measured exactly at nine levels with B*ln y = 0.063616 .. 0.063008 over x = 13..37, and the model's own approach to its limit is 0.886/ln y."}},{"path":"research/history/staging/varE-spectral.md","sha256":"6e35cd6ebe08bdd3ed57429ea88c40363b47a95558e65799beaccc7b6a67c70b","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"HEURISTIC closed form lim Var/E = Pr[GD(2) > u] = 0.45546 at u = 2 (confirmed to 2.9e-11 by three routes), TWO open steps (the theta=2 mean-coefficient replacement and the model's own limit theorem, whose n <= L band is unevaluated); the theta = 1 branch is an exact identity with Gorodetsky's (1.5)/(1.6); the published 0.611 is refuted as an inference on both the in-sample and the frozen out-of-sample protocol; HELD pending the two steps."}},{"path":"research/history/staging/varE-theta2-proof.md","sha256":"8a4a3df5d6616b995824bedced5fd0f46b2fac90516b6044783ef6e77b939aea","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"OPEN with the obstruction named. Two of the three lag groups of the decoupling error are now closed unconditionally: |2*X2| <= 60 prod p(p-3)/(p-2)^2 = O(ln y), and delta*(X1 - X_dec) -> 0 at rate O((ln ln y)^{-1/4}) by monotone coupling plus Kolmogorov-Rogozin, which removes that half's dependence on varE-spectral's own limit theorem (both derived here, unreviewed, and the second is numerically vacuous at all six computed levels). The CRT-mixed lags stay OPEN: every lag's phase sum is exact and elementary (R_n(c) = [(r-c)^+ + (r+c-n)^+ - r^2/n]/L), so the frequency route closes by identity and no exponential-sum bound applies; the residual is a divisor-distribution statement about y-smooth divisors of C(C^2-4) exceeding 2L, and the flat/active split that the kernel offers is measured lossy with delta*|flat| rising 0.559 to 1.301 on six levels. lim Var/E = 0.45546 stays HEURISTIC on both steps."}},{"path":"research/history/staging/varE-theta2-step.md","sha256":"f4986f1223106894080d230b14002f5a88f54ebdb670989c2aad052e66053569","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open."}}],"registry_verdict":"The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open."},{"row":27,"id":"Q-X-upper-0829n","todo":"Z2","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0829n-X-upper.md","sha256":"7a9c609e31908822b22fab02f183e6066d1c11b48b3ef0dba9f399787d0a168e","ledger":{"id":"Q-X-upper-0829n","status":"PARTIAL","todo":"Z2","question":"Can the rough-pair census X(K) on the stretch window be bounded above, unconditionally and with an explicit error term, by a dimension-2 upper-bound sieve, and how loose is the bound against exact X(K)?","verdict":"Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated."}}],"registry_verdict":"Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated."},{"row":28,"id":"Q-roughpair-error","todo":"Z2","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-roughpair-error.md","sha256":"355b328db92152ba35546dccdfa0aee469df26e87fe39e74bc986350330db4bf","ledger":{"id":"Q-roughpair-error","status":"PARTIAL","todo":"Z2","question":"How big is the empirical error of the rough-pair census, and is Z2 dead on the numbers?","verdict":"Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit."}}],"registry_verdict":"Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit."},{"row":29,"id":"Q-head-remainder-0830","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-head-remainder.md","sha256":"79f877575974c4d6a0dbb6282f7476a96d103d319499ce951332ead41bc36c71","ledger":{"id":"Q-head-remainder-0830","status":"PARTIAL","todo":"Z4","question":"Does the 5.3 percent remainder that Hardy-Littlewood leaves in the head's endpoint deficit Delta = 2 - beta derive by a route that is not HL: the frozen-sieve first-survivor object, a level-of-distribution correction, or the exact tile-ensemble head?","verdict":"No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2."}}],"registry_verdict":"No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2."},{"row":30,"id":"Q-head-residual","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/head-residual-factor.md","sha256":"3a106c183747e1b7b19ada4b34455f0cae8361f3331afb205d24a903dbadfcc8","ledger":{"id":"Q-head-residual","status":"PARTIAL","todo":"Z4","question":"What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive?","verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."}},{"path":"research/history/staging/head-residual-hl3.md","sha256":"691b5ea985ae609fce750f301781cd24d996aec06d94561eda6d66f394c9b031","ledger":{"id":"Q-head-residual","status":"PARTIAL","todo":"Z4","question":"What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive?","verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."}},{"path":"research/history/staging/head-residual-null.md","sha256":"f369c54712f2795d9710293c363ae59332a28961ee88df44d72becf5fdce3e73","ledger":{"id":"Q-head-residual","status":"PARTIAL","todo":"Z4","question":"What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive?","verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."}}],"registry_verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."},{"row":31,"id":"Q-tail-derivation-0830","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-tail-derivation.md","sha256":"055e8e4b4cff2509077b595828e21f576a312395f5f1860743e78c41b4d6857a","ledger":{"id":"Q-tail-derivation-0830","status":"PARTIAL","todo":"Z4","question":"Does the tail's measured law c = 0.7522 ln^2(p'^2) and its surplus derive, and which part of the coefficient is the tile's own (no prime input) against which part needs Hardy-Littlewood?","verdict":"PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3."}}],"registry_verdict":"PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3."},{"row":32,"id":"Q-zone-tail","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/zone-tail-01.md","sha256":"995fa66bf4492efc853fa9fab8d888359890f0c867e805d5a35e79b7b0933cda","ledger":{"id":"Q-zone-tail","status":"PARTIAL","todo":"Z4","question":"What is the tail field of the zone (p, p'^2) - its law against ln^2, its worst case, its share of the R0 width, and is it the frozen-sieve last survivor below p'^2 at the rate the head is the frozen sqrt(p)-level first survivor above p?","verdict":"The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after."}}],"registry_verdict":"The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after."},{"row":33,"id":"Q-record-mechanism-0830","todo":"Z5","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-record-mechanism.md","sha256":"bc0ae810afdc8ab2eeefdabcf42dd0e5c1e05b5ffcd43a4ae36fd7633f49a432","ledger":{"id":"Q-record-mechanism-0830","status":"PARTIAL","todo":"Z5","question":"Which of three candidate mechanisms (sub-Poisson gap dispersion, the tile's exact gap law, Kourbatov's k = 1 conspiracy heuristic transported to k = 2) carries the residual 0.78 to 0.97 of Kourbatov's b, at what derived size, and what fraction of b is left?","verdict":"The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier."}}],"registry_verdict":"The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier."},{"row":34,"id":"Q-doubling-C2","todo":"D","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-doubling-01.md","sha256":"37e50b61756ba29c77420266f9907f30eebbb06f52053aa7d5c72f42d32ea495","ledger":{"id":"Q-doubling-C2","status":"PARTIAL","todo":"D","question":"Does the doubling inequality hold on the base-2 chain, and can a bridging certificate prove it?","verdict":"Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412)."}}],"registry_verdict":"Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412)."},{"row":35,"id":"Q-doubling-bridge-0829n","todo":"D","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0829n-doubling-bridge.md","sha256":"34d44bc0048b159aa0804f771e32effdc67722621814c155ac600c8b6f83af6f","ledger":{"id":"Q-doubling-bridge-0829n","status":"PARTIAL","todo":"D","question":"Can a bridging certificate carry Ghat(2s) <= 8 Ghat(s) from level s to level 2s uniformly in s, all s, on the base-2 chain?","verdict":"Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched."}}],"registry_verdict":"Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched."},{"row":36,"id":"Q-doubling-killrun-0830","todo":"D","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-doubling-killrun.md","sha256":"07e0863cb68747ae14118ae4db5c54eed51eb3cb9fb2a5ebacee6837dd57e2fe","ledger":{"id":"Q-doubling-killrun-0830","status":"PARTIAL","todo":"D","question":"Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*?","verdict":"No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN."}}],"registry_verdict":"No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN."},{"row":37,"id":"Q-derive-0904-L7-transfer","todo":"0","status":"PARTIAL","status_ok":true,"verdict_ok":false,"verdict":"STALE","notes":[{"path":"research/history/staging/derive-0904-L7-transfer.md","sha256":"c60a250dfa9e633058aeb0ae7f31f2b24eb79c2419ca90f8a2a0a41c23d16712","ledger":{"id":"Q-derive-0904-L7-transfer","status":"PARTIAL","todo":"0","question":"Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to?","verdict":"No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), hence not at every position, which is the form L7 needs; the sieve-on-holes transfer reduces to the Bruedern-Fouvry vector sieve once the hole indicator is replaced by a sieve minorant (the Ford-Halberstam substitution step of sift-limit-attack.md 7b(1b)), whose coupled unconditional price is K_BF = 5.158065 at free levels (2(1 + sqrt e) = 5.2974 only with the levels forced equal), both above beta2, and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap, so mechanism 2 is dead as a route to L7 (redteam-0904-item0.md); weighted sieves with Chen switching, GPY/Maynard-Tao and FKMPT are already closed for this object (sift-limit-attack.md 4.2-4.4); L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only."}}],"registry_verdict":"No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), and the sieve-on-holes transfer is the Bruedern-Fouvry vector sieve, whose coupled unconditional form lands at 2(1 + sqrt e) = 5.2974 above beta2 and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap; L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only."}],"archived_53":[{"row":1,"id":"Q-var41","todo":"9","status":"OPEN","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/var41-prereg.md","sha256":"f14244190e1ac88aef914d133c1b2a9288ef06c7ac09b72c1e2e269141b221a6","ledger":{"id":"Q-var41","status":"OPEN","todo":"2, 9","question":"What does the stable law predict for Var(41), and what can the tenth Var/E point pin?","verdict":"Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift."}}],"registry_verdict":"Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift."},{"row":2,"id":"Q-kstar-prereg","todo":"D","status":"OPEN","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-kstar-01-prereg.md","sha256":"99c6918bddf77ab273acc2fb9461ae436b6820c548b0addf546bef22391ed1f5","ledger":{"id":"Q-kstar-prereg","status":"OPEN","todo":"D","question":"What is K* at the three next doubling steps, predicted before any period walk?","verdict":"Pre-registration only, committed alone: the predictions, the scoring rule and the growth-type verdict thresholds are fixed in advance, with the inclusion-exclusion engine validated against an independent scan engine on all eleven known steps first."}}],"registry_verdict":"Pre-registration only, committed alone: the predictions, the scoring rule and the growth-type verdict thresholds are fixed in advance, with the inclusion-exclusion engine validated against an independent scan engine on all eleven known steps first."},{"row":3,"id":"Q-hsubpow-K-0829n","todo":"1d","status":"OPEN","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0829n-hsubpow-K.md","sha256":"c416c2d60e688a48095892cb0dc5525e697bb70b0ab6b3357e4f586ff8665913","ledger":{"id":"Q-hsubpow-K-0829n","status":"OPEN","todo":"1d","question":"Can (H-sub-pow) be proven with an explicit K inside the trusted legal zone [1.3946, 11.3568) by a mechanism the 2026-08-28 pass did not close?","verdict":"No K is proven at any base; the single open inequality is the uniform-in-k ratio cap G(b^(k+1))/G(b^k) <= e^K G(b), which is a proof gap at a fixed base and a possible truth gap across bases, since for any law G ~ c n^beta (ln n)^delta the all-bases hypothesis holds with finite K if and only if delta >= 0."}}],"registry_verdict":"No K is proven at any base; the single open inequality is the uniform-in-k ratio cap G(b^(k+1))/G(b^k) <= e^K G(b), which is a proof gap at a fixed base and a possible truth gap across bases, since for any law G ~ c n^beta (ln n)^delta the all-bases hypothesis holds with finite K if and only if delta >= 0."},{"row":4,"id":"Q-xchan-at29-prereg","todo":"X","status":"OPEN","status_ok":false,"verdict_ok":false,"verdict":"STALE","notes":[{"path":"research/history/staging/xchan-at29-prereg.md","sha256":"6566bc15ac7db40a47ccfd9df90c25f242676aee48352039c02e392a84038d76","ledger":{"id":"Q-xchan-at29-prereg","status":"ANSWERED","todo":"X","question":"Does the joint-deficit closed form survive a blind test at @29?","verdict":"Sealed and committed alone before any producer script existed, fixing the statistic, the predictions adopted verbatim from the record, two acceptance bands, the validation gate the instrument must clear before any @29 number is reported, and what each verdict does to TODO item X; scored in xchan-at29.md section 5, where the validation gate passes at five reference levels with 0 mismatches and the producer classifier returns the pre-registered HIT at @29 (z = -0.90, d = -0.41%) and SURVIVES WITH A MEASURED OFFSET at @31 (z = -4.93, d = -0.48%), the J-band clause firing at neither. The @31 TEST 1 band is the one figure that is error-model dependent: under the slot-clustered sigma later calibrated in item-x-offset.md section 4 the same residual reads z = -2.32 and TEST 1 returns HIT instead of MARGINAL."}}],"registry_verdict":"Pre-registration only, committed alone before any producer existed: the statistic, the predictions adopted verbatim from the record, two acceptance bands, the validation gate the instrument must clear before any @29 number is reported, and what each verdict does to TODO item X."},{"row":5,"id":"Q-shadow-prereg","todo":"5 (retired)","status":"ANSWERED","status_ok":false,"verdict_ok":false,"verdict":"STALE","notes":[{"path":"research/history/staging/shadow-prereg.md","sha256":"ae3a10ece08ff99607dff4ab9661d3f9042f46a7d8dd360eee931cef1fd9b3c8","ledger":{"id":"Q-shadow-prereg","status":"OPEN","todo":"5 (retired)","question":"Is the kill shadow's 0.85 the band-average of the Unification-Law survival curve over the post-crystallization window?","verdict":"Pre-registration only, written before any measurement: the candidate values are computed and frozen, the scoring rules are fixed in advance, no statistic may be promoted to a verdict after the fact, and the verdict rests on y >= 997."}}],"registry_verdict":"Scored in shadow-buchstab.md: SHAPE-ONLY under the original y >= 997 rule; D3 passes in the reported ten clusters but D1 fails near y = 1000 at 1.49 times the 0.011 tolerance. Later finite-y normalisation and counting-floor corrections do not promote this verdict. The pair-Buchstab identification remains conjectural; the pre-registration body is preserved."},{"row":6,"id":"Q-centered-discrepancy-estimate","todo":"C","status":"PARTIAL","status_ok":false,"verdict_ok":false,"verdict":"STALE","notes":[{"path":"research/centered-discrepancy-estimate.md","sha256":"dd6e1a4c892f4b085400ba36ea81e41d62449563145e9add8ef8c65227c16a90","ledger":{"id":"Q-centered-discrepancy-estimate","status":"ANSWERED","todo":"C","parity":"Exact divisor algebra retains Lambda(n-2)mu(n), centering, odd moduli and moving endpoints. The top-range repair uses ordinary prime Bombieri-Vinogradov (Tao Notes 3 Theorem 17, prefix form by rounding) at moduli m[b^2,g]<=2x^(1/2-eps)(log x)^(3L) with the Mobius sign averaged by the q=1 Siegel-Walfisz mean of mu (Tao Notes 2 Exercise 66); no estimate for the twisted sequence itself is used or supplied. The derivation was read independently by the handler (lane V) and by reader V2 on 2026-09-08 and accepted at its stated scope; no estimate for D^(e_1) follows.","question":"Can the top of D_y be removed using ordinary prime distribution after an exact divisor flip, and what estimate remains?","verdict":"Yes, at the stated scope. Equations (3)-(4), the exact split and flip, survive review and finite controls. The top-range bound T^top=O_(A,eps)(x/log^A x) is DERIVED in section 3a (2026-09-08) with the endpoint atom retained, odd square divisors, the corrected reciprocal-totient local factors with (m',g)=1, explicit truncation powers, a Cauchy multiplicity device, and a uniform Mobius mean proved from the q=1 Siegel-Walfisz statements; its inputs are the terminal-point BV of Tao Notes 3 Theorem 17 with the prefix form derived by rounding. It was read twice independently on 2026-09-08, by the handler (lane V), who reconstructed (BV*), (3a.9), (3a.14) and (3a.16), and by reader V2 (history/reviews-0908/01), who reconstructed every step, and is accepted at its stated scope with ineffective constants; the 2026-09-09 integration review (research-round-validation.md section 7) repaired M<=2x^(1/2-eps) and the log^(L+3) count, both absorbed by fixed power slack. The retained finite check of the limiting constant -H_(b,g)(0) of (3a.9) is at four (b,g) pairs at u=1e6. What remains is D_y=D^(e_1)+O_(A,eps)(x/log^A x): the handoff consumer is equivalent to D^(e_1)>=-4x/25+o(x), the fixed-endpoint signed discrepancy carried by Q-fixed-endpoint-discrepancy. That estimate, D_y>=-4x/25+o(x) and twin-prime infinitude remain OPEN."}}],"registry_verdict":"Equations (3)-(4), the exact split and flip, survive review and finite controls. A repair of the top-range bound T^top=O_(A,eps)(x/log^A x) is DERIVED in section 3a (2026-09-08) with the endpoint atom retained, odd square divisors, the corrected reciprocal-totient local factors with (m',g)=1, explicit truncation powers, a Cauchy multiplicity device, and a uniform Mobius mean proved from the q=1 Siegel-Walfisz statements; its inputs are the terminal-point BV of Tao Notes 3 Theorem 17 with the prefix form derived by rounding. The handler (lane V) read the derivation on 2026-09-08, reconstructed (BV*), (3a.9), (3a.14) and (3a.16), checked the limiting constant of (3a.9) numerically at eight (b,g) pairs and found no defect; it is accepted at its stated scope, with ineffective constants. The payoff is D_y=D^(e_1)+O_(A,eps)(x/log^A x) only, so the handoff consumer is equivalent to D^(e_1)>=-4x/25+o(x). The fixed-endpoint signed discrepancy, D_y>=-4x/25+o(x) and twin-prime infinitude remain OPEN."},{"row":7,"id":"Q-chen-signed-target","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/chen-signed-target.md","sha256":"3afe6eca045454610e041306f9827416beb1c5ba78c3e174b9229223d4be25fb","ledger":{"id":"Q-chen-signed-target","status":"PARTIAL","todo":"C","parity":"The extra input is a one-sided Liouville estimate for the explicitly defined Chen-weighted shifted-prime sum R on infinitely many dyadic long intervals. It is OPEN; classical BV and unsigned switching do not supply it.","question":"What exact additional arithmetic estimate would turn the completed Chen benchmark into a proof of infinitely many twin primes?","verdict":"An elementary prime minorant gives a conditional twin theorem with all weights, ranges, quantifiers and errors specified. The opportunity audit identifies an avoidable negative-weight penalty and a separate-estimate budget that fails even under component cancellation; this sufficient target remains OPEN and is not the sole next proof obligation."}}],"registry_verdict":"An elementary prime minorant gives a conditional twin theorem with all weights, ranges, quantifiers and errors specified. The opportunity audit identifies an avoidable negative-weight penalty and a separate-estimate budget that fails even under component cancellation; this sufficient target remains OPEN and is not the sole next proof obligation."},{"row":8,"id":"Q-cofactor-progression-transfer","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/cofactor-progression-transfer.md","sha256":"d40d4b29f3ab8f321d239cf99c3216d9d86726e7fe3a60560f5582f07097083b","ledger":{"id":"Q-cofactor-progression-transfer","status":"PARTIAL","todo":"C","parity":"The signed estimate imports Tao-Teravainen v2 Theorem 3.1(ii) and the quantitative Liouville non-pretentiousness input in MRT (1.12). Modified Euler factors and exact CRT progressions retain both Mobius signs, divisibility and non-squarefree inputs. Absolute values are taken after the imported signed correlation estimate, not substituted for it. No complete-corner estimate or sufficient twin margin is obtained.","question":"Can the corrected full-cofactor kernel be estimated on a growing cofactor range by representing its actual arithmetic on CRT progressions, and does the resulting bound reach the twin consumer?","verdict":"Derived from named imports: for some positive absolute kappa and d, all prime-r cofactor pairs s,t <= floor((log x)^kappa), including non-squarefree inputs and mixed transition/smoothed profiles, admit a dyadic scale-average O(log^(2-d) X) bound after division by x. The extension uses bounded multiplicative Euler modifications on the progression s|n, t|n-2 and keeps its density 1/lcm(s,t), so summing cofactors costs only O((log log X)^2). This goes beyond s=t=1 but remains short of o(x). The large-cofactor joint remainder, outside residual and twin margin remain OPEN; the attempted extension to power-sized cofactors fails on source modulus range and accumulated logarithmic cost."}}],"registry_verdict":"Derived from named imports: for some positive absolute kappa and d, all prime-r cofactor pairs s,t <= floor((log x)^kappa), including non-squarefree inputs and mixed transition/smoothed profiles, admit a dyadic scale-average O(log^(2-d) X) bound after division by x. The extension uses bounded multiplicative Euler modifications on the progression s|n, t|n-2 and keeps its density 1/lcm(s,t), so summing cofactors costs only O((log log X)^2). This goes beyond s=t=1 but remains short of o(x). The large-cofactor joint remainder, outside residual and twin margin remain OPEN; the attempted extension to power-sized cofactors fails on source modulus range and accumulated logarithmic cost."},{"row":9,"id":"Q-corner-correlation","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/corner-correlation.md","sha256":"e1f5941060c8e1fcbf62afd90883d35f22ccca504f9d0bed4e5835242b19c4c2","ledger":{"id":"Q-corner-correlation","status":"PARTIAL","todo":"C","parity":"Inputs used here are exact divisibility and CRT algebra, the classical Mobius mean estimate and quantitative PNT (Tao, Notes 2, Exercise 66 and Corollary 39) and Mertens. No step uses more than residue and density information plus those classical means; in particular no non-residue input, no bilinear estimate and no sieve upper bound beyond counting is used. The note's conclusion is that closing the corner appears to require an input beyond that list, and that is recorded as an ASSESSMENT, not as an obstruction theorem: no method class, retained statistics, error tolerance or quantifiers are supplied for an impossibility claim, and none is asserted.","question":"On the corner S_0 where both cofactors sit just above their own cutoffs, what exactly is the remaining endpoint sum, what does the sufficient consumer need there, and does any reviewed correlation theorem supply it?","verdict":"The full corner is exactly sum_n C(n)C'(n-2). Proper-prime-power terms above the cutoffs are negligible at fixed eta by §1.1; the remaining prime-r terms with s>1 or s'>1 and non-squarefree inputs remain OPEN. The s=s'=1 piece has a nonnegative Mobius-product weight with exact moving cuts. The multiplicative lift and round-review sampling give small continuous and dyadic scale-average log savings for that subfamily, with no o(x), full-corner control or twin margin. The complement is still open."}}],"registry_verdict":"The full corner is exactly sum_n C(n)C'(n-2). Proper-prime-power terms above the cutoffs are negligible at fixed eta by §1.1; the remaining prime-r terms with s>1 or s'>1 and non-squarefree inputs remain OPEN. The s=s'=1 piece has a nonnegative Mobius-product weight with exact moving cuts. The multiplicative lift and round-review sampling give small continuous and dyadic scale-average log savings for that subfamily, with no o(x), full-corner control or twin margin. The complement is still open."},{"row":10,"id":"Q-corner-log-average","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/corner-log-average.md","sha256":"eb5d20c8f57fe688d365c0db91dc9a3dc156a4e3fd2c2763fe643a1e3114aad3","ledger":{"id":"Q-corner-log-average","status":"PARTIAL","todo":"C","parity":"Exact divisibility, CRT counting and partial summation audit named correlation-theorem interfaces. Imported analytic theorems are not reproved. Failure of a direct application or an absolute error budget is not a universal impossibility claim. The full corner and its sufficient margin remain OPEN.","question":"What do logarithmically averaged correlation theorems and their quantitative successors actually supply for the prime-cofactor corner weight, with exact support, rates and scale quantifiers?","verdict":"The pure band is invariant under dilation by primes outside it; the exact cofactor window is not, but its support extends to x^(1-2eta) and need not leave the window under a fixed dilation. Uniform-prefix logarithmic bounds imply block bounds by Abel summation; a relative exponent above 3 is one sufficient route to o(x), not a universal necessary threshold. Pilatte's 1/(96e) calculation applies only to his displayed parameter choice. A bounded multiplicative Fourier lift now gives a small continuous scale-average log saving for the prime-cofactor subfamily via Tao-Teravainen v2; see prime-band-transfer.md. No o(x), dyadic pointwise estimate, full-corner estimate or positive twin margin follows."}}],"registry_verdict":"The pure band is invariant under dilation by primes outside it; the exact cofactor window is not, but its support extends to x^(1-2eta) and need not leave the window under a fixed dilation. Uniform-prefix logarithmic bounds imply block bounds by Abel summation; a relative exponent above 3 is one sufficient route to o(x), not a universal necessary threshold. Pilatte's 1/(96e) calculation applies only to his displayed parameter choice. A bounded multiplicative Fourier lift now gives a small continuous scale-average log saving for the prime-cofactor subfamily via Tao-Teravainen v2; see prime-band-transfer.md. No o(x), dyadic pointwise estimate, full-corner estimate or positive twin margin follows."},{"row":11,"id":"Q-fixed-endpoint-discrepancy","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":false,"verdict":"STALE","notes":[{"path":"research/fixed-endpoint-discrepancy.md","sha256":"21dce4f3b3bc36d3fd662a616cc2b6a149ddf67ff79bc71a85f4f7b3c82e46c0","ledger":{"id":"Q-fixed-endpoint-discrepancy","status":"PARTIAL","todo":"C","parity":"Exact divisor algebra and Vaughan decomposition; ordinary prime BV in the derived prefix form for body moduli e[r,g]<=x^(1/2-eps'/3)(log x)^L; the uniform Mobius mean (3a.9) at (k,e); the q=1 PNT. These pay only the low Type I term. The Type II term and band retain their actual signed coefficients; no twisted-prime BV input is imported.","question":"After the accepted truncation to odd moduli e=-4x/25+o(x)?","verdict":"Reviewed 2026-09-09 after the coprimality repair: T_I^low=O_(A,eps')(x/log^A x), hence S=C_2x+B+O_A(x/log^A x), with B the exact Type II plus band sum (2.9). The untruncated modulus bound was false; g<=(log x)^(A+13), both tails, the coprime density and the weighted BV multiplicity now pay the estimate. Review corrects harmless log powers and the power-of-two atom over the full eps' range. D^(e_1)>=-4x/25+o(x) is equivalent to B+2C_2M>=-4x/25+o(x); it implies, but is not equivalent to, B>=-(C_2-1/200)x+o(x). The latter and H_B are sufficient OPEN margins. The absolute band statement (4.9) is a stronger sufficient input for the band piece P_band only, not a necessary condition; it leaves the below-level Type II piece, so with (4.9) the margin still needs the signed statement 2C_2M+T_II^low>=-4x/25+o(x). No inspected source estimates the remaining actual signed B. Twin-prime infinitude remains OPEN."}}],"registry_verdict":"Reviewed 2026-09-09 after the coprimality repair: T_I^low=O_(A,eps')(x/log^A x), hence S=C_2x+B+O_A(x/log^A x), with B the exact Type II plus band sum (2.9). The untruncated modulus bound was false; g<=(log x)^(A+13), both tails, the coprime density and the weighted BV multiplicity now pay the estimate. Review corrects harmless log powers and the power-of-two atom over the full eps' range. D^(e_1)>=-4x/25+o(x) is equivalent to B+2C_2M>=-4x/25+o(x); it implies, but is not equivalent to, B>=-(C_2-1/200)x+o(x). The latter and H_B are sufficient OPEN margins. The absolute band statement (4.9) is one stronger sufficient input, not a necessary condition. No inspected source estimates the remaining actual signed B. Twin-prime infinitude remains OPEN."},{"row":12,"id":"Q-fold-arithmetic-bridge","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/fold-arithmetic-bridge.md","sha256":"d248928b9cddf5802e64a38f03c77e015a2e6cce7c1eb977820d4213d4514149","ledger":{"id":"Q-fold-arithmetic-bridge","status":"PARTIAL","todo":"C","parity":"Exact parity-table algebra and the semiprime classification above the dyadic cube-root cutoff. Sieve pricing now imports the Pan--Ding mean value theorem (Wu, Lemma 2.3, read at the arXiv page) for products of k primes with all factors above X^(1/u), ordinary prime Bombieri--Vinogradov, and the Rosser--Iwaniec linear sieve (Wu, Lemma 2.2). No Type II or bilinear estimate for the parity of a shifted prime is used; the decorrelation hypotheses (Cov_u) and (Dec_1) are stated, not proved.","question":"Does one parity-table bridge from the anchored fold ledger yield a sufficient twin lower bound with named arithmetic inputs?","verdict":"Exact identities retained. The one unread sieve input of the pricing, Bombieri--Vinogradov for k-fold X^(1/u)-rough products, is derived from Wu's Lemma 2.3 (section 3a); the same input, sieved in the composite variable, gives the contamination aggregate constant 4 for each fixed k,u, replacing the displayed 12.86 to 19.72. With these inputs, elementary bounds give Q_cov(u)<1 and c*_real(u)<4 for every u>4 (section 4a, independently reviewed 2026-09-09 with rational certificates), so neither sufficient ratio test succeeds at any depth. This closes the two tests, not the decorrelation hypotheses, and supplies no twin estimate."}}],"registry_verdict":"Exact identities retained. The one unread sieve input of the pricing, Bombieri--Vinogradov for k-fold X^(1/u)-rough products, is derived from Wu's Lemma 2.3 (section 3a); the same input, sieved in the composite variable, gives the contamination aggregate constant 4 for each fixed k,u, replacing the displayed 12.86 to 19.72. With these inputs, elementary bounds give Q_cov(u)<1 and c*_real(u)<4 for every u>4 (section 4a, independently reviewed 2026-09-09 with rational certificates), so neither sufficient ratio test succeeds at any depth. This closes the two tests, not the decorrelation hypotheses, and supplies no twin estimate."},{"row":13,"id":"Q-full-coefficient-average","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/full-coefficient-average.md","sha256":"0417d46a8433643db450e27379d57e7606a4506b885638e15ce531ab59e072a9","ledger":{"id":"Q-full-coefficient-average","status":"PARTIAL","todo":"C","parity":"Exact complete-coefficient divisor algebra and Fourier separation, with the log t lift and the composite filter written out. The full family has the envelope 2^omega; low modes are 1-bounded but the full family is not; the composite filter is not multiplicative; an unweighted cancellation theorem does not control a nonconstant arithmetic weight. The 2026-09-08 continuation proves, with PNT as the only arithmetic input, that every representation of the smooth-part coefficient by 1-bounded functions has norm at least (log x)^(2/5), and identifies the both-rough composite pair sum inside every Fourier component. No new correlation estimate, sieve asymptotic or universal representation obstruction beyond that scope is asserted.","question":"Can aggregating the complete coefficients before a correlation theorem remove the explicit cofactor count, and what additional estimate is needed?","verdict":"Exact factor and rounded-endpoint Fourier identities retained, with c_(i,0)=3/5 and an explicit composite-filtered weighted sum. The full family is not 1-bounded, but the sufficient phase condition admits at least k=0,+/-1 on the left and l=0,+/-1,...,+/-6 on the right for every Mellin twist; the earlier zero-only claim is corrected. Composite filtering and the required correlation rate remain unmatched. Proposition 6.5, independently reviewed including on 2026-09-09, proves coefficient norm at least (log x)^(2/5) for representations by 1-bounded functions on all smooth inputs. This does not exclude density-one representations, paid growing components or a jointly treated Fourier sum. No sufficient signed twin margin follows."}}],"registry_verdict":"Exact factor and rounded-endpoint Fourier identities retained, with c_(i,0)=3/5 and an explicit composite-filtered weighted sum. The full family is not 1-bounded, but the sufficient phase condition admits at least k=0,+/-1 on the left and l=0,+/-1,...,+/-6 on the right for every Mellin twist; the earlier zero-only claim is corrected. Composite filtering and the required correlation rate remain unmatched. Proposition 6.5, independently reviewed including on 2026-09-09, proves coefficient norm at least (log x)^(2/5) for representations by 1-bounded functions on all smooth inputs. This does not exclude density-one representations, paid growing components or a jointly treated Fourier sum. No sufficient signed twin margin follows."},{"row":14,"id":"Q-global-cutoff-averaging","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/global-cutoff-averaging.md","sha256":"f8206d9ab5ccab27134736947a4b49fb097a4af8a26b36b7b178b481baabf08f","ledger":{"id":"Q-global-cutoff-averaging","status":"PARTIAL","todo":"C","parity":"Exact averaged Vaughan identities, the existing prime BV and derived Mobius BV inputs with fixed uniform margins, the existing comparison-sequence calculation, Graham's imported one-point mean square and the sharp-corner norm bounds. The new cancellation statement is at the same input, not at shift 2. No signed twin margin or universal method obstruction is proved.","question":"Does the wider corpus suggest changing the global decomposition before extending the small-cofactor estimate, and can that change be made without an unpaid transition or outside term?","verdict":"Derived: independently averaging the two initial Mobius cutoffs over fixed exponent intervals gives S=C2*x+sum G_L(n)G_R(n-2)+O_A(x/log^A x), uniformly on dyadic scales, with all cofactor and prime-power branches included. Each full G has squared norm O(x log x). The existing sharp-corner lower norm then forces cancellation between the corner coefficient and the rest at the same input. This does not estimate their shifted product. The global signed residual was already O(x) by the sieve upper bound and positivity; the new norm representation is not an improved signed bound. Prefer a bounded attempt on this global coefficient pair and a one-sided consumer; the twin margin remains OPEN."}}],"registry_verdict":"Derived: independently averaging the two initial Mobius cutoffs over fixed exponent intervals gives S=C2*x+sum G_L(n)G_R(n-2)+O_A(x/log^A x), uniformly on dyadic scales, with all cofactor and prime-power branches included. Each full G has squared norm O(x log x). The existing sharp-corner lower norm then forces cancellation between the corner coefficient and the rest at the same input. This does not estimate their shifted product. The global signed residual was already O(x) by the sieve upper bound and positivity; the new norm representation is not an improved signed bound. Prefer a bounded attempt on this global coefficient pair and a one-sided consumer; the twin margin remains OPEN."},{"row":15,"id":"Q-global-factor-signs","todo":"C","status":"PARTIAL","status_ok":false,"verdict_ok":false,"verdict":"STALE","notes":[{"path":"research/global-factor-signs.md","sha256":"0a4f04bf5337a649add37617cc3189ebeb0327bb4dcd5bc7e0050f7c7c6b678d","ledger":{"id":"Q-global-factor-signs","status":"ANSWERED","todo":"C","parity":"Exact divisor algebra for the full logarithmic profiles, an elementary count of exceptional prime-power divisors, and the standard divisor bound; PNT is used only for existence of the single-input factor cell. The signed shifted estimate is not supplied. Refutation concerns a specified pair-trigger majorant, not sieve methods generally.","question":"Which full factor configurations cause negative global products, can prime-power exceptions be paid, and does a pair-trigger upper bound control the negative part?","verdict":"All three parts are answered at their stated scope. Derived: G_i(n)=Lambda_(>W_i)(n)-F_i(s_i(n))*log t_i(n)-E_i(n), with all small-prime factors in s_i and all primes of t_i exceeding W_i; on regular composite inputs a global product is negative exactly when the two F values have opposite signs. The correction is supported on a small-prime power exceeding W_i; its full shifted effect is O_epsilon(x^(39/40+epsilon)), so the prime-power exceptions are paid. After also paying proper prime powers, the residual is a composite-filtered signed smooth/rough cofactor sum. A ten-small-prime cell has F=-84 although every pair lies below a, refuting the proposed pair-trigger majorant. Prime filters contribute explicit terms when bounding the negative part; dropping them is an upper bound, not an identity. What remains is carried elsewhere: switching-negative-mass.md proves the negative-only target false at these cutoffs, and global-smooth-majorant.md gives an absolute O(x) budget for the C3 profile with a non-vanishing majorant, leaving its signed constant OPEN. No scale-x signed improvement or twin margin follows."}}],"registry_verdict":"Derived: G_i(n)=Lambda_(>W_i)(n)-F_i(s_i(n))*log t_i(n)-E_i(n), with all small-prime factors in s_i and all primes of t_i exceeding W_i. The correction is supported on a small-prime power exceeding W_i; its full shifted effect is O_epsilon(x^(39/40+epsilon)). After also paying proper prime powers, the residual is a composite-filtered signed smooth/rough cofactor sum. A ten-small-prime cell has F=-84 although every pair lies below a, refuting the proposed pair-trigger majorant. Prime filters contribute explicit terms when bounding the negative part; dropping them is an upper bound, not an identity. No scale-x signed improvement or twin margin follows."},{"row":16,"id":"Q-global-smooth-majorant","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/global-smooth-majorant.md","sha256":"a29d64a062cdca5fa5548bc59c037ffb364da27c9f0c2c23f224a5b705ee9bc9","ledger":{"id":"Q-global-smooth-majorant","status":"PARTIAL","todo":"C","parity":"A pointwise three-smallest-prime finite-difference majorant, classical Mertens estimates, and Henriot's corrected upper Theorem 5 for nonmultiplicative functions satisfying its uniform growth condition. The existing uniform Vaughan reduction and exceptional-prime-power budget are retained. This controls absolute mass, not its sign or a sufficient constant.","question":"Can a higher-order majorant control the complete global coefficient pair at scale x while retaining every factor configuration and the prime filters?","verdict":"Derived using the corrected Henriot upper theorem: a C3 probability average of the same admissible initial cutoffs gives a full residual with sum |Ghat_L(n) Ghat_R(n-2)|=O(x). The three-smallest-prime majorant has bounded harmonic mass and meets the source growth class uniformly, despite not being multiplicative. All prime-power exceptions are paid. This replaces the O(x log x) absolute budget for the earlier logarithmic profile by O(x) for a different admissible profile representing the same signed residual to arbitrary logarithmic precision. The implied constant is not compared with C2 and no improved signed lower bound or twin margin is supplied."}}],"registry_verdict":"Derived using the corrected Henriot upper theorem: a C3 probability average of the same admissible initial cutoffs gives a full residual with sum |Ghat_L(n) Ghat_R(n-2)|=O(x). The three-smallest-prime majorant has bounded harmonic mass and meets the source growth class uniformly, despite not being multiplicative. All prime-power exceptions are paid. This replaces the O(x log x) absolute budget for the earlier logarithmic profile by O(x) for a different admissible profile representing the same signed residual to arbitrary logarithmic precision. The implied constant is not compared with C2 and no improved signed lower bound or twin margin is supplied."},{"row":17,"id":"Q-left-divisor-signs","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/left-divisor-signs.md","sha256":"6ecf59407efe64bf22422c17acede20c77f3193b0d8ee983311369ff9d1e0805","ledger":{"id":"Q-left-divisor-signs","status":"PARTIAL","todo":"C","parity":"Uses the exact convolution structure of the left coefficient (13), classical completion with Ramanujan and composite-modulus Weil bounds, averaged gcd losses, partial summation against the endpoint factor, and Cauchy in the original divisor rather than in the expanded one. Both gcd branches, both endpoint conventions, all four coefficient sectors, prime powers, arbitrary harmonic subsets and independent divisor twists are retained. No cancellation of the right coefficient's Möbius signs is used and no parity obstruction is asserted; the failures recorded are failed upper bounds, not refutations of the arithmetic target.","question":"Can the Möbius structure of the left coefficient A_left(gm) replace the first Cauchy inequality, so that its sqrt(M) loss is not paid, and what does that buy at the target box (delta,nu)=(8/25,9/20) and at the corner a=b=1?","verdict":"Partly, and not where it is needed. Two lemmas are derived: a Type I bound with no zero-frequency budget, usable at the target box whenever the arbitrary block is shorter than x^(1/4), and a Type II bound that is uniform in the Perron twist heights. Applied to the actual coefficient they confine the target-box deficit to sectors with left prime power r>=x^(43/200) and right prime power q>x^(3/100), and lower the worst block exponent there from 103/100 to 41/40. The corner a=b=1 is untouched: grouped, Type I, Type II, Bettin-Chandee/Wright and even a hypothetical per-block square-root bound all exceed 1 there. No region is added, E_dagger and the consumer (20) are unchanged, and the global twin margin remains OPEN."}}],"registry_verdict":"Partly, and not where it is needed. Two lemmas are derived: a Type I bound with no zero-frequency budget, usable at the target box whenever the arbitrary block is shorter than x^(1/4), and a Type II bound that is uniform in the Perron twist heights. Applied to the actual coefficient they confine the target-box deficit to sectors with left prime power r>=x^(43/200) and right prime power q>x^(3/100), and lower the worst block exponent there from 103/100 to 41/40. The corner a=b=1 is untouched: grouped, Type I, Type II, Bettin-Chandee/Wright and even a hypothetical per-block square-root bound all exceed 1 there. No region is added, E_dagger and the consumer (20) are unchanged, and the global twin margin remains OPEN."},{"row":18,"id":"Q-prime-band-transfer","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/prime-band-transfer.md","sha256":"6e89bb839f4048d075f7030fd4d82139968a22d76172c859b8785a3c90511b6b","ledger":{"id":"Q-prime-band-transfer","status":"PARTIAL","todo":"C","parity":"Elementary Fourier superposition and CRT comparisons consume the non-pretentious case of Tao-Teravainen arXiv:2512.01739v2 Theorem 3.1 and its stated Liouville non-pretentiousness input. This uses arithmetic information beyond local residue densities. The imported theorem is not reproved. The continuous scale-average saving and its elementary dyadic sampling consequence apply only to the prime-cofactor subfamily, with no o(x) estimate and no full-corner or twin margin.","question":"Can the nonmultiplicative prime-band weight be represented by bounded multiplicative functions, and what does an available quantitative correlation theorem actually give after all scale and normalization costs?","verdict":"A smooth Fourier superposition represents mu(n)L_B(n)/log X exactly on n<=2X+2. The quantitative non-pretentious input and a mesh give a continuous scale-average saving for the exact s=s'=1 windows. The round review additionally derives a dyadic scale-average saving by bounded-interval stability, with exponent c_*/2. Neither estimate gives an every-dyadic bound, o(N), full-corner control or a twin margin. The extension in cofactor-progression-transfer.md now estimates a growing polylogarithmic cofactor family; the full remainder remains open. Proper-prime-power branches have the separate bound in corner-correlation §1.1."}}],"registry_verdict":"A smooth Fourier superposition represents mu(n)L_B(n)/log X exactly on n<=2X+2. The quantitative non-pretentious input and a mesh give a continuous scale-average saving for the exact s=s'=1 windows. The round review additionally derives a dyadic scale-average saving by bounded-interval stability, with exponent c_*/2. Neither estimate gives an every-dyadic bound, o(N), full-corner control or a twin margin. The extension in cofactor-progression-transfer.md now estimates a growing polylogarithmic cofactor family; the full remainder remains open. Proper-prime-power branches have the separate bound in corner-correlation §1.1."},{"row":19,"id":"Q-signed-moment","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/signed-moment.md","sha256":"f83eb30929ecdfffa484af3e0d0e6cce07f08418e063155a8089abce1bfe2222","ledger":{"id":"Q-signed-moment","status":"PARTIAL","todo":"C","parity":"Expands the block T = sum_m A_left(gm) Y(m) with no Cauchy inequality and prices the pieces. The two local lemmas use elementary inputs only; the linked joint-Cauchy follow-up additionally consumes the classical completion inputs of grouped-divisor-moment. The local inputs are: the exact combination of two inverse phases into a single modulus c = lcm(u1,u2), the coset structure of the resulting frequency, a geometric series in the harmonic variable after completing the harmonic subset by positivity, the elementary count of residues of an inverse in an interval, and the sup/variation bounds on the endpoint factor. No Weil or Ramanujan estimate is needed in Lemmas A and B themselves; the joint follow-up keeps those named imports explicit. Both gcd branches, both endpoint conventions, arbitrary harmonic subsets, all four coefficient sectors and prime powers are retained; no cancellation of any Mobius sign is assumed. The ceilings recorded are properties of named argument shapes and, for the arbitrary-coefficient ceiling, of a stated random model; no parity obstruction, impossibility theorem or necessity of a future mechanism is asserted. Failed upper bounds here say nothing about the sign or size of the underlying correlation.","question":"Is there an argument for the block that does not pay sqrt(M) at the first Cauchy inequality or that extracts cancellation from the R=0 class, and what are its budgets at the corner a=b=1 and at the target box (delta,nu)=(8/25,9/20)?","verdict":"The true diagonal has an upper bound x^(1+o(1)) on the transition band, not a uniform nonzero lower bound. Lemma A controls only u1=u2,h1=h2; unequal proportional R=0 pairs remain outside it. Lemma B and the now-priced joint Cauchy arrangement add no region. The former general Holder floor is valid only under additional coefficient assumptions, not for arbitrary sparse coefficients. Conditional off-diagonal budgets and the random-matrix ceiling remain conditional and heuristic. No necessity of using both signs, full-corner estimate or sufficient twin margin is established."}}],"registry_verdict":"The true diagonal has an upper bound x^(1+o(1)) on the transition band, not a uniform nonzero lower bound. Lemma A controls only u1=u2,h1=h2; unequal proportional R=0 pairs remain outside it. Lemma B and the now-priced joint Cauchy arrangement add no region. The former general Holder floor is valid only under additional coefficient assumptions, not for arbitrary sparse coefficients. Conditional off-diagonal budgets and the random-matrix ceiling remain conditional and heuristic. No necessity of using both signs, full-corner estimate or sufficient twin margin is established."},{"row":20,"id":"Q-smooth-sieve-literature","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/smooth-sieve-literature.md","sha256":"c2e34c3e54f758f4429f1570253a51f3dcd5655e92824ab98877937d7e527e20","ledger":{"id":"Q-smooth-sieve-literature","status":"PARTIAL","todo":"C","parity":"Primary-source matching of smooth sieve moments, quadratic optimality and shifted divisor correlations. A weakened smallest-prime majorant meets Henriot's corrected nonmultiplicative upper theorem and localizes the full absolute residual. Exact prime filters and prime-power errors are retained. Neither a signed lower margin nor a general parity obstruction is proved.","question":"Which nearby published results should be imported instead of rediscovered, and do their methods give a more focused next question for the complete global remainder?","verdict":"Existing sources supply the finite-difference mechanism, one-point concentration and quadratic profile optimization; shifted divisor-sum estimates admit fixed shift two under their own support and smoothness conditions. A derived application of corrected Henriot bounds gives small-prime mass O_sigma(delta^sigma x)+O_epsilon(x^(39/40+epsilon)), uniformly in delta for fixed 0=0, one Cauchy inequality over the pair (m,q), classical completion with Ramanujan and composite-modulus Weil bounds (grouped-divisor-moment (7), itself Pascadi Lemmas 3.2-3.3, rederived in the 2026-09-09 integration review), averaged gcd losses over the common divisor of the e-pair, and an elementary harmonic gcd average with the prime-power factor fixed (Lemma H). Both gcd branches, both endpoint conventions, all four coefficient sectors, prime powers, arbitrary harmonic subsets, the R=0 class, complete periods and the independent divisor twists are retained. No cancellation of any Mobius sign is used; the Lambda weights enter only through nonnegativity and Chebyshev. No parity obstruction or necessity claim is asserted; the failures recorded are failed upper bounds.","question":"Can the actual coefficient structure of b_u=A_right(gu), preserved through one further factorization, improve the small-common-divisor cross term at (delta,nu)=(8/25,9/20) beyond the arbitrary-coefficient moment, and what does it buy regionally?","verdict":"Derived 2026-09-08; read by the handler (research-round-validation section 10) and independently by reader V3, both verifying Lemma H and (D1) within stated scope, with grouped-divisor-moment (7) and the required separate-coefficient upstream block shape rechecked on 2026-09-09; one correction applied (the regional cut is a fourth simultaneous condition of W_dagger, not a substitute for the third). Writing u=eq and applying Cauchy over (m,q) instead of over m keeps every pair of the moment inside a common prime-power factor, so the completed modulus grows by q while the pair count is that of e; one elementary harmonic gcd lemma prices the fixed factor. The block bound (D1) saves x^(min(sigma,alpha)/4) on the cross term and costs x^(sigma/2), x^sigma on the zero and period terms. At the target box the worst sector exponent falls from 41/40 to 407/400 and the box is not controlled. (D1) controls the strip delta<71/100, delta+3nu<327/200 outside the existing region (245 of 36481 grid boxes); section 6 adds the concrete cut d<=floor(x^(141/200)), de^3<=floor(x^(1631/1000)), de>floor(x^(77/100)) as a fourth simultaneous condition of W_dagger through the Perron machinery, changing only the summation domain of E_dagger. The target box (407/400), the corner, the uniform product threshold 19/25, the sign of E_dagger and the global twin margin are unchanged; the margin remains OPEN."}}],"registry_verdict":"Derived 2026-09-08; read by the handler (research-round-validation section 10) and independently by reader V3, both verifying Lemma H and (D1) within stated scope, with grouped-divisor-moment (7) and the required separate-coefficient upstream block shape rechecked on 2026-09-09; one correction applied (the regional cut is a fourth simultaneous condition of W_dagger, not a substitute for the third). Writing u=eq and applying Cauchy over (m,q) instead of over m keeps every pair of the moment inside a common prime-power factor, so the completed modulus grows by q while the pair count is that of e; one elementary harmonic gcd lemma prices the fixed factor. The block bound (D1) saves x^(min(sigma,alpha)/4) on the cross term and costs x^(sigma/2), x^sigma on the zero and period terms. At the target box the worst sector exponent falls from 41/40 to 407/400 and the box is not controlled. (D1) controls the strip delta<71/100, delta+3nu<327/200 outside the existing region (245 of 36481 grid boxes); section 6 adds the concrete cut d<=floor(x^(141/200)), de^3<=floor(x^(1631/1000)), de>floor(x^(77/100)) as a fourth simultaneous condition of W_dagger through the Perron machinery, changing only the summation domain of E_dagger. The target box (407/400), the corner, the uniform product threshold 19/25, the sign of E_dagger and the global twin margin are unchanged; the margin remains OPEN."},{"row":22,"id":"Q-transition-joint-budget","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/transition-joint-budget.md","sha256":"6174e20b929178c0e97922532f83cabf2a6698cc57a5b4642388e1c495935fc1","ledger":{"id":"Q-transition-joint-budget","status":"PARTIAL","todo":"C","parity":"Exact divisor algebra, the imported uniform truncated-Mobius mean square (de la Breteche-Dress-Tenenbaum) and the imported Graham/An mean square, together with Minkowski's integral inequality and the derived norm lower bound of sharp-corner-transition section 4. The negative below is scoped to one named mechanism (moving sharp cutoff followed by Cauchy) and to bounds that pass through the two one-point norms; no impossibility theorem for signed cancellation, no positive shift-2 correlation and no method-class obstruction is claimed. No consumer input is supplied.","question":"Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer?","verdict":"The exact split, cutoff-average identities and separate upper budgets survive. Averaging cutoff norms after triangle and Cauchy is saturated for sufficiently small fixed eta, but signed cutoff arguments and joint cancellation are not closed. R_00 need not be estimated separately under every grouping. The short-window constraint is corrected with a bounded majorant and a safely reduced lower constant. No consumer input or signed improvement is supplied; E_out and the sufficient twin margin remain OPEN."}}],"registry_verdict":"The exact split, cutoff-average identities and separate upper budgets survive. Averaging cutoff norms after triangle and Cauchy is saturated for sufficiently small fixed eta, but signed cutoff arguments and joint cancellation are not closed. R_00 need not be estimated separately under every grouping. The short-window constraint is corrected with a bounded majorant and a safely reduced lower constant. No consumer input or signed improvement is supplied; E_out and the sufficient twin margin remain OPEN."},{"row":23,"id":"Q-transition-signed-estimate","todo":"C","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/transition-signed-estimate.md","sha256":"1ea003db19f8cee76f5fa6b134769feb54814f097f8565bfc629849ac5066eb9","ledger":{"id":"Q-transition-signed-estimate","status":"PARTIAL","todo":"C","parity":"Exact divisor and CRT identities, the uniform DBDT mean-square input through sharp-corner-transition (5), Mertens and a divisor bound. Both Mobius factors, both gcd branches, all prime powers and small cofactors are retained. No cancellation at shift 2 is obtained; the one-sided input is written with its quantifiers and left OPEN.","question":"Can the signed transition kernel (E1) be estimated beyond its absolute norm budget, and if not, what exact input does the consumer need?","verdict":"No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN."}}],"registry_verdict":"No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN."},{"row":24,"id":"Q-recon-0830-smooth-aps","todo":"9","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/recon-0830-smooth-aps.md","sha256":"c46652549a48911dc650da39aac60a91c15095e3d52f94103df8581b2c7199c5","ledger":{"id":"Q-recon-0830-smooth-aps","status":"PARTIAL","question":"Does any theorem on y-friable integers in arithmetic progressions (Granville, Fouvry-Tenenbaum, Soundararajan, Harper, Drappeau, Drappeau-Granville-Shao) supply the uniform o(1) equidistribution that attack-0830-varE-identification.md section 4 leaves open, for moduli up to y^(4/5) with the lam1 weight and the squarefree restriction?","verdict":"NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength.","todo":"9"}}],"registry_verdict":"NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength."},{"row":25,"id":"Q-varE-identification-0830","todo":"9","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-varE-identification.md","sha256":"c950983f8593aab33cd960e0b7d1f0385723d1b20a9de29e0cac74c918e39b3c","ledger":{"id":"Q-varE-identification-0830","status":"PARTIAL","todo":"9","question":"Can either open step behind lim Var/E = 0.45546 (the identification delta*(X - X_dec) -> 0, or the theta = 2 mean-coefficient replacement) be proven, and if not, which single inequality does not close?","verdict":"Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength."}}],"registry_verdict":"Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength."},{"row":26,"id":"Q-varE-limit","todo":"9","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/lit-dickman-variance.md","sha256":"116d227b8666ba4bb5da4b08a3a60c70e767cbce40dc60ca69d6c63d7f1a1d7c","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"Prior art: not in print at theta = 2 (Gorodetsky is kappa = 1 only, confirmed at source; Aryan 2015 Lemma 1.2 is an upper bound with our main term, its exponent the nested P^{-2^{ks}+ks}); arXiv API, Scholar and Opera de Cribro Prop 6.26 owed."}},{"path":"research/history/staging/lit-smooth-divisors.md","sha256":"975711a742532dd043a57ba36e8bf9693fef80776eb40e20919d45d410cfcc1d","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"PARTIAL, and not ABSENT. The owning convention is H_F(x,y,z) (Tenenbaum's localisation des diviseurs de F(n)), Hooley's Delta-function, and Koukoulopoulos's localized factorizations, searched on three channels each calibrated in session; no theorem in print bounds the residual with the needed saving, because every located result is a SET count (integers with at least one divisor in an interval) at a divisor range strictly BELOW the sampling range (y <= x^{1-eps}, Tenenbaum I with reducible F; y <= x/2, Tenenbaum II with F irreducible only; y <= sqrt x, Ford), at order-of-magnitude or (log y)^{o(1)} precision, while the statement needs a weighted sum over EVERY divisor ABOVE the range with relative error O(1/ln y) — and Ford's own 2008 open problem (i) is that no asymptotic exists even for H(x,y,2y). Friability changes nothing: the friable literature bounds Delta (a maximum, never a cancellation) or restricts to positive-density prime sets. ONE artifact could still change the answer and was not obtained: Scourfield, Smooth divisors of polynomials, LMS Lect. Notes 352 (2008) 286-311, whose author summary claims an asymptotic with error term for friable divisors m <= x of f(n) with f squarefree monic reducible — abstract-only here, so no absence is written and the reduction may NOT be called new."}},{"path":"research/history/staging/varE-asymptotic.md","sha256":"d867cbc8f3a606cc4d60a8a159590c63e8e958fad75f6be74501d05f2492dc9e","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"No closed form reached; Var/E = delta X exactly with delta ln^2 W -> 1.109905 and the MS main term exactly L, so all of Var/E is discrepancy; the fitted intercept is unpinned in [0.46, 0.72], and the 0.611 reading is refuted as an inference on both halves of its protocol, the bias-corrected intercepts clustering in [0.4471, 0.4546] around the sibling's heuristic 0.455456."}},{"path":"research/history/staging/varE-exact-ladder-01.md","sha256":"3bf27af9858e86cbd205ee9c3bbf3504fb456ce701044d1dbb34132ffe002a73","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"Neither open step closes here: x = 29 and 31 add two exact levels on which the decoupling error stays bounded and keeps falling (X/X_dec 1.000725 and 1.000471, delta(X - X_dec) ln y 0.00309 and 0.00238) without separating 1/ln y from anything faster, and the group-1 half of the near-cancellation is settled at 0.13347 while the other half is still drifting through the third decimal; the model's n <= L band, which varE-spectral section 4 states as O(1/ln W) and does not evaluate, is now EXACT at nine levels and reads 0.063/ln y to three figures with its share of delta*X_dec falling 4.16 % to 0.94 %; the n | L band is exactly zero and carries 6.4 % of the conductor mass at x = 37; the model itself is exact at x = 37 (0.395667) and 0.402368 +- 3.4e-5 at x = 41; the limit 0.45546 stays HEURISTIC with both steps open."}},{"path":"research/history/staging/varE-limit-theorem.md","sha256":"29a5224af13c8097ca1cea669f8b71fdbd10e43213506054db11fd2ff1e7eb8b","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"Step 2 of the two is CLOSED: the decoupled model's limit is exactly Pr[GD(2) > u] with NO correction term (ln n/ln y -> GD(2) proven with rate O(lnln y/ln y); n | L inert exactly; both transition bands O(1/ln y) by an elementary block bound), so lambda_2(2) = 0.45545648 is unchanged and lim Var/E now rests on ONE open step, the theta = 2 decoupling replacement; the n < L band varE-spectral sec.4 left unevaluated is measured exactly at nine levels with B*ln y = 0.063616 .. 0.063008 over x = 13..37, and the model's own approach to its limit is 0.886/ln y."}},{"path":"research/history/staging/varE-spectral.md","sha256":"6e35cd6ebe08bdd3ed57429ea88c40363b47a95558e65799beaccc7b6a67c70b","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"HEURISTIC closed form lim Var/E = Pr[GD(2) > u] = 0.45546 at u = 2 (confirmed to 2.9e-11 by three routes), TWO open steps (the theta=2 mean-coefficient replacement and the model's own limit theorem, whose n <= L band is unevaluated); the theta = 1 branch is an exact identity with Gorodetsky's (1.5)/(1.6); the published 0.611 is refuted as an inference on both the in-sample and the frozen out-of-sample protocol; HELD pending the two steps."}},{"path":"research/history/staging/varE-theta2-proof.md","sha256":"8a4a3df5d6616b995824bedced5fd0f46b2fac90516b6044783ef6e77b939aea","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"OPEN with the obstruction named. Two of the three lag groups of the decoupling error are now closed unconditionally: |2*X2| <= 60 prod p(p-3)/(p-2)^2 = O(ln y), and delta*(X1 - X_dec) -> 0 at rate O((ln ln y)^{-1/4}) by monotone coupling plus Kolmogorov-Rogozin, which removes that half's dependence on varE-spectral's own limit theorem (both derived here, unreviewed, and the second is numerically vacuous at all six computed levels). The CRT-mixed lags stay OPEN: every lag's phase sum is exact and elementary (R_n(c) = [(r-c)^+ + (r+c-n)^+ - r^2/n]/L), so the frequency route closes by identity and no exponential-sum bound applies; the residual is a divisor-distribution statement about y-smooth divisors of C(C^2-4) exceeding 2L, and the flat/active split that the kernel offers is measured lossy with delta*|flat| rising 0.559 to 1.301 on six levels. lim Var/E = 0.45546 stays HEURISTIC on both steps."}},{"path":"research/history/staging/varE-theta2-step.md","sha256":"f4986f1223106894080d230b14002f5a88f54ebdb670989c2aad052e66053569","ledger":{"id":"Q-varE-limit","status":"PARTIAL","todo":"9","question":"Does lim Var/E on the diagonal window exist, and what is it?","verdict":"The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open."}}],"registry_verdict":"The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open."},{"row":27,"id":"Q-X-upper-0829n","todo":"Z2","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0829n-X-upper.md","sha256":"7a9c609e31908822b22fab02f183e6066d1c11b48b3ef0dba9f399787d0a168e","ledger":{"id":"Q-X-upper-0829n","status":"PARTIAL","todo":"Z2","question":"Can the rough-pair census X(K) on the stretch window be bounded above, unconditionally and with an explicit error term, by a dimension-2 upper-bound sieve, and how loose is the bound against exact X(K)?","verdict":"Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated."}}],"registry_verdict":"Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated."},{"row":28,"id":"Q-roughpair-error","todo":"Z2","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-roughpair-error.md","sha256":"355b328db92152ba35546dccdfa0aee469df26e87fe39e74bc986350330db4bf","ledger":{"id":"Q-roughpair-error","status":"PARTIAL","todo":"Z2","question":"How big is the empirical error of the rough-pair census, and is Z2 dead on the numbers?","verdict":"Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit."}}],"registry_verdict":"Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit."},{"row":29,"id":"Q-head-remainder-0830","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-head-remainder.md","sha256":"79f877575974c4d6a0dbb6282f7476a96d103d319499ce951332ead41bc36c71","ledger":{"id":"Q-head-remainder-0830","status":"PARTIAL","todo":"Z4","question":"Does the 5.3 percent remainder that Hardy-Littlewood leaves in the head's endpoint deficit Delta = 2 - beta derive by a route that is not HL: the frozen-sieve first-survivor object, a level-of-distribution correction, or the exact tile-ensemble head?","verdict":"No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2."}}],"registry_verdict":"No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2."},{"row":30,"id":"Q-head-residual","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/head-residual-factor.md","sha256":"3a106c183747e1b7b19ada4b34455f0cae8361f3331afb205d24a903dbadfcc8","ledger":{"id":"Q-head-residual","status":"PARTIAL","todo":"Z4","question":"What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive?","verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."}},{"path":"research/history/staging/head-residual-hl3.md","sha256":"691b5ea985ae609fce750f301781cd24d996aec06d94561eda6d66f394c9b031","ledger":{"id":"Q-head-residual","status":"PARTIAL","todo":"Z4","question":"What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive?","verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."}},{"path":"research/history/staging/head-residual-null.md","sha256":"f369c54712f2795d9710293c363ae59332a28961ee88df44d72becf5fdce3e73","ledger":{"id":"Q-head-residual","status":"PARTIAL","todo":"Z4","question":"What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive?","verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."}}],"registry_verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63."},{"row":31,"id":"Q-tail-derivation-0830","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-tail-derivation.md","sha256":"055e8e4b4cff2509077b595828e21f576a312395f5f1860743e78c41b4d6857a","ledger":{"id":"Q-tail-derivation-0830","status":"PARTIAL","todo":"Z4","question":"Does the tail's measured law c = 0.7522 ln^2(p'^2) and its surplus derive, and which part of the coefficient is the tile's own (no prime input) against which part needs Hardy-Littlewood?","verdict":"PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3."}}],"registry_verdict":"PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3."},{"row":32,"id":"Q-zone-tail","todo":"Z4","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/zone-tail-01.md","sha256":"995fa66bf4492efc853fa9fab8d888359890f0c867e805d5a35e79b7b0933cda","ledger":{"id":"Q-zone-tail","status":"PARTIAL","todo":"Z4","question":"What is the tail field of the zone (p, p'^2) - its law against ln^2, its worst case, its share of the R0 width, and is it the frozen-sieve last survivor below p'^2 at the rate the head is the frozen sqrt(p)-level first survivor above p?","verdict":"The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after."}}],"registry_verdict":"The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after."},{"row":33,"id":"Q-record-mechanism-0830","todo":"Z5","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-record-mechanism.md","sha256":"bc0ae810afdc8ab2eeefdabcf42dd0e5c1e05b5ffcd43a4ae36fd7633f49a432","ledger":{"id":"Q-record-mechanism-0830","status":"PARTIAL","todo":"Z5","question":"Which of three candidate mechanisms (sub-Poisson gap dispersion, the tile's exact gap law, Kourbatov's k = 1 conspiracy heuristic transported to k = 2) carries the residual 0.78 to 0.97 of Kourbatov's b, at what derived size, and what fraction of b is left?","verdict":"The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier."}}],"registry_verdict":"The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier."},{"row":34,"id":"Q-doubling-C2","todo":"D","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-doubling-01.md","sha256":"37e50b61756ba29c77420266f9907f30eebbb06f52053aa7d5c72f42d32ea495","ledger":{"id":"Q-doubling-C2","status":"PARTIAL","todo":"D","question":"Does the doubling inequality hold on the base-2 chain, and can a bridging certificate prove it?","verdict":"Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412)."}}],"registry_verdict":"Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412)."},{"row":35,"id":"Q-doubling-bridge-0829n","todo":"D","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0829n-doubling-bridge.md","sha256":"34d44bc0048b159aa0804f771e32effdc67722621814c155ac600c8b6f83af6f","ledger":{"id":"Q-doubling-bridge-0829n","status":"PARTIAL","todo":"D","question":"Can a bridging certificate carry Ghat(2s) <= 8 Ghat(s) from level s to level 2s uniformly in s, all s, on the base-2 chain?","verdict":"Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched."}}],"registry_verdict":"Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched."},{"row":36,"id":"Q-doubling-killrun-0830","todo":"D","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-doubling-killrun.md","sha256":"07e0863cb68747ae14118ae4db5c54eed51eb3cb9fb2a5ebacee6837dd57e2fe","ledger":{"id":"Q-doubling-killrun-0830","status":"PARTIAL","todo":"D","question":"Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*?","verdict":"No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN."}}],"registry_verdict":"No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN."},{"row":37,"id":"Q-derive-0904-L7-transfer","todo":"0","status":"PARTIAL","status_ok":true,"verdict_ok":false,"verdict":"STALE","notes":[{"path":"research/history/staging/derive-0904-L7-transfer.md","sha256":"c60a250dfa9e633058aeb0ae7f31f2b24eb79c2419ca90f8a2a0a41c23d16712","ledger":{"id":"Q-derive-0904-L7-transfer","status":"PARTIAL","todo":"0","question":"Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to?","verdict":"No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), hence not at every position, which is the form L7 needs; the sieve-on-holes transfer reduces to the Bruedern-Fouvry vector sieve once the hole indicator is replaced by a sieve minorant (the Ford-Halberstam substitution step of sift-limit-attack.md 7b(1b)), whose coupled unconditional price is K_BF = 5.158065 at free levels (2(1 + sqrt e) = 5.2974 only with the levels forced equal), both above beta2, and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap, so mechanism 2 is dead as a route to L7 (redteam-0904-item0.md); weighted sieves with Chen switching, GPY/Maynard-Tao and FKMPT are already closed for this object (sift-limit-attack.md 4.2-4.4); L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only."}}],"registry_verdict":"No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), and the sieve-on-holes transfer is the Bruedern-Fouvry vector sieve, whose coupled unconditional form lands at 2(1 + sqrt e) = 5.2974 above beta2 and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap; L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only."},{"row":38,"id":"Q-rec-cheapest-0830","todo":"0","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-rec-cheapest.md","sha256":"15d3ee8e20010554550f9ad969c137dada5997fe090532bc2338164ecc89996c","ledger":{"id":"Q-rec-cheapest-0830","status":"PARTIAL","todo":"0","question":"At the cheapest legal point of REC(s, u0), s -> 1+sqrt(e) and u0 -> beta_2, where the saving asked over the triangle inequality is only z^{1.031}, does any of the five dead routes close, does a mixed mean-square-plus-cap strategy close, and is the failure a proof gap or a truth gap?","verdict":"No route closes and the failing step is yesterday's statement, so PARTIAL on the routes; but the step is located as a TRUTH gap, not a proof gap, asymptotically: the certificate's own value at a CRT-planted doubly-smooth window is cc(r) = -(A1A2 + A1B2 + B1A2) with every term a count of exit chains of the Rosser supports (PROVEN, checked exhaustively at z <= 73), the window bound T <= cc(r) + H - 1 is exact, and the exit-chain count is DERIVED (held) to grow like z^{16s/9 - o(1)} at four primes and z^{2s - o(1)} in the limit, so REC(s, u0) is false for every u0 < 16s/9 = 4.7088 at s -> 1+sqrt(e), the whole legal band (2, beta_2] included, and RML(alpha) with it; at every computable z it is a proof gap (Omega(z) exact to z = 73 reads 251 against z^{u0} = 1.05e6, and a certified lower bound 8.86e17 at z = 5e5 sits a factor 1.2e6 under z^{u0}); no exponent moved."}}],"registry_verdict":"No route closes and the failing step is yesterday's statement, so PARTIAL on the routes; but the step is located as a TRUTH gap, not a proof gap, asymptotically: the certificate's own value at a CRT-planted doubly-smooth window is cc(r) = -(A1A2 + A1B2 + B1A2) with every term a count of exit chains of the Rosser supports (PROVEN, checked exhaustively at z <= 73), the window bound T <= cc(r) + H - 1 is exact, and the exit-chain count is DERIVED (held) to grow like z^{16s/9 - o(1)} at four primes and z^{2s - o(1)} in the limit, so REC(s, u0) is false for every u0 < 16s/9 = 4.7088 at s -> 1+sqrt(e), the whole legal band (2, beta_2] included, and RML(alpha) with it; at every computable z it is a proof gap (Omega(z) exact to z = 73 reads 251 against z^{u0} = 1.05e6, and a certified lower bound 8.86e17 at z = 5e5 sits a factor 1.2e6 under z^{u0}); no exponent moved."},{"row":39,"id":"Q-recon-0904-sifting-limit-floor","todo":"0","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/recon-0904-sifting-limit-floor.md","sha256":"9d72ab020b25333bf6405ecdb9388526ae8463cf6fff051b2620f5a684cd1db4","ledger":{"id":"Q-recon-0904-sifting-limit-floor","status":"PARTIAL","todo":"0","question":"What is actually known, in the owning convention and at the page, about LOWER bounds on sifting limits at dimension kappa > 1, and is the class-blind cap at beta_2 = 4.26645 a barrier or a method artefact?","verdict":"Both. The corpus's [ABSENT] is wrong for lower bounds and right for extremal examples: Selberg's Lectures section 17 and Brady's 2017 Corollaries 1 and 3 ARE lower bounds on beta(kappa) at kappa > 1, invisible because Selberg's convention is the reciprocal a_k = 1/beta_kappa so his lower bounds are titled \"upper bounds for sifting limits\", while no kappa > 1 extremal example exists and Halberstam's own 2003 review says so; the best floor on beta(2) resting on a citation is 1.8394 from Brady's reduction evaluated at kappa = 2, unconditional and below the band, and beta(2) >= 2 follows from monotonicity by a padding argument DERIVED here and probably folklore; the cap at 4.26645 is a METHOD ARTEFACT at rung MEASURED, since the level-D LP is exactly the axiom-only information class and its calibrated floor of 3.3152 sits about 18 per cent below the DHR value and passed, 0 of 15, its first external test against the published beta_3 and beta_4; the band (2, 4.26645] is untouched by anything proven."}}],"registry_verdict":"Both. The corpus's [ABSENT] is wrong for lower bounds and right for extremal examples: Selberg's Lectures section 17 and Brady's 2017 Corollaries 1 and 3 ARE lower bounds on beta(kappa) at kappa > 1, invisible because Selberg's convention is the reciprocal a_k = 1/beta_kappa so his lower bounds are titled \"upper bounds for sifting limits\", while no kappa > 1 extremal example exists and Halberstam's own 2003 review says so; the best floor on beta(2) resting on a citation is 1.8394 from Brady's reduction evaluated at kappa = 2, unconditional and below the band, and beta(2) >= 2 follows from monotonicity by a padding argument DERIVED here and probably folklore; the cap at 4.26645 is a METHOD ARTEFACT at rung MEASURED, since the level-D LP is exactly the axiom-only information class and its calibrated floor of 3.3152 sits about 18 per cent below the DHR value and passed, 0 of 15, its first external test against the published beta_3 and beta_4; the band (2, 4.26645] is untouched by anything proven."},{"row":40,"id":"Q-rho-maximal-law","todo":"0","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/rho-exact-z31-01.md","sha256":"65e1451499d19e095bd0c14591f3c9493276666fbea3e98f79800a2e6cba3398","ledger":{"id":"Q-rho-maximal-law","status":"PARTIAL","todo":"0","question":"What is the rho maximal law, what is its weakest sufficient form against the crossing, and where does it sit against print?","verdict":"TODO 0's named cheap data ran (6928 s): Lambda(31) = 476.314, Lambda(37) = 1286.338, sup|rho~|(31) = 28.122062, sup|rho~|(37) = 52.219092, all exact and Parseval-controlled; MV(alpha)'s measured slope rises 4.214 +/- 0.304 to 4.566 +/- 0.217 and beta_2 leaves the 1se bar from BELOW by 1.38 se (inside at 2se, and inside again if z = 37 alone is dropped), so the weakest sufficient form is now measured against rather than undecided, while the TRUTH it bounds grows at only 2.766 +/- 0.212, 1.50 exponents under beta_2, the gap being the l1 instrument's own z^1.8 loss; the Gaussian rho law holds at both new levels (C_true 0.8412, 0.7820) and the TPC-implying sharp form is broken across the whole scan at both; RML(alpha) is open at every alpha, unchanged."}},{"path":"research/history/staging/rho-maximal-law.md","sha256":"4d279bd7860f8f08c113f2bf0cee74c5d9acbedfa49d04eb087e0e6f0404a515","ledger":{"id":"Q-rho-maximal-law","status":"PARTIAL","todo":"0","question":"What is the rho maximal law, what is its weakest sufficient form against the crossing, and where does it sit against print?","verdict":"The pricing lemma turns any RML(alpha) with alpha < beta_2 = 4.26645 into G2(z#) << z^alpha ln^2 z, every step proven except the law itself; the sufficiency curve lambda_max falls from 2.31949 at z = 13 to 1.78446 at z = 47, the weakest measured point, and whether it ever reaches zero is model-dependent and undecided, so nothing here is an unconditional exponent."}}],"registry_verdict":"The pricing lemma turns any RML(alpha) with alpha < beta_2 = 4.26645 into G2(z#) << z^alpha ln^2 z, every step proven except the law itself; the sufficiency curve lambda_max falls from 2.31949 at z = 13 to 1.78446 at z = 47, the weakest measured point, and whether it ever reaches zero is model-dependent and undecided, so nothing here is an unconditional exponent."},{"row":41,"id":"Q-rho-sup-z41-0830","todo":"0","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/measure-0830-rho-sup-z41.md","sha256":"94bcbc9c74bd98fff95d5d7b09783e0522e814a2b8283ae024925cc29e22ec76","ledger":{"id":"Q-rho-sup-z41-0830","status":"PARTIAL","todo":"0","question":"What is the exact sup over all positions of the centred sawtooth remainder at z = 41 (period 7.42e12), and of R_H at H = z^3 and z^4, and what does the eighth exact point do to the truth's slope and to the u0 = 3 form of REC(s, u0)?","verdict":"Not run in full; the exact z = 41 point prices at 4.8 to 5.4 h on this machine from measured per-position costs (naive 69.8, table 23.5, table-plus-windows 36.6 ns per worker; fleet 4.52 ns of wall at z = 41), above the 3.5 h rule, so what exists is a new engine (a PROVEN reflection that halves the walk, a P(29) periodic table worth 2.9x, per-block exact re-seeding) reproducing every cited exact sup at z = 13..37 digit for digit, sup|R_H| at H = z^3 walked for the first time at z = 19..37 (F3 = 26.4 to 35.9, the factor 2 was 1.5 to 2.2x loose), a sealed pre-registration (forecast sup 60.07, band [47.25, 76.37], kill needs sup|R_H3| >= 1807.417), one pilot twelfth giving lower bounds sup|rho~|(41) >= 70.651250 and sup|R_H3| >= 64.416936, and an eleven-segment plan for the box; no bound-and-prune exists on three routes; nothing asymptotic can move whatever the point turns out to be."}}],"registry_verdict":"Not run in full; the exact z = 41 point prices at 4.8 to 5.4 h on this machine from measured per-position costs (naive 69.8, table 23.5, table-plus-windows 36.6 ns per worker; fleet 4.52 ns of wall at z = 41), above the 3.5 h rule, so what exists is a new engine (a PROVEN reflection that halves the walk, a P(29) periodic table worth 2.9x, per-block exact re-seeding) reproducing every cited exact sup at z = 13..37 digit for digit, sup|R_H| at H = z^3 walked for the first time at z = 19..37 (F3 = 26.4 to 35.9, the factor 2 was 1.5 to 2.2x loose), a sealed pre-registration (forecast sup 60.07, band [47.25, 76.37], kill needs sup|R_H3| >= 1807.417), one pilot twelfth giving lower bounds sup|rho~|(41) >= 70.651250 and sup|R_H3| >= 64.416936, and an eleven-segment plan for the box; no bound-and-prune exists on three routes; nothing asymptotic can move whatever the point turns out to be."},{"row":42,"id":"Q-rml-proof-0829n","todo":"0","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0829n-rml-proof.md","sha256":"a581aa2459597058e65cea8f4efba10a8e9d829f1407e7ed134ff4d09b96b537","ledger":{"id":"Q-rml-proof-0829n","status":"PARTIAL","todo":"0","question":"Starting from Lemma V's PROVEN mean-square bound, what is the exact chain of implications to a two-class exponent below beta_2 = 4.26645, which single arrow is open, and does it close?","verdict":"The chain from the proven mean square to an exponent below beta_2 has exactly one open arrow, the mean-square-to-sup recovery REC(s,u0): sup_x |R_H(x)| <= z^{u0/2 - eps} rms(R_H) at H = z^{u0} for one fixed u0 in (2, beta_2); every attempt here dies at a named place (term-by-term accounting is capped at 2s + o(1), the trivial-level exponent; position-union pays e^{theta(z)/q}; window smoothing and the P(y) lever move polylog only; the smooth-profile form is closed on hypothesis and priced above beta_2), the arrow is measured TRUE with certified margin z^1.72 to z^1.92 at u0 = 4 over z = 19..37 and the truth's slope 2.766 +/- 0.212 sits 5.8 se under u0 = 4 on seven points under one octave, so the failure is a proof gap at every computable z and undecided asymptotically; no exponent moved."}}],"registry_verdict":"The chain from the proven mean square to an exponent below beta_2 has exactly one open arrow, the mean-square-to-sup recovery REC(s,u0): sup_x |R_H(x)| <= z^{u0/2 - eps} rms(R_H) at H = z^{u0} for one fixed u0 in (2, beta_2); every attempt here dies at a named place (term-by-term accounting is capped at 2s + o(1), the trivial-level exponent; position-union pays e^{theta(z)/q}; window smoothing and the P(y) lever move polylog only; the smooth-profile form is closed on hypothesis and priced above beta_2), the arrow is measured TRUE with certified margin z^1.72 to z^1.92 at u0 = 4 over z = 19..37 and the truth's slope 2.766 +/- 0.212 sits 5.8 se under u0 = 4 on seven points under one octave, so the failure is a proof gap at every computable z and undecided asymptotically; no exponent moved."},{"row":43,"id":"Q-fekete-1d-defect47","todo":"1d","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/fekete-1d.md","sha256":"33657acd3ed1b3d6fd7abcea6aa2a379cc97830027c40c63899743a411f24a98","ledger":{"id":"Q-fekete-1d-defect47","status":"PARTIAL","todo":"1d","question":"Does the bounded-defect Fekete route survive a probe at 47#?","verdict":"The defect at 47# is ordinary and the 47# enumeration cannot move item 1d's TPC threshold whatever value it returns; the bounded-defect Fekete lemma is stated exactly and proved with every hypothesis except the candidate itself discharged, so the route reduces to one named inequality and is neither closed nor open beyond that."}}],"registry_verdict":"The defect at 47# is ordinary and the 47# enumeration cannot move item 1d's TPC threshold whatever value it returns; the bounded-defect Fekete lemma is stated exactly and proved with every hypothesis except the candidate itself discharged, so the route reduces to one named inequality and is neither closed nor open beyond that."},{"row":44,"id":"Q-g2-falls-decision-rule","todo":"1d","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/phase1-T3prep-decision-rule.md","sha256":"08ab2b2be95121ef00cd99a0455ccc633bbb0088e436683822b4faa6afc94170","ledger":{"id":"Q-g2-falls-decision-rule","status":"PARTIAL","todo":"1d","question":"Does G2(x#)/x^2 fall, and what pre-registered decision rule would settle it?","verdict":"The instrument is calibrated and sharp, resolving the one-class control at 11.6 sigma on the same nine points where it returns 0.9 sigma on G2, and the honest band on the slope is +/-0.117 at nine terms, so the rule is registered; but the power analysis puts separation at x = 53 only if the falling law is x ln^2 x and at x = 151 if it is x ln^3 x, so phase 1's extra terms settle nothing and no reachable exact ladder does either."}}],"registry_verdict":"The instrument is calibrated and sharp, resolving the one-class control at 11.6 sigma on the same nine points where it returns 0.9 sigma on G2, and the honest band on the slope is +/-0.117 at nine terms, so the rule is registered; but the power analysis puts separation at x = 53 only if the falling law is x ln^2 x and at x = 151 if it is x ln^3 x, so phase 1's extra terms settle nothing and no reachable exact ladder does either."},{"row":45,"id":"Q-hsub-reductions","todo":"1d","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-hsub-01.md","sha256":"03626860c502880baeb35c7b9da215c69310749eecc29257717b2806ffd6d8d4","ledger":{"id":"Q-hsub-reductions","status":"PARTIAL","todo":"1d","question":"Can (H-sub) be proven or refuted, and what does the fold machinery reach?","verdict":"Neither, but the statement is smaller: three reductions of the hypothesis are proven, the lemma consuming only power pairs so that it weakens to (H-sub-pow) with the conclusion unchanged, the fold machinery's inability to reach any of them is made exact, and the hunt over all 111 reachable pairs found no drifting family and no counterexample."}}],"registry_verdict":"Neither, but the statement is smaller: three reductions of the hypothesis are proven, the lemma consuming only power pairs so that it weakens to (H-sub-pow) with the conclusion unchanged, the fold machinery's inability to reach any of them is made exact, and the hunt over all 111 reachable pairs found no drifting family and no counterexample."},{"row":46,"id":"Q-xchannel-at23","todo":"X","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/xchannel-at23.md","sha256":"eaa77c372bdfe928858a8a00144aa45ec71e760fd5e2542eb3e47d67b35fe086","ledger":{"id":"Q-xchannel-at23","status":"PARTIAL","todo":"X","question":"What is the fifth point of the X-channel statistic, at @23, and does the monotone rise hold?","verdict":"The fifth point is +0.2658 at @23, the rise holds at five levels and is larger than the four-point trend predicted, and the deficit has migrated into m >= 3, whose share of the X-gap runs 10.5, 23.5 and 81.1 per cent at @17, @19 and @23; the constant itself is not derived here."}}],"registry_verdict":"The fifth point is +0.2658 at @23, the rise holds at five levels and is larger than the four-point trend predicted, and the deficit has migrated into m >= 3, whose share of the X-gap runs 10.5, 23.5 and 81.1 per cent at @17, @19 and @23; the constant itself is not derived here."},{"row":47,"id":"Q-xchannel-closedform","todo":"X","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/xchan-at29.md","sha256":"e9ea5a647477176be2851a5c0162079e52a56db8a226d1c9225b900033e1fc64","ledger":{"id":"Q-xchannel-closedform","status":"PARTIAL","todo":"X","question":"Does the zero-parameter closed form for the joint deficit survive its two blind tests at @29 and @31?","verdict":"1 - J = 4S2 is the only one of the three pre-registered laws left standing and it is not exact: a clean hit at @29, z = -0.90, and 4.93 sigma low at @31 where sigma_J falls to 0.000024, with the two rivals dying at 6.35 and 20.81 sigma; both blind levels agree on a stable relative offset of about half a percent, -0.41% and -0.48%, whose absolute residuals match to 2%."}}],"registry_verdict":"1 - J = 4S2 is the only one of the three pre-registered laws left standing and it is not exact: a clean hit at @29, z = -0.90, and 4.93 sigma low at @31 where sigma_J falls to 0.000024, with the two rivals dying at 6.35 and 20.81 sigma; both blind levels agree on a stable relative offset of about half a percent, -0.41% and -0.48%, whose absolute residuals match to 2%."},{"row":48,"id":"Q-xchannel-offset","todo":"X","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/item-x-offset.md","sha256":"56b36842f16025a152ab819929ff445179bb8a7b09ee063bf059198b25cfe867","ledger":{"id":"Q-xchannel-offset","status":"PARTIAL","todo":"X","question":"What produces the ~3.8 law's -0.45% offset, and which candidate correction survives?","verdict":"The best available description is a finite-level correction of S3's size and sign - 1 - J = 4S2 - S3 scores z = +0.04 at @29 and -0.41 at @31 where the standing law scores -0.43 and -2.32 - but it is POST HOC; two candidate corrections and one shape are refuted on existing data, the sigma behind the @31 detection is calibrated on seven known-truth controls, and the deciding blind test at @37 is pre-registered and committed alone."}}],"registry_verdict":"The best available description is a finite-level correction of S3's size and sign - 1 - J = 4S2 - S3 scores z = +0.04 at @29 and -0.41 at @31 where the standing law scores -0.43 and -2.32 - but it is POST HOC; two candidate corrections and one shape are refuted on existing data, the sigma behind the @31 detection is calibrated on seven known-truth controls, and the deciding blind test at @37 is pre-registered and committed alone."},{"row":49,"id":"Q-at43-bigint-0830","todo":"1","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/engine-0830-at43-bigint.md","sha256":"fe2fff95ebc754eb6ec5ee326998c3e42c434f76fd0e9bc0b4b68e17974dac78","ledger":{"id":"Q-at43-bigint-0830","status":"PARTIAL","todo":"1","question":"Can the K-30 natal march be carried past its 2^53 ceiling to @43 exactly, and is the @43 point worth its cost?","verdict":"The engine side is done and VERIFIED (five paths promoted to BigInt, @7..@37 and a 0.248% slice of @41 reproduced digit for digit); the @43 point is NOT run, because the measured extrapolation is 579 h of eight cores on this machine (a 43x tile times a 2.23x per-cell cost, against the brief's ~13x), which is a weeks-class box job whose only payoff is a sixth point on a curve with no consumer; the forecast 0.8393 raw / 0.8399 persisted stands unscored."}}],"registry_verdict":"The engine side is done and VERIFIED (five paths promoted to BigInt, @7..@37 and a 0.248% slice of @41 reproduced digit for digit); the @43 point is NOT run, because the measured extrapolation is 579 h of eight cores on this machine (a 43x tile times a 2.23x per-cell cost, against the brief's ~13x), which is a weeks-class box job whose only payoff is a sixth point on a curve with no consumer; the forecast 0.8393 raw / 0.8399 persisted stands unscored."},{"row":50,"id":"Q-comb-discrepancy","todo":"8","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/comb-discrepancy-tight.md","sha256":"b8464183b7543cfc83e0eee5832e5efa9cb07959c66e383efa174a28c2767871","ledger":{"id":"Q-comb-discrepancy","status":"PARTIAL","todo":"8","question":"Can the Comb Discrepancy Lemma's constant 2*3^k be tightened (TODO 8c)?","verdict":"The lemma IS the trivial per-block bound; the attained optimum is max G - min G, a computed number per level (slack 29x @23, 54x @29, growing); term-by-term pricing lifts the certified head share to about 28-29 percent, not the 50 hoped for."}}],"registry_verdict":"The lemma IS the trivial per-block bound; the attained optimum is max G - min G, a computed number per level (slack 29x @23, 54x @29, growing); term-by-term pricing lifts the certified head share to about 28-29 percent, not the 50 hoped for."},{"row":51,"id":"Q-comb-tail-0830","todo":"8","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-0830-comb-tail.md","sha256":"e40b8251f329407ad94677a24fdc9e8f231488e9a3e90b1a4d9914f8c892d40f","ledger":{"id":"Q-comb-tail-0830","status":"PARTIAL","todo":"8","question":"Can TODO item 8's remaining part (b), prime-comb equidistribution in the tail regime, be proven at the depths the certificate needs, or at least measured and priced at the enumerable levels (8b)?","verdict":"Not proven and no exponent moves: the tail defect is measured exactly for the first time (signed -0.01% of the tail main term at @23, -0.00% at @29, unsigned 0.60% and 0.25%, smaller than the head's 1.00% in aggregate but 8 to 37% per prime at its worst), the Comb Discrepancy Lemma's method fails in the tail on its MAIN TERM (off by a derived factor e^gamma(1/u - q^(1-u)), measured aggregate 1.14x at @23) before its error term (10^27 x main), the prime-comb Legendre form has 2^(k+2) terms of which the short ones obey the lemma's <1 bound and the long ones are prime-in-AP discrepancies whose term-by-term sum is 11.2% of main at @23 against a signed -0.01%; the all-x form at K = 0 is Theorem C (PROVEN, limit only) and at the certificate's depth K* the non-closing step is a kappa = 1 asymptotic at sifting parameter s < 2, a proof gap on data that show B_tail = 0.998-1.000 at K* through @29; the full-depth half is 8(a), CLOSED."}}],"registry_verdict":"Not proven and no exponent moves: the tail defect is measured exactly for the first time (signed -0.01% of the tail main term at @23, -0.00% at @29, unsigned 0.60% and 0.25%, smaller than the head's 1.00% in aggregate but 8 to 37% per prime at its worst), the Comb Discrepancy Lemma's method fails in the tail on its MAIN TERM (off by a derived factor e^gamma(1/u - q^(1-u)), measured aggregate 1.14x at @23) before its error term (10^27 x main), the prime-comb Legendre form has 2^(k+2) terms of which the short ones obey the lemma's <1 bound and the long ones are prime-in-AP discrepancies whose term-by-term sum is 11.2% of main at @23 against a signed -0.01%; the all-x form at K = 0 is Theorem C (PROVEN, limit only) and at the certificate's depth K* the non-closing step is a kappa = 1 asymptotic at sifting parameter s < 2, a proof gap on data that show B_tail = 0.998-1.000 at K* through @29; the full-depth half is 8(a), CLOSED."},{"row":52,"id":"Q-c2prime-drift","todo":"1c (retired)","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/attack-c2drift-01.md","sha256":"2462c9e26796b6bd054298f4c355abe185fb3242d3b7ab9831cf1ae042843bf8","ledger":{"id":"Q-c2prime-drift","status":"PARTIAL","todo":"1c (retired)","question":"Why does c2' drift on the 22-term ladder?","verdict":"The twin-specific mechanism for the drift is closed (cited as such by c2prime-refit-22.md)."}},{"path":"research/history/staging/c2prime-refit-22.md","sha256":"1ed07f6258acee6cc233187e162e07397ed60e65b864e3417b48913503d70c56","ledger":{"id":"Q-c2prime-drift","status":"PARTIAL","todo":"1c (retired)","question":"Why does c2' drift on the 22-term ladder?","verdict":"Class-count-blind (attack-c2drift-01 §1); on item 1c's own band x >= 41 the ten-point rate is unresolvable: c2' 0.3745 +/- 0.1411 against c1's 0.3344 +/- 0.2358 on the same primes, a difference of 0.0401 = 0.12 of the control's ten-point window sd. Whether the drift is real is NOT closed here: attack-c2drift-01 measured it at p = 0.0053 on x >= 17 and left (i)' and (ii) alive. exponent-control §2/§4/§6 refit at 22 terms."}}],"registry_verdict":"Class-count-blind (attack-c2drift-01 §1); on item 1c's own band x >= 41 the ten-point rate is unresolvable: c2' 0.3745 +/- 0.1411 against c1's 0.3344 +/- 0.2358 on the same primes, a difference of 0.0401 = 0.12 of the control's ten-point window sd. Whether the drift is real is NOT closed here: attack-c2drift-01 measured it at p = 0.0053 on x >= 17 and left (i)' and (ii) alive. exponent-control §2/§4/§6 refit at 22 terms."},{"row":53,"id":"Q-zonegap-reduction","todo":"Z (retired)","status":"PARTIAL","status_ok":true,"verdict_ok":true,"verdict":"CURRENT","notes":[{"path":"research/history/staging/zonegap-02-reduction.md","sha256":"3f35bdaea5d8835e15c85c66218220deb02028059a60e5a9f0dbf11ee2d66e40","ledger":{"id":"Q-zonegap-reduction","status":"PARTIAL","todo":"Z (retired)","question":"What must be proven for Z2, what already is, and what does the proven head machinery give the zone?","verdict":"The Zone Restriction Lemma is proven and verified at five levels - the in-zone twin slots of T_p ARE the in-zone twin primes, so Z2(p) IS the whole-tile gap object restricted to the head window - the three-slack chain is graded honestly, the transfer inventory is listed item by item, and the deep end is proven an onset desert over 24 levels; section 5 lists what was not reached."}}],"registry_verdict":"The Zone Restriction Lemma is proven and verified at five levels - the in-zone twin slots of T_p ARE the in-zone twin primes, so Z2(p) IS the whole-tile gap object restricted to the head window - the three-slack chain is graded honestly, the transfer inventory is listed item by item, and the deep end is proven an onset desert over 24 levels; section 5 lists what was not reached."}],"api":{"source":"/projects/twin-primes/docs/research/QUESTIONS.md","counts":{"open":5,"partial":48,"total":217},"questions":[{"item":"9","id":"Q-var41","text":"What does the stable law predict for Var(41), and what can the tenth Var/E point pin?","status":"OPEN","verdict":"Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift."},{"item":"D","id":"Q-kstar-prereg","text":"What is K* at the three next doubling steps, predicted before any period walk?","status":"OPEN","verdict":"Pre-registration only, committed alone: the predictions, the scoring rule and the growth-type verdict thresholds are fixed in advance, with the inclusion-exclusion engine validated against an independent scan engine on all eleven known steps first."},{"item":"1d","id":"Q-hsubpow-K-0829n","text":"Can (H-sub-pow) be proven with an explicit K inside the trusted legal zone [1.3946, 11.3568) by a mechanism the 2026-08-28 pass did not close?","status":"OPEN","verdict":"No K is proven at any base; the single open inequality is the uniform-in-k ratio cap G(b^(k+1))/G(b^k) <= e^K G(b), which is a proof gap at a fixed base and a possible truth gap across bases, since for any law G ~ c n^beta (ln n)^delta the all-bases hypothesis holds with finite K if and only if delt"},{"item":"X","id":"Q-xchan-at29-prereg","text":"Does the joint-deficit closed form survive a blind test at @29?","status":"OPEN","verdict":"Pre-registration only, committed alone before any producer existed: the statistic, the predictions adopted verbatim from the record, two acceptance bands, the validation gate the instrument must clear before any @29 number is reported, and what each verdict does to TODO item X."},{"item":"5 (retired)","id":"Q-shadow-prereg","text":"Is the kill shadow's 0.85 the band-average of the Unification-Law survival curve over the post-crystallization window?","status":"OPEN","verdict":"Pre-registration only, written before any measurement: the candidate values are computed and frozen, the scoring rules are fixed in advance, no statistic may be promoted to a verdict after the fact, and the verdict rests on y >= 997."},{"item":"C","id":"Q-centered-discrepancy-estimate","text":"Can the top of D_y be removed using ordinary prime distribution after an exact divisor flip, and what estimate remains?","status":"PARTIAL","verdict":"Equations (3)-(4), the exact split and flip, survive review and finite controls. A repair of the top-range bound T^top=O_(A,eps)(x/log^A x) is DERIVED in section 3a (2026-09-08) with the endpoint atom retained, odd square divisors, the corrected reciprocal-totient local factors with (m',g)=1, explic"},{"item":"C","id":"Q-chen-signed-target","text":"What exact additional arithmetic estimate would turn the completed Chen benchmark into a proof of infinitely many twin primes?","status":"PARTIAL","verdict":"An elementary prime minorant gives a conditional twin theorem with all weights, ranges, quantifiers and errors specified. The opportunity audit identifies an avoidable negative-weight penalty and a separate-estimate budget that fails even under component cancellation; this sufficient target remains "},{"item":"C","id":"Q-cofactor-progression-transfer","text":"Can the corrected full-cofactor kernel be estimated on a growing cofactor range by representing its actual arithmetic on CRT progressions, and does the resulting bound reach the twin consumer?","status":"PARTIAL","verdict":"Derived from named imports: for some positive absolute kappa and d, all prime-r cofactor pairs s,t <= floor((log x)^kappa), including non-squarefree inputs and mixed transition/smoothed profiles, admit a dyadic scale-average O(log^(2-d) X) bound after division by x. The extension uses bounded multip"},{"item":"C","id":"Q-corner-correlation","text":"On the corner S_0 where both cofactors sit just above their own cutoffs, what exactly is the remaining endpoint sum, what does the sufficient consumer need there, and does any reviewed correlation theorem supply it?","status":"PARTIAL","verdict":"The full corner is exactly sum_n C(n)C'(n-2). Proper-prime-power terms above the cutoffs are negligible at fixed eta by §1.1; the remaining prime-r terms with s>1 or s'>1 and non-squarefree inputs remain OPEN. The s=s'=1 piece has a nonnegative Mobius-product weight with exact moving cuts. The multi"},{"item":"C","id":"Q-corner-log-average","text":"What do logarithmically averaged correlation theorems and their quantitative successors actually supply for the prime-cofactor corner weight, with exact support, rates and scale quantifiers?","status":"PARTIAL","verdict":"The pure band is invariant under dilation by primes outside it; the exact cofactor window is not, but its support extends to x^(1-2eta) and need not leave the window under a fixed dilation. Uniform-prefix logarithmic bounds imply block bounds by Abel summation; a relative exponent above 3 is one suf"},{"item":"C","id":"Q-fixed-endpoint-discrepancy","text":"After the accepted truncation to odd moduli e=-4x/25+o(x)?","status":"PARTIAL","verdict":"Reviewed 2026-09-09 after the coprimality repair: T_I^low=O_(A,eps')(x/log^A x), hence S=C_2x+B+O_A(x/log^A x), with B the exact Type II plus band sum (2.9). The untruncated modulus bound was false; g<=(log x)^(A+13), both tails, the coprime density and the weighted BV multiplicity now pay the estim"},{"item":"C","id":"Q-fold-arithmetic-bridge","text":"Does one parity-table bridge from the anchored fold ledger yield a sufficient twin lower bound with named arithmetic inputs?","status":"PARTIAL","verdict":"Exact identities retained. The one unread sieve input of the pricing, Bombieri--Vinogradov for k-fold X^(1/u)-rough products, is derived from Wu's Lemma 2.3 (section 3a); the same input, sieved in the composite variable, gives the contamination aggregate constant 4 for each fixed k,u, replacing the "},{"item":"C","id":"Q-full-coefficient-average","text":"Can aggregating the complete coefficients before a correlation theorem remove the explicit cofactor count, and what additional estimate is needed?","status":"PARTIAL","verdict":"Exact factor and rounded-endpoint Fourier identities retained, with c_(i,0)=3/5 and an explicit composite-filtered weighted sum. The full family is not 1-bounded, but the sufficient phase condition admits at least k=0,+/-1 on the left and l=0,+/-1,...,+/-6 on the right for every Mellin twist; the ea"},{"item":"C","id":"Q-global-cutoff-averaging","text":"Does the wider corpus suggest changing the global decomposition before extending the small-cofactor estimate, and can that change be made without an unpaid transition or outside term?","status":"PARTIAL","verdict":"Derived: independently averaging the two initial Mobius cutoffs over fixed exponent intervals gives S=C2*x+sum G_L(n)G_R(n-2)+O_A(x/log^A x), uniformly on dyadic scales, with all cofactor and prime-power branches included. Each full G has squared norm O(x log x). The existing sharp-corner lower norm"},{"item":"C","id":"Q-global-factor-signs","text":"Which full factor configurations cause negative global products, can prime-power exceptions be paid, and does a pair-trigger upper bound control the negative part?","status":"PARTIAL","verdict":"Derived: G_i(n)=Lambda_(>W_i)(n)-F_i(s_i(n))*log t_i(n)-E_i(n), with all small-prime factors in s_i and all primes of t_i exceeding W_i. The correction is supported on a small-prime power exceeding W_i; its full shifted effect is O_epsilon(x^(39/40+epsilon)). After also paying proper prime powers, t"},{"item":"C","id":"Q-global-smooth-majorant","text":"Can a higher-order majorant control the complete global coefficient pair at scale x while retaining every factor configuration and the prime filters?","status":"PARTIAL","verdict":"Derived using the corrected Henriot upper theorem: a C3 probability average of the same admissible initial cutoffs gives a full residual with sum \\"},{"item":"C","id":"Q-left-divisor-signs","text":"Can the Möbius structure of the left coefficient A_left(gm) replace the first Cauchy inequality, so that its sqrt(M) loss is not paid, and what does that buy at the target box (delta,nu)=(8/25,9/20) and at the corner a=b=1?","status":"PARTIAL","verdict":"Partly, and not where it is needed. Two lemmas are derived: a Type I bound with no zero-frequency budget, usable at the target box whenever the arbitrary block is shorter than x^(1/4), and a Type II bound that is uniform in the Perron twist heights. Applied to the actual coefficient they confine the"},{"item":"C","id":"Q-prime-band-transfer","text":"Can the nonmultiplicative prime-band weight be represented by bounded multiplicative functions, and what does an available quantitative correlation theorem actually give after all scale and normalization costs?","status":"PARTIAL","verdict":"A smooth Fourier superposition represents mu(n)L_B(n)/log X exactly on n<=2X+2. The quantitative non-pretentious input and a mesh give a continuous scale-average saving for the exact s=s'=1 windows. The round review additionally derives a dyadic scale-average saving by bounded-interval stability, wi"},{"item":"C","id":"Q-signed-moment","text":"Is there an argument for the block that does not pay sqrt(M) at the first Cauchy inequality or that extracts cancellation from the R=0 class, and what are its budgets at the corner a=b=1 and at the target box (delta,nu)=(8/25,9/20)?","status":"PARTIAL","verdict":"The true diagonal has an upper bound x^(1+o(1)) on the transition band, not a uniform nonzero lower bound. Lemma A controls only u1=u2,h1=h2; unequal proportional R=0 pairs remain outside it. Lemma B and the now-priced joint Cauchy arrangement add no region. The former general Holder floor is valid "},{"item":"C","id":"Q-smooth-sieve-literature","text":"Which nearby published results should be imported instead of rediscovered, and do their methods give a more focused next question for the complete global remainder?","status":"PARTIAL","verdict":"Existing sources supply the finite-difference mechanism, one-point concentration and quadratic profile optimization; shifted divisor-sum estimates admit fixed shift two under their own support and smoothness conditions. A derived application of corrected Henriot bounds gives small-prime mass O_sigma"},{"item":"C","id":"Q-structured-dispersion-estimate","text":"Can the actual coefficient structure of b_u=A_right(gu), preserved through one further factorization, improve the small-common-divisor cross term at (delta,nu)=(8/25,9/20) beyond the arbitrary-coefficient moment, and what does it buy regionally?","status":"PARTIAL","verdict":"Derived 2026-09-08; read by the handler (research-round-validation section 10) and independently by reader V3, both verifying Lemma H and (D1) within stated scope, with grouped-divisor-moment (7) and the required separate-coefficient upstream block shape rechecked on 2026-09-09; one correction appli"},{"item":"C","id":"Q-transition-joint-budget","text":"Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer?","status":"PARTIAL","verdict":"The exact split, cutoff-average identities and separate upper budgets survive. Averaging cutoff norms after triangle and Cauchy is saturated for sufficiently small fixed eta, but signed cutoff arguments and joint cancellation are not closed. R_00 need not be estimated separately under every grouping"},{"item":"C","id":"Q-transition-signed-estimate","text":"Can the signed transition kernel (E1) be estimated beyond its absolute norm budget, and if not, what exact input does the consumer need?","status":"PARTIAL","verdict":"No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x"},{"item":"9","id":"Q-recon-0830-smooth-aps","text":"Does any theorem on y-friable integers in arithmetic progressions (Granville, Fouvry-Tenenbaum, Soundararajan, Harper, Drappeau, Drappeau-Granville-Shao) supply the uniform o(1) equidistribution that attack-0830-varE-identification.md section 4 leaves open, for moduli up to y^(4/5) with the lam1 weight and the squarefree restriction?","status":"PARTIAL","verdict":"NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every"},{"item":"9","id":"Q-varE-identification-0830","text":"Can either open step behind lim Var/E = 0.45546 (the identification delta*(X - X_dec) -> 0, or the theta = 2 mean-coefficient replacement) be proven, and if not, which single inequality does not close?","status":"PARTIAL","verdict":"Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group s"},{"item":"9","id":"Q-varE-limit","text":"Does lim Var/E on the diagonal window exist, and what is it?","status":"PARTIAL","verdict":"The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec"},{"item":"Z2","id":"Q-X-upper-0829n","text":"Can the rough-pair census X(K) on the stretch window be bounded above, unconditionally and with an explicit error term, by a dimension-2 upper-bound sieve, and how loose is the bound against exact X(K)?","status":"PARTIAL","verdict":"Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4."},{"item":"Z2","id":"Q-roughpair-error","text":"How big is the empirical error of the rough-pair census, and is Z2 dead on the numbers?","status":"PARTIAL","verdict":"Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where "},{"item":"Z4","id":"Q-head-remainder-0830","text":"Does the 5.3 percent remainder that Hardy-Littlewood leaves in the head's endpoint deficit Delta = 2 - beta derive by a route that is not HL: the frozen-sieve first-survivor object, a level-of-distribution correction, or the exact tile-ensemble head?","status":"PARTIAL","verdict":"No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half"},{"item":"Z4","id":"Q-head-residual","text":"What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive?","status":"PARTIAL","verdict":"h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly"},{"item":"Z4","id":"Q-tail-derivation-0830","text":"Does the tail's measured law c = 0.7522 ln^2(p'^2) and its surplus derive, and which part of the coefficient is the tile's own (no prime input) against which part needs Hardy-Littlewood?","status":"PARTIAL","verdict":"PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens consta"},{"item":"Z4","id":"Q-zone-tail","text":"What is the tail field of the zone (p, p'^2) - its law against ln^2, its worst case, its share of the R0 width, and is it the frozen-sieve last survivor below p'^2 at the rate the head is the frozen sqrt(p)-level first survivor above p?","status":"PARTIAL","verdict":"The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and th"},{"item":"Z5","id":"Q-record-mechanism-0830","text":"Which of three candidate mechanisms (sub-Poisson gap dispersion, the tile's exact gap law, Kourbatov's k = 1 conspiracy heuristic transported to k = 2) carries the residual 0.78 to 0.97 of Kourbatov's b, at what derived size, and what fraction of b is left?","status":"PARTIAL","verdict":"The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null i"},{"item":"D","id":"Q-doubling-C2","text":"Does the doubling inequality hold on the base-2 chain, and can a bridging certificate prove it?","status":"PARTIAL","verdict":"Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412)."},{"item":"D","id":"Q-doubling-bridge-0829n","text":"Can a bridging certificate carry Ghat(2s) <= 8 Ghat(s) from level s to level 2s uniformly in s, all s, on the base-2 chain?","status":"PARTIAL","verdict":"Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat("},{"item":"D","id":"Q-doubling-killrun-0830","text":"Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*?","status":"PARTIAL","verdict":"No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds th"},{"item":"0","id":"Q-derive-0904-L7-transfer","text":"Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to?","status":"PARTIAL","verdict":"No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), and the sieve-on-holes transfer is the Bruedern-Fouvry vector sieve, whose coupled uncon"},{"item":"0","id":"Q-rec-cheapest-0830","text":"At the cheapest legal point of REC(s, u0), s -> 1+sqrt(e) and u0 -> beta_2, where the saving asked over the triangle inequality is only z^{1.031}, does any of the five dead routes close, does a mixed mean-square-plus-cap strategy close, and is the failure a proof gap or a truth gap?","status":"PARTIAL","verdict":"No route closes and the failing step is yesterday's statement, so PARTIAL on the routes; but the step is located as a TRUTH gap, not a proof gap, asymptotically: the certificate's own value at a CRT-planted doubly-smooth window is cc(r) = -(A1A2 + A1B2 + B1A2) with every term a count of exit chains "},{"item":"0","id":"Q-recon-0904-sifting-limit-floor","text":"What is actually known, in the owning convention and at the page, about LOWER bounds on sifting limits at dimension kappa > 1, and is the class-blind cap at beta_2 = 4.26645 a barrier or a method artefact?","status":"PARTIAL","verdict":"Both. The corpus's [ABSENT] is wrong for lower bounds and right for extremal examples: Selberg's Lectures section 17 and Brady's 2017 Corollaries 1 and 3 ARE lower bounds on beta(kappa) at kappa > 1, invisible because Selberg's convention is the reciprocal a_k = 1/beta_kappa so his lower bounds are "},{"item":"0","id":"Q-rho-maximal-law","text":"What is the rho maximal law, what is its weakest sufficient form against the crossing, and where does it sit against print?","status":"PARTIAL","verdict":"The pricing lemma turns any RML(alpha) with alpha < beta_2 = 4.26645 into G2(z#) << z^alpha ln^2 z, every step proven except the law itself; the sufficiency curve lambda_max falls from 2.31949 at z = 13 to 1.78446 at z = 47, the weakest measured point, and whether it ever reaches zero is model-depen"},{"item":"0","id":"Q-rho-sup-z41-0830","text":"What is the exact sup over all positions of the centred sawtooth remainder at z = 41 (period 7.42e12), and of R_H at H = z^3 and z^4, and what does the eighth exact point do to the truth's slope and to the u0 = 3 form of REC(s, u0)?","status":"PARTIAL","verdict":"Not run in full; the exact z = 41 point prices at 4.8 to 5.4 h on this machine from measured per-position costs (naive 69.8, table 23.5, table-plus-windows 36.6 ns per worker; fleet 4.52 ns of wall at z = 41), above the 3.5 h rule, so what exists is a new engine (a PROVEN reflection that halves the "},{"item":"0","id":"Q-rml-proof-0829n","text":"Starting from Lemma V's PROVEN mean-square bound, what is the exact chain of implications to a two-class exponent below beta_2 = 4.26645, which single arrow is open, and does it close?","status":"PARTIAL","verdict":"The chain from the proven mean square to an exponent below beta_2 has exactly one open arrow, the mean-square-to-sup recovery REC(s,u0): sup_x \\"},{"item":"1d","id":"Q-fekete-1d-defect47","text":"Does the bounded-defect Fekete route survive a probe at 47#?","status":"PARTIAL","verdict":"The defect at 47# is ordinary and the 47# enumeration cannot move item 1d's TPC threshold whatever value it returns; the bounded-defect Fekete lemma is stated exactly and proved with every hypothesis except the candidate itself discharged, so the route reduces to one named inequality and is neither "},{"item":"1d","id":"Q-g2-falls-decision-rule","text":"Does G2(x#)/x^2 fall, and what pre-registered decision rule would settle it?","status":"PARTIAL","verdict":"The instrument is calibrated and sharp, resolving the one-class control at 11.6 sigma on the same nine points where it returns 0.9 sigma on G2, and the honest band on the slope is +/-0.117 at nine terms, so the rule is registered; but the power analysis puts separation at x = 53 only if the falling "},{"item":"1d","id":"Q-hsub-reductions","text":"Can (H-sub) be proven or refuted, and what does the fold machinery reach?","status":"PARTIAL","verdict":"Neither, but the statement is smaller: three reductions of the hypothesis are proven, the lemma consuming only power pairs so that it weakens to (H-sub-pow) with the conclusion unchanged, the fold machinery's inability to reach any of them is made exact, and the hunt over all 111 reachable pairs fou"},{"item":"X","id":"Q-xchannel-at23","text":"What is the fifth point of the X-channel statistic, at @23, and does the monotone rise hold?","status":"PARTIAL","verdict":"The fifth point is +0.2658 at @23, the rise holds at five levels and is larger than the four-point trend predicted, and the deficit has migrated into m >= 3, whose share of the X-gap runs 10.5, 23.5 and 81.1 per cent at @17, @19 and @23; the constant itself is not derived here."},{"item":"X","id":"Q-xchannel-closedform","text":"Does the zero-parameter closed form for the joint deficit survive its two blind tests at @29 and @31?","status":"PARTIAL","verdict":"1 - J = 4S2 is the only one of the three pre-registered laws left standing and it is not exact: a clean hit at @29, z = -0.90, and 4.93 sigma low at @31 where sigma_J falls to 0.000024, with the two rivals dying at 6.35 and 20.81 sigma; both blind levels agree on a stable relative offset of about ha"},{"item":"X","id":"Q-xchannel-offset","text":"What produces the ~3.8 law's -0.45% offset, and which candidate correction survives?","status":"PARTIAL","verdict":"The best available description is a finite-level correction of S3's size and sign - 1 - J = 4S2 - S3 scores z = +0.04 at @29 and -0.41 at @31 where the standing law scores -0.43 and -2.32 - but it is POST HOC; two candidate corrections and one shape are refuted on existing data, the sigma behind the"},{"item":"1","id":"Q-at43-bigint-0830","text":"Can the K-30 natal march be carried past its 2^53 ceiling to @43 exactly, and is the @43 point worth its cost?","status":"PARTIAL","verdict":"The engine side is done and VERIFIED (five paths promoted to BigInt, @7..@37 and a 0.248% slice of @41 reproduced digit for digit); the @43 point is NOT run, because the measured extrapolation is 579 h of eight cores on this machine (a 43x tile times a 2.23x per-cell cost, against the brief's ~13x),"},{"item":"8","id":"Q-comb-discrepancy","text":"Can the Comb Discrepancy Lemma's constant 2*3^k be tightened (TODO 8c)?","status":"PARTIAL","verdict":"The lemma IS the trivial per-block bound; the attained optimum is max G - min G, a computed number per level (slack 29x @23, 54x @29, growing); term-by-term pricing lifts the certified head share to about 28-29 percent, not the 50 hoped for."},{"item":"8","id":"Q-comb-tail-0830","text":"Can TODO item 8's remaining part (b), prime-comb equidistribution in the tail regime, be proven at the depths the certificate needs, or at least measured and priced at the enumerable levels (8b)?","status":"PARTIAL","verdict":"Not proven and no exponent moves: the tail defect is measured exactly for the first time (signed -0.01% of the tail main term at @23, -0.00% at @29, unsigned 0.60% and 0.25%, smaller than the head's 1.00% in aggregate but 8 to 37% per prime at its worst), the Comb Discrepancy Lemma's method fails in"},{"item":"1c (retired)","id":"Q-c2prime-drift","text":"Why does c2' drift on the 22-term ladder?","status":"PARTIAL","verdict":"Class-count-blind (attack-c2drift-01 §1); on item 1c's own band x >= 41 the ten-point rate is unresolvable: c2' 0.3745 +/- 0.1411 against c1's 0.3344 +/- 0.2358 on the same primes, a difference of 0.0401 = 0.12 of the control's ten-point window sd. Whether the drift is real is NOT closed here: attac"},{"item":"Z (retired)","id":"Q-zonegap-reduction","text":"What must be proven for Z2, what already is, and what does the proven head machinery give the zone?","status":"PARTIAL","verdict":"The Zone Restriction Lemma is proven and verified at five levels - the in-zone twin slots of T_p ARE the in-zone twin primes, so Z2(p) IS the whole-tile gap object restricted to the head window - the three-slack chain is graded honestly, the transfer inventory is listed item by item, and the deep en"}]},"row37_patch":"--- a/research/QUESTIONS.md\n+++ b/research/QUESTIONS.md\n@@ -168 +168 @@\n-| 0 | `Q-derive-0904-L7-transfer` Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to? | PARTIAL | No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), and the sieve-on-holes transfer is the Bruedern-Fouvry vector sieve, whose coupled unconditional form lands at 2(1 + sqrt e) = 5.2974 above beta2 and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap; L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only. | [derive-0904-L7-transfer.md](history/staging/derive-0904-L7-transfer.md) |\n+| 0 | `Q-derive-0904-L7-transfer` Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to? | PARTIAL | No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), hence not at every position, which is the form L7 needs; the sieve-on-holes transfer reduces to the Bruedern-Fouvry vector sieve once the hole indicator is replaced by a sieve minorant (the Ford-Halberstam substitution step of sift-limit-attack.md 7b(1b)), whose coupled unconditional price is K_BF = 5.158065 at free levels (2(1 + sqrt e) = 5.2974 only with the levels forced equal), both above beta2, and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap, so mechanism 2 is dead as a route to L7 (redteam-0904-item0.md); weighted sieves with Chen switching, GPY/Maynard-Tao and FKMPT are already closed for this object (sift-limit-attack.md 4.2-4.4); L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only. | [derive-0904-L7-transfer.md](history/staging/derive-0904-L7-transfer.md) |\n@@ -427 +427 @@\n-| `Q-derive-0904-L7-transfer` | PARTIAL | Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to? | No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), and the sieve-on-holes transfer is the Bruedern-Fouvry vector sieve, whose coupled unconditional form lands at 2(1 + sqrt e) = 5.2974 above beta2 and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap; L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only. | 0 | [derive-0904-L7-transfer.md](history/staging/derive-0904-L7-transfer.md) |\n+| `Q-derive-0904-L7-transfer` | PARTIAL | Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to? | No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), hence not at every position, which is the form L7 needs; the sieve-on-holes transfer reduces to the Bruedern-Fouvry vector sieve once the hole indicator is replaced by a sieve minorant (the Ford-Halberstam substitution step of sift-limit-attack.md 7b(1b)), whose coupled unconditional price is K_BF = 5.158065 at free levels (2(1 + sqrt e) = 5.2974 only with the levels forced equal), both above beta2, and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap, so mechanism 2 is dead as a route to L7 (redteam-0904-item0.md); weighted sieves with Chen switching, GPY/Maynard-Tao and FKMPT are already closed for this object (sift-limit-attack.md 4.2-4.4); L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only. | 0 | [derive-0904-L7-transfer.md](history/staging/derive-0904-L7-transfer.md) |\n","proposed_registry_232":"# Questions: what has been asked here, what it got, and where the record is\n\n*(GENERATED from the `` blocks at the top of the notes; never\nhand-edited. Regenerate with `node research/qc.js --index` or\n`node research/gen-questions-index.js`. The block format and the gate that\nenforces it are documented at the top of `qc/questions.js`.)*\n\n**Before proposing an attack or briefing an agent:** find the TODO item in\nsection 1, search for the actual object, then read the relevant records and\ntheir decisive dependencies. Use [OUTCOMES.md](OUTCOMES.md) for reuse and\nrevisit conditions. An item can span many unrelated attempts; loading every\nlinked note is not the required first step. Verify any conclusion that\ndetermines the next move, including an ANSWERED or CLOSED entry.\n\n**Status describes the question, not proof strength or review grade.**\nOPEN: unresolved. PARTIAL: specified parts are resolved. ANSWERED: the bounded\nquestion has an answer, which may be a negative finding, finite measurement\nor completed specification. Its underlying arithmetic target may remain OPEN.\nCLOSED: the stated premise or approach is closed at its recorded scope; this\ndoes not refute every related conjecture. SUPERSEDED: another record replaces\nthis one. Consult the owning note and linked reviews for HELD or other grades.\n\n**Multiple records:** conflicting statuses are shown as MIXED. The displayed\nverdict comes from the last record in path order, not necessarily the newest\nor most authoritative review. Read the linked records before resolving a\ndisagreement; the generator does not adjudicate it.\n\n## 1. By TODO item: what has already run under each\n\n| TODO item | question | status | verdict | records |\n|---|---|---|---|---|\n| C | `Q-agent-start` What must an incoming agent read and preserve before continuing the reviewed arithmetic campaign? | ANSWERED | Onboarding and document ownership only. The second dispatch is completed and independently reviewed on 2026-09-09. RESEARCH-EXECUTION.md owns current dispositions and candidate next obligations; RESEARCH-HANDOFF.md owns the updated exact contract. No assignment is started by that review. Twin-prime infinitude and required signed estimates remain OPEN. | [AGENT-START.md](AGENT-START.md) |\n| C | `Q-bilinear-fold-first-attack` Does assigning each Mobius factor to its first fold, or applying a direct second-moment bound, establish the missing one-sided estimate? | ANSWERED | The first-fold identity yields no saving; a direct second moment has a negligible diagonal and an open two-prime off-diagonal. Fixed-fold covariance is an exact residue-imbalance square and the beta weights balance at each fixed modulus. Growing-depth joint control remains OPEN; B>=-C2*x+o(x) is not improved. | [bilinear-fold-attack.md](bilinear-fold-attack.md) |\n| C | `Q-centered-discrepancy-estimate` Can the top of D_y be removed using ordinary prime distribution after an exact divisor flip, and what estimate remains? | PARTIAL | Equations (3)-(4), the exact split and flip, survive review and finite controls. A repair of the top-range bound T^top=O_(A,eps)(x/log^A x) is DERIVED in section 3a (2026-09-08) with the endpoint atom retained, odd square divisors, the corrected reciprocal-totient local factors with (m',g)=1, explicit truncation powers, a Cauchy multiplicity device, and a uniform Mobius mean proved from the q=1 Siegel-Walfisz statements; its inputs are the terminal-point BV of Tao Notes 3 Theorem 17 with the prefix form derived by rounding. The handler (lane V) read the derivation on 2026-09-08, reconstructed (BV*), (3a.9), (3a.14) and (3a.16), checked the limiting constant of (3a.9) numerically at eight (b,g) pairs and found no defect; it is accepted at its stated scope, with ineffective constants. The payoff is D_y=D^(e_1)+O_(A,eps)(x/log^A x) only, so the handoff consumer is equivalent to D^(e_1)>=-4x/25+o(x). The fixed-endpoint signed discrepancy, D_y>=-4x/25+o(x) and twin-prime infinitude remain OPEN. | [centered-discrepancy-estimate.md](centered-discrepancy-estimate.md) |\n| C | `Q-centered-discrepancy-measurement` At reachable x, is the OPEN sufficient input D_y>=-4x/25 numerically violated, is the absolute form (13) numerically plausible, and does D_y carry structure beyond a random-sign model? | ANSWERED | MEASURED to x=2^38. Neither pre-registered falsifier fires. D_y/x stays within 0.0043 of zero for the measured j>=26. Over 30<=j<=38, D_y/x differs from -(T1/x-C2) by at most 2e-4, with maximum 1.84401e-4 at j=30; the classical term dominates this finite comparison. The data do not establish an asymptotic fluctuation scale, an impossibility of informative future measurements, or the sufficient signed estimate. No proof status changes. | [centered-discrepancy-measurement.md](centered-discrepancy-measurement.md) |\n| C | `Q-chain-review-0906` Do the written derivations from S(x) down to E_dagger hold as stated, with every imported theorem used inside its hypotheses and every discarded term at the claimed O_H(x/log^H x) rate, and where does the chain remain unreviewed? | ANSWERED | Three independent adversarial passes found no defect in the six classical contributions from S(x) to E_>, none in the grouped moment (1)-(20) including the E_* to E_dagger step, and none in the residual-coverage link E_> to E_*, whose block-shape derivation was reconstructed and verified exactly. Every imported theorem was confirmed in its primary source except the Mobius Bombieri-Vinogradov citation, which points at an exercise sheet and needs a published replacement. Stale o(x) rates in three note bodies were replaced. A checked argument is not a refereed theorem; the OPEN signed margin is untouched. | [chain-review-0906.md](chain-review-0906.md) |\n| C | `Q-chen-fold-benchmark` Can the fold framework reproduce a classical Chen lower bound on long intervals with every imported hypothesis and error budget stated? | ANSWERED | The classical implication is derived below using three explicitly imported theorem statements, with the combinatorial minorant proved and its integral margin certified by exact rational arithmetic. This is a benchmark, not a new prime theorem, and it does not prove twins or a short-zone result. | [chen-fold-benchmark.md](chen-fold-benchmark.md) |\n| C | `Q-chen-opportunity` Does the signed Chen target identify an approachable proof mechanism, and what should the next research obligation be? | ANSWERED | The target is sufficient but subtracts an avoidable odd-composite penalty; even cancellation of its obvious signed components does not close the existing separate bounds. Select a prime-detecting weight against explicitly justified arithmetic input ranges before pursuing a new estimate. The opportunity is a research judgment, not a proved mechanism. | [chen-opportunity-audit.md](chen-opportunity-audit.md) |\n| C | `Q-chen-signed-target` What exact additional arithmetic estimate would turn the completed Chen benchmark into a proof of infinitely many twin primes? | PARTIAL | An elementary prime minorant gives a conditional twin theorem with all weights, ranges, quantifiers and errors specified. The opportunity audit identifies an avoidable negative-weight penalty and a separate-estimate budget that fails even under component cancellation; this sufficient target remains OPEN and is not the sole next proof obligation. | [chen-signed-target.md](chen-signed-target.md) |\n| C | `Q-coefficient-structure` Does the arithmetic structure of the aggregated coefficients reduce the endpoint estimate beyond the previous rectangle, and can smaller coefficient norms alone supply the remaining power saving? | ANSWERED | Exact classification gives a nonsquarefree L2 norm of size at most sqrt(D)*W^(1/4) times logarithms, while the squarefree top-band energy is at least a constant times D*W*log(W). At d~x^0.277, e~x^0.467 every endpoint sector except the squarefree-squarefree prime sum has a power saving. This reduces that rectangle to one explicit endpoint correlation; prime-dispersion.md supplies the remaining estimate and controls the full rectangle. Finite algebra, CRT sectors and archived prefixes are checked separately. | [coefficient-structure.md](coefficient-structure.md) |\n| C | `Q-cofactor-progression-transfer` Can the corrected full-cofactor kernel be estimated on a growing cofactor range by representing its actual arithmetic on CRT progressions, and does the resulting bound reach the twin consumer? | PARTIAL | Derived from named imports: for some positive absolute kappa and d, all prime-r cofactor pairs s,t <= floor((log x)^kappa), including non-squarefree inputs and mixed transition/smoothed profiles, admit a dyadic scale-average O(log^(2-d) X) bound after division by x. The extension uses bounded multiplicative Euler modifications on the progression s\\|n, t\\|n-2 and keeps its density 1/lcm(s,t), so summing cofactors costs only O((log log X)^2). This goes beyond s=t=1 but remains short of o(x). The large-cofactor joint remainder, outside residual and twin margin remain OPEN; the attempted extension to power-sized cofactors fails on source modulus range and accumulated logarithmic cost. | [cofactor-progression-transfer.md](cofactor-progression-transfer.md) |\n| C | `Q-consumer-comparison` How does the sufficient margin C_2 x + E_dagger(x) >= c_0 x/(log x)^K compare logically with the published sufficient routes to twin primes, and what does the literature already own of the corner object? | ANSWERED | The sufficient margin remains OPEN. The published conditional routes imply it where their hypotheses and stated lower bounds apply; reverse implications are not established. The dictionary is E_dagger(x)/x = C_2(2 delta_x - delta_{x/2} - 1) + o(1), with K>0 below that normalisation's resolution. Independent review corrects the comparison: cumulative and dyadic consumers on unbounded scales are equivalent at the same fixed K with possibly different positive constants. At K=0 an eventual cumulative lower bound also implies the unbounded-scale dyadic consumer. The nonnegative-weight corner identification applies only to the prime-cofactor subfamily; the full residual retains additional branches. Every surveyed route remains conditional. | [consumer-comparison.md](consumer-comparison.md) |\n| C | `Q-corner-branch-diagnostic` Can future experiments enumerate the full coefficients C(n) and C'(n-2) branch by branch, without silently dropping proper prime powers, cofactors s>1, non-squarefree inputs or either gcd branch? | ANSWERED | The driver exists and its two independent constructions of each side agree exactly on 8192 retained sides and 1802 fixture sides; five deletion and reconstruction controls are ACTIVE in both runs. Its split by gcd(n,n-2) measures integer parity, not the per-term CRT gcd partition. The fixed-eta corner is empty on the retained prefix, and Elo exceeds E0 across the entire J_x, so the matrix is a proxy window. This is finite algebra and tool preparation, with no asymptotic estimate or twin margin. | [corner-branch-diagnostic.md](corner-branch-diagnostic.md) |\n| C | `Q-corner-coefficient-energy` Can the full corner coefficients be studied before splitting their cofactor branches, and what do exact energy and classical smoothed sieve weights supply? | ANSWERED | The sharp coefficient energy is an explicit signed quadratic form in short cofactors plus O_epsilon(x^(1/2)K^2*x^epsilon), a power below x at the fixed corner. Logarithmically averaging the divisor cutoff gives Barban–Vehov weights and an O_eta(x log x) squared norm on each side and absolute shifted-product bound. The follow-up sharp-corner-transition.md gives sharp O_eta(x log^2 x) norms and proves a non-negligible norm transition for sufficiently small fixed eta. Signed transition saving and the global complement remain OPEN; no exact residual cut or twin margin changes. | [corner-coefficient-energy.md](corner-coefficient-energy.md) |\n| C | `Q-corner-correlation` On the corner S_0 where both cofactors sit just above their own cutoffs, what exactly is the remaining endpoint sum, what does the sufficient consumer need there, and does any reviewed correlation theorem supply it? | PARTIAL | The full corner is exactly sum_n C(n)C'(n-2). Proper-prime-power terms above the cutoffs are negligible at fixed eta by §1.1; the remaining prime-r terms with s>1 or s'>1 and non-squarefree inputs remain OPEN. The s=s'=1 piece has a nonnegative Mobius-product weight with exact moving cuts. The multiplicative lift and round-review sampling give small continuous and dyadic scale-average log savings for that subfamily, with no o(x), full-corner control or twin margin. The complement is still open. | [corner-correlation.md](corner-correlation.md) |\n| C | `Q-corner-log-average` What do logarithmically averaged correlation theorems and their quantitative successors actually supply for the prime-cofactor corner weight, with exact support, rates and scale quantifiers? | PARTIAL | The pure band is invariant under dilation by primes outside it; the exact cofactor window is not, but its support extends to x^(1-2eta) and need not leave the window under a fixed dilation. Uniform-prefix logarithmic bounds imply block bounds by Abel summation; a relative exponent above 3 is one sufficient route to o(x), not a universal necessary threshold. Pilatte's 1/(96e) calculation applies only to his displayed parameter choice. A bounded multiplicative Fourier lift now gives a small continuous scale-average log saving for the prime-cofactor subfamily via Tao-Teravainen v2; see prime-band-transfer.md. No o(x), dyadic pointwise estimate, full-corner estimate or positive twin margin follows. | [corner-log-average.md](corner-log-average.md) |\n| C | `Q-corner-measurement` At finite dyadic x, how large is the corner two-point correlation K(x)=sum_{x/2(x)>=c*x/log^K x on unbounded dyadic scales suffices, as does a stated logarithmically rescaled average. These implications are derived from named inputs; their endpoint hypotheses remain OPEN. The recorded uniform-gap theorem comparison has different quantifiers and does not establish an obstruction for this consumer. | [endpoint-target-audit.md](endpoint-target-audit.md) |\n| C | `Q-fixed-endpoint-discrepancy` After the accepted truncation to odd moduli e=-4x/25+o(x)? | PARTIAL | Reviewed 2026-09-09 after the coprimality repair: T_I^low=O_(A,eps')(x/log^A x), hence S=C_2x+B+O_A(x/log^A x), with B the exact Type II plus band sum (2.9). The untruncated modulus bound was false; g<=(log x)^(A+13), both tails, the coprime density and the weighted BV multiplicity now pay the estimate. Review corrects harmless log powers and the power-of-two atom over the full eps' range. D^(e_1)>=-4x/25+o(x) is equivalent to B+2C_2M>=-4x/25+o(x); it implies, but is not equivalent to, B>=-(C_2-1/200)x+o(x). The latter and H_B are sufficient OPEN margins. The absolute band statement (4.9) is one stronger sufficient input, not a necessary condition. No inspected source estimates the remaining actual signed B. Twin-prime infinitude remains OPEN. | [fixed-endpoint-discrepancy.md](fixed-endpoint-discrepancy.md) |\n| C | `Q-fold-arithmetic-bridge` Does one parity-table bridge from the anchored fold ledger yield a sufficient twin lower bound with named arithmetic inputs? | PARTIAL | Exact identities retained. The one unread sieve input of the pricing, Bombieri--Vinogradov for k-fold X^(1/u)-rough products, is derived from Wu's Lemma 2.3 (section 3a); the same input, sieved in the composite variable, gives the contamination aggregate constant 4 for each fixed k,u, replacing the displayed 12.86 to 19.72. With these inputs, elementary bounds give Q_cov(u)<1 and c*_real(u)<4 for every u>4 (section 4a, independently reviewed 2026-09-09 with rational certificates), so neither sufficient ratio test succeeds at any depth. This closes the two tests, not the decorrelation hypotheses, and supplies no twin estimate. | [fold-arithmetic-bridge.md](fold-arithmetic-bridge.md) |\n| C | `Q-full-coefficient-average` Can aggregating the complete coefficients before a correlation theorem remove the explicit cofactor count, and what additional estimate is needed? | PARTIAL | Exact factor and rounded-endpoint Fourier identities retained, with c_(i,0)=3/5 and an explicit composite-filtered weighted sum. The full family is not 1-bounded, but the sufficient phase condition admits at least k=0,+/-1 on the left and l=0,+/-1,...,+/-6 on the right for every Mellin twist; the earlier zero-only claim is corrected. Composite filtering and the required correlation rate remain unmatched. Proposition 6.5, independently reviewed including on 2026-09-09, proves coefficient norm at least (log x)^(2/5) for representations by 1-bounded functions on all smooth inputs. This does not exclude density-one representations, paid growing components or a jointly treated Fourier sum. No sufficient signed twin margin follows. | [full-coefficient-average.md](full-coefficient-average.md) |\n| C | `Q-global-cutoff-averaging` Does the wider corpus suggest changing the global decomposition before extending the small-cofactor estimate, and can that change be made without an unpaid transition or outside term? | PARTIAL | Derived: independently averaging the two initial Mobius cutoffs over fixed exponent intervals gives S=C2*x+sum G_L(n)G_R(n-2)+O_A(x/log^A x), uniformly on dyadic scales, with all cofactor and prime-power branches included. Each full G has squared norm O(x log x). The existing sharp-corner lower norm then forces cancellation between the corner coefficient and the rest at the same input. This does not estimate their shifted product. The global signed residual was already O(x) by the sieve upper bound and positivity; the new norm representation is not an improved signed bound. Prefer a bounded attempt on this global coefficient pair and a one-sided consumer; the twin margin remains OPEN. | [global-cutoff-averaging.md](global-cutoff-averaging.md) |\n| C | `Q-global-factor-signs` Which full factor configurations cause negative global products, can prime-power exceptions be paid, and does a pair-trigger upper bound control the negative part? | PARTIAL | Derived: G_i(n)=Lambda_(>W_i)(n)-F_i(s_i(n))*log t_i(n)-E_i(n), with all small-prime factors in s_i and all primes of t_i exceeding W_i. The correction is supported on a small-prime power exceeding W_i; its full shifted effect is O_epsilon(x^(39/40+epsilon)). After also paying proper prime powers, the residual is a composite-filtered signed smooth/rough cofactor sum. A ten-small-prime cell has F=-84 although every pair lies below a, refuting the proposed pair-trigger majorant. Prime filters contribute explicit terms when bounding the negative part; dropping them is an upper bound, not an identity. No scale-x signed improvement or twin margin follows. | [global-factor-signs.md](global-factor-signs.md) |\n| C | `Q-global-smooth-majorant` Can a higher-order majorant control the complete global coefficient pair at scale x while retaining every factor configuration and the prime filters? | PARTIAL | Derived using the corrected Henriot upper theorem: a C3 probability average of the same admissible initial cutoffs gives a full residual with sum \\|Ghat_L(n) Ghat_R(n-2)\\|=O(x). The three-smallest-prime majorant has bounded harmonic mass and meets the source growth class uniformly, despite not being multiplicative. All prime-power exceptions are paid. This replaces the O(x log x) absolute budget for the earlier logarithmic profile by O(x) for a different admissible profile representing the same signed residual to arbitrary logarithmic precision. The implied constant is not compared with C2 and no improved signed lower bound or twin margin is supplied. | [global-smooth-majorant.md](global-smooth-majorant.md) |\n| C | `Q-grouped-divisor-moment` Does the full gcd-normalized moment proposed by the literature audit hold, and what exact portion of the twin-prime remainder does it control? | ANSWERED | The proposed moment is derived from classical completion with all coefficient sectors and uniform twists included. Full rectangles are controlled when delta<19/25 and delta+3nu<161/100, in addition to the preceding region. A concrete extra cut d<=floor(x^(151/200)), de^3<=floor(x^(321/200)) controls the entire d~e~x^(2/5) benchmark and leaves an explicit smaller-domain endpoint remainder. The uniform product threshold stays below 19/25. At delta=8/25,nu=9/20, the next deficit is confined to small-common-divisor nonzero kernels; their required saving and the global twin margin remain OPEN. Finite validation does not prove asymptotic rates. | [grouped-divisor-moment.md](grouped-divisor-moment.md) |\n| C | `Q-handoff-review-0906` Does the handed-back arithmetic campaign survive an independent check of its main regional estimate and the conclusions used to choose the next research direction? | ANSWERED | The bounded handoff audit is completed in reports 20 and 21: the checked local reduction and regional mechanisms survive, named source statements were verified, and the consumer, corner support, rate, shrinking-margin and identity-piece overclaims were corrected. Joint Cauchy is now priced and adds no region. The multiplicative band transfer has a separate PARTIAL owner with a weaker continuous-scale payoff. Imported deep theorems remain imports; this is not corpus-wide certification or a twin margin. | [handoff-review-0906.md](handoff-review-0906.md) |\n| C | `Q-heath-brown-edges` Does the a=1 edge, and hence the corner S_0, come from the particular two-cutoff Vaughan identity in prime-detection-spec.md and shifted-prime-decomposition.md, or does an equivalent edge reappear under Heath-Brown's identity and the other standard decompositions of Lambda? | ANSWERED | The exact identities and exponent simplex leave a=1 in separately bounded formal pieces, including Heath-Brown's balanced j=K configuration. This does not prove an intrinsic edge after identity-piece cancellation. The bounded-cofactor object has affine dilations, not literally F(n)F(n-2). Linnik's fixed truncation has a large term-wise absolute tail by an elementary counting proof; its signed tail is not thereby bounded below. Heath-Brown K=3 narrows the classical split band, with coefficient and Type I normalization obligations retained. No full alternative reduction, new region or twin margin follows. | [heath-brown-edges.md](heath-brown-edges.md) |\n| C | `Q-joint-correction-source-audit` Does completing the supported prime-partner correction yield cancellation beyond the existing Vaughan reduction, and which literature inputs actually justify that completion? | ANSWERED | CHECKED prior-art matches for subset convolution, complementary sieve sums and signed smooth-number distribution. DERIVED reconstruction identifies the unrestricted factor weight with an existing short divisor approximant, up to the paid prime-power error. Its supports are x^(12/25) and x^(1/10). Reassembling the entire joint correction returns the already-open Vaughan remainder and supplies no new signed bound. A formal factor-vector control distinguishes the unrestricted logarithmic weight from the selected prime-cofactor branch. The matched general sieve theorems require inputs not supplied here. Literature novelty is unestablished; twin infinitude remains OPEN. | [joint-correction-source-audit.md](joint-correction-source-audit.md) |\n| C | `Q-joint-factor-estimate` Can an additional estimate for actual factor configurations control the full signed balance of the C3 residual? | ANSWERED | DERIVED: for the single-large-prime delta-rough family F, the residual splits exactly as R_F = C2*x*H_delta - Z_F^p + o(x), where the Type I part C2*x*H_delta is evaluated by ordinary prime BV on each cofactor interval and the twisted Mobius constant 2C2 (corrected 2026-09-08 after V2: Wu Lemma 2.3 is squarefree-only and did not cover the non-squarefree b_R moduli; prime BV covers all moduli), and Z_F^p is the signed prime-partner sum. The complement carries the opposite Type I part -C2*x*H_delta, so grouping by factor configuration transfers Type I mass and leaves the twisted prime correlation B_L unchanged. With the matched upper sieve the family bound is C2*x(1+H_delta-(40/9)H^+), certified below -2/5 C2*x: INSUFFICIENT BOUND. Even a sieve constant 2 in place of 40/9 needs H^abs<1 and leaves the complement unpaid. Independently reviewed 2026-09-09 with the uniform delta-range and complement corrections below. Twin infinitude and every sufficient margin remain OPEN. | [joint-factor-estimate.md](joint-factor-estimate.md) |\n| C | `Q-kernel-sign-control` At delta=8/25, nu=9/20, is the moment Mfrak and its small-common-divisor kernel X_small measurably smaller with the actual coefficient b_u=A_right(gu) than with \\|b_u\\| or with \\|b_u\\| times an independent seeded random sign, and does the actual/random ratio decrease with x over the feasible dyadic range? | ANSWERED | MEASURED, negative. Over seven dyadic scales j=18..30 and four boxes, the pre-registered slope of log2(actual/random) for X_small has mean + sd >= 0 in all four families, so the run gives no heuristic support for extra Mobius-sign cancellation in the small-j kernel. The actual coefficient's \\|X_small\\| ranks like one more random draw. The measurement is weak where it matters: the finite moment is 97.66-102.58 percent equal-frequency class, X_small carries 0.02-2.88 percent, J0=floor(x^(1/20)) is 1 at j=18 and 2 at j=20..30, and Z=2 collapses the prime-power sector of (13) to r=2. Equation (21) and the global twin margin remain OPEN and untouched. | [kernel-sign-control.md](kernel-sign-control.md) |\n| C | `Q-left-divisor-signs` Can the Möbius structure of the left coefficient A_left(gm) replace the first Cauchy inequality, so that its sqrt(M) loss is not paid, and what does that buy at the target box (delta,nu)=(8/25,9/20) and at the corner a=b=1? | PARTIAL | Partly, and not where it is needed. Two lemmas are derived: a Type I bound with no zero-frequency budget, usable at the target box whenever the arbitrary block is shorter than x^(1/4), and a Type II bound that is uniform in the Perron twist heights. Applied to the actual coefficient they confine the target-box deficit to sectors with left prime power r>=x^(43/200) and right prime power q>x^(3/100), and lower the worst block exponent there from 103/100 to 41/40. The corner a=b=1 is untouched: grouped, Type I, Type II, Bettin-Chandee/Wright and even a hypothetical per-block square-root bound all exceed 1 there. No region is added, E_dagger and the consumer (20) are unchanged, and the global twin margin remains OPEN. | [left-divisor-signs.md](left-divisor-signs.md) |\n| C | `Q-mobius-bv-derivation` Is there a published theorem statement of Bombieri-Vinogradov for the Mobius function at level T^(1/2)/log^B T with a maximum over coprime classes, and if not, does that estimate follow from published theorems by a derivation whose every hypothesis is checked? | ANSWERED | No published theorem statement was located in five channels searched in the owning convention named in research/SEARCH-CONVENTIONS.md; the closest is Granville-Shao's published assertion that the result is known, which carries no proof locator for the Mobius case. The estimate is derived here from four numbered results of Koukoulopoulos, GSM 203 (Corollary 13.4, Theorem 26.2, Theorem 26.6, equation (26.3)) plus Vaughan's identity for mu, with B(A)=A+6 and an ineffective constant. This is a derivation from published theorems, not a refereed theorem, and it is read from the author's preliminary version of that book. | [mobius-bv-derivation.md](mobius-bv-derivation.md) |\n| C | `Q-moving-cutoff-parity` Does a proof-level reading of the shifted-Mobius sieve give a valid, explicit error-tolerant arithmetic target, and does its divisor switching preserve the moving boundary? | ANSWERED | CHECKED prior art: Murty--Vatwani already supplies the conditional squarefree/parity mechanism and fixed-residue reduction. Its printed p. 654 swap omits n+h>ey; an exact finite counterexample verifies failure of that equality. DERIVED dyadic repair keeps the boundary and gives S=C2*x-2*C2*M+D_y+O_A(x/log^A x). A one-sided D_y>=-4*x/25+o(x) on unbounded dyadic scales is sufficient, using the certified margin C2*(1-A2)>33/200. That discrepancy estimate remains OPEN. Vatwani's recovered author preprint clarifies the one-odd-exponent cases and unfilled near-level-one hypotheses. No new signed bound is obtained; literature novelty is unestablished. | [moving-cutoff-parity.md](moving-cutoff-parity.md) |\n| C | `Q-next-correlation-source-map` Is there a primary-source statement with stronger scale or coefficient quantifiers than the ones the prime-band transfer actually consumed? | ANSWERED | Scoped negative for the inspected statements: function-class and rate mismatches remain. The coordinating review withdraws the all-scales/dyadic-omitting requirement as a necessary gate, since bounded-interval stability yields a weak dyadic scale average from the existing input. No sufficient rate or full-coefficient theorem is matched. Proper-prime-power terms are already negligible on the fixed corner; other prime-r cofactor branches remain open. | [next-correlation-source-map.md](next-correlation-source-map.md) |\n| C | `Q-next-transfer-review` Does prime-band-transfer.md (1)-(6) follow at exactly its stated scope, and does any step fail against an adversarial reading of its hypotheses? | ANSWERED | The derivation (1)-(6) survives at its stated continuous-average scope. The coordinating round review corrects check l: interval stability additionally gives a dyadic scale average, with a further exponent loss. There is no every-dyadic estimate, o(N), full-corner control or twin margin. Proper-prime-power branches have a separate negligible fixed-corner bound. | [next-transfer-review.md](next-transfer-review.md) |\n| C | `Q-paired-factor-budget` Does averaging the proposed two-small-prime loss and three-small-prime gain using existing distribution theorems make their net contribution sufficient for the current twin consumer? | ANSWERED | DERIVED from the matched classical inputs, with finite rational enclosures VERIFIED: the explicit positive family has liminf P3/(C2*x)>1, but liminf (N2-P3)/(C2*x)>11/10. Keeping only these families and the main term therefore fails at the current cutoffs. Pan--Ding supplies aggregate level x^(9/20), stronger than the earlier per-cofactor application; the complete signed margin remains OPEN. The aggregation machinery is prior art and literature novelty of this application is unestablished. | [paired-factor-budget.md](paired-factor-budget.md) |\n| C | `Q-polylog-fold-transfer` Can the fixed-fold calculation be made uniform at growing depth, and transferred to the actual bilinear remainder with an adequate error? | ANSWERED | The local bilinear model is O_H(x/log^H x) uniformly for polylogarithmic squarefree moduli. Its absolute reconstruction error is at least (1/2+o(1))*x. The needed signed reconstruction bound remains OPEN, so this model does not establish the twin-prime lower bound. | [polylog-fold-transfer.md](polylog-fold-transfer.md) |\n| C | `Q-prime-band-completion` Can the remaining squarefree correlation be localized to simpler prime and harmonic bands, and does completion then permit a direct general bilinear Kloosterman estimate? | ANSWERED | The pilot reduces, with power-saving endpoint errors, to p in (x^0.235,x^0.24], q in (x^0.045,x^0.05] and positive h in (x^0.029,T], with T=O(x^0.0342). Both primes exceed 2h eventually. Completion is exact but produces coupled h-dependent coefficients on every dual residue modulo q. Its full-frequency Kloosterman matrix has norm exactly q, so a uniform power saving by an arbitrary-coefficient operator bound is impossible at that scope. This completion alone leaves the 61/20000 budget deficit; prime-dispersion.md controls the pilot using a different second moment. No twin lower bound is established. | [prime-band-completion.md](prime-band-completion.md) |\n| C | `Q-prime-band-transfer` Can the nonmultiplicative prime-band weight be represented by bounded multiplicative functions, and what does an available quantitative correlation theorem actually give after all scale and normalization costs? | PARTIAL | A smooth Fourier superposition represents mu(n)L_B(n)/log X exactly on n<=2X+2. The quantitative non-pretentious input and a mesh give a continuous scale-average saving for the exact s=s'=1 windows. The round review additionally derives a dyadic scale-average saving by bounded-interval stability, with exponent c_*/2. Neither estimate gives an every-dyadic bound, o(N), full-corner control or a twin margin. The extension in cofactor-progression-transfer.md now estimates a growing polylogarithmic cofactor family; the full remainder remains open. Proper-prime-power branches have the separate bound in corner-correlation §1.1. | [prime-band-transfer.md](prime-band-transfer.md) |\n| C | `Q-prime-detection-inputs` Can we give a locally correct positive comparison sequence, justify the ordinary arithmetic inputs, and prove exactly what one additional estimate would buy? | ANSWERED | Yes: the comparison sequence and Type I estimates are derived, and a classical Vaughan decomposition gives S(x)=C2*x+B(x)+O_H(x/log^H x) for every fixed H. A fixed one-sided saving over B>=-C2*x+o(x) implies twins on unbounded scales. This is a fully specified classical reduction, not a new cancellation estimate or proof mechanism. | [prime-detection-spec.md](prime-detection-spec.md) |\n| C | `Q-prime-dispersion` Can a second moment retaining two right primes control the remaining localized squarefree pilot after its actual conductor and coefficient costs are included? | ANSWERED | Yes at this rectangle: aggregation in m=dp before Cauchy gives a logarithmically bounded coefficient on a long interval. The only zero-phase pairs are identical (q,h). Distinct primes give modulus e*q1*q2 with gcd loss at most O(A*Z); completion and Weil bound all off-diagonal terms. The diagonal has exponent 1989/2000 and the largest off-diagonal exponent is 1173/1250 before an arbitrarily small loss. The remaining high-frequency polynomial is O(x^(199/200)); consuming the previous reductions gives R_IJ=O_H(x/log^H x) at D=x^0.277, E=x^0.467. This is a full rectangle at product scale x^0.744, not a uniform product cutoff or a twin lower bound. | [prime-dispersion.md](prime-dispersion.md) |\n| C | `Q-prime-power-dispersion` Does the repeated-prime structure control the BB contribution beyond its two-norm bound, and can a prime-power moment include every harmonic uniformly? | ANSWERED | The decomposition leaves an exceptional coefficient with norm at most sqrt(D) times logarithms; its odd prime-power core has a derived all-harmonic dispersion bound. The same bound for first powers removes the former left-prime cutoff and unpaired diagonal constraint. Two strict inequalities control a region including d~x^0.247, e~x^0.612 at product scale x^0.859. Their product-exponent supremum is 5757/6700, not a uniform product cutoff or a twin lower bound. Exact finite checks run separately from this classical-input derivation. | [prime-power-dispersion.md](prime-power-dispersion.md) |\n| C | `Q-reachability-coverage` Which part of the original divisor domain can no improvement to the grouped moment's nonzero kernel reach, in either orientation, and what would a uniform saving on that kernel actually buy? | ANSWERED | For a prescribed fixed exponent margin eta0, the zero budgets leave S_0={p<2eta0,q<2eta0} below that required margin regardless of the nonzero-kernel saving. Uniform gamma=2 covers its complement at that prescribed margin. Smaller positive margins can reach fixed interior points of S_0; only p=q=0 remains at zero budget one for every margin. The proposed eta0~loglog x/log x substitution is not justified by estimates carrying x^epsilon losses; its box count is geometry only. The sufficient twin margin remains OPEN. Independent review F3 and F5 correct the quantifiers and the prime-power tail proof; round-review-0906 corrects the diagonal scope, fixed-margin bulk claim and six-cut separation. | [reachability-coverage.md](reachability-coverage.md) |\n| C | `Q-research-execution` How should agents use the integrated returns, avoid repeated work and select the next bounded research obligation? | ANSWERED | The second dispatch from 1285d47 closed at 46fa948 and was independently reviewed on 2026-09-09. A/A2/B/C/D/E and V/W returns are present and integrated at their owning scopes. A2's corrected Type I estimate is accepted; D's fourth residual cut is retained and its remaining moment saving corrected to 7/200. C's low nonzero modes and E's aggregate scope are corrected. No new assignment is started by this integration; next obligations are candidates, not running work. Twin-prime infinitude and every sufficient signed margin remain OPEN. | [RESEARCH-EXECUTION.md](RESEARCH-EXECUTION.md) |\n| C | `Q-research-handoff` What must an incoming research agent understand, verify and return before its work can advance the current twin-prime argument? | ANSWERED | Current handoff after the 2026-09-09 independent review of the dispatch ending at 46fa948. The full residual has four simultaneous complement conditions after D's regional estimate. A's centered truncation and A2's repaired low Type I estimate give the alternative S=C2*x+B+O_A(x/log^A x). B and all sufficient signed margins remain OPEN. The C3 absolute bound, family identities and scoped C/E failures retain their owning hypotheses. Execution is owned by RESEARCH-EXECUTION.md. | [RESEARCH-HANDOFF.md](RESEARCH-HANDOFF.md) |\n| C | `Q-research-round-validation` Which submitted results from lanes A, A2, B, C, D, E, V and W survive direct review, and what can be integrated or used to choose the next attempt? | ANSWERED | Reviewed incoming commits 07ab47f through 46fa948 on 2026-09-09. A's truncation and A2's repaired low Type I estimate are accepted with bookkeeping corrections. B's ordinary-BV family identity survives; its uniform Dickman constant and complement condition are repaired. C's norm obstruction survives on all smooth inputs, but low nonzero Fourier modes are also 1-bounded. D's block estimate and fourth residual cut survive; its next moment saving is 7/200, not 17/200. E's rough-product distribution and aggregate constant 4 are accepted at the stated Wu uniformity reading; rational certificates close the two displayed tests for every fixed u>4. W remains OCR-only at the original 1974 theorem page. All sufficient twin-prime margins remain OPEN. | [research-round-validation.md](research-round-validation.md) |\n| C | `Q-residual-coverage` What portion of the full residual is controlled with uniform margins, and can the exceptional first branch improve that coverage rather than just a regional corner? | ANSWERED | The first-branch and prime-free moments remove the exceptional norm condition. Full rectangles are controlled when delta+nu<19/25 or 5delta+2nu<123/50. Uniform twists justify exact coupled cuts: every fixed de<=x^theta with theta<19/25, and d^5*e^2<=x^lambda with lambda<123/50, as well as their union, have arbitrary fixed logarithmic savings. A concrete remaining endpoint sum has de>floor(x^(3/4)) and d^5*e^2>floor(x^(49/20)). Its twin margin is OPEN. The right zero-frequency budget, after an extra Cauchy inequality, limits the uniform product range; the left cross moment limits the other edge. Finite checks validate identities and masks, not asymptotic rates. | [residual-coverage.md](residual-coverage.md) |\n| C | `Q-review-request-0906` Which claims of the arithmetic campaign should an independent reviewer check, in what order, against which records, and what must the review return? | ANSWERED | Completed review specification at the bounded scope recorded in handoff-review-0906.md and reports 20 and 21, with the subsequent round reviewed in round-review-0906.md. The dependency list records questions at dispatch, not current unfinished assignments. Imported proofs retain their review limits and the twin margin remains OPEN. Current assignments are in RESEARCH-EXECUTION.md. | [REVIEW-REQUEST.md](REVIEW-REQUEST.md) |\n| C | `Q-round-review-0906` Which conclusions of the completed agent round survive review, and which corrections change the next research specification? | ANSWERED | The fixed-band lift and continuous moving-window estimate survive the checked source interface. Interval stability additionally gives a dyadic scale-average logarithmic saving, so the blanket scale exclusion was too strong. The rate and missing prime-cofactor terms with s>1 or s'>1 still prevent a twin margin. Proper-prime-power branches already have a negligible bound on the fixed corner. The driver computes integer parity, not the CRT gcd partition; its total coefficient identities survive. Diagonal lower-bound, reachability and six-cut bookkeeping overclaims are corrected. No region, exact residual cut or twin lower bound changes. | [round-review-0906.md](round-review-0906.md) |\n| C | `Q-sharp-corner-transition` What is the energy of the complete sharp corner coefficient, and can the smoothed estimate be transferred through a negligible L2 transition? | ANSWERED | DERIVED using named analytic inputs: for each fixed 00 both sharp squared norms and sharp-minus-smoothed squared norms are Theta_eta(x log^2 x) on the actual dyadic intervals. Thus an O_eta(x log x) sharp squared norm or negligible L2 transition fails in that range. Signed transition correlations and the global complement remain OPEN. No region, exact residual cut or twin margin changes. | [sharp-corner-transition.md](sharp-corner-transition.md) |\n| C | `Q-shifted-prime-decomposition` Does decomposing Lambda(dk-2) give a provable saving on any part of the actual shifted-prime sum, and what exact arithmetic remains outside the imported hypotheses? | ANSWERED | Both second Type I terms are O_H(x/log^H x) by classical Mobius BV. The residual is an explicit weighted sum over dk-ev=2, equivalently an average of two-linear-form Mobius correlations with growing coefficients and possibly one-point intervals. Its required one-sided improvement is OPEN. No twin lower bound or novelty is claimed. | [shifted-prime-decomposition.md](shifted-prime-decomposition.md) |\n| C | `Q-shifted-prime-mobius-sums` At reachable x, do the shifted-prime Mobius and Liouville sums, the cleanest instance of the parity input the twin reduction lacks, show any size or sign structure that a random-sign model does not, and how loose is the trivial bound on M(x) used for the centered tolerance? | ANSWERED | MEASURED to x=2^38 (10.9e9 primes). All four sums sit at random-sign size: \\|U\\|/control rms at most 2.8 at any j, slopes 0.28 to 0.65 against the control's 0.43 to 0.47 with per-draw spread 0.19 to 0.30; the pre-registered structure falsifier did not fire. M(x)/x is at most 8.8e-5 in magnitude for j>=29 against the trivial bound 0.374, so the -4x/25 tolerance in moving-cutoff-parity is loose by four orders at these scales; a proof still needs a bound on M, which is the same parity object. The squarefree density of p+2 among primes is 0.747911 at 2^38 against 2*Artin = 0.7479116. pi(2^j) matches OEIS A007053 at every j. Nothing here bears on the asymptotic conjecture. | [shifted-prime-mobius-sums.md](shifted-prime-mobius-sums.md) |\n| C | `Q-signed-divisor-grouping` Can grouping different fibers while retaining their Mobius signs control an explicit part of R, and what signed error remains after that grouping? | ANSWERED | For every fixed H>0 the actual remainder restricted to de<=x^(7/10) is O_H(x/log^H x), although each sign's mass there is at least c*x*log(x) eventually. This follows from a written classical-input derivation, with finite algebra and archived-factor checks. The remaining de>x^(7/10) contribution reduces to an explicit weighted CRT endpoint discrepancy whose required one-sided improvement is OPEN. | [signed-divisor-grouping.md](signed-divisor-grouping.md) |\n| C | `Q-signed-moment` Is there an argument for the block that does not pay sqrt(M) at the first Cauchy inequality or that extracts cancellation from the R=0 class, and what are its budgets at the corner a=b=1 and at the target box (delta,nu)=(8/25,9/20)? | PARTIAL | The true diagonal has an upper bound x^(1+o(1)) on the transition band, not a uniform nonzero lower bound. Lemma A controls only u1=u2,h1=h2; unequal proportional R=0 pairs remain outside it. Lemma B and the now-priced joint Cauchy arrangement add no region. The former general Holder floor is valid only under additional coefficient assumptions, not for arbitrary sparse coefficients. Conditional off-diagonal budgets and the random-matrix ceiling remain conditional and heuristic. No necessity of using both signs, full-corner estimate or sufficient twin margin is established. | [signed-moment.md](signed-moment.md) |\n| C | `Q-singleton-fiber-audit` Can the one-point fibers of the coupled remainder be discarded or controlled in absolute value at scale x, and what do the actual weights and archived intervals show? | ANSWERED | The grouped coefficient is zero whenever either integer is prime. Each sign's ungrouped singleton mass is at least c*x*log(x) eventually for an absolute c>0, by a written derivation from named classical inputs. Finite full-interval and archived-prefix checks validate the partition. The signed singleton and longer-fiber contributions remain OPEN; no twin lower bound or novelty is claimed. | [singleton-fiber-audit.md](singleton-fiber-audit.md) |\n| C | `Q-small-divisor-kernel` Does reciprocity separate the j<=x^(1/20) kernel of grouped-divisor-moment (21) at delta=8/25, nu=9/20, and do the Duke-Friedlander-Iwaniec / Bettin-Chandee and Kuznetsov interfaces then supply the required saving? | ANSWERED | The separation is exact and cheap: reciprocity splits index by index, the correction phase has sup norm and total variation O(A/(MN))=O(1/x) at this box, and Mellin separation of the endpoint weight costs x^epsilon with L1 mass min(1,Ax/(MN)), so the whole block reduces to a pure trilinear Kloosterman fraction with unimodular twists. The interfaces then fail by explicit amounts: Bettin-Chandee Theorem 1 gives block exponent 129/125, above the required 1 by 4/125 and above the classical 103/100; DFI (1.1) gives 1267/1200; every box Bettin-Chandee controls is already controlled, verified on 19005 rational boxes; the audit's spectral diagnostic factor is trivial for all common divisors up to x^(19/50). Closing this box inside the same interface needs the (M+N) exponent below 27/140 or the (AMN) exponent below 9/28. Target (21) and the global twin margin remain OPEN; nothing is added to the controlled region. | [small-divisor-kernel.md](small-divisor-kernel.md) |\n| C | `Q-smooth-sieve-literature` Which nearby published results should be imported instead of rediscovered, and do their methods give a more focused next question for the complete global remainder? | PARTIAL | Existing sources supply the finite-difference mechanism, one-point concentration and quadratic profile optimization; shifted divisor-sum estimates admit fixed shift two under their own support and smoothness conditions. A derived application of corrected Henriot bounds gives small-prime mass O_sigma(delta^sigma x)+O_epsilon(x^(39/40+epsilon)), uniformly in delta for fixed 0floor(x^(77/100)) as a fourth simultaneous condition of W_dagger through the Perron machinery, changing only the summation domain of E_dagger. The target box (407/400), the corner, the uniform product threshold 19/25, the sign of E_dagger and the global twin margin are unchanged; the margin remains OPEN. | [structured-dispersion-estimate.md](structured-dispersion-estimate.md) |\n| C | `Q-supported-coefficient-dickman` Can the whole supported coefficient be priced using existing literature before enumerating its factor cells, and does the resulting separate-sign sieve estimate supply a positive twin margin? | ANSWERED | DERIVED from classical inputs: at delta=1/100 the harmonic limit is H_delta=D(25/12)-1+E_delta with 0<=E_delta<=24/22!, hence -13/2, where I is the explicit ordered two-factor integral below. A three-prime left input and rough composite right input suffice; prime partners are subtracted using an upper sieve. The witness survives every fixed delta<1/50 and every averaging profile with the same plateaus. Consequently the negative-only consumer is false, and liminf Phat/(C2*x)>1/2. The signed twin margin remains OPEN; literature novelty is unestablished. | [switching-negative-mass.md](switching-negative-mass.md) |\n| C | `Q-transition-energy-review` Does the sharp-energy chain in sharp-corner-transition.md survive an adversarial check, and do the upper norm, the small-fixed-eta lower norm and the failed negligible transition each stand at their stated scope? | ANSWERED | All ten assigned rows survive at their stated scope; no counterexample or decisive contradiction was found. The upper norm, the small-fixed-eta lower norm and the refuted negligible L2 transition each stand separately. Two repairs are citation-level only: the integer Barban-Vehov input is Graham 1978 quoted by Chen An, and the note should record why the k=Q constant is absolute. The de la Breteche-Dress-Tenenbaum PDF was refetched and its SHA-256 matches the pinned hash; its (1.5) and Theorem 1.1 supply exactly the imported (3) and (4). eta_0 remains positive and unextracted, and the signed sums, E_out and the twin margin remain OPEN. | [transition-energy-review.md](transition-energy-review.md) |\n| C | `Q-transition-energy-review-spec` What independent checks are required before the sharp-energy and non-negligible-transition conclusions can guide the next signed research attempt? | ANSWERED | Bounded review assignment with explicit source, algebra, interval, error and quantifier checks; per-claim verdicts and dependency consequences are required. The assignment is specified, not executed. | [transition-energy-review-spec.md](transition-energy-review-spec.md) |\n| C | `Q-transition-joint-budget` Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | PARTIAL | The exact split, cutoff-average identities and separate upper budgets survive. Averaging cutoff norms after triangle and Cauchy is saturated for sufficiently small fixed eta, but signed cutoff arguments and joint cancellation are not closed. R_00 need not be estimated separately under every grouping. The short-window constraint is corrected with a bounded majorant and a safely reduced lower constant. No consumer input or signed improvement is supplied; E_out and the sufficient twin margin remain OPEN. | [transition-joint-budget.md](transition-joint-budget.md) |\n| C | `Q-transition-joint-budget-spec` Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | ANSWERED | Bounded assignment to audit the exact four-term decomposition, price a concrete joint treatment, and return a sufficient one-sided or common-scale inequality with all open terms explicit. The decomposition and existing norm budgets are inputs, not new findings. | [transition-joint-budget-spec.md](transition-joint-budget-spec.md) |\n| C | `Q-transition-research-execution` How should the core research handler execute and integrate the three bounded transition assignments while retaining the central signed estimate? | ANSWERED | Prepared execution contract with a fixed mathematical baseline, three independently assignable specs, handler-owned signed research, dependency checks, shared-file ownership, reporting requirements and stopping rules. Execution is complete; the corrected results are in transition-round-review.md and transition-round-audit.md. The specification itself supplies no arithmetic estimate. | [TRANSITION-RESEARCH-EXECUTION.md](TRANSITION-RESEARCH-EXECUTION.md) |\n| C | `Q-transition-round-audit` Which conclusions of the completed transition round survive direct review, which require correction, and what research decisions remain justified? | ANSWERED | The sharp upper norms and sufficiently-small-fixed-eta lower norms survive. The integration contained substantive errors: an omitted lower cutoff, an incorrect Mellin formula for the transition, a conflation of singleton divisor fibers with long cofactor fibers, an unpriced source representation and overbroad closures of joint or cutoff arguments. Owning notes and current records are corrected. No signed improvement or sufficient twin margin is established; the corrected cofactor and joint-correlation interfaces remain open. | [transition-round-audit.md](transition-round-audit.md) |\n| C | `Q-transition-round-review` What survives the executed transition round after direct review, and what combined estimate is still missing? | ANSWERED | The energy chain survives at its original scope; the integration's missing cutoff, Mellin representation, fiber identification, normalization and general closure claims are corrected. The exact cofactor and joint-cutoff formulations remain useful. No signed estimate, controlled region, exact cut or sufficient twin margin changed. Only the stated norm-only procedure and the arbitrary-factor fixed-shift relaxation are refuted at their specified scopes. | [transition-round-review.md](transition-round-review.md) |\n| C | `Q-transition-signed-estimate` Can the signed transition kernel (E1) be estimated beyond its absolute norm budget, and if not, what exact input does the consumer need? | PARTIAL | No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN. | [transition-signed-estimate.md](transition-signed-estimate.md) |\n| C | `Q-transition-source-match` Do the inspected divisor-correlation, shifted-convolution and averaged-Chowla statements directly supply a usable estimate for the exact transition kernel? | ANSWERED | No direct supplier was established among the inspected statements. The cofactor exchange and Theta identity are exact, but their scalar coefficient mass is not a full bounded-class representation for T. The transition Mellin kernel requires a sharp subtraction with a 1/s tail. Fixed-divisor singleton fibers differ from potentially long cofactor fibers. The fixed-shift arbitrary-factor relaxation is refuted; broader signed and cutoff methods remain open. | [transition-source-match.md](transition-source-match.md) |\n| C | `Q-transition-source-match-spec` What bounded source investigation could supply a usable signed estimate for the transition kernel, and how must its hypotheses and losses be priced? | ANSWERED | Specification for up to three detailed source-interface assessments, including coefficient representation, scale quantifiers, normalization, separation errors and exact downstream payoff. No new theorem match or literature-absence result is claimed. | [transition-source-match-spec.md](transition-source-match-spec.md) |\n| C | `Q-twin-reduction` What has the arithmetic campaign of 2026-09-05 and 2026-09-06 actually established about the twin sum, at what calibration, what exactly remains, and what would suffice? | ANSWERED | Consolidates the checked regional reduction S=C2*x+E_dagger+O_H(x/log^H x), its sufficient unbounded-scale margins, coefficient definitions and source dependencies. Later complete smooth and centered formulations are owned by RESEARCH-HANDOFF.md and their linked derivations. No new arithmetic estimate is supplied. Imported theorem proofs retain their stated review limits; every sufficient twin margin remains OPEN. | [TWIN-REDUCTION.md](TWIN-REDUCTION.md) |\n| 9 | `Q-applied-0828-varE` Were the Var/E red team's corrections applied to the four HELD notes? | ANSWERED | Every WEAKENED and REFUTED verdict in redteam-0828-varE.md is applied to its target note in the present tense; four ledger verdicts are rewritten, the theta=1 row is raised to PROVEN, and seven live-doc sentences plus one producer reading stay open and are drafted here. | [applied-0828-varE.md](history/staging/applied-0828-varE.md) |\n| 9 | `Q-lit-scourfield-2008` Does Scourfield, Smooth divisors of polynomials (LMS Lect. Note Ser. 352, CUP 2008, 286-311), supply the divisor-distribution estimate that varE-theta2-proof.md section 6 leaves open? | ANSWERED | DOES NOT DELIVER, at SECOND-HAND rung, and the chapter is still UNREAD at the page: ten channels were attempted, nine answered, and every one that answered is closed, degraded or paywalled, but the author's own restatement of the 2008 theorem, read at the page image of Scourfield, Funct. Approx. 55.1 (2016) 84 eq. (1.1), counts divisors m <= x of f(n) for n <= x with weight 1, for f a product of pairwise coprime irreducible factors each of degree at least 2, and the open step needs divisors n > 2L above the window, carrying a branch-dependent weight of total mass 4^omega, for the product of three LINEAR factors C(C-2)(C+2). Two gaps each independently fatal, plus a third that is AMBIGUOUS between two author-sourced statements and does not carry the verdict. One correction to lit-smooth-divisors.md is earned: the precision register of the owning convention is not uniformly (log y)^{o(1)} or order-of-magnitude, since (1.1) is an asymptotic with relative error O(1/log x), which is the right register and one epsilon short of the o(1/ln y) the open step needs. Step 1 of Var/E does NOT become conditional on a citation, and no absence may be written, since the chapter's interior lemmas were not read. | [lit-scourfield-2008.md](history/staging/lit-scourfield-2008.md) |\n| 9 | `Q-paper-iii-restructure` Is Paper III restructured around the proven model theorem? | ANSWERED | Yes. paper/variance-note.md now carries four new sections in place of its fit narrative: sec.8 the proven spectral form (Var/E = delta X, delta ln^2 W -> 16 C_2 e^{-2gamma}/3 = 1.109905, the Montgomery-Soundararajan main term exactly L prime by prime, so all of Var/E is discrepancy), sec.9 the decoupled model with Theorems 7 and 8 and Lemmas 9-11 written out with proofs and the closed form lambda_2(2) = 1 - e^{-2gamma}(9/2 - 4 ln 2) = 0.45546 plus the theta = 1 identity with Gorodetsky, sec.10 Conjecture 1 (delta(X - X_dec) -> 0) with eight exact ratios, two of three lag groups closed and the third named as a divisor-distribution statement not yet searched, and sec.11 the 0.611 refutation as a short calibration paragraph; sections 1-5 are untouched, the abstract and section 6's open question are rewritten to match, and the \"u = 2 exactly\" defect in section 7 is corrected. | [paper-iii-restructure.md](history/staging/paper-iii-restructure.md) |\n| 9 | `Q-recon-0830-smooth-aps` Does any theorem on y-friable integers in arithmetic progressions (Granville, Fouvry-Tenenbaum, Soundararajan, Harper, Drappeau, Drappeau-Granville-Shao) supply the uniform o(1) equidistribution that attack-0830-varE-identification.md section 4 leaves open, for moduli up to y^(4/5) with the lam1 weight and the squarefree restriction? | PARTIAL | NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength. | [recon-0830-smooth-aps.md](history/staging/recon-0830-smooth-aps.md) |\n| 9 | `Q-redteam-0828-varE` Does the 2026-08-28 chain from the exact comb variance to lim Var/E = Pr[GD(2) > 2] = 0.45546 survive an adversarial re-derivation, and does the refutation of the 0.611 reading hold? | ANSWERED | The constant survives at HEURISTIC and the 0.611 refutation is CONFIRMED and strengthened (the frozen out-of-sample half of the protocol also fails on the control); the correction is that TWO steps are open, not one, and that the theta=1 branch is an exact identity with a read theorem rather than a second-hand numerical match. | [redteam-0828-varE.md](history/staging/redteam-0828-varE.md) |\n| 9 | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| 9 | `Q-redteam-0830-slack` Do attack-0830-head-remainder.md, attack-0830-tail-derivation.md and verify-0830-record-defects.md survive an adversarial re-derivation on independent code, and do the five riders the verification put on live notes stand as written? | ANSWERED | Arithmetically they survive: every figure of the three notes that this pass could recompute reproduced to the printed digit on code written from the definitions, 0 assertion failures over 58 assertion call sites (most inside per-level loops), including every figure of the verification's three claims and the half-decade Delta_HL it quoted rather than recomputed. Four sentences do not survive. (1) verify-0830-record-defects.md:316, a replacement queued for head-residual-hl3.md sec.0, says the pooled value sits \"0.038 to 0.052 below the sub-window mean at all three decades\"; measured, the two lower decades run to 0.076 and 0.066, and the same note's own falsifier row says 0.038 to 0.076, so the wrong half is the one queued to land. (2) verify-0830-record-defects.md:379's un-measured \"+0.005\" residual inside the eighths is +0.0004 measured at sixteenths, so the de-pooled top-decade value is converged and the caution can be dropped. (3) the ruling that the class null is \"the matched figure\" for the tail is matched on residue class only: p'^2 is coprime to every q <= p', and the ensemble's rough-class offset is E_rc - R = 5.6714 -> 7.5357 over x = 7..29 against the class null's 5.6000 -> 6.0336, giving t/(R_shell + 7.5357) = 1.0123 against t/classNull = 1.0157. (4) attack-0830-head-remainder.md sec.3's top row is not gap-scale matched: E[g] 244.0 against 235.9, y_match capped at 19997, and on the note's own six ensemble points Delta_ens ~ E[g]^-0.312, so meas/ens reads 0.9640 not 0.9539 and the headline \"0.954 to 0.995\" reads 0.964 to 0.995. Three levels the notes recorded as out of reach are run here: the X2 group at x = 23, the tile identities and conditionals at x = 29, and the ensemble ladder at y = 29 (pipe/ens 0.9535, 40 s, against the head note's \"about fifteen minutes\"). No route opens or closes and nothing here touches Z2. | [redteam-0830-slack.md](history/staging/redteam-0830-slack.md) |\n| 9 | `Q-var41` What does the stable law predict for Var(41), and what can the tenth Var/E point pin? | OPEN | Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift. | [var41-prereg.md](history/staging/var41-prereg.md) |\n| 9 | `Q-varE-identification-0830` Can either open step behind lim Var/E = 0.45546 (the identification delta*(X - X_dec) -> 0, or the theta = 2 mean-coefficient replacement) be proven, and if not, which single inequality does not close? | PARTIAL | Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength. | [attack-0830-varE-identification.md](history/staging/attack-0830-varE-identification.md) |\n| 9 | `Q-varE-limit` Does lim Var/E on the diagonal window exist, and what is it? | PARTIAL | The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open. | [lit-dickman-variance.md](history/staging/lit-dickman-variance.md), [lit-smooth-divisors.md](history/staging/lit-smooth-divisors.md), [varE-asymptotic.md](history/staging/varE-asymptotic.md), [varE-exact-ladder-01.md](history/staging/varE-exact-ladder-01.md), [varE-limit-theorem.md](history/staging/varE-limit-theorem.md), [varE-spectral.md](history/staging/varE-spectral.md), [varE-theta2-proof.md](history/staging/varE-theta2-proof.md), [varE-theta2-step.md](history/staging/varE-theta2-step.md) |\n| 9 | `Q-verify-record-defects-0830` Do the three defect claims of 2026-08-30 (attack-0830-varE-identification.md sec.8 on the doubled X2 column; attack-0830-tail-derivation.md sec.7 on the corpus's \"R + 1/2\"; attack-0830-head-remainder.md sec.1 on the decade-pooled Delta = 0.6214) reproduce on independent code from the definitions, and which of the corrections they list apply? | ANSWERED | Claim 1 CONFIRMED: the corpus delta*X2 column is the positive half of the p \\| h-2 pattern doubled, that pattern's mirror is the p \\| h+2 pattern (W-(-h) = W+(h) exactly, W-(h) != W-(-h) at 9 to 900,679 shifts), the group sum 2X2 reads -0.5603 .. 0.1846 at x = 7..19 against 5.7147 .. 5.3266, and Xmix is overstated 2.305x at x = 19 (6.9x at x = 7); X, X1 untouched. Claim 2 AMENDED: R + 5/2 and R + 3 are exact for the tail convention (all and odd origins, asserted at x = 7..23) and t/(R + 3) = 1.0228, but head-residual-factor.md:70 is the HEAD's forward convention where R + 1/2 and R + 1 are exact, so that correction does not apply; and p'^2 is 1 mod 6, where the tail constant is 5 (t/(R + 5) = 1.0181), with the class null (1.0157) the matched figure, so 1.0228 is one unmatched convention replacing another. Claim 3 CONFIRMED as an artefact, AMENDED on mechanism and on the half-decade reading: 0.6214 pooled against 0.6592, 0.6705, 0.6736 at 2, 4, 8 sub-windows; the between-slope (Simpson) piece the note derives is half of the pooling term (0.0187 of 0.0378 at halves, 0.0261 of 0.0522 at eighths), the other half is the within slope's own fall with height weighted by Var(g); and re-reading the halves from their eighths puts HL BELOW the measurement at 5 of 6 half-decades by 2.5 to 3.4 percent at the top decade, so \"within 1.6 s.e., sign alternating\" is itself a pooled statement. | [verify-0830-record-defects.md](history/staging/verify-0830-record-defects.md) |\n| Z2 | `Q-X-upper-0829n` Can the rough-pair census X(K) on the stretch window be bounded above, unconditionally and with an explicit error term, by a dimension-2 upper-bound sieve, and how loose is the bound against exact X(K)? | PARTIAL | Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated. | [attack-0829n-X-upper.md](history/staging/attack-0829n-X-upper.md) |\n| Z2 | `Q-applied-0828-quadpoint` Were the quadpoint red team's corrections applied to the four HELD notes? | ANSWERED | Applied: the nine REFUTED and WEAKENED verdicts that target the four notes are written into them in present tense, with ledger blocks added; the tenth targets the sealed prereg, outside the fence, and is recorded in attack-quadpoint-02.md instead; three corrections owed by TODO.md Z2 and one by Z0 are listed here and are NOT applied. | [applied-0828-quadpoint.md](history/staging/applied-0828-quadpoint.md) |\n| Z2 | `Q-capture-identity` Does the transplanted cap family collapse onto a classical object, and what does the collapse say about the depth law and the wall? | ANSWERED | PROVEN, elementary: floor_K = T − X(K) on the half-open window with both members in [Q², Q′²), a convention that is load-bearing; the wall is renamed, not weakened; Σ capU counts each member against its own threshold, not against a uniform p_K, the two differing 11% to 37% at K*. | [quadpoint-identity-01.md](history/staging/quadpoint-identity-01.md) |\n| Z2 | `Q-derive-0904-r0-extension` Which pieces of the R0 decomposition (the tile form, the zone form, head, tail, Z2, and the composites R0/R1/R2/stretch) carry the parity obstruction's forbidden extension, and is any single piece both legal on the TPC-strength axis and exempt from it? | ANSWERED | No piece of R0 is both legal and exempt with content: the criterion reduces to a coordinate count (Proposition A) under which every statement forcing a twin pair into a range where roughness implies primality is covered, and the exempt residue is exactly the statements that assert no such forcing (R0's identity, lower bounds, boundary artefacts) plus the tile form, whose exemption is a property of the statement and provably does not close under deduction (Proposition B), so it survives only for routes with no sieve weight anywhere. | [derive-0904-r0-extension.md](history/staging/derive-0904-r0-extension.md) |\n| Z2 | `Q-parity-adversary` Does a parity adversary built on our own stretches survive at every level, and what precision class does a certificate need? | ANSWERED | It does NOT survive: the exact-data adversary dies at D* about Q^1.18 (MEASURED, exact arithmetic, 43 anchors Q <= 200), and the certificate that kills it is itself destroyed by 0.30 of one count per modulus, so Z2's precision class is now measured rather than described; it is PROVEN not to be a proof ingredient. | [attack-parity-adversary.md](history/staging/attack-parity-adversary.md) |\n| Z2 | `Q-parity-dstar-law-0829n` Does the exact-data parity adversary's killing level D*(Q) follow D* ~ Q^c with a stable c on the decades past Q = 200, and is c distinguishable from the independent-thinning null's? | CLOSED | No law in Q and CLOSED by the sealed kill rule (score 5 HIT, 1 MISS): MEASURED on 271 anchors 211 <= Q <= 13679, the Q-slope moves 1.446 to 1.204 to 0.575 across ranges while ln D* on ln width holds slope 1.097 +- 0.012 with a quarter of the scatter, D*/width about 0.5, and the independent-thinning null reproduces the width law within 0.025 in slope; the mechanism is that D* is where a modulus first reads a single position of the window, which is the wall survey's remainder statement in the stretch coordinate and names nothing new. | [attack-0829n-parity-dstar.md](history/staging/attack-0829n-parity-dstar.md) |\n| Z2 | `Q-quadpoint-blind-31607-0830` Does the zero-parameter depth law y*(Q), stated on the set where T(Q) >= 1 and on both the 1/(2e^gamma) = 0.280730 and the u*omega(u) = 2 (1/u* = 0.280438) forms with and without the finite-size Mertens factor, survive a sealed blind test on the bands past Q = 10007, and can that decade tell the two asymptotes apart? | ANSWERED | MEASURED, blind, and it decides nothing asymptotic: on 8363 new anchors 10009 <= Q <= 100003 the 76 sealed rows score 64 HIT and 12 MISS with every MISS on the two naked asymptotes as pre-declared, the two finite-size zero-parameter comparators HIT every row at every band (residual on ln y*/ln h -0.00022 to -0.00002 against C2), K*/pool falls 0.032 -> 0.026 -> 0.020 -> 0.016 -> 0.013 with no bend and a quiet sup, and the band means sit 0.0017 to 0.0037 below both asymptotes, six to twelve times their 0.000291 difference, so which limit the deficit tends to is set by the comparator and not by the data. | [blind-0830-quadpoint-31607.md](history/staging/blind-0830-quadpoint-31607.md) |\n| Z2 | `Q-quadpoint-c1c2-0830` Does the fourth decade's post-hoc, unsealed preference for the omega-form comparator C2 over the exact-Mertens comparator C1 (C1 above the data by 3.46 and 8.83 se at B11 and B12, C2 within 2.82 se) survive a sealed blind test at the fifth decade, Q in (100003, 316243], and what does that say about which mechanism explains the depth law's drift? | ANSWERED | MEASURED, sealed before the run and scored blind on 17702 new anchors, and it decides nothing asymptotic: the sealed D1 row HITs at both B13 and B14 (C1 above the data by 13.33 and 23.82 se, C2 within 1.26 and 1.82 se), so by the sealed rule the omega-at-finite-u crossing of import-rough-anatomy.md §2.1 is CONFIRMED over the exact-Mertens product of u2-engine-depth.md §5 as the depth law's main term at the sampling scale, while both still HIT every ±0.0015 row, the kill rows on C2 all HIT, K*/pool falls 0.013 -> 0.010 -> 0.008 with no bend, and the band means sit 0.0012 to 0.0018 below both asymptotes, so the two constants 0.280438 and 0.280730 stay unseparated by the pre-declared rule and the run separates two mechanisms, not two limits. | [blind-0830-quadpoint-c1c2.md](history/staging/blind-0830-quadpoint-c1c2.md) |\n| Z2 | `Q-quadpoint-prior-art` In the owning conventions, who holds the rough-pair census, the capture identity and the crossing law, and is any of it ours? | ANSWERED | The object and the identity are standard (the dimension-2 twin sifting function plus Buchstab's identity; ADJACENT-STANDARD, no verbatim carrier, no novelty language); only the comparison X(y) < T and the crossing law stay ABSENT-PER-CONVENTION, and the Buchstab correction is 6.6% of the top-band residual, not 2%. | [quadpoint-prior-art.md](history/staging/quadpoint-prior-art.md) |\n| Z2 | `Q-quadpoint-transplant` Does the anchored-cap family transplanted onto the stretch window S_Q certify every anchor, and what does the depth cost do with height? | ANSWERED | Pre-registration for the decade extension, committed ALONE before the segmented producer existed: it fixes the FALL trend line, the registered band readings, the kill rule and a digit-exact calibration gate that must abort before any new figure prints, and states that a falling K*/pool over two decades would still be only a measurement. | [attack-quadpoint-01.md](history/staging/attack-quadpoint-01.md), [attack-quadpoint-02.md](history/staging/attack-quadpoint-02.md), [quadpoint-decade-prereg.md](history/staging/quadpoint-decade-prereg.md) |\n| Z2 | `Q-recon-0828-rough` Does the 2000-2026 literature on y-rough numbers, sifted sets and short intervals hold any theorem that lowers Z2 or G2, meaning any control on the largest gap or the minimum count of a sifted set in EVERY short interval, or any structure of rough numbers a gap bound could use? | ANSWERED | No. Ten angles examined, ten killed for this purpose; the strongest every-interval statement in print for one-class rough numbers is Iwaniec's S(x,y,z) >= (4y/log^2 y)(log(y/z^2) - O(1)) for y >> z^2, uniform in x, giving J(P(z)) << z^2, and it is the linear sieve run exactly at its sifting limit beta_1 = 2 with no slack outside it; no two-class analogue exists in print at any exponent, the corpus's own x^4.2665 is beta_2 by the same mechanism, and every remaining branch of the field (Matomaki-Radziwill, Gorodetsky, Friedlander-Iwaniec Cor 6.28, Gafni-Tao) carries the almost-all quantifier, which a second-moment statement can never convert into a bound on one empty window. | [recon-0828-rough.md](history/staging/recon-0828-rough.md) |\n| Z2 | `Q-recon-0828-sieve` Is there anything in the 2008-2026 sieve literature, or in the parity-breaking literature, that lowers beta_2 = 4.26645 or supplies a consumer for a level theta > 1 on the two-class comb? | ANSWERED | No route. Twenty-one angles examined, nineteen dead on arrival, nothing in print beats 4.26645 at kappa = 2 at any level on four calibrated channels; the two survivors are an owning-convention row and one unresolved hypothesis in a five-page 1990 announcement whose stated requirement beta < 3 excludes beta_2 = 4.26645. | [recon-0828-sieve.md](history/staging/recon-0828-sieve.md) |\n| Z2 | `Q-redteam-0828-quadpoint` Do the four HELD quadpoint notes of 2026-08-22 survive an adversarial pass: the capture identity's proof line by line, the depth law and its asymptote, the sealed prereg scoring, and the prior-art citations at page level? | ANSWERED | The identity is PROVEN once its window convention is written down and holds at every K of 50 anchors under an independent implementation; four load-bearing sentences are wrong (section 4's gloss on Sum capU, v1 section 2's limit, the prior-art note's 2%, and the note's unconditional y* sentences), and none of the four defects opens or closes a route. | [redteam-0828-quadpoint.md](history/staging/redteam-0828-quadpoint.md) |\n| Z2 | `Q-redteam-0830-records` Do attack-0829n-parity-dstar.md (CLOSED, HELD) and attack-0830-record-mechanism.md (PARTIAL, HELD) survive an adversarial pass on independent code, does REFUTED row 95 stand as worded, and is TODO Z5's new title supported? | ANSWERED | Both notes' measurements reproduce on independent code and neither headline is refuted: D* is confirmed EXACTLY, by a BigInt rational simplex written here, at 299 of 376 anchors with 0 contradictions (the other 77 exceed the exact solver's size cap), the old range's 172-figure gate is re-derived exactly at all 43 anchors with 0 disagreements, and an independent 30-wheel sieve to 1e11 reproduces note (b)'s seven decade gap counts, CV^2 and far-tail slopes to every printed digit, with the counts also matching the published pi_2(10^k). Four sentences are wrong or over-stated and are replaced here: REFUTED row 95, note (a)'s ledger, its section 6 and TODO Z5 all attribute the null's 0.025 agreement to the WIDTH law when 0.025 is the ln Q slope difference (the width-slope difference on the same 84 matched anchors is 0.031); note (a) section 3's \"the threshold sits in a gap of at least 0.25 at every anchor\" is scoped in its own producer to the true arm and the null arm's exact gap is 0.1212; P6's HIT rests entirely on the decade-2 collapse that section 5 discounts as a sampler artefact when it discounts kill clause (a); and note (b)'s \"d b_z = 1.0806 +- 0.0014\" carries only the Monte Carlo pairing error, while moving the far-tail slope by 0.02 (against a spread of 0.0174 across six fit windows on the same decade and 0.1196 across decades) moves d b_z from 0.9888 to 1.1720, and continuing the law at slope 1 above the last resolved point still gives 0.7752. REFUTED row 95's CLOSED verdict stands on kill clause (b), which is better powered than the note presents it (paired s.e. 0.0401 against a 0.15 band), and the row needs two clauses reworded; TODO Z5's title is supported for \"measured and not derived\", and the resolved part of the law carries 72 per cent of the residual on its own with the extrapolation carrying the rest. | [redteam-0830-records.md](history/staging/redteam-0830-records.md) |\n| Z2 | `Q-redteam-0830-zone` Do attack-0829n-X-upper.md, blind-0830-quadpoint-31607.md and blind-0830-quadpoint-c1c2.md survive an adversarial re-derivation and an independent re-implementation of their producers, and at what rung does the corpus carry each of their headline claims? | ANSWERED | They survive on the numbers and mostly on the wording. On independent code every band sum, tier ratio, sealed forecast, band statistic and z of all three notes reproduces to the printed digit (X-upper 7.82 to 10.13 and the flat 378100.0; the fourth decade's 76 rows at 64 HIT and 12 MISS with the same twelve MISSes; the fifth decade's class A at both bands), and three attacks failed to break them (the paired-se attack on the D rows, a search for a fitted constant in C1, and gap-selection at the band edges). Four defects stand: the X-upper note's \"s_max 1.81 to 1.96\" is wrong in its own arrow convention, which means B3 to B8, since s_max peaks at B4 and reads 1.85 at B8; the c1c2 note's OLD R2 row at B14 is a boundary call that my 1-in-8 subsample scores the other way; the c1c2 note's custody line \"three tails, one code-sha256\" is a tautology of tailfmt.js and is not evidence of a seal; and the unscored y* check carries a Jensen bias of about +0.44 in y, which is the whole size of the C2 gap it is read as corroborating. Nothing here moves 4.2665 to 2, no rung rises, and all three notes stay HELD. | [redteam-0830-zone.md](history/staging/redteam-0830-zone.md) |\n| Z2 | `Q-redteam-0904-r0-extension` Do the seven load-bearing claims of derive-0904-r0-extension.md survive an adversarial re-derivation against Tao's own text, and do its proposed live-layer changes survive? | ANSWERED | Six of seven survive at their stated rung and one is refuted: Proposition A, the scope slip, row e'' and the equivariance transfer are CONFIRMED (the slip is strengthened, since Tao's own Example 2 is the target note's missing one-coordinate witness), Propositions B and D are WEAKENED (B's stated mechanism proves too much and its proposed insertion drops the qualifier that saves it; D's \"same trigger\" is near-definitional and its causal reading of the exponent band does not hold), and the claim that no corpus artifact certifies the window-count variance at width p'^2 is REFUTED by research/06-variance-theorem.js, which computes exactly that, brute-force verified at two levels; separately, EXEMPT throughout means \"Claim 1's H5 fails\", which is not the parity statement wall-note Face 1 is priced against, and the note's proposed live-layer text carries no H6 conditional. | [redteam-0904-r0-extension.md](history/staging/redteam-0904-r0-extension.md) |\n| Z2 | `Q-roughpair-error` How big is the empirical error of the rough-pair census, and is Z2 dead on the numbers? | PARTIAL | Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit. | [attack-roughpair-error.md](history/staging/attack-roughpair-error.md) |\n| Z2 | `Q-roughpair-null` Does the independent-thinning null named in attack-roughpair-error.md's defects list return chi2/df = 1, and is the measured sub-Poisson dispersion of the rough-pair census error real or a normalisation artefact? | ANSWERED | MEASURED, null-side, label (i), no bearing on the certificate: the independent-thinning null is binomial and returns 1 - p (0.8164 to 0.9808), not 1, so attack-roughpair-error.md's \"below 1 everywhere: sub-Poisson\" is WEAKENED and the registered F1 fires at u = 5; the deficit against the mean-matched null survives at pooled z = -5.87, -7.09, -11.39; and a CRT-exact null that only makes each prime's kill count exact in the window predicts 0.33 to 0.56, which the measured value EXCEEDS by 1.26 to 1.40, so D8 is interval-level in form, elementary in content, and not wall-relevant. | [measure-roughpair-null-0829.md](history/staging/measure-roughpair-null-0829.md) |\n| Z4 | `Q-applied-0828-census` Were the census red team's corrections applied to the three HELD notes? | ANSWERED | Every WEAKENED and REFUTED verdict in redteam-0828-census.md is applied to its target note in the present tense; two producer defects and four live-doc corrections stay open and are listed here. | [applied-0828-census.md](history/staging/applied-0828-census.md) |\n| Z4 | `Q-applied-0828-head` Were the head red team's corrections applied to the three HELD notes? | ANSWERED | Applied. Every WEAKENED and REFUTED row of redteam-0828-head.md lands in the note it targets as 42 prose edits, and all three ledger verdict lines now carry the surviving chain; four corrections fall outside the fence and are owed elsewhere, the load-bearing one being destroyer-census-01 §6(b)'s R and its h/R = 1.09 -> 1.03. | [applied-0828-head.md](history/staging/applied-0828-head.md) |\n| Z4 | `Q-applied-0828-live` Which engine and head red-team corrections reached the live layer? | ANSWERED | Nineteen edits across four documents: the glossary's cap_K dimension count with its mandatory sifted-versus-assumed clause plus three new entries (twin opener, head, tail); the survey's one-class density factor, S1's restored pi(q-1) terms and r in N_x hypothesis, the dropped Chen absorption, Theorem C with its emptiness, dimension 1 for q_i < q, the comb-conditioning qualifier and the inverted shallow-band bullet; the certificate engine's equidistribution status cell, the q = T^{o(1)} second hypothesis and the Comb Discrepancy scope cell; and the census's R as the continuum functional with its three comparators; paper/staircase-note.md, TODO.md and QUESTIONS.md are owed and untouched. | [applied-0828-live.md](history/staging/applied-0828-live.md) |\n| Z4 | `Q-destroyer-census` Who destroys each channel pair, what does the zone kill budget certify, and where does the counting certificate die? | ANSWERED | The census reproduces digit-exactly on an independent engine; the destroyer rule is positional, not temporal, the certificate holds at 15 zones and dies at p = 67 where B/C first crosses 1, and no first-mover excess survives the derived null. | [destroyer-census-01.md](history/staging/destroyer-census-01.md) |\n| Z4 | `Q-head-remainder-0830` Does the 5.3 percent remainder that Hardy-Littlewood leaves in the head's endpoint deficit Delta = 2 - beta derive by a route that is not HL: the frozen-sieve first-survivor object, a level-of-distribution correction, or the exact tile-ensemble head? | PARTIAL | No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2. | [attack-0830-head-remainder.md](history/staging/attack-0830-head-remainder.md) |\n| Z4 | `Q-head-residual` What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive? | PARTIAL | h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63. | [head-residual-factor.md](history/staging/head-residual-factor.md), [head-residual-hl3.md](history/staging/head-residual-hl3.md), [head-residual-null.md](history/staging/head-residual-null.md) |\n| Z4 | `Q-redteam-0828-census` Do destroyer-census-01.md, stretch-01.md and records-placement-01.md survive an independent re-derivation of every load-bearing claim, and may they leave HELD? | ANSWERED | All three survive on arithmetic, every decisive number reproducing exactly on an independent engine; one sealed reading (records READ-3) is REFUTED as vacuous and four sentences need correcting before integration. | [redteam-0828-census.md](history/staging/redteam-0828-census.md) |\n| Z4 | `Q-redteam-0828-head` Do the three 2026-08-28 head-residual notes survive an adversarial re-derivation of every load-bearing claim on independent code? | ANSWERED | Mostly yes on the numbers and no on two framings: \"h/R -> 1 iff beta CV^2 -> 2\" is REFUTED (the limit needs only boundedness, the product controls the RATE), and 9 to 59 percent of the quoted h - R is the choice of comparator, since R is the continuum functional and a discrete uniform origin sees R + 1/2 exactly. | [redteam-0828-head.md](history/staging/redteam-0828-head.md) |\n| Z4 | `Q-redteam-0830-slack` Do attack-0830-head-remainder.md, attack-0830-tail-derivation.md and verify-0830-record-defects.md survive an adversarial re-derivation on independent code, and do the five riders the verification put on live notes stand as written? | ANSWERED | Arithmetically they survive: every figure of the three notes that this pass could recompute reproduced to the printed digit on code written from the definitions, 0 assertion failures over 58 assertion call sites (most inside per-level loops), including every figure of the verification's three claims and the half-decade Delta_HL it quoted rather than recomputed. Four sentences do not survive. (1) verify-0830-record-defects.md:316, a replacement queued for head-residual-hl3.md sec.0, says the pooled value sits \"0.038 to 0.052 below the sub-window mean at all three decades\"; measured, the two lower decades run to 0.076 and 0.066, and the same note's own falsifier row says 0.038 to 0.076, so the wrong half is the one queued to land. (2) verify-0830-record-defects.md:379's un-measured \"+0.005\" residual inside the eighths is +0.0004 measured at sixteenths, so the de-pooled top-decade value is converged and the caution can be dropped. (3) the ruling that the class null is \"the matched figure\" for the tail is matched on residue class only: p'^2 is coprime to every q <= p', and the ensemble's rough-class offset is E_rc - R = 5.6714 -> 7.5357 over x = 7..29 against the class null's 5.6000 -> 6.0336, giving t/(R_shell + 7.5357) = 1.0123 against t/classNull = 1.0157. (4) attack-0830-head-remainder.md sec.3's top row is not gap-scale matched: E[g] 244.0 against 235.9, y_match capped at 19997, and on the note's own six ensemble points Delta_ens ~ E[g]^-0.312, so meas/ens reads 0.9640 not 0.9539 and the headline \"0.954 to 0.995\" reads 0.964 to 0.995. Three levels the notes recorded as out of reach are run here: the X2 group at x = 23, the tile identities and conditionals at x = 29, and the ensemble ladder at y = 29 (pipe/ens 0.9535, 40 s, against the head note's \"about fifteen minutes\"). No route opens or closes and nothing here touches Z2. | [redteam-0830-slack.md](history/staging/redteam-0830-slack.md) |\n| Z4 | `Q-tail-derivation-0830` Does the tail's measured law c = 0.7522 ln^2(p'^2) and its surplus derive, and which part of the coefficient is the tile's own (no prime input) against which part needs Hardy-Littlewood? | PARTIAL | PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3. | [attack-0830-tail-derivation.md](history/staging/attack-0830-tail-derivation.md) |\n| Z4 | `Q-verify-record-defects-0830` Do the three defect claims of 2026-08-30 (attack-0830-varE-identification.md sec.8 on the doubled X2 column; attack-0830-tail-derivation.md sec.7 on the corpus's \"R + 1/2\"; attack-0830-head-remainder.md sec.1 on the decade-pooled Delta = 0.6214) reproduce on independent code from the definitions, and which of the corrections they list apply? | ANSWERED | Claim 1 CONFIRMED: the corpus delta*X2 column is the positive half of the p \\| h-2 pattern doubled, that pattern's mirror is the p \\| h+2 pattern (W-(-h) = W+(h) exactly, W-(h) != W-(-h) at 9 to 900,679 shifts), the group sum 2X2 reads -0.5603 .. 0.1846 at x = 7..19 against 5.7147 .. 5.3266, and Xmix is overstated 2.305x at x = 19 (6.9x at x = 7); X, X1 untouched. Claim 2 AMENDED: R + 5/2 and R + 3 are exact for the tail convention (all and odd origins, asserted at x = 7..23) and t/(R + 3) = 1.0228, but head-residual-factor.md:70 is the HEAD's forward convention where R + 1/2 and R + 1 are exact, so that correction does not apply; and p'^2 is 1 mod 6, where the tail constant is 5 (t/(R + 5) = 1.0181), with the class null (1.0157) the matched figure, so 1.0228 is one unmatched convention replacing another. Claim 3 CONFIRMED as an artefact, AMENDED on mechanism and on the half-decade reading: 0.6214 pooled against 0.6592, 0.6705, 0.6736 at 2, 4, 8 sub-windows; the between-slope (Simpson) piece the note derives is half of the pooling term (0.0187 of 0.0378 at halves, 0.0261 of 0.0522 at eighths), the other half is the within slope's own fall with height weighted by Var(g); and re-reading the halves from their eighths puts HL BELOW the measurement at 5 of 6 half-decades by 2.5 to 3.4 percent at the top decade, so \"within 1.6 s.e., sign alternating\" is itself a pooled statement. | [verify-0830-record-defects.md](history/staging/verify-0830-record-defects.md) |\n| Z4 | `Q-zone-tail` What is the tail field of the zone (p, p'^2) - its law against ln^2, its worst case, its share of the R0 width, and is it the frozen-sieve last survivor below p'^2 at the rate the head is the frozen sqrt(p)-level first survivor above p? | PARTIAL | The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after. | [zone-tail-01.md](history/staging/zone-tail-01.md) |\n| Z4 | `Q-zone-tail-02` On the full zonegap-01 range to 1e11, what is the per-zone tail law in both units, is the renewal surplus t/R real at 27,292 zones, and do the head and the tail of a zone have a joint law? | ANSWERED | Resolved DOWN and nothing is derived: zone-tail-01's unresolved t/R = 1.0619 at 782 zones reads 1.0298 on a height-matched comparator at 17,700 zones (bootstrap [1.0156, 1.0443], excluding 1) and 1.0157 against the exactly matched discrete class null (bootstrap [1.0013, 1.0308], clearing 1 by 0.0013), so part of the original figure was the comparator and the pre-registered rule returns MATCH by two parts in ten thousand; c_local = 0.7522 at the top band with bootstrap [0.7410, 0.7630] now CONTAINING HL's 0.7574 and the band drift inside the registered 0.03 per step for the first time but still non-monotone (0.7518, 0.7664, 0.7416, 0.7522), so no convergence is measured; global worst tail/ln^2(p'^2) = 6.840 at p = 15107 with max/mean no longer flat (4.40, 5.36, 8.59, 8.43); Q5 is answered in the negative, head and tail showing no dependence at 27,292 zones (detrended r = -0.0009 against null s.e. 0.0061, permutation p = 0.8920, variance ratio 0.9990, no KS rejection, no chi-square near threshold), so the R0 pieces are a product structure to first and second moments and in the sum's whole law while independence is NOT proven and the simultaneous-extremes regime is untouched; a candidate rough-origin mechanism for the surplus is HEURISTIC and does not fit the head's own excess band by band; the head field's effective sample size is measured at 1,910 distinct a_first among 17,700 top-band zones, so this note's own head interval is priced over draws the field does not hold, a cluster bootstrap over distinct a_first (producer SEC I(a), seed 613009117) measuring the inflation at 4.10 rather than the 3.04 the redundancy alone implies and moving the top-band interval to [0.6848, 0.7692], still inside the registered [0.68, 0.78] (correction originating with redteam-0829-measure-b.md section 1c C15); the scope of that defect is that one interval and not the corpus, since destroyer-census-01.md publishes no bootstrap, head-residual-factor.js bootstraps over gaps, zonegap-01.js has none and zone-tail-01.js bootstraps only tail quantities; ten of ten predictions hit, which is a criticism of the pre-registration; and the R0 shares read 1.40% / 92.80% / 5.81% with the tail's share still falling, so Z2 is more of the obstruction after this pass than before it. | [zone-tail-02-0829.md](history/staging/zone-tail-02-0829.md) |\n| Z5 | `Q-applied-0828-litimports` Were the lit/imports red team's corrections applied to the six HELD notes? | ANSWERED | Applied, 64 substantive edits across the six notes: the Saffari-Vaughan range exponent is 6/11 in both import notes, the fixed-M THEOREM in import-fracparts is struck and the cap-36 MEASURED to PROVEN upgrade withdrawn, row 15 loses its theorem column and row 16 is regraded stale, and the six weakened sentences in the four literature notes now read as the audit requires; four claims are declined with reasons, and nine live documents plus two fenced staging notes are recorded here as owing corrections that this pass did not apply. | [applied-0828-litimports.md](history/staging/applied-0828-litimports.md) |\n| Z5 | `Q-applied-0828-registries` Which lit/imports corrections reached the registries? | ANSWERED | 13 edits across six files, plus one appended changelog section: IMPORT-MAP gains rows 15 (no THEOREM, the column struck), 16 (STALE) and 17 (CLOSURE, two-sided) with its three counts recounted to seventeen rows; SEARCH-CONVENTIONS gains the Kourbatov-b, generalized-Dickman and VC-of-multiples rows with each channel's calibration state; import-map-construction's determinantal cell, natal-cap-36's separate-census sentence, one REFUTED row and one PRIOR-ART block are corrected; GLOSSARY, TODO, QUESTIONS, the five loose hyperuniformity documents and two staging notes are left for their holders and listed here. | [applied-0828-registries.md](history/staging/applied-0828-registries.md) |\n| Z5 | `Q-record-deficit` Does the 6.0 percent record-location deficit survive the corrected null, and what is it? | MIXED (lit-kourbatov-shortfall.md: ANSWERED; record-location-null.md: PARTIAL) | Survives (z = -3.3, five window cuts); Z5's premises on 'location' and on n_eff were wrong; corrected-null formula in §4. | [lit-kourbatov-shortfall.md](history/staging/lit-kourbatov-shortfall.md), [record-location-null.md](history/staging/record-location-null.md) |\n| Z5 | `Q-record-mechanism-0830` Which of three candidate mechanisms (sub-Poisson gap dispersion, the tile's exact gap law, Kourbatov's k = 1 conspiracy heuristic transported to k = 2) carries the residual 0.78 to 0.97 of Kourbatov's b, at what derived size, and what fraction of b is left? | PARTIAL | The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier. | [attack-0830-record-mechanism.md](history/staging/attack-0830-record-mechanism.md) |\n| Z5 | `Q-record-null2` How much of Kourbatov's shortfall coefficient b does an inhomogeneous-intensity record null carry, how much does a 6Z-latticed null carry, and what is the residual? | ANSWERED | The inhomogeneous null carries essentially none of b (d b_z = -0.0012 +- 0.0001, MEASURED); the 6Z lattice's share is LAW-DEPENDENT, +0.1113 +- 0.0003 under the memoryless rounding-up law against -0.0060 +- 0.0003 under rounding to nearest, so the null side is a bracket of 16.1 to 25.1 percent of b and three quarters or more stays a residual with no mechanism; record-location-null.md section 8's argued 1.7e-4 lattice bound is wrong but no single number replaces it; the 15 percent estimator disagreement is pinned as an exact weighting identity; and the shape assumption behind every b reading is measured at 1.6 sigma and stays open. | [measure-record-null2-0829.md](history/staging/measure-record-null2-0829.md) |\n| Z5 | `Q-redteam-0828-litimports` Do the six notes of 2026-08-28 survive an adversarial pass, and which of their load-bearing claims are wrong? | ANSWERED | Every measured number reproduces on independent code; Saffari-Vaughan Theorem 10's range exponent is 6/11 not 1/11, which voids import-fracparts's one banked THEOREM at fixed M and corrects row 15 twice; four further weakenings, one refuted verdict line, no note refuted whole. | [redteam-0828-litimports.md](history/staging/redteam-0828-litimports.md) |\n| Z5 | `Q-redteam-0830-records` Do attack-0829n-parity-dstar.md (CLOSED, HELD) and attack-0830-record-mechanism.md (PARTIAL, HELD) survive an adversarial pass on independent code, does REFUTED row 95 stand as worded, and is TODO Z5's new title supported? | ANSWERED | Both notes' measurements reproduce on independent code and neither headline is refuted: D* is confirmed EXACTLY, by a BigInt rational simplex written here, at 299 of 376 anchors with 0 contradictions (the other 77 exceed the exact solver's size cap), the old range's 172-figure gate is re-derived exactly at all 43 anchors with 0 disagreements, and an independent 30-wheel sieve to 1e11 reproduces note (b)'s seven decade gap counts, CV^2 and far-tail slopes to every printed digit, with the counts also matching the published pi_2(10^k). Four sentences are wrong or over-stated and are replaced here: REFUTED row 95, note (a)'s ledger, its section 6 and TODO Z5 all attribute the null's 0.025 agreement to the WIDTH law when 0.025 is the ln Q slope difference (the width-slope difference on the same 84 matched anchors is 0.031); note (a) section 3's \"the threshold sits in a gap of at least 0.25 at every anchor\" is scoped in its own producer to the true arm and the null arm's exact gap is 0.1212; P6's HIT rests entirely on the decade-2 collapse that section 5 discounts as a sampler artefact when it discounts kill clause (a); and note (b)'s \"d b_z = 1.0806 +- 0.0014\" carries only the Monte Carlo pairing error, while moving the far-tail slope by 0.02 (against a spread of 0.0174 across six fit windows on the same decade and 0.1196 across decades) moves d b_z from 0.9888 to 1.1720, and continuing the law at slope 1 above the last resolved point still gives 0.7752. REFUTED row 95's CLOSED verdict stands on kill clause (b), which is better powered than the note presents it (paired s.e. 0.0401 against a 0.15 band), and the row needs two clauses reworded; TODO Z5's title is supported for \"measured and not derived\", and the resolved part of the law carries 72 per cent of the residual on its own with the extrapolation carrying the rest. | [redteam-0830-records.md](history/staging/redteam-0830-records.md) |\n| D | `Q-doubling-C2` Does the doubling inequality hold on the base-2 chain, and can a bridging certificate prove it? | PARTIAL | Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412). | [attack-doubling-01.md](history/staging/attack-doubling-01.md) |\n| D | `Q-doubling-bridge-0829n` Can a bridging certificate carry Ghat(2s) <= 8 Ghat(s) from level s to level 2s uniformly in s, all s, on the base-2 chain? | PARTIAL | Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched. | [attack-0829n-doubling-bridge.md](history/staging/attack-0829n-doubling-bridge.md) |\n| D | `Q-doubling-killrun-0830` Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | PARTIAL | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN. | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n| D | `Q-kstar-prereg` What is K* at the three next doubling steps, predicted before any period walk? | OPEN | Pre-registration only, committed alone: the predictions, the scoring rule and the growth-type verdict thresholds are fixed in advance, with the inclusion-exclusion engine validated against an independent scan engine on all eleven known steps first. | [attack-kstar-01-prereg.md](history/staging/attack-kstar-01-prereg.md) |\n| D | `Q-recon-0830-rec-killrun` Does the literature hold, in its own conventions, a theorem whose hypotheses REC(s, u0) (the sup-versus-rms recovery of the level-D signed remainder over all positions, attack-0829n-rml-proof.md section 3) or the weighted kill-run K*(s) (the longest run of level-s slots the primes in (s, 2s] can kill, attack-0829n-doubling-bridge.md sections 0 and 3) satisfies as stated, or a Maier-type theorem that makes REC false for two-class sifted sets at some u0 below beta_2? | ANSWERED | No theorem applies to either object as stated, on four calibrated channels searched in the owning conventions; every neighbour is graded NEAREST with its unmet hypothesis named, and neither object is on any refuted row. On the Maier question the answer is negative for REC as stated (the Maier family bounds the COUNT, i.e. the full-level remainder, never a level-D truncation) but carries one calibration: at one class and full level the REC-shaped inequality is FALSE asymptotically, by Buchstab's origin ratio against the Montgomery-Vaughan full-period variance ceiling, and the embedded arithmetic puts the level where that falsity first shows at log10 z between 16 and 141 depending on u0 and epsilon, so a finite-z margin of the kind the corpus measures cannot see a failure of this type; at two classes the same full-level statement is HL-conditional at u0 = 2 and unlocated in print at any u0. No exponent moved. | [recon-0830-rec-killrun.md](history/staging/recon-0830-rec-killrun.md) |\n| D | `Q-redteam-0830-doubling` Do attack-0829n-doubling-bridge.md and attack-0830-doubling-killrun.md survive an adversarial re-derivation on an engine sharing nothing with their producers, and do REFUTED rows 94 and 98 stand as worded? | ANSWERED | The mathematics survives: the maxsum certificate Ghat(2s) <= maxsum_{K*+1}(T_s) and the product composition K*+1 <= prod(1+L_j) are each re-derived here and hold, the second at 21,641,346 nesting links over 6,012,804 killed runs with zero failures including the zero-kill fold, and every quoted figure reproduces digit for digit on a fresh engine (K*(16) = 17; G2(31#) = 348 @ 8813641451 x4 from both base tiles; sup msc 6.6364; the diagonal cells; the 2^N ratios 1.226/1.481/41.348). Row 94 STANDS and is if anything under-claimed, but its attribution is wrong in one direction: Lemma 1 at s = 128 alone clears the whole band, so the s = 16 walk corroborates rather than carries it. One statement is falsified: the bridge note's NOT-REACHED line puts 19#->37# out of reach, but column-major it returns here, reproducing the ladder row x = 37 and adding a FIFTEENTH step at s = 19, 20 (K* = 13, N = 4, C2 3.5200, certificate 3.8000), so the enumerable range ends at s = 20, not s = 18. Row 98 STANDS on its mathematics and is WEAKENED on one clause: \"the truth sits under it everywhere (sup w/a = 0.8295)\" attaches the CERTIFICATE's ratio to the word truth; the truth's sup is 0.6591. | [redteam-0830-doubling.md](history/staging/redteam-0830-doubling.md) |\n| D | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| 0 | `Q-applied-0828-closures` Were the closures red team's corrections applied to the five HELD notes? | ANSWERED | Applied. 47 prose corrections across the five notes; c2prime-refit-22 drops from CLOSED to PARTIAL and three ledger verdicts are rewritten; four producer READINGS blocks and eleven live-document lines carry the same defects and are listed here uncorrected, behind the fence. | [applied-0828-closures.md](history/staging/applied-0828-closures.md) |\n| 0 | `Q-barrier-kappa2` Does Granville's exceptional-character construction, which makes the Jurkat-Richert f and F attained by interval sieving problems at kappa = 1, transfer to kappa = 2 and supply the missing barrier on wall-note Face 4, so that no class-blind argument can beat beta_2 = 4.26645 on intervals? | CLOSED | No. Verdict (b): the transfer runs, fixes the axiom obstruction that sift-limit-attack.md section 2 blamed for the mixed-sign sketch's death, and then hits a hard ceiling at u = 2, because the character's only gift is the one-point identity lambda = chi on z-rough integers and a sign pattern with a +1 coordinate is empty exactly when z^2 >= x; above u = 2 the surviving question is the shifted intersection of two positive-density lambda-classes, which is Chowla-strength, so the section 2 verdict stands with a corrected reason; the band (2, 4.26645] is untouched, and the hypothesis itself implies the target by Heath-Brown 1983. | [attack-barrier-kappa2.md](history/staging/attack-barrier-kappa2.md) |\n| 0 | `Q-derive-0904-L7-transfer` Is the legal open-set target L7, G2(x#) << g(x#) (ln x)^A for a fixed A (which would give exponent 2 + o(1) from Iwaniec's one-class bound, below beta2 and above the TPC line), reachable by a TRANSFER from the one-class Jacobsthal bound, and if not, what does each transfer mechanism reduce to? | PARTIAL | No transfer mechanism in the corpus reaches L7, DERIVED: the union-bound transfer is vacuous already in the period average from x = 11 (the exact CRT budget sum of 1/(p - 1) over 3 <= p <= x passes 1 at x = 11), hence not at every position, which is the form L7 needs; the sieve-on-holes transfer reduces to the Bruedern-Fouvry vector sieve once the hole indicator is replaced by a sieve minorant (the Ford-Halberstam substitution step of sift-limit-attack.md 7b(1b)), whose coupled unconditional price is K_BF = 5.158065 at free levels (2(1 + sqrt e) = 5.2974 only with the levels forced equal), both above beta2, and whose decoupled form needs the sup-over-positions remainder law that item 0 ruled a truth gap, so mechanism 2 is dead as a route to L7 (redteam-0904-item0.md); weighted sieves with Chen switching, GPY/Maynard-Tao and FKMPT are already closed for this object (sift-limit-attack.md 4.2-4.4); L7 stays a legal OPEN statement with no mechanism, and the conjectural A = 1 is truth-side evidence only. | [derive-0904-L7-transfer.md](history/staging/derive-0904-L7-transfer.md) |\n| 0 | `Q-g2-provenance-x37` Does the headline G2 exponent depend on the eight terms this repository has never reproduced, and does any instrument without G2(37#) inside it flag x = 37? | ANSWERED | MEASURED, both largely negative: the custody-only refit lands at 1.533 against the headline 1.498 and no provenance-block drop moves the corrected central by more than 0.035 (Ghat(64) alone moves it 0.002), while no G2-free instrument flags 37 in the high direction, the one \\|z\\| past 2 being h(37#) at -2.20 in the low direction and range-dependent; the blind extreme-value forecast of G2(37#) does overshoot at z = +6.58, unexplained. | [measure-g2-provenance-0829.md](history/staging/measure-g2-provenance-0829.md) |\n| 0 | `Q-gap-spectrum` What is the full gap-length distribution of twin slots over one period of the tile, what does the excess functional \\|B_N\\| = sum_{g>N}(g-N) read on an x^s grid, and where does the empirical minimum window count leave zero? | ANSWERED | The distribution is exact at nine levels to x = 31 and the pre-registered renewal null FAILS in the light direction at every one: the tail is uniformly steeper than exponential (body slope -1.3302 against -1), no power law survives (the power-law slope moves by a factor 17), the maximum is 2.087 to 2.241 BELOW the renewal maximum, and \\|B_N\\| sits at 0.0245 to 0.7436 of the null and is exactly zero at s = 1.75 where the null predicts 6.5262e+5 empty windows; so no heavy-tail mechanism for a super-linear G2 exponent exists at any computable level, the identity G2 <= N + \\|B_N\\| is proven but degenerates to G2 <= N on this grid, and the sifting onset is flat at 1.63 to 1.70 against a sieve bound f2 that is zero everywhere the grid reaches. | [gap-spectrum-01.md](history/staging/gap-spectrum-01.md) |\n| 0 | `Q-lit-siebert` Is Siebert's 1983 result stated for general sieve dimension kappa, or for kappa = 1 only, and does it therefore already contain the kappa = 2 extremal example that SEARCH-CONVENTIONS section 3 records as not found? | ANSWERED | kappa = 1 ONLY, on three independent statements of the theorem (the chapter's own publisher abstract, Granville 2020 section 1, Friedlander-Iwaniec 2022 page 20), all naming the LINEAR sieve and the Jurkat-Richert f and F; the chapter's full text was NOT reached, so this is testimony not primary reading, and the SEARCH-CONVENTIONS section 3 \"no published kappa = 2 extremal example\" row needs no correction. | [lit-siebert-1983.md](history/staging/lit-siebert-1983.md) |\n| 0 | `Q-maximal-law-tpc` Is the SIEVE Gaussian maximal law TPC-implying? | ANSWERED | YES in the only form that would deliver anything: stated for the operative remainder R_H, need/z^2 runs 0.49 to 0.61, flat and below the zone budget at every z from 13 to 43, which is the Gap Reformulation, hence the Zone Postulate, hence TPC, so no soft argument can prove it; the published above-2 theta column is not the maximal law's verdict but the law plus two lossy steps. | [phase1-T4-maximal-law.md](history/staging/phase1-T4-maximal-law.md) |\n| 0 | `Q-measure-g2-generic` Where does G2(x#) sit in the distribution of the same maximum gap taken over other two-class configurations with the same census, and is the constant-shift family generic inside the free-pair family? | ANSWERED | G2 is GENERIC in this coordinate on the registered rule, MEASURED: the midrank percentile of G2 in the census-matched two-class ensemble reads 20.00, 18.06, 26.35, 17.14 exhaustively at x = 11..19 and 13.70 sampled at x = 23, all inside the registered [5, 95] band so the falsifier does not fire, while sitting about one ensemble sd below the mean at all five levels; and the free-pair and constant-shift ensembles are PROVEN identical up to translation, so killer 1 gains no target in the class positions at these levels. | [measure-g2-generic-0829.md](history/staging/measure-g2-generic-0829.md) |\n| 0 | `Q-omega-floor-blind-0830` Does the local log-slope of the pointwise floor Omega(z) of attack-0830-rec-cheapest.md (exact to z = 73, certified 2+4-chain family to z = 5e5), extended blind to new levels under a sealed forecast, behave as the DERIVED growth law Omega >> z^{16s/9}/ln^8 z predicts at s = 2.698721, and at what z would the test be decisive? | ANSWERED | MEASURED, blind, on the derived law only: 18 of 22 sealed rows HIT; the certified 2+4-chain family at p* = (47, 43) runs 5e5 -> 1e9 (A1A2 = 8.863e17 -> 9.351e32, exact integers) with its step slope falling 4.85 -> 4.38 through every sealed band onto the law's log-corrected slope, the decisive decade 1e8 -> 1e9 reading 4.410 against 16s/9 - 8/ln z = 4.389 (HIT, kill rule not triggered at 4.452 +/- 0.011); the 4 MISSes are the ratio to z^{16s/9}/ln^8 z sitting at 2.00-2.14 above the sealed cap of 2 at z >= 1e8, the pre-declared non-adverse direction; the exact floor is extended 73 -> 113 (251 -> 1980, equal to the hill-climb floors at 89 and 101), where the law predicts nothing; no exponent moves and the law stays DERIVED and HELD. | [blind-0830-omega-floor.md](history/staging/blind-0830-omega-floor.md) |\n| 0 | `Q-rec-cheapest-0830` At the cheapest legal point of REC(s, u0), s -> 1+sqrt(e) and u0 -> beta_2, where the saving asked over the triangle inequality is only z^{1.031}, does any of the five dead routes close, does a mixed mean-square-plus-cap strategy close, and is the failure a proof gap or a truth gap? | PARTIAL | No route closes and the failing step is yesterday's statement, so PARTIAL on the routes; but the step is located as a TRUTH gap, not a proof gap, asymptotically: the certificate's own value at a CRT-planted doubly-smooth window is cc(r) = -(A1A2 + A1B2 + B1A2) with every term a count of exit chains of the Rosser supports (PROVEN, checked exhaustively at z <= 73), the window bound T <= cc(r) + H - 1 is exact, and the exit-chain count is DERIVED (held) to grow like z^{16s/9 - o(1)} at four primes and z^{2s - o(1)} in the limit, so REC(s, u0) is false for every u0 < 16s/9 = 4.7088 at s -> 1+sqrt(e), the whole legal band (2, beta_2] included, and RML(alpha) with it; at every computable z it is a proof gap (Omega(z) exact to z = 73 reads 251 against z^{u0} = 1.05e6, and a certified lower bound 8.86e17 at z = 5e5 sits a factor 1.2e6 under z^{u0}); no exponent moved. | [attack-0830-rec-cheapest.md](history/staging/attack-0830-rec-cheapest.md) |\n| 0 | `Q-recon-0828-covering` Does the interval-covering, automated-proof or extremal-combinatorics literature hold a method that bounds the length of an interval covered by two residue classes per prime, or that turns the exact G₂ ladder into a statement at all x? | ANSWERED | No route. Fifteen angles examined, fourteen dead on arrival or already closed here; the best interval-covering bound in print is Crittenden-Vanden Eynden's own Lemma 2, which reads 1.02e12 against G₂(79#) = 1710 and is 8181x weaker than the corpus's own 4.2665 sieve bound at the same level; the one survivor, transplanting Costello-Watts's recurrent certificate to two classes, is a computation that certifies finitely many levels and whose analytic half is Erdős #970 at one class. | [recon-0828-covering.md](history/staging/recon-0828-covering.md) |\n| 0 | `Q-recon-0828-farfields` Do any of the fields still absent from IMPORT-MAP.md hold a theorem whose hypothesis the tile satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | ANSWERED | No route from any of the sixteen candidates priced; two reach STRONG-ANALOGY or better and CLEAN and both bank only a closure or a wall address, the Fourier one by a one-line non-vanishing proof that empties the Donoho-Stark/Tao/Meshulam family on this object, and Janson's lower tail by saturating at exp(-1/c) >= 0.0805 against the 1/W a position union bound needs, short by 3.6e2 at x = 11 and 2.8e13 at x = 41. | [recon-0828-farfields.md](history/staging/recon-0828-farfields.md) |\n| 0 | `Q-recon-0828-rough` Does the 2000-2026 literature on y-rough numbers, sifted sets and short intervals hold any theorem that lowers Z2 or G2, meaning any control on the largest gap or the minimum count of a sifted set in EVERY short interval, or any structure of rough numbers a gap bound could use? | ANSWERED | No. Ten angles examined, ten killed for this purpose; the strongest every-interval statement in print for one-class rough numbers is Iwaniec's S(x,y,z) >= (4y/log^2 y)(log(y/z^2) - O(1)) for y >> z^2, uniform in x, giving J(P(z)) << z^2, and it is the linear sieve run exactly at its sifting limit beta_1 = 2 with no slack outside it; no two-class analogue exists in print at any exponent, the corpus's own x^4.2665 is beta_2 by the same mechanism, and every remaining branch of the field (Matomaki-Radziwill, Gorodetsky, Friedlander-Iwaniec Cor 6.28, Gafni-Tao) carries the almost-all quantifier, which a second-moment statement can never convert into a bound on one empty window. | [recon-0828-rough.md](history/staging/recon-0828-rough.md) |\n| 0 | `Q-recon-0828-sieve` Is there anything in the 2008-2026 sieve literature, or in the parity-breaking literature, that lowers beta_2 = 4.26645 or supplies a consumer for a level theta > 1 on the two-class comb? | ANSWERED | No route. Twenty-one angles examined, nineteen dead on arrival, nothing in print beats 4.26645 at kappa = 2 at any level on four calibrated channels; the two survivors are an owning-convention row and one unresolved hypothesis in a five-page 1990 announcement whose stated requirement beta < 3 excludes beta_2 = 4.26645. | [recon-0828-sieve.md](history/staging/recon-0828-sieve.md) |\n| 0 | `Q-recon-0829-escapes` Each of the three killers is an obstruction shape that occurs elsewhere in mathematics; where has each shape been beaten in print, by what mechanism, under what hypothesis, and does that hypothesis hold for the tile and zone objects? | ANSWERED | Of nineteen escapes read, fourteen fail a hypothesis check (twelve on a fact already in this corpus), four fail some other way and one (the decoupled vector sieve) stays OPEN as the programme's existing road, so no route opens; Granville-Soundararajan's uncertainty principle is NOT killer 3 in print, is adverse-direction, and is already cited here twice. | [recon-0829-escapes.md](history/staging/recon-0829-escapes.md) |\n| 0 | `Q-recon-0829-farfields2` Do any of eight fields still absent from IMPORT-MAP.md and from the three 2026-08-28 recon notes hold a theorem whose hypothesis the tile or the zone satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | ANSWERED | No route from any of the eight; the pass banks one PUBLISHED-ANCHOR (Holt and Rudd's transfer matrix has its full spectrum in print, second eigenvalue a2 = prod_{17<=q<=p}(q-3)/(q-2), printed 0.10206751799779 at p = 999999999989, decaying only like 2.82/ln p, and this corpus's prior-art record names the eigenstructure and the binomial eigenvectors but carries the per-prime eigenvalue (p-j-1)/(p-2) at lit-pdf-holt-rudd.md line 259 but no product-over-primes closed form, no numerical value and no rate), one CLOSURE with mechanism (Beurling-Selberg is the proof device behind the large sieve, whose constant N-1+1/delta is an l2-to-l2 statement and whose error 1/delta exceeds the window at the operative theta_total > 2, so the whole extremal-function family reproduces a row already rejected), and three wall addresses; two angles are TPC-strength at the form that would pay and are labelled (ii). | [recon-0829-farfields2.md](history/staging/recon-0829-farfields2.md) |\n| 0 | `Q-recon-0830-rec-killrun` Does the literature hold, in its own conventions, a theorem whose hypotheses REC(s, u0) (the sup-versus-rms recovery of the level-D signed remainder over all positions, attack-0829n-rml-proof.md section 3) or the weighted kill-run K*(s) (the longest run of level-s slots the primes in (s, 2s] can kill, attack-0829n-doubling-bridge.md sections 0 and 3) satisfies as stated, or a Maier-type theorem that makes REC false for two-class sifted sets at some u0 below beta_2? | ANSWERED | No theorem applies to either object as stated, on four calibrated channels searched in the owning conventions; every neighbour is graded NEAREST with its unmet hypothesis named, and neither object is on any refuted row. On the Maier question the answer is negative for REC as stated (the Maier family bounds the COUNT, i.e. the full-level remainder, never a level-D truncation) but carries one calibration: at one class and full level the REC-shaped inequality is FALSE asymptotically, by Buchstab's origin ratio against the Montgomery-Vaughan full-period variance ceiling, and the embedded arithmetic puts the level where that falsity first shows at log10 z between 16 and 141 depending on u0 and epsilon, so a finite-z margin of the kind the corpus measures cannot see a failure of this type; at two classes the same full-level statement is HL-conditional at u0 = 2 and unlocated in print at any u0. No exponent moved. | [recon-0830-rec-killrun.md](history/staging/recon-0830-rec-killrun.md) |\n| 0 | `Q-recon-0904-sifting-limit-floor` What is actually known, in the owning convention and at the page, about LOWER bounds on sifting limits at dimension kappa > 1, and is the class-blind cap at beta_2 = 4.26645 a barrier or a method artefact? | PARTIAL | Both. The corpus's [ABSENT] is wrong for lower bounds and right for extremal examples: Selberg's Lectures section 17 and Brady's 2017 Corollaries 1 and 3 ARE lower bounds on beta(kappa) at kappa > 1, invisible because Selberg's convention is the reciprocal a_k = 1/beta_kappa so his lower bounds are titled \"upper bounds for sifting limits\", while no kappa > 1 extremal example exists and Halberstam's own 2003 review says so; the best floor on beta(2) resting on a citation is 1.8394 from Brady's reduction evaluated at kappa = 2, unconditional and below the band, and beta(2) >= 2 follows from monotonicity by a padding argument DERIVED here and probably folklore; the cap at 4.26645 is a METHOD ARTEFACT at rung MEASURED, since the level-D LP is exactly the axiom-only information class and its calibrated floor of 3.3152 sits about 18 per cent below the DHR value and passed, 0 of 15, its first external test against the published beta_3 and beta_4; the band (2, 4.26645] is untouched by anything proven. | [recon-0904-sifting-limit-floor.md](history/staging/recon-0904-sifting-limit-floor.md) |\n| 0 | `Q-redteam-0828-closures` Do the five 2026-08-28 closure notes stand, and do they stand for the reasons they give? | ANSWERED | Three stand on corrected sentences (1d, Z5b, 0); one stands in half (10, the 1.074 counter-claim does not); one does not stand for its stated reason (1c, closed on a narrower window than the prior work's significant one, and its CLOSED has overwritten a PARTIAL in the generated index). | [redteam-0828-closures.md](history/staging/redteam-0828-closures.md) |\n| 0 | `Q-redteam-0830-floor-growth` Does the DERIVED growth half of attack-0830-rec-cheapest.md sec.4.2 (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive an adversarial re-derivation on independent code, does it really make REC(s, u0) false for every u0 < 16s/9, and does the blind slope test of blind-0830-omega-floor.md test the LAW or the CONSTRUCTION? | ANSWERED | No break found in six attacks, so the growth half SURVIVES this pass and stays DERIVED (one failed break is not a proof, and the whole thing still rests on the exact half E1-E3 that this pass did not grade); but four claims are corrected - the threshold 16s/9 needs the unstated hypothesis s <= 3 (above it the four-prime LP maximum is 2(2s+2)/3, then 8, both below 16s/9, though the corollary that every legal u0 < beta_2 fails survives at every admissible s because 2 x LP-max > beta_2 for all s > 9beta_2/16 = 2.3999), the 2s - o(1) limit needs 3^k <= ln D / ln 8 so only k = 2 is available at every z below 1.1e9, A_i is >= not ~ the dyadic count, and the certified ratio does NOT rise monotonically (0.0118, 0.0128, 0.0101, 0.0057, 0.0051, 0.0093, 0.0336, 0.0801, 0.1658, 0.3545 on my own recount, which reproduces all ten S4b rows digit for digit); the blind test is ruled a test of the CONSTRUCTION's count and not of the law, since it cannot see E1-E3 or the CRT step; on the ruling Chris asked for, the floor does make the RML route a truth gap asymptotically and conditionally on E1-E4, and changes nothing computable, the literal construction first passing H = z^{u0} at z ~ 5.6e31 on the constant 2.93e-4 measured here; no exponent moved. | [redteam-0830-floor-growth.md](history/staging/redteam-0830-floor-growth.md) |\n| 0 | `Q-redteam-0830-floor-sign` Does the EXACT half of attack-0830-rec-cheapest.md sec.4 (E1-E4, the sign facts, the window bound T <= cc(r) + H - 1, the exact Omega, and sec.(d)/(e)'s calibration sentences) survive an adversarial re-derivation on independent code, and does it by itself constrain REC at any u0 without the growth law? | ANSWERED | The mathematics STANDS as PROVEN and is stronger in two places than the note claims, but it constrains REC at NO u0 by itself: E3's identity is pure algebra and holds at every position (0 mismatches in 20.5M positions, both s), E2 holds at every divisor n > 1 under three disjoint routes at every s >= 1 and FAILS at s = 0.8, locating a hypothesis D >= z the note omits, E4 has 0 violations at every x over four complete periods with the wrap, and Omega is reproduced by an independent enumeration at all 26 tabled values and EXTENDED to z = 101 (285, 441, 684, 990, 1155 at z = 79, 83, 89, 97, 101), confirming blind-0830's exact 684 and 1155; three sentences are wrong -- E1's \"every pair with gcd \\| 2 is realised\" (exactly half are; the missing half is all those with 2 dividing one side), the ledger's and sec.0's \"251 against z^{u0} = 1.05e6\" (1.05e6 is HM, z^{u0} = 7.19e7, so the gap is understated 68.3x), and sec.4.4's reason for lam+(P(z)) = 0 (0.24 exceeds 1/8; the figure that closes the slab is 0.1199 at z = 89, under 1/8 by 4 percent) -- and sup\\|rho~\\| >= (Omega - M)/2 is loose: sup\\|R_1\\| = Omega + M exactly. Every exactly known log_z Omega is under 2 while REC needs it above u0 > 2, so the exact half touches REC at no u0 and every adverse consequence in the note still rests entirely on the growth half. No exponent moves. | [redteam-0830-floor-sign.md](history/staging/redteam-0830-floor-sign.md) |\n| 0 | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| 0 | `Q-redteam-0830-rml` Do the three HELD notes of 2026-08-29 night and 2026-08-30 on the RML chain survive an adversarial pass — the six-arrow chain and the term-count cap lemma of attack-0829n-rml-proof.md, the same-object ruling and the applied replacement sentences of verify-0830-usup-convention.md, and the reflection identity, custody, pilot bounds and sealed forecast of measure-0830-rho-sup-z41.md? | ANSWERED | The three load-bearing PROVEN claims survive independent re-derivation — the CAP lemma (every step, sine sum at worst ratio 0.585568, the constant 6, 0 per-modulus violations at z = 13, 17), the reflection identity rho~(W-3-y) = -rho~(y) (proved here and its two hypotheses verified at z = 13..37, residual <= 1.7e-10 at every position of z = 13, 17, 19), and the same-object ruling (an independent lattice reproduces the repository's term multiset exactly at z = 13..37 and its {Vabs > 0} set equals LSE's records at all ten levels); five of the seven cited exact sups and three of the five walked sup\\|R_H3\\| reproduce to <= 5.0e-7, and every figure of the sealed z = 41 forecast reproduces from the seven cited sups alone. Fourteen claims do not survive, none of them reopening a route. The load-bearing one is RML sec.2's ms_m/ask column: it measures the PROVEN mean-square BOUND sqrt(B H), not the ^{1/2} that REC names, the two differing by 36.53x to 200.45x on the tabled rows because saturates in H while B H does not, so sec.5's ordering (ask below the Gaussian factor at u0 = 3.0 and 3.5) is an artifact and reverses at every row against the true mean square. \"gauss -> 0\" (sec.5) and \"sup/rms <= sqrt(2 lnW) O(1) = z^{o(1)}\" (sec.3) are the same error twice, against the note's own sec.0: sqrt(2 ln W) = z^{1/2+o(1)}, measured gauss 0.7905 at z = 19 falling to 0.5645 at z = 1e7, limit 1/2. \"the recovery exponent is log_z(2 sup\\|rho~\\|/rms): about 0.99-1.29\" quotes the truth column, which is log_z(2 sup\\|rho~\\|) alone; the quantity named measures 0.5628 to 0.6712. \"REC would be moot rather than false\" should read false. \"u_cap -> 2s + o(1)\" and \"n ~ z^{2s}/polylog\" are asserted where only \"<=\" is proven and the data cannot decide: u_cap is 4.2652 at z = 47, crosses beta_2 only at z = 53, reaches 4.4891 at z = 79, and passes u_triv from z = 53. \"seven points spanning less than one octave\" is 1.509 octaves, still uncorrected in three places including the ledger verdict. verify-0830's applied \"polynomially many from z = 223 on\" is true at every z >= 13, and its z = 331 crossover silently sets A = 1 (A fitted to LSE's own Ssat moves it to 337). No exponent moves, no route opens or closes, and no ledger verdict changes. | [redteam-0830-rml.md](history/staging/redteam-0830-rml.md) |\n| 0 | `Q-redteam-0904-floor-growth-2` Does the growth half of the adverse pointwise floor (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive a SECOND adversarial pass, and does a floor on the certificate at a CRT-planted window make REC(s,u0) false (a truth gap) or only unprovable by that certificate (a proof gap)? | ANSWERED | SURVIVES, at the same rung and no higher: four new attacks and two unasked ones found no break, so the growth half stays DERIVED and red-teamed twice, which is two failed breaks on a derivation and not a proof; the proof-gap reading is REFUTED because REC is a statement about R_H, the remainder of the very certificate the floor bounds below, and the chain has no step where a certificate value must become a true remainder, so it is a truth gap for REC as the corpus states it; five corrections are owed to the record -- the REFUTED row is UNSCOPED and should read \"on the Rosser vector-sieve lattice at equal levels\" since only the Rosser instance is derived, the \"falsity beyond z ~ 5.6e31\" is an s = 2.698721 figure quoted without its s and the fitted crossing at the corpus's own measured family s = 3.0 is z ~ 10^15.3, the analytic p* window (4D^{1/27}, D^{1/9}/4) is neither necessary nor sufficient at reachable levels so the exact onset is 4.42e5 at s = 3.0 rather than the quoted 1.055e6, the four-prime construction has NO exit prime below z once s >= 7 so the first pass's \"8 beyond s = 5\" holds only on [5,7), and the first pass's escape-(a) density 1/W understates the planted class by the factor W/(n1n2) though the escape still fails by an exponential; the LP maximum 8s/9 is confirmed as an exact vertex and the corollary crossing reproduces 9beta2/16 to 4.4e-16, the pre-registered slope band held at a new s (top step 4.9025 at s = 3.0 against a model 4.8990), and no exponent moved. | [redteam-0904-floor-growth-2.md](history/staging/redteam-0904-floor-growth-2.md) |\n| 0 | `Q-redteam-0904-item0` Do the two HELD notes of 2026-09-04 on item 0, the second adversarial pass on the adverse floor's growth half and the L7 one-class-to-two-class transfer, survive an independent adversarial pass, and do the live-layer changes they propose survive verbatim? | ANSWERED | Both notes SURVIVE at their own rungs and neither moves an exponent, but SIX of their proposed live-layer changes need rewording and two of their supporting derivations are wrong; every load-bearing number reproduces on independent code (18 of 18 A1A2 cells digit for digit, the LP maximum 8s/9 at 0 deviations of 16 with residual 4.441e-16, the crossing 2.399878284834 against 9beta2/16 at 1.097e-13, the fitted C = 1.1206e-4 and the s = 3.0 crossing 10^15.30, the onsets 4.390e5 / 1.111e6 / 1.860e6, ln(n1n2) = 7.4993e7, and the L7 CRT counts EQUAL at x = 7, 11, 13), so the truth-gap reading of REC is CONFIRMED and the growth half stays DERIVED and red-teamed twice, not proven; what does not survive is the scoping, the exit-window and the price wording: the proposed clause \"at equal levels D1 = D2 = z^s\" is NARROWER than the derivation supports, since over 1643 admissible upper-and-lower level splits the floor beats the decoupled window at every cell by at least 0.644444, so no level split escapes and the sibling rider \"asymmetric levels give 8s1/9 + 8s2/9 with s1 + s2 pinned\" is REFUTED as written (it holds only while both s_i <= 3); the record's z ~ 5.6e31 is u0-specific as well as s-specific (10^31.68 at u0 = 4.2165 against 10^35.36 at u0 = beta2, same s), so replacing it with a beta2-convention 10^15.30 mixes two conventions; the onset correction is right numerically and wrong in wording, since at the record's own s = 2.698721 the exact onset is 1.875e6, LATER than the quoted analytic 1.055e6, not earlier; the escape-(a) correction is right in substance but its \"(A1A2)^2 / (2 n1n2)\" is a LOWER bound on the split's contribution, and the two-sided version through lambda+(n) <= 2^omega(n) reads 10^{-3.004323e+7} against B ~ 10^{10.1}, still no contradiction; and on the L7 side the union-bound argument and the CRT count are CONFIRMED while the coupled vector-sieve price 2(1 + sqrt e) = 5.297442541400 is the FORCED-equal-level constant, the corpus's live figure being K_BF = 5.158064680330, reproduced here to twelve digits at (a, b) = (2.229949, 2.928115), and the sieve-on-holes is the vector sieve only after the Ford-Halberstam substitution step that sift-limit-attack.md 7b(1b) already owns; the \"no third mechanism excluded\" line is honest but incomplete, since weighted sieves with Chen switching are already priced and closed at sift-limit-attack.md 4.2; scope of death gains one row, L7's mechanism 2, which the growth note's own section 10 calls untouched while its sibling calls it dead; no exponent moved. | [redteam-0904-item0.md](history/staging/redteam-0904-item0.md) |\n| 0 | `Q-redteam-0904-sifting-limit` Do recon-0904-sifting-limit-floor.md's five claims survive adversarial re-derivation at the page, and in particular is the 4.26645 cap a method artefact at rung MEASURED? | ANSWERED | Four of five claims survive with corrections and the headline does not. Claim d is REFUTED as stated on four grounds, each sufficient: the level-D LP fixes one omega-profile out of a class Ford defines by a ONE-SIDED inequality, and inside the classical (Omega_2(kappa,L)) budget a legal profile at x = 13 gives a calibrated reading of 5.0113, above beta_2 = 4.26645, which fires the target note's own pre-registered refutation of its floor; the calibration is a 1.72 multiplicative correction fitted at one point and it misses the second proven point beta(1/2) = 1 by 66 to 82 per cent, two and a half times the 28.7 per cent effect the headline rests on; the pooled 3.3152 averages four statistics of which only s* is the definitional analogue of beta, and that route reads 3.4678 here and 3.9487 at x = 43 in the corpus's own data, still climbing at +0.4297 per ln x with the fitted line reaching 4.26645 at x = 104; and 3.3152 is 22.2961 per cent below 4.26645 rather than the 18 per cent the note prints. Claim a is CONFIRMED with a second source off the OCR channel (Ford 2023 p. 37, \"Some authors, e.g. Selberg, refer to 1/beta(kappa) as the sieve limit\"), one page correction owed (Halberstam is p. 117, not p. 116). Claim b is CONFIRMED and strengthened: Brady's class is stated on his p. 10 and IS the axiom-only interval class Face 4 needs, his v_R table is reproduced here, and the identity v_{2d+2} = v_{2d+1} his proof asserts is confirmed at d = 0, 1, 2, so 1.819592 rests on proved facts alone. Claim c is CONFIRMED but demoted: beta(2) >= beta(1) = 2 is two lines from Ford's own one-sided (Omega) plus his own beta(1) >= 2, so the padding construction is correct and unnecessary. Of the eight proposed live-layer changes, two survive verbatim, five need rewording and one is refuted; the new SEARCH-CONVENTIONS row adds exactly three clearing phrases and changes nothing for any existing absence claim. | [redteam-0904-sifting-limit.md](history/staging/redteam-0904-sifting-limit.md) |\n| 0 | `Q-rho-maximal-law` What is the rho maximal law, what is its weakest sufficient form against the crossing, and where does it sit against print? | PARTIAL | The pricing lemma turns any RML(alpha) with alpha < beta_2 = 4.26645 into G2(z#) << z^alpha ln^2 z, every step proven except the law itself; the sufficiency curve lambda_max falls from 2.31949 at z = 13 to 1.78446 at z = 47, the weakest measured point, and whether it ever reaches zero is model-dependent and undecided, so nothing here is an unconditional exponent. | [rho-exact-z31-01.md](history/staging/rho-exact-z31-01.md), [rho-maximal-law.md](history/staging/rho-maximal-law.md) |\n| 0 | `Q-rho-sup-z41-0830` What is the exact sup over all positions of the centred sawtooth remainder at z = 41 (period 7.42e12), and of R_H at H = z^3 and z^4, and what does the eighth exact point do to the truth's slope and to the u0 = 3 form of REC(s, u0)? | PARTIAL | Not run in full; the exact z = 41 point prices at 4.8 to 5.4 h on this machine from measured per-position costs (naive 69.8, table 23.5, table-plus-windows 36.6 ns per worker; fleet 4.52 ns of wall at z = 41), above the 3.5 h rule, so what exists is a new engine (a PROVEN reflection that halves the walk, a P(29) periodic table worth 2.9x, per-block exact re-seeding) reproducing every cited exact sup at z = 13..37 digit for digit, sup\\|R_H\\| at H = z^3 walked for the first time at z = 19..37 (F3 = 26.4 to 35.9, the factor 2 was 1.5 to 2.2x loose), a sealed pre-registration (forecast sup 60.07, band [47.25, 76.37], kill needs sup\\|R_H3\\| >= 1807.417), one pilot twelfth giving lower bounds sup\\|rho~\\|(41) >= 70.651250 and sup\\|R_H3\\| >= 64.416936, and an eleven-segment plan for the box; no bound-and-prune exists on three routes; nothing asymptotic can move whatever the point turns out to be. | [measure-0830-rho-sup-z41.md](history/staging/measure-0830-rho-sup-z41.md) |\n| 0 | `Q-rho2-bound` Is there an analytic upper bound on (z) from its proven closed form, and does it matter for RML? | ANSWERED | Already proven 2026-08-21 (attack-rhoms-01); the constant is now named, 170.88 z^{2s} ln^8 z; Chebyshev off any second moment diverges from RML (the true C_L = ms = 1 floor clears at z = 41 and 43 and misses by 2.155x at z = 47), so it is an ingredient, not a route. | [attack-rhoms-01.md](history/staging/attack-rhoms-01.md), [rho2-analytic-bound.md](history/staging/rho2-analytic-bound.md) |\n| 0 | `Q-rml-proof-0829n` Starting from Lemma V's PROVEN mean-square bound, what is the exact chain of implications to a two-class exponent below beta_2 = 4.26645, which single arrow is open, and does it close? | PARTIAL | The chain from the proven mean square to an exponent below beta_2 has exactly one open arrow, the mean-square-to-sup recovery REC(s,u0): sup_x \\|R_H(x)\\| <= z^{u0/2 - eps} rms(R_H) at H = z^{u0} for one fixed u0 in (2, beta_2); every attempt here dies at a named place (term-by-term accounting is capped at 2s + o(1), the trivial-level exponent; position-union pays e^{theta(z)/q}; window smoothing and the P(y) lever move polylog only; the smooth-profile form is closed on hypothesis and priced above beta_2), the arrow is measured TRUE with certified margin z^1.72 to z^1.92 at u0 = 4 over z = 19..37 and the truth's slope 2.766 +/- 0.212 sits 5.8 se under u0 = 4 on seven points under one octave, so the failure is a proof gap at every computable z and undecided asymptotically; no exponent moved. | [attack-0829n-rml-proof.md](history/staging/attack-0829n-rml-proof.md) |\n| 0 | `Q-tail-deficit-model` Does the exact compound-geometric thinning of the previous level's own gap histogram, with the qualifying-gap constraint g = 0, +/-2 (mod q) carried through the ladder, predict the tile's tail-deficit factor G2/(mbar ln D) at zero parameters, and does that make object-models-read-0829's D5 residue-level classification constructive rather than inferred? | ANSWERED | NO. The zero-parameter CRT-constrained thinning predicts a tail HEAVIER than the tile's at every level, delta_M2 = 0.6461, 0.6746, 0.7021 against a measured 0.4577, 0.4463, 0.4791, so the pre-registered \"classification was wrong\" arm fires and D5 returns to OPEN with C3's constructive route REFUTED; the constraint is informative but small, carrying 4.0 to 10.0 percent of ln(null/truth) at the far tail, or 7.7 to 14.4 percent read against a rate-matched control, against the grain's ORDER at 39.4 to 54.6 percent at the deepest abscissa each level resolves; at shallow abscissae the ordering reverses (B 8.7 against C 4.8 at x = 23, u = 4), which the exact operator on a shuffled true grain confirms without any model (maximum 276, 354, 426 against the true 204, 258, 348), and the order effect is now localised (sections 7 and 9): a first-order Markov word from the true adjacent-pair statistics carries 32.3, 34.2 and 60.8 percent of ln(shuffled/truth) at the deepest abscissa of the three folds, and a SECOND-order word from the true adjacent-triple statistics carries 97.3, 97.9 and 102.6 percent there, r = 0.972, 1.061 and 1.000 on draw-mean maxima over 40, 20 and 10 draws, so the folded tile's tail is MEASURED to be a function of the previous grain's three-consecutive-gap statistics and of essentially nothing longer-range; that surrogate is seeded on the true previous grain at one fold, is not iterated, predicts no delta and does not revive C3, and the 348.0 sd 0.0 at 29->31 rests on ten draws. | [measure-tail-deficit-0829.md](history/staging/measure-tail-deficit-0829.md) |\n| 0 | `Q-theta-ladder` Does the all-positions exponent theta turn over below 2, converge to exactly 2, or settle above 2? | CLOSED | The answer is above 2 with an amendment, and the route is retired regardless: theta does not turn over (it dips and comes back, need/z^2 = 0.3550 to 0.6119 at z = 13..31 and rising from 31), convergence to exactly 2 is not supported (e = 1 rejected at 95% in all four fits), point estimates run 2.37 to 2.99 without settling, and OUTCOMES.md records the certificate route as RETIRED because the sharp maximal law it needs is itself TPC-implying. | [theta-ladder.md](theta-ladder.md) |\n| 0 | `Q-usup-convention-0830` Are lemmaV-sup-extension.md's u_sup and u_sat and attack-0829n-rml-proof.md sec.4.1's CAP(z) statements about the same object (level D = z^s at s = 3.0, same moduli, weights and normalisation), so that the sec.4.1 correction in passing applies, or does a level-convention mismatch void it? | ANSWERED | SAME object, VERIFIED at the code: both notes build the lattice through buildTerms(z, z^3), the modulus sets and Vabs(e) agree to 6.9e-18 at z = 13..23 and the count convention matches at all ten levels, the cited Ssat and u_sat reproduce on the RML lattice to every printed digit at z = 13..19 and the full-level alternative does not (19.544 against 19.602 at z = 13, 45.827 against 50.314 at z = 17); so the PROVEN cap Ssat <= CAP <= z^{2s+o(1)} applies and refutes lemmaV-sup-extension.md's asymptotic prose at lines 485-486 and 508-516 (2^pi(z) moduli, a C^pi(z) theorem as the reachable end), while sec.4.1's attribution sentence overreaches by calling that note's \"reading\" a shape it lists as one of two indistinguishable fits and flags as its likeliest error; neither ledger verdict line changes. | [verify-0830-usup-convention.md](history/staging/verify-0830-usup-convention.md) |\n| 1d | `Q-applied-0828-closures` Were the closures red team's corrections applied to the five HELD notes? | ANSWERED | Applied. 47 prose corrections across the five notes; c2prime-refit-22 drops from CLOSED to PARTIAL and three ledger verdicts are rewritten; four producer READINGS blocks and eleven live-document lines carry the same defects and are listed here uncorrected, behind the fence. | [applied-0828-closures.md](history/staging/applied-0828-closures.md) |\n| 1d | `Q-delta-reader-0830` Can any instrument read the sign of the log-power correction delta in G2 ~ c n^beta (ln n)^delta at reach 79, passing the one-class control first? | ANSWERED | No. Six readers were pre-registered against stepped synthetic laws and the one-class control; the four power-chain readers (the diagonal meter among them) are killed by the P(n) stepping alone, the joint fit is calibrated but reads the control's finite-reach delta NEGATIVE (-0.38 +- 0.14 at 64 terms) where its conjectured asymptotic delta is +2, and the one reader that passes does so by importing the exponent, its sign being the sign of (1.777 - beta_hat). delta's sign for G2 is unreadable at reach 79 by any instrument tried, and the control shows a finite-reach reading would not carry the asymptotic sign anyway; item 1d's all-bases form stays unattackable. | [measure-0830-delta-reader.md](history/staging/measure-0830-delta-reader.md) |\n| 1d | `Q-fekete-1d-defect47` Does the bounded-defect Fekete route survive a probe at 47#? | PARTIAL | The defect at 47# is ordinary and the 47# enumeration cannot move item 1d's TPC threshold whatever value it returns; the bounded-defect Fekete lemma is stated exactly and proved with every hypothesis except the candidate itself discharged, so the route reduces to one named inequality and is neither closed nor open beyond that. | [fekete-1d.md](history/staging/fekete-1d.md) |\n| 1d | `Q-g2-falls-decision-rule` Does G2(x#)/x^2 fall, and what pre-registered decision rule would settle it? | PARTIAL | The instrument is calibrated and sharp, resolving the one-class control at 11.6 sigma on the same nine points where it returns 0.9 sigma on G2, and the honest band on the slope is +/-0.117 at nine terms, so the rule is registered; but the power analysis puts separation at x = 53 only if the falling law is x ln^2 x and at x = 151 if it is x ln^3 x, so phase 1's extra terms settle nothing and no reachable exact ladder does either. | [phase1-T3prep-decision-rule.md](history/staging/phase1-T3prep-decision-rule.md) |\n| 1d | `Q-hsub-reductions` Can (H-sub) be proven or refuted, and what does the fold machinery reach? | PARTIAL | Neither, but the statement is smaller: three reductions of the hypothesis are proven, the lemma consuming only power pairs so that it weakens to (H-sub-pow) with the conclusion unchanged, the fold machinery's inability to reach any of them is made exact, and the hunt over all 111 reachable pairs found no drifting family and no counterexample. | [attack-hsub-01.md](history/staging/attack-hsub-01.md) |\n| 1d | `Q-hsubpow-K` Can (H-sub-pow) be proven with an explicit K in the legal zone? | CLOSED | NO by three mechanisms: the CRT lift (K* >= pi(y') - pi(y) diverges), anchored caps (diverge at every base), Iwaniec at two classes (it IS beta2-note); TODO 1d's legal zone is mis-stated, the trusted zone is [1.3946, 11.3568). | [hsubpow-explicit-K.md](history/staging/hsubpow-explicit-K.md) |\n| 1d | `Q-hsubpow-K-0829n` Can (H-sub-pow) be proven with an explicit K inside the trusted legal zone [1.3946, 11.3568) by a mechanism the 2026-08-28 pass did not close? | OPEN | No K is proven at any base; the single open inequality is the uniform-in-k ratio cap G(b^(k+1))/G(b^k) <= e^K G(b), which is a proof gap at a fixed base and a possible truth gap across bases, since for any law G ~ c n^beta (ln n)^delta the all-bases hypothesis holds with finite K if and only if delta >= 0. | [attack-0829n-hsubpow-K.md](history/staging/attack-0829n-hsubpow-K.md) |\n| 1d | `Q-import-interp` Does the Bayati-Gamarnik-Tetali interpolation method reach the G2 Fekete object? | ANSWERED | No: BGT closes on hypothesis H1, since the constraint count never splits (pi(st) - pi(s) - pi(t) is zero at no pair with st >= 25, minimum 2, maximum 12, VERIFIED on 104 pairs), and the one coordinate that does split has limit +infinity; the row lands as WALL-ADDRESS plus the identity that the submultiplicativity defect is the Overshoot slack. | [import-interp.md](history/staging/import-interp.md) |\n| 1d | `Q-redteam-0828-closures` Do the five 2026-08-28 closure notes stand, and do they stand for the reasons they give? | ANSWERED | Three stand on corrected sentences (1d, Z5b, 0); one stands in half (10, the 1.074 counter-claim does not); one does not stand for its stated reason (1c, closed on a narrower window than the prior work's significant one, and its CLOSED has overwritten a PARTIAL in the generated index). | [redteam-0828-closures.md](history/staging/redteam-0828-closures.md) |\n| 1d | `Q-redteam-0830-fekete` Do the load-bearing claims of attack-0829n-hsubpow-K.md (the sign lemma, the K -> beta_bound map, the zone, the TODO.md base-16 correction) and measure-0830-delta-reader.md (the six pre-registered readers, their kill gates, the joint fit's calibration, the RB circularity argument) survive independent re-derivation, and are the two live-doc corrections they caused the right sentences? | ANSWERED | Every number in both notes reproduces on independently written code (all 14 cells of the beta_bound / K_min table, all 48 cells of the reader-calibration table, all 24 figures of the real-control table, the margins, the sups, the 5.607 correction, the 10-of-81 count), and the sign lemma is re-proven as stated for continuous exact laws. Two claims are WEAKENED and one live-doc sentence needs a qualifier: the sign lemma's constant 1.0597 loses 43% of its value if the base floor moves from 2 to 3 and its whole shape fails for the stepped law that a primorial ladder must present, where beta re-enters the sup and a delta = 0 law already needs K = 1.37 at beta = 2, inside the trap; and TODO.md 1d's \"the sign of delta is unreadable for G2 at reach 79 by any instrument tried\" is wrong on the letter, since reader RB passed all four pre-registered criteria and read delta_hat = +0.80 +- 0.09, the note voiding it post-hoc on a circularity the pre-registration flagged but did not make a kill criterion; the honest sentence adds \"non-circular\". No claim in either note is refuted. | [redteam-0830-fekete.md](history/staging/redteam-0830-fekete.md) |\n| 1d | `Q-y2-recompute` Does the sixteen-level Y2 ladder reproduce on the corrected instrument, and does Y2/x^2 fall? | ANSWERED | The ladder reproduces exactly, sixteen of sixteen from sixteen independent processes, digit for digit against the published 2026-08-18 ladder, and Y2/x^2 falls at 15 of the 15 consecutive steps; this does NOT show that G2(x#)/x^2 falls, since the shortfall Y2/(G2-1) is unmeasured above x = 79. | [y2-recompute.md](history/staging/y2-recompute.md) |\n| 0b | `Q-gate-multiplies` Does \"the gate multiplies\" close the entire u-frame recursion branch, or only the merge chain? | ANSWERED | Only the merge chain and one relative of it: the no-fixed-point argument does not reach TODO 0b at all, though 0b is wrong as stated for an unrelated reason and the error is a factor of ln u; what survives is the copy theorem for maxsum (VERIFIED 40 of 40), which needs a residue-deleted maxsum bound that does not pass through a kill count. | [gate-multiplies.md](gate-multiplies.md) |\n| 0b | `Q-import-thinning` Do point-process thinning and interval coalescence give H'' a null model? | ANSWERED | Yes and exactly: the fold recursion is an exactly solvable thinning whose gap pgf transforms by a Mobius map fixing 0 and 1, so under independent thinning the gap word of T_x is exactly geometric with mean mbar/6 at every rung with no error term, which turns both of the record's fitted parameters into derived ones. | [import-thinning.md](history/staging/import-thinning.md) |\n| 0c | `Q-0c-holesweep` At a fold, how does maxsum degrade copy by copy as the two deleted residues sweep through their possible positions? | ANSWERED | The full curve is on disk for nine folds (5->7 through 31->37, every copy) and it is a PALINDROME: the Mirror-Sweep Lemma is proven here and verified exhaustively, giving the fingerprint any kill-count-free bound must reproduce, but no such bound was produced by this pass. | [attack-0c-holesweep.md](history/staging/attack-0c-holesweep.md) |\n| 0c | `Q-0c0e-level-selection` Can a residue-deleted maxsum bound that only has to hold at levels of the argument's choosing carry the weak Zone Postulate? | CLOSED | CLOSED, and the mechanism has a name: the level-selection licence is worth 0.3187 nats once and is falling, no selection rule beats its own null by anything worth having across T_11..T_29, and the BV/EH sweep supplies no moduli-selecting statement to spend. | [attack-0c0e-level-selection.md](history/staging/attack-0c0e-level-selection.md) |\n| 0c | `Q-foldL-maxsum-direct` Can maxsum_m(T_x), plain and residue-deleted, be bounded above by an argument that never counts kills? | CLOSED | The brief's premise contradicts the corpus's own Bridge Floor (maxsum_k >= maxsum_1 = G2(T_x) for every k), so the bridge cannot convert far enough however good the bound is; all four routes close (R1 partial then closed, R2 tautological and quantitative, R3 busts the budget), and the order-m object is in print, so item 0c's absence sentence has to change. | [attack-foldL-05-maxsum-direct.md](history/staging/attack-foldL-05-maxsum-direct.md) |\n| 0c | `Q-import-chaining` Can Dudley's entropy bound or Talagrand's generic chaining beat the union bound over positions on the maxsum law? | CLOSED | No, and the reason is geometric rather than probabilistic: the entropy integral of the true increment metric is already 1.054-1.099 times rms*sqrt(2 lnW) at its lower branch and 1.484-1.545 at its upper, flat across z = 13..23, so chaining's ceiling with a perfect universal constant sits below the union bound's floor; the honest constant-carrying chain measures 2.878 to 3.027. | [import-chaining.md](history/staging/import-chaining.md) |\n| X | `Q-verify-cofactor-convolution` Does the cofactor-convolution identity at the anchor hold, and does it test the joint law? | ANSWERED | RESTATED with corrections: the arithmetic is right, an independent re-derivation reproducing every figure to the digit at all five levels and confirming the asserted closed-form step, but the framing does not survive, since X is pinned by the identity X = M - Nbar + n_0 so the whole comparison collapses to one cell and the joint is measurably not a product elsewhere; the model error is 0.52 per cent, not 0.050. | [verify-cofactor-convolution.md](history/staging/verify-cofactor-convolution.md) |\n| X | `Q-xchan-at29-prereg` Does the joint-deficit closed form survive a blind test at @29? | OPEN | Pre-registration only, committed alone before any producer existed: the statistic, the predictions adopted verbatim from the record, two acceptance bands, the validation gate the instrument must clear before any @29 number is reported, and what each verdict does to TODO item X. | [xchan-at29-prereg.md](history/staging/xchan-at29-prereg.md) |\n| X | `Q-xchan-at37-offset` Does any registered offset-correction candidate for the ~3.8 law survive at @37? | ANSWERED | Sealed and committed alone before any @37 census of any kind existed, fixing the candidates, the sigma model and its projection band, the scoring rule and what each verdict does to item X's offset clause; scored in xchan-at37-score.md, where every registered candidate is killed and the number survives an independent recount. | [xchan-at37-offset-prereg.md](history/staging/xchan-at37-offset-prereg.md) |\n| X | `Q-xchan-at37-score` What does the @37 census say about the sealed X-channel offset pre-registration? | ANSWERED | The census measured 1 - J = 0.020823, below every registered prediction, so scored exactly as registered every one of the seven candidates dies at \\|z\\| = 104 to 122 and the survivor set is EMPTY, an outcome the sealed prereg has no consequence clause for; the number itself survives an independent recount on a different marking scheme, and the offset question is replaced by a larger one. | [xchan-at37-score.md](history/staging/xchan-at37-score.md) |\n| X | `Q-xchannel-at23` What is the fifth point of the X-channel statistic, at @23, and does the monotone rise hold? | PARTIAL | The fifth point is +0.2658 at @23, the rise holds at five levels and is larger than the four-point trend predicted, and the deficit has migrated into m >= 3, whose share of the X-gap runs 10.5, 23.5 and 81.1 per cent at @17, @19 and @23; the constant itself is not derived here. | [xchannel-at23.md](history/staging/xchannel-at23.md) |\n| X | `Q-xchannel-closedform` Does the zero-parameter closed form for the joint deficit survive its two blind tests at @29 and @31? | PARTIAL | 1 - J = 4S2 is the only one of the three pre-registered laws left standing and it is not exact: a clean hit at @29, z = -0.90, and 4.93 sigma low at @31 where sigma_J falls to 0.000024, with the two rivals dying at 6.35 and 20.81 sigma; both blind levels agree on a stable relative offset of about half a percent, -0.41% and -0.48%, whose absolute residuals match to 2%. | [xchan-at29.md](history/staging/xchan-at29.md) |\n| X | `Q-xchannel-offset` What produces the ~3.8 law's -0.45% offset, and which candidate correction survives? | PARTIAL | The best available description is a finite-level correction of S3's size and sign - 1 - J = 4S2 - S3 scores z = +0.04 at @29 and -0.41 at @31 where the standing law scores -0.43 and -2.32 - but it is POST HOC; two candidate corrections and one shape are refuted on existing data, the sigma behind the @31 detection is calibrated on seven known-truth controls, and the deciding blind test at @37 is pre-registered and committed alone. | [item-x-offset.md](history/staging/item-x-offset.md) |\n| X | `Q-xchannel-triples` Does the joint deficit deepen or decay as the mixed super-W triple census is extended past @17? | ANSWERED | It decays: J = 0.9025, 0.9599, 0.9659 at @17, @19, @23, so the deficit runs 9.7%, 4.0%, 3.4%, both new points land inside the pre-registered DECAYING FASTER THAN FORCED band, and the DEEPENING instinct is refuted by 3.50 sigma between @17 and @19 and a further 1.68 sigma to @23. | [xchannel-triples.md](history/staging/xchannel-triples.md) |\n| A | `Q-anchored-ladder` Does the unified anchored ladder generalize past @11 and @13, and what does cheap K buy at each level? | ANSWERED | It generalizes verbatim to @17 and @19, and the K = 0 unified floor is DEAD there (vacuous at -1262 and -55865); what survives and grows is the family lead at the classic certification depth K*, margin +2, +5, +26, +110 across @11 to @19. | [attack-anchored-02.md](history/staging/attack-anchored-02.md) |\n| A | `Q-anchored-ladder-17-0830` At @17 and above, at which depth K does the composed (unified) anchored floor first turn positive and at which K does it reach the truth, and does the depth-cost curve K_first_positive(level), K_truth(level) move with level? | ANSWERED | At @17/@19 the answer was already on record (Q-anchored-ladder: positive at K = 2/10, truth at ascending K = 109/410, minimal pool 88/350) and is re-derived here as the custody gate; the new level @23 ran under a sealed 14-of-14 forecast: positive first at K = 27 = K* (PROVEN from the record before the run), truth at ascending K = 1732 of 1739, minimal pool 1543 = 0.887 of the scour (PROVEN lower bound meets VERIFIED upper bound); across five levels positivity costs exactly K* while the truth fraction rises 0.40, 0.62, 0.73, 0.81, 0.89, a MEASURED finite table with no law in x and no exponent touched. | [attack-0830-anchored-ladder-17.md](history/staging/attack-0830-anchored-ladder-17.md) |\n| A | `Q-anchored-unify` Can the three anchored mechanics be unified at @11, and what floor family does the unified cap certify? | ANSWERED | MEASURED and PROVEN-here but HELD: extending the staircase's cofactor injection to m = 1 folds the self-strike allowance into the count, the unified-cap lemma gives fresh <= capU_K <= cap_K at every depth and prime at @11 and @13, and the floor family runs 36 to 45; the x = 37 secondary is a clean negative. | [attack-anchored-01.md](history/staging/attack-anchored-01.md) |\n| A | `Q-history-dial` Does revealing the scour primes' classes concentrate the floor on a bounded set of strike locations, and what is the history dial worth? | ANSWERED | Disconfirming: the class axis is linear at 2.90 survivors per prime read, so no bounded set of strike locations carries the floor, and the touch-count ceiling is proven and tight; deliverable (1) of the brief already existed as canonical state (the forcing ladder 16 -> 45 at @11), so nothing new was bought there. | [attack-history-dial.md](history/staging/attack-history-dial.md) |\n| A | `Q-redteam-0830-engine` Do attack-0830-buchstab-deep.md, attack-0830-comb-tail.md and attack-0830-anchored-ladder-17.md survive an adversarial re-derivation on code that shares nothing with their producers, and does REFUTED row 97 stand as worded? | ANSWERED | Every headline number in the three notes reproduces exactly on independent code (26 of 26 comparisons, including F2/f2 = 3.6682 at sigma = 4.7088 by a near-analytic route, the 0-of-1512930 pair count, the tail defect at five levels, the full 419328-term Legendre split, and the whole @23 anchored ladder including K* = 27, floorU = 5364, truth 597475 and the minimal pool 1543 proven exact); one load-bearing DERIVATION is REFUTED — \"\\|B - 1\\| >= c forces sigma(q) < u_c - 1\" fails at @23 on 21134 (q, K) pairs for the engine's model B at c = 0.1 and on 33875 high-count pairs for the measured B at c = 0.01, because the step bounds every u in a weighted average by the largest one and treats the denominator as e^-gamma, so the \"level-free\" clause of buchstab-deep section 4 and REFUTED row 97's \"\\|B - 1\\| >= 0.01 forces sigma < 1.798\" must be re-graded from DERIVED to MEASURED-at-@23 (where the conclusion survives: the worst sigma is 2.159, still far below beta2 = 4.26645); row 97's \"the best sigma any level has\" is separately WEAKENED, since @29's head sigma is 5.5785 with width 1.5325 and @97's is 17.1422 with width 1.0000; comb-tail derives its main-term factor from prod (1 - 1/q_i) and measures it against prod (1 - 1/(q_i - 1)), which is what natal-cap-28 line 283 computes against its own line 20 and against certificate-engine.md section 1, a 0.9% difference at @23 that moves nothing certified; comb-tail also misquotes its own cited source as F1 in [1.5, 4] where that source says [1.5, 3] and says there is no bound at all at s < 1; four smaller slips are listed and none opens or closes a route. | [redteam-0830-engine.md](history/staging/redteam-0830-engine.md) |\n| 1 | `Q-at43-bigint-0830` Can the K-30 natal march be carried past its 2^53 ceiling to @43 exactly, and is the @43 point worth its cost? | PARTIAL | The engine side is done and VERIFIED (five paths promoted to BigInt, @7..@37 and a 0.248% slice of @41 reproduced digit for digit); the @43 point is NOT run, because the measured extrapolation is 579 h of eight cores on this machine (a 43x tile times a 2.23x per-cell cost, against the brief's ~13x), which is a weeks-class box job whose only payoff is a sixth point on a curve with no consumer; the forecast 0.8393 raw / 0.8399 persisted stands unscored. | [engine-0830-at43-bigint.md](history/staging/engine-0830-at43-bigint.md) |\n| 1 | `Q-redteam-0830-imports` Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | ANSWERED | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| Z7 | `Q-zonegap-03-score` Do the ten predictions sealed in zonegap-03-prereg.md score against the stage-3 sweep at X = 1e12? | ANSWERED | All ten sealed rows score HIT and none miss, after a second pass added a band-edge argument to zonegap-01.js and re-ran the decade so the two rows that named an unprinted band could be scored; the four Group T hits are a custody promotion that follows from CUSTODY 1 and 3 passing, one sub-clause of T5 (the full-decade sd) stays unprinted, and the sweep still needs a DERIVED engine because zonegap-01.js's inlined 41-record ladder makes it exit at 1e12. | [zonegap-03-score.md](history/staging/zonegap-03-score.md) |\n| 2 | `Q-var41` What does the stable law predict for Var(41), and what can the tenth Var/E point pin? | OPEN | Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift. | [var41-prereg.md](history/staging/var41-prereg.md) |\n| 8 | `Q-applied-0828-engine` Were the engine red team's corrections applied to the five HELD notes? | ANSWERED | Applied, 37 edits across the five notes: two numbers corrected (first s >= 10.82 at x = 263 not 239, first non-empty kappa=1 level @37 not @53), two ledger verdict lines and one note title rewritten, one proof step given BV's max-over-y form, the one-class freshness factor restated on P^-(m) >= q so it holds at every scour prime, and two mislabelled columns renamed; six corrections that land on live documents are collected here unapplied, and no producer was touched. | [applied-0828-engine.md](history/staging/applied-0828-engine.md) |\n| 8 | `Q-applied-0828-live` Which engine and head red-team corrections reached the live layer? | ANSWERED | Nineteen edits across four documents: the glossary's cap_K dimension count with its mandatory sifted-versus-assumed clause plus three new entries (twin opener, head, tail); the survey's one-class density factor, S1's restored pi(q-1) terms and r in N_x hypothesis, the dropped Chen absorption, Theorem C with its emptiness, dimension 1 for q_i < q, the comb-conditioning qualifier and the inverted shallow-band bullet; the certificate engine's equidistribution status cell, the q = T^{o(1)} second hypothesis and the Comb Discrepancy scope cell; and the census's R as the continuum functional with its three comparators; paper/staircase-note.md, TODO.md and QUESTIONS.md are owed and untouched. | [applied-0828-live.md](history/staging/applied-0828-live.md) |\n| 8 | `Q-buchstab-deep-0830` Can the certificate engine's deep-ladder Buchstab transfer be proven at dimension 2 at the depths the run levels reach by a route that does not go through the fundamental lemma at s >= 22.06 or the constant-free DH Theorem 9.1 (TODO 8a)? | CLOSED | NO by any instrument this corpus can cite, and the non-closing step is structural, not a constant: the transfer is an asymptotic for a ratio of two dimension-2 sifting functions at one sifting depth z = q, so a sieve bracket [f2, F2] survives undivided in the ratio (width 3.67 at the best sigma any level has, 4.71 at the @23 head); a correction \\|B - 1\\| >= 1% can only occur at sigma(q) < 1.8 where f2 = 0 and F2 >= 7.85, while a lower bound exists only at sigma > 4.266 where \\|B - 1\\| < 1e-5; the Buchstab identity iterated once is already negative at K = 1 for q = 37 at @23 and is the sieve itself when iterated fully; Jurkat-Richert fails Omega(1) as stated; in the certificate's legal direction F2 beats the trivial cap_K <= cap2 at 0 of 1512930 (q, K) pairs at @23, so the sharp-sieve floor is -1733138 at every K; the transfer stays HEURISTIC, what would move it is a kappa = 2 asymptotic in the open band 2 < sigma < 4.266, and part (b) is scoped and graded, not attacked. | [attack-0830-buchstab-deep.md](history/staging/attack-0830-buchstab-deep.md) |\n| 8 | `Q-buchstab-transfer` Is the certificate engine's Buchstab transfer provable in the shallow regime y = T^{o(1)}? | ANSWERED | PROVEN conditional on the fundamental lemma and EMPTY at every run level (needs s >= 22.06; available 4.7 @23, 17.1 @97); the engine's B is a dimension-1 object, the survey's pair-Buchstab is dimension 2, the certificate needs a third. | [thm-buchstab-transfer-shallow.md](history/staging/thm-buchstab-transfer-shallow.md) |\n| 8 | `Q-comb-discrepancy` Can the Comb Discrepancy Lemma's constant 2*3^k be tightened (TODO 8c)? | PARTIAL | The lemma IS the trivial per-block bound; the attained optimum is max G - min G, a computed number per level (slack 29x @23, 54x @29, growing); term-by-term pricing lifts the certified head share to about 28-29 percent, not the 50 hoped for. | [comb-discrepancy-tight.md](history/staging/comb-discrepancy-tight.md) |\n| 8 | `Q-comb-tail-0830` Can TODO item 8's remaining part (b), prime-comb equidistribution in the tail regime, be proven at the depths the certificate needs, or at least measured and priced at the enumerable levels (8b)? | PARTIAL | Not proven and no exponent moves: the tail defect is measured exactly for the first time (signed -0.01% of the tail main term at @23, -0.00% at @29, unsigned 0.60% and 0.25%, smaller than the head's 1.00% in aggregate but 8 to 37% per prime at its worst), the Comb Discrepancy Lemma's method fails in the tail on its MAIN TERM (off by a derived factor e^gamma(1/u - q^(1-u)), measured aggregate 1.14x at @23) before its error term (10^27 x main), the prime-comb Legendre form has 2^(k+2) terms of which the short ones obey the lemma's <1 bound and the long ones are prime-in-AP discrepancies whose term-by-term sum is 11.2% of main at @23 against a signed -0.01%; the all-x form at K = 0 is Theorem C (PROVEN, limit only) and at the certificate's depth K* the non-closing step is a kappa = 1 asymptotic at sifting parameter s < 2, a proof gap on data that show B_tail = 0.998-1.000 at K* through @29; the full-depth half is 8(a), CLOSED. | [attack-0830-comb-tail.md](history/staging/attack-0830-comb-tail.md) |\n| 8 | `Q-redteam-0828-engine` Do the five 2026-08-28 certificate-engine notes survive an adversarial re-derivation, and does the one-class freshness factor correction hold before it reaches a live document? | ANSWERED | The one-class factor holds and is stronger than either note states; four numbers are refuted (first s>=10.82 is x=263 not 239, first non-empty kappa=1 level is @37 not @53, rho*g_max is off by one gap, the @17 certified share and per-term constant carry the wrong convention) and one proof step needs the max-over-y form of BV; the cluster's shared verdict stands. | [redteam-0828-engine.md](history/staging/redteam-0828-engine.md) |\n| 8 | `Q-redteam-0830-engine` Do attack-0830-buchstab-deep.md, attack-0830-comb-tail.md and attack-0830-anchored-ladder-17.md survive an adversarial re-derivation on code that shares nothing with their producers, and does REFUTED row 97 stand as worded? | ANSWERED | Every headline number in the three notes reproduces exactly on independent code (26 of 26 comparisons, including F2/f2 = 3.6682 at sigma = 4.7088 by a near-analytic route, the 0-of-1512930 pair count, the tail defect at five levels, the full 419328-term Legendre split, and the whole @23 anchored ladder including K* = 27, floorU = 5364, truth 597475 and the minimal pool 1543 proven exact); one load-bearing DERIVATION is REFUTED — \"\\|B - 1\\| >= c forces sigma(q) < u_c - 1\" fails at @23 on 21134 (q, K) pairs for the engine's model B at c = 0.1 and on 33875 high-count pairs for the measured B at c = 0.01, because the step bounds every u in a weighted average by the largest one and treats the denominator as e^-gamma, so the \"level-free\" clause of buchstab-deep section 4 and REFUTED row 97's \"\\|B - 1\\| >= 0.01 forces sigma < 1.798\" must be re-graded from DERIVED to MEASURED-at-@23 (where the conclusion survives: the worst sigma is 2.159, still far below beta2 = 4.26645); row 97's \"the best sigma any level has\" is separately WEAKENED, since @29's head sigma is 5.5785 with width 1.5325 and @97's is 17.1422 with width 1.0000; comb-tail derives its main-term factor from prod (1 - 1/q_i) and measures it against prod (1 - 1/(q_i - 1)), which is what natal-cap-28 line 283 computes against its own line 20 and against certificate-engine.md section 1, a 0.9% difference at @23 that moves nothing certified; comb-tail also misquotes its own cited source as F1 in [1.5, 4] where that source says [1.5, 3] and says there is no bound at all at s < 1; four smaller slips are listed and none opens or closes a route. | [redteam-0830-engine.md](history/staging/redteam-0830-engine.md) |\n| 8 | `Q-sharp-sieve-range` Do the sharp sieve functions (Jurkat-Richert, DHR) make the two empty certificate-engine theorems non-empty at run levels? | CLOSED | NO at finite level: DH Thm 9.1 carries no written constant and the crude fundamental lemma is strictly better; as limit statements kappa=1 is first non-empty @37 (a 19.8-wide bracket; @53 is the first narrow one, 1.656) and kappa=2 @23. | [thm-sharp-sieve-range.md](history/staging/thm-sharp-sieve-range.md) |\n| 8 | `Q-u2-engine-depth` Is the certificate engine's operative depth heading to u = 2, and does that make TODO item 8's payout form TPC-strength? | ANSWERED | It is not: the measured operative depth runs u = 4.191 at @17 down to 3.557 at @97 and is still falling, so the brief's conditional does not fire and item 8 is shown neither TPC-strength nor safe; a WALL-ADDRESS in the weakest sense, every figure SCRATCHPAD-GRADE. | [u2-engine-depth.md](history/staging/u2-engine-depth.md) |\n| Z0 | `Q-applied-0828-census` Were the census red team's corrections applied to the three HELD notes? | ANSWERED | Every WEAKENED and REFUTED verdict in redteam-0828-census.md is applied to its target note in the present tense; two producer defects and four live-doc corrections stay open and are listed here. | [applied-0828-census.md](history/staging/applied-0828-census.md) |\n| Z0 | `Q-applied-0828-quadpoint` Were the quadpoint red team's corrections applied to the four HELD notes? | ANSWERED | Applied: the nine REFUTED and WEAKENED verdicts that target the four notes are written into them in present tense, with ledger blocks added; the tenth targets the sealed prereg, outside the fence, and is recorded in attack-quadpoint-02.md instead; three corrections owed by TODO.md Z2 and one by Z0 are listed here and are NOT applied. | [applied-0828-quadpoint.md](history/staging/applied-0828-quadpoint.md) |\n| Z0 | `Q-redteam-0828-census` Do destroyer-census-01.md, stretch-01.md and records-placement-01.md survive an independent re-derivation of every load-bearing claim, and may they leave HELD? | ANSWERED | All three survive on arithmetic, every decisive number reproducing exactly on an independent engine; one sealed reading (records READ-3) is REFUTED as vacuous and four sentences need correcting before integration. | [redteam-0828-census.md](history/staging/redteam-0828-census.md) |\n| Z0 | `Q-redteam-0828-quadpoint` Do the four HELD quadpoint notes of 2026-08-22 survive an adversarial pass: the capture identity's proof line by line, the depth law and its asymptote, the sealed prereg scoring, and the prior-art citations at page level? | ANSWERED | The identity is PROVEN once its window convention is written down and holds at every K of 50 anchors under an independent implementation; four load-bearing sentences are wrong (section 4's gloss on Sum capU, v1 section 2's limit, the prior-art note's 2%, and the note's unconditional y* sentences), and none of the four defects opens or closes a route. | [redteam-0828-quadpoint.md](history/staging/redteam-0828-quadpoint.md) |\n| Z0 | `Q-review-request-0907` Which claims of the 2026-09-07 session should an independent math agent check, in what order, against which records, and what must the review return? | ANSWERED | Reviewed 2026-09-08 by an outside reader (history/reviews-0907/10): ranked claims 1 (conditional on the unread 1974 page), 2, 4, 5, 6 verified within stated scope; claim 3 verified with its quoted tolerances corrected (max deviation 1.8e-4, not 1e-4 or 1e-5); the Corollary 1 slip sharpened (fails for every representative other than 1, and mis-signs even then); ASSUMED items 4 and 6 discharged, 2 partially, 1, 3, 5 not. Twin-prime infinitude and every sufficient signed margin remain OPEN. Ranked below: the §6.2 demotion in the two-class manuscript (a change to a proof's dependency), the D_y identity reading (a change to what a census can show), the Erdős #687 attribution, and the two measurement artifacts. Twin-prime infinitude and every sufficient signed margin remain OPEN. | [review-request-0907.md](review-request-0907.md) |\n| A9 (retired) | `Q-a9-histogram-operator` What is the exact evolution of the gap-size histogram under folding, as a transfer operator on count(d), and what is the tail P(gap >= 2p)? | ANSWERED | The operator is derived and then verified by exact computation at every fold from T5 to T31 and the tail law is computed exactly, but the machinery is a rediscovery of Holt and Rudd arXiv:1408.6002 section 5 and may not be presented as new; only the G2 spacing beyond their \\|s\\| < 2p restriction is ours. | [a3-09-histogram-operator.md](a3-09-histogram-operator.md) |\n| G (retired) | `Q-block-L-first-dead` Is the block-1 counting bound on L the first-dead 62 or the last-alive 111, and does downward closure hold in the block coordinate? | ANSWERED | Downward closure HOLDS in the block coordinate: L <= 62 is sound and recomputed from scratch rather than inherited, L <= 111 is true, implied by 62 and weaker by 1.79x, and the adjudication's supposedly sharper instrument is attack 3's instrument. | [adjudicate-L-bound.md](history/staging/adjudicate-L-bound.md) |\n| 1c (retired) | `Q-c2prime-drift` Why does c2' drift on the 22-term ladder? | PARTIAL | Class-count-blind (attack-c2drift-01 §1); on item 1c's own band x >= 41 the ten-point rate is unresolvable: c2' 0.3745 +/- 0.1411 against c1's 0.3344 +/- 0.2358 on the same primes, a difference of 0.0401 = 0.12 of the control's ten-point window sd. Whether the drift is real is NOT closed here: attack-c2drift-01 measured it at p = 0.0053 on x >= 17 and left (i)' and (ii) alive. exponent-control §2/§4/§6 refit at 22 terms. | [attack-c2drift-01.md](history/staging/attack-c2drift-01.md), [c2prime-refit-22.md](history/staging/c2prime-refit-22.md) |\n| 11 (retired) | `Q-capK-bv` Is the prime-regime cap_K over the full wheel an unconditional asymptotic via the fundamental lemma over Bombieri-Vinogradov? | ANSWERED | PROVEN at short-note grade for q_K = W^{o(1)}, and EMPTY in every computable range (needs s >= 10.82, first cleared at x = 263; the lemma's floor s >= 10 is first reached at x = 239); the deep ladder is untouched. | [thm-capK-bv.md](history/staging/thm-capK-bv.md) |\n| 11b (retired) | `Q-consolidation-wave` Can the five cost-class scripts be bound to their own output, and can U-FRAME's two lost tables be rebuilt? | ANSWERED | All four runnable cost-class embeds are bound and the hand-pasted-tail counter falls 19 to 15 with the gate at TOTAL 0; three needed --force at a cost of 24 tokens out of 211 with no value changed anywhere, and natal-cap-33-overnight.js is a three-run composite that should never have been on the cost list. | [consolidation-wave.md](history/staging/consolidation-wave.md) |\n| 10 (retired) | `Q-excess-chain-c` Does the excess chain's constant c pin to 1.074 via a compressed-tail max correction? | CLOSED | NO: for any FIXED correlation length the derived family tends to 1 and both named corrections lower the maximum, so 1.074 is not derivable from a compressed-tail max correction; c measures 1.05 +/- 0.07 (sd) over x = 17..31, MEASURED, which does not separate 1.05 from 1.074. | [excess-chain-c.md](history/staging/excess-chain-c.md) |\n| 1b (retired) | `Q-greedy-oracle` Is the corrected greedy a G2 oracle? | ANSWERED | ORACLE ESTABLISHED, 13 of 13 exactly-known terms hit with minimum ratio 1.0000, so the greedy RULE is an exact solver where the answer is checkable at x <= 41; the rider matters more, the search budget needed grows 3.31x per additional prime and two objects whose truth reaches further show the same estimator's fidelity DECAYING, so nothing is established for the greedy AS RUN on the ladder. | [greedy-oracle-validation.md](history/staging/greedy-oracle-validation.md), [phase1-T1-greedy-oracle.md](history/staging/phase1-T1-greedy-oracle.md) |\n| 4 (retired) | `Q-import-fracparts` Does Saffari-Vaughan Theorem 10 cover the branches carrying the Skeleton door's mass? | ANSWERED | Prediction HIT: the covered branches carry at most 8 percent of the mass; anchor and a sharper wall-address banked; the THEOREM column is struck, not merely overpriced, because Theorem 10's range condition is x^{6/11+eps} < y, which fails at fixed M; no route; no cap-36 line is upgraded. | [import-fracparts.md](history/staging/import-fracparts.md) |\n| 0e (retired) | `Q-ioslack-survey` Does any instrument in the corpus carry a sharp-level signature that would let the infinitely-often slack be spent? | CLOSED | None does: 23 instruments surveyed and 19 eligible, smallest per-instrument p_FWE = 0.1082 and 0.8865 after Šidák, so dial 4's fourth channel closes and the dial is finished; the second finding is that maxsum_{L+1} is sharp exactly when L = 1. | [ioslack-survey.md](history/staging/ioslack-survey.md) |\n| Z5b (retired) | `Q-lambda-ledger` Does parity information survive in the lambda-weighted fold ledger? | CLOSED | REJECT, against a pre-registered threshold fixed before the producer existed: the lambda multiplier exists and is parity-free, so the ledger is blind at its design point rather than at its margins; two columns are pinned by proof, and nothing here is novel mathematics. | [attack-lambda-ledger.md](history/staging/attack-lambda-ledger.md) |\n| Z5b (retired) | `Q-ledger-forced` Which properties of the fold ledger's columns are FORCED rather than expected? | ANSWERED | Fourteen forced constraints, all identities or wrong-direction bounds; by_new is forced only in the prime gap (its O(1) is MEASURED); nothing forces net from below. | [fold-ledger-forced.md](history/staging/fold-ledger-forced.md) |\n| 11 (retired) | `Q-mod30-tail` Are the BV survey's S1 (mod-30 tail) and S2 (fixed truncation and depth) provable as stated? | ANSWERED | Both PROVEN at short-note grade (no second reader) once S2's freshness factor is corrected to one class per prime, which needs only P^-(m) >= q > q_i and so holds at every scour prime, not only in the prime regime; tail constant 2 ln 2 -> (ln 2)/2; nothing in the head. | [thm-mod30-tail.md](history/staging/thm-mod30-tail.md) |\n| 3 (retired) | `Q-monotonicity-sweep` Does anything in the corpus assume certificate validity is monotone in L? | ANSWERED | One unsound artifact and one invalid inference: attack-beta2-04-loss-budget.js section 6 bisects on a predicate measured not upward-closed and is wrong at 3 of 5 levels, true first-crossings 30/72/132/174/210 against the reported 36/72/144/174/354, and redteam-DP1-certificate.js draws a global minimality conclusion from a two-point local check; corrected, worst-casing certifies within 1.00 to 2.00 of true G2 and the exponent penalty runs 0 to 0.27 and falls with x. | [monotonicity-sweep.md](history/staging/monotonicity-sweep.md) |\n| Z6 (retired) | `Q-records-placement` Do the seven unswept twin-gap records 76-82, above 2^53, land uniformly inside their stretches, or is there square-anchor coupling in record-start placement? | ANSWERED | Sealed alone before the producer existed: the uniform band, the fixed definitions, the registered readings, the calibration abort gate and the riders are all fixed here and no placement fraction, q or stretch boundary was evaluated; scored in records-placement-01.md. | [records-placement-01.md](history/staging/records-placement-01.md), [records-placement-02.md](history/staging/records-placement-02.md), [records-placement-prereg.md](history/staging/records-placement-prereg.md) |\n| 5 (retired) | `Q-shadow-amplitude` Where does the kill shadow's drift amplitude come from, and does the record's counting floor explain it? | MIXED (shadow-amplitude-prereg.md: OPEN; shadow-amplitude.md: PARTIAL) | The finite-y correction is an identity with no free parameter and both measurement routes agree 10 of 10, but the record's own counting floor is four to six times too small and its candidate explanation is the wrong half, so the label stays PARTIALLY EXPLAINED. | [shadow-amplitude-prereg.md](history/staging/shadow-amplitude-prereg.md), [shadow-amplitude.md](history/staging/shadow-amplitude.md) |\n| 5 (retired) | `Q-shadow-prereg` Is the kill shadow's 0.85 the band-average of the Unification-Law survival curve over the post-crystallization window? | ANSWERED | Scored in shadow-buchstab.md: SHAPE-ONLY under the original y >= 997 rule; D3 passes in the reported ten clusters but D1 fails near y = 1000 at 1.49 times the 0.011 tolerance. Later finite-y normalisation and counting-floor corrections do not promote this verdict. The pair-Buchstab identification remains conjectural; the pre-registration body is preserved. | [shadow-prereg.md](history/staging/shadow-prereg.md) |\n| 0d (retired) | `Q-single-alignment` Does the head's single-alignment fold recursion for M(x, x^3) give a proven-shaped handle on the per-fold multiplier that the max-over-alignments recursion lacked? | CLOSED | The answer splits: the multiplier IS different in shape, measured - exactly 1 at 225 of 240 folds from x = 53, total spend 1.09 nats against a tile-shaped ladder's 7.12, measured M(1613) = 2220 against a tile-shaped 3.7e5 - but the route to a growth law through the recursion closes anyway, because the growth is initiated by the window's expansion into fresh ground, a boundary term that is the localized gap problem re-posed and that no fold reaches. | [localized-single-alignment.md](localized-single-alignment.md) |\n| 4 (retired) | `Q-skeleton-decide-0830` Should TODO item 4, \"Skeleton Equidistribution: restate or demote\", be restated around the modulus-W mass or demoted off the board, and what exactly is banked either way? | ANSWERED | DEMOTE. Over every scour prime the branches on which the door is a fixed-modulus question carry 9.2, -0.9, 0.2 and 0.5 percent of the skeleton at @13, @17, @19, @23 (the -10.8 and 5.5 percent on record were 9 and 2 percent subsamples), so the door as named removes at most 0.0102 from a G30_agg whose open part is 0.094 to 0.126; on the open side the phase never wraps and no equidistribution statement remains, only the inequality; nothing on the live board consumes G30_agg < 1/2; no first move exists that is not already ANSWERED. Banked regardless: the Skeleton Collapse Theorem (PROVEN, all x, all q) and G30_agg < 1/2 CERTIFIED at six levels @11..@29. | [decide-0830-skeleton-door.md](history/staging/decide-0830-skeleton-door.md) |\n| 4 (retired) | `Q-skeleton-door` Is the Skeleton Equidistribution Conjecture the blocker on the anchored calm? | ANSWERED | It is not the blocker as far as the door can be seen: Theorem A (Trapezoid Cancellation) is proven for all x, q and branches, @29 is certified as an exact integer inequality at G30_agg = 0.1176 with margin 0.3824 over 7,863 scour primes, and the decay-law shortcut is REFUTED, the six levels being flat within their own spread with every fit made strictly worse by adding @29. | [natal-cap-36-skeleton-door.md](natal-cap-36-skeleton-door.md) |\n| Z3 (retired) | `Q-stretch-structure` What is the stretch S_q = [q^2, q'^2) as an object, where does the Stretch Postulate sit against the Zone Postulate, and does the square anchor's QR structure buy any density advantage? | ANSWERED | The implication chain and the QR kill law re-derive independently arrow by arrow; the anchor's structure is real, deterministic and redistribution-only (exactly two killed offset classes at every prime anchor checked), so there is structure and no advantage, and SP sits strictly above the strong Zone Postulate. | [stretch-01.md](history/staging/stretch-01.md) |\n| 0e (retired) | `Q-verify-monotone-depth` Does the Monotone Depth obstruction, which retires dial 4, survive an adversarial re-derivation? | ANSWERED | NARROWED: every measurement in the record reproduces, several to the last digit, but the mechanism as named is false as a general law and the corpus already holds a counterexample to it; what survives is an accounting of three channels priced in tenths of a nat against a need of 6.700, 8.191 and 9.637 nats, so dial 4 becomes priced slack with one channel open and unpriced. | [verify-monotone-depth.md](history/staging/verify-monotone-depth.md) |\n| 1e (retired) | `Q-wrongdirection-audit` Are any of the ten live targets secretly TPC-strength, before the sessions are spent on them? | ANSWERED | The audit closes no target: two of the ten come out TPC-strength and three more carry a TPC-strength face under a quantifier they are likely to drift into, which is a labelling result and not a reason to drop them; item 1e is settled only because the answer was already on disk, and one route-blocking number in it is hand arithmetic and unstamped. | [attack-wrongdirection-audit.md](history/staging/attack-wrongdirection-audit.md) |\n| Z3 (retired) | `Q-z3-immune` Do the square anchor's immune offset classes (stretch-01 §4) carry a survivor surplus beyond the redistribution-only guardrail, do they attract the floor's first survivor, and does restricting the transplanted caps to them lower K*? | CLOSED | No, on all three. The preregistered surplus test is VOID on its own matched control (a 0.6% ratio-of-means bias present with and without the quadratic point); the preregistered placement test HOLDS at Z = +0.49; the design-free class test reads the guardrail's r/(r-2) over 3.4 million twin openers with a largest per-prime deviation of 0.11% and per-prime Z in -0.48..+1.66; and the restricted certificate, while lowering K* at 61% of anchors, has no certificate at all at 93 of 1219 and is beaten head to head by the QR-BLIND restriction that certifies 1219 of 1219. The refinement is closed. | [attack-z3-immune-01.md](history/staging/attack-z3-immune-01.md) |\n| Z (retired) | `Q-zonegap-reduction` What must be proven for Z2, what already is, and what does the proven head machinery give the zone? | PARTIAL | The Zone Restriction Lemma is proven and verified at five levels - the in-zone twin slots of T_p ARE the in-zone twin primes, so Z2(p) IS the whole-tile gap object restricted to the head window - the three-slack chain is graded honestly, the transfer inventory is listed item by item, and the deep end is proven an onset desert over 24 levels; section 5 lists what was not reached. | [zonegap-02-reduction.md](history/staging/zonegap-02-reduction.md) |\n\n## 2. Every question, by id\n\n| id | status | question | verdict | TODO | records |\n|---|---|---|---|---|---|\n| `Q-0c-holesweep` | ANSWERED | At a fold, how does maxsum degrade copy by copy as the two deleted residues sweep through their possible positions? | The full curve is on disk for nine folds (5->7 through 31->37, every copy) and it is a PALINDROME: the Mirror-Sweep Lemma is proven here and verified exhaustively, giving the fingerprint any kill-count-free bound must reproduce, but no such bound was produced by this pass. | 0c | [attack-0c-holesweep.md](history/staging/attack-0c-holesweep.md) |\n| `Q-0c0e-level-selection` | CLOSED | Can a residue-deleted maxsum bound that only has to hold at levels of the argument's choosing carry the weak Zone Postulate? | CLOSED, and the mechanism has a name: the level-selection licence is worth 0.3187 nats once and is falling, no selection rule beats its own null by anything worth having across T_11..T_29, and the BV/EH sweep supplies no moduli-selecting statement to spend. | 0c, 0e (retired) | [attack-0c0e-level-selection.md](history/staging/attack-0c0e-level-selection.md) |\n| `Q-DP1-mechanism` | ANSWERED | Does anything consume two-point data about a sifted set? | One consumer exists and is priced: the sharp degree-2 Boole-Frechet bound on empty windows is unconditional and concludes at every window position, but it over-certifies G2 with a log-log slope of +5.20 against x over x = 5..19, so the price of stopping at two-point data grows as a power of x rather than as a constant. | none | [attack-DP1-mechanism.md](history/staging/attack-DP1-mechanism.md) |\n| `Q-L-own-law` | ANSWERED | Does L, the adjacent-kill run length, have a law of its own level by level, and which abscissa is it linear in? | L has no law of its own: (L+1)*mbar(T_v) is approximately G2(y#) at every tile and top prime where both sides are exact, spread 1.0000 to 1.0838 over four tiles at y >= 23 with mean 1.0198, so the residue is quantisation, the abscissa question returns a calibrated negative, and the distance to 529 is priced rather than closed. | none | [attack-L-law.md](history/staging/attack-L-law.md) |\n| `Q-L-subadditivity` | ANSWERED | Is L sub-additive when two prime sets merge, as the intuition that L should be smaller for the combined set suggests? | Read literally the intuition is wrong by a one-line proof rather than an edge case: L is super-additive, exhaustively censused to nine primes; read as a statement about reusing primes it is right, and that reading is worth more than the refutation. | none | [attack-L-subadditivity.md](history/staging/attack-L-subadditivity.md) |\n| `Q-T2a-prediction` | PARTIAL | What are G2(43#) and G2(47#), predicted blind from the thirteen exact terms? | Registered blind: G2(43#) central 630, window 561 to 747, and G2(47#) central 720, window 653 to 868, with the method's calibration PASSING on the eight-term prefix; the 43# term has since been enumerated at 618, inside the window and below the central value, and 47# remains unmeasured, with the report's own largest risk being that c2' may be about to turn down. | none | [phase1-T2a-prediction.md](history/staging/phase1-T2a-prediction.md) |\n| `Q-W1a-applied` | ANSWERED | Were the unapplied findings for partition A, the paper suite and citation-heavy files, applied? | Thirty-three findings, 24 applied, 3 refused at a primary source (two of which would have written a falsehood into the corpus) and 6 handed back; the most consequential item was not on the list, since covering-dive's stated reason for dismissing Kalmynin-Konyagin was false by the corpus's own proof and the corrected reason had to be found rather than copied. | none | [phase1-W1a-applied.md](history/staging/phase1-W1a-applied.md) |\n| `Q-W3-literature` | ANSWERED | What do the four literature targets give: the Omega(kappa, L) quantifier, the Kalmynin-Konyagin transfer, Erdos-Ruzsa 1980, and the two-class upper bound? | The quantifier is over all pairs, confirmed verbatim in two independent sources, and every page and section citation in beta2-note checks out; the higher-consequence find is that covering-dive's stated reason for dismissing Kalmynin-Konyagin is false, since the proof only sees the size of Omega_p, and the two-class upper bound survives a second independent attempt as ABSENT. | none | [phase1-W3-literature.md](history/staging/phase1-W3-literature.md) |\n| `Q-X-upper-0829n` | PARTIAL | Can the rough-pair census X(K) on the stretch window be bounded above, unconditionally and with an explicit error term, by a dimension-2 upper-bound sieve, and how loose is the bound against exact X(K)? | Yes, as a theorem with nothing open (Selberg's Λ² inequality with a remainder bounded by the interval structure alone, VERIFIED at all 10908 anchor-depth pairs), but it is loose by 7.82 to 10.13 against exact X(K) at the band depths, decomposed as a sieve loss 1.78 to 2.53 times a structural loss 4.01 to 4.39 that no upper-bound sieve can remove, the window holds the level below z² (s_max 1.81 to 1.96) so the bound stops improving past p_K = 31 to 61, its main term is the sifting function's and not the census's, and the drift is a crossing quantity outside the legal half and is not evaluated. | Z2 | [attack-0829n-X-upper.md](history/staging/attack-0829n-X-upper.md) |\n| `Q-a144311-vocabulary` | ANSWERED | In the vocabulary the literature actually uses, is there a published upper bound for G2, and is beta2 still the best known kappa = 2 sifting limit? | The terms of art are the paired Jacobsthal function and Jacobsthal-type functions for polynomials, and in that vocabulary no published upper bound exists at any exponent, beta2 is unimproved since 2008, nothing is found on A144311's asymptotic growth, and an Erdős-Rankin lower bound is free; both load-bearing corpus claims survive. | none | [audit-a144311-vocabulary.md](history/staging/audit-a144311-vocabulary.md) |\n| `Q-a3-05-bound-L` | PARTIAL | Can L be bounded unconditionally from run consistency, and where does that stop? | Theorem B gives the first unconditional bound, L <= 1 + m*, sitting 0 to 3 above the truth at all eight measured folds, but it is of order G2(old)/p, which is linear in x on the fold diagonal; section 8 locates the wall at one large-deviation hypothesis H″ the residue side cannot reach, and Theorem C inherits it for kappa(m). | none | [a3-05-bound-L.md](a3-05-bound-L.md) |\n| `Q-a9-histogram-operator` | ANSWERED | What is the exact evolution of the gap-size histogram under folding, as a transfer operator on count(d), and what is the tail P(gap >= 2p)? | The operator is derived and then verified by exact computation at every fold from T5 to T31 and the tail law is computed exactly, but the machinery is a rediscovery of Holt and Rudd arXiv:1408.6002 section 5 and may not be presented as new; only the G2 spacing beyond their \\|s\\| < 2p restriction is ours. | A9 (retired) | [a3-09-histogram-operator.md](a3-09-histogram-operator.md) |\n| `Q-ab-coupling` | MIXED (attack-ab-coupling.md: PARTIAL; verify-ab-coupling.md: ANSWERED) | How much of the counting criterion's known slack does the rigidity of the two kill channels A = 0 mod p and B = -2 mod p close? | The pilot survives, every held number reproducing on an independent code path, and the one correction is in its favour: the depth-3 ceiling is 38 slots, not 39; the LP answers NO, its exact depth-2 optimum over the full polytope being 54 slots, identical to the pilot's, so it prices the idea and does not clear 51. | none | [attack-ab-coupling.md](history/staging/attack-ab-coupling.md), [verify-ab-coupling.md](history/staging/verify-ab-coupling.md) |\n| `Q-adversary-wave2` | ANSWERED | Do the four same-evening headlines (kill shadow, scanstat, sofic, Shearer) survive a refute-first adversarial pass? | Nothing BROKEN: sofic SURVIVES and the other three SURVIVE WITH CORRECTIONS, the corrections being one verdict label a grade too high by the record's own prereg rule, three false custody sentences and an oversold prediction, a misdescribed extremal witness, and an atomicity hypothesis that is load-bearing and not shown. | none | [adversary-wave2.md](history/staging/adversary-wave2.md) |\n| `Q-advmin-1113` | CLOSED | Can joint caps quantified over classes recover the staircase-to-truth gap at @11 and @13? | CLOSED at @11: the adversarial minimum for the whole family is 16, below the class-blind ceiling and 18 under the staircase floor of 34, which also refutes the task's own framing that it would sit between floor and truth; at @13 the same family is priced at advmin <= 152. | none | [attack-advmin-1113.md](history/staging/attack-advmin-1113.md) |\n| `Q-agent-start` | ANSWERED | What must an incoming agent read and preserve before continuing the reviewed arithmetic campaign? | Onboarding and document ownership only. The second dispatch is completed and independently reviewed on 2026-09-09. RESEARCH-EXECUTION.md owns current dispositions and candidate next obligations; RESEARCH-HANDOFF.md owns the updated exact contract. No assignment is started by that review. Twin-prime infinitude and required signed estimates remain OPEN. | C | [AGENT-START.md](AGENT-START.md) |\n| `Q-anchored-calm` | PARTIAL | What is proven about the anchored calm, and what is not? | The calm names a phenomenon and never a claim: the Mirror-Sibling, Fusion, Mirror-Phase Doubling and Minus-Half results are PROVEN at all x and all scour q, the phenomenon itself is MEASURED (the anchored rotation at rank 2 of 510,510 at @17), and two things stay unproven, of which the Skeleton Equidistribution Conjecture is one. | none | [anchored-calm.md](anchored-calm.md) |\n| `Q-anchored-ladder` | ANSWERED | Does the unified anchored ladder generalize past @11 and @13, and what does cheap K buy at each level? | It generalizes verbatim to @17 and @19, and the K = 0 unified floor is DEAD there (vacuous at -1262 and -55865); what survives and grows is the family lead at the classic certification depth K*, margin +2, +5, +26, +110 across @11 to @19. | A | [attack-anchored-02.md](history/staging/attack-anchored-02.md) |\n| `Q-anchored-ladder-17-0830` | ANSWERED | At @17 and above, at which depth K does the composed (unified) anchored floor first turn positive and at which K does it reach the truth, and does the depth-cost curve K_first_positive(level), K_truth(level) move with level? | At @17/@19 the answer was already on record (Q-anchored-ladder: positive at K = 2/10, truth at ascending K = 109/410, minimal pool 88/350) and is re-derived here as the custody gate; the new level @23 ran under a sealed 14-of-14 forecast: positive first at K = 27 = K* (PROVEN from the record before the run), truth at ascending K = 1732 of 1739, minimal pool 1543 = 0.887 of the scour (PROVEN lower bound meets VERIFIED upper bound); across five levels positivity costs exactly K* while the truth fraction rises 0.40, 0.62, 0.73, 0.81, 0.89, a MEASURED finite table with no law in x and no exponent touched. | A | [attack-0830-anchored-ladder-17.md](history/staging/attack-0830-anchored-ladder-17.md) |\n| `Q-anchored-unify` | ANSWERED | Can the three anchored mechanics be unified at @11, and what floor family does the unified cap certify? | MEASURED and PROVEN-here but HELD: extending the staircase's cofactor injection to m = 1 folds the self-strike allowance into the count, the unified-cap lemma gives fresh <= capU_K <= cap_K at every depth and prime at @11 and @13, and the floor family runs 36 to 45; the x = 37 secondary is a clean negative. | A | [attack-anchored-01.md](history/staging/attack-anchored-01.md) |\n| `Q-anchored-vs-global-gap` | CLOSED | Is the anchored gap A(v) = F(v) - v easier to bound than the global gap G2(v#)? | The separation is real and correctly measured but worth exactly one unit of exponent against a deficit of 2.2665, and the anchored quantity's only proven bound is beta_2 = 4.26645, the IDENTICAL theorem rather than a consequence, because the DHR sieve is position-uniform; so the anchored object sits further from its bound, and Proposition D is a closure at today's exponent only. | none | [attack-block-09-anchored.md](history/staging/attack-block-09-anchored.md) |\n| `Q-anchored-windows` | SUPERSEDED | How much does anchoring at the origin enrich a window against a random window, and for how long? | SPENT, live treatment is paper/anchored-note.md: Theorems A-C proven (A and B unconditional, C's constants HL-conditional), anchored enrichment bounded by e^{2gamma} = 3.172 and mortal, the head-window dip constant e^{2gamma}/4 = 0.79305 with 0.89 a finite-size blend; the kill shadow is no longer a separate object and section 3's peak sequence remains unreproduced. | none | [anchored-windows.md](anchored-windows.md) |\n| `Q-applied-0828-backfill-1` | ANSWERED | Which legacy notes in chunk 1 received ledger blocks? | All 86 notes in the chunk received a block and none was skipped; 85 distinct question ids were minted, no id was reused from QUESTIONS.md section 2, and two notes were chained onto one shared id. | none | [applied-0828-backfill-1.md](history/staging/applied-0828-backfill-1.md) |\n| `Q-applied-0828-backfill-2` | ANSWERED | Which legacy notes in chunk 2 received ledger blocks? | 85 of the 86 notes in chunk 2 carry a block; only GLOSSARY.md was left unindexed, as a vocabulary registry that poses no question, and one id (Q-records-placement) was reused from QUESTIONS.md section 2 with its question text copied exactly. | none | [applied-0828-backfill-2.md](history/staging/applied-0828-backfill-2.md) |\n| `Q-applied-0828-backfill-3` | ANSWERED | Which legacy notes in chunk 3 received ledger blocks? | All 86 notes in the chunk carry a block; none was skipped, one id (Q-quadpoint-transplant) is reused from QUESTIONS.md section 2 with its question text copied exactly, one id (Q-f-census) is shared by the two notes of the f-from-census chain, and seven blocks name a TODO item whose Ledger line does not yet list them. | none | [applied-0828-backfill-3.md](history/staging/applied-0828-backfill-3.md) |\n| `Q-applied-0828-backfill-4` | ANSWERED | Which legacy notes in chunk 4 received ledger blocks? | All 85 notes of chunk 4 carry a ledger block, none reuses an id already in QUESTIONS.md section 2, and none was left unclassified. | none | [applied-0828-backfill-4.md](history/staging/applied-0828-backfill-4.md) |\n| `Q-applied-0828-census` | ANSWERED | Were the census red team's corrections applied to the three HELD notes? | Every WEAKENED and REFUTED verdict in redteam-0828-census.md is applied to its target note in the present tense; two producer defects and four live-doc corrections stay open and are listed here. | Z0, Z4, Z6 (retired) | [applied-0828-census.md](history/staging/applied-0828-census.md) |\n| `Q-applied-0828-closures` | ANSWERED | Were the closures red team's corrections applied to the five HELD notes? | Applied. 47 prose corrections across the five notes; c2prime-refit-22 drops from CLOSED to PARTIAL and three ledger verdicts are rewritten; four producer READINGS blocks and eleven live-document lines carry the same defects and are listed here uncorrected, behind the fence. | 10 (retired), 1c (retired), 1d, Z5b (retired), 0 | [applied-0828-closures.md](history/staging/applied-0828-closures.md) |\n| `Q-applied-0828-engine` | ANSWERED | Were the engine red team's corrections applied to the five HELD notes? | Applied, 37 edits across the five notes: two numbers corrected (first s >= 10.82 at x = 263 not 239, first non-empty kappa=1 level @37 not @53), two ledger verdict lines and one note title rewritten, one proof step given BV's max-over-y form, the one-class freshness factor restated on P^-(m) >= q so it holds at every scour prime, and two mislabelled columns renamed; six corrections that land on live documents are collected here unapplied, and no producer was touched. | 11 (retired), 8 | [applied-0828-engine.md](history/staging/applied-0828-engine.md) |\n| `Q-applied-0828-glossary` | ANSWERED | Was the hyperuniformity conflation corrected? | In the vocabulary yes: GLOSSARY's single entry is split into Sub-Poisson window counts (Var/E), which keeps every measured value, and Hyperuniformity, which now carries Torquato's definition, the class I/II/III taxonomy, the tile's vacuous class I by periodicity and the sub-Poisson-not-hyperuniform reading at L = y^u; in the corpus no, one staging note is corrected here and ten further loose uses in nine .md files plus eighteen in seven scripts sit outside the fence with their replacement sentences listed below. | none | [applied-0828-glossary.md](history/staging/applied-0828-glossary.md) |\n| `Q-applied-0828-head` | ANSWERED | Were the head red team's corrections applied to the three HELD notes? | Applied. Every WEAKENED and REFUTED row of redteam-0828-head.md lands in the note it targets as 42 prose edits, and all three ledger verdict lines now carry the surviving chain; four corrections fall outside the fence and are owed elsewhere, the load-bearing one being destroyer-census-01 §6(b)'s R and its h/R = 1.09 -> 1.03. | Z4 | [applied-0828-head.md](history/staging/applied-0828-head.md) |\n| `Q-applied-0828-litimports` | ANSWERED | Were the lit/imports red team's corrections applied to the six HELD notes? | Applied, 64 substantive edits across the six notes: the Saffari-Vaughan range exponent is 6/11 in both import notes, the fixed-M THEOREM in import-fracparts is struck and the cap-36 MEASURED to PROVEN upgrade withdrawn, row 15 loses its theorem column and row 16 is regraded stale, and the six weakened sentences in the four literature notes now read as the audit requires; four claims are declined with reasons, and nine live documents plus two fenced staging notes are recorded here as owing corrections that this pass did not apply. | Z5, 4 (retired) | [applied-0828-litimports.md](history/staging/applied-0828-litimports.md) |\n| `Q-applied-0828-live` | ANSWERED | Which engine and head red-team corrections reached the live layer? | Nineteen edits across four documents: the glossary's cap_K dimension count with its mandatory sifted-versus-assumed clause plus three new entries (twin opener, head, tail); the survey's one-class density factor, S1's restored pi(q-1) terms and r in N_x hypothesis, the dropped Chen absorption, Theorem C with its emptiness, dimension 1 for q_i < q, the comb-conditioning qualifier and the inverted shallow-band bullet; the certificate engine's equidistribution status cell, the q = T^{o(1)} second hypothesis and the Comb Discrepancy scope cell; and the census's R as the continuum functional with its three comparators; paper/staircase-note.md, TODO.md and QUESTIONS.md are owed and untouched. | 11 (retired), 8, Z4 | [applied-0828-live.md](history/staging/applied-0828-live.md) |\n| `Q-applied-0828-quadpoint` | ANSWERED | Were the quadpoint red team's corrections applied to the four HELD notes? | Applied: the nine REFUTED and WEAKENED verdicts that target the four notes are written into them in present tense, with ledger blocks added; the tenth targets the sealed prereg, outside the fence, and is recorded in attack-quadpoint-02.md instead; three corrections owed by TODO.md Z2 and one by Z0 are listed here and are NOT applied. | Z0, Z2 | [applied-0828-quadpoint.md](history/staging/applied-0828-quadpoint.md) |\n| `Q-applied-0828-queue0827` | ANSWERED | Were the 2026-08-27 drafted corrections applied? | Eighteen edit entries applied across six files, the Wu band-label inference and the saturation claim being the load-bearing ones; six proposals declined, two on ownership, one because the brief forbids promoting its note, one as already carried in paraphrase, one on an unverified inferred theta-law, and one because two scratchpad notes disagree on the number. | none | [applied-0828-queue0827.md](history/staging/applied-0828-queue0827.md) |\n| `Q-applied-0828-registries` | ANSWERED | Which lit/imports corrections reached the registries? | 13 edits across six files, plus one appended changelog section: IMPORT-MAP gains rows 15 (no THEOREM, the column struck), 16 (STALE) and 17 (CLOSURE, two-sided) with its three counts recounted to seventeen rows; SEARCH-CONVENTIONS gains the Kourbatov-b, generalized-Dickman and VC-of-multiples rows with each channel's calibration state; import-map-construction's determinantal cell, natal-cap-36's separate-census sentence, one REFUTED row and one PRIOR-ART block are corrected; GLOSSARY, TODO, QUESTIONS, the five loose hyperuniformity documents and two staging notes are left for their holders and listed here. | Z5, 4 (retired) | [applied-0828-registries.md](history/staging/applied-0828-registries.md) |\n| `Q-applied-0828-registries2` | ANSWERED | Which queued registry corrections were applied? | 15 edits across four files: SEARCH-CONVENTIONS gains four §1 rows (the census as a pretentious correlation with the Chowla warning, Boolean analysis on the CRT product, covering a cyclic group by translates, the fractional parts of N/n) and five §3 rows, plus one pipe fix that was hiding a clearing phrase from the gate; import-rough-anatomy's λ₁ → λ₂ comparand is corrected in four places, 12–23× becoming 2.11 to 2.86×; lit-dickman-variance §6.3's \"row 15\" is disambiguated to the drafted row it means; IMPORT-MAP's circularity and payoff tallies are recounted and now sum to seventeen; REFUTED.md needed no edit and got none. | none | [applied-0828-registries2.md](history/staging/applied-0828-registries2.md) |\n| `Q-applied-0828-todo-prune` | ANSWERED | Which TODO items left the file under its charter after 2026-08-28? | Five left (11, 10, 1c, 1e, Z5b), nine were restated on what remains (Z2, Z4, Z5, Z6, Z7, Z0, A, 0, 1d, 4, 8), the rest stand; every retained Ledger line is verbatim, no claim's rung moved, and eleven notes now need `(retired)` on their todo lines before the gate is green. | none | [applied-0828-todo-prune.md](history/staging/applied-0828-todo-prune.md) |\n| `Q-applied-0828-varE` | ANSWERED | Were the Var/E red team's corrections applied to the four HELD notes? | Every WEAKENED and REFUTED verdict in redteam-0828-varE.md is applied to its target note in the present tense; four ledger verdicts are rewritten, the theta=1 row is raised to PROVEN, and seven live-doc sentences plus one producer reading stay open and are drafted here. | 9 | [applied-0828-varE.md](history/staging/applied-0828-varE.md) |\n| `Q-applied-0829-ledger` | ANSWERED | Were today's notes linked into the question ledger's TODO guard, the Z2 draft's last two non-fit lines fixed, and the covering-prune root corrected? | All three landed and none of them moves a result: nine of thirty notes read now name the TODO item their move executes and four TODO items carry the new ids, so `node research/qc.js` reports the ledger check clean at 0 findings; the Z2 draft's legal items 3 and 4 carry the audit's instrument rider and the quantifier-police clause the red team asked for; and the covering-prune producer now computes the root of a*ln(a/e) = 1 instead of quoting it, giving a = 3.5911214767 and a divergence constant of 7.1822 lnln x against the 7.19 the file carried, a 0.08 per cent change with nothing downstream consuming it. | none | [applied-0829-ledger.md](history/staging/applied-0829-ledger.md) |\n| `Q-applied-0829-measure-a` | ANSWERED | Were red team A's corrections applied to the notes it reviewed? | Of the nine APPLY items in redteam-0829-measure-a.md §3a-3c, seven were applied here as exact string edits, two (E1 and E5) were verified as already applied by the producing agent with a producer fix and a forced re-embed, one clause of E1's proposed wording is left unapplied and is recorded as owed, and the four live-document items of §3d plus the QUESTIONS.md regeneration are left for the orchestrator; node research/qc.js returns TOTAL 0 across all thirteen checks after the edits. | none | [applied-0829-measure-a.md](history/staging/applied-0829-measure-a.md) |\n| `Q-applied-0829-measure-b` | ANSWERED | Were red team B's corrections applied to the notes it reviewed? | 17 of 17 APPLY items whose target is a staging note are applied in place, 2 ledger verdict lines rewritten as the red team specified (measure-record-null2-0829 and zone-tail-02-0829), 3 HOLD/DECLINE items deliberately not applied, 5 live-document items left verbatim for the orchestrator, and 3 producer items recorded as OWED without touching any .js; the fast gate returns 0 findings after the pass, the single mid-pass finding having belonged to another agent's file, research/measure-g2z2-0829.js:432, and never to any edit made here. | none | [applied-0829-measure-b.md](history/staging/applied-0829-measure-b.md) |\n| `Q-applied-0829-measure-c` | ANSWERED | Were red team C's corrections applied to the notes it reviewed? | 22 of the 25 items in section 3 target the four HELD staging notes and all 22 are applied (21 as the exact old-text to new-text strings the red team wrote, 1 as a minimal carry because filling its column for all nineteen rows would be a fresh grading judgement rather than a citation), plus 1 directed edit to lit-scourfield-2008.md section 0 that red team section 1g names and section 3 gives no string for; 3 items are flagged HOLD and are left verbatim for the orchestrator (varE-theta2-proof.md, lit-smooth-divisors.md, SEARCH-CONVENTIONS.md); 1 producer item is OWED and untouched, since the producer's readings 13 and 14 still carry the M-P1 failure that E8 and E9 reverse in the note and correcting them needs a re-embed; node research/qc.js returned TOTAL 1 on the run straight after the edits, the one finding being research/measure-g2z2-0829.js:432 in another agent's file, and TOTAL 0 on the run after this note was written, with refs, quotes and ledger clean on both. | none | [applied-0829-measure-c.md](history/staging/applied-0829-measure-c.md) |\n| `Q-applied-0829-refuted` | ANSWERED | Were the four refuted-claims audits' APPLY row rewrites applied to REFUTED.md? | 25 of the 27 APPLY items are in the file, 1 more merged into a sibling's text at the shared boundary row, 1 deferred to the in-progress red team, 7 HOLD items untouched and listed here for Chris, 4 items owed outside REFUTED.md; the table still holds exactly 67 data rows and qc.js reports refs 0 and crosslinks 0. | none | [applied-0829-refuted.md](history/staging/applied-0829-refuted.md) |\n| `Q-applied-0829-registries` | ANSWERED | Were the registry debts of 2026-08-29 (IMPORT-MAP rows, the PRIOR-ART spectrum line, the escape labels, the REFUTED HOLD proposals) landed? | All four debts are discharged as far as a non-adjudicating pass may take them: IMPORT-MAP carries rows 20 and 21 at CLOSURE-plus-anchor and anchor-plus-wall-address with nothing opened, PRIOR-ART's Holt-Rudd attribution now names the printed spectrum and the SCRATCHPAD-GRADE 2.82/ln p mixing rate with priority stated as Holt and Rudd's, recon-0829-escapes.md section 6 carries all sixteen owed (i)/(ii)/(iii) labels of which nine are fresh judgements and three come out (ii), and three of the seven REFUTED HOLD proposals were applied as wording and calibration while four are left verbatim for Chris because they touch a producer, a canonical file, a cross-file number or the index's format; the table stands at 67 rows and qc.js is 0 on refs, crosslinks, calibration and search-convention. | none | [applied-0829-registries.md](history/staging/applied-0829-registries.md) |\n| `Q-applied-C` | ANSWERED | Which wave-2 consistency findings were applied to the paper suite? | Applied across the seven paper/ files with post-edit line numbers, plus a CHRIS-DECIDES list, handoffs to other partitions and one unresolved item: two scopes for the Cov_adj anticorrelation exception count, both now printed, one of which should be checked and the other dropped. | none | [applied-C.md](history/staging/applied-C.md) |\n| `Q-applied-G` | ANSWERED | Which wave-3 partition G findings were applied, and what did the pass find on its own? | Applied to the eleven owned files: the OEIS off-by-one confirmed and provable four ways, a factor of two found in the seam draft's Hardy-Littlewood heuristic, the L gap corrected in three files from a flat 0.58 ln p to the home's 0.58 to 0.95 ln p range, seven orphans swept, and one supplied answer refused as wrong before it reached a header banner. | none | [applied-G.md](history/staging/applied-G.md) |\n| `Q-applied-Q` | ANSWERED | Do the two OEIS drafts survive an instrument that recomputes them rather than reads them? | Two defects found in the G2 draft (the Maier-Pomerance conjecture cited in the wrong direction, and a no-upper-bound-published claim the repository itself contradicts) plus a third error class routed from partition P; every DATA term was recomputed and audit-numbers went from 37/39 to 76/78 checks. | none | [applied-Q.md](history/staging/applied-Q.md) |\n| `Q-applied-wave2-A` | ANSWERED | Which wave-2 partition A corrections were applied, and to which files? | Five jobs applied across G2-STATE.md, LOCALIZED-GAP.md, maier-matrix.md and origin-excess.md, with partition A's own qc columns at 0 on every check afterwards; handoffs to other partitions and one decision needing Chris are listed rather than guessed. | none | [applied-A.md](history/staging/applied-A.md) |\n| `Q-applied-wave2-B` | ANSWERED | Which wave-2 partition B corrections were applied to U-FRAME.md, ATTACKS3.md and gate-multiplies.md? | Applied with the U-FRAME section map preserved (128 inbound pointers, 47 on 5a, nothing renumbered), the strategic contradiction resolved, statistics corrected, one dead quotation removed and two further corrections to the record found on the way; section 12 lists what stayed unresolved. | none | [applied-B.md](history/staging/applied-B.md) |\n| `Q-applied-wave2-D` | ANSWERED | Were wave-2 partition D's findings applied to the eight entry-path documents? | Applied across all eight files with qc total 22 to 21 and one refs finding of its own (a framework bug), two transfers pairs word-diffed; the em-dash scope question and one GLOSSARY entry are flagged as judgement calls rather than omissions, and other partitions were live in the same tree so the deltas are not all this partition's. | none | [applied-D.md](history/staging/applied-D.md) |\n| `Q-applied-wave2-E` | ANSWERED | Which wave-2 partition E corrections were applied, and to which files? | Seven jobs applied across covering-dive, two-class-lower-bounds, PRIOR-ART, sift-limit-attack, theta-ladder, maxgap-law and dhr-verification, with refs and quotes at 0 in this partition before and after; one novelty verdict in a publication-track file is weakened by de Polignac 1849 and flagged for Chris. | none | [applied-E.md](history/staging/applied-E.md) |\n| `Q-applied-wave2-F` | ANSWERED | Which wave-2 partition F corrections were applied to the natal-cap family and its compound claims? | Applied across nine natal-cap files with two new homes created (anchored-calm.md and certificate-engine.md); the Fused-Window Calm Lemma was decomposed and its name retired, the X-limitation theorem's scope is confirmed a scope error, and the refutation is recorded as bigger than it had been reported. | none | [applied-F.md](history/staging/applied-F.md) |\n| `Q-applied-wave3-H` | ANSWERED | Were wave-3 partition H's U-FRAME sections 10-12 split into child documents? | Split and applied: U-FRAME falls 1,032 to 772 lines with three children created, but the corpus as a whole is 87 lines larger and that must not be reported as a shrink; refs and crosslinks stay at zero and no transfers finding exists between any stub and its child. | none | [applied-H.md](history/staging/applied-H.md) |\n| `Q-applied-wave3-I` | ANSWERED | Was the flagship paper split as wave 3 partition I directed, and what did the split expose? | Split into paper/moire-primes.md and the new paper/wall-note.md, with every deliberate change to moved text word-diffed; three open defects sit inside the split, two of them already landed and one not, and the judgement calls are listed so they can be overruled. | none | [applied-I.md](history/staging/applied-I.md) |\n| `Q-applied-wave4-P` | ANSWERED | Which calibration defects sit on a3-05-bound-L.md, localized-04-maxsum.md and level-ledger-tight.md, and were they fixed? | Fourteen defects found and fixed on the one axis wave 3 never ran, none of them reachable by any check in qc.js: two numbers contradicting the file's own pasted script output, one slot count against thirteen other sites and an exact closed form, one superseded sifting limit and three dropped scopes; the gate stayed at zero on all six checks. | none | [applied-P.md](history/staging/applied-P.md) |\n| `Q-at43-bigint-0830` | PARTIAL | Can the K-30 natal march be carried past its 2^53 ceiling to @43 exactly, and is the @43 point worth its cost? | The engine side is done and VERIFIED (five paths promoted to BigInt, @7..@37 and a 0.248% slice of @41 reproduced digit for digit); the @43 point is NOT run, because the measured extrapolation is 579 h of eight cores on this machine (a 43x tile times a 2.23x per-cell cost, against the brief's ~13x), which is a weeks-class box job whose only payoff is a sixth point on a curve with no consumer; the forecast 0.8393 raw / 0.8399 persisted stands unscored. | 1 | [engine-0830-at43-bigint.md](history/staging/engine-0830-at43-bigint.md) |\n| `Q-attacks-wall-ten` | ANSWERED | Which ten attacks on the frontier-zone wall were executed, and what did each return? | All ten are marked DONE with their learnings recorded; none breached the wall, parity stands, and the durable yields are attack 8's unconditional small-gap theorem for p >= 17 and the anchored-origin phase picture. | none | [ATTACKS.md](ATTACKS.md) |\n| `Q-attacks2` | ANSWERED | What did the ten copy-geography attacks of the second wave find? | All ten complete: one theorem-grade result (the Exact Invariance Lemma, fossil depth frozen at birth, proved independently twice) and one MEASURED, Hardy-Littlewood-conditional law (the Unification Law, to about 1 percent); no unexplained novelty survives and the wall stands. | none | [ATTACKS2.md](ATTACKS2.md) |\n| `Q-attacks3-uframe` | ANSWERED | What did the ten-attack u-frame wave (A1-A10) settle about the fold structure and the Zone Postulate? | The R/I split held: every residue attack returned an exact object and no interval attack moved; the additive chain G2(new) <= G2(old) + L*mbar it was framed around is itself REFUTED (U-FRAME 5a step 4), A5's Theorem B is structurally capped, and A10's exactness route is a dead end (rate 0.927 over 329 cells, excess 6..120 not shrinking). | none | [ATTACKS3.md](ATTACKS3.md) |\n| `Q-audit-campaign` | ANSWERED | Does the campaign archive layer - the natal-cap notes, ATTACKS, covering-dive and their neighbours - hold internal inconsistencies? | Six files and eight of the natal-cap notes are clean and need no change; the remainder carry per-file findings recorded in place, and this is a diagnosis pass rather than an edit. | none | [audit-campaign.md](history/staging/audit-campaign.md) |\n| `Q-audit-cross-doc` | ANSWERED | Where does the corpus carry two values for the same object in two different documents? | Twenty-six findings ranked A, B and C, eighteen of them the Kourbatov shape where the resolution was already on disk in a document the stale one cites by name, including a retracted theta column quoted as live in nine places and a prior-art collision on the dimension-2 Rankin accounting; the gate read 0 findings before and after. | none | [audit-cross-document-constants.md](history/staging/audit-cross-document-constants.md) |\n| `Q-audit-front-door` | ANSWERED | Does someone arriving after the 2026-08-19/20 wave get the true current picture from README, G2-STATE section 0 and CHRONICLE in ten minutes? | All three are STALE: README's Status is dated 2026-08-17 with a broken map row and four missing files, G2-STATE section 0 stops at the second attack wave, and CHRONICLE ends at Day 5; drafts are ready for two of the three and README's rewrite is left in Chris's register. | none | [audit-front-door.md](history/staging/audit-front-door.md) |\n| `Q-audit-new1` | ANSWERED | Do G2-STATE.md, LOCALIZED-GAP.md, localized-04-maxsum.md, exponent-control.md and gate-multiplies.md agree with themselves and with their sources? | Findings per file, the leading one a NARROWED Origin Excess claim: the lemma carries an unstated third hypothesis, positivity of D_y(y'^2) - 2(pi(x) - pi(y) + 1), which forces ln x*/ln y near 1.44 at every level computed and caps the advantage at about 2.2 rather than order (ln x / ln y)^2. | none | [audit-new1.md](history/staging/audit-new1.md) |\n| `Q-audit-new2` | ANSWERED | Are the seven research documents of the new2 partition internally consistent and correctly scoped? | Per-file findings across the seven, mostly dropped scopes and attribution defects, plus four documents that were missing the standard current-understanding footer, which was added. | none | [audit-new2.md](history/staging/audit-new2.md) |\n| `Q-audit-numbers` | ANSWERED | Does the corpus's arithmetic survive recomputation from scratch by an independent method? | The ladder is right: all twelve G2 terms reproduce under a method sharing no code with the one that produced them, 37 of 39 assertions pass in 152 s, and the four errors found are small and none is load-bearing. | none | [audit-numbers.md](history/staging/audit-numbers.md) |\n| `Q-audit-papers` | ANSWERED | Are the paper suite and the root README consistent with their research homes? | Per-file corrections applied across the six paper/ files and README, with a Not fixed section naming what was deliberately left, including the exposition question the Holt attribution raises and one stylistic sentence of Chris's that was left alone. | none | [audit-papers.md](history/staging/audit-papers.md) |\n| `Q-audit-reading-path` | ANSWERED | Can a cold reader reach every live result in two hops? | The two-hop test passes for eight of the ten headline results of 2026-08-19/20 and no staging record is orphaned; what fails is narrower, the front door being three days behind and contradicting REFUTED.md on u_sup, G2-STATE's section 10 table still the 2026-08-17 list, and kappa-not-L carrying nothing from the L wave. | none | [audit-reading-path.md](history/staging/audit-reading-path.md) |\n| `Q-audit-spine` | ANSWERED | Do the spine documents - ZONE-POSTULATE, THE-DIALS, THE-LENS, GLOSSARY, OBSERVATIONS - state their objects correctly? | Findings per file, the leading one a frame error in ZONE-POSTULATE section 5: G2's own exponent measures 1.57 central, bracket 1.3 to 1.9, against a calibrated one-class control, while theta is above 2 and rising, so the two readings that sat on boundary exponent 2 resolve in opposite directions. | none | [audit-spine.md](history/staging/audit-spine.md) |\n| `Q-audit-staleness` | ANSWERED | How much of the live layer is stale against changelog passes 26 to 48? | Eleven of the nineteen files in scope are clean and eight carry at least one stale sentence (U-FRAME three, G2-STATE two and others), with a separate list of upgrades the live layer has not absorbed; report only, nothing outside the report was edited. | none | [audit-staleness.md](history/staging/audit-staleness.md) |\n| `Q-audit-uframe` | ANSWERED | Do the u-frame documents' claims survive an audit against their own sources? | Several are REFUTED: the multiplier requirement ln c <~ 2 ln^2 u / u is off by a factor ln u and is replaced by the per-fold rate ln c(p) <= 2 ln p / p, the Inertness Lemma's rate is narrowed to 4/u, and SUM L*mbar ~ 2 x ln^3 x is false because U-FRAME step 4 is false. | none | [audit-uframe.md](history/staging/audit-uframe.md) |\n| `Q-b2mean` | ANSWERED | Can the mean value of B2 = Sum e^2 Vabs(e)^2 be bounded below its trivial qmax*B ceiling? | Yes, by one logarithm: B2 = O(qmax*ln^7 z) against the trivial O(qmax*ln^8 z), with the mass located on primorial-core smooth e nowhere near qmax, the primitive-mode weight J2(e)/12 proved and priced as a flat 1.48x cut of MS3, and the finite forms computed exactly at z = 13..47. | none | [attack-b2mean-01.md](history/staging/attack-b2mean-01.md) |\n| `Q-barrier-kappa2` | CLOSED | Does Granville's exceptional-character construction, which makes the Jurkat-Richert f and F attained by interval sieving problems at kappa = 1, transfer to kappa = 2 and supply the missing barrier on wall-note Face 4, so that no class-blind argument can beat beta_2 = 4.26645 on intervals? | No. Verdict (b): the transfer runs, fixes the axiom obstruction that sift-limit-attack.md section 2 blamed for the mixed-sign sketch's death, and then hits a hard ceiling at u = 2, because the character's only gift is the one-point identity lambda = chi on z-rough integers and a sign pattern with a +1 coordinate is empty exactly when z^2 >= x; above u = 2 the surviving question is the shifted intersection of two positive-density lambda-classes, which is Chowla-strength, so the section 2 verdict stands with a corrected reason; the band (2, 4.26645] is untouched, and the hypothesis itself implies the target by Heath-Brown 1983. | 0 | [attack-barrier-kappa2.md](history/staging/attack-barrier-kappa2.md) |\n| `Q-bc-parity-floor` | CLOSED | Is the 2 that the census's B/C ratio limits to the same object as the parity floor's 2? | REFUTED at the first step, before any kappa-scan: the certificate dies where B/C crosses 1, not 2 (B = 503 against C = 497 at the death zone), the constant reads the sifting dimension while the threshold does not, and the parity floor's 2 cannot be this one. | none | [attack-bc-parity-floor.md](history/staging/attack-bc-parity-floor.md) |\n| `Q-beta2-AB-bounded` | ANSWERED | Is B(z,s) bounded, and does bounding it move the 4.2665 exponent? | B(z,s) <= 9 A(z)^2 (E(z) - 1) = O((log z)^8) is proven, unconditional, explicit and uniform in s, but the gap it closed was never load-bearing, the estimate has a published neighbour at s >= 9, Opera de Cribro Lemma 6.18, which does not cover this corpus's s in [2.0, 3.4], and the route to B = O(1) is measured dead as a uniform statement. | none | [attack-AB-bounded.md](history/staging/attack-AB-bounded.md) |\n| `Q-beta2-exact-strata` | CLOSED | Does re-inserting exact Buchstab strata (DP3) lower the dimension-2 positivity threshold below beta2 = 4.26645? | A sharp negative with a price tag: exact strata are legitimate and worth 1.72 to 1.84 of exponent, taking the positivity threshold to 2.0260 at finite levels, but they produce no theorem because the exact stratum value is the upper sieve function of a dilated tile one level down, so the regress terminates at every finite z and at no uniform z. | none | [attack-beta2-03-exact-strata.md](history/staging/attack-beta2-03-exact-strata.md) |\n| `Q-beta2-loss-budget` | ANSWERED | Where in the chain from truth to beta2 = 4.26645 is the loss, and which discard point is worth attacking? | Aim at theta: it carries the largest derivative (-4.2665 per unit) and the only consumer in the literature, beta is worth at most 1.07 and has no consumer, DP2 and the o(1) are worth exactly zero, and the two live knobs together stop at 1.597, so the last factor of 1.6 down to truth is in neither of them. | none | [attack-beta2-04-loss-budget.md](history/staging/attack-beta2-04-loss-budget.md) |\n| `Q-beta2-theta-total` | CLOSED | What is the largest theta_total defensible position-uniformly, and does it clear the break-even the beta2 upper-bound attack needs? | The largest defensible theta_total is 1 and it does not clear break-even: it misses by 0.2417 under the brief's symmetric arithmetic and by 0.2090 under the corrected asymmetric one, no part of the gap closes, and the weakest link in the negative is an ABSENT rather than a PROVEN. | none | [attack-beta2-02-theta-total-minimal.md](history/staging/attack-beta2-02-theta-total-minimal.md) |\n| `Q-beyond-chebyshev` | PARTIAL | Can the ensemble bound on P(S = 0) be pushed beyond Chebyshev, and how far? | Two beyond-Chebyshev bounds now stand, at @11 where capacity gives P(S = 0) = 0 exactly and at @13 where P(S = 0) <= 1.898e-6, a factor 513 below Chebyshev's 9.74e-4, with 683 assertions machine-checked; @17 is blocked on a 4.9e16-term sum and needs a 4-point wrap identity that does not exist. | none | [natal-cap-21-beyond-chebyshev.md](natal-cap-21-beyond-chebyshev.md) |\n| `Q-bf-split` | ANSWERED | Is Brüdern-Fouvry's level split optimal for their own theorem, or is there unclaimed exponent in it? | It was 99.3 per cent a trap: their condition (iii) binds at the published split and the proposed re-split violates it by x^{0.040403}, leaving 0.0000120536 in theta of the claimed 0.0295482779, real but invisible at the four decimals they print. | none | [attack-bf-split.md](history/staging/attack-bf-split.md) |\n| `Q-bilinear-fold-first-attack` | ANSWERED | Does assigning each Mobius factor to its first fold, or applying a direct second-moment bound, establish the missing one-sided estimate? | The first-fold identity yields no saving; a direct second moment has a negligible diagonal and an open two-prime off-diagonal. Fixed-fold covariance is an exact residue-imbalance square and the beta weights balance at each fixed modulus. Growing-depth joint control remains OPEN; B>=-C2*x+o(x) is not improved. | C | [bilinear-fold-attack.md](bilinear-fold-attack.md) |\n| `Q-bilinear-transplant` | CLOSED | Does this programme's frame have anywhere to put bilinear or Type-II arithmetic information, the only thing that defeats parity in practice? | The tile side cannot host it, since no corpus object is a signed sum over two ranging element ranges; the zone side can express one, and the estimate that one needs is the one already recorded absent. Section 9 lists the four findings that would reopen the row. | none | [attack-bilinear-transplant.md](history/staging/attack-bilinear-transplant.md) |\n| `Q-block-L-first-dead` | ANSWERED | Is the block-1 counting bound on L the first-dead 62 or the last-alive 111, and does downward closure hold in the block coordinate? | Downward closure HOLDS in the block coordinate: L <= 62 is sound and recomputed from scratch rather than inherited, L <= 111 is true, implied by 62 and weaker by 1.79x, and the adjudication's supposedly sharper instrument is attack 3's instrument. | G (retired) | [adjudicate-L-bound.md](history/staging/adjudicate-L-bound.md) |\n| `Q-block-alternation` | CLOSED | Is there a block-level alternation law? | No: a block-level inequality exists and is a real theorem, but it is not an alternation law - over a block the alternation law is strictly weaker than plain slot counting by the exact factor mbar(T_v)/6, at least 10/6 and growing like ln^2 v, and the resulting Block Partition Inequality closes only at v = 5 and v = 7 and is vacuous from v = 11 because 2*Sum_{v v^2 block ladder to sustain itself? | No: on the eleven-term exact ladder (this attack computed G2(41#) = 546) the ratio is flat at slope +0.05 +/- 0.11 on b >= 11 against a 12.3 per cent band, while the same estimator resolves the one-class control's falling ratio at 11.6 sigma; and the criterion is not independent, since at the natal it IS G2(x#)/x^2, the Zone Postulate itself. | none | [attack-block-01-ladder.md](history/staging/attack-block-01-ladder.md) |\n| `Q-block-exponent` | CLOSED | Does the block sub-problem have a better exponent than the proven 4.2665? | The required exponent for the ladder to close is 2, not 4 (the brief's step-3 arithmetic carried a factor error), and 2 is the TPC-equivalent line, so the useful part of the open band (2, 4.2665] is empty; the block's own prime range pins kappa = 2 and starting from T_v does not change the dimension. | none | [attack-block-05-exponent.md](history/staging/attack-block-05-exponent.md) |\n| `Q-block-greedy` | ANSWERED | Does the block-restricted adversarial greedy reach the truth at v = 5, and does block restriction cost anything? | Deterministic greedy reaches 17 against truth 19, randomised restarts reach 19 and an exhaustive DP confirms it, so greedy as a rule is optimal at v = 5 and the shortfall is a search failure; block restriction costs nothing on ten points with the same estimator on both sides, and the published Y2 ladder's bisection on a non-monotone predicate is a real defect. | none | [attack-block-04-greedy.md](history/staging/attack-block-04-greedy.md) |\n| `Q-block-kappa` | CLOSED | What does the block version of kappa(m) buy over the per-fold form? | Nothing: kappa_block(1) = 19 equals combined L at block 1 by construction, the minimal shift j*(m) equals kappa_block(m) at every m from 1 to 12 so there is zero slack in the block object, and the block form of Theorem C is empty, its vacuity coefficient 1.552 against a requirement of 1 at block 1 and growing like ln^2 v. | none | [attack-block-07-kappa.md](history/staging/attack-block-07-kappa.md) |\n| `Q-block-killers` | ANSWERED | For a maximal run of deleted T_v slots under the block v -> v^2, which primes do the deleting and how concentrated is the work? | Not concentrated: across 40 runs in five datasets every block prime kills at least one slot of every run and the exact minimum set cover is 82 to 100 per cent of the block, so no bound ranging over the block gets a reduction; the one favourable number is 915 of 1146 slots, 79.8 per cent, with exactly one killer. | none | [attack-block-02-killers.md](history/staging/attack-block-02-killers.md) |\n| `Q-block-literature` | ANSWERED | Does the literature already own the range-restricted covering object behind the block v -> v^2? | FOUND, and it has a name: the range-restricted covering problem is Erdős Problem #688 and is OPEN, the bounded-capacity conjecture #1200 is a third trap of the same class as the brief's two, and the Kalmynin-Konyagin journal version that covering-dive.md says does not exist does; the remaining negatives are ABSENT-AFTER-COMPETENT-SEARCH on calibrated channels. | none | [attack-block-06-literature.md](history/staging/attack-block-06-literature.md) |\n| `Q-block-reformulation` | CLOSED | Does the v to v^2 block reformulation, treating the block as a set, give a smaller combined L and an exponentially growing window? | Sound reformulation, no open path: no primality input is needed anywhere, nothing is deleted inside the window at all so combined L there is identically zero, and the object has to live in the tile; this note's own correction (the counting bound is 111, not 62) was itself reversed the same day by adjudicate-L-bound.md. | none | [attack-block-00-ADJUDICATION.md](history/staging/attack-block-00-ADJUDICATION.md) |\n| `Q-block-secondmoment` | CLOSED | Can a second moment over a block bound the empty windows, and is it allowed to work? | NO, on a tile-independent impossibility: Chebyshev needs dist(E, Z) < E/sqrt(W) and the measured shortfall at H = 204 is a factor 8.41e6, so a second moment gives a density bound that is legal at every H and TPC-relevant nowhere; the TPC line sits at eps = 1/W and at H about w^2, and quantifying over w buys nothing. | none | [attack-block-08-secondmoment.md](history/staging/attack-block-08-secondmoment.md) |\n| `Q-block-target` | CLOSED | What exponent does the squaring ladder v -> v^2 actually need, and do the steps get easier up the ladder? | The required exponent is exactly 2 with a constant below 1, which by the p^2 rule is TPC-equivalent, and the requirement is exponent-invariant at every step, so as a route to a theorem weaker than TPC the ladder is dead. | none | [attack-block-10-target.md](history/staging/attack-block-10-target.md) |\n| `Q-bonferroni-degree` | CLOSED | What degree does the Boole-Frechet certificate need, and does raising the degree reach an asymptotic bound? | Dead for asymptotics on a loop that closes on itself: raising the degree divides the over-certification exponent by the number of pairs without removing it (measured slopes 0.5441, 0.5425, 0.2816, 0.2937, 0.1695 at k = 2..6 against the predicted 1/(2 floor(k/2))), and Theorem A gives k >= (theta(x) - O(1))/(log G2 + O(1)), so the better the G2 bound assumed the higher the degree needed. | none | [attack-bonferroni-degree.md](history/staging/attack-bonferroni-degree.md) |\n| `Q-buchstab-deep-0830` | CLOSED | Can the certificate engine's deep-ladder Buchstab transfer be proven at dimension 2 at the depths the run levels reach by a route that does not go through the fundamental lemma at s >= 22.06 or the constant-free DH Theorem 9.1 (TODO 8a)? | NO by any instrument this corpus can cite, and the non-closing step is structural, not a constant: the transfer is an asymptotic for a ratio of two dimension-2 sifting functions at one sifting depth z = q, so a sieve bracket [f2, F2] survives undivided in the ratio (width 3.67 at the best sigma any level has, 4.71 at the @23 head); a correction \\|B - 1\\| >= 1% can only occur at sigma(q) < 1.8 where f2 = 0 and F2 >= 7.85, while a lower bound exists only at sigma > 4.266 where \\|B - 1\\| < 1e-5; the Buchstab identity iterated once is already negative at K = 1 for q = 37 at @23 and is the sieve itself when iterated fully; Jurkat-Richert fails Omega(1) as stated; in the certificate's legal direction F2 beats the trivial cap_K <= cap2 at 0 of 1512930 (q, K) pairs at @23, so the sharp-sieve floor is -1733138 at every K; the transfer stays HEURISTIC, what would move it is a kappa = 2 asymptotic in the open band 2 < sigma < 4.266, and part (b) is scoped and graded, not attacked. | 8 | [attack-0830-buchstab-deep.md](history/staging/attack-0830-buchstab-deep.md) |\n| `Q-buchstab-transfer` | ANSWERED | Is the certificate engine's Buchstab transfer provable in the shallow regime y = T^{o(1)}? | PROVEN conditional on the fundamental lemma and EMPTY at every run level (needs s >= 22.06; available 4.7 @23, 17.1 @97); the engine's B is a dimension-1 object, the survey's pair-Buchstab is dimension 2, the certificate needs a third. | 8 | [thm-buchstab-transfer-shallow.md](history/staging/thm-buchstab-transfer-shallow.md) |\n| `Q-bv-import-survey` | ANSWERED | Which unproven legs of the tile programme become theorems if Bombieri-Vinogradov, Elliott-Halberstam or GRH is imported? | Two legs become provable now, the fixed-modulus tail refinements S1/S2 by Siegel-Walfisz and the full-wheel prime-comb equidistribution in the tail regime by BV; the Buchstab transfer at bounded u and Assumption A for d = 2 are parity-blocked at every one of the four inputs. | none | [bv-import-survey.md](bv-import-survey.md) |\n| `Q-c2prime-drift` | PARTIAL | Why does c2' drift on the 22-term ladder? | Class-count-blind (attack-c2drift-01 §1); on item 1c's own band x >= 41 the ten-point rate is unresolvable: c2' 0.3745 +/- 0.1411 against c1's 0.3344 +/- 0.2358 on the same primes, a difference of 0.0401 = 0.12 of the control's ten-point window sd. Whether the drift is real is NOT closed here: attack-c2drift-01 measured it at p = 0.0053 on x >= 17 and left (i)' and (ii) alive. exponent-control §2/§4/§6 refit at 22 terms. | 1c (retired) | [attack-c2drift-01.md](history/staging/attack-c2drift-01.md), [c2prime-refit-22.md](history/staging/c2prime-refit-22.md) |\n| `Q-cal4-routing` | ANSWERED | Does the standing certificate plan point at the right obstruction, and what is CAL4 worth at @17? | The plan is aimed at the wrong obstruction, but not for partition W's reason: the @13 1e-9 gate is met today only by an assembly containing the brute-force C(990,4) march whose @17 counterpart is 513 days on ten cores and is not codeable here, the @17 requirement is a ladder whose first useful rung is relT4 <= 5.05e-5, a factor of 7.9 rather than six orders, and CAL4 has no correct constant value. | none | [phase1-W2-cal4-routing.md](history/staging/phase1-W2-cal4-routing.md) |\n| `Q-calm-lemma-identities` | PARTIAL | What in the fused window and the anchored calm is proven, exactly? | Three identities and the exact spectral forms are proven and verified as exact integers or floats; the uniform-in-q anticorrelation is REFUTED rather than open, with six counterexample primes across six levels, and the Anchored Typicality Measurement is the anchored-escape wall one level down with no proof mechanism in sight. | none | [natal-cap-19-calm-lemma.md](natal-cap-19-calm-lemma.md) |\n| `Q-calm-vs-kill` | PARTIAL | What does the anchored calm buy against annihilation? | Two theorems, the @11 closure and the X-Limitation Theorem at @11, @13, @17 and @19, and two refutations, calm implying concentration and minimizer loudness; the overlap-floor candidate that would prove non-annihilation dies on the anchor's own drift, with the anchored rotation t = 0 its worst case at @17, leaving the X-floor open. | none | [natal-cap-31-calm-vs-kill.md](natal-cap-31-calm-vs-kill.md) |\n| `Q-capK-bv` | ANSWERED | Is the prime-regime cap_K over the full wheel an unconditional asymptotic via the fundamental lemma over Bombieri-Vinogradov? | PROVEN at short-note grade for q_K = W^{o(1)}, and EMPTY in every computable range (needs s >= 10.82, first cleared at x = 263; the lemma's floor s >= 10 is first reached at x = 239); the deep ladder is untouched. | 11 (retired) | [thm-capK-bv.md](history/staging/thm-capK-bv.md) |\n| `Q-capture-identity` | ANSWERED | Does the transplanted cap family collapse onto a classical object, and what does the collapse say about the depth law and the wall? | PROVEN, elementary: floor_K = T − X(K) on the half-open window with both members in [Q², Q′²), a convention that is load-bearing; the wall is renamed, not weakened; Σ capU counts each member against its own threshold, not against a uniform p_K, the two differing 11% to 37% at K*. | Z2 | [quadpoint-identity-01.md](history/staging/quadpoint-identity-01.md) |\n| `Q-centered-discrepancy-estimate` | PARTIAL | Can the top of D_y be removed using ordinary prime distribution after an exact divisor flip, and what estimate remains? | Equations (3)-(4), the exact split and flip, survive review and finite controls. A repair of the top-range bound T^top=O_(A,eps)(x/log^A x) is DERIVED in section 3a (2026-09-08) with the endpoint atom retained, odd square divisors, the corrected reciprocal-totient local factors with (m',g)=1, explicit truncation powers, a Cauchy multiplicity device, and a uniform Mobius mean proved from the q=1 Siegel-Walfisz statements; its inputs are the terminal-point BV of Tao Notes 3 Theorem 17 with the prefix form derived by rounding. The handler (lane V) read the derivation on 2026-09-08, reconstructed (BV*), (3a.9), (3a.14) and (3a.16), checked the limiting constant of (3a.9) numerically at eight (b,g) pairs and found no defect; it is accepted at its stated scope, with ineffective constants. The payoff is D_y=D^(e_1)+O_(A,eps)(x/log^A x) only, so the handoff consumer is equivalent to D^(e_1)>=-4x/25+o(x). The fixed-endpoint signed discrepancy, D_y>=-4x/25+o(x) and twin-prime infinitude remain OPEN. | C | [centered-discrepancy-estimate.md](centered-discrepancy-estimate.md) |\n| `Q-centered-discrepancy-measurement` | ANSWERED | At reachable x, is the OPEN sufficient input D_y>=-4x/25 numerically violated, is the absolute form (13) numerically plausible, and does D_y carry structure beyond a random-sign model? | MEASURED to x=2^38. Neither pre-registered falsifier fires. D_y/x stays within 0.0043 of zero for the measured j>=26. Over 30<=j<=38, D_y/x differs from -(T1/x-C2) by at most 2e-4, with maximum 1.84401e-4 at j=30; the classical term dominates this finite comparison. The data do not establish an asymptotic fluctuation scale, an impossibility of informative future measurements, or the sufficient signed estimate. No proof status changes. | C | [centered-discrepancy-measurement.md](centered-discrepancy-measurement.md) |\n| `Q-certificate-engine` | PARTIAL | What did natal-cap-28 assemble, and at what calibration does the certificate engine stand? | There is no fully analytic certificate law and nothing here is closed: what reads as one object is nine at five calibrations with one of the nine refuted, the Certified-Head Theorem is PROVEN on 1/3/6 certified primes at @17/@19/@23, and every engine output carries the status of its weakest input, the HEURISTIC Buchstab Transfer Hypothesis. | none | [certificate-engine.md](certificate-engine.md) |\n| `Q-chain-review-0906` | ANSWERED | Do the written derivations from S(x) down to E_dagger hold as stated, with every imported theorem used inside its hypotheses and every discarded term at the claimed O_H(x/log^H x) rate, and where does the chain remain unreviewed? | Three independent adversarial passes found no defect in the six classical contributions from S(x) to E_>, none in the grouped moment (1)-(20) including the E_* to E_dagger step, and none in the residual-coverage link E_> to E_*, whose block-shape derivation was reconstructed and verified exactly. Every imported theorem was confirmed in its primary source except the Mobius Bombieri-Vinogradov citation, which points at an exercise sheet and needs a published replacement. Stale o(x) rates in three note bodies were replaced. A checked argument is not a refereed theorem; the OPEN signed margin is untouched. | C | [chain-review-0906.md](chain-review-0906.md) |\n| `Q-changelog-add-B` | ANSWERED | Which superseded text from wave-2 partition B belongs in the changelog? | The per-document entries for U-FRAME, ATTACKS3 and gate-multiplies, staged for the shepherd to merge in one pass; nothing was written to CHANGELOG.md here. | none | [changelog-add-B.md](history/staging/changelog-add-B.md) |\n| `Q-changelog-add-C` | ANSWERED | What history left wave-2 partition C's paper-suite files, and what has to be staged for the CHANGELOG? | Staged: Door 2's two load-bearing numbers are RETRACTED because the column they came from was disclaimed by its own script's correction banner, the corrected artifact reverses the conclusion, the OEIS term count is corrected to twelve, the matching lower bound is retired, and Zone Equivalence is demoted from spine theorem to framing device. | none | [changelog-add-C.md](history/staging/changelog-add-C.md) |\n| `Q-changelog-add-F` | ANSWERED | Which superseded text from wave-2 partition F, the natal-cap family, belongs in the changelog? | Entries for eleven natal-cap documents and two new files, led by the retirement of the Fused-Window Calm Lemma and the certificate law with it, plus the prose-note index that closes qc-arch E4; staged only, not merged. | none | [changelog-add-F.md](history/staging/changelog-add-F.md) |\n| `Q-changelog-add-G` | ANSWERED | What history left wave-3 partition G's files, and what has to be staged for the CHANGELOG? | Staged verbatim with file and line: the twin-candidate census index is corrected from A059861(n-1) to A059861(n) with four independent confirmations, two script banner titles are retired as contradicted by their own companion prose, and two scripts that had no banner title gained one. | none | [changelog-add-G.md](history/staging/changelog-add-G.md) |\n| `Q-changelog-add-P` | ANSWERED | Which superseded text from wave-4 partition P's three files belongs in the changelog, and what does calibration against the home document find? | Fourteen defects came out of the check wave 3 recorded it had not run, and none of them is reachable by any existing gate check; the removed or rewritten text is reproduced verbatim per file for the shepherd. | none | [changelog-add-P.md](history/staging/changelog-add-P.md) |\n| `Q-changelog-add-Q` | ANSWERED | What history left wave-4 partition Q's files, and what has to be staged for the CHANGELOG? | Staged: the Maier-Pomerance clause in the OEIS draft is RETIRED because it drew a >= from a << (they state an upper bound), and audit-numbers.js gained an oeis part of 39 checks carrying three retired values, including the exponent 1.57 quoted for G2 when 1.57 is A288815's. | none | [changelog-add-Q.md](history/staging/changelog-add-Q.md) |\n| `Q-changelog-wave2-A` | ANSWERED | What changelog entries does wave-2 partition A owe research/history/CHANGELOG.md? | Staged per-document entries for G2-STATE.md, LOCALIZED-GAP.md, maier-matrix.md and origin-excess.md, each naming the claim as it stood, what replaced it and the artifact that forced the change; a staging file for the parent to merge, not an edit to the changelog. | none | [changelog-add-A.md](history/staging/changelog-add-A.md) |\n| `Q-changelog-wave2-D` | ANSWERED | Which changelog entries does wave 2 partition D stage for CHANGELOG.md? | Staged entries in the changelog's house form for research/README.md (repurposed from a summary into the router), README.md, GLOSSARY.md, TODO.md, THE-DIALS.md, ZONE-POSTULATE.md, THE-LENS.md and FOLD-PROFILE.md, for the parent to merge. | none | [changelog-add-D.md](history/staging/changelog-add-D.md) |\n| `Q-changelog-wave2-E` | ANSWERED | What changelog entries does wave-2 partition E owe research/history/CHANGELOG.md? | Staged entries covering covering-dive.md, two-class-lower-bounds.md, PRIOR-ART.md, sift-limit-attack.md, theta-ladder.md, maxgap-law.md and dhr-verification.md, led by the FKMPT constant moved across two files together. | none | [changelog-add-E.md](history/staging/changelog-add-E.md) |\n| `Q-changelog-wave3-H` | ANSWERED | Which changelog entries does wave 3 partition H stage for CHANGELOG.md? | Entries for U-FRAME.md's split, in which sections 10, 11 and 12 keep their numbers and heading text and lose their bodies, plus the three new child documents kappa-not-L.md, operator-and-pair-count.md and f-decays.md. | none | [changelog-add-H.md](history/staging/changelog-add-H.md) |\n| `Q-changelog-wave3-I` | ANSWERED | What changelog entries does wave-3 partition I, the flagship split, owe research/history/CHANGELOG.md? | Staged entries for the split of the flagship's wall chapter into the new paper/wall-note.md and the pointer repairs that split forces, in house form, newest first and grouped by the document changed. | none | [changelog-add-I.md](history/staging/changelog-add-I.md) |\n| `Q-chen-fold-benchmark` | ANSWERED | Can the fold framework reproduce a classical Chen lower bound on long intervals with every imported hypothesis and error budget stated? | The classical implication is derived below using three explicitly imported theorem statements, with the combinatorial minorant proved and its integral margin certified by exact rational arithmetic. This is a benchmark, not a new prime theorem, and it does not prove twins or a short-zone result. | C | [chen-fold-benchmark.md](chen-fold-benchmark.md) |\n| `Q-chen-opportunity` | ANSWERED | Does the signed Chen target identify an approachable proof mechanism, and what should the next research obligation be? | The target is sufficient but subtracts an avoidable odd-composite penalty; even cancellation of its obvious signed components does not close the existing separate bounds. Select a prime-detecting weight against explicitly justified arithmetic input ranges before pursuing a new estimate. The opportunity is a research judgment, not a proved mechanism. | C | [chen-opportunity-audit.md](chen-opportunity-audit.md) |\n| `Q-chen-signed-target` | PARTIAL | What exact additional arithmetic estimate would turn the completed Chen benchmark into a proof of infinitely many twin primes? | An elementary prime minorant gives a conditional twin theorem with all weights, ranges, quantifiers and errors specified. The opportunity audit identifies an avoidable negative-weight penalty and a separate-estimate budget that fails even under component cancellation; this sufficient target remains OPEN and is not the sole next proof obligation. | C | [chen-signed-target.md](chen-signed-target.md) |\n| `Q-coefficient-structure` | ANSWERED | Does the arithmetic structure of the aggregated coefficients reduce the endpoint estimate beyond the previous rectangle, and can smaller coefficient norms alone supply the remaining power saving? | Exact classification gives a nonsquarefree L2 norm of size at most sqrt(D)*W^(1/4) times logarithms, while the squarefree top-band energy is at least a constant times D*W*log(W). At d~x^0.277, e~x^0.467 every endpoint sector except the squarefree-squarefree prime sum has a power saving. This reduces that rectangle to one explicit endpoint correlation; prime-dispersion.md supplies the remaining estimate and controls the full rectangle. Finite algebra, CRT sectors and archived prefixes are checked separately. | C | [coefficient-structure.md](coefficient-structure.md) |\n| `Q-cofactor-progression-transfer` | PARTIAL | Can the corrected full-cofactor kernel be estimated on a growing cofactor range by representing its actual arithmetic on CRT progressions, and does the resulting bound reach the twin consumer? | Derived from named imports: for some positive absolute kappa and d, all prime-r cofactor pairs s,t <= floor((log x)^kappa), including non-squarefree inputs and mixed transition/smoothed profiles, admit a dyadic scale-average O(log^(2-d) X) bound after division by x. The extension uses bounded multiplicative Euler modifications on the progression s\\|n, t\\|n-2 and keeps its density 1/lcm(s,t), so summing cofactors costs only O((log log X)^2). This goes beyond s=t=1 but remains short of o(x). The large-cofactor joint remainder, outside residual and twin margin remain OPEN; the attempted extension to power-sized cofactors fails on source modulus range and accumulated logarithmic cost. | C | [cofactor-progression-transfer.md](cofactor-progression-transfer.md) |\n| `Q-coherence-0828` | ANSWERED | Are the 2026-08-28 notes consistent with each other? | 20 contradictions, 8 convergences, 46 live-doc corrections collected (34 mechanical, 12 need a second reader). | none | [coherence-0828.md](history/staging/coherence-0828.md) |\n| `Q-coherence-0829` | ANSWERED | After the 2026-08-29 edits, does every live document state each changed fact the same way, and do the papers still agree with the notes? | 24 changed facts checked at 63 live-layer sites: 16 live disagreements (11 APPLY, 5 HOLD) plus one count error inside a HELD note; the worst is the localized band 2.9 to 4.2 attributed to \"two engines\" when only one of the two reads it, the other reading 2.14 to 4.39; qc.js 1 finding, in a file another agent holds; audit-numbers 251/251. | none | [coherence-0829.md](history/staging/coherence-0829.md) |\n| `Q-coherence-0830` | ANSWERED | Do the live layer (TODO, README, G2-STATE, REFUTED, anchored-calm, GLOSSARY, CHANGELOG, QUESTIONS) and the eighteen notes landed 2026-08-29 evening and 2026-08-30 morning agree sentence by sentence? | They mostly agree; 27 distinct disagreements found, 15 graded APPLY (both sides quoted, no judgement needed) and 12 ASK, none touching a note's mathematics: the live layer lags the landed notes in six places (a PROPOSAL listed under PROVEN in G2-STATE section 0, 67 for 71 closed routes, the skeleton door still open in README and two anchored-calm sentences, Z5's body contradicting the record-mechanism note, item 9's one-versus-two open steps, a stale Z2 first move), carries four numeric slips (8-of-10 for 10-of-10, 27 for 25 clauses, u* in the seventh digit, nine for ten levels), one rung inflation (a text-layer reading called read at the page), and one landed note (recon-0830-rec-killrun) is itself wrong about the record on the seventy-five count; qc.js --full at 09:23 fails only on two ledger ids from notes that landed during the run. | none | [coherence-0830.md](history/staging/coherence-0830.md) |\n| `Q-comb-discrepancy` | PARTIAL | Can the Comb Discrepancy Lemma's constant 2*3^k be tightened (TODO 8c)? | The lemma IS the trivial per-block bound; the attained optimum is max G - min G, a computed number per level (slack 29x @23, 54x @29, growing); term-by-term pricing lifts the certified head share to about 28-29 percent, not the 50 hoped for. | 8 | [comb-discrepancy-tight.md](history/staging/comb-discrepancy-tight.md) |\n| `Q-comb-tail-0830` | PARTIAL | Can TODO item 8's remaining part (b), prime-comb equidistribution in the tail regime, be proven at the depths the certificate needs, or at least measured and priced at the enumerable levels (8b)? | Not proven and no exponent moves: the tail defect is measured exactly for the first time (signed -0.01% of the tail main term at @23, -0.00% at @29, unsigned 0.60% and 0.25%, smaller than the head's 1.00% in aggregate but 8 to 37% per prime at its worst), the Comb Discrepancy Lemma's method fails in the tail on its MAIN TERM (off by a derived factor e^gamma(1/u - q^(1-u)), measured aggregate 1.14x at @23) before its error term (10^27 x main), the prime-comb Legendre form has 2^(k+2) terms of which the short ones obey the lemma's <1 bound and the long ones are prime-in-AP discrepancies whose term-by-term sum is 11.2% of main at @23 against a signed -0.01%; the all-x form at K = 0 is Theorem C (PROVEN, limit only) and at the certificate's depth K* the non-closing step is a kappa = 1 asymptotic at sifting parameter s < 2, a proof gap on data that show B_tail = 0.998-1.000 at K* through @29; the full-depth half is 8(a), CLOSED. | 8 | [attack-0830-comb-tail.md](history/staging/attack-0830-comb-tail.md) |\n| `Q-consolidation-wave` | ANSWERED | Can the five cost-class scripts be bound to their own output, and can U-FRAME's two lost tables be rebuilt? | All four runnable cost-class embeds are bound and the hand-pasted-tail counter falls 19 to 15 with the gate at TOTAL 0; three needed --force at a cost of 24 tokens out of 211 with no value changed anywhere, and natal-cap-33-overnight.js is a three-run composite that should never have been on the cost list. | 11b (retired) | [consolidation-wave.md](history/staging/consolidation-wave.md) |\n| `Q-constants-audit-2` | ANSWERED | For every load-bearing number that appears in two or more live documents, does it agree everywhere, and does it trace to exactly one custody-bound producer? | 25 findings over 69 of 70 files, 8 rank A, 12 rank B, 5 rank C: 46 named-constant groups carry two or more distinct values across two or more files, and 439 numerals of five or more significant digits in the live layer have no producer printing them at any precision; nothing was fixed and five judgement calls stayed queued. | none | [constants-audit-2.md](history/staging/constants-audit-2.md) |\n| `Q-consumer-comparison` | ANSWERED | How does the sufficient margin C_2 x + E_dagger(x) >= c_0 x/(log x)^K compare logically with the published sufficient routes to twin primes, and what does the literature already own of the corner object? | The sufficient margin remains OPEN. The published conditional routes imply it where their hypotheses and stated lower bounds apply; reverse implications are not established. The dictionary is E_dagger(x)/x = C_2(2 delta_x - delta_{x/2} - 1) + o(1), with K>0 below that normalisation's resolution. Independent review corrects the comparison: cumulative and dyadic consumers on unbounded scales are equivalent at the same fixed K with possibly different positive constants. At K=0 an eventual cumulative lower bound also implies the unbounded-scale dyadic consumer. The nonnegative-weight corner identification applies only to the prime-cofactor subfamily; the full residual retains additional branches. Every surveyed route remains conditional. | C | [consumer-comparison.md](consumer-comparison.md) |\n| `Q-corner-branch-diagnostic` | ANSWERED | Can future experiments enumerate the full coefficients C(n) and C'(n-2) branch by branch, without silently dropping proper prime powers, cofactors s>1, non-squarefree inputs or either gcd branch? | The driver exists and its two independent constructions of each side agree exactly on 8192 retained sides and 1802 fixture sides; five deletion and reconstruction controls are ACTIVE in both runs. Its split by gcd(n,n-2) measures integer parity, not the per-term CRT gcd partition. The fixed-eta corner is empty on the retained prefix, and Elo exceeds E0 across the entire J_x, so the matrix is a proxy window. This is finite algebra and tool preparation, with no asymptotic estimate or twin margin. | C | [corner-branch-diagnostic.md](corner-branch-diagnostic.md) |\n| `Q-corner-coefficient-energy` | ANSWERED | Can the full corner coefficients be studied before splitting their cofactor branches, and what do exact energy and classical smoothed sieve weights supply? | The sharp coefficient energy is an explicit signed quadratic form in short cofactors plus O_epsilon(x^(1/2)K^2*x^epsilon), a power below x at the fixed corner. Logarithmically averaging the divisor cutoff gives Barban–Vehov weights and an O_eta(x log x) squared norm on each side and absolute shifted-product bound. The follow-up sharp-corner-transition.md gives sharp O_eta(x log^2 x) norms and proves a non-negligible norm transition for sufficiently small fixed eta. Signed transition saving and the global complement remain OPEN; no exact residual cut or twin margin changes. | C | [corner-coefficient-energy.md](corner-coefficient-energy.md) |\n| `Q-corner-correlation` | PARTIAL | On the corner S_0 where both cofactors sit just above their own cutoffs, what exactly is the remaining endpoint sum, what does the sufficient consumer need there, and does any reviewed correlation theorem supply it? | The full corner is exactly sum_n C(n)C'(n-2). Proper-prime-power terms above the cutoffs are negligible at fixed eta by §1.1; the remaining prime-r terms with s>1 or s'>1 and non-squarefree inputs remain OPEN. The s=s'=1 piece has a nonnegative Mobius-product weight with exact moving cuts. The multiplicative lift and round-review sampling give small continuous and dyadic scale-average log savings for that subfamily, with no o(x), full-corner control or twin margin. The complement is still open. | C | [corner-correlation.md](corner-correlation.md) |\n| `Q-corner-log-average` | PARTIAL | What do logarithmically averaged correlation theorems and their quantitative successors actually supply for the prime-cofactor corner weight, with exact support, rates and scale quantifiers? | The pure band is invariant under dilation by primes outside it; the exact cofactor window is not, but its support extends to x^(1-2eta) and need not leave the window under a fixed dilation. Uniform-prefix logarithmic bounds imply block bounds by Abel summation; a relative exponent above 3 is one sufficient route to o(x), not a universal necessary threshold. Pilatte's 1/(96e) calculation applies only to his displayed parameter choice. A bounded multiplicative Fourier lift now gives a small continuous scale-average log saving for the prime-cofactor subfamily via Tao-Teravainen v2; see prime-band-transfer.md. No o(x), dyadic pointwise estimate, full-corner estimate or positive twin margin follows. | C | [corner-log-average.md](corner-log-average.md) |\n| `Q-corner-measurement` | PARTIAL | At finite dyadic x, how large is the corner two-point correlation K(x)=sum_{x/2= 1 with the density condition as its only hypothesis, so what beta2-note adds is two parameter choices and one dimension-free observation that is zeb's at kappa = 1; the honest response is to state the k-class family, whose k = 1 row is a known theorem. | none | [attack-dim2-standalone.md](history/staging/attack-dim2-standalone.md) |\n| `Q-discrepancy-two-class` | ANSWERED | What is the two-class analogue of Holt's signed discrepancy DeltaPhi, and do the three candidate growth laws on the table agree? | One object in three norms rather than three agreeing measurements: the proven Level Ledger bound 2*3^(pi(x)-1) and natal-cap-29's spectral level law share the integer 3 provably, since R_k(p) tends to k+1, so the apparent agreement is an identity; the custody gate reproducing Holt's Table 2 passed. | none | [discrepancy-two-class.md](discrepancy-two-class.md) |\n| `Q-dispersion-range` | ANSWERED | How far do the dispersion and coefficient-sector estimates extend across divisor sizes, and does a better orientation or gcd budget enlarge their overlap? | Averaging the nonzero gcd losses over the original divisor gives a different dispersion bound with cross-prime exponent (5/4)a+(1/2)b+3/50, where a=delta+6/25 and b=nu+1/20. Explicit diagonal, prime-cut and sparse-sector inequalities control a region of full rectangles, including d~x^0.282, e~x^0.522 at product scale x^0.804. Its cross-prime and left-sparse budgets are 0.9985 and 0.9988. The supremum of product exponents in this sufficient region is 5397/6700; it is not a uniform product cutoff. Balanced supports separately allow 12/25= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched. | D | [attack-0829n-doubling-bridge.md](history/staging/attack-0829n-doubling-bridge.md) |\n| `Q-doubling-killrun-0830` | PARTIAL | Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN. | D | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n| `Q-embed-backlog-0829` | PARTIAL | How much of the embed backlog (legacy scripts with no OUTPUT block, readings not traceable to their block) could be closed in one pass, and what did the fresh runs contradict? | MEASURED. embed-backlog fell 218 -> 189 findings in one pass: no-output-block 34 -> 5, readings-not-traceable 181 -> 181 (untouched by design), hand-pasted-tail 3 -> 3. Twenty-nine legacy scripts were bound with node research/qc/embed.js, zero --force was used, and one legacy reading is contradicted by its own fresh output (attack-beta2-03-exact-strata reading 8, \"1.04 to 1.07 across y = 7..23\" against a printed 1.102 at y = 7). | none | [embed-backlog-0829.md](history/staging/embed-backlog-0829.md) |\n| `Q-embed-binding` | ANSWERED | What does the embed fingerprint actually bind, and what does it leave loose? | It binds the code to a claim about the output and does not bind the output block to anything: code-sha256 covers every byte above the banner, out-sha256 is only ever compared against another run, timeouts and failures write nothing, a prose line can unbind a tail and one did during this pass, and 37 cited scripts have no output custody at all. | none | [verify-the-verifier-embeds.md](history/staging/verify-the-verifier-embeds.md) |\n| `Q-endpoint-fourier` | ANSWERED | Does a complete Fourier truncation budget and a matched Kloosterman-fraction theorem control any further part of the actual endpoint sum when its small prime-power coefficients are combined first? | A written classical-input derivation controls the rectangle d in (floor(x^(27/100)),2floor(x^(27/100))], e in (floor(x^(46/100)),2floor(x^(46/100))] to O_H(x/log^H x) for every fixed H. Its product is of order x^(73/100), outside the previously controlled region eventually. The aggregated Fourier exponent is 1989/2000; the full Vaaler tail and gcd=2 branch are included. This is a regional estimate, not a full residual bound or twin theorem; finite algebra and saved-factor checks are separate validation. | C | [endpoint-fourier.md](endpoint-fourier.md) |\n| `Q-endpoint-pairing` | ANSWERED | Does retaining the difference of interval endpoints improve the complete Fourier budget, and are the lowest frequencies actually the next obstruction on the squarefree pilot rectangle? | A written derivation controls the full rectangle d~x^(11/40), e~x^(93/200) to O_H(x/log^H x), with product of order x^(37/50). The sufficient first exponent becomes 3/20+(7/10)(a+b)+(1/4)max(a,b), equal to 3999/4000 there. On the a=b=517/1000 pilot, this transition-frequency budget is 20061/20000, not the separate-endpoint 20163/20000; prime-dispersion.md now controls that pilot with a different estimate. Finite identities and exact exponent checks validate the implementation, not the asymptotic theorem. No uniform product cutoff or twin lower bound follows. | C | [endpoint-pairing.md](endpoint-pairing.md) |\n| `Q-endpoint-target-audit` | ANSWERED | Does the endpoint reduction require a fixed positive fraction of the expected twin count, and do recorded uniform-gap theorem failures exclude its weaker consumer? | No fixed fraction is required: for every fixed H the reduction has error O_H(x/log^H x), so C2*x+E_>(x)>=c*x/log^K x on unbounded dyadic scales suffices, as does a stated logarithmically rescaled average. These implications are derived from named inputs; their endpoint hypotheses remain OPEN. The recorded uniform-gap theorem comparison has different quantifiers and does not establish an obstruction for this consumer. | C | [endpoint-target-audit.md](endpoint-target-audit.md) |\n| `Q-erdos-map` | ANSWERED | Does the two-class object already occupy a numbered slot on somebody else's map of open problems? | It has no problem number and no name on erdosproblems.com, Ben Green's list or the OEIS citation graph, but it is not unposed: Erdos posed it himself in one sentence in the same paragraph as the $1000 offer, and our object is the r = 2, difference-2 instance of his own stated extension of #687. | none | [attack-erdos-map.md](history/staging/attack-erdos-map.md) |\n| `Q-excess-chain-c` | CLOSED | Does the excess chain's constant c pin to 1.074 via a compressed-tail max correction? | NO: for any FIXED correlation length the derived family tends to 1 and both named corrections lower the maximum, so 1.074 is not derivable from a compressed-tail max correction; c measures 1.05 +/- 0.07 (sd) over x = 17..31, MEASURED, which does not separate 1.05 from 1.074. | 10 (retired) | [excess-chain-c.md](history/staging/excess-chain-c.md) |\n| `Q-exponent-control` | PARTIAL | What is the growth exponent of G2, measured against a control that knows its own answer? | MEASURED 1.50 +/- 0.05 stat on 22 trusted terms after control correction, systematic unquantified; the raw fit's bias grows and sticks at +0.28, exponent 2 stays disfavoured but is not excluded, and the question is bias-limited rather than data-limited. | none | [exponent-control.md](exponent-control.md) |\n| `Q-external-data-audit` | ANSWERED | Where is the corpus limited by external data it could simply adopt? | Findings are candidates, not verdicts: the highest settles an open reading for free, since dividing the two now-trusted series moves the G2/h ladder maximum from x = 37 to x = 79 and reverses the fall at x = 53, killing \"peaks at x = 37\"; the rest tighten quoted constants or retire stale limitation sentences. | none | [external-data-audit.md](history/staging/external-data-audit.md) |\n| `Q-f-census` | PARTIAL | What does the grain census law give for f, the qualifying-gap fraction, and where does it structurally stop? | DEFECT-carrying: every census point from x = 37 up is aliased, so the 42-point table above x = 31, both regressions, the factor 170 and the x = 1000 extrapolation must be re-read against the corrected law; the staircase theorem (treads are exactly the twin pairs), Lemma B, the comb coefficient and everything at x <= 31 are UNAFFECTED, and the growth law is a fit and not a theorem. | none | [a3-03-f-from-census.md](a3-03-f-from-census.md), [f-decays.md](f-decays.md) |\n| `Q-f4weak` | PARTIAL | What is the weakest sufficient form of F4 that could be proven, given rms <= z^(3+o(1))? | The mode-count/degree bound is NOT the theorem (sqrt(N)*rms grows at z^8.174 +/- 0.249 against the z^4.26645 ceiling and is dead from z = 31); one new PROVEN finite-z clearing survives z = 47 at a 5.0 percent margin but converges onto the trivial bound; the weakest law-shaped form found is MV(alpha), a mean value over modes, MEASURED slope 4.214 +/- 0.304 with beta2 inside the bar. | none | [attack-f4weak-01.md](history/staging/attack-f4weak-01.md) |\n| `Q-fdecay-deep` | ANSWERED | Does the fitted f decay law hold out of sample at deep levels? | It holds as a band, nine of nine deep levels inside the four-specification band, but the residual trends against the central specification at t = -7.08; the test also found what it was not looking for, that the 42-point exact census is wrong from x = 37 upward by a factor rising to 1.63 at x = 199, from a 32-bit shift alias. | none | [fdecay-deep.md](history/staging/fdecay-deep.md) |\n| `Q-fdecay-out-of-sample` | OPEN | Does the 42-point decay law for f, the qualifying-gap fraction, survive out of sample, given that every downstream reading extrapolates it three to thirty times past its range? | Pre-registration only, written before any producer for the pass exists on disk: four specifications are refit on the 42 exact census points as a transcription check and their projections are frozen, and nothing here is measured. | none | [fdecay-deep-prereg.md](history/staging/fdecay-deep-prereg.md) |\n| `Q-fekete-1d-defect47` | PARTIAL | Does the bounded-defect Fekete route survive a probe at 47#? | The defect at 47# is ordinary and the 47# enumeration cannot move item 1d's TPC threshold whatever value it returns; the bounded-defect Fekete lemma is stated exactly and proved with every hypothesis except the candidate itself discharged, so the route reduces to one named inequality and is neither closed nor open beyond that. | 1d | [fekete-1d.md](history/staging/fekete-1d.md) |\n| `Q-fixed-endpoint-discrepancy` | PARTIAL | After the accepted truncation to odd moduli e=-4x/25+o(x)? | Reviewed 2026-09-09 after the coprimality repair: T_I^low=O_(A,eps')(x/log^A x), hence S=C_2x+B+O_A(x/log^A x), with B the exact Type II plus band sum (2.9). The untruncated modulus bound was false; g<=(log x)^(A+13), both tails, the coprime density and the weighted BV multiplicity now pay the estimate. Review corrects harmless log powers and the power-of-two atom over the full eps' range. D^(e_1)>=-4x/25+o(x) is equivalent to B+2C_2M>=-4x/25+o(x); it implies, but is not equivalent to, B>=-(C_2-1/200)x+o(x). The latter and H_B are sufficient OPEN margins. The absolute band statement (4.9) is one stronger sufficient input, not a necessary condition. No inspected source estimates the remaining actual signed B. Twin-prime infinitude remains OPEN. | C | [fixed-endpoint-discrepancy.md](fixed-endpoint-discrepancy.md) |\n| `Q-fkmpt-corrigendum` | ANSWERED | Does the 2023 FKMPT corrigendum change anything the corpus depends on? | Clean bill of health: the corrigendum changes four numerical constants and the parameter M, every one already carried at its corrected value here; the loudest finding is the opposite of the expected one, since the premise that nothing in this repository has read it is false and has been since 2026-08-18. | none | [verify-fkmpt-corrigendum.md](history/staging/verify-fkmpt-corrigendum.md) |\n| `Q-fold-arithmetic-bridge` | PARTIAL | Does one parity-table bridge from the anchored fold ledger yield a sufficient twin lower bound with named arithmetic inputs? | Exact identities retained. The one unread sieve input of the pricing, Bombieri--Vinogradov for k-fold X^(1/u)-rough products, is derived from Wu's Lemma 2.3 (section 3a); the same input, sieved in the composite variable, gives the contamination aggregate constant 4 for each fixed k,u, replacing the displayed 12.86 to 19.72. With these inputs, elementary bounds give Q_cov(u)<1 and c*_real(u)<4 for every u>4 (section 4a, independently reviewed 2026-09-09 with rational certificates), so neither sufficient ratio test succeeds at any depth. This closes the two tests, not the decorrelation hypotheses, and supplies no twin estimate. | C | [fold-arithmetic-bridge.md](fold-arithmetic-bridge.md) |\n| `Q-fold-profile` | ANSWERED | Where does a fold by p land its damage inside the original tile stretch [0, W)? | The counting half is a theorem with an effective constant (Level Ledger PROVEN, Mirror Ledger VERIFIED 45 of 45) and the survival law is scale free (MEASURED), but the quantity controlled here is provably uninformative about L and kappa(m), so it buys nothing against the Zone Postulate route. | none | [FOLD-PROFILE.md](FOLD-PROFILE.md) |\n| `Q-fold-succession` | CLOSED | Does folding in succession damp the multiplier, giving a lower L than the sum of per-fold jumps? | No: the succession-damping route closes empirically at both reachable scales against a calibrated null, the only damping present is what level-tracking forces and the only extra structure present is cooperative, matching the structural closure by super-additivity. | none | [fold-succession-autocorr.md](history/staging/fold-succession-autocorr.md) |\n| `Q-foldL-amortized` | CLOSED | Can the fold multiplier L be bounded by charging kill-runs to the birth of the gaps they consume? | The accounting does not close on the tile: the Consumption Identity makes the charge exact and the bound is then only as good as X = 2Q0 + Q+ + Q-, and supply against demand fails on the tile at every x by exactly the factor ln^2 x; it closes in a localized window from p about 421 on, which is a statement about a bounded population only. | none | [attack-foldL-04-amortized.md](history/staging/attack-foldL-04-amortized.md) |\n| `Q-foldL-bridge` | ANSWERED | Does the bridge from a fold's kill count to L hold, and what is the sharpest transportable ceiling it gives? | The bridge is PROVEN and was already in the corpus, so the job was custody rather than a new theorem; the new pair-window rung is exact at all eight diagonal cells, and the best fully-proven transportable ceiling stays near 0.18p and beats the requirement nowhere. | none | [attack-foldL-02-bridge.md](history/staging/attack-foldL-02-bridge.md) |\n| `Q-foldL-extinction-scaling` | ANSWERED | Does the multi-kill extinction law predict windows it was not fitted on? | CONFIRMED under the pre-registered rule at Y = 2e7, 2e8 and 2e10 from the Y = 2e9 calibration alone, with the run-length extension REFUTED exactly as pre-registered; this promotes a law candidate on measurement, not a proof. | none | [attack-foldL-06-scaling.md](history/staging/attack-foldL-06-scaling.md) |\n| `Q-foldL-maxsum-direct` | CLOSED | Can maxsum_m(T_x), plain and residue-deleted, be bounded above by an argument that never counts kills? | The brief's premise contradicts the corpus's own Bridge Floor (maxsum_k >= maxsum_1 = G2(T_x) for every k), so the bridge cannot convert far enough however good the bound is; all four routes close (R1 partial then closed, R2 tautological and quantitative, R3 busts the budget), and the order-m object is in print, so item 0c's absence sentence has to change. | 0c | [attack-foldL-05-maxsum-direct.md](history/staging/attack-foldL-05-maxsum-direct.md) |\n| `Q-foldL-run-census` | PARTIAL | What ceiling on L does the channel-compatible run census force, and is that ceiling forced or a bridge? | Channel compatibility is exact and cheap but buys little: 3 in 71 at kappa(1) = L, the forced ceiling is a presence-relaxation rather than a multiset-exact bound, exact tiles stop at T_29, and the angle's own verdict sends it to TODO 0c, bounding a residue-deleted maxsum, which this pass did not attempt. | none | [attack-foldL-01-census.md](history/staging/attack-foldL-01-census.md) |\n| `Q-foldL-transport` | ANSWERED | Is there a third invariant of the tile's gap alphabet that provably survives the fold recursion, alongside the sum rules and the maxsum family? | Yes: the tail-count profile transports (the Tail-Count Transport, PROVEN, verified to T29 at 214,708,725 twin slots) and is sharper per fold than the standing route by a factor of three to eight in nats, but it does not chain, dying on the same accumulating index gate-multiplies.md closes. | none | [attack-foldL-03-transport.md](history/staging/attack-foldL-03-transport.md) |\n| `Q-foldL-window5` | MIXED (foldL-window5-prereg.md: OPEN; foldL-window5.md: ANSWERED) | Does the fold extinction law score one decade blind at W = 2e11? | HIT on all four pre-registered criteria (last fold with L >= 2 measured 631 against band [571, 877]; both counts inside their bands), with the hot systematic now confirmed at five of five windows at measured over predicted about 0.82, which by the prereg's own clause belongs in the law as a known overprediction rather than in the acceptance band. | none | [foldL-window5-prereg.md](history/staging/foldL-window5-prereg.md), [foldL-window5.md](history/staging/foldL-window5.md) |\n| `Q-ford-halberstam` | CLOSED | Does Ford and Halberstam's dual decomposition beat Brudern-Fouvry's (2.6), as its authors said it should? | No: the dual is the same inequality, verified to 3.553e-15 at r = 2 and 6.821e-13 at r = 2..7, and their estimation step is better than they claimed, the Rosser boundary layer making their absolute-value bound an identity with loss 0.000000000 at z = 20, 30, 42; the shortfall is the freedom the step gives up, one level per component and no lower sieve. | none | [attack-ford-halberstam.md](history/staging/attack-ford-halberstam.md) |\n| `Q-fractional-retention` | CLOSED | Do Brady and Li's fractional retention rules at kappa = 2 open the adjacent door sift-limit-attack section 7c named? | Do not pursue: the door is real, applies to our system and carries no regress, but half the rule family cannot be applied at kappa = 2 and the applicability window there is empty, both settled from the sources; the unlooked-for find is that Brady's thesis is prior art for our object. | none | [scope-fractional-retention.md](history/staging/scope-fractional-retention.md) |\n| `Q-frontier37` | ANSWERED | What do the fold-L wave's three exact instruments give one level deeper, at fold 37? | The prior-art check moved the target first: the ninth diagonal L(T_31, 37) = 4 and the maxsum_m(T_31) table for m <= 8 were already embedded in the corpus, so this is a re-measurement, not a first; M_alt = G2 is measured at eight folds and proven at none, and the transport ratio's rise 0.8881 to 0.9477 has no mechanism attached. | none | [frontier37.md](history/staging/frontier37.md) |\n| `Q-full-coefficient-average` | PARTIAL | Can aggregating the complete coefficients before a correlation theorem remove the explicit cofactor count, and what additional estimate is needed? | Exact factor and rounded-endpoint Fourier identities retained, with c_(i,0)=3/5 and an explicit composite-filtered weighted sum. The full family is not 1-bounded, but the sufficient phase condition admits at least k=0,+/-1 on the left and l=0,+/-1,...,+/-6 on the right for every Mellin twist; the earlier zero-only claim is corrected. Composite filtering and the required correlation rate remain unmatched. Proposition 6.5, independently reviewed including on 2026-09-09, proves coefficient norm at least (log x)^(2/5) for representations by 1-bounded functions on all smooth inputs. This does not exclude density-one representations, paid growing components or a jointly treated Fourier sum. No sufficient signed twin margin follows. | C | [full-coefficient-average.md](full-coefficient-average.md) |\n| `Q-g2-43-term` | ANSWERED | What is the fourteenth exact term of the G2 ladder, past 41#? | G2(43#) = 618, at least position 830,330,079,152,051 and attained at 8 positions of the period, confirmed by two independent enumerations over disjoint natal masks agreeing on value, multiplicity, position and survivor count; 47# is priced by direct probe at 1.49 days per run and stays out of session reach. | none | [phase1-T2b-exact-ladder.md](history/staging/phase1-T2b-exact-ladder.md) |\n| `Q-g2-falls-decision-rule` | PARTIAL | Does G2(x#)/x^2 fall, and what pre-registered decision rule would settle it? | The instrument is calibrated and sharp, resolving the one-class control at 11.6 sigma on the same nine points where it returns 0.9 sigma on G2, and the honest band on the slope is +/-0.117 at nine terms, so the rule is registered; but the power analysis puts separation at x = 53 only if the falling law is x ln^2 x and at x = 151 if it is x ln^3 x, so phase 1's extra terms settle nothing and no reachable exact ladder does either. | 1d | [phase1-T3prep-decision-rule.md](history/staging/phase1-T3prep-decision-rule.md) |\n| `Q-g2-provenance-x37` | ANSWERED | Does the headline G2 exponent depend on the eight terms this repository has never reproduced, and does any instrument without G2(37#) inside it flag x = 37? | MEASURED, both largely negative: the custody-only refit lands at 1.533 against the headline 1.498 and no provenance-block drop moves the corrected central by more than 0.035 (Ghat(64) alone moves it 0.002), while no G2-free instrument flags 37 in the high direction, the one \\|z\\| past 2 being h(37#) at -2.20 in the low direction and range-dependent; the blind extreme-value forecast of G2(37#) does overshoot at z = +6.58, unexplained. | 0 | [measure-g2-provenance-0829.md](history/staging/measure-g2-provenance-0829.md) |\n| `Q-g2-state` | PARTIAL | What is known about G2, the two-class maximum twin-slot gap, and at what calibration? | The gap is unchanged through roughly fifty recorded passes: the proven upper bound is exponent 4.26645 against a target of 2, and this file consolidates the map rather than computing anything new. | none | [G2-STATE.md](G2-STATE.md) |\n| `Q-gap-spectrum` | ANSWERED | What is the full gap-length distribution of twin slots over one period of the tile, what does the excess functional \\|B_N\\| = sum_{g>N}(g-N) read on an x^s grid, and where does the empirical minimum window count leave zero? | The distribution is exact at nine levels to x = 31 and the pre-registered renewal null FAILS in the light direction at every one: the tail is uniformly steeper than exponential (body slope -1.3302 against -1), no power law survives (the power-law slope moves by a factor 17), the maximum is 2.087 to 2.241 BELOW the renewal maximum, and \\|B_N\\| sits at 0.0245 to 0.7436 of the null and is exactly zero at s = 1.75 where the null predicts 6.5262e+5 empty windows; so no heavy-tail mechanism for a super-linear G2 exponent exists at any computable level, the identity G2 <= N + \\|B_N\\| is proven but degenerates to G2 <= N on this grid, and the sifting onset is flat at 1.63 to 1.70 against a sieve bound f2 that is zero everywhere the grid reaches. | 0 | [gap-spectrum-01.md](history/staging/gap-spectrum-01.md) |\n| `Q-gate-multiplies` | ANSWERED | Does \"the gate multiplies\" close the entire u-frame recursion branch, or only the merge chain? | Only the merge chain and one relative of it: the no-fixed-point argument does not reach TODO 0b at all, though 0b is wrong as stated for an unrelated reason and the error is a factor of ln u; what survives is the copy theorem for maxsum (VERIFIED 40 of 40), which needs a residue-deleted maxsum bound that does not pass through a kill count. | 0b | [gate-multiplies.md](gate-multiplies.md) |\n| `Q-gate-repair` | ANSWERED | Were the verify-the-verifier repairs landed with the gate ending fully green? | COMPLETE: node research/qc.js --full reads FULL GATE PASSED at the close, TOTAL 0 across the 11 checks, selftest 39 known positives firing and 32 controls silent, audit-numbers 246/246, and no bound tail left amber. | none | [gate-repair-finale.md](history/staging/gate-repair-finale.md) |\n| `Q-global-cutoff-averaging` | PARTIAL | Does the wider corpus suggest changing the global decomposition before extending the small-cofactor estimate, and can that change be made without an unpaid transition or outside term? | Derived: independently averaging the two initial Mobius cutoffs over fixed exponent intervals gives S=C2*x+sum G_L(n)G_R(n-2)+O_A(x/log^A x), uniformly on dyadic scales, with all cofactor and prime-power branches included. Each full G has squared norm O(x log x). The existing sharp-corner lower norm then forces cancellation between the corner coefficient and the rest at the same input. This does not estimate their shifted product. The global signed residual was already O(x) by the sieve upper bound and positivity; the new norm representation is not an improved signed bound. Prefer a bounded attempt on this global coefficient pair and a one-sided consumer; the twin margin remains OPEN. | C | [global-cutoff-averaging.md](global-cutoff-averaging.md) |\n| `Q-global-factor-signs` | PARTIAL | Which full factor configurations cause negative global products, can prime-power exceptions be paid, and does a pair-trigger upper bound control the negative part? | Derived: G_i(n)=Lambda_(>W_i)(n)-F_i(s_i(n))*log t_i(n)-E_i(n), with all small-prime factors in s_i and all primes of t_i exceeding W_i. The correction is supported on a small-prime power exceeding W_i; its full shifted effect is O_epsilon(x^(39/40+epsilon)). After also paying proper prime powers, the residual is a composite-filtered signed smooth/rough cofactor sum. A ten-small-prime cell has F=-84 although every pair lies below a, refuting the proposed pair-trigger majorant. Prime filters contribute explicit terms when bounding the negative part; dropping them is an upper bound, not an identity. No scale-x signed improvement or twin margin follows. | C | [global-factor-signs.md](global-factor-signs.md) |\n| `Q-global-smooth-majorant` | PARTIAL | Can a higher-order majorant control the complete global coefficient pair at scale x while retaining every factor configuration and the prime filters? | Derived using the corrected Henriot upper theorem: a C3 probability average of the same admissible initial cutoffs gives a full residual with sum \\|Ghat_L(n) Ghat_R(n-2)\\|=O(x). The three-smallest-prime majorant has bounded harmonic mass and meets the source growth class uniformly, despite not being multiplicative. All prime-power exceptions are paid. This replaces the O(x log x) absolute budget for the earlier logarithmic profile by O(x) for a different admissible profile representing the same signed residual to arbitrary logarithmic precision. The implied constant is not compared with C2 and no improved signed lower bound or twin margin is supplied. | C | [global-smooth-majorant.md](global-smooth-majorant.md) |\n| `Q-greedy-oracle` | ANSWERED | Is the corrected greedy a G2 oracle? | ORACLE ESTABLISHED, 13 of 13 exactly-known terms hit with minimum ratio 1.0000, so the greedy RULE is an exact solver where the answer is checkable at x <= 41; the rider matters more, the search budget needed grows 3.31x per additional prime and two objects whose truth reaches further show the same estimator's fidelity DECAYING, so nothing is established for the greedy AS RUN on the ladder. | 1b (retired) | [greedy-oracle-validation.md](history/staging/greedy-oracle-validation.md), [phase1-T1-greedy-oracle.md](history/staging/phase1-T1-greedy-oracle.md) |\n| `Q-grouped-divisor-moment` | ANSWERED | Does the full gcd-normalized moment proposed by the literature audit hold, and what exact portion of the twin-prime remainder does it control? | The proposed moment is derived from classical completion with all coefficient sectors and uniform twists included. Full rectangles are controlled when delta<19/25 and delta+3nu<161/100, in addition to the preceding region. A concrete extra cut d<=floor(x^(151/200)), de^3<=floor(x^(321/200)) controls the entire d~e~x^(2/5) benchmark and leaves an explicit smaller-domain endpoint remainder. The uniform product threshold stays below 19/25. At delta=8/25,nu=9/20, the next deficit is confined to small-common-divisor nonzero kernels; their required saving and the global twin margin remain OPEN. Finite validation does not prove asymptotic rates. | C | [grouped-divisor-moment.md](grouped-divisor-moment.md) |\n| `Q-growth-law` | ANSWERED | What does G2(x#) actually grow like? | MEASURED about 0.762 * x ln^2 x * lnln x over x = 11..79 (18 terms, ten log-linear families AICc-ranked), with the honest statement being the band and not the winner; the pure power law is excluded against a control that knows its own answer, and G2/h costs one further logarithm. | none | [attack-growth-law.md](history/staging/attack-growth-law.md) |\n| `Q-h2-extension` | CLOSED | Is extending A288815 (h2) past its 21 terms the high-value computation it was taken for? | No, on both halves, and it is recorded in OUTCOMES.md as WITHDRAWN: term 22 is a roughly four-year single-thread computation for the specialists' own tuned code, all three cheaper proxies fail downward and growing (the direction that fakes a smaller exponent), and the control measured one extra term moving a ten-term exponent fit by 0.022. | none | [h2-scoping.md](h2-scoping.md) |\n| `Q-handoff-review-0906` | ANSWERED | Does the handed-back arithmetic campaign survive an independent check of its main regional estimate and the conclusions used to choose the next research direction? | The bounded handoff audit is completed in reports 20 and 21: the checked local reduction and regional mechanisms survive, named source statements were verified, and the consumer, corner support, rate, shrinking-margin and identity-piece overclaims were corrected. Joint Cauchy is now priced and adds no region. The multiplicative band transfer has a separate PARTIAL owner with a weaker continuous-scale payoff. Imported deep theorems remain imports; this is not corpus-wide certification or a twin margin. | C | [handoff-review-0906.md](handoff-review-0906.md) |\n| `Q-hawkins-read` | ANSWERED | Does the Hawkins random-sieve tradition, read at source, hold a two-class variant, a stage-to-stage moment identity, or an answer to the analogue question? | NOT FOUND for a two-class or k-residue variant; the moment identity is found in the null and not in the fold; and the tradition raises the analogue question repeatedly and answers it only as a missing constant. Two primaries stayed paywalled, so the absence claims rest on the rest of the bibliography. | none | [hawkins-read.md](history/staging/hawkins-read.md) |\n| `Q-head-remainder-0830` | PARTIAL | Does the 5.3 percent remainder that Hardy-Littlewood leaves in the head's endpoint deficit Delta = 2 - beta derive by a route that is not HL: the frozen-sieve first-survivor object, a level-of-distribution correction, or the exact tile-ensemble head? | No route that is not HL closes it, and the remainder as recorded is not what it was taken to be. The record's Delta_meas = 0.6214 at [1e7,1e8) pools a decade over which the prime density falls ten percent, and the OLS intercept absorbs the gradient (a Simpson-type effect, sign derived): the two half-decades read 0.6848 and 0.6500, the four quarter-decades 0.7203 to 0.6565, and pooled minus the gap-weighted mean of the halves is -0.0378, -0.0455, -0.0524 at the three decades, so the same-sign 5.3 percent miss is the pooling. At half-decade resolution HL's pipeline prices Delta to 1.2 and 0.4 percent at the top two windows, inside one standard error, and the sign of the miss alternates. That agreement is a near-cancellation of two four-percent effects: the pipeline under-predicts its own rotation ensemble by 3.6 to 4.9 percent (pipe/ens 0.951 to 0.964 across y = 313 to 19997, MEASURED by exact CRT sampling; 1.049 to 0.958 at y = 11 to 23 by full enumeration), an ensemble quantity that derives by finite count with no prime input and whose sign is opposite to hl3 section 2's guess; and the anchored window's deficit sits 2 to 5 percent below its gap-scale-matched ensemble (Delta_meas/Delta_ens 0.878 to 0.995 over six half-decades, 0.954 to 0.995 on the four with more than 13,000 gaps), the anchoring part, which is a three-point prime correlation in a short window and is HL-strength by every route named. The head is a slack field and nothing here touches Z2. | Z4 | [attack-0830-head-remainder.md](history/staging/attack-0830-head-remainder.md) |\n| `Q-head-residual` | PARTIAL | What is the head's residual prime-origin factor h/R = 1.09 -> 1.03, and does it derive? | h - R decomposes exactly and A_forced derives; h/R -> 1 follows from beta CV^2 being bounded, beta CV^2 -> 2 controlling the RATE and not the limit (under it h - R -> D = -0.95, so +8.4661/ln^2 p cannot be the limit law); R is the continuum functional and the integer-origin null sees R + 1/2 exactly, so h - R = 5.679 depends on the unstated null population, reading 5.179 discrete-uniform and 2.925 coprime-to-30; the mod-30 answer is NO by a valid route, class term -0.0001; Delta = 2 - beta is priced by HL to 5.3 percent with nothing fitted and HL's own 1/ln x term absorbs the miss, so the 5.5 s.e. framing is dropped; the asymmetry-as-mechanism claim and the [0.289, 0.361] bracket are refuted, hl3's 16 percent standing; beta_null is 1.898 for the discrete-consistent null and 2 in the continuum; the 72/28 split reads 81/19 in the other exact order; c = 0.844 is 0.722 on a subset, pinned to 15 percent; Delta_HL ln p/lnln p = 4.02 is a property of the prediction; and the N4 plateau is not OPEN, needing beta CV^2 = 2.71 rising to 6.63. | Z4 | [head-residual-factor.md](history/staging/head-residual-factor.md), [head-residual-hl3.md](history/staging/head-residual-hl3.md), [head-residual-null.md](history/staging/head-residual-null.md) |\n| `Q-heath-brown-edges` | ANSWERED | Does the a=1 edge, and hence the corner S_0, come from the particular two-cutoff Vaughan identity in prime-detection-spec.md and shifted-prime-decomposition.md, or does an equivalent edge reappear under Heath-Brown's identity and the other standard decompositions of Lambda? | The exact identities and exponent simplex leave a=1 in separately bounded formal pieces, including Heath-Brown's balanced j=K configuration. This does not prove an intrinsic edge after identity-piece cancellation. The bounded-cofactor object has affine dilations, not literally F(n)F(n-2). Linnik's fixed truncation has a large term-wise absolute tail by an elementary counting proof; its signed tail is not thereby bounded below. Heath-Brown K=3 narrows the classical split band, with coefficient and Type I normalization obligations retained. No full alternative reduction, new region or twin margin follows. | C | [heath-brown-edges.md](heath-brown-edges.md) |\n| `Q-history-dial` | ANSWERED | Does revealing the scour primes' classes concentrate the floor on a bounded set of strike locations, and what is the history dial worth? | Disconfirming: the class axis is linear at 2.90 survivors per prime read, so no bounded set of strike locations carries the floor, and the touch-count ceiling is proven and tight; deliverable (1) of the brief already existed as canonical state (the forcing ladder 16 -> 45 at @11), so nothing new was bought there. | A | [attack-history-dial.md](history/staging/attack-history-dial.md) |\n| `Q-hm-basis` | ANSWERED | Does the u_sup divergence survive the change to the natural (h,m) basis? | It survives: the two bases are nested rather than rivals, the natural one is the outer and weaker member, and the gap between them is a flat factor of 7.26 across nine levels, so the divergence that closed u_sup runs in both bases. | none | [attack-hm-basis.md](history/staging/attack-hm-basis.md) |\n| `Q-holt-2605` | ANSWERED | Does the fifteenth Holt manuscript, arXiv:2605.19165, contain anything that touches our record? | No: it carries no twin, no max-gap bound and no G2, its \\|s\\|/2 threshold restates the 2603.25915 / 1408.6002 inequality, and the interaction check is negative, our extinction law diverging from his by a factor 396 across three decades of W; the sweep is now complete at fifteen of fifteen. | none | [holt-2605-sweep.md](history/staging/holt-2605-sweep.md) |\n| `Q-hsub-reductions` | PARTIAL | Can (H-sub) be proven or refuted, and what does the fold machinery reach? | Neither, but the statement is smaller: three reductions of the hypothesis are proven, the lemma consuming only power pairs so that it weakens to (H-sub-pow) with the conclusion unchanged, the fold machinery's inability to reach any of them is made exact, and the hunt over all 111 reachable pairs found no drifting family and no counterexample. | 1d | [attack-hsub-01.md](history/staging/attack-hsub-01.md) |\n| `Q-hsubpow-K` | CLOSED | Can (H-sub-pow) be proven with an explicit K in the legal zone? | NO by three mechanisms: the CRT lift (K* >= pi(y') - pi(y) diverges), anchored caps (diverge at every base), Iwaniec at two classes (it IS beta2-note); TODO 1d's legal zone is mis-stated, the trusted zone is [1.3946, 11.3568). | 1d | [hsubpow-explicit-K.md](history/staging/hsubpow-explicit-K.md) |\n| `Q-hsubpow-K-0829n` | OPEN | Can (H-sub-pow) be proven with an explicit K inside the trusted legal zone [1.3946, 11.3568) by a mechanism the 2026-08-28 pass did not close? | No K is proven at any base; the single open inequality is the uniform-in-k ratio cap G(b^(k+1))/G(b^k) <= e^K G(b), which is a proof gap at a fixed base and a possible truth gap across bases, since for any law G ~ c n^beta (ln n)^delta the all-bases hypothesis holds with finite K if and only if delta >= 0. | 1d | [attack-0829n-hsubpow-K.md](history/staging/attack-0829n-hsubpow-K.md) |\n| `Q-hybrid-bound` | CLOSED | Does an exactly-handled head of small primes plus a sieved tail improve the certified exponent? | The glue closes and is a real theorem, and it buys one factor of 1.93 in x and nothing asymptotic: the window where the bound beats 4.2665 widens from x <= 227 to x <= 439 and never returns, the head can only reach x0 = O(ln x), and the literal glue the brief named (A144311 as base case) is dead on a type mismatch. | none | [attack-hybrid-bound.md](history/staging/attack-hybrid-bound.md) |\n| `Q-identifications-prior-art` | ANSWERED | Who owns the three identifications that were banked without a prior-art search? | All three are OWNED in their conventions: the complementary-window duality, maxsum_m as the largest m-spacing of a scan statistic, and the alternation language as a textbook charge constraint; the exponent law H = a + b ln D and the H* Shearer-threshold ladder come back NOVEL-SO-FAR on four calibrated channels. | none | [identifications-prior-art.md](history/staging/identifications-prior-art.md) |\n| `Q-import-bfree` | ANSWERED | Does the ergodic theory of B-free systems - Mirsky measures, Toeplitz structure, tautness, heredity, entropy - say anything about the twin comb? | It lands as an exclusion: the comb is exactly the object the field's newest generalisation is built for and that generalisation names the comb's own regime as the one it declines to study, the limit comb is the single point {-1} so every ergodic statement about it is vacuous, and the yield is a corrected address for the walls plus one live external open problem. | none | [import-bfree.md](history/staging/import-bfree.md) |\n| `Q-import-boolean-analysis` | CLOSED | Does the analysis of Boolean functions reach the anchored bias? | Five things that had to hold do not, starting with the product space eating the statement worse than C^pi(x); the forced degree saturates at 2 and the globality hypothesis fails at q1, so the row supplies a wall address rather than a route, and every figure is SCRATCHPAD-GRADE and may not be quoted until re-derived inside an embedded producer. | none | [import-boolean-analysis.md](history/staging/import-boolean-analysis.md) |\n| `Q-import-bridge` | CLOSED | Do Ojaroudi's Bridge and collision lemmas certify a number the corpus lacks? | Both lemmas are true and both proofs go through in three lines here, and the answer to the question the import was raised for is no: the certified-number verdict is zero by an identity rather than by a margin, and the per-prime nature is what stops it. | none | [import-bridge.md](history/staging/import-bridge.md) |\n| `Q-import-bridge-prereg` | SUPERSEDED | Do Ojaroudi's two elementary lemmas, imported onto our tile, beat the incumbent per-prime discrepancy numbers? | Pre-registration only, sealed before any number was computed: the predictions, the incumbents, the win condition and five declared traps are fixed here, and the null result is the expected result because P4 is an identity; the outturn is import-bridge.md. | none | [import-bridge-prereg.md](history/staging/import-bridge-prereg.md) |\n| `Q-import-chaining` | CLOSED | Can Dudley's entropy bound or Talagrand's generic chaining beat the union bound over positions on the maxsum law? | No, and the reason is geometric rather than probabilistic: the entropy integral of the true increment metric is already 1.054-1.099 times rms*sqrt(2 lnW) at its lower branch and 1.484-1.545 at its upper, flat across z = 13..23, so chaining's ceiling with a perfect universal constant sits below the union bound's floor; the honest constant-carrying chain measures 2.878 to 3.027. | 0c | [import-chaining.md](history/staging/import-chaining.md) |\n| `Q-import-distortion` | CLOSED | Does the distortion method of covering systems speak at two classes per modulus, and what does it certify on the window? | It does speak at two classes, and the row's expected blocker was the wrong one: its economy sum 4/p^2 converges (sup 0.364545) where the union bound's sum 2/p dies at x = 13, but it charges in ambient length, its measures living on a CRT product so the certified window is at least a primorial and the only published bridge back to an interval is exponential in the number of progressions. | none | [import-distortion.md](history/staging/import-distortion.md) |\n| `Q-import-distortion-prereg` | ANSWERED | What does the distortion method certify on our window, and does it speak at one class per modulus or at two? | Sealed before any line of the producer existed; scored in import-distortion.md, where the deciding question comes back opposite to the row's expectation: BBMST's criterion carries no distinctness, multiplicity or minimum-modulus hypothesis, so the method speaks at two classes and the one-versus-two-class wall is not its wall. | none | [import-distortion-prereg.md](history/staging/import-distortion-prereg.md) |\n| `Q-import-entropy-decrement` | CLOSED | Does Tao's entropy decrement argument, the one place a parity-type obstruction was circumvented for a two-point correlation, transfer to the tile's census? | It does not: the engine runs on multiplicativity at small primes and the census is defined by the absence of small prime factors, Tao scopes twin-prime sums out himself in print, and the census sits on the structured side of the pretentious dichotomy; all figures SCRATCHPAD-GRADE. | none | [import-entropy-decrement.md](history/staging/import-entropy-decrement.md) |\n| `Q-import-fracparts` | ANSWERED | Does Saffari-Vaughan Theorem 10 cover the branches carrying the Skeleton door's mass? | Prediction HIT: the covered branches carry at most 8 percent of the mass; anchor and a sharper wall-address banked; the THEOREM column is struck, not merely overpriced, because Theorem 10's range condition is x^{6/11+eps} < y, which fails at fixed M; no route; no cap-36 line is upgraded. | 4 (retired) | [import-fracparts.md](history/staging/import-fracparts.md) |\n| `Q-import-hypergraph` | MIXED (import-hypergraph-prereg.md: OPEN; import-hypergraph.md: ANSWERED) | Does hypergraph covering (Pippenger-Spencer / FGKMT) apply to the adversary's construction? | The covering theorem is class-count-agnostic and the analogy is EXACT at the hypothesis level, leaking at exactly one named place, the edges the machine needs as input; Branch A landed a theorem-provenance lower bound G2(x#) >> x ln x (HELD), Branch B died as predicted with a sharper wall than the registered one, and none of the three pre-registered kill lines fired. | none | [import-hypergraph-prereg.md](history/staging/import-hypergraph-prereg.md), [import-hypergraph.md](history/staging/import-hypergraph.md) |\n| `Q-import-interp` | ANSWERED | Does the Bayati-Gamarnik-Tetali interpolation method reach the G2 Fekete object? | No: BGT closes on hypothesis H1, since the constraint count never splits (pi(st) - pi(s) - pi(t) is zero at no pair with st >= 25, minimum 2, maximum 12, VERIFIED on 104 pairs), and the one coordinate that does split has limit +infinity; the row lands as WALL-ADDRESS plus the identity that the submultiplicativity defect is the Overshoot slack. | 1d | [import-interp.md](history/staging/import-interp.md) |\n| `Q-import-interp-prereg` | SUPERSEDED | Does the interpolation method (Bayati-Gamarnik-Tetali, Proposition 5) transfer to the G2 ladder, and in which coordinate? | Pre-registration only, committed alone before any producer existed, with the source verified at page images first (Proposition 5 is a special case of de Bruijn-Erdos, by the authors' own attribution); the predictions and the meaning of each outcome for the map are fixed here, and the outturn is import-interp.md. | none | [import-interp-prereg.md](history/staging/import-interp-prereg.md) |\n| `Q-import-kw-zonegap` | ANSWERED | What does the graded Kourbatov-Wolf row buy the Z2 programme, and does the flagged 0.7574 against 0.7504 agreement corroborate anything? | A split-cell circularity verdict: the trend formula's raw performance is real, G/Tbar inside [0.78, 1.05] over thirteen decades with zero fitted parameters, but the flagged agreement is adjudicated a range accident, and since Theorem occurs zero times in the source the row can only be priced PUBLISHED-ANCHOR plus WALL-ADDRESS, whose wall is a quantifier: an almost-all over a log-sparse record sequence cannot deliver an every-zone statement. | none | [import-kw-zonegap.md](history/staging/import-kw-zonegap.md) |\n| `Q-import-l1l2` | CLOSED | Does an l1 -> l2 conversion on the (e,a) coefficient sum buy the needed sqrt(log)? | The pre-registered kill line (rho >= 0.5 at every level) does NOT fire, rho falling 0.4352 to 0.0645 at z = 13..41, and the programme dies anyway on what the decay measures: \\|\\|Theta\\|\\|_1/\\|\\|Theta\\|\\|_2 grows by 2.01 per added prime against 2.0516 for S_sat, so the l1/l2 gap is not a proxy for the C^{pi(z)} price, it IS that price; rows 5 and 6 retire together. | none | [import-l1l2.md](history/staging/import-l1l2.md) |\n| `Q-import-l1l2-prereg` | CLOSED | Does the l1 to l2 conversion on Theta_e(a) reach the threshold the import map set? | Sealed before any number was computed; scored in import-l1l2.md, where the pre-registered kill does not fire and the programme dies anyway: rho falls monotonically from 0.4352 to 0.0645 over z = 13..41, never reaching the map's 0.5 line, and what the conversion outputs is the sharp maximal law. | none | [import-l1l2-prereg.md](history/staging/import-l1l2-prereg.md) |\n| `Q-import-map` | PARTIAL | Which foreign mathematics is worth aiming at this object, and what did each landed import actually buy? | Nineteen landings, zero routes opened on the exponent; every one banked a proven identity, a derived constant, a published anchor or a wall address, which is why payoff is graded by TYPE rather than by probability, and the map is live with rows still unrun. | none | [IMPORT-MAP.md](IMPORT-MAP.md) |\n| `Q-import-map-construction` | ANSWERED | What was searched, what was rejected, and at what verification level, in building IMPORT-MAP.md? | The reconnaissance record behind the map: candidates rejected with reasons (hypergraph containers for want of a supersaturation input; determinantal processes by a proof-level obstruction, the twin tile failing the pair inequality at d = 6), a per-attribution SOURCED / SOURCED-BIB / MEMORY ledger, and two results derived here and offered for adjudication. | none | [import-map-construction.md](history/staging/import-map-construction.md) |\n| `Q-import-maxplus` | ANSWERED | Do max-plus (tropical) spectral theory and subadditive ergodic theory bound the fold recursion's growth exponent? | The mapping is exact rather than an analogy - the fold is p-fold cyclic duplication followed by max-plus state elimination and the copy theorem is a semiring identity, verified at 6 of 6 folds - but the tropical Perron root of the tile is the mean gap mbar, not G2, so the import delivers a structural negative, a sharpening of A5's Theorem A, and refuses the growth exponent. | none | [import-maxplus.md](history/staging/import-maxplus.md) |\n| `Q-import-proof-complexity` | CLOSED | Does proof complexity supply the barrier that wall-note Face 4 wants? | The row is VOCABULARY-ONLY and is recommended for rejection at the gate: the shared word is parity naming two different objects, a degree bound is a pseudo-expectation whose finite exact instance the corpus already refuted, and any unconditional barrier would imply Siegel-zero finiteness; the payoff is Tao and Brady 2014 read at source as a published anchor and a wall address, not a theorem. | none | [import-proof-complexity.md](history/staging/import-proof-complexity.md) |\n| `Q-import-repulsive` | CLOSED | Does any repulsive point-process model (determinantal, Coulomb gas, hyperuniform) reproduce the twin tile's sub-Poisson counts? | NO, two-sided: g(2) = 0 kills positively-associated models and g(6) = 2.66 (g never in (0,1); support 6 \\| d, g >= 2.38) kills Hermitian determinantal and negatively-associated ones; the Gibbs extension is withdrawn; every fixed level is periodic hence class I hyperuniform and the statement is empty, while along the diagonal family L = y^u no member approaches a hyperuniform limit in Var/E, which is a statement about the family and not a class for any one tile; the determinantal row's quoted product evaluates to 0 and its obstruction distance is 6 not 2. | none | [import-repulsive.md](history/staging/import-repulsive.md) |\n| `Q-import-rough-anatomy` | ANSWERED | Does the analytic theory of rough numbers derive the depth law's drift, and is u = 2 a singular point of the dimension-2 sifting functions? | SCRATCHPAD-GRADE throughout, and leaning on three never-red-teamed premises: the drift is derived to 0.16 per cent by exact Mertens products and NOT by any published next-order term (the one in print is the wrong term for this object), and u = 2 is one identity seen four times rather than a singular point of the dimension-2 sifting functions. | none | [import-rough-anatomy.md](history/staging/import-rough-anatomy.md) |\n| `Q-import-rows-15-17` | ANSWERED | Which three new fields deserve import-map rows, and at what price? | Row 15 is a wall address and a published anchor and NOT a theorem, since Theorem 10 requires x^{6/11+eps} < y and fails at every fixed M; row 16 is stale, its experiment already executed by record-location-null.md and its prior-art half closed by lit-kourbatov-shortfall.md; row 17 lands as priced; six fields rejected with pointers and one promoted to row 17. | none | [import-map-rows-15-17.md](history/staging/import-map-rows-15-17.md) |\n| `Q-import-scanstat` | ANSWERED | Does the extreme-value theory of scan statistics settle the disputed sqrt(m) claim of IMPORT-MAP row 1? | The identity offered for adjudication is true and its conclusion is false - Sum gamma(k) = 0 is trivial while the step to Var(S_m)/m tending to 0 is refuted by a free permutation counterexample - the Leadbetter half of the row is confirmed as written and the pre-registered kill criterion passes at both target levels, one of them blind; the adversary pass corrected the claim that T29 had never been computed here to a reproduction. | none | [import-scanstat.md](history/staging/import-scanstat.md) |\n| `Q-import-scanstat-prereg` | OPEN | What is the maxsum exponent at T_23 and T_29, predicted from a T_13/T_17/T_19 fit before the run? | Machine-written pre-registration only: the extrapolation laws, the grid and the kill criterion (Model A must beat Model B on the ln-RMS of excess_m at T_23) are fixed before any scoring, so part 4 cannot be scored against a prediction chosen after the fact. | none | [import-scanstat-prereg.md](history/staging/import-scanstat-prereg.md) |\n| `Q-import-shearer` | ANSWERED | Where does Shearer's region actually end for the fold read as a repulsive lattice gas? | SURVIVES WITH CORRECTIONS under the 2026-08-19 adversarial pass: the complete-graph identity is verified by independent-set enumeration at n = 2..8, H* = 35..481 reproduce exactly and the 2/sqrt(e) floor is sound, but the tightness witness's disjoint-intervals sentence is false exactly where invoked and the atomicity lemma's hypothesis is load-bearing and not shown, the closure surviving instead on the sequel's gamma_i >= mu(f_i). | none | [import-shearer.md](history/staging/import-shearer.md) |\n| `Q-import-shearer-prereg` | ANSWERED | Where does Shearer's region actually end on the repulsive lattice gas model of our window? | Sealed before any line of the producer existed; scored in import-shearer.md, where the exact criterion says the local lemma is the union bound on a complete dependency graph, and the two levels it buys over the local lemma's own sufficient condition are the only thing it buys. | none | [import-shearer-prereg.md](history/staging/import-shearer-prereg.md) |\n| `Q-import-sofic` | ANSWERED | Does constrained coding and symbolic dynamics identify the Alternation Lemma's shift, and does the import map's shape claim survive? | The identification is exact and better than the map states - the shift is strictly sofic, two states, four edges, Perron root exactly 2, and the graph's own per-step rate is 2/p rather than the 3/p the map divides by - and the pre-registered ratio test then kills the map's literal formula while the graph-corrected one survives only as a small-D transient spent by fold 37; the shape claim does not stand, and it fails in the corpus's favour. | none | [import-sofic.md](history/staging/import-sofic.md) |\n| `Q-import-sofic-prereg` | OPEN | Does the constrained-coding presentation of the fold predict the exact per-fold L, and is the shift sofic? | Pre-registration only, and declared weaker than the G2(41#) case because the nine exact L values were already published in the corpus: what is fixed here is the estimator, the exclusion rule, the trend statistic and the kill thresholds, plus a soficity verdict written before the check, strictly sofic and not of finite type. | none | [import-sofic-prereg.md](history/staging/import-sofic-prereg.md) |\n| `Q-import-stein` | CLOSED | Does Stein's method for Poisson approximation derive the extinction law's constants and the ~3.8 joint deficit? | The pre-registered kill fires at both targets for one structural reason: each object is driven by exactly one shared uniform draw, so the non-neighbourhood indicators reconstruct it and b3 climbs to its own ceiling, measured at 0.850 to 0.9998 of that ceiling and 200 to 800 times b1 + b2; with no error term there is no Stein derivation, and the first-moment arithmetic banks the (A, c) pair anyway, relabelled. | none | [import-stein.md](history/staging/import-stein.md) |\n| `Q-import-stein-prereg` | CLOSED | Does Stein's method for Poisson approximation bound the extinction law or the ~3.8 constant? | Sealed before any producer ran; scored in import-stein.md, where the pre-registered kill criterion fires at both targets for one structural reason, that both objects are driven by exactly one shared uniform draw, which is precisely the dependence the b3 term measures. | none | [import-stein-prereg.md](history/staging/import-stein-prereg.md) |\n| `Q-import-suen` | ANSWERED | Do Suen's inequality, Janson's inequality and the Lovász Local Lemma family supply the missing proof for the anchored delta? | No inequality can: the import lands and what it certifies is that the target was never a lemma, the NOT-REACHED item being the Twin Prime Conjecture wearing a percentage; what it does deliver is the constant in the sharp form and the wall's address in local-lemma coordinates. | none | [import-suen.md](history/staging/import-suen.md) |\n| `Q-import-thinning` | ANSWERED | Do point-process thinning and interval coalescence give H'' a null model? | Yes and exactly: the fold recursion is an exactly solvable thinning whose gap pgf transforms by a Mobius map fixing 0 and 1, so under independent thinning the gap word of T_x is exactly geometric with mean mbar/6 at every rung with no error term, which turns both of the record's fitted parameters into derived ones. | 0b | [import-thinning.md](history/staging/import-thinning.md) |\n| `Q-import-transference` | CLOSED | Does the transference principle and relative Szemeredi theory reach the twin pattern? | VOCABULARY-ONLY and closed by an exclusion in print: the founding paper names our configuration as out of scope in one printed sentence, the theorem degenerates at k = 2 which is the case we want, and the W-trick removes the tile before the argument starts; re-entry costs a finite-complexity system whose solvability implies the Zone Postulate. | none | [import-transference.md](history/staging/import-transference.md) |\n| `Q-import-vc-nets` | CLOSED | Does VC dimension, epsilon-net or set-cover duality bound G2? | VOCABULARY-ONLY, at a self-set 0.2 per cent confidence of opening the 4.2665 -> 2 gap and with every number SCRATCHPAD-GRADE: the range space's VC dimension is small and its growth is O(log log L) (proven), but the dual shatter function is exponential, the interval formulation's hypothesis contains its conclusion, and the full-period formulation is clean, free and on the wrong side of the inequality. | none | [import-vc-nets.md](history/staging/import-vc-nets.md) |\n| `Q-ioslack-survey` | CLOSED | Does any instrument in the corpus carry a sharp-level signature that would let the infinitely-often slack be spent? | None does: 23 instruments surveyed and 19 eligible, smallest per-instrument p_FWE = 0.1082 and 0.8865 after Šidák, so dial 4's fourth channel closes and the dial is finished; the second finding is that maxsum_{L+1} is sharp exactly when L = 1. | 0e (retired) | [ioslack-survey.md](history/staging/ioslack-survey.md) |\n| `Q-joint-correction-source-audit` | ANSWERED | Does completing the supported prime-partner correction yield cancellation beyond the existing Vaughan reduction, and which literature inputs actually justify that completion? | CHECKED prior-art matches for subset convolution, complementary sieve sums and signed smooth-number distribution. DERIVED reconstruction identifies the unrestricted factor weight with an existing short divisor approximant, up to the paid prime-power error. Its supports are x^(12/25) and x^(1/10). Reassembling the entire joint correction returns the already-open Vaughan remainder and supplies no new signed bound. A formal factor-vector control distinguishes the unrestricted logarithmic weight from the selected prime-cofactor branch. The matched general sieve theorems require inputs not supplied here. Literature novelty is unestablished; twin infinitude remains OPEN. | C | [joint-correction-source-audit.md](joint-correction-source-audit.md) |\n| `Q-joint-factor-estimate` | ANSWERED | Can an additional estimate for actual factor configurations control the full signed balance of the C3 residual? | DERIVED: for the single-large-prime delta-rough family F, the residual splits exactly as R_F = C2*x*H_delta - Z_F^p + o(x), where the Type I part C2*x*H_delta is evaluated by ordinary prime BV on each cofactor interval and the twisted Mobius constant 2C2 (corrected 2026-09-08 after V2: Wu Lemma 2.3 is squarefree-only and did not cover the non-squarefree b_R moduli; prime BV covers all moduli), and Z_F^p is the signed prime-partner sum. The complement carries the opposite Type I part -C2*x*H_delta, so grouping by factor configuration transfers Type I mass and leaves the twisted prime correlation B_L unchanged. With the matched upper sieve the family bound is C2*x(1+H_delta-(40/9)H^+), certified below -2/5 C2*x: INSUFFICIENT BOUND. Even a sieve constant 2 in place of 40/9 needs H^abs<1 and leaves the complement unpaid. Independently reviewed 2026-09-09 with the uniform delta-range and complement corrections below. Twin infinitude and every sufficient margin remain OPEN. | C | [joint-factor-estimate.md](joint-factor-estimate.md) |\n| `Q-k4direct-swap` | ANSWERED | Does swapping the shipped Monte Carlo estimator for k4direct meet the @13 gate, and is the x3600 on record a speedup? | The swap meets the gate by x3632, but the margin on record is an ACCURACY margin and not a speedup: k4direct is a 4x to 8x SLOWDOWN, 93.5 s against 11.7 to 23.4 s, and the 198.9 s on record for it is 2.1x too expensive, which drags the @17 extrapolation from 8.5 days on ten cores to about 4.4. | none | [verify-k4direct-swap.md](history/staging/verify-k4direct-swap.md) |\n| `Q-kappa-not-L` | CLOSED | Can L, or its generalisation kappa(m), be bounded well enough to be the route's target? | L is not the target: three bounds on L are PROVEN through the Alternation Lemma and transfer to kappa(m), but the wall is located precisely and the lower bound never becomes exact, so L cannot be made irrelevant; closed 2026-08-19, L has no law of its own, being G2 divided by the block's own spacing and super-additive on disjoint sets. | none | [kappa-not-L.md](kappa-not-L.md) |\n| `Q-kernel-sign-control` | ANSWERED | At delta=8/25, nu=9/20, is the moment Mfrak and its small-common-divisor kernel X_small measurably smaller with the actual coefficient b_u=A_right(gu) than with \\|b_u\\| or with \\|b_u\\| times an independent seeded random sign, and does the actual/random ratio decrease with x over the feasible dyadic range? | MEASURED, negative. Over seven dyadic scales j=18..30 and four boxes, the pre-registered slope of log2(actual/random) for X_small has mean + sd >= 0 in all four families, so the run gives no heuristic support for extra Mobius-sign cancellation in the small-j kernel. The actual coefficient's \\|X_small\\| ranks like one more random draw. The measurement is weak where it matters: the finite moment is 97.66-102.58 percent equal-frequency class, X_small carries 0.02-2.88 percent, J0=floor(x^(1/20)) is 1 at j=18 and 2 at j=20..30, and Z=2 collapses the prime-power sector of (13) to r=2. Equation (21) and the global twin margin remain OPEN and untouched. | C | [kernel-sign-control.md](kernel-sign-control.md) |\n| `Q-kk-substitution` | ANSWERED | Does the Kalmynin-Konyagin construction survive substituting the two-class set Omega_p = {a_p, a_p - 2}, and what lower bound does it give? | STANDS WITH CORRECTIONS: G2(P(y)) >> y (ln y)^3 (lnlnln y)^2 / (lnln y)^4 for y >= y0 survives every attack made here, including an exhaustive brute force of the Proposition itself over four million values of i; five corrections follow and none touches the exponent. | none | [attack-kk-substitution.md](history/staging/attack-kk-substitution.md), [verify-kk-substitution.md](history/staging/verify-kk-substitution.md) |\n| `Q-klz-forward-walk` | ANSWERED | Does the forward citation graph of arXiv:2205.08273 hold a two-class or k-class complexity result, and is Part II out? | The forward graph has exactly one member on three independent indices and it never treats word complexity; no citing work goes beyond one class per prime, Part II is NOT OUT as of 2026-08-19, the owning convention was OEIS A023192 all along, and the comparison is APPLES-TO-APPLES so the exponent-shape sentence needs no heredity caveat. | none | [klz-forward-walk.md](history/staging/klz-forward-walk.md) |\n| `Q-kstar-drift` | ANSWERED | Is the drift in K* across doubling steps structural, and how far past the scannable levels does the certificate reach? | Structural and it lands early: K* is now enumerated at 16 doubling steps against 11, the raw drift slope steepens from 0.6881 +/- 0.1328 to 0.8184 +/- 0.0908, and the period-free certificate touches K*+1 = 18, 93.5% of 2^beta2 = 19.2455, at the base-2 chain step s = 16 itself. | none | [attack-kstar-01.md](history/staging/attack-kstar-01.md) |\n| `Q-kstar-prereg` | OPEN | What is K* at the three next doubling steps, predicted before any period walk? | Pre-registration only, committed alone: the predictions, the scoring rule and the growth-type verdict thresholds are fixed in advance, with the inclusion-exclusion engine validated against an independent scan engine on all eleven known steps first. | D | [attack-kstar-01-prereg.md](history/staging/attack-kstar-01-prereg.md) |\n| `Q-l1-residue` | CLOSED | Is the L = 1 residue count an open counting hypothesis whose proof would deliver the Zone Postulate? | REFUTED as a hypothesis: restore the dropped L >= 2 terms and it IS the Zone Postulate, so the chain is a tautology, and leave them out and what remains is provably no stronger than the target; Lemma A (inside B(p) the residue condition is the kill condition) is PROVEN and VERIFIED at 237 folds, and the route lands back on the residue-deleted maxsum without advancing it. | none | [attack-l1-residue.md](history/staging/attack-l1-residue.md) |\n| `Q-lambda-ledger` | CLOSED | Does parity information survive in the lambda-weighted fold ledger? | REJECT, against a pre-registered threshold fixed before the producer existed: the lambda multiplier exists and is parity-free, so the ledger is blind at its design point rather than at its margins; two columns are pinned by proof, and nothing here is novel mathematics. | Z5b (retired) | [attack-lambda-ledger.md](history/staging/attack-lambda-ledger.md) |\n| `Q-ledger-extraction` | ANSWERED | Can the QC engine's three suppression ledgers be moved out of the checks and into data? | Moved: all three now live in research/qc/ledgers.js, the fast gate and the selftest are byte-identical to their pre-change output, and all 25 entries were verified verbatim against git HEAD by key, order and reason text. | none | [audit-ledger-extraction.md](history/staging/audit-ledger-extraction.md) |\n| `Q-ledger-forced` | ANSWERED | Which properties of the fold ledger's columns are FORCED rather than expected? | Fourteen forced constraints, all identities or wrong-direction bounds; by_new is forced only in the prime gap (its O(1) is MEASURED); nothing forces net from below. | Z5b (retired) | [fold-ledger-forced.md](history/staging/fold-ledger-forced.md) |\n| `Q-left-divisor-signs` | PARTIAL | Can the Möbius structure of the left coefficient A_left(gm) replace the first Cauchy inequality, so that its sqrt(M) loss is not paid, and what does that buy at the target box (delta,nu)=(8/25,9/20) and at the corner a=b=1? | Partly, and not where it is needed. Two lemmas are derived: a Type I bound with no zero-frequency budget, usable at the target box whenever the arbitrary block is shorter than x^(1/4), and a Type II bound that is uniform in the Perron twist heights. Applied to the actual coefficient they confine the target-box deficit to sectors with left prime power r>=x^(43/200) and right prime power q>x^(3/100), and lower the worst block exponent there from 103/100 to 41/40. The corner a=b=1 is untouched: grouped, Type I, Type II, Bettin-Chandee/Wright and even a hypothetical per-block square-root bound all exceed 1 there. No region is added, E_dagger and the consumer (20) are unchanged, and the global twin margin remains OPEN. | C | [left-divisor-signs.md](left-divisor-signs.md) |\n| `Q-lemmaV-meansquare` | PARTIAL | Does the mean-square-in-x form of Lemma V hold, and what does the proof cost? | Proved unconditionally, _H <= B(z,s)*H for every H, z and level s, and the proof stops at exactly one place, B(z,s) bounded: B(z,3.0) measures 1.3833 to 1.4883 at z = 13..37, flat to 8 per cent over the whole computable range, which is a measurement and not a bound. | none | [attack-beta2-01-lemmaV-meansquare.md](history/staging/attack-beta2-01-lemmaV-meansquare.md) |\n| `Q-lemmaV-neighbours` | ANSWERED | What do the five Lemma-V-adjacent instruments give when read at source, and which hypothesis do we violate? | The right instrument is Maynard's Lemma 6.12, owned by Deshouillers-Iwaniec 1982 Theorem 12 and sharpened by Pascadi's Corollary 18 in exactly the term that binds us; the hypothesis violated is narrower and sharper than the corpus expected, since all three papers allow arbitrary rough coefficients in three of five variables and what they require is smoothness where we have none. | none | [lemmaV-neighbours.md](history/staging/lemmaV-neighbours.md) |\n| `Q-lemmaV-usup` | ANSWERED | Does u_sup plateau below beta2, or diverge? | It rises at every added level, 2.0617 at z = 13 to 3.2026 at z = 43: a plateau below beta2 is rejected and so is the fast divergence attack 1 feared, leaving \"plateau above beta2, or divergence\", which for this route is the same verdict (divergence since REFUTED at fixed s by attack-0829n-rml-proof.md section 4.1, adjudicated in verify-0830-usup-convention.md). | none | [lemmaV-sup-extension.md](history/staging/lemmaV-sup-extension.md) |\n| `Q-level-ledger-tight` | PARTIAL | How much of the Level Ledger's 2*3^{pi(x)-1} class-discrepancy bound can be taken back? | The sup-versus-variance gap is not closed, and section 4 shows no L1 Fourier method can close it, since such a bound is already >> 2^{pi(x)} from its own j = 1 term; what replaces the exponent is an exact reduction to one finite quantity, computed by exhaustion to y = 19, and a proven CONSTANT factor 81.0 uniform in x, p and a (53.9 from the cheap y = 17 seed), which does not grow. | none | [level-ledger-tight.md](level-ledger-tight.md) |\n| `Q-lichtman-decomp` | ANSWERED | What is the wall's published constant 3.29956 made of, and is there technique slack a method of this class could spend? | The split is multiplicative, 3.2995525 = 2 x 1.649776 with the second factor an equidistribution deficit, so the brief's \"remaining 1.65 of technique\" has no referent and category (b) is empty; the floor for this class is 2 on Type-I data and still 1.122919 at unlimited level, all arithmetic SCRATCHPAD-GRADE. | none | [attack-lichtman-decomp.md](history/staging/attack-lichtman-decomp.md) |\n| `Q-lit-evans` | ANSWERED | Does Evans, Correlations of almost primes, reach y about x^0.28, does it ever fix h, and is there a secondary term to harvest for the depth law? | None of the three, and the item named the single highest-value unread item in the survey yields nothing for the depth law: over the whole 35-page extraction Buchstab, rough, sifting and omega(u) each occur zero times, so the paper has no sieve-depth coordinate, and its object is E2 numbers, a multiplicative condition rather than a roughness one. | none | [lit-evans.md](history/staging/lit-evans.md) |\n| `Q-lit-fgkt-maier` | ANSWERED | Do the corpus's FGKT and Maier quotations hold against the PDFs of record? | The quotations are VERBATIM where checked, including at the sub/superscript level HTML destroys, and the defects are in the claims built on them: a Buchstab dimension error at four sites, one of them publication-track and self-contradictory, and two provenance errors (the Maier-Pomerance equality form and the FGKT/FGKMT R-statement); Cheer-Goldston was not obtained, so one quotation stays unverified. | none | [lit-pdf-fgkt-maier.md](history/staging/lit-pdf-fgkt-maier.md) |\n| `Q-lit-fkmpt-quotes` | ANSWERED | Do the corpus's FKMPT quotations hold against the journal PDFs of record? | All three quotations are VERBATIM or CONFIRMED and two of the three surrounding claims are supported; the third is not, the cited section 1.3 does not exist (the passage is 1.1) and the connective overreaches, and five corrections are drafted including one silent elision inside a block labelled verbatim. | none | [lit-pdf-fkmpt.md](history/staging/lit-pdf-fkmpt.md) |\n| `Q-lit-halberstam-richert` | ANSWERED | Do the Halberstam-Richert and DHR citations in dhr-verification.md and two-class-lower-bounds.md check out against primary sources? | Mostly reachable, against the brief's expectation: seven claims verbatim against source including beta2 about 4.266 at the book page itself, one UNREACHABLE (HR Corollary 2.4.1), the meaning of DHR and the Friedlander attribution both settled, and 4 defects among 21 further attributions swept. | none | [lit-pdf-halberstam-richert.md](history/staging/lit-pdf-halberstam-richert.md) |\n| `Q-lit-kalmynin-konyagin` | ANSWERED | Do the corpus's Kalmynin-Konyagin citations hold against the PDF of record? | Item 2 is clean, reproducing their Theorem 1 at l_f = 2, h_f = 0, M(f) = 2 exactly; item 1 is MISROUTED, the quote being FKMPT's Definition 1 rather than K-K; and the word twin appears zero times in every version, with the calibration running opposite to expectation, since they delete two or more residue classes per prime and run a dimension-2 Mertens ledger, which our own absence rows still call ABSENT. | none | [lit-pdf-kalmynin-konyagin.md](history/staging/lit-pdf-kalmynin-konyagin.md) |\n| `Q-lit-kourbatov-grob` | ANSWERED | Do the Kourbatov and Grob quotes on which the ZONE-POSTULATE retraction rested hold against the PDFs of record? | They hold: four verification items land VERBATIM against the published article and Grob's three negatives are confirmed, so the retraction was justified and a true claim was not retracted on false evidence; the corpus under-reports Grob in two places. | none | [lit-pdf-kourbatov-grob.md](history/staging/lit-pdf-kourbatov-grob.md) |\n| `Q-lit-pdf-bft` | ANSWERED | Do our Banks-Ford-Tao quotations survive checking against the PDFs of record? | All three quotations VERBATIM, checked by scripted normalised diff rather than by eye; one was misattributed by the brief and not by the document (it is Maier-Pomerance), the demotion resting on their model R stands, and the corrections owed to the record are listed. | none | [lit-pdf-banks-ford-tao.md](history/staging/lit-pdf-banks-ford-tao.md) |\n| `Q-lit-pdf-holt-rudd` | ANSWERED | Do our Holt and Rudd citations survive checking against the arXiv PDFs of record? | Every quotation VERBATIM with no misquotation found, but Lemma 3.1 is not the lemma the demotion needs, the 2p spacing result carries no numbered theorem of that name, several attribution defects and two internal conflicts are ours to settle, and the absence claim remains an absence claim. | none | [lit-pdf-holt-rudd.md](history/staging/lit-pdf-holt-rudd.md) |\n| `Q-lit-scourfield-2008` | ANSWERED | Does Scourfield, Smooth divisors of polynomials (LMS Lect. Note Ser. 352, CUP 2008, 286-311), supply the divisor-distribution estimate that varE-theta2-proof.md section 6 leaves open? | DOES NOT DELIVER, at SECOND-HAND rung, and the chapter is still UNREAD at the page: ten channels were attempted, nine answered, and every one that answered is closed, degraded or paywalled, but the author's own restatement of the 2008 theorem, read at the page image of Scourfield, Funct. Approx. 55.1 (2016) 84 eq. (1.1), counts divisors m <= x of f(n) for n <= x with weight 1, for f a product of pairwise coprime irreducible factors each of degree at least 2, and the open step needs divisors n > 2L above the window, carrying a branch-dependent weight of total mass 4^omega, for the product of three LINEAR factors C(C-2)(C+2). Two gaps each independently fatal, plus a third that is AMBIGUOUS between two author-sourced statements and does not carry the verdict. One correction to lit-smooth-divisors.md is earned: the precision register of the owning convention is not uniformly (log y)^{o(1)} or order-of-magnitude, since (1.1) is an asymptotic with relative error O(1/log x), which is the right register and one epsilon short of the o(1/ln y) the open step needs. Step 1 of Var/E does NOT become conditional on a citation, and no absence may be written, since the chapter's interior lemmas were not read. | 9 | [lit-scourfield-2008.md](history/staging/lit-scourfield-2008.md) |\n| `Q-lit-siebert` | ANSWERED | Is Siebert's 1983 result stated for general sieve dimension kappa, or for kappa = 1 only, and does it therefore already contain the kappa = 2 extremal example that SEARCH-CONVENTIONS section 3 records as not found? | kappa = 1 ONLY, on three independent statements of the theorem (the chapter's own publisher abstract, Granville 2020 section 1, Friedlander-Iwaniec 2022 page 20), all naming the LINEAR sieve and the Jurkat-Richert f and F; the chapter's full text was NOT reached, so this is testimony not primary reading, and the SEARCH-CONVENTIONS section 3 \"no published kappa = 2 extremal example\" row needs no correction. | 0 | [lit-siebert-1983.md](history/staging/lit-siebert-1983.md) |\n| `Q-lit-wu2004` | ANSWERED | What is H_theta(2) in Wu 2004, and what does the source say about theta approaching 1? | The source does not answer it: Wu never parameterises H by a level of distribution at all, so the theta to 1 reading is not in the paper; three defects follow in what attack-lichtman-decomp.md quotes, one of them a wrong inference built on a wrong table row, and the only proven cap is H <= 1. | none | [lit-wu2004.md](history/staging/lit-wu2004.md) |\n| `Q-localized-gap` | CLOSED | Does the Localized Merge Lemma close a chain from the localized twin-slot gap to a bound on the maximal gap? | The chain does not close, and it fails on a one-line averaging argument rather than on any sieve question; what survives is the growth law of maxsum_m and the boundary question, closed at (a)/(b) = (a)/(c) = 1.0000 at every x and every m <= 1024. | none | [LOCALIZED-GAP.md](LOCALIZED-GAP.md) |\n| `Q-lp-push-x43` | ANSWERED | Does the level-D LP's DP1 > DP3 inversion survive being pushed to x = 43? | Yes, and the correction strengthens it: the two statistics still climbing at x = 23 stop climbing, the pooled floor moves UP from 3.1945 (16 readings) to 3.3152 (33 readings), DP1 reads 2.32 of the 3.2665 against DP2+DP3's 0.95, and every one of the 33 pooled readings clears the (1 + beta_2)/2 = 2.6332 the inversion needs, the tightest at 2.6692. | none | [lp-push-x43.md](history/staging/lp-push-x43.md) |\n| `Q-maier-matrix` | CLOSED | Can the Maier matrix transfer exact residue-level knowledge about twin slots into an interval statement, and if not, where does it stop? | It stops at a scale collision: at q = x# the matrix is the identity 0 = 0, at q = y# with y < x the transfer identity is PROVEN and VERIFIED 20 of 20 but is a first-moment identity only, almost-all would need the second moment which is the localized twin-gap problem itself, and Granville-Soundararajan Corollary 1.4 is vacuous at every computable scale. | none | [maier-matrix.md](maier-matrix.md) |\n| `Q-maxgap-law` | ANSWERED | Does maxgap ~ c*mbar*lnD survive far enough to contradict Maier-Pomerance, and why did two agents measure two constants? | It does not, and not because the law breaks late: it was never an extreme-value law but a curve through a two-dimensional surface, and the two agents sat on different curves without recording which; on the diagonal c really is flat over a lever 46 times long with an estimator demonstrably able to see Maier-Pomerance growth, and one repo projection is REFUTED by the audit. | none | [maxgap-law.md](maxgap-law.md) |\n| `Q-maximal-law-tpc` | ANSWERED | Is the SIEVE Gaussian maximal law TPC-implying? | YES in the only form that would deliver anything: stated for the operative remainder R_H, need/z^2 runs 0.49 to 0.61, flat and below the zone budget at every z from 13 to 43, which is the Gap Reformulation, hence the Zone Postulate, hence TPC, so no soft argument can prove it; the published above-2 theta column is not the maximal law's verdict but the law plus two lossy steps. | 0 | [phase1-T4-maximal-law.md](history/staging/phase1-T4-maximal-law.md) |\n| `Q-maxsum-growth-law` | CLOSED | What is the growth law of maxsum_m, and is there a constant C that closes the localized chain? | The chain has no chance, and for a reason cheaper than the sieve wall: the gate grows like ln x per fold while the bound it must stay under grows by at least 2.4 ln^2 x, a deficit that is unconditional in C and in the sifting parameter, and the Deficit Lemma kills the weaken-the-gate repair because the gate feeds back. | none | [localized-04-maxsum.md](localized-04-maxsum.md) |\n| `Q-maxvr-uniform` | CLOSED | Is there a level-uniform bound on max VR, and what would an all-x form need? | No level-uniform bound: all three candidate bounds are killed by the numbers, and the all-x form needs a second ingredient the Status sentence does not name, an analytic lower bound on Sbar, the count of n with both n and n+2 free of prime factors in (x, sqrt(N)]; a max VR bound is in any case not TPC-strength, and no REFUTED.md row covers the route. | none | [attack-maxvr-uniform.md](history/staging/attack-maxvr-uniform.md) |\n| `Q-measure-0904-argmax` | PARTIAL | Where inside the tile is G2(x#) attained, with what multiplicity, and how thick is the near-maximal tail? | The multiplicity half was NOT open, and is reproduced here rather than found: exact-g2-ladder.js, measure-g2z2-0829.js and ATTACKS3.md already carry it at every level to x = 43, so object-g2-read-0829.md:1000's \"unknown\" is wrong. What is new, MEASURED exhaustively over the whole period at x = 11..37 by a third independent engine: the argmax set is tau-invariant with no fixed-point hit at all eight levels and carries ZERO congruence pairs from x = 23 up (refuting this note's own F7 at four scored levels), while 58 to 82 percent of the near-maximal windows ARE exact congruence translates of another by a multiple of W/p, at 10^6 to 10^8 times the uniform null; at x = 37 the maximum is 2 positions of 7,420,738,134,810 and only 6 gaps of 217,929,355,875 sit within 10 percent of it; four of eight pre-registered forecasts failed (F3, F5, F6, F7) and two falsifiers fired (F5, F7), and the exponent is untouched. | none | [measure-0904-argmax.md](history/staging/measure-0904-argmax.md) |\n| `Q-measure-g2-generic` | ANSWERED | Where does G2(x#) sit in the distribution of the same maximum gap taken over other two-class configurations with the same census, and is the constant-shift family generic inside the free-pair family? | G2 is GENERIC in this coordinate on the registered rule, MEASURED: the midrank percentile of G2 in the census-matched two-class ensemble reads 20.00, 18.06, 26.35, 17.14 exhaustively at x = 11..19 and 13.70 sampled at x = 23, all inside the registered [5, 95] band so the falsifier does not fire, while sitting about one ensemble sd below the mean at all five levels; and the free-pair and constant-shift ensembles are PROVEN identical up to translation, so killer 1 gains no target in the class positions at these levels. | 0 | [measure-g2-generic-0829.md](history/staging/measure-g2-generic-0829.md) |\n| `Q-measure-g2z2` | ANSWERED | What is G2(x#)/Z2(x) at every level where both exist, where does the tile's least attaining position sit, and how often does a zone hold exactly two pairs? | MEASURED at 22 levels: G2/Z2 rises 1.00 to 8.1429 with its maximum 8.3214 at x = 71, is lossless only at x <= 7, and no gap of length G2 lies inside the zone for x = 11..79 (PROVEN there from Z2 < G2 plus the Zone Restriction Lemma); R0's tight case k = 2 occurs at 0 of 27,291 zones above the degenerate first one; the fourteen custody ratios reproduce digit for digit and Z2 = env at 27,292 of 27,292 zones; the pre-registration scored three of five with one pre-registered theorem refuted (the Poisson miss is 1.518e-1 over p >= 3, corrected from a mislabelled 4.177e-1); no upper bound on G2/Z2 is claimed or in evidence. | none | [measure-g2z2-0829.md](history/staging/measure-g2z2-0829.md) |\n| `Q-minus-half` | ANSWERED | Is the -1/2 anticorrelation constant of the abutting-window covariance exact, or only equidistribution-conditional? | For the flat spectral functional the -1/2 is EXACT, a two-line consequence of the mod-30 difference set, verified to relerr <= 1e-15 on the full spectrum at x = 7 and 11; the whole equidistribution question compresses exactly into two residue-class correlation sums, and the residual all-x statement reduces to G30_agg(x) < 1/2. | none | [natal-cap-26-minus-half.md](natal-cap-26-minus-half.md) |\n| `Q-mismatch-adjudication` | ANSWERED | What is the true value behind each of readings-traceability's 56 mismatches, and where does each repair land? | All 56 adjudicated with old and new recorded: 33 READING-FIXED, 5 OUTPUT-FIXED-REBOUND, 2 awaiting re-embed, 5 DOC-FIXED, 4 UNTRACED-MARKED and 7 HOLDS-AS-IS; nine were repaired by making a script produce a figure it had only described, and three of those reproductions turned up a second defect. | none | [mismatch-adjudication.md](history/staging/mismatch-adjudication.md) |\n| `Q-mobius-bv-derivation` | ANSWERED | Is there a published theorem statement of Bombieri-Vinogradov for the Mobius function at level T^(1/2)/log^B T with a maximum over coprime classes, and if not, does that estimate follow from published theorems by a derivation whose every hypothesis is checked? | No published theorem statement was located in five channels searched in the owning convention named in research/SEARCH-CONVENTIONS.md; the closest is Granville-Shao's published assertion that the result is known, which carries no proof locator for the Mobius case. The estimate is derived here from four numbered results of Koukoulopoulos, GSM 203 (Corollary 13.4, Theorem 26.2, Theorem 26.6, equation (26.3)) plus Vaughan's identity for mu, with B(A)=A+6 and an ineffective constant. This is a derivation from published theorems, not a refereed theorem, and it is read from the author's preliminary version of that book. | C | [mobius-bv-derivation.md](mobius-bv-derivation.md) |\n| `Q-mod30-tail` | ANSWERED | Are the BV survey's S1 (mod-30 tail) and S2 (fixed truncation and depth) provable as stated? | Both PROVEN at short-note grade (no second reader) once S2's freshness factor is corrected to one class per prime, which needs only P^-(m) >= q > q_i and so holds at every scour prime, not only in the prime regime; tail constant 2 ln 2 -> (ln 2)/2; nothing in the head. | 11 (retired) | [thm-mod30-tail.md](history/staging/thm-mod30-tail.md) |\n| `Q-monotonicity-sweep` | ANSWERED | Does anything in the corpus assume certificate validity is monotone in L? | One unsound artifact and one invalid inference: attack-beta2-04-loss-budget.js section 6 bisects on a predicate measured not upward-closed and is wrong at 3 of 5 levels, true first-crossings 30/72/132/174/210 against the reported 36/72/144/174/354, and redteam-DP1-certificate.js draws a global minimality conclusion from a two-point local check; corrected, worst-casing certifies within 1.00 to 2.00 of true G2 and the exponent penalty runs 0 to 0.27 and falls with x. | 3 (retired) | [monotonicity-sweep.md](history/staging/monotonicity-sweep.md) |\n| `Q-moving-cutoff-parity` | ANSWERED | Does a proof-level reading of the shifted-Mobius sieve give a valid, explicit error-tolerant arithmetic target, and does its divisor switching preserve the moving boundary? | CHECKED prior art: Murty--Vatwani already supplies the conditional squarefree/parity mechanism and fixed-residue reduction. Its printed p. 654 swap omits n+h>ey; an exact finite counterexample verifies failure of that equality. DERIVED dyadic repair keeps the boundary and gives S=C2*x-2*C2*M+D_y+O_A(x/log^A x). A one-sided D_y>=-4*x/25+o(x) on unbounded dyadic scales is sufficient, using the certified margin C2*(1-A2)>33/200. That discrepancy estimate remains OPEN. Vatwani's recovered author preprint clarifies the one-odd-exponent cases and unfilled near-level-one hypotheses. No new signed bound is obtained; literature novelty is unestablished. | C | [moving-cutoff-parity.md](moving-cutoff-parity.md) |\n| `Q-mp-derivation` | ANSWERED | Can the fold-factor field M_p be derived rather than merely measured? | Its comb structure derives: M_p is about k*W1(theta_p)*exp(-delta*theta_p/mbar_p) with W1 the exact endpoint comb at zero parameters, blind-validated at a second fresh anchor; (k, delta) remain fitted, so this is a zero-parameter derivation of the field's comb structure and not of M_p, and nothing here proves H-double-prime or touches the exponent. | none | [mp-derivation.md](history/staging/mp-derivation.md) |\n| `Q-mp-window-prereg` | OPEN | Do the M_p FORMULA bands hold at a second fresh anchor? | Pre-registration only, sealed and committed alone before the measuring producer exists: the window, the population, the zero-new-parameter formula, all 37 band pairs, three scoring criteria and the consequences are fixed here, pinned to the v1 producer's embed fingerprint; nothing is measured. | none | [mp-window-prereg.md](history/staging/mp-window-prereg.md) |\n| `Q-multiplicity3` | CLOSED | Does the m >= 3 multiplicity instrument buy anything for the anchored deficit? | Closed as an instrument: at @17 the m >= 3 statistic sees the anchored deficit worse than the pair statistic it was to replace (anchored z -0.23 against -2.71 for the overlap credit X), the Bonferroni depth ladder buys one place and dies, and multiplicity 3 in moment order buys a factor 1.3 that does not reach the anchor. | none | [attack-multiplicity3.md](history/staging/attack-multiplicity3.md) |\n| `Q-natal-cap-campaign` | ANSWERED | What is the mathematical upper limit on the number of Natal@5 slots a prime q can remove from an X-tile as the Scour drags across it? | Per-prime removal is boxed by four instruments (max overshoot +7.7% over the fair share 2N/q, worst conceivable dilation +0.7% at @17 over 92,160 tuples, certified Selberg caps 1.13-2.5x truth, and a proven prime-counting cap for q > W^(1/3)), but no per-prime cap, even an oracle, closes the first-order union bound for x >= 13 because Sum 2/q crosses 1 between @11 and @13. | none | [NATAL-CAP-CAMPAIGN.md](NATAL-CAP-CAMPAIGN.md) |\n| `Q-natal-cap-overlap-sign` | CLOSED | Is the sub-CRT overlap bound S2 <= sum of 4N/(q q') provable, per pair or in aggregate? | REFUTED as an inequality at every granularity, with 40 to 53 percent of pairs sitting above CRT at x = 11 through 23 and named exhibits at each level; what survives is proven structure, an exact per-pair-computable aggregate deficit, with the remainder a sign-alternating discrepancy at noise scale. | none | [natal-cap-12-overlap-sign.md](natal-cap-12-overlap-sign.md) |\n| `Q-natal-cap-sieve-cap` | ANSWERED | What is the rigorous sieve upper bound on how much a single scour prime can remove, and does it certify the zone? | Certified Selberg and Bonferroni caps run 1.60 to 2.36 times N over x = 7..17 with the fluctuation factor at 1.000, gross(q) hugging 2N/q to three decimals, but from x = 13 the harmonic factor alone exceeds 1, so Sum gross > N and even exact-truth caps fail. | none | [natal-cap-10-sieve-cap.md](natal-cap-10-sieve-cap.md) |\n| `Q-natal-discrepancy-lemma` | PARTIAL | Can the rotation ensemble's class discrepancy be controlled strongly enough to feed Freedman's inequality? | Lemmas 1 to 4 and Theorem 5 are stated and machine-checked (1,954 assertions, zero failures) and Proposition 6's stopped Markov-union-Freedman chain is rigorous, but none of it touches the anchored problem: the anchored path's per-step conditional variances are ensemble-typical (mean ratio 0.93 to 0.99), so the anchored side remains 100 per cent drift against the Mertens/2C2 wall. | none | [natal-cap-14-discrepancy-lemma.md](natal-cap-14-discrepancy-lemma.md) |\n| `Q-natal-onset` | ANSWERED | Does Chris's q^2 destruction-onset staircase hold, and does the onset lens open a mechanism at x = 37? | The staircase is VERIFIED over 1..10000 after aborting-on-mismatch against his three hand anchors, the three onsets collapse to two and the naive 50:50 A/B split is refuted by derivation; the x = 37 fourth lens is a clean negative and the fourth mechanism family closes. | none | [natal-onset-01.md](history/staging/natal-onset-01.md) |\n| `Q-next-correlation-source-map` | ANSWERED | Is there a primary-source statement with stronger scale or coefficient quantifiers than the ones the prime-band transfer actually consumed? | Scoped negative for the inspected statements: function-class and rate mismatches remain. The coordinating review withdraws the all-scales/dyadic-omitting requirement as a necessary gate, since bounded-interval stability yields a weak dyadic scale average from the existing input. No sufficient rate or full-coefficient theorem is matched. Proper-prime-power terms are already negligible on the fixed corner; other prime-r cofactor branches remain open. | C | [next-correlation-source-map.md](next-correlation-source-map.md) |\n| `Q-next-transfer-review` | ANSWERED | Does prime-band-transfer.md (1)-(6) follow at exactly its stated scope, and does any step fail against an adversarial reading of its hypotheses? | The derivation (1)-(6) survives at its stated continuous-average scope. The coordinating round review corrects check l: interval stability additionally gives a dyadic scale average, with a further exponent loss. There is no every-dyadic estimate, o(N), full-corner control or twin margin. Proper-prime-power branches have a separate negligible fixed-corner bound. | C | [next-transfer-review.md](next-transfer-review.md) |\n| `Q-novelty-postaudit` | ANSWERED | Of the ten results never covered by the 2026-08-13 prior-art audit, which are novel? | None survives as fully novel: two are outright prior art (one published thirteen years earlier with its headline claim contradicted by the source's own table), one is a two-line classical theorem mis-calibrated as a measurement, five are restatements or special cases of standard objects, and one names a lemma that does not exist. | none | [audit-novelty-postaudit.md](history/staging/audit-novelty-postaudit.md) |\n| `Q-np-licenses` | ANSWERED | What does NP-completeness license here, and is Brady's Problem 3 the G2 covering problem? | The corpus sentence \"his Problem 3 IS the G2 covering problem\" is false as written and must be withdrawn (one class per prime and an arbitrary finite set, against two classes at locked separation 2 on an interval); NP-completeness licenses four statements about computation and none of the five mathematical ones. | none | [attack-np-licenses.md](history/staging/attack-np-licenses.md) |\n| `Q-null-limsup` | MIXED (null-limsup-prereg.md: OPEN; null-limsup.md: ANSWERED) | Does the thinning null's maximal gap disagree with Neudecker's limsup law, which would retire the extinction half? | The trigger does not fire: the closed form is the exact law, the reduction returns Hawkins' own constant, and the real fold's record gap lands within 2 sigma of the null, so the extinction half survives and the null now supports the ceiling argument rather than threatening it; the limsup itself is not measurable and cannot be. | none | [null-limsup-prereg.md](history/staging/null-limsup-prereg.md), [null-limsup.md](history/staging/null-limsup.md) |\n| `Q-object-bridge-read` | PARTIAL | What sits between Z2(p) and G2(x#), which inequalities between them are proven and in which direction, and is the information the Gap Reformulation discards provably needed? | Map only, nothing computed: the reduction discards the origin to buy rotation invariance at a loss measured at G2/Z2 = 4.12 by p = 43, and the discarded information is PROVABLY not needed for the implication (a rotation-invariant statement, G2 < x'^2 - 2, does reach the zone statement), MEASURED to be worth about one unit of exponent against a deficit of 2.2665, and OPEN as to whether any proof needs it, with no separation theorem on record on either side. | none | [object-bridge-read-0829.md](history/staging/object-bridge-read-0829.md) |\n| `Q-object-g2-read` | PARTIAL | What is actually known about G2, at what calibration, where do the corpus's documents disagree about it, and which questions about it have not been asked? | The band is unchanged: exponent 4.26645 proven above, 2 needed, and the reading found no document that moves it; what this note adds is a variant table, a legal open set for section 4, seven drift items including one live target that is TPC-strength and unlabelled, and eight unasked understanding questions. | none | [object-g2-read-0829.md](history/staging/object-g2-read-0829.md) |\n| `Q-object-models-read` | PARTIAL | For G2(x#) and Z2(p), what does each null model in the corpus predict, which measured deviations from those models are real, and does any of them carry interval-level (wall-relevant) information? | Nothing found that carries interval-level information: seven of the nine real deviations are residue-level by the THE-LENS section 5 rule, Kourbatov's b is interval-level in form but blocked by a log-sparse quantifier and unexplained as a mechanism in both corpora, and the sub-Poisson rough-pair dispersion is classified interval-level in form and elementary in content (division with remainder, not placement) by the independent-thinning null that ran 2026-08-29 (measure-roughpair-null-0829.md), which also weakened the sub-Poisson reading since that null's own chi-squared per degree of freedom is 1 minus p rather than 1. | none | [object-models-read-0829.md](history/staging/object-models-read-0829.md) |\n| `Q-observations` | PARTIAL | Which sightings from the bench survive being stated precisely enough to check, and at what rung? | A running log, each entry carrying its own rung: the mirror-centre and divisor-landmark items stand as VERIFIED, the closed form for the half word is REFUTED as a route (max of the half equals max of the whole at every level), and the compounding window is PROVEN to close only to U = 30. | none | [OBSERVATIONS.md](OBSERVATIONS.md) |\n| `Q-obstruction-audit` | ANSWERED | Is the wall named parity the right name for what blocks G2(x#) < x'^2 - 2? | Read at source, the audit's central reason does not survive: Tao's forbidden is defined extensionally rather than intensionally, so the primality-detection step in the reduction does not put the method class outside the obstruction, and where the wall sits on our own reduction moves accordingly; the proposed text for paper/wall-note.md is left unapplied. | none | [attack-obstruction-audit.md](history/staging/attack-obstruction-audit.md), [lit-tao-parity.md](history/staging/lit-tao-parity.md) |\n| `Q-oeis-G2-submission` | CLOSED | Should the twin Jacobsthal function G2 be submitted to OEIS as a new sequence? | DO NOT SUBMIT: it duplicates A144311 (Carter, September 2008), which is G2 - 1 on the same fixed classes with no free translate and carries 22 terms to our fourteen, all fourteen agreeing; five waves missed it because every search was run on G2 and never on G2 - 1. | none | [oeis-G2-submission.md](oeis-G2-submission.md) |\n| `Q-oeis-g2-absence` | ANSWERED | Is the G2 ladder absent from OEIS at fourteen terms? | Falsified: the ladder has been in OEIS since 2008 in the run-length convention G2 - 1, as A144311 carrying 22 terms to our 14, with the search channel calibrated live in the same session on two known-positive probes. | none | [audit-oeis-14term.md](history/staging/audit-oeis-14term.md) |\n| `Q-oeis-seam-submission` | PARTIAL | Is the seam twin-pair count sequence absent from OEIS, and is the draft ready to submit? | Status DRAFT: the exact-terms absence survives on both range conventions and the 20 terms are cross-checked by two independent Miller-Rabin implementations, but qc-wave6-X section B3 found a concept neighbour, A367739, that the draft's crossrefs do not mention. | none | [oeis-seam-submission.md](oeis-seam-submission.md) |\n| `Q-ojaroudi-read` | ANSWERED | Does Ojaroudi's Zenodo preprint prove an unconditional twin-prime theorem, and is anything in it importable? | No: the fatal step imports a Selberg quadratic-form LOWER bound from Opera de Cribro Chapter 7 where none exists, and a second independent gap leaves the Kloosterman hypothesis never checked; the venue is an unrefereed self-deposit, and the only payoff is two elementary lemmas that are importable onto our tile. | none | [ojaroudi-read.md](history/staging/ojaroudi-read.md) |\n| `Q-omega-floor-blind-0830` | ANSWERED | Does the local log-slope of the pointwise floor Omega(z) of attack-0830-rec-cheapest.md (exact to z = 73, certified 2+4-chain family to z = 5e5), extended blind to new levels under a sealed forecast, behave as the DERIVED growth law Omega >> z^{16s/9}/ln^8 z predicts at s = 2.698721, and at what z would the test be decisive? | MEASURED, blind, on the derived law only: 18 of 22 sealed rows HIT; the certified 2+4-chain family at p* = (47, 43) runs 5e5 -> 1e9 (A1A2 = 8.863e17 -> 9.351e32, exact integers) with its step slope falling 4.85 -> 4.38 through every sealed band onto the law's log-corrected slope, the decisive decade 1e8 -> 1e9 reading 4.410 against 16s/9 - 8/ln z = 4.389 (HIT, kill rule not triggered at 4.452 +/- 0.011); the 4 MISSes are the ratio to z^{16s/9}/ln^8 z sitting at 2.00-2.14 above the sealed cap of 2 at z >= 1e8, the pre-declared non-adverse direction; the exact floor is extended 73 -> 113 (251 -> 1980, equal to the hill-climb floors at 89 and 101), where the law predicts nothing; no exponent moves and the law stays DERIVED and HELD. | 0 | [blind-0830-omega-floor.md](history/staging/blind-0830-omega-floor.md) |\n| `Q-operator-pair-count` | ANSWERED | Can the histogram transfer operator and the pair count be evaluated exactly at any level with no tile in memory? | Both instruments are exact and neither needs a tile resident: the operator is PROVEN and VERIFIED exactly at six folds and the pair count at every fold; the tail carries a FIT beside them that must not be used past the range it was fitted on. | none | [operator-and-pair-count.md](operator-and-pair-count.md) |\n| `Q-origin-excess` | ANSWERED | Can the Origin Excess Lemma be pushed to S = x'^2, and is the scale collision genuine or an artifact of that one argument? | It cannot, and the collision is genuine: the origin's excess is exactly a ratio of two values of the survival curve rho at the same window and two sieving levels, and the Zone Postulate asks for that ratio at u = 2, where rho takes its minimum, so no better lemma moves the boundary; three candidate mechanisms fail, each for a different reason, one of them working against us. | none | [origin-excess.md](origin-excess.md) |\n| `Q-packing-two-class-priorart` | PARTIAL | Does the two-class (twin) analogue of the Hensley-Richards packing function exist in print? | Not found, on an uncalibrated search in our own wording with no owning convention recorded, so this is the reach of the search rather than an absence; the classical one-class theory is well developed, and against A008407 the two-class ladder is bounded below by the minimal admissible 2k-tuple diameter. | none | [natal-cap-04-packing-notes.md](natal-cap-04-packing-notes.md) |\n| `Q-paired-factor-budget` | ANSWERED | Does averaging the proposed two-small-prime loss and three-small-prime gain using existing distribution theorems make their net contribution sufficient for the current twin consumer? | DERIVED from the matched classical inputs, with finite rational enclosures VERIFIED: the explicit positive family has liminf P3/(C2*x)>1, but liminf (N2-P3)/(C2*x)>11/10. Keeping only these families and the main term therefore fails at the current cutoffs. Pan--Ding supplies aggregate level x^(9/20), stronger than the earlier per-cofactor application; the complete signed margin remains OPEN. The aggregation machinery is prior art and literature novelty of this application is unestablished. | C | [paired-factor-budget.md](paired-factor-budget.md) |\n| `Q-paper-iii-restructure` | ANSWERED | Is Paper III restructured around the proven model theorem? | Yes. paper/variance-note.md now carries four new sections in place of its fit narrative: sec.8 the proven spectral form (Var/E = delta X, delta ln^2 W -> 16 C_2 e^{-2gamma}/3 = 1.109905, the Montgomery-Soundararajan main term exactly L prime by prime, so all of Var/E is discrepancy), sec.9 the decoupled model with Theorems 7 and 8 and Lemmas 9-11 written out with proofs and the closed form lambda_2(2) = 1 - e^{-2gamma}(9/2 - 4 ln 2) = 0.45546 plus the theta = 1 identity with Gorodetsky, sec.10 Conjecture 1 (delta(X - X_dec) -> 0) with eight exact ratios, two of three lag groups closed and the third named as a divisor-distribution statement not yet searched, and sec.11 the 0.611 refutation as a short calibration paragraph; sections 1-5 are untouched, the abstract and section 6's open question are rewritten to match, and the \"u = 2 exactly\" defect in section 7 is corrected. | 9 | [paper-iii-restructure.md](history/staging/paper-iii-restructure.md) |\n| `Q-paper-kk-draft` | ANSWERED | Is the K–K two-class lower bound written up as a refereeable draft? | Yes. paper/kk-lower-bound.md, self-contained at INFERRED grade, carrying Theorem B (the substitution), Theorem A (the published-ingredient x ln x chain) and Proposition 2 (the free G2 >= g transfer), with every constant, every consumed hypothesis, the y0 = 10^134.1 floor, the three residuals, and a per-number provenance appendix; nothing in it is new mathematics and nothing in it is refereed. | none | [paper-kk-draft.md](history/staging/paper-kk-draft.md) |\n| `Q-parity-adversary` | ANSWERED | Does a parity adversary built on our own stretches survive at every level, and what precision class does a certificate need? | It does NOT survive: the exact-data adversary dies at D* about Q^1.18 (MEASURED, exact arithmetic, 43 anchors Q <= 200), and the certificate that kills it is itself destroyed by 0.30 of one count per modulus, so Z2's precision class is now measured rather than described; it is PROVEN not to be a proof ingredient. | Z2 | [attack-parity-adversary.md](history/staging/attack-parity-adversary.md) |\n| `Q-parity-dstar-law-0829n` | CLOSED | Does the exact-data parity adversary's killing level D*(Q) follow D* ~ Q^c with a stable c on the decades past Q = 200, and is c distinguishable from the independent-thinning null's? | No law in Q and CLOSED by the sealed kill rule (score 5 HIT, 1 MISS): MEASURED on 271 anchors 211 <= Q <= 13679, the Q-slope moves 1.446 to 1.204 to 0.575 across ranges while ln D* on ln width holds slope 1.097 +- 0.012 with a quarter of the scatter, D*/width about 0.5, and the independent-thinning null reproduces the width law within 0.025 in slope; the mechanism is that D* is where a modulus first reads a single position of the window, which is the wall survey's remainder statement in the stretch coordinate and names nothing new. | Z2 | [attack-0829n-parity-dstar.md](history/staging/attack-0829n-parity-dstar.md) |\n| `Q-perfold-error-model` | ANSWERED | What is the per-fold error model behind the extinction law's +/-3 sqrt(lambda) failure at 43.2 per cent? | X_p ~ Poisson(lambda_model(p, Y) M_p) with M_p a deterministic factor of the fold, the same number at every window length from 2e7 to 2e11 and at every anchor, MEASURED and not derived, and it holds on a sealed blind test at a fresh anchor. | none | [perfold-error-model.md](history/staging/perfold-error-model.md) |\n| `Q-perfold-window` | OPEN | Does the negative-binomial per-fold error model's band hold at a fresh blind anchor, after the extinction law's +/-3 sqrt(lambda) clause failed at the fifth window? | Pre-registration only, committed alone before the producer existed: the population is fixed in advance at the 37 folds p >= 100 with predictive mean or lambda_model at least 1, and the bands are printed verbatim from the model's embedded Stage 4; nothing here is measured. | none | [perfold-window-prereg.md](history/staging/perfold-window-prereg.md) |\n| `Q-phase1-W1b` | ANSWERED | Which unapplied wave-6 findings on the research notes were still live, and what did applying them change? | Most of wave 6 was already applied, so the yield is the residue plus one code defect nobody had fixed: a3-05-bound-L.js's truncated cyclic replay was printing a FALSE PASS on kappa(m) <= L+2 at fold 7, and fixing it kills a claim; the gate reads 0 findings across all seven checks at hand-back. | none | [phase1-W1b-applied.md](history/staging/phase1-W1b-applied.md) |\n| `Q-polylog-fold-transfer` | ANSWERED | Can the fixed-fold calculation be made uniform at growing depth, and transferred to the actual bilinear remainder with an adequate error? | The local bilinear model is O_H(x/log^H x) uniformly for polylogarithmic squarefree moduli. Its absolute reconstruction error is at least (1/2+o(1))*x. The needed signed reconstruction bound remains OPEN, so this model does not establish the twin-prime lower bound. | C | [polylog-fold-transfer.md](polylog-fold-transfer.md) |\n| `Q-prime-band-completion` | ANSWERED | Can the remaining squarefree correlation be localized to simpler prime and harmonic bands, and does completion then permit a direct general bilinear Kloosterman estimate? | The pilot reduces, with power-saving endpoint errors, to p in (x^0.235,x^0.24], q in (x^0.045,x^0.05] and positive h in (x^0.029,T], with T=O(x^0.0342). Both primes exceed 2h eventually. Completion is exact but produces coupled h-dependent coefficients on every dual residue modulo q. Its full-frequency Kloosterman matrix has norm exactly q, so a uniform power saving by an arbitrary-coefficient operator bound is impossible at that scope. This completion alone leaves the 61/20000 budget deficit; prime-dispersion.md controls the pilot using a different second moment. No twin lower bound is established. | C | [prime-band-completion.md](prime-band-completion.md) |\n| `Q-prime-band-transfer` | PARTIAL | Can the nonmultiplicative prime-band weight be represented by bounded multiplicative functions, and what does an available quantitative correlation theorem actually give after all scale and normalization costs? | A smooth Fourier superposition represents mu(n)L_B(n)/log X exactly on n<=2X+2. The quantitative non-pretentious input and a mesh give a continuous scale-average saving for the exact s=s'=1 windows. The round review additionally derives a dyadic scale-average saving by bounded-interval stability, with exponent c_*/2. Neither estimate gives an every-dyadic bound, o(N), full-corner control or a twin margin. The extension in cofactor-progression-transfer.md now estimates a growing polylogarithmic cofactor family; the full remainder remains open. Proper-prime-power branches have the separate bound in corner-correlation §1.1. | C | [prime-band-transfer.md](prime-band-transfer.md) |\n| `Q-prime-detection-inputs` | ANSWERED | Can we give a locally correct positive comparison sequence, justify the ordinary arithmetic inputs, and prove exactly what one additional estimate would buy? | Yes: the comparison sequence and Type I estimates are derived, and a classical Vaughan decomposition gives S(x)=C2*x+B(x)+O_H(x/log^H x) for every fixed H. A fixed one-sided saving over B>=-C2*x+o(x) implies twins on unbounded scales. This is a fully specified classical reduction, not a new cancellation estimate or proof mechanism. | C | [prime-detection-spec.md](prime-detection-spec.md) |\n| `Q-prime-dispersion` | ANSWERED | Can a second moment retaining two right primes control the remaining localized squarefree pilot after its actual conductor and coefficient costs are included? | Yes at this rectangle: aggregation in m=dp before Cauchy gives a logarithmically bounded coefficient on a long interval. The only zero-phase pairs are identical (q,h). Distinct primes give modulus e*q1*q2 with gcd loss at most O(A*Z); completion and Weil bound all off-diagonal terms. The diagonal has exponent 1989/2000 and the largest off-diagonal exponent is 1173/1250 before an arbitrarily small loss. The remaining high-frequency polynomial is O(x^(199/200)); consuming the previous reductions gives R_IJ=O_H(x/log^H x) at D=x^0.277, E=x^0.467. This is a full rectangle at product scale x^0.744, not a uniform product cutoff or a twin lower bound. | C | [prime-dispersion.md](prime-dispersion.md) |\n| `Q-prime-power-dispersion` | ANSWERED | Does the repeated-prime structure control the BB contribution beyond its two-norm bound, and can a prime-power moment include every harmonic uniformly? | The decomposition leaves an exceptional coefficient with norm at most sqrt(D) times logarithms; its odd prime-power core has a derived all-harmonic dispersion bound. The same bound for first powers removes the former left-prime cutoff and unpaired diagonal constraint. Two strict inequalities control a region including d~x^0.247, e~x^0.612 at product scale x^0.859. Their product-exponent supremum is 5757/6700, not a uniform product cutoff or a twin lower bound. Exact finite checks run separately from this classical-input derivation. | C | [prime-power-dispersion.md](prime-power-dispersion.md) |\n| `Q-prior-art-audit` | PARTIAL | What in this programme is rediscovery, and what might be new? | Rediscovery, prolific and correct, spanning 170 years (Smith 1857 to Tafula 2015); three candidate novelties survived the 2026-08-13 audit and item 1 was cut back on 2026-08-18 by OEIS A144311 (Carter 2008), and several negatives were run in our own wording rather than the owning convention, which is worth little. The 2026-09-06 global smooth majorant uses an explicitly matched prior-art finite-difference mechanism; literature novelty of the complete application is unestablished. | none | [PRIOR-ART.md](PRIOR-ART.md) |\n| `Q-prior-art-last-ground` | ANSWERED | Is MathSciNet reachable, and does the two-class upper-bound absence survive a complete title enumeration? | MR Lookup answers author/title/journal/year queries free (bibliographic fields only, no review text or MSC), so SEARCH-CONVENTIONS section 5 needs correcting; the standing sentence survives, since the complete MathSciNet title record for Jacobsthal contains every published upper bound and every one is one class per prime, and Holt's 2022 book is in no bibliographic database. | none | [attack-prior-art-last-ground.md](history/staging/attack-prior-art-last-ground.md) |\n| `Q-proposals-prior-art` | ANSWERED | What is the prior-art risk for the six candidates in the paper-proposals registry? | None is clean: three are ADJACENT with the boundary drawn Holt-style (one of them breaking a sentence the corpus rests on), the thinning null is PRIOR ART FOUND under Hawkins' random sieve with the Fold Moment Identity NOT FOUND, and only the reverse-direction Suen import reads NOVEL-SO-FAR; every verdict names what was not searched. | none | [proposals-prior-art.md](history/staging/proposals-prior-art.md) |\n| `Q-qc-arch` | ANSWERED | Is the corpus's architecture, ordering and file layout readable by a fresh agent at minimum context cost? | Diagnosis only, no existing file edited: the restructure plan of section 2 was accepted over the shepherd's, and the leading verdict is to leave OBSERVATIONS.md exactly as it is, in place, unsplit and off the reading path, taking out only four inbound citations that name it as the home of something it does not own. | none | [qc-arch.md](history/staging/qc-arch.md) |\n| `Q-qc-campaign` | ANSWERED | What did the 2026-08-17 consistency campaign run, find, decide and apply? | The shepherd's ledger: Chris's duplication rule and splitting ruling recorded in his words, the qc framework and the provenance index delivered in wave 1, and every partition's results with the decisions that settled them, including two novelty verdicts flagged as publication-track changes. | none | [qc-CAMPAIGN.md](history/staging/qc-CAMPAIGN.md) |\n| `Q-qc-checks-9-10` | ANSWERED | What do the provenance and search-convention gate checks find, and why are they held out of the default gate? | Both are built, calibrated and in the selftest but deliberately behind --pending because they fire on live claims an attack agent is mid-flight against: provenance reads 8 findings and search-convention 75 on the 2026-08-18 corpus, the flip to default is one line, and what could not be mechanised is stated. | none | [qc-checks-9-10.md](history/staging/qc-checks-9-10.md) |\n| `Q-qc-compound` | ANSWERED | Which named claims are compounds whose parts carry different calibrations, and how should each be decomposed? | Twelve compounds decomposed and eight examined and left whole, with about 90 corpus sites needing rewording; the test each decomposition must pass is that Proven: becomes unwritable rather than merely wrong, and the sharpest finding is that natal-cap-28's fully analytic certificate law has no markdown home at all, which is why its status is unfindable. | none | [qc-compound.md](history/staging/qc-compound.md) |\n| `Q-qc-history-migration` | ANSWERED | Which body text is history and should move to CHANGELOG.md or history/? | The headline is a negative and it is the most useful thing in the report: no body file is a session record that should move wholesale, so what moves is per-section, and the pass leaves an ORPHANED-CLAIM list of live errors plus per-file findings over all 63 body files. | none | [qc-history.md](history/staging/qc-history.md) |\n| `Q-qc-numbers` | ANSWERED | Do two places in the corpus ever give the same number for the same object, and does each remote quotation carry the caveat its home document requires? | 16 findings organised by quantity, led by the rho disagreement between U-FRAME:646 and gate-multiplies:360; diagnosis only, no existing file touched, and arithmetic-per-number is audit-numbers.md's axis rather than this pass's. | none | [qc-numbers.md](history/staging/qc-numbers.md) |\n| `Q-qc-papers2` | ANSWERED | Do the paper suite's five doors and four faces restate their research homes correctly? | Fifteen findings in sections 7 and 7A plus a suite sweep: a door resting entirely on a column its own cited file disclaims as invalid, whose corrected computation reverses the reading; a degree-4 certificate credited with a result needing moments through order 6; and the same paper contradicting itself forty lines apart on the anchored calm. | none | [qc-papers2.md](history/staging/qc-papers2.md) |\n| `Q-qc-queue-9-10` | ANSWERED | Can the provenance and search-convention queues be cleared without suppressing anything? | TOTAL 84 to 0 with nothing suppressed and every finding resolved in the corpus: all six not in OEIS claims were FALSE, since the G2 ladder is A144311 + 1 and PRIOR-ART.md already recorded the find 270 lines further down; the honest remainder is that five of 75 were resolved by rewording a sentence that was never a literature claim. | none | [qc-queue-9-10-worked.md](history/staging/qc-queue-9-10-worked.md) |\n| `Q-qc-refs` | ANSWERED | Are the corpus's external citations and its quotations sound? | Nine dead quotations and eight wrong external citations, the worst being that the corpus sits on the retracted FKMPT constant, an OEIS crossref off by one twice in a document addressed to an OEIS editor, and a false premise (\"Kanold, Stevens and Paseman all give exponent 2 + eps\") under an open TODO item. | none | [qc-refs.md](history/staging/qc-refs.md) |\n| `Q-qc-scope-R` | ANSWERED | Where does the summary layer restate a result with the scope its home document attaches dropped? | Fifteen findings, 2 HIGH, 3 MEDIUM-HIGH, 4 MEDIUM, 6 LOW: one HIGH is a false statement in README.md Status introduced by this campaign's own wave 2, the other is both papers giving a false reason for the X-limitation theorem's scope, and the coverage statement at the end is short and matters. | none | [qc-scope-R.md](history/staging/qc-scope-R.md) |\n| `Q-qc-scope-T` | ANSWERED | Does the surface partition R left unswept carry the campaign's dominant defect, a scope dropped in restatement, or a false absence claim? | Fifteen ranked findings plus the TA, TB and TC blocks: a scoreboard still logging the rich vein as the campaign's one unexplained novelty after a same-day follow-up solved it, a fourth copy of the retired sifting limit, and a largest-single-event superlative refuted by the event log it is read from; adjudication only, nothing edited. | none | [qc-scope-T.md](history/staging/qc-scope-T.md) |\n| `Q-qc-scripts-S1` | ANSWERED | Do the 37 natal-cap scripts' READINGS blocks hold against their own output and against the documents citing them? | Twenty-six of 37 are consistent and eleven carry a defect, none of them contradicting the summary layer on a status claim: a false promise of a record with no READINGS block, a reading refuted by its own printed output, an absence claim at the site a whole wave read as absolute, and a Miller-Rabin bound wrong by nine orders (3.186e14 for 3.186e23) at three sites. | none | [qc-scripts-S1.md](history/staging/qc-scripts-S1.md) |\n| `Q-qc-scripts-S2` | ANSWERED | Do the fold-profile and attack script families say what their own outputs say? | Thirteen defects over 34 scripts and 5,673 lines, five of them HIGH: an untested identification two later scripts had already killed, a printed reading refuted by its own table, a section that has printed only its header since it was written, and a reproduction pointer to a scratchpad that is gone; script-side ones fixed, document-side ones left as evidence, gate 0 on all seven checks. | none | [qc-scripts-S2.md](history/staging/qc-scripts-S2.md) |\n| `Q-qc-scripts-S3` | ANSWERED | Do the 57 non-campaign research scripts' banners, embedded OUTPUT blocks and READINGS agree with each other and with the documents citing them? | Defects ranked by consequence, the leading one a3-02-diagonal-f.js carrying the refuted L scanner while naming as its source the sibling that had been repaired underneath it, the two state machines disagreeing at exactly one cell, L(T23, 29) = 3 against the true 2, now fixed; the partition ends with qc.js at 0 on all seven checks and audit-numbers.js 78/78. | none | [qc-scripts-S3.md](history/staging/qc-scripts-S3.md) |\n| `Q-qc-shepherd` | ANSWERED | What does the wave-1 shepherd find on the corpus's own structure? | The largest structural defect is that U-FRAME is organised by campaign rather than by claim, with five whole sections of process record sitting in working documents, a PROVEN lemma quoted without the hypothesis that makes it non-vacuous, and three documents disagreeing about how many hypotheses that lemma has; the claim-status register across named objects was not covered and is named as the highest-value remaining axis. | none | [qc-shepherd.md](history/staging/qc-shepherd.md) |\n| `Q-qc-slopes-K` | ANSWERED | Are the three fits at slopes 1.062, 1.451 and 1.2992 numerically inconsistent? | There is no numerical inconsistency: the seven tile points are seven of the 42 census points with f agreeing to printed precision, restricting the 42 to the seven's x reproduces 1.062 exactly, and the two estimates are statistically indistinguishable (seven-point 95 per cent interval [0.32, 1.81]); but the corpus's stated reason is wrong, the comb does not explain it, and the coefficient is range-dependent under every specification, so no single slope exists. | none | [qc-slopes-K.md](history/staging/qc-slopes-K.md) |\n| `Q-qc-status` | ANSWERED | Is any named object's claimed status inflated, contradicted or misattributed? | Thirteen findings, 12 with replacement text: the worst scope inflation is the Fused-Window Calm Lemma listed as proven when two of its four legs are not, and \"the matching lower bound\" claims a sharpness the corpus explicitly disclaims; on attribution the corpus is in better shape than the brief assumed. | none | [qc-status.md](history/staging/qc-status.md) |\n| `Q-qc-transfers-J` | ANSWERED | Are the thirteen transfers findings real defects or benign restatements? | Adjudicated by word diff with the diff pasted under each finding: 11 KEEP, 2 DEFECT, both in gate-multiplies.md and both one root cause, 0 false positives, and nothing needing compute or a human decision. | none | [qc-transfers-J.md](history/staging/qc-transfers-J.md) |\n| `Q-qc-wave6-U` | ANSWERED | Do ATTACKS.md and ATTACKS2.md say what the corpus above them says? | Fifteen findings on 57 lines, led by a campaign verdict awarding theorem-grade to a curve its own home marks MEASURED and Hardy-Littlewood-conditional, the rich vein still logged as an unexplained novelty, and the anchored-window programme called unexplored where a research note and a 34 kB paper exist; six of the fifteen turn on a frozen-record-versus-current-state decision nobody has made. | none | [qc-wave6-U.md](history/staging/qc-wave6-U.md) |\n| `Q-qc-wave6-V` | ANSWERED | Do the sixteen fold-profile scripts carry auditable evidence, and what do they show when run? | All sixteen were run and now carry a real OUTPUT block and a numbered READINGS block, each verified by re-running and diffing; eighteen findings follow, the highest being a lemma quoted as proven that is false as written in two documents while three scripts in this partition print the counter-example. | none | [qc-wave6-V.md](history/staging/qc-wave6-V.md) |\n| `Q-qc-wave6-W` | ANSWERED | Do the three expensive natal-cap artifacts reproduce? | All three re-run, after the complete @41 march log turned up on disk outside the repo in a place no wave had cited; a three-way tally per file, with the .md disagreements logged rather than edited and the coverage limits stated. | none | [qc-wave6-W.md](history/staging/qc-wave6-W.md) |\n| `Q-qc-wave6-Y` | ANSWERED | Do the eight run logs, the three committed .txt outputs and the leaf-note residue say what the corpus above them says? | Findings on all three surfaces, including a stated bound on sup\\|R\\|/(H*M) that the log's own full-period block violates by 5.6x, an S6 block produced by a function the repo has since flagged wrong while the log stays unflagged, and a false absence claim in G2-STATE that the same document refutes 162 lines later; line numbers were taken against a tree being modified concurrently. | none | [qc-wave6-Y.md](history/staging/qc-wave6-Y.md) |\n| `Q-qc-wave6-absence` | ANSWERED | Do the corpus's [ABSENT], [INFERRED] and [UNVERIFIED] markers survive a check against fetched primary sources? | First web-enabled pass, no repository file edited: the exact-terms OEIS absence for the seam count sequence survives on both range conventions but a concept neighbour, A367739, goes unmentioned in the draft's crossrefs, and the note closes with an explicit list of what it could not reach, led by the MathSciNet citation graph of Iwaniec 1978. | none | [qc-wave6-X.md](history/staging/qc-wave6-X.md) |\n| `Q-quadpoint-blind-31607-0830` | ANSWERED | Does the zero-parameter depth law y*(Q), stated on the set where T(Q) >= 1 and on both the 1/(2e^gamma) = 0.280730 and the u*omega(u) = 2 (1/u* = 0.280438) forms with and without the finite-size Mertens factor, survive a sealed blind test on the bands past Q = 10007, and can that decade tell the two asymptotes apart? | MEASURED, blind, and it decides nothing asymptotic: on 8363 new anchors 10009 <= Q <= 100003 the 76 sealed rows score 64 HIT and 12 MISS with every MISS on the two naked asymptotes as pre-declared, the two finite-size zero-parameter comparators HIT every row at every band (residual on ln y*/ln h -0.00022 to -0.00002 against C2), K*/pool falls 0.032 -> 0.026 -> 0.020 -> 0.016 -> 0.013 with no bend and a quiet sup, and the band means sit 0.0017 to 0.0037 below both asymptotes, six to twelve times their 0.000291 difference, so which limit the deficit tends to is set by the comparator and not by the data. | Z2 | [blind-0830-quadpoint-31607.md](history/staging/blind-0830-quadpoint-31607.md) |\n| `Q-quadpoint-c1c2-0830` | ANSWERED | Does the fourth decade's post-hoc, unsealed preference for the omega-form comparator C2 over the exact-Mertens comparator C1 (C1 above the data by 3.46 and 8.83 se at B11 and B12, C2 within 2.82 se) survive a sealed blind test at the fifth decade, Q in (100003, 316243], and what does that say about which mechanism explains the depth law's drift? | MEASURED, sealed before the run and scored blind on 17702 new anchors, and it decides nothing asymptotic: the sealed D1 row HITs at both B13 and B14 (C1 above the data by 13.33 and 23.82 se, C2 within 1.26 and 1.82 se), so by the sealed rule the omega-at-finite-u crossing of import-rough-anatomy.md §2.1 is CONFIRMED over the exact-Mertens product of u2-engine-depth.md §5 as the depth law's main term at the sampling scale, while both still HIT every ±0.0015 row, the kill rows on C2 all HIT, K*/pool falls 0.013 -> 0.010 -> 0.008 with no bend, and the band means sit 0.0012 to 0.0018 below both asymptotes, so the two constants 0.280438 and 0.280730 stay unseparated by the pre-declared rule and the run separates two mechanisms, not two limits. | Z2 | [blind-0830-quadpoint-c1c2.md](history/staging/blind-0830-quadpoint-c1c2.md) |\n| `Q-quadpoint-prior-art` | ANSWERED | In the owning conventions, who holds the rough-pair census, the capture identity and the crossing law, and is any of it ours? | The object and the identity are standard (the dimension-2 twin sifting function plus Buchstab's identity; ADJACENT-STANDARD, no verbatim carrier, no novelty language); only the comparison X(y) < T and the crossing law stay ABSENT-PER-CONVENTION, and the Buchstab correction is 6.6% of the top-band residual, not 2%. | Z2 | [quadpoint-prior-art.md](history/staging/quadpoint-prior-art.md) |\n| `Q-quadpoint-transplant` | ANSWERED | Does the anchored-cap family transplanted onto the stretch window S_Q certify every anchor, and what does the depth cost do with height? | Pre-registration for the decade extension, committed ALONE before the segmented producer existed: it fixes the FALL trend line, the registered band readings, the kill rule and a digit-exact calibration gate that must abort before any new figure prints, and states that a falling K*/pool over two decades would still be only a measurement. | Z2, Z1 (retired) | [attack-quadpoint-01.md](history/staging/attack-quadpoint-01.md), [attack-quadpoint-02.md](history/staging/attack-quadpoint-02.md), [quadpoint-decade-prereg.md](history/staging/quadpoint-decade-prereg.md) |\n| `Q-quartic-fourth-moment` | PARTIAL | Can the fourth moment of rho-tilde, attack-rhoms-01's named stopping object, be bounded? | Not yet: the genuine quartic correlation is small (OFF/m2^2 measured -0.0454, -0.2767, +0.0101, -0.0446 at z = 13..23), the resonance condition is proved to be a local covering condition, and the whole question transfers by two exact identities onto a Lambda(4) inequality for one explicit cosecant sum whose constant is flat; the new increment rung clears z = 47. | none | [attack-quartic-01.md](history/staging/attack-quartic-01.md) |\n| `Q-reachability-coverage` | ANSWERED | Which part of the original divisor domain can no improvement to the grouped moment's nonzero kernel reach, in either orientation, and what would a uniform saving on that kernel actually buy? | For a prescribed fixed exponent margin eta0, the zero budgets leave S_0={p<2eta0,q<2eta0} below that required margin regardless of the nonzero-kernel saving. Uniform gamma=2 covers its complement at that prescribed margin. Smaller positive margins can reach fixed interior points of S_0; only p=q=0 remains at zero budget one for every margin. The proposed eta0~loglog x/log x substitution is not justified by estimates carrying x^epsilon losses; its box count is geometry only. The sufficient twin margin remains OPEN. Independent review F3 and F5 correct the quantifiers and the prime-power tail proof; round-review-0906 corrects the diagonal scope, fixed-margin bulk claim and six-cut separation. | C | [reachability-coverage.md](reachability-coverage.md) |\n| `Q-readings-traceability` | ANSWERED | What is the source of each of the 1,592 figures that appear in a script's READINGS and not in its own OUTPUT block? | The running record: nothing in the pass changes a number, 56 mismatches are classified in eight kinds for adjudication elsewhere, and the advisory count rises when the work is done right because a provenance declaration is prose that carries printed values. | none | [readings-traceability.md](history/staging/readings-traceability.md) |\n| `Q-rec-cheapest-0830` | PARTIAL | At the cheapest legal point of REC(s, u0), s -> 1+sqrt(e) and u0 -> beta_2, where the saving asked over the triangle inequality is only z^{1.031}, does any of the five dead routes close, does a mixed mean-square-plus-cap strategy close, and is the failure a proof gap or a truth gap? | No route closes and the failing step is yesterday's statement, so PARTIAL on the routes; but the step is located as a TRUTH gap, not a proof gap, asymptotically: the certificate's own value at a CRT-planted doubly-smooth window is cc(r) = -(A1A2 + A1B2 + B1A2) with every term a count of exit chains of the Rosser supports (PROVEN, checked exhaustively at z <= 73), the window bound T <= cc(r) + H - 1 is exact, and the exit-chain count is DERIVED (held) to grow like z^{16s/9 - o(1)} at four primes and z^{2s - o(1)} in the limit, so REC(s, u0) is false for every u0 < 16s/9 = 4.7088 at s -> 1+sqrt(e), the whole legal band (2, beta_2] included, and RML(alpha) with it; at every computable z it is a proof gap (Omega(z) exact to z = 73 reads 251 against z^{u0} = 1.05e6, and a certified lower bound 8.86e17 at z = 5e5 sits a factor 1.2e6 under z^{u0}); no exponent moved. | 0 | [attack-0830-rec-cheapest.md](history/staging/attack-0830-rec-cheapest.md) |\n| `Q-recon-0828-covering` | ANSWERED | Does the interval-covering, automated-proof or extremal-combinatorics literature hold a method that bounds the length of an interval covered by two residue classes per prime, or that turns the exact G₂ ladder into a statement at all x? | No route. Fifteen angles examined, fourteen dead on arrival or already closed here; the best interval-covering bound in print is Crittenden-Vanden Eynden's own Lemma 2, which reads 1.02e12 against G₂(79#) = 1710 and is 8181x weaker than the corpus's own 4.2665 sieve bound at the same level; the one survivor, transplanting Costello-Watts's recurrent certificate to two classes, is a computation that certifies finitely many levels and whose analytic half is Erdős #970 at one class. | 0 | [recon-0828-covering.md](history/staging/recon-0828-covering.md) |\n| `Q-recon-0828-farfields` | ANSWERED | Do any of the fields still absent from IMPORT-MAP.md hold a theorem whose hypothesis the tile satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | No route from any of the sixteen candidates priced; two reach STRONG-ANALOGY or better and CLEAN and both bank only a closure or a wall address, the Fourier one by a one-line non-vanishing proof that empties the Donoho-Stark/Tao/Meshulam family on this object, and Janson's lower tail by saturating at exp(-1/c) >= 0.0805 against the 1/W a position union bound needs, short by 3.6e2 at x = 11 and 2.8e13 at x = 41. | 0 | [recon-0828-farfields.md](history/staging/recon-0828-farfields.md) |\n| `Q-recon-0828-jacobsthal` | ANSWERED | Does the 1978-2026 literature on upper bounds for Jacobsthal-type functions and maximal gaps in sieved sets hold anything that lowers G2 or Z2? | No route. Thirteen angles graded, ten dead on arrival (eight already closed in this corpus, two on their own structure), three surviving and none of them lowers an exponent: a kappa=2 extremal candidate built from an exceptional character rather than from Liouville, which can only close the band faster; an unread 1983 Siebert chapter that could already contain it; and one published anchor. Z2 has no non-TPC band at all. | none | [recon-0828-jacobsthal.md](history/staging/recon-0828-jacobsthal.md) |\n| `Q-recon-0828-rough` | ANSWERED | Does the 2000-2026 literature on y-rough numbers, sifted sets and short intervals hold any theorem that lowers Z2 or G2, meaning any control on the largest gap or the minimum count of a sifted set in EVERY short interval, or any structure of rough numbers a gap bound could use? | No. Ten angles examined, ten killed for this purpose; the strongest every-interval statement in print for one-class rough numbers is Iwaniec's S(x,y,z) >= (4y/log^2 y)(log(y/z^2) - O(1)) for y >> z^2, uniform in x, giving J(P(z)) << z^2, and it is the linear sieve run exactly at its sifting limit beta_1 = 2 with no slack outside it; no two-class analogue exists in print at any exponent, the corpus's own x^4.2665 is beta_2 by the same mechanism, and every remaining branch of the field (Matomaki-Radziwill, Gorodetsky, Friedlander-Iwaniec Cor 6.28, Gafni-Tao) carries the almost-all quantifier, which a second-moment statement can never convert into a bound on one empty window. | Z2, 0 | [recon-0828-rough.md](history/staging/recon-0828-rough.md) |\n| `Q-recon-0828-sieve` | ANSWERED | Is there anything in the 2008-2026 sieve literature, or in the parity-breaking literature, that lowers beta_2 = 4.26645 or supplies a consumer for a level theta > 1 on the two-class comb? | No route. Twenty-one angles examined, nineteen dead on arrival, nothing in print beats 4.26645 at kappa = 2 at any level on four calibrated channels; the two survivors are an owning-convention row and one unresolved hypothesis in a five-page 1990 announcement whose stated requirement beta < 3 excludes beta_2 = 4.26645. | 0, Z2 | [recon-0828-sieve.md](history/staging/recon-0828-sieve.md) |\n| `Q-recon-0829-escapes` | ANSWERED | Each of the three killers is an obstruction shape that occurs elsewhere in mathematics; where has each shape been beaten in print, by what mechanism, under what hypothesis, and does that hypothesis hold for the tile and zone objects? | Of nineteen escapes read, fourteen fail a hypothesis check (twelve on a fact already in this corpus), four fail some other way and one (the decoupled vector sieve) stays OPEN as the programme's existing road, so no route opens; Granville-Soundararajan's uncertainty principle is NOT killer 3 in print, is adverse-direction, and is already cited here twice. | 0 | [recon-0829-escapes.md](history/staging/recon-0829-escapes.md) |\n| `Q-recon-0829-farfields2` | ANSWERED | Do any of eight fields still absent from IMPORT-MAP.md and from the three 2026-08-28 recon notes hold a theorem whose hypothesis the tile or the zone satisfies exactly and whose conclusion is a lower bound on a periodic set's count in every window, a maximal-gap bound for a product-structured periodic set, or a positivity statement at a distinguished point? | No route from any of the eight; the pass banks one PUBLISHED-ANCHOR (Holt and Rudd's transfer matrix has its full spectrum in print, second eigenvalue a2 = prod_{17<=q<=p}(q-3)/(q-2), printed 0.10206751799779 at p = 999999999989, decaying only like 2.82/ln p, and this corpus's prior-art record names the eigenstructure and the binomial eigenvectors but carries the per-prime eigenvalue (p-j-1)/(p-2) at lit-pdf-holt-rudd.md line 259 but no product-over-primes closed form, no numerical value and no rate), one CLOSURE with mechanism (Beurling-Selberg is the proof device behind the large sieve, whose constant N-1+1/delta is an l2-to-l2 statement and whose error 1/delta exceeds the window at the operative theta_total > 2, so the whole extremal-function family reproduces a row already rejected), and three wall addresses; two angles are TPC-strength at the form that would pay and are labelled (ii). | 0 | [recon-0829-farfields2.md](history/staging/recon-0829-farfields2.md) |\n| `Q-recon-0830-rec-killrun` | ANSWERED | Does the literature hold, in its own conventions, a theorem whose hypotheses REC(s, u0) (the sup-versus-rms recovery of the level-D signed remainder over all positions, attack-0829n-rml-proof.md section 3) or the weighted kill-run K*(s) (the longest run of level-s slots the primes in (s, 2s] can kill, attack-0829n-doubling-bridge.md sections 0 and 3) satisfies as stated, or a Maier-type theorem that makes REC false for two-class sifted sets at some u0 below beta_2? | No theorem applies to either object as stated, on four calibrated channels searched in the owning conventions; every neighbour is graded NEAREST with its unmet hypothesis named, and neither object is on any refuted row. On the Maier question the answer is negative for REC as stated (the Maier family bounds the COUNT, i.e. the full-level remainder, never a level-D truncation) but carries one calibration: at one class and full level the REC-shaped inequality is FALSE asymptotically, by Buchstab's origin ratio against the Montgomery-Vaughan full-period variance ceiling, and the embedded arithmetic puts the level where that falsity first shows at log10 z between 16 and 141 depending on u0 and epsilon, so a finite-z margin of the kind the corpus measures cannot see a failure of this type; at two classes the same full-level statement is HL-conditional at u0 = 2 and unlocated in print at any u0. No exponent moved. | 0, D | [recon-0830-rec-killrun.md](history/staging/recon-0830-rec-killrun.md) |\n| `Q-recon-0830-smooth-aps` | PARTIAL | Does any theorem on y-friable integers in arithmetic progressions (Granville, Fouvry-Tenenbaum, Soundararajan, Harper, Drappeau, Drappeau-Granville-Shao) supply the uniform o(1) equidistribution that attack-0830-varE-identification.md section 4 leaves open, for moduli up to y^(4/5) with the lam1 weight and the squarefree restriction? | NONE APPLIES AS STATED, and the step stays open; lim Var/E = 0.45546 stays HEURISTIC. Read at the page (eleven sources, arXiv text layers and the Acta Math. page image): every pointwise asymptotic is O(log q / log y)-precise (Granville 1993 Thm 1) or hypothesises log x / log q -> infinity, and every beyond-square-root level (Fouvry-Tenenbaum 1996, Drappeau 2015, Drappeau-Granville-Shao 2017, Pascadi 2023/2025) hypothesises y <= x^delta, i.e. u -> infinity, against our u in (1.2, 2]. NEAREST: Harper arXiv:1208.5992 (2012, a preprint with no journal version found) Theorem 2, the Barban-Davenport-Halberstam form, whose range (log^K x <= y <= x, Q <= Psi/log^A x, bounded u in the ineffective form) covers d up to L^(1/2)/log and whose weight (1 on all friable n, no squarefree restriction, no max over x' <= x) is unmet. The record's quantifier is also refined: the cell needs the lam0-weighted AVERAGE over d, not uniformity. PROVEN given the weighted form (H_w) of that theorem, derivation mine and unreviewed, with its two identities checked numerically in the producer: every two-branch cell of Xmix, both mirror cases, all bands, balanced blocks included, is o(ln^2 y), so the Bettin-Chandee kernel separation is not on this route; the reduction of (H_w) to Harper's theorem is OUTLINED and not written, and the three-branch type (measured -0.0002 at x = 19, trivial bound O(ln^3 y)) is untouched. Not TPC-strength. | 9 | [recon-0830-smooth-aps.md](history/staging/recon-0830-smooth-aps.md) |\n| `Q-recon-0904-sifting-limit-floor` | PARTIAL | What is actually known, in the owning convention and at the page, about LOWER bounds on sifting limits at dimension kappa > 1, and is the class-blind cap at beta_2 = 4.26645 a barrier or a method artefact? | Both. The corpus's [ABSENT] is wrong for lower bounds and right for extremal examples: Selberg's Lectures section 17 and Brady's 2017 Corollaries 1 and 3 ARE lower bounds on beta(kappa) at kappa > 1, invisible because Selberg's convention is the reciprocal a_k = 1/beta_kappa so his lower bounds are titled \"upper bounds for sifting limits\", while no kappa > 1 extremal example exists and Halberstam's own 2003 review says so; the best floor on beta(2) resting on a citation is 1.8394 from Brady's reduction evaluated at kappa = 2, unconditional and below the band, and beta(2) >= 2 follows from monotonicity by a padding argument DERIVED here and probably folklore; the cap at 4.26645 is a METHOD ARTEFACT at rung MEASURED, since the level-D LP is exactly the axiom-only information class and its calibrated floor of 3.3152 sits about 18 per cent below the DHR value and passed, 0 of 15, its first external test against the published beta_3 and beta_4; the band (2, 4.26645] is untouched by anything proven. | 0 | [recon-0904-sifting-limit-floor.md](history/staging/recon-0904-sifting-limit-floor.md) |\n| `Q-reconcile-bind` | ANSWERED | Can the unbound script tails be reconciled against their code and then bound by embed.js? | Six producers came back CLEAN-BOUND and one REBOUND with two documented label supersessions and identical results; nothing was DEFERRED and nothing DRIFTED outside the one pre-registered band move, fdecay-band-01's point 35.5 to 33.9 and band [30.8, 42.9] to [29.6, 38.3]. | none | [reconcile-bind.md](history/staging/reconcile-bind.md) |\n| `Q-record-deficit` | MIXED (lit-kourbatov-shortfall.md: ANSWERED; record-location-null.md: PARTIAL) | Does the 6.0 percent record-location deficit survive the corrected null, and what is it? | Survives (z = -3.3, five window cuts); Z5's premises on 'location' and on n_eff were wrong; corrected-null formula in §4. | Z5 | [lit-kourbatov-shortfall.md](history/staging/lit-kourbatov-shortfall.md), [record-location-null.md](history/staging/record-location-null.md) |\n| `Q-record-mechanism-0830` | PARTIAL | Which of three candidate mechanisms (sub-Poisson gap dispersion, the tile's exact gap law, Kourbatov's k = 1 conspiracy heuristic transported to k = 2) carries the residual 0.78 to 0.97 of Kourbatov's b, at what derived size, and what fraction of b is left? | The residual is carried by the twin-prime gap law AT HEIGHT and by nothing else tried: a new sieve to 1e11 measures that law under-dispersed (CV^2 rising 0.7276 to 0.9295 over seven decades) with a far tail steeper than exponential (log-slope 1.0638 at the top decade), and fed into the record null it carries 95.7 to 99.8 percent of the residual (d b_z = 1.0370 and 1.0806 +- 0.0014 against 1.0833, MEASURED on a model, paired, 2000 replicates); the tile's period-wide law (d b_z = 8.10) and Kourbatov-Wolf's k = 1 bin-count heuristic (4.20) overshoot by 4 to 7x and are closed as posed; the transport of a bare CV^2 is family-dependent (0.62 against 1.06 at CV^2 = 0.93), so \"computable from Var/E\" is false as stated; Kourbatov-Wolf's second-order scale a_c/abar tracks the measured CV^2 to within 0.04 at every decade with no parameter and is an ansatz, not a derivation; the shape statistic moves a third of the way toward the data (z_D from -1.64 to -0.97); what is left with no derivation is the gap law itself, and the top height band's b (0.937 measured against 1.69 to 1.98 predicted on 17 records) is the open falsifier. | Z5 | [attack-0830-record-mechanism.md](history/staging/attack-0830-record-mechanism.md) |\n| `Q-record-null2` | ANSWERED | How much of Kourbatov's shortfall coefficient b does an inhomogeneous-intensity record null carry, how much does a 6Z-latticed null carry, and what is the residual? | The inhomogeneous null carries essentially none of b (d b_z = -0.0012 +- 0.0001, MEASURED); the 6Z lattice's share is LAW-DEPENDENT, +0.1113 +- 0.0003 under the memoryless rounding-up law against -0.0060 +- 0.0003 under rounding to nearest, so the null side is a bracket of 16.1 to 25.1 percent of b and three quarters or more stays a residual with no mechanism; record-location-null.md section 8's argued 1.7e-4 lattice bound is wrong but no single number replaces it; the 15 percent estimator disagreement is pinned as an exact weighting identity; and the shape assumption behind every b reading is measured at 1.6 sigma and stays open. | Z5 | [measure-record-null2-0829.md](history/staging/measure-record-null2-0829.md) |\n| `Q-records-placement` | ANSWERED | Do the seven unswept twin-gap records 76-82, above 2^53, land uniformly inside their stretches, or is there square-anchor coupling in record-start placement? | Sealed alone before the producer existed: the uniform band, the fixed definitions, the registered readings, the calibration abort gate and the riders are all fixed here and no placement fraction, q or stretch boundary was evaluated; scored in records-placement-01.md. | Z6 (retired) | [records-placement-01.md](history/staging/records-placement-01.md), [records-placement-02.md](history/staging/records-placement-02.md), [records-placement-prereg.md](history/staging/records-placement-prereg.md) |\n| `Q-redteam-0818` | ANSWERED | Do the six headlines of 2026-08-18 survive being checked by someone other than their author? | Four CONFIRMED, two WEAKENED, one REFUTED: the second instrument's independence claim is refuted, the growth law weakens to G2 = x ln^{2+o(1)} x with the o(1) positive, and B is polylog, Brady's Problem 3 and DP1's consumer stand. | none | [redteam-2026-08-18.md](history/staging/redteam-2026-08-18.md) |\n| `Q-redteam-0820-empirical` | ANSWERED | Do the two held empirical headlines, perfold-error-model and item-x-offset, survive an adversarial pass before integration? | Both SURVIVE: every decisive statistic reproduced digit-for-digit on independent code, the blind window was re-sieved and re-scored 33/37 with independently re-derived bands, and the cofactor purity claim is certified; two sentences are weakened (the anchor-direction identical is only bounded at 6-10 per cent, and the @31 sigma calibrated claim outruns its controls) and one sentence is refuted as stated. | none | [redteam-0820-empirical.md](history/staging/redteam-0820-empirical.md) |\n| `Q-redteam-0820-math` | ANSWERED | Do fekete-1d, smoothness-front and import-hypergraph survive an adversarial pass before integration? | Mostly CONFIRMED, with one REFUTED as stated (import-hypergraph's \"the engine can never carry a ln-power\" is false for bounded-size edges, though the row's verdict survives for FGKMT-sized edges) and one WEAKENED (the freeze survives, the frozen value does not, under the trusted ladder). | none | [redteam-0820-math.md](history/staging/redteam-0820-math.md) |\n| `Q-redteam-0820-night` | ANSWERED | Do the night's two staged headlines, mp-derivation.md and rho-maximal-law.md, survive an adversarial re-derivation before integration? | Both survive: every decisive number reproduced on independent code, the fresh window re-sieved with a different engine reproducing all 37 X, the prereg custody at commit 303711b confirmed with the anchor genuinely fresh, and all 37 sealed (mu, lam) values and all 74 band integers reproduced exactly. | none | [redteam-0820-night-empirical.md](history/staging/redteam-0820-night-empirical.md) |\n| `Q-redteam-0820-night-proofs` | ANSWERED | Do the two proof-heavy held headlines of the 0820 night, anchored-01 and hsub-01, survive independent re-derivation? | Both stand: zero refutations and zero corrections to any quoted number, with every digit re-derived from the staircase-note's own lemmas or recomputed from the definitions in independent code; the doubling inequality itself was not attempted and remains posed, open and trap-free. | none | [redteam-0820-night-proofs.md](history/staging/redteam-0820-night-proofs.md) |\n| `Q-redteam-0820-structural` | ANSWERED | Do the Mirror-Sweep Lemma and its palindrome, and the advmin@11 = 16 headline, survive an adversarial replay? | Both CONFIRMED on independent re-derivation with zero shared code, advmin@11 = 16 re-proven end to end so that 16 < 34 kills every class-uniform cap; the correction that matters is one quantifier made explicit in the inversion sentence, since a family whose conclusion reads the chosen classes is not capped by 16 at the anchored point, and two precision defects sit in a Thorne citation. | none | [redteam-0820-structural.md](history/staging/redteam-0820-structural.md) |\n| `Q-redteam-0821-exponent` | ANSWERED | Do attack-rhoms-01's exponent claim and attack-doubling-01's certificates survive independent re-derivation? | No numerical discrepancy anywhere in either target, every re-derived figure reproducing to the printed digit; the 3.5+o(1) cap survives the attack it was most likely to die to but is not an unconditional bound on G2, and two wordings that run ahead of their custody grades are WEAKENED. | none | [redteam-0821-exponent.md](history/staging/redteam-0821-exponent.md) |\n| `Q-redteam-0821-structure` | ANSWERED | Do the W1/HL identity and the anchored-02 ladder survive re-derivation from the definitions on independent code? | Both headlines survive with zero refutations and all ten sub-claims CONFIRMED, carrying two recorded corrections: the -0.33 se figure's sign is presentation-dependent, becoming +0.32 se when duplicate-theta folds are collapsed, and the shadow guarantee is stronger than sold, a one-line theorem rather than a 76/76 empirical. | none | [redteam-0821-structure.md](history/staging/redteam-0821-structure.md) |\n| `Q-redteam-0821-wave2` | ANSWERED | Do the three held analytic attacks, b2mean, f4weak and quartic, survive an adversarial re-derivation? | All three survive with every load-bearing number re-derived independently, including four full N_k curves on a different inclusion-exclusion implementation and a c1 column from a freshly fetched OEIS b-file; two sentences are weakened, the cert/C2 widening being non-monotone, and no claim is refuted. | none | [redteam-0821-wave2-analytic.md](history/staging/redteam-0821-wave2-analytic.md), [redteam-0821-wave2-structural.md](history/staging/redteam-0821-wave2-structural.md) |\n| `Q-redteam-0828-census` | ANSWERED | Do destroyer-census-01.md, stretch-01.md and records-placement-01.md survive an independent re-derivation of every load-bearing claim, and may they leave HELD? | All three survive on arithmetic, every decisive number reproducing exactly on an independent engine; one sealed reading (records READ-3) is REFUTED as vacuous and four sentences need correcting before integration. | Z0, Z4, Z6 (retired) | [redteam-0828-census.md](history/staging/redteam-0828-census.md) |\n| `Q-redteam-0828-closures` | ANSWERED | Do the five 2026-08-28 closure notes stand, and do they stand for the reasons they give? | Three stand on corrected sentences (1d, Z5b, 0); one stands in half (10, the 1.074 counter-claim does not); one does not stand for its stated reason (1c, closed on a narrower window than the prior work's significant one, and its CLOSED has overwritten a PARTIAL in the generated index). | 10 (retired), 1c (retired), 1d, Z5b (retired), 0 | [redteam-0828-closures.md](history/staging/redteam-0828-closures.md) |\n| `Q-redteam-0828-engine` | ANSWERED | Do the five 2026-08-28 certificate-engine notes survive an adversarial re-derivation, and does the one-class freshness factor correction hold before it reaches a live document? | The one-class factor holds and is stronger than either note states; four numbers are refuted (first s>=10.82 is x=263 not 239, first non-empty kappa=1 level is @37 not @53, rho*g_max is off by one gap, the @17 certified share and per-term constant carry the wrong convention) and one proof step needs the max-over-y form of BV; the cluster's shared verdict stands. | 11 (retired), 8 | [redteam-0828-engine.md](history/staging/redteam-0828-engine.md) |\n| `Q-redteam-0828-head` | ANSWERED | Do the three 2026-08-28 head-residual notes survive an adversarial re-derivation of every load-bearing claim on independent code? | Mostly yes on the numbers and no on two framings: \"h/R -> 1 iff beta CV^2 -> 2\" is REFUTED (the limit needs only boundedness, the product controls the RATE), and 9 to 59 percent of the quoted h - R is the choice of comparator, since R is the continuum functional and a discrete uniform origin sees R + 1/2 exactly. | Z4 | [redteam-0828-head.md](history/staging/redteam-0828-head.md) |\n| `Q-redteam-0828-litimports` | ANSWERED | Do the six notes of 2026-08-28 survive an adversarial pass, and which of their load-bearing claims are wrong? | Every measured number reproduces on independent code; Saffari-Vaughan Theorem 10's range exponent is 6/11 not 1/11, which voids import-fracparts's one banked THEOREM at fixed M and corrects row 15 twice; four further weakenings, one refuted verdict line, no note refuted whole. | Z5, 4 (retired) | [redteam-0828-litimports.md](history/staging/redteam-0828-litimports.md) |\n| `Q-redteam-0828-quadpoint` | ANSWERED | Do the four HELD quadpoint notes of 2026-08-22 survive an adversarial pass: the capture identity's proof line by line, the depth law and its asymptote, the sealed prereg scoring, and the prior-art citations at page level? | The identity is PROVEN once its window convention is written down and holds at every K of 50 anchors under an independent implementation; four load-bearing sentences are wrong (section 4's gloss on Sum capU, v1 section 2's limit, the prior-art note's 2%, and the note's unconditional y* sentences), and none of the four defects opens or closes a route. | Z0, Z2 | [redteam-0828-quadpoint.md](history/staging/redteam-0828-quadpoint.md) |\n| `Q-redteam-0828-varE` | ANSWERED | Does the 2026-08-28 chain from the exact comb variance to lim Var/E = Pr[GD(2) > 2] = 0.45546 survive an adversarial re-derivation, and does the refutation of the 0.611 reading hold? | The constant survives at HEURISTIC and the 0.611 refutation is CONFIRMED and strengthened (the frozen out-of-sample half of the protocol also fails on the control); the correction is that TWO steps are open, not one, and that the theta=1 branch is an exact identity with a read theorem rather than a second-hand numerical match. | 9 | [redteam-0828-varE.md](history/staging/redteam-0828-varE.md) |\n| `Q-redteam-0829-measure-a` | ANSWERED | Do the three held measurement notes of 2026-08-29 (g2z2, g2-generic, provenance/x37) survive an independent re-derivation of every load-bearing claim, a custody and pre-registration audit, and a label audit against the wrong-direction scheme? | 96 load-bearing claims checked, 88 CONFIRMED on independent code or by hand, 7 WEAKENED, 1 REFUTED; the one refutation is a label, not a result: the g2z2 note's M2 and its producer's printed block both call 4.177e-1 the summed Poisson probability of a two-pair zone over p >= 3, while the code sums every decade including p = 2, whose single contribution is 2.6586e-1, so the true p >= 3 figure is 1.518e-1 and the MISS verdict is unchanged; no pre-registration in any of the three shows any sign of a prediction edited after its run, and birth-time evidence puts the note file before the producer file in two of the three, with the generic producer's inode anomalous and its claimed timestamps uncorroborated. | none | [redteam-0829-measure-a.md](history/staging/redteam-0829-measure-a.md) |\n| `Q-redteam-0829-measure-b` | ANSWERED | Do the three 2026-08-29 HELD measurement notes (measure-roughpair-null-0829, measure-record-null2-0829, zone-tail-02-0829) survive independent re-derivation of their load-bearing claims, their custody and pre-registration integrity, their (i)/(ii)/(iii) labels, and their proposed edits to other documents? | 59 load-bearing claims checked, 44 CONFIRMED, 13 WEAKENED, 2 REFUTED, no data defect found and all three producers bit-honest under embed --check; the worst finding is custody clerical rather than numerical, measure-roughpair-null-0829.md:161 quoting code-sha256 4813584b against the producer's banner 5caaa5173b4c1561, a hand-transcribed hash that does not bind the artefact it names; the second is zone-tail-02's scope claim that every head bootstrap in the corpus is three times too narrow, REFUTED as written because destroyer-census-01.md publishes no bootstrap at all and head-residual-factor.js bootstraps over gaps rather than zones, while the defect itself is CONFIRMED on an independent engine (1,910 distinct a_first among 17,700 top-band zones reproduced exactly) and is LARGER than stated, a cluster bootstrap giving an inflation factor of 4.10 against the note's implied 3.04; measure-record-null2's exact cov identity reproduces to 1.4e-15 from the OEIS ladder and its lattice arithmetic reproduces at every row, but its headline \"wrong by about three orders in b units\" is unit-inconsistent and contradicts its own section 3e's \"about one order below the effect\"; no pre-registration shows any sign of post-run editing and none of the three can be shown NOT to have been, because all three preregs live inside note files whose mtimes necessarily postdate their producers'. | none | [redteam-0829-measure-b.md](history/staging/redteam-0829-measure-b.md) |\n| `Q-redteam-0829-measure-c` | ANSWERED | Do the load-bearing claims of measure-tail-deficit-0829.md, lit-scourfield-2008.md, recon-0829-farfields2.md and recon-0829-escapes.md survive independent re-derivation at the record, and are their custody, prereg, provenance and (i)/(ii)/(iii) labels intact? | No verdict of the four notes is overturned; of 61 load-bearing claims 38 CONFIRMED, 14 WEAKENED, 6 REFUTED, 3 UNVERIFIED. Worst: lit-scourfield-2008.md line 79 quotes lit-smooth-divisors.md section 6 as saying the convention has \"no asymptotic machinery in this range at all\", a string absent from the repository and contradicted by that section's own words, and uses it to justify a correction; measure-tail-deficit-0829.md section 2 describes a superseded embed and does not disclose the --force the header records, although embed.js --check passes on all three hashes; and note 1's reported M-P1 failure at 19 -> 23 is a single-draw artefact, reversed here on 40 draws (shuffled 296.1 sd 29.1, Markov 264.0 sd 18.4, share 34.9 percent inside the registered band). Note 2's precision correction inverts a quantifier, the open step needing o(1/ln y) against Scourfield's O(1/log x); note 3's corpus does hold the per-prime eigenvalue at lit-pdf-holt-rudd.md line 259; note 3's section 3c re-prices a family already resident as the Vaaler completion of its own Lemma V remainder. Every verdict, and most of the arithmetic, otherwise reproduces on an independently written engine. | none | [redteam-0829-measure-c.md](history/staging/redteam-0829-measure-c.md) |\n| `Q-redteam-0829-objects-gb` | ANSWERED | Does every load-bearing claim of the two 2026-08-29 object reads (G2 and the bridge) survive independent re-derivation at the cited record? | 60 load-bearing claims re-derived at the record: 47 CONFIRMED, 8 WEAKENED, 1 REFUTED, 4 left UNCHECKED and marked so; the refutation is the G2 note's L5 formula, which pairs the corrected trusted zone K in [1.3946, 11.3568) with the superseded single-base expression (ln 66 + K)/ln 16, an expression that evaluates to 5.607 above beta2 at the top of its own stated range, and the three live-layer edits already applied by the orchestrator are correct as written. | none | [redteam-0829-objects-gb.md](history/staging/redteam-0829-objects-gb.md) |\n| `Q-redteam-0829-objects-zm` | ANSWERED | Do the load-bearing claims of z2-state-draft-0829.md and object-models-read-0829.md survive independent re-derivation at the record, and is the Z2 draft fit to become research/Z2-STATE.md? | 96 load-bearing claims re-derived at the record, 84 CONFIRMED and 11 WEAKENED and 1 REFUTED; the one refutation is a custody label, since the Z2 draft grades as unstamped hand arithmetic a table that sits in an embedded producer's OUTPUT block, and the draft is fit to become Z2-STATE only after eight named line fixes. | none | [redteam-0829-objects-zm.md](history/staging/redteam-0829-objects-zm.md) |\n| `Q-redteam-0829-theorem1` | ANSWERED | Is Theorem 1 of attack-AB-bounded.md (B <= 9 A(z)^2 (E(z)-1) = O((log z)^8)) a theorem, and at what rung does the corpus carry it? | PROVEN, and the scope now covers the whole chain: the L1 to L5 mean-square derivation and Theorem 1's bound on B are each re-derived here with no hypothesis, so _H <= 9 A(z)^2 (E(z)-1) H holds for every z, s and H as a mean over one period, the record's [INFERRED] is an under-grade, and the live layer's \"published as Opera de Cribro 6.18\" is wrong on two counts and must be replaced. | none | [redteam-0829-theorem1.md](history/staging/redteam-0829-theorem1.md) |\n| `Q-redteam-0830-doubling` | ANSWERED | Do attack-0829n-doubling-bridge.md and attack-0830-doubling-killrun.md survive an adversarial re-derivation on an engine sharing nothing with their producers, and do REFUTED rows 94 and 98 stand as worded? | The mathematics survives: the maxsum certificate Ghat(2s) <= maxsum_{K*+1}(T_s) and the product composition K*+1 <= prod(1+L_j) are each re-derived here and hold, the second at 21,641,346 nesting links over 6,012,804 killed runs with zero failures including the zero-kill fold, and every quoted figure reproduces digit for digit on a fresh engine (K*(16) = 17; G2(31#) = 348 @ 8813641451 x4 from both base tiles; sup msc 6.6364; the diagonal cells; the 2^N ratios 1.226/1.481/41.348). Row 94 STANDS and is if anything under-claimed, but its attribution is wrong in one direction: Lemma 1 at s = 128 alone clears the whole band, so the s = 16 walk corroborates rather than carries it. One statement is falsified: the bridge note's NOT-REACHED line puts 19#->37# out of reach, but column-major it returns here, reproducing the ladder row x = 37 and adding a FIFTEENTH step at s = 19, 20 (K* = 13, N = 4, C2 3.5200, certificate 3.8000), so the enumerable range ends at s = 20, not s = 18. Row 98 STANDS on its mathematics and is WEAKENED on one clause: \"the truth sits under it everywhere (sup w/a = 0.8295)\" attaches the CERTIFICATE's ratio to the word truth; the truth's sup is 0.6591. | D | [redteam-0830-doubling.md](history/staging/redteam-0830-doubling.md) |\n| `Q-redteam-0830-engine` | ANSWERED | Do attack-0830-buchstab-deep.md, attack-0830-comb-tail.md and attack-0830-anchored-ladder-17.md survive an adversarial re-derivation on code that shares nothing with their producers, and does REFUTED row 97 stand as worded? | Every headline number in the three notes reproduces exactly on independent code (26 of 26 comparisons, including F2/f2 = 3.6682 at sigma = 4.7088 by a near-analytic route, the 0-of-1512930 pair count, the tail defect at five levels, the full 419328-term Legendre split, and the whole @23 anchored ladder including K* = 27, floorU = 5364, truth 597475 and the minimal pool 1543 proven exact); one load-bearing DERIVATION is REFUTED — \"\\|B - 1\\| >= c forces sigma(q) < u_c - 1\" fails at @23 on 21134 (q, K) pairs for the engine's model B at c = 0.1 and on 33875 high-count pairs for the measured B at c = 0.01, because the step bounds every u in a weighted average by the largest one and treats the denominator as e^-gamma, so the \"level-free\" clause of buchstab-deep section 4 and REFUTED row 97's \"\\|B - 1\\| >= 0.01 forces sigma < 1.798\" must be re-graded from DERIVED to MEASURED-at-@23 (where the conclusion survives: the worst sigma is 2.159, still far below beta2 = 4.26645); row 97's \"the best sigma any level has\" is separately WEAKENED, since @29's head sigma is 5.5785 with width 1.5325 and @97's is 17.1422 with width 1.0000; comb-tail derives its main-term factor from prod (1 - 1/q_i) and measures it against prod (1 - 1/(q_i - 1)), which is what natal-cap-28 line 283 computes against its own line 20 and against certificate-engine.md section 1, a 0.9% difference at @23 that moves nothing certified; comb-tail also misquotes its own cited source as F1 in [1.5, 4] where that source says [1.5, 3] and says there is no bound at all at s < 1; four smaller slips are listed and none opens or closes a route. | 8, A | [redteam-0830-engine.md](history/staging/redteam-0830-engine.md) |\n| `Q-redteam-0830-fekete` | ANSWERED | Do the load-bearing claims of attack-0829n-hsubpow-K.md (the sign lemma, the K -> beta_bound map, the zone, the TODO.md base-16 correction) and measure-0830-delta-reader.md (the six pre-registered readers, their kill gates, the joint fit's calibration, the RB circularity argument) survive independent re-derivation, and are the two live-doc corrections they caused the right sentences? | Every number in both notes reproduces on independently written code (all 14 cells of the beta_bound / K_min table, all 48 cells of the reader-calibration table, all 24 figures of the real-control table, the margins, the sups, the 5.607 correction, the 10-of-81 count), and the sign lemma is re-proven as stated for continuous exact laws. Two claims are WEAKENED and one live-doc sentence needs a qualifier: the sign lemma's constant 1.0597 loses 43% of its value if the base floor moves from 2 to 3 and its whole shape fails for the stepped law that a primorial ladder must present, where beta re-enters the sup and a delta = 0 law already needs K = 1.37 at beta = 2, inside the trap; and TODO.md 1d's \"the sign of delta is unreadable for G2 at reach 79 by any instrument tried\" is wrong on the letter, since reader RB passed all four pre-registered criteria and read delta_hat = +0.80 +- 0.09, the note voiding it post-hoc on a circularity the pre-registration flagged but did not make a kill criterion; the honest sentence adds \"non-circular\". No claim in either note is refuted. | 1d | [redteam-0830-fekete.md](history/staging/redteam-0830-fekete.md) |\n| `Q-redteam-0830-floor-growth` | ANSWERED | Does the DERIVED growth half of attack-0830-rec-cheapest.md sec.4.2 (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive an adversarial re-derivation on independent code, does it really make REC(s, u0) false for every u0 < 16s/9, and does the blind slope test of blind-0830-omega-floor.md test the LAW or the CONSTRUCTION? | No break found in six attacks, so the growth half SURVIVES this pass and stays DERIVED (one failed break is not a proof, and the whole thing still rests on the exact half E1-E3 that this pass did not grade); but four claims are corrected - the threshold 16s/9 needs the unstated hypothesis s <= 3 (above it the four-prime LP maximum is 2(2s+2)/3, then 8, both below 16s/9, though the corollary that every legal u0 < beta_2 fails survives at every admissible s because 2 x LP-max > beta_2 for all s > 9beta_2/16 = 2.3999), the 2s - o(1) limit needs 3^k <= ln D / ln 8 so only k = 2 is available at every z below 1.1e9, A_i is >= not ~ the dyadic count, and the certified ratio does NOT rise monotonically (0.0118, 0.0128, 0.0101, 0.0057, 0.0051, 0.0093, 0.0336, 0.0801, 0.1658, 0.3545 on my own recount, which reproduces all ten S4b rows digit for digit); the blind test is ruled a test of the CONSTRUCTION's count and not of the law, since it cannot see E1-E3 or the CRT step; on the ruling Chris asked for, the floor does make the RML route a truth gap asymptotically and conditionally on E1-E4, and changes nothing computable, the literal construction first passing H = z^{u0} at z ~ 5.6e31 on the constant 2.93e-4 measured here; no exponent moved. | 0 | [redteam-0830-floor-growth.md](history/staging/redteam-0830-floor-growth.md) |\n| `Q-redteam-0830-floor-sign` | ANSWERED | Does the EXACT half of attack-0830-rec-cheapest.md sec.4 (E1-E4, the sign facts, the window bound T <= cc(r) + H - 1, the exact Omega, and sec.(d)/(e)'s calibration sentences) survive an adversarial re-derivation on independent code, and does it by itself constrain REC at any u0 without the growth law? | The mathematics STANDS as PROVEN and is stronger in two places than the note claims, but it constrains REC at NO u0 by itself: E3's identity is pure algebra and holds at every position (0 mismatches in 20.5M positions, both s), E2 holds at every divisor n > 1 under three disjoint routes at every s >= 1 and FAILS at s = 0.8, locating a hypothesis D >= z the note omits, E4 has 0 violations at every x over four complete periods with the wrap, and Omega is reproduced by an independent enumeration at all 26 tabled values and EXTENDED to z = 101 (285, 441, 684, 990, 1155 at z = 79, 83, 89, 97, 101), confirming blind-0830's exact 684 and 1155; three sentences are wrong -- E1's \"every pair with gcd \\| 2 is realised\" (exactly half are; the missing half is all those with 2 dividing one side), the ledger's and sec.0's \"251 against z^{u0} = 1.05e6\" (1.05e6 is HM, z^{u0} = 7.19e7, so the gap is understated 68.3x), and sec.4.4's reason for lam+(P(z)) = 0 (0.24 exceeds 1/8; the figure that closes the slab is 0.1199 at z = 89, under 1/8 by 4 percent) -- and sup\\|rho~\\| >= (Omega - M)/2 is loose: sup\\|R_1\\| = Omega + M exactly. Every exactly known log_z Omega is under 2 while REC needs it above u0 > 2, so the exact half touches REC at no u0 and every adverse consequence in the note still rests entirely on the growth half. No exponent moves. | 0 | [redteam-0830-floor-sign.md](history/staging/redteam-0830-floor-sign.md) |\n| `Q-redteam-0830-imports` | ANSWERED | Do the six lighter notes of 2026-08-30 (varE-identification, smooth-aps, rec-killrun, skeleton-door, at43-bigint, coherence) survive an adversarial pass on independent code and at the source pages, and which of their load-bearing claims are wrong? | No note is refuted whole and no exponent moves. Every decisive measurement reproduces on code sharing nothing with the producers: the varE mixed remainder and its 0.844 / 0.826 share below 2L and 94.4 / 98.7 percent unbalanced share at x = 13, 17; the Buchstab deviations and all three crossing levels log10 z* = 33.53, 68.80, 33.62; the skeleton door's 9.2 / -0.9 percent, G30_agg 0.1113 / 0.1011 and the 0.0102 cap at @13, @17, by a path that also verifies cap-36 Theorem A; the @43 parity exactness on all 26,157,448 scour classes with 0 above 2^54 and a constructed @47 counterexample; and the five recon-0828 verdict counts summing to 75, which REFUTES rec-killrun's brief-error clause and confirms the orchestrator's rider. Seven claims WEAKEN. The load-bearing one is smooth-aps's \"the weight is unmet in print\": Harper's J. London Math. Soc. 112 (2025) e70293 proves a Barban-Davenport-Halberstam asymptotic for an ARBITRARY sequence on exactly that dyadic all-classes object, and his own footnote says the missing max over x' can be incorporated, so the NEAREST citation changes even though the step still does not close (the 2025 range is sqrt(2x) < Q <= x and its Theorem 2 route bars sieved sets by name). Also: Henriot Corollary 2 applies, but to the ERRATUM's statement and under two hypotheses the note leaves unstated (eps < alpha/600, not \"every eps\"; F at prime powers); varE section 4's display (*) carries an unfilled placeholder and is vacuous by a factor L/d; the skeleton door's \"would tighten\" is wrong in sign at @17, where the closable block is negative and removing it RAISES G30_agg to 0.1020; Halasz-Montgomery is not applicable for the reason given (it is an abstract inner-product inequality); FGKT's heuristic quote is on p. 4, not p. 3; and the \"~13x had no source\" is a corpus miss, the retired G2-walk figure at CHANGELOG.md:5716. Not TPC-strength; nothing here opens a route. | 9, 0, D, 1 | [redteam-0830-imports.md](history/staging/redteam-0830-imports.md) |\n| `Q-redteam-0830-records` | ANSWERED | Do attack-0829n-parity-dstar.md (CLOSED, HELD) and attack-0830-record-mechanism.md (PARTIAL, HELD) survive an adversarial pass on independent code, does REFUTED row 95 stand as worded, and is TODO Z5's new title supported? | Both notes' measurements reproduce on independent code and neither headline is refuted: D* is confirmed EXACTLY, by a BigInt rational simplex written here, at 299 of 376 anchors with 0 contradictions (the other 77 exceed the exact solver's size cap), the old range's 172-figure gate is re-derived exactly at all 43 anchors with 0 disagreements, and an independent 30-wheel sieve to 1e11 reproduces note (b)'s seven decade gap counts, CV^2 and far-tail slopes to every printed digit, with the counts also matching the published pi_2(10^k). Four sentences are wrong or over-stated and are replaced here: REFUTED row 95, note (a)'s ledger, its section 6 and TODO Z5 all attribute the null's 0.025 agreement to the WIDTH law when 0.025 is the ln Q slope difference (the width-slope difference on the same 84 matched anchors is 0.031); note (a) section 3's \"the threshold sits in a gap of at least 0.25 at every anchor\" is scoped in its own producer to the true arm and the null arm's exact gap is 0.1212; P6's HIT rests entirely on the decade-2 collapse that section 5 discounts as a sampler artefact when it discounts kill clause (a); and note (b)'s \"d b_z = 1.0806 +- 0.0014\" carries only the Monte Carlo pairing error, while moving the far-tail slope by 0.02 (against a spread of 0.0174 across six fit windows on the same decade and 0.1196 across decades) moves d b_z from 0.9888 to 1.1720, and continuing the law at slope 1 above the last resolved point still gives 0.7752. REFUTED row 95's CLOSED verdict stands on kill clause (b), which is better powered than the note presents it (paired s.e. 0.0401 against a 0.15 band), and the row needs two clauses reworded; TODO Z5's title is supported for \"measured and not derived\", and the resolved part of the law carries 72 per cent of the residual on its own with the extrapolation carrying the rest. | Z2, Z5 | [redteam-0830-records.md](history/staging/redteam-0830-records.md) |\n| `Q-redteam-0830-rml` | ANSWERED | Do the three HELD notes of 2026-08-29 night and 2026-08-30 on the RML chain survive an adversarial pass — the six-arrow chain and the term-count cap lemma of attack-0829n-rml-proof.md, the same-object ruling and the applied replacement sentences of verify-0830-usup-convention.md, and the reflection identity, custody, pilot bounds and sealed forecast of measure-0830-rho-sup-z41.md? | The three load-bearing PROVEN claims survive independent re-derivation — the CAP lemma (every step, sine sum at worst ratio 0.585568, the constant 6, 0 per-modulus violations at z = 13, 17), the reflection identity rho~(W-3-y) = -rho~(y) (proved here and its two hypotheses verified at z = 13..37, residual <= 1.7e-10 at every position of z = 13, 17, 19), and the same-object ruling (an independent lattice reproduces the repository's term multiset exactly at z = 13..37 and its {Vabs > 0} set equals LSE's records at all ten levels); five of the seven cited exact sups and three of the five walked sup\\|R_H3\\| reproduce to <= 5.0e-7, and every figure of the sealed z = 41 forecast reproduces from the seven cited sups alone. Fourteen claims do not survive, none of them reopening a route. The load-bearing one is RML sec.2's ms_m/ask column: it measures the PROVEN mean-square BOUND sqrt(B H), not the ^{1/2} that REC names, the two differing by 36.53x to 200.45x on the tabled rows because saturates in H while B H does not, so sec.5's ordering (ask below the Gaussian factor at u0 = 3.0 and 3.5) is an artifact and reverses at every row against the true mean square. \"gauss -> 0\" (sec.5) and \"sup/rms <= sqrt(2 lnW) O(1) = z^{o(1)}\" (sec.3) are the same error twice, against the note's own sec.0: sqrt(2 ln W) = z^{1/2+o(1)}, measured gauss 0.7905 at z = 19 falling to 0.5645 at z = 1e7, limit 1/2. \"the recovery exponent is log_z(2 sup\\|rho~\\|/rms): about 0.99-1.29\" quotes the truth column, which is log_z(2 sup\\|rho~\\|) alone; the quantity named measures 0.5628 to 0.6712. \"REC would be moot rather than false\" should read false. \"u_cap -> 2s + o(1)\" and \"n ~ z^{2s}/polylog\" are asserted where only \"<=\" is proven and the data cannot decide: u_cap is 4.2652 at z = 47, crosses beta_2 only at z = 53, reaches 4.4891 at z = 79, and passes u_triv from z = 53. \"seven points spanning less than one octave\" is 1.509 octaves, still uncorrected in three places including the ledger verdict. verify-0830's applied \"polynomially many from z = 223 on\" is true at every z >= 13, and its z = 331 crossover silently sets A = 1 (A fitted to LSE's own Ssat moves it to 337). No exponent moves, no route opens or closes, and no ledger verdict changes. | 0 | [redteam-0830-rml.md](history/staging/redteam-0830-rml.md) |\n| `Q-redteam-0830-slack` | ANSWERED | Do attack-0830-head-remainder.md, attack-0830-tail-derivation.md and verify-0830-record-defects.md survive an adversarial re-derivation on independent code, and do the five riders the verification put on live notes stand as written? | Arithmetically they survive: every figure of the three notes that this pass could recompute reproduced to the printed digit on code written from the definitions, 0 assertion failures over 58 assertion call sites (most inside per-level loops), including every figure of the verification's three claims and the half-decade Delta_HL it quoted rather than recomputed. Four sentences do not survive. (1) verify-0830-record-defects.md:316, a replacement queued for head-residual-hl3.md sec.0, says the pooled value sits \"0.038 to 0.052 below the sub-window mean at all three decades\"; measured, the two lower decades run to 0.076 and 0.066, and the same note's own falsifier row says 0.038 to 0.076, so the wrong half is the one queued to land. (2) verify-0830-record-defects.md:379's un-measured \"+0.005\" residual inside the eighths is +0.0004 measured at sixteenths, so the de-pooled top-decade value is converged and the caution can be dropped. (3) the ruling that the class null is \"the matched figure\" for the tail is matched on residue class only: p'^2 is coprime to every q <= p', and the ensemble's rough-class offset is E_rc - R = 5.6714 -> 7.5357 over x = 7..29 against the class null's 5.6000 -> 6.0336, giving t/(R_shell + 7.5357) = 1.0123 against t/classNull = 1.0157. (4) attack-0830-head-remainder.md sec.3's top row is not gap-scale matched: E[g] 244.0 against 235.9, y_match capped at 19997, and on the note's own six ensemble points Delta_ens ~ E[g]^-0.312, so meas/ens reads 0.9640 not 0.9539 and the headline \"0.954 to 0.995\" reads 0.964 to 0.995. Three levels the notes recorded as out of reach are run here: the X2 group at x = 23, the tile identities and conditionals at x = 29, and the ensemble ladder at y = 29 (pipe/ens 0.9535, 40 s, against the head note's \"about fifteen minutes\"). No route opens or closes and nothing here touches Z2. | Z4, 9 | [redteam-0830-slack.md](history/staging/redteam-0830-slack.md) |\n| `Q-redteam-0830-zone` | ANSWERED | Do attack-0829n-X-upper.md, blind-0830-quadpoint-31607.md and blind-0830-quadpoint-c1c2.md survive an adversarial re-derivation and an independent re-implementation of their producers, and at what rung does the corpus carry each of their headline claims? | They survive on the numbers and mostly on the wording. On independent code every band sum, tier ratio, sealed forecast, band statistic and z of all three notes reproduces to the printed digit (X-upper 7.82 to 10.13 and the flat 378100.0; the fourth decade's 76 rows at 64 HIT and 12 MISS with the same twelve MISSes; the fifth decade's class A at both bands), and three attacks failed to break them (the paired-se attack on the D rows, a search for a fitted constant in C1, and gap-selection at the band edges). Four defects stand: the X-upper note's \"s_max 1.81 to 1.96\" is wrong in its own arrow convention, which means B3 to B8, since s_max peaks at B4 and reads 1.85 at B8; the c1c2 note's OLD R2 row at B14 is a boundary call that my 1-in-8 subsample scores the other way; the c1c2 note's custody line \"three tails, one code-sha256\" is a tautology of tailfmt.js and is not evidence of a seal; and the unscored y* check carries a Jensen bias of about +0.44 in y, which is the whole size of the C2 gap it is read as corroborating. Nothing here moves 4.2665 to 2, no rung rises, and all three notes stay HELD. | Z2 | [redteam-0830-zone.md](history/staging/redteam-0830-zone.md) |\n| `Q-redteam-0904-argmax` | ANSWERED | Does measure-0904-argmax.md survive an adversarial re-derivation of its positions, its congruence null, its residue chi-square and its own pre-registration scoring? | Every positional number in the note reproduces exactly on an independent fold-replication engine at x = 11..31, including the argmax lists, m(x), the top-K sizes and components, the per-prime pair counts, the tail counts and the F6 drops, so the note's data survive. What does not survive is three things and the largest is the null: two random TWIN SLOTS are congruent modulo W/p with probability (p-3)/(D-1), not 1/M, so the note's \"10^6 to 10^8 times the uniform null\" is inflated by 6.9 to 29.1 at these levels and should read 10^4 to 10^6, and the statistic is not a random variable at all but a deterministic function of each window (translate lemma, proven here and checked against every argmax pair count), which makes a null ratio a category error rather than a small correction; the note's own \"58 to 82 per cent are translates of another\" reports K - components when its wording needs K - isolated, which is 83 to 98 per cent; and the custody table in §2 quotes a code-sha256 (3019147f...) that the producer does not carry (d53a3fd1...), while §2's body and §5(5) still describe a widths annotation the rider says was already deleted. The scoring is faithful in verdict and wrong in arithmetic: F3 and F7 are scored at four levels, not five, so F7's falsifier fired at three scored levels and F3's tally is 2 of 4; the brief's \"three of eight\" does not exist on disk, both the ledger and §0 say four, and four is right. The exponent is untouched and nothing here is a route. | none | [redteam-0904-argmax.md](history/staging/redteam-0904-argmax.md) |\n| `Q-redteam-0904-floor-growth-2` | ANSWERED | Does the growth half of the adverse pointwise floor (Omega >> z^{16s/9}/ln^8 z from four-prime Rosser exit chains) survive a SECOND adversarial pass, and does a floor on the certificate at a CRT-planted window make REC(s,u0) false (a truth gap) or only unprovable by that certificate (a proof gap)? | SURVIVES, at the same rung and no higher: four new attacks and two unasked ones found no break, so the growth half stays DERIVED and red-teamed twice, which is two failed breaks on a derivation and not a proof; the proof-gap reading is REFUTED because REC is a statement about R_H, the remainder of the very certificate the floor bounds below, and the chain has no step where a certificate value must become a true remainder, so it is a truth gap for REC as the corpus states it; five corrections are owed to the record -- the REFUTED row is UNSCOPED and should read \"on the Rosser vector-sieve lattice at equal levels\" since only the Rosser instance is derived, the \"falsity beyond z ~ 5.6e31\" is an s = 2.698721 figure quoted without its s and the fitted crossing at the corpus's own measured family s = 3.0 is z ~ 10^15.3, the analytic p* window (4D^{1/27}, D^{1/9}/4) is neither necessary nor sufficient at reachable levels so the exact onset is 4.42e5 at s = 3.0 rather than the quoted 1.055e6, the four-prime construction has NO exit prime below z once s >= 7 so the first pass's \"8 beyond s = 5\" holds only on [5,7), and the first pass's escape-(a) density 1/W understates the planted class by the factor W/(n1n2) though the escape still fails by an exponential; the LP maximum 8s/9 is confirmed as an exact vertex and the corollary crossing reproduces 9beta2/16 to 4.4e-16, the pre-registered slope band held at a new s (top step 4.9025 at s = 3.0 against a model 4.8990), and no exponent moved. | 0 | [redteam-0904-floor-growth-2.md](history/staging/redteam-0904-floor-growth-2.md) |\n| `Q-redteam-0904-item0` | ANSWERED | Do the two HELD notes of 2026-09-04 on item 0, the second adversarial pass on the adverse floor's growth half and the L7 one-class-to-two-class transfer, survive an independent adversarial pass, and do the live-layer changes they propose survive verbatim? | Both notes SURVIVE at their own rungs and neither moves an exponent, but SIX of their proposed live-layer changes need rewording and two of their supporting derivations are wrong; every load-bearing number reproduces on independent code (18 of 18 A1A2 cells digit for digit, the LP maximum 8s/9 at 0 deviations of 16 with residual 4.441e-16, the crossing 2.399878284834 against 9beta2/16 at 1.097e-13, the fitted C = 1.1206e-4 and the s = 3.0 crossing 10^15.30, the onsets 4.390e5 / 1.111e6 / 1.860e6, ln(n1n2) = 7.4993e7, and the L7 CRT counts EQUAL at x = 7, 11, 13), so the truth-gap reading of REC is CONFIRMED and the growth half stays DERIVED and red-teamed twice, not proven; what does not survive is the scoping, the exit-window and the price wording: the proposed clause \"at equal levels D1 = D2 = z^s\" is NARROWER than the derivation supports, since over 1643 admissible upper-and-lower level splits the floor beats the decoupled window at every cell by at least 0.644444, so no level split escapes and the sibling rider \"asymmetric levels give 8s1/9 + 8s2/9 with s1 + s2 pinned\" is REFUTED as written (it holds only while both s_i <= 3); the record's z ~ 5.6e31 is u0-specific as well as s-specific (10^31.68 at u0 = 4.2165 against 10^35.36 at u0 = beta2, same s), so replacing it with a beta2-convention 10^15.30 mixes two conventions; the onset correction is right numerically and wrong in wording, since at the record's own s = 2.698721 the exact onset is 1.875e6, LATER than the quoted analytic 1.055e6, not earlier; the escape-(a) correction is right in substance but its \"(A1A2)^2 / (2 n1n2)\" is a LOWER bound on the split's contribution, and the two-sided version through lambda+(n) <= 2^omega(n) reads 10^{-3.004323e+7} against B ~ 10^{10.1}, still no contradiction; and on the L7 side the union-bound argument and the CRT count are CONFIRMED while the coupled vector-sieve price 2(1 + sqrt e) = 5.297442541400 is the FORCED-equal-level constant, the corpus's live figure being K_BF = 5.158064680330, reproduced here to twelve digits at (a, b) = (2.229949, 2.928115), and the sieve-on-holes is the vector sieve only after the Ford-Halberstam substitution step that sift-limit-attack.md 7b(1b) already owns; the \"no third mechanism excluded\" line is honest but incomplete, since weighted sieves with Chen switching are already priced and closed at sift-limit-attack.md 4.2; scope of death gains one row, L7's mechanism 2, which the growth note's own section 10 calls untouched while its sibling calls it dead; no exponent moved. | 0 | [redteam-0904-item0.md](history/staging/redteam-0904-item0.md) |\n| `Q-redteam-0904-r0-extension` | ANSWERED | Do the seven load-bearing claims of derive-0904-r0-extension.md survive an adversarial re-derivation against Tao's own text, and do its proposed live-layer changes survive? | Six of seven survive at their stated rung and one is refuted: Proposition A, the scope slip, row e'' and the equivariance transfer are CONFIRMED (the slip is strengthened, since Tao's own Example 2 is the target note's missing one-coordinate witness), Propositions B and D are WEAKENED (B's stated mechanism proves too much and its proposed insertion drops the qualifier that saves it; D's \"same trigger\" is near-definitional and its causal reading of the exponent band does not hold), and the claim that no corpus artifact certifies the window-count variance at width p'^2 is REFUTED by research/06-variance-theorem.js, which computes exactly that, brute-force verified at two levels; separately, EXEMPT throughout means \"Claim 1's H5 fails\", which is not the parity statement wall-note Face 1 is priced against, and the note's proposed live-layer text carries no H6 conditional. | Z2 | [redteam-0904-r0-extension.md](history/staging/redteam-0904-r0-extension.md) |\n| `Q-redteam-0904-sifting-limit` | ANSWERED | Do recon-0904-sifting-limit-floor.md's five claims survive adversarial re-derivation at the page, and in particular is the 4.26645 cap a method artefact at rung MEASURED? | Four of five claims survive with corrections and the headline does not. Claim d is REFUTED as stated on four grounds, each sufficient: the level-D LP fixes one omega-profile out of a class Ford defines by a ONE-SIDED inequality, and inside the classical (Omega_2(kappa,L)) budget a legal profile at x = 13 gives a calibrated reading of 5.0113, above beta_2 = 4.26645, which fires the target note's own pre-registered refutation of its floor; the calibration is a 1.72 multiplicative correction fitted at one point and it misses the second proven point beta(1/2) = 1 by 66 to 82 per cent, two and a half times the 28.7 per cent effect the headline rests on; the pooled 3.3152 averages four statistics of which only s* is the definitional analogue of beta, and that route reads 3.4678 here and 3.9487 at x = 43 in the corpus's own data, still climbing at +0.4297 per ln x with the fitted line reaching 4.26645 at x = 104; and 3.3152 is 22.2961 per cent below 4.26645 rather than the 18 per cent the note prints. Claim a is CONFIRMED with a second source off the OCR channel (Ford 2023 p. 37, \"Some authors, e.g. Selberg, refer to 1/beta(kappa) as the sieve limit\"), one page correction owed (Halberstam is p. 117, not p. 116). Claim b is CONFIRMED and strengthened: Brady's class is stated on his p. 10 and IS the axiom-only interval class Face 4 needs, his v_R table is reproduced here, and the identity v_{2d+2} = v_{2d+1} his proof asserts is confirmed at d = 0, 1, 2, so 1.819592 rests on proved facts alone. Claim c is CONFIRMED but demoted: beta(2) >= beta(1) = 2 is two lines from Ford's own one-sided (Omega) plus his own beta(1) >= 2, so the padding construction is correct and unnecessary. Of the eight proposed live-layer changes, two survive verbatim, five need rewording and one is refuted; the new SEARCH-CONVENTIONS row adds exactly three clearing phrases and changes nothing for any existing absence claim. | 0 | [redteam-0904-sifting-limit.md](history/staging/redteam-0904-sifting-limit.md) |\n| `Q-redteam-at37-score` | ANSWERED | Does the @37 scoring record survive an adversarial pass on its prereg re-score, its independence claim, its interpretation table and the cofactor extrapolation? | The empty-survivor scoring holds - every registered figure reproduces from the committed prereg text and the embedded census block, and the four skipped reference-level gates were run here and all pass - with two findings against the held report, neither touching the verdict: the one-level-drop figure is 8.2x rather than 4x, which strengthens the reversal claim, and the cofactor-one surplus sentence oversells. | none | [redteam-at37-score.md](history/staging/redteam-at37-score.md) |\n| `Q-redteam-zonegap-foundation` | ANSWERED | Do natal-onset-01, zonegap-01 and zonegap-prior-art, the three artifacts the Z2 pivot builds on, survive an adversarial pass? | The foundation HOLDS: all four natal-onset claims CONFIRMED, zonegap-01 confirmed at every reachable point by independent code using a different sieve and a different max-gap algorithm, and the prior-art spot checks all confirmed at page image; two prose defects found, both WEAKENED and neither refuted. | none | [redteam-zonegap-foundation.md](history/staging/redteam-zonegap-foundation.md) |\n| `Q-refuted-audit-0829-1` | ANSWERED | Do the closures recorded in REFUTED.md rows 1 to 17 survive re-derivation against the object definitions, the producers' embedded output and the corpus corrections through 2026-08-29? | Ten of the seventeen rows stand as written and seven are SOUND-NARROWER on wording that claims more than the record carries; no row is WEAKENED or UNSOUND, no route reopens, and the sharpest defect is row 16 crediting a published lemma whose own hypothesis excludes this corpus's operative range. | none | [refuted-audit-0829-1.md](history/staging/refuted-audit-0829-1.md) |\n| `Q-refuted-audit-0829-2` | ANSWERED | Do the closures recorded in REFUTED.md rows 17 to 34 survive re-derivation against the object definitions, the producers' embedded output, the 2026-08-29 corrections, and their own quantifiers? | All eighteen closures stand and none reopens; nine rows are SOUND and nine are SOUND-NARROWER, the worst being row 53's \"the search is finished\", which its own record contradicts in two places, and the others splitting into three classes: a mechanism clause that covers half its route (rows 47, 58), a universal quantifier wider than the sweep behind it (rows 49, 59), and a measured number carried without its calibration or its unit (rows 43, 46, 60). | none | [refuted-audit-0829-2.md](history/staging/refuted-audit-0829-2.md) |\n| `Q-refuted-audit-0829-3` | ANSWERED | Do the closure arguments behind REFUTED.md rows 34 to 51 (the greedy oracle through the bounded-differences family) hold when re-derived against the object definitions, the producers' embedded OUTPUT blocks, and the corpus corrections landed through 2026-08-29? | The band holds: 13 of 18 rows SOUND and 5 SOUND-NARROWER, no WEAKENED and no UNSOUND, so no route reopens; the worst finding is a factual inversion in the anchored-delta row, which asserts that delta exceeds the forced scale at 2 of 7 levels when the record's own table has \\|delta\\| < F at 7 of 7, and the same wording has already propagated into a second note. | none | [refuted-audit-0829-3.md](history/staging/refuted-audit-0829-3.md) |\n| `Q-refuted-audit-0829-4` | ANSWERED | Do the closures recorded in REFUTED.md rows 51 to 67 hold when the record is opened and the closing mechanism re-derived against today's corrected corpus? | All seventeen closures stand: 8 SOUND and 9 SOUND-NARROWER, zero WEAKENED and zero UNSOUND, no route reopens; the narrowings are wording that claims more than the record carries, worst of them row 67, whose closing clause quotes a section its own record headed POST HOC and carrying no verdict after the pre-registered primary went VOID on its matched control. | none | [refuted-audit-0829-4.md](history/staging/refuted-audit-0829-4.md) |\n| `Q-refuted-index` | SUPERSEDED | Where do recorded citations to the closed-route index resolve? | The current closed-route records are in OUTCOMES.md. This file is only a compatibility pointer for citations in recorded script output; it contains no separate outcome register. | none | [REFUTED.md](REFUTED.md) |\n| `Q-registry-glossary` | ANSWERED | What does each word of the programme mean, one term per object? | The vocabulary registry; adopted terms with dates, the anchored layer, and the calibrated entries (Var/E, hyperuniformity, the freshness dimension count) as corrected on 2026-08-28. | none | [GLOSSARY.md](GLOSSARY.md) |\n| `Q-registry-outcomes` | ANSWERED | What has each research approach established, where has it failed or stopped, and what evidence or changed input permits reuse or a further attempt? | One outcome register organized by research question and approach. Each record preserves its calibration, established result, limitation or failed step, evidence and reuse or revisit conditions. The closed-route table is part of this register. Git owns revision and authorship history; an open estimate is not a refuted claim. | none | [OUTCOMES.md](OUTCOMES.md) |\n| `Q-registry-research-readme` | ANSWERED | Which file in research/ answers which question, and in what order should a reader open them? | Router only: state lives in ../README.md section Status and G2-STATE.md section 0, the target in ZONE-POSTULATE.md, the queue in ../TODO.md; this file holds no mathematics and no summary of the programme. | none | [README.md](README.md) |\n| `Q-research-execution` | ANSWERED | How should agents use the integrated returns, avoid repeated work and select the next bounded research obligation? | The second dispatch from 1285d47 closed at 46fa948 and was independently reviewed on 2026-09-09. A/A2/B/C/D/E and V/W returns are present and integrated at their owning scopes. A2's corrected Type I estimate is accepted; D's fourth residual cut is retained and its remaining moment saving corrected to 7/200. C's low nonzero modes and E's aggregate scope are corrected. No new assignment is started by this integration; next obligations are candidates, not running work. Twin-prime infinitude and every sufficient signed margin remain OPEN. | C | [RESEARCH-EXECUTION.md](RESEARCH-EXECUTION.md) |\n| `Q-research-handoff` | ANSWERED | What must an incoming research agent understand, verify and return before its work can advance the current twin-prime argument? | Current handoff after the 2026-09-09 independent review of the dispatch ending at 46fa948. The full residual has four simultaneous complement conditions after D's regional estimate. A's centered truncation and A2's repaired low Type I estimate give the alternative S=C2*x+B+O_A(x/log^A x). B and all sufficient signed margins remain OPEN. The C3 absolute bound, family identities and scoped C/E failures retain their owning hypotheses. Execution is owned by RESEARCH-EXECUTION.md. | C | [RESEARCH-HANDOFF.md](RESEARCH-HANDOFF.md) |\n| `Q-research-round-validation` | ANSWERED | Which submitted results from lanes A, A2, B, C, D, E, V and W survive direct review, and what can be integrated or used to choose the next attempt? | Reviewed incoming commits 07ab47f through 46fa948 on 2026-09-09. A's truncation and A2's repaired low Type I estimate are accepted with bookkeeping corrections. B's ordinary-BV family identity survives; its uniform Dickman constant and complement condition are repaired. C's norm obstruction survives on all smooth inputs, but low nonzero Fourier modes are also 1-bounded. D's block estimate and fourth residual cut survive; its next moment saving is 7/200, not 17/200. E's rough-product distribution and aggregate constant 4 are accepted at the stated Wu uniformity reading; rational certificates close the two displayed tests for every fixed u>4. W remains OCR-only at the original 1974 theorem page. All sufficient twin-prime margins remain OPEN. | C | [research-round-validation.md](research-round-validation.md) |\n| `Q-residual-coverage` | ANSWERED | What portion of the full residual is controlled with uniform margins, and can the exceptional first branch improve that coverage rather than just a regional corner? | The first-branch and prime-free moments remove the exceptional norm condition. Full rectangles are controlled when delta+nu<19/25 or 5delta+2nu<123/50. Uniform twists justify exact coupled cuts: every fixed de<=x^theta with theta<19/25, and d^5*e^2<=x^lambda with lambda<123/50, as well as their union, have arbitrary fixed logarithmic savings. A concrete remaining endpoint sum has de>floor(x^(3/4)) and d^5*e^2>floor(x^(49/20)). Its twin margin is OPEN. The right zero-frequency budget, after an extra Cauchy inequality, limits the uniform product range; the left cross moment limits the other edge. Finite checks validate identities and masks, not asymptotic rates. | C | [residual-coverage.md](residual-coverage.md) |\n| `Q-review-0905` | ANSWERED | Does the present programme justify its latest stopping decision, and what is the next useful campaign toward infinitely many twin primes? | The computational checks pass and the DHR application survives this reading, but several summaries overstate the obstruction or misstate an implication. Recommend repairing those claims, retaining the fold framework, and testing it against Chen on long intervals before attempting a specifically stated parity-sensitive estimate. No proof of twin primes or improvement of an exponent is supplied. | none | [review-0905.md](history/staging/review-0905.md) |\n| `Q-review-request-0906` | ANSWERED | Which claims of the arithmetic campaign should an independent reviewer check, in what order, against which records, and what must the review return? | Completed review specification at the bounded scope recorded in handoff-review-0906.md and reports 20 and 21, with the subsequent round reviewed in round-review-0906.md. The dependency list records questions at dispatch, not current unfinished assignments. Imported proofs retain their review limits and the twin margin remains OPEN. Current assignments are in RESEARCH-EXECUTION.md. | C | [REVIEW-REQUEST.md](REVIEW-REQUEST.md) |\n| `Q-review-request-0907` | ANSWERED | Which claims of the 2026-09-07 session should an independent math agent check, in what order, against which records, and what must the review return? | Reviewed 2026-09-08 by an outside reader (history/reviews-0907/10): ranked claims 1 (conditional on the unread 1974 page), 2, 4, 5, 6 verified within stated scope; claim 3 verified with its quoted tolerances corrected (max deviation 1.8e-4, not 1e-4 or 1e-5); the Corollary 1 slip sharpened (fails for every representative other than 1, and mis-signs even then); ASSUMED items 4 and 6 discharged, 2 partially, 1, 3, 5 not. Twin-prime infinitude and every sufficient signed margin remain OPEN. Ranked below: the §6.2 demotion in the two-class manuscript (a change to a proof's dependency), the D_y identity reading (a change to what a census can show), the Erdős #687 attribution, and the two measurement artifacts. Twin-prime infinitude and every sufficient signed margin remain OPEN. | Z0 | [review-request-0907.md](review-request-0907.md) |\n| `Q-rho-maximal-law` | PARTIAL | What is the rho maximal law, what is its weakest sufficient form against the crossing, and where does it sit against print? | The pricing lemma turns any RML(alpha) with alpha < beta_2 = 4.26645 into G2(z#) << z^alpha ln^2 z, every step proven except the law itself; the sufficiency curve lambda_max falls from 2.31949 at z = 13 to 1.78446 at z = 47, the weakest measured point, and whether it ever reaches zero is model-dependent and undecided, so nothing here is an unconditional exponent. | 0 | [rho-exact-z31-01.md](history/staging/rho-exact-z31-01.md), [rho-maximal-law.md](history/staging/rho-maximal-law.md) |\n| `Q-rho-sup-z41-0830` | PARTIAL | What is the exact sup over all positions of the centred sawtooth remainder at z = 41 (period 7.42e12), and of R_H at H = z^3 and z^4, and what does the eighth exact point do to the truth's slope and to the u0 = 3 form of REC(s, u0)? | Not run in full; the exact z = 41 point prices at 4.8 to 5.4 h on this machine from measured per-position costs (naive 69.8, table 23.5, table-plus-windows 36.6 ns per worker; fleet 4.52 ns of wall at z = 41), above the 3.5 h rule, so what exists is a new engine (a PROVEN reflection that halves the walk, a P(29) periodic table worth 2.9x, per-block exact re-seeding) reproducing every cited exact sup at z = 13..37 digit for digit, sup\\|R_H\\| at H = z^3 walked for the first time at z = 19..37 (F3 = 26.4 to 35.9, the factor 2 was 1.5 to 2.2x loose), a sealed pre-registration (forecast sup 60.07, band [47.25, 76.37], kill needs sup\\|R_H3\\| >= 1807.417), one pilot twelfth giving lower bounds sup\\|rho~\\|(41) >= 70.651250 and sup\\|R_H3\\| >= 64.416936, and an eleven-segment plan for the box; no bound-and-prune exists on three routes; nothing asymptotic can move whatever the point turns out to be. | 0 | [measure-0830-rho-sup-z41.md](history/staging/measure-0830-rho-sup-z41.md) |\n| `Q-rho2-bound` | ANSWERED | Is there an analytic upper bound on (z) from its proven closed form, and does it matter for RML? | Already proven 2026-08-21 (attack-rhoms-01); the constant is now named, 170.88 z^{2s} ln^8 z; Chebyshev off any second moment diverges from RML (the true C_L = ms = 1 floor clears at z = 41 and 43 and misses by 2.155x at z = 47), so it is an ingredient, not a route. | 0 | [attack-rhoms-01.md](history/staging/attack-rhoms-01.md), [rho2-analytic-bound.md](history/staging/rho2-analytic-bound.md) |\n| `Q-rml-proof-0829n` | PARTIAL | Starting from Lemma V's PROVEN mean-square bound, what is the exact chain of implications to a two-class exponent below beta_2 = 4.26645, which single arrow is open, and does it close? | The chain from the proven mean square to an exponent below beta_2 has exactly one open arrow, the mean-square-to-sup recovery REC(s,u0): sup_x \\|R_H(x)\\| <= z^{u0/2 - eps} rms(R_H) at H = z^{u0} for one fixed u0 in (2, beta_2); every attempt here dies at a named place (term-by-term accounting is capped at 2s + o(1), the trivial-level exponent; position-union pays e^{theta(z)/q}; window smoothing and the P(y) lever move polylog only; the smooth-profile form is closed on hypothesis and priced above beta_2), the arrow is measured TRUE with certified margin z^1.72 to z^1.92 at u0 = 4 over z = 19..37 and the truth's slope 2.766 +/- 0.212 sits 5.8 se under u0 = 4 on seven points under one octave, so the failure is a proof gap at every computable z and undecided asymptotically; no exponent moved. | 0 | [attack-0829n-rml-proof.md](history/staging/attack-0829n-rml-proof.md) |\n| `Q-roughpair-error` | PARTIAL | How big is the empirical error of the rough-pair census, and is Z2 dead on the numbers? | Not dead on the numbers - the error sits below T at every one of 1,206 anchors, its scatter is sub-Poisson, its systematic part is 0.1% at the top band with the favourable sign and its exponent is 0.40 below the twin count's - but the same run moves the wall off the error term onto the depth, where the slack at the crossing is 1.056 and falling and the main term alone is 5.6 times the twin count at the sifting limit. | Z2 | [attack-roughpair-error.md](history/staging/attack-roughpair-error.md) |\n| `Q-roughpair-null` | ANSWERED | Does the independent-thinning null named in attack-roughpair-error.md's defects list return chi2/df = 1, and is the measured sub-Poisson dispersion of the rough-pair census error real or a normalisation artefact? | MEASURED, null-side, label (i), no bearing on the certificate: the independent-thinning null is binomial and returns 1 - p (0.8164 to 0.9808), not 1, so attack-roughpair-error.md's \"below 1 everywhere: sub-Poisson\" is WEAKENED and the registered F1 fires at u = 5; the deficit against the mean-matched null survives at pooled z = -5.87, -7.09, -11.39; and a CRT-exact null that only makes each prime's kill count exact in the window predicts 0.33 to 0.56, which the measured value EXCEEDS by 1.26 to 1.40, so D8 is interval-level in form, elementary in content, and not wall-relevant. | Z2 | [measure-roughpair-null-0829.md](history/staging/measure-roughpair-null-0829.md) |\n| `Q-round-review-0906` | ANSWERED | Which conclusions of the completed agent round survive review, and which corrections change the next research specification? | The fixed-band lift and continuous moving-window estimate survive the checked source interface. Interval stability additionally gives a dyadic scale-average logarithmic saving, so the blanket scale exclusion was too strong. The rate and missing prime-cofactor terms with s>1 or s'>1 still prevent a twin margin. Proper-prime-power branches already have a negligible bound on the fixed corner. The driver computes integer parity, not the CRT gcd partition; its total coefficient identities survive. Diagonal lower-bound, reachability and six-cut bookkeeping overclaims are corrected. No region, exact residual cut or twin lower bound changes. | C | [round-review-0906.md](round-review-0906.md) |\n| `Q-row11-closure` | CLOSED | Can the (1 - 1/e) greedy-coverage certificate of IMPORT-MAP row 11 ever fire? | No, and now on a producer rather than on prose: the map's paragraph-only pre-pricing reproduces exactly at all six figures it states and extends to the full ladder x = 5..79 with the certificate silent at every level under every constant that could be used, and the step from a density to an algorithm is proved in one line. | none | [row11-closure.md](history/staging/row11-closure.md) |\n| `Q-row11-closure-prereg` | OPEN | Does IMPORT-MAP row 11's (1 - 1/e) certificate reproduce, and does its test ever fire? | Pre-registration only, hand-written and committed before its producer existed: the claim being reproduced, what the producer must return, the pass criteria and the disclosed leaks are all fixed here, with the killing arithmetic still living only in prose. | none | [row11-closure-prereg.md](history/staging/row11-closure-prereg.md) |\n| `Q-row12-lonely-runner` | CLOSED | Does the lonely runner conjecture, or the Birkhoff and bounded-remainder branch, transfer to the Zone Postulate or to G2? | CLOSED WITH MECHANISM on two independent grounds, either sufficient: the general two-class problem is settled at the trivial bound, and the obstruction Tao names is our own configuration; the Birkhoff branch is subsumed and strictly worse from x = 13, and the row's payoff is a wall address rather than the published anchor the map priced. | none | [row12-recon.md](history/staging/row12-recon.md) |\n| `Q-row7-talagrand` | CLOSED | Does Talagrand's concentration on product spaces (IMPORT-MAP row 7) bound anything the corpus needs? | CLOSED WITH MECHANISM: the structural fit is better than the map wrote, since Theorem 8 needs no dependence structure and the shared-draw mechanism that closed rows 3, 4 and 10 does not close this one, but the per-coordinate effect c exceeds the largest tolerable value by a factor that DIVERGES (174x at @11 to 70,576x at @23), and the target hole is on the wrong side of the ensemble/anchor divide, so even a perfect bound would be inert. | none | [row7-recon.md](history/staging/row7-recon.md) |\n| `Q-scanstat-t37` | ANSWERED | What does the seventh exact level T37 do to the linear-in-ln D rule for H, and to the sqrt(m) refutation? | The sealed prediction H*5(T37) = 0.381254, band [0.369866, 0.392641], misses the measured 0.356548 +/- 0.0068 by 3.63 of its own s.e., so per the seal the linear form was a coincidence of a short ladder; the exponent series still rises but is concave in ln D, and G2(37#) is certified exhaustively over 217,929,355,875 slots. | none | [scanstat-t37.md](history/staging/scanstat-t37.md) |\n| `Q-scanstat-t37-prereg` | OPEN | What is the moving-sum exponent H at T_37, predicted before any producer for the pass existed? | Pre-registration only, sealed and committed alone: the prediction band, the criterion, the weak secondaries, the custody gates the producer must pass before reporting and the compute plan are fixed, and T_31 is explicitly excluded as another pre-registration's verdict. | none | [scanstat-t37-prereg.md](history/staging/scanstat-t37-prereg.md) |\n| `Q-scanstat2` | ANSWERED | Does the scan-statistic exponent law survive a sixth exact level, and is the tail factor the extremal index? | Both follow-ups come back negative: T_31 missed the pre-registered exponent rule from outside its own 95 per cent band, so the linear-in-ln D law describes five points and is not a law, and the tail factor is not the extremal index, its correction pointing the wrong way at seven of nine tested places; the sixth level confirms the kill on sqrt(m) harder, at H = 0.3460 +/- 0.0068 against 0.5. | none | [scanstat2.md](history/staging/scanstat2.md) |\n| `Q-scanstat2-prereg` | CLOSED | Does the linear-in-ln D exponent rule predict H(T31), and is the tail factor the extremal index? | Sealed and committed alone before any producer for the pass was written; scored in scanstat2.md, where both follow-ups come back negative: T31 missed the pre-registered band from outside, so the linear law describes five points and is not a law, and the tail factor is not the extremal index, with the correction pointing the wrong way at seven of nine. | none | [scanstat2-prereg.md](history/staging/scanstat2-prereg.md) |\n| `Q-search-conventions` | ANSWERED | In whose vocabulary do these objects live, and which prior-art searches have already been run in the owning convention? | The owning conventions are tabulated by object and the searches already run are listed so they are not repeated; the rule stands that a clean negative in our own wording proves nothing, and section 5 keeps what is still uncovered separate from what is covered. | none | [SEARCH-CONVENTIONS.md](SEARCH-CONVENTIONS.md) |\n| `Q-self-contradiction` | ANSWERED | Which documents in the corpus contradict themselves? | Twenty findings, two rated HIGH because they change what somebody does: theta-ladder.md's retracted crossing still asserted unmarked in three further sections, and G2-STATE.md's confirmed G2(41#) = 546 against three sections still carrying twelve terms; eight more change a number somebody quotes. | none | [audit-self-contradiction.md](history/staging/audit-self-contradiction.md) |\n| `Q-session-0828` | ANSWERED | What did the 2026-08-28 wave establish? | 21 agents, zero routes, four TODO items closed or answered, one HELD headline (Var/E = 0.45546, heuristic). | none | [session-0828-summary.md](history/staging/session-0828-summary.md) |\n| `Q-session-0829` | ANSWERED | What did the 2026-08-29 session (the Z/G object reads, the measurement wave, the red teams, the refuted-claims audit) establish, and what does it leave open? | Nothing moved an exponent or opened a route; the map moved: a Z2-STATE draft exists, both objects carry labelled legal-open-sets, the Gap Reformulation's discarded origin is proven not needed for the implication and measured worth one unit of exponent against a deficit of 2.2665, all 67 REFUTED rows re-derived with none reopening and 27 clauses corrected, and about forty live-layer and HELD-note defects were applied after verification. | none | [session-0829-summary.md](history/staging/session-0829-summary.md) |\n| `Q-session-0830-summary` | ANSWERED | What did the 2026-08-30 overnight campaign (rolling waves of up to ten agents on the queue rewritten after the 08-29 evening wave) change, and what is still open? | Neither exponent moved; twenty-one staging notes landed, all HELD; four routes closed (the skeleton door, the K*-product and fold-composition doubling bridges, the deep-ladder Buchstab transfer), TODO item 4 deleted and items D and 8 parked, the RML route carries an adverse derived floor whose growth law survived one sealed blind test and awaits a red team only Chris can call, Z2's fifth decade rejected the exact-Mertens main term for the omega-form crossing at 13 to 24 se, three record defects were verified on independent code and applied as riders, and a coherence pass corrected 27 lags in the live layer. | none | [session-0830-summary.md](history/staging/session-0830-summary.md) |\n| `Q-session-0904-summary` | ANSWERED | What did the 2026-09-04 wave (four Opus attacks on wall-facing questions, one orchestrator note, four Opus red teams, all verdicts applied) change, and what is still open? | Neither exponent moved; item 0's growth half survived a second adversarial pass so the route is a truth gap at rung derived-and-red-teamed-twice; Face 4's \"no lower bound on the kappa = 2 sifting limit is known\" was a convention failure and published floors at or below 2 are now cited, while the recon's headline that the cap is a method artefact was refuted by its red team; killer 2's coordinate is measured for the first time (argmax mirror-invariant, zero congruence pairs from x = 23, forced) after the multiplicity half turned out to be on the ladder already; no piece of R0 is both legal and parity-exempt with content; L7 is not a transfer; about thirty live-layer sentences corrected across seven files. | none | [session-0904-summary.md](history/staging/session-0904-summary.md) |\n| `Q-shadow-amplitude` | MIXED (shadow-amplitude-prereg.md: OPEN; shadow-amplitude.md: PARTIAL) | Where does the kill shadow's drift amplitude come from, and does the record's counting floor explain it? | The finite-y correction is an identity with no free parameter and both measurement routes agree 10 of 10, but the record's own counting floor is four to six times too small and its candidate explanation is the wrong half, so the label stays PARTIALLY EXPLAINED. | 5 (retired) | [shadow-amplitude-prereg.md](history/staging/shadow-amplitude-prereg.md), [shadow-amplitude.md](history/staging/shadow-amplitude.md) |\n| `Q-shadow-buchstab` | ANSWERED | Is the kill shadow the band-averaged pair-Buchstab integral? | SURVIVES WITH CORRECTIONS, and under the record's own pre-registration the verdict is SHAPE-ONLY rather than DERIVED, since y ~ 1000 misses D1 at 1.49x tolerance; the drift's amplitude is off by about 2.6x, the coefficient has the closed form 2 - 1/ln 2 = 0.5573049591 that the record missed, and anchored-windows section 5 reproduces 32 of 32 from an instrument sharing no code. | none | [shadow-buchstab.md](history/staging/shadow-buchstab.md) |\n| `Q-shadow-prereg` | ANSWERED | Is the kill shadow's 0.85 the band-average of the Unification-Law survival curve over the post-crystallization window? | Scored in shadow-buchstab.md: SHAPE-ONLY under the original y >= 997 rule; D3 passes in the reported ten clusters but D1 fails near y = 1000 at 1.49 times the 0.011 tolerance. Later finite-y normalisation and counting-floor corrections do not promote this verdict. The pair-Buchstab identification remains conjectural; the pre-registration body is preserved. | 5 (retired) | [shadow-prereg.md](history/staging/shadow-prereg.md) |\n| `Q-sharp-corner-transition` | ANSWERED | What is the energy of the complete sharp corner coefficient, and can the smoothed estimate be transferred through a negligible L2 transition? | DERIVED using named analytic inputs: for each fixed 00 both sharp squared norms and sharp-minus-smoothed squared norms are Theta_eta(x log^2 x) on the actual dyadic intervals. Thus an O_eta(x log x) sharp squared norm or negligible L2 transition fails in that range. Signed transition correlations and the global complement remain OPEN. No region, exact residual cut or twin margin changes. | C | [sharp-corner-transition.md](sharp-corner-transition.md) |\n| `Q-sharp-sieve-range` | CLOSED | Do the sharp sieve functions (Jurkat-Richert, DHR) make the two empty certificate-engine theorems non-empty at run levels? | NO at finite level: DH Thm 9.1 carries no written constant and the crude fundamental lemma is strictly better; as limit statements kappa=1 is first non-empty @37 (a 19.8-wide bracket; @53 is the first narrow one, 1.656) and kappa=2 @23. | 8 | [thm-sharp-sieve-range.md](history/staging/thm-sharp-sieve-range.md) |\n| `Q-shifted-prime-decomposition` | ANSWERED | Does decomposing Lambda(dk-2) give a provable saving on any part of the actual shifted-prime sum, and what exact arithmetic remains outside the imported hypotheses? | Both second Type I terms are O_H(x/log^H x) by classical Mobius BV. The residual is an explicit weighted sum over dk-ev=2, equivalently an average of two-linear-form Mobius correlations with growing coefficients and possibly one-point intervals. Its required one-sided improvement is OPEN. No twin lower bound or novelty is claimed. | C | [shifted-prime-decomposition.md](shifted-prime-decomposition.md) |\n| `Q-shifted-prime-mobius-sums` | ANSWERED | At reachable x, do the shifted-prime Mobius and Liouville sums, the cleanest instance of the parity input the twin reduction lacks, show any size or sign structure that a random-sign model does not, and how loose is the trivial bound on M(x) used for the centered tolerance? | MEASURED to x=2^38 (10.9e9 primes). All four sums sit at random-sign size: \\|U\\|/control rms at most 2.8 at any j, slopes 0.28 to 0.65 against the control's 0.43 to 0.47 with per-draw spread 0.19 to 0.30; the pre-registered structure falsifier did not fire. M(x)/x is at most 8.8e-5 in magnitude for j>=29 against the trivial bound 0.374, so the -4x/25 tolerance in moving-cutoff-parity is loose by four orders at these scales; a proof still needs a bound on M, which is the same parity object. The squarefree density of p+2 among primes is 0.747911 at 2^38 against 2*Artin = 0.7479116. pi(2^j) matches OEIS A007053 at every j. Nothing here bears on the asymptotic conjecture. | C | [shifted-prime-mobius-sums.md](shifted-prime-mobius-sums.md) |\n| `Q-sift-limit-discards` | PARTIAL | Where does the dimension-2 sieve discard our structure, and can any of it re-enter to beat beta2 = 4.2665? | Every asset checked against the five discard points has no known consumer and no entry point, and EH and GRH change nothing here; Lemma V's mean-square form is PROVED and hands back a sup bound, the strata are self-similar and it still does not close, L has no combination law of its own, and the 529 covering route is closed rather than unfinished. | none | [sift-limit-attack.md](sift-limit-attack.md) |\n| `Q-sigma31-calibration` | ANSWERED | Is the sigma behind the @31 X-channel detection calibrated at @31 itself? | Calibrated at its own level for the first time: seven known-truth control draws give sigma_true/sigma_reported = 1.127 at the point, 95 percent bracket [0.745, 2.293] (pooled with the earlier draws, [0.772, 1.664]), which restates the detection at z = -2.06 under the point calibration and closes both T2.b findings; the detection weakens rather than dies. | none | [attack-sigma31-01.md](history/staging/attack-sigma31-01.md) |\n| `Q-signed-divisor-grouping` | ANSWERED | Can grouping different fibers while retaining their Mobius signs control an explicit part of R, and what signed error remains after that grouping? | For every fixed H>0 the actual remainder restricted to de<=x^(7/10) is O_H(x/log^H x), although each sign's mass there is at least c*x*log(x) eventually. This follows from a written classical-input derivation, with finite algebra and archived-factor checks. The remaining de>x^(7/10) contribution reduces to an explicit weighted CRT endpoint discrepancy whose required one-sided improvement is OPEN. | C | [signed-divisor-grouping.md](signed-divisor-grouping.md) |\n| `Q-signed-moment` | PARTIAL | Is there an argument for the block that does not pay sqrt(M) at the first Cauchy inequality or that extracts cancellation from the R=0 class, and what are its budgets at the corner a=b=1 and at the target box (delta,nu)=(8/25,9/20)? | The true diagonal has an upper bound x^(1+o(1)) on the transition band, not a uniform nonzero lower bound. Lemma A controls only u1=u2,h1=h2; unequal proportional R=0 pairs remain outside it. Lemma B and the now-priced joint Cauchy arrangement add no region. The former general Holder floor is valid only under additional coefficient assumptions, not for arbitrary sparse coefficients. Conditional off-diagonal budgets and the random-matrix ceiling remain conditional and heuristic. No necessity of using both signs, full-corner estimate or sufficient twin margin is established. | C | [signed-moment.md](signed-moment.md) |\n| `Q-single-alignment` | CLOSED | Does the head's single-alignment fold recursion for M(x, x^3) give a proven-shaped handle on the per-fold multiplier that the max-over-alignments recursion lacked? | The answer splits: the multiplier IS different in shape, measured - exactly 1 at 225 of 240 folds from x = 53, total spend 1.09 nats against a tile-shaped ladder's 7.12, measured M(1613) = 2220 against a tile-shaped 3.7e5 - but the route to a growth law through the recursion closes anyway, because the growth is initiated by the window's expansion into fresh ground, a boundary term that is the localized gap problem re-posed and that no fold reaches. | 0d (retired) | [localized-single-alignment.md](localized-single-alignment.md) |\n| `Q-singleton-fiber-audit` | ANSWERED | Can the one-point fibers of the coupled remainder be discarded or controlled in absolute value at scale x, and what do the actual weights and archived intervals show? | The grouped coefficient is zero whenever either integer is prime. Each sign's ungrouped singleton mass is at least c*x*log(x) eventually for an absolute c>0, by a written derivation from named classical inputs. Finite full-interval and archived-prefix checks validate the partition. The signed singleton and longer-fiber contributions remain OPEN; no twin lower bound or novelty is claimed. | C | [singleton-fiber-audit.md](singleton-fiber-audit.md) |\n| `Q-skeleton-bound` | PARTIAL | Does the aggregate 30-skeleton bound hold, and can it be certified at every level? | Certified as an exact BigInt inequality at six levels @11 through @29, margins 0.287 to 0.406, with the Skeleton Collapse Theorem proven for all x and all q and an exact exception criterion; the all-x form is open and its blocking term is prime-equidistribution of window residues rather than branch algebra. | none | [natal-cap-30-skeleton-bound.md](natal-cap-30-skeleton-bound.md) |\n| `Q-skeleton-decide-0830` | ANSWERED | Should TODO item 4, \"Skeleton Equidistribution: restate or demote\", be restated around the modulus-W mass or demoted off the board, and what exactly is banked either way? | DEMOTE. Over every scour prime the branches on which the door is a fixed-modulus question carry 9.2, -0.9, 0.2 and 0.5 percent of the skeleton at @13, @17, @19, @23 (the -10.8 and 5.5 percent on record were 9 and 2 percent subsamples), so the door as named removes at most 0.0102 from a G30_agg whose open part is 0.094 to 0.126; on the open side the phase never wraps and no equidistribution statement remains, only the inequality; nothing on the live board consumes G30_agg < 1/2; no first move exists that is not already ANSWERED. Banked regardless: the Skeleton Collapse Theorem (PROVEN, all x, all q) and G30_agg < 1/2 CERTIFIED at six levels @11..@29. | 4 (retired) | [decide-0830-skeleton-door.md](history/staging/decide-0830-skeleton-door.md) |\n| `Q-skeleton-door` | ANSWERED | Is the Skeleton Equidistribution Conjecture the blocker on the anchored calm? | It is not the blocker as far as the door can be seen: Theorem A (Trapezoid Cancellation) is proven for all x, q and branches, @29 is certified as an exact integer inequality at G30_agg = 0.1176 with margin 0.3824 over 7,863 scour primes, and the decay-law shortcut is REFUTED, the six levels being flat within their own spread with every fit made strictly worse by adding @29. | 4 (retired) | [natal-cap-36-skeleton-door.md](natal-cap-36-skeleton-door.md) |\n| `Q-small-divisor-kernel` | ANSWERED | Does reciprocity separate the j<=x^(1/20) kernel of grouped-divisor-moment (21) at delta=8/25, nu=9/20, and do the Duke-Friedlander-Iwaniec / Bettin-Chandee and Kuznetsov interfaces then supply the required saving? | The separation is exact and cheap: reciprocity splits index by index, the correction phase has sup norm and total variation O(A/(MN))=O(1/x) at this box, and Mellin separation of the endpoint weight costs x^epsilon with L1 mass min(1,Ax/(MN)), so the whole block reduces to a pure trilinear Kloosterman fraction with unimodular twists. The interfaces then fail by explicit amounts: Bettin-Chandee Theorem 1 gives block exponent 129/125, above the required 1 by 4/125 and above the classical 103/100; DFI (1.1) gives 1267/1200; every box Bettin-Chandee controls is already controlled, verified on 19005 rational boxes; the audit's spectral diagnostic factor is trivial for all common divisors up to x^(19/50). Closing this box inside the same interface needs the (M+N) exponent below 27/140 or the (AMN) exponent below 9/28. Target (21) and the global twin margin remain OPEN; nothing is added to the controlled region. | C | [small-divisor-kernel.md](small-divisor-kernel.md) |\n| `Q-smooth-sieve-literature` | PARTIAL | Which nearby published results should be imported instead of rediscovered, and do their methods give a more focused next question for the complete global remainder? | Existing sources supply the finite-difference mechanism, one-point concentration and quadratic profile optimization; shifted divisor-sum estimates admit fixed shift two under their own support and smoothness conditions. A derived application of corrected Henriot bounds gives small-prime mass O_sigma(delta^sigma x)+O_epsilon(x^(39/40+epsilon)), uniformly in delta for fixed 0floor(x^(77/100)) as a fourth simultaneous condition of W_dagger through the Perron machinery, changing only the summation domain of E_dagger. The target box (407/400), the corner, the uniform product threshold 19/25, the sign of E_dagger and the global twin margin are unchanged; the margin remains OPEN. | C | [structured-dispersion-estimate.md](structured-dispersion-estimate.md) |\n| `Q-supported-coefficient-dickman` | ANSWERED | Can the whole supported coefficient be priced using existing literature before enumerating its factor cells, and does the resulting separate-sign sieve estimate supply a positive twin margin? | DERIVED from classical inputs: at delta=1/100 the harmonic limit is H_delta=D(25/12)-1+E_delta with 0<=E_delta<=24/22!, hence -13/2, where I is the explicit ordered two-factor integral below. A three-prime left input and rough composite right input suffice; prime partners are subtracted using an upper sieve. The witness survives every fixed delta<1/50 and every averaging profile with the same plateaus. Consequently the negative-only consumer is false, and liminf Phat/(C2*x)>1/2. The signed twin margin remains OPEN; literature novelty is unestablished. | C | [switching-negative-mass.md](switching-negative-mass.md) |\n| `Q-tail-deficit-model` | ANSWERED | Does the exact compound-geometric thinning of the previous level's own gap histogram, with the qualifying-gap constraint g = 0, +/-2 (mod q) carried through the ladder, predict the tile's tail-deficit factor G2/(mbar ln D) at zero parameters, and does that make object-models-read-0829's D5 residue-level classification constructive rather than inferred? | NO. The zero-parameter CRT-constrained thinning predicts a tail HEAVIER than the tile's at every level, delta_M2 = 0.6461, 0.6746, 0.7021 against a measured 0.4577, 0.4463, 0.4791, so the pre-registered \"classification was wrong\" arm fires and D5 returns to OPEN with C3's constructive route REFUTED; the constraint is informative but small, carrying 4.0 to 10.0 percent of ln(null/truth) at the far tail, or 7.7 to 14.4 percent read against a rate-matched control, against the grain's ORDER at 39.4 to 54.6 percent at the deepest abscissa each level resolves; at shallow abscissae the ordering reverses (B 8.7 against C 4.8 at x = 23, u = 4), which the exact operator on a shuffled true grain confirms without any model (maximum 276, 354, 426 against the true 204, 258, 348), and the order effect is now localised (sections 7 and 9): a first-order Markov word from the true adjacent-pair statistics carries 32.3, 34.2 and 60.8 percent of ln(shuffled/truth) at the deepest abscissa of the three folds, and a SECOND-order word from the true adjacent-triple statistics carries 97.3, 97.9 and 102.6 percent there, r = 0.972, 1.061 and 1.000 on draw-mean maxima over 40, 20 and 10 draws, so the folded tile's tail is MEASURED to be a function of the previous grain's three-consecutive-gap statistics and of essentially nothing longer-range; that surrogate is seeded on the true previous grain at one fold, is not iterated, predicts no delta and does not revive C3, and the 348.0 sd 0.0 at 29->31 rests on ten draws. | 0 | [measure-tail-deficit-0829.md](history/staging/measure-tail-deficit-0829.md) |\n| `Q-tail-derivation-0830` | PARTIAL | Does the tail's measured law c = 0.7522 ln^2(p'^2) and its surplus derive, and which part of the coefficient is the tile's own (no prime input) against which part needs Hardy-Littlewood? | PARTIAL, kill clause fired on the coefficient: the ensemble object (the same functional averaged over all p# translates) derives exactly, E_all = R + 5/2 and E_odd = R + 3 with R = Sum g^2/2W, computed exact at x = 7..29 with every conditional the rough-origin candidate needs, and its Mertens constant e^{2gamma}/(8 C2) = 0.6007 is 1/(2 C2) times rho(2) = e^{2gamma}/4 by construction; every route from there to the anchored 0.7574 passes through rho(2)'s limit (the sharp form of Assumption A, algebraically equivalent to HL) and through the zone's gap shape CV^2 -> 1 (an HL statement), so the anchored coefficient is HL in disguise and nothing beyond HL is derived; the tile's own (1 + CV^2)/2 is 0.6306 -> 0.7532 over x = 7..29 and not settled; the record's 0.7522 = HL x 0.9644 x 1.0298 is two non-HL-sized factors cancelling at this height; the rough-origin candidate has an exact ensemble counterpart E_rc/E_cls = 1.0050 -> 1.0523, right sign, wrong size and trend against the anchored 1.0157, not identified; one number derives that the record measured: the class-null offset E_cls - R = 5.600 -> 6.034 exact against the record's 6.05, replacing both the prereg's 0.5 and the note's 7.5; and the corpus's \"R + 1/2\" is the other convention, under the tail's own the constants are 5/2 and 3. | Z4 | [attack-0830-tail-derivation.md](history/staging/attack-0830-tail-derivation.md) |\n| `Q-tail-maximal` | CLOSED | Is a tail-only maximal inequality a smaller ask than the full one, as attack-AB-bounded section 4.4 supposed? | No: the split is exact but is a reparametrisation rather than a localisation, the tail is maximal and saturates the Gaussian law, a fixed cut buys nothing asymptotically, and the tail is not a smaller ask but the whole ask. | none | [attack-tail-maximal.md](history/staging/attack-tail-maximal.md) |\n| `Q-tailcount-transport` | ANSWERED | Does the Tail-Count Transport survive an independent adversarial re-derivation? | The inequality, the certificates and the NO-CHAIN verdict all STAND on an implementation written from the operator definition, with a seventh fold added exact (31: 348 = 348); three corrections follow, the stated equivalence is false at fold 29, zero loss is exactness-by-relaxation rather than a tail fact, and the measured spends are 1, 1, 2, (1 or 2), 3, 2. | none | [verify-tailcount-transport.md](history/staging/verify-tailcount-transport.md) |\n| `Q-tau-repricing` | CLOSED | Does the tau(m) re-pricing of the x-free bound stand? | The separability claim is true and re-derived four ways, but the re-pricing substitutes one quantity for a different one: summed over the modulus set the tau(m) bound IS the divisor-pair count up to the vector sieve's fixed factor 3, and used as a bound it is 4 to 5x weaker than the exact quantity in the Fourier basis and 23 to 44x weaker in the divisor-pair basis. | none | [attack-tau-repricing.md](history/staging/attack-tau-repricing.md) |\n| `Q-the-dials` | ANSWERED | Which variables can this programme actually push, and which is Chris missing? | The square frontier constrains certification from roughness alone, not every arithmetic method. The current campaign uses long intervals, a classical Chen benchmark and an OPEN signed estimate; uniform maximum-gap control is a sufficient secondary target. Finite slopes do not determine an asymptotic exponent. | none | [THE-DIALS.md](THE-DIALS.md) |\n| `Q-the-lens` | ANSWERED | Why is the tile the right object, and what does the lens buy? | Completeness is PROVEN and elementary (every twin prime above p is a twin slot of T_p) and the recursion is exact; nothing here is claimed as new mathematics, and the triage rule of section 5 states what the lens does not buy. | none | [THE-LENS.md](THE-LENS.md) |\n| `Q-theta-ladder` | CLOSED | Does the all-positions exponent theta turn over below 2, converge to exactly 2, or settle above 2? | The answer is above 2 with an amendment, and the route is retired regardless: theta does not turn over (it dips and comes back, need/z^2 = 0.3550 to 0.6119 at z = 13..31 and rising from 31), convergence to exactly 2 is not supported (e = 1 rejected at 95% in all four fits), point estimates run 2.37 to 2.99 without settling, and OUTCOMES.md records the certificate route as RETIRED because the sharp maximal law it needs is itself TPC-implying. | 0 | [theta-ladder.md](theta-ladder.md) |\n| `Q-theta-last-gap` | CLOSED | Can the last 0.209 of theta_total be recovered by sharper absolute-value accounting? | No: theta_total stays 1 and the obstruction now carries an exponent, the absolute-value ceiling is c*H^theta_total with c > 0 rather than H*polylog, so the shortfall is a power H^0.212 and the entire budget any constant could ever buy is O(lnln H / ln H) against a break-even of 1.208983. | none | [attack-theta-last-gap.md](history/staging/attack-theta-last-gap.md) |\n| `Q-theta-selfconsistent` | ANSWERED | What does the exact-supremum theta ladder give when re-run self-consistently in H? | All five published self-consistent values reproduce exactly from two independent implementations; z = 31 is now measured at nP = 588, nP/z^2 = 0.6119, so the published 1.1776 is overstated by 1.93x, continuing the pattern, and at z = 47 a prefix walk finds the certificate failing at H = 1.0412 z^2, so the self-consistent unconditional requirement leaves the zone budget by z = 47. | none | [theta-selfconsistent.md](history/staging/theta-selfconsistent.md) |\n| `Q-transition-energy-review` | ANSWERED | Does the sharp-energy chain in sharp-corner-transition.md survive an adversarial check, and do the upper norm, the small-fixed-eta lower norm and the failed negligible transition each stand at their stated scope? | All ten assigned rows survive at their stated scope; no counterexample or decisive contradiction was found. The upper norm, the small-fixed-eta lower norm and the refuted negligible L2 transition each stand separately. Two repairs are citation-level only: the integer Barban-Vehov input is Graham 1978 quoted by Chen An, and the note should record why the k=Q constant is absolute. The de la Breteche-Dress-Tenenbaum PDF was refetched and its SHA-256 matches the pinned hash; its (1.5) and Theorem 1.1 supply exactly the imported (3) and (4). eta_0 remains positive and unextracted, and the signed sums, E_out and the twin margin remain OPEN. | C | [transition-energy-review.md](transition-energy-review.md) |\n| `Q-transition-energy-review-spec` | ANSWERED | What independent checks are required before the sharp-energy and non-negligible-transition conclusions can guide the next signed research attempt? | Bounded review assignment with explicit source, algebra, interval, error and quantifier checks; per-claim verdicts and dependency consequences are required. The assignment is specified, not executed. | C | [transition-energy-review-spec.md](transition-energy-review-spec.md) |\n| `Q-transition-joint-budget` | PARTIAL | Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | The exact split, cutoff-average identities and separate upper budgets survive. Averaging cutoff norms after triangle and Cauchy is saturated for sufficiently small fixed eta, but signed cutoff arguments and joint cancellation are not closed. R_00 need not be estimated separately under every grouping. The short-window constraint is corrected with a bounded majorant and a safely reduced lower constant. No consumer input or signed improvement is supplied; E_out and the sufficient twin margin remain OPEN. | C | [transition-joint-budget.md](transition-joint-budget.md) |\n| `Q-transition-joint-budget-spec` | ANSWERED | Can the mixed and smoothed terms be handled jointly with the transition pair, and what complete inequality would make such an estimate useful for the twin consumer? | Bounded assignment to audit the exact four-term decomposition, price a concrete joint treatment, and return a sufficient one-sided or common-scale inequality with all open terms explicit. The decomposition and existing norm budgets are inputs, not new findings. | C | [transition-joint-budget-spec.md](transition-joint-budget-spec.md) |\n| `Q-transition-research-execution` | ANSWERED | How should the core research handler execute and integrate the three bounded transition assignments while retaining the central signed estimate? | Prepared execution contract with a fixed mathematical baseline, three independently assignable specs, handler-owned signed research, dependency checks, shared-file ownership, reporting requirements and stopping rules. Execution is complete; the corrected results are in transition-round-review.md and transition-round-audit.md. The specification itself supplies no arithmetic estimate. | C | [TRANSITION-RESEARCH-EXECUTION.md](TRANSITION-RESEARCH-EXECUTION.md) |\n| `Q-transition-round-audit` | ANSWERED | Which conclusions of the completed transition round survive direct review, which require correction, and what research decisions remain justified? | The sharp upper norms and sufficiently-small-fixed-eta lower norms survive. The integration contained substantive errors: an omitted lower cutoff, an incorrect Mellin formula for the transition, a conflation of singleton divisor fibers with long cofactor fibers, an unpriced source representation and overbroad closures of joint or cutoff arguments. Owning notes and current records are corrected. No signed improvement or sufficient twin margin is established; the corrected cofactor and joint-correlation interfaces remain open. | C | [transition-round-audit.md](transition-round-audit.md) |\n| `Q-transition-round-review` | ANSWERED | What survives the executed transition round after direct review, and what combined estimate is still missing? | The energy chain survives at its original scope; the integration's missing cutoff, Mellin representation, fiber identification, normalization and general closure claims are corrected. The exact cofactor and joint-cutoff formulations remain useful. No signed estimate, controlled region, exact cut or sufficient twin margin changed. Only the stated norm-only procedure and the arbitrary-factor fixed-shift relaxation are refuted at their specified scopes. | C | [transition-round-review.md](transition-round-review.md) |\n| `Q-transition-signed-estimate` | PARTIAL | Can the signed transition kernel (E1) be estimated beyond its absolute norm budget, and if not, what exact input does the consumer need? | No signed improvement. Derived: the proper-prime-power part of R_11 is O(x^(39/40+epsilon)); the prime part is an exact beta-weighted sum over pairs of linear forms of two-point Mobius correlations with coefficients up to x^(6/25+2eta) and x^(1/20+2eta); the Cauchy budget is at most 2B*eta*x*log^2(x)(1+o(1)) and the fiber triangle budget 4*eta^4*x*log^4(x)(1+o(1)), so every existing inequality loses one of the two signs. The cutoff-difference identity converts T at pn into a sharp-window coefficient times log(p)/L plus two boundary windows; the entropy-decrement route then needs bounded coefficients, a short-interval one-point input for T and a log-weighted consumer, none available. The required one-sided input is stated exactly in section 5. The twin margin remains OPEN. | C | [transition-signed-estimate.md](transition-signed-estimate.md) |\n| `Q-transition-source-match` | ANSWERED | Do the inspected divisor-correlation, shifted-convolution and averaged-Chowla statements directly supply a usable estimate for the exact transition kernel? | No direct supplier was established among the inspected statements. The cofactor exchange and Theta identity are exact, but their scalar coefficient mass is not a full bounded-class representation for T. The transition Mellin kernel requires a sharp subtraction with a 1/s tail. Fixed-divisor singleton fibers differ from potentially long cofactor fibers. The fixed-shift arbitrary-factor relaxation is refuted; broader signed and cutoff methods remain open. | C | [transition-source-match.md](transition-source-match.md) |\n| `Q-transition-source-match-spec` | ANSWERED | What bounded source investigation could supply a usable signed estimate for the transition kernel, and how must its hypotheses and losses be priced? | Specification for up to three detailed source-interface assessments, including coefficient representation, scale quantifiers, normalization, separation errors and exact downstream payoff. No new theorem match or literature-absence result is claimed. | C | [transition-source-match-spec.md](transition-source-match-spec.md) |\n| `Q-twin-reduction` | ANSWERED | What has the arithmetic campaign of 2026-09-05 and 2026-09-06 actually established about the twin sum, at what calibration, what exactly remains, and what would suffice? | Consolidates the checked regional reduction S=C2*x+E_dagger+O_H(x/log^H x), its sufficient unbounded-scale margins, coefficient definitions and source dependencies. Later complete smooth and centered formulations are owned by RESEARCH-HANDOFF.md and their linked derivations. No new arithmetic estimate is supplied. Imported theorem proofs retain their stated review limits; every sufficient twin margin remains OPEN. | C | [TWIN-REDUCTION.md](TWIN-REDUCTION.md) |\n| `Q-two-class-lower-bound` | PARTIAL | What does the two-class LOWER bound on G2 say, and does it conflict with attack E's measured law? | The finite range cannot decide and it is not close: with both constants set to 1 the transferred bound and attack E's measured law do not cross until x = 10^7327 while the exact ladder stops at 79, so neither result refutes the other and no computation ever will. | none | [attack-lower-bound.md](history/staging/attack-lower-bound.md) |\n| `Q-two-class-lower-bounds` | PARTIAL | How large can G2(x#) be FORCED to be? | The best PROVEN lower bound costs nothing, the Kalmynin-Konyagin substitution is carried out here (DERIVED, independently checked, not refereed), and the certificate ladder is MEASURED with an oracle test whose load-bearing caveat is stated on its own; against the target x'^2 and the proven x^(4.2665+eps) upper bound the question stays open. | none | [two-class-lower-bounds.md](two-class-lower-bounds.md) |\n| `Q-two-moire` | ANSWERED | Do the Grain and the Scour, generated by disjoint prime alphabets, force twins to be infinite? | The provable content is exact CRT factorization: over the JOINT period the miss count is guaranteed positive, so aggregate alignment is arithmetically impossible, but that is an aggregate statement over a period vastly wider than the zone and does not reach TPC; the nearest unclaimed theorem is a two-class Jacobsthal upper bound at ANY exponent, and exponent < 2 would prove TPC outright. | none | [two-moire-argument.md](two-moire-argument.md) |\n| `Q-u-frame` | PARTIAL | Does restating the Zone Postulate as one inequality in u, stepping on odd numbers rather than on primes, buy anything against the wall? | It buys form and closes off a class of dead ends, but no difficulty and no slack: the requirement ln c(p) <= 2 ln p/p is exactly what the per-prime analysis already gave and the measured ladders run at about the full rate, so this is a change of coordinates rather than of terrain. | none | [U-FRAME.md](U-FRAME.md) |\n| `Q-u2-engine-depth` | ANSWERED | Is the certificate engine's operative depth heading to u = 2, and does that make TODO item 8's payout form TPC-strength? | It is not: the measured operative depth runs u = 4.191 at @17 down to 3.557 at @97 and is still falling, so the brief's conditional does not fire and item 8 is shown neither TPC-strength nor safe; a WALL-ADDRESS in the weakest sense, every figure SCRATCHPAD-GRADE. | 8 | [u2-engine-depth.md](history/staging/u2-engine-depth.md) |\n| `Q-unreached-sources` | ANSWERED | What is actually in the three sources SEARCH-CONVENTIONS section 5 lists as unreached? | The 2009 SeqFan thread on A144311 does not exist, now a read negative over 19,964 archived messages with zero hits; Paseman's n is the number of distinct prime factors and at that reading his shape is asymptotically weaker than our x^{4.2665}; MathSciNet stays paywalled and unswept. | none | [audit-unreached-sources.md](history/staging/audit-unreached-sources.md) |\n| `Q-usup-convention-0830` | ANSWERED | Are lemmaV-sup-extension.md's u_sup and u_sat and attack-0829n-rml-proof.md sec.4.1's CAP(z) statements about the same object (level D = z^s at s = 3.0, same moduli, weights and normalisation), so that the sec.4.1 correction in passing applies, or does a level-convention mismatch void it? | SAME object, VERIFIED at the code: both notes build the lattice through buildTerms(z, z^3), the modulus sets and Vabs(e) agree to 6.9e-18 at z = 13..23 and the count convention matches at all ten levels, the cited Ssat and u_sat reproduce on the RML lattice to every printed digit at z = 13..19 and the full-level alternative does not (19.544 against 19.602 at z = 13, 45.827 against 50.314 at z = 17); so the PROVEN cap Ssat <= CAP <= z^{2s+o(1)} applies and refutes lemmaV-sup-extension.md's asymptotic prose at lines 485-486 and 508-516 (2^pi(z) moduli, a C^pi(z) theorem as the reachable end), while sec.4.1's attribution sentence overreaches by calling that note's \"reading\" a shape it lists as one of two indistinguishable fits and flags as its likeliest error; neither ledger verdict line changes. | 0 | [verify-0830-usup-convention.md](history/staging/verify-0830-usup-convention.md) |\n| `Q-var41` | OPEN | What does the stable law predict for Var(41), and what can the tenth Var/E point pin? | Pre-registration only, sealed and committed alone before any Var(41) engine exists: it freezes the prediction, a band taken from the law's own residuals at z <= 37, the derived z(41) prediction, and the honest statement that one more point cannot separate a limit from a drift. | 2, 9 | [var41-prereg.md](history/staging/var41-prereg.md) |\n| `Q-varE-identification-0830` | PARTIAL | Can either open step behind lim Var/E = 0.45546 (the identification delta*(X - X_dec) -> 0, or the theta = 2 mean-coefficient replacement) be proven, and if not, which single inequality does not close? | Neither closes, and the two named steps are one statement (Conjecture 1 of variance-note sec.10; the model half is PROVEN in varE-limit-theorem.md). The remainder is re-split exactly at five levels: the corpus's X2 column doubles the positive half of one shift pattern (X2c = 2.66 against the group sum 0.09 at x = 19, PROVEN by rebuild), so its Xmix is overstated 2.3x; the true mixed remainder is MEASURED at -0.49 ln y and 82 % of it sits BELOW 2L, in the two-branch type, in the unbalanced range min(d,e) <= L^(2/5) (99.7 % of that cell at x = 19), outside the range of every bilinear Kloosterman-fraction bound; the divisor-distribution estimate the record names (n > 2L only) is therefore not the whole open step. Henriot's Corollary 2 (read at the page, erratum read) applies as stated and cuts the moduli to n <= L ln^(2+o(1)) y, PROVEN given that theorem; the one inequality left is the uniform o(1) equidistribution of y-friable squarefree integers in progressions to moduli up to y^(4/5), NOT SEARCHED at the page. The limit 0.45546 stays HEURISTIC. Not TPC-strength. | 9 | [attack-0830-varE-identification.md](history/staging/attack-0830-varE-identification.md) |\n| `Q-varE-limit` | PARTIAL | Does lim Var/E on the diagonal window exist, and what is it? | The theta=2 mean-coefficient step is neither proven nor refuted: the replacement error is exactly a sum over shifts of W(h) - V(h), it splits into a c=0 group (needs no decoupling) and CRT-mixed lags (open); measured ratios true/model 1.0098, 1.0039, 1.0014, 1.0013 at x = 13..23 with delta(X - X_dec) ln y falling rather than settling, so the error is O(1/ln y) or better MEASURED on four levels that exclude growth and nothing finer, and the limit 0.45546 stays HEURISTIC with varE-spectral's second step, its own limit theorem, still open. | 9 | [lit-dickman-variance.md](history/staging/lit-dickman-variance.md), [lit-smooth-divisors.md](history/staging/lit-smooth-divisors.md), [varE-asymptotic.md](history/staging/varE-asymptotic.md), [varE-exact-ladder-01.md](history/staging/varE-exact-ladder-01.md), [varE-limit-theorem.md](history/staging/varE-limit-theorem.md), [varE-spectral.md](history/staging/varE-spectral.md), [varE-theta2-proof.md](history/staging/varE-theta2-proof.md), [varE-theta2-step.md](history/staging/varE-theta2-step.md) |\n| `Q-vc-prior-art` | ANSWERED | Does arXiv:2208.06442 contain or overlap the VC-dimension = 4 finding of import-vc-nets? | DISJOINT at theorem level; not found there nor in the reachable one-hop neighbourhood; Helmbold-Sloan-Warmuth 1992 Thm 3.1 owed (abstract only). | none | [lit-vc-multiples.md](history/staging/lit-vc-multiples.md) |\n| `Q-verify-audit-numbers` | ANSWERED | Is audit-numbers.js circular? | Not circular in the way that would matter most, since it reads no other repo script, but 15 of its 117 checks certify nothing and 17 more are artifact echoes among transcribed constants; the one bug class the charter was written against had nothing in sections A to W to fire against and still has nothing, and one from-scratch re-implementation found a check depending on an unnamed hard-coded phase choice. | none | [verify-the-verifier-numbers.md](history/staging/verify-the-verifier-numbers.md) |\n| `Q-verify-cofactor-convolution` | ANSWERED | Does the cofactor-convolution identity at the anchor hold, and does it test the joint law? | RESTATED with corrections: the arithmetic is right, an independent re-derivation reproducing every figure to the digit at all five levels and confirming the asserted closed-form step, but the framing does not survive, since X is pinned by the identity X = M - Nbar + n_0 so the whole comparison collapses to one cell and the joint is measurably not a product elsewhere; the model error is 0.52 per cent, not 0.050. | X | [verify-cofactor-convolution.md](history/staging/verify-cofactor-convolution.md) |\n| `Q-verify-monotone-depth` | ANSWERED | Does the Monotone Depth obstruction, which retires dial 4, survive an adversarial re-derivation? | NARROWED: every measurement in the record reproduces, several to the last digit, but the mechanism as named is false as a general law and the corpus already holds a counterexample to it; what survives is an accounting of three channels priced in tenths of a nat against a need of 6.700, 8.191 and 9.637 nats, so dial 4 becomes priced slack with one channel open and unpriced. | 0e (retired) | [verify-monotone-depth.md](history/staging/verify-monotone-depth.md) |\n| `Q-verify-record-defects-0830` | ANSWERED | Do the three defect claims of 2026-08-30 (attack-0830-varE-identification.md sec.8 on the doubled X2 column; attack-0830-tail-derivation.md sec.7 on the corpus's \"R + 1/2\"; attack-0830-head-remainder.md sec.1 on the decade-pooled Delta = 0.6214) reproduce on independent code from the definitions, and which of the corrections they list apply? | Claim 1 CONFIRMED: the corpus delta*X2 column is the positive half of the p \\| h-2 pattern doubled, that pattern's mirror is the p \\| h+2 pattern (W-(-h) = W+(h) exactly, W-(h) != W-(-h) at 9 to 900,679 shifts), the group sum 2X2 reads -0.5603 .. 0.1846 at x = 7..19 against 5.7147 .. 5.3266, and Xmix is overstated 2.305x at x = 19 (6.9x at x = 7); X, X1 untouched. Claim 2 AMENDED: R + 5/2 and R + 3 are exact for the tail convention (all and odd origins, asserted at x = 7..23) and t/(R + 3) = 1.0228, but head-residual-factor.md:70 is the HEAD's forward convention where R + 1/2 and R + 1 are exact, so that correction does not apply; and p'^2 is 1 mod 6, where the tail constant is 5 (t/(R + 5) = 1.0181), with the class null (1.0157) the matched figure, so 1.0228 is one unmatched convention replacing another. Claim 3 CONFIRMED as an artefact, AMENDED on mechanism and on the half-decade reading: 0.6214 pooled against 0.6592, 0.6705, 0.6736 at 2, 4, 8 sub-windows; the between-slope (Simpson) piece the note derives is half of the pooling term (0.0187 of 0.0378 at halves, 0.0261 of 0.0522 at eighths), the other half is the within slope's own fall with height weighted by Var(g); and re-reading the halves from their eighths puts HL BELOW the measurement at 5 of 6 half-decades by 2.5 to 3.4 percent at the top decade, so \"within 1.6 s.e., sign alternating\" is itself a pooled statement. | Z4, 9 | [verify-0830-record-defects.md](history/staging/verify-0830-record-defects.md) |\n| `Q-verify-the-verifier` | ANSWERED | Does the QC gate's alarm ring when a defect of each real class is present, rather than merely reading green? | Of the 31 blind mutations the existing selftest covers zero: it is a reachability test proving each alarm can ring, never a sensitivity test asking how far a defect must move before the alarm stops, and its fourteen controls are all obvious silences; the ranked blind spots are listed with a proposed fix each, led by out-sha256 being written and never read. | none | [verify-the-verifier-checks.md](history/staging/verify-the-verifier-checks.md) |\n| `Q-w1-singular-series` | ANSWERED | What is the endpoint comb W1 in the literature's terms? | W1 is exactly the Hardy-Littlewood singular-series ratio for (0, 2, v, v+2) over the twin series squared, truncated to the folded primes and normalised by a v-independent constant, PROVEN algebraically and VERIFIED as exact BigInt-rational equality, so the fold-factor comb is the twin-twin correlation comb evaluated at v = theta_p. | none | [w1-singular-series.md](history/staging/w1-singular-series.md) |\n| `Q-width-repairs` | ANSWERED | Can the five loaded containers found by the width sweeps be guarded without invalidating any embedded figure? | Forward protection only: every repair is a widening or a bound check, storage-only by construction, no corpus figure was retroactively corrupt and none moved, with maxgap-law.js at 0 of 1389 figures unreproduced and attack-foldL-01-census.js byte-for-byte on the same out-sha256. | none | [width-repairs.md](history/staging/width-repairs.md) |\n| `Q-width-sweep` | ANSWERED | Which big-level enumeration and census scripts carry a fixed-width container that is safe at every level run and aliases silently above a threshold? | Three instances: two CORRUPT (the one-word residue mask that corrupted the census from x = 37 up, and a Uint16 index into the scour-prime array in the @37 census, both since fixed) and one that threw rather than aliased; every internal identity in the corrupted producer is a COUNT identity and stayed PASS throughout, because the alias corrupts which prime, not how many. | none | [width-sweep-census.md](history/staging/width-sweep-census.md) |\n| `Q-width-sweep-attacks` | ANSWERED | Does the attack and analysis script family carry the fixed-width-container defect class that corrupted the @37 census? | No live corruption across 123 scripts, every stored value derived at the level actually invoked and fitting its container; one hazard is serious, attack-x-offset-02-profile.js storing an index into the scour-prime array in a Uint16Array, the identical mechanism in the identical role as the census defect fixed at 605ce83, and it fires at @37. | none | [width-sweep-attacks.md](history/staging/width-sweep-attacks.md) |\n| `Q-wrap-identity` | ANSWERED | Can T4 be computed without enumerating quadruples? | Yes: the 4-point wrap identity exists and is verified through @13 against the certified value, turning @17's dead T4 (4.9e16 quadruples) into an 11-minute computation, but at a precision that certifies T4 itself and not yet the quartic bound. | none | [natal-cap-32-wrap-identity.md](natal-cap-32-wrap-identity.md) |\n| `Q-wrongdirection-audit` | ANSWERED | Are any of the ten live targets secretly TPC-strength, before the sessions are spent on them? | The audit closes no target: two of the ten come out TPC-strength and three more carry a TPC-strength face under a quantifier they are likely to drift into, which is a labelling result and not a reason to drop them; item 1e is settled only because the answer was already on disk, and one route-blocking number in it is hand arithmetic and unstamped. | 1e (retired) | [attack-wrongdirection-audit.md](history/staging/attack-wrongdirection-audit.md) |\n| `Q-xchan-at29-prereg` | OPEN | Does the joint-deficit closed form survive a blind test at @29? | Pre-registration only, committed alone before any producer existed: the statistic, the predictions adopted verbatim from the record, two acceptance bands, the validation gate the instrument must clear before any @29 number is reported, and what each verdict does to TODO item X. | X | [xchan-at29-prereg.md](history/staging/xchan-at29-prereg.md) |\n| `Q-xchan-at37-offset` | ANSWERED | Does any registered offset-correction candidate for the ~3.8 law survive at @37? | Sealed and committed alone before any @37 census of any kind existed, fixing the candidates, the sigma model and its projection band, the scoring rule and what each verdict does to item X's offset clause; scored in xchan-at37-score.md, where every registered candidate is killed and the number survives an independent recount. | X | [xchan-at37-offset-prereg.md](history/staging/xchan-at37-offset-prereg.md) |\n| `Q-xchan-at37-score` | ANSWERED | What does the @37 census say about the sealed X-channel offset pre-registration? | The census measured 1 - J = 0.020823, below every registered prediction, so scored exactly as registered every one of the seven candidates dies at \\|z\\| = 104 to 122 and the survivor set is EMPTY, an outcome the sealed prereg has no consequence clause for; the number itself survives an independent recount on a different marking scheme, and the offset question is replaced by a larger one. | X | [xchan-at37-score.md](history/staging/xchan-at37-score.md) |\n| `Q-xchannel-at23` | PARTIAL | What is the fifth point of the X-channel statistic, at @23, and does the monotone rise hold? | The fifth point is +0.2658 at @23, the rise holds at five levels and is larger than the four-point trend predicted, and the deficit has migrated into m >= 3, whose share of the X-gap runs 10.5, 23.5 and 81.1 per cent at @17, @19 and @23; the constant itself is not derived here. | X | [xchannel-at23.md](history/staging/xchannel-at23.md) |\n| `Q-xchannel-closedform` | PARTIAL | Does the zero-parameter closed form for the joint deficit survive its two blind tests at @29 and @31? | 1 - J = 4S2 is the only one of the three pre-registered laws left standing and it is not exact: a clean hit at @29, z = -0.90, and 4.93 sigma low at @31 where sigma_J falls to 0.000024, with the two rivals dying at 6.35 and 20.81 sigma; both blind levels agree on a stable relative offset of about half a percent, -0.41% and -0.48%, whose absolute residuals match to 2%. | X | [xchan-at29.md](history/staging/xchan-at29.md) |\n| `Q-xchannel-offset` | PARTIAL | What produces the ~3.8 law's -0.45% offset, and which candidate correction survives? | The best available description is a finite-level correction of S3's size and sign - 1 - J = 4S2 - S3 scores z = +0.04 at @29 and -0.41 at @31 where the standing law scores -0.43 and -2.32 - but it is POST HOC; two candidate corrections and one shape are refuted on existing data, the sigma behind the @31 detection is calibrated on seven known-truth controls, and the deciding blind test at @37 is pre-registered and committed alone. | X | [item-x-offset.md](history/staging/item-x-offset.md) |\n| `Q-xchannel-triples` | ANSWERED | Does the joint deficit deepen or decay as the mixed super-W triple census is extended past @17? | It decays: J = 0.9025, 0.9599, 0.9659 at @17, @19, @23, so the deficit runs 9.7%, 4.0%, 3.4%, both new points land inside the pre-registered DECAYING FASTER THAN FORCED band, and the DEEPENING instinct is refuted by 3.50 sigma between @17 and @19 and a further 1.68 sigma to @23. | X | [xchannel-triples.md](history/staging/xchannel-triples.md) |\n| `Q-y2-recompute` | ANSWERED | Does the sixteen-level Y2 ladder reproduce on the corrected instrument, and does Y2/x^2 fall? | The ladder reproduces exactly, sixteen of sixteen from sixteen independent processes, digit for digit against the published 2026-08-18 ladder, and Y2/x^2 falls at 15 of the 15 consecutive steps; this does NOT show that G2(x#)/x^2 falls, since the shortfall Y2/(G2-1) is unmeasured above x = 79. | 1d | [y2-recompute.md](history/staging/y2-recompute.md) |\n| `Q-z2-state` | PARTIAL | What is known about Z2, the largest gap between twin openers inside the zone (p, p'^2), and at what calibration? | Draft consolidation only, computes nothing new: the zone statement is an interval statement, the parity obstruction applies to it in full, and no proven statement about Z2 survives past the zone's own width. | none | [z2-state-draft-0829.md](history/staging/z2-state-draft-0829.md) |\n| `Q-z3-immune` | CLOSED | Do the square anchor's immune offset classes (stretch-01 §4) carry a survivor surplus beyond the redistribution-only guardrail, do they attract the floor's first survivor, and does restricting the transplanted caps to them lower K*? | No, on all three. The preregistered surplus test is VOID on its own matched control (a 0.6% ratio-of-means bias present with and without the quadratic point); the preregistered placement test HOLDS at Z = +0.49; the design-free class test reads the guardrail's r/(r-2) over 3.4 million twin openers with a largest per-prime deviation of 0.11% and per-prime Z in -0.48..+1.66; and the restricted certificate, while lowering K* at 61% of anchors, has no certificate at all at 93 of 1219 and is beaten head to head by the QR-BLIND restriction that certifies 1219 of 1219. The refinement is closed. | Z3 (retired) | [attack-z3-immune-01.md](history/staging/attack-z3-immune-01.md) |\n| `Q-zone-postulate` | OPEN | Is every zone occupied by a twin pair, and what is proven toward it? | OPEN: the weak form is PROVEN equivalent to the twin prime conjecture (both directions, elementary), the zone's supply is MEASURED to grow like p^2/ln^2 p with margin about p and verified by segmented sieve to 1e11, and the obstruction is named; none of the four attack routes closes it. | none | [ZONE-POSTULATE.md](ZONE-POSTULATE.md) |\n| `Q-zone-tail` | PARTIAL | What is the tail field of the zone (p, p'^2) - its law against ln^2, its worst case, its share of the R0 width, and is it the frozen-sieve last survivor below p'^2 at the rate the head is the frozen sqrt(p)-level first survivor above p? | The field exists now, 1,225 zones, and nothing in it is derived. The tail is the head's own renewal functional read at height p'^2 rather than p: c_tail = 0.7771 ln^2(p'^2) at [3163,1e4) against the head's 0.6693 ln^2 p on the same zones and the same estimator, both referenced to HL's 0.7574, and the apparent factor of four is the unit ln^2(p'^2) = 4 ln^2 p and nothing else. The band drift does not settle (0.7518, 0.7288, 0.7771; the pre-registered 0.03 step is missed), so this is band composition on two decades and not a measured convergence. The frozen-sieve mirror is 100% at the zone's own level p, but that is the Zone Restriction Lemma restated and not a rate comparable to the head's 96.65%; the non-vacuous mirror is one fold back, where the tail survives at 98.69% with the residual priced exactly (88 extra lpf(n) = p survivors, 18.18% of them biting), and the head's own frozen level sqrt(p) identifies the tail in only 22.86%, refuting this note's own pre-registered [0,5] zones. The renewal surplus t/R = 1.0619 at B4 is NOT RESOLVED, its bootstrap [0.9937, 1.1321] containing 1, and an exhaustive class-matched origin null over 5,962,057 origins gives the same 1.0619; three matched non-square endpoints see no difference at all, sign tests z = 0.14, -0.54, 0.66 with six paired intervals all containing zero, so nothing here is a property of the endpoint being a prime square. R0 is asserted at all 1,225 zones and the shares are 1.82% head, 89.72% Z2, 8.46% tail at B4 with the tail's share FALLING, so filling the tail row moves the decomposition's difficulty nowhere: Z2 was the obstruction before and is more of it after. | Z4 | [zone-tail-01.md](history/staging/zone-tail-01.md) |\n| `Q-zone-tail-02` | ANSWERED | On the full zonegap-01 range to 1e11, what is the per-zone tail law in both units, is the renewal surplus t/R real at 27,292 zones, and do the head and the tail of a zone have a joint law? | Resolved DOWN and nothing is derived: zone-tail-01's unresolved t/R = 1.0619 at 782 zones reads 1.0298 on a height-matched comparator at 17,700 zones (bootstrap [1.0156, 1.0443], excluding 1) and 1.0157 against the exactly matched discrete class null (bootstrap [1.0013, 1.0308], clearing 1 by 0.0013), so part of the original figure was the comparator and the pre-registered rule returns MATCH by two parts in ten thousand; c_local = 0.7522 at the top band with bootstrap [0.7410, 0.7630] now CONTAINING HL's 0.7574 and the band drift inside the registered 0.03 per step for the first time but still non-monotone (0.7518, 0.7664, 0.7416, 0.7522), so no convergence is measured; global worst tail/ln^2(p'^2) = 6.840 at p = 15107 with max/mean no longer flat (4.40, 5.36, 8.59, 8.43); Q5 is answered in the negative, head and tail showing no dependence at 27,292 zones (detrended r = -0.0009 against null s.e. 0.0061, permutation p = 0.8920, variance ratio 0.9990, no KS rejection, no chi-square near threshold), so the R0 pieces are a product structure to first and second moments and in the sum's whole law while independence is NOT proven and the simultaneous-extremes regime is untouched; a candidate rough-origin mechanism for the surplus is HEURISTIC and does not fit the head's own excess band by band; the head field's effective sample size is measured at 1,910 distinct a_first among 17,700 top-band zones, so this note's own head interval is priced over draws the field does not hold, a cluster bootstrap over distinct a_first (producer SEC I(a), seed 613009117) measuring the inflation at 4.10 rather than the 3.04 the redundancy alone implies and moving the top-band interval to [0.6848, 0.7692], still inside the registered [0.68, 0.78] (correction originating with redteam-0829-measure-b.md section 1c C15); the scope of that defect is that one interval and not the corpus, since destroyer-census-01.md publishes no bootstrap, head-residual-factor.js bootstraps over gaps, zonegap-01.js has none and zone-tail-01.js bootstraps only tail quantities; ten of ten predictions hit, which is a criticism of the pre-registration; and the R0 shares read 1.40% / 92.80% / 5.81% with the tail's share still falling, so Z2 is more of the obstruction after this pass than before it. | Z4 | [zone-tail-02-0829.md](history/staging/zone-tail-02-0829.md) |\n| `Q-zonegap-01-prereg` | SUPERSEDED | What is Z2(p) in the unswept half-decade p in [1e5, 316228)? | Pre-registration only, committed before the X = 1e11 sweep ran: five predictions are sealed on the per-zone distributional structure the published record ladders do NOT determine, with the records excluded from scoring and used as custody instead; the scoring document is the stage-2 embedded output, in zonegap-01.md. | none | [zonegap-01-prereg.md](history/staging/zonegap-01-prereg.md) |\n| `Q-zonegap-03-prereg` | OPEN | What is Z2(p) in the unswept decade X in (1e11, 1e12]? | Pre-registration only, sealed before any sweep past X = 1e11 exists: five theorem-grade predictions at sigma = 0 (resting on Z2(p) = env(p) identically, a two-line theorem conditional on the adopted ladder being the true running max) and five blind statistical ones with sigma models and kill rules, scored by the stage-3 embedded output with misses stated first. | none | [zonegap-03-prereg.md](history/staging/zonegap-03-prereg.md) |\n| `Q-zonegap-03-score` | ANSWERED | Do the ten predictions sealed in zonegap-03-prereg.md score against the stage-3 sweep at X = 1e12? | All ten sealed rows score HIT and none miss, after a second pass added a band-edge argument to zonegap-01.js and re-ran the decade so the two rows that named an unprinted band could be scored; the four Group T hits are a custody promotion that follows from CUSTODY 1 and 3 passing, one sub-clause of T5 (the full-decade sd) stays unprinted, and the sweep still needs a DERIVED engine because zonegap-01.js's inlined 41-record ladder makes it exit at 1e12. | Z7 | [zonegap-03-score.md](history/staging/zonegap-03-score.md) |\n| `Q-zonegap-Z2` | PARTIAL | What is Z2(p), the largest twin-pair gap inside the zone (p, p′^2), measured at every zone to 1e11? | MEASURED to 1e11 over 27,292 zones: every zone holds at least two twin pairs, Z2 is the record envelope wearing zone coordinates, Z2(p) <= G2(p#) is a one-line theorem with equality only to p = 7, and the zone-local margin runs away like p^2/(3.9 ln^3 p); the pre-registration scored 2 of 5. | none | [zonegap-01.md](history/staging/zonegap-01.md) |\n| `Q-zonegap-model` | ANSWERED | What is Z2 once decomposed, and does the per-zone field carry anything the record ladder does not? | Z2(p) = env(p) with D(p) identically zero (PROVEN conditional on the adopted ladder, VERIFIED 204 ways), so the per-zone field is the record ladder wearing zone coordinates and the u bimodality is closed; the blind tests for the [1e11, 1e12] decade are sealed and the sweep itself is not run. | none | [zonegap-03-model.md](history/staging/zonegap-03-model.md) |\n| `Q-zonegap-prior-art` | ANSWERED | Who owns Z2(p), the maximal twin-prime gap below a quadratic cutoff, in the owning conventions? | Kourbatov (2013) and Kourbatov-Wolf (2019) own maximal twin-prime gaps, with heuristics and records and nothing proven; the zone form (p, p′^2) has five neighbours and no owner, and the per-zone quadratic-cutoff object appears absent on channels calibrated in the same session. | none | [zonegap-prior-art.md](history/staging/zonegap-prior-art.md) |\n| `Q-zonegap-reduction` | PARTIAL | What must be proven for Z2, what already is, and what does the proven head machinery give the zone? | The Zone Restriction Lemma is proven and verified at five levels - the in-zone twin slots of T_p ARE the in-zone twin primes, so Z2(p) IS the whole-tile gap object restricted to the head window - the three-slack chain is graded honestly, the transfer inventory is listed item by item, and the deep end is proven an onset desert over 24 levels; section 5 lists what was not reached. | Z (retired) | [zonegap-02-reduction.md](history/staging/zonegap-02-reduction.md) |\n| `Q-zonegap-witnesses` | ANSWERED | Do independent second witnesses confirm the twin-gap record table, and does the due OEIS flip-search turn anything up? | Both witnesses AGREE at 82/82 rows with no extension and no conflict and the lesser-to-lesser convention verified rather than assumed; the OEIS check returns one loud hit, the per-zone pair-count sequence being A273257 one index over, while the gap objects stay absent, and one literature item, Korevaar 2012, is still walled and read only by arXiv proxy. | none | [zonegap-witnesses.md](history/staging/zonegap-witnesses.md) |\n\n## 3. Unindexed notes (0): title only, until a block is added\n\n*(Legacy notes written before the ledger existed. A grep for the object still\nlands here. Add a block when a note is next touched; `node research/qc.js\nledger-backlog` lists them.)*\n\n","accepted_152":{"status":"accepted","final_rung":"verified","revision_path":"research/history/staging/derive-0904-L7-transfer.md","revision_sha":"c60a250dfa9e633058aeb0ae7f31f2b24eb79c2419ca90f8a2a0a41c23d16712","patch_status":"integrated","created_at":"2026-09-11T16:25:55.712Z","effects_applied_at":"2026-09-12T15:10:49.302Z","decision":{"status":"accepted","final_rung":"verified","provisional":false,"by":"trusted","note":"1 trusted vote(s)","decided_at":"2026-09-12T15:10:49.297Z","decided_by":["Benjaminsen"],"decided_by_author_handle":true,"review_ids":[59]}},"reported_registry_digest_230":"e2ddcfc55f89be535041515a26fbc5068db832a7d548d35765b75f5360ff60e","source_manifest_230":[{"sha256":"341c2f96e208b491ccfb9b25be3b311da1edc06a1ff86ee8e6d922e66e9c17a5","name":"report.md","bytes":11274},{"sha256":"e5c7e4f835070a36c9dc3e2eab9981aea15bd713ffd291462925467bb50253ab","name":"rows23-37.md","bytes":11490},{"sha256":"d8ef6544e7bceed989ebee05bbbf2207096f34e5af06b41b41efe55f6ec61bd9","name":"registry-check.py","bytes":7227},{"sha256":"61af0912a15ec5c4285ab630fe6355ad876d0f5b573a30a2211703231c02f9e7","name":"registry-check.out","bytes":2873},{"sha256":"a4870e46012dcaf1adcc05767a04c6301db3b0a3f844749a8ebc00b131738a49","name":"registry-check-all.out","bytes":10316},{"sha256":"07657e11adc77a5e25225ade34bde532d59842bf57f69deabcf4b1431c11d49b","name":"registry-check.json","bytes":48776},{"sha256":"a9ee206d5e508a60171836f0073eefbdc08fc3db1491977c19867aaae5b4b220","name":"registry-check-all.json","bytes":130277},{"sha256":"d100d38644e63a6dc4d8b14c7a17c3e9d983053a1b352eb8717829ca60cfb159","name":"questions-row37.patch","bytes":4924},{"sha256":"25b158257631bb34b1d595208dc29ba021f84e71aba6957e763e7a26aabe06ea","name":"mkpatch37.py","bytes":2552},{"sha256":"d5f4f960acf2abc5bfbb33fdc61d2d6b3be6bf8e7c91a362d62f349fe1b4f782","name":"returns-sweep.json","bytes":144849},{"sha256":"f906bb93abfc8b896529ffb7ff66d82e54f068238ce48908b5389da02d4c9b96","name":"audit-report.md","bytes":4238}]}