Experiment 205

“F2.4: a run of nulls at both ends of the message (SOE's Dutch section), the known letters moved by the start run, then a periodic or progressive key on the table, exact, with planted texts”

F2.4 (issue #78): SOE's Dutch section put eight random letters at the beginning and at the end of each message (Marks p. 232). If K4's message is padded so, the known words sit s places later on the copper than in the message. The end run only shortens the message (s + e <= 23 keeps BERLINCLOCK inside); it moves nothing, so every pair of runs 0-12 reduces to the start run s. A key that starts with the message or with the copper is the same family (the offset is absorbed by the key word, for periodic and both progressive forms). 0023 tested start runs 1-24 with periodic keys; new here: the progressive key, per letter and per repeat, steps 1-25, lengths 1-52, on the 8 standard/KRYPTOS table classes, for s = 0-12, with periodic keys (step 0) rerun alongside, on K4, ten scrambled copies and planted texts.

revertedstatus
experiment 23parents
7 stime, all phases
0candidates
0/24known letters
unclocked
1

The experiment method

What the method does with the 24 known letters.

Wartime agents sometimes put a handful of meaningless lettersnulls Letters inserted into a message that carry no meaning, used to pad it or to disguise it. before and after a message, so the real words do not start where an enemy expects. If Sanborn did that, the known words sit a few places further along the copper than in the messagethe message The 97 letters of English that Jim Sanborn wrote and enciphered.. We slide them along by 0 to 12 places and test every repeating or steadily sliding secret word 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..

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.

OBKRUOXOGHULBSOLIFBBWEASTNORTHEASTOTWTQSJQSSEKZZWATJKLUDIAWINFBBERLINCLOCKWGDKZXTJCDIGKUHUAUEKCARthe known words moved 0-12 places along the copper (nulls before the message); does any key of length L fit K4? lengths 1-30a repeating key (as 0023)110202630shortest that fits K4 26; every copy 26; K4 ahead of every copy in 0 cellsa key that slides one step every lettershortest that fits K4 26; every copy 26; K4 ahead of every copy in 0 cellsa key that slides one step every passshortest that fits K4 26; every copy 26; K4 ahead of every copy in 0 cellsno setting fitssome setting fitsplanted messages padded at both ends (8 + 8 and 5 + 11 nulls), sliding keys of 9 and 11: found at 9, found at 11EASTNORTHEASTBERLINCLOCKIN: THE COPPER, ALL 97 LETTERS, THE 24 KNOWN PLACES IN ACCENTOUT: NO READING; NULLS AT BOTH ENDS REVIVE NO SHORT KEY
the idea

SOE's Dutch section put eight random letters before and after every message. Padding at the start moves the known words along the copper; padding at the end moves nothing.

the check

Every start run 0-12, a repeating key or one that slides by any step after every letter or every pass, lengths 1-52, on the sculpture's tables, K4 against ten scrambled copies and two planted padded messages.

the bound

Nothing fits below length 26 on K4 or on any copy, whatever the start run; the planted messages are found at their own lengths. F2.4 closed.

2

Experiment lineage

What this experiment was built on, from the lineage page: 1 experiment before it, back to the root of its line. Its number is in bold.

kept reverted, in its family's colour ×error or timeout reverted under today's rules built on a parent in the same family built on a parent in another family
3

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 under Result and bounds below.

4

Walkthrough, by hand

Redo the method on a few letters with pencil and paper.

  1. Put eight random letters before the message and some after it.
  2. Encipher the whole on the table with a key word that slides one step along the table after each full pass.
  3. To test: slide the known words eight places along the copper.
  4. At each, the table gives the key value; take away the slide for that pass.
  5. Known letters in the same slot of the key word must then agree.
the worksheet: the first steps by hand, on squared paper
message placeknowncopper placecarved22E30N23A31G26N34S64B72F74K82JThe key's value at each known letter isread on the table from the carved lettereight places on; known letters in thesame slot of the key must agree once theslide is taken away.EIGHT NULLS FIRST: THE KNOWN WORDS SIT EIGHT PLACES LATER ON THE COPPER
5

Worked example, generated

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

start run of 8 nulls: the known words sit 8 places later on the copper; KRYPTOS table, added form

place  known  carved place  carved  key value
   22      E            30       N          8
   23      A            31       G          6
   24      S            32       K         20
   25      T            33       S          2
   26      N            34       S         13
   27      O            35       O          0
6

Hypothesis, for a cryptanalyst

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

C4(a) (a mask that pads the plaintext), C17(b) (the working text longer than 97). Source: reports/marks-between-silk-and-cyanide.md. Model: carved = nulls(s) + T(message) + nulls(e), message positions of the known letters 22-34, 64-74 (Sanborn's numbering of the message), so carved places q + s; T a tableau key with value w[i mod L] + d i (per letter) or w[i mod L] + d floor(i/L) (per repeat), d 0-25, L 1-52, plain and cipher alphabets standard or KRYPTOS, added or Beaufort form (8 classes; the variant form is the added form with -w). Exact by slot agreement of the 24 forced values after removing the step. Statistic (fixed): per form, the shortest consistent length over all s and steps on K4 against the copies, and the cells (form, length) where K4's count of live (s, step, class) settings exceeds every copy's.

7

Prediction

Written before the run; the result decides it.

For every start run, nothing consistent below length 24-26 with a periodic key (as 0023), and the progressive forms at the copies' rate; K4 above every copy in no more cells than a copy is. Planted texts found at their own setting. Zero candidates.

8

Method

  1. For each start run s = 0-12 and table class, the forced key value at each known letter, read at carved place q + s.
  2. For each form and step d, remove d i or d floor(i/L) and test slot agreement for every length L.
  3. Count live settings per (form, length) on K4, ten copies and two planted texts; the fixed statistic.
9

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

Shortest live length K4 / copies: periodic 26 / 26; per-letter 26 / 26; per-repeat 26 / 26. K4 above every copy in 0 cells, copies 0-5. Plants: per-repeat found True (shortest 9), per-letter found True (shortest 11)

What was searched, as the harness recorded it.

family
nulls at both ends (start run s 0-12; the end run moves nothing), then a periodic or progressive key on the standard/KRYPTOS tables
start runs
0-12
end runs
0-12 (any; s + e <= 23)
classes
std/std/vig-var, std/std/beau, std/kry/vig-var, std/kry/beau, kry/std/vig-var, kry/std/beau, kry/kry/vig-var, kry/kry/beau
forms
periodic
step 0
per-letter
w[i mod L] + d i, d 1-25
per-repeat
w[i mod L] + d floor(i/L), d 1-25
lengths
1-52
per form
periodic
k4 live by length
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, 5, 104, 104, 104, 5, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5
copies live by length 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, 0, 8, 104, 104, 104, 9, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8
k4 shortest
26
copies shortest
26, 26, 26, 26, 26, 26, 26, 26, 26, 26
k4 above every copy
none
copy cells above rest
0, 0, 0, 2, 0, 0, 0, 0, 1, 0
per-letter
k4 live by length
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, 125, 2,600, 2,600, 2,600, 107, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 125
copies live by length 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, 0, 200, 2,600, 2,600, 2,600, 132, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 200
k4 shortest
26
copies shortest
26, 26, 26, 26, 26, 26, 26, 26, 26, 26
k4 above every copy
none
copy cells above rest
0, 0, 0, 2, 1, 0, 0, 0, 0, 0
per-repeat
k4 live by length
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, 99, 2,600, 2,600, 2,600, 99, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 99
copies live by length 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, 0, 102, 2,600, 2,600, 2,600, 102, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 102
k4 shortest
26
copies shortest
26, 26, 26, 26, 26, 26, 26, 26, 26, 26
k4 above every copy
none
copy cells above rest
0, 0, 0, 1, 0, 0, 0, 0, 0, 0
k4 settings below 24
none
k4 cells above every copy
0
copy cells above rest
0, 0, 0, 5, 1, 0, 0, 0, 1, 0
stop queue
no
plants
  1. s
    8
    e
    8
    class
    std/kry/beau
    form
    per-repeat
    step
    3
    length
    9
    found
    yes
    shortest found
    9
    other settings below 24
    5
  2. s
    5
    e
    11
    class
    kry/kry/vig-var
    form
    per-letter
    step
    7
    length
    11
    found
    yes
    shortest found
    11
    other settings below 24
    5
controls
10 shuffled copies (seed 2400)
seconds
5
exhaustive
yes

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-11-05 17:14 UTC; updated after every experiment.
view on GitHub