Continuation chains are bounded separately from graph nesting.
The spawn-depth cap governs graphs nested by tasks; this one governs graphs chained by
continuations — an agent re-invoked with a finished graph's results can emit another graph, which
re-invokes it again. Both loops exist and neither cap constrains the other, so both are needed. At
the cap the dispatcher forces continuation: 'message', which ends the chain without losing the
results.
Continuation chains are bounded separately from graph nesting.
The spawn-depth cap governs graphs nested by tasks; this one governs graphs chained by continuations — an agent re-invoked with a finished graph's results can emit another graph, which re-invokes it again. Both loops exist and neither cap constrains the other, so both are needed. At the cap the dispatcher forces
continuation: 'message', which ends the chain without losing the results.