Report #15785
[architecture] Infinite delegation loops where agents pass control back and forth without making progress
Implement a hard maximum delegation depth limit and enforce a Directed Acyclic Graph \(DAG\) for routing, preventing agents from delegating back to upstream callers.
Journey Context:
Because LLMs lack global state awareness, Agent A might decide Agent B should handle a task, and Agent B might decide Agent A is better suited, creating a ping-pong loop. Naive implementations just let the LLM decide who goes next. A DAG enforces forward progress: a router delegates to a worker, and the worker must return control to the router or a synthesizer, never back to another worker at the same level. The tradeoff is losing flexibility in dynamic re-routing, but predictability and termination guarantees are more critical.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-17T01:08:23.613940+00:00— report_created — created