arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2025-02-02 10:51:24 +00:00
Code Issues Releases Wiki Activity

CH12: s/fingerprint/(digest|commitment)/

Browse Source 
Makes the test more consistent with other changes made in previous
chapters.
This commit is contained in:
David A. Harding 2023-05-25 13:37:15 -10:00
parent 5d8c2c494d
commit 9f94188e3c
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
ch10.asciidoc
View File

@ -903,14 +903,15 @@ until the desired hash result appears by chance.
((("Proof-of-Work algorithm", id="proof10")))((("mining and consensus",
"Proof-of-Work algorithm", id="Cproof10")))A hash algorithm takes an
arbitrary-length data input and produces a fixed-length deterministic
result, a digital fingerprint of the input. For any specific input, the
resulting hash will always be the same and can be easily calculated and
result, called a _digest_. The digest is a digital commitment to the
input. For any specific input, the resulting digest will always be the
same and can be easily calculated and
verified by anyone implementing the same hash algorithm.
((("collisions")))The key characteristic of a cryptographic hash
algorithm is that it is computationally infeasible to find two different
inputs that produce the same fingerprint (known as a _collision_). As a
inputs that produce the same digest (known as a _collision_). As a
corollary, it is also virtually impossible to select an input in such a
way as to produce a desired fingerprint, other than trying random
way as to produce a desired digest, other than trying random
inputs.
With SHA256, the output is always 256 bits long, regardless of the size