summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPaul Sztorc <psztorc01@gmail.com>2018-04-23 19:15:13 -0400
committerPaul Sztorc <psztorc01@gmail.com>2019-09-20 10:19:46 -0700
commit3201b2311951652020e1d948362c24fcc06d6708 (patch)
treef4fc4a90ef6441fa8a04a0842b9e682fa387d219
parentdd02ff4c07736f4e95b9f69866acdb17428cdf2e (diff)
downloadbips-3201b2311951652020e1d948362c24fcc06d6708.tar.xz
typo
-rw-r--r--bip-hashrate-escrows.mediawiki2
1 files changed, 1 insertions, 1 deletions
diff --git a/bip-hashrate-escrows.mediawiki b/bip-hashrate-escrows.mediawiki
index 0a61b47..ae31e29 100644
--- a/bip-hashrate-escrows.mediawiki
+++ b/bip-hashrate-escrows.mediawiki
@@ -309,7 +309,7 @@ M4 is exceptional (in comparison to the other M's) in a few ways. First, its con
In fact, M4 can also be *nothing*. In other words, it may be optional. This is precisely because, from one block to the next, we have constrained D2 such that it is only allowed to change in a few ways. Therefore, the exhaustive set of "candidate D2s" can be precomputed by full nodes in advance.
-The following sections assume a maximum of one sucessful withdrawal per sidechain at a time (see [bip-hashrate-escrows/appendix-1.txt appendix 1]).
+The following sections assume a maximum of one sucessful withdrawal per sidechain at a time (see [/bip-hashrate-escrows/appendix-1.txt appendix 1]).
==== How Hard is it to Guess M4? ====