audit-tools 0.28.0

package/dist/audit/orchestrator/scope.js

@@ -0,0 +1,268 @@
+import { changedFiles, gitRefExists, isGitRepo } from "audit-tools/shared";
+import { buildDispositionMap } from "../extractors/disposition.js";
+import { buildPathLookup } from "../extractors/graph.js";
+import { HIGH_FAN_DEGREE_THRESHOLD, buildGraphDegreeIndex, collectGraphEdges, graphEdgeConfidence, normalizeGraphPath, } from "./reviewPacketGraph.js";
+/** Default cap on in-scope files (seeds + expanded) before expansion stops. */
+export const DEFAULT_SCOPE_MAX_FILES = 200;
+/** Graph edges below this confidence are never traversed during expansion. */
+export const SCOPE_EDGE_CONFIDENCE_FLOOR = 0.5;
+/**
+ * Expansion stops along a path once the accumulated path-confidence (the product
+ * of the traversed edge confidences) drops below this floor. With no fixed hop
+ * count, this — together with hub-skipping and the file budget — bounds the
+ * frontier deterministically.
+ */
+export const SCOPE_MIN_FRONTIER_CONFIDENCE = 0.5;
+/**
+ * Deterministic priority-frontier expansion (Phase 3). Starting from the changed
+ * files (seeds), walk the dependency graph outward, always visiting the neighbour
+ * with the highest accumulated path-confidence first (tie-broken by path). High
+ * fan-in/out hubs are skipped so a single change near a hub does not drag the
+ * whole repo into scope, low-confidence edges are dropped, and expansion halts at
+ * the file budget or when the best remaining frontier confidence falls below the
+ * floor. Same inputs → identical scope.
+ */
+export function computeAuditScope(input) {
+    const maxFiles = input.budget?.max_files ?? DEFAULT_SCOPE_MAX_FILES;
+    // normalized graph key -> canonical (repo-manifest) path for auditable files.
+    const canonicalByNorm = new Map();
+    for (const file of input.includedFiles) {
+        const key = normalizeGraphPath(file);
+        if (!canonicalByNorm.has(key)) {
+            canonicalByNorm.set(key, file);
+        }
+    }
+    // Seeds = changed files that are auditable (present in the manifest). Changed
+    // files that are excluded, deleted, or otherwise absent simply drop out.
+    const seedKeys = [];
+    const seedSeen = new Set();
+    for (const path of input.changed) {
+        const key = normalizeGraphPath(path);
+        if (canonicalByNorm.has(key) && !seedSeen.has(key)) {
+            seedSeen.add(key);
+            seedKeys.push(key);
+        }
+    }
+    const edges = collectGraphEdges(input.graphBundle);
+    const degree = buildGraphDegreeIndex(edges);
+    const isHub = (key) => (degree.fanIn.get(key) ?? 0) > HIGH_FAN_DEGREE_THRESHOLD ||
+        (degree.fanOut.get(key) ?? 0) > HIGH_FAN_DEGREE_THRESHOLD;
+    // Bidirectional adjacency: a change to a file is relevant to what it depends
+    // on AND to what depends on it. Edges below the confidence floor are dropped.
+    const adjacency = new Map();
+    const addEdge = (from, to, confidence) => {
+        const list = adjacency.get(from) ?? [];
+        list.push({ to, confidence });
+        adjacency.set(from, list);
+    };
+    for (const edge of edges) {
+        const confidence = graphEdgeConfidence(edge);
+        if (confidence < SCOPE_EDGE_CONFIDENCE_FLOOR) {
+            continue;
+        }
+        const from = normalizeGraphPath(edge.from);
+        const to = normalizeGraphPath(edge.to);
+        addEdge(from, to, confidence);
+        addEdge(to, from, confidence);
+    }
+    // Max-product shortest-path frontier. `best` holds the highest accumulated
+    // confidence discovered for each node; seeds start at 1.
+    const best = new Map();
+    for (const key of seedKeys) {
+        best.set(key, 1);
+    }
+    const visited = new Set();
+    const inScope = new Set(seedKeys);
+    const expandedKeys = [];
+    let budgetHit = false;
+    for (;;) {
+        let pick;
+        let pickConfidence = -1;
+        for (const [key, confidence] of best) {
+            if (visited.has(key))
+                continue;
+            if (confidence > pickConfidence ||
+                (confidence === pickConfidence && (pick === undefined || key < pick))) {
+                pick = key;
+                pickConfidence = confidence;
+            }
+        }
+        if (pick === undefined || pickConfidence < SCOPE_MIN_FRONTIER_CONFIDENCE) {
+            break;
+        }
+        visited.add(pick);
+        // Record newly-reached auditable files (seeds are already in scope).
+        if (canonicalByNorm.has(pick) && !inScope.has(pick)) {
+            if (inScope.size >= maxFiles) {
+                budgetHit = true;
+                process.stderr.write(JSON.stringify({
+                    kind: "scope_budget_hit",
+                    max_files: maxFiles,
+                    since: input.since,
+                    seed_count: seedKeys.length,
+                    ts: new Date().toISOString(),
+                }) + "\n");
+                break;
+            }
+            inScope.add(pick);
+            expandedKeys.push(pick);
+        }
+        // Relax neighbours, skipping hubs (never traverse through or into a hub) and
+        // non-auditable nodes.
+        for (const neighbour of adjacency.get(pick) ?? []) {
+            if (isHub(neighbour.to) || !canonicalByNorm.has(neighbour.to)) {
+                continue;
+            }
+            const candidate = pickConfidence * neighbour.confidence;
+            if (candidate < SCOPE_MIN_FRONTIER_CONFIDENCE) {
+                continue;
+            }
+            if (candidate > (best.get(neighbour.to) ?? 0)) {
+                best.set(neighbour.to, candidate);
+            }
+        }
+    }
+    const seedFiles = seedKeys
+        .map((key) => canonicalByNorm.get(key))
+        .sort((a, b) => a.localeCompare(b));
+    const expandedFiles = expandedKeys
+        .map((key) => canonicalByNorm.get(key))
+        .sort((a, b) => a.localeCompare(b));
+    const notes = [];
+    if (seedFiles.length === 0) {
+        notes.push(`No auditable files changed since ${input.since}.`);
+    }
+    if (budgetHit) {
+        notes.push(`Expansion stopped at the ${maxFiles}-file budget; some graph neighbours were left out of scope.`);
+    }
+    return {
+        mode: "delta",
+        since: input.since,
+        seed_files: seedFiles,
+        expanded_files: expandedFiles,
+        budget: { max_files: maxFiles },
+        ...(notes.length > 0 ? { dropped_note: notes.join(" ") } : {}),
+    };
+}
+/** A full-audit scope (the default, and every fallback). */
+export function fullAuditScope(budget, droppedNote) {
+    return {
+        mode: "full",
+        since: null,
+        seed_files: [],
+        expanded_files: [],
+        budget: { max_files: budget?.max_files ?? DEFAULT_SCOPE_MAX_FILES },
+        ...(droppedNote ? { dropped_note: droppedNote } : {}),
+    };
+}
+/**
+ * Resolve the scope for a planning run. Returns a full-audit scope unless a
+ * `--since` ref was supplied against a real git repository; an unusable ref or
+ * missing root degrades to a full audit with an honest note. Reads the auditable
+ * file set from the repo manifest + disposition (the same lookup the graph
+ * extractor uses) and the dependency graph from the bundle.
+ */
+export function resolveAuditScope(input) {
+    const since = input.since?.trim();
+    if (!since) {
+        return fullAuditScope(input.budget);
+    }
+    if (!input.root) {
+        return fullAuditScope(input.budget, `--since '${since}' was ignored: no repository root was available, so a full audit ran.`);
+    }
+    if (!isGitRepo(input.root)) {
+        return fullAuditScope(input.budget, `--since '${since}' was ignored: '${input.root}' is not a git repository, so a full audit ran.`);
+    }
+    if (!gitRefExists(input.root, since)) {
+        return fullAuditScope(input.budget, `--since '${since}' could not be resolved to a commit, so a full audit ran.`);
+    }
+    const dispositionMap = buildDispositionMap(input.bundle.file_disposition);
+    const includedFiles = input.bundle.repo_manifest
+        ? [
+            ...new Set(buildPathLookup(input.bundle.repo_manifest, dispositionMap).values()),
+        ].sort((a, b) => a.localeCompare(b))
+        : [];
+    return computeAuditScope({
+        since,
+        changed: changedFiles(input.root, since),
+        includedFiles,
+        graphBundle: input.bundle.graph_bundle,
+        budget: input.budget,
+    });
+}
+/**
+ * Apply a delta scope to a freshly-built coverage matrix. In-scope files (seeds
+ * + expanded neighbours) keep their fresh `pending` status to be re-audited.
+ * Out-of-scope files inherit a prior `complete` record verbatim when present (so
+ * previously-finished work is preserved, not re-run), and are otherwise excluded
+ * from this run with `classification_status: "out_of_scope_delta"`. Deterministic
+ * exclusions (non-auditable/trivial) are left untouched. A full scope is a no-op.
+ */
+export function applyScopeToCoverage(coverage, scope, priorCoverage) {
+    if (scope.mode !== "delta") {
+        return coverage;
+    }
+    const inScope = new Set([
+        ...scope.seed_files,
+        ...scope.expanded_files,
+    ]);
+    const priorByPath = new Map((priorCoverage?.files ?? []).map((file) => [file.path, file]));
+    for (const file of coverage.files) {
+        if (file.audit_status === "excluded") {
+            continue;
+        }
+        if (inScope.has(file.path)) {
+            continue;
+        }
+        const prior = priorByPath.get(file.path);
+        if (prior && prior.audit_status === "complete") {
+            file.required_lenses = [...prior.required_lenses];
+            file.completed_lenses = [...prior.completed_lenses];
+            file.unit_ids = [...prior.unit_ids];
+            file.audit_status = "complete";
+            file.classification_status = prior.classification_status;
+        }
+        else {
+            file.required_lenses = [];
+            file.completed_lenses = [];
+            file.unit_ids = [];
+            file.audit_status = "excluded";
+            file.classification_status = "out_of_scope_delta";
+        }
+    }
+    return coverage;
+}
+function pathMatchesExclusion(filePath, entryPath) {
+    const f = filePath.replace(/\\/g, "/");
+    const p = entryPath.replace(/\\/g, "/").replace(/\/+$/, "");
+    if (!p)
+        return false;
+    return f === p || f.startsWith(`${p}/`);
+}
+/**
+ * Apply the intent checkpoint's `excluded_scope` to a coverage matrix: any file
+ * whose path matches an exclusion (exact or directory-prefix) is marked excluded
+ * so it never becomes an audit task. The user's exclusions layer on top of the
+ * deterministic disposition — they catch scope pollution the automatic pass
+ * missed. Returns the newly-excluded paths (for the run summary / report); a
+ * checkpoint with no exclusions is a no-op.
+ */
+export function applyIntentExclusionsToCoverage(coverage, excludedScope) {
+    if (!excludedScope || excludedScope.length === 0)
+        return [];
+    const excluded = [];
+    for (const file of coverage.files) {
+        if (file.audit_status === "excluded")
+            continue;
+        if (excludedScope.some((entry) => pathMatchesExclusion(file.path, entry.path))) {
+            file.required_lenses = [];
+            file.completed_lenses = [];
+            file.unit_ids = [];
+            file.audit_status = "excluded";
+            file.classification_status = "out_of_scope_intent";
+            excluded.push(file.path);
+        }
+    }
+    return excluded;
+}
+//# sourceMappingURL=scope.js.map

package/dist/audit/orchestrator/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../../src/audit/orchestrator/scope.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAK3E,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EACL,yBAAyB,EACzB,qBAAqB,EACrB,iBAAiB,EACjB,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,wBAAwB,CAAC;AAEhC,+EAA+E;AAC/E,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAC3C,8EAA8E;AAC9E,MAAM,CAAC,MAAM,2BAA2B,GAAG,GAAG,CAAC;AAC/C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,GAAG,CAAC;AAcjD;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA6B;IAE7B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,uBAAuB,CAAC;IAEpE,8EAA8E;IAC9E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9B,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,yEAAyE;IACzE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAW,EAAE,CACrC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,yBAAyB;QACxD,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,yBAAyB,CAAC;IAE5D,6EAA6E;IAC7E,8EAA8E;IAC9E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqD,CAAC;IAC/E,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,UAAkB,EAAQ,EAAE;QACrE,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACvC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,UAAU,GAAG,2BAA2B,EAAE,CAAC;YAC7C,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,OAAO,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;QAC9B,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAChC,CAAC;IAED,2EAA2E;IAC3E,yDAAyD;IACzD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;IAC1C,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,SAAS,CAAC;QACR,IAAI,IAAwB,CAAC;QAC7B,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC;QACxB,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,IAAI,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC/B,IACE,UAAU,GAAG,cAAc;gBAC3B,CAAC,UAAU,KAAK,cAAc,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,EACrE,CAAC;gBACD,IAAI,GAAG,GAAG,CAAC;gBACX,cAAc,GAAG,UAAU,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,IAAI,IAAI,KAAK,SAAS,IAAI,cAAc,GAAG,6BAA6B,EAAE,CAAC;YACzE,MAAM;QACR,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAElB,qEAAqE;QACrE,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpD,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC7B,SAAS,GAAG,IAAI,CAAC;gBACjB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,IAAI,CAAC,SAAS,CAAC;oBACb,IAAI,EAAE,kBAAkB;oBACxB,SAAS,EAAE,QAAQ;oBACnB,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,UAAU,EAAE,QAAQ,CAAC,MAAM;oBAC3B,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;iBAC7B,CAAC,GAAG,IAAI,CACV,CAAC;gBACF,MAAM;YACR,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,6EAA6E;QAC7E,uBAAuB;QACvB,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,IAAI,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9D,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,cAAc,GAAG,SAAS,CAAC,UAAU,CAAC;YACxD,IAAI,SAAS,GAAG,6BAA6B,EAAE,CAAC;gBAC9C,SAAS;YACX,CAAC;YACD,IAAI,SAAS,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC9C,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,QAAQ;SACvB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;SACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,aAAa,GAAG,YAAY;SAC/B,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;SACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,oCAAoC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,CAAC,IAAI,CACR,4BAA4B,QAAQ,6DAA6D,CAClG,CAAC;IACJ,CAAC;IAED,OAAO;QACL,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,UAAU,EAAE,SAAS;QACrB,cAAc,EAAE,aAAa;QAC7B,MAAM,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE;QAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC/D,CAAC;AACJ,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,cAAc,CAC5B,MAAyB,EACzB,WAAoB;IAEpB,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,KAAK,EAAE,IAAI;QACX,UAAU,EAAE,EAAE;QACd,cAAc,EAAE,EAAE;QAClB,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,IAAI,uBAAuB,EAAE;QACnE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtD,CAAC;AACJ,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA6B;IAE7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;IAClC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAChB,OAAO,cAAc,CACnB,KAAK,CAAC,MAAM,EACZ,YAAY,KAAK,uEAAuE,CACzF,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,OAAO,cAAc,CACnB,KAAK,CAAC,MAAM,EACZ,YAAY,KAAK,mBAAmB,KAAK,CAAC,IAAI,iDAAiD,CAChG,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACrC,OAAO,cAAc,CACnB,KAAK,CAAC,MAAM,EACZ,YAAY,KAAK,2DAA2D,CAC7E,CAAC;IACJ,CAAC;IAED,MAAM,cAAc,GAAG,mBAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;IAC1E,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,aAAa;QAC9C,CAAC,CAAC;YACE,GAAG,IAAI,GAAG,CACR,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC,MAAM,EAAE,CACrE;SACF,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO,iBAAiB,CAAC;QACvB,KAAK;QACL,OAAO,EAAE,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QACxC,aAAa;QACb,WAAW,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY;QACtC,MAAM,EAAE,KAAK,CAAC,MAAM;KACrB,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAwB,EACxB,KAAyB,EACzB,aAA8B;IAE9B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC3B,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS;QAC9B,GAAG,KAAK,CAAC,UAAU;QACnB,GAAG,KAAK,CAAC,cAAc;KACxB,CAAC,CAAC;IACH,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,CAAC,aAAa,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAC9D,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;YACrC,SAAS;QACX,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,KAAK,IAAI,KAAK,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;YAC/C,IAAI,CAAC,eAAe,GAAG,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC;YAClD,IAAI,CAAC,gBAAgB,GAAG,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACpD,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC;YAC/B,IAAI,CAAC,qBAAqB,GAAG,KAAK,CAAC,qBAAqB,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACnB,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC;YAC/B,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QACpD,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,QAAgB,EAAE,SAAiB;IAC/D,MAAM,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5D,IAAI,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACrB,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,+BAA+B,CAC7C,QAAwB,EACxB,aAAkE;IAElE,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5D,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,YAAY,KAAK,UAAU;YAAE,SAAS;QAC/C,IACE,aAAa,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAC1E,CAAC;YACD,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACnB,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC;YAC/B,IAAI,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;YACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/audit/orchestrator/selectiveDeepening/conflict.d.ts

@@ -0,0 +1,9 @@
+import type { AuditTask } from "../../types.js";
+import { type FindingContext } from "./shared.js";
+export declare function buildConflictFollowupTask(params: {
+    contexts: FindingContext[];
+    conflictKey: string;
+    lineIndex?: Record<string, number>;
+}): AuditTask;
+export declare function conflictGroups(contexts: FindingContext[]): Map<string, FindingContext[]>;
+//# sourceMappingURL=conflict.d.ts.map

package/dist/audit/orchestrator/selectiveDeepening/conflict.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict.d.ts","sourceRoot":"","sources":["../../../../src/audit/orchestrator/selectiveDeepening/conflict.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAe,SAAS,EAAQ,MAAM,gBAAgB,CAAC;AACnE,OAAO,EAGL,KAAK,cAAc,EAMpB,MAAM,aAAa,CAAC;AAErB,wBAAgB,yBAAyB,CAAC,MAAM,EAAE;IAChD,QAAQ,EAAE,cAAc,EAAE,CAAC;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACpC,GAAG,SAAS,CAqDZ;AAED,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,cAAc,EAAE,GACzB,GAAG,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC,CAyB/B"}

package/dist/audit/orchestrator/selectiveDeepening/conflict.js

@@ -0,0 +1,72 @@
+import { CONFIDENCE_RANK, DEEPENING_TAG, SEVERITY_RANK, lineCountForPath, sanitizeSegment, taskIdFor, uniqueSorted, } from "./shared.js";
+export function buildConflictFollowupTask(params) {
+    const [first] = params.contexts;
+    const paths = uniqueSorted(params.contexts.flatMap((context) => context.paths));
+    const maxSeverity = Math.max(...params.contexts.map((context) => SEVERITY_RANK[context.finding.severity]));
+    const lineSources = new Map();
+    for (const context of params.contexts) {
+        for (const path of context.paths) {
+            if (!lineSources.has(path)) {
+                lineSources.set(path, { task: context.task, result: context.result });
+            }
+        }
+    }
+    const sourceTaskIds = uniqueSorted(params.contexts.map((context) => context.result.task_id));
+    const findingIds = uniqueSorted(params.contexts.map((context) => context.finding.id));
+    return {
+        task_id: taskIdFor("conflict", [
+            params.conflictKey,
+            ...sourceTaskIds,
+            ...findingIds,
+        ]),
+        unit_id: first?.result.unit_id ?? "selective-deepening",
+        pass_id: `deepening:${first?.result.pass_id ?? "conflict"}`,
+        lens: (first?.result.lens ?? "correctness"),
+        file_paths: paths,
+        file_line_counts: Object.fromEntries(paths.map((path) => {
+            const source = lineSources.get(path);
+            return [
+                path,
+                source
+                    ? lineCountForPath(path, source.task, source.result, params.lineIndex)
+                    : (params.lineIndex?.[path] ?? 0),
+            ];
+        })),
+        rationale: `Reconcile conflicting audit output for ${params.conflictKey}. ` +
+            `Compare source tasks ${sourceTaskIds.join(", ")} and decide the correct severity, confidence, and evidence-backed conclusion.`,
+        priority: maxSeverity >= SEVERITY_RANK.high ? "high" : "medium",
+        tags: [
+            DEEPENING_TAG,
+            "trigger:conflicting_output",
+            ...sourceTaskIds.slice(0, 3).map((id) => `source_task:${sanitizeSegment(id)}`),
+        ],
+        status: "pending",
+    };
+}
+export function conflictGroups(contexts) {
+    const groups = new Map();
+    for (const context of contexts) {
+        for (const path of context.paths) {
+            const key = [
+                context.result.lens,
+                context.finding.category,
+                path.toLowerCase(),
+            ].join(":");
+            const group = groups.get(key) ?? [];
+            group.push(context);
+            groups.set(key, group);
+        }
+    }
+    for (const [key, group] of groups) {
+        const uniqueTasks = new Set(group.map((context) => context.result.task_id));
+        const severities = group.map((context) => SEVERITY_RANK[context.finding.severity]);
+        const confidences = group.map((context) => CONFIDENCE_RANK[context.finding.confidence]);
+        const severitySpread = Math.max(...severities) - Math.min(...severities);
+        const confidenceSpread = Math.max(...confidences) - Math.min(...confidences);
+        if (uniqueTasks.size < 2 || (severitySpread < 2 && confidenceSpread < 2)) {
+            groups.delete(key);
+        }
+    }
+    return groups;
+}
+//# sourceMappingURL=conflict.js.map

package/dist/audit/orchestrator/selectiveDeepening/conflict.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict.js","sourceRoot":"","sources":["../../../../src/audit/orchestrator/selectiveDeepening/conflict.ts"],"names":[],"mappings":"AACA,OAAO,EACL,eAAe,EACf,aAAa,EAEb,aAAa,EACb,gBAAgB,EAChB,eAAe,EACf,SAAS,EACT,YAAY,GACb,MAAM,aAAa,CAAC;AAErB,MAAM,UAAU,yBAAyB,CAAC,MAIzC;IACC,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC;IAChC,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAChF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAC7E,CAAC;IACF,MAAM,WAAW,GAAG,IAAI,GAAG,EAAqD,CAAC;IACjF,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3B,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,aAAa,GAAG,YAAY,CAChC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CACzD,CAAC;IACF,MAAM,UAAU,GAAG,YAAY,CAC7B,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CACrD,CAAC;IAEF,OAAO;QACL,OAAO,EAAE,SAAS,CAAC,UAAU,EAAE;YAC7B,MAAM,CAAC,WAAW;YAClB,GAAG,aAAa;YAChB,GAAG,UAAU;SACd,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,IAAI,qBAAqB;QACvD,OAAO,EAAE,aAAa,KAAK,EAAE,MAAM,CAAC,OAAO,IAAI,UAAU,EAAE;QAC3D,IAAI,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,IAAI,aAAa,CAAS;QACnD,UAAU,EAAE,KAAK;QACjB,gBAAgB,EAAE,MAAM,CAAC,WAAW,CAClC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACjB,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,OAAO;gBACL,IAAI;gBACJ,MAAM;oBACJ,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC;oBACtE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACpC,CAAC;QACJ,CAAC,CAAC,CACH;QACD,SAAS,EACP,0CAA0C,MAAM,CAAC,WAAW,IAAI;YAChE,wBAAwB,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,+EAA+E;QACjI,QAAQ,EAAE,WAAW,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;QAC/D,IAAI,EAAE;YACJ,aAAa;YACb,4BAA4B;YAC5B,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,eAAe,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC;SAC/E;QACD,MAAM,EAAE,SAAS;KAClB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,QAA0B;IAE1B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA4B,CAAC;IACnD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG;gBACV,OAAO,CAAC,MAAM,CAAC,IAAI;gBACnB,OAAO,CAAC,OAAO,CAAC,QAAQ;gBACxB,IAAI,CAAC,WAAW,EAAE;aACnB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACZ,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5E,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QACnF,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;QACxF,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;QACzE,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;QAC7E,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,CAAC,IAAI,gBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC;YACzE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/audit/orchestrator/selectiveDeepening/findingFollowup.d.ts

@@ -0,0 +1,11 @@
+import type { AuditResult, AuditTask, Finding } from "../../types.js";
+import { type FindingContext } from "./shared.js";
+export declare function buildFindingFollowupTask(params: {
+    result: AuditResult;
+    task?: AuditTask;
+    finding: Finding;
+    triggers: string[];
+    lineIndex?: Record<string, number>;
+}): AuditTask;
+export declare function findingContexts(results: AuditResult[], taskById: Map<string, AuditTask>): FindingContext[];
+//# sourceMappingURL=findingFollowup.d.ts.map

package/dist/audit/orchestrator/selectiveDeepening/findingFollowup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findingFollowup.d.ts","sourceRoot":"","sources":["../../../../src/audit/orchestrator/selectiveDeepening/findingFollowup.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAEL,KAAK,cAAc,EAOpB,MAAM,aAAa,CAAC;AAErB,wBAAgB,wBAAwB,CAAC,MAAM,EAAE;IAC/C,MAAM,EAAE,WAAW,CAAC;IACpB,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACpC,GAAG,SAAS,CAqCZ;AAED,wBAAgB,eAAe,CAC7B,OAAO,EAAE,WAAW,EAAE,EACtB,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,GAC/B,cAAc,EAAE,CAiBlB"}

package/dist/audit/orchestrator/selectiveDeepening/findingFollowup.js

@@ -0,0 +1,53 @@
+import { DEEPENING_TAG, SEVERITY_RANK, isDeepeningTask, lineCountForPath, pathsForFinding, sanitizeSegment, taskIdFor, } from "./shared.js";
+export function buildFindingFollowupTask(params) {
+    const paths = pathsForFinding(params.finding, params.result, params.task);
+    const triggerLabel = params.triggers.join("+");
+    const taskId = taskIdFor("finding", [
+        params.result.task_id,
+        params.finding.id,
+        triggerLabel,
+    ]);
+    const priority = SEVERITY_RANK[params.finding.severity] >= SEVERITY_RANK.high
+        ? "high"
+        : "medium";
+    return {
+        task_id: taskId,
+        unit_id: params.result.unit_id,
+        pass_id: `deepening:${params.result.pass_id}`,
+        lens: params.result.lens,
+        file_paths: paths,
+        file_line_counts: Object.fromEntries(paths.map((path) => [
+            path,
+            lineCountForPath(path, params.task, params.result, params.lineIndex),
+        ])),
+        rationale: `Follow up on ${params.finding.id} (${params.finding.severity}/${params.finding.confidence}) from ${params.result.task_id}. ` +
+            "Verify impact, evidence quality, affected scope, and whether the finding should stand, narrow, or be downgraded.",
+        priority,
+        tags: [
+            DEEPENING_TAG,
+            ...params.triggers.map((trigger) => `trigger:${trigger}`),
+            `source_task:${sanitizeSegment(params.result.task_id)}`,
+            `finding:${sanitizeSegment(params.finding.id)}`,
+        ],
+        status: "pending",
+    };
+}
+export function findingContexts(results, taskById) {
+    const contexts = [];
+    for (const result of results) {
+        const task = taskById.get(result.task_id);
+        if (isDeepeningTask(task)) {
+            continue;
+        }
+        for (const finding of result.findings) {
+            contexts.push({
+                result,
+                task,
+                finding,
+                paths: pathsForFinding(finding, result, task),
+            });
+        }
+    }
+    return contexts;
+}
+//# sourceMappingURL=findingFollowup.js.map

package/dist/audit/orchestrator/selectiveDeepening/findingFollowup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findingFollowup.js","sourceRoot":"","sources":["../../../../src/audit/orchestrator/selectiveDeepening/findingFollowup.ts"],"names":[],"mappings":"AACA,OAAO,EACL,aAAa,EAEb,aAAa,EACb,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,eAAe,EACf,SAAS,GACV,MAAM,aAAa,CAAC;AAErB,MAAM,UAAU,wBAAwB,CAAC,MAMxC;IACC,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,EAAE;QAClC,MAAM,CAAC,MAAM,CAAC,OAAO;QACrB,MAAM,CAAC,OAAO,CAAC,EAAE;QACjB,YAAY;KACb,CAAC,CAAC;IACH,MAAM,QAAQ,GACZ,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,IAAI;QAC1D,CAAC,CAAC,MAAM;QACR,CAAC,CAAC,QAAQ,CAAC;IAEf,OAAO;QACL,OAAO,EAAE,MAAM;QACf,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO;QAC9B,OAAO,EAAE,aAAa,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE;QAC7C,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;QACxB,UAAU,EAAE,KAAK;QACjB,gBAAgB,EAAE,MAAM,CAAC,WAAW,CAClC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAClB,IAAI;YACJ,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC;SACrE,CAAC,CACH;QACD,SAAS,EACP,gBAAgB,MAAM,CAAC,OAAO,CAAC,EAAE,KAAK,MAAM,CAAC,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,UAAU,MAAM,CAAC,MAAM,CAAC,OAAO,IAAI;YAC7H,kHAAkH;QACpH,QAAQ;QACR,IAAI,EAAE;YACJ,aAAa;YACb,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,WAAW,OAAO,EAAE,CAAC;YACzD,eAAe,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;YACvD,WAAW,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;SAChD;QACD,MAAM,EAAE,SAAS;KAClB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,OAAsB,EACtB,QAAgC;IAEhC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACtC,QAAQ,CAAC,IAAI,CAAC;gBACZ,MAAM;gBACN,IAAI;gBACJ,OAAO;gBACP,KAAK,EAAE,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/audit/orchestrator/selectiveDeepening/highRiskClean.d.ts

@@ -0,0 +1,8 @@
+import type { AuditResult, AuditTask } from "../../types.js";
+export declare function isHighRiskCleanResult(result: AuditResult, task: AuditTask | undefined): boolean;
+export declare function buildHighRiskCleanFollowupTask(params: {
+    result: AuditResult;
+    task?: AuditTask;
+    lineIndex?: Record<string, number>;
+}): AuditTask;
+//# sourceMappingURL=highRiskClean.d.ts.map

package/dist/audit/orchestrator/selectiveDeepening/highRiskClean.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"highRiskClean.d.ts","sourceRoot":"","sources":["../../../../src/audit/orchestrator/selectiveDeepening/highRiskClean.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAU7D,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,WAAW,EACnB,IAAI,EAAE,SAAS,GAAG,SAAS,GAC1B,OAAO,CA4BT;AAED,wBAAgB,8BAA8B,CAAC,MAAM,EAAE;IACrD,MAAM,EAAE,WAAW,CAAC;IACpB,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACpC,GAAG,SAAS,CA+BZ"}

package/dist/audit/orchestrator/selectiveDeepening/highRiskClean.js

@@ -0,0 +1,46 @@
+import { DEEPENING_TAG, isDeepeningTask, lineCountForPath, sanitizeSegment, taskIdFor, uniqueSorted, } from "./shared.js";
+export function isHighRiskCleanResult(result, task) {
+    if (result.findings.length > 0 ||
+        result.requires_followup === false ||
+        isDeepeningTask(task)) {
+        return false;
+    }
+    if (!task) {
+        return (result.requires_followup === true &&
+            (result.lens === "security" || result.lens === "data_integrity"));
+    }
+    if (task.priority === "high") {
+        return true;
+    }
+    if (task.tags?.some((tag) => ["critical_flow", "external_analyzer_signal"].includes(tag))) {
+        return true;
+    }
+    return result.requires_followup === true && task.priority === "medium";
+}
+export function buildHighRiskCleanFollowupTask(params) {
+    const taskFilePaths = params.task?.file_paths;
+    const paths = uniqueSorted(taskFilePaths && taskFilePaths.length > 0
+        ? taskFilePaths
+        : params.result.file_coverage.map((coverage) => coverage.path));
+    return {
+        task_id: taskIdFor("clean", [params.result.task_id, params.result.lens]),
+        unit_id: params.result.unit_id,
+        pass_id: `deepening:${params.result.pass_id}`,
+        lens: params.result.lens,
+        file_paths: paths,
+        file_line_counts: Object.fromEntries(paths.map((path) => [
+            path,
+            lineCountForPath(path, params.task, params.result, params.lineIndex),
+        ])),
+        rationale: `Sample high-risk no-finding result from ${params.result.task_id}. ` +
+            "Re-review the assigned files for missed edge cases, hidden runtime failures, and whether the clean conclusion should stand.",
+        priority: params.task?.priority === "high" ? "high" : "medium",
+        tags: [
+            DEEPENING_TAG,
+            "trigger:high_risk_no_finding",
+            `source_task:${sanitizeSegment(params.result.task_id)}`,
+        ],
+        status: "pending",
+    };
+}
+//# sourceMappingURL=highRiskClean.js.map

package/dist/audit/orchestrator/selectiveDeepening/highRiskClean.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"highRiskClean.js","sourceRoot":"","sources":["../../../../src/audit/orchestrator/selectiveDeepening/highRiskClean.ts"],"names":[],"mappings":"AACA,OAAO,EACL,aAAa,EACb,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,SAAS,EACT,YAAY,GACb,MAAM,aAAa,CAAC;AAErB,MAAM,UAAU,qBAAqB,CACnC,MAAmB,EACnB,IAA2B;IAE3B,IACE,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC1B,MAAM,CAAC,iBAAiB,KAAK,KAAK;QAClC,eAAe,CAAC,IAAI,CAAC,EACrB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,CACL,MAAM,CAAC,iBAAiB,KAAK,IAAI;YACjC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI,MAAM,CAAC,IAAI,KAAK,gBAAgB,CAAC,CACjE,CAAC;IACJ,CAAC;IAED,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IACE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CACtB,CAAC,eAAe,EAAE,0BAA0B,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAC5D,EACD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,MAAM,CAAC,iBAAiB,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC;AACzE,CAAC;AAED,MAAM,UAAU,8BAA8B,CAAC,MAI9C;IACC,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC;IAC9C,MAAM,KAAK,GAAG,YAAY,CACxB,aAAa,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;QACvC,CAAC,CAAC,aAAa;QACf,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CACjE,CAAC;IAEF,OAAO;QACL,OAAO,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxE,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO;QAC9B,OAAO,EAAE,aAAa,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE;QAC7C,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;QACxB,UAAU,EAAE,KAAK;QACjB,gBAAgB,EAAE,MAAM,CAAC,WAAW,CAClC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAClB,IAAI;YACJ,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC;SACrE,CAAC,CACH;QACD,SAAS,EACP,2CAA2C,MAAM,CAAC,MAAM,CAAC,OAAO,IAAI;YACpE,6HAA6H;QAC/H,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;QAC9D,IAAI,EAAE;YACJ,aAAa;YACb,8BAA8B;YAC9B,eAAe,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;SACxD;QACD,MAAM,EAAE,SAAS;KAClB,CAAC;AACJ,CAAC"}

package/dist/audit/orchestrator/selectiveDeepening/index.d.ts

@@ -0,0 +1,25 @@
+import type { AuditTask } from "../../types.js";
+import { type BuildSelectiveDeepeningTaskOptions } from "./shared.js";
+export type { BuildSelectiveDeepeningTaskOptions } from "./shared.js";
+/**
+ * Build the self-bounding set of selective-deepening follow-up tasks. Each
+ * strategy (finding-followup, conflict, steward-followup, runtime-validation,
+ * lens-verification, high-risk-clean) lives in its own module under this
+ * directory; this entry sequences them and dedupes (via `pushIfNew`).
+ *
+ * There is no per-batch or total-count limit. Each strategy keys its task id off
+ * the finding/unit/lens it verifies, `pushIfNew` dedupes against tasks created in
+ * prior rounds, and no strategy deepens a deepening-sourced result (finding /
+ * conflict / lens-verification / high-risk-clean all filter `isDeepeningTask`;
+ * steward only fires on lens-verification results and its output is not itself a
+ * lens-verification task). The strategy chain is therefore a finite DAG that
+ * converges on its own — each qualifying item is deepened at most once — so the
+ * bound is the size of the qualifying set, never an arbitrary number.
+ */
+export declare function buildSelectiveDeepeningTasks(options: BuildSelectiveDeepeningTaskOptions): AuditTask[];
+export declare const selectiveDeepeningTestUtils: {
+    DEEPENING_TAG: string;
+    LENS_VERIFICATION_TAG: string;
+    LENS_VERIFICATION_FOLLOWUP_TAG: string;
+};
+//# sourceMappingURL=index.d.ts.map

package/dist/audit/orchestrator/selectiveDeepening/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/audit/orchestrator/selectiveDeepening/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EACL,KAAK,kCAAkC,EAQxC,MAAM,aAAa,CAAC;AAerB,YAAY,EAAE,kCAAkC,EAAE,MAAM,aAAa,CAAC;AAEtE;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,4BAA4B,CAC1C,OAAO,EAAE,kCAAkC,GAC1C,SAAS,EAAE,CAgKb;AAED,eAAO,MAAM,2BAA2B;;;;CAIvC,CAAC"}