“A6.1, replication: 0034's completed periodic keys at lengths 27-29, where K4's best judged reading (8) led all 10 copies (best 7), against fresh copies of the same frozen search until one reaches 8 or 80 stay below”
Rerun of 0224 with gate 4 given the 0034 search's own copies (0216's 10, pass1_copies.json, 30 readings at 27-29) as well as the fresh ones: 0224 gave it only its 8 fresh copies, and K4's period-29 reading (-6.709), below 0216's copies (best -6.627) and failed in 0222, was kept against them (issue #88's error again). Same seeds; the replication is unchanged. A6.1 (Stage 2, step 4, issue #84), the candidate 0222 left (0223 is a mistaken duplicate of 0222: the new code was not written before the run). 0222 judged K4's saved readings of 0034, 0035 and 0048 against 0216's regenerated copies: in the cell 0034 at 27-29 K4's best (8 of 100) was above every one of 10 copies (4-7), the only one of 4 cells where it led (chance 0.36). Pre-registered rule (program.md): a candidate is replicated on that cell alone against fresh copies, enough for the corrected p (0.05 / 4: 80 copies all below K4), before anything else. Fresh plain shuffles (seed 4222), 0034's frozen sweep unchanged at periods 27, 28, 29 (the cell's three readings per text: 24 conventions, 20 restarts each), eight at a time, judged after each batch.
One old search, rerun on scrambled copiesa shuffled control The same experiment run on the carved letters shuffled into a random order. of the carving, gave readings 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. scored a little below the carving's reading (7 against 8 out of 100, both near the bottom of the scale). That is probably luck. The honest check is to scramble again and again, run the same search, and see how soon a scrambled copy does as well.
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.
the idea
In 0222 K4's readings at key lengths 27-29 scored 8 out of 100 with the judge, every copy 7 or less. Luck is tested by more copies.
the check
Fresh scrambles through 0034's frozen search at 27-29, judged in batches of eight; 80 in a row below 8 would be a flag.
the bound
Copy 6 of the first batch scored 8: not a flag; A6.1's cell closes. Rerun of 0224 with gate 4 given the 0034 search's own copies as well (issue #94): every reading fails, reverted.
2
Experiment lineage
What this experiment was built on, from the lineage page: 16 experiments before it, back to the root of its line. Its number is in bold.
keptreverted, in its family's colour×error or timeoutreverted under today's rulesbuilt on a parent in the same familybuilt 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?YJAE
IVIZKOYDBEACIOSSLEASTNORTHEASTV
CACZLEVESITMILANBACMIIXDCHKYBER
LINCLOCKATTHIZQLLPDLOFDFOIJGUSM
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 missed
0 of 24, ten points each
0.00
English
the 73 free letters score -6.71; English text scores -3.6
3.11
Key
151 bits to write it down (key words are cheap, arbitrary letters 4.7 bits each); each 60 beyond 60 costs a point
1.51
Loss
of 240, the worst possible
4.62 1.9%
5
Walkthrough, by hand
Redo the method on a few letters with pencil and paper.
Scramble the 97 carved letters.
For key lengths 27, 28 and 29, fix the key letters the known words force, and choose the 3-5 free ones so the rest reads as much like English as possible.
Hide the known words and give the three readings to the judge.
If the best scores 8 or more, the carving's lead was luck: stop.
Otherwise scramble again; 80 scrambles in a row below 8 would be a signal.
the worksheet: the first steps by hand, on squared paper
6
Worked example, generated
The same steps run by the code on the real letters.
0034's reading of K4 at key length 27 (3 free key slots climbed):
reading ZWAWFAFIWGMGOGMDROTMAEASTNORTHEASTISTCDAPPUDSFROKLPDGBCUMLDWLBYBERLINCLOCKADHARIUHVWCQFISIQMNGDJK
judge sees ZWAWFAFIWGMGOGMDROTMA#############ISTCDAPPUDSFROKLPDGBCUMLDWLBY###########ADHARIUHVWCQFISIQMNGDJK
K4's best of its three readings (27, 28, 29) scored 8; a fresh copy's three readings by the same search must reach 8.
7
Hypothesis, for a cryptanalyst
Family, key space, the constraint under test, and the clues it reads.
A6 (knowledge/12-assumptions.md). Cipher: one periodic key on the standard or KRYPTOS tables, 24 conventions, key lengths 27-29 (C1(c), C27(c): the K1/K2 tableau system at the only lengths 1-52 the known letters leave alive for it; 0005), the 3-5 free key slots completed by a quadgram climb (0034). Statistic: the judge's best score (j3, Sonnet 5.5) over a text's three readings. K4: 8 ('? LEVES SIT MILAN BAC ? AT ? OF ?'). With 3-5 free slots each reading is fixed but for 9-15 letters, so a score of 8 means a few short words, inside what the bench calls chance (20 = a few short words). Sequential: a fresh copy at or above 8 ends it (not a flag); 80 copies all below K4 is a flag (p < 0.0125 corrected for the 4 cells of 0222).
8
Prediction
Written before the run; the result decides it.
A fresh copy scores 8 or more within the first two batches (16 copies): the 10 copies of 0222 already reached 7 twice, and the judge's scores at this end of the scale move in steps of 2-4. Not a flag. Zero candidates pass gate 4.
9
Method
Fresh copies: plain shuffles of K4 from random.Random(4222), a search seed each, as tools/a13_check.py's pass 1 drew them.
Each through 0034's frozen sweep at periods 27, 28, 29 (24 conventions, 20 restarts), best reading per period.
Eight copies at a time on eight cores; the batch's 24 readings judged in one call; each copy's best.
Stop at the first copy at or above 8 (not a flag), at 80 copies all below (a flag), or at the clock (unresolved, with p at most 1/(copies + 11)).
10
Result and bounds
The harness's record: candidates, gates, loss, and the negative result this experiment leaves behind.