<p>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.  </p>

<p>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.</p>

CC BY-SA 3.0
2015-12-01T16:00:10.530Z
Thanks for your answer. 

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
CC BY-SA 3.0
2015-12-01T16:34:22.163Z
Imagine you and I play a game with a deck of cards. All of the cards are turned face down on a table. We each take turns flipping over a card until one of us uncovers the King of Spades. If we both turn over one card on each of our turns, then you and I each have a 50% chance of winning, right? Now, let's say you get to turn over 2 cards when it's your turn, but I only get to turn over 1 card on my turns. You would win 2/3 of these games, and I would win 1/3, right? Mining is similar to this game of chance. Miners that can hash faster will win more often, but will not win 100% of the time.
mti2935
CC BY-SA 3.0
2015-12-01T17:16:11.947Z
And now imagine how to do that card game 1) without any dealer 2) without trusting any of the other players (to shuffle the deck fairly and not peeking) 3) while being on the other side of the world of each other 4) without even any communication until the moment the right card has been picked. Only Proof of Work can do that and it has never been done before Bitcoin.
Jannes
CC BY-SA 3.0
2015-12-02T15:51:53.400Z
@GeorgeTsichritzis: Each miner is trying to solve the puzzle with a different set of tiles. Therefore they require different amounts of work at random to solve it.
Murch
CC BY-SA 3.0
2015-12-03T23:27:06.247Z
@murch Do you mean that every mining pool scans different possible inputs to the hash function?
George Tsichritzis
CC BY-SA 3.0
2015-12-04T07:29:35.590Z
@GeorgeTsichritzis: Exactly. Among other things, they are trying to send the block reward to different addresses which causes them to work on different input data for the block.
Murch
CC BY-SA 3.0
2015-12-01T15:52:32.147Z
2015-12-01T15:52:32.147Z
mti2935
<p>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? </p>

<proof-of-work><mining-theory>
Can the mining pool with the most mining power always win?
George Tsichritzis
# Can the mining pool with the most mining power always win?

(Asked by: username_0 on 2015-12-01)

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?

**Tags:** proof-of-work, mining-theory


---

## 1 answers

### Answer by username_1 on 2015-12-01. Score: 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.

> **Comments:**
> **username_0**: Thanks for your answer.   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.  
> **username_1**: Imagine you and I play a game with a deck of cards. All of the cards are turned face down on a table. We each take turns flipping over a card until one of us uncovers the King of Spades. If we both turn over one card on each of our turns, then you and I each have a 50% chance of winning, right? Now, let's say you get to turn over 2 cards when it's your turn, but I only get to turn over 1 card on my turns. You would win 2/3 of these games, and I would win 1/3, right? Mining is similar to this game of chance. Miners that can hash faster will win more often, but will not win 100% of the time.  
> **username_2**: And now imagine how to do that card game 1) without any dealer 2) without trusting any of the other players (to shuffle the deck fairly and not peeking) 3) while being on the other side of the world of each other 4) without even any communication until the moment the right card has been picked. Only Proof of Work can do that and it has never been done before Bitcoin.  
> **username_3**: @username_0: Each miner is trying to solve the puzzle with a different set of tiles. Therefore they require different amounts of work at random to solve it.  
> **username_0**: @username_3 Do you mean that every mining pool scans different possible inputs to the hash function?  
> **username_3**: @username_0: Exactly. Among other things, they are trying to send the block reward to different addresses which causes them to work on different input data for the block.  

---

