Chances of practically finding a collision are indeed really small, though as you can easily calculate, there exists a sha256 hash value such that there are at least 2^256 different 512-bit long bit strings that map to it (and actually most of them should have this property).
Re:How Hash Algorithms Work (2007)
by seanwilson on Friday January 13, 2017 @04:53PM
(#13395045)
> The chances of a sha256 collision is essentially zero barring a vulnerability being found in sha2.
Yes, but to answer the question if you can find the input from the hash, the answer is no because it's impossible to be 100% certain as many input can hash to the same value.
?
The chances of a sha256 collision is essentially zero barring a vulnerability being found in sha2. Far more likely for a comet to wipe out earth in your lifetime.