The "ideal" (Poisson) hash function distribution false positive rate for the given Bloom parameters is 0.4026% and our trivial hash function's rate yields 0.396% - better than ideal 🙂. Though the implementation requires 7 hash functions, and to achieve this FP rate they all must be at this level. We take 8 bytes of the point's sha256 hash to get this result, and we should be able to get sufficient independence at the same uniformity by just using other half-overlapping segments of the sha256 hash.