| obviously. But what if there was a theoretical floor, based on the laws of mathematics? Im not arguing there can be, but what if?
I think it all comes down to a single premise. If
| taking the square root of a Very Large number (1000 characters) can massively decrease the number of characters, then isnt that by itself a compression? All you gotta do is not add
My advice for sqrt, DO THE MATH. It is really not hard, and it will help you understand the issues involved. DO NOT try to add AES or something into the mix, do ONE thing first.
| 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?
