pair-planninglisted

# Pair-Planning: symmetric plan-to-consensus with Codex Two frontier models plan the same task **independently**, then converge. You (Claude) hold the session context and orchestrate; Codex is the fresh pair of eyes. The deliverable is a single agreed plan — **read-only, no implementation**. All Codex round-trips go through the helper, never `codex` directly: ``` "${CLAUDE_PLUGIN_ROOT}/scripts/pair-codex" fresh <dir> <prompt_file> r0 # start session "${CLAUDE_PLUGIN_ROOT}/scripts/pair-codex" resume <dir> <prompt_file> r<n> # continue it ``` The helper enforces the correct invocation (`--json -o`, stdin closed, read-only, thread-id capture, fail-hard). It prints Codex's final message to stdout and writes `<dir>/<label>.{jsonl,last,err}` plus `<dir>/thread_id`. Effort defaults to `xhigh`; override per call with `CODEX_EFFORT=high` when a round is light, or `CODEX_EFFORT=max` for a genuinely hard round. Planning is reasoning-heavy — don't downgrade the model tier. ## 1. Setup + launch Codex in the background Action 0, the moment you're invoked — get Codex planning *before* you do, so the two plans are written in parallel and neither side anchors on the other. 1. Pick the session slug (your handle — you control it) and create its dir: ```bash slug="$(date +%s)-$(printf '%s' "$ARGUMENTS" | tr -cs 'A-Za-z0-9' '-' | cut -c1-40)" dir="/tmp/pair-planning/$slug"; mkdir -p "$dir"; echo "$dir" ``` Use the printed path literally in every later step — shell var