01 The passage
Britland’s 2013 article printed the ciphered passage from Forster’s papers, with two clear French passages and the date; Tomokiyo transcribed it on his blog on 21 September 2021 and Pitt’s input is token for token the same. The tracker row here had said “134 groups, 24 symbols”; the real counts:
| tokens | words | distinct symbols | numbers | letters | seen once | IC |
|---|---|---|---|---|---|---|
| 207 | 37 | 34 | 0 2 4 5 7 8 12 14 16 19 20 30 40 50 70 80 88 90 | a b c d e f g l n p q s t u x y | 8 | 0.047 |
Commonest: 30 (×24), 2 and 0 (×18 each), 20 (×13), x (×10), c and s (×9). The commas are word or word-pair boundaries, which is what makes 207 tokens tractable at all.
02 The key (Pitt; Lasry and Biermann earlier)
| letters | a d · b t · c l · d i · e g · f b · g y · l r · n f · p a · q c · s o · t n · u m · x s · y p |
|---|---|
| numbers | 0 e · 2 e · 4 a · 5 g · 7 d · 8 t · 12 c · 14 z · 16 i · 19 n · 20 r · 30 u · 40 s · 50 t · 70 f · 80 l · 88 q · 90 p |
No shift, no block, no odd/even row: a mixed alphabet with a second symbol (for t a third) for the frequent letters e a c d f g i l n p r s t, and u single although it is the commonest letter. The family is the Richelieu type of homophonic alphabet, not the regular Stuart type; the unused values presumably cover h k m o x and more homophones in the full key.
il ny a aucun subiet descrupule de manquer a dieu | ie vous en responds et mesmes dans | les reigles de perfection prenez sdulement les uoyes de prudence piur conceruer uotre uie pour en faire a dieu un plus grand sacrifiye par la multiplication des uos seruices pour le salut de uos freres | et mesurer a cela sil est meilleur d’agir, ou de soupir · 13. de may. 1644
There is no ground for scruple about failing God; I answer for it, even within the rules of perfection. Take only the ways of prudence to preserve your life, so as to make God a greater sacrifice of it by multiplying your services for the salvation of your brethren, and measure by that whether it is better to act or to suffer. Four tokens (bold) conflict with the reading — a→d, 16→i, q→c, g→y, each against several agreeing occurrences — and are single slips of the encipherer or of the typeset transcription; four in 207 is Boswell’s rate. Britland’s correspondents read aucune voie de scrupule and preveu seulement where Pitt reads aucun subiet and prenez; the tokens at issue (f, 14) occur once each and cannot be settled from the text.
03 Permutation control
The twenty plaintext-letter identities were permuted over Pitt’s homophone partition 20,000 times and the 207-letter decode scored with a French 5-gram model.
| model | Pitt’s key | null mean / sd / best | z | null at least as good |
|---|---|---|---|---|
| letters only (6.5 M letters) | −450.3 | −1327 / 117 / −960 | 7.5 | 0 / 20,000 |
| letters + word edges, u for v, i for j | −524.9 | −1768 / 142 / −1230 | 8.8 | 0 / 20,000 |
04 Blind recovery, and what the controls say
A homophonic annealer (34 symbols to 26 letters, 150,000 steps, 8–12 restarts), first without and then with the word boundaries, on the target and on six matched controls: held-out French of 207 letters enciphered with a random key of exactly Pitt’s homophone multiplicities, adjacent words merged with probability 0.2 as in the target.
| run | model | controls read (of 6) | target |
|---|---|---|---|
| 1 | 5-gram, letters only, no word edges | 0 (16–49 % right; the solver’s optimum beats the truth on 5 of 6) | gibberish, 31 % of Pitt’s key |
| 2 | 5-gram with spaces, raw corpus | 3 at 99.5–100 %; 3 fall into an all-i attractor from OCR Roman numerals | attractor |
| 3 | same, Roman numerals removed | 5 at 99–100 %, one at 44 % | −591.6 found against −602.4 for Pitt: a wrong key outscores the truth, 14.5 % agreement |
| 4 | same, training text with v→u, j→i | 6 of 6 (98–100 %) | 97.6 % of Pitt’s key blind: 202 of 207 tokens |
Run 1 is the lesson of the Moray letter at this length: 207 letters over 34 symbols with a plain letter-stream model is below the solver’s threshold even on controls, so nothing could have been read into a target failure. Run 3 is the more useful one: the controls pass and the target fails, so the plaintext was out of the model’s distribution. The letter writes uotre, uie, uos, seruices, uoyes, subiet, ie, as every 1644 hand does; a model trained on a nineteenth-century edition with v and j scores that spelling some 200 nats worse than modern French of the same length, and gibberish wins. Normalising the training text fixes it. The blind key differs from Pitt’s at three rare symbols only (g, 14, e), whose values n-grams cannot fix and the words do. The two 134-letter controls that were run under the same model (the tracker’s wrong length) both read at 97–99 %, so the length was never the obstacle.
05 What stays open
- The manuscript: Val-d’Oise 68.H.8, third bundle (the papers of the English Augustinian convent at Pontoise, where a Forster daughter was a nun — an inference from the reference). No image is online; the four slips, the two one-occurrence words, and whether this is a whole letter or an extract, depend on it.
- The recipient, and whether the key recurs in other Forster or Henrietta Maria papers of 1644.
- Reporting: Tomokiyo’s page still says unsolved. Lasry, Biermann and Pitt have priority and Pitt’s repository is the public record.
06 Method and files
- Tokeniser, groups, Pitt’s key and literal decode (
forster/key.py). - Letters-only French 5-gram, permutation test, blind annealer, six matched controls (
ng5fr.py,solve.py,run1.txt). - Word-edge model with u/v, i/j normalisation, same tests (
solve2.py,run2–4.txt); the 134-letter repeat (control134.py,run5_134.txt).
Checked: Pitt’s input against the blog text; the key against 20,000 permutations; blind recovery and six matched controls under four models. Not checked: the manuscript; Britland’s article itself beyond its abstract and the readings quoted by Pitt.
07 Sources
- K. Britland, article of 2013 on Sir Richard Forster’s papers (Val-d’Oise 68.H.8), source of the printed cipher.
- S. Tomokiyo, blog post of 21 September 2021, and Unsolved Historical Ciphers (cryptiana).
- R. Pitt, forster-cipher (GitHub, September 2026; Lasry and Biermann credited in the README).
Analysis scripts and the ciphertext are in the repository (forster/).