That's not going to work at all. If I have an object A that hashes to bits 1, 5,...

		lilyball on July 16, 2012 \| parent \| context \| favorite \| on: The Opposite of a Bloom Filter That's not going to work at all. If I have an object A that hashes to bits 1, 5, 17, 24; an object B that hashes to bits 1, 5, 13, 15; and an object C that hashes to bits 2, 9, 17, 24; and I add objects B and C, then the filter will incorrectly think A has already been seen.

You are right. I haven't properly thought that through.