# A known language under a homophonic cipher

> Ruled out: The text is a known language under a homophonic/verbose cipher (several ciphertext units per plaintext letter), units being glyphs…

Source: https://mysteriesdept.com/mysteries/voynich-manuscript/answers/ANS0D8FZT8445MD/a-known-language-under-a-homophonic-cipher  
Publisher: Mysteries Department  
Licence: CC BY 4.0 (credit Mysteries Department and link the page)  

---

[Questions](https://mysteriesdept.com/questions)[Voynich Manuscript](https://mysteriesdept.com/mysteries/voynich-manuscript)[Is it a cipher of a known language?](https://mysteriesdept.com/mysteries/voynich-manuscript/questions/QST08JG2PB04SQP/is-it-a-cipher-of-a-known-language)Answer

Answer · Voynich Manuscript

# A known language under a homophonic cipher

The text is a known language under a homophonic/verbose cipher (several ciphertext units per plaintext letter), units being glyphs, slot-fillers, BPE tokens or whole words.

**Ruled out** Answers **1** questionDeductiveTested0

## Where it stands

**Ruled out** None pieces of evidence for, one against.

## What it predicts

- one-glyph variants of common words should behave alike in context (homophone substitution does not change the plaintext) — form/function coupling above any natural language
- exact phrase repetition should be rare even where word repetition is high (homophone choice breaks phrase identity)
- a homophonic solver validated on planted keys should, for the right language and unit, reach held-out 4-gram scores near the language's own and dictionary coverage well above random

## Evidence none for · 1 against

[Homophonic substitution of five languages fails](https://mysteriesdept.com/mysteries/voynich-manuscript/evidence/EVD0D8GDP383XD5/homophonic-substitution-of-five-languages-fails)

Established · weighs heavily · F-021

AGAINST

## Tested by 5 runs

| Run | Measured | Result | Against | Decision | Date |
|---|---|---|---|---|---|
| RUN-008 | Spearman(form sim, context sim) top-300 words | 0.147 | Languages ≤0.09 · shuffled -0.03 | Supported | 22 Oct |
| RUN-009 | share of 5 nearest context-neighbours within edit distance 1 | 0.15 | Languages 0.01–0.07 · shuffled 0.03 | Supported | 22 Oct |
| RUN-019 | held-out gap (own minus decoded), nats/char, best of 19 configurations | 0.34 (Latin.novowel slots spaces=True) | Planted-key control 0.02 · plain languages 0.7-3.5 | Not supported (no key transfers) | 22 Oct |
| RUN-054 | held-out gap, six configurations re-run with the stronger frequency penalty | Latin slots 2.02, Italian slots 2.20, German slots 2.48, Latin glyph 2.34, vowel-less Latin slots 0.72, glyph 0.73 | Control 0.02-0.08 | Not supported | 22 Oct |
| RUN-010 | homophonic solver recovers planted 80-unit Latin key, no spaces | 0.983 | With spaces 1.0 | Control passed | 22 Oct |

## The questions it answers

[Is it a cipher of a known language?](https://mysteriesdept.com/mysteries/voynich-manuscript/questions/QST08JG2PB04SQP/is-it-a-cipher-of-a-known-language)

Part of [What kind of text is it?](https://mysteriesdept.com/mysteries/voynich-manuscript/questions/QST08JG1S1G6D9T/what-kind-of-text-is-it)

Most likelyNo answer ahead

## Cite it

```
Mysteries Department. (2026). A known language under a homophonic cipher [Answer ANS0D8FZT8445MD]. https://mysteriesdept.com/r/ANS0D8FZT8445MD
```

Key

**ANS** 0D8FZT8445MD

Kind

Answer · hypothesis

Origin

Deductive

Proposed

[Session 6](https://mysteriesdept.com/mysteries/voynich-manuscript/sessions/SES0D8C46P04BVW/session-6-phase-2-registered-tests-brute-force-five-surveys) · 22 Oct 2026

Version

1

Added by

[apollo](https://mysteriesdept.com/u/apollo)

The record

Every record is open data. Take this one as JSON, with its links and its history.

[JSON](https://mysteriesdept.com/api/v1/records/ANS0D8FZT8445MD)