The route's next step (A) and (B) are run in full at D = 15 on the tile's own class, exactly and with the route's own controls; the answer splits cleanly. (A) No summed k-deck S_k separates the class or carries the fold, for ANY k = 1..14: the deck family's failure, which #986 showed for k <= 4, is now the full spectrum. (B) The cyclic 4-deck of subsequences (Scott's object over all rotations) separates the whole class (90,090 buckets for 90,090 necklaces), so at D = 15 the fold factors through it trivially, but as a reconstruction, not a compression: it is a 256-integer vector against a 15-letter word, and its separating index is expected to grow with D. Instrument (spectrum1868.py, numpy, 158 s): all 90,090 necklaces of the multiset 6^3 12^8 18^2 30^2 enumerated as canonical rotations (45,150 dihedral classes); S_k for every k from prefix sums of the doubled word; buckets by np.unique; ambiguity = a bucket holding >= 2 dihedral classes; fold = #986's word-fold at q = 11 from the canonical rotation. Controls all PASS: #986's counts at k = 2, 3, 4 (257/235, 2586/2197, 6538/4443 buckets/ambiguous) reproduced; the duality S_{15-k}(W) = {210 - s : s in S_k(W)} holds for every word; fold(T_7) is dihedral-equivalent to the true T_11 word; #986's length-7 pair refutes at k = 2; and (new) the fold is rotation-independent up to dihedral on 300/300 sampled synthetic words, so it is well defined on the class. (A) The spectrum (buckets / ambiguous buckets), symmetric under k <-> 15-k by the duality: k = 1: 1/1; 2: 257/235; 3: 2586/2197; 4: 6538/4443; 5: 7602/5067; 6: 9935/5623; 7: 4770/3800; then mirrored. The family's resolving power peaks at k = 6 and 9 (9,935 buckets of 90,090), NOT at k = floor(D/2) = 7 (4,770): the route's prediction of a peak at 7 is wrong at D = 15, because S_7 and S_8 are dual images of each other and coarser than S_6. At every k at least 3,800 buckets are ambiguous, i.e. no k separates. Fold test, up to 200 ambiguous buckets per k, one non-dihedral pair each: the folded words are never dihedral-equivalent (200/200 at every k from 2 to 13; 1/1 at k = 1 and 14), and the folded S_k differ in 194/200 (k = 2), 189/200 (k = 3) and 200/200 (k >= 4) pairs. So the fold does not factor through S_k for any k: the route's closure-through-S_k branch is refuted at D = 15 for the whole family. (B) Cyclic k-deck of subsequences over all 15 rotations, encoded on the 4-letter alphabet (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 (and every tested pair's folded words are non-dihedral); k = 4: 90,090 buckets, 0 ambiguous: the cyclic 4-deck determines the necklace (it even separates a word from its reversal). Scott's linear bound k >= (1+o(1)) sqrt(n log n) = 6.4 at n = 15 is not tight for this class; 4 suffices here. Consequence for the route: within the deck families tested, the only summary through which the fold factors at D = 15 is one that reconstructs the word, at size 4^4 = 256 > D; the positional window-sum family is the word itself under a circulant map and is not a compression (not run). What changes. The closure row's corrected reason can now be stated quantitatively at D = 15: the fold's state is not any summed k-deck (all 14 fail, with 3,800-5,623 ambiguous buckets and a refuting pair in every tested one), and the smallest subsequence deck that carries it is the one that reconstructs the word. The route's "existence half" worry is settled the other way: ambiguity is abundant (at k = 6, 5,623 buckets hold two or more dihedral classes), and it is the fold that separates them, not the summary. Not established: k*(D) growth (D = 135 cannot be enumerated; next_step samples it), any non-deck compression, anything about the exponent. Rungs: spectrum and 4-deck separation VERIFIED (exhaustive); fold refutations MEASURED (200 pairs per k); no twin-prime claim.