“A Myszkowski transposition keyed by any English word with a repeated letter, with a repeating key before or after”
Every keyed column shuffle so far broke ties in the key word left to right (or dropped repeated letters). Myszkowski's 1902 variant reads columns that share a key letter together, row by row, which gives a different order whenever the word repeats a letter, as ABSCISSA and PALIMPSEST do. Here every dictionary word with a repeated letter is a Myszkowski key, with a repeating key of length 1-26 after or before the move.
In the usual column shuffle you read the columns in the alphabetical order of a secret word's letters. When the word has a letter twice, like the two S's of ABSCISSA, Myszkowski's version reads those columns together, zigzagging across each row. We try every dictionary word with a repeated letter this way, with a short repeating secret word on 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. before or after, 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..
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 shuffle
Myszkowski's column shuffle lets a key word repeat letters: columns under the same letter are read together, row by row. Every dictionary word with a repeated letter is a key here, forwards and as the undoing.
the check
After the shuffle a repeating secret word on the table must give the copper's letters where the known letters landed; two known letters in one slot of the word must agree.
the bound
343,964 routes, keys of 1 to 26 letters before or after: one setting at period 21, as on a copper, and the only count outside the scrambled coppers' range, period 25 after the move (1,499 against 1,540-1,650), is below it.
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.
ABSCISSA gives ranks A1 B2 S5 C3 I4 S5 S5 A1.
Write the 97 letters in rows of 8.
Read rank 1 first: in each row, column 1 then column 8; then rank 2 (column 2) down the rows; and so on, with rank 5 read across columns 3, 6, 7 in each row.
Each known letter lands at a new place; with a key of length p after the move, letters sharing a slot must agree.
Repeat for every word, key length and rule, and with the key before the move.
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.
ABSCISSA as a Myszkowski key: ranks [1, 2, 5, 3, 4, 5, 5, 1] (both A's rank 1, the S's rank 5)
columns of equal rank are read together, row by row
place letter lands at copper there
22 E 69 T
23 A 70 M
24 S 6 O
25 T 7 X
64 B 16 L
5
Hypothesis, for a cryptanalyst
Family, key space, the constraint under test, and the clues it reads.
Type 1, a route family not in any earlier set. ABSCISSA (K2's key) and PALIMPSEST (K1's) both repeat letters (C7(a)); a Myszkowski key reads the columns of equal rank together across each row. Keys: the rank pattern of every dictionary word of 3-30 letters with a repeated letter, deduplicated; rows of the word's length, the last row short; forward and inverse. Key: periodic 1-26 after the move (slot = carved place mod p) or before it, 8 tableau classes, exact by slot agreement. Ten shuffled coppers.
6
Prediction
Written before the run; the result decides it.
Nothing consistent below period 20; counts inside the coppers' range, give or take one period. Zero candidates.
7
Method
Turn every dictionary word with a repeated letter into its Myszkowski rank pattern; drop repeats.
Build the move and its inverse.
Test periods 1-26 in both orders and 8 classes by slot agreement.
Count per period on K4 and ten shuffled coppers.
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
171,995 distinct Myszkowski keys from 234,428 words, 343,964 routes x 8 classes x 2 orders, periods 1-26. K4 live below 20: 0. Outside the control range: {'A': [25], 'B': []}.
What was searched, as the harness recorded it.
family
Myszkowski transposition keyed by every dictionary word with a repeated letter, then or before a periodic tableau key