commonware

It’s a Grind

Authenticated databases use tree structures like tries, binary search trees, and BTrees to support fast key lookup and generate a verifiable state (known as ‘merkleizing’). These structures work best when the keys are spread out evenly (uniformly distributed), and performance can suffer otherwise.