<p>The Proof of Work is not really a puzzle that is solved.</p>

<p>For a block to have a valid proof of work, the hash of the block header must be less than a given target. This will result in the hash having some number of leading 0's. People will then simplify that to be "some number of leading 0's" when explaining PoW to people. But it is actually less than a certain target value.</p>

<p>The target value is used to determine the difficulty (it's an inverse relationship: as the target decreases, the difficulty increases). If you were to calculate the difficulty of a block in the same way with its hash, then the difficulty of a block must be greater than or equal to the network difficulty.</p>

CC BY-SA 3.0
2017-11-12T05:46:00.223Z
Thank you, Andrew. This is what i really want to know :-)
Truong Nguyen
CC BY-SA 3.0
2017-11-11T18:41:26.807Z
2017-11-11T18:41:26.807Z
Ava Chow
<p>At this time, I am really confused about the Proof of work puzzle because as I have seen in some documents, there are 2 different ways to talk about them.</p>

<p>The first one I have seen is from some videos, and also the original of Bitcoin by Nakamoto: the answers to the puzzle will make the result of hashing the block header contains some number of zeros from the start consecutively.</p>

<p>Meanwhile, there are also some documents saying that the result of hashing the block header has to be below a difficulty.</p>

<p>So I wonder which one I can trust now. Could anybody tell me? Thanks in advance :-)</p>

<proof-of-work>
Bitcoin Proof of work puzzle inconsistency
Truong Nguyen
# Bitcoin Proof of work puzzle inconsistency

(Asked by: username_0 on 2017-11-11)

At this time, I am really confused about the Proof of work puzzle because as I have seen in some documents, there are 2 different ways to talk about them.

The first one I have seen is from some videos, and also the original of Bitcoin by Nakamoto: the answers to the puzzle will make the result of hashing the block header contains some number of zeros from the start consecutively.

Meanwhile, there are also some documents saying that the result of hashing the block header has to be below a difficulty.

So I wonder which one I can trust now. Could anybody tell me? Thanks in advance :-)

**Tags:** proof-of-work


---

## 1 answers

### Answer by username_1 on 2017-11-11. Score: 4 | Accepted answer

The Proof of Work is not really a puzzle that is solved.

For a block to have a valid proof of work, the hash of the block header must be less than a given target. This will result in the hash having some number of leading 0's. People will then simplify that to be "some number of leading 0's" when explaining PoW to people. But it is actually less than a certain target value.

The target value is used to determine the difficulty (it's an inverse relationship: as the target decreases, the difficulty increases). If you were to calculate the difficulty of a block in the same way with its hash, then the difficulty of a block must be greater than or equal to the network difficulty.

> **Comments:**
> **username_0**: Thank you, Andrew. This is what i really want to know :-)  

---

