“F6.6: move, change, move again: a grid reading or K3's rule, then a repeating key on the table, then a second move, every pair from a library of 950 moves”
F6.6 (pivot audit, issue #55, D4; directions.md type 1, 'move, change, move again'). 0080 tested key-move-key; the move-key-move sandwich was dropped after P3. Here: the message moved by M1, enciphered by a repeating key on the standard or KRYPTOS table, then moved by M2. The key's slots follow M1's places, the carved letters sit at M2(M1). Library: the four column readings (0134's) at every width 2-96 and K3's rule i -> b i mod 97 for every multiplier b, each forwards and inverted: 950 moves, every ordered pair (902,500), compiled, exact; ten scrambled coppers.
revertedstatus
a new rootparents
2 mintime, all phases
0candidates
0/24known letters
unclocked
1
The experiment method
What the method does with the 24 known letters.
Write the messagethe message The 97 letters of English that Jim Sanborn wrote and enciphered. in 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. and copy it out, encipher it with a repeating secret wordthe secret word The word or string a cipher needs besides the method. on the sculpture's tablethe table The right-hand half of the sculpture, 26 rows of the alphabet each shifted one place further, starting from the word KRYPTOS., then write the result in a grid again and copy it out once more. We try every pair of grid readings and K3the earlier messages The three solved parts of the sculpture.'s own counting rule as the two moves, with secret words of 1 to 26 letters, against the 24 known lettersthe known letters Sanborn has confirmed that positions 22 to 34 of the message read EASTNORTHEAST and positions 64 to 74 read BERLINCLOCK. and scrambled copies of the carved textthe carved letters The 97 letters cut into the copper at the CIA, shown at the top of every experiment page..
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
Move the letters, encipher them on the table, move them again: the sandwich Sanborn's 'double matrixes' and 'layer two' allow, which had been dropped after an earlier pivot.
the check
Every ordered pair of 844 moves (grid readings at every width, K3's counting rule at every step, both directions), with a repeating key of 1-26 on the sculpture's tables between them, against the 24 known letters and ten scrambled copies.
the bound
No key shorter than 20 fits K4; the copies reach 18. K4 leads the copies in 1 of 26 cells: chance.
2
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 in section 7.
3
Walkthrough, by hand
Redo the method on a few letters with pencil and paper.
Write the 97 letters in rows of 9 and copy them out down the columns (move 1).
Encipher the moved text with a repeating word on the sculpture's table.
Write that in rows of 13 and copy it out up the columns (move 2): this is the carved text.
Follow each known letter: its key slot is its place after move 1, mod the word length; its carved letter is at its place after move 2.
Two known letters in one slot must force the same key letter. Repeat for every pair of moves and every length.
the worksheet: the first steps by hand, on squared paper
4
Worked example, generated
The same steps run by the code on the real letters.
move 1: rows of 9 read down the columns; key on the table; move 2: rows of 13 read up, right first
place letter after move 1 slot mod 11 carved place carved
22 E 36 2 26 Q
23 A 47 2 39 Q
24 S 58 2 53 K
64 B 8 7 42 Q
65 E 19 7 56 D
74 K 20 8 48 Z
5
Hypothesis, for a cryptanalyst
Family, key space, the constraint under test, and the clues it reads.
C1(a) and C1(c) (Sanborn, CNN 2005: 'a matrix code... double matrixes and triple matrixes... then went back to this table', knowledge/sources/cnn-2005-sanborn-interview-transcript.txt), C2(a) (K3's rule), C20(a) ('layer two'). Model: c_{M2(M1(i))} = T(p_i, k[M1(i) mod p]) for one of 8 table classes (plain and cipher alphabets standard or KRYPTOS, Beaufort or not), p 1-26. A period is live if no slot holds two different forced key letters. Statistic fixed before the run (0134's): cells (p) where K4's live count is above every copper's, against each copper's count against the rest; K4's settings live below 20 listed.
6
Prediction
Written before the run; the result decides it.
Nothing live below key length 20 beyond the coppers' rate; K4 above every copper in no more cells than the null's maximum. Zero candidates.
7
Method
Build the 950 moves (where-maps).
For each ordered pair: the slot of each known letter (M1's place mod p) and its carved letter (at M2(M1)).
Compiled: per class and text, live periods 1-26; counts.
K4 against the coppers with the fixed statistic.
8
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
712,336 move pairs x 8 classes, periods 1-26: shortest live on K4 20 (coppers 18); live below 20 K4 0 (coppers 0-1); K4 above every copper in 1 of 26 cells, null 0-2; stop False
What was searched, as the harness recorded it.
family
move, repeating key on the standard/KRYPTOS table, move again; 950 moves (four column readings at widths 2-96, K3's rule at every multiplier; forwards and inverted), every ordered pair