mirror of https://github.com/jmcorgan/fips.git synced 2026-08-09 16:24:45 +00:00

T

Johnathan Corgan 2f8e97c0ab Implement greedy routing with bloom filter priority

Add the full next-hop routing algorithm to Node::find_next_hop():
- Local delivery, direct peer, bloom filter candidates, greedy tree
  routing fallback, with (link_cost, tree_distance, node_addr) ordering
- select_best_candidate() scores by peer→dest distance (not us→peer)
  with self-distance check to prevent routing loops
- TreeState::find_next_hop() for greedy tree routing with progress
  guarantee
- ActivePeer::link_cost() placeholder (constant 1.0) for future link
  quality metrics

Add routing tests including 100-node all-pairs reachability simulation
(9900/9900 delivered, 0 loops, avg 4.0 hops, max 8).

Update fips-routing.md to reflect bloom filter routing as the primary
forwarding mechanism, with greedy tree routing as fallback during
convergence windows.

2026-02-11 16:55:14 +00:00

docs

Implement greedy routing with bloom filter priority

2026-02-11 16:55:14 +00:00

src

Implement greedy routing with bloom filter priority

2026-02-11 16:55:14 +00:00

.gitignore

Add identity module with NodeId, FipsAddress, and auth challenge

2026-01-24 23:57:48 +00:00

Cargo.lock

Session 46: Noise IK peer authentication implementation