diff options
| author | Jonas Schnelli <jonas.schnelli@include7.ch> | 2014-12-18 08:45:16 +0100 |
|---|---|---|
| committer | Jonas Schnelli <jonas.schnelli@include7.ch> | 2014-12-18 08:45:16 +0100 |
| commit | f44f68b93980d130f2f243b924c668414c05ad9b (patch) | |
| tree | b247bdf421cf2f35a41ca4d2f8dd0a8baaa92eb6 /bip-0032.mediawiki | |
| parent | 7d77befd2b14359b9386fc1f9fb15f82d418fb34 (diff) | |
| download | bips-f44f68b93980d130f2f243b924c668414c05ad9b.tar.xz | |
Bip32, fix missing parenthesis
reported by fenn on #bitcoin-dev [02:59:57]
Diffstat (limited to 'bip-0032.mediawiki')
| -rw-r--r-- | bip-0032.mediawiki | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/bip-0032.mediawiki b/bip-0032.mediawiki index b851e8f..7e84204 100644 --- a/bip-0032.mediawiki +++ b/bip-0032.mediawiki @@ -104,7 +104,7 @@ This is not possible. The next step is cascading several CKD constructions to build a tree. We start with one root, the master extended key m. By evaluating CKDpriv(m,i) for several values of i, we get a number of level-1 derived nodes. As each of these is again an extended key, CKDpriv can be applied to those as well. -To shorten notation, we will write CKDpriv(CKDpriv(CKDpriv(m,3<sub>H</sub>),2),5) as m/3<sub>H</sub>/2/5. Equivalently for public keys, we write CKDpub(CKDpub(CKDpub(M,3),2,5) as M/3/2/5. This results in the following identities: +To shorten notation, we will write CKDpriv(CKDpriv(CKDpriv(m,3<sub>H</sub>),2),5) as m/3<sub>H</sub>/2/5. Equivalently for public keys, we write CKDpub(CKDpub(CKDpub(M,3),2),5) as M/3/2/5. This results in the following identities: * N(m/a/b/c) = N(m/a/b)/c = N(m/a)/b/c = N(m)/a/b/c = M/a/b/c. * N(m/a<sub>H</sub>/b/c) = N(m/a<sub>H</sub>/b)/c = N(m/a<sub>H</sub>)/b/c. However, N(m/a<sub>H</sub>) cannot be rewritten as N(m)/a<sub>H</sub>, as the latter is not possible. |