Experiment 169

“F12.3: Stein's index-of-coincidence peak at 13 alphabets in K1 and K2: real or chance, against shuffles that keep each part's own key period”

F12.3 (C28). Stein found a peak in the average index of coincidence at m = 13 alphabets in K1 (his Part I, key length 10) and in K2's Part II (the 125 letters between the panel's first two question marks, key length 8) and asked: 'Could this be a sign of another code overlaid on top of the others... Or just a coincidence?' Here the question is answered against the right null: shuffles that keep each part's key-period structure (letters permuted only within their own key column), 10,000 per text; also plain shuffles. Statistics: the I.C. at 13 and the local peak (I.C. at 13 minus the larger of 12 and 14). Texts: K1, K2 Part II (Stein's), K2 Part III, all of K2, and the K1 and K2 plaintexts. K4's own value at 13 is in 0168 (p 0.21).

revertedstatus
experiment 168parents
68 stime, all phases
0candidates
0/24known letters
unclocked
1

The experiment method

What the method does with the 24 known letters.

When Stein cut the first two messages into 13 interleaved strands, the letters matched a little more often than expected, and he wondered whether a second, 13-letter code lay underneath. We check whether that bump is bigger than what the known keys alone would give, by shuffling the letters only among positions that share a key letter, 10,000 times.

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 ACCENTK1, 63 letters, key 10: index of coincidence over 1-16 strands (Stein's plot); the key length ochre, 13 accent15101316at 13: 0.07436; p 0.0075 against shuffles keeping the key, 0.0359 plainunusual alone; about 0.02 once every strand count is allowed forK2 Part II, 125 letters, key 8: index of coincidence over 1-16 strands (Stein's plot); the key length ochre, 13 accent1581316at 13: 0.04231; p 0.2435 against shuffles keeping the key, 0.331 plaininside the shuffles: no peak to explainthe rest of K2 at 13: Part III p 0.4051, all 369 letters p 0.0894, keeping the keyOUT: NO READING; STEIN'S PEAK AT 13 IS A COINCIDENCE IN K1'S SHORT TEXTEASTNORTHEASTBERLINCLOCK
the idea

Stein saw the letters match more often when K1 and part of K2 were cut into 13 strands, and wondered whether a second, 13-letter code lay underneath.

the check

Shuffle each text only among the places that share a key letter, which keeps everything the known keys explain, 10,000 times, and see how often the bump at 13 is reached.

the bound

K1's bump is unusual (p 0.0075, about 0.02 allowing for the strand counts scanned); Part II's is not (0.24), nor K4's (0.21). A coincidence, closed.

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. Write K1's 63 letters into 13 strands: letters 1, 14, 27, ...; 2, 15, 28, ...; and so on.
  2. In each strand count the pairs of equal letters, divide by the possible pairs, and average over the 13 strands.
  3. Shuffle K1's letters, but only among places that used the same key letter (places 1, 11, 21, ... together), and recompute; repeat 10,000 times.
  4. If K1's value is above nearly all the shuffled values, the bump at 13 is more than the key explains.
the worksheet: the first steps by hand, on squared paper
K1'S 63 LETTERS IN 13 STRANDS (PLACE I IN STRAND I MOD 13)strand 1E U G B Ystrand 2M S N Q Qstrand 3U D F V Tstrand 4F J I Y Mstrand 5P K V U Kstrand 6H Z J V Ystrand 7Z L Y L Rstrand 8L D Q L Dstrand 9R K T T Mstrand 10F R Q R Fstrand 11A N U E Dstrand 12X S X Vstrand 13Y H Q JMatching letters within a strand raisethe index of coincidence. K1's strandsmatch more often than shuffles keepingits 10-letter key allow, once in about130; Part II of K2 does not repeat it.
4

Worked example, generated

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

K1's 63 letters in 13 strands (letter i goes to strand i mod 13):

  strand  1: EUGBY
  strand  2: MSNQQ
  strand  3: UDFVT
  strand  4: FJIYM
  strand  5: PKVUK
  strand  6: HZJVY
  strand  7: ZLYLR
  strand  8: LDQLD
  strand  9: RKTTM
  strand 10: FRQRF
  strand 11: ANUED
  strand 12: XSXV
  strand 13: YHQJ

average index of coincidence over the 13 strands: 0.0744; over 10 strands (the key length): 0.0914
5

Hypothesis, for a cryptanalyst

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

C28 (knowledge/11-clue-register.md); Stein 1999 (knowledge/sources/stein-1999-cracking-the-courtyard-crypto.txt), Figures 7, 17, 26: 'I knew that the peak at m = 10 was caused by the 10-letter keyword, and the peaks at 5 and 15 are expected artifacts... But what was this peak at m = 13? ... it also showed up in the I.C. plot for Part II.' Model of the null: a Quagmire III ciphertext of period L has column multisets fixed by the plaintext and key; permuting letters within each column (place mod L) keeps every period-L property and destroys any other structure. If K1's and Part II's I.C. at 13 sit inside that null, the peak is a coincidence of the plaintext's letters; if outside, something keyed at 13 exists and K4 would be tested for it.

6

Prediction

Written before the run; the result decides it.

The m = 13 values sit inside the key-period null for K1 and Part II (p above 0.05): a coincidence of short texts. Zero candidates.

7

Method

  1. Texts: K1 (63), K2 Part II (125), Part III (61), K2 without '?' (369), K1 and K2 plaintexts.
  2. I.C. averaged over m interleaved strands, m 12-14; the peak statistic.
  3. 10,000 within-column shuffles (key period 10 for K1, 8 for K2) and 10,000 plain shuffles per text: one-sided p.
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

K1 ciphertext (Stein's Part I, key 10): I.C.13 0.07436, p within-columns 0.0075, plain 0.0359; K2 Part II (Stein's 125 letters, key 8): I.C.13 0.04231, p within-columns 0.2435, plain 0.331; K2 Part III (key 8): I.C.13 0.04103, p within-columns 0.4051, plain 0.4586; K2 ciphertext without '?' (key 8): I.C.13 0.04837, p within-columns 0.0894, plain 0.1486; K1 plaintext: I.C.13 0.04359, p within-columns -, plain 0.8613; K2 plaintext: I.C.13 0.06619, p within-columns -, plain 0.3845

What was searched, as the harness recorded it.

family
observation: the I.C. at 13 alphabets in K1 and K2 against key-period-preserving shuffles
shuffles
10,000
rows
  1. text
    K1 ciphertext (Stein's Part I, key 10)
    letters
    63
    ic13
    0.074
    peak13
    0.048
    p ic13 (within key columns)
    0.007
    p peak13 (within key columns)
    0.005
    p ic13 (plain shuffles)
    0.036
    p peak13 (plain shuffles)
    0.01
  2. text
    K2 Part II (Stein's 125 letters, key 8)
    letters
    125
    ic13
    0.042
    peak13
    0.008
    p ic13 (within key columns)
    0.243
    p peak13 (within key columns)
    0.048
    p ic13 (plain shuffles)
    0.331
    p peak13 (plain shuffles)
    0.126
  3. text
    K2 Part III (key 8)
    letters
    61
    ic13
    0.041
    peak13
    -0.006
    p ic13 (within key columns)
    0.405
    p peak13 (within key columns)
    0.531
    p ic13 (plain shuffles)
    0.459
    p peak13 (plain shuffles)
    0.423
  4. text
    K2 ciphertext without '?' (key 8)
    letters
    369
    ic13
    0.048
    peak13
    -0.006
    p ic13 (within key columns)
    0.089
    p peak13 (within key columns)
    0.12
    p ic13 (plain shuffles)
    0.149
    p peak13 (plain shuffles)
    0.899
  5. text
    K1 plaintext
    letters
    63
    ic13
    0.044
    peak13
    -0.045
    p ic13 (plain shuffles)
    0.861
    p peak13 (plain shuffles)
    0.86
  6. text
    K2 plaintext
    letters
    369
    ic13
    0.066
    peak13
    -0.002
    p ic13 (plain shuffles)
    0.385
    p peak13 (plain shuffles)
    0.551
stein texts below p 0 01
K1 ciphertext (Stein's Part I, key 10)
controls
10000 within-key-column shuffles and 10000 plain shuffles per text (seed 1613)

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