“F14.6c: every move of the type-1 library (either order), then the sculpture's table with a puzzle word and a dictionary word summed as the key; the known letters force the dictionary word, looked up among every rotation; K4 against 30 shuffles, 8 plants”
F14.6c (issue #93; reports/f14.6-grammar.md form 9). 0115 summed a puzzle word and a dictionary word with no move; F6 (0110-0114, 0129) put single keys of length 1-26 after or before every move. The sum of two words repeats only every lcm(m, n) letters, beyond every F6 length. Here: 27,852 moves x 2 orders x 24 rules x 1,085 puzzle-word starts (1.45 x 10^9 settings per text); for each, the known letters force the dictionary word at the slots they cover (bit-packed same-slot checks over all moves at once), and the forced word is looked up among every rotation of every dictionary word of 3-24 letters.
Shuffle the letters through a grida grid Writing the message into rows of some width and reading it out in another order, column by column for instance, which shuffles the letters without changing them. as in the third section, then use the tablethe table The right-hand half of the sculpture, 26 rows of the alphabet each shifted one place further, starting from the word KRYPTOS. twice with two words, one from the puzzle and one any English word. Using the table twice is the same as using it once with the two words added. For every grid shuffle and every puzzle word, the clue wordsthe known letters Sanborn has confirmed that positions 22 to 34 of the message read EASTNORTHEAST and positions 64 to 74 read BERLINCLOCK. tell us exactly what the second word would have to be; we look it up in the dictionary.
Words in the margin are defined on the glossary page.
1.1
The method at work
The carved letters go in at the top; the reading comes out at the bottom.
the idea
F14.6c: K3's grid shuffle, then K1's table used twice, with a puzzle word and any English word.
the check
1,450,532,160 settings per text; the known letters force the second word, looked up from every start.
the bound
No word on K4 or any shuffle; plants 8 of 8: dead. One count cell (A23) just above the shuffles, with no word behind it.
2
Experiment lineage
What this experiment was built on, from the lineage page: 4 experiments before it, back to the root of its line. Its number is in bold.
keptreverted, in its family's colour×error or timeoutreverted under today's rulesbuilt on a parent in the same familybuilt on a parent in another family
3
Best candidate against the known letters
This experiment produced no candidate: the search ruled everything out before a full text was built. Its product is the bounded negative under Result and bounds below.
4
Walkthrough, by hand
Redo the method on a few letters with pencil and paper.
Pick a move, say K3's rule with some numbers, and see where each known letter lands.
Pick a rule of the table and a puzzle word with its start, say KRYPTOS from its K.
At each known place, the table needs some key letter; take KRYPTOS's letter off it: the rest is the second word's letter.
For a second word of length 9, places in the same slot (landing place mod 9) must agree; then read the word off and look it up.
Repeat for every move, order, rule, puzzle word and length, and for the shuffles of K4.
the worksheet: the first steps by hand, on squared paper
5
Worked example, generated
The same steps run by the code on the real letters.
No move, KRYPTOS table (Vigenere), KRYPTOS from K as the puzzle word; the dictionary word's forced letters:
place known carved key value KRYPTOS second word's letter
22 E F 1 K R
23 A L 10 R C
24 S R 21 Y N
25 T V 18 P I
64 B N 11 K E
65 E Y 17 R J
66 R P 2 Y K
With a move, each known letter's slot is its landing place (order A) or its message place (order B) mod the word length.
6
Hypothesis, for a cryptanalyst
Family, key space, the constraint under test, and the clues it reads.
C1(a) (Sanborn's matrix, then the table), C5 ('key word/s'), C20(a) ('layer two' as a second pass with a second word), Scheidt's 'building layers... mix and match'. K3's matrix, then K1/K2's table used twice with two remembered words. Pre-registered: no setting fits K4 (a hit needs the forced letters to spell a word); hit counts against 30 shuffles; a plant (Carter, random move, order, rule, puzzle word and dictionary word) is found when its own keys come back.
7
Prediction
Written before the run; the result decides it.
No hit on K4; none or almost none on shuffles; plants 8 of 8.
8
Method
Moves: 0129's type-1 library (27,852), orders A (move, then table) and B (table, then move).
Rules: 24 (Vigenere, variant, Beaufort; plain, cipher and key alphabets standard or KRYPTOS).
For each rule and puzzle-word start: the remainder the dictionary word must supply at each known place, for every move at once; same-slot agreement packed as bits; per length 3-24 and order, survivors' forced words looked up among every dictionary rotation (covered slots matched where the known places leave some uncovered).
K4 and 30 shuffles; 8 plants with their own known letters; K4's hits decrypted and submitted.
9
Result and bounds
The harness's record: candidates, gates, loss, and the negative result this experiment leaves behind.
0candidates returned
0passed every gate
0/24known letters, best
–lowest loss
nonechampion before
1,450,532,160 settings per text; dictionary-word hits K4 0, shuffles max 0; cells with K4 above every shuffle 1 of 44; plants 8/8