From 29dae10d59787369419df13030d2b04e1844bffa Mon Sep 17 00:00:00 2001 From: "judymcconville@roadrunner.com" Date: Tue, 2 May 2017 11:15:49 -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 f3a5ae6a..2e369922 100644 --- a/ch10.asciidoc +++ b/ch10.asciidoc @@ -506,7 +506,7 @@ The Proof-of-Work must produce a hash that is _less than_ the target. A higher t ==== -Bitcoin's Proof-of-Work is very similar to the challenge shown in <>. The miner constructs a candidate block filled with transactions. Next, the miner calculates the hash of this block's header and sees if it is smaller than the current _target_. If the hash is not less than the target, the miner will modify the nonce (usually just incrementing it by one) and try again. At the current difficulty in the bitcoin network, miners have to try quadrillions of times before finding a nonce that results in a low enough block header hash. +((("targets")))Bitcoin's Proof-of-Work is very similar to the challenge shown in <>. The miner constructs a candidate block filled with transactions. Next, the miner calculates the hash of this block's header and sees if it is smaller than the current _target_. If the hash is not less than the target, the miner will modify the nonce (usually just incrementing it by one) and try again. At the current difficulty in the bitcoin network, miners have to try quadrillions of times before finding a nonce that results in a low enough block header hash. A very simplified Proof-of-Work algorithm is implemented in Python in <>.