strikethroo 3.16.0 → 3.17.0

package/dist/validation/graph-checks.js

@@ -0,0 +1,388 @@
+"use strict";
+/**
+ * Structural checks over the task dependency graph and the execution blueprint:
+ * dangling dependency references, dependency cycles, blueprint/task consistency
+ * in both directions, agreement among the three coexisting task-id notions, and
+ * task-id uniqueness within a plan.
+ *
+ * Scope is `plans/` only; `archive/` participates solely in plan-id uniqueness.
+ * Plan clarification 1 settled that: an archived plan is immutable history, so a
+ * content finding against it cannot be acted on and is therefore noise. Plan ids
+ * are the exception because continuous numbering across active and archived
+ * plans is exactly what stops an archived plan from colliding with a new one.
+ *
+ * Cycle detection exists nowhere else in this repository. The acyclicity rule is
+ * written down only as instructions to a language model
+ * (`src/skill-prompts/sections/validation-checklist.md`, the
+ * `POST_TASK_GENERATION_ALL` hook). Today a cycle is a display defect in the
+ * viewer plus a permanent, undiagnosed "phase not ready" stall from
+ * `collectTaskReadinessIssues` — which is why naming the participating task ids
+ * in the message is the point of the check, not a nicety.
+ *
+ * No blueprint parser is defined here. The repository already carries
+ * `parseBlueprintPhases` twice (`src/serve/derivation.ts` and
+ * `src/skill-scripts/shared/blueprint-parse.ts`), quietly diverging; a third
+ * copy is the specific failure mode this file must not add. The serve copy is
+ * reused because it is inside the CLI's `tsc` domain and already returns the
+ * `Phase` shape. Deduplicating the existing two is out of scope.
+ *
+ * Known limitation, deliberately not fixed here: that parser's `TASK_REF_RE`
+ * matches the first `Task NN` in *any* bulleted line, so ordinary prose in a
+ * blueprint bullet is indistinguishable from a phase assignment and can yield a
+ * phantom reference. Hardening it belongs to whoever deduplicates the two
+ * parsers. The `blueprint/reference-unresolved` message therefore spells the
+ * false-positive case out, so a human meets it as a known limitation instead of
+ * a mystery.
+ *
+ * `findStrikethrooRoot` is never imported: it terminates the process on a
+ * schema-version mismatch. The root arrives already resolved.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.graphChecks = graphChecks;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const markdown_1 = require("../serve/markdown");
+const derivation_1 = require("../serve/derivation");
+const plan_scan_1 = require("../skill-scripts/shared/plan-scan");
+/** Leading `NN--` numeric prefix of a task filename — the id notion `findTaskFile` uses. */
+const FILENAME_PREFIX_RE = /^(\d+)--/;
+/** Ascending numeric sort, for stable id lists in messages. */
+const byNumber = (a, b) => a - b;
+/** Sorted directory names under `<root>/<area>`. Missing or unreadable dir -> []. */
+const listPlanDirNames = (root, area) => {
+    try {
+        return fs
+            .readdirSync(path.join(root, area), { withFileTypes: true })
+            .filter(entry => entry.isDirectory())
+            .map(entry => entry.name)
+            .sort((a, b) => a.localeCompare(b));
+    }
+    catch {
+        return [];
+    }
+};
+/**
+ * Picks the plan document inside a plan directory: the first `plan-*.md` in
+ * sorted order, falling back to the first `*.md`. Sorting keeps the choice
+ * independent of `readdirSync` order.
+ */
+const findPlanFile = (planDir) => {
+    let names;
+    try {
+        names = fs
+            .readdirSync(planDir, { withFileTypes: true })
+            .filter(entry => entry.isFile() && entry.name.endsWith('.md'))
+            .map(entry => entry.name)
+            .sort((a, b) => a.localeCompare(b));
+    }
+    catch {
+        return undefined;
+    }
+    return names.find(name => name.startsWith('plan-')) ?? names[0];
+};
+/** Builds the per-plan context for every directory under `plans/`. Never throws. */
+const collectPlans = (root) => listPlanDirNames(root, 'plans').map(name => {
+    const planDir = path.join(root, 'plans', name);
+    const planFile = findPlanFile(planDir);
+    let body = '';
+    if (planFile !== undefined) {
+        try {
+            body = (0, markdown_1.extractBody)(fs.readFileSync(path.join(planDir, planFile), 'utf8'));
+        }
+        catch {
+            body = '';
+        }
+    }
+    return {
+        name,
+        relDir: path.join('plans', name),
+        relPlanFile: planFile === undefined ? undefined : path.join('plans', name, planFile),
+        body,
+        tasks: (0, derivation_1.scanTasks)(planDir),
+    };
+});
+/** The `NN` prefix of a task filename, or undefined when the name has none. */
+const filenameId = (file) => {
+    const match = file.match(FILENAME_PREFIX_RE);
+    if (!match || match[1] === undefined)
+        return undefined;
+    const parsed = parseInt(match[1], 10);
+    return Number.isNaN(parsed) ? undefined : parsed;
+};
+/**
+ * The id a task answers to. Frontmatter wins because it is the notion the viewer
+ * and the dependency graph use; the filename prefix is the fallback so a task
+ * with unparsable frontmatter still participates instead of vanishing.
+ */
+const effectiveId = (task) => task.id ?? filenameId(task.file);
+/** Every id one task can be addressed by, across notions; deduplicated. */
+const notionIds = (task) => {
+    const ids = [];
+    if (typeof task.id === 'number')
+        ids.push(task.id);
+    const fromName = filenameId(task.file);
+    if (fromName !== undefined && !ids.includes(fromName))
+        ids.push(fromName);
+    return ids;
+};
+/**
+ * Every id by which a task in this plan can be addressed, across all notions.
+ *
+ * A reference resolves if *any* notion matches. That keeps a single id
+ * disagreement from being reported three times: `identity/task-id-mismatch`
+ * already names the root cause, so the dependency and blueprint checks stay
+ * quiet about the same file.
+ */
+const resolvableIds = (tasks) => new Set(tasks.flatMap(notionIds));
+/**
+ * Canonical key for a cycle, invariant under rotation: rotate so the smallest id
+ * leads. Two DFS entry points reaching the same cycle then produce one finding.
+ */
+const cycleKey = (cycle) => {
+    let pivot = 0;
+    for (let i = 1; i < cycle.length; i++) {
+        if (cycle[i] < cycle[pivot])
+            pivot = i;
+    }
+    return [...cycle.slice(pivot), ...cycle.slice(0, pivot)].join('>');
+};
+/**
+ * Finds every distinct dependency cycle by depth-first search with a recursion
+ * stack (white/grey/black colouring). Graphs here hold a handful of tasks, so
+ * recursion depth is a non-issue. The stack slice is what supplies the member
+ * list the finding message must name.
+ *
+ * @param edges - task id -> ids it depends on, restricted to ids in this plan.
+ */
+const findCycles = (edges) => {
+    const GREY = 1;
+    const BLACK = 2;
+    const colour = new Map();
+    const stack = [];
+    const cycles = [];
+    const seen = new Set();
+    const visit = (id) => {
+        colour.set(id, GREY);
+        stack.push(id);
+        for (const next of edges.get(id) ?? []) {
+            const state = colour.get(next);
+            if (state === undefined) {
+                visit(next);
+            }
+            else if (state === GREY) {
+                const start = stack.indexOf(next);
+                if (start !== -1) {
+                    const cycle = stack.slice(start);
+                    const key = cycleKey(cycle);
+                    if (!seen.has(key)) {
+                        seen.add(key);
+                        cycles.push(cycle);
+                    }
+                }
+            }
+        }
+        stack.pop();
+        colour.set(id, BLACK);
+    };
+    for (const id of [...edges.keys()].sort(byNumber)) {
+        if (colour.get(id) === undefined)
+            visit(id);
+    }
+    return cycles;
+};
+/** Cycles and dangling dependency references for one plan. */
+const dependencyFindings = (plan) => {
+    const findings = [];
+    const known = resolvableIds(plan.tasks);
+    for (const task of plan.tasks) {
+        const id = effectiveId(task);
+        const label = id === undefined ? task.file : `task ${id} (${task.file})`;
+        for (const dep of [...new Set(task.dependencies)].sort(byNumber)) {
+            if (known.has(dep))
+                continue;
+            findings.push({
+                check: 'graph/dangling-dependency',
+                path: path.join(plan.relDir, 'tasks', task.file),
+                message: `Plan "${plan.name}": ${label} declares a dependency on task ${dep}, but no task file in that plan carries that id under any notion (frontmatter id or filename prefix). Remove the dependency or add the missing task.`,
+            });
+        }
+    }
+    // The graph is built over frontmatter ids only: that is the notion the viewer
+    // and `inferPhases` traverse, so it is the notion in which a cycle actually
+    // stalls execution.
+    const graphIds = new Set(plan.tasks.map(task => task.id).filter((id) => typeof id === 'number'));
+    const edges = new Map();
+    for (const task of plan.tasks) {
+        if (typeof task.id !== 'number')
+            continue;
+        const outgoing = [...new Set(task.dependencies)]
+            .filter(dep => graphIds.has(dep))
+            .sort(byNumber);
+        edges.set(task.id, [...(edges.get(task.id) ?? []), ...outgoing]);
+    }
+    for (const cycle of findCycles(edges)) {
+        const members = [...new Set(cycle)].sort(byNumber);
+        const trail = [...cycle, cycle[0]].join(' -> ');
+        const detail = members.length === 1
+            ? `task ${members[0]} depends on itself`
+            : `tasks ${members.join(', ')} (${trail})`;
+        findings.push({
+            check: 'graph/dependency-cycle',
+            path: plan.relDir,
+            message: `Plan "${plan.name}" has a dependency cycle: ${detail}. No phase ordering satisfies it, so these tasks can never become ready. Break the cycle by dropping one of the dependencies.`,
+        });
+    }
+    return findings;
+};
+/** Blueprint <-> task consistency, in both directions, for one plan. */
+const blueprintFindings = (plan) => {
+    const phases = (0, derivation_1.parseBlueprintPhases)(plan.body);
+    // No blueprint section (or one with no phase headings) is a legitimate state
+    // for a drafted plan, not a defect. Nothing to reconcile against.
+    if (!phases || phases.length === 0)
+        return [];
+    const findings = [];
+    const known = resolvableIds(plan.tasks);
+    const scheduled = new Set();
+    const planFileLabel = plan.relPlanFile ?? plan.relDir;
+    for (const phase of phases) {
+        const phaseLabel = phase.name === undefined ? `phase ${phase.index}` : `phase ${phase.index} ("${phase.name}")`;
+        for (const id of phase.taskIds) {
+            scheduled.add(id);
+            if (known.has(id))
+                continue;
+            const finding = {
+                check: 'blueprint/reference-unresolved',
+                message: `Plan "${plan.name}": the Execution Blueprint's ${phaseLabel} references task ${id}, but no file in ${path.join(plan.relDir, 'tasks')} carries that id. Either the task file is missing, or this is a false positive: the shared blueprint parser treats the first "Task NN" in any bulleted line as a phase assignment, so a bullet whose prose merely mentions "Task ${id}" reads as a reference — reword that bullet if so.`,
+            };
+            if (plan.relPlanFile !== undefined)
+                finding.path = plan.relPlanFile;
+            findings.push(finding);
+        }
+    }
+    for (const task of plan.tasks) {
+        const id = effectiveId(task);
+        if (id === undefined)
+            continue;
+        // Symmetric with the incoming direction above, which resolves through
+        // `resolvableIds`: a task counts as scheduled when *any* of its notions is
+        // named by a phase. Keying this sweep on `effectiveId` alone would report a
+        // file whose frontmatter id and filename prefix disagree as unscheduled
+        // even though a phase names it by filename — a second finding for a root
+        // cause `identity/task-id-mismatch` already reports, carrying remediation
+        // ("Add it to a phase") that is wrong for that cause.
+        if (notionIds(task).some(notion => scheduled.has(notion)))
+            continue;
+        findings.push({
+            check: 'blueprint/task-in-no-phase',
+            path: path.join(plan.relDir, 'tasks', task.file),
+            message: `Plan "${plan.name}": task ${id} (${task.file}) appears in no phase of the Execution Blueprint in ${planFileLabel}, so nothing will ever execute it. Add it to a phase or remove the file.`,
+        });
+    }
+    return findings;
+};
+/** Task-id agreement across notions, plus per-plan task-id uniqueness. */
+const taskIdentityFindings = (plan) => {
+    const findings = [];
+    for (const task of plan.tasks) {
+        const fromName = filenameId(task.file);
+        if (typeof task.id !== 'number' || fromName === undefined)
+            continue;
+        if (task.id === fromName)
+            continue;
+        findings.push({
+            check: 'identity/task-id-mismatch',
+            path: path.join(plan.relDir, 'tasks', task.file),
+            message: `Plan "${plan.name}": ${task.file} declares frontmatter id ${task.id} but its filename prefix is ${fromName}. The viewer and the dependency graph resolve tasks by frontmatter id while the execution path (\`findTaskFile\`) resolves by filename prefix, so the two consumers would pick different files. Make them agree.`,
+        });
+    }
+    // Task ids are unique *within a plan* only: `config/STRIKETHROO.md` specifies
+    // auto-incremental ids that restart at 01 per plan, so a global check would
+    // flag every healthy multi-plan workspace.
+    const byId = new Map();
+    for (const task of plan.tasks) {
+        if (typeof task.id !== 'number')
+            continue;
+        byId.set(task.id, [...(byId.get(task.id) ?? []), task.file]);
+    }
+    for (const id of [...byId.keys()].sort(byNumber)) {
+        const files = [...(byId.get(id) ?? [])].sort((a, b) => a.localeCompare(b));
+        if (files.length < 2)
+            continue;
+        findings.push({
+            check: 'identity/duplicate-task-id',
+            path: plan.relDir,
+            message: `Plan "${plan.name}" has ${files.length} task files declaring frontmatter id ${id}: ${files.join(', ')}. Task ids must be unique within a plan; dependencies on task ${id} are ambiguous until this is fixed.`,
+        });
+    }
+    return findings;
+};
+/**
+ * Plan-id uniqueness across `plans/` and `archive/` together — the only check
+ * that reads `archive/`. Continuous numbering across both trees is what keeps a
+ * newly created plan from colliding with an archived one.
+ */
+const planIdFindings = (root) => {
+    const byId = new Map();
+    for (const entry of (0, plan_scan_1.getAllPlans)(root)) {
+        byId.set(entry.id, [...(byId.get(entry.id) ?? []), path.relative(root, entry.file)]);
+    }
+    const findings = [];
+    for (const id of [...byId.keys()].sort(byNumber)) {
+        const files = [...(byId.get(id) ?? [])].sort((a, b) => a.localeCompare(b));
+        if (files.length < 2)
+            continue;
+        findings.push({
+            check: 'identity/duplicate-plan-id',
+            message: `Plan id ${id} is claimed by ${files.length} plans across plans/ and archive/: ${files.join(', ')}. Plan ids must be unique across both, since numbering continues when a plan is archived.`,
+        });
+    }
+    return findings;
+};
+/**
+ * Runs the graph and identity checks against an already-resolved absolute
+ * workspace root. Pure: reads only, never writes, never exits.
+ */
+function graphChecks(root) {
+    const plans = collectPlans(root);
+    return [
+        ...plans.flatMap(dependencyFindings),
+        ...plans.flatMap(blueprintFindings),
+        ...plans.flatMap(taskIdentityFindings),
+        ...planIdFindings(root),
+    ];
+}
+//# sourceMappingURL=graph-checks.js.map

package/dist/validation/graph-checks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-checks.js","sourceRoot":"","sources":["../../src/validation/graph-checks.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8UH,kCAQC;AApVD,uCAAyB;AACzB,2CAA6B;AAC7B,gDAAgD;AAChD,oDAA6F;AAC7F,iEAAgE;AAGhE,4FAA4F;AAC5F,MAAM,kBAAkB,GAAG,UAAU,CAAC;AAetC,+DAA+D;AAC/D,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAEzD,qFAAqF;AACrF,MAAM,gBAAgB,GAAG,CAAC,IAAY,EAAE,IAAyB,EAAY,EAAE;IAC7E,IAAI,CAAC;QACH,OAAO,EAAE;aACN,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;aAC3D,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;aACpC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,YAAY,GAAG,CAAC,OAAe,EAAsB,EAAE;IAC3D,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,EAAE;aACP,WAAW,CAAC,OAAO,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;aAC7C,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;aAC7D,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC,CAAC;AAEF,oFAAoF;AACpF,MAAM,YAAY,GAAG,CAAC,IAAY,EAAiB,EAAE,CACnD,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;IACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACvC,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC;YACH,IAAI,GAAG,IAAA,sBAAW,EAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QAC5E,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,GAAG,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI;QACJ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC;QAChC,WAAW,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC;QACpF,IAAI;QACJ,KAAK,EAAE,IAAA,sBAAS,EAAC,OAAO,CAAC;KAC1B,CAAC;AACJ,CAAC,CAAC,CAAC;AAEL,+EAA+E;AAC/E,MAAM,UAAU,GAAG,CAAC,IAAY,EAAsB,EAAE;IACtD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAC7C,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACvD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtC,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;AACnD,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,WAAW,GAAG,CAAC,IAAU,EAAsB,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAEzF,2EAA2E;AAC3E,MAAM,SAAS,GAAG,CAAC,IAAU,EAAY,EAAE;IACzC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1E,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,aAAa,GAAG,CAAC,KAAa,EAAe,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;AAExF;;;GAGG;AACH,MAAM,QAAQ,GAAG,CAAC,KAAe,EAAU,EAAE;IAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAK,KAAK,CAAC,CAAC,CAAY,GAAI,KAAK,CAAC,KAAK,CAAY;YAAE,KAAK,GAAG,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrE,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CAAC,KAA4B,EAAc,EAAE;IAC9D,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,MAAM,KAAK,GAAG,CAAC,EAAU,EAAQ,EAAE;QACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,CAAC;YACd,CAAC;iBAAM,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAClC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACjB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;oBACjC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACd,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClD,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,SAAS;YAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,8DAA8D;AAC9D,MAAM,kBAAkB,GAAG,CAAC,IAAiB,EAAa,EAAE;IAC1D,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC;QACzE,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC7B,QAAQ,CAAC,IAAI,CAAC;gBACZ,KAAK,EAAE,2BAA2B;gBAClC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC;gBAChD,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,MAAM,KAAK,kCAAkC,GAAG,sJAAsJ;aAClO,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,4EAA4E;IAC5E,oBAAoB;IACpB,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC,CACrF,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ;YAAE,SAAS;QAC1C,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aAC7C,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAChC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,MAAM,GACV,OAAO,CAAC,MAAM,KAAK,CAAC;YAClB,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC,CAAC,oBAAoB;YACxC,CAAC,CAAC,SAAS,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC;QAC/C,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,wBAAwB;YAC/B,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,6BAA6B,MAAM,+HAA+H;SAC9L,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,wEAAwE;AACxE,MAAM,iBAAiB,GAAG,CAAC,IAAiB,EAAa,EAAE;IACzD,MAAM,MAAM,GAAwB,IAAA,iCAAoB,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,6EAA6E;IAC7E,kEAAkE;IAClE,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE9C,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC;IAEtD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,UAAU,GACd,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC;QAC/F,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAC/B,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClB,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC5B,MAAM,OAAO,GAAY;gBACvB,KAAK,EAAE,gCAAgC;gBACvC,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,gCAAgC,UAAU,oBAAoB,EAAE,oBAAoB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,oOAAoO,EAAE,oDAAoD;aACza,CAAC;YACF,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;gBAAE,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;YACpE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,SAAS;YAAE,SAAS;QAC/B,sEAAsE;QACtE,2EAA2E;QAC3E,4EAA4E;QAC5E,wEAAwE;QACxE,yEAAyE;QACzE,0EAA0E;QAC1E,sDAAsD;QACtD,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAAE,SAAS;QACpE,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,4BAA4B;YACnC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC;YAChD,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,WAAW,EAAE,KAAK,IAAI,CAAC,IAAI,uDAAuD,aAAa,0EAA0E;SACrM,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,0EAA0E;AAC1E,MAAM,oBAAoB,GAAG,CAAC,IAAiB,EAAa,EAAE;IAC5D,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,IAAI,QAAQ,KAAK,SAAS;YAAE,SAAS;QACpE,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ;YAAE,SAAS;QACnC,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,2BAA2B;YAClC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC;YAChD,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,4BAA4B,IAAI,CAAC,EAAE,+BAA+B,QAAQ,kNAAkN;SACvU,CAAC,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,4EAA4E;IAC5E,2CAA2C;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ;YAAE,SAAS;QAC1C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC/B,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,4BAA4B;YACnC,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,SAAS,KAAK,CAAC,MAAM,wCAAwC,EAAE,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,iEAAiE,EAAE,qCAAqC;SACxN,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,cAAc,GAAG,CAAC,IAAY,EAAa,EAAE;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,IAAA,uBAAW,EAAC,IAAI,CAAC,EAAE,CAAC;QACtC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC;IAED,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC/B,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,4BAA4B;YACnC,OAAO,EAAE,WAAW,EAAE,kBAAkB,KAAK,CAAC,MAAM,sCAAsC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,2FAA2F;SACtM,CAAC,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF;;;GAGG;AACH,SAAgB,WAAW,CAAC,IAAY;IACtC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,OAAO;QACL,GAAG,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC;QACpC,GAAG,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC;QACnC,GAAG,KAAK,CAAC,OAAO,CAAC,oBAAoB,CAAC;QACtC,GAAG,cAAc,CAAC,IAAI,CAAC;KACxB,CAAC;AACJ,CAAC"}

package/dist/validation/metadata-gate.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Metadata gate: workspace-shape checks derived from `<root>/.init-metadata.json`.
+ *
+ * Four findings come out of this file — an unreadable or unparsable metadata
+ * file, an absent `files` map, a `workspaceSchemaVersion` other than the current
+ * constant, and any path recorded in `files` that is no longer on disk.
+ *
+ * Hash drift is deliberately NOT reported. `src/conflict-detector.ts` documents
+ * that a hash mismatch is how the tool detects *user modification* — a
+ * first-class, protected state that the whole hash-tracking mechanism exists to
+ * preserve. Reporting it would fire on every customized or profiled workspace.
+ * Only deletions are reported.
+ *
+ * `isFileDeleted` from `src/conflict-detector.ts` is not reused: it evaluates
+ * `relativePath in metadata.files`, which throws when `files` is `undefined`.
+ * Any workspace initialized before the hash map was recorded is in that state,
+ * so the absent-map finding short-circuits the deletion scan below.
+ */
+import { Finding } from './types';
+/**
+ * Runs the metadata gate against an already-resolved absolute workspace root.
+ *
+ * Pure: reads only, never writes, never exits.
+ */
+export declare function metadataGate(root: string): Finding[];
+//# sourceMappingURL=metadata-gate.d.ts.map

package/dist/validation/metadata-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metadata-gate.d.ts","sourceRoot":"","sources":["../../src/validation/metadata-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAKH,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AA0BlC;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,EAAE,CA6CpD"}

package/dist/validation/metadata-gate.js

@@ -0,0 +1,123 @@
+"use strict";
+/**
+ * Metadata gate: workspace-shape checks derived from `<root>/.init-metadata.json`.
+ *
+ * Four findings come out of this file — an unreadable or unparsable metadata
+ * file, an absent `files` map, a `workspaceSchemaVersion` other than the current
+ * constant, and any path recorded in `files` that is no longer on disk.
+ *
+ * Hash drift is deliberately NOT reported. `src/conflict-detector.ts` documents
+ * that a hash mismatch is how the tool detects *user modification* — a
+ * first-class, protected state that the whole hash-tracking mechanism exists to
+ * preserve. Reporting it would fire on every customized or profiled workspace.
+ * Only deletions are reported.
+ *
+ * `isFileDeleted` from `src/conflict-detector.ts` is not reused: it evaluates
+ * `relativePath in metadata.files`, which throws when `files` is `undefined`.
+ * Any workspace initialized before the hash map was recorded is in that state,
+ * so the absent-map finding short-circuits the deletion scan below.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.metadataGate = metadataGate;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const metadata_1 = require("../metadata");
+const METADATA_FILENAME = '.init-metadata.json';
+/**
+ * Reads and parses `<root>/.init-metadata.json`.
+ *
+ * Returns `null` when the file is missing, unreadable, unparsable, or not a
+ * JSON object. Never throws: an unreadable metadata file is a finding, not a
+ * crash.
+ */
+const readMetadata = (root) => {
+    try {
+        const parsed = JSON.parse(fs.readFileSync(path.join(root, METADATA_FILENAME), 'utf-8'));
+        if (typeof parsed !== 'object' || parsed === null || Array.isArray(parsed))
+            return null;
+        return parsed;
+    }
+    catch {
+        return null;
+    }
+};
+/**
+ * Runs the metadata gate against an already-resolved absolute workspace root.
+ *
+ * Pure: reads only, never writes, never exits.
+ */
+function metadataGate(root) {
+    const findings = [];
+    const metadata = readMetadata(root);
+    if (metadata === null) {
+        findings.push({
+            check: 'metadata/unreadable',
+            path: METADATA_FILENAME,
+            message: `${METADATA_FILENAME} is missing, unreadable, or not a JSON object. Run \`npx strikethroo init\` to initialize the workspace.`,
+        });
+        return findings;
+    }
+    const recordedVersion = metadata.workspaceSchemaVersion;
+    if (recordedVersion !== metadata_1.CURRENT_WORKSPACE_SCHEMA_VERSION) {
+        const shown = recordedVersion === undefined ? 'absent' : JSON.stringify(recordedVersion);
+        findings.push({
+            check: 'metadata/schema-version-skew',
+            path: METADATA_FILENAME,
+            message: `workspaceSchemaVersion is ${shown}, but this build expects ${metadata_1.CURRENT_WORKSPACE_SCHEMA_VERSION}. Re-run \`npx strikethroo init\` to bring the workspace to current shape.`,
+        });
+    }
+    const files = metadata.files;
+    if (typeof files !== 'object' || files === null || Array.isArray(files)) {
+        findings.push({
+            check: 'metadata/files-map-absent',
+            path: METADATA_FILENAME,
+            message: `${METADATA_FILENAME} has no \`files\` map, so tracked-file deletions cannot be detected. Re-run \`npx strikethroo init\` to record it.`,
+        });
+        // Short-circuit: without a map there is nothing to scan for deletions.
+        return findings;
+    }
+    for (const relativePath of Object.keys(files)) {
+        if (!fs.existsSync(path.join(root, relativePath))) {
+            findings.push({
+                check: 'metadata/file-deleted',
+                path: relativePath,
+                message: `${relativePath} is recorded in .init-metadata.json but no longer exists on disk. Restore it or re-run \`npx strikethroo init\`.`,
+            });
+        }
+    }
+    return findings;
+}
+//# sourceMappingURL=metadata-gate.js.map

package/dist/validation/metadata-gate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metadata-gate.js","sourceRoot":"","sources":["../../src/validation/metadata-gate.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCH,oCA6CC;AA/ED,uCAAyB;AACzB,2CAA6B;AAC7B,0CAA+D;AAG/D,MAAM,iBAAiB,GAAG,qBAAqB,CAAC;AAKhD;;;;;;GAMG;AACH,MAAM,YAAY,GAAG,CAAC,IAAY,EAAsB,EAAE;IACxD,IAAI,CAAC;QACH,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAChC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,iBAAiB,CAAC,EAAE,OAAO,CAAC,CAC7D,CAAC;QACF,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QACxF,OAAO,MAAqB,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,SAAgB,YAAY,CAAC,IAAY;IACvC,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAEpC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,qBAAqB;YAC5B,IAAI,EAAE,iBAAiB;YACvB,OAAO,EAAE,GAAG,iBAAiB,0GAA0G;SACxI,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,eAAe,GAAG,QAAQ,CAAC,sBAAsB,CAAC;IACxD,IAAI,eAAe,KAAK,2CAAgC,EAAE,CAAC;QACzD,MAAM,KAAK,GAAG,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;QACzF,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,8BAA8B;YACrC,IAAI,EAAE,iBAAiB;YACvB,OAAO,EAAE,6BAA6B,KAAK,4BAA4B,2CAAgC,4EAA4E;SACpL,CAAC,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;IAC7B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACxE,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,2BAA2B;YAClC,IAAI,EAAE,iBAAiB;YACvB,OAAO,EAAE,GAAG,iBAAiB,oHAAoH;SAClJ,CAAC,CAAC;QACH,uEAAuE;QACvE,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC;YAClD,QAAQ,CAAC,IAAI,CAAC;gBACZ,KAAK,EAAE,uBAAuB;gBAC9B,IAAI,EAAE,YAAY;gBAClB,OAAO,EAAE,GAAG,YAAY,kHAAkH;aAC3I,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/validation/strict-pass.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Strict frontmatter pass over `plans/<plan>/plan-<name>.md` and
+ * `plans/<plan>/tasks/<name>.md`.
+ *
+ * Deliberately independent of the viewer's frontmatter reader in
+ * `src/serve/markdown.ts`: that one is lenient by design and cannot distinguish
+ * a missing field from a malformed one, which is precisely the distinction a
+ * validator must report. It runs `parseInt` and leaves the field `undefined` on
+ * failure, so `id: abc` and a file with no `id:` line at all produce
+ * byte-identical results. The two parsers coexist with different tolerance
+ * contracts, and the viewer's is not to be "fixed" — leniency is correct for
+ * rendering.
+ *
+ * Enumeration is likewise hand-rolled rather than routed through the shared
+ * plan-scan helpers in `src/skill-scripts/shared/`, which drop any plan whose
+ * `id` will not parse and are therefore structurally incapable of reporting the
+ * plans most likely to be broken.
+ *
+ * Scope is exactly `plans/`. Archived plans are immutable history, so a finding
+ * against one is unfixable noise; the shipped task template carries literal
+ * placeholders (`status: "[STATUS]"`), so a workspace-wide Markdown sweep would
+ * make the workspace report its own templates as broken.
+ *
+ * Required plan *sections* are deliberately not checked: no machine-readable
+ * list of them exists, and the templates are user-editable and wholesale
+ * replaceable by a strikethroo profile.
+ */
+import { Finding } from './types';
+/**
+ * Runs the strict frontmatter pass against an already-resolved absolute
+ * workspace root. Pure: reads only, never writes, never exits.
+ *
+ * @param root - Absolute path to the `.ai/strikethroo` directory.
+ * @returns One finding per proven frontmatter defect, each carrying a
+ *          workspace-relative `path`.
+ */
+export declare function strictPass(root: string): Finding[];
+//# sourceMappingURL=strict-pass.d.ts.map

package/dist/validation/strict-pass.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strict-pass.d.ts","sourceRoot":"","sources":["../../src/validation/strict-pass.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAKH,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AA8UlC;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,EAAE,CAgClD"}