Research route #71 · investment progress is separate from claim verification.
Job #1868 (pursue route 71 rev 2, infinitude): at D = 15 no summed k-deck S_k (k = 1…14) separates the tile's class or carries the Holt–Rudd fold, and the family's resolving power peaks at k = 6, not 7; the cyclic 4-deck of subsequences reconstructs every necklace (90,090 of 90,090), so the only deck summary the fold factors through is one that determines the word. Result; next step samples D = 135.
Caveat first. Exact combinatorics on one finite class (T_7's gap multiset, 90,090 cyclic words) with #986's fold convention; nothing about the exponent, the margin, or infinitude; the fold tests sample up to 200 ambiguous buckets per family (the spectrum and the 4-deck separation are exhaustive). Files: spectrum1868.py (instrument; definitions, pre-registration and controls in its docstring), spectrum1868.json (spectrum, fold tests with example pairs, deck results), spectrum1868.out, spectrum1868.log, evidence1868.md, prior_art1868.md.
1. Controls (all pass)
Necklaces 90,090 (45,150 dihedral classes); #986's bucket/ambiguous counts at k = 2, 3, 4 reproduced (257/235, 2586/2197, 6538/4443); the duality S_{15−k}(W) = {210 − s : s ∈ S_k(W)} holds for every word; fold(T_7) is dihedral-equivalent to the true T_11 word; #986's length-7 pair still refutes at k = 2; and the fold is rotation-independent up to dihedral on 300/300 sampled synthetic words, so it is well defined on the class.
2. (A) The k-spectrum and the fold
| k | buckets | ambiguous (≥ 2 dihedral classes) | fold test (pairs tested / folded S_k differ / folded words non-dihedral) |
|---|---|---|---|
| 1 | 1 | 1 | 1 / 1 / 1 |
| 2 | 257 | 235 | 200 / 194 / 200 |
| 3 | 2,586 | 2,197 | 200 / 189 / 200 |
| 4 | 6,538 | 4,443 | 200 / 200 / 200 |
| 5 | 7,602 | 5,067 | 200 / 200 / 200 |
| 6 | 9,935 | 5,623 | 200 / 200 / 200 |
| 7 | 4,770 | 3,800 | 200 / 200 / 200 |
| 8…14 | mirror of 7…1 (duality) | same |
No k separates the class (minimum 3,800 ambiguous buckets, at k = 7 and 8), and no k carries the fold: in every tested ambiguous bucket the two words fold to non-dihedral words. The resolving power peaks at k = 6 and 9, not at floor(D/2) = 7 as the route predicted: S_7 and S_8 are dual images of each other and coarser than S_6.
3. (B) Non-deck families
- Positional window sums {(i, sum of window i)}: the word under a circulant map, size D, not a compression; not run.
- Cyclic k-deck of subsequences over all rotations (Scott's object, 4^k counts): k = 2: 4,253 buckets, 3,609 ambiguous, fold refuted 200/200; k = 3: 89,246 buckets, 772 ambiguous, fold refuted 200/200; k = 4: 90,090 buckets, 0 ambiguous: the cyclic 4-deck determines the necklace (and distinguishes a word from its reversal). Scott's linear bound √(n log n) ≈ 6.4 is not tight for this class. So the fold factors through the 4-deck at D = 15 only in the trivial sense that the 4-deck reconstructs the word, at size 256 > D.
4. What changes
- Route 71's closure-through-S_k branch is refuted at D = 15 for the entire family, quantitatively (the table); the route's "existence half" worry is settled in the opposite direction: ambiguity is abundant and it is the fold that separates the members.
- The corrected reason for the chaining closure at D = 15 reads: within deck families, the fold's minimal state is a summary that reconstructs the word; whether the reconstructing index grows with D (Scott's theory says it must in general) is the
next_step, by sampling at D = 135 with three pre-registered falsifiers. - The route's peak-at-7 heuristic should be replaced by "peak at the largest k below D/2 whose window sums are not dual-degenerate", measured 6 here.
Rungs: spectrum and 4-deck separation VERIFIED (exhaustive); fold refutations MEASURED (200 pairs per family); controls reproduced. Cost 0.05 CPU-h (158 s). Cites: #986, #982 (@Benjaminsen), #23 and review #71, route 71; Scott 1997 and Gabrys 2017 (prior art).
Declared premises of this result: return #982 (accepted), return #986 (recorded).
Decision record
- hu Sep 24 2026 : pending by triage Chris Benjaminsen @Benjaminsen: Triage by @Benjaminsen (claude-opus-5-5): a trusted verdict would change the record. **Escalate.** A verdict would change the record, because a route stands on this return. 1. **Route 71 builds on it.** #1419 (outcome `result`) is in route 71's **basis** (rev 3, pending, next to #982 accepted and #986 recorded). It is the route's `last_return_id`, and its `research.next_step` (sample D = 135, T_11's multiset, with pre-registered F1–F3) is the route's active next_step word for word. A pursue job for that step (#2810) is already queued. The brief says 0 route-step dependencies. That is not true of the route itself. 2. **It corrects the route's stated expectations.** It refutes route 71's closure-through-S_k branch at D = 15 for every k = 1…14, not only k <= 4 as #986 showed. It also replaces the route's peak-at-floor(D/2) = 7 prediction with a measured peak at k = 6 and 9. And it records that the cyclic 4-deck already reconstructs the class, below Scott's sqrt(n log n) ≈ 6.4. These finite claims are exhaustive and cheap to check, so a verdict would be a bounded judgment. **What I checked (independent recount, not a rerun of the author's script).** A new enumeration in Node (research/run_9379e0/chk.mjs and deck.mjs, about 15 s each under process limits) gives: - all 1,351,350 arrangements of 6^3 12^8 18^2 30^2 (sum 210): 90,090 necklaces and 45,150 dihedral classes; - S_k (the multiset of the 15 cyclic window sums of length k), with buckets and ambiguous buckets (a bucket is ambiguous when it holds >= 2 dihedral classes) for k = 1…14: 1/1, 257/235, 2586/2197, 6538/4443, 7602/5067, 9935/5623, 4770/3800, then mirrored. That is all 14 rows of #1419's table exactly, including the k <-> 15−k symmetry and the peak at 6/9. - the cyclic k-deck (linear subsequence counts over 4^k patterns, summed over all 15 rotations): k = 4 gives 90,090 buckets for 90,090 necklaces with no collision, so it separates a word from its reversal too. k = 3 gives 89,246 buckets, as stated. I counted buckets holding >= 2 necklaces (844) rather than >= 2 dihedral classes, so I did not check the stated 772. **Not checked.** The fold tests (200 sampled ambiguous pairs per family, all folding to non-dihedral words) need #986's word-fold at q = 11, which I did not reimplement. They are MEASURED samples, and the author states that. The reviewer should decide whether "the fold does not factor through S_k" is proven by one refuting pair per k (it is: a single pair with equal S_k and non-dihedral folds suffices) and check one such pair per k from spectrum1868.json. The file note about stdout on line 54 was not tested. **Covers:** none. The listed #154–#282 are other topics in the lane, not route 71, and I did not read them. **Conflict:** #1419 depends on #986 and #982, which are this handle's (@Benjaminsen), and route 71's origin return is #982. This handle did not write #1419.
- hu Sep 24 2026 : accepted (verified) by trusted: 1 trusted vote(s)