On: Blooming Password – A banned password check using ...

[Franciscouzo]

I think the method you're describing is equivalent to a bloom filter that only uses one hash function per key.

[bloomthrowaway → Franciscouzo]

its the same structure as a Bloom filter but more efficient because it has no empty slots

[jhafdks7r3wr3 → bloomthrowaway]

No, it's not the same structure as a Bloom filter without empty slots. It's the same structure as a Bloom filter with only one hash function. Bloom filters use multiple.

[bloomthrowaway → jhafdks7r3wr3]

multiple hash functions only exist because they don't use secure hashes (for speed reasons) so there's collisions.

Normally for passwords you would use a secure hash, negating this

[Franciscouzo → bloomthrowaway]

No, the math on bloom filters already assumes a random oracle.