Merge pull request #934 from scgbckbone/fix_bip85

Fix bip85

1 files changed, 10 insertions, 8 deletions

diff --git a/bip-0085.mediawiki b/bip-0085.mediawiki
index 6a6a1c5..7c4cbca 100644
--- a/bip-0085.mediawiki
+++ b/bip-0085.mediawiki
@@ -147,7 +147,7 @@ Words Table
 |}
 
 ====12 English words====
-BIP39 English 12 word mnemonic seed 
+BIP39 English 12 word mnemonic seed
 
 128 bits of entropy as input to BIP39 to derive 12 word mnemonic
 
@@ -188,12 +188,7 @@ OUTPUT:
 ===HD-Seed WIF===
 Application number: 2'
 
-Uses 256 bits of entropy as the secret exponent to derive a private key and encode as a compressed WIF which will be used as the hdseed for Bitcoin Core wallets.
-
-There is a very small chance that you'll make an invalid key that is zero or bigger than the order of the curve. If this occurs, software should hard fail (forcing users should iterate to the next index).
-
-From BIP32:
-> In case parse<sub>256</sub>(I<sub>L</sub>) ≥ n or k<sub>i</sub> = 0, the resulting key is invalid, and one should proceed with the next value for i. (Note: this has probability lower than 1 in 2<sup>127</sup>.)
+Uses 256 bits[1] of entropy as the secret exponent to derive a private key and encode as a compressed WIF which will be used as the hdseed for Bitcoin Core wallets.
 
 Path format is <code>m/83696968'/2'/{index}'</code>
 
@@ -208,7 +203,7 @@ OUTPUT
 ===XPRV===
 Application number: 32'
 
-Taking 64 bytes of the HMAC digest, the first 32 bytes are the chain code, and second 32 bytes are the private key for BIP32 XPRV value. Child number, depth, and parent fingerprint are forced to zero.
+Taking 64 bytes of the HMAC digest, the first 32 bytes are the chain code, and second 32 bytes[1] are the private key for BIP32 XPRV value. Child number, depth, and parent fingerprint are forced to zero.
 
 Path format is <code>m/83696968'/32'/{index}'</code>
 
@@ -254,6 +249,13 @@ Many thanks to Peter Gray and Christopher Allen for their input, and to Peter fo
 
 BIP32, BIP39
 
+==Footnotes==
+
+[1] There is a very small chance that you'll make an invalid key that is zero or bigger than the order of the curve. If this occurs, software should hard fail (forcing users should iterate to the next index).
+
+From BIP32:
+> In case parse<sub>256</sub>(I<sub>L</sub>) is 0 or ≥ n, the resulting key is invalid, and one should proceed with the next value for i. (Note: this has probability lower than 1 in 2<sup>127</sup>.)
+
 ==Copyright==
 
 This BIP is dual-licensed under the Open Publication License and BSD 2-clause license.