Protocol Foundations 004: Data proofs
<p>The digitalization of the modern world has brought an exponential surge in the amount of information computer systems must handle. Hashes, which we covered in <em>Protocol Foundations 003: Hashing</em>, can be leveraged to structure large quantities of data in a way that allows for efficient integrity verification.</p> <p>A common example is a database using hashes as indices for faster data lookup. The so-called <em>hash table</em> stores data in key- value pairs and accesses them by hashes. In <em>Figure 1</em>, we see this applied to storing phone numbers, one of hash tables’ original uses dating from the 1950s…</p>
Authors: Mario Havel, Tim Beiko
Part of: Summer of Protocols
ISBN: 9781962872539