commit 8e69ca0c24eac95f4122ae0dc8a35fbc7cbbb61a
parent 1869ead84c10dfafd36f18db2586a33d1a670204
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date: Wed, 16 Feb 2022 18:57:46 +0100
pow
Diffstat:
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/draft-schanzen-gns.xml b/draft-schanzen-gns.xml
@@ -582,7 +582,7 @@ zTLD := zkl[126..129].zkl[63..125].zkl[0..62]
</dd>
</dl>
<t>
- Traditionally, PoW schemes require to find a POW value such that
+ Usually, PoW schemes require to find one POW value such that
at least D leading zeroes are found in the hash result.
D is then referred to as the difficulty of the PoW.
In order to reduce the variance in time it takes to calculate the
