Compression of random binary data

[danceswithnumbers at gmail.com]

On Monday, July 11, 2016 at 11:52:27 AM UTC-6, jonas.t... at gmail.com wrote:
> What kind of statistic law or mathematical conjecture  or is it even a physical law is violated by compression of random binary data? 
> 
> I only know that Shanon theorised it could not be done, but were there any proof? 
> 
> What is to say that you can not do it if the symbolic representation is richer than the symbolic represenatation of the dataset. 
> 
> Isn't it a fact that the set of squareroots actually depict numbers in a shorter way than their actual representation. 
> 
> Now the inpretator or program must know the rules. And i have very good rules to make it happen.

In Short, I cannot find a single mathematical proof that says you cannot compress random numbers. Pigeon hole and other conjectures are just that. In fact, the biggest fallacy when people start talking about compression is to say that all compression alg rely on redundancies, or repetitive sequences. The million random digits is compressed down to 415,241 kb. I have been only able to compress that down to 352,954 kb. A very small amount. It has taken six years to come up with that small amount.