# Read through Greshko's segmentation, a working two-letter solver finds no reading

> With the segmentation fixed by Greshko's prefix and suffix inventories, a solver that recovers two-letters-per-word keys finds no reading of the…

Source: https://mysteriesdept.com/mysteries/voynich-manuscript/evidence/EVD0DC7RD2B8AP5/read-through-greshkos-segmentation-a-working-two-letter  
Publisher: Mysteries Department  
Licence: CC BY 4.0 (credit Mysteries Department and link the page)  

---

[Voynich Manuscript](https://mysteriesdept.com/mysteries/voynich-manuscript)Evidence

Evidence · Voynich Manuscript

# Read through Greshko's segmentation, a working two-letter solver finds no reading

With the segmentation fixed by Greshko's prefix and suffix inventories, a solver that recovers two-letters-per-word keys finds no reading of the manuscript.

Suggestive0

## What it means

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

Most likely: a notation or memory system

**Most likely** unchanged

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

Partly answered

**Most likely** unchanged

Answer this evidence bears on[Each word is a fragment of a verbose cipher](https://mysteriesdept.com/mysteries/voynich-manuscript/answers/ANS0D8FZZC67P7G/each-word-is-a-fragment-of-a-verbose-cipher)

Counts againstnone for, 2 against

**Disputed** unchanged

## Next steps 5

1

T39, second round of the section-level grid: add the two mechanisms that produce what T38 cannot reach. (a) Re-spacing: write the cipher as a continuous glyph stream and place spaces by a rule (after word-final glyphs such as -y, -n, -r, -l, before q-, ch-, d-), so word edges depend on neighbouring glyphs (T15's re-spaced stream gave edge MI 0.22). (b) Local copying: with probability p the next word is a one-glyph variant of a word among the last w (self-citation), for the near-twins. Cross with the T38 table-stay knob and the line layer, confirm best settings on fresh seeds.

~8 h

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

**—** not judged

2

Naibbe-type key over glyph strings learned from the manuscript rather than Greshko's inventory (which reads 78 % of tokens), with whole-word signs for common words, validated on planted keys first. It would also have to keep page locality, which letter-level homophones erase (M-T36).

~16 h

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

**—** not judged

3

Codebook attack: group one-glyph variant families that share contexts, then align the manuscript's co-occurrence structure with Latin texts of the same genres (unsupervised lexicon induction: embedding alignment, graph matching). Validate on a planted Latin codebook with variants laid into the same pages first.

~20 h

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

**—** not judged

4

Section-level key search: run the M-T37 solver within single sections (training and held-out pages alternating by bifolio), so a key need not hold across sections whose order and scribes differ.

~6 h

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

**—** not judged

Ranked by how likely each is to move the key question, for the time it takes[All 5 on the question](https://mysteriesdept.com/mysteries/voynich-manuscript/questions/QST08JG2PB04SQP/is-it-a-cipher-of-a-known-language#next)

## Sources 2

[The Naibbe cipher: a substitution cipher that encrypts Latin and Italian as Voynich manuscript-like ciphertext](https://mysteriesdept.com/sources/SRC08JHZJJR0Z8T/the-naibbe-cipher-a-substitution-cipher-that-encrypts-latin)

G 2025

SRC

[greshko/naibbe-cipher: Python implementations of the Naibbe cipher and Voynichesque, decryption script and figure data](https://mysteriesdept.com/sources/SRC0DC7KNC9B3YT/greshko-naibbe-cipher-python-implementations-of-the-naibbe)

Greshko 2025

SRC

## Cite it

```
Mysteries Department. (2026). Read through Greshko's segmentation, a working two-letter solver finds no reading [Evidence EVD0DC7RD2B8AP5]. https://mysteriesdept.com/r/EVD0DC7RD2B8AP5
```

Key

**EVD** 0DC7RD2B8AP5

Kind

Evidence

Tier

Suggestive

Found in

[Session 11](https://mysteriesdept.com/mysteries/voynich-manuscript/sessions/SES0DCDMFZAWWNC/session-11-the-naibbe-cipher-tested-section-level-hyper) · 28 Oct 2026

Version

2

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/EVD0DC7RD2B8AP5)