arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2025-03-25 11:55:44 +00:00
Code Issues Releases Wiki Activity

formatting fixes

Browse Source
This commit is contained in:
Andreas M. Antonopoulos 2014-05-28 20:34:04 -04:00
parent 656e60caeb
commit 092017829c
1 changed files with 10 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
ch04.asciidoc
View File

@ -413,7 +413,7 @@ The standard defines the creation of a mnemonic code and seed as a follows:
.Mnemonic Codes: Entropy and Word Length
[options="header"]
|=======
|Entropy (bits) | Checksum (bits) | Word Length
|Entropy (bits) | Checksum (bits) | Entropy+Checksum | Word Length
| 128 | 4 | 132 | 12
| 160 | 5 | 165 | 15
| 192 | 6 | 198 | 18
@ -435,9 +435,9 @@ Here are some examples of mnemonic codes and the seeds they produce:
.256-bit entropy mnemonic code and resulting seed
|=======
| entropy input (256 bits) | 2041546864449caff939d32d574753fe684d3c947c3346713dd8423e74abcf8c (256 bits)
| mnemonic (24 words) | cake apple borrow silk endorse fitness top denial coil riot stay wolf luggage oxygen faint major edit measure invite love trap field dilemma oblige (24 words)
| seed (512 bits) | 3972e432e99040f75ebe13a660110c3e29d131a2c808c7ee5f1631d0a977fcf473bee22fce540af281bf7cdeade0dd2c1c795bd02f1e4049e205a0158906c343 (512 bits)
| entropy input (256 bits) | 2041546864449caff939d32d574753fe684d3c947c3346713dd8423e74abcf8c
| mnemonic (24 words) | cake apple borrow silk endorse fitness top denial coil riot stay wolf luggage oxygen faint major edit measure invite love trap field dilemma oblige
| seed (512 bits) | 3972e432e99040f75ebe13a660110c3e29d131a2c808c7ee5f1631d0a977fcf473bee22fce540af281bf7cdeade0dd2c1c795bd02f1e4049e205a0158906c343
|=======
===== Deterministic Chains (Electrum Key Chains)
@ -453,9 +453,11 @@ image::images/chained_wallet.png["chained wallet"]
.Type-2 Hierarchical Deterministic Wallet: A Tree of Keys Generated from a Seed
image::images/HD_wallet.png["HD wallet"]
==== Advanced Keys and Addresses
===== Encrypted Private Keys (BIP0038)
@ -500,9 +502,10 @@ Let's look at the pattern "1Kids" as a number and see how frequently we might fi
| 6 | 1KidsCh | 1 in 38bn | 2 days
| 7 | 1KidsCha | 1 in 2.2tn | 3-4 months
| 8 | 1KidsChar | 1 in 128tn | 13-18 years
| 9 | 1KidsChari | 1 in 7qn | > 800 years
| 10 | 1KidsCharit | 1 in 400qdn | > 46,000 years
| 11 | 1KidsCharity | 1 in 23qnt | > 2.5m years
| 9 | 1KidsChari | 1 in 7qn | 800 years
| 10 | 1KidsCharit | 1 in 400qdn | 46,000 years
| 11 | 1KidsCharity | 1 in 23qnt | 2.5m years
As you can see, Eugenio won't be creating the vanity address "1KidsCharity" any time soon, even if he had access to several thousand computers. Each additional character increases the difficulty by a factor of 58. Patterns with more than seven characters are usually found by specialized hardware, such as custom-built desktops with multiple Graphical Processing Units (GPUs). These are often re-purposed bitcoin mining "rigs", that are no longer profitable for bitcoin mining, but can be used effectively to find vanity addresses. Vanity searches on GPU systems are many orders of magnitude faster than on a general-purpose CPU.