Bloom filters are an essential class of probabilistic data structures designed for rapid set membership testing while minimising memory usage. By utilising multiple hash functions, these structures ...