<div id='Merkelize' align='center'>
<h1>Merkleize</h1>
<p>The function <code>merkleize(value)</code> builds a <em><strong>Merkle Tree</strong></em><br>
and returns the <code>Bytes32</code>  <em><strong>Hash Tree Root</strong></em></p>
</div>
<div align='start'>
<h3><code>merkleize(value)</code> provides <code>hash_tree_root</code> for</h3>
<ul>
<li><code>Basic types</code> i.e. <code>unsigned integers</code> of <code>N bytes</code>, known as <code>uintN</code>s, as well as <code>Booleans</code></li>
<li><code>List</code> and <code>vectors</code> of <code>bits</code>, known as <code>BitLists</code> and <code>BitVectors</code></li>
<li><code>Lists</code> and <code>vectors</code> of <code>Serializable</code> i.e. either basic or composite types</li>
<li><code>Containers</code> with <code>Serializable</code> fields</li>
<li><code>Unions</code></li>
</ul>
<h3>To implement <code>hash_tree_root</code> a number of helper functions are required, including</h3>
<ul>
<li><code>size_of</code></li>
<li><code>chunk_count</code></li>
<li><code>pack</code></li>
<li><code>pack_bits</code></li>
<li><code>next_pow_of_two</code></li>
<li><code>merkleize</code></li>
<li><code>mix_in_length</code></li>
<li><code>mix_in_type</code></li>
</ul>


Merkleize

`merkleize(value)` provides `hash_tree_root` for

To implement `hash_tree_root` a number of helper functions are required, including

Merkleize

merkleize(value) provides hash_tree_root for

To implement hash_tree_root a number of helper functions are required, including

`merkleize(value)` provides `hash_tree_root` for

To implement `hash_tree_root` a number of helper functions are required, including