Difference between revisions of "BIP 0032"
Coincidental (talk | contribs) m |
m (Use monospace font for functions and variable names to make lower-case variables stand out, and upper-case 'i' and lower case 'L' more distinguishable) |
||
Line 3: | Line 3: | ||
RECENT CHANGES: | RECENT CHANGES: | ||
− | * [16 Apr 2013] Added private derivation for i >= 0x80000000 (less risk of parent private key leakage) | + | * [16 Apr 2013] Added private derivation for <tt>i >= 0x80000000</tt> (less risk of parent private key leakage) |
− | * [30 Apr 2013] Switched from multiplication by | + | * [30 Apr 2013] Switched from multiplication by <tt>I<sub>L</sub></tt> to addition of <tt>I<sub>L</sub></tt> (faster, easier implementation) |
* [25 May 2013] Added test vectors | * [25 May 2013] Added test vectors | ||
Line 41: | Line 41: | ||
* byte sequences | * byte sequences | ||
− | We shall denote the compressed form of point P by χ(P), which for secp256k1 will always be 33 bytes long. | + | We shall denote the compressed form of point <tt>P</tt> by <tt>χ(P)</tt>, which for secp256k1 will always be 33 bytes long. |
− | Addition (+) of two coordinates is defined as application of the EC group operation. Multiplication (*) of an integer and a coordinate is defined as repeated application of the EC group operation. The generator element of the curve is called G. The public key K corresponding to the private key k is calculated as k*G. We do not distinguish between numbers or coordinates and their serialization as byte sequences. | + | Addition (+) of two coordinates is defined as application of the EC group operation. Multiplication (*) of an integer and a coordinate is defined as repeated application of the EC group operation. The generator element of the curve is called <tt>G</tt>. The public key <tt>K</tt> corresponding to the private key <tt>k</tt> is calculated as <tt>k*G</tt>. We do not distinguish between numbers or coordinates and their serialization as byte sequences. |
===Extended keys=== | ===Extended keys=== | ||
Line 49: | Line 49: | ||
In what follows, we will define a function that derives a number of child keys from a parent key. In order to prevent these from depending solely on the key itself, we extend both private and public keys first with an extra 256 bits of entropy. This extension, called the chain code, is identical for corresponding private and public keys, and consists of 32 bytes. | In what follows, we will define a function that derives a number of child keys from a parent key. In order to prevent these from depending solely on the key itself, we extend both private and public keys first with an extra 256 bits of entropy. This extension, called the chain code, is identical for corresponding private and public keys, and consists of 32 bytes. | ||
− | We represent an extended private key as (k, c), with k the normal private key, and c the chain code. An extended public key is represented as (K, c), with K = k*G and c the chain code. | + | We represent an extended private key as <tt>(k, c)</tt>, with <tt>k</tt> the normal private key, and <tt>c</tt> the chain code. An extended public key is represented as <tt>(K, c)</tt>, with <tt>K = k*G</tt> and <tt>c</tt> the chain code. |
===Child key derivation functions=== | ===Child key derivation functions=== | ||
We allow for two different types of derivation: private and public. | We allow for two different types of derivation: private and public. | ||
− | * Private derivation: knowledge of the private key k<sub>par</sub> and c<sub>par</sub> is required to compute both k<sub>i</sub> and K<sub>i</sub>. | + | * Private derivation: knowledge of the private key <tt>k<sub>par</sub></tt> and <tt>c<sub>par</sub></tt> is required to compute both <tt>k<sub>i</sub></tt> and <tt>K<sub>i</sub></tt>. |
− | * Public derivation: knowledge of the public key K<sub>par</sub> and c<sub>par</sub> suffices to compute K<sub>i</sub> (but not k<sub>i</sub>). | + | * Public derivation: knowledge of the public key <tt>K<sub>par</sub></tt> and <tt>c<sub>par</sub></tt> suffices to compute <tt>K<sub>i</sub></tt> (but not <tt>k<sub>i</sub></tt>). |
We define the private and public child key derivation functions: | We define the private and public child key derivation functions: | ||
− | * CKD((k<sub>par</sub>, c<sub>par</sub>), i) → (k<sub>i</sub>, c<sub>i</sub>), defined for both private and public derivation. | + | * <tt>CKD((k<sub>par</sub>, c<sub>par</sub>), i) → (k<sub>i</sub>, c<sub>i</sub>)</tt>, defined for both private and public derivation. |
− | * CKD | + | * <tt>CKD′((K<sub>par</sub>, c<sub>par</sub>), i) → (K<sub>i</sub>, c<sub>i</sub>)</tt>, defined only for public derivation. |
− | We use the most significant bit of i to specify which type of derivation to use. i is encoded as a 32 bit unsigned integer, most significant byte first; '||' represents concatenation. | + | We use the most significant bit of <tt>i</tt> to specify which type of derivation to use. <tt>i</tt> is encoded as a 32 bit unsigned integer, most significant byte first; '||' represents concatenation. |
====Private child key derivation==== | ====Private child key derivation==== | ||
− | To define CKD((k<sub>par</sub>, c<sub>par</sub>), i) → (k<sub>i</sub>, c<sub>i</sub>): | + | To define <tt>CKD((k<sub>par</sub>, c<sub>par</sub>), i) → (k<sub>i</sub>, c<sub>i</sub>)</tt>: |
− | * Check whether the highest bit (0x80000000) of i is set: | + | * Check whether the highest bit (<tt>0x80000000</tt>) of <tt>i</tt> is set: |
− | ** If 1, private derivation is used: let I = HMAC-SHA512(Key = c<sub>par</sub>, Data = 0x00 || k<sub>par</sub> || i) [Note: The 0x00 pads the private key to make it 33 bytes long.] | + | ** If 1, private derivation is used: let <tt>I = HMAC-SHA512(Key = c<sub>par</sub>, Data = 0x00 || k<sub>par</sub> || i)</tt> [Note: The 0x00 pads the private key to make it 33 bytes long.] |
− | ** If 0, public derivation is used: let I = HMAC-SHA512(Key = c<sub>par</sub>, Data = χ(k<sub>par</sub>*G) || i) | + | ** If 0, public derivation is used: let <tt>I = HMAC-SHA512(Key = c<sub>par</sub>, Data = χ(k<sub>par</sub>*G) || i)</tt> |
− | * Split I = I<sub>L</sub> || I<sub>R</sub> into two 32-byte sequences, I<sub>L</sub> and I<sub>R</sub>. | + | * Split <tt>I = I<sub>L</sub> || I<sub>R</sub></tt> into two 32-byte sequences, <tt>I<sub>L</sub></tt> and <tt>I<sub>R</sub></tt>. |
− | * k<sub>i</sub> = I<sub>L</sub> + k<sub>par</sub> (mod n). | + | * <tt>k<sub>i</sub> = I<sub>L</sub> + k<sub>par</sub> (mod n)</tt>. |
− | * c<sub>i</sub> = I<sub>R</sub>. | + | * <tt>c<sub>i</sub> = I<sub>R</sub></tt>. |
− | In case 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. | + | In case <tt>I<sub>L</sub> ≥ n</tt> or <tt>k<sub>i</sub> = 0</tt>, the resulting key is invalid, and one should proceed with the next value for <tt>i</tt>. |
[Note: this has probability lower than 1 in 2<sup>127</sup>.] | [Note: this has probability lower than 1 in 2<sup>127</sup>.] | ||
====Public child key derivation==== | ====Public child key derivation==== | ||
− | To define CKD | + | To define <tt>CKD′((K<sub>par</sub>, c<sub>par</sub>), i) → (K<sub>i</sub>, c<sub>i</sub>)</tt>: |
− | * Check whether the highest bit (0x80000000) of i is set: | + | * Check whether the highest bit (<tt>0x80000000</tt>) of <tt>i</tt> is set: |
** If 1, return error | ** If 1, return error | ||
− | ** If 0, let I = HMAC-SHA512(Key = c<sub>par</sub>, Data = χ(K<sub>par</sub>) || i) | + | ** If 0, let <tt>I = HMAC-SHA512(Key = c<sub>par</sub>, Data = χ(K<sub>par</sub>) || i)</tt> |
− | * Split I = I<sub>L</sub> || I<sub>R</sub> into two 32-byte sequences, I<sub>L</sub> and I<sub>R</sub>. | + | * Split <tt>I = I<sub>L</sub> || I<sub>R</sub></tt> into two 32-byte sequences, <tt>I<sub>L</sub></tt> and <tt>I<sub>R</sub></tt>. |
− | * K<sub>i</sub> = (I<sub>L</sub> + k<sub>par</sub>)*G = I<sub>L</sub>*G + K<sub>par</sub> | + | * <tt>K<sub>i</sub> = (I<sub>L</sub> + k<sub>par</sub>)*G = I<sub>L</sub>*G + K<sub>par</sub></tt> |
− | * c<sub>i</sub> = I<sub>R</sub>. | + | * <tt>c<sub>i</sub> = I<sub>R</sub></tt>. |
− | In case I<sub>L</sub> ≥ n or K<sub>i</sub> is the point at infinity, the resulting key is invalid, and one should proceed with the next value for i. | + | In case <tt>I<sub>L</sub> ≥ n</tt> or <tt>K<sub>i</sub></tt> is the point at infinity, the resulting key is invalid, and one should proceed with the next value for <tt>i</tt>. |
− | Note that the extended public key corresponding to the evaluation of CKD(k<sub>ext</sub>, i) with public derivation (so with i < 0x80000000) is identical to the evaluation of CKD | + | Note that the extended public key corresponding to the evaluation of <tt>CKD(k<sub>ext</sub>, i)</tt> with public derivation (so with <tt>i < 0x80000000</tt>) is identical to the evaluation of <tt>CKD′(K<sub>ext</sub>, i)</tt>, with <tt>K<sub>ext</sub></tt> the extended public key corresponding to <tt>k<sub>ext</sub></tt>. Symbolically, <tt>CKD((k, c), i)*G = CKD'((k*G, c), i)</tt>. This implies that <tt>CKD'</tt> can be used to derive all public keys corresponding to the private keys that <tt>CKD</tt> would find. It cannot be used to retrieve the private keys, however. |
The HMAC-SHA512 function is specified in [http://tools.ietf.org/html/rfc4231 RFC 4231]. | The HMAC-SHA512 function is specified in [http://tools.ietf.org/html/rfc4231 RFC 4231]. | ||
Line 92: | Line 92: | ||
===The key tree=== | ===The key tree=== | ||
− | The next step is cascading several CKD constructions to build a tree. We start with one root, the master extended key m. By evaluating CKD(m,i) for several values of i, we get a number of first-degree derivative nodes. As each of these is again an extended key, CKD can be applied to those as well. To shorten notation, we will write CKD(CKD(CKD(m,0x8000003),0x2),0x5) as m/3 | + | The next step is cascading several <tt>CKD</tt> constructions to build a tree. We start with one root, the master extended key <tt>m</tt>. By evaluating <tt>CKD(m,i)</tt> for several values of <tt>i</tt>, we get a number of first-degree derivative nodes. As each of these is again an extended key, <tt>CKD</tt> can be applied to those as well. To shorten notation, we will write <tt>CKD(CKD(CKD(m,0x8000003),0x2),0x5)</tt> as <tt>m/3′/2/5</tt> now. |
Each leaf node in the tree corresponds to an actual keypair, while the internal nodes correspond to the collection of keypairs that descends from them. The chain codes of the leaf nodes are ignored, and only their embedded private or public key is used. Because of this construction, knowing an extended private key allows reconstruction of all descendant private keys and public keys, and knowing an extended public keys allows reconstruction of all descendant public keys derived using public derivation. | Each leaf node in the tree corresponds to an actual keypair, while the internal nodes correspond to the collection of keypairs that descends from them. The chain codes of the leaf nodes are ignored, and only their embedded private or public key is used. Because of this construction, knowing an extended private key allows reconstruction of all descendant private keys and public keys, and knowing an extended public keys allows reconstruction of all descendant public keys derived using public derivation. | ||
Line 105: | Line 105: | ||
Extended public and private keys are serialized as follows: | Extended public and private keys are serialized as follows: | ||
− | * 4 byte: version bytes (mainnet: 0x0488B21E public, 0x0488ADE4 private; testnet: 0x043587CF public, 0x04358394 private) | + | * 4 byte: version bytes (mainnet: <tt>0x0488B21E</tt> public, <tt>0x0488ADE4</tt> private; testnet: <tt>0x043587CF</tt> public, <tt>0x04358394</tt> private) |
− | * 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, .... | + | * 1 byte: depth: <tt>0x00</tt> for master nodes, <tt>0x01</tt> for level-1 descendants, .... |
− | * 4 bytes: the fingerprint of the parent's key (0x00000000 if master key) | + | * 4 bytes: the fingerprint of the parent's key (<tt>0x00000000</tt> if master key) |
− | * 4 bytes: child number. This is the number i in x<sub>i</sub> = x<sub>par</sub>/i, with x<sub>i</sub> the key being serialized. This is encoded in MSB order. (0x00000000 if master key) | + | * 4 bytes: child number. This is the number <tt>i</tt> in <tt>x<sub>i</sub> = x<sub>par</sub>/i</tt>, with <tt>x<sub>i</sub></tt> the key being serialized. This is encoded in MSB order. (<tt>0x00000000</tt> if master key) |
* 32 bytes: the chain code | * 32 bytes: the chain code | ||
− | * 33 bytes: the public key or private key data (0x02 + X or 0x03 + X for public keys, 0x00 + k for private keys) | + | * 33 bytes: the public key or private key data (<tt>0x02 + X</tt> or <tt>0x03 + X</tt> for public keys, <tt>0x00 + k</tt> for private keys) |
This 78 byte structure can be encoded like other Bitcoin data in Base58, by first adding 32 checksum bits (derived from the double SHA-256 checksum), and then converting to the Base58 representation. This results in a Base58-encoded string of up to 112 characters. Because of the choice of the version bytes, the Base58 representation will start with "xprv" or "xpub" on mainnet, "tprv" or "tpub" on testnet. | This 78 byte structure can be encoded like other Bitcoin data in Base58, by first adding 32 checksum bits (derived from the double SHA-256 checksum), and then converting to the Base58 representation. This results in a Base58-encoded string of up to 112 characters. Because of the choice of the version bytes, the Base58 representation will start with "xprv" or "xpub" on mainnet, "tprv" or "tpub" on testnet. | ||
Line 120: | Line 120: | ||
===Master key generation=== | ===Master key generation=== | ||
− | The total number of possible extended keypairs is almost 2 | + | The total number of possible extended keypairs is almost 2<sup>512</sup>, but the produced keys are only 256 bits long, and offer about half of that in terms of security. Therefore, master keys are not generated directly, but instead from a potentially short seed value. |
* Generate a seed S of a chosen length (at least 128 bits, but 256 is advised) from a (P)RNG. | * Generate a seed S of a chosen length (at least 128 bits, but 256 is advised) from a (P)RNG. | ||
− | * Calculate I = HMAC-SHA512(key="Bitcoin seed", msg=S) | + | * Calculate <tt>I = HMAC-SHA512(key="Bitcoin seed", msg=S)</tt> |
− | * Split I into two 32-byte sequences, I<sub>L</sub> and I<sub>R</sub>. | + | * Split <tt>I</tt> into two 32-byte sequences, <tt>I<sub>L</sub></tt> and <tt>I<sub>R</sub></tt>. |
− | * Use I<sub>L</sub> as master secret key, and I<sub>R</sub> as master chain code. | + | * Use <tt>I<sub>L</sub></tt> as master secret key, and <tt>I<sub>R</sub></tt> as master chain code. |
− | In case I<sub>L</sub> is 0 or >=n, the master key is invalid. | + | In case <tt>I<sub>L</sub></tt> is 0 or <tt>>=n</tt>, the master key is invalid. |
[[File:BIP32-derivation.png]] | [[File:BIP32-derivation.png]] | ||
Line 138: | Line 138: | ||
Each account is composed of two keypair chains: an internal and an external one. The external [[keychain]] is used to generate new public addresses, while the internal keychain is used for all other operations (change addresses, generation addresses, ..., anything that doesn't need to be communicated). Clients that do not support separate keychains for these should use the external one for everything. | Each account is composed of two keypair chains: an internal and an external one. The external [[keychain]] is used to generate new public addresses, while the internal keychain is used for all other operations (change addresses, generation addresses, ..., anything that doesn't need to be communicated). Clients that do not support separate keychains for these should use the external one for everything. | ||
− | * m/i | + | * <tt>m/i′/0/k</tt> corresponds to the <tt>k</tt>'th keypair of the external chain of account number <tt>i</tt> of the HDW derived from master m. |
− | * m/i | + | * <tt>m/i′/1/k</tt> corresponds to the <tt>k</tt>'th keypair of the internal chain of account number <tt>i</tt> of the HDW derived from master m. |
===Use cases=== | ===Use cases=== | ||
− | ====Full wallet sharing: m==== | + | ====Full wallet sharing: <tt>m</tt>==== |
− | In cases where two systems need to access a single shared wallet, and both need to be able to perform spendings, one needs to share the master private extended key. Nodes can keep a pool of N look-ahead keys cached for external chains, to watch for incoming payments. The look-ahead for internal chains can be very small, as no gaps are to be expected here. An extra look-ahead could be active for the first unused account's chains - triggering the creation of a new account when used. Note that the name of the account will still need to be entered manually and cannot be synchronized via the block chain. | + | In cases where two systems need to access a single shared wallet, and both need to be able to perform spendings, one needs to share the master private extended key. Nodes can keep a pool of <tt>N</tt> look-ahead keys cached for external chains, to watch for incoming payments. The look-ahead for internal chains can be very small, as no gaps are to be expected here. An extra look-ahead could be active for the first unused account's chains - triggering the creation of a new account when used. Note that the name of the account will still need to be entered manually and cannot be synchronized via the block chain. |
− | ====Audits: M==== | + | ====Audits: <tt>M</tt>==== |
In case an auditor needs full access to the list of incoming and outgoing payments, one can share the master public extended key. This will allow the auditor to see all transactions from and to the wallet, in all accounts, but not a single secret key. | In case an auditor needs full access to the list of incoming and outgoing payments, one can share the master public extended key. This will allow the auditor to see all transactions from and to the wallet, in all accounts, but not a single secret key. | ||
− | ====Per-office balances: m/i | + | ====Per-office balances: <tt>m/i′</tt>==== |
When a business has several independent offices, they can all use wallets derived from a single master. This will allow the headquarters to maintain a super-wallet that sees all incoming and outgoing transactions of all offices, and even permit moving money between the offices. | When a business has several independent offices, they can all use wallets derived from a single master. This will allow the headquarters to maintain a super-wallet that sees all incoming and outgoing transactions of all offices, and even permit moving money between the offices. | ||
− | ====Recurrent business-to-business transactions: M/i | + | ====Recurrent business-to-business transactions: <tt>M/i′/0</tt>==== |
− | In case two business partners often transfer money, one can use the extended public key for the external chain of a specific account (M/i | + | In case two business partners often transfer money, one can use the extended public key for the external chain of a specific account (<tt>M/i′/0</tt>) as a sort of "super address", allowing frequent transactions that cannot (easily) be associated, but without needing to request a new address for each payment. |
Such a mechanism could also be used by mining pool operators as variable payout address. | Such a mechanism could also be used by mining pool operators as variable payout address. | ||
− | ====Unsecure money receiver: M/i | + | ====Unsecure money receiver: <tt>M/i′/0</tt>==== |
When an unsecure webserver is used to run an e-commerce site, it needs to know public addresses that be used to receive payments. The webserver only needs to know the public extended key of the external chain of a single account. This means someone illegally obtaining access to the webserver can at most see all incoming payments, but will not (trivially) be able to distinguish outgoing transactions, nor see payments received by other webservers if there are several ones. | When an unsecure webserver is used to run an e-commerce site, it needs to know public addresses that be used to receive payments. The webserver only needs to know the public extended key of the external chain of a single account. This means someone illegally obtaining access to the webserver can at most see all incoming payments, but will not (trivially) be able to distinguish outgoing transactions, nor see payments received by other webservers if there are several ones. | ||
Line 171: | Line 171: | ||
In addition to the expectations from the EC public-key cryptography itself: | In addition to the expectations from the EC public-key cryptography itself: | ||
− | * Given a public key K, an attacker cannot find the corresponding private key more efficiently than by solving the EC discrete logarithm problem (assumed to require 2<sup>128</sup> group operations). | + | * Given a public key <tt>K</tt>, an attacker cannot find the corresponding private key more efficiently than by solving the EC discrete logarithm problem (assumed to require 2<sup>128</sup> group operations). |
the intended security properties of this standard are: | the intended security properties of this standard are: | ||
− | * Given a child extended private key (k<sub>i</sub>,c<sub>i</sub>) and the integer i, an attacker cannot find the parent private key k<sub>par</sub> more efficiently than a 2<sup>256</sup> brute force of HMAC-SHA512. | + | * Given a child extended private key <tt>(k<sub>i</sub>,c<sub>i</sub>)</tt> and the integer <tt>i</tt>, an attacker cannot find the parent private key <tt>k<sub>par</sub></tt> more efficiently than a 2<sup>256</sup> brute force of HMAC-SHA512. |
− | * Given any number (2 <= N <= 2<sup>32</sup>-1) of (index, extended private key) tuples (i<sub>j</sub>,(p<sub>j</sub>,c<sub>j</sub>)), with distinct i<sub>j</sub>'s, determining whether they are derived from a common parent extended private key (i.e., whether there exists a (p<sub>par</sub>,c<sub>par</sub>) such that for each j in [0..N-1] CKD((p<sub>par</sub>,c<sub>par</sub>),i<sub>j</sub>)=(p<sub>j</sub>,c<sub>j</sub>)), cannot be done more efficiently than a 2<sup>256</sup> brute force of HMAC-SHA512. | + | * Given any number (<tt>2 <= N <= 2<sup>32</sup>-1</tt>) of (index, extended private key) tuples (<tt>i<sub>j</sub>,(p<sub>j</sub>,c<sub>j</sub>)</tt>), with distinct <tt>i<sub>j</sub></tt>'s, determining whether they are derived from a common parent extended private key (i.e., whether there exists a <tt>(p<sub>par</sub>,c<sub>par</sub>)</tt> such that for each <tt>j</tt> in <tt>[0..N-1] CKD((p<sub>par</sub>,c<sub>par</sub>),i<sub>j</sub>)=(p<sub>j</sub>,c<sub>j</sub>))</tt>, cannot be done more efficiently than a 2<sup>256</sup> brute force of HMAC-SHA512. |
Note however that the following properties does not exist: | Note however that the following properties does not exist: | ||
− | * Given a parent extended public key (K<sub>par</sub>,c<sub>par</sub>) and a child public key (K<sub>i</sub>), it is hard to find i. | + | * Given a parent extended public key <tt>(K<sub>par</sub>,c<sub>par</sub>)</tt> and a child public key <tt>(K<sub>i</sub>)</tt>, it is hard to find <tt>i</tt>. |
− | * Given a parent extended public key (K<sub>par</sub>,c<sub>par</sub>) and a child private key (k<sub>i</sub>) using public derivation, it is hard to find k<sub>par</sub>. | + | * Given a parent extended public key <tt>(K<sub>par</sub>,c<sub>par</sub>)</tt> and a child private key <tt>(k<sub>i</sub>)</tt> using public derivation, it is hard to find <tt>k<sub>par</sub></tt>. |
Private and public keys must be kept safe as usual. Leaking a private key means access to coins - leaking a public key can mean loss of privacy. | Private and public keys must be kept safe as usual. Leaking a private key means access to coins - leaking a public key can mean loss of privacy. |
Revision as of 00:13, 30 October 2013
This page describes a BIP (Bitcoin Improvement Proposal). |
RECENT CHANGES:
- [16 Apr 2013] Added private derivation for i >= 0x80000000 (less risk of parent private key leakage)
- [30 Apr 2013] Switched from multiplication by I_{L} to addition of I_{L} (faster, easier implementation)
- [25 May 2013] Added test vectors
BIP: 32 Title: Hierarchical Deterministic Wallets Author: Pieter Wuille Status: Accepted Type: Informational Created: 11-02-2012
Contents
Abstract
This document describes hierarchical determinstic wallets (or "HD Wallets"): wallets which can be shared partially or entirely with different systems, each with or without the ability to spend coins.
The specification is intended to set a standard for deterministic wallets that can be interchanged between different clients. Although the wallets described here have many features, not all are required by supporting clients.
The specification consists of two parts. In a first part, a system for deriving a tree of keypairs from a single seed is presented. The second part demonstrates how to build a wallet structure on top of such a tree.
Motivation
The Bitcoin reference client uses randomly generated keys. In order to avoid the necessity for a backup after every transaction, (by default) 100 keys are cached in a pool of reserve keys. Still, these wallets are not intended to be shared and used on several systems simultaneously. They support hiding their private keys by using the wallet encrypt feature and not sharing the password, but such "neutered" wallets lose the power to generate public keys as well.
Deterministic wallets do not require such frequent backups, and elliptic curve mathematics permit schemes where one can calculate the public keys without revealing the private keys. This permits for example a webshop business to let its webserver generate fresh addresses (public key hashes) for each order or for each customer, without giving the webserver access to the corresponding private keys (which are required for spending the received funds).
However, deterministic wallets typically consist of a single "chain" of keypairs. The fact that there is only one chain means that sharing a wallet happens on an all-or-nothing basis. However, in some cases one only wants some (public) keys to be shared and recoverable. In the example of a webshop, the webserver does not need access to all public keys of the merchant's wallet; only to those addresses which are used to receive customer's payments, and not for example the change addresses that are generated when the merchant spends money. Hierarchical deterministic wallets allow such selective sharing by supporting multiple keypair chains, derived from a single root.
Specification: Key derivation
Conventions
In the rest of this text we will assume the public key cryptography used in Bitcoin, namely elliptic curve cryptography using the field and curve parameters defined by secp256k1 (http://www.secg.org/index.php?action=secg,docs_secg). Variables below are either:
- integers modulo the order of the curve (referred to as n), serialized as 32 bytes, most significant byte first.
- coordinates of points on the curve, serialized as specified in SEC1 in compressed form: [0x02 or 0x03] + 32 byte x coordinate), where the header byte depends on the parity of the omitted y coordinate.
- byte sequences
We shall denote the compressed form of point P by χ(P), which for secp256k1 will always be 33 bytes long.
Addition (+) of two coordinates is defined as application of the EC group operation. Multiplication (*) of an integer and a coordinate is defined as repeated application of the EC group operation. The generator element of the curve is called G. The public key K corresponding to the private key k is calculated as k*G. We do not distinguish between numbers or coordinates and their serialization as byte sequences.
Extended keys
In what follows, we will define a function that derives a number of child keys from a parent key. In order to prevent these from depending solely on the key itself, we extend both private and public keys first with an extra 256 bits of entropy. This extension, called the chain code, is identical for corresponding private and public keys, and consists of 32 bytes.
We represent an extended private key as (k, c), with k the normal private key, and c the chain code. An extended public key is represented as (K, c), with K = k*G and c the chain code.
Child key derivation functions
We allow for two different types of derivation: private and public.
- Private derivation: knowledge of the private key k_{par} and c_{par} is required to compute both k_{i} and K_{i}.
- Public derivation: knowledge of the public key K_{par} and c_{par} suffices to compute K_{i} (but not k_{i}).
We define the private and public child key derivation functions:
- CKD((k_{par}, c_{par}), i) → (k_{i}, c_{i}), defined for both private and public derivation.
- CKD′((K_{par}, c_{par}), i) → (K_{i}, c_{i}), defined only for public derivation.
We use the most significant bit of i to specify which type of derivation to use. i is encoded as a 32 bit unsigned integer, most significant byte first; '||' represents concatenation.
Private child key derivation
To define CKD((k_{par}, c_{par}), i) → (k_{i}, c_{i}):
- Check whether the highest bit (0x80000000) of i is set:
- If 1, private derivation is used: let I = HMAC-SHA512(Key = c_{par}, Data = 0x00 || k_{par} || i) [Note: The 0x00 pads the private key to make it 33 bytes long.]
- If 0, public derivation is used: let I = HMAC-SHA512(Key = c_{par}, Data = χ(k_{par}*G) || i)
- Split I = I_{L} || I_{R} into two 32-byte sequences, I_{L} and I_{R}.
- k_{i} = I_{L} + k_{par} (mod n).
- c_{i} = I_{R}.
In case I_{L} ≥ n or k_{i} = 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^{127}.]
Public child key derivation
To define CKD′((K_{par}, c_{par}), i) → (K_{i}, c_{i}):
- Check whether the highest bit (0x80000000) of i is set:
- If 1, return error
- If 0, let I = HMAC-SHA512(Key = c_{par}, Data = χ(K_{par}) || i)
- Split I = I_{L} || I_{R} into two 32-byte sequences, I_{L} and I_{R}.
- K_{i} = (I_{L} + k_{par})*G = I_{L}*G + K_{par}
- c_{i} = I_{R}.
In case I_{L} ≥ n or K_{i} is the point at infinity, the resulting key is invalid, and one should proceed with the next value for i.
Note that the extended public key corresponding to the evaluation of CKD(k_{ext}, i) with public derivation (so with i < 0x80000000) is identical to the evaluation of CKD′(K_{ext}, i), with K_{ext} the extended public key corresponding to k_{ext}. Symbolically, CKD((k, c), i)*G = CKD'((k*G, c), i). This implies that CKD' can be used to derive all public keys corresponding to the private keys that CKD would find. It cannot be used to retrieve the private keys, however.
The HMAC-SHA512 function is specified in RFC 4231.
The key tree
The next step is cascading several CKD constructions to build a tree. We start with one root, the master extended key m. By evaluating CKD(m,i) for several values of i, we get a number of first-degree derivative nodes. As each of these is again an extended key, CKD can be applied to those as well. To shorten notation, we will write CKD(CKD(CKD(m,0x8000003),0x2),0x5) as m/3′/2/5 now.
Each leaf node in the tree corresponds to an actual keypair, while the internal nodes correspond to the collection of keypairs that descends from them. The chain codes of the leaf nodes are ignored, and only their embedded private or public key is used. Because of this construction, knowing an extended private key allows reconstruction of all descendant private keys and public keys, and knowing an extended public keys allows reconstruction of all descendant public keys derived using public derivation.
Key identifiers
Extended keys can be identified by the Hash160 (RIPEMD160 after SHA256) of the serialized public key, ignoring the chain code. This corresponds exactly to the data used in traditional Bitcoin addresses. It is not advised to represent this data in base58 format though, as it may be interpreted as an address that way (and wallet software is not required to accept payment to the chain key itself).
The first 32 bits of the identifier are called the fingerprint.
Serialization format
Extended public and private keys are serialized as follows:
- 4 byte: version bytes (mainnet: 0x0488B21E public, 0x0488ADE4 private; testnet: 0x043587CF public, 0x04358394 private)
- 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, ....
- 4 bytes: the fingerprint of the parent's key (0x00000000 if master key)
- 4 bytes: child number. This is the number i in x_{i} = x_{par}/i, with x_{i} the key being serialized. This is encoded in MSB order. (0x00000000 if master key)
- 32 bytes: the chain code
- 33 bytes: the public key or private key data (0x02 + X or 0x03 + X for public keys, 0x00 + k for private keys)
This 78 byte structure can be encoded like other Bitcoin data in Base58, by first adding 32 checksum bits (derived from the double SHA-256 checksum), and then converting to the Base58 representation. This results in a Base58-encoded string of up to 112 characters. Because of the choice of the version bytes, the Base58 representation will start with "xprv" or "xpub" on mainnet, "tprv" or "tpub" on testnet.
Note that the fingerprint of the parent only serves as a fast way to detect parent and child nodes in software, and software must be willing to deal with collisions. Internally, the full 160-bit identifier could be used.
When importing a serialized extended public key, implementations must verify whether the X coordinate in the public key data corresponds to a point on the curve. If not, the extended public key is invalid.
Master key generation
The total number of possible extended keypairs is almost 2^{512}, but the produced keys are only 256 bits long, and offer about half of that in terms of security. Therefore, master keys are not generated directly, but instead from a potentially short seed value.
- Generate a seed S of a chosen length (at least 128 bits, but 256 is advised) from a (P)RNG.
- Calculate I = HMAC-SHA512(key="Bitcoin seed", msg=S)
- Split I into two 32-byte sequences, I_{L} and I_{R}.
- Use I_{L} as master secret key, and I_{R} as master chain code.
In case I_{L} is 0 or >=n, the master key is invalid.
Specification: Wallet structure
The previous sections specified key trees and their nodes. The next step is imposing a wallet structure on this tree. The layout defined in this section is a default only, though clients are encouraged to mimick it for compatibility, even if not all features are supported.
An HDW is organized as several 'accounts'. Accounts are numbered, the default account ("") being number 0. Clients are not required to support more than one account - if not, they only use the default account.
Each account is composed of two keypair chains: an internal and an external one. The external keychain is used to generate new public addresses, while the internal keychain is used for all other operations (change addresses, generation addresses, ..., anything that doesn't need to be communicated). Clients that do not support separate keychains for these should use the external one for everything.
* m/i′/0/k corresponds to the k'th keypair of the external chain of account number i of the HDW derived from master m. * m/i′/1/k corresponds to the k'th keypair of the internal chain of account number i of the HDW derived from master m.
Use cases
Full wallet sharing: m
In cases where two systems need to access a single shared wallet, and both need to be able to perform spendings, one needs to share the master private extended key. Nodes can keep a pool of N look-ahead keys cached for external chains, to watch for incoming payments. The look-ahead for internal chains can be very small, as no gaps are to be expected here. An extra look-ahead could be active for the first unused account's chains - triggering the creation of a new account when used. Note that the name of the account will still need to be entered manually and cannot be synchronized via the block chain.
Audits: M
In case an auditor needs full access to the list of incoming and outgoing payments, one can share the master public extended key. This will allow the auditor to see all transactions from and to the wallet, in all accounts, but not a single secret key.
Per-office balances: m/i′
When a business has several independent offices, they can all use wallets derived from a single master. This will allow the headquarters to maintain a super-wallet that sees all incoming and outgoing transactions of all offices, and even permit moving money between the offices.
Recurrent business-to-business transactions: M/i′/0
In case two business partners often transfer money, one can use the extended public key for the external chain of a specific account (M/i′/0) as a sort of "super address", allowing frequent transactions that cannot (easily) be associated, but without needing to request a new address for each payment. Such a mechanism could also be used by mining pool operators as variable payout address.
Unsecure money receiver: M/i′/0
When an unsecure webserver is used to run an e-commerce site, it needs to know public addresses that be used to receive payments. The webserver only needs to know the public extended key of the external chain of a single account. This means someone illegally obtaining access to the webserver can at most see all incoming payments, but will not (trivially) be able to distinguish outgoing transactions, nor see payments received by other webservers if there are several ones.
Compatibility
To comply with this standard, a client must at least be able to import an extended public or private key, to give access to its direct descendants as wallet keys. The wallet structure (master/account/chain/subchain) presented in the second part of the specification is advisory only, but is suggested as a minimal structure for easy compatibility - even when no separate accounts or distinction between internal and external chains is made. However, implementations may deviate from it for specific needs; more complex applications may call for a more complex tree structure.
Security
In addition to the expectations from the EC public-key cryptography itself:
- Given a public key K, an attacker cannot find the corresponding private key more efficiently than by solving the EC discrete logarithm problem (assumed to require 2^{128} group operations).
the intended security properties of this standard are:
- Given a child extended private key (k_{i},c_{i}) and the integer i, an attacker cannot find the parent private key k_{par} more efficiently than a 2^{256} brute force of HMAC-SHA512.
- Given any number (2 <= N <= 2^{32}-1) of (index, extended private key) tuples (i_{j},(p_{j},c_{j})), with distinct i_{j}'s, determining whether they are derived from a common parent extended private key (i.e., whether there exists a (p_{par},c_{par}) such that for each j in [0..N-1] CKD((p_{par},c_{par}),i_{j})=(p_{j},c_{j})), cannot be done more efficiently than a 2^{256} brute force of HMAC-SHA512.
Note however that the following properties does not exist:
- Given a parent extended public key (K_{par},c_{par}) and a child public key (K_{i}), it is hard to find i.
- Given a parent extended public key (K_{par},c_{par}) and a child private key (k_{i}) using public derivation, it is hard to find k_{par}.
Private and public keys must be kept safe as usual. Leaking a private key means access to coins - leaking a public key can mean loss of privacy.
Somewhat more care must be taken regarding extended keys, as these correspond to an entire (sub)tree of keys. One weakness that may not be immediately obvious, is that knowledge of the extended public key + a private key descending from it is equivalent to knowing the extended private key (i.e., every private and public key) in case public derivation is used. This means that extended public keys must be treated more carefully than regular public keys. This is the reason why accounts at the first level of the default wallet layout use private derivation, so a leak of account-specific (or below) private key never risks compromising the master.
Test Vectors
For more detailed information about these (such as intermediate values and other representations), see BIP_0032_TestVectors
Test vector 1
Master (hex): 000102030405060708090a0b0c0d0e0f * [Chain m] * ext pub: xpub661MyMwAqRbcFtXgS5sYJABqqG9YLmC4Q1Rdap9gSE8NqtwybGhePY2gZ29ESFjqJoCu1Rupje8YtGqsefD265TMg7usUDFdp6W1EGMcet8 * ext prv: xprv9s21ZrQH143K3QTDL4LXw2F7HEK3wJUD2nW2nRk4stbPy6cq3jPPqjiChkVvvNKmPGJxWUtg6LnF5kejMRNNU3TGtRBeJgk33yuGBxrMPHi * [Chain m/0'] * ext pub: xpub68Gmy5EdvgibQVfPdqkBBCHxA5htiqg55crXYuXoQRKfDBFA1WEjWgP6LHhwBZeNK1VTsfTFUHCdrfp1bgwQ9xv5ski8PX9rL2dZXvgGDnw * ext prv: xprv9uHRZZhk6KAJC1avXpDAp4MDc3sQKNxDiPvvkX8Br5ngLNv1TxvUxt4cV1rGL5hj6KCesnDYUhd7oWgT11eZG7XnxHrnYeSvkzY7d2bhkJ7 * [Chain m/0'/1] * ext pub: xpub6ASuArnXKPbfEwhqN6e3mwBcDTgzisQN1wXN9BJcM47sSikHjJf3UFHKkNAWbWMiGj7Wf5uMash7SyYq527Hqck2AxYysAA7xmALppuCkwQ * ext prv: xprv9wTYmMFdV23N2TdNG573QoEsfRrWKQgWeibmLntzniatZvR9BmLnvSxqu53Kw1UmYPxLgboyZQaXwTCg8MSY3H2EU4pWcQDnRnrVA1xe8fs * [Chain m/0'/1/2'] * ext pub: xpub6D4BDPcP2GT577Vvch3R8wDkScZWzQzMMUm3PWbmWvVJrZwQY4VUNgqFJPMM3No2dFDFGTsxxpG5uJh7n7epu4trkrX7x7DogT5Uv6fcLW5 * ext prv: xprv9z4pot5VBttmtdRTWfWQmoH1taj2axGVzFqSb8C9xaxKymcFzXBDptWmT7FwuEzG3ryjH4ktypQSAewRiNMjANTtpgP4mLTj34bhnZX7UiM * [Chain m/0'/1/2'/2] * ext pub: xpub6FHa3pjLCk84BayeJxFW2SP4XRrFd1JYnxeLeU8EqN3vDfZmbqBqaGJAyiLjTAwm6ZLRQUMv1ZACTj37sR62cfN7fe5JnJ7dh8zL4fiyLHV * ext prv: xprvA2JDeKCSNNZky6uBCviVfJSKyQ1mDYahRjijr5idH2WwLsEd4Hsb2Tyh8RfQMuPh7f7RtyzTtdrbdqqsunu5Mm3wDvUAKRHSC34sJ7in334 * [Chain m/0'/1/2'/2/1000000000] * ext pub: xpub6H1LXWLaKsWFhvm6RVpEL9P4KfRZSW7abD2ttkWP3SSQvnyA8FSVqNTEcYFgJS2UaFcxupHiYkro49S8yGasTvXEYBVPamhGW6cFJodrTHy * ext prv: xprvA41z7zogVVwxVSgdKUHDy1SKmdb533PjDz7J6N6mV6uS3ze1ai8FHa8kmHScGpWmj4WggLyQjgPie1rFSruoUihUZREPSL39UNdE3BBDu76
Test vector 2
Master (hex): fffcf9f6f3f0edeae7e4e1dedbd8d5d2cfccc9c6c3c0bdbab7b4b1aeaba8a5a29f9c999693908d8a8784817e7b7875726f6c696663605d5a5754514e4b484542 * [Chain m] * ext pub: xpub661MyMwAqRbcFW31YEwpkMuc5THy2PSt5bDMsktWQcFF8syAmRUapSCGu8ED9W6oDMSgv6Zz8idoc4a6mr8BDzTJY47LJhkJ8UB7WEGuduB * ext prv: xprv9s21ZrQH143K31xYSDQpPDxsXRTUcvj2iNHm5NUtrGiGG5e2DtALGdso3pGz6ssrdK4PFmM8NSpSBHNqPqm55Qn3LqFtT2emdEXVYsCzC2U * [Chain m/0] * ext pub: xpub69H7F5d8KSRgmmdJg2KhpAK8SR3DjMwAdkxj3ZuxV27CprR9LgpeyGmXUbC6wb7ERfvrnKZjXoUmmDznezpbZb7ap6r1D3tgFxHmwMkQTPH * ext prv: xprv9vHkqa6EV4sPZHYqZznhT2NPtPCjKuDKGY38FBWLvgaDx45zo9WQRUT3dKYnjwih2yJD9mkrocEZXo1ex8G81dwSM1fwqWpWkeS3v86pgKt * [Chain m/0/2147483647'] * ext pub: xpub6ASAVgeehLbnwdqV6UKMHVzgqAG8Gr6riv3Fxxpj8ksbH9ebxaEyBLZ85ySDhKiLDBrQSARLq1uNRts8RuJiHjaDMBU4Zn9h8LZNnBC5y4a * ext prv: xprv9wSp6B7kry3Vj9m1zSnLvN3xH8RdsPP1Mh7fAaR7aRLcQMKTR2vidYEeEg2mUCTAwCd6vnxVrcjfy2kRgVsFawNzmjuHc2YmYRmagcEPdU9 * [Chain m/0/2147483647'/1] * ext pub: xpub6DF8uhdarytz3FWdA8TvFSvvAh8dP3283MY7p2V4SeE2wyWmG5mg5EwVvmdMVCQcoNJxGoWaU9DCWh89LojfZ537wTfunKau47EL2dhHKon * ext prv: xprv9zFnWC6h2cLgpmSA46vutJzBcfJ8yaJGg8cX1e5StJh45BBciYTRXSd25UEPVuesF9yog62tGAQtHjXajPPdbRCHuWS6T8XA2ECKADdw4Ef * [Chain m/0/2147483647'/1/2147483646'] * ext pub: xpub6ERApfZwUNrhLCkDtcHTcxd75RbzS1ed54G1LkBUHQVHQKqhMkhgbmJbZRkrgZw4koxb5JaHWkY4ALHY2grBGRjaDMzQLcgJvLJuZZvRcEL * ext prv: xprvA1RpRA33e1JQ7ifknakTFpgNXPmW2YvmhqLQYMmrj4xJXXWYpDPS3xz7iAxn8L39njGVyuoseXzU6rcxFLJ8HFsTjSyQbLYnMpCqE2VbFWc * [Chain m/0/2147483647'/1/2147483646'/2] * ext pub: xpub6FnCn6nSzZAw5Tw7cgR9bi15UV96gLZhjDstkXXxvCLsUXBGXPdSnLFbdpq8p9HmGsApME5hQTZ3emM2rnY5agb9rXpVGyy3bdW6EEgAtqt * ext prv: xprvA2nrNbFZABcdryreWet9Ea4LvTJcGsqrMzxHx98MMrotbir7yrKCEXw7nadnHM8Dq38EGfSh6dqA9QWTyefMLEcBYJUuekgW4BYPJcr9E7j
Implementations
A Python implementation is available at https://github.com/richardkiss/pycoin
A Java implementation is available at https://github.com/bitsofproof/supernode/blob/1.1/api/src/main/java/com/bitsofproof/supernode/api/ExtendedKey.java
A C++ implementation is available at https://github.com/CodeShark/CoinClasses/tree/master/tests/hdwallets
A Ruby implementation is available at https://github.com/wink/money-tree
Acknowledgements
- Gregory Maxwell for the original idea of type-2 deterministic wallets, and many discussions about it.
- Alan Reiner for the implementation of this scheme in Armory, and the suggestions that followed from that.
- Mike Caldwell for the version bytes to obtain human-recognizable Base58 strings.