lsd0001

commit 24a4c54fee0ddf148296734de92141a26279deb7
parent b89f0346eea8a91398bbb5fca809d97f2091e222
Author: Christian Grothoff <christian@grothoff.org>
Date:   Fri, 30 Jun 2023 19:25:29 +0200

explain that applications MAY provide pows with higher D before going into implications

Diffstat:
M
draft-schanzen-gns.xml
 | 
7
+++++--

1 file changed, 5 insertions(+), 2 deletions(-)
diff --git a/draft-schanzen-gns.xml b/draft-schanzen-gns.xml
@@ -742,8 +742,11 @@ zTLD[126..129].zTLD[63..125].zTLD[0..62]
        </t>
        <t>
          Given an average difficulty of D, the proofs have an
-         expiration time of EPOCH. With each additional bit difficulty, the
-         lifetime of the proof is prolonged for another EPOCH.
+         expiration time of EPOCH.  Applications MAY calculate proofs
+         with a difficulty that is higher than D by providing POW
+         values where there are (on average) more than D bits of leading zeros.
+         With each additional bit of difficulty, the
+         lifetime of the proof is prolonged by another EPOCH.
          Consequently, by calculating a more difficult PoW, the lifetime of the
          proof can be increased on demand by the zone owner.
        </t>