Do you have a software project in which you need a fast and space-efficient approximate set data structure, like a Bloom filter ? Then probably what you want is actually a cuckoo filter , a plug-in replacement for Bloom filters that is faster, more space-efficient, and more versatile (because it allows elements to be deleted as well as inserted). Michael Mitzenmacher has described cuckoo filters i
![Cuckoo filters and their analysis: 11011110](https://cdn-ak-scissors.b.st-hatena.com/image/square/47902927e70686d279b0d1f2fb4ce4600e93bdee/height=288;version=1;width=512/http%3A%2F%2Fl-stat.livejournal.net%2Fimg%2Fsign.png)