Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality. such as removals or counting. This paper shows that fingerprint-based hash tables offer a much better tradeoff between accuracy and space. https://parisnaturalfoodes.shop/product-category/coconut-toffee/