4 ms·
How long would it take the cryptocurrency miners to use all their hashing power to find the deterministic key that generates the content of libgen? That might
by jancsika 8y ago
How long would it take the cryptocurrency miners to use all their hashing power to find the deterministic key that generates the content of libgen?
That might be an easier solution than trying to achieve minimally sane copyright reform.
- na85 8y ago>How long would it take the cryptocurrency miners to use all their hashing power to find the deterministic key that generates the content of libgen? Could you not simply hash the content of libgen to find said key?
- colordrops 8y agoIt doesn't work like that. Hashes aren't compressed versions of the hashed content.
- canjobear 8y agoWell, not losslessly compressed :)
- bepvte 8y agoI think theyre suggesting hashing all of libgen and distributing and working backwards from that hash, as a joke
- na85 8y agoIt'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.
- snovv_crash 8y agoAmong many other things.
- raxxorrax 8y agoChose your hash carefully or might end up with the ask toolbar for windows ME because of collisions.
- isostatic 8y agoThere 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.
- Dylan16807 8y agoTo 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.
- jancsika 8y agoWell 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.
- mikorym 8y agoIf you found such a thing, how would you know? There is no way of traversing hash collisions. It would be the hash of some string of cryptocurrency jarble that also happens to be the hash of some encoding of the libgen database and you would have no way of knowing this unless you specifically hashed all of libgen. In this case you know all of libgen already anyway, unless you forgot the information that you hashed.