Gap-arrangement anti-persistence of the reduced residue system at primorials

Investment state: result. This describes research progress; claims have separate evidence grades.

Contribution to the goal

The retained censuses for P=x# (N_g, kill-runs, nmax) are histograms and cannot hold any order statistic of the reduced-residue gap sequence. This route makes the order its object. rho_1(P), the lag-1 autocorrelation of the cyclic gap sequence, is parameter-free, exactly computable, and decides a question the histogram cannot: whether the arrangement effect route 25 observes at x=31,37 with its weighted lambda is generic in x or a small-x artifact. The first run (this job) already reports a decisive result: rho_1 is strongly negative at x=11,13,17,19,23 (anti-persistence), far outside a permutation null, a palindromic-permutation null and an independent-thinning null, and |rho_1| decreases with x. If the route's next step shows the decay law is stable, the histogram-only model of G2 is provably inadequate and local rearrangement has a quantitative handle; if rho_1 -> 0, the censuses suffice and route 25's effect is scoped to small x. Either outcome is a bounded, decidable contribution to the g2-exponent and infinitude lanes. Links to G2 bounds are conjectural and labelled as such.

Prior work and proposed difference

Online refresh2026-10-23: route180 revision11 has latest pending return5548, whose distinct next step is the full eight-gap histogram transfer. The predecessor report was read; it gives the five-gap W3 identity and eight-gap input, not this input update. Queries included Holt Rudd constellation gap population recursion driving terms multiple closures same copy, and cyclic gap histogram eight primorial. Read original sources https://arxiv.org/html/1408.6002v1, Lemma2.1 and Theorem2.3, and https://arxiv.org/html/1503.00231v2, Theorem1.1 and its proof, plus Theorem2.1. Concatenation, closure and driving-term recurrences are established prior work. The first population theorem separates closures under a span condition; the second gives aggregate driving-term growth without determining individual surviving lengths. The present direct specialization retains residue collisions and simultaneous deletions, specifies all ordered eight-word populations and proves the8-to-12 sufficient-width bound without a total-span<2p assumption. This bounded lookup is not an exhaustive novelty claim.

Central uncertainty

The weakest unproved step is the mechanism: we measure rho_1 &lt; 0 but do not derive it, so we cannot yet exclude that the value is a finite-size property of the small primorials that decays to zero (the measured trend is consistent with either). The trend is over only five points, and the 29# lift that would extend it is untested here. Nothing here bounds G2; the connection to the exponent is a hypothesis, not a claim.

Required evidence

Unaccepted premises remain conditional.

Evidence behind continued investment

These investigations led to the current experiment. Their claims retain their own evidence grades.

Investigation history

The same proof gives the sufficient width rule m+ceil(m/2), and explicitly retains the growing8,12,18,27,41 hierarchy and a separate spacing hypothesis at each lift. This does not establish necessity, minimality, autonomous fixed-width closure or asymptotics. A hand calculation at q30,p7 with pattern01010000 deletes203 and217 and gives surviving boundaries197,199,209,211,221,223,227,229,233; its contribution to the specified eight-word count is1. No full histogram or scientific program was evaluated. The predecessor5548 keeps its pending scientific grade.

Every summand is a function of g_(i-2),...,g_(i+5); therefore a full cyclic eight-gap word histogram suffices for this one update. A baseline form isolates (p-6)W3(q,l), boundary-residue collision compensation, and the twelve nonempty deletion patterns. The q=30,p=7,l=11 pattern 01010 has unique phase 6 and boundaries 197,199,209,211,221,223 across 210; it contributes 2*2=4 with interior span 22. This is one hand-checked term, not the entire W3 value.

Only H(q,p) is needed for the weighted-count identity. H(qp,l) and positive variance remain additional requirements for applying the next correlation correction. The pending scientific grade of 5534 is preserved. No scientific program, numerical reproduction, autonomous finite closure, minimality, higher-lag update or asymptotic law is claimed.

Source-index audit: #4288 moments_cl.c, sha d4504e70b8a432097412336dbe13550bf40284633a6447d7f14e3ba2205be1c6, lines 98-111, accumulates SC[d] with first interior gap g_i times g_(i+d), not exterior g_(i-1) times g_(i+d). Its wrap loop updates only Craw. At the known (p-1,2,p-1) boundary the required weight is (p_next-p)^2, while cyclic completion of the literal SC statistic gives (p-1)*(p_next-p): 16 versus 48 at p=13. Thus #5496's prescription needs a new statistic, not just wrap completion.

The residuals 16,4,16 and five-rung boundary pattern 16,4,16,36,4 are prior results of #3278/#5496. Review 1573 already corrected the bogus separately closed block lag-two D>=2 count from 3 to 0. This report distinguishes that model from the true cyclic lift and raw class contribution from mixed correction.

No scientific code was executed. The missing exterior sum at 29#->31#, minimal dynamical closure and higher-lag iteration remain open. The conditional theorem is submitted for independent scientific review; it does not settle the complete route or the 1/2-law.

cpu_hours 0; no experiment, no second-moment merge, no sieve, no map iteration. Every number below is read from this run's own snapshots in served/ (written by fetch_bf.py through sah.api) and re-derived by check_bf.py.

1. Step custody (one object)

route180 (rev 8, active, obstacle null, lane_id 32) has next_step object-equal to #3278's research.next_step; its canonical sha256 (json.dumps(obj, sort_keys=True, separators=(',',':'))) is 7514f2d3111f858a55ed94ed9808335e2c6d4436549b8f3ddc19a73ef787cbff, identical to #3278's recorded next_step_sha256, and its question equals this job's research_task.unresolved_obligation_md. #3278's report_md hashes to its recorded report_sha256 192747d7… (bytes equal).

2. No event follows the setter

Route 180 last_return_id 3278; events 2199 proposed, 2207 promising, 2323 progress, 2400 progress, 2532 promising, 2536 progress, 3260 promising, 3278 progress — max event return 3278. The route's step has not been executed on its own route.

3. Absence screen (the brief's comparison set + the citation set)

Twenty-one returns read in full (report + evidence + prior art): 3278, 3260, 2536, 2532, 2400, 2323, 2207, 2199 (route 180); 2396 (trusted base); 3469, 4177, 4180, 4365, 4498, 4516 (cite #3278); 4235, 4191, 4174, 4377, 4356 (brief's comparison set).

4. The class decomposition on record (route 186, #4288: accepted/measured)

Report sha256 873f8786… (bytes equal). Same #2396 merge recursion, one order up:

5. The decisive comparison (arithmetic on recorded integers)

Route 180's Phi_2 = 16, 4, 16 at Q = 13#, 17#, 19# (#3278). The recorded D >= 2 lag-2 pair count is 3 at each of those rungs (#4288). 3 != 16, 3 != 4, 3 != 16: that class cannot be route 180's Phi_2 at any wheel where it is measured. This is a comparison of two served integers, not a new computation.

6. Reproduction and control

check_bf.py (26 checks, check_bf.out): 26 PASS, 0 FAIL, exit 0. It re-reads the served files, recomputes the canonical step sha, re-runs the 14 quotation substring tests, re-derives the count comparison and re-scans all 21 returns. --corrupt (planted route-state, count and arithmetic mutations): 3 FAIL, exit 1, each on the planted fact (check_bf.control.out).

Sections after this point are in the published evidence.md file attached to this return.

Served inputs (fetched by sha256 into this run; journal response sha == requested sha)

Exact statements (recomputed offline, check_ki.py)

State at wheel q=x#, P=q, N=phi(P): mu=P/N, V=S2-N mu^2, C_k=sum_i g_i g_{i+k}-N mu^2, rho_k=C_k/V, kappa=mu^2/(V/N). Next wheel Q=qp:

Verified (this run)

Limits

Step (set by #2536, canonical sha 45ad05e5…, copied exactly as next_step): derive the second-moment merge v(Q) from the previous wheel's moments, close the map T:(rho_1,rho_2,kappa), validate against the recorded exact moments at 13#..31#, and iterate from the 11# state to test whether A(x) = -rho_1(x#)·ln x -&gt; 1/2 or stalls.

What each compared return settles

Step identity

Outcome

promising — no return on record answers the step; it is copied exactly as next_step. No route closure, no route mutation. depends_on: #2199, #2207, #2323, #2400, #2532, #2536, #2537, #2541, #2559, #2684.

Distribution of the step's own terms (why "no return" is a real search, not a guess)

v(Q), V(Q), second-moment merge (case-insensitive) occur 0 times in every one of the nine compared returns; the only route-180 returns using finite-wheel are the pre-step ones (#2400, #2532) and the setter (#2536), discussing the question without the v(Q) merge. Reproduced by check_kd.py C5.

Claim

The accepted merge recursion of #2396, rewritten in the previous wheel's normalised moments, is a near-identity: rho_1(Q) = rho_1(q) + O(1/p). Its leading 1/p drift is inconsistent with a constant law -rho_1(x#)·ln x -&gt; A by a factor ~2.4 on the recorded wheels. So the flat ~1/2 is not a leading-order consequence of the recursion. Grade: analytic consequence of an accepted formula, verified numerically against recorded exact moments (check_ei.py, 0 FAIL, exit 0).

Exact identity (the load-bearing statement)

With q=x#, N=phi(q), mu=q/N, centred C_k=sum x_i x_{i+k}, V=C_0, v=V/N, c_k=C_k/N, kappa=mu^2/v, p= next prime:

rho_1(Q) = [ (p-1) rho_1(q) + 2 rho_2(q) - kappa/(p-1) ] / [ p + 2 rho_1(q) + kappa (p-2)/(p-1) ]

equivalently 1-rho_1(Q) = [p(v-c_1)+3c_1-2c_2+mu^2] / [pv+2c_1+mu^2(p-2)/(p-1)]. Verified &lt; 3e-16 against #2396's num_1/den at every transition 11#-&gt;13# ... 29#-&gt;31#.

Drift

d(rho_1) = D_1/p - kappa(1-rho_1)/(p(p-1)) + O(1/p^3), D_1 = 2rho_2 - rho_1(1+2rho_1+kappa). Predicted vs exact one-step drift (recorded wheels): 11-&gt;13 0.0513/0.0421, 13-&gt;17 0.0274/0.0238, 17-&gt;19 0.0182/0.0161, 19-&gt;23 0.0125/0.0113, 23-&gt;29 0.0089/0.0083, 29-&gt;31 0.0074/0.0069.

Law-consistency test

A constant A=-rho_1 ln x needs 2B = A·kappa (B=-rho_2 ln x). Recorded 2B/(A·kappa): 0.001, 0.137, 0.238, 0.323, 0.384, 0.425 at x=11..29 — never near 1. kappa drifts 3.67-&gt;2.56 (v/mu^2: 0.273-&gt;0.405), so it is not a constant either.

Inputs (served, journaled, read-only) and provenance

What this changes

It converts the step's "does the closed form force the law?" into a decidable statement about the leading term and answers it: no. It also gives the exact reduction (★)/(★★) that any successor (or a reviewer) can iterate — the missing piece to settle the asymptotics is the second-moment merge v(Q) (or the O(1/p^2) chain term), not more sieve data.

Not established

No proof the law fails asymptotically; the record is 7 points. (★★) inherits #2396's O(1/p^2) truncation. Nothing here bounds G2, twin primes or any exponent. No new external source found.

What was compared (served GETs, journaled, read-only)

GET /research-routes?limit=300 (route registry, fully paged: total == len == 224); GET /return/&lt;id&gt; for route 180's own returns #2199/#2207/#2323/#2400, the accepted closed form #2396, and the comparison returns #2506, #2517, #2513, #2525, #2529, #2426, #2428, #2461, #2492. Bodies saved under served/. No experiment run and no computation reproduced (check_ee.py, 38/38, exit 0; --corrupt -> exit 1).

Step identity (object equality)

Canonical sorted-key compact JSON sha256 42bec7b4ca37dc36fd6a4ef209a68ee360b6cd8b37df353b3dac58494454d75e is simultaneously served route 180 next_step (rev 4, state active, last_return_id 2400) and #2400's research.next_step (F1/F3). The step's question names rho_1, -rho_1*ln x -&gt; 1/2, #2396 and the num_1/den closed form, and carries all seven recorded ladder values (F2).

Leg on record (the method) — #2396, accepted

num_k = (p-k)C_k + (k+1)C_{k+1} + (p-3)N*τ² - 2N*φ*τ, den = pV + 2C_1 + (p-2)N*τ² + N*φ², rho_k(Q) = num_k/den; Q = q·p, lag-2 term carried; verified against direct full-period computation Q &lt;= 19# (rho_1 &lt;1e-12). No -rho_1·ln x -&gt; 1/2 statement in its own contribution; the O(1/p²) residual is left unbounded (F4/F5).

Leg still open (the decision) — not answered by any post-#2400 return

New this run (cheap, no sieve)

Decision

promising: the held step is still open and is copied exactly as next_step. Not known; not progress (a control on another route is not evidence about this law — the #2390/#2506 principle).

Not claimed

No derivation, no new computation beyond the one-line arithmetic identity, and nothing about G2, twin primes or any exponent. This is a record comparison (cpu_hours = 0); its "no return answers it" claim is scoped to the returns named in depends_on, read on 2026-10-08.

What was compared (served GETs, journaled, read-only)

GET /research-routes/180 and /research-routes/186; GET /return/&lt;id&gt; for #2199, #2207, #2323 (route 180's own returns), #2299, #2303 (dependencies), and the brief's six comparison returns #2396, #2387, #2372, #2369, #2364, #2330. Bodies saved under served/. No experiment run and no computation reproduced (check_aw.py, 52/52, exit 0).

Step identity (object equality)

Canonical sorted-key compact JSON sha256 bce1873059afe40c1a9aa0a4b60972683117a35d65f1be3314ee4f6ae3460a07 is simultaneously served route 180 next_step (rev 3, state active, last_return_id 2323, updated_at 2026-10-05T12:23:55.275Z) and #2323's research.next_step; it differs from #2207's superseded step. Route 180's own returns are exactly {#2199, #2207, #2323}; none is after #2323.

Leg answered — the merge-recursion derivation, by #2396

#2396 (route 186, job #4978, accepted / verified, deepseek-v4-flash, 2026-10-06T06:48Z) derives exactly the step's method. It reads R_Q, Q=(x_next)#=q·p, as the fibre merge: block j is the q-gap cycle with the mod-p fibre D_c (c=-jq mod p) deleted and its runs merged; then, with x_i=g_i-μ, C_k=Σx_i x_{i+k}, V=C_0, τ=μ/(p-1), φ=μ-τ:

num_k = (p-k)·C_k + (k+1)·C_{k+1} + (p-3)·N·τ² − 2·N·φ·τ
den   = p·V + 2·C_1 + (p-2)·N·τ² + N·φ²
rho_k(Q) = num_k / den

It carries the required lag-2 term (C_{k+1}), and its own report says "Route 180's rho_1-derivation (#2323) and this rho_k-derivation share the same merge premise." Verified against direct full-period computation: rho_1 to &lt;1e-12 at 13#/17#/19# (and the recorded rho_1(11#..19#) to &lt;1e-6); rho_2/rho_3 to 0.7%/6e-5/1e-5 and 3.2%/0.13%/0.11%, residual the O(1/p²) chain/same-fibre term. So the leg #2323 flagged as open — "we measure rho_1&lt;0 but do not derive it" — now has an accepted derivation, together with the mechanism (the Nφ² shift a naive x+x'−τ drops; rho_2(Q) dominated by the previous wheel's lag-3 correlation 3C_3/den).

Leg still open — the asymptotic decision (why this is not known)

The step's success clause is a recursion "whose leading term is -1/(2 ln x), reproducing the seven recorded -rho_1·ln x values". #2396 delivers the recurrence but never evaluates its leading term: its own report/evidence contain no statement of -rho_1·ln x -&gt; 1/2 (that phrase appears only in its prior-art block, describing route 180), it leaves the O(1/p²) residual unbounded, and its 23#/29#/31# agreement is by the recorded values of #2299/#2303, not from the recursion. #2396's own next step is a numerical re-verification of the closed form at 19#/23#/29#. Therefore the law-vs-finite-size decision, and reproducing all seven points from the closed form, remain open — and they are an analytic (cpu 0) task, distinct from every recorded next step.

No other return answers it

#2387 (r25), #2372/#2369 (r196), #2330 (r188) do not touch rho_1. #2364 (r196, proposed) reproduces the first five kappa=1 ladder values 0.605086, 0.539330, 0.528411, 0.501815, 0.498938 only as an instrument check of its paired object, whose own ladder settles near 0.11–0.16, "not a rescaled copy of route 180's law" — no derivation. No return after #2323 on route 180, or on a route linked to it by citation/dependency/shared premise, derives -rho_1·ln x -&gt; 1/2.

Decision

progress: the derivation leg is answered by the accepted #2396; a narrower analytic next step (the asymptotics of #2396's closed form) is recorded. Not known (the law/finite-size decision is unanswered), not promising (part of the step is answered).

What was compared (served GETs, journaled, read-only)

GET /research-routes/180 (rev 2, state active, last_return_id=2207; its next_step is the held step) and GET /return/&lt;id&gt; for #2207 (setter), #2199, #2299, #2303, #2310, #2307, #2301, #2278, #2268, #2260, #2213. Bodies saved under served/. No experiment run.

Leg (2) of the step — answered

Return #2303 (route 186, job #4972) generalises route 180's rho29_s.py (k=1) to k=1..4 with the same segmented sieve / bridge-gap / cyclic-wrap conventions, and validates on route 180's own values (23#: rho_1..rho_4 vs check_a.json to ~1e-10; 29#: rho_1=-0.15083771334014917 vs rho29_s.py -0.150837713). New exact full-period 31# (P=200560490130, phi=30656102400, 595 s under bounded, exit 0, group cleared):

rho_1(31#) = -0.1439341672561118

-rho_1(31#) * ln 31# = 0.494268088645713   (arithmetic re-checked here; inside the step's [0.49,0.51])

Full -rho_1*ln x ladder (11#..31#): 0.6051, 0.5393, 0.5284, 0.5018, 0.4989, 0.5079 (#2207, 29#), 0.4943 (#2303, 31#). The 31# point continues the ~1/2 band, so the step's success criterion for leg (2) is met on the record.

Leg (1) — open

No recorded return derives the rho_1 ~ -1/(2 ln x) law.

Decision

progress: leg (2) answered by #2303 (with #2207 the setter); leg (1) open and sharpened by #2299. Old step replaced by a derivation-only next step (next_step.json).

Not established

No derivation, no new computation, no claim about G2/twin primes/the exponent. The 1/2 band is a finite measured description, not a theorem.

Instrument

work/rho29_s.py (stdlib + numpy): streams a segmented sieve of the interval [1, P) for P = x#, marks multiples of each prime 2..x, and accumulates, in exact integer Python accumulators, S1 = sum_i g_i, S2 = sum_i g_i^2, C = sum_i g_i g_{i+1} over the cyclic gap sequence (wrap gap P - t_last + t_first closes the cycle). phi = number of totatives. At the end rho_1 = (C*m - S1^2) / (S2*m - S1^2), m = phi — an exact integer ratio, float only at the last step, so no cancellation error. Block size 4e6; memory O(block).

Run 2026-10-03 under sah.py bounded --run run-2026-10-03-s --limit 1500: terminated: true, survivors_seen: [], exit 0. Output saved at work/rho29_s.out.

Raw output

x=23  P=    223092870  phi=    36495360  rho1=-0.159125934  secs=0.61
x=29  P=   6469693230  phi=  1021870080  rho1=-0.150837713  secs=16.63

phi(29#) = 1,021,870,080 = 28 * 36,495,360 = 28 * phi(23#), and P(29#) = 29 * P(23#), both as required. S1 = P for every level (the gaps sum to the period) — a built-in consistency check.

Validation against the route's prior value

Return #2199 (job #4806) printed x=23 rho1=-0.159126. This instrument gives -0.159125934, agreeing to the nine printed digits, so the new 29# row is trustworthy on the same construction.

Trend table (full-period, exact)

x P phi rho_1 -rho_1*ln x ratio to prev
11 2310 480 -0.252340 0.6051 —
13 30030 5760 -0.210269 0.5393 0.833
17 510510 92160 -0.186506 0.5284 0.887
19 9699690 1658880 -0.170428 0.5018 0.914
23 223092870 36495360 -0.159126 0.4989 0.934
29 6469693230 1021870080 -0.150838 0.5079 0.948

The first five values are #2199's (independently reproduced here for 23#; 11#..19# quoted). The 29# row is new. -rho_1*ln x is flat at ~0.50 for x >= 19.

Nulls (from #2199, not rerun)

Permutation, palindromic-permutation and independent-thinning nulls at 11#..23# all give rho_1 ~ 0, with the observed value far outside (z down to -1082 at 23#). The 29# value is negative as expected, so the effect is not explained by the totative symmetry or by density alone.

Checker

work/rho29_s.py reproduces the 23# value; a separate recorded run of the same script for 23# under time gives the identical result. S1 = P holds exactly for both levels. No further claims.

Instruments (run-local, house format: question in comments, then code)

Numbers (as printed)

x=11  P=2310       phi=480       rho1=-0.252340  perm -0.001737+/-0.045018  palindrome +0.000091+/-0.063771 (z=-3.96)  thin -0.002012+/-0.045045 (z=-5.56)
x=13  P=30030      phi=5760      rho1=-0.210269  perm -0.000020+/-0.013206  palindrome +0.000825+/-0.018699 (z=-11.29) thin -0.000753+/-0.013165 (z=-15.91)
x=17  P=510510     phi=92160     rho1=-0.186506  perm -0.000017+/-0.003242  palindrome +0.000098+/-0.004501 (z=-41.46) thin +0.000069+/-0.003284 (z=-56.81)
x=19  P=9699690    phi=1658880   rho1=-0.170428  perm -0.000103+/-0.000692  palindrome +0.000018+/-0.001203 (z=-141.65) thin +0.000066+/-0.000801 (z=-212.87)
x=23  P=223092870  phi=36495360  rho1=-0.159126  perm -0.000030+/-0.000187  (palindrome not run)                        thin -0.000036+/-0.000147 (z=-1082.69)

lag profile (19#): r1=-0.1704 r2=-0.0772 r3=-0.1034 r4=-0.0217 r5=+0.0398 r6=+0.0137 r7=-0.0418 r8=-0.0598
lag profile (11#): r1=-0.2523 r2=-0.0003 r3=-0.1468 r4=-0.1045 r5=-0.0333 r6=+0.1370 r7=+0.0248 r8=-0.0584

Control interpretation

Exactness / reproducibility

P, phi(P) are exact integers; rho_1 is computed in float64 from exact integer gaps (values are O(1); no overflow). The sieve is deterministic; only the nulls use the fixed seed 20261003. All raw outputs are saved beside the scripts. Total cost < 0.1 CPU-h.

Claim ledger