Experiment 12

“Plaintext autokey, chained: the 24 known letters force the rest, lag by lag”

0003 only checked the cribs against each other. Here each known letter is also used as the key for the letter one lag later, and as the ciphertext's partner one lag earlier, and the forced letters are chained until nothing new follows. For small lags that fixes the whole text.

revertedstatus
experiment 3parents
2 mintime, all phases
0candidates
0/24known letters
1

The experiment method

What the method does with the 24 known letters.

In an autokey cipheran autokey cipher A cipher that uses the message itself, or the scrambled text itself, as the secret word, each letter enciphered with the letter a fixed distance before it. the messagethe message The 97 letters of English that Jim Sanborn wrote and enciphered. is its own secret word: each letter is enciphered using the letter some fixed distance before it. That makes 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. very powerful. Each one was used to encipher a letter further on, so that letter can be worked out; and each one was itself enciphered by a letter further back, so that one can be worked out too. Repeating this spreads outward until, for short distances, the whole message is known. We try every distance and every way of using 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., and read what comes out.

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 ACCENTKNOWN; EACH REVEALS THE PLACES 13 ON AND 13 BACKEASTNORTHEASTBERLINCLOCKONE STEPTWO STEPSplace 22 reveals 35, which reveals 48OUT: NO READING; AT LAG 13 THE CHAINS CONTRADICT EACH OTHEREASTNORTHEASTBERLINCLOCK
the chain

In a plaintext autokey each letter is keyed by the message letter 13 places before it. So each known letter reveals the letter 13 places later and the one 13 places earlier, and those reveal more.

where chains meet

Step by step the chains reach every place, and two routes to one place must give the same letter. At lag 13 they disagree under every way of using the table, so lag 13 is dead.

the bound

Lags 1 to 25 and 30 to 52 die under all 24 ways of using the table. Lags 26 to 29 and 53 upwards survive but force too little to build a reading.

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 lag 13 and the sculpture's alphabet with Vigenere.
  2. Position 22 is E and its ciphertext is F; under the table, the key that turns E into F is R, so position 9 is R.
  3. Position 35 was enciphered with key E, the letter at 22; the ciphertext at 35 is S, and S decrypted with key E is the letter at 35.
  4. Now 9 and 35 are known, so 48 and 61 follow, and so on, up and down by 13 until the chain leaves the text.
  5. Do the same from every one of the 24 known letters.
  6. Where two chains meet, the letters must agree, or lag 13 is dead under this convention.
  7. If every position fills, read the text aloud.
  8. The first 13 letters were enciphered with the primer; the key letter that maps each of them to its ciphertext is the primer, which should be a word.
the worksheet: the first steps by hand, on squared paper
THE LEDGER FOR LAG 13, SCULPTURE'S ALPHABET, LETTERS ADDED: THREE KNOWN LETTERS AND WHAT THEY REVEALplaceknowncarvedkey = letter 13 backas key for place + 13carved thererevealed22EFR (place 9)place 35OQ (place 35)23ALD (place 10)place 36TW (place 36)64BNE (place 51)place 77DY (place 77)Every revealed letter goes back into the ledger asa new known letter and reveals two more. Theledger closes when a place is reached twice.If the two entries for that place differ, this lagis dead under this way of using the table. Fourcolumns of arithmetic, no computer needed.The table arithmetic: E is the 11th letter of KRYPTOSABCDEFGHIJLMNQUVWXZ, F the 12th; the key that turns E into F is the2nd, R.
4

Worked example, generated

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

lag 13, KRYPTOS alphabet throughout, Vigenere: chaining from the cribs

consistent: False; letters forced: 28 of 97
.....................EASTNORTHEASTS............N............K..BERLINCLOCK............K..........

position 22 (E, cipher F) forces position 9 = R; key E at 22 decrypts cipher O at 35 to Q
5

Hypothesis, for a cryptanalyst

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

Plaintext autokey (the NSA's 1992 guess, C11a; a Scheidt-era hand system, C5): c[i] = E(p[i], p[i-L]) for i >= L after a primer of length L. A crib letter p[i] forces p[i-L] through c[i] and forces p[i+L] through c[i+L]; each forced letter forces two more. The closure from the 24 cribs covers every residue class modulo L that a crib position touches, so for L <= 13 the whole text is forced, for L up to about 24 most of it, and for larger L two or three stretches. 0003 found lags 1-11 and 30-52 inconsistent inside the cribs; lags 12-29 and 53-96 were undecided. Here, under each of the 24 conventions and each lag 1-96, we propagate to closure, reject on any conflict, and for a fully forced text derive the primer and submit the candidate. Partially forced texts are scored as English on their forced runs and compared with the same procedure on shuffled K4 letters. Bounds: complete for plaintext autokey with a primer of length L, any L 1-96, under these conventions.

6

Prediction

Written before the run; the result decides it.

Every lag from 1 to 25 either conflicts somewhere in the chain or yields a fully forced text that is not English, scoring below -6 per quadgram against -3.6 for English. Lags above 25 leave stretches that score no better than the shuffled control. No candidate passes the English standard; a fully forced text may pass the four gates by construction and will then stand as a champion with a loss of 3 to 4, which is a gibberish champion, not a solution.

7

Method

  1. For each convention and lag L, start with the 24 cribs as forced letters.
  2. For each forced letter at i: if i >= L, force p[i-L] as the key that maps p[i] to c[i]; if i + L < 97, force p[i+L] by decrypting c[i+L] with key p[i].
  3. Repeat until nothing new appears; any conflict kills the pair.
  4. If all 97 letters are forced, derive the primer k[i] for i < L and submit the text.
  5. Otherwise score the forced runs of four or more letters as English.
  6. Run the same procedure on ten shuffles of K4 for a control.
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

1129 consistent (lag, convention) pairs; 0 fully forced texts submitted. A fully forced text passes the crib gate by construction; only its English score matters.

What was searched, as the harness recorded it.

family
plaintext autokey with primer, chained closure from cribs
conventions
24
lags
1-96
lags dead all conventions
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52
consistent pairs by lag
26
1
27
24
28
24
29
24
53
24
54
24
55
24
56
24
57
24
58
24
59
24
60
24
61
24
62
24
63
24
64
24
65
24
66
24
67
24
68
24
69
24
70
24
71
24
72
24
73
24
74
24
75
24
76
24
77
24
78
24
79
24
80
24
81
24
82
24
83
24
84
24
85
24
86
24
87
24
88
24
89
24
90
24
91
24
92
24
93
24
94
24
95
24
96
24
fully forced candidates
0
best english of forced runs
  1. score
    -4.095
    lag
    96
    convention
    std/std/std/vig
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
  2. score
    -4.095
    lag
    96
    convention
    std/std/std/varbeau
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
  3. score
    -4.095
    lag
    96
    convention
    std/std/std/beau
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
  4. score
    -4.095
    lag
    96
    convention
    std/std/kry/vig
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
  5. score
    -4.095
    lag
    96
    convention
    std/std/kry/varbeau
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
  6. score
    -4.095
    lag
    96
    convention
    std/std/kry/beau
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
  7. score
    -4.095
    lag
    96
    convention
    std/kry/std/vig
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
  8. score
    -4.095
    lag
    96
    convention
    std/kry/std/varbeau
    forced letters
    24
    runs
    EASTNORTHEAST, BERLINCLOCK
shuffled control best per seed
-4.095, -4.064, -4.095, -4.083, -4.095, -4.095, -4.095, -4.095, -4.095, -4.095

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