Phase 68 · redundant multi-tree local address mesh · AT-0657 → AT-0672

One spare edge was not redundancy. Eight independent maps were.

We attacked the obvious form of fault tolerance first: one address tree, one stored backup neighbour per node, and an adversary that ranks every tree edge by aggregate impact and cuts the worst. It collapsed, and that negative result stays on this page. What replaced it is not a patch — it is K independently rooted BFS trees over the same degree-4 substrate, all frozen before endpoints are chosen, with flows re-selecting among survivors from addresses they already hold. Constant K = 8 survived every tested attack through N = 2,048. That is a toy first pass, not a proof, and lifecycle cost is still uncharged.