| more characters with notation than what you reduce with math. Is there some reason you could never be on the positive end here?
My idea with using AES255 encryption is simply that
| doing so gives you a totally different set of characters with different entropy, i think. So you could compress it differently.
Logically speaking, i dont think a singularity is
| realistic, no, but what if the shrinking process involved with square-rooting results in more compressioj than not? If the compression even had a mere 51% chance of being superior,
| then couldnt we just do it over and over again to get a better compression?
I think it all hinges on the premise that math allows us to bidirectionally and deterministically shorten
| a character count. Is this assumption itself incorrect?
