progmune-runtime 2.1.6 → 3.2.0

package/dist/scale-trajectory-collector.js

@@ -0,0 +1,128 @@
+"use strict";
+/**
+ * Scale Trajectory Collector
+ *
+ * Generates 500+ validated trajectories from repo signatures
+ * using AST extraction + augmentation + Protocol VM validation.
+ *
+ * Pipeline:
+ *   Repo Signatures → AST extraction → Synonym normalization
+ *   → Random walks → Mutations → Validation → Dedup → Corpus
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.collectTrajectoriesAtScale = collectTrajectoriesAtScale;
+exports.printCollectionReport = printCollectionReport;
+const protocol_mining_1 = require("./protocol-mining");
+const trajectory_corpus_1 = require("./trajectory-corpus");
+const unsupervised_physics_1 = require("./experimental/unsupervised-physics");
+const trajectory_augmentation_1 = require("./trajectory-augmentation");
+const function_synonyms_1 = require("./function-synonyms");
+const software_physics_1 = require("./experimental/software-physics");
+const protocol_coverage_1 = require("./protocol-coverage");
+const auto_protocol_synthesizer_1 = require("./auto-protocol-synthesizer");
+/**
+ * Collect trajectories at scale from all available sources.
+ *
+ * Combines:
+ *   1. Mining signatures (21 repos, 64 sequences)
+ *   2. Expanded trajectories (10 libraries, 50 sequences)
+ *   3. Cross-repo sequences (5 repos, 15 sequences)
+ *   4. Random walks from protocol rules
+ *   5. Mutations of existing trajectories
+ *
+ * All sequences are normalized, validated, and deduplicated.
+ */
+function collectTrajectoriesAtScale() {
+    // Collect all source sequences
+    const sourceSeqs = [];
+    // Source 1: Mining signatures
+    for (const sig of protocol_mining_1.MINING_SIGNATURES) {
+        for (const p of sig.patterns) {
+            if (p.length >= 2)
+                sourceSeqs.push(p);
+        }
+    }
+    // Source 2: Expanded trajectories
+    for (const lib of trajectory_corpus_1.EXPANDED_TRAJECTORIES) {
+        for (const seq of lib.sequences) {
+            if (seq.length >= 2)
+                sourceSeqs.push(seq);
+        }
+    }
+    // Source 3: Cross-repo sequences
+    for (const seqs of Object.values(unsupervised_physics_1.CROSS_REPO_SEQUENCES)) {
+        for (const seq of seqs) {
+            if (seq.length >= 2)
+                sourceSeqs.push(seq);
+        }
+    }
+    const sourceCount = sourceSeqs.length;
+    const uniqueSources = new Set(sourceSeqs.map(s => s.join("→")));
+    // Normalize all sequences
+    const normalized = sourceSeqs.map(seq => seq.map(function_synonyms_1.normalizeFunctionName));
+    // Build protocol rules for validation
+    const defs = (0, protocol_coverage_1.loadDefaultProtocolDefinitions)();
+    const rules = new Map();
+    const nsInit = new Map();
+    for (const p of defs) {
+        nsInit.set(p.name, p.initialState);
+        for (const [fn, rule] of p.rules)
+            rules.set(fn, rule);
+    }
+    const synthesized = (0, auto_protocol_synthesizer_1.synthesizeAllKnownProtocols)();
+    for (const sp of synthesized) {
+        for (const sr of sp.rules) {
+            rules.set(sr.function, {
+                pre_states: sr.pre_states,
+                post_states: sr.post_states,
+                invalidate: sr.invalidate,
+            });
+        }
+    }
+    // Generate random walks from all rules + synthesized (push to 200+)
+    const walks = (0, trajectory_augmentation_1.generateRandomWalks)(rules, 5000, 2, 10, nsInit);
+    const normalizedWalks = walks.map(seq => seq.map(function_synonyms_1.normalizeFunctionName));
+    // Generate mutations at scale
+    const seedForMutations = [...normalized, ...normalizedWalks];
+    const mutations = (0, trajectory_augmentation_1.mutateTrajectories)(seedForMutations.slice(0, 800), rules, 3000);
+    const normalizedMutations = mutations.map(seq => seq.map(function_synonyms_1.normalizeFunctionName));
+    // Combine all
+    const allSequences = [...normalized, ...normalizedWalks, ...normalizedMutations];
+    // Validate: only keep valid physics sequences
+    let valid = allSequences.filter(seq => (0, software_physics_1.isValidPhysicsSequence)(seq).valid);
+    // Deduplicate
+    const seen = new Set();
+    const unique = [];
+    for (const seq of valid) {
+        const key = seq.join("→");
+        if (!seen.has(key) && seq.length >= 2) {
+            seen.add(key);
+            unique.push(seq);
+        }
+    }
+    return {
+        sequences: unique,
+        report: {
+            sourceRepos: protocol_mining_1.MINING_SIGNATURES.length + trajectory_corpus_1.EXPANDED_TRAJECTORIES.length,
+            sourceSequences: sourceCount,
+            randomWalks: walks.length,
+            mutations: mutations.length,
+            totalCollected: allSequences.length,
+            validSequences: valid.length,
+            duplicateRemoved: valid.length - unique.length,
+            finalCorpusSize: unique.length,
+        },
+    };
+}
+function printCollectionReport(report) {
+    console.log("\n─── Scale Trajectory Collection Report ───");
+    console.log(`  Source Repos:        ${report.sourceRepos}`);
+    console.log(`  Source Sequences:    ${report.sourceSequences}`);
+    console.log(`  Random Walks:        ${report.randomWalks}`);
+    console.log(`  Mutations:           ${report.mutations}`);
+    console.log(`  Total Collected:     ${report.totalCollected}`);
+    console.log(`  Valid Sequences:     ${report.validSequences}`);
+    console.log(`  Duplicates Removed:  ${report.duplicateRemoved}`);
+    console.log(`  Final Corpus Size:   ${report.finalCorpusSize}`);
+    console.log();
+}

package/dist/sdk.js

@@ -0,0 +1,250 @@
+"use strict";
+/**
+ * Progmune SDK — Simple one-call API for AI Code Governance
+ *
+ * Usage:
+ *   import { verify } from "@progmune/sdk"
+ *   const result = await verify("./src/server.ts")
+ *
+ * Returns everything a developer needs in one call:
+ *   certificate, knowledge version, stable protocols, risk level
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RUNTIME_VERSION = void 0;
+exports.verify = verify;
+exports.fix = fix;
+exports.explain = explain;
+exports.getCompatibility = getCompatibility;
+const certify_1 = require("./certify");
+const risk_model_1 = require("./risk-model");
+const protocol_knowledge_1 = require("./protocol-knowledge");
+const evidence_repository_1 = require("./evidence-repository");
+/** Runtime version — stable public identifier. Internal layers evolve underneath. */
+exports.RUNTIME_VERSION = "1.0.0";
+function verify(filePath) {
+    const cert = (0, certify_1.certify)(filePath);
+    const kb = (0, protocol_knowledge_1.buildKnowledgeBase)();
+    const er = (0, evidence_repository_1.buildEvidenceRepository)();
+    const risk = (0, risk_model_1.assessRisk)(["SSL_CTX_new", "SSL_connect"]);
+    // Decision: Risk → Policy → Decision
+    let decision;
+    if (risk.riskLevel === "Critical")
+        decision = "BLOCK";
+    else if (risk.riskLevel === "High")
+        decision = "WARN";
+    else
+        decision = "ALLOW";
+    // Knowledge Network context
+    let network;
+    try {
+        const { buildKnowledgeGraph, getDependencies, getDependents } = require("./knowledge-graph");
+        const g = buildKnowledgeGraph();
+        const related = [...new Set([
+                ...getDependencies(g, "PROTO-TLS").map((n) => n.name),
+                ...getDependents(g, "PROTO-TLS").map((n) => n.name),
+            ])];
+        network = { totalNodes: g.nodes.length, totalEdges: g.edges.length, relatedProtocols: related };
+    }
+    catch { /* graph unavailable */ }
+    return {
+        runtimeVersion: exports.RUNTIME_VERSION,
+        decision,
+        certificate: cert,
+        knowledge: {
+            version: kb.version,
+            stableProtocols: kb.summary.byMaturity["stable"],
+            totalProtocols: kb.summary.totalUnits,
+            averageConfidence: kb.summary.averageConfidence,
+        },
+        evidence: {
+            totalRepos: er.summary.totalRepos,
+            totalSequences: er.summary.totalSequences,
+            topProtocols: er.summary.topProtocols.slice(0, 3).map(t => t.protocol),
+        },
+        risk: {
+            level: risk.riskLevel,
+            recommendation: risk.recommendation,
+            patterns: risk.patterns.map(p => ({
+                name: p.patternName, severity: p.severity, confidence: p.confidence,
+                concept: p.concept, detail: p.detail,
+            })),
+        },
+        network,
+        timestamp: new Date().toISOString(),
+    };
+}
+/**
+ * Analyze a project and return actionable fix suggestions.
+ *
+ * Uses the Trust Engine (SSG state machine + Express/NestJS framework
+ * detectors) to find protocol violations, then extracts concrete
+ * repair steps — BFS-computed fix paths, middleware additions,
+ * decorator insertions, etc.
+ *
+ * Usage:
+ *   const result = await fix("./my-project")
+ *   if (result.possible) {
+ *     for (const s of result.suggestions) {
+ *       console.log(s.file, s.fix)
+ *     }
+ *   }
+ */
+async function fix(projectPath) {
+    try {
+        // Lazy-require trust engine to avoid circular deps at module load
+        const { evaluateTrust } = require("./trust/engine");
+        const decision = await evaluateTrust({
+            projectPath,
+            projectName: projectPath.split("/").pop() || "unknown",
+            commit: "working-tree",
+            language: "typescript",
+        });
+        const suggestions = [];
+        const seen = new Set(); // deduplicate by file + ruleId
+        for (const v of decision.violations) {
+            if (!v.fix)
+                continue;
+            // Deduplicate: same file + same rule → report once
+            const dedupKey = `${v.file}::${v.rule_id}`;
+            if (seen.has(dedupKey))
+                continue;
+            seen.add(dedupKey);
+            const source = v.rule_id.startsWith("SSG_") ? "ssg" :
+                v.policy_ref === "framework.express" ? "express" :
+                    v.policy_ref === "framework.nestjs" ? "nestjs" :
+                        v.policy_ref?.startsWith("protocol") ? "protocol" : "policy";
+            // Extract BFS fix path from SSG violations
+            let fixPath;
+            if (source === "ssg") {
+                const match = v.fix.match(/Insert before the violating call:\s*(.+)/);
+                if (match) {
+                    fixPath = match[1].split(" → ").map((s) => s.trim()).filter(Boolean);
+                }
+            }
+            suggestions.push({
+                file: v.file || projectPath,
+                severity: v.severity,
+                ruleId: v.rule_id,
+                message: v.message,
+                fix: v.fix,
+                fixPath: fixPath?.length ? fixPath : undefined,
+                source,
+            });
+        }
+        // Sort: critical first, then by file
+        suggestions.sort((a, b) => {
+            const sev = { critical: 0, high: 1, medium: 2, low: 3 };
+            const sa = sev[a.severity] ?? 4;
+            const sb = sev[b.severity] ?? 4;
+            if (sa !== sb)
+                return sa - sb;
+            return a.file.localeCompare(b.file);
+        });
+        return {
+            possible: suggestions.length > 0,
+            totalIssues: decision.violations.length,
+            fixableIssues: suggestions.length,
+            suggestions,
+            summary: suggestions.length > 0
+                ? `Found ${suggestions.length} fixable issue(s) across ${new Set(suggestions.map(s => s.file)).size} file(s).`
+                : "No fixable issues found. The project passes all protocol checks.",
+        };
+    }
+    catch (e) {
+        return {
+            possible: false,
+            totalIssues: 0,
+            fixableIssues: 0,
+            suggestions: [],
+            summary: `Fix analysis failed: ${e.message || "unknown error"}`,
+        };
+    }
+}
+/**
+ * explain() — Human-readable governance explanation.
+ * Answers: WHY is this risk Critical? WHAT knowledge backs it?
+ */
+function explain(result) {
+    const lines = [];
+    lines.push("Progmune Governance Explanation");
+    lines.push(`Runtime v${result.runtimeVersion}  |  Decision: ${result.decision}`);
+    lines.push("================================\n");
+    lines.push(`Risk Level: ${result.risk.level}`);
+    lines.push(`Recommendation: ${result.risk.recommendation}\n`);
+    if (result.risk.patterns.length > 0) {
+        lines.push("Risk Patterns Detected:");
+        for (const p of result.risk.patterns) {
+            lines.push(`  - ${p.name} (${p.severity}, ${p.confidence}% confidence)`);
+            if (p.concept)
+                lines.push(`    Missing concept: ${p.concept}`);
+            lines.push(`    ${p.detail}`);
+        }
+        lines.push("");
+    }
+    else {
+        lines.push("No risk patterns detected. Code appears protocol-compliant.\n");
+    }
+    lines.push("Knowledge Backing:");
+    lines.push(`  Protocol Knowledge Base v${result.knowledge.version}`);
+    lines.push(`  ${result.knowledge.stableProtocols} stable protocol domains with ${result.knowledge.averageConfidence}% avg confidence`);
+    lines.push(`  Evidence from ${result.evidence.totalRepos} repositories (${result.evidence.totalSequences} validated sequences)`);
+    lines.push(`  Top protocols: ${result.evidence.topProtocols.join(", ")}`);
+    if (result.certificate.kbAssets?.length) {
+        lines.push("\nVerified Against:");
+        for (const a of result.certificate.kbAssets) {
+            const rfc = a.rfc ? ` (${a.rfc})` : "";
+            lines.push(`  ${a.name} v${a.version} — ${a.confidence}% confidence${rfc}`);
+        }
+    }
+    if (result.network && result.network.relatedProtocols.length > 0) {
+        lines.push(`\nProtocol Network Context:`);
+        lines.push(`  ${result.network.totalNodes} nodes, ${result.network.totalEdges} edges in Knowledge Graph`);
+        lines.push(`  Related: ${result.network.relatedProtocols.join(" · ")}`);
+    }
+    return lines.join("\n");
+}
+function getCompatibility() {
+    const kb = (0, protocol_knowledge_1.buildKnowledgeBase)();
+    return {
+        sdkVersion: "1.0.0",
+        knowledgeVersion: kb.version,
+        protocols: kb.units.filter((u) => u.maturity === "stable").map((u) => u.name),
+        compatibleWith: [
+            { component: "Policy Engine", version: "2.0.0", compatible: true, notes: "All 8 rules operational" },
+            { component: "Certificate", version: "2.0.0", compatible: true, notes: "Ontology-backed certificates" },
+            { component: "GitHub Action", version: "1.0.0", compatible: true, notes: "CI deploy gate active" },
+            { component: "Knowledge API", version: "1.0.0", compatible: true, notes: "All endpoints operational" },
+            { component: "Dashboard", version: "1.0.0", compatible: true, notes: "Governance KPIs active" },
+            { component: "Verification API", version: "1.0.0", compatible: true, notes: "External verification active" },
+        ],
+    };
+}
+// ═══════════════════════════════════════════════════════════════
+// CLI
+// ═══════════════════════════════════════════════════════════════
+if (require.main === module) {
+    const args = process.argv.slice(2);
+    if (args[0] === "compat") {
+        console.log(JSON.stringify(getCompatibility(), null, 2));
+    }
+    else if (args[0] === "explain" && args[1]) {
+        const result = verify(args[1]);
+        console.log(explain(result));
+    }
+    else {
+        const filePath = args[0] || ".";
+        try {
+            const result = verify(filePath);
+            if (args.includes("--explain")) {
+                console.log(explain(result));
+            }
+            else {
+                console.log(JSON.stringify(result, null, 2));
+            }
+        }
+        catch (e) {
+            console.error(JSON.stringify({ error: e.message }));
+            process.exit(1);
+        }
+    }
+}

package/dist/search-planner.js

@@ -1,54 +1,17 @@
 "use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.searchPlan = searchPlan;
 const validator_1 = require("./validator");
 const llm_1 = require("./llm");
 const feedback_1 = require("./feedback");
 const utils_1 = require("./utils");
-const fs = __importStar(require("fs"));
+const ir_utils_1 = require("./ir-utils");
 // ⚖️ 可调权重（修改这些值后重新运行压力测试即可）
 const WEIGHT_STATIC_SCORE = 0.3; // 静态文本相似度的权重
 const WEIGHT_LLM_SCORE = 0.7; // LLM 评分的权重
 const WEIGHT_HISTORY = 0.4; // 反馈系统成功率的权重
 const WEIGHT_GOAL_COMPLETION = 0.5; // 目标完成奖励
 const STATIC_HIGH_THRESHOLD = 0.6; // 静态评分超过此值时，跳过LLM调用
-function loadIR() {
-    const raw = JSON.parse(fs.readFileSync("ir.json", "utf-8"));
-    return Array.isArray(raw) ? raw : (raw.functions || []);
-}
 const staticScoreCache = new Map();
 function getStaticScore(funcName, goal) {
     const key = `${funcName}|${goal}`;
@@ -90,7 +53,7 @@ async function decomposeGoals(intent, functions) {
             return result.slice(0, 3);
         }
     }
-    catch { }
+    catch { /* LLM score fallback */ }
     return [intent];
 }
 /** 批量评分：将同一 goal 的所有候选函数打包为一次 LLM 调用 */
@@ -120,7 +83,7 @@ async function batchScoreFuncs(funcs, goal) {
             }
         }
     }
-    catch { }
+    catch { /* LLM score fallback */ }
     for (const f of needsLLM) {
         if (!result.has(f.name))
             result.set(f.name, 0.3);
@@ -131,7 +94,7 @@ async function batchScoreFuncs(funcs, goal) {
 async function searchPlan(intent, beamWidth = 2, maxDepth = 6) {
     (0, llm_1.resetCallCount)();
     staticScoreCache.clear();
-    const ir = loadIR();
+    const ir = (0, ir_utils_1.loadIR)();
     const goals = await decomposeGoals(intent, ir);
     console.log("🎯 目标栈:", goals);
     let beam = [{

package/dist/semantic-snapshot.js

@@ -96,7 +96,7 @@ function listSnapshots() {
             try {
                 snapshots.push(JSON.parse(fs.readFileSync(path.join(SNAPSHOT_DIR, file), "utf-8")));
             }
-            catch { }
+            catch { /* snapshot may be unavailable */ }
         }
     }
     snapshots.sort((a, b) => b.timestamp.localeCompare(a.timestamp));

package/dist/semantic-topology.js

@@ -10,6 +10,39 @@
  *
  * Replaces simple string matching in capability search.
  */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.SemanticTopology = void 0;
 exports.getTopology = getTopology;
@@ -144,17 +177,105 @@ class SemanticTopology {
     get size() { return this.nodes.size; }
 }
 exports.SemanticTopology = SemanticTopology;
+// ── Persistence cache: avoid O(n²) rebuild on every run ──
+const crypto = __importStar(require("crypto"));
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const CACHE_DIR = path.resolve(__dirname, "..", ".progmune");
+const TOPO_CACHE = path.join(CACHE_DIR, "topology.json");
+function irHash(ir) {
+    // Include protocol + capability metadata in hash — if annotations change,
+    // the cached topology must be invalidated even if function names stay same.
+    return crypto.createHash("md5")
+        .update(JSON.stringify(ir.map((f) => ({
+        name: f.name,
+        file: f.file,
+        protocol: f.protocol,
+        purpose: f.purpose,
+        requires: f.requires,
+        produces: f.produces,
+    }))))
+        .digest("hex");
+}
+function serializeTopology(topo, hash) {
+    try {
+        if (!fs.existsSync(CACHE_DIR))
+            fs.mkdirSync(CACHE_DIR, { recursive: true });
+        const data = {
+            hash,
+            nodes: [...topo["nodes"].entries()].map(([name, n]) => ({
+                name, file: n.file, tags: [...n.tags], purposeWords: [...n.purposeWords],
+                produces: [...n.produces], requires: [...n.requires],
+            })),
+            edges: [...topo["edges"].entries()].map(([name, edges]) => ({
+                name, edges: edges.map((e) => ({ source: e.source, target: e.target, weight: e.weight, reason: e.reason })),
+            })),
+        };
+        fs.writeFileSync(TOPO_CACHE, JSON.stringify(data));
+    }
+    catch { /* best-effort cache write */ }
+}
+function deserializeTopology() {
+    try {
+        if (!fs.existsSync(TOPO_CACHE))
+            return null;
+        const data = JSON.parse(fs.readFileSync(TOPO_CACHE, "utf-8"));
+        const topo = new SemanticTopology();
+        for (const n of data.nodes) {
+            topo["nodes"].set(n.name, {
+                name: n.name, file: n.file,
+                tags: new Set(n.tags), purposeWords: new Set(n.purposeWords),
+                produces: new Set(n.produces), requires: new Set(n.requires),
+            });
+        }
+        for (const e of data.edges) {
+            topo["edges"].set(e.name, e.edges);
+            for (const edge of e.edges) {
+                const key = edge.source < edge.target ? `${edge.source}::${edge.target}` : `${edge.target}::${edge.source}`;
+                topo["similarityCache"].set(key, Math.max(topo["similarityCache"].get(key) || 0, edge.weight));
+            }
+        }
+        return topo;
+    }
+    catch {
+        return null;
+    }
+}
 // Singleton
 let _topology = null;
+let _topoHash = null;
 function getTopology(ir) {
     if (!_topology && ir) {
+        const hash = irHash(ir);
+        // Try disk cache first
+        try {
+            if (fs.existsSync(TOPO_CACHE)) {
+                const cached = JSON.parse(fs.readFileSync(TOPO_CACHE, "utf-8"));
+                if (cached.hash === hash) {
+                    _topology = deserializeTopology();
+                    if (_topology) {
+                        _topoHash = hash;
+                        console.error("[Topology] 从缓存加载 (%d 节点)", _topology.size);
+                        return _topology;
+                    }
+                }
+            }
+        }
+        catch { /* fall through to build */ }
+        // Build from scratch
+        const start = Date.now();
         _topology = new SemanticTopology();
         _topology.build(ir);
+        _topoHash = hash;
+        console.error("[Topology] 构建完成 (%d 节点, %dms)", _topology.size, Date.now() - start);
+        serializeTopology(_topology, hash);
     }
     return _topology || new SemanticTopology();
 }
 function rebuildTopology(ir) {
     _topology = new SemanticTopology();
     _topology.build(ir);
+    _topoHash = irHash(ir);
+    serializeTopology(_topology, _topoHash);
     return _topology;
 }