@synaplink/orqlaude 0.3.0

package/dist/lib/hallucination.js

@@ -0,0 +1,154 @@
+import { promises as fs } from "node:fs";
+import path from "node:path";
+const EDIT_TOOLS = new Set(["Edit", "Write", "MultiEdit", "NotebookEdit"]);
+const READ_TOOLS = new Set(["Read", "Grep", "Glob", "NotebookRead"]);
+/**
+ * Score a session by inspecting its full set of tool_use events (extracted by
+ * the caller from the JSONL). cwd is the worktree root to check paths against.
+ */
+export async function detectHallucination(toolUses, cwd) {
+    const concerns = [];
+    let score = 0;
+    // ---- Check 1: path-existence ---------------------------------------------
+    const referencedPaths = new Set();
+    for (const tu of toolUses) {
+        const p = extractPathFromToolUse(tu);
+        if (p)
+            referencedPaths.add(p);
+    }
+    const missing = [];
+    for (const p of referencedPaths) {
+        if (!path.isAbsolute(p))
+            continue; // skip relative; we'd need worktree context
+        if (!p.startsWith(cwd) && !p.startsWith("/tmp"))
+            continue; // outside worktree, skip
+        try {
+            await fs.access(p);
+        }
+        catch {
+            missing.push(p);
+        }
+    }
+    if (missing.length > 0) {
+        const ratio = missing.length / Math.max(1, referencedPaths.size);
+        if (ratio > 0.3 || missing.length >= 3) {
+            score += 0.4;
+            concerns.push(`Referenced ${missing.length} path(s) that don't exist in the worktree: ${missing
+                .slice(0, 3)
+                .join(", ")}${missing.length > 3 ? ` (+${missing.length - 3} more)` : ""}`);
+        }
+        else if (missing.length > 0) {
+            score += 0.1;
+            concerns.push(`Minor: ${missing.length} referenced path(s) missing — could be in-flight files.`);
+        }
+    }
+    // ---- Check 2a: edit-without-prior-read -----------------------------------
+    const editedWithoutRead = [];
+    const readPaths = new Set();
+    for (const tu of toolUses) {
+        if (READ_TOOLS.has(tu.name)) {
+            const p = extractPathFromToolUse(tu);
+            if (p)
+                readPaths.add(p);
+        }
+        else if (EDIT_TOOLS.has(tu.name)) {
+            const p = extractPathFromToolUse(tu);
+            if (p && !readPaths.has(p) && tu.name !== "Write") {
+                // Write is OK without read (new file). Edit/MultiEdit needs prior read.
+                editedWithoutRead.push(p);
+            }
+        }
+    }
+    if (editedWithoutRead.length > 0) {
+        score += 0.15;
+        concerns.push(`Edited ${editedWithoutRead.length} file(s) without first reading them: ${editedWithoutRead
+            .slice(0, 2)
+            .join(", ")}. Agent may be guessing at file contents.`);
+    }
+    // ---- Check 2b: repeated identical tool calls (tight loop) ---------------
+    const seen = new Map();
+    for (const tu of toolUses) {
+        const key = JSON.stringify({ n: tu.name, i: tu.input });
+        seen.set(key, (seen.get(key) ?? 0) + 1);
+    }
+    const maxRepeat = Math.max(0, ...seen.values());
+    if (maxRepeat >= 4) {
+        score += 0.2;
+        concerns.push(`Repeated the same tool call ${maxRepeat} times — agent may be looping.`);
+    }
+    else if (maxRepeat === 3) {
+        score += 0.05;
+        concerns.push(`Repeated the same tool call 3 times — possible loop.`);
+    }
+    // ---- Check 2c: commit without testing ------------------------------------
+    // Heuristic: look for `git commit` in Bash tool calls without any prior Bash
+    // call that includes test/check/lint.
+    const bashCmds = toolUses
+        .filter((tu) => tu.name === "Bash")
+        .map((tu) => String(tu.input?.command ?? ""));
+    const committed = bashCmds.some((c) => /\bgit\s+commit\b/.test(c));
+    const tested = bashCmds.some((c) => /\b(npm\s+test|pytest|cargo\s+test|tsc|lint|check|jest|vitest|mocha)\b/.test(c));
+    if (committed && !tested) {
+        score += 0.1;
+        concerns.push(`Committed without running tests/typecheck. Worth verifying before merge.`);
+    }
+    return {
+        score: Math.min(1, score),
+        level: levelFromScore(score),
+        concerns,
+    };
+}
+function levelFromScore(s) {
+    if (s >= 0.6)
+        return "severe";
+    if (s >= 0.3)
+        return "moderate";
+    if (s >= 0.1)
+        return "minor";
+    return "clean";
+}
+function extractPathFromToolUse(tu) {
+    const i = tu.input;
+    if (!i || typeof i !== "object")
+        return null;
+    return ((typeof i.file_path === "string" && i.file_path) ||
+        (typeof i.path === "string" && i.path) ||
+        (typeof i.notebook_path === "string" && i.notebook_path) ||
+        null);
+}
+/**
+ * Extract all tool_use events from a JSONL-derived snapshot's raw lines.
+ * The snapshot module currently only keeps the *last* tool_use; for
+ * hallucination detection we need the full history. This re-reads the JSONL.
+ */
+export async function extractToolUses(jsonlPath) {
+    try {
+        const raw = await fs.readFile(jsonlPath, "utf8");
+        const out = [];
+        for (const line of raw.split("\n")) {
+            if (!line.trim())
+                continue;
+            let evt;
+            try {
+                evt = JSON.parse(line);
+            }
+            catch {
+                continue;
+            }
+            if (evt.type === "assistant" && Array.isArray(evt.message?.content)) {
+                for (const block of evt.message.content) {
+                    if (block.type === "tool_use") {
+                        out.push({ name: block.name, input: block.input });
+                    }
+                }
+            }
+        }
+        return out;
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return [];
+        throw err;
+    }
+}
+//# sourceMappingURL=hallucination.js.map

package/dist/lib/hallucination.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hallucination.js","sourceRoot":"","sources":["../../src/lib/hallucination.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,IAAI,MAAM,WAAW,CAAC;AAuC7B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC;AAC3E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;AAErE;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,QAAwB,EACxB,GAAW;IAEX,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,6EAA6E;IAC7E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC;YAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAAE,SAAS,CAAC,4CAA4C;QAC/E,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,SAAS,CAAC,yBAAyB;QACpF,IAAI,CAAC;YACH,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;QACjE,IAAI,KAAK,GAAG,GAAG,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACvC,KAAK,IAAI,GAAG,CAAC;YACb,QAAQ,CAAC,IAAI,CACX,cAAc,OAAO,CAAC,MAAM,8CAA8C,OAAO;iBAC9E,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;iBACX,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7E,CAAC;QACJ,CAAC;aAAM,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,KAAK,IAAI,GAAG,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,UAAU,OAAO,CAAC,MAAM,yDAAyD,CAAC,CAAC;QACnG,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,MAAM,iBAAiB,GAAa,EAAE,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;aAAM,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAClD,wEAAwE;gBACxE,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACjC,KAAK,IAAI,IAAI,CAAC;QACd,QAAQ,CAAC,IAAI,CACX,UAAU,iBAAiB,CAAC,MAAM,wCAAwC,iBAAiB;aACxF,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,IAAI,CAAC,IAAI,CAAC,2CAA2C,CACzD,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;QACxD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAChD,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,KAAK,IAAI,GAAG,CAAC;QACb,QAAQ,CAAC,IAAI,CAAC,+BAA+B,SAAS,gCAAgC,CAAC,CAAC;IAC1F,CAAC;SAAM,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QAC3B,KAAK,IAAI,IAAI,CAAC;QACd,QAAQ,CAAC,IAAI,CAAC,sDAAsD,CAAC,CAAC;IACxE,CAAC;IAED,6EAA6E;IAC7E,6EAA6E;IAC7E,sCAAsC;IACtC,MAAM,QAAQ,GAAG,QAAQ;SACtB,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC;SAClC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC;IAChD,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACjC,uEAAuE,CAAC,IAAI,CAAC,CAAC,CAAC,CAChF,CAAC;IACF,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,CAAC;QACzB,KAAK,IAAI,GAAG,CAAC;QACb,QAAQ,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;IAC5F,CAAC;IAED,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC;QACzB,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC;QAC5B,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,CAAS;IAC/B,IAAI,CAAC,IAAI,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC9B,IAAI,CAAC,IAAI,GAAG;QAAE,OAAO,UAAU,CAAC;IAChC,IAAI,CAAC,IAAI,GAAG;QAAE,OAAO,OAAO,CAAC;IAC7B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,sBAAsB,CAAC,EAAgB;IAC9C,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;IACnB,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC7C,OAAO,CACL,CAAC,OAAO,CAAC,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,CAAC,SAAS,CAAC;QAChD,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC;QACtC,CAAC,OAAO,CAAC,CAAC,aAAa,KAAK,QAAQ,IAAI,CAAC,CAAC,aAAa,CAAC;QACxD,IAAI,CACL,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,SAAiB;IACrD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QACjD,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,SAAS;YAC3B,IAAI,GAAQ,CAAC;YACb,IAAI,CAAC;gBACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;gBACpE,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;oBACxC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;wBAC9B,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;oBACrD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAAC,OAAO,GAAQ,EAAE,CAAC;QAClB,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;QACrC,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC"}

package/dist/lib/jsonl_tail.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Read the tail of a Claude Code session JSONL and derive a status snapshot.
+ *
+ * Session files live at:
+ *   ~/.claude/projects/<encoded-cwd>/<session-id>.jsonl
+ *
+ * v0.2.0 optimization: per-session byte-offset cache. After the first full
+ * read we remember where we stopped and only parse new bytes on subsequent
+ * snapshots. This matters for long-running fleets where status() is polled
+ * frequently against multi-MB JSONLs.
+ *
+ * The cache lives in-process; on MCP server restart it's rebuilt by re-reading
+ * the file once. Cache hit reduces a `status()` call from O(filesize) to
+ * O(new-bytes-only).
+ */
+export interface SessionSnapshot {
+    exists: boolean;
+    sessionId: string;
+    jsonlPath: string;
+    totalCostUsd: number;
+    inputTokens: number;
+    outputTokens: number;
+    cacheReadTokens: number;
+    cacheCreationTokens: number;
+    totalEffectiveTokens: number;
+    lastEventType: string | null;
+    lastActivityAt: number | null;
+    lastAssistantText: string | null;
+    lastToolUse: {
+        name: string;
+        input: unknown;
+    } | null;
+    terminated: boolean;
+    terminationReason: string | null;
+}
+export declare function encodeCwdForProjects(cwd: string): string;
+export declare function jsonlPathFor(cwd: string, sessionId: string): string;
+export declare function snapshotSession(cwd: string, sessionId: string): Promise<SessionSnapshot>;
+/** For tests / forced refresh. */
+export declare function clearTailCache(): void;

package/dist/lib/jsonl_tail.js

@@ -0,0 +1,126 @@
+import { promises as fs } from "node:fs";
+import path from "node:path";
+const HOME = process.env.HOME ?? process.env.USERPROFILE ?? "";
+export function encodeCwdForProjects(cwd) {
+    return cwd.replace(/[\/]/g, "-");
+}
+export function jsonlPathFor(cwd, sessionId) {
+    return path.join(HOME, ".claude", "projects", encodeCwdForProjects(cwd), `${sessionId}.jsonl`);
+}
+const cache = new Map(); // keyed by jsonlPath
+function emptySnap(sessionId, jsonlPath) {
+    return {
+        exists: false,
+        sessionId,
+        jsonlPath,
+        totalCostUsd: 0,
+        inputTokens: 0,
+        outputTokens: 0,
+        cacheReadTokens: 0,
+        cacheCreationTokens: 0,
+        totalEffectiveTokens: 0,
+        lastEventType: null,
+        lastActivityAt: null,
+        lastAssistantText: null,
+        lastToolUse: null,
+        terminated: false,
+        terminationReason: null,
+    };
+}
+export async function snapshotSession(cwd, sessionId) {
+    const jsonlPath = jsonlPathFor(cwd, sessionId);
+    let stat;
+    try {
+        stat = await fs.stat(jsonlPath);
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return emptySnap(sessionId, jsonlPath);
+        throw err;
+    }
+    let entry = cache.get(jsonlPath);
+    // If the file shrank or rotated, reset.
+    if (entry && entry.byteOffset > stat.size) {
+        cache.delete(jsonlPath);
+        entry = undefined;
+    }
+    if (entry && entry.byteOffset === stat.size) {
+        return entry.snap; // no new data
+    }
+    // Read only the new bytes since last visit.
+    const startOffset = entry?.byteOffset ?? 0;
+    const carry = entry?.carry ?? "";
+    const snap = entry ? { ...entry.snap, exists: true } : { ...emptySnap(sessionId, jsonlPath), exists: true };
+    const fh = await fs.open(jsonlPath, "r");
+    try {
+        const buf = Buffer.alloc(stat.size - startOffset);
+        if (buf.byteLength > 0) {
+            await fh.read({ buffer: buf, position: startOffset });
+        }
+        const text = carry + buf.toString("utf8");
+        const lines = text.split("\n");
+        // Last element may be a partial line.
+        const newCarry = lines.pop() ?? "";
+        for (const line of lines) {
+            if (!line.trim())
+                continue;
+            let evt;
+            try {
+                evt = JSON.parse(line);
+            }
+            catch {
+                continue;
+            }
+            applyEvent(snap, evt);
+        }
+        cache.set(jsonlPath, { byteOffset: stat.size, carry: newCarry, snap });
+    }
+    finally {
+        await fh.close();
+    }
+    return snap;
+}
+function applyEvent(snap, evt) {
+    snap.lastEventType = evt.type ?? snap.lastEventType;
+    const ts = typeof evt.timestamp === "string" ? Date.parse(evt.timestamp) : undefined;
+    if (ts && !Number.isNaN(ts))
+        snap.lastActivityAt = ts;
+    const usage = evt.message?.usage ?? evt.usage;
+    if (usage) {
+        if (typeof usage.input_tokens === "number")
+            snap.inputTokens += usage.input_tokens;
+        if (typeof usage.output_tokens === "number")
+            snap.outputTokens += usage.output_tokens;
+        if (typeof usage.cache_read_input_tokens === "number")
+            snap.cacheReadTokens += usage.cache_read_input_tokens;
+        if (typeof usage.cache_creation_input_tokens === "number")
+            snap.cacheCreationTokens += usage.cache_creation_input_tokens;
+    }
+    snap.totalEffectiveTokens =
+        snap.inputTokens + snap.outputTokens + snap.cacheReadTokens + snap.cacheCreationTokens;
+    if (typeof evt.total_cost_usd === "number") {
+        snap.totalCostUsd = evt.total_cost_usd; // running total from result rows
+    }
+    else if (typeof evt.cost_usd === "number") {
+        snap.totalCostUsd += evt.cost_usd;
+    }
+    if (evt.type === "assistant" && Array.isArray(evt.message?.content)) {
+        for (const block of evt.message.content) {
+            if (block.type === "text" && typeof block.text === "string") {
+                snap.lastAssistantText = block.text.slice(0, 500);
+            }
+            else if (block.type === "tool_use") {
+                snap.lastToolUse = { name: block.name, input: block.input };
+            }
+        }
+    }
+    if (evt.type === "result") {
+        snap.terminated = true;
+        snap.terminationReason = evt.subtype ?? evt.terminal_reason ?? "completed";
+    }
+}
+/** For tests / forced refresh. */
+export function clearTailCache() {
+    cache.clear();
+}
+//# sourceMappingURL=jsonl_tail.js.map

package/dist/lib/jsonl_tail.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jsonl_tail.js","sourceRoot":"","sources":["../../src/lib/jsonl_tail.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,IAAI,MAAM,WAAW,CAAC;AA0C7B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,EAAE,CAAC;AAE/D,MAAM,UAAU,oBAAoB,CAAC,GAAW;IAC9C,OAAO,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,GAAW,EAAE,SAAiB;IACzD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,oBAAoB,CAAC,GAAG,CAAC,EAAE,GAAG,SAAS,QAAQ,CAAC,CAAC;AACjG,CAAC;AAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAC,qBAAqB;AAElE,SAAS,SAAS,CAAC,SAAiB,EAAE,SAAiB;IACrD,OAAO;QACL,MAAM,EAAE,KAAK;QACb,SAAS;QACT,SAAS;QACT,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,CAAC;QACd,YAAY,EAAE,CAAC;QACf,eAAe,EAAE,CAAC;QAClB,mBAAmB,EAAE,CAAC;QACtB,oBAAoB,EAAE,CAAC;QACvB,aAAa,EAAE,IAAI;QACnB,cAAc,EAAE,IAAI;QACpB,iBAAiB,EAAE,IAAI;QACvB,WAAW,EAAE,IAAI;QACjB,UAAU,EAAE,KAAK;QACjB,iBAAiB,EAAE,IAAI;KACxB,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,GAAW,EAAE,SAAiB;IAClE,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IAE/C,IAAI,IAAsB,CAAC;IAC3B,IAAI,CAAC;QACH,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAClC,CAAC;IAAC,OAAO,GAAQ,EAAE,CAAC;QAClB,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAClE,MAAM,GAAG,CAAC;IACZ,CAAC;IAED,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAEjC,wCAAwC;IACxC,IAAI,KAAK,IAAI,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1C,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACxB,KAAK,GAAG,SAAS,CAAC;IACpB,CAAC;IAED,IAAI,KAAK,IAAI,KAAK,CAAC,UAAU,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,cAAc;IACnC,CAAC;IAED,4CAA4C;IAC5C,MAAM,WAAW,GAAG,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,EAAE,CAAC;IACjC,MAAM,IAAI,GAAoB,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAE7H,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IACzC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,CAAC;QAClD,IAAI,GAAG,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/B,sCAAsC;QACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,SAAS;YAC3B,IAAI,GAAQ,CAAC;YACb,IAAI,CAAC;gBACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;IACzE,CAAC;YAAS,CAAC;QACT,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CAAC,IAAqB,EAAE,GAAQ;IACjD,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,aAAa,CAAC;IACpD,MAAM,EAAE,GAAG,OAAO,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrF,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QAAE,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;IAEtD,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC;IAC9C,IAAI,KAAK,EAAE,CAAC;QACV,IAAI,OAAO,KAAK,CAAC,YAAY,KAAK,QAAQ;YAAE,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,YAAY,CAAC;QACnF,IAAI,OAAO,KAAK,CAAC,aAAa,KAAK,QAAQ;YAAE,IAAI,CAAC,YAAY,IAAI,KAAK,CAAC,aAAa,CAAC;QACtF,IAAI,OAAO,KAAK,CAAC,uBAAuB,KAAK,QAAQ;YAAE,IAAI,CAAC,eAAe,IAAI,KAAK,CAAC,uBAAuB,CAAC;QAC7G,IAAI,OAAO,KAAK,CAAC,2BAA2B,KAAK,QAAQ;YAAE,IAAI,CAAC,mBAAmB,IAAI,KAAK,CAAC,2BAA2B,CAAC;IAC3H,CAAC;IACD,IAAI,CAAC,oBAAoB;QACvB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAAC;IAEzF,IAAI,OAAO,GAAG,CAAC,cAAc,KAAK,QAAQ,EAAE,CAAC;QAC3C,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,cAAc,CAAC,CAAC,iCAAiC;IAC3E,CAAC;SAAM,IAAI,OAAO,GAAG,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC5C,IAAI,CAAC,YAAY,IAAI,GAAG,CAAC,QAAQ,CAAC;IACpC,CAAC;IAED,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QACpE,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC5D,IAAI,CAAC,iBAAiB,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACpD,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBACrC,IAAI,CAAC,WAAW,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,iBAAiB,GAAG,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,eAAe,IAAI,WAAW,CAAC;IAC7E,CAAC;AACH,CAAC;AAED,kCAAkC;AAClC,MAAM,UAAU,cAAc;IAC5B,KAAK,CAAC,KAAK,EAAE,CAAC;AAChB,CAAC"}

package/dist/lib/pricing.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Per-model pricing as of model release.
+ * Numbers are USD per 1M tokens. Update when Anthropic publishes new pricing.
+ *
+ * `estimateAgentCost` is intentionally rough — it assumes a single agent burns
+ * roughly `baselineInputTokens` of system prompt + small per-turn user/tool
+ * input and produces `baselineOutputTokens` of output across the run. Refine
+ * by observing real runs and tuning the baselines.
+ */
+export interface Pricing {
+    inputPer1M: number;
+    outputPer1M: number;
+    cacheWritePer1M: number;
+    cacheReadPer1M: number;
+}
+export declare const MODEL_PRICING: Record<string, Pricing>;
+/**
+ * Rough cost estimate for one agent running a sub-task.
+ *
+ * Defaults assume a moderate task (~10 turns of reading/editing). Tune via the
+ * `effortMultiplier` argument: 0.5 for trivial, 1.0 for moderate, 2.0+ for
+ * heavy refactors. This estimate is a budgeting safety net, not a forecast.
+ */
+export declare function estimateAgentCost(model: string, effortMultiplier?: number): number;

package/dist/lib/pricing.js

@@ -0,0 +1,43 @@
+/**
+ * Per-model pricing as of model release.
+ * Numbers are USD per 1M tokens. Update when Anthropic publishes new pricing.
+ *
+ * `estimateAgentCost` is intentionally rough — it assumes a single agent burns
+ * roughly `baselineInputTokens` of system prompt + small per-turn user/tool
+ * input and produces `baselineOutputTokens` of output across the run. Refine
+ * by observing real runs and tuning the baselines.
+ */
+export const MODEL_PRICING = {
+    // Defaults; conservative for estimation.
+    "claude-opus-4-7": { inputPer1M: 15, outputPer1M: 75, cacheWritePer1M: 18.75, cacheReadPer1M: 1.5 },
+    "claude-sonnet-4-6": { inputPer1M: 3, outputPer1M: 15, cacheWritePer1M: 3.75, cacheReadPer1M: 0.3 },
+    "claude-haiku-4-5": { inputPer1M: 1, outputPer1M: 5, cacheWritePer1M: 1.25, cacheReadPer1M: 0.1 },
+    // Fallback for unrecognized models.
+    default: { inputPer1M: 3, outputPer1M: 15, cacheWritePer1M: 3.75, cacheReadPer1M: 0.3 },
+};
+function pricingFor(model) {
+    // Strip date suffix (e.g. "-20251001") and any [1m] context-window suffix.
+    const stripped = model.replace(/-\d{8}.*$/, "").replace(/\[[^\]]+\]$/, "");
+    return MODEL_PRICING[stripped] ?? MODEL_PRICING[model] ?? MODEL_PRICING.default;
+}
+/**
+ * Rough cost estimate for one agent running a sub-task.
+ *
+ * Defaults assume a moderate task (~10 turns of reading/editing). Tune via the
+ * `effortMultiplier` argument: 0.5 for trivial, 1.0 for moderate, 2.0+ for
+ * heavy refactors. This estimate is a budgeting safety net, not a forecast.
+ */
+export function estimateAgentCost(model, effortMultiplier = 1) {
+    const p = pricingFor(model);
+    // Baselines tuned to match an empirical haiku run we observed: ~30k cache-creation tokens, ~10 input, ~45 output → $0.038.
+    // Scale by multiplier and adjust output baseline upward for real work.
+    const cacheCreate = 30_000 * effortMultiplier;
+    const input = 1_000 * effortMultiplier;
+    const cacheRead = 50_000 * effortMultiplier; // most input tokens are cached after first turn
+    const output = 4_000 * effortMultiplier;
+    return ((cacheCreate * p.cacheWritePer1M) / 1_000_000 +
+        (input * p.inputPer1M) / 1_000_000 +
+        (cacheRead * p.cacheReadPer1M) / 1_000_000 +
+        (output * p.outputPer1M) / 1_000_000);
+}
+//# sourceMappingURL=pricing.js.map

package/dist/lib/pricing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pricing.js","sourceRoot":"","sources":["../../src/lib/pricing.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AASH,MAAM,CAAC,MAAM,aAAa,GAA4B;IACpD,yCAAyC;IACzC,iBAAiB,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,eAAe,EAAE,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE;IACnG,mBAAmB,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,eAAe,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE;IACnG,kBAAkB,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE;IACjG,oCAAoC;IACpC,OAAO,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,eAAe,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE;CACxF,CAAC;AAEF,SAAS,UAAU,CAAC,KAAa;IAC/B,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;IAC3E,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,OAAO,CAAC;AAClF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,gBAAgB,GAAG,CAAC;IACnE,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC5B,2HAA2H;IAC3H,uEAAuE;IACvE,MAAM,WAAW,GAAG,MAAM,GAAG,gBAAgB,CAAC;IAC9C,MAAM,KAAK,GAAG,KAAK,GAAG,gBAAgB,CAAC;IACvC,MAAM,SAAS,GAAG,MAAM,GAAG,gBAAgB,CAAC,CAAC,gDAAgD;IAC7F,MAAM,MAAM,GAAG,KAAK,GAAG,gBAAgB,CAAC;IACxC,OAAO,CACL,CAAC,WAAW,GAAG,CAAC,CAAC,eAAe,CAAC,GAAG,SAAS;QAC7C,CAAC,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,SAAS;QAClC,CAAC,SAAS,GAAG,CAAC,CAAC,cAAc,CAAC,GAAG,SAAS;QAC1C,CAAC,MAAM,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,SAAS,CACrC,CAAC;AACJ,CAAC"}

package/dist/lib/state.d.ts

@@ -0,0 +1,118 @@
+/**
+ * orqlaude state store — single JSON file per project, atomically written.
+ *
+ * Why JSON not SQLite: state is small (a fleet rarely has more than ~10 agents,
+ * a handful of notes/messages), and atomic JSON writes via tmp+rename are
+ * sufficient for the concurrency we expect (handful of MCP calls per second).
+ * If contention becomes a problem, swap to node:sqlite without changing the
+ * external API of this module.
+ *
+ * Schema version 2 (v0.2.0): tokens-first budget, file claims, audit
+ * resumability hooks.
+ */
+export type TaskStatus = "pending" | "dispatched" | "running" | "done" | "failed" | "cancelled";
+export type PlanStatus = "draft" | "estimating" | "awaiting_approval" | "approved" | "dispatching" | "running" | "collected" | "cancelled" | "cancelled_overbudget";
+export interface Task {
+    id: string;
+    title: string;
+    prompt: string;
+    tldr: string;
+    scope?: string[];
+    branchHint?: string;
+    status: TaskStatus;
+    spawnedSessionId?: string;
+    costUsd?: number;
+    tokensUsed?: number;
+    startedAt?: number;
+    finishedAt?: number;
+    prUrl?: string;
+    summary?: string;
+    exitReason?: string;
+    stopRequested?: {
+        reason: string;
+        requestedAt: number;
+    };
+}
+export interface Note {
+    id: string;
+    fromSessionId: string;
+    taskId: string;
+    text: string;
+    blocking: boolean;
+    postedAt: number;
+    acked: boolean;
+    prUrl?: string;
+}
+export interface Message {
+    id: string;
+    toSessionId: string;
+    fromTaskId?: string;
+    text: string;
+    queuedAt: number;
+    delivered: boolean;
+    deliveredAt?: number;
+    kind?: "directed" | "stop";
+}
+export interface FileClaim {
+    path: string;
+    claimedBy: string;
+    taskId: string;
+    reason?: string;
+    claimedAt: number;
+}
+export interface Plan {
+    id: string;
+    createdAt: number;
+    rootTask: string;
+    budgetCapTokens: number;
+    perAgentCapTokens: number;
+    estimatedTokens?: number;
+    budgetCapUsd?: number;
+    perAgentCapUsd?: number;
+    estimatedCostUsd?: number;
+    estimatedDurationSec?: number;
+    modelForEstimate?: string;
+    effortMultiplier?: number;
+    status: PlanStatus;
+    approvalToken?: string;
+    approvedAt?: number;
+    tasks: Task[];
+    notes: Note[];
+    messages: Message[];
+    claims: FileClaim[];
+    reviewPlanId?: string;
+}
+export interface State {
+    schemaVersion: 2;
+    plans: Record<string, Plan>;
+}
+export declare class StateStore {
+    private filePath;
+    private cache;
+    private writeLock;
+    constructor(stateDir: string);
+    private load;
+    update<T>(mutator: (state: State) => T | Promise<T>): Promise<T>;
+    read<T>(reader: (state: State) => T): Promise<T>;
+    private persist;
+}
+export declare function newPlan(rootTask: string, budgetCapTokens: number, tasksInput: Array<Omit<Task, "id" | "status">>): Plan;
+export declare function findPlan(state: State, planId: string): Plan;
+export declare function findTask(plan: Plan, taskId: string): Task;
+export declare function findTaskBySession(plan: Plan, sessionId: string): Task | undefined;
+/** Locate the plan+task a given child session belongs to. */
+export declare function planForSession(state: State, sessionId: string): {
+    plan: Plan;
+    task: Task;
+} | undefined;
+/**
+ * Find a dispatched-but-unclaimed task by task_id. Used for self-registration:
+ * when a freshly-spawned child agent calls `checkin` with its task_id (which we
+ * embed in the spawn prompt), we can adopt it.
+ */
+export declare function unclaimedTaskById(state: State, taskId: string): {
+    plan: Plan;
+    task: Task;
+} | undefined;
+/** Normalize a path for claim comparison (handle . , .. , trailing slash, case). */
+export declare function normalizeClaimPath(p: string, cwd: string): string;

package/dist/lib/state.js

@@ -0,0 +1,138 @@
+import { promises as fs } from "node:fs";
+import path from "node:path";
+import { randomUUID } from "node:crypto";
+const EMPTY_STATE = { schemaVersion: 2, plans: {} };
+export class StateStore {
+    filePath;
+    cache = null;
+    writeLock = Promise.resolve();
+    constructor(stateDir) {
+        this.filePath = path.join(stateDir, "orqlaude-state.json");
+    }
+    async load() {
+        if (this.cache)
+            return this.cache;
+        try {
+            const raw = await fs.readFile(this.filePath, "utf8");
+            const parsed = JSON.parse(raw);
+            this.cache = migrate(parsed);
+        }
+        catch (err) {
+            if (err.code === "ENOENT") {
+                this.cache = structuredClone(EMPTY_STATE);
+            }
+            else {
+                throw err;
+            }
+        }
+        return this.cache;
+    }
+    async update(mutator) {
+        let release = () => { };
+        const next = new Promise((res) => (release = res));
+        const prev = this.writeLock;
+        this.writeLock = prev.then(() => next);
+        await prev;
+        try {
+            const state = await this.load();
+            const result = await mutator(state);
+            await this.persist(state);
+            return result;
+        }
+        finally {
+            release();
+        }
+    }
+    async read(reader) {
+        const state = await this.load();
+        return reader(state);
+    }
+    async persist(state) {
+        await fs.mkdir(path.dirname(this.filePath), { recursive: true });
+        const tmp = `${this.filePath}.${process.pid}.tmp`;
+        await fs.writeFile(tmp, JSON.stringify(state, null, 2));
+        await fs.rename(tmp, this.filePath);
+        this.cache = state;
+    }
+}
+/** Forward-compatible migration from earlier schemas. */
+function migrate(input) {
+    const v = input.schemaVersion ?? 1;
+    if (v === 2 && input.plans)
+        return input;
+    // v1 → v2: synthesize token fields from USD if missing.
+    const out = { schemaVersion: 2, plans: {} };
+    for (const [id, plan] of Object.entries(input.plans ?? {})) {
+        const p = plan;
+        out.plans[id] = {
+            ...p,
+            budgetCapTokens: p.budgetCapTokens ?? Math.round((p.budgetCapUsd ?? 5) * 25_000), // rough $0.04/k
+            perAgentCapTokens: p.perAgentCapTokens ?? Math.round((p.perAgentCapUsd ?? 1) * 25_000),
+            claims: p.claims ?? [],
+        };
+    }
+    return out;
+}
+// ---- Plan helpers (pure functions; mutator-friendly) ----
+export function newPlan(rootTask, budgetCapTokens, tasksInput) {
+    const tasks = tasksInput.map((t) => ({
+        ...t,
+        id: randomUUID(),
+        status: "pending",
+    }));
+    return {
+        id: randomUUID(),
+        createdAt: Date.now(),
+        rootTask,
+        budgetCapTokens,
+        perAgentCapTokens: tasks.length > 0 ? Math.floor(budgetCapTokens / tasks.length) : budgetCapTokens,
+        status: "draft",
+        tasks,
+        notes: [],
+        messages: [],
+        claims: [],
+    };
+}
+export function findPlan(state, planId) {
+    const plan = state.plans[planId];
+    if (!plan)
+        throw new Error(`Plan not found: ${planId}`);
+    return plan;
+}
+export function findTask(plan, taskId) {
+    const task = plan.tasks.find((t) => t.id === taskId);
+    if (!task)
+        throw new Error(`Task not found in plan ${plan.id}: ${taskId}`);
+    return task;
+}
+export function findTaskBySession(plan, sessionId) {
+    return plan.tasks.find((t) => t.spawnedSessionId === sessionId);
+}
+/** Locate the plan+task a given child session belongs to. */
+export function planForSession(state, sessionId) {
+    for (const plan of Object.values(state.plans)) {
+        const task = findTaskBySession(plan, sessionId);
+        if (task)
+            return { plan, task };
+    }
+    return undefined;
+}
+/**
+ * Find a dispatched-but-unclaimed task by task_id. Used for self-registration:
+ * when a freshly-spawned child agent calls `checkin` with its task_id (which we
+ * embed in the spawn prompt), we can adopt it.
+ */
+export function unclaimedTaskById(state, taskId) {
+    for (const plan of Object.values(state.plans)) {
+        const task = plan.tasks.find((t) => t.id === taskId && !t.spawnedSessionId);
+        if (task)
+            return { plan, task };
+    }
+    return undefined;
+}
+/** Normalize a path for claim comparison (handle . , .. , trailing slash, case). */
+export function normalizeClaimPath(p, cwd) {
+    const abs = path.isAbsolute(p) ? p : path.resolve(cwd, p);
+    return path.normalize(abs);
+}
+//# sourceMappingURL=state.js.map