“F1.9: progressive keys, per-letter and per-repeat, every step and period 1-52, on the standard, KRYPTOS and every dictionary keyword table, against scrambled copies (Kryha's step of 3 included)”
F1.9. 0011 tested the progressive key (per-repeat and per-letter) on the standard and KRYPTOS tables and 0042 the per-repeat form on vocabulary tables; the per-letter form on keyword tables, the surviving periods 26-30 against copies, and Kryha's machine stepping (3 per cycle) at periods 31-52 were open. Here both forms, steps 1-25, periods 1-52, on 0109's tables: every dictionary word of four letters or more as a keyword alphabet (plain side, cipher side or both, the other side standard or KRYPTOS), plus the 8 standard/KRYPTOS tables, added and Beaufort forms; the consistency test is compiled C. Ten scrambled copies.
revertedstatus
a new rootparents
7 mintime, all phases
0candidates
0/24known letters
unclocked
1
The experiment method
What the method does with the 24 known letters.
In a progressive key the secret wordthe secret word The word or string a cipher needs besides the method. slides along the tablethe table The right-hand half of the sculpture, 26 rows of the alphabet each shifted one place further, starting from the word KRYPTOS. by a fixed step, either after every letter or after every full pass of the word, the way some cipher machines stepped. We try every step and word length up to 52 on the sculpture's tables and on tables built from every dictionary word, and check against 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. and scrambled copies of the carved textthe carved letters The 97 letters cut into the copper at the CIA, shown at the top of every experiment page..
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
A progressive key slides the secret word along the table by a fixed step, after every letter or after every pass of the word, as some cipher machines (Kryha) did. Only part of this had been tried.
the check
Every step 1-25 and word length 1-52, both kinds of stepping, on 1,040,314 tables (the sculpture's and every dictionary word's), against the 24 known letters and ten scrambled copies.
the bound
Nothing fits below length 25, on K4 as on the copies; K4 leads the copies in 4 of 104 cells, within what a copy manages against the rest. Length 34 noted.
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.
Take a key word of length 7 and a step of 3 per letter: the key at place i is the word's letter at i mod 7 plus 3 i.
On the table, the known letter and the carved letter at each known place fix the key value there.
Subtract 3 times the place: what is left must be the same for all known places in one slot (i mod 7).
Per repeat instead: subtract 3 times the number of completed passes of the word.
Repeat for every step, length, table and form, and on scrambled copies.
the worksheet: the first steps by hand, on squared paper
4
Worked example, generated
The same steps run by the code on the real letters.
sculpture's table, Vigenere: key value forced at each known place, then minus 3 x place (per-letter step 3), slot = place mod 7
place key value minus 3i slot
22 1 16 0
23 10 22 1
29 23 17 0
30 5 22 1
64 11 4 0
71 8 6 0
places 22 and 29 share slot 0 and must leave the same value
5
Hypothesis, for a cryptanalyst
Family, key space, the constraint under test, and the clues it reads.
C5(a), C20 (hand schedules); TM 32-220 par. 125 (progressive key) and Lewis, German Agent Systems (Kryha stepping, net step 3 per revolution), per research_notes/Scheidt patents and field ciphers/addendum_downloaded_manuals.md. Model: key value at message place i = w[i mod L] + s i (per-letter) or w[i mod L] + s floor(i / L) (per-repeat, 'step per cycle'), w free letters, s 1-25 (the variant form is the added form with -s). Forced key values at the 24 known places; period L consistent for (table, s, form) if each slot holds one value of K - progression. Statistic fixed before the run: per (form, period), K4's count of consistent (table, step) pairs against the ten coppers' range; cells where K4 is above every copper against each copper's count against the rest; smallest consistent period.
6
Prediction
Written before the run; the result decides it.
Short periods die for both forms on every table; at 26 and above some survive on K4 at the coppers' rate; K4 above every copper in no more cells than the null's maximum. Zero candidates.
For each text, table and form: the 24 forced key values.
Compiled: for each step 1-25 and period 1-52, per-letter and per-repeat, test slot consistency; count.
Compare K4 with the coppers cell by cell.
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
1,040,314 tables x 2 forms x 25 steps: shortest live period on K4 per-letter 25, per-repeat 25 (coppers 24, 24); K4 above every copper in 4 of 104 cells, null 0-5; stop False
What was searched, as the harness recorded it.
family
progressive key, per-letter and per-repeat, steps 1-25, periods 1-52, on 0109's dictionary keyword tables plus standard/KRYPTOS