Experiment 177
F3.4. 0173 decided the patent's text/key relation with one table between two keys. Here N = 2, as the patent writes it: v = d + P2[b + P1[u + a]] mod 26, three repeating keys a, b, d of length 1-10 each, P1 and P2 each the KRYPTOS order or its inverse (a standard table collapses to 0173's form), the message letter numbered by the standard, KRYPTOS or inverse order with either sign (u), and the carved letter read the same way (v): 144 classes. Each known place ties one slot of each key; any two fix the third, so a compiled search with propagation decides every cell exactly.
What the method does with the 24 known letters.
Scheidt's patent can stack the shift-and-look-up step: shift, mixed alphabet, shift, mixed alphabet, shift. With three short secret words as the three shifts, each known letter ties a letter of each word together, and any two decide the third. A computer search tries every short length for the three words and every way of choosing the two mixed alphabets, on K4the carved letters The 97 letters cut into the copper at the CIA, shown at the top of every experiment page. and on scrambled copies.
Words in the margin are defined on the glossary page.
The carved letters go in at the top; the reading comes out at the bottom.
Scheidt's patent can stack its step: shift, mixed alphabet, shift, mixed alphabet, shift. Three short secret words would give the three shifts; Sanborn spoke of 'triple matrixes'.
Each known letter ties one letter of each word; any two decide the third. A compiled search with that rule decides every choice of the two mixed alphabets and every length triple up to 10 exactly.
Where the known letters give 4 or more checks, nothing fits K4 or a scrambled copy. With fewer checks K4 fits as often as the copies. F3.4 closed; the few-check cells are too weak to decide.
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.
Redo the method on a few letters with pencil and paper.
The same steps run by the code on the real letters.
key lengths 5, 6, 7: the three slots each known place ties together
place 22: E -> F: first key slot 1, second 3, third 0
place 23: A -> L: first key slot 2, second 4, third 1
place 24: S -> R: first key slot 3, second 5, third 2
place 25: T -> V: first key slot 4, second 0, third 3
place 26: N -> Q: first key slot 0, second 1, third 4
place 27: O -> Q: first key slot 1, second 2, third 5
place 28: R -> P: first key slot 2, second 3, third 6
place 29: T -> R: first key slot 3, second 4, third 0
place 30: H -> N: first key slot 4, second 5, third 1
place 31: E -> G: first key slot 0, second 0, third 2
place 32: A -> K: first key slot 1, second 1, third 3
place 33: S -> S: first key slot 2, second 2, third 4
place 34: T -> S: first key slot 3, second 3, third 5
place 64: B -> N: first key slot 3, second 3, third 0
place 65: E -> Y: first key slot 4, second 4, third 1
place 66: R -> P: first key slot 0, second 5, third 2
place 67: L -> V: first key slot 1, second 0, third 3
place 68: I -> T: first key slot 2, second 1, third 4
place 69: N -> T: first key slot 3, second 2, third 5
place 70: C -> M: first key slot 4, second 3, third 6
place 71: L -> Z: first key slot 0, second 4, third 0
place 72: O -> F: first key slot 1, second 5, third 1
place 73: C -> P: first key slot 2, second 0, third 2
place 74: K -> K: first key slot 3, second 1, third 3
slots used: 18; checks: 6
Family, key space, the constraint under test, and the clues it reads.
US 6,075,865 (Scheidt and Wack): O = a_N + pi_N[a_N-1 + ... + pi_1[I + a_0]] mod W; Sanborn's 'triple matrixes' (reports/Scheidt patents and field ciphers.md, issue #9); C5(b), C6. Model as in 'changed'. A cell (class, La, Lb, Ld) is live if some a, b, d satisfy all 24 known places; checks: 24 minus the key slots the known places use. Statistic: live cells by checks, K4 against 20 shuffled coppers; plants as a builder check.
Written before the run; the result decides it.
No cell with 4 or more checks is live on K4; K4's live cells at each number of checks fall inside the coppers' range. Zero candidates.
The harness's record: candidates, gates, loss, and the negative result this experiment leaves behind.
live cells with >=4 checks: K4 0 (coppers 0-0); >=1: K4 124 (coppers 98-130); undecided K4 0; plants live 3/3
What was searched, as the harness recorded it.
How this experiment sits among the others is on the lineage page; its family's open hypotheses are on the families page.