Voynichese is a numeric cipher?

[ololololo]

Could you feed your cipher description to a coding agent and make it create an encoder, that would convert plaintext to ciphertext? If you check that it works correctly, I can encode some text using this encoder and you can check how quickly you can read it. I would say that if reading a single sentence takes more than a couple minutes even after some practice, then this cipher looks impractical for a book. Not that anything would prevent the creator of the manuscript from using an impractical cipher, but I tend to think that for a book of this size some more or less efficient solution would be used. Not many people like wasting their time.

I'm very bad at programming, so I asked Gemini to make this code for me (I hope I didn't break the forum rules too much ). But it doesn't add nulls, replace numbers, add them, "glue" them, etc. And there is no eiin-daiin replacement. In general, you will have to work a little on the encrypted text, specifically by placing the letters in the right places or combining words, such as cph eol into cpheol. I apologize for that.
I tested it in Online Python, and it seems to produce the same results as I did.
I can't send the code file, so I'll write it here and you can just copy it:

def letter_to_num(letter):

    letter = letter.upper()
    if letter in ['U', 'V']:
        return 21
    if 'A' <= letter <= 'Z':
        return ord(letter) - ord('A') + 1
    return None

def num_to_roman_tokens(num):
   
    tokens = []
    roman_rules = [
        (22, 'XXII'), (21, 'XXI'), (20, 'XX'), (19, 'XIX'),
        (17, 'XVII'), (16, 'XVI'), (15, 'XV'), (11, 'XI'),
        (9, 'IX'), (6, 'VI'), (4, 'IV'), (10, 'X'),
        (5, 'V'), (3, 'III'), (2, 'II'), (1, 'I')
    ]
    for val, sym in roman_rules:
        while num >= val:
            tokens.append(sym)
            num -= val
    return tokens

def encrypt_word(word):
   
    numbers = [letter_to_num(l) for l in word if letter_to_num(l) is not None]
    if not numbers:
        return word
   
   
    numbers.sort(reverse=True)
   

    raw_tokens = []
    for num in numbers:
        raw_tokens.extend(num_to_roman_tokens(num))
       
   
    separate_last_i = False
    if len(raw_tokens) >= 2 and raw_tokens[-2] == 'III' and raw_tokens[-1] == 'I':
        separate_last_i = True
        raw_tokens.pop()
       
    encrypted_tokens = []
    is_standalone_xx = len(raw_tokens) == 1 and raw_tokens[0] == 'XX'
   
    
    i = 0
    while i < len(raw_tokens):
        token = raw_tokens[i]
       
       
        if token == 'XV' and i + 1 < len(raw_tokens) and raw_tokens[i+1] == 'XV':
            encrypted_tokens.append("che")
            i += 2  
            continue
           
   
        if token == 'XVI':
            if i + 1 < len(raw_tokens):
                next_token = raw_tokens[i+1]
                
                if next_token.startswith('XV') or next_token.startswith('X') or next_token.startswith('V'):
                    
                    if next_token == 'XV':
                        encrypted_tokens.append("q") 
                        i += 2 
                        continue
                    else:
                        encrypted_tokens.append("qo")
                        i += 1
                        continue
            
            encrypted_tokens.append("s")
            i += 1
            continue
           
        
        if token == 'XXII': encrypted_tokens.append("chol")
        elif token == 'XXI':  encrypted_tokens.append("chor")
        elif token == 'XIX':  encrypted_tokens.append("eor")
        elif token == 'XX':  encrypted_tokens.append("sh" if is_standalone_xx else "ch")
        elif token == 'XVII': encrypted_tokens.append("cph")
        elif token == 'XV':  encrypted_tokens.append("o")
        elif token == 'XI':  encrypted_tokens.append("ey")
        elif token == 'IX':  encrypted_tokens.append("or")
        elif token == 'VI':  encrypted_tokens.append("an")
        elif token == 'IV':  encrypted_tokens.append("oke")
        elif token == 'X':    encrypted_tokens.append("e")
        elif token == 'V':    encrypted_tokens.append("a")
        elif token == 'III':  encrypted_tokens.append("iin")
        elif token == 'II':  encrypted_tokens.append("in")
        elif token == 'I':
            current_word_str = "".join(encrypted_tokens)
            if current_word_str and current_word_str[-1] in ['a', 'o']:
                encrypted_tokens.append("n")
            else:
                encrypted_tokens.append("y")
        i += 1
               
    encrypted_str = " ".join(encrypted_tokens)
   

    if separate_last_i:
        current_word_str = "".join(encrypted_tokens)
        last_i_char = "n" if current_word_str and current_word_str[-1] in ['a', 'o'] else "y"
        encrypted_str += f" {last_i_char}"
       
    return encrypted_str

def encrypt_text(text):
    words = text.split()
    encrypted_words = [encrypt_word(w) for w in words]
    return " /// ".join(encrypted_words)

print(encrypt_text("OO"))
print( encrypt_text("PE"))
print(encrypt_text("PO"))

my_text = "YOUR TEXT"
print(encrypt_text(my_text))