Experiment 190

“F11.2: the SOE poem code: a double columnar transposition keyed by consecutive words of K1-K3 and the Morse, then or before a repeating key on the sculpture's tables: exact”

F11.2. The poem code (SOE, Second World War): the agent takes words from a memorised text, writes them out as one key, numbers its letters alphabetically (ties left to right) and transposes twice by columns with that number key. Here the memorised texts are the sculpture's own: the plaintexts of K1, K2 and K3 and the Morse. Keys: every run of 1-6 consecutive words, 5-40 letters; used for both transpositions, or split into two keys at every word boundary. Each move and its inverse, then (A) or before (B) a repeating key 1-26 on 8 table classes (F6's compiled tester); K4 against 15 shuffled copies. 0167-era double columnar tests used dictionary keywords, not these phrases.

revertedstatus
experiment 184parents
5 stime, all phases
0candidates
0/24known letters
unclocked
1

The experiment method

What the method does with the 24 known letters.

British agents in the war carried their keys in their heads: a poem. They picked a few words, wrote them out, numbered the letters in alphabetical order, and used the numbers to shuffle the messagethe message The 97 letters of English that Jim Sanborn wrote and enciphered. twice through a grida grid Writing the message into rows of some width and reading it out in another order, column by column for instance, which shuffles the letters without changing them.. Here the 'poem' is the sculpture's own solved text. We try every run of a few consecutive words as the keythe secret word The word or string a cipher needs besides the method., with a repeating secret worda repeating secret word A secret word written under the message again and again. on the sculpture's tables before or after.

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 ACCENTthe double transposition undone, then a repeating key on the table: is key length p (1-26) consistent for some poem key?151015202426no key of the 6,092 moves allows itsome key doesK4: shortest consistent key 24; scrambled copies: 22at length 24: K4 3 settings, copies 1-6a repeating key on the table, then the double transposition undone: is key length p (1-26) consistent for some poem key?151015202526K4: shortest consistent key 25; scrambled copies: 25at length 25: K4 4 settings, copies 0-5K4 above every copy in 0 of 52 cells; each copy against the rest: 0-1. Inside chance.words picked out of order from the text: too many to list, not runOUT: NO READING; THE SCULPTURE'S OWN TEXT AS A POEM-CODE KEY DOES NOT FIT K4EASTNORTHEASTBERLINCLOCK
the idea

SOE agents kept their keys in a memorised poem: a few words written out, their letters numbered alphabetically, used to shuffle the message twice through a grid. The sculpture's solved text is a poem its makers knew by heart.

the check

Every run of 1-6 consecutive words of K1, K2, K3 and the Morse as the key, used twice or split in two, each shuffle undone, then a repeating key of 1-26 on the sculpture's tables before or after; 15 scrambled copies.

the bound

Nothing fits K4 better than the copies. F11.2 closed for consecutive words; free picks of words remain untested.

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 words SHADOW FORCES from the Morse: SHADOWFORCES, 12 letters.
  2. Number the letters alphabetically, ties left to right: A=1, C=2, D=3, E=4, F=5, H=6, the Os 7 and 8, R=9, the Ss 10 and 11, W=12.
  3. Write the message in rows of 12, read the columns in number order; do it again.
  4. Undo that, and test a repeating key on the sculpture's tables against the 24 known letters.
  5. Every run of words, on K4 and on scrambled copies.
the worksheet: the first steps by hand, on squared paper
NUMBERING A POEM-CODE KEYSHADOW FORCES, 12 letters, numberedalphabetically with ties left to right:S10 H6 A1 D3 O7 W12 F5 O8 R9 C2 E4 S11.The message goes into rows of 12 andcomes out column 1 first, then 2, and soon.Doing that twice is the doubletransposition. Undone on K4, it leavesletters for a repeating key on thesculpture's tables to explain; acrossall 6,092 moves none shorter than 24does.
4

Worked example, generated

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

key SHADOWFORCES, column numbers [10, 6, 1, 3, 7, 12, 5, 8, 9, 2, 4, 11]
K4 with the double transposition undone: ZJPADRVTLYWOZEJAESUBCGSGXTOSUNQRTVKULIIAWFDGFJBXUTWPKLGKMKTZALUHKKSKSQUOQPSQWHRONBORBIICNTBFKFWDZ
5

Hypothesis, for a cryptanalyst

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

C5(b) ('key word/s'), A9 (agency hand systems; Scheidt's CIA background), F11; SOE poem code (Marks, Between Silk and Cyanide). Model: c = T(P2(P1(p))) or P2(P1(T(p))), P1, P2 columnar transpositions keyed by the phrase numbers, T a periodic tableau key. Statistic: 0134's fixed statistic and the shortest live period, K4 against copies.

6

Prediction

Written before the run; the result decides it.

No phrase key gives K4 a live period below the copies'; cells where K4 leads stay inside the copies' range. Zero candidates.

7

Method

  1. Word lists of K1, K2, K3 plaintexts and the Morse.
  2. Every run of 1-6 consecutive words of 5-40 letters: its number key; the double columnar move with it twice, and with the run split in two at every word boundary.
  3. Each move and its inverse, deduplicated.
  4. F6's compiled tester: live (order, period) per text; K4 against 15 shuffled copies.
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

6092 moves; shortest live K4 A 24 B 25 (copies 22, 25); K4 above every copy in 0 of 52 cells (copies 0-1)

What was searched, as the harness recorded it.

family
SOE poem code: double columnar keyed by 1-6 consecutive words of K1-K3 and the Morse (same key twice, or split), then/before a periodic key 1-26, 8 classes, exact
phrase keys
3,063
maps after dedupe
6,092
routes
6,092
k4 live by period
A
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 17
B
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 1,930
controls live by period min
A
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 17
B
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, 1,787
controls live by period max
A
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 6, 4, 22
B
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, 1,935
k4 shortest live
A
24
B
25
coppers shortest live
A
22
B
25
k4 settings live below 20
A
0
B
0
controls settings live below 20
A
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
B
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
k4 live below 20
none
cells k4 above every copper
none
null cells above rest per copper
0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0
stop queue
no
copies
15 shuffled copies (seed 1900)
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-10-18 12:26 UTC; updated after every experiment.
view on GitHub