Architecture · Illustrate

Three runs at once, one tree each

Dispatch is non-blocking, so fanning out is just repeated start calls. The constraint is not concurrency — it is that a write-capable run needs a tree of its own.

OWN CWD OWN CWD OWN CWD START ×3 YOU Dispatcher start returns at once list · collect RUN Supervisor + harness codex · 125.5s RUN Supervisor + harness codex · 125.4s RUN Supervisor + harness codex · 115.5s TREE Worktree A clean delta TREE Worktree B clean delta TREE Worktree C clean delta AVOID All three sharing one worktree measured: every run reports all three files · files_mismatch true LEGEND You Concurrent run Working tree Arrangement to avoid Isolated measurement

Measured on three concurrent Codex runs: dispatched inside one second, 130 s of wall clock for all three. Sharing a directory does not corrupt the work — it corrupts the attribution, because the tripwire watches the tree, not the author.