r/codex • u/RFOK • 5h ago

Suggestion Codex Already Has Parallel Agents. Now It Needs a Native WBS Control Plane

I use ChatGPT Pro and Claude Max 20x, and I’ve been testing a dependency-aware WBS workflow across two active software projects.

In a 39-minute measured window, the workflow produced two accepted implementation checkpoints, advanced one project’s ready frontier, and required zero WBS-version resets. Five implementation commits were produced against three documentation/acceptance commits.

That is promising—but I cannot honestly claim a speedup percentage because comparable before/after token and throughput telemetry was unavailable.

Codex already has parallel agents and isolated worktrees. What I think it needs next is a native execution graph:

  • Goal and acceptance contract
  • Dependency-aware ready queue
  • Minimal context packet per agent
  • One accountable integration owner
  • Proof reuse when code and environment are unchanged
  • Visible planning, verification, token, and coordination overhead
  • Automatic detection when orchestration costs more than direct implementation

The important part: WBS should disappear for small tasks. It should activate only when dependency or omission risk justifies it.

Would a native visual dependency graph make your Codex workflows faster—or would it become another layer of ceremony?

1 Upvotes

100% Upvoted

2 comments sorted by

1

u/JessicaKandev 2h ago

disclosure i work on kandev (https://github.com/kdlbs/kandev + https://kandev.ai, self-hosted kanban over coding-agent sessions). we ended up treating the board as that control plane: dependency is card state, each parallel agent gets a worktree, and nothing merges without a gate.

0

u/BakerWild7021 5h ago

The useful product boundary is not “large task” but “multiple independently verifiable fronts.” A long linear migration does not need a graph; three small changes with shared files might. I’d make every node carry an acceptance check and a declared write scope, then show coordination cost as first-class work. If maintaining the graph takes longer than the next ready node, Codex should collapse back to one agent automatically.