26-05-2026, 01:31 PM
I work tthe text in the search of a candidate set of ngrams (group of adjacents glyphs within a word) to conform the key of a cipher.
The most difficult thing is to determine is a word is a ngram or it can be split in 2 or more ngrams.
If a candidate set is not possible or it is not possible that they form a key then the meaningless hypothesis will be the right one.
The most difficult thing is to determine is a word is a ngram or it can be split in 2 or more ngrams.
If a candidate set is not possible or it is not possible that they form a key then the meaningless hypothesis will be the right one.


![[+]](https://www.voynich.ninja/images/collapse_collapsed.png)