diff --git a/ch09.asciidoc b/ch09.asciidoc
index a1f3caa7..c6b5d4d3 100644
--- a/ch09.asciidoc
+++ b/ch09.asciidoc
@@ -159,7 +159,7 @@ Looking at this new block, the node finds the +previousblockhash+ field, which c
 ((("binary hash trees", see="merkle trees")))A _merkle tree_, also known as a _binary hash tree_, is a data structure used for efficiently summarizing and verifying the integrity of large sets of data. Merkle trees are binary trees containing cryptographic hashes. The term "tree" is used in computer science to describe a branching data structure, but these trees are usually displayed upside down with the "root" at the top and the "leaves" at the bottom of a diagram, as you will see in the examples that follow.
 
 [[chain_of_blocks]]
-[role="smallerfifty"]
+[role="smallerfourtyfive"]
 .Blocks linked in a chain by reference to the previous block header hash
 image::images/mbc2_0901.png[]