Recent hash table development raises questions about an optimal solution. Hash tables are one of the oldest and simplest data structures for storing elements and supporting deletions and queries.

Bloom filters are an essential class of probabilistic data structures designed for rapid set membership testing while minimising memory usage. By utilising multiple hash functions, these structures ...

The original version of this story appeared in Quanta Magazine. Sometime in the fall of 2021, Andrew Krapivin, an undergraduate at Rutgers University, encountered a paper that would change his life.