Johnathan Corgan 81e4207631 bloom: compute the SHA-256 digest once per double-hash probe ...

BloomFilter derived all k hash functions from one SHA-256 digest but
recomputed that digest inside the per-function loop, so every insert and
contains ran SHA-256 hash_count times (5x at the default) over the same
bytes. Hoist the digest out of the loop: base_hashes() computes it once
and returns (h1, h2), and bit_index() derives each of the k indices with
the same (h1 + k*h2) mod m arithmetic. Bit-for-bit identical output; this
is the hottest path in packet forwarding and mesh-size estimation.

Adds a test pinning the bit indices against the double-hashing formula
recomputed independently, proving the refactor is behavior-neutral.

2026-07-11 01:22:07 +00:00

..

filter.rs

bloom: compute the SHA-256 digest once per double-hash probe

2026-07-11 01:22:07 +00:00

mod.rs

Design documentation illustration and review pass

2026-02-24 17:32:37 +00:00

state.rs

fipstop: TUI overhaul with render-snapshot harness and navigation model

2026-06-12 23:05:58 +00:00

tests.rs

bloom: compute the SHA-256 digest once per double-hash probe

2026-07-11 01:22:07 +00:00