Pages:
Author

Topic: Solving the problem of on-chain scaling - page 3. (Read 1193 times)

legendary
Activity: 1624
Merit: 2481
August 06, 2019, 07:05:58 AM
#2
Quote
Quote
There's limit how much you compress data, especially random ones (without pattern or specific iteration)

There is?

Yes. Compression is not a magic algorithm.

Compression works by removing redundancy of data.

Lets look at the following string for example:
Code:
abcbaaaaaaadbaaaaa

You would compress it roughly like this:
Code:
abcb[7*a]db[5*a]


With random data, you don't have such patterns. And therefore you can't compress much at all (at least not if it isn't an extremely shitty PRNG).
Same applies to encrypted data, because it will look like random data.

By the way, that's also one easy way to find encrypted data. Search a drive for data with high entropy.
If you find very high entropy -> most likely encrypted data.
hero member
Activity: 680
Merit: 500
August 05, 2019, 09:35:40 AM
#1
.
Pages:
Jump to: