<div align='center' id='Merkleization'>
<h1>Merkleization</h1>
<br/>
<h2>The Merkle Tree</h2>
</div>
<div id='The%20Merkle%20Tree' align='start'>
<br/>
<h3>A <strong>Merkle Tree</strong> is a binary hash tree</h3>
<ul>
<li>The values of the <strong>Leaves</strong> of the Merkle Tree are each a <code>Bytes32</code> result of a <code>hash function</code> applied to the serialized objects stored in the tree</li>
<li>The value of any <strong>parent</strong> node in the Merkle Tree is the result of the same <code>hash function</code> applied to a concatenation of the values of its two <strong>child</strong> nodes.</li>
<li>The value of the <strong>Root</strong> node is the culmination of the process of hashing pairs of child nodes to reach a single node.
<ul>
<li>Referred to in SSZ as <code>hash_tree_root</code></li>
</ul>
</li>
</ul>
<img src='/merkle_tree.png' alt='merkletree' class='img-fluid'/>

Merkleization

The Merkle Tree

A Merkle Tree is a binary hash tree