arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2024-11-22 08:08:11 +00:00
Code Issues Releases Wiki Activity

Edited ch12_mining.adoc with Atlas code editor

Browse Source
This commit is contained in:
claylock 2023-10-26 20:04:06 +00:00
parent a6b39a6ec6
commit 93c691dd8c
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
ch12_mining.adoc
View File

@ -819,6 +819,8 @@ $ echo "Hello, world! 32" | sha256sum
09cb91f8250df04a3db8bd98f47c7cecb712c99835f4123e8ea51460ccbec314 - 09cb91f8250df04a3db8bd98f47c7cecb712c99835f4123e8ea51460ccbec314 -
---- ----
++++
<p class="fix_tracking3">
Although it only takes one hash computation to verify, it took 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 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 target (higher difficulty), it would take many more hash computations to
@ -826,6 +828,8 @@ find a suitable nonce, but only one hash computation for anyone to
verify. Furthermore, by knowing the target, anyone can estimate the verify. Furthermore, by knowing the target, anyone can estimate the
difficulty using statistics and therefore know roughly how much work was needed difficulty using statistics and therefore know roughly how much work was needed
to find such a nonce. to find such a nonce.
</p>
++++
[TIP] [TIP]
==== ====