@productbrain/cli 0.1.0-beta.9 → 0.1.0-beta.90

package/dist/generators/chain-classifier.js

@@ -0,0 +1,180 @@
+/**
+ * Chain Classifier — BET-286 Slice 1
+ *
+ * Pure function that maps governance entries (from getGovernanceWithRelations)
+ * to the governance function each entry serves. No LLM, no network calls.
+ * Deterministic: same input always produces same output.
+ *
+ * Chain: BET-286 (Chain-Derived Agent Configuration)
+ */
+/** Base score awarded for a collection-type match. */
+const COLLECTION_BASE_SCORE = 0.45;
+/** Score boost for a supporting relation type match. */
+const RELATION_BOOST = 0.2;
+/** Score boost for a supporting name pattern match. */
+const NAME_BOOST = 0.15;
+/** Map collection slug → primary governance function. */
+const COLLECTION_TO_FUNCTION = {
+    'standards': 'constraint',
+    'business-rules': 'constraint',
+    'architecture': 'boundary',
+    'decisions': 'convention',
+    'patterns': 'convention',
+    'policies': 'policy',
+    'flows': 'workflow',
+    'glossary': 'unclassified',
+};
+/**
+ * Relation-type signals that boost a governance function.
+ * Key: relation type string (lowercased).
+ * Value: [governanceFunction, boost].
+ */
+const RELATION_SIGNALS = [
+    { type: 'constrains', fn: 'constraint', boost: RELATION_BOOST },
+    { type: 'governs', fn: 'policy', boost: RELATION_BOOST },
+    { type: 'part_of', fn: 'workflow', boost: RELATION_BOOST },
+];
+/** Relation signals based on the collection of the *other* entry. */
+const RELATION_COLLECTION_SIGNALS = [
+    // informed_by an architecture entry → boost boundary
+    { otherCollectionSlug: 'architecture', relationType: 'informed_by', fn: 'boundary', boost: RELATION_BOOST },
+];
+/**
+ * Name keyword signals — applied against the lowercased entry name.
+ * Matched signals are applied once per matching keyword group.
+ */
+const NAME_SIGNALS = [
+    {
+        keywords: ['auth', 'security', 'permission'],
+        fn: 'policy',
+        boost: NAME_BOOST,
+        label: 'name contains security/auth/permission keyword',
+    },
+    {
+        keywords: ['test', 'quality', 'check', 'gate'],
+        fn: 'quality-gate',
+        boost: NAME_BOOST,
+        label: 'name contains test/quality/check/gate keyword',
+    },
+    {
+        keywords: ['deploy', 'release', 'rollback'],
+        fn: 'convention',
+        boost: NAME_BOOST,
+        label: 'name contains deploy/release/rollback keyword',
+    },
+    {
+        keywords: ['domain', 'boundary', 'layer', 'architecture'],
+        fn: 'boundary',
+        boost: NAME_BOOST,
+        label: 'name contains domain/boundary/layer/architecture keyword',
+    },
+    {
+        keywords: ['flag', 'feature flag'],
+        fn: 'convention',
+        boost: NAME_BOOST,
+        label: 'name contains flag/feature flag keyword',
+    },
+];
+/**
+ * Secondary collection overrides — for collections that can produce multiple
+ * governance functions depending on relation/name context. When a secondary
+ * function score exceeds this threshold, it may win over the primary collection
+ * signal if its total score is higher.
+ *
+ * `standards` can produce `quality-gate` in addition to `constraint`.
+ * `business-rules` can produce `policy` in addition to `constraint`.
+ * `decisions` can produce `boundary` in addition to `convention`.
+ */
+const SECONDARY_COLLECTION_SIGNALS = {
+    'standards': 'quality-gate',
+    'business-rules': 'policy',
+    'decisions': 'boundary',
+};
+// ── Classifier ────────────────────────────────────────────────────────
+/**
+ * Classify a batch of governance entries, returning one ClassifiedGovernance
+ * per entry that has a non-null entryId. Entries with null entryId are silently
+ * excluded (safety guard — entries without IDs cannot be referenced by archetypes).
+ */
+export function classifyGovernance(entries) {
+    const results = [];
+    for (const entry of entries) {
+        // Safety: skip entries without a human-readable ID
+        if (entry.entryId === null)
+            continue;
+        const scores = new Map();
+        const signals = [];
+        const nameLower = entry.name.toLowerCase();
+        const slug = entry.collectionSlug;
+        // ── Signal 1: Collection type (strongest) ──────────────────────
+        const primaryFn = COLLECTION_TO_FUNCTION[slug];
+        if (primaryFn && primaryFn !== 'unclassified') {
+            addScore(scores, primaryFn, COLLECTION_BASE_SCORE);
+            signals.push(`collection '${slug}' → ${primaryFn}`);
+        }
+        // Secondary collection function — seed with a lower base so it can win
+        // only when relation/name signals push it above the primary.
+        const secondaryFn = SECONDARY_COLLECTION_SIGNALS[slug];
+        if (secondaryFn) {
+            addScore(scores, secondaryFn, COLLECTION_BASE_SCORE - 0.1);
+            signals.push(`collection '${slug}' secondary → ${secondaryFn}`);
+        }
+        // ── Signal 2: Relation types (refining) ───────────────────────
+        for (const rel of entry.relations) {
+            const relTypeLower = rel.type.toLowerCase();
+            for (const sig of RELATION_SIGNALS) {
+                if (relTypeLower === sig.type) {
+                    addScore(scores, sig.fn, sig.boost);
+                    signals.push(`relation '${rel.type}' → boost ${sig.fn}`);
+                }
+            }
+            for (const sig of RELATION_COLLECTION_SIGNALS) {
+                if (relTypeLower === sig.relationType &&
+                    rel.otherCollectionSlug === sig.otherCollectionSlug) {
+                    addScore(scores, sig.fn, sig.boost);
+                    signals.push(`relation '${rel.type}' to ${sig.otherCollectionSlug} → boost ${sig.fn}`);
+                }
+            }
+        }
+        // ── Signal 3: Name patterns (weakest) ─────────────────────────
+        for (const sig of NAME_SIGNALS) {
+            const matched = sig.keywords.some((kw) => nameLower.includes(kw));
+            if (matched) {
+                addScore(scores, sig.fn, sig.boost);
+                signals.push(sig.label);
+            }
+        }
+        // ── Pick winner ───────────────────────────────────────────────
+        let bestFn = 'unclassified';
+        let bestScore = 0;
+        for (const [fn, score] of scores) {
+            if (score > bestScore) {
+                bestScore = score;
+                bestFn = fn;
+            }
+        }
+        // Glossary is always unclassified regardless of score
+        if (slug === 'glossary') {
+            bestFn = 'unclassified';
+            bestScore = 0;
+        }
+        // Confidence: clamp to [0, 1]
+        const confidence = Math.min(1, Math.max(0, bestScore));
+        results.push({
+            entryId: entry.entryId,
+            name: entry.name,
+            collectionSlug: entry.collectionSlug,
+            governanceFunction: bestFn,
+            confidence,
+            matchedSignals: signals,
+            data: entry.data,
+            relations: entry.relations,
+        });
+    }
+    return results;
+}
+// ── Helpers ────────────────────────────────────────────────────────────
+function addScore(scores, fn, delta) {
+    scores.set(fn, (scores.get(fn) ?? 0) + delta);
+}
+//# sourceMappingURL=chain-classifier.js.map

package/dist/generators/chain-classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-classifier.js","sourceRoot":"","sources":["../../src/generators/chain-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAqDH,sDAAsD;AACtD,MAAM,qBAAqB,GAAG,IAAI,CAAC;AACnC,wDAAwD;AACxD,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,uDAAuD;AACvD,MAAM,UAAU,GAAG,IAAI,CAAC;AAExB,yDAAyD;AACzD,MAAM,sBAAsB,GAAuC;IACjE,WAAW,EAAE,YAAY;IACzB,gBAAgB,EAAE,YAAY;IAC9B,cAAc,EAAE,UAAU;IAC1B,WAAW,EAAE,YAAY;IACzB,UAAU,EAAE,YAAY;IACxB,UAAU,EAAE,QAAQ;IACpB,OAAO,EAAE,UAAU;IACnB,UAAU,EAAE,cAAc;CAC3B,CAAC;AAEF;;;;GAIG;AACH,MAAM,gBAAgB,GAAmE;IACvF,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,cAAc,EAAE;IAC/D,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE;IACxD,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE;CAC3D,CAAC;AAEF,qEAAqE;AACrE,MAAM,2BAA2B,GAK5B;IACH,qDAAqD;IACrD,EAAE,mBAAmB,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE;CAC5G,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAwF;IACxG;QACE,QAAQ,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC;QAC5C,EAAE,EAAE,QAAQ;QACZ,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,gDAAgD;KACxD;IACD;QACE,QAAQ,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC;QAC9C,EAAE,EAAE,cAAc;QAClB,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,+CAA+C;KACvD;IACD;QACE,QAAQ,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC;QAC3C,EAAE,EAAE,YAAY;QAChB,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,+CAA+C;KACvD;IACD;QACE,QAAQ,EAAE,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,CAAC;QACzD,EAAE,EAAE,UAAU;QACd,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,0DAA0D;KAClE;IACD;QACE,QAAQ,EAAE,CAAC,MAAM,EAAE,cAAc,CAAC;QAClC,EAAE,EAAE,YAAY;QAChB,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,yCAAyC;KACjD;CACF,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,4BAA4B,GAAuC;IACvE,WAAW,EAAE,cAAc;IAC3B,gBAAgB,EAAE,QAAQ;IAC1B,WAAW,EAAE,UAAU;CACxB,CAAC;AAEF,yEAAyE;AAEzE;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAA+B;IAChE,MAAM,OAAO,GAA2B,EAAE,CAAC;IAE3C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,mDAAmD;QACnD,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI;YAAE,SAAS;QAErC,MAAM,MAAM,GAAa,IAAI,GAAG,EAAE,CAAC;QACnC,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAElC,kEAAkE;QAClE,MAAM,SAAS,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,SAAS,IAAI,SAAS,KAAK,cAAc,EAAE,CAAC;YAC9C,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,qBAAqB,CAAC,CAAC;YACnD,OAAO,CAAC,IAAI,CAAC,eAAe,IAAI,OAAO,SAAS,EAAE,CAAC,CAAC;QACtD,CAAC;QAED,uEAAuE;QACvE,6DAA6D;QAC7D,MAAM,WAAW,GAAG,4BAA4B,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,WAAW,EAAE,CAAC;YAChB,QAAQ,CAAC,MAAM,EAAE,WAAW,EAAE,qBAAqB,GAAG,GAAG,CAAC,CAAC;YAC3D,OAAO,CAAC,IAAI,CAAC,eAAe,IAAI,iBAAiB,WAAW,EAAE,CAAC,CAAC;QAClE,CAAC;QAED,iEAAiE;QACjE,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YAClC,MAAM,YAAY,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAE5C,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBACnC,IAAI,YAAY,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;oBAC9B,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;oBACpC,OAAO,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,IAAI,aAAa,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;YAED,KAAK,MAAM,GAAG,IAAI,2BAA2B,EAAE,CAAC;gBAC9C,IACE,YAAY,KAAK,GAAG,CAAC,YAAY;oBACjC,GAAG,CAAC,mBAAmB,KAAK,GAAG,CAAC,mBAAmB,EACnD,CAAC;oBACD,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;oBACpC,OAAO,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,mBAAmB,YAAY,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBACzF,CAAC;YACH,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAClE,IAAI,OAAO,EAAE,CAAC;gBACZ,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;gBACpC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,IAAI,MAAM,GAAuB,cAAc,CAAC;QAChD,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,SAAS,GAAG,KAAK,CAAC;gBAClB,MAAM,GAAG,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;YACxB,MAAM,GAAG,cAAc,CAAC;YACxB,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;QAED,8BAA8B;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QAEvD,OAAO,CAAC,IAAI,CAAC;YACX,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,kBAAkB,EAAE,MAAM;YAC1B,UAAU;YACV,cAAc,EAAE,OAAO;YACvB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,KAAK,CAAC,SAAS;SAC3B,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,0EAA0E;AAE1E,SAAS,QAAQ,CAAC,MAAgB,EAAE,EAAsB,EAAE,KAAa;IACvE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AAChD,CAAC"}

package/dist/generators/chain-classifier.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=chain-classifier.test.d.ts.map

package/dist/generators/chain-classifier.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-classifier.test.d.ts","sourceRoot":"","sources":["../../src/generators/chain-classifier.test.ts"],"names":[],"mappings":""}

package/dist/generators/chain-classifier.test.js

@@ -0,0 +1,257 @@
+/**
+ * chain-classifier — unit tests.
+ * BET-286 Slice 1: relation-aware governance function classifier.
+ */
+import { describe, expect, it } from 'vitest';
+import { classifyGovernance, } from './chain-classifier.js';
+// ── Helpers ────────────────────────────────────────────────────────────
+function makeEntry(overrides) {
+    return {
+        status: 'committed',
+        verificationStatus: null,
+        data: null,
+        relations: [],
+        ...overrides,
+    };
+}
+function makeRelation(overrides) {
+    return {
+        direction: 'outgoing',
+        otherEntryId: null,
+        otherName: 'other entry',
+        otherCollectionSlug: null,
+        ...overrides,
+    };
+}
+// ── Test cases ─────────────────────────────────────────────────────────
+describe('classifyGovernance — collection signal', () => {
+    it('STD entry with constrains relation → constraint with high confidence (>=0.6)', () => {
+        const entry = makeEntry({
+            entryId: 'STD-1',
+            name: 'Trunk-based development standard',
+            collectionSlug: 'standards',
+            relations: [makeRelation({ type: 'constrains', otherCollectionSlug: 'bets' })],
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(1);
+        expect(results[0].governanceFunction).toBe('constraint');
+        expect(results[0].confidence).toBeGreaterThanOrEqual(0.6);
+    });
+    it('ARCH entry → boundary with medium confidence (>=0.4)', () => {
+        const entry = makeEntry({
+            entryId: 'ARCH-1',
+            name: 'Seven system domains',
+            collectionSlug: 'architecture',
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(1);
+        expect(results[0].governanceFunction).toBe('boundary');
+        expect(results[0].confidence).toBeGreaterThanOrEqual(0.4);
+    });
+    it('DEC entry with deployment in name → convention with boosted confidence', () => {
+        const entry = makeEntry({
+            entryId: 'DEC-1',
+            name: 'deployment ordering for Convex and Railway',
+            collectionSlug: 'decisions',
+        });
+        const noNameEntry = makeEntry({
+            entryId: 'DEC-2',
+            name: 'some decision',
+            collectionSlug: 'decisions',
+        });
+        const withName = classifyGovernance([entry]);
+        const withoutName = classifyGovernance([noNameEntry]);
+        expect(withName[0].governanceFunction).toBe('convention');
+        expect(withName[0].confidence).toBeGreaterThan(withoutName[0].confidence);
+    });
+    it('FLOW entry → workflow', () => {
+        const entry = makeEntry({
+            entryId: 'FLOW-1',
+            name: 'Feature flag lifecycle flow',
+            collectionSlug: 'flows',
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(1);
+        expect(results[0].governanceFunction).toBe('workflow');
+    });
+    it('POL entry with governs relation → policy with high confidence', () => {
+        const entry = makeEntry({
+            entryId: 'POL-1',
+            name: 'Access control policy',
+            collectionSlug: 'policies',
+            relations: [makeRelation({ type: 'governs', otherCollectionSlug: 'bets' })],
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(1);
+        expect(results[0].governanceFunction).toBe('policy');
+        expect(results[0].confidence).toBeGreaterThanOrEqual(0.6);
+    });
+    it('STD entry with test in name → quality-gate with boosted confidence', () => {
+        const entry = makeEntry({
+            entryId: 'STD-2',
+            name: 'Test coverage quality gate for all slices',
+            collectionSlug: 'standards',
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(1);
+        expect(results[0].governanceFunction).toBe('quality-gate');
+        expect(results[0].confidence).toBeGreaterThanOrEqual(0.5);
+    });
+});
+describe('classifyGovernance — null entryId safety', () => {
+    it('entry with null entryId is excluded from output', () => {
+        const entry = makeEntry({
+            entryId: null,
+            name: 'Draft entry without ID',
+            collectionSlug: 'standards',
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(0);
+    });
+});
+describe('classifyGovernance — empty input', () => {
+    it('empty input → empty output', () => {
+        const results = classifyGovernance([]);
+        expect(results).toHaveLength(0);
+    });
+});
+describe('classifyGovernance — unclassified', () => {
+    it('glossary entry → unclassified regardless of signals', () => {
+        const entry = makeEntry({
+            entryId: 'GLO-1',
+            name: 'Trunk-based development',
+            collectionSlug: 'glossary',
+            relations: [makeRelation({ type: 'constrains' })],
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(1);
+        expect(results[0].governanceFunction).toBe('unclassified');
+        expect(results[0].confidence).toBe(0);
+    });
+});
+describe('classifyGovernance — multiple signal matches', () => {
+    it('entry with multiple signals → highest confidence function wins', () => {
+        // BR entry with both constrains AND governs relations.
+        // constrains boosts 'constraint', governs boosts 'policy'.
+        // business-rules base maps to 'constraint', so constraint should win.
+        const entry = makeEntry({
+            entryId: 'BR-1',
+            name: 'Entry creation must use createEntry gate',
+            collectionSlug: 'business-rules',
+            relations: [
+                makeRelation({ type: 'constrains' }),
+                makeRelation({ type: 'constrains' }),
+                makeRelation({ type: 'governs' }),
+            ],
+        });
+        const results = classifyGovernance([entry]);
+        expect(results).toHaveLength(1);
+        // Both constraint and policy are plausible; the function with the highest score wins.
+        // With 2x constrains boosts, constraint should dominate.
+        expect(results[0].governanceFunction).toBe('constraint');
+        expect(results[0].confidence).toBeGreaterThanOrEqual(0.6);
+    });
+});
+describe('classifyGovernance — passthrough fields', () => {
+    it('passes data and relations through to result', () => {
+        const data = { someField: 'someValue' };
+        const relation = makeRelation({ type: 'constrains' });
+        const entry = makeEntry({
+            entryId: 'STD-99',
+            name: 'Some standard',
+            collectionSlug: 'standards',
+            data,
+            relations: [relation],
+        });
+        const results = classifyGovernance([entry]);
+        expect(results[0].data).toBe(data);
+        expect(results[0].relations).toEqual([relation]);
+    });
+    it('returns entryId, name, and collectionSlug unchanged', () => {
+        const entry = makeEntry({
+            entryId: 'ARCH-42',
+            name: 'My architecture entry',
+            collectionSlug: 'architecture',
+        });
+        const results = classifyGovernance([entry]);
+        expect(results[0].entryId).toBe('ARCH-42');
+        expect(results[0].name).toBe('My architecture entry');
+        expect(results[0].collectionSlug).toBe('architecture');
+    });
+});
+describe('classifyGovernance — name signal boosts', () => {
+    it('security keyword boosts policy for business-rules collection', () => {
+        const withKeyword = makeEntry({
+            entryId: 'BR-2',
+            name: 'Auth security check before MCP tool execution',
+            collectionSlug: 'business-rules',
+        });
+        const withoutKeyword = makeEntry({
+            entryId: 'BR-3',
+            name: 'Some business rule',
+            collectionSlug: 'business-rules',
+        });
+        const [withResult] = classifyGovernance([withKeyword]);
+        const [withoutResult] = classifyGovernance([withoutKeyword]);
+        // Security keyword → policy wins over default constraint
+        expect(withResult.governanceFunction).toBe('policy');
+        // Without keyword, default constraint wins
+        expect(withoutResult.governanceFunction).toBe('constraint');
+    });
+    it('matchedSignals contains human-readable explanations', () => {
+        const entry = makeEntry({
+            entryId: 'STD-5',
+            name: 'Quality gate for test coverage',
+            collectionSlug: 'standards',
+            relations: [makeRelation({ type: 'constrains' })],
+        });
+        const [result] = classifyGovernance([entry]);
+        expect(result.matchedSignals.length).toBeGreaterThan(0);
+        expect(result.matchedSignals.some((s) => s.includes('standards'))).toBe(true);
+    });
+});
+describe('classifyGovernance — mixed null/non-null entryIds', () => {
+    it('only entries with non-null entryIds are returned', () => {
+        const entries = [
+            makeEntry({ entryId: 'STD-1', name: 'Valid standard', collectionSlug: 'standards' }),
+            makeEntry({ entryId: null, name: 'Draft entry', collectionSlug: 'standards' }),
+            makeEntry({ entryId: 'ARCH-2', name: 'Architecture entry', collectionSlug: 'architecture' }),
+        ];
+        const results = classifyGovernance(entries);
+        expect(results).toHaveLength(2);
+        expect(results.map((r) => r.entryId)).toEqual(['STD-1', 'ARCH-2']);
+    });
+});
+describe('classifyGovernance — patterns collection', () => {
+    it('PAT entry → convention', () => {
+        const entry = makeEntry({
+            entryId: 'PAT-1',
+            name: 'Additive wrapping pattern for feature flags',
+            collectionSlug: 'patterns',
+        });
+        const results = classifyGovernance([entry]);
+        expect(results[0].governanceFunction).toBe('convention');
+    });
+});
+describe('classifyGovernance — informed_by ARCH relation boosts boundary', () => {
+    it('DEC informed_by an architecture entry → boundary wins over convention', () => {
+        const entry = makeEntry({
+            entryId: 'DEC-5',
+            name: 'Domain boundaries for the seven layers',
+            collectionSlug: 'decisions',
+            relations: [
+                makeRelation({
+                    type: 'informed_by',
+                    direction: 'outgoing',
+                    otherCollectionSlug: 'architecture',
+                    otherName: 'Seven system domains',
+                    otherEntryId: 'ARCH-26',
+                }),
+            ],
+        });
+        // Also include 'domain' keyword in the name → double boundary boost
+        const results = classifyGovernance([entry]);
+        expect(results[0].governanceFunction).toBe('boundary');
+    });
+});
+//# sourceMappingURL=chain-classifier.test.js.map

package/dist/generators/chain-classifier.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-classifier.test.js","sourceRoot":"","sources":["../../src/generators/chain-classifier.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EACL,kBAAkB,GAGnB,MAAM,uBAAuB,CAAC;AAE/B,0EAA0E;AAE1E,SAAS,SAAS,CAAC,SAA2G;IAC5H,OAAO;QACL,MAAM,EAAE,WAAW;QACnB,kBAAkB,EAAE,IAAI;QACxB,IAAI,EAAE,IAAI;QACV,SAAS,EAAE,EAAE;QACb,GAAG,SAAS;KACb,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,SAA6D;IACjF,OAAO;QACL,SAAS,EAAE,UAAU;QACrB,YAAY,EAAE,IAAI;QAClB,SAAS,EAAE,aAAa;QACxB,mBAAmB,EAAE,IAAI;QACzB,GAAG,SAAS;KACb,CAAC;AACJ,CAAC;AAED,0EAA0E;AAE1E,QAAQ,CAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,kCAAkC;YACxC,cAAc,EAAE,WAAW;YAC3B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,EAAE,CAAC,CAAC;SAC/E,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,QAAQ;YACjB,IAAI,EAAE,sBAAsB;YAC5B,cAAc,EAAE,cAAc;SAC/B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,4CAA4C;YAClD,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG,SAAS,CAAC;YAC5B,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,eAAe;YACrB,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,MAAM,WAAW,GAAG,kBAAkB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAEtD,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1D,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,QAAQ;YACjB,IAAI,EAAE,6BAA6B;YACnC,cAAc,EAAE,OAAO;SACxB,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,uBAAuB;YAC7B,cAAc,EAAE,UAAU;YAC1B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,EAAE,CAAC,CAAC;SAC5E,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,2CAA2C;YACjD,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,IAAI;YACb,IAAI,EAAE,wBAAwB;YAC9B,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,OAAO,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,yBAAyB;YAC/B,cAAc,EAAE,UAAU;YAC1B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;SAClD,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,uDAAuD;QACvD,2DAA2D;QAC3D,sEAAsE;QACtE,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,0CAA0C;YAChD,cAAc,EAAE,gBAAgB;YAChC,SAAS,EAAE;gBACT,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC;gBACpC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC;gBACpC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;aAClC;SACF,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,sFAAsF;QACtF,yDAAyD;QACzD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,IAAI,GAAG,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,QAAQ;YACjB,IAAI,EAAE,eAAe;YACrB,cAAc,EAAE,WAAW;YAC3B,IAAI;YACJ,SAAS,EAAE,CAAC,QAAQ,CAAC;SACtB,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,SAAS;YAClB,IAAI,EAAE,uBAAuB;YAC7B,cAAc,EAAE,cAAc;SAC/B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QACtD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,WAAW,GAAG,SAAS,CAAC;YAC5B,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,+CAA+C;YACrD,cAAc,EAAE,gBAAgB;SACjC,CAAC,CAAC;QACH,MAAM,cAAc,GAAG,SAAS,CAAC;YAC/B,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,oBAAoB;YAC1B,cAAc,EAAE,gBAAgB;SACjC,CAAC,CAAC;QAEH,MAAM,CAAC,UAAU,CAAC,GAAG,kBAAkB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;QAE7D,yDAAyD;QACzD,MAAM,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,2CAA2C;QAC3C,MAAM,CAAC,aAAa,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,gCAAgC;YACtC,cAAc,EAAE,WAAW;YAC3B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;SAClD,CAAC,CAAC;QAEH,MAAM,CAAC,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;IACjE,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,OAAO,GAAG;YACd,SAAS,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,cAAc,EAAE,WAAW,EAAE,CAAC;YACpF,SAAS,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,CAAC;YAC9E,SAAS,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,oBAAoB,EAAE,cAAc,EAAE,cAAc,EAAE,CAAC;SAC7F,CAAC;QAEF,MAAM,OAAO,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,6CAA6C;YACnD,cAAc,EAAE,UAAU;SAC3B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gEAAgE,EAAE,GAAG,EAAE;IAC9E,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,wCAAwC;YAC9C,cAAc,EAAE,WAAW;YAC3B,SAAS,EAAE;gBACT,YAAY,CAAC;oBACX,IAAI,EAAE,aAAa;oBACnB,SAAS,EAAE,UAAU;oBACrB,mBAAmB,EAAE,cAAc;oBACnC,SAAS,EAAE,sBAAsB;oBACjC,YAAY,EAAE,SAAS;iBACxB,CAAC;aACH;SACF,CAAC,CAAC;QAEH,oEAAoE;QACpE,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/generators/chain-rules.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Chain Rules Assembler — BET-286 Slice 3
+ *
+ * Fetches governance entries via MCP, classifies them, resolves archetype
+ * templates, and returns CanonicalRule objects ready to merge into the
+ * canonical rules array in runHandshake().
+ *
+ * Chain: BET-286 (Chain-Derived Agent Configuration)
+ */
+import type { CanonicalRule } from './portable-knowledge.js';
+import type { kernelCall as McpCallFn } from '../lib/client.js';
+/** Statistics from a generateChainRules() call. */
+export interface ChainRulesStats {
+    totalEntries: number;
+    classifiedEntries: number;
+    generatedRules: number;
+    suppressedByManual: number;
+    suppressedByZeroEntries: number;
+}
+/** Result returned by generateChainRules(). */
+export interface ChainRulesResult {
+    /** Generated rules ready to merge into canonical rules array. */
+    rules: CanonicalRule[];
+    /** Function keys with no matching governance entries. */
+    gaps: string[];
+    /** Sentinel rule when MCP is unreachable — null on success. */
+    sentinel: CanonicalRule | null;
+    stats: ChainRulesStats;
+    /** Classified governance entries — passed through for diff engine confidence data. */
+    classified: import('./chain-classifier.js').ClassifiedGovernance[];
+}
+/**
+ * Fetch governance entries, classify them, resolve archetypes, and produce
+ * CanonicalRule objects ready to merge into the handshake pipeline.
+ *
+ * @param kernelCallFn - Injected kernelCall function for testability.
+ * @param manualRules - Existing manual rules from .productbrain/rules/.
+ *                      Used to suppress generated rules when a manual rule
+ *                      with the same name already exists.
+ */
+export declare function generateChainRules(kernelCallFn: typeof McpCallFn, manualRules: CanonicalRule[]): Promise<ChainRulesResult>;
+//# sourceMappingURL=chain-rules.d.ts.map

package/dist/generators/chain-rules.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-rules.d.ts","sourceRoot":"","sources":["../../src/generators/chain-rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAI7D,OAAO,KAAK,EAAE,UAAU,IAAI,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAIhE,mDAAmD;AACnD,MAAM,WAAW,eAAe;IAC9B,YAAY,EAAE,MAAM,CAAC;IACrB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,uBAAuB,EAAE,MAAM,CAAC;CACjC;AAED,+CAA+C;AAC/C,MAAM,WAAW,gBAAgB;IAC/B,iEAAiE;IACjE,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,yDAAyD;IACzD,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,+DAA+D;IAC/D,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAC;IAC/B,KAAK,EAAE,eAAe,CAAC;IACvB,sFAAsF;IACtF,UAAU,EAAE,OAAO,uBAAuB,EAAE,oBAAoB,EAAE,CAAC;CACpE;AAkCD;;;;;;;;GAQG;AACH,wBAAsB,kBAAkB,CACtC,YAAY,EAAE,OAAO,SAAS,EAC9B,WAAW,EAAE,aAAa,EAAE,GAC3B,OAAO,CAAC,gBAAgB,CAAC,CAoF3B"}

package/dist/generators/chain-rules.js

@@ -0,0 +1,144 @@
+/**
+ * Chain Rules Assembler — BET-286 Slice 3
+ *
+ * Fetches governance entries via MCP, classifies them, resolves archetype
+ * templates, and returns CanonicalRule objects ready to merge into the
+ * canonical rules array in runHandshake().
+ *
+ * Chain: BET-286 (Chain-Derived Agent Configuration)
+ */
+import { classifyGovernance } from './chain-classifier.js';
+import { resolveArchetype } from './archetypes.js';
+// ── Sentinel ──────────────────────────────────────────────────────────
+/** Produced when chain.getGovernanceWithRelations is unreachable. */
+const CHAIN_DEGRADED_SENTINEL = {
+    name: '_chain_degraded',
+    description: 'Chain governance unavailable — agent operating with manual rules only',
+    body: 'WARNING: The Chain MCP endpoint is unreachable. Generated governance rules are unavailable. Agent is operating with manual rules only. Exercise extra caution on governance decisions — check with the human before proceeding.',
+    sourcePath: 'chain://_sentinel',
+    autoApply: true,
+    level: 'core',
+    scope: undefined,
+    targets: undefined,
+};
+// ── Governance functions to attempt (excluding 'unclassified') ────────
+const GOVERNANCE_FUNCTIONS = [
+    'constraint',
+    'boundary',
+    'convention',
+    'policy',
+    'workflow',
+    'quality-gate',
+];
+/** Maximum number of generated rules (ranked by relation density). */
+const MAX_GENERATED_RULES = 8;
+// ── Assembler ─────────────────────────────────────────────────────────
+/**
+ * Fetch governance entries, classify them, resolve archetypes, and produce
+ * CanonicalRule objects ready to merge into the handshake pipeline.
+ *
+ * @param kernelCallFn - Injected kernelCall function for testability.
+ * @param manualRules - Existing manual rules from .productbrain/rules/.
+ *                      Used to suppress generated rules when a manual rule
+ *                      with the same name already exists.
+ */
+export async function generateChainRules(kernelCallFn, manualRules) {
+    const emptyStats = {
+        totalEntries: 0,
+        classifiedEntries: 0,
+        generatedRules: 0,
+        suppressedByManual: 0,
+        suppressedByZeroEntries: 0,
+    };
+    // Step 1: Fetch governance entries — return sentinel on failure
+    // The Convex query returns { entries: [...], total: N } — unwrap the array.
+    let entries;
+    try {
+        const result = await kernelCallFn('chain.getGovernanceWithRelations', {});
+        if (!Array.isArray(result?.entries)) {
+            return { rules: [], gaps: [], sentinel: CHAIN_DEGRADED_SENTINEL, stats: emptyStats, classified: [] };
+        }
+        entries = result.entries;
+    }
+    catch {
+        return {
+            rules: [],
+            gaps: [],
+            sentinel: CHAIN_DEGRADED_SENTINEL,
+            stats: emptyStats,
+            classified: [],
+        };
+    }
+    // Step 2: Classify entries
+    const classified = classifyGovernance(entries);
+    // Step 3: Build manual rule name set for suppression check
+    const manualRuleNames = new Set(manualRules.map((r) => r.name));
+    // Step 4: Resolve an archetype per governance function
+    const resolvedRules = [];
+    const gaps = [];
+    let suppressedByManual = 0;
+    let suppressedByZeroEntries = 0;
+    for (const fn of GOVERNANCE_FUNCTIONS) {
+        const matching = classified.filter((e) => e.governanceFunction === fn);
+        if (matching.length === 0) {
+            // Zero entries for this function — add to gaps
+            gaps.push(fn);
+            suppressedByZeroEntries++;
+            continue;
+        }
+        const result = resolveArchetype(fn, classified, manualRuleNames);
+        if ('skipped' in result) {
+            if (result.skipped === 'manual-suppression') {
+                suppressedByManual++;
+            }
+            // 'no-template' and 'zero-entries' are not counted as manual suppression.
+            // Zero-entries is already handled above; no-template is a missing file (not a user action).
+            continue;
+        }
+        resolvedRules.push(result.resolved.rule);
+    }
+    // Step 5: Cap at MAX_GENERATED_RULES — rank by relation density
+    // Relation density = total relations across all classified entries matching this function
+    const ranked = rankByRelationDensity(resolvedRules, classified);
+    const cappedRules = ranked.slice(0, MAX_GENERATED_RULES);
+    const stats = {
+        totalEntries: entries.length,
+        classifiedEntries: classified.length,
+        generatedRules: cappedRules.length,
+        suppressedByManual,
+        suppressedByZeroEntries,
+    };
+    return {
+        rules: cappedRules,
+        gaps,
+        sentinel: null,
+        stats,
+        classified,
+    };
+}
+// ── Ranking ───────────────────────────────────────────────────────────
+/**
+ * Rank generated rules by the total number of relations across classified
+ * entries that contributed to each rule. Higher relation density → ranked first.
+ *
+ * Falls back to name-based sort for ties to ensure stable output.
+ */
+function rankByRelationDensity(rules, classified) {
+    // Build a density score per sourcePath (chain://<functionKey>)
+    const densityMap = new Map();
+    for (const rule of rules) {
+        // sourcePath is 'chain://<functionKey>'
+        const functionKey = rule.sourcePath.replace('chain://', '');
+        const matching = classified.filter((e) => e.governanceFunction === functionKey);
+        const density = matching.reduce((sum, e) => sum + e.relations.length, 0);
+        densityMap.set(rule.sourcePath, density);
+    }
+    return [...rules].sort((a, b) => {
+        const densityA = densityMap.get(a.sourcePath) ?? 0;
+        const densityB = densityMap.get(b.sourcePath) ?? 0;
+        if (densityB !== densityA)
+            return densityB - densityA;
+        return a.name.localeCompare(b.name);
+    });
+}
+//# sourceMappingURL=chain-rules.js.map