@stevenvo780/st-lang 4.10.0 → 4.11.0

package/dist/tooling/lemma-library/set-theory.js

@@ -0,0 +1,134 @@
+"use strict";
+// ============================================================
+// Lemas curados — Teoría de conjuntos (~15)
+// Álgebra booleana sobre ∪, ∩, ⊆, complemento.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SET_THEORY_LEMMAS = void 0;
+exports.SET_THEORY_LEMMAS = [
+    {
+        id: 'set.union-commutative',
+        name: 'Commutativity of union',
+        statement: '∀A B. A ∪ B = B ∪ A',
+        domain: 'set',
+        tags: ['commutativity', 'union', 'boolean-algebra'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'set.inter-commutative',
+        name: 'Commutativity of intersection',
+        statement: '∀A B. A ∩ B = B ∩ A',
+        domain: 'set',
+        tags: ['commutativity', 'intersection', 'boolean-algebra'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'set.union-associative',
+        name: 'Associativity of union',
+        statement: '∀A B C. (A ∪ B) ∪ C = A ∪ (B ∪ C)',
+        domain: 'set',
+        tags: ['associativity', 'union', 'boolean-algebra'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'set.inter-associative',
+        name: 'Associativity of intersection',
+        statement: '∀A B C. (A ∩ B) ∩ C = A ∩ (B ∩ C)',
+        domain: 'set',
+        tags: ['associativity', 'intersection', 'boolean-algebra'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'set.union-distributes-inter',
+        name: 'Distributivity of ∪ over ∩',
+        statement: '∀A B C. A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)',
+        domain: 'set',
+        tags: ['distributivity', 'union', 'intersection', 'boolean-algebra'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'set.inter-distributes-union',
+        name: 'Distributivity of ∩ over ∪',
+        statement: '∀A B C. A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)',
+        domain: 'set',
+        tags: ['distributivity', 'union', 'intersection', 'boolean-algebra'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'set.de-morgan-union',
+        name: 'De Morgan (union)',
+        statement: '∀A B. (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ',
+        domain: 'set',
+        tags: ['de-morgan', 'union', 'complement', 'duality', 'boolean-algebra'],
+        difficulty: 'medium',
+        references: ['De Morgan, 1860'],
+    },
+    {
+        id: 'set.de-morgan-inter',
+        name: 'De Morgan (intersection)',
+        statement: '∀A B. (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ',
+        domain: 'set',
+        tags: ['de-morgan', 'intersection', 'complement', 'duality', 'boolean-algebra'],
+        difficulty: 'medium',
+        references: ['De Morgan, 1860'],
+    },
+    {
+        id: 'set.union-idempotent',
+        name: 'Idempotence of union',
+        statement: '∀A. A ∪ A = A',
+        domain: 'set',
+        tags: ['idempotence', 'union', 'boolean-algebra'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'set.inter-idempotent',
+        name: 'Idempotence of intersection',
+        statement: '∀A. A ∩ A = A',
+        domain: 'set',
+        tags: ['idempotence', 'intersection', 'boolean-algebra'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'set.union-empty',
+        name: 'Union with empty set',
+        statement: '∀A. A ∪ ∅ = A',
+        domain: 'set',
+        tags: ['identity', 'union', 'empty-set'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'set.inter-empty',
+        name: 'Intersection with empty set',
+        statement: '∀A. A ∩ ∅ = ∅',
+        domain: 'set',
+        tags: ['annihilator', 'intersection', 'empty-set'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'set.subset-reflexive',
+        name: 'Reflexivity of ⊆',
+        statement: '∀A. A ⊆ A',
+        domain: 'set',
+        tags: ['reflexivity', 'subset', 'order'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'set.subset-transitive',
+        name: 'Transitivity of ⊆',
+        statement: '∀A B C. A ⊆ B ∧ B ⊆ C → A ⊆ C',
+        domain: 'set',
+        tags: ['transitivity', 'subset', 'order'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'set.extensionality',
+        name: 'Axiom of extensionality',
+        statement: '∀A B. (∀x. x ∈ A ↔ x ∈ B) → A = B',
+        domain: 'set',
+        tags: ['zfc', 'extensionality', 'axiom', 'equality'],
+        difficulty: 'easy',
+        isAxiom: true,
+        references: ['Zermelo, 1908'],
+    },
+];
+//# sourceMappingURL=set-theory.js.map

package/dist/tooling/lemma-library/set-theory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"set-theory.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/set-theory.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+CAA+C;AAC/C,+DAA+D;;;AAIlD,QAAA,iBAAiB,GAAmB;IAC/C;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,eAAe,EAAE,OAAO,EAAE,iBAAiB,CAAC;QACnD,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,+BAA+B;QACrC,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,eAAe,EAAE,cAAc,EAAE,iBAAiB,CAAC;QAC1D,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,mCAAmC;QAC9C,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,eAAe,EAAE,OAAO,EAAE,iBAAiB,CAAC;QACnD,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,+BAA+B;QACrC,SAAS,EAAE,mCAAmC;QAC9C,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,eAAe,EAAE,cAAc,EAAE,iBAAiB,CAAC;QAC1D,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,6BAA6B;QACjC,IAAI,EAAE,4BAA4B;QAClC,SAAS,EAAE,yCAAyC;QACpD,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,gBAAgB,EAAE,OAAO,EAAE,cAAc,EAAE,iBAAiB,CAAC;QACpE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,6BAA6B;QACjC,IAAI,EAAE,4BAA4B;QAClC,SAAS,EAAE,yCAAyC;QACpD,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,gBAAgB,EAAE,OAAO,EAAE,cAAc,EAAE,iBAAiB,CAAC;QACpE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,mBAAmB;QACzB,SAAS,EAAE,0BAA0B;QACrC,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,WAAW,EAAE,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,iBAAiB,CAAC;QACxE,UAAU,EAAE,QAAQ;QACpB,UAAU,EAAE,CAAC,iBAAiB,CAAC;KAChC;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,0BAA0B;QAChC,SAAS,EAAE,0BAA0B;QACrC,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,SAAS,EAAE,iBAAiB,CAAC;QAC/E,UAAU,EAAE,QAAQ;QACpB,UAAU,EAAE,CAAC,iBAAiB,CAAC;KAChC;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,sBAAsB;QAC5B,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,aAAa,EAAE,OAAO,EAAE,iBAAiB,CAAC;QACjD,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,6BAA6B;QACnC,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,aAAa,EAAE,cAAc,EAAE,iBAAiB,CAAC;QACxD,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,sBAAsB;QAC5B,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,CAAC;QACxC,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,6BAA6B;QACnC,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,aAAa,EAAE,cAAc,EAAE,WAAW,CAAC;QAClD,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,kBAAkB;QACxB,SAAS,EAAE,WAAW;QACtB,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,aAAa,EAAE,QAAQ,EAAE,OAAO,CAAC;QACxC,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,mBAAmB;QACzB,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,cAAc,EAAE,QAAQ,EAAE,OAAO,CAAC;QACzC,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,mCAAmC;QAC9C,MAAM,EAAE,KAAK;QACb,IAAI,EAAE,CAAC,KAAK,EAAE,gBAAgB,EAAE,OAAO,EAAE,UAAU,CAAC;QACpD,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;QACb,UAAU,EAAE,CAAC,eAAe,CAAC;KAC9B;CACF,CAAC"}

package/dist/tooling/lemma-library/standard.d.ts

@@ -0,0 +1,3 @@
+import { LemmaLibrary } from './library';
+export declare function standardLibrary(): LemmaLibrary;
+//# sourceMappingURL=standard.d.ts.map

package/dist/tooling/lemma-library/standard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"standard.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/standard.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAOzC,wBAAgB,eAAe,IAAI,YAAY,CAQ9C"}

package/dist/tooling/lemma-library/standard.js

@@ -0,0 +1,27 @@
+"use strict";
+// ============================================================
+// standardLibrary() — ensamble de la biblioteca curada base
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.standardLibrary = standardLibrary;
+const library_1 = require("./library");
+const propositional_1 = require("./propositional");
+const arithmetic_1 = require("./arithmetic");
+const set_theory_1 = require("./set-theory");
+const modal_1 = require("./modal");
+const firstorder_1 = require("./firstorder");
+function standardLibrary() {
+    const lib = new library_1.LemmaLibrary();
+    for (const lemma of propositional_1.PROPOSITIONAL_LEMMAS)
+        lib.add(lemma);
+    for (const lemma of arithmetic_1.ARITHMETIC_LEMMAS)
+        lib.add(lemma);
+    for (const lemma of set_theory_1.SET_THEORY_LEMMAS)
+        lib.add(lemma);
+    for (const lemma of modal_1.MODAL_LEMMAS)
+        lib.add(lemma);
+    for (const lemma of firstorder_1.FIRSTORDER_LEMMAS)
+        lib.add(lemma);
+    return lib;
+}
+//# sourceMappingURL=standard.js.map

package/dist/tooling/lemma-library/standard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"standard.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/standard.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;;AAS/D,0CAQC;AAfD,uCAAyC;AACzC,mDAAuD;AACvD,6CAAiD;AACjD,6CAAiD;AACjD,mCAAuC;AACvC,6CAAiD;AAEjD,SAAgB,eAAe;IAC7B,MAAM,GAAG,GAAG,IAAI,sBAAY,EAAE,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,oCAAoB;QAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzD,KAAK,MAAM,KAAK,IAAI,8BAAiB;QAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtD,KAAK,MAAM,KAAK,IAAI,8BAAiB;QAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtD,KAAK,MAAM,KAAK,IAAI,oBAAY;QAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,8BAAiB;QAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/tooling/lemma-library/tfidf.d.ts

@@ -0,0 +1,5 @@
+import type { SemanticSearchHit, TfIdfIndex } from './types';
+import type { LemmaLibrary } from './library';
+export declare function buildIndex(library: LemmaLibrary): TfIdfIndex;
+export declare function semanticSearch(index: TfIdfIndex, query: string, k?: number): SemanticSearchHit[];
+//# sourceMappingURL=tfidf.d.ts.map

package/dist/tooling/lemma-library/tfidf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/tfidf.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAgB,iBAAiB,EAAiB,UAAU,EAAE,MAAM,SAAS,CAAC;AAC1F,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAW9C,wBAAgB,UAAU,CAAC,OAAO,EAAE,YAAY,GAAG,UAAU,CAoB5D;AA4CD,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,SAAI,GAAG,iBAAiB,EAAE,CAc3F"}

package/dist/tooling/lemma-library/tfidf.js

@@ -0,0 +1,100 @@
+"use strict";
+// ============================================================
+// Índice TF-IDF sobre LemmaLibrary
+//
+// Construye un vector espaciable por documento (lema) mezclando
+// name + tags + statement. Ranking de consultas via cosine
+// similarity. Determinístico, sin dependencias externas.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildIndex = buildIndex;
+exports.semanticSearch = semanticSearch;
+const tokenize_1 = require("./tokenize");
+function lemmaTokens(lemma) {
+    return [
+        ...(0, tokenize_1.tokenize)(lemma.name),
+        ...lemma.tags.flatMap((t) => (0, tokenize_1.tokenize)(t)),
+        ...(0, tokenize_1.tokenize)(lemma.statement),
+    ];
+}
+function buildIndex(library) {
+    const lemmas = library.all();
+    const lemmasMap = new Map();
+    const documents = [];
+    const docFreq = new Map();
+    for (const lemma of lemmas) {
+        lemmasMap.set(lemma.id, lemma);
+        const tokens = lemmaTokens(lemma);
+        const termFreq = new Map();
+        for (const tok of tokens) {
+            termFreq.set(tok, (termFreq.get(tok) ?? 0) + 1);
+        }
+        for (const term of termFreq.keys()) {
+            docFreq.set(term, (docFreq.get(term) ?? 0) + 1);
+        }
+        documents.push({ lemmaId: lemma.id, termFreq, length: tokens.length });
+    }
+    return { documents, docFreq, totalDocs: lemmas.length, lemmas: lemmasMap };
+}
+function idf(term, index) {
+    const df = index.docFreq.get(term) ?? 0;
+    if (df === 0)
+        return 0;
+    // suavizado clásico: log((N + 1) / (df + 1)) + 1
+    return Math.log((index.totalDocs + 1) / (df + 1)) + 1;
+}
+function vectorize(tokens, index) {
+    const tf = new Map();
+    for (const tok of tokens) {
+        tf.set(tok, (tf.get(tok) ?? 0) + 1);
+    }
+    const vec = new Map();
+    for (const [term, freq] of tf) {
+        vec.set(term, freq * idf(term, index));
+    }
+    return vec;
+}
+function docVector(doc, index) {
+    const vec = new Map();
+    for (const [term, freq] of doc.termFreq) {
+        vec.set(term, freq * idf(term, index));
+    }
+    return vec;
+}
+function cosine(a, b) {
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (const [, w] of a)
+        normA += w * w;
+    for (const [, w] of b)
+        normB += w * w;
+    if (normA === 0 || normB === 0)
+        return 0;
+    const [small, big] = a.size <= b.size ? [a, b] : [b, a];
+    for (const [term, w] of small) {
+        const other = big.get(term);
+        if (other !== undefined)
+            dot += w * other;
+    }
+    return dot / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+function semanticSearch(index, query, k = 5) {
+    const queryTokens = (0, tokenize_1.tokenize)(query);
+    if (queryTokens.length === 0)
+        return [];
+    const qVec = vectorize(queryTokens, index);
+    const hits = [];
+    for (const doc of index.documents) {
+        const lemma = index.lemmas.get(doc.lemmaId);
+        if (!lemma)
+            continue;
+        const dVec = docVector(doc, index);
+        const score = cosine(qVec, dVec);
+        if (score > 0)
+            hits.push({ lemma, score });
+    }
+    hits.sort((a, b) => b.score - a.score || a.lemma.id.localeCompare(b.lemma.id));
+    return hits.slice(0, k);
+}
+//# sourceMappingURL=tfidf.js.map

package/dist/tooling/lemma-library/tfidf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/tfidf.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mCAAmC;AACnC,EAAE;AACF,gEAAgE;AAChE,2DAA2D;AAC3D,yDAAyD;AACzD,+DAA+D;;AAc/D,gCAoBC;AA4CD,wCAcC;AAxFD,yCAAsC;AAEtC,SAAS,WAAW,CAAC,KAAmB;IACtC,OAAO;QACL,GAAG,IAAA,mBAAQ,EAAC,KAAK,CAAC,IAAI,CAAC;QACvB,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,mBAAQ,EAAC,CAAC,CAAC,CAAC;QACzC,GAAG,IAAA,mBAAQ,EAAC,KAAK,CAAC,SAAS,CAAC;KAC7B,CAAC;AACJ,CAAC;AAED,SAAgB,UAAU,CAAC,OAAqB;IAC9C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;IAClD,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE1C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AAC7E,CAAC;AAED,SAAS,GAAG,CAAC,IAAY,EAAE,KAAiB;IAC1C,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACvB,iDAAiD;IACjD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,SAAS,CAAC,MAAgB,EAAE,KAAiB;IACpD,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9B,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,GAAkB,EAAE,KAAiB;IACtD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACxC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,MAAM,CAAC,CAAsB,EAAE,CAAsB;IAC5D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,KAAK,KAAK,SAAS;YAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC;IAC5C,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AAED,SAAgB,cAAc,CAAC,KAAiB,EAAE,KAAa,EAAE,CAAC,GAAG,CAAC;IACpE,MAAM,WAAW,GAAG,IAAA,mBAAQ,EAAC,KAAK,CAAC,CAAC;IACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,MAAM,IAAI,GAAG,SAAS,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAwB,EAAE,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,IAAI,KAAK,GAAG,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1B,CAAC"}

package/dist/tooling/lemma-library/tokenize.d.ts

@@ -0,0 +1,2 @@
+export declare function tokenize(text: string): string[];
+//# sourceMappingURL=tokenize.d.ts.map

package/dist/tooling/lemma-library/tokenize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenize.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/tokenize.ts"],"names":[],"mappings":"AAgDA,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAsB/C"}

package/dist/tooling/lemma-library/tokenize.js

@@ -0,0 +1,74 @@
+"use strict";
+// ============================================================
+// Tokenización compartida — biblioteca de lemas
+//
+// Mezcla léxica (palabras) + estructural (símbolos lógicos),
+// con stopwords mínimos para que la búsqueda de operadores
+// (∧, ∨, →, ↔, ¬, □, ◇, ∀, ∃, =, ∈, ⊆, +, ·, …) sea efectiva.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.tokenize = tokenize;
+const LOGIC_SYMBOLS = new Set([
+    '∧',
+    '∨',
+    '¬',
+    '→',
+    '↔',
+    '⊥',
+    '⊤',
+    '∀',
+    '∃',
+    '□',
+    '◇',
+    '⊢',
+    '⇒',
+    '=',
+    '≠',
+    '≤',
+    '<',
+    '>',
+    '∈',
+    '∉',
+    '⊆',
+    '⊂',
+    '∪',
+    '∩',
+    '∅',
+    '·',
+    '+',
+    'ᶜ',
+]);
+// Stopwords con ≥3 letras: queremos preservar metavars de 1 letra
+// (P, Q, A, n, x, …) y separadores cortos (en/un/la) NO se filtran
+// para no colisionar con identificadores.
+const STOPWORDS = new Set(['the', 'and', 'with', 'for', 'los', 'las']);
+// Separadores adicionales que NO son símbolos lógicos pero rompen
+// tokens (paréntesis, espacios, comas, hyphens en kebab-case tags…).
+const SEPARATOR_RE = /[\s\-.,;:!?()[\]{}'"`]/;
+function tokenize(text) {
+    const out = [];
+    let current = '';
+    const flush = () => {
+        if (current.length > 0) {
+            const norm = current.toLowerCase();
+            if (!STOPWORDS.has(norm))
+                out.push(norm);
+        }
+        current = '';
+    };
+    for (const ch of text) {
+        if (LOGIC_SYMBOLS.has(ch)) {
+            flush();
+            out.push(ch);
+        }
+        else if (SEPARATOR_RE.test(ch)) {
+            flush();
+        }
+        else {
+            current += ch;
+        }
+    }
+    flush();
+    return out;
+}
+//# sourceMappingURL=tokenize.js.map

package/dist/tooling/lemma-library/tokenize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenize.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/tokenize.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,EAAE;AACF,6DAA6D;AAC7D,2DAA2D;AAC3D,8DAA8D;AAC9D,+DAA+D;;AA0C/D,4BAsBC;AA9DD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IAC5B,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;CACJ,CAAC,CAAC;AAEH,kEAAkE;AAClE,mEAAmE;AACnE,0CAA0C;AAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;AAEvE,kEAAkE;AAClE,qEAAqE;AACrE,MAAM,YAAY,GAAG,wBAAwB,CAAC;AAE9C,SAAgB,QAAQ,CAAC,IAAY;IACnC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,MAAM,KAAK,GAAG,GAAS,EAAE;QACvB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;YACnC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,GAAG,EAAE,CAAC;IACf,CAAC,CAAC;IACF,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,IAAI,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,KAAK,EAAE,CAAC;YACR,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;aAAM,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACjC,KAAK,EAAE,CAAC;QACV,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,EAAE,CAAC;QAChB,CAAC;IACH,CAAC;IACD,KAAK,EAAE,CAAC;IACR,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/tooling/lemma-library/types.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Dominio del lema. Las constantes documentadas son los cinco
+ * dominios curados de base, pero se permite cualquier string para
+ * extensiones de usuario.
+ */
+export type LemmaDomain = 'propositional' | 'firstorder' | 'modal' | 'arithmetic' | 'set' | string;
+export type LemmaDifficulty = 'trivial' | 'easy' | 'medium' | 'hard';
+/**
+ * Un lema curado: enunciado canónico + metadata para búsqueda y
+ * aplicación. El campo `statement` se asume en forma normalizada
+ * (ASCII + Unicode lógico estándar: ∧ ∨ ¬ → ↔ ∀ ∃ □ ◇).
+ */
+export interface CuratedLemma {
+    id: string;
+    name: string;
+    statement: string;
+    domain: LemmaDomain;
+    tags: string[];
+    difficulty: LemmaDifficulty;
+    provedBy?: {
+        profile: string;
+        proof?: unknown;
+    };
+    references?: string[];
+    isAxiom?: boolean;
+}
+/**
+ * Documento indexado por TF-IDF: bag-of-words tokenizado con su
+ * frecuencia local y un puntero al lema original.
+ */
+export interface TfIdfDocument {
+    lemmaId: string;
+    termFreq: Map<string, number>;
+    length: number;
+}
+/**
+ * Índice TF-IDF pre-calculado sobre la biblioteca completa.
+ */
+export interface TfIdfIndex {
+    documents: TfIdfDocument[];
+    docFreq: Map<string, number>;
+    totalDocs: number;
+    lemmas: Map<string, CuratedLemma>;
+}
+export interface SemanticSearchHit {
+    lemma: CuratedLemma;
+    score: number;
+}
+export interface LemmaApplicationResult {
+    applicable: CuratedLemma[];
+    substitutions?: Map<string, string>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/tooling/lemma-library/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/types.ts"],"names":[],"mappings":"AAQA;;;;GAIG;AAEH,MAAM,MAAM,WAAW,GAAG,eAAe,GAAG,YAAY,GAAG,OAAO,GAAG,YAAY,GAAG,KAAK,GAAG,MAAM,CAAC;AAEnG,MAAM,MAAM,eAAe,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,CAAC;AAErE;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,WAAW,CAAC;IACpB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,UAAU,EAAE,eAAe,CAAC;IAC5B,QAAQ,CAAC,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,CAAA;KAAE,CAAC;IAChD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,aAAa,EAAE,CAAC;IAC3B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;CACnC;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,YAAY,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,sBAAsB;IACrC,UAAU,EAAE,YAAY,EAAE,CAAC;IAC3B,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACrC"}

package/dist/tooling/lemma-library/types.js

@@ -0,0 +1,10 @@
+"use strict";
+// ============================================================
+// ST Lemma Library — Tipos base
+//
+// Biblioteca curada de lemas pre-probados organizados por dominio
+// (proposicional, primer orden, modal, aritmética, conjuntos, …)
+// con metadata para búsqueda, filtrado y aplicación automática.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/tooling/lemma-library/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,EAAE;AACF,kEAAkE;AAClE,iEAAiE;AACjE,gEAAgE;AAChE,+DAA+D"}

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

@@ -0,0 +1,3 @@
+export type { AuditReport, ProvenanceKind, ProvenanceMetadata, ProvenanceNode, TrustLevel, } from './types';
+export { ProvenanceLedger, auditTheorem, provenanceToCertificate } from './ledger';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/tooling/provenance/index.ts"],"names":[],"mappings":"AASA,YAAY,EACV,WAAW,EACX,cAAc,EACd,kBAAkB,EAClB,cAAc,EACd,UAAU,GACX,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,uBAAuB,EAAE,MAAM,UAAU,CAAC"}

package/dist/tooling/provenance/index.js

@@ -0,0 +1,16 @@
+"use strict";
+// ============================================================
+// ST Provenance — Public API
+//
+// DAG auditado de teoremas/lemas/axiomas: cada nodo declara sus
+// dependencias y metadata (autor, herramienta, timestamp, perfil).
+// El ledger ofrece queries del cierre transitivo, detección de
+// ciclos, estadísticas y serialización determinística.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.provenanceToCertificate = exports.auditTheorem = exports.ProvenanceLedger = void 0;
+var ledger_1 = require("./ledger");
+Object.defineProperty(exports, "ProvenanceLedger", { enumerable: true, get: function () { return ledger_1.ProvenanceLedger; } });
+Object.defineProperty(exports, "auditTheorem", { enumerable: true, get: function () { return ledger_1.auditTheorem; } });
+Object.defineProperty(exports, "provenanceToCertificate", { enumerable: true, get: function () { return ledger_1.provenanceToCertificate; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/tooling/provenance/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,EAAE;AACF,gEAAgE;AAChE,mEAAmE;AACnE,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;;;AAU/D,mCAAmF;AAA1E,0GAAA,gBAAgB,OAAA;AAAE,sGAAA,YAAY,OAAA;AAAE,iHAAA,uBAAuB,OAAA"}

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

@@ -0,0 +1,89 @@
+import type { AuditReport, ProvenanceMetadata, ProvenanceNode, TrustLevel } from './types';
+export declare class ProvenanceLedger {
+    private readonly nodes;
+    /**
+     * 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: Omit<ProvenanceNode, 'id'>): string;
+    get(id: string): ProvenanceNode | undefined;
+    /**
+     * 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: string): ProvenanceNode[];
+    /**
+     * Cuenta trust por categoría sobre el cierre transitivo (incluye al root).
+     */
+    trustChain(id: string): {
+        verified: number;
+        admitted: number;
+        external: number;
+    };
+    /**
+     * Conjunto de IDs de axiomas alcanzables desde `id` (cierre).
+     * Útil para "¿qué postulados base sostienen este teorema?".
+     */
+    axiomsUsed(id: string): Set<string>;
+    /**
+     * 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: string): boolean;
+    /** Cierre transitivo de ancestros (deps directas + indirectas), sin el propio nodo. */
+    ancestors(id: string): Set<string>;
+    /** Cierre transitivo de descendientes (quien depende de este nodo), sin el propio nodo. */
+    descendants(id: string): Set<string>;
+    /**
+     * 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(): string[][];
+    totalNodes(): number;
+    axiomCount(): number;
+    /** Longitud (en nodos) de la cadena más larga de dependencias. */
+    longestChain(): number;
+    /**
+     * Exporta el ledger a JSON determinístico (claves ordenadas, nodos
+     * ordenados por id). Apto para hashing y para diff.
+     */
+    exportLedger(): string;
+    /**
+     * 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: string): void;
+    /**
+     * 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(): Promise<string>;
+}
+/**
+ * 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.
+ */
+export declare function auditTheorem(theoremId: string, ledger: ProvenanceLedger): AuditReport;
+/**
+ * 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.
+ */
+export declare function provenanceToCertificate(node: ProvenanceNode, ledger: ProvenanceLedger): unknown;
+export type { ProvenanceMetadata, TrustLevel };
+//# sourceMappingURL=ledger.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ledger.d.ts","sourceRoot":"","sources":["../../../src/tooling/provenance/ledger.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EACV,WAAW,EAEX,kBAAkB,EAClB,cAAc,EACd,UAAU,EACX,MAAM,SAAS,CAAC;AA6BjB,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAqC;IAE3D;;;;;OAKG;IACH,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,GAAG,MAAM;IAyB7C,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAa3C;;;;OAIG;IACH,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,EAAE;IAiB7C;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;IAShF;;;OAGG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IASnC;;;OAGG;IACH,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQpC,uFAAuF;IACvF,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAkBlC,2FAA2F;IAC3F,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAoBpC;;;;;;OAMG;IACH,YAAY,IAAI,MAAM,EAAE,EAAE;IAmC1B,UAAU,IAAI,MAAM;IAIpB,UAAU,IAAI,MAAM;IAMpB,kEAAkE;IAClE,YAAY,IAAI,MAAM;IA6BtB;;;OAGG;IACH,YAAY,IAAI,MAAM;IAetB;;;;;OAKG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAqChC;;;;;OAKG;IACH,UAAU,IAAI,OAAO,CAAC,MAAM,CAAC;CAI9B;AAoCD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,GAAG,WAAW,CAsCrF;AAID;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,gBAAgB,GAAG,OAAO,CAsB/F;AAGD,YAAY,EAAE,kBAAkB,EAAE,UAAU,EAAE,CAAC"}