audit-tools 0.52.5 → 0.54.0

package/dist/remediate/contractPipeline/phaseCut.d.ts

@@ -1,125 +0,0 @@
-/**
- * Deterministic phase-cut derivation (remediator auto-phasing, T3).
- *
- * When `/remediate-code` is pointed at an arbitrary N-goal input (e.g. the whole
- * backlog), the independent conceptual-design critique used to reject the run as
- * "over-scoped" and the HOST had to manually re-scope to a phase at intake. That
- * is the tool's job, not the host's: given the module-dependency DAG (the
- * producer/consumer `artifact:<name>` token edges declared in the contracts'
- * inputs/outputs), the tool derives a foundations→consumers
- * phase cut MECHANICALLY — ordered tiers where every module sits one tier below
- * the modules that depend on it. The critique is then handed the derived cut, so
- * it assesses design quality WITHIN a mechanically dependency-ordered phasing
- * rather than rejecting breadth (over-scoping is already handled by construction).
- *
- * Pure + deterministic (no I/O, no Date/Math.random, stable ordering): the same
- * modules always yield the same cut. Cycle-safe — a dependency cycle cannot be
- * topologically tiered, so its members are placed together at the tier just past
- * their highest acyclic dependency (named-sorted, fail toward a LATER tier so a
- * cyclic module never front-runs a real foundation it transitively needs).
- */
-import { moduleSlugForObligationId } from "./idRegistry.js";
-/** One module + the names of the other modules it depends on (its foundations). */
-export interface PhaseCutModule {
-    name: string;
-    /** Names of modules this module needs in place first (directional: this → dep). */
-    depends_on: string[];
-}
-/** One derived phase: an ordered tier of modules that may be authored together. */
-export interface PhaseCutPhase {
-    /** 0-based tier ordinal; 0 = foundations. */
-    ordinal: number;
-    /** Stable human label for the tier. */
-    name: string;
-    /** Module names in this tier, sorted for determinism. */
-    modules: string[];
-}
-/** The derived phase cut: ordered tiers covering every module exactly once. */
-export interface PhaseCut {
-    phases: PhaseCutPhase[];
-    /** True when a dependency cycle was detected (its members were tiered together). */
-    has_cycle: boolean;
-    /** Module name → 0-based phase ordinal (foundations = 0). The downstream key. */
-    module_phase: Record<string, number>;
-}
-/**
- * Derive the ordered phase cut from a module-dependency DAG. Each module's tier is
- * the length of its longest dependency chain (foundations = 0). Edges to unknown
- * module names are ignored (a `needs` on a module not in scope is not a phase
- * constraint here). Returns one phase per occupied tier, covering every module.
- */
-export declare function derivePhaseCut(modules: PhaseCutModule[]): PhaseCut;
-/**
- * The id fragment obligation ids encode — re-exported from the id registry,
- * which owns both this and the mint that produces `OBL-<slug>-…`, so encoder and
- * decoder cannot drift. Kept exported here because this module is where the
- * node→phase decoders live and import it from.
- */
-export { moduleSlug } from "./idRegistry.js";
-/**
- * Resolve the phase ordinal for an implementation-DAG node from the obligation
- * ids it discharges. Every derived obligation id is `OBL-<moduleSlug>-<suffix>`,
- * so the owning module (hence phase) is recoverable by the EXACT join in
- * `idRegistry.moduleSlugForObligationId` — no lossy slug reversal, and no
- * longest-prefix guess (that rule resolved `OBL-auth-service-…` to `auth`
- * whenever `auth-service` was not in the slug set, silently handing the node
- * another module's phase and file scope). A node spanning modules in several
- * phases takes the MAX ordinal (fail-toward-later: it cannot land before the
- * latest module it touches is reachable). A node whose obligations match no
- * in-scope module slug — a counterexample-only node, or an obligation from a
- * module dropped from the cut — defaults to the LAST phase (integration), never
- * front-running a foundation.
- *
- * `slugToOrdinal` is the module-phase map re-keyed by `moduleSlug(name)`.
- */
-export declare function phaseOrdinalForObligations(obligationIds: readonly string[], slugToOrdinal: Map<string, number>, lastOrdinal: number): number;
-export { moduleSlugForObligationId };
-/** One producer→consumer pairing and the artifact token that links it. */
-interface ArtifactTokenEdge {
-    /** The depending module — it consumes the artifact. */
-    consumer: string;
-    /** The module it depends on — it produces the artifact. */
-    producer: string;
-    /** The normalized artifact name from the `artifact:<name>` token. */
-    artifact: string;
-}
-/**
- * Build {@link PhaseCutModule}s from finalized module contracts. A module's
- * `depends_on` derives from producer/consumer artifact-token matching over
- * `inputs`/`outputs` ALONE. Drafted `neighbor_needs` never enter this graph
- * (open-bugs.md:106): they are symmetric coordination prose whose directions
- * per-module drafting agents routinely invert, and unioning them in let prose
- * override every declared token edge — finalization drops the field instead.
- * A module that consumes from another is one tier ABOVE it. Tolerant of
- * malformed payloads: anything unparseable contributes no module/edge.
- */
-export declare function phaseCutModulesFromContracts(contractsPayload: unknown): PhaseCutModule[];
-/** One declared-graph cycle: its member modules and the token edges among them. */
-export interface ContractTokenCycle {
-    /** Cycle members, in stable input order. */
-    members: string[];
-    /** The consumer→producer token edges between cycle members. */
-    edges: ArtifactTokenEdge[];
-}
-/**
- * Detect cycles in the DECLARED module-dependency graph — the producer/consumer
- * `artifact:` token edges of a module-contracts payload (drafted or finalized;
- * finalization copies `inputs`/`outputs` verbatim, so the two graphs are equal).
- * A cycle here is a VALIDATION error at the contract boundary (open-bugs.md:106):
- * the phase cut must never be derived over a cyclic declared graph, because the
- * fail-toward-later tiering silently drops a back-edge and places token
- * consumers ahead of their producers. Members and their linking edges are
- * reported so the repair prompt can name exactly which tokens form each cycle.
- */
-export declare function detectContractTokenCycles(contractsPayload: unknown): ContractTokenCycle[];
-/**
- * Add Path-A seam-preparation edges to the contract-derived module DAG. The
- * decomposition gate has already guaranteed one preparer per required seam;
- * this projection makes every implementation module for either participating
- * work block depend on that preparer, yielding a seam-first phase followed by
- * parallel refactor modules.
- */
-export declare function applyWorkBlockSeamDependencies(modules: PhaseCutModule[], moduleDecompositionPayload: unknown, pathASeedPayload: unknown): PhaseCutModule[];
-/** Render the derived phase cut as a markdown section for the critique prompt. */
-export declare function renderPhaseCutSection(cut: PhaseCut): string;
-//# sourceMappingURL=phaseCut.d.ts.map

package/dist/remediate/contractPipeline/phaseCut.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"phaseCut.d.ts","sourceRoot":"","sources":["../../../src/remediate/contractPipeline/phaseCut.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,yBAAyB,EAAE,MAAM,iBAAiB,CAAC;AAI5D,mFAAmF;AACnF,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,mFAAmF;IACnF,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,mFAAmF;AACnF,MAAM,WAAW,aAAa;IAC5B,6CAA6C;IAC7C,OAAO,EAAE,MAAM,CAAC;IAChB,uCAAuC;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,yDAAyD;IACzD,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,+EAA+E;AAC/E,MAAM,WAAW,QAAQ;IACvB,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,oFAAoF;IACpF,SAAS,EAAE,OAAO,CAAC;IACnB,iFAAiF;IACjF,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACtC;AASD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,cAAc,EAAE,GAAG,QAAQ,CAiElE;AAED;;;;;GAKG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,0BAA0B,CACxC,aAAa,EAAE,SAAS,MAAM,EAAE,EAChC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAClC,WAAW,EAAE,MAAM,GAClB,MAAM,CAWR;AAED,OAAO,EAAE,yBAAyB,EAAE,CAAC;AA+BrC,0EAA0E;AAC1E,UAAU,iBAAiB;IACzB,uDAAuD;IACvD,QAAQ,EAAE,MAAM,CAAC;IACjB,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,CAAC;IACjB,qEAAqE;IACrE,QAAQ,EAAE,MAAM,CAAC;CAClB;AAiDD;;;;;;;;;GASG;AACH,wBAAgB,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,GAAG,cAAc,EAAE,CAYxF;AAED,mFAAmF;AACnF,MAAM,WAAW,kBAAkB;IACjC,4CAA4C;IAC5C,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,+DAA+D;IAC/D,KAAK,EAAE,iBAAiB,EAAE,CAAC;CAC5B;AAED;;;;;;;;;GASG;AACH,wBAAgB,yBAAyB,CAAC,gBAAgB,EAAE,OAAO,GAAG,kBAAkB,EAAE,CAYzF;AAED;;;;;;GAMG;AACH,wBAAgB,8BAA8B,CAC5C,OAAO,EAAE,cAAc,EAAE,EACzB,0BAA0B,EAAE,OAAO,EACnC,gBAAgB,EAAE,OAAO,GACxB,cAAc,EAAE,CAiElB;AAED,kFAAkF;AAClF,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,QAAQ,GAAG,MAAM,CAmB3D"}

package/dist/remediate/contractPipeline/phaseCut.js

@@ -1,339 +0,0 @@
-/**
- * Deterministic phase-cut derivation (remediator auto-phasing, T3).
- *
- * When `/remediate-code` is pointed at an arbitrary N-goal input (e.g. the whole
- * backlog), the independent conceptual-design critique used to reject the run as
- * "over-scoped" and the HOST had to manually re-scope to a phase at intake. That
- * is the tool's job, not the host's: given the module-dependency DAG (the
- * producer/consumer `artifact:<name>` token edges declared in the contracts'
- * inputs/outputs), the tool derives a foundations→consumers
- * phase cut MECHANICALLY — ordered tiers where every module sits one tier below
- * the modules that depend on it. The critique is then handed the derived cut, so
- * it assesses design quality WITHIN a mechanically dependency-ordered phasing
- * rather than rejecting breadth (over-scoping is already handled by construction).
- *
- * Pure + deterministic (no I/O, no Date/Math.random, stable ordering): the same
- * modules always yield the same cut. Cycle-safe — a dependency cycle cannot be
- * topologically tiered, so its members are placed together at the tier just past
- * their highest acyclic dependency (named-sorted, fail toward a LATER tier so a
- * cyclic module never front-runs a real foundation it transitively needs).
- */
-import { moduleSlugForObligationId } from "./idRegistry.js";
-import { compareCodeUnits } from "../../shared/compareCodeUnits.js";
-import { findCyclicComponents } from "../../shared/graph/directedCycles.js";
-/** Stable label for a tier ordinal. */
-function phaseName(ordinal, lastOrdinal) {
-    if (ordinal === 0)
-        return "foundations";
-    if (ordinal === lastOrdinal)
-        return "integration";
-    return `consumers-${ordinal}`;
-}
-/**
- * Derive the ordered phase cut from a module-dependency DAG. Each module's tier is
- * the length of its longest dependency chain (foundations = 0). Edges to unknown
- * module names are ignored (a `needs` on a module not in scope is not a phase
- * constraint here). Returns one phase per occupied tier, covering every module.
- */
-export function derivePhaseCut(modules) {
-    const names = modules.map((m) => m.name);
-    const known = new Set(names);
-    // Normalize edges: keep only deps that name a real in-scope module, drop self-edges.
-    const deps = new Map();
-    for (const m of modules) {
-        deps.set(m.name, [...new Set(m.depends_on)].filter((d) => d !== m.name && known.has(d)));
-    }
-    // Longest-dependency-chain tier via memoized DFS with cycle detection. A node on
-    // an active path (cycle) resolves to the max tier of its already-settled deps + 1
-    // (fail toward a later tier), and the cycle flag is raised.
-    const tier = new Map();
-    const visiting = new Set();
-    let hasCycle = false;
-    const computeTier = (name) => {
-        const cached = tier.get(name);
-        if (cached !== undefined)
-            return cached;
-        if (visiting.has(name)) {
-            // Back-edge: a cycle. Don't recurse through it; treat as no added depth here.
-            hasCycle = true;
-            return 0;
-        }
-        visiting.add(name);
-        let maxDep = -1;
-        // Sort deps for deterministic traversal (tier values are order-independent, but
-        // keep traversal stable for predictability under future changes).
-        for (const d of [...(deps.get(name) ?? [])].sort()) {
-            maxDep = Math.max(maxDep, computeTier(d));
-        }
-        visiting.delete(name);
-        const t = maxDep + 1;
-        tier.set(name, t);
-        return t;
-    };
-    for (const name of [...names].sort())
-        computeTier(name);
-    const lastOrdinal = Math.max(0, ...[...tier.values()]);
-    const byTier = new Map();
-    for (const [name, t] of tier) {
-        const bucket = byTier.get(t) ?? [];
-        bucket.push(name);
-        byTier.set(t, bucket);
-    }
-    const phases = [];
-    for (let ordinal = 0; ordinal <= lastOrdinal; ordinal++) {
-        const members = byTier.get(ordinal);
-        if (!members || members.length === 0)
-            continue;
-        phases.push({
-            ordinal,
-            name: phaseName(ordinal, lastOrdinal),
-            modules: [...members].sort(),
-        });
-    }
-    const module_phase = {};
-    for (const [name, t] of tier)
-        module_phase[name] = t;
-    return { phases, has_cycle: hasCycle, module_phase };
-}
-/**
- * The id fragment obligation ids encode — re-exported from the id registry,
- * which owns both this and the mint that produces `OBL-<slug>-…`, so encoder and
- * decoder cannot drift. Kept exported here because this module is where the
- * node→phase decoders live and import it from.
- */
-export { moduleSlug } from "./idRegistry.js";
-/**
- * Resolve the phase ordinal for an implementation-DAG node from the obligation
- * ids it discharges. Every derived obligation id is `OBL-<moduleSlug>-<suffix>`,
- * so the owning module (hence phase) is recoverable by the EXACT join in
- * `idRegistry.moduleSlugForObligationId` — no lossy slug reversal, and no
- * longest-prefix guess (that rule resolved `OBL-auth-service-…` to `auth`
- * whenever `auth-service` was not in the slug set, silently handing the node
- * another module's phase and file scope). A node spanning modules in several
- * phases takes the MAX ordinal (fail-toward-later: it cannot land before the
- * latest module it touches is reachable). A node whose obligations match no
- * in-scope module slug — a counterexample-only node, or an obligation from a
- * module dropped from the cut — defaults to the LAST phase (integration), never
- * front-running a foundation.
- *
- * `slugToOrdinal` is the module-phase map re-keyed by `moduleSlug(name)`.
- */
-export function phaseOrdinalForObligations(obligationIds, slugToOrdinal, lastOrdinal) {
-    const knownSlugs = new Set(slugToOrdinal.keys());
-    let max = -1;
-    let matchedAny = false;
-    for (const id of obligationIds) {
-        const slug = moduleSlugForObligationId(id, knownSlugs);
-        if (slug === null)
-            continue;
-        max = Math.max(max, slugToOrdinal.get(slug) ?? 0);
-        matchedAny = true;
-    }
-    return matchedAny ? max : lastOrdinal;
-}
-export { moduleSlugForObligationId };
-/**
- * A structured artifact reference embedded anywhere inside a module's free-prose
- * `inputs`/`outputs` string: the token `artifact:<name>`, where `<name>` is a
- * stable identifier (letters, digits, `_`, `-`, `.`, `/`). The rest of the string
- * stays human prose. A module PRODUCES every artifact token in its `outputs` and
- * CONSUMES every token in its `inputs`; the tool matches producer→consumer to
- * derive data-flow ordering, so the ordering is tool-enforced from the finalized
- * contracts rather than relying on the host to hand-add `depends_on` edges.
- * Matching is case-insensitive so `artifact:Roster` (produced) and `artifact:roster`
- * (consumed) still pair.
- */
-const ARTIFACT_TOKEN_PATTERN = /\bartifact:([A-Za-z0-9_./-]+)/gi;
-/** The normalized artifact names referenced by a module's inputs/outputs list. */
-function extractArtifactNames(entries) {
-    const names = new Set();
-    if (!Array.isArray(entries))
-        return names;
-    for (const entry of entries) {
-        if (typeof entry !== "string")
-            continue;
-        for (const match of entry.matchAll(ARTIFACT_TOKEN_PATTERN)) {
-            // Trim trailing separator/punctuation the greedy class may have swallowed
-            // (e.g. a token ending a sentence: "artifact:roster.").
-            const name = match[1].replace(/[._/-]+$/, "").toLowerCase();
-            if (name.length > 0)
-                names.add(name);
-        }
-    }
-    return names;
-}
-/**
- * Derive the DECLARED module-dependency graph from producer/consumer artifact
- * tokens in the contracts' `inputs`/`outputs`. For each module M and each
- * artifact M consumes (an `artifact:<name>` token in M's `inputs`), M depends
- * on every OTHER module that produces that artifact (the token in its
- * `outputs`). Returns both the dependency map (module name → set of module
- * names that must run first) and the per-edge artifact attribution, so a cycle
- * can be reported with the exact tokens that form it. Tolerant of malformed
- * payloads: anything unparseable contributes no edge.
- */
-function deriveModuleArtifactGraph(contractsPayload) {
-    const root = contractsPayload;
-    const list = Array.isArray(root?.module_contracts) ? root.module_contracts : [];
-    const producers = new Map(); // artifact name → producing modules
-    const consumes = new Map(); // module name → consumed artifact names
-    const moduleNames = [];
-    for (const mod of list) {
-        if (typeof mod !== "object" || mod === null)
-            continue;
-        const m = mod;
-        if (typeof m.name !== "string" || m.name.length === 0)
-            continue;
-        moduleNames.push(m.name);
-        for (const artifact of extractArtifactNames(m.outputs)) {
-            const set = producers.get(artifact) ?? new Set();
-            set.add(m.name);
-            producers.set(artifact, set);
-        }
-        consumes.set(m.name, extractArtifactNames(m.inputs));
-    }
-    const deps = new Map();
-    const edges = [];
-    for (const name of moduleNames) {
-        const set = new Set();
-        for (const artifact of consumes.get(name) ?? []) {
-            for (const producer of producers.get(artifact) ?? []) {
-                if (producer === name)
-                    continue;
-                set.add(producer);
-                edges.push({ consumer: name, producer, artifact });
-            }
-        }
-        deps.set(name, set);
-    }
-    return { deps, edges };
-}
-/**
- * Build {@link PhaseCutModule}s from finalized module contracts. A module's
- * `depends_on` derives from producer/consumer artifact-token matching over
- * `inputs`/`outputs` ALONE. Drafted `neighbor_needs` never enter this graph
- * (open-bugs.md:106): they are symmetric coordination prose whose directions
- * per-module drafting agents routinely invert, and unioning them in let prose
- * override every declared token edge — finalization drops the field instead.
- * A module that consumes from another is one tier ABOVE it. Tolerant of
- * malformed payloads: anything unparseable contributes no module/edge.
- */
-export function phaseCutModulesFromContracts(contractsPayload) {
-    const root = contractsPayload;
-    const list = Array.isArray(root?.module_contracts) ? root.module_contracts : [];
-    const { deps } = deriveModuleArtifactGraph(contractsPayload);
-    const out = [];
-    for (const mod of list) {
-        if (typeof mod !== "object" || mod === null)
-            continue;
-        const m = mod;
-        if (typeof m.name !== "string" || m.name.length === 0)
-            continue;
-        out.push({ name: m.name, depends_on: [...(deps.get(m.name) ?? [])] });
-    }
-    return out;
-}
-/**
- * Detect cycles in the DECLARED module-dependency graph — the producer/consumer
- * `artifact:` token edges of a module-contracts payload (drafted or finalized;
- * finalization copies `inputs`/`outputs` verbatim, so the two graphs are equal).
- * A cycle here is a VALIDATION error at the contract boundary (open-bugs.md:106):
- * the phase cut must never be derived over a cyclic declared graph, because the
- * fail-toward-later tiering silently drops a back-edge and places token
- * consumers ahead of their producers. Members and their linking edges are
- * reported so the repair prompt can name exactly which tokens form each cycle.
- */
-export function detectContractTokenCycles(contractsPayload) {
-    const { deps, edges } = deriveModuleArtifactGraph(contractsPayload);
-    const components = findCyclicComponents([...deps.entries()].map(([id, dependsOn]) => ({ id, depends_on: [...dependsOn] })));
-    return components.map((members) => {
-        const memberSet = new Set(members);
-        return {
-            members,
-            edges: edges.filter((e) => memberSet.has(e.consumer) && memberSet.has(e.producer)),
-        };
-    });
-}
-/**
- * Add Path-A seam-preparation edges to the contract-derived module DAG. The
- * decomposition gate has already guaranteed one preparer per required seam;
- * this projection makes every implementation module for either participating
- * work block depend on that preparer, yielding a seam-first phase followed by
- * parallel refactor modules.
- */
-export function applyWorkBlockSeamDependencies(modules, moduleDecompositionPayload, pathASeedPayload) {
-    const decomposition = moduleDecompositionPayload;
-    const decomposed = Array.isArray(decomposition?.modules) ? decomposition.modules : [];
-    const seed = pathASeedPayload;
-    const seams = Array.isArray(seed?.work_block_seams) ? seed.work_block_seams : [];
-    if (decomposed.length === 0 || seams.length === 0)
-        return modules;
-    const sourceBlocksByModule = new Map();
-    const preparerBySeam = new Map();
-    for (const value of decomposed) {
-        if (typeof value !== "object" || value === null)
-            continue;
-        const mod = value;
-        if (typeof mod.name !== "string")
-            continue;
-        sourceBlocksByModule.set(mod.name, new Set(Array.isArray(mod.source_work_block_ids)
-            ? mod.source_work_block_ids.filter((id) => typeof id === "string")
-            : []));
-        for (const seamId of Array.isArray(mod.prepares_seam_ids)
-            ? mod.prepares_seam_ids
-            : []) {
-            if (typeof seamId === "string" && !preparerBySeam.has(seamId)) {
-                preparerBySeam.set(seamId, mod.name);
-            }
-        }
-    }
-    const extraDeps = new Map();
-    for (const value of seams) {
-        if (typeof value !== "object" || value === null)
-            continue;
-        const seam = value;
-        if (seam.requires_preparation !== true || typeof seam.id !== "string")
-            continue;
-        const preparer = preparerBySeam.get(seam.id);
-        if (!preparer)
-            continue;
-        const blockIds = new Set(Array.isArray(seam.block_ids)
-            ? seam.block_ids.filter((id) => typeof id === "string")
-            : []);
-        for (const [moduleName, sourceBlocks] of sourceBlocksByModule) {
-            if (moduleName === preparer)
-                continue;
-            if (![...sourceBlocks].some((id) => blockIds.has(id)))
-                continue;
-            const deps = extraDeps.get(moduleName) ?? new Set();
-            deps.add(preparer);
-            extraDeps.set(moduleName, deps);
-        }
-    }
-    return modules.map((module) => ({
-        ...module,
-        depends_on: [
-            ...new Set([...module.depends_on, ...(extraDeps.get(module.name) ?? [])]),
-        ].sort((a, b) => compareCodeUnits(a, b)),
-    }));
-}
-/** Render the derived phase cut as a markdown section for the critique prompt. */
-export function renderPhaseCutSection(cut) {
-    const lines = cut.phases.map((p) => `- **Phase ${p.ordinal} — ${p.name}** (${p.modules.length} module(s)): ${p.modules.join(", ")}`);
-    return `## Mechanically-Derived Phase Cut
-
-This change is **not** executed as one monolithic landing. The tool derived the
-following ordered, dependency-gated phase cut from the module-dependency DAG —
-each phase's modules depend only on earlier phases, and the scheduler enforces the
-ordering with mechanical dependencies (a later-phase module cannot dispatch until
-its foundations are verified-complete, with a whole-repo green gate between phases):
-
-${lines.join("\n")}
-
-Assess the **design quality** within this phasing. Do NOT reject the work as
-"over-scoped" or "too large for one change" — breadth is already handled by
-construction: the phases land incrementally, green at every commit. Flag a real
-design problem (a wrong boundary, a missing invariant, an unsound seam), not the
-number of modules.${cut.has_cycle ? "\n\n> NOTE: a dependency cycle was detected among the modules; its members were tiered together. A genuine circular dependency between modules is a design smell worth your scrutiny." : ""}`;
-}
-//# sourceMappingURL=phaseCut.js.map

package/dist/remediate/contractPipeline/phaseCut.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"phaseCut.js","sourceRoot":"","sources":["../../../src/remediate/contractPipeline/phaseCut.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,yBAAyB,EAAE,MAAM,iBAAiB,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AA4B5E,uCAAuC;AACvC,SAAS,SAAS,CAAC,OAAe,EAAE,WAAmB;IACrD,IAAI,OAAO,KAAK,CAAC;QAAE,OAAO,aAAa,CAAC;IACxC,IAAI,OAAO,KAAK,WAAW;QAAE,OAAO,aAAa,CAAC;IAClD,OAAO,aAAa,OAAO,EAAE,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,OAAyB;IACtD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC7B,qFAAqF;IACrF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CACN,CAAC,CAAC,IAAI,EACN,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACvE,CAAC;IACJ,CAAC;IAED,iFAAiF;IACjF,kFAAkF;IAClF,4DAA4D;IAC5D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,IAAI,QAAQ,GAAG,KAAK,CAAC;IAErB,MAAM,WAAW,GAAG,CAAC,IAAY,EAAU,EAAE;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACxC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,8EAA8E;YAC9E,QAAQ,GAAG,IAAI,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,gFAAgF;QAChF,kEAAkE;QAClE,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACnD,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE;QAAE,WAAW,CAAC,IAAI,CAAC,CAAC;IAExD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,WAAW,EAAE,OAAO,EAAE,EAAE,CAAC;QACxD,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC/C,MAAM,CAAC,IAAI,CAAC;YACV,OAAO;YACP,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,WAAW,CAAC;YACrC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE;SAC7B,CAAC,CAAC;IACL,CAAC;IAED,MAAM,YAAY,GAA2B,EAAE,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI;QAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAErD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;AACvD,CAAC;AAED;;;;;GAKG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,0BAA0B,CACxC,aAAgC,EAChC,aAAkC,EAClC,WAAmB;IAEnB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;IACjD,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,yBAAyB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QACvD,IAAI,IAAI,KAAK,IAAI;YAAE,SAAS;QAC5B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAClD,UAAU,GAAG,IAAI,CAAC;IACpB,CAAC;IACD,OAAO,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;AACxC,CAAC;AAED,OAAO,EAAE,yBAAyB,EAAE,CAAC;AAErC;;;;;;;;;;GAUG;AACH,MAAM,sBAAsB,GAAG,iCAAiC,CAAC;AAEjE,kFAAkF;AAClF,SAAS,oBAAoB,CAAC,OAAgB;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,SAAS;QACxC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,EAAE,CAAC;YAC3D,0EAA0E;YAC1E,wDAAwD;YACxD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;YAC5D,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAYD;;;;;;;;;GASG;AACH,SAAS,yBAAyB,CAAC,gBAAyB;IAI1D,MAAM,IAAI,GAAG,gBAA8D,CAAC;IAC5E,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;IACjF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC,CAAC,oCAAoC;IACtF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC,CAAC,wCAAwC;IACzF,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;YAAE,SAAS;QACtD,MAAM,CAAC,GAAG,GAA8D,CAAC;QACzE,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAChE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,KAAK,MAAM,QAAQ,IAAI,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YACvD,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YACzD,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChB,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,MAAM,KAAK,GAAwB,EAAE,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAChD,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;gBACrD,IAAI,QAAQ,KAAK,IAAI;oBAAE,SAAS;gBAChC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,4BAA4B,CAAC,gBAAyB;IACpE,MAAM,IAAI,GAAG,gBAA8D,CAAC;IAC5E,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;IACjF,MAAM,EAAE,IAAI,EAAE,GAAG,yBAAyB,CAAC,gBAAgB,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;YAAE,SAAS;QACtD,MAAM,CAAC,GAAG,GAAyB,CAAC;QACpC,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAChE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAUD;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CAAC,gBAAyB;IACjE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,yBAAyB,CAAC,gBAAgB,CAAC,CAAC;IACpE,MAAM,UAAU,GAAG,oBAAoB,CACrC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,CACnF,CAAC;IACF,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QAChC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACnC,OAAO;YACL,OAAO;YACP,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;SACnF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,8BAA8B,CAC5C,OAAyB,EACzB,0BAAmC,EACnC,gBAAyB;IAEzB,MAAM,aAAa,GAAG,0BAA+D,CAAC;IACtF,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,aAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACvF,MAAM,IAAI,GAAG,gBAA8D,CAAC;IAC5E,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;IAClF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAElE,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;YAAE,SAAS;QAC1D,MAAM,GAAG,GAAG,KAIX,CAAC;QACF,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QAC3C,oBAAoB,CAAC,GAAG,CACtB,GAAG,CAAC,IAAI,EACR,IAAI,GAAG,CACL,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;YACtC,CAAC,CAAC,GAAG,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC;YAChF,CAAC,CAAC,EAAE,CACP,CACF,CAAC;QACF,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC;YACvD,CAAC,CAAC,GAAG,CAAC,iBAAiB;YACvB,CAAC,CAAC,EAAE,EAAE,CAAC;YACP,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9D,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;YAAE,SAAS;QAC1D,MAAM,IAAI,GAAG,KAIZ,CAAC;QACF,IAAI,IAAI,CAAC,oBAAoB,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ;YAAE,SAAS;QAChF,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ;YAAE,SAAS;QACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC;YAC3B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC;YACrE,CAAC,CAAC,EAAE,CACP,CAAC;QACF,KAAK,MAAM,CAAC,UAAU,EAAE,YAAY,CAAC,IAAI,oBAAoB,EAAE,CAAC;YAC9D,IAAI,UAAU,KAAK,QAAQ;gBAAE,SAAS;YACtC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAAE,SAAS;YAChE,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAC5D,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACnB,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC9B,GAAG,MAAM;QACT,UAAU,EAAE;YACV,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,EAAE,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;SAC1E,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KACzC,CAAC,CAAC,CAAC;AACN,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,qBAAqB,CAAC,GAAa;IACjD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,gBAAgB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACvG,CAAC;IACF,OAAO;;;;;;;;EAQP,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;;;;;;oBAME,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,uLAAuL,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;AACnO,CAAC"}

package/dist/remediate/contractPipeline/phaseCutArtifact.d.ts

@@ -1,31 +0,0 @@
-/**
- * Phase-cut sidecar artifact (remediator auto-phasing, T3).
- *
- * The foundations→consumers phase cut derived by {@link derivePhaseCut} is a
- * DERIVED, deterministic artifact (a pure function of the finalized module
- * contracts' module-dependency DAG — producer/consumer `artifact:<name>` tokens
- * in `inputs`/`outputs` alone). It is persisted as a
- * first-class sidecar —
- * `intake/contract/phase_cut.json` — so the cut the conceptual critique sees and
- * the cut the implementation-DAG promotion enforces are ONE source, inspectable
- * on disk, not two inline recomputations that could drift.
- *
- * It is deliberately NOT a member of `CP_ARTIFACT_NAMES`: that enum drives the
- * LLM-phase staleness DAG and the phase-progression completeness checks, where an
- * "absent" entry perturbs sequencing. The cut is re-derivable on demand from
- * `finalized_module_contracts`, so it carries no staleness envelope — it is simply
- * (re)written whenever its single upstream is available, and read by consumers.
- */
-import { type PhaseCut } from "./phaseCut.js";
-export declare const PHASE_CUT_FILE = "phase_cut.json";
-export declare function phaseCutFilePath(artifactsDir: string): string;
-/** Read the persisted cut, or null if it has not been written yet. */
-export declare function readPhaseCutArtifact(artifactsDir: string): Promise<PhaseCut | null>;
-/**
- * Derive the cut from the on-disk `finalized_module_contracts` and (re)write the
- * sidecar. Idempotent: a finalized-contracts payload that yields the same DAG
- * yields byte-identical JSON. Returns the derived cut, or null when there are no
- * in-scope modules to phase (no finalized contracts on disk yet).
- */
-export declare function ensurePhaseCutArtifact(artifactsDir: string): Promise<PhaseCut | null>;
-//# sourceMappingURL=phaseCutArtifact.d.ts.map

package/dist/remediate/contractPipeline/phaseCutArtifact.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"phaseCutArtifact.d.ts","sourceRoot":"","sources":["../../../src/remediate/contractPipeline/phaseCutArtifact.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAUH,OAAO,EAIL,KAAK,QAAQ,EACd,MAAM,eAAe,CAAC;AAEvB,eAAO,MAAM,cAAc,mBAAmB,CAAC;AAE/C,wBAAgB,gBAAgB,CAAC,YAAY,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED,sEAAsE;AACtE,wBAAsB,oBAAoB,CACxC,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,CAE1B;AAED;;;;;GAKG;AACH,wBAAsB,sBAAsB,CAC1C,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,CAiB1B"}

package/dist/remediate/contractPipeline/phaseCutArtifact.js

@@ -1,48 +0,0 @@
-/**
- * Phase-cut sidecar artifact (remediator auto-phasing, T3).
- *
- * The foundations→consumers phase cut derived by {@link derivePhaseCut} is a
- * DERIVED, deterministic artifact (a pure function of the finalized module
- * contracts' module-dependency DAG — producer/consumer `artifact:<name>` tokens
- * in `inputs`/`outputs` alone). It is persisted as a
- * first-class sidecar —
- * `intake/contract/phase_cut.json` — so the cut the conceptual critique sees and
- * the cut the implementation-DAG promotion enforces are ONE source, inspectable
- * on disk, not two inline recomputations that could drift.
- *
- * It is deliberately NOT a member of `CP_ARTIFACT_NAMES`: that enum drives the
- * LLM-phase staleness DAG and the phase-progression completeness checks, where an
- * "absent" entry perturbs sequencing. The cut is re-derivable on demand from
- * `finalized_module_contracts`, so it carries no staleness envelope — it is simply
- * (re)written whenever its single upstream is available, and read by consumers.
- */
-import { join } from "node:path";
-import { readOptionalJsonFile, writeJsonFile } from "audit-tools/shared";
-import { contractPipelineDir, pathASeedFilePath, readContractArtifact, envelopePayload, } from "./artifactStore.js";
-import { derivePhaseCut, applyWorkBlockSeamDependencies, phaseCutModulesFromContracts, } from "./phaseCut.js";
-export const PHASE_CUT_FILE = "phase_cut.json";
-export function phaseCutFilePath(artifactsDir) {
-    return join(contractPipelineDir(artifactsDir), PHASE_CUT_FILE);
-}
-/** Read the persisted cut, or null if it has not been written yet. */
-export async function readPhaseCutArtifact(artifactsDir) {
-    return (await readOptionalJsonFile(phaseCutFilePath(artifactsDir))) ?? null;
-}
-/**
- * Derive the cut from the on-disk `finalized_module_contracts` and (re)write the
- * sidecar. Idempotent: a finalized-contracts payload that yields the same DAG
- * yields byte-identical JSON. Returns the derived cut, or null when there are no
- * in-scope modules to phase (no finalized contracts on disk yet).
- */
-export async function ensurePhaseCutArtifact(artifactsDir) {
-    const finalized = envelopePayload(await readContractArtifact(artifactsDir, "finalized_module_contracts"));
-    const decomposition = envelopePayload(await readContractArtifact(artifactsDir, "module_decomposition"));
-    const pathASeed = await readOptionalJsonFile(pathASeedFilePath(artifactsDir));
-    const modules = applyWorkBlockSeamDependencies(phaseCutModulesFromContracts(finalized), decomposition, pathASeed);
-    if (modules.length === 0)
-        return null;
-    const cut = derivePhaseCut(modules);
-    await writeJsonFile(phaseCutFilePath(artifactsDir), cut);
-    return cut;
-}
-//# sourceMappingURL=phaseCutArtifact.js.map

package/dist/remediate/contractPipeline/phaseCutArtifact.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"phaseCutArtifact.js","sourceRoot":"","sources":["../../../src/remediate/contractPipeline/phaseCutArtifact.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACzE,OAAO,EACL,mBAAmB,EACnB,iBAAiB,EACjB,oBAAoB,EACpB,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,cAAc,EACd,8BAA8B,EAC9B,4BAA4B,GAE7B,MAAM,eAAe,CAAC;AAEvB,MAAM,CAAC,MAAM,cAAc,GAAG,gBAAgB,CAAC;AAE/C,MAAM,UAAU,gBAAgB,CAAC,YAAoB;IACnD,OAAO,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,EAAE,cAAc,CAAC,CAAC;AACjE,CAAC;AAED,sEAAsE;AACtE,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,YAAoB;IAEpB,OAAO,CAAC,MAAM,oBAAoB,CAAW,gBAAgB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AACxF,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,YAAoB;IAEpB,MAAM,SAAS,GAAG,eAAe,CAC/B,MAAM,oBAAoB,CAAC,YAAY,EAAE,4BAA4B,CAAC,CACvE,CAAC;IACF,MAAM,aAAa,GAAG,eAAe,CACnC,MAAM,oBAAoB,CAAC,YAAY,EAAE,sBAAsB,CAAC,CACjE,CAAC;IACF,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAAU,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAC;IACvF,MAAM,OAAO,GAAG,8BAA8B,CAC5C,4BAA4B,CAAC,SAAS,CAAC,EACvC,aAAa,EACb,SAAS,CACV,CAAC;IACF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,MAAM,GAAG,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IACpC,MAAM,aAAa,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,OAAO,GAAG,CAAC;AACb,CAAC"}