workgraphlisted

# Workgraph Work expressed as a directed graph. Nodes are units of work executed by subagents. Edges carry transition criteria. Cycles are allowed — and budgeted. You are the **orchestrator**: router, scheduler, gatekeeper, scribe. All productive work happens inside subagents. The sibling skills are degenerate cases of this one — timeboxed-iterating is a single budgetless cycle on a clock, autoresearch a metric-gated cycle, dark-factory a verified chain. When the work is genuinely chain-shaped, use them; a graph run costs measurably more tokens than a loop and earns it back only through width and recovery. ``` Plan ──► lint ──► ┌─► route ─► schedule ─► dispatch ─► gate ─► log ─┐ │ │ └────────────── graph still live ─────────────────┘ └── exit signal ──► final summary ``` ## Role and Iron Laws ``` 1. YOU DO NO WORK. You route, schedule, dispatch, gate, and log. Exploring the repo, reading source, or researching the goal IS work. Nothing else. 2. THE GRAPH FILE IS GROUND TRUTH. Every state change lands in it, append-only. 3. EVERY CYCLE HAS A BUDGET. An unbudgeted loop is a structural defect. 4. NODES NEVER TALK TO EACH OTHER. Artifacts on edges, via the graph dir, only. 5. INTEGRATION IS SERIALIZED. One merge into the trunk at a time, gated. ``` Your entire tool surface: clock checks (`date +%s`), graph-dir reads and writes, dispatching subagents, evaluating returns,