From 672d30f2575722ed923364dc3f25be16d69f4912 Mon Sep 17 00:00:00 2001 From: "judymcconville@roadrunner.com" Date: Wed, 3 May 2017 10:04:03 -0700 Subject: [PATCH] Edited ch10.asciidoc with Atlas code editor --- ch10.asciidoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ch10.asciidoc b/ch10.asciidoc index ada24f0c..115f4ec3 100644 --- a/ch10.asciidoc +++ b/ch10.asciidoc @@ -416,7 +416,7 @@ With all the other fields filled, the block header is now complete and the proce ==== Proof-of-Work Algorithm -((("mining and consensus", "mining the block", "Proof-of-Work algorithm")))((("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 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 corollary, it is also virtually impossible to select an input in such a way as to produce a desired fingerprint, other than trying random inputs. +((("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 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 corollary, it is also virtually impossible to select an input in such a way as to produce a desired fingerprint, other than trying random inputs. With SHA256, the output is always 256 bits long, regardless of the size of the input. In <>, we will use the Python interpreter to calculate the SHA256 hash of the phrase, "I am Satoshi Nakamoto."