Unsolved Catalogue · no. 2317 · class B · priority 7.4 · open

Envoy Carl Bonde (and Lillieroot) at Paris: Swedish and French despatches in a 2-3 digit code, partly glossed, with whole pages bare

Sweden's envoy at Louis XIV's court during the Scanian War (1675-79), when France was Sweden's only ally: a dated 1670s Swedish code with its decipherment.

Date
1674-1678
Correspondents
Carl Bonde (Swedish envoy in France), some letters co-signed by Nils Lillieroot; secretary Sylvester Phrygius -> Charles XI
Place
Paris
Language
Swedish (2-3 digit code groups 10-997 mixed with clear words)
Held at
Riksarkivet, Diplomatica Gallica, SE/RA/2105/I/A/24/54 (Envoyén Carl Bonde, Brev till Kungl. Maj:t, 1674-1678) · 557 images (series R0003797). Bare: 107 (inserted sheet f. 101, two pages), 109, 112 left, 324-326 (French letter), 327-330 (Swedish letter with Lillieroot). Glossed: 76 margin, 102-106, 110-111, 112 right, 113, 335, 446 (f. 431), 520. About 110 images seen (checked 6 Nov 2026, batch n09).
Images
NAD record · IIIF manifest · image 113 · image 335 · image 446 · image 520

Hand this page to your AI agent

Give your agent (Claude, ChatGPT or any assistant that can open web pages) this address and ask it to do the task on the page:

https://cyphersolver.com/solve/2317.html

Or copy the block below into the chat. It is the whole task: what the cipher is, where the images are, what has been tried, the steps, and how to report back.

TASK: help read Unsolved Catalogue no. 2317 of the cyphersolver project
This page: https://cyphersolver.com/solve/2317.html

You are helping a public research project read historical cipher letters that nobody has read yet.

THE CIPHER
  Title:          Envoy Carl Bonde (and Lillieroot) at Paris: Swedish and French despatches in a 2-3 digit code, partly glossed, with whole pages bare
  Date:           1674-1678
  Correspondents: Carl Bonde (Swedish envoy in France), some letters co-signed by Nils Lillieroot; secretary Sylvester Phrygius -> Charles XI
  Place:          Paris
  Language:       Swedish (2-3 digit code groups 10-997 mixed with clear words) (expected)
  Held at:        Riksarkivet, Diplomatica Gallica, SE/RA/2105/I/A/24/54 (Envoyén Carl Bonde, Brev till Kungl. Maj:t, 1674-1678); 557 images (series R0003797). Bare: 107 (inserted sheet f. 101, two pages), 109, 112 left, 324-326 (French letter), 327-330 (Swedish letter with Lillieroot). Glossed: 76 margin, 102-106, 110-111, 112 right, 113, 335, 446 (f. 431), 520. About 110 images seen (checked 6 Nov 2026, batch n09).
  Images/records:
    - NAD record: https://sok.riksarkivet.se/arkiv/hEtOUgZrzo78ePt4qXFrp5
    - IIIF manifest: https://lbiiif.riksarkivet.se/arkis!R0003797/manifest
    - image 113: https://sok.riksarkivet.se/bildvisning/R0003797_00113
    - image 335: https://sok.riksarkivet.se/bildvisning/R0003797_00335
    - image 446: https://sok.riksarkivet.se/bildvisning/R0003797_00446
    - image 520: https://sok.riksarkivet.se/bildvisning/R0003797_00520

WHAT IS KNOWN
  Status: Catalogue: volume title only. Glossed: Swedish decipherment written above every coded run on all four pages zoomed (2400 px).
  Outcome so far: not yet attempted by the project
  Prior-art check: open as far as checked (6 Nov 2026): known.py finds nothing on the shelfmark or the correspondents; DECODE, Tomokiyo, Lasry and the editions not searched for these letters
  Check first: Rebuild the code from the glossed pairs; page the volume for unglossed passages; compare with other 1670s Swedish codes.
  Class B: part of a key or a known cipher family of the same office is in print or on DECODE.

STEPS
0. Set up. If you can run a shell, fork and clone the repository and work inside it:
     git clone https://github.com/dbourdeau/cyphersolver.git
   Then read, in this order: CONTRIBUTING.md (how a contribution is sent and credited); README.md, sections
   "Repository layout" and "Conventions" (how readings are measured and named); and
   lang/README.md (shared language models).
   Put all your work in targets/<writer><year>/ (a new folder, e.g. sega1593): transcription, key, decipherment, scripts. Write a NOTES.md that says
   what the document is, the system, the key, the reading, and what is open and why. Keep WORKLOG.md there too:
   one dated line per step (transcription, hypothesis, solver run, crib, key found, control), failures included.
   Do not edit docs/ (the site is generated and rebuilt on merge) and do not commit large images: link them.
   If you cannot run a shell, do the same work in files you keep and send them with the issue below.
1. Make sure it is still unread. Search the web and the literature for the shelfmark, the correspondents and the date:
   printed editions and calendars of the correspondence, Satoshi Tomokiyo's cryptiana pages
   (https://cryptiana.web.fc2.com/), the DECODE record and the files attached to it, and the project notes above.
   If a decipherment already exists, stop and report where it is. That is a useful result.
2. Get the images. For Gallica items, a page image is
   https://gallica.bnf.fr/iiif/ark:/12148/<ark>/f<page>/full/full/0/native.jpg (page numbers from the manifest).
   DECODE records (de-crypt.org) need a free account: if you cannot log in, ask your human to download the images for you.
3. Look for key material before attacking the ciphertext, in this order: a decipherment written between the lines or
   in the margin; a clear copy or a deciphered sibling letter in the same volume or DECODE series; a key sheet from the
   same office and years (DECODE key records, Tomokiyo's articles, printed editions); clear passages in the letter
   itself that can serve as a crib.
4. Transcribe exactly what is on the page: one token per sign or number group, line by line, with folio and line
   numbers, unclear signs marked with ?. Keep the transcription as a file. It is worth sending even if nothing else works.
5. If no key exists, identify the system (count the distinct symbols, tokens and repeats: simple or homophonic
   substitution, nomenclator with code words, syllabary, two-digit figures) and recover the key from the ciphertext
   with a solver scored on a language model of the period (Swedish (2-3 digit code groups 10-997 mixed with clear words)). In the clone, use the shared models in lang/
   (from lang import lm; lm.load('<model>'), lm.best_language(text)) rather than building your own; add a corpus there
   if none fits. Before trusting a result, run the same solver on a control text you encipher yourself in the same
   system and at the same length. If it cannot solve the control, its output on the real letter means nothing.
6. Measure the result against the project's bar (README.md, Conventions). A text is "complete" only when (1) at least
   95% of its cipher tokens give sense, counted from a reading file, not estimated; (2) no gap is left untried;
   (3) every letter in the item is covered; (4) what stays open is scattered code groups or names, or pieces blocked
   from outside (no key material, too short, illegible, needs the archive). Otherwise it is "partial": say which
   pieces are open and why. Mark every uncertain word with [?] and leave unread groups as their numbers or signs.
   Never fill gaps with plausible guesses. A failed attempt that records what was ruled out is still a contribution.
7. Name how the text was obtained with one of the project's methods (do not write just "solved" or "read"):
     - ciphertext-only break: The key was rebuilt from the ciphertext alone: frequencies, solvers, pattern words, the order of the key. No plaintext and no existing key was used. If someone had solved the same text earlier and it was found only afterwards, the write-up says so: an independent re-solution.
     - key from external plaintext: The key was rebuilt by matching the ciphertext against a plaintext found elsewhere: a printed edition, a calendar of state papers, a copy of the same letter in another archive.
     - key from adjacent plaintext: The key was rebuilt from plaintext next to the ciphertext: a partial decipherment written between the lines or in the margin, clear passages in the same letter, a deciphered copy in the same file.
     - external key matched: An existing key that had not been connected with this document (a key for another correspondent or series, a key sheet filed elsewhere) was found to fit, and applied.
     - known key applied: The key was already identified for this document or its correspondence (on its archive or DECODE record, published for it, filed with it) and was applied. The work is transcription and decipherment, which is not mechanical when the key is polyphonic or variable-length.
     - existing decipherment: A complete decipherment already existed (between the lines, on a separate copy, or in print). The work was transcribing the cipher and checking the decipherment against it.
     - not solved: Attempted; neither the key nor the text was obtained. What was learned is recorded. A target whose key was obtained but whose text does not read keeps the method that obtained the key, with extent "none (text not read)".
     - not applicable: Not a cipher (clear text, shorthand, a key sheet, instructions), or the item could not be reached.

REPORT BACK
With a clone: open a pull request with your targets/<writer><year>/ folder. Say in the description how you want to be
  credited (name, initials or handle, and a link) and include the same points as the issue below.
Without one: open an issue: https://github.com/dbourdeau/cyphersolver/issues/new?template=solution.yml&title=Solution%3A+catalogue+2317&target=catalogue+2317
(other kinds of contribution: https://github.com/dbourdeau/cyphersolver/issues/new/choose). Include:
  - Target: catalogue 2317
  - the documents and the images you worked from;
  - the key: sign-to-value table, code groups with values, nulls;
  - the decipherment line by line against the ciphertext, with uncertain passages marked;
  - the method (step 7), the share of tokens that give sense, complete or partial (step 6), and whether the
    reading was already published anywhere;
  - your step log (WORKLOG.md), and the tools and the AI model you used.
If you cannot open issues or pull requests, write this report for your human to send. Credit goes to the person who sends it.

Where the cipher is

Cipher located and confirmed. Swedish (and French) despatches with dotted 2-3 digit code groups (10-997) between clear words or in whole pages. On 107, 109, 112 left, 324 and 328 nothing is written above or below the numbers at 2600 px (some rows on 112 left are underlined only). On 112 right a later pencil hand has written single letters under the code lines ('P a r i s d e n ... n o v e m b r i s ... e f t e r ... a m b a s ...'), on top of the contemporary gloss. (Riksarkivet IIIF series R0003797 (Diplomatica Gallica SE/RA/2105/I/A/24/54), Referer route, 6 Nov 2026: contact sheets of images 100-123, 324-347, 436-459, 508-531 at 450 px; 76, 113, 335, 446, 520, 112 at 1500-2400 px; crops of 107, 109, 112, 324, 328 at 2600 px; checked 2026-11-06 by claude leads review batch n09)

What is known

Status and prior art. Catalogue: volume title only. Glossed: Swedish decipherment written above every coded run on all four pages zoomed (2400 px).

Outcome so far. Not yet attempted by the project. Prior-art check: open as far as checked (6 Nov 2026): known.py finds nothing on the shelfmark or the correspondents; DECODE, Tomokiyo, Lasry and the editions not searched for these letters.

Check first. Rebuild the code from the glossed pairs; page the volume for unglossed passages; compare with other 1670s Swedish codes.

Scores

Importance
3 of 5
Solvability
5 of 5
Difficulty
2 of 5
Class B
part of a key or a known cipher family of the same office is in print or on DECODE
Note
Scored from sampled images (15 per volume at 600 px, suspects at 900-1200 px, cipher pages cropped at 2400-3200 px to look for faint interlinear decipherments) viewed during the Riksarkivet western sweep, 6 Nov 2026 (research/sweep_2026-11_riksarkivet_west/)

Send a result

A reading, a partial reading, a transcription, or a source that shows it was read long ago: all of it counts and is credited to you on the site.

Open a solution issueOther kinds of reportHow credit works← All unsolved ciphers