One thing always came in my mind is a block are like a bus who pass every 10min. In real life the bus have theoric limited amount of seats (the 1mb limit analogy), but it possible to add more people in the bus with a little of additional work. or "compress" work

[...]

And in physics its possible to compress anything on a small limited volume, but that "compress" need always addition work according to the initial volume. (Black holes for example)

So my theory is if it is possibile to find an algorythm that do the same thing but with data and information. Giving an arbitrary large file, is it possible mathematically to compress it to a limit less 1Mb.