Suppose we have three mining pools, one with 40% of computing power, and the other two having 30% of computing power each. Will the node with 40% power, be able to solve the puzzle for each node always quicker than the others?
Asked
Active
Viewed 317 times
1 Answers
4
No. Everything else being equal, the node with 40% of the computational power will 'solve the puzzle' 40% of the time, and each of the nodes with 30% of the computational power will 'solve the puzzle' 30% of the time.
By 'solving puzzle', we mean mining a block by finding a nonce that (when combined with the rest of the information in the block header) produces a SHA256 hash that meets the difficulty requirements of the network at that time.

mti2935
- 727
- 3
- 8
My assumption is that all the mining pools begin the process of finding the nonce exactly the same time. If they begin solving the puzzle the same time, then the one with more computational power wins. Isn't that right? I cannot see why one with smaller computational power will find the nonce quicker than one with bigger computational power. I will be grateful if you explain to me how one with small computational power find the nonce quicker than the one with small computational power.
– George Tsichritzis Dec 01 '15 at 16:00