One hash is enough for a Bloom filter. I measured it — and the 52% cliff when you break its one rule.

Bluesky's one-hash Bloom filter, tested in Python: 0.92% false positives vs 0.83% for double hashing at the same bit budget — and 52.25% when I made the partition sizes non-coprime.