Bloom filters are a data structure developed by Burton Howard Bloom in 1970. You can see them as a hash tables’ cousin. They also allow
Merkle trees, also known as binary hash trees, are a type of binary tree. They can be used to efficiently verify the integrity of large