mirror of
https://github.com/jmcorgan/fips.git
synced 2026-08-09 08:14:42 +00:00
5d7af5b478ef7335584cb6a763f976137b0a4c12
Add bloom filter reachability announcement protocol: - FilterAnnounce encode/decode (wire format 0x20, 1035 bytes) - node/bloom.rs: send/receive with debounce, split-horizon loop prevention - Handler wiring: dispatch, tick, peer promotion/removal, cross-connection - Five integration tests: 10-node, star, chain, ring, 100-node convergence Remove TTL/K-hop mechanism from code and design docs after discovering that per-entry TTL scoping is fundamentally incompatible with flat bloom filter merge + regeneration architecture. Each node re-originates filters with fresh TTL, making propagation unbounded regardless of TTL value. Split-horizon remains the primary loop prevention mechanism. Document spanning tree known limitations (v1) in spanning-tree-dynamics.md. 316 tests pass, clean build, zero warnings.
FIPS Documentation
| Directory | Description |
|---|---|
| design/ | Protocol design specifications and analysis |
Languages
Rust
83.6%
Shell
11.7%
Python
4.2%
PowerShell
0.2%
Makefile
0.1%