@co-engram/core 0.1.0

package/dist/generative/cross-pollinate.js

@@ -0,0 +1,390 @@
+/**
+ * 跨域授粉（spec §5.3 机制 4，P3 4.3）
+ *
+ * 发现跨领域类比（创造性思维）。
+ *
+ * 算法：
+ *   1. 计算每个 domain 的结构指纹：
+ *      - SynapseKind 分布（structural/causal/evidential/...）
+ *      - EngramKind 分布（observation/fact/...）
+ *      - 平均 importance / confidence
+ *   2. 计算两个 domain 的结构相似度（Cosine similarity on synapse kind 向量）
+ *   3. 相似度 ≥ threshold → 调 Provider 生成类比描述
+ *   4. 可选创建 hypothesis engram 记录类比（kind=hypothesis, domainTags=[A,B]）
+ *
+ * 默认启发式：基于结构向量相似度 + 模板化类比描述。
+ * 生产实现：宿主注入 LLM provider 做真正的语义类比。
+ *
+ * @module @co-engram/core/generative
+ */
+import { randomUUID } from "node:crypto";
+/** 默认配置 */
+const DEFAULT_SIMILARITY_THRESHOLD = 0.5;
+const DEFAULT_ADOPTION_THRESHOLD = 0.5;
+const SAMPLE_SIZE = 3;
+// ============================================================
+// 默认启发式 Provider
+// ============================================================
+/**
+ * 默认启发式跨域类比 Provider（无 LLM）
+ *
+ * 模板化输出：
+ *   - analogy: "{domainA} 的 {topKindA} 模式与 {domainB} 的 {topKindB} 模式结构同构"
+ *   - sharedPrinciple: 基于 top synapse kind 推断
+ *   - confidence = structuralSimilarity
+ */
+export class LocalHeuristicCrossPollinationProvider {
+    generate(input) {
+        const topKindA = topKey(input.profileA.synapseDistribution);
+        const topKindB = topKey(input.profileB.synapseDistribution);
+        if (input.structuralSimilarity < DEFAULT_SIMILARITY_THRESHOLD) {
+            return {
+                analogy: `${input.domainA} 与 ${input.domainB} 的结构相似度不足（${input.structuralSimilarity.toFixed(2)}），无明显类比`,
+                sharedPrinciple: "N/A",
+                confidence: input.structuralSimilarity,
+                reason: `structuralSimilarity ${input.structuralSimilarity.toFixed(2)} < threshold ${DEFAULT_SIMILARITY_THRESHOLD}`,
+            };
+        }
+        const sameTopKind = topKindA === topKindB;
+        const analogy = sameTopKind
+            ? `${input.domainA} 与 ${input.domainB} 都以 ${topKindA} 为主导连接模式，存在结构同构`
+            : `${input.domainA}（${topKindA}）与 ${input.domainB}（${topKindB}）虽然主导连接不同，但整体结构相似度为 ${input.structuralSimilarity.toFixed(2)}`;
+        const principle = sameTopKind
+            ? `两个领域都通过 ${topKindA} 组织知识，可能共享相同的认知结构`
+            : `两个领域结构相似但主导关系不同，可探索深层共同原理`;
+        return {
+            analogy,
+            sharedPrinciple: principle,
+            confidence: input.structuralSimilarity,
+            reason: `cosine similarity ${input.structuralSimilarity.toFixed(2)} based on synapse kind distribution`,
+        };
+    }
+}
+// ============================================================
+// 主 API
+// ============================================================
+/**
+ * 计算单个 domain 的结构指纹
+ */
+export function computeDomainProfile(repo, domain) {
+    const engrams = [];
+    for (const entry of repo.listEngrams()) {
+        const engram = repo.readEngram(entry.id);
+        if (engram.status !== "active")
+            continue;
+        if (!engram.domainTags.includes(domain))
+            continue;
+        engrams.push(engram);
+    }
+    if (engrams.length === 0)
+        return null;
+    const kindDistribution = {
+        observation: 0,
+        fact: 0,
+        pattern: 0,
+        procedure: 0,
+        hypothesis: 0,
+    };
+    let importanceSum = 0;
+    let confidenceSum = 0;
+    for (const e of engrams) {
+        kindDistribution[e.kind] += 1;
+        importanceSum += e.importance;
+        confidenceSum += e.confidence;
+    }
+    // 统计该 domain 下所有 engram 的 outgoing synapses
+    const synapseDistribution = {
+        extends: 0,
+        part_of: 0,
+        similar_to: 0,
+        depends_on: 0,
+        causes: 0,
+        follows: 0,
+        derives_from: 0,
+        contradicts: 0,
+        exemplifies: 0,
+        supersedes: 0,
+        consolidates: 0,
+        contextualizes: 0,
+    };
+    for (const e of engrams) {
+        const file = repo.readSynapses(e.id);
+        for (const syn of file.outgoing) {
+            synapseDistribution[syn.kind] += 1;
+        }
+    }
+    return {
+        domain,
+        engramCount: engrams.length,
+        kindDistribution,
+        synapseDistribution,
+        avgImportance: importanceSum / engrams.length,
+        avgConfidence: confidenceSum / engrams.length,
+    };
+}
+/**
+ * 计算两个 domain 的结构相似度（Cosine similarity on synapse kind 向量）
+ *
+ * 返回 [0,1]，1 = 完全同构
+ */
+export function computeStructuralSimilarity(a, b) {
+    const kinds = [
+        "extends",
+        "part_of",
+        "similar_to",
+        "depends_on",
+        "causes",
+        "follows",
+        "derives_from",
+        "contradicts",
+        "exemplifies",
+        "supersedes",
+        "consolidates",
+        "contextualizes",
+    ];
+    // 归一化（除以总数，处理 domain 大小差异）
+    const totalA = kinds.reduce((s, k) => s + a.synapseDistribution[k], 0) || 1;
+    const totalB = kinds.reduce((s, k) => s + b.synapseDistribution[k], 0) || 1;
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (const k of kinds) {
+        const va = a.synapseDistribution[k] / totalA;
+        const vb = b.synapseDistribution[k] / totalB;
+        dot += va * vb;
+        normA += va * va;
+        normB += vb * vb;
+    }
+    if (normA === 0 || normB === 0)
+        return 0;
+    return dot / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+/**
+ * 扫描所有 domain pair，返回结构相似的候选对
+ *
+ * @param options.threshold 相似度下限（默认 0.5）
+ * @param options.maxPairs 最多返回数量（默认 10）
+ */
+export function findCrossDomainCandidates(repo, options = {}) {
+    const threshold = options.threshold ?? DEFAULT_SIMILARITY_THRESHOLD;
+    const maxPairs = options.maxPairs ?? 10;
+    const minEngrams = options.minEngramsPerDomain ?? 2;
+    // 收集所有 domain
+    const domainSet = new Set();
+    for (const entry of repo.listEngrams()) {
+        const engram = repo.readEngram(entry.id);
+        if (engram.status !== "active")
+            continue;
+        for (const d of engram.domainTags)
+            domainSet.add(d);
+    }
+    // 计算每个 domain 的 profile
+    const profiles = new Map();
+    for (const d of domainSet) {
+        const p = computeDomainProfile(repo, d);
+        if (p && p.engramCount >= minEngrams)
+            profiles.set(d, p);
+    }
+    // 两两计算相似度
+    const domains = [...profiles.keys()].sort();
+    const candidates = [];
+    for (let i = 0; i < domains.length; i++) {
+        for (let j = i + 1; j < domains.length; j++) {
+            const a = profiles.get(domains[i]);
+            const b = profiles.get(domains[j]);
+            const sim = computeStructuralSimilarity(a, b);
+            if (sim >= threshold) {
+                candidates.push({
+                    domainA: domains[i],
+                    domainB: domains[j],
+                    similarity: sim,
+                });
+            }
+        }
+    }
+    // 按相似度降序
+    candidates.sort((a, b) => {
+        if (b.similarity !== a.similarity)
+            return b.similarity - a.similarity;
+        return a.domainA < b.domainA ? -1 : 1;
+    });
+    return candidates.slice(0, maxPairs);
+}
+/**
+ * 对单对 domain 执行跨域授粉
+ *
+ * 行为：
+ *   1. 计算 profileA / profileB
+ *   2. 计算 structuralSimilarity
+ *   3. 调 Provider.generate（即使相似度低也调用，由 Provider 决定是否输出）
+ *   4. createHypothesis=true 且 confidence ≥ autoAdoptionThreshold
+ *      → 创建 hypothesis engram（domainTags=[A,B]）记录类比
+ */
+export async function crossPollinate(repo, provider, input) {
+    const nowIso = input.nowIso ?? new Date().toISOString();
+    const autoAdoptionThreshold = input.autoAdoptionThreshold ?? DEFAULT_ADOPTION_THRESHOLD;
+    const createHypothesis = input.createHypothesis ?? false;
+    const profileA = computeDomainProfile(repo, input.domainA);
+    const profileB = computeDomainProfile(repo, input.domainB);
+    if (!profileA) {
+        return emptyResult(input.domainA, input.domainB, `domain A "${input.domainA}" has no active engrams`);
+    }
+    if (!profileB) {
+        return emptyResult(input.domainA, input.domainB, `domain B "${input.domainB}" has no active engrams`);
+    }
+    const similarity = computeStructuralSimilarity(profileA, profileB);
+    const sampleA = sampleEngrams(repo, input.domainA, SAMPLE_SIZE);
+    const sampleB = sampleEngrams(repo, input.domainB, SAMPLE_SIZE);
+    const output = await provider.generate({
+        domainA: input.domainA,
+        profileA,
+        domainB: input.domainB,
+        profileB,
+        structuralSimilarity: similarity,
+        sampleEngramsA: sampleA,
+        sampleEngramsB: sampleB,
+    });
+    const adopted = createHypothesis && output.confidence >= autoAdoptionThreshold;
+    let engramId = null;
+    let reason;
+    if (!createHypothesis) {
+        reason = `analogy generated; createHypothesis=false`;
+    }
+    else if (!adopted) {
+        reason = `confidence ${output.confidence.toFixed(2)} < threshold ${autoAdoptionThreshold}`;
+    }
+    else {
+        const newEngram = repo.createEngram({
+            title: `Cross-domain analogy: ${input.domainA} ↔ ${input.domainB}`,
+            content: [
+                `# ${output.analogy}`,
+                "",
+                `**共同原理**：${output.sharedPrinciple}`,
+                "",
+                `**结构相似度**：${similarity.toFixed(2)}`,
+                `**置信度**：${output.confidence.toFixed(2)}`,
+                "",
+                `**${input.domainA} 样本**：`,
+                ...sampleA.map((e) => `- ${e.title}`),
+                "",
+                `**${input.domainB} 样本**：`,
+                ...sampleB.map((e) => `- ${e.title}`),
+            ].join("\n"),
+            summary: output.sharedPrinciple,
+            kind: "hypothesis",
+            domainTags: [input.domainA, input.domainB].sort(),
+            importance: 0.5,
+            confidence: output.confidence,
+            sourceType: "inferred",
+            createdBy: input.createdBy,
+        });
+        repo.updateVerificationStatus(newEngram.id, "unverified");
+        engramId = newEngram.id;
+        reason = `adopted; confidence=${output.confidence.toFixed(2)}`;
+    }
+    return {
+        domainA: input.domainA,
+        domainB: input.domainB,
+        structuralSimilarity: similarity,
+        profileA,
+        profileB,
+        analogy: output,
+        adopted,
+        engramId,
+        reason,
+    };
+}
+/**
+ * 批量执行：对前 N 个候选 pair 跑 crossPollinate
+ */
+export async function crossPollinateBatch(repo, provider, input) {
+    const candidates = findCrossDomainCandidates(repo, {
+        threshold: input.threshold,
+        maxPairs: input.maxPairs,
+    });
+    const results = [];
+    for (const c of candidates) {
+        const r = await crossPollinate(repo, provider, {
+            domainA: c.domainA,
+            domainB: c.domainB,
+            createdBy: input.createdBy,
+            createHypothesis: input.createHypothesis,
+            autoAdoptionThreshold: input.autoAdoptionThreshold,
+        });
+        results.push(r);
+    }
+    return { candidates, results };
+}
+// ============================================================
+// 辅助
+// ============================================================
+function emptyResult(a, b, reason) {
+    return {
+        domainA: a,
+        domainB: b,
+        structuralSimilarity: 0,
+        profileA: emptyProfile(a),
+        profileB: emptyProfile(b),
+        analogy: null,
+        adopted: false,
+        engramId: null,
+        reason,
+    };
+}
+function emptyProfile(domain) {
+    return {
+        domain,
+        engramCount: 0,
+        kindDistribution: {
+            observation: 0,
+            fact: 0,
+            pattern: 0,
+            procedure: 0,
+            hypothesis: 0,
+        },
+        synapseDistribution: {
+            extends: 0,
+            part_of: 0,
+            similar_to: 0,
+            depends_on: 0,
+            causes: 0,
+            follows: 0,
+            derives_from: 0,
+            contradicts: 0,
+            exemplifies: 0,
+            supersedes: 0,
+            consolidates: 0,
+            contextualizes: 0,
+        },
+        avgImportance: 0,
+        avgConfidence: 0,
+    };
+}
+function topKey(dist) {
+    let best = null;
+    let bestN = -1;
+    for (const key in dist) {
+        if (dist[key] > bestN) {
+            bestN = dist[key];
+            best = key;
+        }
+    }
+    return best ?? Object.keys(dist)[0];
+}
+function sampleEngrams(repo, domain, n) {
+    const result = [];
+    for (const entry of repo.listEngrams()) {
+        if (result.length >= n)
+            break;
+        const e = repo.readEngram(entry.id);
+        if (e.status !== "active")
+            continue;
+        if (!e.domainTags.includes(domain))
+            continue;
+        result.push({ title: e.title, content: e.content });
+    }
+    return result;
+}
+// 触发 randomUUID 的引用（用于 createHypothesis 时的 synapse ID，未来扩展用）
+void randomUUID;
+//# sourceMappingURL=cross-pollinate.js.map

package/dist/generative/cross-pollinate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-pollinate.js","sourceRoot":"","sources":["../../src/generative/cross-pollinate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAyEzC,WAAW;AACX,MAAM,4BAA4B,GAAG,GAAG,CAAC;AACzC,MAAM,0BAA0B,GAAG,GAAG,CAAC;AACvC,MAAM,WAAW,GAAG,CAAC,CAAC;AAEtB,+DAA+D;AAC/D,iBAAiB;AACjB,+DAA+D;AAE/D;;;;;;;GAOG;AACH,MAAM,OAAO,sCAAsC;IACjD,QAAQ,CACN,KAAoC;QAEpC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC;QAC5D,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC;QAE5D,IAAI,KAAK,CAAC,oBAAoB,GAAG,4BAA4B,EAAE,CAAC;YAC9D,OAAO;gBACL,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,MAAM,KAAK,CAAC,OAAO,aAAa,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;gBACvG,eAAe,EAAE,KAAK;gBACtB,UAAU,EAAE,KAAK,CAAC,oBAAoB;gBACtC,MAAM,EAAE,wBAAwB,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,4BAA4B,EAAE;aACpH,CAAC;QACJ,CAAC;QAED,MAAM,WAAW,GAAG,QAAQ,KAAK,QAAQ,CAAC;QAC1C,MAAM,OAAO,GAAG,WAAW;YACzB,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,MAAM,KAAK,CAAC,OAAO,OAAO,QAAQ,iBAAiB;YACrE,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,IAAI,QAAQ,MAAM,KAAK,CAAC,OAAO,IAAI,QAAQ,uBAAuB,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAE9H,MAAM,SAAS,GAAG,WAAW;YAC3B,CAAC,CAAC,WAAW,QAAQ,mBAAmB;YACxC,CAAC,CAAC,2BAA2B,CAAC;QAEhC,OAAO;YACL,OAAO;YACP,eAAe,EAAE,SAAS;YAC1B,UAAU,EAAE,KAAK,CAAC,oBAAoB;YACtC,MAAM,EAAE,qBAAqB,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,qCAAqC;SACxG,CAAC;IACJ,CAAC;CACF;AAED,+DAA+D;AAC/D,QAAQ;AACR,+DAA+D;AAE/D;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,IAAsB,EACtB,MAAc;IAEd,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ;YAAE,SAAS;QACzC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAS;QAClD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,MAAM,gBAAgB,GAA+B;QACnD,WAAW,EAAE,CAAC;QACd,IAAI,EAAE,CAAC;QACP,OAAO,EAAE,CAAC;QACV,SAAS,EAAE,CAAC;QACZ,UAAU,EAAE,CAAC;KACd,CAAC;IACF,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,aAAa,IAAI,CAAC,CAAC,UAAU,CAAC;QAC9B,aAAa,IAAI,CAAC,CAAC,UAAU,CAAC;IAChC,CAAC;IAED,4CAA4C;IAC5C,MAAM,mBAAmB,GAAgC;QACvD,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;QACV,UAAU,EAAE,CAAC;QACb,UAAU,EAAE,CAAC;QACb,MAAM,EAAE,CAAC;QACT,OAAO,EAAE,CAAC;QACV,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,CAAC;QACd,WAAW,EAAE,CAAC;QACd,UAAU,EAAE,CAAC;QACb,YAAY,EAAE,CAAC;QACf,cAAc,EAAE,CAAC;KAClB,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM;QACN,WAAW,EAAE,OAAO,CAAC,MAAM;QAC3B,gBAAgB;QAChB,mBAAmB;QACnB,aAAa,EAAE,aAAa,GAAG,OAAO,CAAC,MAAM;QAC7C,aAAa,EAAE,aAAa,GAAG,OAAO,CAAC,MAAM;KAC9C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CACzC,CAAgB,EAChB,CAAgB;IAEhB,MAAM,KAAK,GAAkB;QAC3B,SAAS;QACT,SAAS;QACT,YAAY;QACZ,YAAY;QACZ,QAAQ;QACR,SAAS;QACT,cAAc;QACd,aAAa;QACb,aAAa;QACb,YAAY;QACZ,cAAc;QACd,gBAAgB;KACjB,CAAC;IAEF,2BAA2B;IAC3B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAE5E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAC7C,MAAM,EAAE,GAAG,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAC7C,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;QACf,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;IACnB,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAAsB,EACtB,UAII,EAAE;IAEN,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,4BAA4B,CAAC;IACpE,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;IACxC,MAAM,UAAU,GAAG,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC;IAEpD,cAAc;IACd,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ;YAAE,SAAS;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,wBAAwB;IACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,CAAC,WAAW,IAAI,UAAU;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,UAAU;IACV,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5C,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAE,CAAC;YACrC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAE,CAAC;YACrC,MAAM,GAAG,GAAG,2BAA2B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;gBACrB,UAAU,CAAC,IAAI,CAAC;oBACd,OAAO,EAAE,OAAO,CAAC,CAAC,CAAE;oBACpB,OAAO,EAAE,OAAO,CAAC,CAAC,CAAE;oBACpB,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS;IACT,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;YAAE,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;QACtE,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,IAAsB,EACtB,QAAkC,EAClC,KAA8B;IAE9B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACxD,MAAM,qBAAqB,GACzB,KAAK,CAAC,qBAAqB,IAAI,0BAA0B,CAAC;IAC5D,MAAM,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,IAAI,KAAK,CAAC;IAEzD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAC3D,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAE3D,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,WAAW,CAChB,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,OAAO,EACb,aAAa,KAAK,CAAC,OAAO,yBAAyB,CACpD,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,WAAW,CAChB,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,OAAO,EACb,aAAa,KAAK,CAAC,OAAO,yBAAyB,CACpD,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,2BAA2B,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAChE,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAEhE,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,QAAQ,CAAC;QACrC,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,QAAQ;QACR,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,QAAQ;QACR,oBAAoB,EAAE,UAAU;QAChC,cAAc,EAAE,OAAO;QACvB,cAAc,EAAE,OAAO;KACxB,CAAC,CAAC;IAEH,MAAM,OAAO,GACX,gBAAgB,IAAI,MAAM,CAAC,UAAU,IAAI,qBAAqB,CAAC;IACjE,IAAI,QAAQ,GAAkB,IAAI,CAAC;IACnC,IAAI,MAAc,CAAC;IAEnB,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtB,MAAM,GAAG,2CAA2C,CAAC;IACvD,CAAC;SAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACpB,MAAM,GAAG,cAAc,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,qBAAqB,EAAE,CAAC;IAC7F,CAAC;SAAM,CAAC;QACN,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC;YAClC,KAAK,EAAE,yBAAyB,KAAK,CAAC,OAAO,MAAM,KAAK,CAAC,OAAO,EAAE;YAClE,OAAO,EAAE;gBACP,KAAK,MAAM,CAAC,OAAO,EAAE;gBACrB,EAAE;gBACF,YAAY,MAAM,CAAC,eAAe,EAAE;gBACpC,EAAE;gBACF,aAAa,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACpC,WAAW,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACzC,EAAE;gBACF,KAAK,KAAK,CAAC,OAAO,QAAQ;gBAC1B,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBACrC,EAAE;gBACF,KAAK,KAAK,CAAC,OAAO,QAAQ;gBAC1B,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;aACtC,CAAC,IAAI,CAAC,IAAI,CAAC;YACZ,OAAO,EAAE,MAAM,CAAC,eAAe;YAC/B,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE;YACjD,UAAU,EAAE,GAAG;YACf,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,UAAU,EAAE,UAAU;YACtB,SAAS,EAAE,KAAK,CAAC,SAAS;SAC3B,CAAC,CAAC;QACH,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;QAC1D,QAAQ,GAAG,SAAS,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,uBAAuB,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACjE,CAAC;IAED,OAAO;QACL,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,oBAAoB,EAAE,UAAU;QAChC,QAAQ;QACR,QAAQ;QACR,OAAO,EAAE,MAAM;QACf,OAAO;QACP,QAAQ;QACR,MAAM;KACP,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,IAAsB,EACtB,QAAkC,EAClC,KAMC;IAKD,MAAM,UAAU,GAAG,yBAAyB,CAAC,IAAI,EAAE;QACjD,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,QAAQ,EAAE,KAAK,CAAC,QAAQ;KACzB,CAAC,CAAC;IACH,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,MAAM,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE;YAC7C,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;YACxC,qBAAqB,EAAE,KAAK,CAAC,qBAAqB;SACnD,CAAC,CAAC;QACH,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AACjC,CAAC;AAED,+DAA+D;AAC/D,KAAK;AACL,+DAA+D;AAE/D,SAAS,WAAW,CAClB,CAAS,EACT,CAAS,EACT,MAAc;IAEd,OAAO;QACL,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;QACV,oBAAoB,EAAE,CAAC;QACvB,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;QACzB,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;QACzB,OAAO,EAAE,IAAI;QACb,OAAO,EAAE,KAAK;QACd,QAAQ,EAAE,IAAI;QACd,MAAM;KACP,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,MAAc;IAClC,OAAO;QACL,MAAM;QACN,WAAW,EAAE,CAAC;QACd,gBAAgB,EAAE;YAChB,WAAW,EAAE,CAAC;YACd,IAAI,EAAE,CAAC;YACP,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,CAAC;YACZ,UAAU,EAAE,CAAC;SACd;QACD,mBAAmB,EAAE;YACnB,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,CAAC;YACb,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,CAAC;YACV,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,CAAC;YACd,UAAU,EAAE,CAAC;YACb,YAAY,EAAE,CAAC;YACf,cAAc,EAAE,CAAC;SAClB;QACD,aAAa,EAAE,CAAC;QAChB,aAAa,EAAE,CAAC;KACjB,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAmB,IAAuB;IACvD,IAAI,IAAI,GAAa,IAAI,CAAC;IAC1B,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,GAAQ,CAAC,GAAG,KAAK,EAAE,CAAC;YAC3B,KAAK,GAAG,IAAI,CAAC,GAAQ,CAAC,CAAC;YACvB,IAAI,GAAG,GAAQ,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,IAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAO,CAAC;AAC7C,CAAC;AAED,SAAS,aAAa,CACpB,IAAsB,EACtB,MAAc,EACd,CAAS;IAET,MAAM,MAAM,GAA8C,EAAE,CAAC;IAC7D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;YAAE,MAAM;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,SAAS;QACpC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAS;QAC7C,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,6DAA6D;AAC7D,KAAK,UAAU,CAAC"}

package/dist/generative/gap-detector.d.ts

@@ -0,0 +1,80 @@
+/**
+ * 主动缺口检测（spec §5.3 机制 2，P3 4.2）
+ *
+ * 识别"不知道什么"——主动报告知识库中的结构性缺陷：
+ *
+ * 缺口类型：
+ *   1. missing_evidence: fact/hypothesis/pattern engram 的 derives_from
+ *      synapse 数量 < 阈值（证据不足）
+ *   2. missing_procedure: 某 domain 有 ≥ N 个 observation/fact 但 0 个 procedure
+ *      （有认知但无可执行流程）
+ *   3. missing_contradiction: 高 importance 的 engram 没有任何 contradicts
+ *      synapse（缺乏反例验证 → 确认偏误风险）
+ *   4. orphan_engram: 无任何 synapse 连接的 active engram（孤立知识）
+ *   5. stale_active: freshness='stale' 但 status='active'（可能过时）
+ *
+ * 上层可基于 gaps 主动触发：
+ *   - 生成 hypothesis 填补缺口
+ *   - 提示团队验证高 importance 的 engram
+ *   - 把 orphan 纳入 dreaming consolidation
+ *   - 把 stale_active engram 归档或重新激活
+ *
+ * @module @co-engram/core/generative
+ */
+import type { EngramRepository } from "../storage/repository.js";
+/** 缺口类型 */
+export type GapType = "missing_evidence" | "missing_procedure" | "missing_contradiction" | "orphan_engram" | "stale_active";
+/** 严重度 */
+export type GapSeverity = "low" | "medium" | "high";
+/** 单条知识缺口 */
+export interface KnowledgeGap {
+    readonly type: GapType;
+    /** 相关 domainTags（missing_procedure 时表示缺口所在 domain） */
+    readonly domainTags?: readonly string[];
+    /** 描述（人类可读） */
+    readonly description: string;
+    /** 相关 engram ID */
+    readonly relatedEngramIds: readonly string[];
+    /** 严重度（high=急需处理，low=可选） */
+    readonly severity: GapSeverity;
+    /** 修复建议 */
+    readonly suggestion: string;
+}
+/** 缺口检测配置 */
+export interface GapDetectionConfig {
+    /** fact 的最少 evidence 数（默认 2） */
+    readonly minEvidenceForFact: number;
+    /** hypothesis 的最少 evidence 数（默认 3） */
+    readonly minEvidenceForHypothesis: number;
+    /** pattern 的最少 evidence 数（默认 3） */
+    readonly minEvidenceForPattern: number;
+    /** 缺失 procedure 阈值：domain 中 ≥ 此值的 obs/fact 但 0 procedure（默认 5） */
+    readonly missingProcedureThreshold: number;
+    /** 缺失 contradicts 的 importance 下限（默认 0.7） */
+    readonly missingContradictionImportance: number;
+    /** 是否检测 orphan（默认 true） */
+    readonly includeOrphans: boolean;
+    /** 是否检测 stale_active（默认 true） */
+    readonly includeStaleActive: boolean;
+}
+export declare const DEFAULT_GAP_CONFIG: GapDetectionConfig;
+/** 检测结果 */
+export interface DetectGapsResult {
+    readonly gaps: readonly KnowledgeGap[];
+    readonly summary: {
+        readonly totalGaps: number;
+        readonly byType: Record<GapType, number>;
+    };
+}
+/**
+ * 主动检测知识缺口
+ *
+ * @param repo Repository
+ * @param options.config 部分覆盖默认配置
+ * @param options.domainTags 限定域（只在这些 domainTags 范围内检测）
+ */
+export declare function detectKnowledgeGaps(repo: EngramRepository, options?: {
+    readonly config?: Partial<GapDetectionConfig>;
+    readonly domainTags?: readonly string[];
+}): DetectGapsResult;
+//# sourceMappingURL=gap-detector.d.ts.map

package/dist/generative/gap-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gap-detector.d.ts","sourceRoot":"","sources":["../../src/generative/gap-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAGjE,WAAW;AACX,MAAM,MAAM,OAAO,GACf,kBAAkB,GAClB,mBAAmB,GACnB,uBAAuB,GACvB,eAAe,GACf,cAAc,CAAC;AAEnB,UAAU;AACV,MAAM,MAAM,WAAW,GAAG,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;AAEpD,aAAa;AACb,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,sDAAsD;IACtD,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,eAAe;IACf,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,mBAAmB;IACnB,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,4BAA4B;IAC5B,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B,WAAW;IACX,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,aAAa;AACb,MAAM,WAAW,kBAAkB;IACjC,gCAAgC;IAChC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,sCAAsC;IACtC,QAAQ,CAAC,wBAAwB,EAAE,MAAM,CAAC;IAC1C,mCAAmC;IACnC,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;IACvC,kEAAkE;IAClE,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC;IAC3C,6CAA6C;IAC7C,QAAQ,CAAC,8BAA8B,EAAE,MAAM,CAAC;IAChD,2BAA2B;IAC3B,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC,iCAAiC;IACjC,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC;CACtC;AAED,eAAO,MAAM,kBAAkB,EAAE,kBAQhC,CAAC;AAEF,WAAW;AACX,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE;QAChB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;KAC1C,CAAC;CACH;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,gBAAgB,EACtB,OAAO,GAAE;IACP,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAC9C,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC,GACL,gBAAgB,CAsNlB"}