opencode-telos 1.0.0

package/dist/sdd/persistence/yaml.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"yaml.d.ts","sourceRoot":"","sources":["../../../src/sdd/persistence/yaml.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACrG,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAChD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAA;AAItD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,CAAC,CAG/C;AAED,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,CAU/D;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,CAAC,CAG/C;AAED,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,CAI/D;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAI/C;AAED,wBAAgB,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAEpD;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAYvE;AAED,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAMlD;AAYD;;;;GAIG;AACH,qBAAa,mBAAoB,YAAW,eAAe;IACzD,OAAO,CAAC,OAAO,CAAQ;IACvB,OAAO,CAAC,SAAS,CAAQ;IACzB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAqC;gBAE7C,UAAU,EAAE,MAAM;IAK9B,YAAY,IAAI,IAAI;IASpB,aAAa,IAAI,OAAO;IAIxB,SAAS,IAAI,cAAc;IAwD3B,UAAU,IAAI,YAAY;IAQ1B,SAAS,CAAC,KAAK,EAAE,cAAc,GAAG,IAAI;IA2GtC,cAAc,IAAI,MAAM;IAIxB,YAAY,IAAI,OAAO;IAWvB,eAAe,IAAI,IAAI;IAIvB,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,cAAc;IA8BpF,cAAc,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;IAS3C,aAAa,IAAI,MAAM,EAAE;IAQzB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,eAAe;IAgBzE,YAAY,IAAI,MAAM;IAatB,oBAAoB,IAAI,MAAM;IAM9B,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE;IAczC,gBAAgB,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO,EAAE;IAK/C,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAM5C,uBAAuB,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,EAAE;CAIxD"}

package/dist/sdd/persistence/yaml.js

@@ -0,0 +1,382 @@
+import * as yaml from "js-yaml";
+import { readFileSync, writeFileSync, existsSync, mkdirSync, readdirSync } from "fs";
+import { join, dirname } from "path";
+import { GraphIndices } from "../graph/index.js";
+import { getCacheManager } from "../cache/manager.js";
+import { recordLegitimateSave, validateGraphIntegrity } from "../graph/integrity-guard.js";
+export function readYaml(filePath) {
+    const content = readFileSync(filePath, "utf-8");
+    return yaml.load(content);
+}
+export function writeYaml(filePath, data) {
+    const dir = dirname(filePath);
+    if (!existsSync(dir))
+        mkdirSync(dir, { recursive: true });
+    const content = yaml.dump(data, {
+        noRefs: true,
+        lineWidth: 120,
+        quotingType: '"',
+        forceQuotes: false,
+    });
+    writeFileSync(filePath, content, "utf-8");
+}
+export function readJson(filePath) {
+    const content = readFileSync(filePath, "utf-8");
+    return JSON.parse(content);
+}
+export function writeJson(filePath, data) {
+    const dir = dirname(filePath);
+    if (!existsSync(dir))
+        mkdirSync(dir, { recursive: true });
+    writeFileSync(filePath, JSON.stringify(data, null, 2), "utf-8");
+}
+export function ensureDir(dirPath) {
+    if (!existsSync(dirPath)) {
+        mkdirSync(dirPath, { recursive: true });
+    }
+}
+export function fileExists(filePath) {
+    return existsSync(filePath);
+}
+export function listFiles(dirPath, extension) {
+    if (!existsSync(dirPath))
+        return [];
+    const entries = readdirSync(dirPath, { withFileTypes: true });
+    const files = [];
+    for (const entry of entries) {
+        if (entry.isFile()) {
+            if (!extension || entry.name.endsWith(extension)) {
+                files.push(join(dirPath, entry.name));
+            }
+        }
+    }
+    return files;
+}
+export function listDirs(dirPath) {
+    if (!existsSync(dirPath))
+        return [];
+    const entries = readdirSync(dirPath, { withFileTypes: true });
+    return entries
+        .filter((e) => e.isDirectory())
+        .map((e) => join(dirPath, e.name));
+}
+// ── Repository ───────────────────────────────────────────────────────
+/**
+ * YAML-backed graph repository.
+ * Suitable for small to medium projects (<1000 nodes).
+ * Uses in-memory cache and pre-computed indices for fast queries.
+ */
+export class YamlGraphRepository {
+    baseDir;
+    graphPath;
+    static cache = new Map();
+    constructor(projectDir) {
+        this.baseDir = join(projectDir, ".sdd");
+        this.graphPath = join(this.baseDir, "graph.yaml");
+    }
+    ensureSddDir() {
+        ensureDir(this.baseDir);
+        ensureDir(join(this.baseDir, "nodes"));
+        ensureDir(join(this.baseDir, "relationships"));
+        ensureDir(join(this.baseDir, "changes"));
+        ensureDir(join(this.baseDir, "snapshots"));
+        ensureDir(join(this.baseDir, "transactions"));
+    }
+    isInitialized() {
+        return fileExists(this.graphPath);
+    }
+    loadGraph() {
+        if (!this.isInitialized()) {
+            throw new Error("SDD not initialized. Run sdd.initialize first.");
+        }
+        // Check cache with revalidation
+        const cached = YamlGraphRepository.cache.get(this.graphPath);
+        if (cached) {
+            // Revalidation: check if file was modified externally
+            const currentMtime = (() => { try {
+                return require("fs").statSync(this.graphPath).mtimeMs;
+            }
+            catch {
+                return 0;
+            } })();
+            if (currentMtime <= cached.lastModified) {
+                // Cache is valid — also check incremental hash
+                const cacheMgr = getCacheManager(require("path").dirname(this.baseDir));
+                if (cacheMgr.isGraphHashValid(cached.indices.totalNodes + ":" + cached.indices.totalRelationships)) {
+                    // Never expose the cached snapshot itself: callers intentionally
+                    // mutate the graph before saveGraph(), and leaking this reference
+                    // makes old/new comparisons impossible.
+                    return structuredClone(cached.graph);
+                }
+            }
+            // File was modified externally or hash mismatch, invalidate cache
+            YamlGraphRepository.cache.delete(this.graphPath);
+        }
+        // Cross-process check
+        const cacheMgr = getCacheManager(require("path").dirname(this.baseDir));
+        if (cacheMgr.checkCrossProcessInvalidation(this.graphPath)) {
+            YamlGraphRepository.cache.delete(this.graphPath);
+        }
+        const graph = readYaml(this.graphPath);
+        const indices = GraphIndices.from(graph);
+        const stat = (() => { try {
+            return require("fs").statSync(this.graphPath).mtimeMs;
+        }
+        catch {
+            return 0;
+        } })();
+        YamlGraphRepository.cache.set(this.graphPath, {
+            graph,
+            indices,
+            lastModified: stat,
+        });
+        // Initialize incremental hash
+        cacheMgr.initGraphHash(graph.nodes.length, graph.relationships.length);
+        // Anti-bypass: check for out-of-band modifications
+        const projectDir = require("path").dirname(this.baseDir);
+        try {
+            const tamperResult = validateGraphIntegrity(projectDir, graph);
+            if (tamperResult.tampered) {
+                // Graph was modified outside SDD workflow — attach warning to graph metadata
+                ;
+                graph.metadata.__tamper_warning = tamperResult.reason;
+            }
+        }
+        catch { }
+        return structuredClone(graph);
+    }
+    getIndices() {
+        const cached = YamlGraphRepository.cache.get(this.graphPath);
+        if (cached)
+            return cached.indices;
+        const graph = this.loadGraph();
+        return GraphIndices.from(graph);
+    }
+    saveGraph(graph) {
+        this.ensureSddDir();
+        // Acquire cross-process lock
+        const cacheMgr = getCacheManager(require("path").dirname(this.baseDir));
+        cacheMgr.acquireWriteLock();
+        try {
+            writeYaml(this.graphPath, graph);
+        }
+        finally {
+            cacheMgr.releaseWriteLock();
+        }
+        // Record legitimate save for anti-bypass integrity tracking
+        const projectDir = require("path").dirname(this.baseDir);
+        try {
+            recordLegitimateSave(projectDir, graph);
+        }
+        catch { }
+        // Keep an immutable cache snapshot.  Compute the dirty state before
+        // replacing it; doing this afterwards compares the new graph to itself.
+        const cached = YamlGraphRepository.cache.get(this.graphPath);
+        const { computeDirtyState } = require("../graph/index.js");
+        const snapshot = structuredClone(graph);
+        const dirty = computeDirtyState(cached?.graph || null, snapshot);
+        // Rebuilding the in-memory index is deterministic and avoids stale
+        // readonly totals/search entries after additions and removals. YAML is
+        // limited to small graphs; large graphs migrate to SQLite.
+        const indices = GraphIndices.from(snapshot);
+        YamlGraphRepository.cache.set(this.graphPath, {
+            graph: snapshot,
+            indices,
+            lastModified: Date.now(),
+        });
+        /*
+        if (cached) {
+          // Compute dirty nodes incrementally
+          const oldGraph = cached.graph
+          const { computeDirtyState } = require("../graph/index.js")
+          const dirty = computeDirtyState(oldGraph, graph)
+    
+          if (!dirty.allChanged && dirty.dirtyNodeIds.size <= 50) {
+            // Incremental update: modify only affected entries
+            for (const nodeId of dirty.dirtyNodeIds) {
+              const oldNode = oldGraph.nodes.find(n => n.id === nodeId)
+              const newNode = graph.nodes.find(n => n.id === nodeId)
+              if (oldNode && newNode) {
+                cached.indices.updateNode(oldNode, newNode)
+              } else if (newNode) {
+                cached.indices.addNode(newNode)
+              } else if (oldNode) {
+                cached.indices.removeNode(nodeId)
+              }
+            }
+            // Update relationship indices incrementally
+            const oldRelKeys = new Set(oldGraph.relationships.map(r => `${r.from}||${r.to}||${r.type}`))
+            const newRelKeys = new Set(graph.relationships.map(r => `${r.from}||${r.to}||${r.type}`))
+            for (const rel of graph.relationships) {
+              const key = `${rel.from}||${rel.to}||${rel.type}`
+              if (!oldRelKeys.has(key)) {
+                cached.indices.addRelationship(rel)
+              }
+            }
+            for (const rel of oldGraph.relationships) {
+              const key = `${rel.from}||${rel.to}||${rel.type}`
+              if (!newRelKeys.has(key)) {
+                cached.indices.removeRelationship(rel)
+              }
+            }
+          } else {
+            // Full rebuild needed
+            YamlGraphRepository.cache.delete(this.graphPath)
+            const indices = GraphIndices.from(graph)
+            YamlGraphRepository.cache.set(this.graphPath, {
+              graph,
+              indices,
+              lastModified: Date.now(),
+            })
+          }
+        } else {
+          // No previous cache, full build
+          const indices = GraphIndices.from(graph)
+          YamlGraphRepository.cache.set(this.graphPath, {
+            graph,
+            indices,
+            lastModified: Date.now(),
+          })
+        }
+        */
+        // Update incremental hash
+        cacheMgr.initGraphHash(graph.nodes.length, graph.relationships.length);
+        // A: Granular invalidation — only invalidate caches for changed types
+        if (dirty.allChanged || dirty.dirtyTypes.size > 10) {
+            // Too many types changed — full invalidation is faster
+            cacheMgr.invalidateAll();
+        }
+        else if (dirty.dirtyTypes.size > 0) {
+            // A: Partial invalidation — only affected types
+            cacheMgr.invalidatePartial([...dirty.dirtyTypes]);
+        }
+        // G: Save graph snapshot to disk for cross-session restore
+        cacheMgr.saveGraphSnapshot(graph);
+    }
+    getStorageType() {
+        return "yaml";
+    }
+    isCacheValid() {
+        const cached = YamlGraphRepository.cache.get(this.graphPath);
+        if (!cached)
+            return false;
+        try {
+            const stat = require("fs").statSync(this.graphPath);
+            return stat.mtimeMs <= cached.lastModified;
+        }
+        catch {
+            return false;
+        }
+    }
+    invalidateCache() {
+        YamlGraphRepository.cache.delete(this.graphPath);
+    }
+    createProject(projectId, name, description) {
+        this.ensureSddDir();
+        const now = new Date().toISOString();
+        const graph = {
+            version: "1.0.0",
+            project_id: projectId,
+            nodes: [
+                {
+                    id: projectId,
+                    type: "project",
+                    name,
+                    description,
+                    status: "DRAFT",
+                    version: 1,
+                    metadata: { name, description },
+                    created_at: now,
+                    updated_at: now,
+                },
+            ],
+            relationships: [],
+            metadata: {
+                created_at: now,
+                updated_at: now,
+                sdd_version: "1.0.0",
+            },
+        };
+        this.saveGraph(graph);
+        return graph;
+    }
+    createSnapshot(description) {
+        const graph = this.loadGraph();
+        const timestamp = new Date().toISOString().replace(/[:.]/g, "-");
+        const snapshotId = `snapshot-${timestamp}`;
+        const snapshotPath = join(this.baseDir, "snapshots", `${snapshotId}.yaml`);
+        writeYaml(snapshotPath, { id: snapshotId, timestamp: new Date().toISOString(), description, graph_state: graph });
+        return snapshotId;
+    }
+    listSnapshots() {
+        const snapDir = join(this.baseDir, "snapshots");
+        // Get both YAML files and directories (for snapshot folders)
+        const yamlFiles = listFiles(snapDir, ".yaml");
+        const dirs = listDirs(snapDir);
+        return [...yamlFiles, ...dirs];
+    }
+    migrateTo(target, projectDir) {
+        const graph = this.loadGraph();
+        if (target === "sqlite") {
+            const { SqliteGraphRepository } = require("./sqlite.js");
+            const repo = new SqliteGraphRepository(projectDir);
+            repo.saveGraph(graph);
+            return repo;
+        }
+        // Already YAML
+        return this;
+    }
+    // ── Optimized queries (use indices) ─────────────────────────────
+    getNodeCount() {
+        const cached = YamlGraphRepository.cache.get(this.graphPath);
+        if (cached)
+            return cached.indices.totalNodes;
+        // Quick count without full parse
+        try {
+            const content = readFileSync(this.graphPath, "utf-8");
+            const matches = content.match(/^  - id:/gm);
+            return matches ? matches.length : 0;
+        }
+        catch {
+            return 0;
+        }
+    }
+    getRelationshipCount() {
+        const cached = YamlGraphRepository.cache.get(this.graphPath);
+        if (cached)
+            return cached.indices.totalRelationships;
+        return 0;
+    }
+    getNodesByType(type) {
+        // Check per-type cache first
+        const cacheMgr = getCacheManager(require("path").dirname(this.baseDir));
+        const graphVersion = (() => { try {
+            return this.loadGraph().metadata.updated_at;
+        }
+        catch {
+            return "";
+        } })();
+        const versionNum = graphVersion ? new Date(graphVersion).getTime() : 0;
+        const cached = cacheMgr.getCachedNodesByType(type, versionNum);
+        if (cached)
+            return cached;
+        const indices = this.getIndices();
+        const nodes = indices.getNodesByType(type);
+        cacheMgr.setCachedNodesByType(type, nodes, versionNum);
+        return nodes;
+    }
+    getNodesByStatus(status) {
+        const indices = this.getIndices();
+        return indices.getNodesByStatus(status);
+    }
+    getNodeById(id) {
+        // Check byId map directly (O(1))
+        const indices = this.getIndices();
+        return indices.byId.get(id);
+    }
+    getRelationshipsForNode(nodeId) {
+        const indices = this.getIndices();
+        return indices.getRelationships(nodeId);
+    }
+}
+//# sourceMappingURL=yaml.js.map

package/dist/sdd/persistence/yaml.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"yaml.js","sourceRoot":"","sources":["../../../src/sdd/persistence/yaml.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,SAAS,CAAA;AAC/B,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,IAAI,CAAA;AACpF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAA;AAEpC,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAEhD,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAA;AACrD,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAmB,MAAM,6BAA6B,CAAA;AAE3G,MAAM,UAAU,QAAQ,CAAI,QAAgB;IAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAM,CAAA;AAChC,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,IAAa;IACvD,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAA;IAC7B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IACzD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;QAC9B,MAAM,EAAE,IAAI;QACZ,SAAS,EAAE,GAAG;QACd,WAAW,EAAE,GAAG;QAChB,WAAW,EAAE,KAAK;KACnB,CAAC,CAAA;IACF,aAAa,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;AAC3C,CAAC;AAED,MAAM,UAAU,QAAQ,CAAI,QAAgB;IAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IAC/C,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAM,CAAA;AACjC,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,IAAa;IACvD,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAA;IAC7B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IACzD,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;AACjE,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,OAAe;IACvC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACzB,SAAS,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IACzC,CAAC;AACH,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,QAAgB;IACzC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAA;AAC7B,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,OAAe,EAAE,SAAkB;IAC3D,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,EAAE,CAAA;IACnC,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAA;IAC7D,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,OAAe;IACtC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,EAAE,CAAA;IACnC,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAA;IAC7D,OAAO,OAAO;SACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;AACtC,CAAC;AAUD,wEAAwE;AAExE;;;;GAIG;AACH,MAAM,OAAO,mBAAmB;IACtB,OAAO,CAAQ;IACf,SAAS,CAAQ;IACjB,MAAM,CAAC,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAA;IAEzD,YAAY,UAAkB;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAA;QACvC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IACnD,CAAC;IAED,YAAY;QACV,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACvB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAA;QACtC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAA;QAC9C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAA;QACxC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAA;QAC1C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAA;IAC/C,CAAC;IAED,aAAa;QACX,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IACnC,CAAC;IAED,SAAS;QACP,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAA;QACnE,CAAC;QAED,gCAAgC;QAChC,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC5D,IAAI,MAAM,EAAE,CAAC;YACX,sDAAsD;YACtD,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;gBAAC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAA;YAAC,CAAC;YAAC,MAAM,CAAC;gBAAC,OAAO,CAAC,CAAA;YAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YACnH,IAAI,YAAY,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBACxC,+CAA+C;gBAC/C,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAA;gBACvE,IAAI,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,GAAG,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;oBACnG,iEAAiE;oBACjE,kEAAkE;oBAClE,wCAAwC;oBACxC,OAAO,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;gBACtC,CAAC;YACH,CAAC;YACD,kEAAkE;YAClE,mBAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAClD,CAAC;QAED,sBAAsB;QACtB,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAA;QACvE,IAAI,QAAQ,CAAC,6BAA6B,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YAC3D,mBAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAClD,CAAC;QAED,MAAM,KAAK,GAAG,QAAQ,CAAiB,IAAI,CAAC,SAAS,CAAC,CAAA;QACtD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,MAAM,IAAI,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;YAAC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAA;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO,CAAC,CAAA;QAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAE3G,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE;YAC5C,KAAK;YACL,OAAO;YACP,YAAY,EAAE,IAAI;SACnB,CAAC,CAAA;QAEF,8BAA8B;QAC9B,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;QAEtE,mDAAmD;QACnD,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxD,IAAI,CAAC;YACH,MAAM,YAAY,GAAG,sBAAsB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;YAC9D,IAAI,YAAY,CAAC,QAAQ,EAAE,CAAC;gBAC1B,6EAA6E;gBAC7E,CAAC;gBAAC,KAAK,CAAC,QAAgB,CAAC,gBAAgB,GAAG,YAAY,CAAC,MAAM,CAAA;YACjE,CAAC;QACH,CAAC;QAAC,MAAM,CAAC,CAAA,CAAC;QAEV,OAAO,eAAe,CAAC,KAAK,CAAC,CAAA;IAC/B,CAAC;IAED,UAAU;QACR,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC5D,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC,OAAO,CAAA;QAEjC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAA;QAC9B,OAAO,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IAED,SAAS,CAAC,KAAqB;QAC7B,IAAI,CAAC,YAAY,EAAE,CAAA;QAEnB,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAA;QACvE,QAAQ,CAAC,gBAAgB,EAAE,CAAA;QAE3B,IAAI,CAAC;YACH,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAA;QAClC,CAAC;gBAAS,CAAC;YACT,QAAQ,CAAC,gBAAgB,EAAE,CAAA;QAC7B,CAAC;QAED,4DAA4D;QAC5D,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxD,IAAI,CAAC;YACH,oBAAoB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;QACzC,CAAC;QAAC,MAAM,CAAC,CAAA,CAAC;QAEV,oEAAoE;QACpE,wEAAwE;QACxE,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC5D,MAAM,EAAE,iBAAiB,EAAE,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAA;QAC1D,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAmB,CAAA;QACzD,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,EAAE,KAAK,IAAI,IAAI,EAAE,QAAQ,CAAC,CAAA;QAEhE,mEAAmE;QACnE,uEAAuE;QACvE,2DAA2D;QAC3D,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC3C,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE;YAC5C,KAAK,EAAE,QAAQ;YACf,OAAO;YACP,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;SACzB,CAAC,CAAA;QACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UAsDE;QAEF,0BAA0B;QAC1B,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;QAEtE,sEAAsE;QACtE,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC;YACnD,uDAAuD;YACvD,QAAQ,CAAC,aAAa,EAAE,CAAA;QAC1B,CAAC;aAAM,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACrC,gDAAgD;YAChD,QAAQ,CAAC,iBAAiB,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAA;QACnD,CAAC;QAED,2DAA2D;QAC3D,QAAQ,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAA;IACnC,CAAC;IAED,cAAc;QACZ,OAAO,MAAM,CAAA;IACf,CAAC;IAED,YAAY;QACV,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC5D,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAA;QACzB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;YACnD,OAAO,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,YAAY,CAAA;QAC5C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IAED,eAAe;QACb,mBAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAClD,CAAC;IAED,aAAa,CAAC,SAAiB,EAAE,IAAY,EAAE,WAAoB;QACjE,IAAI,CAAC,YAAY,EAAE,CAAA;QACnB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAA;QACpC,MAAM,KAAK,GAAmB;YAC5B,OAAO,EAAE,OAAO;YAChB,UAAU,EAAE,SAAS;YACrB,KAAK,EAAE;gBACL;oBACE,EAAE,EAAE,SAAS;oBACb,IAAI,EAAE,SAAS;oBACf,IAAI;oBACJ,WAAW;oBACX,MAAM,EAAE,OAAO;oBACf,OAAO,EAAE,CAAC;oBACV,QAAQ,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE;oBAC/B,UAAU,EAAE,GAAG;oBACf,UAAU,EAAE,GAAG;iBAChB;aACF;YACD,aAAa,EAAE,EAAE;YACjB,QAAQ,EAAE;gBACR,UAAU,EAAE,GAAG;gBACf,UAAU,EAAE,GAAG;gBACf,WAAW,EAAE,OAAO;aACrB;SACF,CAAA;QACD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QACrB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,cAAc,CAAC,WAAmB;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAA;QAC9B,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;QAChE,MAAM,UAAU,GAAG,YAAY,SAAS,EAAE,CAAA;QAC1C,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,UAAU,OAAO,CAAC,CAAA;QAC1E,SAAS,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAA;QACjH,OAAO,UAAU,CAAA;IACnB,CAAC;IAED,aAAa;QACX,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAA;QAC/C,6DAA6D;QAC7D,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;QAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,OAAO,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC,CAAA;IAChC,CAAC;IAED,SAAS,CAAC,MAAyB,EAAE,UAAkB;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAA;QAE9B,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACxB,MAAM,EAAE,qBAAqB,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAA;YACxD,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,UAAU,CAAC,CAAA;YAClD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;YACrB,OAAO,IAAI,CAAA;QACb,CAAC;QAED,eAAe;QACf,OAAO,IAAI,CAAA;IACb,CAAC;IAED,mEAAmE;IAEnE,YAAY;QACV,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC5D,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC,OAAO,CAAC,UAAU,CAAA;QAC5C,iCAAiC;QACjC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;YACrD,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,CAAA;YAC3C,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACrC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IAED,oBAAoB;QAClB,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC5D,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAA;QACpD,OAAO,CAAC,CAAA;IACV,CAAC;IAED,cAAc,CAAC,IAAc;QAC3B,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAA;QACvE,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;YAAC,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAA;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO,EAAE,CAAA;QAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAC1G,MAAM,UAAU,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QACtE,MAAM,MAAM,GAAG,QAAQ,CAAC,oBAAoB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;QAC9D,IAAI,MAAM;YAAE,OAAO,MAAM,CAAA;QAEzB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAA;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QAC1C,QAAQ,CAAC,oBAAoB,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,CAAA;QACtD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,gBAAgB,CAAC,MAAkB;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAA;QACjC,OAAO,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;IACzC,CAAC;IAED,WAAW,CAAC,EAAU;QACpB,iCAAiC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAA;QACjC,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC7B,CAAC;IAED,uBAAuB,CAAC,MAAc;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAA;QACjC,OAAO,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;IACzC,CAAC"}

package/dist/sdd/promises/classifier.d.ts

@@ -0,0 +1,48 @@
+import type { KnowledgeGraph } from "../domain/types.js";
+import { GraphIndices } from "../graph/index.js";
+/**
+ * A dependency rule maps a keyword pattern to the graph infrastructure
+ * required to verify a promise. If the infrastructure doesn't exist
+ * in the graph, the promise is marked as "unverifiable".
+ *
+ * The AI can configure these rules to adapt to different project types.
+ */
+export interface DependencyRule {
+    /** Keywords that trigger this rule (any match activates it) */
+    keywords: string[];
+    /** Description of what this rule checks */
+    description: string;
+    /**
+     * Function that checks if the required infrastructure exists in the graph.
+     * Returns true if the promise CAN be verified (infrastructure exists).
+     */
+    checkExists: (graph: KnowledgeGraph, indices: GraphIndices) => boolean;
+}
+/**
+ * Default dependency rules for infrastructure detection.
+ * The AI can extend or override these per-project.
+ */
+export declare const DEFAULT_DEPENDENCY_RULES: DependencyRule[];
+/**
+ * Classify whether a promise is verifiable based on its description
+ * and the current graph state.
+ *
+ * The AI can pass custom rules to override or extend the defaults.
+ */
+export declare function classifyPromiseVerifiability(description: string, graph: KnowledgeGraph, customRules?: DependencyRule[]): {
+    verifiable: boolean;
+    reason?: string;
+};
+/**
+ * Batch classify a list of promises, returning those that are unverifiable.
+ */
+export declare function findUnverifiablePromises(promises: Array<{
+    id: string;
+    description: string;
+    status: string;
+}>, graph: KnowledgeGraph, customRules?: DependencyRule[]): Array<{
+    id: string;
+    description: string;
+    reason: string;
+}>;
+//# sourceMappingURL=classifier.d.ts.map

package/dist/sdd/promises/classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.d.ts","sourceRoot":"","sources":["../../../src/sdd/promises/classifier.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAA;AAExD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAEhD;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,EAAE,CAAA;IAClB,2CAA2C;IAC3C,WAAW,EAAE,MAAM,CAAA;IACnB;;;OAGG;IACH,WAAW,EAAE,CAAC,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,YAAY,KAAK,OAAO,CAAA;CACvE;AAED;;;GAGG;AACH,eAAO,MAAM,wBAAwB,EAAE,cAAc,EAiKpD,CAAA;AAED;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAC1C,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,cAAc,EACrB,WAAW,CAAC,EAAE,cAAc,EAAE,GAC7B;IAAE,UAAU,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAqB1C;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,QAAQ,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,EACpE,KAAK,EAAE,cAAc,EACrB,WAAW,CAAC,EAAE,cAAc,EAAE,GAC7B,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAsB5D"}

package/dist/sdd/promises/classifier.js

@@ -0,0 +1,215 @@
+import { getNodesByType } from "../graph/engine.js";
+import { GraphIndices } from "../graph/index.js";
+/**
+ * Default dependency rules for infrastructure detection.
+ * The AI can extend or override these per-project.
+ */
+export const DEFAULT_DEPENDENCY_RULES = [
+    {
+        keywords: ["docker", "container", "dockerfile", "docker-compose", "image"],
+        description: "Docker infrastructure required",
+        checkExists: (graph) => {
+            // Check for Docker-related architecture components
+            const archNodes = getNodesByType(graph, "architecture_component");
+            const hasDockerArch = archNodes.some(n => {
+                const tech = n.metadata.technology?.toLowerCase() || "";
+                return tech.includes("docker");
+            });
+            // Check for Docker files
+            const files = getNodesByType(graph, "file");
+            const hasDockerFiles = files.some(f => {
+                const path = f.metadata.path?.toLowerCase() || "";
+                return path.includes("dockerfile") || path.includes("docker-compose") || path.includes(".dockerignore");
+            });
+            return hasDockerArch || hasDockerFiles;
+        },
+    },
+    {
+        keywords: ["health check", "healthcheck", "liveness", "readiness", "probes"],
+        description: "Health check infrastructure required",
+        checkExists: (graph) => {
+            const archNodes = getNodesByType(graph, "architecture_component");
+            return archNodes.some(n => {
+                const name = n.name.toLowerCase();
+                const tech = n.metadata.technology?.toLowerCase() || "";
+                return name.includes("health") || name.includes("monitoring") || tech.includes("health");
+            });
+        },
+    },
+    {
+        keywords: ["rollback", "roll-back", "auto-rollback", "automático"],
+        description: "Rollback infrastructure required",
+        checkExists: (graph) => {
+            // Check for migration nodes with rollback scripts
+            const migrations = getNodesByType(graph, "migration");
+            if (migrations.length > 0)
+                return true;
+            // Check for architecture components related to deployment
+            const archNodes = getNodesByType(graph, "architecture_component");
+            return archNodes.some(n => {
+                const name = n.name.toLowerCase();
+                return name.includes("deploy") || name.includes("ci") || name.includes("cd");
+            });
+        },
+    },
+    {
+        keywords: ["dlq", "dead letter", "dead-letter", "idempotency", "idempotent"],
+        description: "Message queue infrastructure required",
+        checkExists: (graph) => {
+            const archNodes = getNodesByType(graph, "architecture_component");
+            return archNodes.some(n => {
+                const tech = n.metadata.technology?.toLowerCase() || "";
+                const name = n.name.toLowerCase();
+                return tech.includes("queue") || tech.includes("rabbitmq") || tech.includes("kafka") ||
+                    tech.includes("bull") || tech.includes("redis") ||
+                    name.includes("queue") || name.includes("worker") || name.includes("event");
+            });
+        },
+    },
+    {
+        keywords: ["observability", "observabilidade", "logging", "tracing", "metrics", "prometheus", "grafana", "datadog"],
+        description: "Observability stack required",
+        checkExists: (graph) => {
+            const archNodes = getNodesByType(graph, "architecture_component");
+            const hasObs = archNodes.some(n => {
+                const tech = n.metadata.technology?.toLowerCase() || "";
+                const name = n.name.toLowerCase();
+                return tech.includes("prometheus") || tech.includes("grafana") || tech.includes("datadog") ||
+                    tech.includes("opentelemetry") || tech.includes("otel") ||
+                    name.includes("observ") || name.includes("monitor") || name.includes("log");
+            });
+            // Also check for metric/alert nodes
+            const metrics = getNodesByType(graph, "metric");
+            const alerts = getNodesByType(graph, "alert");
+            return hasObs || metrics.length > 0 || alerts.length > 0;
+        },
+    },
+    {
+        keywords: ["semver", "semantic version", "versioning"],
+        description: "Versioning infrastructure required",
+        checkExists: (graph) => {
+            // Check for manifest/config files with versioning
+            const files = getNodesByType(graph, "file");
+            return files.some(f => {
+                const path = f.metadata.path?.toLowerCase() || "";
+                return path.includes("package.json") || path.includes("manifest") || path.includes("version");
+            });
+        },
+    },
+    {
+        keywords: ["performance", "perf", "latência", "response time", "tempo de resposta"],
+        description: "Performance measurement infrastructure required",
+        checkExists: (graph) => {
+            // Check for SLA nodes or metric nodes related to performance
+            const slas = getNodesByType(graph, "sla");
+            const metrics = getNodesByType(graph, "metric");
+            const hasPerfSla = slas.some(s => {
+                const metric = s.metadata.metric?.toLowerCase() || "";
+                return metric.includes("response") || metric.includes("latency") || metric.includes("performance");
+            });
+            const hasPerfMetric = metrics.some(m => {
+                const name = m.metadata.metric_name?.toLowerCase() || "";
+                return name.includes("response") || name.includes("latency") || name.includes("p99");
+            });
+            return hasPerfSla || hasPerfMetric;
+        },
+    },
+    {
+        keywords: ["cpt", "dynamic registration", "registro dinâmico"],
+        description: "Dynamic registration infrastructure required",
+        checkExists: (graph) => {
+            // Check for plugin system or module system architecture
+            const archNodes = getNodesByType(graph, "architecture_component");
+            return archNodes.some(n => {
+                const name = n.name.toLowerCase();
+                return name.includes("plugin") || name.includes("module") || name.includes("registry");
+            });
+        },
+    },
+    {
+        keywords: ["cli search", "busca cli", "search cli"],
+        description: "CLI search infrastructure required",
+        checkExists: (graph) => {
+            // Check for CLI-related architecture or files
+            const archNodes = getNodesByType(graph, "architecture_component");
+            const hasCliArch = archNodes.some(n => {
+                const name = n.name.toLowerCase();
+                return name.includes("cli") || name.includes("command");
+            });
+            const files = getNodesByType(graph, "file");
+            const hasCliFiles = files.some(f => {
+                const path = f.metadata.path?.toLowerCase() || "";
+                return path.includes("cli") || path.includes("command");
+            });
+            return hasCliArch || hasCliFiles;
+        },
+    },
+    {
+        keywords: ["layer ordering", "layer order", "ordering", "ordenação"],
+        description: "Layer ordering infrastructure required",
+        checkExists: (graph) => {
+            // Check for multiple architecture components with defined layers
+            const archNodes = getNodesByType(graph, "architecture_component");
+            const layers = new Set(archNodes.map(n => n.metadata.layer).filter(Boolean));
+            return layers.size >= 2;
+        },
+    },
+    {
+        keywords: ["checksum", "hash", "integridade"],
+        description: "Checksum infrastructure required",
+        checkExists: (graph) => {
+            // Check for build/deploy pipeline architecture
+            const archNodes = getNodesByType(graph, "architecture_component");
+            return archNodes.some(n => {
+                const name = n.name.toLowerCase();
+                return name.includes("build") || name.includes("pipeline") || name.includes("ci");
+            });
+        },
+    },
+];
+/**
+ * Classify whether a promise is verifiable based on its description
+ * and the current graph state.
+ *
+ * The AI can pass custom rules to override or extend the defaults.
+ */
+export function classifyPromiseVerifiability(description, graph, customRules) {
+    const rules = customRules || DEFAULT_DEPENDENCY_RULES;
+    const indices = GraphIndices.from(graph);
+    const descLower = description.toLowerCase();
+    for (const rule of rules) {
+        // Check if any keyword matches the promise description
+        const matchesKeyword = rule.keywords.some(kw => descLower.includes(kw.toLowerCase()));
+        if (!matchesKeyword)
+            continue;
+        // Keyword matched — now check if the required infrastructure exists
+        const infrastructureExists = rule.checkExists(graph, indices);
+        if (!infrastructureExists) {
+            return {
+                verifiable: false,
+                reason: `Requires ${rule.description} (no matching infrastructure in graph)`,
+            };
+        }
+    }
+    return { verifiable: true };
+}
+/**
+ * Batch classify a list of promises, returning those that are unverifiable.
+ */
+export function findUnverifiablePromises(promises, graph, customRules) {
+    const results = [];
+    for (const promise of promises) {
+        if (promise.status !== "pending")
+            continue;
+        const classification = classifyPromiseVerifiability(promise.description, graph, customRules);
+        if (!classification.verifiable && classification.reason) {
+            results.push({
+                id: promise.id,
+                description: promise.description,
+                reason: classification.reason,
+            });
+        }
+    }
+    return results;
+}
+//# sourceMappingURL=classifier.js.map