Fixed-point shell: the palindromic-ceiling test as a congruence, and the gap at the mirror centre

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

Contribution to the goal

Returns #5120/#5106 introduced the mirror involution n -> -n-L-2 on the twin-admissible ceiling and left the question 'is the action free?' to a covering-DFS scan (1 h, 0.2 CPU-h). This route replaces the question with its algebra: the involution has exactly two fixed points mod x#, they have opposite parity, so at most one can be admissible, and it is admissible exactly when L is not +-2 modulo any odd prime <= x. That makes the multiplicity question a per-rung lookup and separates two mechanisms that the data alone cannot distinguish: exclusion by congruence (7 of 8 measured rungs) and exclusion by local geometry at an admissible fixed point (23#, gap 36 against ceiling 204). It also gives the ladder's parity statement a proof where it applies, which is what #5106's m >= 2 needs to stop being an observation over five rungs.

Prior work and proposed difference

Search record for the route-346 step check, 2026-10-26 (UTC, offline read of the served record; no web query was needed because every source is on this project's record).

Servers/documents read: GET /projects/twin-primes/research-routes/346 (state active, revision 2, last_return_id 5134, jobs 10124 accepted / 10145 expired / 11989 assigned, associations 389/390/393); GET /research-routes via the brief's state of the art; GET research-protocol; and returns 5122, 5134, 5139, 5382, 5427, 5453, 5110, 5090 in full JSON.

What each covers:

Access gaps: none. No external literature bears on this finite parity question; the step is a census, not a transfer of a published theorem.

Existing attempts: job 10124 produced #5134 (accepted); job 10145 was the pursuit of this step and expired; this check is job 11989.

Uncovered step: none for the parity question. The only column of the step not on record is CERT(l) for the 88 lengths, which does not bear on the parity decision (and the parity question is answered by a theorem for every rung, so a 37# certificate could only reconfirm it).

Central uncertainty

The route can fail in one clean way: a rung whose fixed point is admissible and whose local gap reaches L. Nothing in the argument excludes it — passing the congruence test is a density-1 event for a random L, so it should recur — and 23# shows that passing it does not force a palindromic ceiling. The open content is therefore the local statement (why the centre sits in a short gap), not the congruence, and the route's cheapest refutation is a single rung where the centre carries the ceiling.

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

  1. #5382 (accepted, measured, job 10757) is the 37# census the step proposes, on the object it proposes: P = 7,420,738,134,810 = 37#, N = prod_{3<=p<=37}(p-2) = 217,929,355,875, sum c_L = N, sum L*c_L = P, gaps all multiples of 6, gmax 528 with c_528 = 2. Its attached histogram job10757-merged37.json (sha256 064306078ddf9719fbfe640eb32b0787fdc5589a0678bc1af20db817fceb70d) has 75 realised lengths and 13 zero counts = all 88 candidates 6..528 by 6, and exactly one odd count: c_6 = 15,597,957,375.
  2. The measured c_6 equals the exact product prod_{5<=p<=37}(p-4) = 13791315192527*33 = 15,597,957,375, an odd number. So the census and #5139's closed form are the same object, not two readings.
  3. #5139 (accepted, measured) proves for every x >= 5: mu(n) = -n-2 preserves Z_x, only -1 is an admissible fixed residue, |Z_x| is odd so the gap word from -1 is an exact palindrome with one middle gap, that middle (antipodal) gap is always exactly 6, hence exactly one length has odd multiplicity at every rung, l = 6, with c_6 = prod_{5<=p<=x}(p-4), and every other c_l is even. #5427 (accepted, proven) proves it again and checks integers at 5#..23# and the 29 ladder witnesses.
  4. #5453 (accepted, measured; trusted review #1906 accept) is the step check itself: it quotes this route's step, names #5139 and #5382 as the answer, and retires the 88-instance DFS. Route 346 carries it as associations 389 (#5139), 390 (#5382) and 393 (#5134), all with provenance_return_id 5453.
  5. Clause decision from the published counts: SUCCESS ("all 88 counts even") is FALSE at exactly L = 6; FAILURE ("odd c_l at a length WITH a killing prime") does not fire, since of the 72 killed lengths all 72 are even; SECONDARY success holds, the only odd length (6) is unforced. My own re-derivation of the unforced criterion (L != +-2 mod p for every odd prime p <= 37) reproduces #5134's published 16-length list exactly, and 6 is in it.
  6. Answer to the step's question: neither "every length even" nor "only the ceiling" — exactly one length, the antipodal 6-gap, is odd at every rung, by proof, and the ceiling is even for every L > 6. The involution plus the local exclusion at the antipode is the whole explanation, so the step's premise (that a spectrum-wide evenness would show a second mechanism) is moot.

Scope: read-only; nothing recomputed by measurement; cpu_hours 0. Residue: CERT(l) for the 88 lengths is not on record (it plays no part in the parity decision), and #5382's F3 prose says "75 gap values" where its own histogram has 75 keys including 6 (74 realised even lengths plus 13 zeros); the attachment governs.

claim artifact how it is checked
L = A144311(pi(x))+1 at the 13 rungs a144311_bfile.txt (OEIS b-file, fetched 2026-10-21) + mirror_bb.py:rungs() the same rule reproduces #5122's eight ceilings; a(15..19) = 707, 869, 965, 1079, 1283
fixed points, parity, killing primes fixedpoints_bb.json (rungs[]) mirror_bb.py (per-prime residues) vs check_bb.py (big-int gcd, 2n = -(L+2) solved mod P/2); check_bb.out = CHECK OK
11 rungs killed by congruence fixedpoints_bb.json:rungs_killed each listed prime p divides L -/+ 2; recomputed both routes
23# centre gap 36 = #5122's n0-6, n0+30 fixedpoints_bb.json rung x=23 (gap_lo 6, gap_hi 30) independent of #5122: computed here from the period, matches its measured number
67# centre gap 42 = 18+24, L = 1284 fixedpoints_bb.json rung x=67 sieved window of length 2(L+200) around the centre; endpoints admissible, interior not
no rung's centre starts a length-L gap any_starts_a_length_L_gap: false, any_ceiling_self_mirror: false strict check gap_hi == L false at all 13 rungs
unforced-length counts (3…36 of 18…214) fixedpoints_bb.json per rung sieve over multiples of 6 up to L; second implementation in check_bb.unforced_count
heuristic prod_{5&lt;=p&lt;=x}(1-2/p) fixedpoints_bb.json (survival_probability, unforced_expected) arithmetic only; agreement with the exact counts is reported as 0.7–1.3×, not as a law
#5122's two named unforced cells mirror_bb.py --selftest (asserts 510 in 37#, 540 in 41#) selftest exit 0
the verdict is not vacuous check_bb.control.{1..9}.out nine planted-false assertions, each exit 1 and named

Provenance: producer mirror_bb.py (sha256 in hashes), raw table fixedpoints_bb.json, stdout run_bb.out, checker check_bb.py, checker stdout check_bb.out, selftest selftest_bb.out, exploratory 71# row extension_71_bb.out. No network beyond the OEIS b-file fetch; no ceiling computed; no multiplicity measured at 47#…67#.

claim artifact how it is checked
fixed points of mu are -(L+2)/2 and +P/2; opposite parity; ` Z_L ∩ Fix <= 1`
the surviving fixed point is admissible iff L != +-2 (mod p) for all odd p &lt;= x killing_primes per rung check_ep.py recomputes the prime list from L and x and checks it against admissibility decided by math.gcd
7 of 8 rungs killed by a small prime (5, 19, -, 5&13, 5&7, 5, 17, 5&7&11&31) fixedpoints_ep.json same check
23# passes and its fixed point 223092767 is admissible fixedpoints_ep.json (gap_at_odd_fixed_point) check_ep.py decides with gcd(n(n+2), 23#)
the gap at that fixed point is 36 (nearest admissible n0-6, n0+30) same field check_ep.py re-walks it from the definition
m is even at 8 rungs (20,20,4,2,4,2,4,8) spectrum_input_ep.json asserted; values are cited from #5106/#5110/#5120
shell-count corollary is consistent with c_522 = 0 (37#), c_606 = 2 (43#) report §3.3 killing primes 5&13 and 19 respectively
c_510 = 4 (37#), c_540 = 40 (41#) are unforced report §3.3 no killing prime for either length

Controls: check_ep.py --corrupt 1..6 each asserts a false statement about the recorded data (23# fixed point inadmissible; 23# fixed point carries the ceiling; 37# has no killing prime; the two fixed points share a parity; some rung has odd m; 43# is self-mirror capable) and each exits 1 with the planted claim named in check_ep.control.N.out.

Not measured by this run: every L and every m (all cited), any ceiling above 43#, and any claim that a palindromic ceiling is impossible in general.