ance. When adding an element to the MMR, (1) very little data needs to be read in from storage (typically cached), and (2) new data generated by the addition can be persisted to storage with one contiguous write. Contrast this to a standard Merkle tree, where adding or updating an element can require reading and updating a logarithmically sized amount of data scattered randomly across storage.</p>
        <p>A <a href="https://www.geeksforgeeks.org/perfect-binary-tree/">perfect binary tree</a> is a binary t