It sounds as if it's a process that enables a wallet to be rebuilt from a passphrase, or from several fragments scattered about. Could someone provide a detailed technical explanation?
You've hit the nail on the head. A deterministic wallet is any system which uses a passphrase or other snippet of data to build a keypair in a repeatable manner. So long as you remember the passphrase, the keypair can be re-generated from it, so storage is no longer a security concern. There are several methods for generating deterministic wallets, but my favorite is Casascius' Bitcoin-Address generator (C#, Windows, binaries here)
Normally, when you send money you also generate a new private/public key for the "change" to return. therefore every time you send money your wallet.dat grows a little bit.
The Basic Idea of the deterministic wallet: instead of a database with lots of private/public keys you start with a single private key, from which all future keys can be calculated.
This has many advantages. It is trivial to back up and transferable. it could be used from multiple computers.
afaik, webcoin.ch uses this concept. The current "official" client not.
A deterministic wallet is any wallet for which a given private key can be predictably recovered with just:
- the original secret seed
- the identifier / sequence number of the desired keypair
There are two types of deterministic wallets:
- sequential deterministic wallets
- hierarchical deterministic wallets
With a sequential deterministic wallet, the seed is a passphrase or sequence of characters that can be repeatedly incremented and hashed to generate new private keys.
For example, if I use the passphrase:
'shepherd mais pack rate enamel horace diva filesize maximum really roar mall'
...then I can create the first 100 private keys by doing the following:
hex(sha256('shepherd mais pack rate enamel horace diva filesize maximum really roar mall 0')) hex(sha256('shepherd mais pack rate enamel horace diva filesize maximum really roar mall 1')) ...
And as long as I am consistent with how I modify the original passphrase, I can easily recover any given passphrase that I wish.
A hierarchical deterministic wallet, on the other hand, starts with a single keypair as the master keypair. The private key of this keypair is the secret seed.
Each keypair has children. And the public key of a given child of a given parent node in the tree is generated by performing elliptic curve multiplication on the parent's public key.
The private key of the child can be recovered by the owner by performing the same multiplicative operation on the parent's private key. This is because mPubkey/Pubkey = mPrivkey/Privkey.
The cool thing about this is that you can give a server a public key and that server can generate new addresses for you without ever having to know your private key.
If you're looking for a python implementation of sequential deterministic wallets, I put one together here: https://github.com/blockstack/pybitcoin (or just do "pip install pybitcoin").
Another example using deterministic wallets is the BCCAPI, which is a library for making light-weight secure Bitcoin clients. http://code.google.com/p/bccapi/
Primary Bitcoin Improvement Proposals (BIP) associated with deterministic, specifically hierarchical deterministic (HD) wallets to facilitate portability between implementations to avoid vendor lock-in are BIPs 32, 39, 44. BIPs get into the technical details. May want to examine libbitcoin for command line interface examples for applying BIPs 32, 39, and 44.
protected by Community♦ Jul 15 '16 at 23:31
Thank you for your interest in this question.
Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).
Would you like to answer one of these unanswered questions instead?