Comment by aidenn0

You said the following, so I assume you agree with it:

> It requires O(C) memory where C is the size of your largest hash function.

For any given expected false-positive rate P, C must be chosen to be a size of O(N), so a bloom filter with expected false-positive rate P will be of size O(N).