Network · Graph
The graph layer: vertices hold key, a swap is one edge, refusals
9/9 passed in 33ms
| Test | What it does | Result |
|---|---|---|
test_bad_graph | Isolated nodes, parallel hops, unknown endpoints, self-loops and a payload neither q.Link nor q.Swap raise. | ✅ pass |
test_clock_units | Every hop's rate in bits per second is its per-shot key rate times the declared clock. | ✅ pass |
test_dry_plan | explain() runs nothing, labels a rate "derived (run to compute)" and carries the trust and end-to-end rows. | ✅ pass |
test_node_total | ERNET's total is the sum of its three incident segment rates in bits per second. | ✅ pass |
test_pair_order | A segment rate reads the same with the hop's ends in either order. | ✅ pass |
test_payload_blame | A segment's own refusal is re-raised naming the hop. | ✅ pass |
test_relay_vertex | A q.Relay offered as a vertex is refused. | ✅ pass |
test_swap_edge | A swap is one edge between its two senders, its midpoint in no segment key and no node degree. | ✅ pass |
test_swap_isolated | Every hop of a route beside a swap is a pair of q.Node vertices, and the midpoint is refused as an endpoint. | ✅ pass |