audit-tools 0.28.0

package/dist/audit/cli/confirmIntentStep.js

@@ -0,0 +1,210 @@
+import { LENSES } from "audit-tools/shared";
+import { MANDATORY_LENSES } from "../orchestrator/lensSelection.js";
+import { CONCEPTUAL_PERSPECTIVES, DEFAULT_CONCEPTUAL_PERSPECTIVES, } from "../orchestrator/designReviewPrompt.js";
+function isAggregatedRow(row) {
+    return "prefix" in row && row.prefix !== undefined;
+}
+// One-line meaning per canonical lens, shown in the confirm-intent catalog so the
+// user can choose deliberately instead of guessing from the bare lens name.
+const LENS_DESCRIPTIONS = {
+    correctness: "Logic errors, wrong results, broken invariants, mishandled edge cases.",
+    architecture: "Structure, boundaries, coupling, dependency direction, layering.",
+    maintainability: "Readability, duplication, complexity, naming, dead code, change cost.",
+    security: "Injection, authn/authz, secret handling, unsafe input, privilege boundaries.",
+    reliability: "Failure modes, error handling, retries, resource leaks, recovery.",
+    performance: "Hot paths, algorithmic complexity, allocation, avoidable I/O and work.",
+    data_integrity: "Persistence correctness, schema/serialization drift, races, lost or duplicated state.",
+    tests: "Coverage gaps, brittle or flaky tests, missing negative cases, weak assertions.",
+    operability: "Deploy / runbooks, health, config surface, diagnosability in production.",
+    config_deployment: "Build, packaging, CI/CD, release, environment and config wiring.",
+    observability: "Logging, metrics, tracing, and signal quality for debugging incidents.",
+};
+/**
+ * Render the host-facing prompt for the `confirm_intent` step. Shows the
+ * deterministically-computed scope picture and asks the host to write (or
+ * refine) `intent_checkpoint.json` — confirming scope/intent and optionally
+ * adding exclusions the disposition pass missed (the scope-pollution case),
+ * must-not-touch globs, free-form audit intent, disposition overrides for
+ * suspicious inclusions, and lens selection.
+ */
+export function renderConfirmIntentPrompt(preDigest, opts) {
+    const dirLines = preDigest.scope_dirs
+        .slice(0, 20)
+        .map((d) => `- \`${d.dir}\` — ${d.files} file(s)`)
+        .join("\n") || "_(none)_";
+    // Render collapsed excluded-scope summary
+    const excludedLines = preDigest.excluded_summary.length > 0
+        ? preDigest.excluded_summary
+            .map((row) => isAggregatedRow(row)
+            ? `- \`${row.prefix}/\` — ${row.file_count} file(s) (${row.status}${row.reason ? `: ${row.reason}` : ""})`
+            : `- \`${row.path}\` (${row.status}${row.reason ? `: ${row.reason}` : ""})`)
+            .join("\n")
+        : "_(none)_";
+    // Render disposition override proposals
+    const overrideProposalLines = preDigest.disposition_override_proposals.length > 0
+        ? preDigest.disposition_override_proposals
+            .map((p) => `- \`${p.path}\` → \`${p.proposed_status}\` (${p.reason})`)
+            .join("\n")
+        : "_(none)_";
+    // Render lens proposals
+    const lensProposalLines = preDigest.lens_proposals.length > 0
+        ? preDigest.lens_proposals
+            .map((p) => `- **${p.lens}**: ${p.action === "exclude" ? "suggest excluding" : "include"} — ${p.reason}`)
+            .join("\n")
+        : "_(none)_";
+    const hasOverrideProposals = preDigest.disposition_override_proposals.length > 0;
+    const hasLensProposals = preDigest.lens_proposals.length > 0;
+    // Derive the mandatory-lens prose from the authoritative MANDATORY_LENSES
+    // constant so the rendered guidance can never drift from the enforced set
+    // (MNT-df8c4551).
+    const mandatoryLensList = MANDATORY_LENSES.join(", ");
+    const unresolvedClauses = opts.unresolvedConstraintClauses ?? [];
+    const hasBlockingClauses = unresolvedClauses.length > 0;
+    return [
+        "# Confirm Audit Scope and Intent",
+        "",
+        ...(hasBlockingClauses
+            ? [
+                "## ⚠ Blocking: unencodable intent clauses",
+                "",
+                "Your `free_form_intent` contains directive(s) that could NOT be encoded",
+                "as a lens weight, priority signal, or scope emphasis. They will be",
+                "**silently lost** unless you resolve them here — the audit will not",
+                "proceed past planning until each is answered. For every question below,",
+                "add a `constraint_clauses` entry (with the exact `checkpoint_question`",
+                "text and a concrete `host_answer`) to `intent_checkpoint.json`, or remove",
+                "the clause from `free_form_intent`:",
+                "",
+                ...unresolvedClauses.map((c, i) => `${i + 1}. Clause: \`${c.text}\`\n   Question: ${c.checkpoint_question}`),
+                "",
+            ]
+            : []),
+        "Before planning, confirm what this audit should cover. The scope below was",
+        "discovered deterministically from intake. Your job is to **confirm it** and,",
+        "if needed, **prune scope pollution** the automatic disposition missed (build",
+        "output, vendored code, fixtures, generated files, scratch directories).",
+        "",
+        `**Mode:** ${preDigest.mode}${preDigest.since ? ` (since ${preDigest.since})` : ""}`,
+        `**Files in scope:** ${preDigest.files_in_scope}`,
+        "",
+        "## In-scope top-level directories",
+        "",
+        dirLines,
+        "",
+        "## Already excluded (deterministic disposition)",
+        "",
+        excludedLines,
+        "",
+        ...(hasOverrideProposals
+            ? [
+                "## Suspicious inclusions (proposed overrides)",
+                "",
+                "The following files match build-output, vendor, or generated patterns but",
+                "are currently included. Accept proposals by adding them to `disposition_overrides`.",
+                "",
+                overrideProposalLines,
+                "",
+            ]
+            : []),
+        ...(hasLensProposals
+            ? [
+                "## Lens proposals",
+                "",
+                `Based on codebase character. Mandatory lenses (${mandatoryLensList})`,
+                "cannot be excluded regardless of selection.",
+                "",
+                lensProposalLines,
+                "",
+            ]
+            : []),
+        "## Lens catalog",
+        "",
+        "The following canonical lenses are available:",
+        "",
+        ...LENSES.map((lens) => {
+            const isMandatory = MANDATORY_LENSES.includes(lens);
+            const desc = LENS_DESCRIPTIONS[lens];
+            return `- **${lens}**${isMandatory ? " *(mandatory)*" : ""}${desc ? ` — ${desc}` : ""}`;
+        }),
+        "",
+        `Mandatory lenses (${mandatoryLensList}) are`,
+        "always included regardless of selection.",
+        "",
+        "**Custom lenses are also accepted.** You may define any additional review",
+        "perspective — the lens name is freeform. Workers receive the lens name and",
+        "the `free_form_intent` as context for custom lenses.",
+        "",
+        "## Conceptual design-review depth",
+        "",
+        "The audit runs a conceptual design-review pass (philosophy / alternatives /",
+        "better directions, distinct from the contract pass). Choose its depth:",
+        "",
+        "- **shallow** *(default)* — a single conceptual reviewer. Faster, cheaper.",
+        `- **deep** — fan out ${DEFAULT_CONCEPTUAL_PERSPECTIVES} independent reviewers, each with a maximally`,
+        "  dissimilar value system, then compile via an independent judge. Surfaces more,",
+        "  costs more. The default perspectives are:",
+        ...CONCEPTUAL_PERSPECTIVES.slice(0, DEFAULT_CONCEPTUAL_PERSPECTIVES).map((p) => `    - **${p.name}** — ${p.lens}`),
+        "  Set `design_review.perspectives` to widen or narrow the fan-out.",
+        "",
+        "This records *how much* review to do, not which model runs it — model choice",
+        "is resolved at dispatch against whatever models the provider has then.",
+        "",
+        "## User confirmation required",
+        "",
+        "Before writing the checkpoint, confirm with the user in a single round of",
+        "questions (e.g. one `AskUserQuestion`):",
+        "",
+        "1. Present the scope summary above.",
+        "2. Present the lens selection (default: all canonical lenses, or per the",
+        "   proposals above). Ask which lenses to include/exclude and whether the",
+        "   user wants to add any custom lenses.",
+        "3. Ask the conceptual design-review depth (default **shallow**).",
+        "4. Wait for the user to confirm before proceeding.",
+        "",
+        "## What to do",
+        "",
+        "After the user confirms, write `intent_checkpoint.json` to:",
+        "",
+        `  ${opts.intentCheckpointPath}`,
+        "",
+        "Use this shape (only `scope_summary` and `intent_summary` are required; add",
+        "the optional fields to constrain the run):",
+        "",
+        "```json",
+        "{",
+        '  "schema_version": "intent-checkpoint/v1",',
+        '  "confirmed_at": "<ISO-8601 timestamp>",',
+        '  "confirmed_by": "host",',
+        '  "scope_summary": "<what is in scope>",',
+        '  "intent_summary": "<the goal, e.g. full-audit / security-focused>",',
+        '  "free_form_intent": "<optional: what to focus on; interpreted into lens/priority signals at planning, never threaded verbatim into worker prompts>",',
+        '  "constraint_clauses": [{ "text": "<unencodable clause>", "checkpoint_question": "<the question above>", "host_answer": "<how to apply it>" }],',
+        '  "excluded_scope": [{ "path": "<path or prefix>", "reason": "<why>" }],',
+        '  "must_not_touch": ["<glob>"],',
+        '  "disposition_overrides": [{ "path": "<path>", "status": "<generated|vendor|excluded|...>", "reason": "<why>" }],',
+        '  "lens_selection": { "include": ["<lens>"], "exclude": ["<lens>"] },',
+        '  "design_review": { "conceptual_depth": "shallow", "perspectives": 5 }',
+        "}",
+        "```",
+        "",
+        "- `constraint_clauses` resolves the blocking questions above: each unencodable",
+        "  `free_form_intent` clause needs one entry with a concrete `host_answer`.",
+        "  Until every blocking question is answered (or its clause removed from",
+        "  `free_form_intent`), this confirm-intent step re-fires and planning is held.",
+        "- `excluded_scope` entries are pruned from planning so excluded files never",
+        "  become audit tasks, and they are listed in the final report under",
+        '  "Excluded / Out-of-Scope".',
+        "- `disposition_overrides` patches the file disposition before coverage",
+        "  initialization — overridden files never enter coverage at all.",
+        "- `lens_selection.include` and `lens_selection.exclude` accept both canonical",
+        "  and custom lens names. Custom lenses generate tasks using the unit's files",
+        "  with context derived from the lens name and `free_form_intent`.",
+        "- `design_review.conceptual_depth` is `shallow` (default) or `deep`; on `deep`,",
+        "  `perspectives` bounds the parallel-reviewer fan-out. Omit for shallow.",
+        "- Leave the optional fields out to audit the full discovered scope.",
+        "",
+        `Then run: ${opts.continueCommand}`,
+        "",
+    ].join("\n");
+}
+//# sourceMappingURL=confirmIntentStep.js.map

package/dist/audit/cli/confirmIntentStep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"confirmIntentStep.js","sourceRoot":"","sources":["../../../src/audit/cli/confirmIntentStep.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AACpE,OAAO,EACL,uBAAuB,EACvB,+BAA+B,GAChC,MAAM,uCAAuC,CAAC;AAG/C,SAAS,eAAe,CAAC,GAAuC;IAC9D,OAAO,QAAQ,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC;AACrD,CAAC;AAED,kFAAkF;AAClF,4EAA4E;AAC5E,MAAM,iBAAiB,GAA2B;IAChD,WAAW,EAAE,wEAAwE;IACrF,YAAY,EAAE,kEAAkE;IAChF,eAAe,EAAE,uEAAuE;IACxF,QAAQ,EAAE,8EAA8E;IACxF,WAAW,EAAE,mEAAmE;IAChF,WAAW,EAAE,wEAAwE;IACrF,cAAc,EAAE,uFAAuF;IACvG,KAAK,EAAE,iFAAiF;IACxF,WAAW,EAAE,0EAA0E;IACvF,iBAAiB,EAAE,kEAAkE;IACrF,aAAa,EAAE,wEAAwE;CACxF,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,UAAU,yBAAyB,CACvC,SAAyB,EACzB,IAWC;IAED,MAAM,QAAQ,GACZ,SAAS,CAAC,UAAU;SACjB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,UAAU,CAAC;SACjD,IAAI,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC;IAE9B,0CAA0C;IAC1C,MAAM,aAAa,GACjB,SAAS,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;QACnC,CAAC,CAAC,SAAS,CAAC,gBAAgB;aACvB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CACX,eAAe,CAAC,GAAG,CAAC;YAClB,CAAC,CAAC,OAAO,GAAG,CAAC,MAAM,SAAS,GAAG,CAAC,UAAU,aAAa,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG;YAC1G,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAC9E;aACA,IAAI,CAAC,IAAI,CAAC;QACf,CAAC,CAAC,UAAU,CAAC;IAEjB,wCAAwC;IACxC,MAAM,qBAAqB,GACzB,SAAS,CAAC,8BAA8B,CAAC,MAAM,GAAG,CAAC;QACjD,CAAC,CAAC,SAAS,CAAC,8BAA8B;aACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,eAAe,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC;aACtE,IAAI,CAAC,IAAI,CAAC;QACf,CAAC,CAAC,UAAU,CAAC;IAEjB,wBAAwB;IACxB,MAAM,iBAAiB,GACrB,SAAS,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;QACjC,CAAC,CAAC,SAAS,CAAC,cAAc;aACrB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC;aACxG,IAAI,CAAC,IAAI,CAAC;QACf,CAAC,CAAC,UAAU,CAAC;IAEjB,MAAM,oBAAoB,GAAG,SAAS,CAAC,8BAA8B,CAAC,MAAM,GAAG,CAAC,CAAC;IACjF,MAAM,gBAAgB,GAAG,SAAS,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7D,0EAA0E;IAC1E,0EAA0E;IAC1E,kBAAkB;IAClB,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,MAAM,iBAAiB,GAAG,IAAI,CAAC,2BAA2B,IAAI,EAAE,CAAC;IACjE,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;IAExD,OAAO;QACL,kCAAkC;QAClC,EAAE;QACF,GAAG,CAAC,kBAAkB;YACpB,CAAC,CAAC;gBACE,2CAA2C;gBAC3C,EAAE;gBACF,yEAAyE;gBACzE,oEAAoE;gBACpE,qEAAqE;gBACrE,yEAAyE;gBACzE,wEAAwE;gBACxE,2EAA2E;gBAC3E,qCAAqC;gBACrC,EAAE;gBACF,GAAG,iBAAiB,CAAC,GAAG,CACtB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,oBAAoB,CAAC,CAAC,mBAAmB,EAAE,CAC3E;gBACD,EAAE;aACH;YACH,CAAC,CAAC,EAAE,CAAC;QACP,4EAA4E;QAC5E,8EAA8E;QAC9E,8EAA8E;QAC9E,yEAAyE;QACzE,EAAE;QACF,aAAa,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACpF,uBAAuB,SAAS,CAAC,cAAc,EAAE;QACjD,EAAE;QACF,mCAAmC;QACnC,EAAE;QACF,QAAQ;QACR,EAAE;QACF,iDAAiD;QACjD,EAAE;QACF,aAAa;QACb,EAAE;QACF,GAAG,CAAC,oBAAoB;YACtB,CAAC,CAAC;gBACE,+CAA+C;gBAC/C,EAAE;gBACF,2EAA2E;gBAC3E,qFAAqF;gBACrF,EAAE;gBACF,qBAAqB;gBACrB,EAAE;aACH;YACH,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,gBAAgB;YAClB,CAAC,CAAC;gBACE,mBAAmB;gBACnB,EAAE;gBACF,kDAAkD,iBAAiB,GAAG;gBACtE,6CAA6C;gBAC7C,EAAE;gBACF,iBAAiB;gBACjB,EAAE;aACH;YACH,CAAC,CAAC,EAAE,CAAC;QACP,iBAAiB;QACjB,EAAE;QACF,+CAA+C;QAC/C,EAAE;QACF,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACrB,MAAM,WAAW,GAAI,gBAAsC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC3E,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;YACrC,OAAO,OAAO,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAC1F,CAAC,CAAC;QACF,EAAE;QACF,qBAAqB,iBAAiB,OAAO;QAC7C,0CAA0C;QAC1C,EAAE;QACF,2EAA2E;QAC3E,4EAA4E;QAC5E,sDAAsD;QACtD,EAAE;QACF,mCAAmC;QACnC,EAAE;QACF,6EAA6E;QAC7E,wEAAwE;QACxE,EAAE;QACF,4EAA4E;QAC5E,wBAAwB,+BAA+B,+CAA+C;QACtG,kFAAkF;QAClF,6CAA6C;QAC7C,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC,EAAE,+BAA+B,CAAC,CAAC,GAAG,CACtE,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CACzC;QACD,oEAAoE;QACpE,EAAE;QACF,8EAA8E;QAC9E,wEAAwE;QACxE,EAAE;QACF,+BAA+B;QAC/B,EAAE;QACF,2EAA2E;QAC3E,yCAAyC;QACzC,EAAE;QACF,qCAAqC;QACrC,0EAA0E;QAC1E,0EAA0E;QAC1E,yCAAyC;QACzC,kEAAkE;QAClE,oDAAoD;QACpD,EAAE;QACF,eAAe;QACf,EAAE;QACF,6DAA6D;QAC7D,EAAE;QACF,KAAK,IAAI,CAAC,oBAAoB,EAAE;QAChC,EAAE;QACF,6EAA6E;QAC7E,4CAA4C;QAC5C,EAAE;QACF,SAAS;QACT,GAAG;QACH,6CAA6C;QAC7C,2CAA2C;QAC3C,2BAA2B;QAC3B,0CAA0C;QAC1C,uEAAuE;QACvE,wJAAwJ;QACxJ,kJAAkJ;QAClJ,0EAA0E;QAC1E,iCAAiC;QACjC,oHAAoH;QACpH,uEAAuE;QACvE,yEAAyE;QACzE,GAAG;QACH,KAAK;QACL,EAAE;QACF,gFAAgF;QAChF,4EAA4E;QAC5E,yEAAyE;QACzE,gFAAgF;QAChF,6EAA6E;QAC7E,qEAAqE;QACrE,8BAA8B;QAC9B,wEAAwE;QACxE,kEAAkE;QAClE,+EAA+E;QAC/E,8EAA8E;QAC9E,mEAAmE;QACnE,iFAAiF;QACjF,0EAA0E;QAC1E,qEAAqE;QACrE,EAAE;QACF,aAAa,IAAI,CAAC,eAAe,EAAE;QACnC,EAAE;KACH,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC"}

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

@@ -0,0 +1,102 @@
+import type { SessionConfig, GraphBundle, DispatchModelHint, DispatchModelTier } from "audit-tools/shared";
+import type { AuditTask } from "../../types.js";
+import type { ReviewPacket } from "../../types/reviewPlanning.js";
+import type { ArtifactBundle } from "../../io/artifacts.js";
+import type { TaskAffinityGraph } from "../../orchestrator/taskAffinityGraph.js";
+import type { DispatchComplexity } from "./types.js";
+export declare function isIsolatedLargeFilePacket(packet: {
+    file_paths: string[];
+    total_lines: number;
+}): boolean;
+export declare function buildDispatchComplexity(packet: {
+    task_ids: string[];
+    file_paths: string[];
+    total_lines: number;
+    estimated_tokens: number;
+    priority: NonNullable<AuditTask["priority"]>;
+    lenses: AuditTask["lens"][];
+    tags?: string[];
+}, largeFileMode: boolean): DispatchComplexity;
+export declare function buildPendingAuditTasks(bundle: ArtifactBundle): {
+    unit_id: string;
+    lens: string;
+    rationale: string;
+    task_id: string;
+    pass_id: string;
+    file_paths: string[];
+    status?: "complete" | "pending" | undefined;
+    file_line_counts?: Record<string, number> | undefined;
+    line_ranges?: {
+        path: string;
+        end: number;
+        start: number;
+    }[] | undefined;
+    inputs?: Record<string, string> | undefined;
+    priority?: "high" | "low" | "medium" | undefined;
+    token_estimate?: number | undefined;
+    risk_estimate?: number | undefined;
+    tags?: string[] | undefined;
+    completed_at?: string | undefined;
+    completion_reason?: string | undefined;
+}[];
+interface FilterPacketsResult {
+    emitPackets: ReviewPacket[];
+    deferredPackets: ReviewPacket[];
+}
+/**
+ * Encapsulates the budget-cap filtering logic.
+ * Returns the subset of packets to emit this round plus deferred packets.
+ */
+export declare function filterPackets(packets: ReviewPacket[], sessionConfig: SessionConfig): FilterPacketsResult;
+/**
+ * Resolve the task-affinity graph to partition at dispatch: prefer the persisted
+ * provider-neutral graph (built + frozen at planning) restricted to the still-
+ * pending tasks; fall back to building one from the dispatch tasks when the
+ * persisted graph is missing or doesn't cover every pending task (older
+ * artifacts or freshly generated tasks). Frozen per-task estimates live on the
+ * tasks, so a rebuild reuses the same node numbers.
+ */
+export declare function resolveDispatchTaskGraph(bundle: ArtifactBundle, orderedTasks: AuditTask[]): TaskAffinityGraph;
+/**
+ * Per-tier re-fit pass (partition-then-validate, design (a) of the roster
+ * handshake): the initial partition runs under the LARGEST reported window so
+ * coherent clusters are not over-split, but risk routing may then assign a
+ * packet to a rank with a smaller window. Re-partition just that packet's
+ * subgraph under its assigned tier's budget. The re-split sub-packets get
+ * their own tiers, so iterate to a bounded fixed point; a packet that cannot
+ * split further (single task, or the partition refuses) is left for the
+ * oversized-packet warning.
+ */
+export declare function fitPacketsToTierBudgets(params: {
+    packets: ReviewPacket[];
+    taskGraph: TaskAffinityGraph;
+    orderedTasks: AuditTask[];
+    tierBudgets: Record<DispatchModelTier, number>;
+    sessionConfig: SessionConfig;
+    lineIndex?: Record<string, number>;
+    sizeIndex?: Record<string, number>;
+    graphBundle?: GraphBundle;
+}): ReviewPacket[];
+/**
+ * Extracts the context-budget warning loop.
+ * Returns warnings for packets whose estimated token count exceeds the context
+ * budget — the assigned tier's budget when the host reported a roster, the
+ * single resolved window otherwise.
+ * When confidence is 'low', returns an empty array (limits are unreliable).
+ */
+export declare function collectOversizedWarnings(plan: Array<{
+    packet_id: string;
+    complexity: DispatchComplexity;
+    model_hint?: DispatchModelHint;
+}>, waveSchedule: {
+    confidence: string;
+    resolved_limits: {
+        context_tokens: number;
+        output_tokens: number;
+    };
+}, tierBudgets?: Record<DispatchModelTier, number> | null): Array<{
+    code: string;
+    message: string;
+}>;
+export {};
+//# sourceMappingURL=packetFilter.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"packetFilter.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/packetFilter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAC3G,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,yCAAyC,CAAC;AACjF,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAiBrD,wBAAgB,yBAAyB,CAAC,MAAM,EAAE;IAChD,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;CACrB,GAAG,OAAO,CAKV;AAED,wBAAgB,uBAAuB,CACrC,MAAM,EAAE;IACN,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;IAC7C,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;IAC5B,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB,EACD,aAAa,EAAE,OAAO,GACrB,kBAAkB,CAWpB;AAED,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,cAAc;;;;;;;;;;;;;;;;;;;;;IAe5D;AAED,UAAU,mBAAmB;IAC3B,WAAW,EAAE,YAAY,EAAE,CAAC;IAC5B,eAAe,EAAE,YAAY,EAAE,CAAC;CACjC;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,YAAY,EAAE,EACvB,aAAa,EAAE,aAAa,GAC3B,mBAAmB,CAcrB;AAED;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,cAAc,EACtB,YAAY,EAAE,SAAS,EAAE,GACxB,iBAAiB,CAcnB;AAED;;;;;;;;;GASG;AACH,wBAAgB,uBAAuB,CAAC,MAAM,EAAE;IAC9C,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,SAAS,EAAE,iBAAiB,CAAC;IAC7B,YAAY,EAAE,SAAS,EAAE,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;IAC/C,aAAa,EAAE,aAAa,CAAC;IAC7B,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,WAAW,CAAC,EAAE,WAAW,CAAC;CAC3B,GAAG,YAAY,EAAE,CA6CjB;AAED;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CACtC,IAAI,EAAE,KAAK,CAAC;IACV,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,kBAAkB,CAAC;IAC/B,UAAU,CAAC,EAAE,iBAAiB,CAAC;CAChC,CAAC,EACF,YAAY,EAAE;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE;QAAE,cAAc,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,EACxG,WAAW,CAAC,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,GAAG,IAAI,GACrD,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,CAsB1C"}

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

@@ -0,0 +1,148 @@
+import { orderTasksForPacketReview, buildReviewPacketsFromPartition, sizeIndexFromManifest, } from "../../orchestrator/reviewPackets.js";
+import { buildTaskAffinityGraph, filterTaskAffinityGraph, } from "../../orchestrator/taskAffinityGraph.js";
+import { LARGE_FILE_PACKET_TARGET_LINES } from "./types.js";
+import { resolveDispatchTier } from "./tierRouting.js";
+// Packet filtering and fitting: budget cap, pending-task derivation,
+// JIT task-graph resolution, per-tier re-fit pass, oversized warnings, and
+// dispatch-complexity assembly. Pure logic — no file I/O.
+export function isIsolatedLargeFilePacket(packet) {
+    return (packet.file_paths.length === 1 &&
+        packet.total_lines > LARGE_FILE_PACKET_TARGET_LINES);
+}
+export function buildDispatchComplexity(packet, largeFileMode) {
+    return {
+        priority: packet.priority,
+        task_count: packet.task_ids.length,
+        file_count: packet.file_paths.length,
+        total_lines: packet.total_lines,
+        estimated_tokens: packet.estimated_tokens,
+        lenses: packet.lenses,
+        tags: packet.tags ?? [],
+        large_file_mode: largeFileMode,
+    };
+}
+export function buildPendingAuditTasks(bundle) {
+    const completedTaskIds = new Set((bundle.audit_results ?? []).map((result) => result.task_id));
+    const pendingTasks = (bundle.audit_tasks ?? []).filter((task) => task.status !== "complete" && !completedTaskIds.has(task.task_id));
+    const lineIndex = Object.fromEntries(pendingTasks.flatMap((task) => Object.entries(task.file_line_counts ?? {})));
+    return orderTasksForPacketReview(pendingTasks, {
+        graphBundle: bundle.graph_bundle,
+        lineIndex,
+        sizeIndex: sizeIndexFromManifest(bundle.repo_manifest),
+    });
+}
+/**
+ * Encapsulates the budget-cap filtering logic.
+ * Returns the subset of packets to emit this round plus deferred packets.
+ */
+export function filterPackets(packets, sessionConfig) {
+    const maxPackets = sessionConfig.dispatch?.max_packets;
+    const budgetCapped = typeof maxPackets === "number" &&
+        maxPackets >= 0 &&
+        maxPackets < packets.length;
+    const emitPackets = budgetCapped
+        ? packets.slice(0, maxPackets)
+        : packets;
+    const deferredPackets = budgetCapped
+        ? packets.slice(maxPackets)
+        : [];
+    return { emitPackets, deferredPackets };
+}
+/**
+ * Resolve the task-affinity graph to partition at dispatch: prefer the persisted
+ * provider-neutral graph (built + frozen at planning) restricted to the still-
+ * pending tasks; fall back to building one from the dispatch tasks when the
+ * persisted graph is missing or doesn't cover every pending task (older
+ * artifacts or freshly generated tasks). Frozen per-task estimates live on the
+ * tasks, so a rebuild reuses the same node numbers.
+ */
+export function resolveDispatchTaskGraph(bundle, orderedTasks) {
+    const pendingIds = new Set(orderedTasks.map((task) => task.task_id));
+    const persisted = bundle.task_affinity_graph;
+    if (persisted && persisted.nodes.length > 0) {
+        const covered = persisted.nodes.filter((node) => pendingIds.has(node.task_id)).length;
+        if (covered === pendingIds.size) {
+            return filterTaskAffinityGraph(persisted, pendingIds);
+        }
+    }
+    return buildTaskAffinityGraph(orderedTasks, {
+        graphBundle: bundle.graph_bundle,
+    });
+}
+/**
+ * Per-tier re-fit pass (partition-then-validate, design (a) of the roster
+ * handshake): the initial partition runs under the LARGEST reported window so
+ * coherent clusters are not over-split, but risk routing may then assign a
+ * packet to a rank with a smaller window. Re-partition just that packet's
+ * subgraph under its assigned tier's budget. The re-split sub-packets get
+ * their own tiers, so iterate to a bounded fixed point; a packet that cannot
+ * split further (single task, or the partition refuses) is left for the
+ * oversized-packet warning.
+ */
+export function fitPacketsToTierBudgets(params) {
+    const { tierBudgets, sessionConfig } = params;
+    let packets = params.packets;
+    for (let pass = 0; pass < 4; pass++) {
+        let changed = false;
+        const next = [];
+        for (const packet of packets) {
+            const hint = resolveDispatchTier({
+                routingRisk: packet.routing_risk,
+                complexity: buildDispatchComplexity(packet, isIsolatedLargeFilePacket(packet)),
+                routingTiers: sessionConfig.dispatch?.routing_tiers,
+            });
+            if (packet.estimated_tokens <= tierBudgets[hint.tier] ||
+                packet.task_ids.length <= 1) {
+                next.push(packet);
+                continue;
+            }
+            const memberIds = new Set(packet.task_ids);
+            const subPackets = buildReviewPacketsFromPartition(params.orderedTasks.filter((task) => memberIds.has(task.task_id)), {
+                graph: filterTaskAffinityGraph(params.taskGraph, memberIds),
+                contextTokenBudget: tierBudgets[hint.tier],
+                riskMassBudget: sessionConfig.dispatch?.risk_mass_budget,
+                graphBundle: params.graphBundle,
+                lineIndex: params.lineIndex,
+                sizeIndex: params.sizeIndex,
+            });
+            if (subPackets.length <= 1) {
+                next.push(packet);
+                continue;
+            }
+            next.push(...subPackets);
+            changed = true;
+        }
+        packets = next;
+        if (!changed)
+            break;
+    }
+    return packets;
+}
+/**
+ * Extracts the context-budget warning loop.
+ * Returns warnings for packets whose estimated token count exceeds the context
+ * budget — the assigned tier's budget when the host reported a roster, the
+ * single resolved window otherwise.
+ * When confidence is 'low', returns an empty array (limits are unreliable).
+ */
+export function collectOversizedWarnings(plan, waveSchedule, tierBudgets) {
+    if (waveSchedule.confidence === "low") {
+        return [];
+    }
+    const fallbackBudget = waveSchedule.resolved_limits.context_tokens - waveSchedule.resolved_limits.output_tokens;
+    const warnings = [];
+    for (const p of plan) {
+        const tier = p.model_hint?.tier;
+        const contextBudget = tierBudgets && tier ? tierBudgets[tier] : fallbackBudget;
+        if (p.complexity.estimated_tokens > contextBudget) {
+            warnings.push({
+                code: "oversized_packet",
+                message: `Packet ${p.packet_id} estimated tokens (${p.complexity.estimated_tokens}) exceed ` +
+                    `context budget (${contextBudget}). This packet may fail at dispatch. ` +
+                    `Set quota.default_context_tokens or quota.models in session-config.json to override.`,
+            });
+        }
+    }
+    return warnings;
+}
+//# sourceMappingURL=packetFilter.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"packetFilter.js","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/packetFilter.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,yBAAyB,EACzB,+BAA+B,EAC/B,qBAAqB,GACtB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EACL,sBAAsB,EACtB,uBAAuB,GACxB,MAAM,yCAAyC,CAAC;AACjD,OAAO,EAAE,8BAA8B,EAAE,MAAM,YAAY,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAc,MAAM,kBAAkB,CAAC;AAEnE,qEAAqE;AACrE,2EAA2E;AAC3E,0DAA0D;AAE1D,MAAM,UAAU,yBAAyB,CAAC,MAGzC;IACC,OAAO,CACL,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAC9B,MAAM,CAAC,WAAW,GAAG,8BAA8B,CACpD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,uBAAuB,CACrC,MAQC,EACD,aAAsB;IAEtB,OAAO;QACL,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;QAClC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,MAAM;QACpC,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;QACzC,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE;QACvB,eAAe,EAAE,aAAa;KAC/B,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,MAAsB;IAC3D,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAC9B,CAAC,MAAM,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAC7D,CAAC;IACF,MAAM,YAAY,GAAG,CAAC,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,MAAM,CACpD,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,UAAU,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAC5E,CAAC;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAClC,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,CAC5E,CAAC;IACF,OAAO,yBAAyB,CAAC,YAAY,EAAE;QAC7C,WAAW,EAAE,MAAM,CAAC,YAAY;QAChC,SAAS;QACT,SAAS,EAAE,qBAAqB,CAAC,MAAM,CAAC,aAAa,CAAC;KACvD,CAAC,CAAC;AACL,CAAC;AAOD;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,OAAuB,EACvB,aAA4B;IAE5B,MAAM,UAAU,GAAG,aAAa,CAAC,QAAQ,EAAE,WAAW,CAAC;IACvD,MAAM,YAAY,GAChB,OAAO,UAAU,KAAK,QAAQ;QAC9B,UAAU,IAAI,CAAC;QACf,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC;IAC9B,MAAM,WAAW,GAAG,YAAY;QAC9B,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC;QAC9B,CAAC,CAAC,OAAO,CAAC;IACZ,MAAM,eAAe,GAAG,YAAY;QAClC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC;QAC3B,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAAsB,EACtB,YAAyB;IAEzB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACrE,MAAM,SAAS,GAAG,MAAM,CAAC,mBAAmB,CAAC;IAC7C,IAAI,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAC9C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAC7B,CAAC,MAAM,CAAC;QACT,IAAI,OAAO,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;YAChC,OAAO,uBAAuB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,OAAO,sBAAsB,CAAC,YAAY,EAAE;QAC1C,WAAW,EAAE,MAAM,CAAC,YAAY;KACjC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,uBAAuB,CAAC,MASvC;IACC,MAAM,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,MAAM,CAAC;IAC9C,IAAI,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC7B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,MAAM,IAAI,GAAmB,EAAE,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,mBAAmB,CAAC;gBAC/B,WAAW,EAAE,MAAM,CAAC,YAAY;gBAChC,UAAU,EAAE,uBAAuB,CACjC,MAAM,EACN,yBAAyB,CAAC,MAAM,CAAC,CAClC;gBACD,YAAY,EAAE,aAAa,CAAC,QAAQ,EAAE,aAAa;aACpD,CAAC,CAAC;YACH,IACE,MAAM,CAAC,gBAAgB,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;gBACjD,MAAM,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,EAC3B,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC3C,MAAM,UAAU,GAAG,+BAA+B,CAChD,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EACjE;gBACE,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC;gBAC3D,kBAAkB,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC1C,cAAc,EAAE,aAAa,CAAC,QAAQ,EAAE,gBAAgB;gBACxD,WAAW,EAAE,MAAM,CAAC,WAAW;gBAC/B,SAAS,EAAE,MAAM,CAAC,SAAS;gBAC3B,SAAS,EAAE,MAAM,CAAC,SAAS;aAC5B,CACF,CAAC;YACF,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;YACzB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,OAAO,GAAG,IAAI,CAAC;QACf,IAAI,CAAC,OAAO;YAAE,MAAM;IACtB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAIE,EACF,YAAwG,EACxG,WAAsD;IAEtD,IAAI,YAAY,CAAC,UAAU,KAAK,KAAK,EAAE,CAAC;QACtC,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,cAAc,GAClB,YAAY,CAAC,eAAe,CAAC,cAAc,GAAG,YAAY,CAAC,eAAe,CAAC,aAAa,CAAC;IAC3F,MAAM,QAAQ,GAA6C,EAAE,CAAC;IAC9D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC;QAChC,MAAM,aAAa,GACjB,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC;QAC3D,IAAI,CAAC,CAAC,UAAU,CAAC,gBAAgB,GAAG,aAAa,EAAE,CAAC;YAClD,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,kBAAkB;gBACxB,OAAO,EACL,UAAU,CAAC,CAAC,SAAS,sBAAsB,CAAC,CAAC,UAAU,CAAC,gBAAgB,WAAW;oBACnF,mBAAmB,aAAa,uCAAuC;oBACvE,sFAAsF;aACzF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

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

@@ -0,0 +1,48 @@
+import type { AuditTask } from "../../types.js";
+import type { ReviewPacket } from "../../types/reviewPlanning.js";
+import type { ArtifactBundle } from "../../io/artifacts.js";
+import { type FileAnchorSummary } from "../../orchestrator/fileAnchors.js";
+/**
+ * Encapsulates large-file anchor extraction for a single packet.
+ * Appends to the provided warnings array on unavailability or failure.
+ */
+export declare function extractPacketAnchor(params: {
+    packet: ReviewPacket;
+    reviewRoot: string | undefined;
+    bundle: ArtifactBundle;
+    taskResultsDir: string;
+    warnings: Array<{
+        code: string;
+        message: string;
+    }>;
+}): Promise<{
+    anchorPath: string | null;
+    anchorSummary: FileAnchorSummary | null;
+}>;
+/**
+ * Extracts the per-task flatMap that builds task section lines.
+ */
+export declare function buildTaskSections(packetTasks: AuditTask[], lensDefs: Record<string, {
+    description: string;
+    do_not_report: string;
+}>, lineIndex: Record<string, number>): string[];
+/**
+ * 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 declare function buildPacketPrompt(params: {
+    packet: ReviewPacket;
+    packetTasks: AuditTask[];
+    fileList: string;
+    largeFileSection: string[];
+    taskSections: string[];
+    resultPath: string;
+    repoRoot?: string;
+}): string;
+export declare function buildLargeFileSection(largeFileMode: boolean, anchorSummary: FileAnchorSummary | null, anchorPath: string | null): string[];
+//# sourceMappingURL=packetPrompt.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"packetPrompt.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/packetPrompt.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAA0B,KAAK,iBAAiB,EAAE,MAAM,mCAAmC,CAAC;AA0FnG;;;GAGG;AACH,wBAAsB,mBAAmB,CAAC,MAAM,EAAE;IAChD,MAAM,EAAE,YAAY,CAAC;IACrB,UAAU,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,MAAM,EAAE,cAAc,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACpD,GAAG,OAAO,CAAC;IAAE,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,aAAa,EAAE,iBAAiB,GAAG,IAAI,CAAA;CAAE,CAAC,CAgClF;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,WAAW,EAAE,SAAS,EAAE,EACxB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE;IAAE,WAAW,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAA;CAAE,CAAC,EACxE,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,MAAM,EAAE,CAwCV;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE;IACxC,MAAM,EAAE,YAAY,CAAC;IACrB,WAAW,EAAE,SAAS,EAAE,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,GAAG,MAAM,CAwFT;AAED,wBAAgB,qBAAqB,CACnC,aAAa,EAAE,OAAO,EACtB,aAAa,EAAE,iBAAiB,GAAG,IAAI,EACvC,UAAU,EAAE,MAAM,GAAG,IAAI,GACxB,MAAM,EAAE,CAcV"}