Back to matrix

G01-CJ: No

Rationale

In the selected replicated route-server design, a server answers gr queries from its own node inventory and Dijkstra graph. Both source and target must exist locally; a missing target produces a reply without a route, not a delegated lookup. Peer synchronization exchanges known announcement inventories and fetches missing announcements. A server providing arbitrary global destination lookup therefore needs global destination reachability records and a connecting graph. This is control-plane replication, despite compact labels at transit switches. It does not require every possible edge or every client to hold a complete table, and is not a verdict for the older cjdns DHT design.

Assessment method

Read-only source analysis and whole-stack architectural inference

Source context

Pinned route-server query, local graph and announcement synchronization

Outstanding qualification

The selected route-server composition still requires cjdns client/server interoperability qualification, including announcement signatures/state hashes and route replies. No global deployment or resource-capacity experiment was performed. G04 query distribution remains Yes; G05 capacity remains Pending. This negative is derived from the selected control-plane design and does not rely on assuming a conventional Internet underlay.

Public sources