Unsolved Catalogue · no. 2258 · class A · priority 7.4 · open

Clas Rålamb's despatches from Constantinople, 1657: number cipher, some letters glossed, others bare

The Swedish embassy to Mehmed IV in 1657-58, sent to bind Transylvania into Charles X's Polish war; its ciphered reports and their decipherments give a dated 1650s Swedish chancery code.

Date
1657
Correspondents
Clas Rålamb and Gotthard Vellingk (envoys extraordinary) -> Charles X Gustav
Place
Constantinople
Language
Swedish (number code, groups 1-110 and a few in the 800s)
Held at
Riksarkivet, Diplomatica Turcica, SE/RA/2119/2119.1/I/2/2 (E.o. ablegaterna Clas Rålamb och Gotthard Vellingk, 1657) · 132 images (series 40008933). Cipher at image 23 (two pages of number runs with Swedish between the lines) and image 88 (letter of 12 June 1657 signed Clas Rålamb).
Images
NAD record · IIIF manifest · image 23 · image 88

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/2258.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. 2258 of the cyphersolver project
This page: https://cyphersolver.com/solve/2258.html

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

THE CIPHER
  Title:          Clas Rålamb's despatches from Constantinople, 1657: number cipher, some letters glossed, others bare
  Date:           1657
  Correspondents: Clas Rålamb and Gotthard Vellingk (envoys extraordinary) -> Charles X Gustav
  Place:          Constantinople
  Language:       Swedish (number code, groups 1-110 and a few in the 800s) (expected)
  Held at:        Riksarkivet, Diplomatica Turcica, SE/RA/2119/2119.1/I/2/2 (E.o. ablegaterna Clas Rålamb och Gotthard Vellingk, 1657); 132 images (series 40008933). Cipher at image 23 (two pages of number runs with Swedish between the lines) and image 88 (letter of 12 June 1657 signed Clas Rålamb).
  Images/records:
    - NAD record: https://sok.riksarkivet.se/arkiv/eWy9xynckH1kcXy2OkH6B5
    - IIIF manifest: https://lbiiif.riksarkivet.se/arkis!40008933/manifest
    - image 23: https://sok.riksarkivet.se/bildvisning/40008933_00023
    - image 88: https://sok.riksarkivet.se/bildvisning/40008933_00088

WHAT IS KNOWN
  Status: Catalogue: the volume title only. Vetting 5 Nov 2026: bare number runs with no decipherment on images 104 and 114; other letters (18, 22-23, 74, 77, 87-88) carry a decipherment written over the numbers, so the code can be rebuilt from those pairs and applied to the bare passages.
  Outcome so far: not yet attempted by the project
  Prior-art check: open as far as checked (5 Nov 2026): known.py finds nothing on the shelfmark or the correspondents; web search found no decipherment or edition of these letters; DECODE, Tomokiyo and Lasry not searched
  Check first: Page the volume for every cipher passage; rebuild the code from the interlinear pairs; compare with the Rákóczi cipher of 2119.5/4 (lead 2243) and Cantersten 1648.
  Class A: a sibling letter with a decipherment is in the same volume or series, so matching it is the first move.
  Project notes (read these before anything else; they record what was tried and ruled out): https://github.com/dbourdeau/cyphersolver/blob/main/targets/gramont1529/NOTES.md

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); targets/gramont1529/NOTES.md (everything
   already tried on this cipher, with the files it used); and lang/README.md (shared language models).
   Put all your work in targets/gramont1529/: transcription, key, decipherment, scripts. Add your findings to its NOTES.md
   under a dated heading, without rewriting what is there. 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 (number code, groups 1-110 and a few in the 800s)). 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/gramont1529/ 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+2258&target=catalogue+2258
(other kinds of contribution: https://github.com/dbourdeau/cyphersolver/issues/new/choose). Include:
  - Target: catalogue 2258
  - 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. Small-number code, dot-separated, in Swedish despatches. Image 114: about ten runs of 5-15 groups each (e.g. 71.6.80.8.16.70.84.34.37.17.32.36; 12.8.64.34.6; 4.40.10.41.34.37.74.34.102) with no interlinear writing, no gloss in the margin and no decipherment on the facing page, zoomed at 2400 px; image 104 shows the same bare runs at 760 px. Other letters carry a decipherment written over the numbers (22, 23, 74, 77, 87, 88; image 18 in faint lighter ink): those passages are cribs, not open text. (Riksarkivet image series 40008933 (Diplomatica Turcica SE/RA/2119/2119.1/I/2/2, NAD https://sok.riksarkivet.se/arkiv/eWy9xynckH1kcXy2OkH6B5), contact sheets of 42 + 24 images and images 18, 22, 23, 24, 34, 68, 74, 77, 87, 88, 104, 114, 120, 126 at 760-900 px, 114 and 18 zoomed at 2400 px; Referer route, 5 Nov 2026; checked 2026-11-05 by Claude Opus 5.5, Riksarkivet Turcica vetting pass) open that page

What is known

Status and prior art. Catalogue: the volume title only. Vetting 5 Nov 2026: bare number runs with no decipherment on images 104 and 114; other letters (18, 22-23, 74, 77, 87-88) carry a decipherment written over the numbers, so the code can be rebuilt from those pairs and applied to the bare passages.

Outcome so far. Not yet attempted by the project. Prior-art check: open as far as checked (5 Nov 2026): known.py finds nothing on the shelfmark or the correspondents; web search found no decipherment or edition of these letters; DECODE, Tomokiyo and Lasry not searched.

Check first. Page the volume for every cipher passage; rebuild the code from the interlinear pairs; compare with the Rákóczi cipher of 2119.5/4 (lead 2243) and Cantersten 1648.

Scores

Importance
3 of 5
Solvability
5 of 5
Difficulty
2 of 5
Class A
a sibling letter with a decipherment is in the same volume or series, so matching it is the first move
Note
Scored from sampled images (24 per volume, suspects at 900 px) viewed during the Riksarkivet Turcica sweep, 5 Nov 2026 (research/sweep_2026-11_riksarkivet_turcica/)

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