“F2.3: a 26-letter phrase with repeated letters as the plain strip, so a letter may be enciphered from any of its places (homophones that keep the length), repeating key 1-26: exact”
F2.3. Not a documented method: the reverse use of EMC par. 45b derived in research_notes/Scheidt patents and field ciphers/addendum_downloaded_manuals.md (issue #9), and stated as such. The plain strip is a 26-letter phrase with its repeats (NOWISTHETIMEFORALLGOODMENT...); a letter that occurs twice may be taken from either place; the cipher strip is the standard or KRYPTOS order, slid by a repeating key. Phrases: every 26-letter window of the K1, K2 and K3 plaintexts, the Morse texts, Carter's 1923 book (K3's source) and famous sentences, kept if they hold the 13 letters of the known words. At each known place the allowed key values form a set; sets intersect per key slot. Lengths 1-26, slide either way; K4 against 20 shuffled copies.
Write a phrase such as NOW IS THE TIME FOR ALL GOOD MEN on a strip instead of the alphabet. Letters that appear twice give the encipherer a choice, so the same plain letter can turn into different code letters, yet the messagethe message The 97 letters of English that Jim Sanborn wrote and enciphered. stays the same length. Slide the strip against an alphabet by a repeating secret wordthe secret word The word or string a cipher needs besides the method.. For each phrase from the sculpture's own texts, 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. say which secret words remain possible.
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
Write a phrase such as NOW IS THE TIME FOR ALL GOOD MEN on the plain strip: a letter found twice may be taken from either place, so one plain letter has several code letters and the message keeps its length. That would flatten K4's letter counts.
the check
Every 26-letter window of the sculpture's texts and of Carter's book that holds the 13 letters of the known words, against the standard or KRYPTOS strip, either way, with a repeating key of 1-26: the known letters allow a set of key values at each place; the sets must meet in every slot.
the bound
No phrase fits K4 at any key length up to 25; at 26, with a single check, K4 fits as copies do. F2.3 closed for these phrases; any phrase at all would be a free alphabet, which the known letters cannot decide.
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.
Write the phrase on the plain strip; E stands at, say, places 3 and 9 of it.
The known E at place 22 is carved F: F sits at place 5 of the standard cipher strip.
So the key there is 5 - 3 = 2 or 5 - 9 = 22: either is allowed.
For a key of length 7, place 29 shares that slot: its allowed values must include 2 or 22.
A slot with no common value kills the length. Repeat for every phrase and length, and on 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.
phrase strip NOWISTHETIMEFORALLGOODMENT (lacks C, K: such a phrase is dropped)
place 22: E at strip places [7, 11, 23], carved F at 5: allowed keys [8, 20, 24]
place 23: A at strip places [15], carved L at 11: allowed keys [22]
place 24: S at strip places [4], carved R at 17: allowed keys [13]
place 25: T at strip places [5, 8, 25], carved V at 21: allowed keys [13, 16, 22]
place 26: N at strip places [0, 24], carved Q at 16: allowed keys [16, 18]
place 27: O at strip places [1, 13, 19, 20], carved Q at 16: allowed keys [3, 15, 22, 23]
place 28: R at strip places [14], carved P at 15: allowed keys [1]
place 29: T at strip places [5, 8, 25], carved R at 17: allowed keys [9, 12, 18]
5
Hypothesis, for a cryptanalyst
Family, key space, the constraint under test, and the clues it reads.
Scheidt: 'I masked the English language' (C2): homophones flatten letter counts without lengthening the text (K4's flat counts, 0056). EMC par. 45b (keyword phrases with repeated letters for components), reversed here as a derivation (addendum, candidate 3). Model: c_i = C[(j + k_{i mod L}) mod 26] or C[(k - j) mod 26] with phrase[j] = p_i, the choice of j free. Exact: allowed k per known place = {C^-1(c) -+ j : phrase[j] = p}, intersected per slot. Statistic: live (phrase, strip, form, L) cells with at least one check, K4 against copies.
6
Prediction
Written before the run; the result decides it.
Live cells with checks at the shuffled copies' rate; homophones loosen each check, so short lengths may survive on copies as on K4. Zero candidates.
7
Method
Phrases: 26-letter windows of K1-K3, the Morse, Carter's book, famous sentences; keep those with E A S T N O R H B L I C K.
For each text, phrase, cipher strip (standard, KRYPTOS) and form (j + k, k - j): allowed key values per known place.
For lengths 1-26: intersect per slot; live if no slot is empty.
K4 against 20 shuffled copies; a planted text as a builder check.
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
1196 phrases; live cells K4 617 (copies 0-737); lengths where K4 is above every copy: []; plant live True
What was searched, as the harness recorded it.
family
repeated-letter phrase as plain strip (homophones keeping the length), cipher strip std/KRYPTOS, slide j+k or k-j, repeating key 1-26, exact; a derivation from EMC 45b, not a documented method