Experiment 217

“A13.3, replication: 0034's saved readings read backwards, the one candidate 0216 left unresolved, against more fresh copies of the same search, with reversed messages planted through 0034's own climb”

A13.3 (Stage 2, step 3, issue #75), the replication 0216 began and its clock cut short. 0216 found K4 above every copy in 2 of 112 cells; 0034/eng_keep_nth met a fresh copy at copy 6, but 0034/eng_reverse (K4 -5.458, the best of its 18 readings read backwards, from period 71) stayed above all 8 fresh copies drawn before the clock (and all 10 of pass 1). Here the same pre-registered sequence continues: fresh copies 8 onward of seed '3113', each a plain shuffle run through 0034's frozen sweep unchanged (24 conventions, periods 27-29 and 53-95 every third, 20 restarts), eight at a time, until one copy's best backwards score is at or above K4's (not a flag), or the clock (unresolved, with its p bound). New: reversed messages planted under 0034's own method at period 71 and climbed by its own climb, to say whether this cell can see a reversal at all.

revertedstatus
experiment 216parents
41 mintime, all phases
3candidates
24/24known letters
1

The experiment method

What the method does with the 24 known letters.

An old search (0034) produced 18 readings of K4the carved letters The 97 letters cut into the copper at the CIA, shown at the top of every experiment page. with every known letter in place and threw them away as gibberish. One of them reads a little better backwardsa mirror Reading or writing the text from the end to the start. than any reading the same search made from scrambled copiesa shuffled control The same experiment run on the carved letters shuffled into a random order. of the carving, which could mean Sanborn wrote his message backwards before enciphering it, or could be luck. Luck is tested the only honest way: run the same search on more scrambled copies until one of them reads as well backwards. We also hide some backwards messages of our own and see whether this search and test would notice them.

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.

OBKRUOXOGHULBSOLIFBBWEASTNORTHEASTOTWTQSJQSSEKZZWATJKLUDIAWINFBBERLINCLOCKWGDKZXTJCDIGKUHUAUEKCAR0034's 18 readings of each text written backwards, best English score: K4 against scrambled copies run through the same searchpass-1 copies (10)-6.5-6.0-5.5-5.0-4.5K4 -5.46fresh copies 8-15-6.5-6.0-5.5-5.0-4.5K4 -5.46copy 14 reaches K4: not a flagreversed plants-6.5-6.0-5.5-5.0-4.5K4 -5.46found 0 of 4a scrambled copya backwards message, after the climbthe message itselfEASTNORTHEASTBERLINCLOCKIN: THE COPPER, ALL 97 LETTERS, THE 24 KNOWN PLACES IN ACCENTOUT: NO READING; K4'S BACKWARDS LEAD WAS LUCK
the idea

0216 left one comparison open: K4's period-71 reading of 0034, written backwards, read a little better than any copy's. If Sanborn reversed his message before enciphering it, that is where it would show.

the check

The same pre-registered run of scrambled copies continued through 0034's own search until one copy read as well backwards; four backwards messages planted through the same search.

the bound

Fresh copy 14 reached -5.419 against K4's -5.458: not a flag, A13.3 ends with none. The plants were missed 4 of 4 times though each message itself would have been found: the forward climb overwrites a backwards message, so this test is weak for masks.

2

Experiment lineage

What this experiment was built on, from the lineage page: 14 experiments 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

Laid out as the copper carries K4: OBKR ends the line that finishes K3, then three lines of 31. Left, as carved, the 24 known places in accent. Right, the candidate: a known place it gets right is an accent cell, one it misses is outlined. This is the candidate with most known letters right; none passed every gate.

in: the copper, always the same

as carved, 97 letters; the 24 known places in accent
ECDMRIPFEIMEHNLSSTTRTVDOHW?OBKR
UOXOGHULBSOLIFBBWFLRVQQPRNGKSSO
TWTQSJQSSEKZZWATJKLUDIAWINFBNYP
VTTMZFPKWGDKZXTJCDIGKUHUAUEKCAR

OBKR ends the line that finishes K3, then three lines of 31

out: the candidate

every place read; known places in accent, misses outlined
ECDMRIPFEIMEHNLSSTTRTVDOHW?HUKS
ALLTHAVICEFFICESAEASTNORTHEASTN
ATIONANDINATESTINANDATTHERESBER
LINCLOCKENSTIONESERTERETOODSLCQ

checked: the known letters in place, and the reading turns back into the copper

4

How the score is made

The loss of the best candidate, part by part. Zero is solved.

Known letters missed0 of 24, ten points each0.00
Englishthe 73 free letters score -4.01; English text scores -3.60.41
Key348 bits to write it down (key words are cheap, arbitrary letters 4.7 bits each); each 60 beyond 60 costs a point4.80
Lossof 240, the worst possible5.21 2.2%
5

Walkthrough, by hand

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

  1. Take 0034's reading at period 71 with all 24 known letters in place.
  2. Write it backwards and score the backwards text for English: -5.458.
  3. Scramble the carved letters, run 0034's search on the scramble, and do the same with each of its 18 readings; keep its best backwards score.
  4. If that score reaches -5.458, K4's lead was luck: stop.
  5. If not, scramble again and repeat; 2,242 scrambles in a row below K4 would be a real signal.
  6. Separately, write a known message backwards, encipher it the 0034 way, run the search, and see whether the backwards score finds it.
the worksheet: the first steps by hand, on squared paper
copybest backwardsagainst K4search timefresh copy 8-5.473below2099 sfresh copy 9-5.494below2104 sfresh copy 10-5.700below2094 sfresh copy 11-5.694below2105 sfresh copy 12-5.709below2102 sfresh copy 13-5.586below2103 sfresh copy 14-5.419at or above K42103 sfresh copy 15-5.463below2104 sCopies 0-7 were drawn in 0216, all below. One copy at or above K4 ends the replication: not a flag.0034'S SWEEP ON EACH FRESH COPY, IN ORDER: BEST BACKWARDS SCORE AGAINST K4'S -5.458
6

Worked example, generated

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

0034's reading, period 71 : HUKSALLTHAVICEFFICESAEASTNORTHEASTNATIONANDINATESTINANDATTHERESBERLINCLOCKENSTIONESERTERETOODSLCQ
written backwards:            QCLSDOOTERETRESENOITSNEKCOLCNILREBSEREHTTADNANITSETANIDNANOITANTSAEHTRONTSAEASECIFFECIVAHTLLASKUH
English score of the backwards text: -5.458
a fresh scrambled copy through the same search counts against it when its best backwards score is at or above this
7

Hypothesis, for a cryptanalyst

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

A13 (knowledge/12-assumptions.md), C4(a) (Scheidt 2005, 2015: 'I masked the English language'; a plaintext transform before the keyed stage), reading: the mask is a reversal of the message, the simplest move-only mask (0023 closed it exactly for short periodic keys; here the long periods 53-95 where the known letters leave 47-71 free key slots). Cipher: one periodic tableau key on the standard or KRYPTOS alphabets, 24 conventions, periods 27-29 and 53-95 every third (0034's space), free slots completed by a forward quadgram climb. Statistic: eng_reverse (tools/a13_structure.py), the quadgram score of the reading written backwards, best over a text's 18 readings. The cell was one of 112 pre-registered in reports/a13-structure-check.md (flag at p < 0.05/112, all of 2,242 fresh copies below K4). K4's two best backwards readings (periods 71 and 77, -5.458 and -5.525) both exceed every copy's best so far (-5.553), which is why it needs fresh copies, not argument. Plants measure power: a forward climb pulls the free letters toward forward English, so a reversed message may be destroyed by the very search that should reveal it.

8

Prediction

Written before the run; the result decides it.

A fresh copy reaches K4's backwards score within the 40 or so copies the clock allows (K4 has led 18 copies, which luck alone does about one time in 19), so the cell is not a flag and A13.3 closes with no flag. The reversed plants are found 0 or 1 times in 4: the forward climb overwrites the free letters, so the backwards test on this search has little power, and a 'nothing found' here says little about reversal. Zero candidates pass gate 4.

9

Method

  1. K4: 0034's 18 saved readings (24 of 24 known letters), each re-enciphered by 0034's frozen encrypt; the best backwards score.
  2. Reversed plants: four messages from Carter's 1923 book, written backwards, the 24 known letters set after the reversal, enciphered under 0034's method with a random convention and a random period-71 key; each climbed by 0034's frozen sweep at period 71 only (a slice: one period of its 18, which can only lower the plant's best); found when its best backwards score is above every 0034 copy's.
  3. Fresh copies 8 onward of seed '3113' (copies 0-7 were 0216's), 0034's sweep unchanged, eight at a time on eight cores, until one copy is at or above K4, or 2,242 copies all below (a flag), or the clock.
  4. Verdict: caught (not a flag; A13.3 closes), or unresolved with p at most 1/(copies + 1).
10

Result and bounds

The harness's record: candidates, gates, loss, and the negative result this experiment leaves behind.

3candidates returned
0passed every gate
24/24known letters, best
2.2%lowest loss
nonechampion before

All 3 candidates, lowest loss first.

1failed at baseline24/24 known lettersloss 2.2%
ECDMRIPFEIMEHNLSSTTRTVDOHW?HUKS
ALLTHAVICEFFICESAEASTNORTHEASTN
ATIONANDINATESTINANDATTHERESBER
LINCLOCKENSTIONESERTERETOODSLCQ

0034's saved reading, backwards score -5.458: period 71 key KSDEGWSDMKXVMAYZNVJUIQTELWEHGZUPFHUFMTEZYWBPEPUHJVTJPMDVTVBWFQUOGHTTKPB (47 free slots

2failed at baseline24/24 known lettersloss 2.2%
ECDMRIPFEIMEHNLSSTTRTVDOHW?TOVE
NOTHESTHERSTTHESAEASTNORTHEASTR
ERESIDENTERSAREARETOTHERATERBER
LINCLOCKSONOFTHISFREETERSINEEDL

0034's saved reading, backwards score -5.525: period 77 key HSUPMCUYLTXJVEGYTUVDPMCLWNQHMHLKFGFKQKXYGDAGNLNRQWVRTYNCMWQEKMCBYHITCDFYZDURP (53 free

3failed at baseline24/24 known lettersloss 2.4%
ECDMRIPFEIMEHNLSSTTRTVDOHW?WARO
UNTRETHEREATEDINTEASTNORTHEASTE
RESTOREASTEVERESANDINTHETHESBER
LINCLOCKTATTHECONTHESTORATANAME

0034's saved reading, backwards score -5.764: period 86 key IZHXAZWDYMNTQMMIWYHMXZPBYXYCCUYQABQYIZDWIOIAPUWFVEZRDSOKLHILUZROGCQPUQMJNAXUQJIHJFLQZY

0034/eng_reverse: K4 -5.458; 8 more fresh copies (max -5.419); first at or above: 14; verdict not a flag. Reversed plants found 0 of 4.

What was searched, as the harness recorded it.

item
A13.3
cell
0034/eng_reverse
pre registered
2026-10-21, reports/a13-structure-check.md; replication rule in 0216
k4 value
-5.458
k4 period
period 71
k4 readings
18
k4 reencrypt ok
yes
k4 second
-5.525
pass1 copies
10
pass1 max
-5.553
fresh in 0216
8
fresh in 0216 max
-5.557
fresh here
8
fresh here first index
8
fresh here max
-5.419
first copy at or above
14
verdict
not a flag
p bound if unresolved
None
fresh values
  1. copy
    8
    eng reverse
    -5.473
    seconds
    2,099.1
  2. copy
    9
    eng reverse
    -5.494
    seconds
    2,103.8
  3. copy
    10
    eng reverse
    -5.7
    seconds
    2,093.7
  4. copy
    11
    eng reverse
    -5.694
    seconds
    2,104.7
  5. copy
    12
    eng reverse
    -5.709
    seconds
    2,101.6
  6. copy
    13
    eng reverse
    -5.586
    seconds
    2,102.7
  7. copy
    14
    eng reverse
    -5.419
    seconds
    2,102.9
  8. copy
    15
    eng reverse
    -5.463
    seconds
    2,103.5
search
0034's frozen sweep unchanged: 24 conventions, periods 27-29 and 53-95 every third, 20 restarts, forward quadgram climb of the free slots
plants
  1. i
    0
    convention
    std/kry/kry/vig
    reading value
    -5.734
    plaintext value
    -4.711
    letters right
    35
    found
    no
    reading
    AERENTORARECOULDIENTSEASTNORTHEASTINTHEREINTHESTERSTORINGINGINABERLINCLOCKTETESTEMPLEOFTEALLTAPEH
  2. i
    1
    convention
    std/std/kry/varbeau
    reading value
    -6.034
    plaintext value
    -4.744
    letters right
    42
    found
    no
    reading
    EVENGTHEALINTHEECASHEEASTNORTHEASTREDINGTHERESTANDREATEDINTHEINBERLINCLOCKTERSPEANETECHISTILEHTHT
  3. i
    2
    convention
    kry/kry/std/vig
    reading value
    -5.962
    plaintext value
    -4.995
    letters right
    40
    found
    no
    reading
    ETOGETHEALSEROOMSBEFIEASTNORTHEASTNTHERENTHESANDSOMETERANDINTHEBERLINCLOCKISHINTHERTHECOATTELATON
  4. i
    3
    convention
    kry/std/std/varbeau
    reading value
    -5.89
    plaintext value
    -4.805
    letters right
    29
    found
    no
    reading
    ACLOSERSABOUTSONOUSEOEASTNORTHEASTFTHERETHETHESERINTHESTHATIONOBERLINCLOCKMOREMENBURESTERIANEUVIT
plants found
0 of 4
plant design
Carter 1923 written backwards, 24 known letters set after the reversal, random convention, random period-71 key; climbed by 0034's sweep at period 71 only (sliced); found = best backwards score above every pass-1 copy's (-5.553)
plant seconds
67.1
seconds
2,171.9

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