I think theyre suggesting hashing all of libgen and distributing and working backwards from that hash, as a joke

It's not totally ridiculous, just wildly impractical. There is a hash out there that if brute-forced would yield a Windows 10 version of Half-Life 3.

Chose your hash carefully or might end up with the ask toolbar for windows ME because of collisions.

Among many other things.

There are an infinite amount of things that hash to a given hash.

For something of the size of half life 3 (about 2GB? no idea), the number of collissions would be far more than the number of atoms in the universe.

To provide a much tighter bound, you reach "atoms in the universe" levels of collision once your hash inputs are 260-270 bits bigger than the hash output. No need for even a single kilobyte.

Almost a "Graham's number" level of understatement.

Well I wrote it wrong.

Imagine something like finding the seed for a pseudorandom number generator where the numbers generated form the byte pattern for libgen.

That's similar to the cryptominer hashing where people just have rigs enumerating through possible values to generate a hash with the appropriate number of leading zeros. It's just that libgen would be little bit longer than a hash and also have some ones interspersed with the zeros.

Well, not losslessly compressed :)