How miners on the same pool search non-overlapping sets of nonce candidates already tried by other miners to find a solution?
To solve the problem of high variance, the mining pools were created. In a traditional mining pool, many people all agree to combine their mining efforts and split the rewards according to their contributions.
Based on that:
For example: There is 500 miners on the same pool. As I understand they all trying different nonce to come up with a solution which is less than the difficulty.
Based on this answer:
mining is doing the work of finding nonce so that sha256(sha256(data+nonce)) < difficulty
[Q] Overall, Do all miners in the same pool create solutions with different nonce between each other, or is there any possibility that multiple miners may create same solution by using same nonce being unaware.
If yes, How miners on the same pool search non-overlapping sets of nonce candidates already tried by other miners to find a solution?
http://ift.tt/2BJS15P
Comments
Post a Comment