And while in the subject...
Although extremely unlikely, what happens if a new block has the same hash as a previous block?
Shouldn't minners keep digging in that case? and shouldn't CheckBlock verify that case (e.g., if another block has the same hash but a lower height then this block is invalid)?
https://github.com/bitcoin/bitcoin/blob/5488514b901d807a98544618cb441a28e0b28bda/src/main.cpp
Topic: Is the output of hash function evenly distributed? - page 2. (Read 2265 times)
Hash function (sha256) is used to mine and identify a block. The digest is a 256 bit string.
We don't know whether this function is surjective or not (whether there is an input-block header for each output-digest).
But we assume that the output of the hash function is evenly distributed (so we can calculate target and difficulty for proof-of-work algorithm).
How can we know for sure the output is evenly distributed?
We don't know whether this function is surjective or not (whether there is an input-block header for each output-digest).
But we assume that the output of the hash function is evenly distributed (so we can calculate target and difficulty for proof-of-work algorithm).
How can we know for sure the output is evenly distributed?
Jump to: