taskflow-core 0.1.0

package/dist/context-store.js

@@ -0,0 +1,383 @@
+/**
+ * Shared Context Tree — the file-based blackboard + supervision-tree store.
+ *
+ * This module is the IPC substrate that lets isolated subagent processes share
+ * context with each other (a horizontal blackboard) and report results upward
+ * so a parent can react (a vertical supervision tree). It deliberately reuses
+ * the SAME atomic-write + file-lock primitives as the run store (`store.ts`),
+ * so it inherits the project's "all file ops are atomic" invariant for free.
+ *
+ * On-disk layout, rooted at PI_TASKFLOW_CTX_DIR (one directory per run):
+ *
+ *   <ctxDir>/
+ *   ├── tree.json                  the node tree (who spawned whom + status)
+ *   ├── tree.json.lock             lock guarding tree.json RMW cycles
+ *   ├── findings/
+ *   │   ├── <nodeId>.json          findings written by one node (last-write-wins per key)
+ *   │   └── <nodeId>.json.lock
+ *   ├── reports/
+ *   │   └── <nodeId>.json          a node's upward report ({summary, structured?})
+ *   └── pending/
+ *       └── <nodeId>-<seq>.json    a ctx_spawn intent the runtime will pick up
+ *
+ * Why per-node findings files (not one shared findings.json): sibling subagents
+ * run concurrently. Giving each node its OWN file means concurrent writers never
+ * contend on the same lock — a node only locks its own file. A reader unions the
+ * relevant nodes' files (its ancestors + completed siblings). This is the same
+ * "shard by writer" trick the run index uses to avoid a global write bottleneck.
+ */
+import * as crypto from "node:crypto";
+import * as fs from "node:fs";
+import * as path from "node:path";
+import { validateRunId, withLock, writeFileAtomic } from "./store.js";
+// ---------------------------------------------------------------------------
+// Guards (size + key charset). A subagent is untrusted input from the LLM's
+// point of view; cap what it can write so a runaway tool call can't fill the
+// disk or smuggle a path-traversal key.
+// ---------------------------------------------------------------------------
+/** Max bytes for a single findings value (after JSON.stringify). */
+export const MAX_VALUE_BYTES = 256 * 1024; // 256 KB
+/** Max bytes for a single report summary string. */
+export const MAX_REPORT_BYTES = 256 * 1024;
+/** Max bytes for a report's structured payload (after JSON.stringify). */
+export const MAX_STRUCTURED_BYTES = 256 * 1024;
+/** Max bytes for a single ctx_spawn task prompt. */
+export const MAX_TASK_BYTES = 64 * 1024;
+/** Max number of keys one node may write. */
+export const MAX_KEYS_PER_NODE = 256;
+/** Max assignments a single ctx_spawn call may queue. */
+export const MAX_SPAWN_ASSIGNMENTS = 16;
+/** Max bytes for a single ctx_spawn `subflow` payload (after JSON.stringify). */
+export const MAX_SUBFLOW_BYTES = 256 * 1024; // 256 KB
+/** A findings/report key must be a short, traversal-safe token. */
+const KEY_RE = /^[A-Za-z0-9._-]{1,128}$/;
+export function isValidKey(key) {
+    return typeof key === "string" && KEY_RE.test(key) && !key.includes("..");
+}
+// ---------------------------------------------------------------------------
+// Path helpers
+// ---------------------------------------------------------------------------
+function treePath(ctxDir) {
+    return path.join(ctxDir, "tree.json");
+}
+function treeLockPath(ctxDir) {
+    return path.join(ctxDir, "tree.json.lock");
+}
+function findingsDir(ctxDir) {
+    return path.join(ctxDir, "findings");
+}
+function findingsPath(ctxDir, nodeId) {
+    return path.join(findingsDir(ctxDir), `${nodeId}.json`);
+}
+function findingsLockPath(ctxDir, nodeId) {
+    return path.join(findingsDir(ctxDir), `${nodeId}.json.lock`);
+}
+function reportsDir(ctxDir) {
+    return path.join(ctxDir, "reports");
+}
+function reportPath(ctxDir, nodeId) {
+    return path.join(reportsDir(ctxDir), `${nodeId}.json`);
+}
+function pendingDir(ctxDir) {
+    return path.join(ctxDir, "pending");
+}
+/** Build the per-run ctx directory path under a runs root. */
+export function ctxDirFor(runsRoot, runId) {
+    if (!validateRunId(runId))
+        throw new Error(`Unsafe runId for ctx dir: ${runId}`);
+    return path.join(runsRoot, "ctx", runId);
+}
+/**
+ * Ensure the ctx directory tree exists. Idempotent; safe to call repeatedly.
+ * Returns the same ctxDir for chaining.
+ */
+export function initCtxDir(ctxDir) {
+    fs.mkdirSync(ctxDir, { recursive: true });
+    fs.mkdirSync(findingsDir(ctxDir), { recursive: true });
+    fs.mkdirSync(reportsDir(ctxDir), { recursive: true });
+    fs.mkdirSync(pendingDir(ctxDir), { recursive: true });
+    return ctxDir;
+}
+// ---------------------------------------------------------------------------
+// Tree
+// ---------------------------------------------------------------------------
+export function readTree(ctxDir) {
+    try {
+        const raw = fs.readFileSync(treePath(ctxDir), "utf-8");
+        const parsed = JSON.parse(raw);
+        if (parsed && Array.isArray(parsed.nodes))
+            return parsed;
+    }
+    catch {
+        /* missing/corrupt → empty tree */
+    }
+    return { nodes: [] };
+}
+/**
+ * Register (or update) a node in the tree. IDEMPOTENT — upserts by nodeId so a
+ * resume that re-runs a phase does not duplicate tree entries (which would
+ * double-count ancestor findings). This is the C3 resume-safety fix.
+ */
+export function registerNode(ctxDir, nodeId, phaseId, parentNodeId, status = "running") {
+    if (!validateRunId(nodeId))
+        throw new Error(`Unsafe nodeId: ${nodeId}`);
+    withLock(treeLockPath(ctxDir), () => {
+        const tree = readTree(ctxDir);
+        const now = Date.now();
+        const idx = tree.nodes.findIndex((n) => n.nodeId === nodeId);
+        if (idx >= 0) {
+            const existing = tree.nodes[idx];
+            tree.nodes[idx] = {
+                ...existing,
+                phaseId,
+                parentNodeId,
+                status,
+                updatedAt: now,
+            };
+        }
+        else {
+            tree.nodes.push({ nodeId, phaseId, parentNodeId, status, createdAt: now, updatedAt: now });
+        }
+        writeFileAtomic(treePath(ctxDir), JSON.stringify(tree, null, 2));
+    });
+}
+export function setNodeStatus(ctxDir, nodeId, status) {
+    withLock(treeLockPath(ctxDir), () => {
+        const tree = readTree(ctxDir);
+        const node = tree.nodes.find((n) => n.nodeId === nodeId);
+        if (!node)
+            return;
+        node.status = status;
+        node.updatedAt = Date.now();
+        writeFileAtomic(treePath(ctxDir), JSON.stringify(tree, null, 2));
+    });
+}
+/** Compute a node's depth (root = 0) by walking the parent chain. */
+export function nodeDepth(tree, nodeId) {
+    let depth = 0;
+    let current = tree.nodes.find((n) => n.nodeId === nodeId);
+    const seen = new Set();
+    while (current?.parentNodeId && !seen.has(current.nodeId)) {
+        seen.add(current.nodeId);
+        depth++;
+        const parentId = current.parentNodeId;
+        current = tree.nodes.find((n) => n.nodeId === parentId);
+    }
+    return depth;
+}
+/** Return the ancestor chain nodeIds for a node (excluding itself), in nearest-first order (parent, grandparent, …). */
+export function ancestorIds(tree, nodeId) {
+    const out = [];
+    const seen = new Set([nodeId]);
+    let current = tree.nodes.find((n) => n.nodeId === nodeId);
+    while (current?.parentNodeId && !seen.has(current.parentNodeId)) {
+        out.push(current.parentNodeId);
+        seen.add(current.parentNodeId);
+        const parentId = current.parentNodeId;
+        current = tree.nodes.find((n) => n.nodeId === parentId);
+    }
+    return out;
+}
+// ---------------------------------------------------------------------------
+// Findings (the horizontal blackboard)
+// ---------------------------------------------------------------------------
+export function readNodeFindings(ctxDir, nodeId) {
+    if (!validateRunId(nodeId))
+        return {}; // defense-in-depth: never build a path from an unsafe id
+    try {
+        const raw = fs.readFileSync(findingsPath(ctxDir, nodeId), "utf-8");
+        const parsed = JSON.parse(raw);
+        if (parsed && typeof parsed === "object" && !Array.isArray(parsed))
+            return parsed;
+    }
+    catch {
+        /* missing/corrupt → empty */
+    }
+    return {};
+}
+/**
+ * Write one finding (last-write-wins per key) into THIS node's findings file.
+ * Only locks the node's own file → concurrent siblings never contend.
+ * Throws on bad key / oversized value / too many keys (caller surfaces as tool error).
+ */
+export function writeFinding(ctxDir, nodeId, key, value) {
+    if (!validateRunId(nodeId))
+        throw new Error(`Unsafe nodeId: ${nodeId}`);
+    if (!isValidKey(key))
+        throw new Error(`Invalid finding key '${key}' (allowed: [A-Za-z0-9._-], <=128 chars, no '..').`);
+    const serialized = JSON.stringify(value ?? null);
+    if (Buffer.byteLength(serialized, "utf-8") > MAX_VALUE_BYTES) {
+        throw new Error(`Finding '${key}' exceeds ${MAX_VALUE_BYTES} bytes.`);
+    }
+    fs.mkdirSync(findingsDir(ctxDir), { recursive: true });
+    withLock(findingsLockPath(ctxDir, nodeId), () => {
+        const findings = readNodeFindings(ctxDir, nodeId);
+        if (!(key in findings) && Object.keys(findings).length >= MAX_KEYS_PER_NODE) {
+            throw new Error(`Node '${nodeId}' exceeds ${MAX_KEYS_PER_NODE} findings keys.`);
+        }
+        findings[key] = JSON.parse(serialized);
+        writeFileAtomic(findingsPath(ctxDir, nodeId), JSON.stringify(findings, null, 2));
+    });
+}
+/**
+ * Read the findings visible to a node: its OWN findings unioned with its
+ * ancestors' and all sibling/other nodes' findings that are already `done`.
+ * "done" visibility prevents reading a half-written blackboard from a sibling
+ * that is still running (eventual consistency: you see a sibling's findings
+ * once it has reported completion). The node's own findings are always visible.
+ *
+ * On key conflicts: nearer scope wins (own > ancestors > completed others),
+ * matching intuition that a node trusts its own/closer notes most.
+ *
+ * @param key  optional — return only that key's value (or undefined).
+ */
+export function readVisibleFindings(ctxDir, nodeId, key) {
+    if (!validateRunId(nodeId))
+        return key !== undefined ? undefined : {};
+    const tree = readTree(ctxDir);
+    const ancestors = new Set(ancestorIds(tree, nodeId));
+    // Build layered maps; merge order = lowest priority first.
+    const completedOthers = {};
+    const ancestorFindings = {};
+    for (const n of tree.nodes) {
+        if (n.nodeId === nodeId)
+            continue;
+        const f = readNodeFindings(ctxDir, n.nodeId);
+        if (ancestors.has(n.nodeId)) {
+            Object.assign(ancestorFindings, f);
+        }
+        else if (n.status === "done") {
+            Object.assign(completedOthers, f);
+        }
+    }
+    const own = readNodeFindings(ctxDir, nodeId);
+    const merged = { ...completedOthers, ...ancestorFindings, ...own };
+    if (key !== undefined) {
+        if (!isValidKey(key))
+            return undefined;
+        return merged[key];
+    }
+    return merged;
+}
+// ---------------------------------------------------------------------------
+// Reports (the vertical upward channel)
+// ---------------------------------------------------------------------------
+export function writeReport(ctxDir, nodeId, summary, structured) {
+    if (!validateRunId(nodeId))
+        throw new Error(`Unsafe nodeId: ${nodeId}`);
+    if (Buffer.byteLength(String(summary ?? ""), "utf-8") > MAX_REPORT_BYTES) {
+        throw new Error(`Report summary exceeds ${MAX_REPORT_BYTES} bytes.`);
+    }
+    if (structured !== undefined && Buffer.byteLength(JSON.stringify(structured ?? null), "utf-8") > MAX_STRUCTURED_BYTES) {
+        throw new Error(`Report 'structured' payload exceeds ${MAX_STRUCTURED_BYTES} bytes.`);
+    }
+    fs.mkdirSync(reportsDir(ctxDir), { recursive: true });
+    // No lock: each node owns its own report file and is a single process, so the
+    // pure-overwrite writeFileAtomic is race-free here (unlike findings, which do
+    // read-modify-write and therefore lock).
+    const report = { nodeId, summary: String(summary ?? ""), structured, at: Date.now() };
+    writeFileAtomic(reportPath(ctxDir, nodeId), JSON.stringify(report, null, 2));
+}
+export function readReport(ctxDir, nodeId) {
+    if (!validateRunId(nodeId))
+        return undefined;
+    try {
+        const raw = fs.readFileSync(reportPath(ctxDir, nodeId), "utf-8");
+        const parsed = JSON.parse(raw);
+        if (parsed && typeof parsed.summary === "string")
+            return parsed;
+    }
+    catch {
+        /* none */
+    }
+    return undefined;
+}
+// ---------------------------------------------------------------------------
+// Pending spawns (ctx_spawn intents → runtime supervision loop)
+// ---------------------------------------------------------------------------
+/** Queue a ctx_spawn intent. Each call writes a unique file the runtime picks up. */
+export function queueSpawn(ctxDir, parentNodeId, assignments) {
+    if (!validateRunId(parentNodeId))
+        throw new Error(`Unsafe nodeId: ${parentNodeId}`);
+    if (!Array.isArray(assignments) || assignments.length === 0) {
+        throw new Error("ctx_spawn requires a non-empty assignments array.");
+    }
+    if (assignments.length > MAX_SPAWN_ASSIGNMENTS) {
+        throw new Error(`ctx_spawn limited to ${MAX_SPAWN_ASSIGNMENTS} assignments per call.`);
+    }
+    const clean = assignments.map((a) => {
+        if (!a || typeof a !== "object") {
+            throw new Error("Each ctx_spawn assignment must be an object with 'task' or 'subflow'.");
+        }
+        const hasTask = typeof a.task === "string" && a.task.trim().length > 0;
+        const hasSubflow = a.subflow !== undefined && a.subflow !== null;
+        // XOR: exactly one of task / subflow. Check subflow first so a pure-subflow
+        // assignment (no `task`) is never rejected by the task-required branch.
+        if (hasSubflow) {
+            if (hasTask) {
+                throw new Error("A ctx_spawn assignment has both 'task' and 'subflow' — provide exactly one.");
+            }
+            const bytes = Buffer.byteLength(JSON.stringify(a.subflow), "utf-8");
+            if (bytes > MAX_SUBFLOW_BYTES) {
+                throw new Error(`ctx_spawn subflow exceeds ${MAX_SUBFLOW_BYTES} bytes.`);
+            }
+            return { subflow: a.subflow, defaultAgent: typeof a.defaultAgent === "string" ? a.defaultAgent : undefined };
+        }
+        if (hasTask) {
+            if (Buffer.byteLength(a.task, "utf-8") > MAX_TASK_BYTES) {
+                throw new Error(`ctx_spawn task exceeds ${MAX_TASK_BYTES} bytes.`);
+            }
+            return { task: a.task, agent: typeof a.agent === "string" ? a.agent : undefined };
+        }
+        throw new Error("Each ctx_spawn assignment needs exactly one of 'task' (non-empty string) or 'subflow' (object).");
+    });
+    fs.mkdirSync(pendingDir(ctxDir), { recursive: true });
+    // Unique per call: time + crypto-random so two concurrent queueSpawn calls
+    // from the same parent in the same ms cannot collide (and overwrite).
+    const seq = `${Date.now().toString(36)}-${crypto.randomBytes(6).toString("hex")}`;
+    const payload = { parentNodeId, assignments: clean, at: Date.now() };
+    writeFileAtomic(path.join(pendingDir(ctxDir), `${parentNodeId}-${seq}.json`), JSON.stringify(payload, null, 2));
+    return clean.length;
+}
+/**
+ * Drain (read + delete) all pending spawn intents queued by a parent node.
+ * Returns the flattened assignment list. Used by the runtime supervision loop
+ * after a node's subagent finishes.
+ *
+ * INVARIANT: only call this AFTER the parent subagent process has exited. The
+ * read-then-unlink is not directory-locked, so a concurrent queueSpawn from a
+ * still-running parent could be missed. The runtime drains post-exit, so no
+ * concurrent writer exists.
+ */
+export function drainPendingSpawns(ctxDir, parentNodeId) {
+    if (!validateRunId(parentNodeId))
+        return [];
+    const dir = pendingDir(ctxDir);
+    let files;
+    try {
+        files = fs.readdirSync(dir).filter((f) => f.startsWith(`${parentNodeId}-`) && f.endsWith(".json"));
+    }
+    catch {
+        return [];
+    }
+    const out = [];
+    for (const f of files.sort()) {
+        const full = path.join(dir, f);
+        try {
+            const parsed = JSON.parse(fs.readFileSync(full, "utf-8"));
+            if (parsed && Array.isArray(parsed.assignments))
+                out.push(...parsed.assignments);
+        }
+        catch {
+            /* skip corrupt */
+        }
+        try {
+            fs.unlinkSync(full);
+        }
+        catch {
+            /* already gone */
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=context-store.js.map

package/dist/context-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-store.js","sourceRoot":"","sources":["../src/context-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AACtC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAEtE,8EAA8E;AAC9E,4EAA4E;AAC5E,6EAA6E;AAC7E,wCAAwC;AACxC,8EAA8E;AAE9E,oEAAoE;AACpE,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,SAAS;AACpD,oDAAoD;AACpD,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,GAAG,IAAI,CAAC;AAC3C,0EAA0E;AAC1E,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,GAAG,IAAI,CAAC;AAC/C,oDAAoD;AACpD,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,GAAG,IAAI,CAAC;AACxC,6CAA6C;AAC7C,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AACrC,yDAAyD;AACzD,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AACxC,iFAAiF;AACjF,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,SAAS;AAEtD,mEAAmE;AACnE,MAAM,MAAM,GAAG,yBAAyB,CAAC;AAEzC,MAAM,UAAU,UAAU,CAAC,GAAW;IACrC,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC3E,CAAC;AAyDD,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,SAAS,QAAQ,CAAC,MAAc;IAC/B,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AACvC,CAAC;AACD,SAAS,YAAY,CAAC,MAAc;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;AAC5C,CAAC;AACD,SAAS,WAAW,CAAC,MAAc;IAClC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AACtC,CAAC;AACD,SAAS,YAAY,CAAC,MAAc,EAAE,MAAc;IACnD,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,OAAO,CAAC,CAAC;AACzD,CAAC;AACD,SAAS,gBAAgB,CAAC,MAAc,EAAE,MAAc;IACvD,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,YAAY,CAAC,CAAC;AAC9D,CAAC;AACD,SAAS,UAAU,CAAC,MAAc;IACjC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AACrC,CAAC;AACD,SAAS,UAAU,CAAC,MAAc,EAAE,MAAc;IACjD,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,OAAO,CAAC,CAAC;AACxD,CAAC;AACD,SAAS,UAAU,CAAC,MAAc;IACjC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AACrC,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,KAAa;IACxD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,KAAK,EAAE,CAAC,CAAC;IACjF,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,MAAc;IACxC,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1C,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACvD,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,OAAO;AACP,8EAA8E;AAE9E,MAAM,UAAU,QAAQ,CAAC,MAAc;IACtC,IAAI,CAAC;QACJ,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAgB,CAAC;QAC9C,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;IAC1D,CAAC;IAAC,MAAM,CAAC;QACR,kCAAkC;IACnC,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AACtB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC3B,MAAc,EACd,MAAc,EACd,OAAe,EACf,YAAgC,EAChC,SAAqB,SAAS;IAE9B,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,MAAM,EAAE,CAAC,CAAC;IACxE,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE;QACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QAC7D,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;YACd,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAE,CAAC;YAClC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG;gBACjB,GAAG,QAAQ;gBACX,OAAO;gBACP,YAAY;gBACZ,MAAM;gBACN,SAAS,EAAE,GAAG;aACd,CAAC;QACH,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5F,CAAC;QACD,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,MAAc,EAAE,MAAc,EAAE,MAAkB;IAC/E,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE;QACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QACzD,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC5B,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,SAAS,CAAC,IAAiB,EAAE,MAAc;IAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,OAAO,EAAE,YAAY,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3D,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACzB,KAAK,EAAE,CAAC;QACR,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC;QACtC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,wHAAwH;AACxH,MAAM,UAAU,WAAW,CAAC,IAAiB,EAAE,MAAc;IAC5D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IACvC,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAC1D,OAAO,OAAO,EAAE,YAAY,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;QACjE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC;QACtC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,MAAc;IAC9D,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC,CAAC,yDAAyD;IAChG,IAAI,CAAC;QACJ,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;QACnE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAgB,CAAC;QAC9C,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;IACnF,CAAC;IAAC,MAAM,CAAC;QACR,6BAA6B;IAC9B,CAAC;IACD,OAAO,EAAE,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc,EAAE,MAAc,EAAE,GAAW,EAAE,KAAc;IACvF,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,MAAM,EAAE,CAAC,CAAC;IACxE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,GAAG,oDAAoD,CAAC,CAAC;IACvH,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;IACjD,IAAI,MAAM,CAAC,UAAU,CAAC,UAAU,EAAE,OAAO,CAAC,GAAG,eAAe,EAAE,CAAC;QAC9D,MAAM,IAAI,KAAK,CAAC,YAAY,GAAG,aAAa,eAAe,SAAS,CAAC,CAAC;IACvE,CAAC;IACD,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACvD,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,EAAE;QAC/C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAClD,IAAI,CAAC,CAAC,GAAG,IAAI,QAAQ,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,IAAI,iBAAiB,EAAE,CAAC;YAC7E,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,aAAa,iBAAiB,iBAAiB,CAAC,CAAC;QACjF,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACvC,eAAe,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CAClC,MAAc,EACd,MAAc,EACd,GAAY;IAEZ,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;QAAE,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;IACtE,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IACrD,2DAA2D;IAC3D,MAAM,eAAe,GAAgB,EAAE,CAAC;IACxC,MAAM,gBAAgB,GAAgB,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,SAAS;QAClC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;QACpC,CAAC;aAAM,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QACnC,CAAC;IACF,CAAC;IACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAgB,EAAE,GAAG,eAAe,EAAE,GAAG,gBAAgB,EAAE,GAAG,GAAG,EAAE,CAAC;IAChF,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QACvC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,wCAAwC;AACxC,8EAA8E;AAE9E,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,MAAc,EAAE,OAAe,EAAE,UAAoB;IAChG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,MAAM,EAAE,CAAC,CAAC;IACxE,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC1E,MAAM,IAAI,KAAK,CAAC,0BAA0B,gBAAgB,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,IAAI,IAAI,CAAC,EAAE,OAAO,CAAC,GAAG,oBAAoB,EAAE,CAAC;QACvH,MAAM,IAAI,KAAK,CAAC,uCAAuC,oBAAoB,SAAS,CAAC,CAAC;IACvF,CAAC;IACD,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,8EAA8E;IAC9E,8EAA8E;IAC9E,yCAAyC;IACzC,MAAM,MAAM,GAAe,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IAClG,eAAe,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9E,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,MAAc,EAAE,MAAc;IACxD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7C,IAAI,CAAC;QACJ,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAe,CAAC;QAC7C,IAAI,MAAM,IAAI,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ;YAAE,OAAO,MAAM,CAAC;IACjE,CAAC;IAAC,MAAM,CAAC;QACR,UAAU;IACX,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E,qFAAqF;AACrF,MAAM,UAAU,UAAU,CAAC,MAAc,EAAE,YAAoB,EAAE,WAA8B;IAC9F,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,YAAY,EAAE,CAAC,CAAC;IACpF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,WAAW,CAAC,MAAM,GAAG,qBAAqB,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,wBAAwB,qBAAqB,wBAAwB,CAAC,CAAC;IACxF,CAAC;IACD,MAAM,KAAK,GAAsB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACtD,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,uEAAuE,CAAC,CAAC;QAC1F,CAAC;QACD,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC;QACjE,4EAA4E;QAC5E,wEAAwE;QACxE,IAAI,UAAU,EAAE,CAAC;YAChB,IAAI,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,KAAK,CAAC,6EAA6E,CAAC,CAAC;YAChG,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;YACpE,IAAI,KAAK,GAAG,iBAAiB,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,6BAA6B,iBAAiB,SAAS,CAAC,CAAC;YAC1E,CAAC;YACD,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QAC9G,CAAC;QACD,IAAI,OAAO,EAAE,CAAC;YACb,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,IAAc,EAAE,OAAO,CAAC,GAAG,cAAc,EAAE,CAAC;gBACnE,MAAM,IAAI,KAAK,CAAC,0BAA0B,cAAc,SAAS,CAAC,CAAC;YACpE,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAc,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QAC7F,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,iGAAiG,CAAC,CAAC;IACpH,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,2EAA2E;IAC3E,sEAAsE;IACtE,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;IAClF,MAAM,OAAO,GAAiB,EAAE,YAAY,EAAE,WAAW,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IACnF,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,GAAG,YAAY,IAAI,GAAG,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAChH,OAAO,KAAK,CAAC,MAAM,CAAC;AACrB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAc,EAAE,YAAoB;IACtE,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5C,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAC/B,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACJ,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,YAAY,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;IACpG,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,EAAE,CAAC;IACX,CAAC;IACD,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC;YACJ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAiB,CAAC;YAC1E,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QAClF,CAAC;QAAC,MAAM,CAAC;YACR,kBAAkB;QACnB,CAAC;QACD,IAAI,CAAC;YACJ,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QAAC,MAAM,CAAC;YACR,kBAAkB;QACnB,CAAC;IACF,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/detached-runner.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Detached runner — spawned as a child process for background (detached) runs.
+ *
+ * Reads a context JSON file (path passed as argv[2]), calls executeTaskflow,
+ * and persists the terminal state.  Top-level try/catch writes status "failed"
+ * on crash.  Approval phases auto-reject in detached mode (no interactive
+ * approver available).
+ *
+ * This file is NOT imported by index.ts — it is spawned via `child_process.spawn`.
+ */
+export {};
+//# sourceMappingURL=detached-runner.d.ts.map

package/dist/detached-runner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detached-runner.d.ts","sourceRoot":"","sources":["../src/detached-runner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG"}

package/dist/detached-runner.js

@@ -0,0 +1,68 @@
+/**
+ * Detached runner — spawned as a child process for background (detached) runs.
+ *
+ * Reads a context JSON file (path passed as argv[2]), calls executeTaskflow,
+ * and persists the terminal state.  Top-level try/catch writes status "failed"
+ * on crash.  Approval phases auto-reject in detached mode (no interactive
+ * approver available).
+ *
+ * This file is NOT imported by index.ts — it is spawned via `child_process.spawn`.
+ */
+import { readFileSync } from "node:fs";
+import { discoverAgents, readSubagentSettings } from "./agents.js";
+import { executeTaskflow } from "./runtime.js";
+import { getFlow, loadRun, saveRun, DEFAULT_KEPT_RUNS, DEFAULT_RUN_AGE_DAYS } from "./store.js";
+const contextPath = process.argv[2];
+if (!contextPath) {
+    console.error("[detached-runner] Missing context file path argument");
+    process.exit(1);
+}
+let ctx;
+try {
+    ctx = JSON.parse(readFileSync(contextPath, "utf-8"));
+}
+catch (e) {
+    console.error(`[detached-runner] Failed to read context: ${e instanceof Error ? e.message : String(e)}`);
+    process.exit(1);
+}
+const cleanupConfig = { maxKeep: DEFAULT_KEPT_RUNS, maxAgeDays: DEFAULT_RUN_AGE_DAYS };
+try {
+    const state = loadRun(ctx.cwd, ctx.runId);
+    if (!state) {
+        console.error(`[detached-runner] Run not found: ${ctx.runId}`);
+        process.exit(1);
+    }
+    // Re-discover agents using the same settings as the host session.
+    const settings = readSubagentSettings();
+    cleanupConfig.maxKeep = settings.taskflow.maxKeptRuns;
+    cleanupConfig.maxAgeDays = settings.taskflow.maxRunAgeDays;
+    const scope = state.def.agentScope ?? "user";
+    const { agents } = discoverAgents(ctx.cwd, scope, settings.modelRoles, settings.taskflow);
+    const result = await executeTaskflow(state, {
+        cwd: ctx.cwd,
+        agents,
+        globalThinking: settings.globalThinking,
+        persist: (s) => saveRun(s, cleanupConfig),
+        // No requestApproval — approval phases auto-reject in detached/CI mode
+        // (safety: approval gates are never bypassed; the run records the rejection).
+        loadFlow: (name) => getFlow(ctx.cwd, name)?.def,
+    });
+    saveRun(result.state, cleanupConfig);
+}
+catch (e) {
+    // Top-level catch: persist failure so the host can poll the terminal state.
+    const message = e instanceof Error ? e.message : String(e);
+    console.error(`[detached-runner] Fatal: ${message}`);
+    try {
+        const state = loadRun(ctx.cwd, ctx.runId);
+        if (state && state.status === "running") {
+            state.status = "failed";
+            saveRun(state, cleanupConfig);
+        }
+    }
+    catch {
+        // Best-effort — if we can't even load the state, there's nothing to persist.
+    }
+    process.exit(1);
+}
+//# sourceMappingURL=detached-runner.js.map

package/dist/detached-runner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detached-runner.js","sourceRoot":"","sources":["../src/detached-runner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAmB,cAAc,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACpF,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAShG,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpC,IAAI,CAAC,WAAW,EAAE,CAAC;IAClB,OAAO,CAAC,KAAK,CAAC,sDAAsD,CAAC,CAAC;IACtE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,IAAI,GAAkB,CAAC;AACvB,IAAI,CAAC;IACJ,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,CAAC,CAAkB,CAAC;AACvE,CAAC;AAAC,OAAO,CAAC,EAAE,CAAC;IACZ,OAAO,CAAC,KAAK,CAAC,6CAA6C,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACzG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,MAAM,aAAa,GAAG,EAAE,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAC;AAEvF,IAAI,CAAC;IACJ,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;QACZ,OAAO,CAAC,KAAK,CAAC,oCAAoC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;QAC/D,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IAED,kEAAkE;IAClE,MAAM,QAAQ,GAAG,oBAAoB,EAAE,CAAC;IACxC,aAAa,CAAC,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC;IACtD,aAAa,CAAC,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,aAAa,CAAC;IAC3D,MAAM,KAAK,GAAe,KAAK,CAAC,GAAG,CAAC,UAAU,IAAI,MAAM,CAAC;IACzD,MAAM,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAE1F,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,KAAK,EAAE;QAC3C,GAAG,EAAE,GAAG,CAAC,GAAG;QACZ,MAAM;QACN,cAAc,EAAE,QAAQ,CAAC,cAAc;QACvC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,aAAa,CAAC;QACzC,uEAAuE;QACvE,8EAA8E;QAC9E,QAAQ,EAAE,CAAC,IAAY,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,GAAG;KACvD,CAAC,CAAC;IAEH,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;AACtC,CAAC;AAAC,OAAO,CAAC,EAAE,CAAC;IACZ,4EAA4E;IAC5E,MAAM,OAAO,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3D,OAAO,CAAC,KAAK,CAAC,4BAA4B,OAAO,EAAE,CAAC,CAAC;IACrD,IAAI,CAAC;QACJ,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACzC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACxB,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAC/B,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,6EAA6E;IAC9E,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC"}

package/dist/flowir/hash.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Content-addressed hashing for flow definitions.
+ *
+ * The canonical-JSON + SHA-256-truncation algorithm here is **vendored from
+ * overstory `packages/core/src/ir/hash.ts`** (pinned commit) so that
+ * pi-taskflow and overstory share one byte-identical hashing contract. This is
+ * the `M1` slice of the overstory-convergence roadmap: we are *not* compiling
+ * to overstory FlowIR yet (the IR compiler expects an explicit inject/emits
+ * model pi-taskflow doesn't have), but we share the **hash algorithm** now —
+ * the cheapest, lowest-risk piece of the contract — and put it to immediate
+ * work folding the flow *definition* into the cross-run cache key (M2).
+ *
+ * Why this matters: previously the cache key folded only the flow **name**
+ * (`flow:${flowName}`), so two structurally-different flows that happened to
+ * share a name + phase id + task could collide in the cross-run cache, and a
+ * flow that changed structure (but not name) could serve a stale hit. Folding
+ * `flowDefHash` (a content fingerprint of the desugared definition) closes
+ * that hole and is the foundation of "identical re-run is free ($0.00)".
+ *
+ * Pure module: no IO. Uses Web Crypto (`globalThis.crypto.subtle`) — therefore
+ * async — exactly like overstory's `hashIR`, so the contract is identical.
+ *
+ * @see docs/internal/overstory-convergence-roadmap.md §3 (M1, "cut B")
+ * @see docs/internal/rfc-flowir-compilation.md
+ */
+import type { Taskflow } from "../schema.ts";
+/**
+ * Deterministic JSON: recursively key-sorted (UTF-16 code units), no
+ * whitespace, `undefined` values dropped. Arrays keep their order (the
+ * desugared Taskflow is already in a canonical shape). Byte-identical to
+ * overstory's `canonicalJson` — do not diverge without bumping the contract
+ * and updating the parity test.
+ */
+export declare function canonicalJson(value: unknown): string;
+/** SHA-256 of the canonical serialization, first 16 bytes, lowercase hex.
+ *  Same shape as overstory's `hashCanonical` / RFC-001 content hashes. */
+export declare function hashCanonical(canonical: string): Promise<string>;
+/**
+ * Content fingerprint of a desugared `Taskflow` definition.
+ *
+ * Hashes the **definition** (structure + task text + declared deps), NOT the
+ * runtime `args` values — args vary per invocation and are already folded into
+ * each phase's `inputHash` via the interpolated task. `flowDefHash` answers a
+ * different question: "did the flow *itself* change?" Two flows are
+ * definitionally identical ⟺ this hash matches (key order / whitespace /
+ * optional-field presence do not affect it).
+ *
+ * Deterministic and async (Web Crypto), matching overstory's `hashIR` shape.
+ */
+export declare function flowDefHash(def: Taskflow): Promise<string>;
+//# sourceMappingURL=hash.d.ts.map

package/dist/flowir/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../src/flowir/hash.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAM7C;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAoBpD;AAMD;0EAC0E;AAC1E,wBAAsB,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAStE;AAMD;;;;;;;;;;;GAWG;AACH,wBAAsB,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAEhE"}

package/dist/flowir/hash.js

@@ -0,0 +1,90 @@
+/**
+ * Content-addressed hashing for flow definitions.
+ *
+ * The canonical-JSON + SHA-256-truncation algorithm here is **vendored from
+ * overstory `packages/core/src/ir/hash.ts`** (pinned commit) so that
+ * pi-taskflow and overstory share one byte-identical hashing contract. This is
+ * the `M1` slice of the overstory-convergence roadmap: we are *not* compiling
+ * to overstory FlowIR yet (the IR compiler expects an explicit inject/emits
+ * model pi-taskflow doesn't have), but we share the **hash algorithm** now —
+ * the cheapest, lowest-risk piece of the contract — and put it to immediate
+ * work folding the flow *definition* into the cross-run cache key (M2).
+ *
+ * Why this matters: previously the cache key folded only the flow **name**
+ * (`flow:${flowName}`), so two structurally-different flows that happened to
+ * share a name + phase id + task could collide in the cross-run cache, and a
+ * flow that changed structure (but not name) could serve a stale hit. Folding
+ * `flowDefHash` (a content fingerprint of the desugared definition) closes
+ * that hole and is the foundation of "identical re-run is free ($0.00)".
+ *
+ * Pure module: no IO. Uses Web Crypto (`globalThis.crypto.subtle`) — therefore
+ * async — exactly like overstory's `hashIR`, so the contract is identical.
+ *
+ * @see docs/internal/overstory-convergence-roadmap.md §3 (M1, "cut B")
+ * @see docs/internal/rfc-flowir-compilation.md
+ */
+// ---------------------------------------------------------------------------
+// Canonical JSON (vendored from overstory ir/hash.ts — byte-identical)
+// ---------------------------------------------------------------------------
+/**
+ * Deterministic JSON: recursively key-sorted (UTF-16 code units), no
+ * whitespace, `undefined` values dropped. Arrays keep their order (the
+ * desugared Taskflow is already in a canonical shape). Byte-identical to
+ * overstory's `canonicalJson` — do not diverge without bumping the contract
+ * and updating the parity test.
+ */
+export function canonicalJson(value) {
+    if (value === null || typeof value === "number" || typeof value === "boolean") {
+        return JSON.stringify(value);
+    }
+    if (typeof value === "string") {
+        return JSON.stringify(value);
+    }
+    if (Array.isArray(value)) {
+        return `[${value.map((item) => canonicalJson(item === undefined ? null : item)).join(",")}]`;
+    }
+    if (typeof value === "object") {
+        const record = value;
+        const keys = Object.keys(record)
+            .filter((key) => record[key] !== undefined)
+            .sort();
+        const body = keys.map((key) => `${JSON.stringify(key)}:${canonicalJson(record[key])}`);
+        return `{${body.join(",")}}`;
+    }
+    // undefined / function / symbol at the top level — not representable.
+    return "null";
+}
+// ---------------------------------------------------------------------------
+// Hashing (vendored from overstory ir/hash.ts — byte-identical)
+// ---------------------------------------------------------------------------
+/** SHA-256 of the canonical serialization, first 16 bytes, lowercase hex.
+ *  Same shape as overstory's `hashCanonical` / RFC-001 content hashes. */
+export async function hashCanonical(canonical) {
+    const bytes = new TextEncoder().encode(canonical);
+    const digest = await globalThis.crypto.subtle.digest("SHA-256", bytes);
+    const view = new Uint8Array(digest).slice(0, 16);
+    let hex = "";
+    for (const byte of view) {
+        hex += byte.toString(16).padStart(2, "0");
+    }
+    return hex;
+}
+// ---------------------------------------------------------------------------
+// Flow-definition fingerprint
+// ---------------------------------------------------------------------------
+/**
+ * Content fingerprint of a desugared `Taskflow` definition.
+ *
+ * Hashes the **definition** (structure + task text + declared deps), NOT the
+ * runtime `args` values — args vary per invocation and are already folded into
+ * each phase's `inputHash` via the interpolated task. `flowDefHash` answers a
+ * different question: "did the flow *itself* change?" Two flows are
+ * definitionally identical ⟺ this hash matches (key order / whitespace /
+ * optional-field presence do not affect it).
+ *
+ * Deterministic and async (Web Crypto), matching overstory's `hashIR` shape.
+ */
+export async function flowDefHash(def) {
+    return hashCanonical(canonicalJson(def));
+}
+//# sourceMappingURL=hash.js.map

package/dist/flowir/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/flowir/hash.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAIH,8EAA8E;AAC9E,uEAAuE;AACvE,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAAc;IAC3C,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/E,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAC9F,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,KAAgC,CAAC;QAChD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;aAC9B,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;aAC1C,IAAI,EAAE,CAAC;QACT,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACvF,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAC9B,CAAC;IACD,sEAAsE;IACtE,OAAO,MAAM,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E;0EAC0E;AAC1E,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,SAAiB;IACpD,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjD,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACzB,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,8EAA8E;AAC9E,8BAA8B;AAC9B,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,GAAa;IAC9C,OAAO,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1C,CAAC"}