@hoilab/ada-cli 0.84.21 → 0.84.22

package/dist/core/workflows/graph.js

@@ -0,0 +1,319 @@
+/**
+ * Ada Intelligence Engine — Grafo de trabajo (Fase 7 / §5).
+ *
+ * El grafo es memoria ESTRUCTURADA: nodos en 3 capas (product/design/code)
+ * y aristas con predicados CERRADOS. Live en `~/.ada/agent/workflows/graph/`
+ * (misma raíz que observaciones) con persistencia JSON + índice invertido
+ * (patrón memoria; sin SQLite nativo).
+ *
+ * Reglas no negociables:
+ * - Ids reutilizables TYPE:slug (≤72 chars); search antes de inventar.
+ * - Predicados fuera de la lista legal → REJECTED con warning.
+ * - addEdges es atómico: si un endpoint no existe, rechaza TODO el lote.
+ * - retract exige --reason (journal).
+ * - Confidence tiers EXTRACTED=1.0 / INFERRED=0.7-0.9 / AMBIGUOUS<0.7 / MANUAL=1.0.
+ * - context(id, minConfidence) filtra < 0.6 por defecto.
+ * - Gates edge-driven: ada gaps (spine incompleto) / ada gate (criterios con evidencia).
+ */
+import { createHash } from "node:crypto";
+import { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from "node:fs";
+import { join } from "node:path";
+import { tokenize } from "../memory-engine/inverted-index.js";
+export const NODE_LAYER = {
+    INTENT: "product",
+    REQUIREMENT: "product",
+    CONSTRAINT: "product",
+    DECISION: "product",
+    RISK: "product",
+    TASK: "product",
+    QA_FINDING: "product",
+    ARTIFACT: "product",
+    LEARNING: "product",
+    METRIC: "product",
+    PERSONA: "product",
+    DESIGN_TOKEN: "design",
+    UI_PATTERN: "design",
+    SCREEN: "design",
+    FLOW: "design",
+    A11Y_RULE: "design",
+    FILE: "code",
+    SYMBOL: "code",
+    ROUTE: "code",
+    TEST: "code",
+    DEPENDENCY: "code",
+};
+/** Predicados cerrados (spine + resto) §5. */
+export const SPINE_EDGES = ["motivates", "planned_as", "touches", "implemented_by", "verified_by"];
+export const LEGAL_EDGES = new Set([
+    ...SPINE_EDGES,
+    "constrains",
+    "mitigated_by",
+    "found",
+    "affects",
+    "regresses",
+    "uses_token",
+    "applied_in",
+    "declared_in",
+    "renders",
+    "calls",
+    "references",
+    "imports",
+    "depends_on",
+    "defines",
+    "served_by",
+    "supersedes",
+    "rejected_in_favour_of",
+    "derives_from",
+    "measured_by",
+    "recalls",
+]);
+export class FileGraphStore {
+    file;
+    constructor(dir) {
+        mkdirSync(dir, { recursive: true });
+        this.file = join(dir, "graph.json");
+    }
+    async save(data) {
+        const tmp = `${this.file}.tmp`;
+        writeFileSync(tmp, JSON.stringify(data, null, 2), "utf8");
+        renameSync(tmp, this.file);
+    }
+    async load() {
+        if (!existsSync(this.file))
+            return null;
+        try {
+            return JSON.parse(readFileSync(this.file, "utf8"));
+        }
+        catch {
+            return null;
+        }
+    }
+}
+/** Variante en memoria para tests */
+export class MemoryGraphStore {
+    data = null;
+    async save(d) {
+        this.data = structuredClone(d);
+    }
+    async load() {
+        return this.data ? structuredClone(this.data) : null;
+    }
+}
+const GRAPH_VERSION = 1;
+export class Graph {
+    store;
+    minConfidence;
+    onEvent;
+    data;
+    constructor(options) {
+        this.store = options.store;
+        this.minConfidence = options.minConfidence ?? 0.6;
+        this.onEvent = options.onEvent;
+        this.data = { version: GRAPH_VERSION, nodes: {}, edges: [] };
+    }
+    async init() {
+        const loaded = await this.store.load();
+        if (loaded?.nodes) {
+            this.data = loaded;
+        }
+        else {
+            this.data = { version: GRAPH_VERSION, nodes: {}, edges: [] };
+        }
+    }
+    // ─── Nodos ───
+    addNode(input) {
+        const id = `${input.type}:${input.slug}`;
+        if (id.length > 72) {
+            return { ok: false, error: `Id excede 72 chars: ${id.length}` };
+        }
+        const confidence = this.clampConfidence(input.confidence);
+        const now = new Date().toISOString();
+        const existing = this.data.nodes[id];
+        const node = {
+            id,
+            type: input.type,
+            description: input.description,
+            status: input.status ?? (input.type === "DECISION" ? "open" : undefined),
+            confidence,
+            ...(input.origin ? { origin: "inferred" } : {}),
+            ...(input.file ? { file: input.file } : {}),
+            createdAt: existing?.createdAt ?? now,
+            updatedAt: now,
+        };
+        this.data.nodes[id] = node;
+        void this.persist();
+        return { ok: true, data: node };
+    }
+    // ─── Aristas (atómico + predicados cerrados) ───
+    addEdges(edges) {
+        const warnings = [];
+        const rejected = [];
+        // 1. Validar predicados (lista cerrada).
+        const legal = edges.every((e) => LEGAL_EDGES.has(e.predicate));
+        if (!legal) {
+            for (const e of edges) {
+                if (!LEGAL_EDGES.has(e.predicate)) {
+                    rejected.push(e.predicate);
+                }
+            }
+            return {
+                ok: false,
+                error: `Predicado(s) fuera de la lista legal: ${rejected.join(", ")}`,
+                rejected,
+            };
+        }
+        // 2. Validar que todos los endpoints existen (rechazo atómico).
+        const missing = edges.filter((e) => !this.data.nodes[e.subject] || !this.data.nodes[e.object]);
+        if (missing.length > 0) {
+            const missingIds = missing.map((e) => [!this.data.nodes[e.subject] && e.subject, !this.data.nodes[e.object] && e.object]
+                .filter(Boolean)
+                .join(","));
+            return {
+                ok: false,
+                error: `Nodos de paso no existen: ${missingIds.join(", ")}`,
+                warnings,
+            };
+        }
+        // 3. Aplicar.
+        const now = new Date().toISOString();
+        const added = [];
+        for (const e of edges) {
+            const id = `${e.subject}--${e.predicate}-->${e.object}`;
+            // Rechazar duplicados exactos.
+            if (this.data.edges.some((x) => x.id === id))
+                continue;
+            const edge = {
+                id,
+                subject: e.subject,
+                predicate: e.predicate,
+                object: e.object,
+                confidence: this.clampConfidence(e.confidence),
+                ...(e.reason ? { reason: e.reason } : {}),
+                createdAt: now,
+            };
+            this.data.edges.push(edge);
+            added.push(edge);
+            this.emit("graph_update", { type: "edge", edge });
+        }
+        void this.persist();
+        return { ok: true, data: { added } };
+    }
+    // ─── Retract (exige reason) ───
+    retract(edgeId, reason) {
+        if (!reason || reason.trim().length === 0) {
+            return { ok: false, error: "retract exige --reason (journal)" };
+        }
+        const idx = this.data.edges.findIndex((e) => e.id === edgeId);
+        if (idx === -1)
+            return { ok: false, error: `Arista no encontrada: ${edgeId}` };
+        const [removed] = this.data.edges.splice(idx, 1);
+        removed.reason = reason;
+        removed.rejected = true;
+        void this.persist();
+        return { ok: true, data: { removed } };
+    }
+    // ─── Búsqueda ───
+    search(term) {
+        const tokens = new Set(tokenize(term.toLowerCase()));
+        const scores = [];
+        for (const node of Object.values(this.data.nodes)) {
+            const text = `${node.description} ${node.id}`.toLowerCase();
+            let score = 0;
+            for (const t of tokens) {
+                if (text.includes(t))
+                    score++;
+            }
+            if (score > 0)
+                scores.push({ node, score });
+        }
+        return scores.sort((a, b) => b.score - a.score);
+    }
+    context(id, minConfidence) {
+        const threshold = minConfidence ?? this.minConfidence;
+        const node = this.data.nodes[id];
+        if (!node)
+            return { ok: false, error: `Nodo no encontrado: ${id}` };
+        if (node.confidence < threshold) {
+            return { ok: false, error: `Nodo ${id} tiene confianza ${node.confidence} < ${threshold} (filtrado)` };
+        }
+        const neighbors = this.data.edges.filter((e) => (e.subject === id || e.object === id) && e.confidence >= threshold);
+        return { ok: true, data: { node, neighbors } };
+    }
+    // ─── Gates edge-driven ───
+    /**
+     * gaps(): devuelve el spine incompleto.
+     * - TODO INTENT sin motivar un REQUIREMENT
+     * - TODO REQUIREMENT sin planned_as → TASK
+     * - TODO TASK sin touches → FILE
+     * - TODO REQUIREMENT sin verified_by → TEST ni implemented_by → SYMBOL
+     */
+    gaps() {
+        const gaps = [];
+        const edgeFor = (from, predicate) => this.data.edges.some((e) => e.subject === from && e.predicate === predicate);
+        for (const n of Object.values(this.data.nodes)) {
+            if (n.type === "INTENT" && !edgeFor(n.id, "motivates"))
+                gaps.push({ id: n.id, description: n.description, missing: "REQUIREMENT motivado (motivates)" });
+            if (n.type === "REQUIREMENT" && !edgeFor(n.id, "planned_as"))
+                gaps.push({ id: n.id, description: n.description, missing: "TASK planificada (planned_as)" });
+            if (n.type === "TASK" && !edgeFor(n.id, "touches"))
+                gaps.push({ id: n.id, description: n.description, missing: "FILE tocado (touches)" });
+            if (n.type === "REQUIREMENT" && !edgeFor(n.id, "verified_by") && !edgeFor(n.id, "implemented_by"))
+                gaps.push({ id: n.id, description: n.description, missing: "TEST verified_by o SYMBOL implemented_by" });
+        }
+        return gaps;
+    }
+    /** gate(criteria): devuelve true si TODOS los requisitos tienen verified_by REAL. */
+    gate() {
+        const requirements = Object.values(this.data.nodes).filter((n) => n.type === "REQUIREMENT");
+        if (requirements.length === 0)
+            return { ok: true, data: { passed: true, failures: [] } };
+        const failures = [];
+        // Una DECISION open bloquea el gate (§5 regla 4: gap que bloquea).
+        for (const n of Object.values(this.data.nodes)) {
+            if (n.type === "DECISION" && n.status === "open") {
+                failures.push(`${n.id}: decisión abierta bloquea el gate`);
+            }
+        }
+        for (const req of requirements) {
+            const verified = this.data.edges.some((e) => e.subject === req.id && e.predicate === "verified_by");
+            if (!verified)
+                failures.push(`${req.id}: sin verified_by`);
+        }
+        return { ok: true, data: { passed: failures.length === 0, failures } };
+    }
+    nodeCount() {
+        return Object.keys(this.data.nodes).length;
+    }
+    edgeCount() {
+        return this.data.edges.length;
+    }
+    nodes() {
+        return Object.values(this.data.nodes);
+    }
+    edges() {
+        return [...this.data.edges];
+    }
+    // ─── helpers ───
+    clampConfidence(c) {
+        if (c === undefined)
+            return 1.0;
+        const n = Math.max(0, Math.min(1, c));
+        return n;
+    }
+    async persist() {
+        try {
+            await this.store.save(this.data);
+        }
+        catch {
+            // best-effort: el disco es cache, no fuente de verdad estricta en memoria
+        }
+    }
+    emit(type, payload) {
+        this.onEvent?.(type, payload);
+    }
+}
+// ─── Hash de id auxiliar (para slugs estables) ───
+export function slugHash(input, len = 6) {
+    return createHash("sha256").update(input).digest("hex").slice(0, len);
+}
+//# sourceMappingURL=graph.js.map

package/dist/core/workflows/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/core/workflows/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACzF,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,QAAQ,EAAE,MAAM,oCAAoC,CAAC;AAgC9D,MAAM,CAAC,MAAM,UAAU,GAAsC;IAC5D,MAAM,EAAE,SAAS;IACjB,WAAW,EAAE,SAAS;IACtB,UAAU,EAAE,SAAS;IACrB,QAAQ,EAAE,SAAS;IACnB,IAAI,EAAE,SAAS;IACf,IAAI,EAAE,SAAS;IACf,UAAU,EAAE,SAAS;IACrB,QAAQ,EAAE,SAAS;IACnB,QAAQ,EAAE,SAAS;IACnB,MAAM,EAAE,SAAS;IACjB,OAAO,EAAE,SAAS;IAClB,YAAY,EAAE,QAAQ;IACtB,UAAU,EAAE,QAAQ;IACpB,MAAM,EAAE,QAAQ;IAChB,IAAI,EAAE,QAAQ;IACd,SAAS,EAAE,QAAQ;IACnB,IAAI,EAAE,MAAM;IACZ,MAAM,EAAE,MAAM;IACd,KAAK,EAAE,MAAM;IACb,IAAI,EAAE,MAAM;IACZ,UAAU,EAAE,MAAM;CAClB,CAAC;AAEF,+CAA8C;AAC9C,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,aAAa,CAAU,CAAC;AAE5G,MAAM,CAAC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS;IAC1C,GAAG,WAAW;IACd,YAAY;IACZ,cAAc;IACd,OAAO;IACP,SAAS;IACT,WAAW;IACX,YAAY;IACZ,YAAY;IACZ,aAAa;IACb,SAAS;IACT,OAAO;IACP,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,SAAS;IACT,WAAW;IACX,YAAY;IACZ,uBAAuB;IACvB,cAAc;IACd,aAAa;IACb,SAAS;CACT,CAAC,CAAC;AAwDH,MAAM,OAAO,cAAc;IAClB,IAAI,CAAS;IACrB,YAAY,GAAW,EAAE;QACxB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;IAAA,CACpC;IACD,KAAK,CAAC,IAAI,CAAC,IAAe,EAAiB;QAC1C,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,MAAM,CAAC;QAC/B,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1D,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAAA,CAC3B;IACD,KAAK,CAAC,IAAI,GAA8B;QACvC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACxC,IAAI,CAAC;YACJ,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAc,CAAC;QACjE,CAAC;QAAC,MAAM,CAAC;YACR,OAAO,IAAI,CAAC;QACb,CAAC;IAAA,CACD;CACD;AAED,qCAAqC;AACrC,MAAM,OAAO,gBAAgB;IAC5B,IAAI,GAAqB,IAAI,CAAC;IAC9B,KAAK,CAAC,IAAI,CAAC,CAAY,EAAiB;QACvC,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAAA,CAC/B;IACD,KAAK,CAAC,IAAI,GAA8B;QACvC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAAA,CACrD;CACD;AAWD,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB,MAAM,OAAO,KAAK;IACT,KAAK,CAAa;IAClB,aAAa,CAAS;IACtB,OAAO,CAA2B;IAClC,IAAI,CAAY;IAExB,YAAY,OAAqB,EAAE;QAClC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,GAAG,CAAC;QAClD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAAA,CAC7D;IAED,KAAK,CAAC,IAAI,GAAkB;QAC3B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACvC,IAAI,MAAM,EAAE,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;QACpB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,IAAI,GAAG,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAC9D,CAAC;IAAA,CACD;IAED,4BAAgB;IAEhB,OAAO,CAAC,KAQP,EAA0B;QAC1B,MAAM,EAAE,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;QACzC,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACpB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,uBAAuB,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;QACjE,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1D,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACrC,MAAM,IAAI,GAAc;YACvB,EAAE;YACF,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;YACxE,UAAU;YACV,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,SAAS,EAAE,QAAQ,EAAE,SAAS,IAAI,GAAG;YACrC,SAAS,EAAE,GAAG;SACd,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QAC3B,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAAA,CAChC;IAED,+DAAkD;IAElD,QAAQ,CAAC,KAAuB,EAAuC;QACtE,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,yCAAyC;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACvB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;oBACnC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAC5B,CAAC;YACF,CAAC;YACD,OAAO;gBACN,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE,yCAAyC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACrE,QAAQ;aACR,CAAC;QACH,CAAC;QAED,iEAAgE;QAChE,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/F,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;iBAChF,MAAM,CAAC,OAAO,CAAC;iBACf,IAAI,CAAC,GAAG,CAAC,CACX,CAAC;YACF,OAAO;gBACN,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE,6BAA6B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC3D,QAAQ;aACR,CAAC;QACH,CAAC;QAED,cAAc;QACd,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,SAAS,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC;YACxD,+BAA+B;YAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;gBAAE,SAAS;YACvD,MAAM,IAAI,GAAc;gBACvB,EAAE;gBACF,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,UAAU,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,UAAU,CAAC;gBAC9C,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzC,SAAS,EAAE,GAAG;aACd,CAAC;YACF,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;IAAA,CACrC;IAED,6CAAiC;IAEjC,OAAO,CAAC,MAAc,EAAE,MAAc,EAAuC;QAC5E,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,kCAAkC,EAAE,CAAC;QACjE,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QAC9D,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,yBAAyB,MAAM,EAAE,EAAE,CAAC;QAC/E,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACjD,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;QACxB,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;QACxB,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC;IAAA,CACvC;IAED,gCAAmB;IAEnB,MAAM,CAAC,IAAY,EAA6C;QAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACrD,MAAM,MAAM,GAA8C,EAAE,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC;YAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACxB,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,KAAK,EAAE,CAAC;YAC/B,CAAC;YACD,IAAI,KAAK,GAAG,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAAA,CAChD;IAED,OAAO,CAAC,EAAU,EAAE,aAAsB,EAA6D;QACtG,MAAM,SAAS,GAAG,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,uBAAuB,EAAE,EAAE,EAAE,CAAC;QACpE,IAAI,IAAI,CAAC,UAAU,GAAG,SAAS,EAAE,CAAC;YACjC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,oBAAoB,IAAI,CAAC,UAAU,MAAM,SAAS,aAAa,EAAE,CAAC;QACxG,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,SAAS,CACzE,CAAC;QACF,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC;IAAA,CAC/C;IAED,wCAA4B;IAE5B;;;;;;OAMG;IACH,IAAI,GAAgE;QACnE,MAAM,IAAI,GAAgE,EAAE,CAAC;QAC7E,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,SAAiB,EAAE,EAAE,CACnD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QAE9E,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC;gBACrD,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,OAAO,EAAE,kCAAkC,EAAE,CAAC,CAAC;YAClG,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC;gBAC3D,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,OAAO,EAAE,+BAA+B,EAAE,CAAC,CAAC;YAC/F,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC;gBACjD,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,CAAC;YACvF,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,gBAAgB,CAAC;gBAChG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,OAAO,EAAE,0CAA0C,EAAE,CAAC,CAAC;QAC3G,CAAC;QACD,OAAO,IAAI,CAAC;IAAA,CACZ;IAED,qFAAqF;IACrF,IAAI,GAAyD;QAC5D,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC;QAC5F,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC;QACzF,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,oEAAmE;QACnE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;gBAClD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,qCAAoC,CAAC,CAAC;YAC5D,CAAC;QACF,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,SAAS,KAAK,aAAa,CAAC,CAAC;YACpG,IAAI,CAAC,QAAQ;gBAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,mBAAmB,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC;IAAA,CACvE;IAED,SAAS,GAAW;QACnB,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IAAA,CAC3C;IACD,SAAS,GAAW;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAAA,CAC9B;IACD,KAAK,GAAgB;QACpB,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAAA,CACtC;IACD,KAAK,GAAgB;QACpB,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAAA,CAC5B;IAED,8BAAkB;IAEV,eAAe,CAAC,CAAc,EAAc;QACnD,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtC,OAAO,CAAe,CAAC;IAAA,CACvB;IAEO,KAAK,CAAC,OAAO,GAAkB;QACtC,IAAI,CAAC;YACJ,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACR,0EAA0E;QAC3E,CAAC;IAAA,CACD;IAEO,IAAI,CAAC,IAA4C,EAAE,OAAgC,EAAQ;QAClG,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAAA,CAC9B;CACD;AAED,gEAAoD;AAEpD,MAAM,UAAU,QAAQ,CAAC,KAAa,EAAE,GAAG,GAAG,CAAC,EAAU;IACxD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAAA,CACtE","sourcesContent":["/**\n * Ada Intelligence Engine — Grafo de trabajo (Fase 7 / §5).\n *\n * El grafo es memoria ESTRUCTURADA: nodos en 3 capas (product/design/code)\n * y aristas con predicados CERRADOS. Live en `~/.ada/agent/workflows/graph/`\n * (misma raíz que observaciones) con persistencia JSON + índice invertido\n * (patrón memoria; sin SQLite nativo).\n *\n * Reglas no negociables:\n * - Ids reutilizables TYPE:slug (≤72 chars); search antes de inventar.\n * - Predicados fuera de la lista legal → REJECTED con warning.\n * - addEdges es atómico: si un endpoint no existe, rechaza TODO el lote.\n * - retract exige --reason (journal).\n * - Confidence tiers EXTRACTED=1.0 / INFERRED=0.7-0.9 / AMBIGUOUS<0.7 / MANUAL=1.0.\n * - context(id, minConfidence) filtra < 0.6 por defecto.\n * - Gates edge-driven: ada gaps (spine incompleto) / ada gate (criterios con evidencia).\n */\n\nimport { createHash } from \"node:crypto\";\nimport { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { tokenize } from \"../memory-engine/inverted-index.ts\";\n\n// ─── Tipos (3 capas) ───\n\nexport type GraphLayer = \"product\" | \"design\" | \"code\";\n\nexport type GraphNodeType =\n\t// product\n\t| \"INTENT\"\n\t| \"REQUIREMENT\"\n\t| \"CONSTRAINT\"\n\t| \"DECISION\"\n\t| \"RISK\"\n\t| \"TASK\"\n\t| \"QA_FINDING\"\n\t| \"ARTIFACT\"\n\t| \"LEARNING\"\n\t| \"METRIC\"\n\t| \"PERSONA\"\n\t// design\n\t| \"DESIGN_TOKEN\"\n\t| \"UI_PATTERN\"\n\t| \"SCREEN\"\n\t| \"FLOW\"\n\t| \"A11Y_RULE\"\n\t// code\n\t| \"FILE\"\n\t| \"SYMBOL\"\n\t| \"ROUTE\"\n\t| \"TEST\"\n\t| \"DEPENDENCY\";\n\nexport const NODE_LAYER: Record<GraphNodeType, GraphLayer> = {\n\tINTENT: \"product\",\n\tREQUIREMENT: \"product\",\n\tCONSTRAINT: \"product\",\n\tDECISION: \"product\",\n\tRISK: \"product\",\n\tTASK: \"product\",\n\tQA_FINDING: \"product\",\n\tARTIFACT: \"product\",\n\tLEARNING: \"product\",\n\tMETRIC: \"product\",\n\tPERSONA: \"product\",\n\tDESIGN_TOKEN: \"design\",\n\tUI_PATTERN: \"design\",\n\tSCREEN: \"design\",\n\tFLOW: \"design\",\n\tA11Y_RULE: \"design\",\n\tFILE: \"code\",\n\tSYMBOL: \"code\",\n\tROUTE: \"code\",\n\tTEST: \"code\",\n\tDEPENDENCY: \"code\",\n};\n\n/** Predicados cerrados (spine + resto) §5. */\nexport const SPINE_EDGES = [\"motivates\", \"planned_as\", \"touches\", \"implemented_by\", \"verified_by\"] as const;\n\nexport const LEGAL_EDGES = new Set<string>([\n\t...SPINE_EDGES,\n\t\"constrains\",\n\t\"mitigated_by\",\n\t\"found\",\n\t\"affects\",\n\t\"regresses\",\n\t\"uses_token\",\n\t\"applied_in\",\n\t\"declared_in\",\n\t\"renders\",\n\t\"calls\",\n\t\"references\",\n\t\"imports\",\n\t\"depends_on\",\n\t\"defines\",\n\t\"served_by\",\n\t\"supersedes\",\n\t\"rejected_in_favour_of\",\n\t\"derives_from\",\n\t\"measured_by\",\n\t\"recalls\",\n]);\n\nexport type Confidence = 1.0 | 0.9 | 0.8 | 0.7 | 0.5 | 0.4 | 0.3;\n\nexport interface GraphNode {\n\tid: string; // TYPE:slug (≤72)\n\ttype: GraphNodeType;\n\tdescription: string; // una frase\n\tstatus?: \"open\" | \"resolved\" | \"rejected\";\n\tconfidence: Confidence;\n\torigin?: \"inferred\";\n\tfile?: string; // source/artefacto\n\tcreatedAt: string;\n\tupdatedAt: string;\n}\n\nexport interface GraphEdge {\n\tid: string;\n\tsubject: string; // from\n\tpredicate: string; // legal cerrado\n\tobject: string; // to\n\tconfidence: Confidence;\n\treason?: string;\n\trejected?: boolean; // DECISION status rejected\n\tcreatedAt: string;\n}\n\nexport interface GraphEdgeInput {\n\tsubject: string;\n\tpredicate: string;\n\tobject: string;\n\tconfidence?: Confidence;\n\treason?: string;\n}\n\nexport interface GraphData {\n\tversion: number;\n\tnodes: Record<string, GraphNode>;\n\tedges: GraphEdge[];\n}\n\nexport interface GraphResult<T> {\n\tok: boolean;\n\tdata?: T;\n\terror?: string;\n\trejected?: string[]; // predicados desconocidos\n\twarnings?: string[];\n}\n\n// ─── Persistencia (inyectable para tests) ───\n\nexport interface GraphStore {\n\tsave(data: GraphData): Promise<void>;\n\tload(): Promise<GraphData | null>;\n}\n\nexport class FileGraphStore implements GraphStore {\n\tprivate file: string;\n\tconstructor(dir: string) {\n\t\tmkdirSync(dir, { recursive: true });\n\t\tthis.file = join(dir, \"graph.json\");\n\t}\n\tasync save(data: GraphData): Promise<void> {\n\t\tconst tmp = `${this.file}.tmp`;\n\t\twriteFileSync(tmp, JSON.stringify(data, null, 2), \"utf8\");\n\t\trenameSync(tmp, this.file);\n\t}\n\tasync load(): Promise<GraphData | null> {\n\t\tif (!existsSync(this.file)) return null;\n\t\ttry {\n\t\t\treturn JSON.parse(readFileSync(this.file, \"utf8\")) as GraphData;\n\t\t} catch {\n\t\t\treturn null;\n\t\t}\n\t}\n}\n\n/** Variante en memoria para tests */\nexport class MemoryGraphStore implements GraphStore {\n\tdata: GraphData | null = null;\n\tasync save(d: GraphData): Promise<void> {\n\t\tthis.data = structuredClone(d);\n\t}\n\tasync load(): Promise<GraphData | null> {\n\t\treturn this.data ? structuredClone(this.data) : null;\n\t}\n}\n\n// ─── Grafo ───\n\nexport interface GraphOptions {\n\tstore: GraphStore;\n\t/** Confianza mínima para context() (default 0.6). */\n\tminConfidence?: number;\n\tonEvent?: (type: \"graph_update\" | \"graph_edge_rejected\", payload: Record<string, unknown>) => void;\n}\n\nconst GRAPH_VERSION = 1;\n\nexport class Graph {\n\tprivate store: GraphStore;\n\tprivate minConfidence: number;\n\tprivate onEvent?: GraphOptions[\"onEvent\"];\n\tprivate data: GraphData;\n\n\tconstructor(options: GraphOptions) {\n\t\tthis.store = options.store;\n\t\tthis.minConfidence = options.minConfidence ?? 0.6;\n\t\tthis.onEvent = options.onEvent;\n\t\tthis.data = { version: GRAPH_VERSION, nodes: {}, edges: [] };\n\t}\n\n\tasync init(): Promise<void> {\n\t\tconst loaded = await this.store.load();\n\t\tif (loaded?.nodes) {\n\t\t\tthis.data = loaded;\n\t\t} else {\n\t\t\tthis.data = { version: GRAPH_VERSION, nodes: {}, edges: [] };\n\t\t}\n\t}\n\n\t// ─── Nodos ───\n\n\taddNode(input: {\n\t\ttype: GraphNodeType;\n\t\tslug: string;\n\t\tdescription: string;\n\t\tconfidence?: Confidence;\n\t\tstatus?: GraphNode[\"status\"];\n\t\torigin?: \"inferred\";\n\t\tfile?: string;\n\t}): GraphResult<GraphNode> {\n\t\tconst id = `${input.type}:${input.slug}`;\n\t\tif (id.length > 72) {\n\t\t\treturn { ok: false, error: `Id excede 72 chars: ${id.length}` };\n\t\t}\n\t\tconst confidence = this.clampConfidence(input.confidence);\n\t\tconst now = new Date().toISOString();\n\t\tconst existing = this.data.nodes[id];\n\t\tconst node: GraphNode = {\n\t\t\tid,\n\t\t\ttype: input.type,\n\t\t\tdescription: input.description,\n\t\t\tstatus: input.status ?? (input.type === \"DECISION\" ? \"open\" : undefined),\n\t\t\tconfidence,\n\t\t\t...(input.origin ? { origin: \"inferred\" } : {}),\n\t\t\t...(input.file ? { file: input.file } : {}),\n\t\t\tcreatedAt: existing?.createdAt ?? now,\n\t\t\tupdatedAt: now,\n\t\t};\n\t\tthis.data.nodes[id] = node;\n\t\tvoid this.persist();\n\t\treturn { ok: true, data: node };\n\t}\n\n\t// ─── Aristas (atómico + predicados cerrados) ───\n\n\taddEdges(edges: GraphEdgeInput[]): GraphResult<{ added: GraphEdge[] }> {\n\t\tconst warnings: string[] = [];\n\t\tconst rejected: string[] = [];\n\n\t\t// 1. Validar predicados (lista cerrada).\n\t\tconst legal = edges.every((e) => LEGAL_EDGES.has(e.predicate));\n\t\tif (!legal) {\n\t\t\tfor (const e of edges) {\n\t\t\t\tif (!LEGAL_EDGES.has(e.predicate)) {\n\t\t\t\t\trejected.push(e.predicate);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn {\n\t\t\t\tok: false,\n\t\t\t\terror: `Predicado(s) fuera de la lista legal: ${rejected.join(\", \")}`,\n\t\t\t\trejected,\n\t\t\t};\n\t\t}\n\n\t\t// 2. Validar que todos los endpoints existen (rechazo atómico).\n\t\tconst missing = edges.filter((e) => !this.data.nodes[e.subject] || !this.data.nodes[e.object]);\n\t\tif (missing.length > 0) {\n\t\t\tconst missingIds = missing.map((e) =>\n\t\t\t\t[!this.data.nodes[e.subject] && e.subject, !this.data.nodes[e.object] && e.object]\n\t\t\t\t\t.filter(Boolean)\n\t\t\t\t\t.join(\",\"),\n\t\t\t);\n\t\t\treturn {\n\t\t\t\tok: false,\n\t\t\t\terror: `Nodos de paso no existen: ${missingIds.join(\", \")}`,\n\t\t\t\twarnings,\n\t\t\t};\n\t\t}\n\n\t\t// 3. Aplicar.\n\t\tconst now = new Date().toISOString();\n\t\tconst added: GraphEdge[] = [];\n\t\tfor (const e of edges) {\n\t\t\tconst id = `${e.subject}--${e.predicate}-->${e.object}`;\n\t\t\t// Rechazar duplicados exactos.\n\t\t\tif (this.data.edges.some((x) => x.id === id)) continue;\n\t\t\tconst edge: GraphEdge = {\n\t\t\t\tid,\n\t\t\t\tsubject: e.subject,\n\t\t\t\tpredicate: e.predicate,\n\t\t\t\tobject: e.object,\n\t\t\t\tconfidence: this.clampConfidence(e.confidence),\n\t\t\t\t...(e.reason ? { reason: e.reason } : {}),\n\t\t\t\tcreatedAt: now,\n\t\t\t};\n\t\t\tthis.data.edges.push(edge);\n\t\t\tadded.push(edge);\n\t\t\tthis.emit(\"graph_update\", { type: \"edge\", edge });\n\t\t}\n\t\tvoid this.persist();\n\t\treturn { ok: true, data: { added } };\n\t}\n\n\t// ─── Retract (exige reason) ───\n\n\tretract(edgeId: string, reason: string): GraphResult<{ removed: GraphEdge }> {\n\t\tif (!reason || reason.trim().length === 0) {\n\t\t\treturn { ok: false, error: \"retract exige --reason (journal)\" };\n\t\t}\n\t\tconst idx = this.data.edges.findIndex((e) => e.id === edgeId);\n\t\tif (idx === -1) return { ok: false, error: `Arista no encontrada: ${edgeId}` };\n\t\tconst [removed] = this.data.edges.splice(idx, 1);\n\t\tremoved.reason = reason;\n\t\tremoved.rejected = true;\n\t\tvoid this.persist();\n\t\treturn { ok: true, data: { removed } };\n\t}\n\n\t// ─── Búsqueda ───\n\n\tsearch(term: string): Array<{ node: GraphNode; score: number }> {\n\t\tconst tokens = new Set(tokenize(term.toLowerCase()));\n\t\tconst scores: Array<{ node: GraphNode; score: number }> = [];\n\t\tfor (const node of Object.values(this.data.nodes)) {\n\t\t\tconst text = `${node.description} ${node.id}`.toLowerCase();\n\t\t\tlet score = 0;\n\t\t\tfor (const t of tokens) {\n\t\t\t\tif (text.includes(t)) score++;\n\t\t\t}\n\t\t\tif (score > 0) scores.push({ node, score });\n\t\t}\n\t\treturn scores.sort((a, b) => b.score - a.score);\n\t}\n\n\tcontext(id: string, minConfidence?: number): GraphResult<{ node?: GraphNode; neighbors: GraphEdge[] }> {\n\t\tconst threshold = minConfidence ?? this.minConfidence;\n\t\tconst node = this.data.nodes[id];\n\t\tif (!node) return { ok: false, error: `Nodo no encontrado: ${id}` };\n\t\tif (node.confidence < threshold) {\n\t\t\treturn { ok: false, error: `Nodo ${id} tiene confianza ${node.confidence} < ${threshold} (filtrado)` };\n\t\t}\n\t\tconst neighbors = this.data.edges.filter(\n\t\t\t(e) => (e.subject === id || e.object === id) && e.confidence >= threshold,\n\t\t);\n\t\treturn { ok: true, data: { node, neighbors } };\n\t}\n\n\t// ─── Gates edge-driven ───\n\n\t/**\n\t * gaps(): devuelve el spine incompleto.\n\t * - TODO INTENT sin motivar un REQUIREMENT\n\t * - TODO REQUIREMENT sin planned_as → TASK\n\t * - TODO TASK sin touches → FILE\n\t * - TODO REQUIREMENT sin verified_by → TEST ni implemented_by → SYMBOL\n\t */\n\tgaps(): Array<{ id: string; description: string; missing: string }> {\n\t\tconst gaps: Array<{ id: string; description: string; missing: string }> = [];\n\t\tconst edgeFor = (from: string, predicate: string) =>\n\t\t\tthis.data.edges.some((e) => e.subject === from && e.predicate === predicate);\n\n\t\tfor (const n of Object.values(this.data.nodes)) {\n\t\t\tif (n.type === \"INTENT\" && !edgeFor(n.id, \"motivates\"))\n\t\t\t\tgaps.push({ id: n.id, description: n.description, missing: \"REQUIREMENT motivado (motivates)\" });\n\t\t\tif (n.type === \"REQUIREMENT\" && !edgeFor(n.id, \"planned_as\"))\n\t\t\t\tgaps.push({ id: n.id, description: n.description, missing: \"TASK planificada (planned_as)\" });\n\t\t\tif (n.type === \"TASK\" && !edgeFor(n.id, \"touches\"))\n\t\t\t\tgaps.push({ id: n.id, description: n.description, missing: \"FILE tocado (touches)\" });\n\t\t\tif (n.type === \"REQUIREMENT\" && !edgeFor(n.id, \"verified_by\") && !edgeFor(n.id, \"implemented_by\"))\n\t\t\t\tgaps.push({ id: n.id, description: n.description, missing: \"TEST verified_by o SYMBOL implemented_by\" });\n\t\t}\n\t\treturn gaps;\n\t}\n\n\t/** gate(criteria): devuelve true si TODOS los requisitos tienen verified_by REAL. */\n\tgate(): GraphResult<{ passed: boolean; failures: string[] }> {\n\t\tconst requirements = Object.values(this.data.nodes).filter((n) => n.type === \"REQUIREMENT\");\n\t\tif (requirements.length === 0) return { ok: true, data: { passed: true, failures: [] } };\n\t\tconst failures: string[] = [];\n\n\t\t// Una DECISION open bloquea el gate (§5 regla 4: gap que bloquea).\n\t\tfor (const n of Object.values(this.data.nodes)) {\n\t\t\tif (n.type === \"DECISION\" && n.status === \"open\") {\n\t\t\t\tfailures.push(`${n.id}: decisión abierta bloquea el gate`);\n\t\t\t}\n\t\t}\n\n\t\tfor (const req of requirements) {\n\t\t\tconst verified = this.data.edges.some((e) => e.subject === req.id && e.predicate === \"verified_by\");\n\t\t\tif (!verified) failures.push(`${req.id}: sin verified_by`);\n\t\t}\n\t\treturn { ok: true, data: { passed: failures.length === 0, failures } };\n\t}\n\n\tnodeCount(): number {\n\t\treturn Object.keys(this.data.nodes).length;\n\t}\n\tedgeCount(): number {\n\t\treturn this.data.edges.length;\n\t}\n\tnodes(): GraphNode[] {\n\t\treturn Object.values(this.data.nodes);\n\t}\n\tedges(): GraphEdge[] {\n\t\treturn [...this.data.edges];\n\t}\n\n\t// ─── helpers ───\n\n\tprivate clampConfidence(c?: Confidence): Confidence {\n\t\tif (c === undefined) return 1.0;\n\t\tconst n = Math.max(0, Math.min(1, c));\n\t\treturn n as Confidence;\n\t}\n\n\tprivate async persist(): Promise<void> {\n\t\ttry {\n\t\t\tawait this.store.save(this.data);\n\t\t} catch {\n\t\t\t// best-effort: el disco es cache, no fuente de verdad estricta en memoria\n\t\t}\n\t}\n\n\tprivate emit(type: \"graph_update\" | \"graph_edge_rejected\", payload: Record<string, unknown>): void {\n\t\tthis.onEvent?.(type, payload);\n\t}\n}\n\n// ─── Hash de id auxiliar (para slugs estables) ───\n\nexport function slugHash(input: string, len = 6): string {\n\treturn createHash(\"sha256\").update(input).digest(\"hex\").slice(0, len);\n}\n"]}

package/dist/core/workflows/index.d.ts

@@ -0,0 +1,18 @@
+export { AgentRunner, agentIdentityHash, extractJson, messageText } from "./agent-runner.ts";
+export { generateCodebaseAuditScript, generateCodeReviewScript, generateDeepResearchScript, generateMultiPerspectiveScript, generateProductBuildScript, } from "./builtins.ts";
+export * from "./goal-engine/index.ts";
+export type { GraphData, GraphEdge, GraphNode, GraphOptions, GraphResult, GraphStore } from "./graph.ts";
+export { FileGraphStore, Graph, LEGAL_EDGES, MemoryGraphStore, NODE_LAYER, SPINE_EDGES, slugHash, } from "./graph.ts";
+export { JOURNAL_VERSION, type PersistedRunState, RunJournal } from "./journal.ts";
+export { type WorkflowEventMap, WorkflowManager, type WorkflowManagerOptions } from "./manager.ts";
+export type { ResolveWorkflowResult } from "./resolve-script.ts";
+export { listUserWorkflowScripts, resolveBuiltinWorkflowScript, resolveWorkflowScriptByName, } from "./resolve-script.ts";
+export { createLimiter, parseWorkflowScript, runWorkflow } from "./runtime.ts";
+export { SharedStore } from "./shared-store.ts";
+export { type CreateSubagentSessionOptions, createSubagentSession } from "./subagent-host.ts";
+export type { WorkflowToolContext } from "./tool-workflow.ts";
+export { createWorkflowTool } from "./tool-workflow.ts";
+export type { AgentRunOptions, AgentRunResult, AgentUsage, WorkflowApi, WorkflowErrorCode, WorkflowLimits, WorkflowMeta, WorkflowPhase, WorkflowRunResult, } from "./types.ts";
+export { DEFAULT_WORKFLOW_LIMITS, WorkflowError } from "./types.ts";
+export { createWorktree, removeWorktree, type Worktree } from "./worktree.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/core/workflows/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/workflows/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7F,OAAO,EACN,2BAA2B,EAC3B,wBAAwB,EACxB,0BAA0B,EAC1B,8BAA8B,EAC9B,0BAA0B,GAC1B,MAAM,eAAe,CAAC;AACvB,cAAc,wBAAwB,CAAC;AACvC,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACzG,OAAO,EACN,cAAc,EACd,KAAK,EACL,WAAW,EACX,gBAAgB,EAChB,UAAU,EACV,WAAW,EACX,QAAQ,GACR,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,eAAe,EAAE,KAAK,iBAAiB,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AACnF,OAAO,EAAE,KAAK,gBAAgB,EAAE,eAAe,EAAE,KAAK,sBAAsB,EAAE,MAAM,cAAc,CAAC;AACnG,YAAY,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AACjE,OAAO,EACN,uBAAuB,EACvB,4BAA4B,EAC5B,2BAA2B,GAC3B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,KAAK,4BAA4B,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAC9F,YAAY,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,YAAY,EACX,eAAe,EACf,cAAc,EACd,UAAU,EACV,WAAW,EACX,iBAAiB,EACjB,cAAc,EACd,YAAY,EACZ,aAAa,EACb,iBAAiB,GACjB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,uBAAuB,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACpE,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC","sourcesContent":["export { AgentRunner, agentIdentityHash, extractJson, messageText } from \"./agent-runner.ts\";\nexport {\n\tgenerateCodebaseAuditScript,\n\tgenerateCodeReviewScript,\n\tgenerateDeepResearchScript,\n\tgenerateMultiPerspectiveScript,\n\tgenerateProductBuildScript,\n} from \"./builtins.ts\";\nexport * from \"./goal-engine/index.ts\";\nexport type { GraphData, GraphEdge, GraphNode, GraphOptions, GraphResult, GraphStore } from \"./graph.ts\";\nexport {\n\tFileGraphStore,\n\tGraph,\n\tLEGAL_EDGES,\n\tMemoryGraphStore,\n\tNODE_LAYER,\n\tSPINE_EDGES,\n\tslugHash,\n} from \"./graph.ts\";\nexport { JOURNAL_VERSION, type PersistedRunState, RunJournal } from \"./journal.ts\";\nexport { type WorkflowEventMap, WorkflowManager, type WorkflowManagerOptions } from \"./manager.ts\";\nexport type { ResolveWorkflowResult } from \"./resolve-script.ts\";\nexport {\n\tlistUserWorkflowScripts,\n\tresolveBuiltinWorkflowScript,\n\tresolveWorkflowScriptByName,\n} from \"./resolve-script.ts\";\nexport { createLimiter, parseWorkflowScript, runWorkflow } from \"./runtime.ts\";\nexport { SharedStore } from \"./shared-store.ts\";\nexport { type CreateSubagentSessionOptions, createSubagentSession } from \"./subagent-host.ts\";\nexport type { WorkflowToolContext } from \"./tool-workflow.ts\";\nexport { createWorkflowTool } from \"./tool-workflow.ts\";\nexport type {\n\tAgentRunOptions,\n\tAgentRunResult,\n\tAgentUsage,\n\tWorkflowApi,\n\tWorkflowErrorCode,\n\tWorkflowLimits,\n\tWorkflowMeta,\n\tWorkflowPhase,\n\tWorkflowRunResult,\n} from \"./types.ts\";\nexport { DEFAULT_WORKFLOW_LIMITS, WorkflowError } from \"./types.ts\";\nexport { createWorktree, removeWorktree, type Worktree } from \"./worktree.ts\";\n"]}

package/dist/core/workflows/index.js

@@ -0,0 +1,14 @@
+export { AgentRunner, agentIdentityHash, extractJson, messageText } from "./agent-runner.js";
+export { generateCodebaseAuditScript, generateCodeReviewScript, generateDeepResearchScript, generateMultiPerspectiveScript, generateProductBuildScript, } from "./builtins.js";
+export * from "./goal-engine/index.js";
+export { FileGraphStore, Graph, LEGAL_EDGES, MemoryGraphStore, NODE_LAYER, SPINE_EDGES, slugHash, } from "./graph.js";
+export { JOURNAL_VERSION, RunJournal } from "./journal.js";
+export { WorkflowManager } from "./manager.js";
+export { listUserWorkflowScripts, resolveBuiltinWorkflowScript, resolveWorkflowScriptByName, } from "./resolve-script.js";
+export { createLimiter, parseWorkflowScript, runWorkflow } from "./runtime.js";
+export { SharedStore } from "./shared-store.js";
+export { createSubagentSession } from "./subagent-host.js";
+export { createWorkflowTool } from "./tool-workflow.js";
+export { DEFAULT_WORKFLOW_LIMITS, WorkflowError } from "./types.js";
+export { createWorktree, removeWorktree } from "./worktree.js";
+//# sourceMappingURL=index.js.map

package/dist/core/workflows/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/workflows/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7F,OAAO,EACN,2BAA2B,EAC3B,wBAAwB,EACxB,0BAA0B,EAC1B,8BAA8B,EAC9B,0BAA0B,GAC1B,MAAM,eAAe,CAAC;AACvB,cAAc,wBAAwB,CAAC;AAEvC,OAAO,EACN,cAAc,EACd,KAAK,EACL,WAAW,EACX,gBAAgB,EAChB,UAAU,EACV,WAAW,EACX,QAAQ,GACR,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,eAAe,EAA0B,UAAU,EAAE,MAAM,cAAc,CAAC;AACnF,OAAO,EAAyB,eAAe,EAA+B,MAAM,cAAc,CAAC;AAEnG,OAAO,EACN,uBAAuB,EACvB,4BAA4B,EAC5B,2BAA2B,GAC3B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAqC,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAE9F,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAYxD,OAAO,EAAE,uBAAuB,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACpE,OAAO,EAAE,cAAc,EAAE,cAAc,EAAiB,MAAM,eAAe,CAAC","sourcesContent":["export { AgentRunner, agentIdentityHash, extractJson, messageText } from \"./agent-runner.ts\";\nexport {\n\tgenerateCodebaseAuditScript,\n\tgenerateCodeReviewScript,\n\tgenerateDeepResearchScript,\n\tgenerateMultiPerspectiveScript,\n\tgenerateProductBuildScript,\n} from \"./builtins.ts\";\nexport * from \"./goal-engine/index.ts\";\nexport type { GraphData, GraphEdge, GraphNode, GraphOptions, GraphResult, GraphStore } from \"./graph.ts\";\nexport {\n\tFileGraphStore,\n\tGraph,\n\tLEGAL_EDGES,\n\tMemoryGraphStore,\n\tNODE_LAYER,\n\tSPINE_EDGES,\n\tslugHash,\n} from \"./graph.ts\";\nexport { JOURNAL_VERSION, type PersistedRunState, RunJournal } from \"./journal.ts\";\nexport { type WorkflowEventMap, WorkflowManager, type WorkflowManagerOptions } from \"./manager.ts\";\nexport type { ResolveWorkflowResult } from \"./resolve-script.ts\";\nexport {\n\tlistUserWorkflowScripts,\n\tresolveBuiltinWorkflowScript,\n\tresolveWorkflowScriptByName,\n} from \"./resolve-script.ts\";\nexport { createLimiter, parseWorkflowScript, runWorkflow } from \"./runtime.ts\";\nexport { SharedStore } from \"./shared-store.ts\";\nexport { type CreateSubagentSessionOptions, createSubagentSession } from \"./subagent-host.ts\";\nexport type { WorkflowToolContext } from \"./tool-workflow.ts\";\nexport { createWorkflowTool } from \"./tool-workflow.ts\";\nexport type {\n\tAgentRunOptions,\n\tAgentRunResult,\n\tAgentUsage,\n\tWorkflowApi,\n\tWorkflowErrorCode,\n\tWorkflowLimits,\n\tWorkflowMeta,\n\tWorkflowPhase,\n\tWorkflowRunResult,\n} from \"./types.ts\";\nexport { DEFAULT_WORKFLOW_LIMITS, WorkflowError } from \"./types.ts\";\nexport { createWorktree, removeWorktree, type Worktree } from \"./worktree.ts\";\n"]}

package/dist/core/workflows/journal.d.ts

@@ -0,0 +1,68 @@
+/**
+ * RunJournal — persistencia del estado de un run de workflow.
+ *
+ * El disco es la fuente de verdad (adversarial R8.5): el snapshot se escribe
+ * tras cada evento relevante; el resume lee el archivo y re-aplica el journal
+ * (resultados cacheados + deltas del store en orden callSeq).
+ *
+ * Formato versionado (adversarial R9.1): `version` desde el día 1, migraciones
+ * incrementales con test por migración.
+ */
+import type { JournalEntry, WorkflowMeta } from "./types.ts";
+export declare const JOURNAL_VERSION = 1;
+export interface PersistedRunState {
+    version: number;
+    /** Sesión que lanzó el run (para filtrar por conversación en el panel). */
+    sessionId?: string;
+    /** Nombre para mostrar en el panel (p.ej. el título de la sub-tarea del goal). */
+    displayName?: string;
+    runId: string;
+    name: string;
+    script: string;
+    args: Record<string, unknown>;
+    meta: WorkflowMeta;
+    status: "pending" | "running" | "paused" | "completed" | "failed" | "aborted";
+    phases: string[];
+    currentPhase: string | null;
+    /** Progreso en vivo por agente (lo lee el panel del desktop). */
+    agents?: Array<{
+        id: string;
+        label: string;
+        phase?: string;
+        status: "running" | "done" | "failed" | "blocked";
+        blockedReason?: string;
+    }>;
+    journal: JournalEntry[];
+    agentCount: number;
+    tokenUsage: {
+        input: number;
+        output: number;
+        total: number;
+        cost: number;
+        cacheRead: number;
+        cacheWrite: number;
+    };
+    startedAt: string;
+    updatedAt: string;
+    resultPath?: string;
+    error?: string;
+}
+export interface RunJournalOptions {
+    /** Directorio raíz de persistencia (~/.ada/agent/workflows/runs). */
+    runsDir: string;
+}
+export declare class RunJournal {
+    private runsDir;
+    constructor(options: RunJournalOptions);
+    pathFor(runId: string): string;
+    save(state: PersistedRunState): Promise<void>;
+    load(runId: string): Promise<PersistedRunState | null>;
+    delete(runId: string): Promise<void>;
+    list(): Promise<Array<{
+        runId: string;
+        name: string;
+        status: PersistedRunState["status"];
+        updatedAt: string;
+    }>>;
+}
+//# sourceMappingURL=journal.d.ts.map

package/dist/core/workflows/journal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"journal.d.ts","sourceRoot":"","sources":["../../../src/core/workflows/journal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE7D,eAAO,MAAM,eAAe,IAAI,CAAC;AAEjC,MAAM,WAAW,iBAAiB;IACjC,OAAO,EAAE,MAAM,CAAC;IAChB,8EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,mFAAkF;IAClF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,EAAE,YAAY,CAAC;IACnB,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,WAAW,GAAG,QAAQ,GAAG,SAAS,CAAC;IAC9E,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,iEAAiE;IACjE,MAAM,CAAC,EAAE,KAAK,CAAC;QACd,EAAE,EAAE,MAAM,CAAC;QACX,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC;QAClD,aAAa,CAAC,EAAE,MAAM,CAAC;KACvB,CAAC,CAAC;IACH,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IAClH,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,iBAAiB;IACjC,sEAAqE;IACrE,OAAO,EAAE,MAAM,CAAC;CAChB;AAED,qBAAa,UAAU;IACtB,OAAO,CAAC,OAAO,CAAS;IAExB,YAAY,OAAO,EAAE,iBAAiB,EAErC;IAED,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE7B;IAEK,IAAI,CAAC,KAAK,EAAE,iBAAiB,GAAG,OAAO,CAAC,IAAI,CAAC,CAOlD;IAEK,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,CAW3D;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAOzC;IAEK,IAAI,IAAI,OAAO,CACpB,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAC9F,CAqBA;CACD","sourcesContent":["/**\n * RunJournal — persistencia del estado de un run de workflow.\n *\n * El disco es la fuente de verdad (adversarial R8.5): el snapshot se escribe\n * tras cada evento relevante; el resume lee el archivo y re-aplica el journal\n * (resultados cacheados + deltas del store en orden callSeq).\n *\n * Formato versionado (adversarial R9.1): `version` desde el día 1, migraciones\n * incrementales con test por migración.\n */\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname, join } from \"node:path\";\nimport type { JournalEntry, WorkflowMeta } from \"./types.ts\";\n\nexport const JOURNAL_VERSION = 1;\n\nexport interface PersistedRunState {\n\tversion: number;\n\t/** Sesión que lanzó el run (para filtrar por conversación en el panel). */\n\tsessionId?: string;\n\t/** Nombre para mostrar en el panel (p.ej. el título de la sub-tarea del goal). */\n\tdisplayName?: string;\n\trunId: string;\n\tname: string;\n\tscript: string;\n\targs: Record<string, unknown>;\n\tmeta: WorkflowMeta;\n\tstatus: \"pending\" | \"running\" | \"paused\" | \"completed\" | \"failed\" | \"aborted\";\n\tphases: string[];\n\tcurrentPhase: string | null;\n\t/** Progreso en vivo por agente (lo lee el panel del desktop). */\n\tagents?: Array<{\n\t\tid: string;\n\t\tlabel: string;\n\t\tphase?: string;\n\t\tstatus: \"running\" | \"done\" | \"failed\" | \"blocked\";\n\t\tblockedReason?: string;\n\t}>;\n\tjournal: JournalEntry[];\n\tagentCount: number;\n\ttokenUsage: { input: number; output: number; total: number; cost: number; cacheRead: number; cacheWrite: number };\n\tstartedAt: string;\n\tupdatedAt: string;\n\tresultPath?: string;\n\terror?: string;\n}\n\nexport interface RunJournalOptions {\n\t/** Directorio raíz de persistencia (~/.ada/agent/workflows/runs). */\n\trunsDir: string;\n}\n\nexport class RunJournal {\n\tprivate runsDir: string;\n\n\tconstructor(options: RunJournalOptions) {\n\t\tthis.runsDir = options.runsDir;\n\t}\n\n\tpathFor(runId: string): string {\n\t\treturn join(this.runsDir, `${runId}.json`);\n\t}\n\n\tasync save(state: PersistedRunState): Promise<void> {\n\t\tconst payload = { ...state, version: JOURNAL_VERSION, updatedAt: new Date().toISOString() };\n\t\tawait mkdir(dirname(this.pathFor(state.runId)), { recursive: true });\n\t\t// tmp ÚNICO por save: saves concurrentes (live progress) no pisan el tmp ajeno.\n\t\tconst tmp = `${this.pathFor(state.runId)}.${Date.now()}-${Math.random().toString(36).slice(2)}.tmp`;\n\t\tawait writeFile(tmp, JSON.stringify(payload, null, 1), \"utf-8\");\n\t\tawait import(\"node:fs/promises\").then(({ rename }) => rename(tmp, this.pathFor(state.runId)));\n\t}\n\n\tasync load(runId: string): Promise<PersistedRunState | null> {\n\t\ttry {\n\t\t\tconst raw = await readFile(this.pathFor(runId), \"utf-8\");\n\t\t\tconst parsed = JSON.parse(raw) as PersistedRunState;\n\t\t\tif (typeof parsed.version !== \"number\" || parsed.version > JOURNAL_VERSION) {\n\t\t\t\treturn null; // versión futura — no tocar\n\t\t\t}\n\t\t\treturn migrate(parsed);\n\t\t} catch {\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tasync delete(runId: string): Promise<void> {\n\t\ttry {\n\t\t\tconst { rm } = await import(\"node:fs/promises\");\n\t\t\tawait rm(this.pathFor(runId), { force: true });\n\t\t} catch {\n\t\t\t// best-effort\n\t\t}\n\t}\n\n\tasync list(): Promise<\n\t\tArray<{ runId: string; name: string; status: PersistedRunState[\"status\"]; updatedAt: string }>\n\t> {\n\t\ttry {\n\t\t\tconst { readdir } = await import(\"node:fs/promises\");\n\t\t\tconst files = await readdir(this.runsDir).catch(() => [] as string[]);\n\t\t\tconst out: Array<{ runId: string; name: string; status: PersistedRunState[\"status\"]; updatedAt: string }> = [];\n\t\t\tfor (const file of files) {\n\t\t\t\tif (!file.endsWith(\".json\") || file.endsWith(\".tmp\")) continue;\n\t\t\t\tconst state = await this.load(file.replace(/\\.json$/, \"\"));\n\t\t\t\tif (state) {\n\t\t\t\t\tout.push({\n\t\t\t\t\t\trunId: state.runId,\n\t\t\t\t\t\tname: state.name,\n\t\t\t\t\t\tstatus: state.status,\n\t\t\t\t\t\tupdatedAt: state.updatedAt,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn out.sort((a, b) => b.updatedAt.localeCompare(a.updatedAt));\n\t\t} catch {\n\t\t\treturn [];\n\t\t}\n\t}\n}\n\n/** Migraciones incrementales (v1 → v2 …). */\nfunction migrate(state: PersistedRunState & { version: number }): PersistedRunState {\n\tconst current = state as PersistedRunState;\n\t// v1: sin migraciones aún. Las siguientes versiones añaden `switch (current.version)`.\n\treturn current;\n}\n"]}

package/dist/core/workflows/journal.js

@@ -0,0 +1,83 @@
+/**
+ * RunJournal — persistencia del estado de un run de workflow.
+ *
+ * El disco es la fuente de verdad (adversarial R8.5): el snapshot se escribe
+ * tras cada evento relevante; el resume lee el archivo y re-aplica el journal
+ * (resultados cacheados + deltas del store en orden callSeq).
+ *
+ * Formato versionado (adversarial R9.1): `version` desde el día 1, migraciones
+ * incrementales con test por migración.
+ */
+import { mkdir, readFile, writeFile } from "node:fs/promises";
+import { dirname, join } from "node:path";
+export const JOURNAL_VERSION = 1;
+export class RunJournal {
+    runsDir;
+    constructor(options) {
+        this.runsDir = options.runsDir;
+    }
+    pathFor(runId) {
+        return join(this.runsDir, `${runId}.json`);
+    }
+    async save(state) {
+        const payload = { ...state, version: JOURNAL_VERSION, updatedAt: new Date().toISOString() };
+        await mkdir(dirname(this.pathFor(state.runId)), { recursive: true });
+        // tmp ÚNICO por save: saves concurrentes (live progress) no pisan el tmp ajeno.
+        const tmp = `${this.pathFor(state.runId)}.${Date.now()}-${Math.random().toString(36).slice(2)}.tmp`;
+        await writeFile(tmp, JSON.stringify(payload, null, 1), "utf-8");
+        await import("node:fs/promises").then(({ rename }) => rename(tmp, this.pathFor(state.runId)));
+    }
+    async load(runId) {
+        try {
+            const raw = await readFile(this.pathFor(runId), "utf-8");
+            const parsed = JSON.parse(raw);
+            if (typeof parsed.version !== "number" || parsed.version > JOURNAL_VERSION) {
+                return null; // versión futura — no tocar
+            }
+            return migrate(parsed);
+        }
+        catch {
+            return null;
+        }
+    }
+    async delete(runId) {
+        try {
+            const { rm } = await import("node:fs/promises");
+            await rm(this.pathFor(runId), { force: true });
+        }
+        catch {
+            // best-effort
+        }
+    }
+    async list() {
+        try {
+            const { readdir } = await import("node:fs/promises");
+            const files = await readdir(this.runsDir).catch(() => []);
+            const out = [];
+            for (const file of files) {
+                if (!file.endsWith(".json") || file.endsWith(".tmp"))
+                    continue;
+                const state = await this.load(file.replace(/\.json$/, ""));
+                if (state) {
+                    out.push({
+                        runId: state.runId,
+                        name: state.name,
+                        status: state.status,
+                        updatedAt: state.updatedAt,
+                    });
+                }
+            }
+            return out.sort((a, b) => b.updatedAt.localeCompare(a.updatedAt));
+        }
+        catch {
+            return [];
+        }
+    }
+}
+/** Migraciones incrementales (v1 → v2 …). */
+function migrate(state) {
+    const current = state;
+    // v1: sin migraciones aún. Las siguientes versiones añaden `switch (current.version)`.
+    return current;
+}
+//# sourceMappingURL=journal.js.map

package/dist/core/workflows/journal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"journal.js","sourceRoot":"","sources":["../../../src/core/workflows/journal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAG1C,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC;AAsCjC,MAAM,OAAO,UAAU;IACd,OAAO,CAAS;IAExB,YAAY,OAA0B,EAAE;QACvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;IAAA,CAC/B;IAED,OAAO,CAAC,KAAa,EAAU;QAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC;IAAA,CAC3C;IAED,KAAK,CAAC,IAAI,CAAC,KAAwB,EAAiB;QACnD,MAAM,OAAO,GAAG,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;QAC5F,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACrE,iFAAgF;QAChF,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACpG,MAAM,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAChE,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAAA,CAC9F;IAED,KAAK,CAAC,IAAI,CAAC,KAAa,EAAqC;QAC5D,IAAI,CAAC;YACJ,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAsB,CAAC;YACpD,IAAI,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ,IAAI,MAAM,CAAC,OAAO,GAAG,eAAe,EAAE,CAAC;gBAC5E,OAAO,IAAI,CAAC,CAAC,+BAA4B;YAC1C,CAAC;YACD,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;QAAC,MAAM,CAAC;YACR,OAAO,IAAI,CAAC;QACb,CAAC;IAAA,CACD;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAiB;QAC1C,IAAI,CAAC;YACJ,MAAM,EAAE,EAAE,EAAE,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC;YAChD,MAAM,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,CAAC;QAAC,MAAM,CAAC;YACR,cAAc;QACf,CAAC;IAAA,CACD;IAED,KAAK,CAAC,IAAI,GAER;QACD,IAAI,CAAC;YACJ,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAC;YACrD,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAc,CAAC,CAAC;YACtE,MAAM,GAAG,GAAmG,EAAE,CAAC;YAC/G,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAC/D,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC3D,IAAI,KAAK,EAAE,CAAC;oBACX,GAAG,CAAC,IAAI,CAAC;wBACR,KAAK,EAAE,KAAK,CAAC,KAAK;wBAClB,IAAI,EAAE,KAAK,CAAC,IAAI;wBAChB,MAAM,EAAE,KAAK,CAAC,MAAM;wBACpB,SAAS,EAAE,KAAK,CAAC,SAAS;qBAC1B,CAAC,CAAC;gBACJ,CAAC;YACF,CAAC;YACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QACnE,CAAC;QAAC,MAAM,CAAC;YACR,OAAO,EAAE,CAAC;QACX,CAAC;IAAA,CACD;CACD;AAED,iDAA6C;AAC7C,SAAS,OAAO,CAAC,KAA8C,EAAqB;IACnF,MAAM,OAAO,GAAG,KAA0B,CAAC;IAC3C,yFAAuF;IACvF,OAAO,OAAO,CAAC;AAAA,CACf","sourcesContent":["/**\n * RunJournal — persistencia del estado de un run de workflow.\n *\n * El disco es la fuente de verdad (adversarial R8.5): el snapshot se escribe\n * tras cada evento relevante; el resume lee el archivo y re-aplica el journal\n * (resultados cacheados + deltas del store en orden callSeq).\n *\n * Formato versionado (adversarial R9.1): `version` desde el día 1, migraciones\n * incrementales con test por migración.\n */\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname, join } from \"node:path\";\nimport type { JournalEntry, WorkflowMeta } from \"./types.ts\";\n\nexport const JOURNAL_VERSION = 1;\n\nexport interface PersistedRunState {\n\tversion: number;\n\t/** Sesión que lanzó el run (para filtrar por conversación en el panel). */\n\tsessionId?: string;\n\t/** Nombre para mostrar en el panel (p.ej. el título de la sub-tarea del goal). */\n\tdisplayName?: string;\n\trunId: string;\n\tname: string;\n\tscript: string;\n\targs: Record<string, unknown>;\n\tmeta: WorkflowMeta;\n\tstatus: \"pending\" | \"running\" | \"paused\" | \"completed\" | \"failed\" | \"aborted\";\n\tphases: string[];\n\tcurrentPhase: string | null;\n\t/** Progreso en vivo por agente (lo lee el panel del desktop). */\n\tagents?: Array<{\n\t\tid: string;\n\t\tlabel: string;\n\t\tphase?: string;\n\t\tstatus: \"running\" | \"done\" | \"failed\" | \"blocked\";\n\t\tblockedReason?: string;\n\t}>;\n\tjournal: JournalEntry[];\n\tagentCount: number;\n\ttokenUsage: { input: number; output: number; total: number; cost: number; cacheRead: number; cacheWrite: number };\n\tstartedAt: string;\n\tupdatedAt: string;\n\tresultPath?: string;\n\terror?: string;\n}\n\nexport interface RunJournalOptions {\n\t/** Directorio raíz de persistencia (~/.ada/agent/workflows/runs). */\n\trunsDir: string;\n}\n\nexport class RunJournal {\n\tprivate runsDir: string;\n\n\tconstructor(options: RunJournalOptions) {\n\t\tthis.runsDir = options.runsDir;\n\t}\n\n\tpathFor(runId: string): string {\n\t\treturn join(this.runsDir, `${runId}.json`);\n\t}\n\n\tasync save(state: PersistedRunState): Promise<void> {\n\t\tconst payload = { ...state, version: JOURNAL_VERSION, updatedAt: new Date().toISOString() };\n\t\tawait mkdir(dirname(this.pathFor(state.runId)), { recursive: true });\n\t\t// tmp ÚNICO por save: saves concurrentes (live progress) no pisan el tmp ajeno.\n\t\tconst tmp = `${this.pathFor(state.runId)}.${Date.now()}-${Math.random().toString(36).slice(2)}.tmp`;\n\t\tawait writeFile(tmp, JSON.stringify(payload, null, 1), \"utf-8\");\n\t\tawait import(\"node:fs/promises\").then(({ rename }) => rename(tmp, this.pathFor(state.runId)));\n\t}\n\n\tasync load(runId: string): Promise<PersistedRunState | null> {\n\t\ttry {\n\t\t\tconst raw = await readFile(this.pathFor(runId), \"utf-8\");\n\t\t\tconst parsed = JSON.parse(raw) as PersistedRunState;\n\t\t\tif (typeof parsed.version !== \"number\" || parsed.version > JOURNAL_VERSION) {\n\t\t\t\treturn null; // versión futura — no tocar\n\t\t\t}\n\t\t\treturn migrate(parsed);\n\t\t} catch {\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tasync delete(runId: string): Promise<void> {\n\t\ttry {\n\t\t\tconst { rm } = await import(\"node:fs/promises\");\n\t\t\tawait rm(this.pathFor(runId), { force: true });\n\t\t} catch {\n\t\t\t// best-effort\n\t\t}\n\t}\n\n\tasync list(): Promise<\n\t\tArray<{ runId: string; name: string; status: PersistedRunState[\"status\"]; updatedAt: string }>\n\t> {\n\t\ttry {\n\t\t\tconst { readdir } = await import(\"node:fs/promises\");\n\t\t\tconst files = await readdir(this.runsDir).catch(() => [] as string[]);\n\t\t\tconst out: Array<{ runId: string; name: string; status: PersistedRunState[\"status\"]; updatedAt: string }> = [];\n\t\t\tfor (const file of files) {\n\t\t\t\tif (!file.endsWith(\".json\") || file.endsWith(\".tmp\")) continue;\n\t\t\t\tconst state = await this.load(file.replace(/\\.json$/, \"\"));\n\t\t\t\tif (state) {\n\t\t\t\t\tout.push({\n\t\t\t\t\t\trunId: state.runId,\n\t\t\t\t\t\tname: state.name,\n\t\t\t\t\t\tstatus: state.status,\n\t\t\t\t\t\tupdatedAt: state.updatedAt,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn out.sort((a, b) => b.updatedAt.localeCompare(a.updatedAt));\n\t\t} catch {\n\t\t\treturn [];\n\t\t}\n\t}\n}\n\n/** Migraciones incrementales (v1 → v2 …). */\nfunction migrate(state: PersistedRunState & { version: number }): PersistedRunState {\n\tconst current = state as PersistedRunState;\n\t// v1: sin migraciones aún. Las siguientes versiones añaden `switch (current.version)`.\n\treturn current;\n}\n"]}