01 / SEARCH & REVIEW
Normal Human Man
Start small: all 26 Caesar shifts and six rail-fence heights. A plain, useful baseline.

CIPHER LAB / A WORKBENCH FOR THE UNKNOWN
Explore classical ciphers with the solvers from Undeciphered Texts.
01 / TRY A READING
Start with an example,
or bring your own transcription.
02 / EVIDENCE & CANDIDATES
Ready for inputLoad an example or paste your text, choose a solver, then run. The engine loads only when you need it.
Candidate plaintexts, forward checks and search limits will appear here. An English-looking answer still needs independent evidence.
03 / COMPLEMENTARY METHODS
Ten research personas.
One standard for correctness.
01 / SEARCH & REVIEW
Start small: all 26 Caesar shifts and six rail-fence heights. A plain, useful baseline.
02 / SEARCH & REVIEW
A systematic classical investigation with a factual ledger and optional neural advice.
03 / SEARCH & REVIEW
Use your keyword guesses, word list and aligned cribs. It needs caller-supplied clues.
04 / SEARCH & REVIEW
Try finite reversals, rotations and affine combinations. Every candidate must reproduce the ciphertext.
05 / SEARCH & REVIEW
Try the finite affine keys and exact crib checks, without persona vocabulary preferences.
06 / SEARCH & REVIEW
Place an unplaced crib and look for repeated-key evidence. Enter the clue in the unplaced crib field.
07 / SEARCH & REVIEW
Explore bounded rail, route, Redefence and rectangular transposition layouts.
08 / SEARCH & REVIEW
Use aligned cribs for progressive keys, autokey recurrences and Hill constraints.
09 / SEARCH & REVIEW
Look for alternative readings consistent with the same supplied evidence.
10 / SEARCH & REVIEW
Review a proposed reading against reserved cribs or a reference hash. A dry voice, exact checks.
04 / KEEP THE EVIDENCE
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.
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.
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 your own clue is not independent proof. The engine keeps unresolved historical claims unresolved.
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.
The first run downloads Python and NumPy from the pinned Pyodide CDN, then executes the original engine in a worker on your 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
Primary sources checked
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.
Archival text recovery and the 2025 sale are documented. Paradigm identified itself as custodian in June 2026 and offers a reference-answer verifier while still calling K4 unsolved. The checked sources do not publish a reproducible full method. RR Auction listed private K4 plaintext and coding material, attributed to Sanborn without examining the contents independently.
Next experiment. Reserve one published clue while fitting another, then test every predicted letter and the complete forward transform. A failed bounded search rules out only its stated models.
Dated research note and evidence limitsYale 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.
Next experiment. Compare two versioned transliterations against the same Yale folios. Hold out entire folios and test whether measured patterns survive alternative sign and space readings.
Dated research note and evidence limitsSigLA connects inscriptions with sign occurrences and their material context. Some conventional readings borrow comparable Linear B sign values; that does not translate the underlying Linear A language.
Next experiment. Preserve sign numbers, uncertain readings and document types. Test repeated sequences on held-out sites rather than selecting a proposed language from a few attractive matches.
Dated research note and evidence limitsThe authored n-gram study identifies limited texts, no bilingual anchor and an unknown underlying language. Its predictive experiments concern sign sequences; they do not provide a decipherment.
Next experiment. Keep artifact identifiers and seal-versus-impression orientation. Evaluate masked signs on held-out artifacts against simple frequency baselines, excluding duplicate impressions across splits.
Dated research note and evidence limitsThe 2024 radiocarbon study reports older wood for one tablet but explicitly discusses reused wood and potentially later engraving. Museum records also distinguish original tablets from modern casts.
Next experiment. Build an object ledger separating originals, casts and copies. Preserve alternating line orientation, then test parallel sign passages on tablets excluded from the fitting set.
Dated research note and evidence limitsHeraklion’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.
Next experiment. Compare independent sign annotations while preserving side, group and reading direction. Report sensitivity to disputed signs before attempting a language mapping on this single object.
Dated research note and evidence limitsZ340’s solvers describe its verified solution and the remaining short ciphers. They explain why many plausible Z13 or Z32 readings can fit the available symbols without establishing a unique answer.
Next experiment. Reproduce the published Z340 transform as a separate control. For Z13 and Z32, enumerate competing compatible readings and require external evidence before treating a name or location as established.
Dated research note and evidence limitsHauer and colleagues test language, substitution and music hypotheses. Their 87-character transcription includes ambiguous symbol orientations. Failed solver trials are evidence about tested assumptions, not a proof that every possible method fails.
Next experiment. Freeze alternative glyph readings before search. Compare bounded trials with matching synthetic controls, keeping attractive English phrases separate from independently verified evidence.
Dated research note and evidence limitsSource extraction limits, corpus access and reproducible bounds are recorded in the notes. No new historical decipherment is claimed. Read the research register and experiment standards.