|
|
|
|
|
|
by seabee
4626 days ago
|
|
|
The length of the digest is 32 bits in the linked example and for Bitcoin is 160 bits. Assuming the hash functions are good, if you only have 32 bits of output you can expect to find a collision after 77,000 hashes; the examples used three times that! With 160 bits, you need to generate many orders of magnitude more hashes before a collision is likely. See http://en.wikipedia.org/wiki/Birthday_attack |
|
|