@neurcode-ai/cli 0.10.0 → 0.12.0

package/dist/governance/intent/intent-contract.js

@@ -0,0 +1,397 @@
+"use strict";
+/**
+ * Intent Contract — declarative architectural intent.
+ *
+ * Canonical path: `.neurcode/intent.json` (project-relative).
+ *
+ * The contract is the *human-authored* form. The loader validates it and
+ * converts it into a typed `IntentGraph` for the drift engine.
+ *
+ * Canonical form is JSON for two reasons:
+ *   1. Replay determinism — JSON parsing is locale-free and YAML has historical
+ *      ambiguities ("yes" → bool, leading zeros, multiline). The contract is a
+ *      replay-relevant artifact, so we lock it to JSON.
+ *   2. Zero extra dependencies — adding a YAML parser to the CLI is unjustified
+ *      for a configuration file the team writes once.
+ *
+ * Contract example:
+ *
+ *   {
+ *     "schemaVersion": 1,
+ *     "layers": [
+ *       { "id": "controller", "glob": ["src/commands/**", "src/handlers/**"] },
+ *       { "id": "service",    "glob": ["src/services/**"] },
+ *       { "id": "persistence","glob": ["src/repositories/**", "src/db/**"] }
+ *     ],
+ *     "allowedEdges": [
+ *       { "from": "controller", "to": "service" },
+ *       { "from": "service",    "to": "persistence" }
+ *     ],
+ *     "forbiddenEdges": [
+ *       { "from": "controller", "to": "persistence",
+ *         "reason": "Controllers must access data via service layer" }
+ *     ]
+ *   }
+ *
+ * Intelligence classification: DETERMINISTIC.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.INTENT_CONTRACT_RELATIVE_PATH = exports.INTENT_CONTRACT_FILENAME = void 0;
+exports.resolveIntentContractPath = resolveIntentContractPath;
+exports.loadIntentContract = loadIntentContract;
+exports.buildIntentGraphFromRaw = buildIntentGraphFromRaw;
+const fs_1 = require("fs");
+const path_1 = require("path");
+const crypto_1 = require("crypto");
+const intent_graph_1 = require("./intent-graph");
+// ── Canonical artifact path ──────────────────────────────────────────────────
+exports.INTENT_CONTRACT_FILENAME = 'intent.json';
+exports.INTENT_CONTRACT_RELATIVE_PATH = `.neurcode/${exports.INTENT_CONTRACT_FILENAME}`;
+// ── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Resolve the canonical contract path for a project. Does not check existence.
+ */
+function resolveIntentContractPath(projectRoot, override) {
+    if (override) {
+        return (0, path_1.resolve)(projectRoot, override);
+    }
+    return (0, path_1.join)(projectRoot, '.neurcode', exports.INTENT_CONTRACT_FILENAME);
+}
+/**
+ * Load and validate the intent contract for a project.
+ *
+ * Behaviour:
+ *   - If the file does not exist → `exists: false`, graph is empty, no errors.
+ *   - If the file is malformed JSON → `exists: true`, graph is empty, `errors`
+ *     contains the parser error.
+ *   - If the schema is wrong → `exists: true`, graph is empty, `errors` lists
+ *     every validation failure.
+ *   - On success → `exists: true`, graph is populated, errors is empty.
+ *
+ * The loader never throws. Drift detection is opt-in; an unparseable contract
+ * must not break verification.
+ */
+function loadIntentContract(projectRoot, override) {
+    const contractPath = resolveIntentContractPath(projectRoot, override);
+    if (!(0, fs_1.existsSync)(contractPath)) {
+        return {
+            path: contractPath,
+            exists: false,
+            graph: intent_graph_1.EMPTY_INTENT_GRAPH,
+            errors: [],
+            warnings: [],
+        };
+    }
+    let raw;
+    try {
+        raw = (0, fs_1.readFileSync)(contractPath, 'utf8');
+    }
+    catch (err) {
+        const msg = err instanceof Error ? err.message : String(err);
+        return {
+            path: contractPath,
+            exists: true,
+            graph: intent_graph_1.EMPTY_INTENT_GRAPH,
+            errors: [`failed to read intent contract: ${msg}`],
+            warnings: [],
+        };
+    }
+    let parsed;
+    try {
+        parsed = JSON.parse(raw);
+    }
+    catch (err) {
+        const msg = err instanceof Error ? err.message : String(err);
+        return {
+            path: contractPath,
+            exists: true,
+            graph: intent_graph_1.EMPTY_INTENT_GRAPH,
+            errors: [`invalid JSON in intent contract: ${msg}`],
+            warnings: [],
+        };
+    }
+    return validateAndBuildGraph(parsed, contractPath);
+}
+/**
+ * Parse + validate a raw contract value (already-parsed JSON) and build the graph.
+ * Exposed for tests so we don't need to touch the filesystem.
+ */
+function buildIntentGraphFromRaw(raw) {
+    return validateAndBuildGraph(raw, '<inline>');
+}
+// ── Validation ───────────────────────────────────────────────────────────────
+function validateAndBuildGraph(raw, sourcePath) {
+    const errors = [];
+    const warnings = [];
+    if (raw === null || typeof raw !== 'object') {
+        return {
+            path: sourcePath,
+            exists: true,
+            graph: intent_graph_1.EMPTY_INTENT_GRAPH,
+            errors: ['intent contract must be a JSON object'],
+            warnings: [],
+        };
+    }
+    const obj = raw;
+    // Schema version
+    const schemaVersion = obj.schemaVersion;
+    if (schemaVersion !== intent_graph_1.INTENT_GRAPH_SCHEMA_VERSION) {
+        errors.push(`unsupported schemaVersion: expected ${intent_graph_1.INTENT_GRAPH_SCHEMA_VERSION}, got ${JSON.stringify(schemaVersion)}`);
+    }
+    // Allowed top-level fields (anything else surfaces as a warning)
+    const KNOWN_FIELDS = new Set([
+        'schemaVersion',
+        'layers',
+        'modules',
+        'trustBoundaries',
+        'allowedEdges',
+        'forbiddenEdges',
+    ]);
+    for (const key of Object.keys(obj)) {
+        if (!KNOWN_FIELDS.has(key)) {
+            warnings.push(`unknown top-level field: ${key}`);
+        }
+    }
+    const layers = validateLayers(obj.layers, errors);
+    const modules = validateModules(obj.modules, errors);
+    const trustBoundaries = validateTrustBoundaries(obj.trustBoundaries, errors);
+    const allowedEdges = validateEdges('allowedEdges', obj.allowedEdges, errors, layers);
+    const forbiddenEdges = validateEdges('forbiddenEdges', obj.forbiddenEdges, errors, layers);
+    // Soft warnings on the resulting shape
+    for (const layer of layers) {
+        if (layer.glob.length === 0) {
+            warnings.push(`layer "${layer.id}" has no glob patterns; nothing will be classified into it`);
+        }
+    }
+    if (errors.length > 0) {
+        return {
+            path: sourcePath,
+            exists: true,
+            graph: intent_graph_1.EMPTY_INTENT_GRAPH,
+            errors,
+            warnings,
+        };
+    }
+    const graph = {
+        schemaVersion: intent_graph_1.INTENT_GRAPH_SCHEMA_VERSION,
+        layers,
+        modules,
+        trustBoundaries,
+        allowedEdges,
+        forbiddenEdges,
+        fingerprint: fingerprintGraph({
+            layers,
+            modules,
+            trustBoundaries,
+            allowedEdges,
+            forbiddenEdges,
+        }),
+    };
+    return {
+        path: sourcePath,
+        exists: true,
+        graph,
+        errors: [],
+        warnings,
+    };
+}
+function validateLayers(value, errors) {
+    if (value === undefined)
+        return [];
+    if (!Array.isArray(value)) {
+        errors.push('"layers" must be an array');
+        return [];
+    }
+    const out = [];
+    const seenIds = new Set();
+    for (let i = 0; i < value.length; i += 1) {
+        const layer = value[i];
+        if (layer === null || typeof layer !== 'object') {
+            errors.push(`layers[${i}] must be an object`);
+            continue;
+        }
+        const rec = layer;
+        const id = rec.id;
+        if (typeof id !== 'string' || id.length === 0) {
+            errors.push(`layers[${i}].id must be a non-empty string`);
+            continue;
+        }
+        if (seenIds.has(id)) {
+            errors.push(`layers[${i}].id "${id}" is a duplicate`);
+            continue;
+        }
+        seenIds.add(id);
+        const glob = rec.glob;
+        if (!Array.isArray(glob) || !glob.every((g) => typeof g === 'string')) {
+            errors.push(`layers[${i}].glob must be an array of strings`);
+            continue;
+        }
+        const description = typeof rec.description === 'string' ? rec.description : undefined;
+        out.push({ id, description, glob: glob });
+    }
+    return out;
+}
+function validateModules(value, errors) {
+    if (value === undefined)
+        return [];
+    if (!Array.isArray(value)) {
+        errors.push('"modules" must be an array');
+        return [];
+    }
+    const out = [];
+    const seenIds = new Set();
+    for (let i = 0; i < value.length; i += 1) {
+        const m = value[i];
+        if (m === null || typeof m !== 'object') {
+            errors.push(`modules[${i}] must be an object`);
+            continue;
+        }
+        const rec = m;
+        const id = rec.id;
+        if (typeof id !== 'string' || id.length === 0) {
+            errors.push(`modules[${i}].id must be a non-empty string`);
+            continue;
+        }
+        if (seenIds.has(id)) {
+            errors.push(`modules[${i}].id "${id}" is a duplicate`);
+            continue;
+        }
+        seenIds.add(id);
+        const glob = rec.glob;
+        if (!Array.isArray(glob) || !glob.every((g) => typeof g === 'string')) {
+            errors.push(`modules[${i}].glob must be an array of strings`);
+            continue;
+        }
+        let entryGlob;
+        if (rec.entryGlob !== undefined) {
+            if (!Array.isArray(rec.entryGlob) || !rec.entryGlob.every((g) => typeof g === 'string')) {
+                errors.push(`modules[${i}].entryGlob must be an array of strings`);
+                continue;
+            }
+            entryGlob = rec.entryGlob;
+        }
+        const description = typeof rec.description === 'string' ? rec.description : undefined;
+        out.push({ id, description, glob: glob, ...(entryGlob ? { entryGlob } : {}) });
+    }
+    return out;
+}
+function validateTrustBoundaries(value, errors) {
+    if (value === undefined)
+        return [];
+    if (!Array.isArray(value)) {
+        errors.push('"trustBoundaries" must be an array');
+        return [];
+    }
+    const out = [];
+    const seenIds = new Set();
+    const VALID_RULES = new Set(['inbound_only', 'outbound_only', 'requires_review']);
+    for (let i = 0; i < value.length; i += 1) {
+        const tb = value[i];
+        if (tb === null || typeof tb !== 'object') {
+            errors.push(`trustBoundaries[${i}] must be an object`);
+            continue;
+        }
+        const rec = tb;
+        const id = rec.id;
+        if (typeof id !== 'string' || id.length === 0) {
+            errors.push(`trustBoundaries[${i}].id must be a non-empty string`);
+            continue;
+        }
+        if (seenIds.has(id)) {
+            errors.push(`trustBoundaries[${i}].id "${id}" is a duplicate`);
+            continue;
+        }
+        seenIds.add(id);
+        const description = rec.description;
+        if (typeof description !== 'string' || description.length === 0) {
+            errors.push(`trustBoundaries[${i}].description must be a non-empty string`);
+            continue;
+        }
+        const insideGlob = rec.insideGlob;
+        if (!Array.isArray(insideGlob) || !insideGlob.every((g) => typeof g === 'string')) {
+            errors.push(`trustBoundaries[${i}].insideGlob must be an array of strings`);
+            continue;
+        }
+        const edgeRule = rec.edgeRule;
+        if (typeof edgeRule !== 'string' || !VALID_RULES.has(edgeRule)) {
+            errors.push(`trustBoundaries[${i}].edgeRule must be one of: ${[...VALID_RULES].join(', ')}`);
+            continue;
+        }
+        out.push({
+            id,
+            description,
+            insideGlob: insideGlob,
+            edgeRule: edgeRule,
+        });
+    }
+    return out;
+}
+function validateEdges(fieldName, value, errors, layers) {
+    if (value === undefined)
+        return [];
+    if (!Array.isArray(value)) {
+        errors.push(`"${fieldName}" must be an array`);
+        return [];
+    }
+    const knownLayerIds = new Set(layers.map((l) => l.id));
+    const out = [];
+    for (let i = 0; i < value.length; i += 1) {
+        const e = value[i];
+        if (e === null || typeof e !== 'object') {
+            errors.push(`${fieldName}[${i}] must be an object`);
+            continue;
+        }
+        const rec = e;
+        const from = rec.from;
+        const to = rec.to;
+        if (typeof from !== 'string' || from.length === 0) {
+            errors.push(`${fieldName}[${i}].from must be a non-empty string`);
+            continue;
+        }
+        if (typeof to !== 'string' || to.length === 0) {
+            errors.push(`${fieldName}[${i}].to must be a non-empty string`);
+            continue;
+        }
+        if (!knownLayerIds.has(from)) {
+            errors.push(`${fieldName}[${i}].from "${from}" references unknown layer`);
+            continue;
+        }
+        if (!knownLayerIds.has(to)) {
+            errors.push(`${fieldName}[${i}].to "${to}" references unknown layer`);
+            continue;
+        }
+        const reason = typeof rec.reason === 'string' ? rec.reason : undefined;
+        out.push({ from, to, ...(reason ? { reason } : {}) });
+    }
+    return out;
+}
+// ── Fingerprinting ───────────────────────────────────────────────────────────
+/**
+ * Produce a deterministic fingerprint of the contract contents.
+ * Used in replay envelopes so runs can be tied back to a specific contract version.
+ */
+function fingerprintGraph(input) {
+    // Canonicalise: stable key order, no insignificant whitespace.
+    const canonical = canonicalStringify({
+        layers: input.layers,
+        modules: input.modules,
+        trustBoundaries: input.trustBoundaries,
+        allowedEdges: input.allowedEdges,
+        forbiddenEdges: input.forbiddenEdges,
+    });
+    return `sha256:${(0, crypto_1.createHash)('sha256').update(canonical).digest('hex')}`;
+}
+/** JSON.stringify with deterministic key ordering. */
+function canonicalStringify(value) {
+    if (value === null)
+        return 'null';
+    if (typeof value !== 'object')
+        return JSON.stringify(value);
+    if (Array.isArray(value)) {
+        return `[${value.map(canonicalStringify).join(',')}]`;
+    }
+    const keys = Object.keys(value).sort();
+    const parts = keys.map((k) => `${JSON.stringify(k)}:${canonicalStringify(value[k])}`);
+    return `{${parts.join(',')}}`;
+}
+//# sourceMappingURL=intent-contract.js.map

package/dist/governance/intent/intent-contract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent-contract.js","sourceRoot":"","sources":["../../../src/governance/intent/intent-contract.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;;;AAwCH,8DAKC;AAgBD,gDA6CC;AAMD,0DAEC;AAhHD,2BAA8C;AAC9C,+BAAqC;AACrC,mCAAoC;AACpC,iDAQwB;AAExB,gFAAgF;AAEnE,QAAA,wBAAwB,GAAG,aAAa,CAAC;AACzC,QAAA,6BAA6B,GAAG,aAAa,gCAAwB,EAAE,CAAC;AAiBrF,gFAAgF;AAEhF;;GAEG;AACH,SAAgB,yBAAyB,CAAC,WAAmB,EAAE,QAAiB;IAC9E,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,IAAA,cAAO,EAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,IAAA,WAAI,EAAC,WAAW,EAAE,WAAW,EAAE,gCAAwB,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,kBAAkB,CAChC,WAAmB,EACnB,QAAiB;IAEjB,MAAM,YAAY,GAAG,yBAAyB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAEtE,IAAI,CAAC,IAAA,eAAU,EAAC,YAAY,CAAC,EAAE,CAAC;QAC9B,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,iCAAkB;YACzB,MAAM,EAAE,EAAE;YACV,QAAQ,EAAE,EAAE;SACb,CAAC;IACJ,CAAC;IAED,IAAI,GAAW,CAAC;IAChB,IAAI,CAAC;QACH,GAAG,GAAG,IAAA,iBAAY,EAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7D,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,iCAAkB;YACzB,MAAM,EAAE,CAAC,mCAAmC,GAAG,EAAE,CAAC;YAClD,QAAQ,EAAE,EAAE;SACb,CAAC;IACJ,CAAC;IAED,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7D,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,iCAAkB;YACzB,MAAM,EAAE,CAAC,oCAAoC,GAAG,EAAE,CAAC;YACnD,QAAQ,EAAE,EAAE;SACb,CAAC;IACJ,CAAC;IAED,OAAO,qBAAqB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,SAAgB,uBAAuB,CAAC,GAAY;IAClD,OAAO,qBAAqB,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;AAChD,CAAC;AAED,gFAAgF;AAEhF,SAAS,qBAAqB,CAAC,GAAY,EAAE,UAAkB;IAC7D,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC5C,OAAO;YACL,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,iCAAkB;YACzB,MAAM,EAAE,CAAC,uCAAuC,CAAC;YACjD,QAAQ,EAAE,EAAE;SACb,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,GAA8B,CAAC;IAE3C,iBAAiB;IACjB,MAAM,aAAa,GAAG,GAAG,CAAC,aAAa,CAAC;IACxC,IAAI,aAAa,KAAK,0CAA2B,EAAE,CAAC;QAClD,MAAM,CAAC,IAAI,CACT,uCAAuC,0CAA2B,SAAS,IAAI,CAAC,SAAS,CACvF,aAAa,CACd,EAAE,CACJ,CAAC;IACJ,CAAC;IAED,iEAAiE;IACjE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC;QAC3B,eAAe;QACf,QAAQ;QACR,SAAS;QACT,iBAAiB;QACjB,cAAc;QACd,gBAAgB;KACjB,CAAC,CAAC;IACH,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,4BAA4B,GAAG,EAAE,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACrD,MAAM,eAAe,GAAG,uBAAuB,CAAC,GAAG,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC;IAC7E,MAAM,YAAY,GAAG,aAAa,CAAC,cAAc,EAAE,GAAG,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACrF,MAAM,cAAc,GAAG,aAAa,CAAC,gBAAgB,EAAE,GAAG,CAAC,cAAc,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAE3F,uCAAuC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,EAAE,4DAA4D,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,OAAO;YACL,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,iCAAkB;YACzB,MAAM;YACN,QAAQ;SACT,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAgB;QACzB,aAAa,EAAE,0CAA2B;QAC1C,MAAM;QACN,OAAO;QACP,eAAe;QACf,YAAY;QACZ,cAAc;QACd,WAAW,EAAE,gBAAgB,CAAC;YAC5B,MAAM;YACN,OAAO;YACP,eAAe;YACf,YAAY;YACZ,cAAc;SACf,CAAC;KACH,CAAC;IAEF,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,IAAI;QACZ,KAAK;QACL,MAAM,EAAE,EAAE;QACV,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,KAAc,EAAE,MAAgB;IACtD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QACzC,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAChD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,qBAAqB,CAAC,CAAC;YAC9C,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,KAAgC,CAAC;QAC7C,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC;QAClB,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,iCAAiC,CAAC,CAAC;YAC1D,SAAS;QACX,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAC;YACtD,SAAS;QACX,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;YACtE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,oCAAoC,CAAC,CAAC;YAC7D,SAAS;QACX,CAAC;QACD,MAAM,WAAW,GAAG,OAAO,GAAG,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QACtF,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,IAAgB,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CAAC,KAAc,EAAE,MAAgB;IACvD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QAC1C,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,qBAAqB,CAAC,CAAC;YAC/C,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC;QAClB,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,iCAAiC,CAAC,CAAC;YAC3D,SAAS;QACX,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAC;YACvD,SAAS;QACX,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;YACtE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,oCAAoC,CAAC,CAAC;YAC9D,SAAS;QACX,CAAC;QACD,IAAI,SAA+B,CAAC;QACpC,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;gBACxF,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,yCAAyC,CAAC,CAAC;gBACnE,SAAS;YACX,CAAC;YACD,SAAS,GAAG,GAAG,CAAC,SAAqB,CAAC;QACxC,CAAC;QACD,MAAM,WAAW,GAAG,OAAO,GAAG,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QACtF,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,IAAgB,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,uBAAuB,CAAC,KAAc,EAAE,MAAgB;IAC/D,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;QAClD,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,GAAG,GAA0B,EAAE,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,cAAc,EAAE,eAAe,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,EAAE,KAAK,IAAI,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,qBAAqB,CAAC,CAAC;YACvD,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,EAA6B,CAAC;QAC1C,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC;QAClB,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,iCAAiC,CAAC,CAAC;YACnE,SAAS;QACX,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAC;YAC/D,SAAS;QACX,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,MAAM,WAAW,GAAG,GAAG,CAAC,WAAW,CAAC;QACpC,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChE,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,0CAA0C,CAAC,CAAC;YAC5E,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;YAClF,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,0CAA0C,CAAC,CAAC;YAC5E,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/D,MAAM,CAAC,IAAI,CACT,mBAAmB,CAAC,8BAA8B,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAChF,CAAC;YACF,SAAS;QACX,CAAC;QACD,GAAG,CAAC,IAAI,CAAC;YACP,EAAE;YACF,WAAW;YACX,UAAU,EAAE,UAAsB;YAClC,QAAQ,EAAE,QAA2C;SACtD,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,aAAa,CACpB,SAA4C,EAC5C,KAAc,EACd,MAAgB,EAChB,MAAqB;IAErB,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,IAAI,SAAS,oBAAoB,CAAC,CAAC;QAC/C,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,IAAI,CAAC,qBAAqB,CAAC,CAAC;YACpD,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;QACtB,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC;QAClB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,IAAI,CAAC,mCAAmC,CAAC,CAAC;YAClE,SAAS;QACX,CAAC;QACD,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,IAAI,CAAC,iCAAiC,CAAC,CAAC;YAChE,SAAS;QACX,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,IAAI,CAAC,WAAW,IAAI,4BAA4B,CAAC,CAAC;YAC1E,SAAS;QACX,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,IAAI,CAAC,SAAS,EAAE,4BAA4B,CAAC,CAAC;YACtE,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QACvE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,SAAS,gBAAgB,CAAC,KAMzB;IACC,+DAA+D;IAC/D,MAAM,SAAS,GAAG,kBAAkB,CAAC;QACnC,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,eAAe,EAAE,KAAK,CAAC,eAAe;QACtC,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,cAAc,EAAE,KAAK,CAAC,cAAc;KACrC,CAAC,CAAC;IACH,OAAO,UAAU,IAAA,mBAAU,EAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;AAC1E,CAAC;AAED,sDAAsD;AACtD,SAAS,kBAAkB,CAAC,KAAc;IACxC,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAClC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACxD,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC,CAAC,IAAI,EAAE,CAAC;IAClE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAE,KAAiC,CAAC,CAAC,CAAC,CAAC,EAAE,CAC3F,CAAC;IACF,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAChC,CAAC"}

package/dist/governance/intent/intent-graph.d.ts

@@ -0,0 +1,135 @@
+/**
+ * Intent Graph — typed model for architectural intent.
+ *
+ * The Intent Graph is the foundational data structure for Intent-Aware Governance
+ * Intelligence. It represents the *intended* architecture of a codebase as a
+ * declarative, machine-verifiable artifact, distinct from:
+ *
+ *   - Plan contracts (`expectedFiles`)        — per-change file expectations
+ *   - Change contracts                        — diff-vs-plan enforcement
+ *   - Intent engine (`runIntentEngine`)       — NL prompt → code coverage matcher
+ *   - Structural rules                        — code-pattern violations (SR001 ...)
+ *
+ * What the Intent Graph adds: a stable, declarative model of *which parts of the
+ * codebase are allowed to depend on which other parts*. Layers, modules, trust
+ * boundaries, and directional dependency rules are first-class nodes/edges.
+ *
+ * Phase 1 scope (this file):
+ *   - Typed primitives only.
+ *   - No runtime computation, no I/O, no validation.
+ *   - Used as the shared vocabulary across intent-contract.ts (loading),
+ *     drift-detector.ts (analysis), and verify.ts (reporting).
+ *
+ * Intelligence classification: DETERMINISTIC (pure types).
+ */
+/** Current schema version. Bumped only with a breaking-change migration plan. */
+export declare const INTENT_GRAPH_SCHEMA_VERSION: 1;
+/**
+ * A named architectural layer. Layers are the primary organising concept:
+ * "controller", "service", "persistence", "infrastructure", etc.
+ *
+ * Layer membership is determined by `glob` patterns matched against
+ * project-relative file paths. Order across the contract's `layers` array
+ * matters: when a file matches multiple layers, the first wins. This makes
+ * the classification deterministic and human-debuggable.
+ */
+export interface IntentLayer {
+    /** Stable identifier referenced by edges. Lowercase, snake_case recommended. */
+    id: string;
+    /** Optional human description shown in drift reports. */
+    description?: string;
+    /**
+     * Glob patterns matched against project-relative paths.
+     * Syntax: `**`, `*`, `?` (see glob-match.ts).
+     */
+    glob: string[];
+}
+/**
+ * A logical module (a bounded subsystem). Modules cut orthogonally to layers:
+ * a "billing" module may span controller, service, and persistence layers.
+ *
+ * Optional `entryGlob` declares the public surface — files outside the module
+ * may only reach the module by importing from one of these entry files.
+ * (Enforcement of the entry rule is opt-in via the contract `enforceModuleEntries`.)
+ */
+export interface IntentModule {
+    id: string;
+    description?: string;
+    glob: string[];
+    /** When set, only these files may be imported from outside the module. */
+    entryGlob?: string[];
+}
+/**
+ * A trust boundary describes a *directional flow rule* across a security
+ * or organisational seam (e.g. tenant isolation, encryption zone, third-party
+ * API surface).
+ *
+ * Phase 1: trust boundary detection emits ADVISORY findings only. Promotion to
+ * blocking requires explicit per-boundary opt-in via a future schema field.
+ */
+export interface IntentTrustBoundary {
+    id: string;
+    description: string;
+    /** Files considered "inside" the boundary. */
+    insideGlob: string[];
+    /**
+     * Flow rule:
+     *   - `inbound_only`     — external code may call in; internal code must not call out.
+     *   - `outbound_only`    — internal code may call out; external code must not call in.
+     *   - `requires_review`  — any cross-boundary edge surfaces an advisory for review.
+     */
+    edgeRule: 'inbound_only' | 'outbound_only' | 'requires_review';
+}
+/**
+ * A directed allowed-or-forbidden dependency edge between two layers.
+ *
+ * The graph uses an *explicit-allow + explicit-forbid* model:
+ *   - If `allowedEdges` is non-empty, ONLY edges in that list are permitted.
+ *   - `forbiddenEdges` always blocks regardless of `allowedEdges`.
+ *
+ * When both lists are empty, the contract is in **observation mode**: drift
+ * detection runs but produces no violations. This makes the contract safe to
+ * adopt incrementally.
+ */
+export interface IntentEdge {
+    from: string;
+    to: string;
+    reason?: string;
+}
+/**
+ * The complete typed graph. This is the in-memory form produced by
+ * `loadIntentContract` and consumed by `runDriftDetection`.
+ *
+ * The graph is **derived data** — it is built from a declarative contract
+ * artifact (intent.json) by the loader. Callers do not construct it directly.
+ */
+export interface IntentGraph {
+    schemaVersion: typeof INTENT_GRAPH_SCHEMA_VERSION;
+    layers: IntentLayer[];
+    modules: IntentModule[];
+    trustBoundaries: IntentTrustBoundary[];
+    allowedEdges: IntentEdge[];
+    forbiddenEdges: IntentEdge[];
+    /**
+     * Stable fingerprint of the graph contents (SHA-256 over canonicalised JSON).
+     * Used in replay envelopes so a verify run records *which* intent graph it ran against.
+     */
+    fingerprint: string;
+}
+/**
+ * A canonical empty graph. Used when no intent contract is configured — drift
+ * detection short-circuits to "no violations" deterministically.
+ */
+export declare const EMPTY_INTENT_GRAPH: IntentGraph;
+/**
+ * Return true when the graph defines *no* layers/modules/boundaries/edges.
+ * Drift detection skips entirely when this is true.
+ */
+export declare function isEmptyIntentGraph(graph: IntentGraph): boolean;
+/**
+ * Returns true if the graph has at least one rule that can produce a drift
+ * finding. A graph with only layers but no edges is "in observation mode" —
+ * it can classify files but not flag violations.
+ */
+export declare function intentGraphHasEnforcement(graph: IntentGraph): boolean;
+//# sourceMappingURL=intent-graph.d.ts.map

package/dist/governance/intent/intent-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent-graph.d.ts","sourceRoot":"","sources":["../../../src/governance/intent/intent-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,iFAAiF;AACjF,eAAO,MAAM,2BAA2B,EAAG,CAAU,CAAC;AAItD;;;;;;;;GAQG;AACH,MAAM,WAAW,WAAW;IAC1B,gFAAgF;IAChF,EAAE,EAAE,MAAM,CAAC;IACX,yDAAyD;IACzD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAID;;;;;;;GAOG;AACH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,0EAA0E;IAC1E,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAID;;;;;;;GAOG;AACH,MAAM,WAAW,mBAAmB;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,8CAA8C;IAC9C,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB;;;;;OAKG;IACH,QAAQ,EAAE,cAAc,GAAG,eAAe,GAAG,iBAAiB,CAAC;CAChE;AAID;;;;;;;;;;GAUG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAID;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,aAAa,EAAE,OAAO,2BAA2B,CAAC;IAClD,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,eAAe,EAAE,mBAAmB,EAAE,CAAC;IACvC,YAAY,EAAE,UAAU,EAAE,CAAC;IAC3B,cAAc,EAAE,UAAU,EAAE,CAAC;IAC7B;;;OAGG;IACH,WAAW,EAAE,MAAM,CAAC;CACrB;AAID;;;GAGG;AACH,eAAO,MAAM,kBAAkB,EAAE,WAQhB,CAAC;AAIlB;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAQ9D;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAErE"}

package/dist/governance/intent/intent-graph.js

@@ -0,0 +1,67 @@
+"use strict";
+/**
+ * Intent Graph — typed model for architectural intent.
+ *
+ * The Intent Graph is the foundational data structure for Intent-Aware Governance
+ * Intelligence. It represents the *intended* architecture of a codebase as a
+ * declarative, machine-verifiable artifact, distinct from:
+ *
+ *   - Plan contracts (`expectedFiles`)        — per-change file expectations
+ *   - Change contracts                        — diff-vs-plan enforcement
+ *   - Intent engine (`runIntentEngine`)       — NL prompt → code coverage matcher
+ *   - Structural rules                        — code-pattern violations (SR001 ...)
+ *
+ * What the Intent Graph adds: a stable, declarative model of *which parts of the
+ * codebase are allowed to depend on which other parts*. Layers, modules, trust
+ * boundaries, and directional dependency rules are first-class nodes/edges.
+ *
+ * Phase 1 scope (this file):
+ *   - Typed primitives only.
+ *   - No runtime computation, no I/O, no validation.
+ *   - Used as the shared vocabulary across intent-contract.ts (loading),
+ *     drift-detector.ts (analysis), and verify.ts (reporting).
+ *
+ * Intelligence classification: DETERMINISTIC (pure types).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EMPTY_INTENT_GRAPH = exports.INTENT_GRAPH_SCHEMA_VERSION = void 0;
+exports.isEmptyIntentGraph = isEmptyIntentGraph;
+exports.intentGraphHasEnforcement = intentGraphHasEnforcement;
+// ── Schema version ───────────────────────────────────────────────────────────
+/** Current schema version. Bumped only with a breaking-change migration plan. */
+exports.INTENT_GRAPH_SCHEMA_VERSION = 1;
+// ── Empty graph ──────────────────────────────────────────────────────────────
+/**
+ * A canonical empty graph. Used when no intent contract is configured — drift
+ * detection short-circuits to "no violations" deterministically.
+ */
+exports.EMPTY_INTENT_GRAPH = Object.freeze({
+    schemaVersion: exports.INTENT_GRAPH_SCHEMA_VERSION,
+    layers: [],
+    modules: [],
+    trustBoundaries: [],
+    allowedEdges: [],
+    forbiddenEdges: [],
+    fingerprint: 'empty:0',
+});
+// ── Predicates ───────────────────────────────────────────────────────────────
+/**
+ * Return true when the graph defines *no* layers/modules/boundaries/edges.
+ * Drift detection skips entirely when this is true.
+ */
+function isEmptyIntentGraph(graph) {
+    return (graph.layers.length === 0 &&
+        graph.modules.length === 0 &&
+        graph.trustBoundaries.length === 0 &&
+        graph.allowedEdges.length === 0 &&
+        graph.forbiddenEdges.length === 0);
+}
+/**
+ * Returns true if the graph has at least one rule that can produce a drift
+ * finding. A graph with only layers but no edges is "in observation mode" —
+ * it can classify files but not flag violations.
+ */
+function intentGraphHasEnforcement(graph) {
+    return graph.allowedEdges.length > 0 || graph.forbiddenEdges.length > 0;
+}
+//# sourceMappingURL=intent-graph.js.map

package/dist/governance/intent/intent-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent-graph.js","sourceRoot":"","sources":["../../../src/governance/intent/intent-graph.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;;;AAwIH,gDAQC;AAOD,8DAEC;AAvJD,gFAAgF;AAEhF,iFAAiF;AACpE,QAAA,2BAA2B,GAAG,CAAU,CAAC;AA6GtD,gFAAgF;AAEhF;;;GAGG;AACU,QAAA,kBAAkB,GAAgB,MAAM,CAAC,MAAM,CAAC;IAC3D,aAAa,EAAE,mCAA2B;IAC1C,MAAM,EAAE,EAAE;IACV,OAAO,EAAE,EAAE;IACX,eAAe,EAAE,EAAE;IACnB,YAAY,EAAE,EAAE;IAChB,cAAc,EAAE,EAAE;IAClB,WAAW,EAAE,SAAS;CACvB,CAAgB,CAAC;AAElB,gFAAgF;AAEhF;;;GAGG;AACH,SAAgB,kBAAkB,CAAC,KAAkB;IACnD,OAAO,CACL,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QACzB,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAC1B,KAAK,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC;QAClC,KAAK,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;QAC/B,KAAK,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAClC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAgB,yBAAyB,CAAC,KAAkB;IAC1D,OAAO,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;AAC1E,CAAC"}