@stevenvo780/st-lang 4.9.0 → 4.11.0

package/dist/tooling/provenance/ledger.js

@@ -0,0 +1,439 @@
+"use strict";
+// ============================================================
+// ST Provenance Ledger — DAG de teoremas/lemas/axiomas + auditoría
+//
+// Determinístico, in-memory. La identidad de un nodo se deriva de
+// (statement, dependencies, kind) — el mismo enunciado con las
+// mismas deps recibe siempre el mismo id, lo que permite usar el
+// ledger como tabla de contenido compartible.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ProvenanceLedger = void 0;
+exports.auditTheorem = auditTheorem;
+exports.provenanceToCertificate = provenanceToCertificate;
+const crypto_1 = require("crypto");
+/**
+ * Normaliza el statement antes de hashear: trim + colapsar whitespace.
+ * Asegura que "P -> Q" y "P  ->  Q" produzcan el mismo id.
+ */
+function normalize(statement) {
+    return statement.trim().replace(/\s+/g, ' ');
+}
+/**
+ * Calcula el id determinístico del nodo. Incluye kind para evitar
+ * colisiones entre, por ejemplo, una `definition` y un `axiom` con
+ * la misma cadena.
+ */
+function computeId(statement, kind, dependencies) {
+    const canonical = JSON.stringify({
+        statement: normalize(statement),
+        kind,
+        dependencies: [...dependencies].sort(),
+    });
+    return (0, crypto_1.createHash)('sha256').update(canonical).digest('hex').slice(0, 32);
+}
+class ProvenanceLedger {
+    nodes = new Map();
+    /**
+     * Añade un nodo al ledger. Devuelve el id determinístico.
+     *
+     * Si el id ya existe se preserva el nodo previo y se devuelve el
+     * mismo id (idempotente). Falla si una dependencia no existe.
+     */
+    add(node) {
+        if (node.kind === 'axiom' && node.dependencies.length > 0) {
+            throw new Error(`axiom "${node.statement}" no puede tener dependencias`);
+        }
+        for (const dep of node.dependencies) {
+            if (!this.nodes.has(dep)) {
+                throw new Error(`dependencia inexistente: ${dep}`);
+            }
+        }
+        const id = computeId(node.statement, node.kind, node.dependencies);
+        if (this.nodes.has(id)) {
+            return id;
+        }
+        this.nodes.set(id, {
+            id,
+            statement: normalize(node.statement),
+            kind: node.kind,
+            dependencies: [...node.dependencies],
+            metadata: { ...node.metadata },
+            proof: node.proof,
+            trust: node.trust,
+        });
+        return id;
+    }
+    get(id) {
+        const n = this.nodes.get(id);
+        if (!n)
+            return undefined;
+        // Devolvemos copia defensiva para que el caller no mute el ledger.
+        return {
+            ...n,
+            dependencies: [...n.dependencies],
+            metadata: { ...n.metadata },
+        };
+    }
+    // --- Auditoría --------------------------------------------------
+    /**
+     * Walk recursivo de dependencias. Devuelve los nodos en orden
+     * topológico (deps antes que el nodo). Cada nodo aparece una sola
+     * vez aunque sea alcanzado por múltiples caminos.
+     */
+    dependencyChain(id) {
+        const root = this.nodes.get(id);
+        if (!root)
+            return [];
+        const visited = new Set();
+        const out = [];
+        const walk = (curr) => {
+            if (visited.has(curr))
+                return;
+            visited.add(curr);
+            const node = this.nodes.get(curr);
+            if (!node)
+                return;
+            for (const dep of node.dependencies)
+                walk(dep);
+            out.push({ ...node, dependencies: [...node.dependencies], metadata: { ...node.metadata } });
+        };
+        walk(id);
+        return out;
+    }
+    /**
+     * Cuenta trust por categoría sobre el cierre transitivo (incluye al root).
+     */
+    trustChain(id) {
+        const chain = this.dependencyChain(id);
+        const acc = { verified: 0, admitted: 0, external: 0 };
+        for (const node of chain) {
+            acc[node.trust]++;
+        }
+        return acc;
+    }
+    /**
+     * Conjunto de IDs de axiomas alcanzables desde `id` (cierre).
+     * Útil para "¿qué postulados base sostienen este teorema?".
+     */
+    axiomsUsed(id) {
+        const chain = this.dependencyChain(id);
+        const out = new Set();
+        for (const node of chain) {
+            if (node.kind === 'axiom')
+                out.add(node.id);
+        }
+        return out;
+    }
+    /**
+     * true sólo si todos los nodos del cierre transitivo (incluido el root)
+     * tienen trust='verified'. Un solo `admitted` o `external` lo descalifica.
+     */
+    isFullyVerified(id) {
+        const chain = this.dependencyChain(id);
+        if (chain.length === 0)
+            return false;
+        return chain.every((n) => n.trust === 'verified');
+    }
+    // --- Queries de grafo -------------------------------------------
+    /** Cierre transitivo de ancestros (deps directas + indirectas), sin el propio nodo. */
+    ancestors(id) {
+        const out = new Set();
+        const root = this.nodes.get(id);
+        if (!root)
+            return out;
+        const walk = (curr) => {
+            const node = this.nodes.get(curr);
+            if (!node)
+                return;
+            for (const dep of node.dependencies) {
+                if (!out.has(dep)) {
+                    out.add(dep);
+                    walk(dep);
+                }
+            }
+        };
+        walk(id);
+        return out;
+    }
+    /** Cierre transitivo de descendientes (quien depende de este nodo), sin el propio nodo. */
+    descendants(id) {
+        const out = new Set();
+        if (!this.nodes.has(id))
+            return out;
+        let changed = true;
+        while (changed) {
+            changed = false;
+            for (const node of this.nodes.values()) {
+                if (out.has(node.id) || node.id === id)
+                    continue;
+                for (const dep of node.dependencies) {
+                    if (dep === id || out.has(dep)) {
+                        out.add(node.id);
+                        changed = true;
+                        break;
+                    }
+                }
+            }
+        }
+        return out;
+    }
+    /**
+     * Detecta ciclos. Devuelve la lista de ciclos como arrays de IDs.
+     *
+     * Bajo construcción normal `add()` impide ciclos (toda dep debe existir
+     * antes), pero la importación cruda de un ledger podría introducirlos
+     * — esta función lo verifica explícitamente.
+     */
+    findCircular() {
+        const cycles = [];
+        const WHITE = 0, GRAY = 1, BLACK = 2;
+        const color = new Map();
+        const stack = [];
+        const dfs = (curr) => {
+            color.set(curr, GRAY);
+            stack.push(curr);
+            const node = this.nodes.get(curr);
+            if (node) {
+                for (const dep of node.dependencies) {
+                    const c = color.get(dep) ?? WHITE;
+                    if (c === GRAY) {
+                        const idx = stack.indexOf(dep);
+                        if (idx >= 0)
+                            cycles.push(stack.slice(idx).concat(dep));
+                    }
+                    else if (c === WHITE) {
+                        dfs(dep);
+                    }
+                }
+            }
+            stack.pop();
+            color.set(curr, BLACK);
+        };
+        for (const id of this.nodes.keys()) {
+            if ((color.get(id) ?? WHITE) === WHITE)
+                dfs(id);
+        }
+        return cycles;
+    }
+    // --- Estadísticas -----------------------------------------------
+    totalNodes() {
+        return this.nodes.size;
+    }
+    axiomCount() {
+        let n = 0;
+        for (const node of this.nodes.values())
+            if (node.kind === 'axiom')
+                n++;
+        return n;
+    }
+    /** Longitud (en nodos) de la cadena más larga de dependencias. */
+    longestChain() {
+        const memo = new Map();
+        const depth = (curr) => {
+            const cached = memo.get(curr);
+            if (cached !== undefined)
+                return cached;
+            const node = this.nodes.get(curr);
+            if (!node || node.dependencies.length === 0) {
+                memo.set(curr, 1);
+                return 1;
+            }
+            let best = 0;
+            for (const dep of node.dependencies) {
+                const d = depth(dep);
+                if (d > best)
+                    best = d;
+            }
+            const result = best + 1;
+            memo.set(curr, result);
+            return result;
+        };
+        let max = 0;
+        for (const id of this.nodes.keys()) {
+            const d = depth(id);
+            if (d > max)
+                max = d;
+        }
+        return max;
+    }
+    // --- Serialización ---------------------------------------------
+    /**
+     * Exporta el ledger a JSON determinístico (claves ordenadas, nodos
+     * ordenados por id). Apto para hashing y para diff.
+     */
+    exportLedger() {
+        const ordered = Array.from(this.nodes.values()).sort((a, b) => (a.id < b.id ? -1 : 1));
+        const serializable = ordered.map((n) => ({
+            id: n.id,
+            statement: n.statement,
+            kind: n.kind,
+            dependencies: [...n.dependencies].sort(),
+            metadata: n.metadata,
+            proof: n.proof,
+            trust: n.trust,
+        }));
+        const payload = { version: '1.0', nodes: serializable };
+        return canonicalJson(payload);
+    }
+    /**
+     * Reemplaza el contenido del ledger por el contenido del JSON.
+     * Tolera reordenamiento de nodos: hace dos pasadas para resolver
+     * dependencias forward (en caso de que el JSON no esté topológicamente
+     * ordenado, aunque exportLedger siempre lo deja así).
+     */
+    importLedger(json) {
+        const parsed = JSON.parse(json);
+        if (!parsed || parsed.version !== '1.0' || !Array.isArray(parsed.nodes)) {
+            throw new Error('formato de ledger inválido');
+        }
+        this.nodes.clear();
+        const pending = [...parsed.nodes];
+        let progress = true;
+        while (pending.length > 0 && progress) {
+            progress = false;
+            for (let i = pending.length - 1; i >= 0; i--) {
+                const node = pending[i];
+                if (!node)
+                    continue;
+                if (node.dependencies.every((d) => this.nodes.has(d))) {
+                    this.nodes.set(node.id, {
+                        ...node,
+                        dependencies: [...node.dependencies],
+                        metadata: { ...node.metadata },
+                    });
+                    pending.splice(i, 1);
+                    progress = true;
+                }
+            }
+        }
+        if (pending.length > 0) {
+            // Restauramos los pendientes tal cual; las dependencias huérfanas o
+            // ciclos se detectarán con findCircular() o get() del consumidor.
+            for (const node of pending) {
+                this.nodes.set(node.id, {
+                    ...node,
+                    dependencies: [...node.dependencies],
+                    metadata: { ...node.metadata },
+                });
+            }
+        }
+    }
+    /**
+     * Hash SHA-256 del ledger canonicalizado. Si dos ledgers tienen el
+     * mismo hash, son idénticos en contenido. Devuelve Promise para
+     * dejar la puerta abierta a un hash async (WebCrypto) en runtime
+     * sin Node `crypto` — la implementación actual es síncrona.
+     */
+    hashLedger() {
+        const canonical = this.exportLedger();
+        return Promise.resolve((0, crypto_1.createHash)('sha256').update(canonical).digest('hex'));
+    }
+}
+exports.ProvenanceLedger = ProvenanceLedger;
+function canonicalJson(value) {
+    return stringify(value);
+}
+function stringify(value) {
+    if (value === null)
+        return 'null';
+    if (typeof value === 'boolean')
+        return value ? 'true' : 'false';
+    if (typeof value === 'number') {
+        if (!isFinite(value))
+            throw new Error('non-finite number in ledger');
+        return String(value);
+    }
+    if (typeof value === 'string')
+        return JSON.stringify(value);
+    if (Array.isArray(value))
+        return '[' + value.map(stringify).join(',') + ']';
+    if (typeof value === 'object') {
+        const obj = value;
+        const keys = Object.keys(obj).sort();
+        const pairs = [];
+        for (const k of keys) {
+            const v = obj[k];
+            if (v === undefined)
+                continue;
+            pairs.push(JSON.stringify(k) + ':' + stringify(v));
+        }
+        return '{' + pairs.join(',') + '}';
+    }
+    return 'null';
+}
+// --- auditoría a nivel de teorema -------------------------------
+/**
+ * Genera un reporte humano-legible sobre la confianza en `theoremId`.
+ *
+ * Estimación de riesgo:
+ * - `low`: 100% verified.
+ * - `medium`: al menos 1 admitted o external pero <30% del DAG.
+ * - `high`: >=30% admitted+external, o un axioma fundamental marcado como external.
+ */
+function auditTheorem(theoremId, ledger) {
+    const root = ledger.get(theoremId);
+    if (!root) {
+        throw new Error(`teorema no encontrado en el ledger: ${theoremId}`);
+    }
+    const chain = ledger.dependencyChain(theoremId);
+    const trustClassification = ledger.trustChain(theoremId);
+    const externalDependencies = chain.filter((n) => n.trust === 'external');
+    const admittedDependencies = chain.filter((n) => n.trust === 'admitted');
+    const axiomList = ledger.axiomsUsed(theoremId);
+    const totalNodes = chain.length;
+    const unverified = trustClassification.admitted + trustClassification.external;
+    const ratio = totalNodes > 0 ? unverified / totalNodes : 0;
+    let estimatedRisk;
+    if (unverified === 0) {
+        estimatedRisk = 'low';
+    }
+    else if (ratio >= 0.3) {
+        estimatedRisk = 'high';
+    }
+    else {
+        // Si un axioma raíz es external/admitted la confianza es estructuralmente baja.
+        const hasUntrustedAxiom = chain.some((n) => n.kind === 'axiom' && (n.trust === 'external' || n.trust === 'admitted'));
+        estimatedRisk = hasUntrustedAxiom ? 'high' : 'medium';
+    }
+    return {
+        rootTheorem: root.statement,
+        trustClassification,
+        externalDependencies,
+        admittedDependencies,
+        axiomList,
+        totalNodes,
+        estimatedRisk,
+    };
+}
+// --- bridge con el formato `ProofCertificate` -------------------
+/**
+ * Convierte un nodo + su cadena a una forma compatible con el
+ * certificado de prueba existente. No reemplaza al generador real:
+ * sirve para que el agente pueda exportar el contexto de proveniencia
+ * cuando publica un teorema.
+ */
+function provenanceToCertificate(node, ledger) {
+    const chain = ledger.dependencyChain(node.id);
+    return {
+        version: '1.0',
+        goal: node.statement,
+        profile: node.metadata.profile,
+        axioms: chain.filter((n) => n.kind === 'axiom').map((n) => n.statement),
+        provenance: {
+            kind: node.kind,
+            trust: node.trust,
+            provedBy: node.metadata.provedBy,
+            provedAt: node.metadata.provedAt,
+            tool: node.metadata.tool,
+            chainLength: chain.length,
+            dependencies: chain.map((n) => ({
+                id: n.id,
+                statement: n.statement,
+                kind: n.kind,
+                trust: n.trust,
+            })),
+        },
+    };
+}
+//# sourceMappingURL=ledger.js.map

package/dist/tooling/provenance/ledger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ledger.js","sourceRoot":"","sources":["../../../src/tooling/provenance/ledger.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mEAAmE;AACnE,EAAE;AACF,kEAAkE;AAClE,+DAA+D;AAC/D,iEAAiE;AACjE,8CAA8C;AAC9C,+DAA+D;;;AA8X/D,oCAsCC;AAUD,0DAsBC;AAlcD,mCAAoC;AAcpC;;;GAGG;AACH,SAAS,SAAS,CAAC,SAAiB;IAClC,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC/C,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,SAAiB,EAAE,IAAoB,EAAE,YAAsB;IAChF,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,SAAS,EAAE,SAAS,CAAC,SAAS,CAAC;QAC/B,IAAI;QACJ,YAAY,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,IAAI,EAAE;KACvC,CAAC,CAAC;IACH,OAAO,IAAA,mBAAU,EAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC3E,CAAC;AAED,MAAa,gBAAgB;IACV,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAE3D;;;;;OAKG;IACH,GAAG,CAAC,IAAgC;QAClC,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1D,MAAM,IAAI,KAAK,CAAC,UAAU,IAAI,CAAC,SAAS,+BAA+B,CAAC,CAAC;QAC3E,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QACD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACnE,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC;YACpC,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,YAAY,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;YACpC,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE;YAC9B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC,CAAC;QACH,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,GAAG,CAAC,EAAU;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACzB,mEAAmE;QACnE,OAAO;YACL,GAAG,CAAC;YACJ,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC;YACjC,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE;SAC5B,CAAC;IACJ,CAAC;IAED,mEAAmE;IAEnE;;;;OAIG;IACH,eAAe,CAAC,EAAU;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,GAAG,GAAqB,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAQ,EAAE;YAClC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO;YAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI;gBAAE,OAAO;YAClB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/C,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,YAAY,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC9F,CAAC,CAAC;QACF,IAAI,CAAC,EAAE,CAAC,CAAC;QACT,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,EAAU;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,EAAU;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,EAAU;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC;IACpD,CAAC;IAED,mEAAmE;IAEnE,uFAAuF;IACvF,SAAS,CAAC,EAAU;QAClB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO,GAAG,CAAC;QACtB,MAAM,IAAI,GAAG,CAAC,IAAY,EAAQ,EAAE;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI;gBAAE,OAAO;YAClB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAClB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACb,IAAI,CAAC,GAAG,CAAC,CAAC;gBACZ,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,EAAE,CAAC,CAAC;QACT,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2FAA2F;IAC3F,WAAW,CAAC,EAAU;QACpB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACvC,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;oBAAE,SAAS;gBACjD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpC,IAAI,GAAG,KAAK,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACjB,OAAO,GAAG,IAAI,CAAC;wBACf,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACH,YAAY;QACV,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,EACb,IAAI,GAAG,CAAC,EACR,KAAK,GAAG,CAAC,CAAC;QACZ,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE;YACjC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpC,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;oBAClC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;wBACf,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;wBAC/B,IAAI,GAAG,IAAI,CAAC;4BAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC1D,CAAC;yBAAM,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;wBACvB,GAAG,CAAC,GAAG,CAAC,CAAC;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,CAAC,GAAG,EAAE,CAAC;YACZ,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzB,CAAC,CAAC;QAEF,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,KAAK,KAAK;gBAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,mEAAmE;IAEnE,UAAU;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,UAAU;QACR,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YAAE,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,CAAC,EAAE,CAAC;QACvE,OAAO,CAAC,CAAC;IACX,CAAC;IAED,kEAAkE;IAClE,YAAY;QACV,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAU,EAAE;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,MAAM,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5C,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAClB,OAAO,CAAC,CAAC;YACX,CAAC;YACD,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;gBACrB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC;YACxB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACvB,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QACF,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACpB,IAAI,CAAC,GAAG,GAAG;gBAAE,GAAG,GAAG,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,kEAAkE;IAElE;;;OAGG;IACH,YAAY;QACV,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,MAAM,YAAY,GAAqB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACzD,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE;YACxC,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,KAAK,EAAE,CAAC,CAAC,KAAK;SACf,CAAC,CAAC,CAAC;QACJ,MAAM,OAAO,GAAqB,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;QAC1E,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,IAAY;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAqB,CAAC;QACpD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YACxE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,QAAQ,GAAG,KAAK,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,IAAI;oBAAE,SAAS;gBACpB,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;wBACtB,GAAG,IAAI;wBACP,YAAY,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;wBACpC,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE;qBAC/B,CAAC,CAAC;oBACH,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACrB,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,oEAAoE;YACpE,kEAAkE;YAClE,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;oBACtB,GAAG,IAAI;oBACP,YAAY,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;oBACpC,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE;iBAC/B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,UAAU;QACR,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACtC,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,mBAAU,EAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/E,CAAC;CACF;AA5SD,4CA4SC;AAOD,SAAS,aAAa,CAAC,KAAc;IACnC,OAAO,SAAS,CAAC,KAAkB,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,SAAS,CAAC,KAAgB;IACjC,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAClC,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;IAChE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACrE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IAC5E,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,KAAmC,CAAC;QAChD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACrC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YAC9B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACrC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,mEAAmE;AAEnE;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAC,SAAiB,EAAE,MAAwB;IACtE,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,uCAAuC,SAAS,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;IAChD,MAAM,mBAAmB,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;IAEzD,MAAM,oBAAoB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC;IACzE,MAAM,oBAAoB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC;IACzE,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;IAEhC,MAAM,UAAU,GAAG,mBAAmB,CAAC,QAAQ,GAAG,mBAAmB,CAAC,QAAQ,CAAC;IAC/E,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,IAAI,aAAwC,CAAC;IAC7C,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACrB,aAAa,GAAG,KAAK,CAAC;IACxB,CAAC;SAAM,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;QACxB,aAAa,GAAG,MAAM,CAAC;IACzB,CAAC;SAAM,CAAC;QACN,gFAAgF;QAChF,MAAM,iBAAiB,GAAG,KAAK,CAAC,IAAI,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,IAAI,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,CAChF,CAAC;QACF,aAAa,GAAG,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxD,CAAC;IAED,OAAO;QACL,WAAW,EAAE,IAAI,CAAC,SAAS;QAC3B,mBAAmB;QACnB,oBAAoB;QACpB,oBAAoB;QACpB,SAAS;QACT,UAAU;QACV,aAAa;KACd,CAAC;AACJ,CAAC;AAED,mEAAmE;AAEnE;;;;;GAKG;AACH,SAAgB,uBAAuB,CAAC,IAAoB,EAAE,MAAwB;IACpF,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9C,OAAO;QACL,OAAO,EAAE,KAAc;QACvB,IAAI,EAAE,IAAI,CAAC,SAAS;QACpB,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO;QAC9B,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACvE,UAAU,EAAE;YACV,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,QAAQ;YAChC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,QAAQ;YAChC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YACxB,WAAW,EAAE,KAAK,CAAC,MAAM;YACzB,YAAY,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9B,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,KAAK,EAAE,CAAC,CAAC,KAAK;aACf,CAAC,CAAC;SACJ;KACF,CAAC;AACJ,CAAC"}

package/dist/tooling/provenance/types.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Categoría del nodo dentro del DAG.
+ *
+ * - `axiom`: postulado base sin dependencias (puede tener proof=undefined).
+ * - `lemma`: resultado intermedio reusable.
+ * - `theorem`: resultado principal o expuesto al usuario.
+ * - `definition`: introduce una notación o constante (no es proposición).
+ */
+export type ProvenanceKind = 'axiom' | 'lemma' | 'theorem' | 'definition';
+/**
+ * Nivel de confianza en el nodo:
+ * - `verified`: probado mecánicamente o aceptado por la audiencia del sistema.
+ * - `admitted`: declarado sin prueba (TODO, sorry, oracle). Se propaga como amarillo.
+ * - `external`: aceptado por referencia a otra herramienta (Lean, Coq, hardware oracle).
+ */
+export type TrustLevel = 'verified' | 'admitted' | 'external';
+/**
+ * Metadata asociada a un nodo. Todo es serializable a JSON puro.
+ * `tool` permite distinguir prueba humana, táctica DSL automática
+ * o checker externo. `durationMs` y `proofSize` son opcionales y
+ * sirven para análisis posterior.
+ */
+export interface ProvenanceMetadata {
+    /** Timestamp ISO 8601 (string) de cuando se añadió el nodo. */
+    provedAt: string;
+    /** Identificador libre del autor (uid, "manual", "agent:claude-opus"...). */
+    provedBy: string;
+    /** Perfil lógico bajo el que se aceptó (p.ej. classical.propositional). */
+    profile: string;
+    /** Herramienta usada: 'manual', 'st-prover@4.10.0', 'lean4', 'coq', 'tactic-dsl', 'auto'. */
+    tool: string;
+    /** Duración opcional en milisegundos para reportes. */
+    durationMs?: number;
+    /** Tamaño opcional de la prueba (pasos / bytes / nodos AST). */
+    proofSize?: number;
+}
+/**
+ * Nodo del DAG de proveniencia. El `id` es derivado determinísticamente
+ * del statement + dependencias (ver `ProvenanceLedger.add`) para que el
+ * mismo statement con las mismas deps reciba siempre el mismo identificador.
+ */
+export interface ProvenanceNode {
+    id: string;
+    statement: string;
+    kind: ProvenanceKind;
+    /** IDs de prerequisitos. Para `axiom` debe estar vacío. */
+    dependencies: string[];
+    metadata: ProvenanceMetadata;
+    /** Prueba opcional — el ledger no la inspecciona, sólo la guarda. */
+    proof?: unknown;
+    trust: TrustLevel;
+}
+/**
+ * Reporte de auditoría: clasifica dependencias del teorema raíz y
+ * estima riesgo en función de cuánto del DAG es admitido o externo.
+ */
+export interface AuditReport {
+    rootTheorem: string;
+    trustClassification: {
+        verified: number;
+        admitted: number;
+        external: number;
+    };
+    externalDependencies: ProvenanceNode[];
+    admittedDependencies: ProvenanceNode[];
+    axiomList: Set<string>;
+    totalNodes: number;
+    estimatedRisk: 'low' | 'medium' | 'high';
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/tooling/provenance/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/tooling/provenance/types.ts"],"names":[],"mappings":"AAYA;;;;;;;GAOG;AACH,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG,OAAO,GAAG,SAAS,GAAG,YAAY,CAAC;AAE1E;;;;;GAKG;AACH,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,UAAU,GAAG,UAAU,CAAC;AAE9D;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,CAAC;IACjB,6EAA6E;IAC7E,QAAQ,EAAE,MAAM,CAAC;IACjB,2EAA2E;IAC3E,OAAO,EAAE,MAAM,CAAC;IAChB,6FAA6F;IAC7F,IAAI,EAAE,MAAM,CAAC;IACb,uDAAuD;IACvD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gEAAgE;IAChE,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,cAAc,CAAC;IACrB,2DAA2D;IAC3D,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,qEAAqE;IACrE,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,KAAK,EAAE,UAAU,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,mBAAmB,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IAC9E,oBAAoB,EAAE,cAAc,EAAE,CAAC;IACvC,oBAAoB,EAAE,cAAc,EAAE,CAAC;IACvC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;CAC1C"}

package/dist/tooling/provenance/types.js

@@ -0,0 +1,14 @@
+"use strict";
+// ============================================================
+// ST Provenance — Tipos públicos
+//
+// Cada nodo del DAG es un axioma, lema, definición o teorema con
+// sus dependencias explícitas, metadata de proveniencia (quién /
+// cuándo / con qué herramienta) y nivel de confianza.
+//
+// El ledger mantiene el grafo + permite auditorías recursivas:
+// qué axiomas se usaron para llegar a un teorema, qué nodos son
+// admitidos (sin prueba) o externos (de otra fuente).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/tooling/provenance/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/tooling/provenance/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iCAAiC;AACjC,EAAE;AACF,iEAAiE;AACjE,iEAAiE;AACjE,sDAAsD;AACtD,EAAE;AACF,+DAA+D;AAC/D,gEAAgE;AAChE,sDAAsD;AACtD,+DAA+D"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stevenvo780/st-lang",
-  "version": "4.9.0",
+  "version": "4.11.0",
   "description": "ST — Lenguaje ejecutable con nucleo logico y capa textual. Motor multi-perfil (11 lógicas), derivaciones, tablas de verdad, contramodelos, aliases modales, Belnap 4-valores y capa textual para formalización de documentos.",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",