Engineering your own voynich

[Scarecrow]

Some hypothetical reconstruction of the encrypment process of the pangram: THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG


Encryption Steps:
THE (sentence-start) → F (T-category initial) + ai (TH) + T (E) = FaiT

Next word must start with K (last bigram = iT).
QUICK → K (bigram rule) + zz (UIC) = Kzz

Next word starts with n (last bigram = zz).
BROWN → n + mn (BRO) + -nuy (null) = nmnuy

Next word starts with m (last bigram = uy).
FOX → m + aig (OX) = maig

Next word starts with q (last bigram = ig).
JUMPS → q + ar (UMPS) = qar

Next word starts with T (last bigram = ar).
OVER → T + iooiea (OVER) = Tiooiea

Next word starts with b (last bigram = ea).
THE (mid-sentence) → b + ar (HE) = bar

Next word starts with n (last bigram = ar).
LAZY → n + maei (AZY) = nmaei

Next word starts with T (last bigram = ei).
DOG → T + mz (OG) = Tmz

Final Ciphertext:
FaiT Kzz nmnuy maig qar Tiooiea bar nmaei Tmz

[oshfdk]

As per new rules, all this with help of Claude and DeepSeek.

If you take your code and just remove "step 2", "step 3", "step 4" etc, and then run it, it will show exactly the same result for the test cases included. Which means that the only working part is a mapping of ciphertext words to plaintext words, which seems arbitrary and will work for almost any plaintext.

The following is the script you attached with everything except the basic dictionary mapping removed. It still passes all the test cases successfully.

Code:

from typing import Dict, Optional, List class PangramDecoder:     def __init__(self):         self.last_bigram: Optional[str] = None         # Complete cipher-to-plain mappings         self.exact_matches = {             # Core pangram             "FaiT": "THE", "Kzz": "QUICK", "nmnuy": "BROWN",             "maig": "FOX", "qar": "JUMPS", "Tiooiea": "OVER",             "bar": "THE", "nmaei": "LAZY", "Tmz": "DOG",             # Typography and extended vocabulary             "Tiiiiz": "PANGRAM", "Tieir": "USES", "Kimb": "QUALITY",             "mvg": "FONT", "Kaiin": "LETTERS", "Fvg": "THAT",             "Tiiig": "STANDARD", "Kaiiea": "THE", "naean": "FONT",             "Fmg": "SHOWS", "TaaT": "TYPICAL", "Faiyun": "FREQUENTLY",             "Foonuy": "VISUALLY", "Tiavinn": "DISPLAYS", "TIeig": "TYPOGRAPHY",             "Timyun": "DEMONSTRATE", "qooiea": "JUMPED", "Tiaeean": "STANDARD",             "Teib": "THIS", "Kaaaouy": "OFTEN", "Fml": "A", "meaei": "AN",             "TiiiT": "TYPOGRAPHY", "Tiiiig": "FREQUENTLY", "KaeiT": "CONTAINS",             "KazT": "EXAMPLE", "Fiiiiz": "FREQUENTLY", "Fmyun": "SOMETIMES"         }     def decrypt_word(self, cipher_word: str) -> str:         # Step 1: Check exact matches         if cipher_word in self.exact_matches:             self.last_bigram = cipher_word[-2:] if len(cipher_word) >= 2 else None             return self.exact_matches[cipher_word]     def decrypt_sentence(self, ciphertext: str) -> str:         return " ".join(self.decrypt_word(word) for word in ciphertext.split()) # ====================== # Test Suite # ====================== def run_tests():     decoder = PangramDecoder()     test_cases = [         ("FaiT Kzz nmnuy maig qar Tiooiea bar nmaei Tmz",         "THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG"),         ("Tiiiiz Tieir Kimb mvg Kaiin Fvg Tiiig",         "PANGRAM USES QUALITY FONT LETTERS THAT STANDARD"),         ("Kaiiea naean Fmg TaaT",         "THE FONT SHOWS TYPICAL"),         ("Faiyun Foonuy Tiavinn",         "FREQUENTLY VISUALLY DISPLAYS"),         ("TIeig Timyun qooiea Tiaeean",         "TYPOGRAPHY DEMONSTRATE JUMPED STANDARD"),         ("Fml meaei TiiiT KaeiT KazT",         "A AN TYPOGRAPHY CONTAINS EXAMPLE"),         ("Fiiiiz Fmyun Kaaaouy",         "FREQUENTLY SOMETIMES OFTEN")     ]     for ciphertext, expected in test_cases:         decrypted = decoder.decrypt_sentence(ciphertext)         print(f"Ciphertext: {ciphertext}")         print(f"Decrypted:  {decrypted}")         print(f"Expected:  {expected}")         print("✅ Pass" if decrypted == expected else "❌ Fail")         print() if __name__ == "__main__":     run_tests()

[Scarecrow]

Ok, not noticed. I just left the python code is for reference for people who do understand those things, I am not a reptile myself.
It might help, it might not but it should contain all the steps needed in codified way.
There has been many versions of it to test some hypothesis and grown to something as that, but I do not know how the Python really works.

[oshfdk]

Ok, not noticed. I just left the python code is for reference for people who do understand those things, I am not a reptile myself.
It might help, it might not but it should contain all the steps needed in codified way.
There has been many versions of it to test some hypothesis and grown to something as that, but I do not know how the Python really works.

Ok, I understand. What is your opinion about this DeepSeek/ChatGPT solution, does it produce any interesting results?

[Scarecrow]

Deepseek was an interesting. I haven't never used it before but it seemed to be very effective especially in pattern analysis.
I have paid Claude subscription so never or almost never use ChatGPT. 

Claude was good in some things but started to deviate from the reality more often than Deepseek, once Claude started to see philosophical dimensions in the method (Philosophical Implications, information is a living, transformable entity, Encryption becomes a revelatory process) so I had to bring it back to reality more often than Deepseek.
But both were needed and complemented each other.

I tried Gemini for some ideas but had troubles scanning the text, for example looped over and over and over and didn't stop, provided false positives more than the others.

Good aides for mathematically impaired, but neither of them would have done, but guided they are good tools, as long as you know that you are doing.

[oshfdk]

Good aides for mathematically impaired, but neither of them would have done, but guided they are good tools, as long as you know that you are doing.

Did you try asking one LLM to scrutinize the result produced by the other? In my experience, two LLMs can produce interesting non-trivial results if one is tasked with finding flaws in the reasoning of the other.

[Scarecrow]

Good aides for mathematically impaired, but neither of them would have done, but guided they are good tools, as long as you know that you are doing.

Did you try asking one LLM to scrutinize the result produced by the other? In my experience, two LLMs can produce interesting non-trivial results if one is tasked with finding flaws in the reasoning of the other.

Once in a while I asked the other to very, proof or analyze the confidence of the other. Most of the times they found something to say in each other's writings.
But it became somewhat useful verification and idea production tool.

[nablator]

A word like [naeyun] is perhaps [na-e-yun], and [Kimaei] is [Ki-m-aei]. But it feels as though the middle column is optional.

I should have followed this excellent advice instead of wasting time searching for solutions with optional (sometimes empty) 2nd and 3rd columns. This was mostly because of the last word: now I think it is missing a 3rd column because the ciphertext ends after the 2nd column, not because the 3rd column is optional.

A non-ambiguous 23-26-26 partition is possible, still looking for more reduced 2nd and 3rd columns.

[RobGea]

I keep coming back to this and keep getting nowhere so i made a list of relevant posts by the OP and some observations as an attachment

post#1
How simple is it to engineer and then have reverse engineered a modern superficial voynich imitation? Let's see.

The imitation should probably use methods which
1) are plausible for the period, and
2) compatible with the ms.

The process used is deterministic, reversible,
=======
post#8
It should be reasonably easy to solve, but I might have overestimated how easy since there's no solution yet. 
=======
post#29
For this[cipher] it[deterministic] means a given plaintext will always produce the same ciphertext.
=======
post#32
In any case, don't worry, mine[this cipher] is reversible.    --{ this is a complicated post to unpick }
=======
post #44
the cipher being relatively simple and the context behind it existing on this very forum
=======
post#47
[A hint is contained in] a thread, and it[ the thread] involves rationality, skepticism, critical thinking and encipherment.
=======


  thread3592_Observations.txt (Size: 1.74 KB / Downloads: 12)

[nablator]

A non-ambiguous 23-26-26 partition is possible, still looking for more reduced 2nd and 3rd columns.

I found a non-ambiguous 24-24-23 partition a while ago, surprisingly without any empty string.

You are not allowed to view links. Register or Login to view.

F ai T
K z z
n m nuy
m ai g
q a r
Ti oo iea
b a r
n m aei
T m z
q oo iea
Ti ae ean
b a r
n m aei
T ei b
T iiii z
Ti ei r
Ki m b
m v g
K aii n
F v g
Tii i g
Ki ei iea
ki i n
F m q
F iiii z
m a yun
T ai yun
q iiia T
m m q
TI ei g
f aai g
Fi a ean
K aae aei
F ai yun
F oo nuy
Ti a vinn
Ti ae aei
T iiii g
F ai T
K z z
K a Eg
qii m iea
m oo l
m ai l
m ai iea
T iiii g
Kii a g
Ki ei iea
fi ee ean
Ti i g
K ai iea
n aai ben
n e r
n ae k
q e K
ni i nuy
m m iea
TI a yun
n a t
F ooi x
f am ean
f v T
Kii i yun
K aaa ouy
mi i g
m m n
t a uYnh
Fi oo g
K aei T
ki a q
m e aei
Ti a vinn
Ti e nuy
F ai yun
F oo g
fi i n
F v T
Ti aa ouy
q a yun
Ti a ean
K am ean
Fi i n
F a aei
m ae l
F i r
Ti a n
F oo yun
Fii i yun
F ai yun
F oo T
fii i r
Ti a n
F oo yun
Fii i yun
Ti oo z
fi ei k
f aoo b
K ae yun
m m r
t e aei
Ti ae ean
F m l
m m q
Fi a q
m e aei
Ti a vinn
Tii i n
F oo iea
Ti ae ean
b a r
n m aei
T ei b
mii i z
fii i g
K aii n
F a q
F m yun
Ki e r
m v r
f aai aei
F m yun
T ae aei
K am g
Ti ee g
F ai yun
n a t
F ooi nuy
m ai l
T iiii g
q e K
ni i nuy
n ae yun
n a z
mii i t
F ooi ouy
Ki a nuy
K aii n
F ei g
m aa ean
Ti i uYnh
f ao yun
n a nuy
qii ei yun
F z l
Fi a g
fi i nuy
f aai z
K aa yun
f ao b
m m n
T ai g
K aa yun
Ti e aei
K ei yun
n m yun
n aa ean
Fi i g
fi a ean
m v q
qii m n
m ai K
F i l
m e q
qii i pen
Ki e aei
Ki i n
F ee z
Ki m z
K aa l
f aai nuy
F m ean
Fi i t
F ooi q
T ei yun
K ai T
K aii ean
T m pen
Ti a l
T ai z
f aa z
fi m g
m ai l
f aai iea
T iiii g
Ki ei g
Tii i T
fii i nuy
T iiii z
Ti ee g
Ki a r
n m aei
K a l
k ae ean
F m r
n z g
K aei z
K a yun
n a ean
F m g
T aa T
fii i nuy
Ti m yun
T ae aei
n m nuy
Ti ae t
fi ae ben
m ai l
TI ei g
T iiii g
Fii i z
mi i nuy
Fi i yun
T ai K
K aa b
Fi v iea
qii a l
m ooi yun
n a yun
Ki m aei
K az T
Tii i T
fii i nuy
Ti m yun
T ae aei
Ti ae nuy
TI m r
F ei nuy
k aa q
q ooi l
F m ean
q iiia yun
m z g
K aei z
K a

Caveat: this is a proof that a non-ambiguous partition, compatible with the size of the (English) alphabet, is possible, not that it is the correct partition. Byatan may have underestimated the difficulty of finding it.