Phase 64 · the self-organizing address layer · AT-0595 → AT-0608

The address book is no longer ours.

Seed 595. We removed the assumption that compact addresses are preloaded by us. On each connected random cubic substrate, every node starts with nothing but an immutable random identifier and its own neighbour / port information. A local min-ID / BFS wave elects a generic root and grows a spanning tree before A and B are chosen. A node's address is simply the sequence of local child-port symbols from the root down to it — degree ≤ 3 means each hop symbol fits in about two bits. Routing is longest common prefix: ascend to the lowest common ancestor, then descend along B's symbols. No shortest-path oracle, no destination beacon, no endpoint-targeted infrastructure. Over N = 128 … 8,192 setup runs 8 → 15 rounds, median addresses 10 → 22 bits, routes 8 → 21.5 hops against shortest paths of 6 → 12, with exponents 0.151, 0.187 and 0.222 and ratios to log2 N that stay bounded. And the build is not free: it touches the whole network once.