summaryrefslogtreecommitdiff
path: root/bip-0083.mediawiki
diff options
context:
space:
mode:
Diffstat (limited to 'bip-0083.mediawiki')
-rw-r--r--bip-0083.mediawiki2
1 files changed, 1 insertions, 1 deletions
diff --git a/bip-0083.mediawiki b/bip-0083.mediawiki
index c669001..8c6f444 100644
--- a/bip-0083.mediawiki
+++ b/bip-0083.mediawiki
@@ -83,7 +83,7 @@ We can continue creating subaccounts indefinitely using this scheme.
In order to create a bidirectional payment channel, it is necessary that previous commitments be revokable. In order to revoke previous commitments, each party reveals a secret to the other that would allow them to steal the funds in the channel if a transaction for a previous commitment is inserted into the blockchain.
-By allowing for arbitrary nesting of sublevels, we can construct decision trees of arbitrary depth and revoke an entire branch by revealing a parent node used to derive all the children.
+By allowing for arbitrary nesting of sublevels, we can construct decision trees of arbitrary depth and revoke an entire branch by revealing a parent node used to derive all the children.
==References==