Voynichese is a numeric cipher?

[ololololo]

@oshfdk, you asked me to use an algorithm to encrypt some large text. I asked Gemini (the author of the code) and tried to apply large passages to it myself. It works, you can use it
I tried to encrypt Shakespeare's Sonnet 18:
oke y /// oiin o oke daiin an a iin y /// ch a /// daiin or or y /// chor ch oke dan or ain an a /// or a ok /// ch y /// chor ch /// eor oiin o or a ok iin /// chor eor qo dan /// eor aiin a in y /// ch oiin qo daiin or a a /// chor chor ch eor oke a /// eor oiin q dan dan or a iin /// daiin or or y /// chor eor a ok iin /// chor ch ch cPh or y /// chor chor eor oiin cph a a a in /// eor eor o dan a /// ch eor eor a n y /// ch oiin oiin or or y /// ch s or iin y

ch oiin o oke or a /// o oke daiin or or /// dan or a iin y /// chor ch oiin oke daiin or a ok /// chor chor eor o dan iin /// ch daiin or iin y /// chor chor chor oiin cPh daiin a n /// chor chor chor ch eor dan /// eor qo a a n /// chor ch oiin oiin che dan a ok iin y /// chor eor cph o oke daiin or a /// eor eor s or a a iin /// y /// eor s or a a iin /// chor eor y /// ch or ok iin y /// chor eor iin y /// chor ch y /// ch o daiin dan dan a n /// ch eor oiin q daiin or a /// chor ch oiin qo a ok y y y

ch y /// o oke oke /// ch eor oiin daiin a a iin iin y /// chor ch y /// ch oiin oke a a n y /// ch eor eor a n y /// oke a iin /// chor eor a ok iin /// ch oiin qo a a ok /// chor cPh o ok /// chor chor ch daiin /// chor oiin oiin qo q daiin or /// ch eor a /// oke a iin /// eor oiin o daiin /// ch a /// ch ch or or iin in y y /// oke or /// chor oiin daiin in y /// chor eor y /// chor oiin daiin dan a in y y /// chor daiin iin /// chor ch /// oke or /// chor eor oiin oke daiin or or iin in y /// ch eor oiin oke or a a n /// eor eor oiin a a iin iin

chor daiin ok /// eor o oke daiin or aiin a /// ch eor oiin qo oke or y /// chor ch y /// chor o dan or iin /// oiin oiin oke a a a iin /// chor chor chor ch ch eor eor q oke or a /// o aiin iin /// и /// chor ch daiin or y /// ch or or in /// ch o oke or ok in y

The peculiarity of the cipher is that when working with English text, it becomes very monotonous in terms of "words" (there are a lot of units like eor or, etc. Nulls are powerless in this case).
In fact, this text can be made "usable" without much effort, just by combining some words, and it will already be quite beautiful, for example. q oke or).
What exactly is difficult about this cipher? Recognizing some letters and deciphering anagrams. Speaking of complexity, I think we need to consider that our decrypter knows all the rules of the cipher. His only obstacle is anagrams.