audit-tools 0.28.0

package/dist/audit/cli/dispatch/packetPrompt.js

@@ -0,0 +1,258 @@
+import { readFile } from "node:fs/promises";
+import { join } from "node:path";
+import { writeJsonFile } from "audit-tools/shared";
+import { buildFileAnchorSummary } from "../../orchestrator/fileAnchors.js";
+import { artifactNameForId } from "../args.js";
+import { withinRoot } from "./paths.js";
+import { isIsolatedLargeFilePacket } from "./packetFilter.js";
+// Prompt rendering: large-file anchor extraction, packet graph context
+// rendering, task section building, and full packet prompt assembly.
+function renderAnchorPreview(summary, anchorPath) {
+    const preview = summary.anchors.slice(0, 24).map((anchor) => {
+        const location = anchor.line ? `${summary.path}:${anchor.line}` : summary.path;
+        const detail = anchor.detail ? ` - ${anchor.detail}` : "";
+        return `- ${location} [${anchor.kind}] ${anchor.name}${detail}`;
+    });
+    return [
+        "## Large File Review Mode",
+        "This packet is intentionally isolated because it covers one large file.",
+        "Use targeted reads/searches within this file, guided by the mechanical anchors.",
+        "Do not read unrelated files unless a finding cannot be evidenced without a direct boundary check.",
+        `Anchor file: ${anchorPath}`,
+        `Anchor counts: symbols=${summary.counts.symbols}, routes=${summary.counts.routes}, keywords=${summary.counts.keywords}, graph_edges=${summary.counts.graph_edges}, analyzer_signals=${summary.counts.analyzer_signals}, omitted=${summary.omitted_anchor_count}`,
+        "Anchor preview:",
+        ...(preview.length > 0 ? preview : ["- no anchors extracted beyond file boundaries"]),
+        "",
+    ];
+}
+function formatPacketConfidence(value) {
+    return typeof value === "number" && Number.isFinite(value)
+        ? value.toFixed(2)
+        : "n/a";
+}
+function renderPacketGraphContext(packet) {
+    const hasContext = (packet.entrypoints?.length ?? 0) > 0 ||
+        (packet.key_edges?.length ?? 0) > 0 ||
+        (packet.boundary_files?.length ?? 0) > 0 ||
+        packet.quality !== undefined;
+    if (!hasContext) {
+        return [];
+    }
+    const lines = ["## Packet graph context"];
+    if (packet.entrypoints?.length) {
+        lines.push("Entrypoints:");
+        lines.push(...packet.entrypoints.map((entrypoint) => `- ${entrypoint}`));
+    }
+    if (packet.key_edges?.length) {
+        lines.push("Key internal edges:");
+        lines.push(...packet.key_edges.map((edge) => {
+            const kind = edge.kind ? ` [${edge.kind}]` : "";
+            const reason = edge.reason ? ` - ${edge.reason}` : "";
+            return `- ${edge.from} -> ${edge.to}${kind} confidence=${formatPacketConfidence(edge.confidence)}${reason}`;
+        }));
+    }
+    if (packet.boundary_files?.length) {
+        lines.push("Boundary files to check only when evidence crosses the packet:");
+        lines.push(...packet.boundary_files.map((path) => `- ${path}`));
+    }
+    if (packet.quality) {
+        lines.push(`Quality: cohesion=${packet.quality.cohesion_score}, internal_edges=${packet.quality.internal_edge_count}, boundary_edges=${packet.quality.boundary_edge_count}, unexplained_files=${packet.quality.unexplained_file_count}`);
+    }
+    lines.push("");
+    return lines;
+}
+/**
+ * Encapsulates large-file anchor extraction for a single packet.
+ * Appends to the provided warnings array on unavailability or failure.
+ */
+export async function extractPacketAnchor(params) {
+    const { packet, reviewRoot, bundle, taskResultsDir, warnings } = params;
+    if (!reviewRoot) {
+        warnings.push({
+            code: "large_file_anchor_unavailable",
+            message: `large single-file packet ${packet.packet_id} has no repo root available for anchor extraction`,
+        });
+        return { anchorPath: null, anchorSummary: null };
+    }
+    try {
+        const filePath = packet.file_paths[0];
+        const totalLines = packet.file_line_counts[filePath] ?? packet.total_lines;
+        const content = await readFile(withinRoot(reviewRoot, filePath), "utf8");
+        const anchorSummary = buildFileAnchorSummary({
+            path: filePath,
+            content,
+            totalLines,
+            graphBundle: bundle.graph_bundle,
+            externalAnalyzerResults: bundle.external_analyzer_results,
+        });
+        const anchorPath = join(taskResultsDir, artifactNameForId(packet.packet_id, "anchors.json"));
+        await writeJsonFile(anchorPath, anchorSummary);
+        return { anchorPath, anchorSummary };
+    }
+    catch (error) {
+        warnings.push({
+            code: "large_file_anchor_failed",
+            message: `large single-file packet ${packet.packet_id} could not be anchored mechanically: ` +
+                (error instanceof Error ? error.message : String(error)),
+        });
+        return { anchorPath: null, anchorSummary: null };
+    }
+}
+/**
+ * Extracts the per-task flatMap that builds task section lines.
+ */
+export function buildTaskSections(packetTasks, lensDefs, lineIndex) {
+    return packetTasks.flatMap((task) => {
+        const lensDef = lensDefs[task.lens];
+        const inputLines = task.inputs
+            ? Object.entries(task.inputs)
+                .sort(([a], [b]) => a.localeCompare(b))
+                .map(([key, value]) => `input.${key}: ${value}`)
+            : [];
+        const isLensVerification = task.tags?.includes("lens_verification") ?? false;
+        const coverageTemplate = task.file_paths.map((path) => ({
+            path,
+            total_lines: task.file_line_counts?.[path] ?? lineIndex[path] ?? 0,
+        }));
+        return [
+            `### ${task.task_id}`,
+            `unit_id: ${task.unit_id}`,
+            `pass_id: ${task.pass_id}`,
+            `lens: ${task.lens}`,
+            ...(task.tags?.length ? [`tags: ${task.tags.join(", ")}`] : []),
+            ...inputLines,
+            `rationale: ${task.rationale}`,
+            "",
+            `Lens guidance: ${lensDef?.description ?? task.lens}`,
+            `Do NOT report: ${lensDef?.do_not_report ?? "N/A"}`,
+            ...(isLensVerification
+                ? [
+                    "",
+                    "Lens verification mode: review the prior result summary in the rationale and use only targeted source checks.",
+                    "Do not redo every packet and do not write direct findings for this task.",
+                    "Return findings: [] plus verification metadata. Include followup_tasks only for bounded, specific re-review packets.",
+                ]
+                : []),
+            "",
+            "file_coverage (copy exactly into your AuditResult for this task):",
+            "```json",
+            JSON.stringify(coverageTemplate),
+            "```",
+            "",
+        ];
+    });
+}
+/**
+ * Wraps the array-join block and returns the assembled prompt string.
+ * The worker writes its own AuditResult[] JSON array to `result_path` (the same
+ * path the rolling-dispatch step prompt pre-approves and ingests). The two
+ * prompts must agree on this — a worker-prompt-and-result-contract regression
+ * test asserts this prompt instructs the write and never forbids it (the prior
+ * "emit inline, do not write files" wording silently dropped every result). No
+ * shell submit command.
+ */
+export function buildPacketPrompt(params) {
+    const { packet, fileList, largeFileSection, taskSections, resultPath, repoRoot } = params;
+    const largeFileMode = isIsolatedLargeFilePacket(packet);
+    // The user's free-form audit intent is interpreted into lens/priority signals
+    // at planning time and is never threaded verbatim into a worker prompt
+    // (INV-S04; guarded by no-verbatim-free-form-intent.test.mjs).
+    return [
+        "You are a code auditor. Review this packet once, then emit exactly one result per listed task.",
+        repoRoot ? `Repository root: ${repoRoot}` : "Repository root: use the root from the step contract.",
+        "Set the shell/tool workdir to the repository root when running backend commands.",
+        "",
+        "## Packet",
+        `packet_id: ${packet.packet_id}`,
+        `task_count: ${packet.task_ids.length}`,
+        `lenses: ${packet.lenses.join(", ")}`,
+        `estimated_tokens: ${packet.estimated_tokens}`,
+        `result_path: ${resultPath}`,
+        "",
+        "## Files to read",
+        largeFileMode
+            ? "Use targeted Read/Grep calls. Paths are repo-relative to the repository root above."
+            : "Use your Read tool. Paths are repo-relative to the repository root above.",
+        "Use host Read and Grep tools for source inspection. Do not use shell search commands.",
+        fileList,
+        "",
+        ...renderPacketGraphContext(packet),
+        ...largeFileSection,
+        "## Tasks",
+        ...taskSections,
+        "## Output",
+        "Produce one JSON array containing exactly one AuditResult object for each listed task,",
+        `and WRITE that array (and nothing else) to your result_path: ${resultPath}`,
+        "Use your Write tool to write that one file. Do not edit source files, run shell commands,",
+        "or write any other file. After writing, reply with the one-line confirmation below — do not",
+        "paste the JSON array into your reply.",
+        "Windows PowerShell: do not pipe an inline foreach statement directly into ConvertTo-Json.",
+        "Assign the foreach output to a variable first, then pipe that variable to ConvertTo-Json.",
+        "PowerShell also unwraps single-element arrays: @(@{...}) collapses to one object, so a",
+        "one-result submission serializes as an object (not a 1-element array) and is rejected. Wrap it",
+        "yourself: '[' + (ConvertTo-Json $obj -Depth 12) + ']', or build the array with Write-Output -NoEnumerate.",
+        "",
+        "Schema file (resolve relative to this prompt's directory): audit_result.schema.json",
+        "  self-contained (all shapes inlined); finding.schema.json and audit_task.schema.json are also provided for reference.",
+        "You MAY validate your JSON array against the schema before emitting. This is optional.",
+        "",
+        "Required AuditResult fields:",
+        "  task_id       copy from the task metadata",
+        "  unit_id       copy from the task metadata",
+        "  pass_id       copy from the task metadata",
+        "  lens          copy from the task metadata",
+        "  file_coverage [{path, total_lines}] - copy the exact template from each task section above. You MUST include total_lines. Do not omit or zero it out, as this will cause fatal validation errors.",
+        "  findings      [] or array of finding objects",
+        "",
+        "Lens verification tasks:",
+        "  tasks tagged lens_verification must use findings: [] and include verification:",
+        "  {verified: boolean, needs_followup: boolean, concerns?: string[],",
+        "   coverage_concerns?: string[], confidence_concerns?: string[],",
+        "   followup_tasks?: AuditTask[]}.",
+        "  Follow-up AuditTask suggestions must stay bounded to files in this packet and use the same lens.",
+        "",
+        "Each finding object:",
+        "  id            unique ID, e.g. \"COR-001\"",
+        "  title         short title",
+        "  category      specific finding category, such as missing-validation or command-execution",
+        "  severity      critical|high|medium|low|info",
+        "  confidence    high|medium|low",
+        "  lens          must match the task lens exactly",
+        "  summary       1-2 sentence description",
+        "  affected_files  [{path, line_start?, line_end?, symbol?, quoted_text}] - objects, not strings; min 1 entry",
+        "  evidence     [\"path/to/file.ts:42 - description of what you see there\"] - min 1 entry",
+        "",
+        "Grounding (required): at least one affected_files entry per finding MUST include quoted_text —",
+        "  a short verbatim span copied EXACTLY from that file at the cited lines. The tool re-reads it",
+        "  and content-matches against disk; a finding whose quoted_text is not found on disk (or is",
+        "  omitted entirely) is marked ungrounded and surfaced for review, not silently confirmed.",
+        "  Quote real code that exists; never paraphrase. Matching is on content (whitespace-normalized),",
+        "  so exact line numbers may safely drift. Add a quoted_text span to every affected_files entry",
+        "  you can — a finding with no verbatim quote will not survive grounding.",
+        "",
+        "Constraints:",
+        "1. line_end must not exceed the file's actual line count.",
+        "2. affected_files entries are objects with a path key, not plain strings.",
+        "3. Only reference files from the packet unless a finding genuinely crosses a boundary.",
+        "4. findings: [] is correct when you find nothing genuine.",
+        "",
+        "## Final response",
+        `After writing the JSON array to ${resultPath}, reply exactly: valid: ${packet.packet_id}, findings=<total finding count>`,
+    ].join("\n");
+}
+export function buildLargeFileSection(largeFileMode, anchorSummary, anchorPath) {
+    if (anchorSummary && anchorPath) {
+        return renderAnchorPreview(anchorSummary, anchorPath);
+    }
+    if (largeFileMode) {
+        return [
+            "## Large File Review Mode",
+            "This packet is intentionally isolated because it covers one large file.",
+            "Use targeted reads/searches within this file only.",
+            "No mechanical anchor file was available, so rely on targeted symbol and keyword searches before reading broad ranges.",
+            "",
+        ];
+    }
+    return [];
+}
+//# sourceMappingURL=packetPrompt.js.map

package/dist/audit/cli/dispatch/packetPrompt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"packetPrompt.js","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/packetPrompt.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAInD,OAAO,EAAE,sBAAsB,EAA0B,MAAM,mCAAmC,CAAC;AACnG,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAE9D,uEAAuE;AACvE,qEAAqE;AAErE,SAAS,mBAAmB,CAC1B,OAA0B,EAC1B,UAAkB;IAElB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAC1D,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QAC/E,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,OAAO,KAAK,QAAQ,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,GAAG,MAAM,EAAE,CAAC;IAClE,CAAC,CAAC,CAAC;IACH,OAAO;QACL,2BAA2B;QAC3B,yEAAyE;QACzE,iFAAiF;QACjF,mGAAmG;QACnG,gBAAgB,UAAU,EAAE;QAC5B,0BAA0B,OAAO,CAAC,MAAM,CAAC,OAAO,YAAY,OAAO,CAAC,MAAM,CAAC,MAAM,cAAc,OAAO,CAAC,MAAM,CAAC,QAAQ,iBAAiB,OAAO,CAAC,MAAM,CAAC,WAAW,sBAAsB,OAAO,CAAC,MAAM,CAAC,gBAAgB,aAAa,OAAO,CAAC,oBAAoB,EAAE;QACjQ,iBAAiB;QACjB,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,+CAA+C,CAAC,CAAC;QACrF,EAAE;KACH,CAAC;AACJ,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAyB;IACvD,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QACxD,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAClB,CAAC,CAAC,KAAK,CAAC;AACZ,CAAC;AAED,SAAS,wBAAwB,CAAC,MAgBjC;IACC,MAAM,UAAU,GACd,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC;QACrC,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC;QACnC,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC;QACxC,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC;IAC/B,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,yBAAyB,CAAC,CAAC;IAC1C,IAAI,MAAM,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAClC,KAAK,CAAC,IAAI,CACR,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtD,OAAO,KAAK,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,GAAG,IAAI,eAAe,sBAAsB,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,MAAM,EAAE,CAAC;QAC9G,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,EAAE,MAAM,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QAC7E,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,KAAK,CAAC,IAAI,CACR,qBAAqB,MAAM,CAAC,OAAO,CAAC,cAAc,oBAAoB,MAAM,CAAC,OAAO,CAAC,mBAAmB,oBAAoB,MAAM,CAAC,OAAO,CAAC,mBAAmB,uBAAuB,MAAM,CAAC,OAAO,CAAC,sBAAsB,EAAE,CAC7N,CAAC;IACJ,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,MAMzC;IACC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;IACxE,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,+BAA+B;YACrC,OAAO,EAAE,4BAA4B,MAAM,CAAC,SAAS,mDAAmD;SACzG,CAAC,CAAC;QACH,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;IACnD,CAAC;IACD,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC;QACvC,MAAM,UAAU,GAAG,MAAM,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC;QAC3E,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;QACzE,MAAM,aAAa,GAAG,sBAAsB,CAAC;YAC3C,IAAI,EAAE,QAAQ;YACd,OAAO;YACP,UAAU;YACV,WAAW,EAAE,MAAM,CAAC,YAAY;YAChC,uBAAuB,EAAE,MAAM,CAAC,yBAAyB;SAC1D,CAAC,CAAC;QACH,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,iBAAiB,CAAC,MAAM,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC;QAC7F,MAAM,aAAa,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QAC/C,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,CAAC;IACvC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,0BAA0B;YAChC,OAAO,EACL,4BAA4B,MAAM,CAAC,SAAS,uCAAuC;gBACnF,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC3D,CAAC,CAAC;QACH,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;IACnD,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,WAAwB,EACxB,QAAwE,EACxE,SAAiC;IAEjC,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM;YAC5B,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;iBACxB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;iBACtC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,SAAS,GAAG,KAAK,KAAK,EAAE,CAAC;YACpD,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,mBAAmB,CAAC,IAAI,KAAK,CAAC;QAC7E,MAAM,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtD,IAAI;YACJ,WAAW,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;SACnE,CAAC,CAAC,CAAC;QACJ,OAAO;YACL,OAAO,IAAI,CAAC,OAAO,EAAE;YACrB,YAAY,IAAI,CAAC,OAAO,EAAE;YAC1B,YAAY,IAAI,CAAC,OAAO,EAAE;YAC1B,SAAS,IAAI,CAAC,IAAI,EAAE;YACpB,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/D,GAAG,UAAU;YACb,cAAc,IAAI,CAAC,SAAS,EAAE;YAC9B,EAAE;YACF,kBAAkB,OAAO,EAAE,WAAW,IAAI,IAAI,CAAC,IAAI,EAAE;YACrD,kBAAkB,OAAO,EAAE,aAAa,IAAI,KAAK,EAAE;YACnD,GAAG,CAAC,kBAAkB;gBACpB,CAAC,CAAC;oBACE,EAAE;oBACF,+GAA+G;oBAC/G,0EAA0E;oBAC1E,sHAAsH;iBACvH;gBACH,CAAC,CAAC,EAAE,CAAC;YACP,EAAE;YACF,mEAAmE;YACnE,SAAS;YACT,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC;YAChC,KAAK;YACL,EAAE;SACH,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAQjC;IACC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,gBAAgB,EAAE,YAAY,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;IAC1F,MAAM,aAAa,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC;IACxD,8EAA8E;IAC9E,uEAAuE;IACvE,+DAA+D;IAC/D,OAAO;QACL,gGAAgG;QAChG,QAAQ,CAAC,CAAC,CAAC,oBAAoB,QAAQ,EAAE,CAAC,CAAC,CAAC,uDAAuD;QACnG,kFAAkF;QAClF,EAAE;QACF,WAAW;QACX,cAAc,MAAM,CAAC,SAAS,EAAE;QAChC,eAAe,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE;QACvC,WAAW,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QACrC,qBAAqB,MAAM,CAAC,gBAAgB,EAAE;QAC9C,gBAAgB,UAAU,EAAE;QAC5B,EAAE;QACF,kBAAkB;QAClB,aAAa;YACX,CAAC,CAAC,qFAAqF;YACvF,CAAC,CAAC,2EAA2E;QAC/E,uFAAuF;QACvF,QAAQ;QACR,EAAE;QACF,GAAG,wBAAwB,CAAC,MAAM,CAAC;QACnC,GAAG,gBAAgB;QACnB,UAAU;QACV,GAAG,YAAY;QACf,WAAW;QACX,wFAAwF;QACxF,gEAAgE,UAAU,EAAE;QAC5E,2FAA2F;QAC3F,6FAA6F;QAC7F,uCAAuC;QACvC,2FAA2F;QAC3F,2FAA2F;QAC3F,wFAAwF;QACxF,gGAAgG;QAChG,2GAA2G;QAC3G,EAAE;QACF,qFAAqF;QACrF,wHAAwH;QACxH,wFAAwF;QACxF,EAAE;QACF,8BAA8B;QAC9B,6CAA6C;QAC7C,6CAA6C;QAC7C,6CAA6C;QAC7C,6CAA6C;QAC7C,qMAAqM;QACrM,gDAAgD;QAChD,EAAE;QACF,0BAA0B;QAC1B,kFAAkF;QAClF,qEAAqE;QACrE,kEAAkE;QAClE,mCAAmC;QACnC,oGAAoG;QACpG,EAAE;QACF,sBAAsB;QACtB,6CAA6C;QAC7C,6BAA6B;QAC7B,4FAA4F;QAC5F,+CAA+C;QAC/C,iCAAiC;QACjC,kDAAkD;QAClD,0CAA0C;QAC1C,8GAA8G;QAC9G,2FAA2F;QAC3F,EAAE;QACF,gGAAgG;QAChG,gGAAgG;QAChG,6FAA6F;QAC7F,2FAA2F;QAC3F,kGAAkG;QAClG,gGAAgG;QAChG,0EAA0E;QAC1E,EAAE;QACF,cAAc;QACd,2DAA2D;QAC3D,2EAA2E;QAC3E,wFAAwF;QACxF,2DAA2D;QAC3D,EAAE;QACF,mBAAmB;QACnB,mCAAmC,UAAU,2BAA2B,MAAM,CAAC,SAAS,kCAAkC;KAC3H,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,aAAsB,EACtB,aAAuC,EACvC,UAAyB;IAEzB,IAAI,aAAa,IAAI,UAAU,EAAE,CAAC;QAChC,OAAO,mBAAmB,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO;YACL,2BAA2B;YAC3B,yEAAyE;YACzE,oDAAoD;YACpD,uHAAuH;YACvH,EAAE;SACH,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/audit/cli/dispatch/paths.d.ts

@@ -0,0 +1,7 @@
+import type { DispatchResultMap, DispatchResultMapEntry } from "./types.js";
+export declare function withinRoot(root: string, path: string): string;
+export declare function dispatchResultMapPath(runDir: string): string;
+export declare function loadDispatchResultMap(runDir: string): Promise<DispatchResultMap | null>;
+export declare function entriesByTaskId(entries: DispatchResultMapEntry[]): Map<string, DispatchResultMapEntry>;
+export declare function resolveRunScopedArg(argv: string[], rawFlag: string, b64Flag: string): string | undefined;
+//# sourceMappingURL=paths.d.ts.map

package/dist/audit/cli/dispatch/paths.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/paths.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AAO5E,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAQ7D;AAED,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAE5D;AAED,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,CASnC;AAED,wBAAgB,eAAe,CAC7B,OAAO,EAAE,sBAAsB,EAAE,GAChC,GAAG,CAAC,MAAM,EAAE,sBAAsB,CAAC,CAErC;AAED,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,EAAE,EACd,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,SAAS,CAIpB"}

package/dist/audit/cli/dispatch/paths.js

@@ -0,0 +1,38 @@
+import { isAbsolute, join, relative, resolve } from "node:path";
+import { readJsonFile, isFileMissingError } from "audit-tools/shared";
+import { DISPATCH_RESULT_MAP_FILENAME } from "./types.js";
+import { getFlag, fromBase64Url } from "../args.js";
+// Path utilities for the dispatch pipeline: path containment guard,
+// result-map path helpers, result-map I/O, and small arg/entry utilities.
+export function withinRoot(root, path) {
+    const rootPath = resolve(root);
+    const absolutePath = resolve(rootPath, path);
+    const relativePath = relative(rootPath, absolutePath);
+    if (relativePath.startsWith("..") || isAbsolute(relativePath)) {
+        throw new Error(`Path '${path}' escapes repository root '${rootPath}'.`);
+    }
+    return absolutePath;
+}
+export function dispatchResultMapPath(runDir) {
+    return join(runDir, DISPATCH_RESULT_MAP_FILENAME);
+}
+export async function loadDispatchResultMap(runDir) {
+    try {
+        return await readJsonFile(dispatchResultMapPath(runDir));
+    }
+    catch (error) {
+        if (!isFileMissingError(error)) {
+            throw error;
+        }
+        return null;
+    }
+}
+export function entriesByTaskId(entries) {
+    return new Map(entries.map((entry) => [entry.task_id, entry]));
+}
+export function resolveRunScopedArg(argv, rawFlag, b64Flag) {
+    const raw = getFlag(argv, rawFlag);
+    const encoded = getFlag(argv, b64Flag);
+    return raw ?? (encoded ? fromBase64Url(encoded) : undefined);
+}
+//# sourceMappingURL=paths.js.map

package/dist/audit/cli/dispatch/paths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.js","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/paths.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAEtE,OAAO,EAAE,4BAA4B,EAAE,MAAM,YAAY,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEpD,oEAAoE;AACpE,0EAA0E;AAE1E,MAAM,UAAU,UAAU,CAAC,IAAY,EAAE,IAAY;IACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,YAAY,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC7C,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IACtD,IAAI,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;QAC9D,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,8BAA8B,QAAQ,IAAI,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAAc;IAClD,OAAO,IAAI,CAAC,MAAM,EAAE,4BAA4B,CAAC,CAAC;AACpD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,MAAc;IAEd,IAAI,CAAC;QACH,OAAO,MAAM,YAAY,CAAoB,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9E,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,KAAK,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,OAAiC;IAEjC,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,IAAc,EACd,OAAe,EACf,OAAe;IAEf,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACvC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;AAC/D,CAAC"}

package/dist/audit/cli/dispatch/quotaPool.d.ts

@@ -0,0 +1,75 @@
+import type { ProviderRateLimits, SessionConfig, DispatchModelTier, HostModelRosterEntry } from "audit-tools/shared";
+import { computeDispatchCapacity } from "../../quota/index.js";
+import type { CapacityPool, DispatchQuota } from "../../quota/index.js";
+export interface ResolvedDispatchPool {
+    /**
+     * Capacity pools available to this dispatch — one per reported roster rank,
+     * or a single pool for the scalar/absent handshake.
+     */
+    pools: CapacityPool[];
+    hostModel: string | null;
+    /**
+     * Per-packet input-token ceiling for the INITIAL partition: the largest
+     * rank's resolved context window minus its reserved output budget. Coherent
+     * clusters partition under the most generous window first; the per-tier
+     * re-fit pass then re-splits any packet routed to a smaller rank.
+     */
+    contextBudgetTokens: number;
+    /**
+     * Per-tier packet input budgets (context − output) when the host reported a
+     * model roster; null for the single-window handshake (every tier shares
+     * `contextBudgetTokens`).
+     */
+    tierBudgets: Record<DispatchModelTier, number> | null;
+}
+/**
+ * Resolve the dispatching host pool(s) (host-model resolution, quota state
+ * lookup, provider-limits query) and probe their resolved context budgets —
+ * everything needed to size the JIT graph partition. The pools are reused by
+ * `finalizeDispatchQuota` after packetization, so this work happens once.
+ *
+ * With a host model roster (`--host-models`), one pool is built per reported
+ * rank, each with its own discovered window; otherwise the scalar handshake
+ * (or nothing) yields the single conservative pool exactly as before.
+ *
+ * The probe runs `computeDispatchCapacity` with no pending work: resolved limits
+ * are model-derived (not work-derived), so the context window is available
+ * before any packet exists. This is the quota-before-packetization reorder.
+ */
+export declare function buildDispatchPool(params: {
+    sessionConfig: SessionConfig;
+    hostModel: string | null | undefined;
+    queryLimits: ((model: string | null) => Promise<ProviderRateLimits | null>) | undefined;
+    hostActiveSubagentLimit: number | null | undefined;
+    /** Context window the host reports for its dispatch model (handshake). */
+    hostContextTokens?: number | null;
+    /** Output cap the host reports for its dispatch model (handshake). */
+    hostOutputTokens?: number | null;
+    /** Ordered model roster (lowest rank first); outranks the scalar pair. */
+    hostModelRoster?: HostModelRosterEntry[] | null;
+    /** Opaque model identity for the quota key when no model name resolves. */
+    hostModelId?: string | null;
+}): Promise<ResolvedDispatchPool>;
+/**
+ * Compute just-in-time dispatch capacity for the already-resolved pool against
+ * the real per-packet token layout, and write the dispatch-quota artifact.
+ * Runs AFTER packetization so capacity reflects the actual partitioned packets.
+ */
+export declare function finalizeDispatchQuota(params: {
+    runId: string;
+    runDir: string;
+    sessionConfig: SessionConfig;
+    pools: CapacityPool[];
+    hostModel: string | null;
+    perPacketTokens: number[];
+    /** Echo of the host's reported roster, when one was given. */
+    hostModelRoster?: HostModelRosterEntry[] | null;
+    /** Per-tier packet input budgets derived from the roster, when given. */
+    tierBudgets?: Record<DispatchModelTier, number> | null;
+}): Promise<{
+    dispatchQuota: DispatchQuota;
+    dispatchQuotaPath: string;
+    waveSchedule: ReturnType<typeof computeDispatchCapacity>["primary"]["schedule"];
+    dispatchCapacity: ReturnType<typeof computeDispatchCapacity>;
+}>;
+//# sourceMappingURL=quotaPool.d.ts.map

package/dist/audit/cli/dispatch/quotaPool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quotaPool.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/quotaPool.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,kBAAkB,EAClB,aAAa,EACb,iBAAiB,EACjB,oBAAoB,EACrB,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EACL,uBAAuB,EAQxB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,KAAK,EACV,YAAY,EAEZ,aAAa,EACd,MAAM,sBAAsB,CAAC;AAO9B,MAAM,WAAW,oBAAoB;IACnC;;;OAGG;IACH,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB;;;;;OAKG;IACH,mBAAmB,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;CACvD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAsB,iBAAiB,CAAC,MAAM,EAAE;IAC9C,aAAa,EAAE,aAAa,CAAC;IAC7B,SAAS,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC;IACrC,WAAW,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,KAAK,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;IACxF,uBAAuB,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC;IACnD,0EAA0E;IAC1E,iBAAiB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,sEAAsE;IACtE,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,0EAA0E;IAC1E,eAAe,CAAC,EAAE,oBAAoB,EAAE,GAAG,IAAI,CAAC;IAChD,2EAA2E;IAC3E,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAgHhC;AAED;;;;GAIG;AACH,wBAAsB,qBAAqB,CAAC,MAAM,EAAE;IAClD,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,aAAa,CAAC;IAC7B,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,8DAA8D;IAC9D,eAAe,CAAC,EAAE,oBAAoB,EAAE,GAAG,IAAI,CAAC;IAChD,yEAAyE;IACzE,WAAW,CAAC,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;CACxD,GAAG,OAAO,CAAC;IACV,aAAa,EAAE,aAAa,CAAC;IAC7B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,YAAY,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC,SAAS,CAAC,CAAC,UAAU,CAAC,CAAC;IAChF,gBAAgB,EAAE,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC;CAC9D,CAAC,CAyCD"}

package/dist/audit/cli/dispatch/quotaPool.js

@@ -0,0 +1,163 @@
+import { join } from "node:path";
+import { writeJsonFile } from "audit-tools/shared";
+import { DEFAULT_EMPIRICAL_HALF_LIFE_HOURS } from "audit-tools/shared";
+import { buildQuotaSource } from "audit-tools/shared/quota/compositeQuotaSource";
+import { resolveFreshSessionProviderName } from "../../providers/index.js";
+import { computeDispatchCapacity, buildProviderModelKey, resolveHostModel, readQuotaState, resolveHostActiveSubagentLimit, lookupDiscoveredLimits, mergeDiscoveredLimits, summarizeDispatchCapacityPools, } from "../../quota/index.js";
+import { resolveTierBudgets, TIER_ORDER } from "./tierRouting.js";
+/**
+ * Resolve the dispatching host pool(s) (host-model resolution, quota state
+ * lookup, provider-limits query) and probe their resolved context budgets —
+ * everything needed to size the JIT graph partition. The pools are reused by
+ * `finalizeDispatchQuota` after packetization, so this work happens once.
+ *
+ * With a host model roster (`--host-models`), one pool is built per reported
+ * rank, each with its own discovered window; otherwise the scalar handshake
+ * (or nothing) yields the single conservative pool exactly as before.
+ *
+ * The probe runs `computeDispatchCapacity` with no pending work: resolved limits
+ * are model-derived (not work-derived), so the context window is available
+ * before any packet exists. This is the quota-before-packetization reorder.
+ */
+export async function buildDispatchPool(params) {
+    const { sessionConfig, queryLimits, hostActiveSubagentLimit } = params;
+    const quotaProviderName = resolveFreshSessionProviderName(undefined, sessionConfig);
+    const hostModel = resolveHostModel({
+        providerName: quotaProviderName,
+        sessionConfig,
+        explicitModel: params.hostModel,
+        envVar: "AUDIT_CODE_HOST_MODEL",
+    });
+    // Quota-key identity: the resolved model name when one exists, else the
+    // host's opaque `--host-model-id` (a key segment ONLY — never a window
+    // authority), else null → `provider/*`. Per-roster-rank `model_id` overrides
+    // per pool below.
+    const quotaModelKeySegment = hostModel ?? params.hostModelId ?? null;
+    const quotaProviderKey = buildProviderModelKey(quotaProviderName, quotaModelKeySegment);
+    const quotaState = await readQuotaState().catch(() => ({ version: 2, entries: {} }));
+    const hostConcurrencyLimit = resolveHostActiveSubagentLimit({
+        explicitLimit: hostActiveSubagentLimit,
+        sessionConfig,
+    });
+    const providerLimits = await queryLimits?.(hostModel)
+        .then((r) => r ? { ...r, source: "provider_query" } : null)
+        .catch(() => null)
+        ?? null;
+    const halfLifeHours = sessionConfig.quota?.empirical_half_life_hours ??
+        DEFAULT_EMPIRICAL_HALF_LIFE_HOURS;
+    const quotaSource = buildQuotaSource({ halfLifeHours });
+    // The capability handshake limits are merged FIRST so they outrank the
+    // queried and cached limits for context/output (the discovered-capability
+    // rung then sizes the partition to the real window). RPM/TPM stay null in
+    // the capability entry and fill from the queried/cached sources.
+    const buildPool = async (capability, rank, modelId) => {
+        const poolKey = modelId
+            ? buildProviderModelKey(quotaProviderName, modelId)
+            : quotaProviderKey;
+        const dispatchCachedLimits = await lookupDiscoveredLimits(poolKey).catch(() => null);
+        const quotaSourceSnapshot = await quotaSource.queryCurrentUsage(poolKey).catch(() => null);
+        return {
+            id: poolKey,
+            providerName: quotaProviderName,
+            hostModel,
+            ...(rank ? { rank } : {}),
+            hostConcurrencyLimit,
+            quotaStateEntry: quotaState.entries[poolKey] ?? null,
+            discoveredLimits: mergeDiscoveredLimits(capability, providerLimits, dispatchCachedLimits),
+            quotaSourceSnapshot,
+        };
+    };
+    const probeBudget = (pool) => {
+        const probe = computeDispatchCapacity({
+            pools: [pool],
+            sessionConfig,
+            pendingItemTokens: [],
+        });
+        const limits = probe.primary.schedule.resolved_limits;
+        return Math.max(1, limits.context_tokens - limits.output_tokens);
+    };
+    const roster = params.hostModelRoster ?? null;
+    if (roster && roster.length > 0) {
+        const pools = [];
+        const perRank = new Map();
+        for (const entry of roster) {
+            const pool = await buildPool({
+                context_tokens: entry.context_tokens,
+                output_tokens: entry.output_tokens,
+                source: "host_capability",
+            }, entry.rank, entry.model_id);
+            pools.push(pool);
+            perRank.set(entry.rank, probeBudget(pool));
+        }
+        const tierBudgets = resolveTierBudgets(perRank);
+        return {
+            pools,
+            hostModel,
+            contextBudgetTokens: Math.max(...Object.values(tierBudgets)),
+            tierBudgets,
+        };
+    }
+    // Single-window handshake (scalar shorthand) or no handshake at all: one
+    // pool, conservative floor when nothing was reported — unchanged behavior.
+    const hostCapabilityLimits = params.hostContextTokens != null || params.hostOutputTokens != null
+        ? {
+            context_tokens: params.hostContextTokens ?? null,
+            output_tokens: params.hostOutputTokens ?? null,
+            source: "host_capability",
+        }
+        : null;
+    const hostPool = await buildPool(hostCapabilityLimits);
+    return {
+        pools: [hostPool],
+        hostModel,
+        contextBudgetTokens: probeBudget(hostPool),
+        tierBudgets: null,
+    };
+}
+/**
+ * Compute just-in-time dispatch capacity for the already-resolved pool against
+ * the real per-packet token layout, and write the dispatch-quota artifact.
+ * Runs AFTER packetization so capacity reflects the actual partitioned packets.
+ */
+export async function finalizeDispatchQuota(params) {
+    const { runId, runDir, sessionConfig, hostModel, perPacketTokens } = params;
+    // Most-capable rank first: computeDispatchCapacity hands the largest pending
+    // items to the first pool, and the biggest packets belong on the rank with
+    // the largest window. Unranked pools are the LEAST capable (conservative
+    // fallback), so they sort last — not first (COR-eebbabf7: was TIER_ORDER.length
+    // which placed them before ranked pools in descending order). The tier ordering
+    // is the single shared authority (`TIER_ORDER` === `DISPATCH_TIER_ORDER`); the
+    // `-1` unranked-last rule is local to this conservative-fallback sort and is
+    // intentionally distinct from rolling-dispatch's neutral-middle fallback.
+    const rankOrder = (pool) => pool.rank ? TIER_ORDER.indexOf(pool.rank) : -1;
+    const pools = [...params.pools].sort((a, b) => rankOrder(b) - rankOrder(a));
+    const dispatchCapacity = computeDispatchCapacity({
+        pools,
+        sessionConfig,
+        pendingItemTokens: perPacketTokens,
+    });
+    const waveSchedule = dispatchCapacity.primary.schedule;
+    const dispatchQuota = {
+        contract_version: "audit-code-dispatch-quota/v1alpha2",
+        run_id: runId,
+        model: hostModel,
+        resolved_limits: waveSchedule.resolved_limits,
+        confidence: waveSchedule.confidence,
+        source: waveSchedule.source,
+        host_concurrency_limit: waveSchedule.host_concurrency_limit,
+        max_concurrent_agents: dispatchCapacity.total_slots,
+        cooldown_until: dispatchCapacity.cooldown_until,
+        binding_cap: dispatchCapacity.binding_cap,
+        capacity_pools: summarizeDispatchCapacityPools(dispatchCapacity),
+        ...(params.hostModelRoster?.length
+            ? { host_model_roster: params.hostModelRoster }
+            : {}),
+        ...(params.tierBudgets ? { tier_budgets: params.tierBudgets } : {}),
+        quota_source_snapshot: waveSchedule.quota_source_snapshot ?? null,
+        backoff_state: null,
+    };
+    const dispatchQuotaPath = join(runDir, "dispatch-quota.json");
+    await writeJsonFile(dispatchQuotaPath, dispatchQuota);
+    return { dispatchQuota, dispatchQuotaPath, waveSchedule, dispatchCapacity };
+}
+//# sourceMappingURL=quotaPool.js.map

package/dist/audit/cli/dispatch/quotaPool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quotaPool.js","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/quotaPool.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAOnD,OAAO,EAAE,iCAAiC,EAAE,MAAM,oBAAoB,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,+CAA+C,CAAC;AACjF,OAAO,EAAE,+BAA+B,EAAE,MAAM,0BAA0B,CAAC;AAC3E,OAAO,EACL,uBAAuB,EACvB,qBAAqB,EACrB,gBAAgB,EAChB,cAAc,EACd,8BAA8B,EAC9B,sBAAsB,EACtB,qBAAqB,EACrB,8BAA8B,GAC/B,MAAM,sBAAsB,CAAC;AAM9B,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AA4BlE;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,MAavC;IACC,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,MAAM,CAAC;IACvE,MAAM,iBAAiB,GAAG,+BAA+B,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;IACpF,MAAM,SAAS,GAAG,gBAAgB,CAAC;QACjC,YAAY,EAAE,iBAAiB;QAC/B,aAAa;QACb,aAAa,EAAE,MAAM,CAAC,SAAS;QAC/B,MAAM,EAAE,uBAAuB;KAChC,CAAC,CAAC;IACH,wEAAwE;IACxE,uEAAuE;IACvE,6EAA6E;IAC7E,kBAAkB;IAClB,MAAM,oBAAoB,GAAG,SAAS,IAAI,MAAM,CAAC,WAAW,IAAI,IAAI,CAAC;IACrE,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;IACxF,MAAM,UAAU,GAAG,MAAM,cAAc,EAAE,CAAC,KAAK,CAAC,GAAmD,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACrI,MAAM,oBAAoB,GAAG,8BAA8B,CAAC;QAC1D,aAAa,EAAE,uBAAuB;QACtC,aAAa;KACd,CAAC,CAAC;IACH,MAAM,cAAc,GAClB,MAAM,WAAW,EAAE,CAAC,SAAS,CAAC;SAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAC1D,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;WACjB,IAAI,CAAC;IACV,MAAM,aAAa,GACjB,aAAa,CAAC,KAAK,EAAE,yBAAyB;QAC9C,iCAAiC,CAAC;IACpC,MAAM,WAAW,GAAG,gBAAgB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC;IAExD,uEAAuE;IACvE,0EAA0E;IAC1E,0EAA0E;IAC1E,iEAAiE;IACjE,MAAM,SAAS,GAAG,KAAK,EACrB,UAAuC,EACvC,IAAwB,EACxB,OAAgB,EACO,EAAE;QACzB,MAAM,OAAO,GAAG,OAAO;YACrB,CAAC,CAAC,qBAAqB,CAAC,iBAAiB,EAAE,OAAO,CAAC;YACnD,CAAC,CAAC,gBAAgB,CAAC;QACrB,MAAM,oBAAoB,GAAG,MAAM,sBAAsB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACrF,MAAM,mBAAmB,GAAG,MAAM,WAAW,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3F,OAAO;YACL,EAAE,EAAE,OAAO;YACX,YAAY,EAAE,iBAAiB;YAC/B,SAAS;YACT,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzB,oBAAoB;YACpB,eAAe,EAAE,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,IAAI;YACpD,gBAAgB,EAAE,qBAAqB,CACrC,UAAU,EACV,cAAc,EACd,oBAAoB,CACrB;YACD,mBAAmB;SACpB,CAAC;IACJ,CAAC,CAAC;IACF,MAAM,WAAW,GAAG,CAAC,IAAkB,EAAU,EAAE;QACjD,MAAM,KAAK,GAAG,uBAAuB,CAAC;YACpC,KAAK,EAAE,CAAC,IAAI,CAAC;YACb,aAAa;YACb,iBAAiB,EAAE,EAAE;SACtB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC;QACtD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,cAAc,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC;IACnE,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,CAAC,eAAe,IAAI,IAAI,CAAC;IAC9C,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,KAAK,GAAmB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6B,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,MAAM,SAAS,CAC1B;gBACE,cAAc,EAAE,KAAK,CAAC,cAAc;gBACpC,aAAa,EAAE,KAAK,CAAC,aAAa;gBAClC,MAAM,EAAE,iBAAiB;aAC1B,EACD,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,QAAQ,CACf,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,WAAW,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAChD,OAAO;YACL,KAAK;YACL,SAAS;YACT,mBAAmB,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAC5D,WAAW;SACZ,CAAC;IACJ,CAAC;IAED,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,oBAAoB,GACxB,MAAM,CAAC,iBAAiB,IAAI,IAAI,IAAI,MAAM,CAAC,gBAAgB,IAAI,IAAI;QACjE,CAAC,CAAC;YACE,cAAc,EAAE,MAAM,CAAC,iBAAiB,IAAI,IAAI;YAChD,aAAa,EAAE,MAAM,CAAC,gBAAgB,IAAI,IAAI;YAC9C,MAAM,EAAE,iBAAiB;SAC1B;QACH,CAAC,CAAC,IAAI,CAAC;IACX,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,oBAAoB,CAAC,CAAC;IACvD,OAAO;QACL,KAAK,EAAE,CAAC,QAAQ,CAAC;QACjB,SAAS;QACT,mBAAmB,EAAE,WAAW,CAAC,QAAQ,CAAC;QAC1C,WAAW,EAAE,IAAI;KAClB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,MAW3C;IAMC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,eAAe,EAAE,GAAG,MAAM,CAAC;IAC5E,6EAA6E;IAC7E,2EAA2E;IAC3E,yEAAyE;IACzE,gFAAgF;IAChF,gFAAgF;IAChF,+EAA+E;IAC/E,6EAA6E;IAC7E,0EAA0E;IAC1E,MAAM,SAAS,GAAG,CAAC,IAAkB,EAAU,EAAE,CAC/C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,gBAAgB,GAAG,uBAAuB,CAAC;QAC/C,KAAK;QACL,aAAa;QACb,iBAAiB,EAAE,eAAe;KACnC,CAAC,CAAC;IACH,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,CAAC,QAAQ,CAAC;IACvD,MAAM,aAAa,GAAkB;QACnC,gBAAgB,EAAE,oCAAoC;QACtD,MAAM,EAAE,KAAK;QACb,KAAK,EAAE,SAAS;QAChB,eAAe,EAAE,YAAY,CAAC,eAAe;QAC7C,UAAU,EAAE,YAAY,CAAC,UAAU;QACnC,MAAM,EAAE,YAAY,CAAC,MAAM;QAC3B,sBAAsB,EAAE,YAAY,CAAC,sBAAsB;QAC3D,qBAAqB,EAAE,gBAAgB,CAAC,WAAW;QACnD,cAAc,EAAE,gBAAgB,CAAC,cAAc;QAC/C,WAAW,EAAE,gBAAgB,CAAC,WAAW;QACzC,cAAc,EAAE,8BAA8B,CAAC,gBAAgB,CAAC;QAChE,GAAG,CAAC,MAAM,CAAC,eAAe,EAAE,MAAM;YAChC,CAAC,CAAC,EAAE,iBAAiB,EAAE,MAAM,CAAC,eAAe,EAAE;YAC/C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,qBAAqB,EAAE,YAAY,CAAC,qBAAqB,IAAI,IAAI;QACjE,aAAa,EAAE,IAAI;KACpB,CAAC;IACF,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;IAC9D,MAAM,aAAa,CAAC,iBAAiB,EAAE,aAAa,CAAC,CAAC;IACtD,OAAO,EAAE,aAAa,EAAE,iBAAiB,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC;AAC9E,CAAC"}

package/dist/audit/cli/dispatch/tierRouting.d.ts

@@ -0,0 +1,36 @@
+import type { DispatchModelHint, DispatchModelTier } from "audit-tools/shared";
+import type { DispatchComplexity } from "./types.js";
+import type { DispatchFanout } from "./types.js";
+export declare const TIER_RANK: Record<DispatchModelTier, number>;
+/**
+ * Derive a packet's relative model rank from its `routing_risk` (the JIT graph
+ * partition's max member risk) — the risk-primary baseline — with complexity
+ * signals acting as ESCALATORS ONLY: they can raise the tier (a genuinely
+ * large/critical-flow packet still gets the top rank at low risk) but never
+ * lower the risk baseline. Cut points are relative positions on the normalized
+ * risk scale, never model names (no-hardcoded-models invariant).
+ */
+export declare function resolveDispatchTier(params: {
+    /** Max member risk from the partition; undefined when no partition ran. */
+    routingRisk: number | undefined;
+    complexity: DispatchComplexity;
+    /** Relative cut-point overrides (sessionConfig.dispatch.routing_tiers). */
+    routingTiers?: {
+        deep_at?: number;
+        standard_at?: number;
+    };
+}): DispatchModelHint;
+export declare const TIER_ORDER: DispatchModelTier[];
+/**
+ * Fill per-tier budgets from the reported roster ranks. A tier the host did
+ * not report falls back to the nearest reported rank (preferring the more
+ * capable one on ties), mirroring how a host maps a tier hint onto its closest
+ * available model.
+ */
+export declare function resolveTierBudgets(perRank: ReadonlyMap<DispatchModelTier, number>): Record<DispatchModelTier, number>;
+export declare function computeDispatchFanout(params: {
+    agentCount: number;
+    maxConcurrent: number;
+    confirmThreshold?: number;
+}): DispatchFanout;
+//# sourceMappingURL=tierRouting.d.ts.map

package/dist/audit/cli/dispatch/tierRouting.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tierRouting.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/tierRouting.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAE/E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAOrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AASjD,eAAO,MAAM,SAAS,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAsB,CAAC;AAI/E;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE;IAC1C,2EAA2E;IAC3E,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IAChC,UAAU,EAAE,kBAAkB,CAAC;IAC/B,2EAA2E;IAC3E,YAAY,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CAC3D,GAAG,iBAAiB,CA+DpB;AAED,eAAO,MAAM,UAAU,EAAE,iBAAiB,EAAwB,CAAC;AAEnE;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,WAAW,CAAC,iBAAiB,EAAE,MAAM,CAAC,GAC9C,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,CA8BnC;AAED,wBAAgB,qBAAqB,CAAC,MAAM,EAAE;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B,GAAG,cAAc,CAejB"}