Lookups in a Bloom Filter are basically constant time. Not sure you can go faster than that. Check out Eugene Spafford's 1992 paper. https://dl.acm.org/citatio

Lookups in a Bloom Filter are basically constant time. Not sure you can go faster than that. Check out Eugene Spafford's 1992 paper. https://dl.acm.org/citation.cfm?id=134593 https://dl.acm.org/citation.cfm?id=134593