From daca98d2633873d8928cc6460a8b6cb592d3d2bd Mon Sep 17 00:00:00 2001 From: claylock Date: Thu, 26 Oct 2023 18:04:56 +0000 Subject: [PATCH] Edited ch12_mining.adoc with Atlas code editor --- ch12_mining.adoc | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/ch12_mining.adoc b/ch12_mining.adoc index 16e6f595..fb430a15 100644 --- a/ch12_mining.adoc +++ b/ch12_mining.adoc @@ -778,6 +778,8 @@ numerically less than the target. If we decrease the target, the task of finding a hash that is less than the target becomes more and more difficult. +++++ +

To give a simple analogy, imagine a game where players throw a pair of dice repeatedly, trying to throw less than a specified target. In the first round, the target is 12. Unless you throw double-six, you win. In @@ -788,6 +790,8 @@ therefore be invalid. It takes more dice throws to win the lower the target gets. Eventually, when the target is 3 (the minimum possible), only one throw out of every 36, or about 3% of them, will produce a winning result. +

+++++ From the perspective of an observer who knows that the target of the dice game is 3, if someone has succeeded in casting a winning throw it