Resolve the first such chain found (depth-first), ordered from root to leaf.
Cycles are detected via a per-path visited set of delegation CIDs so that self-delegations or other loops can be skipped without recursing forever.
List proofs by sub and aud
Store