diff --git a/ch04.asciidoc b/ch04.asciidoc
index 70902780..d6f2d19c 100644
--- a/ch04.asciidoc
+++ b/ch04.asciidoc
@@ -436,8 +436,10 @@ 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
-| 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 
+| 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) | 3972e432e99040f75ebe13a660110c3e29d131a2c808c7ee5f1631d0a977
+fcf473bee22fce540af281bf7cdeade0dd2c1c795bd02f1e4049e205a0158906c343 
 |=======
 
 ===== Deterministic Chains (Electrum Key Chains)
@@ -505,7 +507,7 @@ Let's look at the pattern "1Kids" as a number and see how frequently we might fi
 | 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.