“The sculpture's texts as a running key plus one constant shift of the table, with or without a K3-style move”
0017 and 0090 used the sculpture's texts (the K1/K2 matrix among them) as a running key letter for letter. Sanborn was 'surprised that no one had tried recovering the original matrix and running it through all the possible shifts'. Here every key text gets a constant shift of the table, all 26, on top: the known letters must then differ from the key text by one constant, which is tested exactly through difference signatures, with no move and with every move of the type-1 library, before or after the table.
Sanborn once said he was surprised nobody had taken the original matrix and run it through all the possible shifts. One reading: take one of the sculpture's texts as a long key, and slide the whole table by a fixed amount, any of 26, before using it. We test every text, every starting point and every shift, with and without the grid moves of experiments 80 to 83, 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..
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
Sanborn said he was surprised nobody had run the original matrix through all the possible shifts. One reading: use one of the sculpture's texts as a long key and slide the whole table by a fixed amount first.
the check
At each known place the key needed is the carved letter minus the known letter. With a fixed slide, needed minus offered must be the same at all 24 places; in this example no shift is shared by more than a few.
the bound
Every text, start and shift, with and without 27,852 grid moves on either side: no full match, no crib word alone, and the deepest partial run, 8, sits among the scrambled coppers' 7 to 9.
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.
Take the K1/K2 ciphertext block as the key text, from offset 0, and the sculpture's alphabet with Vigenere.
At each known place, the key needed is the carved letter minus the known letter; the key text offers its own letter there.
With a constant shift s, needed = offered + s at every known place, so needed minus offered must be the same 24 times.
Slide the offset through the whole text, both directions, and repeat for every text, rule, and every grid move before or after the table.
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.
key text: the four ciphertexts as one panel (the K1/K2 block first), offset 0; sculpture's alphabet, Vigenere
place known carved needed key text offered needed - offered
22 E F 1 K 0 1
23 A L 10 R 1 9
24 S R 21 N 19 2
25 T V 18 S 6 12
64 B N 11 V 22 15
65 E Y 17 F 12 5
74 K K 0 W 23 3
a constant shift would make the last column the same at all 24 places
5
Hypothesis, for a cryptanalyst
Family, key space, the constraint under test, and the clues it reads.
C2(b): 'shifts' as the 26 row shifts of the tableau, the matrix as the K1/K2 block or another carved text; C6(a). Model: c_i = E(p_i, k_{o+i} + s) for a key text k, offset o and constant s; E in 12 conventions (Vigenere, Beaufort, variant; plain and cipher alphabets standard or KRYPTOS) and key letters numbered on the standard or KRYPTOS alphabet. Because s is free, only the differences between known places matter: the 23 differences of the forced key must equal the key text's. Key texts as in 0090 (tableau by rows, rows with index, columns; Morse as carved and reversed; the four ciphertexts; K1-K3 plaintexts; Sanborn's 1989 letter, 1991 dedication texts and 2025 letter), forward and backward, every cyclic offset; Carter's book in the change-then-move order only. Moves: the type-1 library (identity included). Change then move: a dictionary of window signatures; move then change: a pair index on differences, filtered check by check. Ten shuffled coppers.
6
Prediction
Written before the run; the result decides it.
No text, offset, shift and move fits all 24 known letters; the deepest partial agreement matches the scrambled coppers'. Zero candidates.
7
Method
Build the key texts (both numberings) and the route library.
Change then move: index every window's 23 key differences at the crib places; for each route and convention, compute the forced differences and look them up (all 24, and each crib stretch alone).
Move then change: for each key text, find the offsets that agree on the first two moved crib places through a pair index on differences, then filter.
Repeat on ten shuffled coppers.
8
Result and bounds
The harness's record: candidates, gates, loss, and the negative result this experiment leaves behind.