Xor filters require all the members of the set be provided up front. Bloom filters allow adding members, but not removing them. Cuckoo filters allow removing

Xor filters require all the members of the set be provided up front. Bloom filters allow adding members, but not removing them. Cuckoo filters allow removing members: https://www.cs.cmu.edu/~dga/papers/cuckoo-conext2014.pdf https://www.cs.cmu.edu/~dga/papers/cuckoo-conext2014.pdf And just for completeness, storing everything losslessly in a btree, radix tree, or hash table would probably be under 300 kB. (80 kB just for the IDs plus, say, an additional ~2x overhead.)