So far, there have been no successes in developing the cipher 
. I'm trying to diversify the alphabet itself, keeping its size below 25. I'm not a very creative person... BUT!
I noticed a peculiarity. At will, some of the numbers we have we can represent as a sum. This also does not complicate the decryption (in the worst case, the desired letter is guessed by context).
In the Voynichese cipher, this can be a way to get rid of multiple repetitions, among other things. For example, the repetition of o o (XV XV; which sometimes occurs in my cipher) can be represented as XXX, i.e. as che (XX+X), or as eee (X+X+X).
So, we can shorten the following word a bit: XVIII XV XV XII IV = oiin che ein (dan) ok. By the way, if I introduce XI as od, then the next unit will turn into y, not into n: oiin che ody ok.
Otherwise, it can be written as: okoiin cheody.
As I mentioned in the previous post, the alphabet can be modified to make it positional, creating the LAAFU effect. If a word appears at the beginning of a line, the numbers within it change according to their specific "initial" variations in the alphabet.
It is also important to avoid making the cipher more complex by making such changes...
This summation will allow you to fit more words into a line and "compress" the encrypted text. The summation should be done within reasonable limits, otherwise the decryption will stop at the selection of possible summands. I think limiting the number of terms to two will make the task easier. If you see che in the text, you can quickly guess that it is a hidden repetition of o o or e e e.
It is also possible that the numbers are combined, as in my example with sh eor - sheor. To eliminate or further disguise a repetition in a word, you can also replace the numbers.
It's actually easy to do all this, but I'm not in the mood today...
P.S. Please don't count my laziness as a flaw in this theory!
. I'm trying to diversify the alphabet itself, keeping its size below 25. I'm not a very creative person... BUT!I noticed a peculiarity. At will, some of the numbers we have we can represent as a sum. This also does not complicate the decryption (in the worst case, the desired letter is guessed by context).
In the Voynichese cipher, this can be a way to get rid of multiple repetitions, among other things. For example, the repetition of o o (XV XV; which sometimes occurs in my cipher) can be represented as XXX, i.e. as che (XX+X), or as eee (X+X+X).
So, we can shorten the following word a bit: XVIII XV XV XII IV = oiin che ein (dan) ok. By the way, if I introduce XI as od, then the next unit will turn into y, not into n: oiin che ody ok.
Otherwise, it can be written as: okoiin cheody.
As I mentioned in the previous post, the alphabet can be modified to make it positional, creating the LAAFU effect. If a word appears at the beginning of a line, the numbers within it change according to their specific "initial" variations in the alphabet.
It is also important to avoid making the cipher more complex by making such changes...
This summation will allow you to fit more words into a line and "compress" the encrypted text. The summation should be done within reasonable limits, otherwise the decryption will stop at the selection of possible summands. I think limiting the number of terms to two will make the task easier. If you see che in the text, you can quickly guess that it is a hidden repetition of o o or e e e.
It is also possible that the numbers are combined, as in my example with sh eor - sheor. To eliminate or further disguise a repetition in a word, you can also replace the numbers.
It's actually easy to do all this, but I'm not in the mood today...
P.S. Please don't count my laziness as a flaw in this theory!