fixed bip32 algo to copy master key creation instead of private2private; added same warning to XPRV part

Author: avirgovi

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
 
@@ -193,7 +193,7 @@ Uses 256 bits of entropy as the secret exponent to derive a private key and enco
 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>.)
+> 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>.)
 
 Path format is <code>m/83696968'/2'/{index}'</code>
 
@@ -210,6 +210,11 @@ 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.
 
+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>R</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>.)
+
 Path format is <code>m/83696968'/32'/{index}'</code>
 
 INPUT: