From c00e7cd14ff5be1d907bb15fc4cdf447ba5d34ec Mon Sep 17 00:00:00 2001 From: claylock Date: Fri, 27 Oct 2023 12:05:20 +0000 Subject: [PATCH] Edited ch12_mining.adoc with Atlas code editor --- ch12_mining.adoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ch12_mining.adoc b/ch12_mining.adoc index aa28cc5a..bf9bb6af 100644 --- a/ch12_mining.adoc +++ b/ch12_mining.adoc @@ -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.