zzgandClaude Opus 5.5 411d78516c Add One-Hashing Bloom Filter library and tests ...

Partitions are k consecutive primes (paper's Algorithm 1), one blake2b
hash per key sized to cover the partition product plus 64 bits.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>

2026-10-20 12:26:47 -07:00

..

test_ohbf.py

Add One-Hashing Bloom Filter library and tests

2026-10-20 12:26:47 -07:00