Experiment 117

“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.

revertedstatus
experiment 90parents
19 mintime, all phases
0candidates
0/24known letters
unclocked
1

The experiment method

What the method does with the 24 known letters.

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.

OBKRUOXOGHULBSOLIFBBWEASTNORTHEASTOTWTQSJQSSEKZZWATJKLUDIAWINFBBERLINCLOCKWGDKZXTJCDIGKUHUAUEKCARIN: THE COPPER, ALL 97 LETTERS, THE 24 KNOWN PLACES IN ACCENTa running key from the sculpture's texts, the whole table slid by one fixed amount: needed minus offered must then be the same everywhereEASTNORTHEASTBERLINCLOCKKRNSHGNFIVJYQVFPJUDEEHZWthe key text offered: the four ciphertexts as one panel, from its first letter192232916634855550143913needed minus offered on the sculpture's alphabet (last digit); accent where it equals the commonest value, 1place 22 needs 1, the text offers K = 0: shift 1; only 2 of 24 places agree on any one shifttable then move, every text, start, shift and move: 0 full matches and 0 for either crib word alone, on K4 and on every copper27,852 moves x 12 rules x 40 key texts at every start and shiftmove then table: deepest run of checks098the copper: 8ten shuffled coppersthe copperOUT: NO READING; NO TEXT AND SHIFT FITSEASTNORTHEASTBERLINCLOCK
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.

  1. Take the K1/K2 ciphertext block as the key text, from offset 0, and the sculpture's alphabet with Vigenere.
  2. At each known place, the key needed is the carved letter minus the known letter; the key text offers its own letter there.
  3. With a constant shift s, needed = offered + s at every known place, so needed minus offered must be the same 24 times.
  4. 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
KEY TEXT: THE FOUR CIPHERTEXTS AS ONE PANEL (THE K1/K2 BLOCK FIRST), OFFSET 0; SCULPTURE'S ALPHABET, VIGENEREplaceknowncarvedneededkey textofferedneeded - offered22EF1K0123AL10R1924SR21N19225TV18S61264BN11V221565EY17F12574KK0W233A constant shift ofthe table would makethe last column onenumber at all 24places.Here it reads 1, 9, 2,12 ...: no shift fitsthis start.
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

  1. Build the key texts (both numberings) and the route library.
  2. 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).
  3. 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.
  4. Repeat on ten shuffled coppers.
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

27,852 routes x 12 conventions. Change then move (44 numbered key texts incl. Carter): full K4 0, controls [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; EASTNORTHEAST stretch K4 0 (controls [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]); BERLINCLOCK stretch K4 0 (controls [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]). Move then change (40 key texts): full 0, deepest K4 8, controls [8, 8, 8, 8, 8, 7, 9, 8, 8, 8] (10 completed).

What was searched, as the harness recorded it.

family
running key from the sculpture's texts plus one constant tableau shift, with or without a type-1 move
routes distinct
27,852
conventions
12
key texts change then move
tableau rows fwd [std]
781
tableau rows fwd [kry]
781
tableau rows bwd [std]
781
tableau rows bwd [kry]
781
tableau rows with index column fwd [std]
807
tableau rows with index column fwd [kry]
807
tableau rows with index column bwd [std]
807
tableau rows with index column bwd [kry]
807
tableau columns fwd [std]
781
tableau columns fwd [kry]
781
tableau columns bwd [std]
781
tableau columns bwd [kry]
781
morse as carved fwd [std]
80
morse as carved fwd [kry]
80
morse as carved bwd [std]
80
morse as carved bwd [kry]
80
morse reversed order fwd [std]
80
morse reversed order fwd [kry]
80
morse reversed order bwd [std]
80
morse reversed order bwd [kry]
80
panel ciphertexts K1-K4 fwd [std]
865
panel ciphertexts K1-K4 fwd [kry]
865
panel ciphertexts K1-K4 bwd [std]
865
panel ciphertexts K1-K4 bwd [kry]
865
K1-K3 plaintexts fwd [std]
768
K1-K3 plaintexts fwd [kry]
768
K1-K3 plaintexts bwd [std]
768
K1-K3 plaintexts bwd [kry]
768
Sanborn 1989 letter fwd [std]
2,176
Sanborn 1989 letter fwd [kry]
2,176
Sanborn 1989 letter bwd [std]
2,176
Sanborn 1989 letter bwd [kry]
2,176
1991 dedication texts fwd [std]
4,880
1991 dedication texts fwd [kry]
4,880
1991 dedication texts bwd [std]
4,880
1991 dedication texts bwd [kry]
4,880
2025 open letter fwd [std]
2,228
2025 open letter fwd [kry]
2,228
2025 open letter bwd [std]
2,228
2025 open letter bwd [kry]
2,228
Carter vol 1 fwd [std]
284,914
Carter vol 1 fwd [kry]
284,914
Carter vol 1 bwd [std]
284,914
Carter vol 1 bwd [kry]
284,914
change then move
k4 full
0
controls full
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
k4 stretch13
0
controls stretch13
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
k4 stretch11
0
controls stretch11
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
k4 full hits
none
move then change
key texts
40
k4 full
0
k4 best depth
8
controls best depth
8, 8, 8, 8, 8, 7, 9, 8, 8, 8
controls completed
10
k4 full hits
none
controls
10 shuffled coppers (seed 117), identical search

How this experiment sits among the others is on the lineage page; its family's open hypotheses are on the families page.

Rendered from the record on 2026-10-18 12:26 UTC; updated after every experiment.
view on GitHub