4 ms·

A Hash160 Collision

• gnabgib 1y ago
  (2017) According to https://web.archive.org/web/20170614210802/https://lbc.cryptoguru.org/man/theory https://web.archive.org/web/20170614210802/https://lbc.crypt...
• susam 1y ago
  > Obviously, the probability for this to happen is 1 in 2^256, which is such a ridiculously small number, that there is nothing in the physical world to describe it by example. Here is my attempt. Take a deck of 52 cards. Pick 5 more cards from another deck of a different brand. So now we have 57 distinct cards. Assume that the 57 cards are shuffled thoroughly in a random and uniform manner, meaning that each permutation of the 57 cards is equally likely. What are the odds of you guessing all 57 cards in the correct sequence purely by chance? Turns out the odds of you guessing the entire sequence of 57 shuffled cards are better than 1 in 2^256. In fact, 57! < 2^256 < 58!.
  • pestatije 1y ago
    plus you do that with a 256-qubit quantum computer and the process will finish soon
• vessenes 1y ago
  @mods this title is the title of the page. However, it is an extremely misleading title for the content, which describes the math of searching for a RIPEMD160 collision, and in no way announces the successful finding of such a collision — an event that would be a major market mover in crypto. I suggest maybe adding “: calculating the odds of success” or something.