Build durable fan-out and fan-in DAGs from ordinary pending jobs.
Workflows are an opt-in layer over ordinary jobs. The graph is validated before enqueue,
then prepared as one atomic batch containing a coordinator and pending children.
Register the coordinator on workers serving its queue, alongside every application task
handler. It uses bounded point reads through the inspection capability.
Roots are promoted first. A child becomes available only after every dependency completes.
If an upstream job reaches a failed terminal state, descendants that never ran are deleted
and the coordinator archives.
This first workflow slice is immutable. Signals, timers, graph mutation, nested workflows,
and workflow-level retry are not claimed yet.