CIPHER LAB / A WORKBENCH FOR THE UNKNOWN

Cipher LabFind a method. Follow the evidence.

Explore classical ciphers with the solvers from Undeciphered Texts.

FIG. 01 / THREE LETTERS APART
01KH
02HE
03OL
04OL
05RO
A Caesar shift, made visible.One simple method. Many harder questions.
Runs on this deviceOriginal Python engineCandidates with evidence

01 / TRY A READING

Work the cipher.

Start with an example,
or paste a transcription.

Try an example
Cipher input and search settings

4 to 512 A-Z letters. Spaces and punctuation are ignored. Digits and other alphabets need a different tool.

A frozen synthetic control from the repository. No key or plaintext is supplied to the search.

Start small: all 26 Caesar shifts and six rail-fence heights. A plain, useful baseline.

Add clues (optional)

The fields shown here apply to this solver. Other clues are kept when switching methods.

A crib is a word expected in the plaintext. Enter one offset:word per line. Positions start at zero after removing spaces and punctuation.

A bounded search with explicit checks.

First run loads the local engine. The ciphertext stays on this device. How it runs.

02 / EVIDENCE & CANDIDATES

Ready for input

Load an example or paste text, choose a solver, then run. The engine loads only when needed.

A reading starts with a check.

Candidate plaintexts, forward checks and search limits will appear here. An English-looking answer still needs independent evidence.

Explore the ten solver personas

03 / COMPLEMENTARY METHODS

Different ways into the same question.

Ten research personas.
One standard for correctness.

01 / SEARCH & REVIEW

Normal Human Man

Start small: all 26 Caesar shifts and six rail-fence heights. A plain, useful baseline.

02 / SEARCH & REVIEW

Emperor

A systematic classical investigation with a factual ledger and optional neural advice.

03 / SEARCH & REVIEW

Inheritance

Uses keyword guesses, word list and aligned cribs. It needs caller-supplied clues.

04 / SEARCH & REVIEW

Hallucinogens

Try finite reversals, rotations and affine combinations. Every candidate must reproduce the ciphertext.

05 / SEARCH & REVIEW

Pacifist

Try the finite affine keys and exact crib checks, without persona vocabulary preferences.

06 / SEARCH & REVIEW

Detective

Place an unplaced crib and look for repeated-key evidence. Enter the clue in the unplaced crib field.

07 / SEARCH & REVIEW

Cartographer

Explore bounded rail, route, Redefence and rectangular transposition layouts.

08 / SEARCH & REVIEW

Mechanic

Use aligned cribs for progressive keys, autokey recurrences and Hill constraints.

09 / SEARCH & REVIEW

Adversary

Look for alternative readings consistent with the same supplied evidence.

10 / SEARCH & REVIEW

Skeptic

Review a proposed reading against reserved cribs or a reference hash. A dry voice, exact checks.

04 / KEEP THE EVIDENCE

A candidate is
the beginning.

What can this cipher solver do?

Try bounded Caesar, affine and transposition searches. Supply cribs for repeated-key, autokey and Hill inference. Connect the research personas in a shared council, then inspect their assumptions, checks and candidate witnesses.

What does Bob the Neural Net do?

Bob ranks known cipher families from statistical and cryptanalytic features. A family suggestion helps choose the next method; it does not establish a key or decrypt the text. Its model and benchmark provenance ship with the workbench.

When is a cipher actually solved?

A candidate must account for the ciphertext and survive evidence that was not used to fit it. A high language score, several agreeing personas, or an exact fit to a supplied clue is not independent proof. The engine keeps unresolved historical claims unresolved.

Where is the code?

This workbench runs a pinned snapshot of the open-source Python engine. The repository includes source-backed controls, tests, certificates and a structured case workflow for unsolved ciphers.

Engine and model provenance

The first run downloads Python and NumPy from the pinned Pyodide CDN, then executes the original engine in a worker on this device. Network access is needed for those initial files. Inputs and results are not uploaded to a solver service.

The exact engine snapshot and file hashes are listed in the build manifest.

05 / RESEARCH NOTES

Undeciphered scripts.
Open historical ciphers.

Ledgers reviewed through

The workbench above handles classical A-Z text. It does not decipher unknown glyph scripts. Those cases need a documented sign inventory, preserved uncertainty and linguistic or archaeological evidence beyond an English language score.

These dated notes separate the source record from proposed experiments. Research plans are not executed results. “Open” describes the cited evidence, not a promise that no one has proposed an answer. A solved control checks a method; it does not solve a different historical target. Each case’s dated note records when its primary sources were checked, and its ledger line is synced from the repository’s status ledgers. Its tally counts the hypothesis families or questions listed there, not every possible cipher, and it is not a distance to a reading.

Kryptos K4Historical cipher · Ongoing

Publicly unsolved; plaintext reported in a private archive, no method in the checked sources.

RR Auction’s October 2025 account describes recovered archival text, not a published method; in November 2025 it sold Sanborn’s archive, relying on his description that it holds the private K4 plaintext and coding material. Paradigm identified itself as custodian in June 2026 and offers a reference-answer verifier while still calling K4 unsolved. This project fitted each clue in turn and checked the other against 32,512 two-layer cipher models on two fixed alphabets (65,024 checks in all): all 888 complete keys contradicted the held-back clue, 2,563 stay undetermined, and no planted-text control at these search bounds is recorded.

Ledger, reviewed through . Unsolved. Plaintext recovered: 0 percent. 22 of 33 hypothesis families listed (67 percent) are excluded by a count or excluded by the clues; 4 are open.

  • Excluded by a count 3
  • Excluded by the clues 19
  • Tested without shown power 7
  • Open 4

Next experiment. Rerun the layered search with unknown keyed alphabets in place of the two fixed ones, solved with a constraint solver, with clue positions frozen before fitting and one clue held back. Even then, a failed search speaks only to the fully determined keys of its stated models.

D’Agapeyeff challengeHistorical cipher · Closed

No accepted reading; ruling hypotheses out is not a decipherment.

Wikipedia attributes the challenge to D’Agapeyeff’s Codes and Ciphers (1939); no reading of its 196 digit pairs is accepted. Under any one-to-one letter key and any reordering, the closest of 479,051 overlapping 196-letter stretches of English prose needs 8 chosen errors to match the pairs’ counts, and searches shown to find planted English and Latin texts found nothing. Hendrick’s interpretation, not a result: most likely there is no message, and under a one-to-one key the counts point to Latin.

Ledger, reviewed through . Unsolved. Plaintext recovered: 0 percent. Research closed on 2026-10-18 by the owner's decision; the owner's view is that there is probably no message, which is an interpretation, not a proof. 29 of 35 hypothesis families listed (83 percent) are closed with shown power or excluded by a count; 6 are left open.

  • Closed with shown power 17
  • Excluded by a count 12
  • Open 6

Next experiment. Build a turning-grille search that recovers planted texts with the key unknown, including keys that even out letter counts, then compare the pairs with shuffled copies. If the pairs score like their shuffles, that rules out a grille only under the keys and languages tested.

Voynich manuscriptUnidentified script · Proposed

Meaning unresolved; encipherment itself is uncertain.

Yale identifies an unknown script and cautions that the manuscript may not be encoded. EVA and other transliterations represent visible signs, not established sounds or translations.

Ledger, reviewed through . Undeciphered. Reading recovered: 0 percent. 4 of 5 questions listed (80 percent) are answered with a control or excluded by a count; 1 is open.

  • Answered with a control 3
  • Excluded by a count 1
  • Open 1

Next experiment. Compare the Zandbergen-Landini ZL 3b transliteration with an independently authored second one on shared loci and publish the disagreement table. Then reserve 10 whole folios and test held-out prediction against shuffles that keep word or line lengths.

Linear AUndeciphered writing system · Proposed

Approximate sign readings do not establish the language.

SigLA connects inscriptions with sign occurrences and their material context. By convention, scholars roughly sound out many signs with the values of similar-looking Linear B signs, but the underlying language is unknown, so most words are not understood.

Ledger, reviewed through . Undeciphered. Reading recovered: 0 percent. 0 of 3 questions listed (0 percent) are answered with a control; 3 are open.

  • Open 3

Next experiment. Preserve sign numbers, uncertain readings and document types. Reserve one find-place before choosing features and test whether repeated sign sequences recur there, rather than selecting a proposed language from a few attractive matches.

Indus signsUnresolved sign system · Proposed

Statistical structure is evidence about sequences, not a translation.

Yadav and colleagues’ 2010 n-gram study notes a limited corpus, no bilingual texts and an uncertain underlying language. Its predictive experiments concern sign sequences; they do not provide a decipherment.

Ledger, reviewed through . Undeciphered. Reading recovered: 0 percent. 0 of 3 questions listed (0 percent) are answered with a control; 3 are open.

  • Open 3

Next experiment. Record each artifact’s identifier, orientation and whether the image is a seal face or an impression. Group duplicates and related artifacts, hold back 20 percent of the groups, and compare n-gram prediction of masked signs in those groups with unigram and position baselines.

RongorongoUndeciphered script · Proposed

A material date does not determine an inscription’s reading or date.

The 2024 radiocarbon study dates wood from four tablets and reports one notably older specimen, but allows that old wood may have been carved later. Of two British Museum records checked here, one is an original tablet and one a plaster cast; counting casts or photographs as separate texts would inflate the corpus.

Ledger, reviewed through . Undeciphered. Reading recovered: 0 percent. 0 of 3 questions listed (0 percent) are answered with a control; 3 are open.

  • Open 3

Next experiment. Build an object ledger separating originals, casts and copies. Keeping line orientation, test whether passages repeated on the other tablets recur on one held-out original, against line-length-preserving shuffles.

Phaistos discUndeciphered inscription · Proposed

The museum reports no definitive interpretation.

Heraklion’s object description records 241 stamped signs in 61 groups across two sides. Proposed word boundaries and a hymn interpretation remain interpretations, not recovered plaintext.

Ledger, reviewed through . Undeciphered. Reading recovered: 0 percent. 0 of 2 questions listed (0 percent) are answered with a control; 2 are open.

  • Open 2

Next experiment. Compare independent sign annotations while preserving side, group and reading direction. Freeze up to 12 annotation and grouping variants before any language scoring, then report how much repeated-group statistics depend on each disputed sign or boundary.

Zodiac Z13 and Z32Short historical ciphers · Proposed

Open in the cited authors’ account; Z340 is a solved control.

Z340’s solvers describe its verified solution and the remaining short ciphers. They explain that, under simple substitution assumptions, many compatible readings fit the Z13 and Z32 symbols, so the symbols alone do not single out one reading. This project has not yet run any test on these ciphers.

Ledger, reviewed through . Unsolved. Plaintext recovered: 0 percent. 0 of 3 hypothesis families listed (0 percent) are closed with shown power; 3 are open.

  • Open 3

Next experiment. Reproduce the published Z340 transform as a separate control. For Z13 and Z32, count fitting readings from a fixed, hashed word list within 10,000 checks, publish several, and treat none as established without outside confirmation or an independently supported method linking the symbols to it.

Dorabella cipherHistorical cipher · Ongoing

The cited study and this project’s searches establish no systematic reading.

Hauer and colleagues test language, substitution and music hypotheses on an 87-character transcription with ambiguous symbol orientations. On their transcription, this project’s one-to-one and many-to-one English substitution searches each gave three conflicting outputs. Because the same methods recovered only 80 and 34 letters, respectively, of a known 87-letter test sentence, those outputs rule out neither model.

Ledger, reviewed through . Unsolved. Plaintext recovered: 0 percent. 0 of 5 hypothesis families listed (0 percent) are closed with shown power; 3 are open.

  • Tested without shown power 2
  • Open 3

Next experiment. Have two people mark symbol orientations independently and freeze at most four transcriptions in all. Then measure full recovery on 100 new 87-character test messages before searching the note again.

Source extraction limits, corpus access and reproducible bounds are recorded in the notes. No new historical decipherment is claimed; no case here is solved, and nothing on this page is a reading. Read the research register and experiment standards.