Bit-level Geometry: A deterministic discovery of Voynichese building blocks

[TheEnglishKiwi]

Can you give us a proper summary in human words?

In simple terms, I've shared a tool that uses math to find the consistent structural building blocks of the text. The repeated "bricks" used to build the words, without having to rely on human guesswork.

Example: Take the English word "unbelievable".

If you didn't speak English, you might guess the blocks were "unb" - "eliev" - "able".  But that's a bad guess because those pieces aren't very reusable.

If the engine cuts the word at "un-", it realises it can reuse that same brick to explain 100's of other words like "un-happy", "un-known", or "un-do". The math proves that "un-" was the optimal building block because it's the most efficient way to organise the dataset.

If your guess is "cs" is a prefix of csheedy and it's wrong, that's potentially years wasted going down the wrong rabbit hole. So this tool acts as a map for translators to test their theories on statistically verified units, rather than random clusters of letters that might just look familiar but aren't.

And the math is proof because the engine can only compress the data if it contained repeating predictable patterns (see the math verified link in the original post for why this is so).

To be clear: The math only proves that a pattern exists. It doesn't prove why it exists or what it means.