Fortunately I have enough of the rar parts to extract the data I want but damn.

  • BeefAndPoultry@lemmus.orgEnglish
    9·
    11 days ago

    The problem is there will be multiple solutions that result in the same hash (collisions), but only one of them will be correct

    And it would take an extremely long time to find them all, I don’t even think a modern GPU could do it in a lifetime

    • Fitzsimmons@lemmy.blahaj.zoneEnglish
      4·
      10 days ago

      It looks like bittorent version 2 hashes with sha-256 at a 16kb resolution.

      pieces root

      For non-empty files this is the the root hash of a merkle tree with a branching factor of 2, constructed from 16KiB blocks of the file. The last block may be shorter than 16KiB. The remaining leaf hashes beyond the end of the file required to construct upper layers of the merkle tree are set to zero. As of meta version 2 SHA2-256 is used as digest function for the merkle tree. The hash is stored in its binary form, not as human-readable string.

      Seems like that should be easily parallelizable and can fit into thread memory on a modern GPU.

      It would just depend on how many 16kb blocks are remaining in that 0.1%

      • BeefAndPoultry@lemmus.orgEnglish
        4·
        10 days ago

        Well the hashes are always much smaller than the actual data, otherwise downloading the hashes would take just as long as downloading the data lol.

        So 16KB blocks means 131072 bits per block, subtract the 256 bit hash size and that means 2^130816 hash collisions

        That’s a lot lol, you’ll never find which one is the correct one. Even if you instantly had a list of all values that match the desired hash, you’d have to check them all and somehow determine which one was correct.