Experiment 109

“Tables built from any English word, not just the puzzle's, with a repeating key of length 1 to 26”

0010 and 0053 rebuilt the tableau from the puzzle's own 61 words and the K1-K3 and 2025-letter words, the way KRYPTOS builds the carved one. Here the keyword is any of the 233,000 words of four letters or more in the project dictionary, used for the plain alphabet, the cipher alphabet or both (with the standard or KRYPTOS alphabet on the other side), with a repeating key of length 1-26 and no move.

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

The experiment method

What the method does with the 24 known letters.

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. on Kryptos starts each alphabet with the word KRYPTOS and then the other letters in order. Any word can make such a table. Experiments 10 and 53 tried the puzzle's own words. Here we try every word in an English dictionary, about 233,000 of them, with a short repeating secret word on top, and ask whether any table lets 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. fit.

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 table keyed by a word: SHADOW first, then the rest of the alphabet; used for both the message and the copper, VigenereS0H1A2D3O4W5B6C7E8F9G10I11J12K13L14M15N16P17Q18R19T20U21V22X23Y24Z25E is 8, F is 9: at place 22 the key value is 1EASTNORTHEASTBERLINCLOCK129224455210606489481500key value each known place needs on this table (last digit)with a key of 7, places 22 and 29 share a key letter but need 1 and 25: dead208,062 distinct keyed tables from 232,989 words x 10 rulesperiod 25 live0170the copper: 0period 26 live0129,809the copper: 68,051smallest live period0269the copper: 26ten shuffled coppersthe copperOUT: NO READING; NO KEYED TABLE FITS A KEY BELOW 26EASTNORTHEASTBERLINCLOCK
the table

K1 and K2 used a table keyed by a word, KRYPTOS. Here every dictionary word of four letters or more keys the table, as K1-K3 did, with a repeating secret word on top.

the check

On SHADOW's table each known place needs one key value; with a key of p letters, places p apart must need the same. With p = 7, places 22 and 29 need 1 and 25.

the bound

208,062 tables, keys of 1 to 26 letters, 10 rules: nothing fits a key shorter than 26 on K4, while scrambled coppers reach 25. K4 is if anything harder to fit.

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 a word, say SHADOW: the alphabet is SHADOWBCEFGIJKLMNPQRTUVXYZ.
  2. Use it for both the plain and cipher alphabets, Vigenere.
  3. Place 22: E is letter 8 of the new alphabet and F letter 9, so the key value there is 1.
  4. With a key of length p, places 22 and 22 + p (if known) must need the same key value.
  5. Repeat for every word, side, key length 1-26 and rule, and on scrambled coppers.
the worksheet: the first steps by hand, on squared paper
KEYWORD SHADOW: ALPHABET SHADOWBCEFGIJKLMNPQRTUVXYZ; BOTH SIDES, VIGENEREplaceknowncarvedpositionskey value22EF9 - 8123AL14 - 21224SR19 - 01925TV22 - 20226NQ18 - 16227OQ18 - 41428RP17 - 192429TR19 - 202530HN16 - 11531EG10 - 8232AK13 - 21133SS0 - 00placeknowncarvedpositionskey value34TS0 - 20664BN16 - 61065EY24 - 81666RP17 - 192467LV22 - 14868IT20 - 11969NT20 - 16470CM15 - 7871LZ25 - 141172OF9 - 4573CP17 - 71074KK13 - 130Positions count from S = 0 in the keyed alphabet. With a key of p letters, two places p apart need the same key value.
4

Worked example, generated

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

keyword SHADOW: alphabet SHADOWBCEFGIJKLMNPQRTUVXYZ; both sides, Vigenere

place  known  carved  key value
   22      E       F          1
   23      A       L         12
   24      S       R         19
   25      T       V          2
   26      N       Q          2
   27      O       Q         14
   28      R       P         24
   29      T       R         25
   30      H       N         15
   31      E       G          2
   32      A       K         11
   33      S       S          0
   34      T       S          6
   64      B       N         10
   65      E       Y         16
   66      R       P         24
   67      L       V          8
   68      I       T          9
   69      N       T          4
   70      C       M          8
   71      L       Z         11
   72      O       F          5
   73      C       P         10
   74      K       K          0
5

Hypothesis, for a cryptanalyst

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

Sanborn: a 'slightly different tableau' (C11a); K1-K2 use a keyword-mixed Quagmire III (KRYPTOS). 0005 closed periods 1-26 for the carved and standard alphabets, 0010 and 0053 for puzzle words. Alphabet W = keyword's distinct letters then the rest in order. Classes (consistency depends only on the plain and cipher alphabets and Beaufort versus not, 0006): (W, W), (W, STD), (STD, W), (W, KRY), (KRY, W), each Beaufort or not: 10 per word. Exact slot agreement at every period 1-26. Distinct alphabets only (words giving the same W counted once). Ten shuffled coppers. C8, C11a.

6

Prediction

Written before the run; the result decides it.

No word gives a consistent period below 20; the number of (alphabet, class) pairs consistent at each period 21-26 lies inside the ten coppers' range. Zero candidates.

7

Method

  1. Build the distinct keyword alphabets from the dictionary.
  2. For each alphabet and class, compute the key value forced at each known letter.
  3. Test slot agreement at periods 1-26.
  4. Count consistent pairs per period on K4 and ten shuffled coppers.
  5. List K4's settings below period 20 and decrypt them.
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

208,062 distinct alphabets from 232,989 words x 10 classes = 2,080,620 settings, periods 1-26. Smallest live period: K4 26, controls [26, 25, 25, 25, 25, 25, 25, 25, 25, 25]. K4 live below 20: 0. Outside the control range: [].

What was searched, as the harness recorded it.

family
keyword-mixed tableau from the whole dictionary, periodic key 1-26, no move
words 4 plus
232,989
distinct alphabets
208,062
settings
2,080,620
k4 live by period
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 68,051
controls live min
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 41,874
controls live max
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 170, 129,809
k4 smallest live period
26
controls smallest live period
26, 25, 25, 25, 25, 25, 25, 25, 25, 25
periods outside control range
none
k4 live below 20
none
n k4 live below 20
0
controls
10 shuffled coppers (seed 109), 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