Experiment 124

“Replication: two unknown alphabets fit K4 at key length 19, where 3 of 100 scrambled coppers fit; against 1,000 fresh coppers, corrected for looking at every length, and against copies that keep the known places' letters”

F1.2, replication (order-of-work rule 5). 0123 found K4 consistent with Quagmire IV at key length 19 while only 3% of 100 coppers were. Here: (a) 1,000 fresh shuffles (seed 124), all lengths 1-26, give the share fitting at 19 and a look-elsewhere p: the share of shuffles whose rarest fitting length is as rare as K4's; (b) 1,000 copies that keep the 24 carved letters at the known places and shuffle only the other 73 (null B), which isolates whether the fit comes from the known places themselves.

revertedstatus
experiment 123parents
9 mintime, all phases
0candidates
0/24known letters
unclocked
1

The experiment method

What the method does with the 24 known letters.

In the last run, two unknown alphabets with a 19-letter key could produce 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., which happened for only 3 of 100 scrambled copies. One reason may be a coincidence in the carved textthe carved letters The 97 letters cut into the copper at the CIA, shown at the top of every experiment page.: two known R's, 38 places apart, both sit under a carved P. Here we try 1,000 new scrambled copies and ask how often any key length looks as rare as 19 did, since we looked at 26 lengths and something rare turns up by chance.

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 ACCENTat key length 19 the known places pair up 38 apart: 26-34 with 64-72, one check per pairFLRVQQPRNGKSSNYPVTTMZFPK28 and 66: R under P both times, so this check holds whatever the alphabetsfresh scrambled coppers that fit at 19: 26 of 1000 (p 0.026)corrected for looking at all 26 lengths: p 0.026, above the 0.01 set to stop; lengths 15 and 17 are as rare (0.028, 0.028)copies that keep the 24 known places' carved letters give K4's verdict at every length: 200 of 200OUT: NO READING; THE LENGTH-19 FIT IS A COINCIDENCE OF THE KNOWN LETTERS AT ABOUT 1 IN 40EASTNORTHEASTBERLINCLOCK
the idea

0123 found two unknown alphabets fitting K4 at key length 19, which only 3 of 100 scrambled coppers did. Rule 5 of the order of work: replicate against fresh controls before anything else.

the check

At length 19 the known places pair 38 apart; the R at 28 and the R at 66 both sit under P, a check that holds for free. 1,000 fresh scrambles show how often that kind of luck happens.

the bound

26 of 1,000 fit at 19 (p 0.026); lengths 15 and 17 are as rare, so a copper lands on such a length often enough. Not a signal; F1.2 goes on.

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 K4 in rows of 19; places 38 apart fall in the same column.
  2. Pair the known places that share a column: 26 with 64, 27 with 65, and so on up to 34 with 72.
  3. Places 28 and 66 are both R under carved P: whatever the alphabets, that pair agrees by itself.
  4. The other eight pairs must each satisfy carved-place minus known-place equal in both, and some pair of alphabets does.
  5. Scramble the carved letters, repeat, and count how often a scramble fits at 19, or at any length as rarely.
the worksheet: the first steps by hand, on squared paper
KEY LENGTH 19: THE NINE PAIRS OF KNOWN PLACES THAT SHARE A COLUMN (38 APART)placeknowncarvedplaceknowncarvedkind26NQ64BNcheck27OQ65EYcheck28RP66RPfree29TR67LVcheck30HN68ITcheck31EG69NTcheck32AK70CMcheck33SS71LZcheck34TS72OFcheckEach pair needs C(carved) - P(known) equal on both sides. The R/P pair satisfies itself, leaving eight checksthat two free alphabets can meet.
4

Worked example, generated

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

key length 8: known letters by slot (place mod 8)
  slot 0: T->V (25), S->S (33), E->Y (65), C->P (73)
  slot 1: N->Q (26), T->S (34), R->P (66), K->K (74)
  slot 2: O->Q (27), L->V (67)
  slot 3: R->P (28), I->T (68)
  slot 4: T->R (29), N->T (69)
  slot 5: E->F (22), H->N (30), C->M (70)
  slot 6: A->L (23), E->G (31), L->Z (71)
  slot 7: S->R (24), A->K (32), B->N (64), O->F (72)
  plain alphabet places: T=0 R=1 I=3 E=7 L=8 O=9 S=10 C=11 N=17 H=21 A=22 B=23 K=24
  cipher alphabet places: L=0 T=1 F=9 R=10 G=11 Z=12 M=13 V=14 Q=15 Y=21 K=22 N=23 S=24 P=25
  key: [14, 24, 6, 24, 10, 2, 4, 0]

key length 9: known letters by slot (place mod 9)
  slot 0: R->P (28), B->N (64), C->P (73)
  slot 1: T->R (29), E->Y (65), K->K (74)
  slot 2: H->N (30), R->P (66)
  slot 3: E->F (22), E->G (31), L->V (67)
  slot 4: A->L (23), A->K (32), I->T (68)
  slot 5: S->R (24), S->S (33), N->T (69)
  slot 6: T->V (25), T->S (34), C->M (70)
  slot 7: N->Q (26), L->Z (71)
  slot 8: O->Q (27), O->F (72)
  dead: no pair of alphabets fits

5

Hypothesis, for a cryptanalyst

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

Follow-up of 0123 (C27(c), C1(b)). Mechanism to test: at length 19 the known places pair up 38 apart (26-34 with 64-72), nine checks; places 28 and 66 are both R under P, so one check holds for free, and the other eight leave two free alphabets room to fit. Under null A (letters shuffled) that coincidence is rare. Under null B the carved letters at the 24 known places are those of K4, so the exact test, which reads only those letters, returns K4's verdict on every copy: null B is a check that the test depends only on the known places, and the honest null is A. Prediction is about A with the look-elsewhere correction. Same exact decider as 0123 (two independent alphabets, CRT mod 13 and mod 2, witness re-checked).

6

Prediction

Written before the run; the result decides it.

At length 19 about 2-5% of the 1,000 fresh coppers fit (K4's p near 0.03), but corrected for looking at every length the p is above 0.2: a copper usually fits at some length that few coppers fit at. So the length-19 fit is not a signal and F1.2 continues. If the corrected p is below 0.01, stop and report.

7

Method

  1. Draw 1,000 shuffles of K4 (seed 124).
  2. For each, decide Quagmire IV consistency at lengths 1-26 exactly.
  3. Share fitting per length; K4's p at 19.
  4. For K4 and each shuffle, the rarest fitting length's share (shares estimated from the other shuffles); corrected p = share of shuffles at least as rare as K4.
  5. Null B: 200 copies keeping the known places' carved letters, to confirm the verdict depends only on those.
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

Length 19: 26 of 1000 fresh coppers fit (p 0.026). K4's rarest fitting length share 0.026; look-elsewhere p 0.026. Null B: 200/200 copies give K4's verdict at every length.

What was searched, as the harness recorded it.

family
two unknown alphabets (Quagmire IV), periodic key 1-26, no move: replication of the length-19 fit
fresh coppers
1,000
seed
124
undecided
2
k4 fits
8, 13, 16, 19, 20, 23, 24, 26
copper share fitting by length
0, 0, 0, 0, 0, 0.157, 0.254, 0.27, 0, 0.485, 0.543, 0.523, 0.659, 0.62, 0.028, 0.728, 0.028, 0.784, 0.026, 0.672, 0.62, 0.724, 0.761, 0.825, 0.891, 0.956
k4 p at 19
0.026
k4 rarest fitting share
0.026
look elsewhere p
0.026
null b copies
200
null b same verdict as k4 at every length
200
controls
1000 fresh shuffled coppers (seed 124); null B 200 copies keeping the known places' letters

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