Experiment 195
F5.2. 0107 closed three-term Gromark on a free alphabet in base 10 (lags up to 6); two-term free-alphabet rules were closed to lag 6 in base 10 and lag 5 in other bases (0069, 0076). Here, with 0107's decider compiled: three-term rules d[i] = d[i-a] + d[i-b] + d[i-c] mod B, 1 <= a < b < c <= 6, every primer, in bases 2-9 and 11-16 (base 26 to c = 5; c = 6 there is 3 billion primers, blocked by cost); two-term rules with b = 7, 8 in base 10 and b = 6 in bases 2-9, 11-16. Four forms (M[P+d]=c, M[P-d]=c, M[C-d]=p, M[C+d]=p), M a free alphabet; same known letters fix digit differences, then the partial one-to-one check. K4 against 10 shuffled copies; plants.
What the method does with the 24 known letters.
A GromarkGromark A cipher whose secret is a short number that grows into a long stream of digits by adding pairs of earlier digits; each message letter is pushed along the alphabet by the next digit. key is a run of digits that grows by addingVigenere The three rules of arithmetic a table can use: add the key letter to the message letter, subtract the message letter from the key letter, or subtract the key letter from the message letter. earlier digits together. Scheidt mentioned other number bases. We try the three-term and longer two-term rules in every base from 2 to 16 and 26, every starting digits, with any mixed alphabet, and see whether any fits 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..
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.
A Gromark key grows its digits by adding earlier ones; Scheidt spoke of other number bases. Base 10 with three terms was closed (0107); here every other base.
Every rule, every starting run of digits, four ways of applying the digit to the letter, with any mixed alphabet: where the known message repeats a letter, the digits must line up exactly, then all 24 letters must match one to one.
Nothing fits K4 or a scrambled copy in 1.5 billion starting runs; planted texts are found. F5.2 closed.
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.
base 16, each digit the sum of the digits 1, 3 and 6 places back, primer 1 2 3 4 5 6:
1 2 3 4 5 6 11 2 11 10 1 2 7 10 7 8 3 12 11 8 11 14 9 0 9 10 5 12 15 4 9 2 11 0
places 26 and 27 (N, O over Q, Q), form M[P+d]=c: need d26 - d27 = 1; here 10 - 5 = 5
Family, key space, the constraint under test, and the clues it reads.
C22(a) (YAR as a Gromark primer), C4(b) ('base 16', non-standard bases; Scheidt), F5. Model as 0107 with base B and the rule's lags. Exhaustive over primers. Statistic: consistent (rule, primer, form) settings, K4 against copies.
Written before the run; the result decides it.
No setting consistent on K4 or the copies, as in 0107; plants found. Zero candidates.
The harness's record: candidates, gates, loss, and the negative result this experiment leaves behind.
1,546,784,471 primers x 4 forms; consistent K4 0 (copies 0-0); plants [1, 1]
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.