Experiment 49

“Long keys with a shape: two puzzle words joined, a word and its mirror, a word doubled, at the periods the cribs allow”

Experiment 5 matched the forced key fragments at periods 27 to 29 against single vocabulary words and K1-K3 windows. A 27 to 29 letter key is unlikely to be one word; here it is built from two: joined, joined with a separator letter, a word followed by its mirror, or a word doubled. The forced fragments are matched exactly under the standard, KRYPTOS and vocabulary-mixed alphabets.

revertedstatus
experiment 5parents
4 mintime, all phases
0candidates
0/24known letters
1

The experiment method

What the method does with the 24 known letters.

A secret word of 27 to 29 letters is probably not one word. It could be two of the puzzle's wordsthe puzzle's words A list of 62 words tied to the sculpture: the earlier secret words, place names, the names of the people involved, the words in the Morse code, and the themes Sanborn has named. joined, a word followed by itself, or a word followed by its mirror image. Each such key fixes the 24 letters that the known lettersthe known letters Sanborn has confirmed that positions 22 to 34 of the message read EASTNORTHEAST and positions 64 to 74 read BERLINCLOCK. demand, so we simply build every key of that kind and check it against the 24 demands, 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. and on tables rebuilt from the puzzle's words.

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 ACCENTYWOYNKYELYOIECBAQKRDUMRIthe 27 slots: 24 forced by the known letters, 3 freeVIRTUALLYINVISIBLESOMEWHEREVIRTUALLYINVISIBLE + SOMEWHERE, the closest join: 23 of 24 missslot 22, forced by the E at place 22the one forced slot it matchesOUT: NO READING; NO SHAPED KEY FITS THE FORCED SLOTSEASTNORTHEASTBERLINCLOCK
the forced slots

At period 27, on the sculpture's table, each known letter forces the key letter in its slot (place p uses slot p mod 27); three slots stay free.

the shapes

A 27 to 29 letter key is unlikely to be one word, so the experiment built 272 keys from the puzzle's words: two joined, joined with an X or a Q, a word and its mirror, a word doubled.

the bound

9,716,112 trials over every shaped key, 63 x 63 tables, three modes and three key readings: none comes within three misses of the forced letters.

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. Join BERLIN and ALEXANDERPLATZ: BERLINALEXANDERPLATZ is 20 letters, too short; join WILLIAMWEBSTER and PALIMPSEST: 24, too short; join TUTANKHAMUN and SHADOWFORCES: 23.
  2. Keep the pairs that reach 27, 28 or 29 letters, such as DIGITALINTERPRETATION joined with EGYPT.
  3. On the sculpture's table with Vigenere, position 22 forces key letter R at slot 21 of a 27-letter key; position 23 forces D at slot 22, and so on for all 24 known letters.
  4. Compare the joined key's letters at those slots; one mismatch and the key is out.
  5. Repeat for every pair, every mirror and every doubling, under every table.
the worksheet: the first steps by hand, on squared paper
A 27-LETTER KEY CHECKED BY HAND: THE FORCED LETTERS ON ONE LINE, THE CANDIDATE UNDER ITslotforcedcandidatecheck1YVx2WIx3ORx4YTx5NUx6KAx7YLx8-L9-Y10EIx11LNx12YVx13OIx14ISx15EIx16CBx17BLx18AEx19QSx20KOx21-M22REx23DWx24UHx25MEx26RRv27IExVIRTUALLYINVISIBLE + SOMEWHERE23 misses of 24Write the forced letters once; under themwrite each candidate key and tick or cross the24 checked slots. A single cross ends thecandidate.The forced line changes with the table (plainalphabet, carved alphabet, mode): 63 x 63 x 3of them, each a new line, each checked against272 keys.The best any key did was more than threecrosses. A candidate with none wouldhave been the first key ever to fit all24 known letters.
4

Worked example, generated

The same steps run by the code on the real letters.

key DIGITALINTERPRETATIONEGYPT, length 26: a 26-letter join falls short of 27, so it is not tried; take instead

joined ABSCISSA+DIGITALINTERPRETATION: ABSCISSADIGITALINTERPRETATION (29 letters)

sculpture's alphabet throughout, Vigenere: forced key letters at the first slots
pos 22: slot 21 must be R; the key has R
pos 23: slot 22 must be D; the key has E
pos 24: slot 23 must be U; the key has T
pos 25: slot 24 must be M; the key has A
5

Hypothesis, for a cryptanalyst

Family, key space, the constraint under test, and the clues it reads.

Periods 27-29 survive the crib sweep under every alphabet pair (0005, 0020), and their forced key fragments read as noise (0009, 0010), which rules out an English phrase as key but not a key made of two puzzle words with no English transition, or a word and its reverse (Sanborn's mirrors, C3), or a doubled word. Key shapes: X+Y, X+c+Y for a separator letter c, X+reverse(X), X+X, X+reverse(Y), over the 62-word vocabulary and its K1-K3 windows, kept when the length is 27, 28 or 29. Under each plain-cipher alphabet pair (standard, KRYPTOS, 61 keyword mixings) and mode, the 24 forced key indices are compared with the key read in the standard, KRYPTOS or the plain alphabet; a match decrypts and submits. About 20,000 key shapes x 12,000 alphabet classes, exact. Bounds: complete for these shapes and alphabets.

6

Prediction

Written before the run; the result decides it.

No shaped key of length 27 to 29 matches all 24 forced letters under any alphabet pair and mode. Zero candidates pass.

7

Method

  1. Build the shaped keys of length 27-29 from the vocabulary.
  2. For each plain and cipher alphabet and mode, compute the 24 forced key indices and their slots at each period.
  3. For each key, read it in each key alphabet as indices and compare at the forced slots; count mismatches.
  4. Decrypt and submit exact matches; report the fewest mismatches.
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
34champion before

272 shaped keys x 63^2 alphabet pairs x 3 modes x 3 key readings: 9716112 trials; fewest mismatches more than 3; 0 exact matches.

What was searched, as the harness recorded it.

family
shaped keys of length 27-29 from the vocabulary, periodic tableau, vocabulary-mixed alphabets
keys
272
keys by length
27
124
28
70
29
78
alphabets
63
trials
9,716,112
fewest mismatches
more than 3
nearest
none
survivors
0

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