|
|
|
@ -825,7 +825,7 @@ Although it only takes one hash computation to verify, it took
|
|
|
|
|
us 32 hash computations to find a nonce that worked. If we had a lower
|
|
|
|
|
target (higher difficulty), it would take many more hash computations to
|
|
|
|
|
find a suitable nonce, but only one hash computation for anyone to
|
|
|
|
|
verify. Furthermore, by knowing the target, anyone can estimate the
|
|
|
|
|
verify. And by knowing the target, anyone can estimate the
|
|
|
|
|
difficulty using statistics and therefore know roughly how much work was needed
|
|
|
|
|
to find such a nonce.
|
|
|
|
|
</p>
|
|
|
|
|