One thing that takes a minute to sink with Bloom Filters is that the size requirements are independent of the size of the individual elements! Storing N elements with a given false positive probability has a fixed cost, whether you're storing integers or 100MB strings.<p>If you are concerned with speed, a bloom filter is exactly the kind of thing I'd never implement in Python. Twiddling bits is orders of magnitude more expensive than in C.