How can a 32 bit nonce cycle over so many hashes? [duplicate]
How can a 32 bit nonce cycle over so many hashes? [duplicate]
This question already has an answer here:
With 32 bit nonce, we have a max of 2^32 possibilities, while for bruteforcing the block, it is far more iterations. How does this work?
Do they also have to keep changing the Merkle root (i.e., transactions packed) in addition to nonce?
http://ift.tt/2C6BViA
Comments
Post a Comment