fleet-topology — Fleet Network Topology with Constraint-Aware Routing

Which devices know which. How constraints propagate. Where cycles need holonomy checks.

What It Does

• Fleet graph: nodes (devices) + edges (communication links)
• Betti number β₁: counts independent cycles (holonomy checks needed)
• Cycle detection: find all cycles for Kawasaki condition verification
• Constraint routing: messages follow constraint-capable edges only
• Holonomy verification: cycle product must be identity

The Math

• β₁ = |E| - |V| + c (Euler characteristic)
• Tree topology: β₁ = 0, no cycles, trivially consistent
• Ring topology: β₁ = 1, one Kawasaki condition
• Complete graph: β₁ = N(N-1)/2 - N + 1, many conditions, high redundancy

Use Cases

• Fleet device discovery and topology mapping
• Constraint propagation planning
• Holonomy verification scheduling
• Fault-tolerant routing (avoid broken links)

Composable With

• fleet-proto-rs: device and constraint types
• fleet-raid5: security audit uses topology for spatial parity
• fold-compression: fold groups operate on topology edges
• physics-clock: temporal inference uses edge latency

Install

[dependencies]
fleet-topology = "0.1"

License

Apache 2.0