Experiment 222

“A6.1, part 2: the completed periodic keys of 0034, 0035 and 0048 (lengths 27-29 on the sculpture's and the puzzle words' tables, and 0034's 53-95) rejudged blind: K4's saved readings against the same frozen searches' readings on 10 copies each”

A6.1 (Stage 2, step 4, issue #84), the second group of sampled verdicts. 0034 (one periodic key on the standard and KRYPTOS tables, 24 conventions, periods 27-29 and 53-95 every third), 0035 (27-29, one side keyword-mixed from the vocabulary) and 0048 (27-29, both sides keyword-mixed) completed the free key slots by a quadgram climb and compared K4's best with shuffled K4 by quadgram. Their copies were never kept, and their runs stopped on the clock, so they cannot be replayed letter for letter; but 0216 ran each frozen search unchanged on 10 fresh plain shuffles (tools/a13_check.py pass1-regen, seed 1300) and kept every reading (reports/a13-structure-data/pass1_copies.json). Here K4's saved readings and those copies' readings go to the judge in one blind call per experiment. 0037's sampled triples are not rejudged: F6.3b's close rests on 0158's exact count.

revertedstatus
experiment 221parents
3 mintime, all phases
24candidates
24/24known letters
unclocked
1

The experiment method

What the method does with the 24 known letters.

Three old experiments filled in long keys so that the carved lettersthe carved letters The 97 letters cut into the copper at the CIA, shown at the top of every experiment page. read as much like English as possible, and compared the result with the same trick on scrambled copiesa shuffled control The same experiment run on the carved letters shuffled into a random order. using a simple letter-statistics score. That score is poor at telling damaged English from English-looking junk. Here the judgethe judge A language model that scores how much of a reading is English, from 0 to 100, allowing misspellings and X between sentences., a language model that reads one text at a time without knowing where it came from, reads the carved letters' readings and the copies' readings.

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.

OBKRUOXOGHULBSOLIFBBWEASTNORTHEASTOTWTQSJQSSEKZZWATJKLUDIAWINFBBERLINCLOCKWGDKZXTJCDIGKUHUAUEKCARK4's saved readings of three old searches against the same searches' readings of 10 scrambled copies each (0216), read by the judge one at a time, unlabelled0034 P53-95020406080100K4 30K4 rank 8 of 110034 P27-29020406080100K4 8K4 rank 1 of 110035 P27-29020406080100K4 6K4 rank 8 of 110048 P27-29020406080100K4 12K4 rank 6 of 11each copy's best readingEASTNORTHEASTBERLINCLOCKIN: THE COPPER, ALL 97 LETTERS, THE 24 KNOWN PLACES IN ACCENTOUT: NO READING; K4 LEADS ONE CELL OF FOUR, AT THE BOTTOM OF THE SCALE
the idea

Three old searches filled in long keys to make K4 read like English and compared it with scrambled copies by letter statistics. The judge reads for words instead.

the check

K4's 24 saved readings and the same searches' readings of 10 copies each, 264 texts in all, judged blind.

the bound

K4 above every copy only at 0034's lengths 27-29, by 8 against 7 out of 100 (chance 0.36 such cells): a candidate, replicated in 0224/0225.

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?RPRE
SIDENTHESTHERESANEASTNORTHEASTD
ERSTHEPRESINTHEREARENTHERETHBER
LINCLOCKERESIDEDINGTHETHEREARTI

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 -3.28; English text scores -3.60.00
Key461 bits to write it down (key words are cheap, arbitrary letters 4.7 bits each); each 60 beyond 60 costs a point6.68
Lossof 240, the worst possible6.68 2.8%
5

Walkthrough, by hand

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

  1. Take 0035's three readings of K4, one per key length 27, 28 and 29.
  2. Take the same search's three readings of each of 10 scrambled copies.
  3. Hide the 24 known letters and give all 33 readings to the judge one at a time, unlabelled.
  4. Keep each text's best score.
  5. K4 wins only if its best is above all 10 copies' bests.
the worksheet: the first steps by hand, on squared paper
cellK4copies' bestK4's rankreadings per text0034 P53-9530458 of 11150034 P27-29871 of 1130035 P27-296128 of 1130048 P27-2912126 of 113A cell flags only at p < 0.05/4; with 10 copies a K4 above all is a candidate to replicate, not a result.EACH COMPLETED-KEY SEARCH, REJUDGED: K4'S BEST JUDGE SCORE AGAINST THE COPIES' BEST
6

Worked example, generated

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

0035's reading of K4 (period 27, plain std, cipher HILL/keyword, vig; 3 free slots climbed):
  reading      QGFMJOYSTOAEUHISNORDFEASTNORTHEASTSDKZSIZKIENYYISBUIIAWIVYLBOMOBERLINCLOCKFFEMXURMHAWYLVEERAJBUXH
  judge sees   QGFMJOYSTOAEUHISNORDF#############SDKZSIZKIENYYISBUIIAWIVYLBOMO###########FFEMXURMHAWYLVEERAJBUXH

  the judge reads it among 30 readings of 10 scrambled copies by the same search, one at a time, unlabelled.
7

Hypothesis, for a cryptanalyst

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

A6 (knowledge/12-assumptions.md); C27(c) and C5 for the tables (the keyword-mixed alphabets of 0035 and 0048), C19 for the judge's tolerance of X stops. Cells: 0034 at 27-29 (3 readings per text), 0034 at 53-95 (15 readings; already blocked by 0136's bound, judged for the record), 0035 at 27-29 (3), 0048 at 27-29 (3). Statistic per cell: the judge's (j3, Sonnet 5.5) best score over a text's readings; K4 counts only strictly above all 10 copies' bests; None as not found. Every reading of every text is sent (no quadgram cut, the same for K4 and copies). Four cells, chance about 4/11 = 0.36 cells with K4 above every copy; a flag needs p < 0.05/4, 80 copies, so a K4 above every copy here is a candidate to replicate on that cell against fresh copies, not a result.

8

Prediction

Written before the run; the result decides it.

K4 above every copy in no cell (chance 0.36). The copies' best judge scores are 20-50 at 53-95, where the climb fills 47-71 free letters with English-like fragments, and under 20 at 27-29, where only 3-5 letters are free. Zero candidates pass gate 4.

9

Method

  1. K4: the 24-of-24 readings saved in 0034 (18), 0035 (3), 0048 (3) raw.json.
  2. Copies: the readings of the same frozen searches on 10 plain shuffles each, from pass1_copies.json.
  3. One judge call per experiment on all of K4's and the copies' readings; per text and cell, the best score.
  4. K4 counts only strictly above every copy's best.
10

Result and bounds

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

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

All 24 candidates, lowest loss first.

1failed at baseline24/24 known lettersloss 1.7%
ECDMRIPFEIMEHNLSSTTRTVDOHW?JGAF
EEFGHJCJOUSTOLITIEASTNORTHEASTE
HHUAODBULYMENDTRYFFLAWPKASEDBER
LINCLOCKITHNDPRGADTYGABNDEDOZMS

saved reading of 0048: period 29, plain LUCID/keyword, cipher WONDERFUL/keyword, beau; 5 free slots climbed

2failed at baseline24/24 known lettersloss 1.8%
ECDMRIPFEIMEHNLSSTTRTVDOHW?UYUG
NUWILATPSJGPEOMIFEASTNORTHEASTI
AORTOOPSUPOUGHBHISCEBKRIFCSOBER
LINCLOCKFWRZEIMDEXZEMBERHTJRETQ

saved reading of 0048: period 27, plain WEBSTER/keyword, cipher WORLDCLOCK/keyword, beau; 3 free slots climbed

3failed at baseline24/24 known lettersloss 1.9%
ECDMRIPFEIMEHNLSSTTRTVDOHW?DWIV
EFUEXNARRMGFNUECOEASTNORTHEASTM
WSESLIBREUKSFOCUJPVHUNIJEFUNBER
LINCLOCKCEDWJICYBUNUIPOBOZZHUQP

saved reading of 0035: period 28, plain WILLIAMWEBSTER/keyword, cipher std, beau; 4 free slots climbed

4failed at baseline24/24 known lettersloss 1.9%
ECDMRIPFEIMEHNLSSTTRTVDOHW?ADJB
NPTHULKBRUNTDELITEASTNORTHEASTY
WBCIGZFRYRKWATWCULYBOLARSASWBER
LINCLOCKALSKHOOJUOLBJCEGOTKPAKO

saved reading of 0048: period 28, plain SHADOW/keyword, cipher LODESTONE/keyword, varbeau; 4 free slots climbed

5failed at baseline24/24 known lettersloss 1.9%
ECDMRIPFEIMEHNLSSTTRTVDOHW?FFAT
RYYSOWADXNDJBUTHEEASTNORTHEASTY
FINMGHFNESEAVOLPGLEXNZIANXBIBER
LINCLOCKRTRAAJSAKOWAAGGQIRORYUK

saved reading of 0035: period 29, plain LANGLEY/keyword, cipher std, beau; 5 free slots climbed

6failed at baseline24/24 known lettersloss 1.9%
ECDMRIPFEIMEHNLSSTTRTVDOHW?QGFM
JOYSTOAEUHISNORDFEASTNORTHEASTS
DKZSIZKIENYYISBUIIAWIVYLBOMOBER
LINCLOCKFFEMXURMHAWYLVEERAJBUXH

saved reading of 0035: period 27, plain std, cipher HILL/keyword, vig; 3 free slots climbed

7failed at baseline24/24 known lettersloss 1.9%
ECDMRIPFEIMEHNLSSTTRTVDOHW?YJAE
IVIZKOYDBEACIOSSLEASTNORTHEASTV
CACZLEVESITMILANBACMIIXDCHKYBER
LINCLOCKATTHIZQLLPDLOFDFOIJGUSM

saved reading of 0034: period 29 key HYHMKBNENTXBQRMAEROOOXYHANZEF (5 free slots climbed); kry/kry/std/beau

8failed at baseline24/24 known lettersloss 1.9%
ECDMRIPFEIMEHNLSSTTRTVDOHW?RYIH
BKSCNNJARISEYUCCTEASTNORTHEASTW
HCOFHCGDMXKAATSIXNHCIURRORLDBER
LINCLOCKTHEJUFYFLIUAILUSCILVXVL

saved reading of 0034: period 28 key NZVDMORFNOEEADIAGKSSSUELRXLO (4 free slots climbed); kry/std/std/vig

9failed at baseline24/24 known lettersloss 2.0%
ECDMRIPFEIMEHNLSSTTRTVDOHW?ISIN
GHICNNJARISEYUNDEEASTNORTHEASTN
ETINTHEREINTEDTOTHERECORDSONBER
LINCLOCKHIMJUFYFLIUAILUSOFFSOFV

saved reading of 0034: period 56 key BFFCTASVNMWWAXSAUQSJPGWPJDPMNBFXOMFSIWDMFVJTLJFMOEMVEAHI (32 free slots climbed); kry/

10failed at baseline24/24 known lettersloss 2.0%
ECDMRIPFEIMEHNLSSTTRTVDOHW?PATE
OVERSCURFONVGFSQYEASTNORTHEASTA
RELEDFEATHESTHEPRESHANINTSTIBER
LINCLOCKNFGEEHNBSHCEBUDGEARESSU

saved reading of 0034: period 53 key PRPUBCROXCHYSSRSHDNLQCECHPTSDQDDDEHDKTQUHQMEEHLMPTBKH (29 free slots climbed); std/std

11failed at baseline24/24 known lettersloss 2.1%
ECDMRIPFEIMEHNLSSTTRTVDOHW?IRWA
HOTALLISAREATHENTEASTNORTHEASTI
NANDSOMESANDINTHERENTHERSEARBER
LINCLOCKSSIONESISSTINGETPVCHACT

saved reading of 0034: period 68 key SDHLGKTHUVFNRRDEIXWHPREZYPYXXSYDKZSSVSGKUTHKTWVLCAFONAADRVOJCODFQXDE (44 free slots cl

12failed at baseline24/24 known lettersloss 2.1%
ECDMRIPFEIMEHNLSSTTRTVDOHW?ZWAW
FAFIWGMGOGMDROTMAEASTNORTHEASTI
STCDAPPUDSFROKLPDGBCUMLDWLBYBER
LINCLOCKADHARIUHVWCQFISIQMNGDJK

saved reading of 0034: period 27 key EFHYHMKUKBNENTXBQRMAEXYHANZ (3 free slots climbed); kry/kry/std/beau

13failed at baseline24/24 known lettersloss 2.1%
ECDMRIPFEIMEHNLSSTTRTVDOHW?ZONV
SENAGRAYSTEDITSUREASTNORTHEASTE
SINTHERATIONANDTHESTIONSIDERBER
LINCLOCKMICHEMWHATHEWPNOSTNOXLS

saved reading of 0034: period 65 key TGNWRJLFKIYNHDJRTJHPXWXAKGZTOAXAFDJDFWXQRUGDKOMSJLBTEWZZQKPTPWCRG (41 free slots climb

14failed at baseline24/24 known lettersloss 2.1%
ECDMRIPFEIMEHNLSSTTRTVDOHW?WHEU
SHESTIONSTEONLYCOEASTNORTHEASTN
THETHESTATESTIMENTSANDINGATIBER
LINCLOCKONTHEWARKENHISTHESOMESG

saved reading of 0034: period 74 key LGZVHKFBYMIMUHPSIHZMLQTELWEHGZUPFHUIBBFTXDHEKZNUABBJSOGDXEPUSRFOGHTTKPBKSD (50 free sl

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

saved reading of 0034: period 71 key KSDEGWSDMKXVMAYZNVJUIQTELWEHGZUPFHUFMTEZYWBPEPUHJVTJPMDVTVBWFQUOGHTTKPB (47 free slots

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

saved reading of 0034: period 77 key HSUPMCUYLTXJVEGYTUVDPMCLWNQHMHLKFGFKQKXYGDAGNLNRQWVRTYNCMWQEKMCBYHITCDFYZDURP (53 free

17failed at baseline24/24 known lettersloss 2.2%
ECDMRIPFEIMEHNLSSTTRTVDOHW?RROU
RUNXYOROCSVIOLEISEASTNORTHEASTA
NDINTHERATINGTHESTINTERSAIDEBER
LINCLOCKTANYLOWCUVRISRQWLTMEDSL

saved reading of 0034: period 59 key IYIFUCJFBFUJDXDKGVFJYJMWZCUJURLLXVUFSBCVWRNZBZMFKHTIHKGANRY (35 free slots climbed); k

18failed at baseline24/24 known lettersloss 2.3%
ECDMRIPFEIMEHNLSSTTRTVDOHW?YVWP
JDWEXAHRENTERNINOEASTNORTHEASTT
HEPARTERANDANDINTHECONTERATIBER
LINCLOCKSANDMEARECTUNWVSGUCAJFA

saved reading of 0034: period 62 key FOGHTTKPBKSDJZDKAFFBLQTELWEHGZUPFHDOEJCLOOLEEKMSFEKOVKEXIVEASR (38 free slots climbed)

19failed at baseline24/24 known lettersloss 2.3%
ECDMRIPFEIMEHNLSSTTRTVDOHW?BERS
DATEDTOARELETHESTEASTNORTHEASTO
RESTHATTHEREATTHETHEAREANDINBER
LINCLOCKTHERESANDITISREELETOURJ

saved reading of 0034: period 80 key XXZVLYUUDKQKHVOGLYXCTBKVSBPCXFCTACADMYQSJQCSAZOSTDQFWDKDOWQWJXPLRCFPLJIHUATZZZOS (56 f

20failed at baseline24/24 known lettersloss 2.4%
ECDMRIPFEIMEHNLSSTTRTVDOHW?OARE
ACHALLIONTHEREINTEASTNORTHEASTH
EWITHEARECOMENTHEREINTERESANBER
LINCLOCKDRESTATINTHEDALECTINGMO

saved reading of 0034: period 83 key JSRDFXJVYXNXFNCNCSAFWSJRXTUOSORAMNCAZEZBOGLYRONFQMDORNNDEXUPZOFICOPEJKMCZKGEUSUCPSE (5

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

saved reading of 0034: period 86 key IZHXAZWDYMNTQMMIWYHMXZPBYXYCCUYQABQYIZDWIOIAPUWFVEZRDSOKLHILUZROGCQPUQMJNAXUQJIHJFLQZY

22failed at baseline24/24 known lettersloss 2.6%
ECDMRIPFEIMEHNLSSTTRTVDOHW?ISCO
REATTHETHESTHEREAEASTNORTHEASTN
DCONTHERESERINTHESTERANDERANBER
LINCLOCKDRENTHEREARATERSTHEMARX

saved reading of 0034: period 89 key NACPMJYYGVZKPKXKWQZMXQRTPHIUUARAYZSHZSHZXYXKDEQHKALUSKZBPUATKMVUGUHMRUKAFKAEONSFIHNKGN

23failed at baseline24/24 known lettersloss 2.7%
ECDMRIPFEIMEHNLSSTTRTVDOHW?OFOR
ESTINTEDINTHEARENEASTNORTHEASTT
HESTHESTHERENTERSANDINGANDINBER
LINCLOCKGSTANDTHERENTERSARETHAL

saved reading of 0034: period 92 key KVUKDZQJQDDANGRPTOAWTRDUMRIYWOYNKYRJFXJMOHYMKZHSNVPDNXEUVQJVCWIELYOIECBAQKDASNSHKYXCTQ

24failed at baseline24/24 known lettersloss 2.8%
ECDMRIPFEIMEHNLSSTTRTVDOHW?RPRE
SIDENTHESTHERESANEASTNORTHEASTD
ERSTHEPRESINTHEREARENTHERETHBER
LINCLOCKERESIDEDINGTHETHEREARTI

saved reading of 0034: period 95 key FALPWPOZKOFGDGYGYMDMJMCLWNQHMHLKFGXKQHZRHUEXABHQDWGHKKCPTKAYEAZBYHITCDFYZDATQMCOKGZPLS

0034 P53-95: K4 30, copies best 45 (rank 8 of 11); 0034 P27-29: K4 8, copies best 7 (rank 1 of 11); 0035 P27-29: K4 6, copies best 12 (rank 8 of 11); 0048 P27-29: K4 12, copies best 12 (rank 6 of 11)

What was searched, as the harness recorded it.

item
A6.1 (part 2)
experiments
0034, 0035, 0048
cells
4
flag level
p < 0.05 / 4; needs 80 copies
copies
0216's regeneration (tools/a13_check.py pass1-regen, seed 1300): each frozen search unchanged on 10 plain shuffles
by cell
0034 P53-95
k4 judge
30
k4 judge reading
IS IN G HIC NN JAR ISE Y UNDE ? NET IN THERE IN TED TO THE RECORDS ON ? HIM ? ? ?
copies best
30, 45, 42, 30, 27, 28, 40, 40, 22, 33
copies max
45
k4 above every copy
no
k4 rank
8
n copies
10
readings per text
15
judge none in call
0
0034 P27-29
k4 judge
8
k4 judge reading
? LEVES SIT MILAN BAC ? AT ? OF ?
copies best
6, 6, 4, 4, 7, 6, 4, 4, 7, 7
copies max
7
k4 above every copy
yes
k4 rank
1
n copies
10
readings per text
3
judge none in call
0
0035 P27-29
k4 judge
6
k4 judge reading
? ? ? BUT THE ? ? ? SEA ? ? ? ?
copies best
5, 8, 12, 12, 6, 4, 4, 12, 6, 8
copies max
12
k4 above every copy
no
k4 rank
8
n copies
10
readings per text
3
judge none in call
0
0048 P27-29
k4 judge
12
k4 judge reading
? ? ? DEXZEMBER (DECEMBER?) ? ?
copies best
8, 12, 6, 8, 12, 8, 12, 12, 12, 7
copies max
12
k4 above every copy
no
k4 rank
6
n copies
10
readings per text
3
judge none in call
0
k4 above every copy cells
0034 P27-29
chance expected
0.36
judge texts sent
264
judge calls estimated
264
quadgram cut
none: every reading of K4 and of the copies sent
not rejudged
0037
F6.3b's close rests on 0158's exact count (105.5 million routes); 0037 kept no reading
controls
quadgram scores of every copy reading of the three searches (pass1_copies.json); each K4 reading faces its own experiment's copies among them (issue #88)
exhaustive
no

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