diff --git a/book/src/fork-deltas.md b/book/src/fork-deltas.md
index ac97e6b128..0b67cf2ca7 100644
--- a/book/src/fork-deltas.md
+++ b/book/src/fork-deltas.md
@@ -1,6 +1,8 @@
 # Fork Deltas
 
-This design describes a way to checkpoint the bank state such that it can track multiple forks without duplicating data.  It addresses the following challenges:
+This design describes a way to checkpoint the bank state such that it can track
+multiple forks without duplicating data.  It addresses the following
+challenges:
 
 * Forks are potentially created at every slot boundary.
 * Forks can be based on any previously produced block.
@@ -9,11 +11,14 @@ This design describes a way to checkpoint the bank state such that it can track
 
 ## Architecture
 
-The basic design idea is to maintain a DAG of forks.  Each fork points back to a single ancestor.  The DAG is initialized with a root.  Each subsequent fork must descend from the root.
+The basic design idea is to maintain a DAG of forks.  Each fork points back to
+a single ancestor.  The DAG is initialized with a root.  Each subsequent fork
+must descend from the root.
 
 ## Active Forks
 
-An *active fork* is a direct list of connected forks that descend from the current root to a specific fork without any descendants.
+An *active fork* is a direct list of connected forks that descend from the
+current root to a specific fork without any descendants.
 
 For example:
 
@@ -28,7 +33,13 @@ The following *active forks* are in the deltas DAG
 
 ## Merging into root
 
-A validator votes for a finalized fork.  The *active fork* connecting the fork to the root is merged.  If the *active fork* is longer than `Forks::ROLLBACK_DEPTH` the oldest two forks are merged.  The oldest fork in the *active fork* is the current root, so the second oldest is a direct descendant of the root fork.  Once merged, the current root is updated to the root descendant. Any forks that are not descendants from the new root are pruned since they are no longer reachable.
+A validator votes for a finalized fork.  The *active fork* connecting the fork
+to the root is merged.  If the *active fork* is longer than
+`Forks::ROLLBACK_DEPTH` the oldest two forks are merged.  The oldest fork in
+the *active fork* is the current root, so the second oldest is a direct
+descendant of the root fork.  Once merged, the current root is updated to the
+root descendant. Any forks that are not descendants from the new root are
+pruned since they are no longer reachable.
 
 For example:
 
@@ -38,10 +49,12 @@ For example:
 
 <img alt="Forks after pruning" src="img/forks-pruned.svg" class="center"/>
 
-The new root is 2, and any active forks that are not descendants from 2 are pruned.
+The new root is 2, and any active forks that are not descendants from 2 are
+pruned.
 
 * ROLLBACK\_DEPTH=2, vote=6, *active fork*={6,1}
 
 <img alt="Forks" src="img/forks.svg" class="center"/>
 
-The tree remains with `root=1`, since the *active fork* starting at 6 is only 2 forks long.
+The tree remains with `root=1`, since the *active fork* starting at 6 is only 2
+forks long.