@stevenvo780/st-lang 4.8.0 → 4.9.0

package/dist/tests/reasoning/differential-privacy/differential-privacy.test.js

@@ -0,0 +1,388 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const differential_privacy_1 = require("../../../reasoning/differential-privacy");
+// ------------------------------------------------------------
+// Fixtures
+// ------------------------------------------------------------
+const SEED = 42;
+function rng() {
+    return (0, differential_privacy_1.makeDPRng)(SEED);
+}
+// Muestrear N veces y devolver la media empírica.
+function empiricalMean(samples) {
+    let s = 0;
+    for (const x of samples)
+        s += x;
+    return s / samples.length;
+}
+function empiricalVar(samples) {
+    const mu = empiricalMean(samples);
+    let s = 0;
+    for (const x of samples)
+        s += (x - mu) ** 2;
+    return s / samples.length;
+}
+// ------------------------------------------------------------
+// 1. Mecanismos de ruido
+// ------------------------------------------------------------
+(0, vitest_1.describe)('differential-privacy / Laplace', () => {
+    (0, vitest_1.it)('mean empírica converge al valor original con N grande', () => {
+        const r = rng();
+        const N = 20000;
+        const samples = [];
+        for (let i = 0; i < N; i++) {
+            samples.push((0, differential_privacy_1.laplaceNoise)(10, 1, 0.5, r));
+        }
+        const mean = empiricalMean(samples);
+        // Laplace tiene mean = original; tolerancia generosa por finite N.
+        (0, vitest_1.expect)(Math.abs(mean - 10)).toBeLessThan(0.2);
+    });
+    (0, vitest_1.it)('varianza empírica ≈ 2b² donde b = Δ/ε', () => {
+        const r = rng();
+        const N = 20000;
+        const sensitivity = 2;
+        const epsilon = 1;
+        const b = sensitivity / epsilon;
+        const samples = [];
+        for (let i = 0; i < N; i++) {
+            samples.push((0, differential_privacy_1.laplaceNoise)(0, sensitivity, epsilon, r));
+        }
+        const variance = empiricalVar(samples);
+        const expected = 2 * b * b;
+        (0, vitest_1.expect)(Math.abs(variance - expected) / expected).toBeLessThan(0.1);
+    });
+    (0, vitest_1.it)('sensibilidad 0 ⇒ no agrega ruido', () => {
+        const r = rng();
+        (0, vitest_1.expect)((0, differential_privacy_1.laplaceNoise)(42, 0, 1, r)).toBe(42);
+    });
+    (0, vitest_1.it)('rechaza epsilon ≤ 0', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.laplaceNoise)(0, 1, 0)).toThrow();
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.laplaceNoise)(0, 1, -0.1)).toThrow();
+    });
+});
+(0, vitest_1.describe)('differential-privacy / Gaussian', () => {
+    (0, vitest_1.it)('mean empírica ≈ valor original', () => {
+        const r = rng();
+        const N = 20000;
+        const samples = [];
+        for (let i = 0; i < N; i++) {
+            samples.push((0, differential_privacy_1.gaussianNoise)(5, 1, 1, 1e-5, r));
+        }
+        (0, vitest_1.expect)(Math.abs(empiricalMean(samples) - 5)).toBeLessThan(0.3);
+    });
+    (0, vitest_1.it)('varianza empírica ≈ σ² con σ = Δ·√(2 ln(1.25/δ))/ε', () => {
+        const r = rng();
+        const N = 20000;
+        const sensitivity = 1;
+        const epsilon = 0.5;
+        const delta = 1e-5;
+        const sigma = (sensitivity * Math.sqrt(2 * Math.log(1.25 / delta))) / epsilon;
+        const samples = [];
+        for (let i = 0; i < N; i++) {
+            samples.push((0, differential_privacy_1.gaussianNoise)(0, sensitivity, epsilon, delta, r));
+        }
+        const variance = empiricalVar(samples);
+        const expected = sigma * sigma;
+        (0, vitest_1.expect)(Math.abs(variance - expected) / expected).toBeLessThan(0.1);
+    });
+    (0, vitest_1.it)('exige delta > 0', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.gaussianNoise)(0, 1, 1, 0)).toThrow();
+    });
+});
+// ------------------------------------------------------------
+// 2. Mecanismo exponencial
+// ------------------------------------------------------------
+(0, vitest_1.describe)('differential-privacy / exponentialMechanism', () => {
+    (0, vitest_1.it)('items con score mayor aparecen más', () => {
+        const r = rng();
+        const items = ['low', 'mid', 'high'];
+        const scoreMap = new Map([
+            ['low', 0],
+            ['mid', 1],
+            ['high', 5],
+        ]);
+        const score = (it) => scoreMap.get(it) ?? 0;
+        const counts = new Map();
+        for (const it of items)
+            counts.set(it, 0);
+        const N = 5000;
+        for (let i = 0; i < N; i++) {
+            const pick = (0, differential_privacy_1.exponentialMechanism)(items, score, 1, 2, r);
+            counts.set(pick, (counts.get(pick) ?? 0) + 1);
+        }
+        // 'high' debe dominar.
+        (0, vitest_1.expect)(counts.get('high')).toBeGreaterThan(counts.get('mid'));
+        (0, vitest_1.expect)(counts.get('mid')).toBeGreaterThan(counts.get('low'));
+    });
+    (0, vitest_1.it)('sensibilidad 0 ⇒ argmax determinista', () => {
+        const items = [
+            { id: 'a', s: 1 },
+            { id: 'b', s: 10 },
+            { id: 'c', s: 5 },
+        ];
+        const pick = (0, differential_privacy_1.exponentialMechanism)(items, (x) => x.s, 0, 1);
+        (0, vitest_1.expect)(pick.id).toBe('b');
+    });
+    (0, vitest_1.it)('rechaza items vacío', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.exponentialMechanism)([], () => 0, 1, 1)).toThrow();
+    });
+});
+// ------------------------------------------------------------
+// 3. Randomized response
+// ------------------------------------------------------------
+(0, vitest_1.describe)('differential-privacy / randomizedResponse', () => {
+    (0, vitest_1.it)('p = 3/4 da ε = ln(3)', () => {
+        const eps = (0, differential_privacy_1.randomizedResponseEpsilon)(0.75);
+        (0, vitest_1.expect)(Math.abs(eps - Math.log(3))).toBeLessThan(1e-9);
+    });
+    (0, vitest_1.it)('p = 2/3 da ε = ln(2)', () => {
+        const eps = (0, differential_privacy_1.randomizedResponseEpsilon)(2 / 3);
+        (0, vitest_1.expect)(Math.abs(eps - Math.log(2))).toBeLessThan(1e-9);
+    });
+    (0, vitest_1.it)('p alto preserva el bit con alta probabilidad', () => {
+        const r = rng();
+        const N = 5000;
+        let truths = 0;
+        for (let i = 0; i < N; i++) {
+            if ((0, differential_privacy_1.randomizedResponse)(true, 0.9, r) === true)
+                truths++;
+        }
+        // ≈ 0.9 ± 0.02
+        (0, vitest_1.expect)(truths / N).toBeGreaterThan(0.87);
+        (0, vitest_1.expect)(truths / N).toBeLessThan(0.93);
+    });
+    (0, vitest_1.it)('p en (0,1) requerido', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.randomizedResponse)(true, 0)).toThrow();
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.randomizedResponse)(true, 1)).toThrow();
+    });
+});
+// ------------------------------------------------------------
+// 4. Queries derivadas
+// ------------------------------------------------------------
+(0, vitest_1.describe)('differential-privacy / dpCount', () => {
+    (0, vitest_1.it)('|dp − true| acotado loose por ε⁻¹·log(1/β)', () => {
+        const r = rng();
+        const values = Array.from({ length: 1000 }, (_, i) => i);
+        const trueCount = values.filter((v) => v % 2 === 0).length;
+        const epsilon = 0.5;
+        const N = 200;
+        let maxDiff = 0;
+        for (let i = 0; i < N; i++) {
+            const got = (0, differential_privacy_1.dpCount)(values, (v) => v % 2 === 0, epsilon, r);
+            const diff = Math.abs(got - trueCount);
+            if (diff > maxDiff)
+                maxDiff = diff;
+        }
+        // Cota loose: con prob ≥ 1 − β, |Lap(1/ε)| ≤ (1/ε) ln(1/β).
+        // Para β = 1/200, ln(200)/0.5 ≈ 10.6; permitimos margen 4x por finitud.
+        (0, vitest_1.expect)(maxDiff).toBeLessThan(50);
+    });
+    (0, vitest_1.it)('siempre devuelve un entero no negativo', () => {
+        const r = rng();
+        const values = [1, 2, 3];
+        for (let i = 0; i < 50; i++) {
+            const got = (0, differential_privacy_1.dpCount)(values, () => false, 0.1, r);
+            (0, vitest_1.expect)(Number.isInteger(got)).toBe(true);
+            (0, vitest_1.expect)(got).toBeGreaterThanOrEqual(0);
+        }
+    });
+});
+(0, vitest_1.describe)('differential-privacy / dpMean', () => {
+    (0, vitest_1.it)('dpMean ≈ true mean para datasets grandes', () => {
+        const r = rng();
+        const n = 1000;
+        const values = Array.from({ length: n }, (_, i) => (i % 100) / 100);
+        const trueMean = empiricalMean(values);
+        const N = 200;
+        const dpMeans = [];
+        for (let i = 0; i < N; i++) {
+            dpMeans.push((0, differential_privacy_1.dpMean)(values, [0, 1], 1, r));
+        }
+        const empirical = empiricalMean(dpMeans);
+        // sensibilidad = 1/n ⇒ ruido pequeño; promedio de N corridas debería ser muy cercano.
+        (0, vitest_1.expect)(Math.abs(empirical - trueMean)).toBeLessThan(0.01);
+    });
+    (0, vitest_1.it)('clipea valores fuera de rango', () => {
+        const r = rng();
+        // Todos valores muy fuera de rango altos ⇒ media DP cerca de 1.
+        const values = [100, 100, 100, 100, 100];
+        const got = (0, differential_privacy_1.dpMean)(values, [0, 1], 100, r);
+        (0, vitest_1.expect)(Math.abs(got - 1)).toBeLessThan(0.5);
+    });
+    (0, vitest_1.it)('rechaza rango inválido', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.dpMean)([1], [1, 0], 1)).toThrow();
+    });
+    (0, vitest_1.it)('rechaza values vacío', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.dpMean)([], [0, 1], 1)).toThrow();
+    });
+});
+(0, vitest_1.describe)('differential-privacy / dpHistogram', () => {
+    (0, vitest_1.it)('preserva categorías y bins suman ≈ N (loose)', () => {
+        const r = rng();
+        const categories = ['a', 'b', 'c'];
+        const values = ['a', 'a', 'b', 'b', 'b', 'c', 'a', 'b', 'c', 'a'];
+        const hist = (0, differential_privacy_1.dpHistogram)(values, categories, 1, r);
+        (0, vitest_1.expect)(hist.size).toBe(3);
+        let sum = 0;
+        for (const v of hist.values())
+            sum += v;
+        // Ruido Laplace mediano puede mover ±5 por bin; sum ∈ [N − 15, N + 15].
+        (0, vitest_1.expect)(Math.abs(sum - values.length)).toBeLessThan(15);
+    });
+});
+// ------------------------------------------------------------
+// 5. Composición
+// ------------------------------------------------------------
+(0, vitest_1.describe)('differential-privacy / basicComposition', () => {
+    (0, vitest_1.it)('ε_total = Σ ε_i, δ_total = Σ δ_i', () => {
+        const ms = [
+            { epsilon: 0.5, delta: 1e-6 },
+            { epsilon: 0.3, delta: 1e-6 },
+            { epsilon: 0.2, delta: 0 },
+        ];
+        const r = (0, differential_privacy_1.basicComposition)(ms);
+        (0, vitest_1.expect)(Math.abs(r.epsilon - 1.0)).toBeLessThan(1e-12);
+        (0, vitest_1.expect)(Math.abs(r.delta - 2e-6)).toBeLessThan(1e-15);
+    });
+    (0, vitest_1.it)('vacío ⇒ (0, 0)', () => {
+        const r = (0, differential_privacy_1.basicComposition)([]);
+        (0, vitest_1.expect)(r.epsilon).toBe(0);
+        (0, vitest_1.expect)(r.delta).toBe(0);
+    });
+});
+(0, vitest_1.describe)('differential-privacy / advancedComposition', () => {
+    (0, vitest_1.it)('para k grande mejora sobre suma cuando ε pequeño', () => {
+        // k = 100 mecanismos cada uno ε = 0.05, δ = 0.
+        const k = 100;
+        const eps = 0.05;
+        const ms = Array.from({ length: k }, () => ({ epsilon: eps, delta: 0 }));
+        const deltaTotal = 1e-5;
+        const advanced = (0, differential_privacy_1.advancedComposition)(ms, deltaTotal);
+        const basic = (0, differential_privacy_1.basicComposition)(ms);
+        // Para k grande y ε pequeño, advanced << basic.
+        (0, vitest_1.expect)(advanced.epsilon).toBeLessThan(basic.epsilon);
+        // El delta total incluye el slack.
+        (0, vitest_1.expect)(advanced.delta).toBeCloseTo(deltaTotal, 10);
+    });
+    (0, vitest_1.it)('coincide con la fórmula Dwork-Rothblum-Vadhan', () => {
+        const k = 50;
+        const eps = 0.1;
+        const ms = Array.from({ length: k }, () => ({ epsilon: eps, delta: 0 }));
+        const deltaTotal = 1e-4;
+        const r = (0, differential_privacy_1.advancedComposition)(ms, deltaTotal);
+        const expected = Math.sqrt(2 * k * Math.log(1 / deltaTotal)) * eps + k * eps * (Math.exp(eps) - 1);
+        (0, vitest_1.expect)(Math.abs(r.epsilon - expected)).toBeLessThan(1e-9);
+    });
+    (0, vitest_1.it)('vacío ⇒ (0, deltaTotal)', () => {
+        const r = (0, differential_privacy_1.advancedComposition)([], 1e-5);
+        (0, vitest_1.expect)(r.epsilon).toBe(0);
+        (0, vitest_1.expect)(r.delta).toBe(1e-5);
+    });
+    (0, vitest_1.it)('rechaza deltaTotal = 0', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.advancedComposition)([{ epsilon: 1, delta: 0 }], 0)).toThrow();
+    });
+});
+(0, vitest_1.describe)('differential-privacy / parallelComposition', () => {
+    (0, vitest_1.it)('ε y δ son el máximo (no la suma)', () => {
+        const ms = [
+            { epsilon: 0.5, delta: 1e-6 },
+            { epsilon: 1.2, delta: 0 },
+            { epsilon: 0.7, delta: 2e-7 },
+        ];
+        const r = (0, differential_privacy_1.parallelComposition)(ms);
+        (0, vitest_1.expect)(r.epsilon).toBe(1.2);
+        (0, vitest_1.expect)(r.delta).toBe(1e-6);
+    });
+});
+// ------------------------------------------------------------
+// 6. Sensitivity calculators
+// ------------------------------------------------------------
+(0, vitest_1.describe)('differential-privacy / globalSensitivityL1', () => {
+    (0, vitest_1.it)('para count, sensibilidad = 1', () => {
+        const fn = (d) => d.length;
+        const s = (0, differential_privacy_1.globalSensitivityL1)(fn, [
+            [
+                [1, 2, 3],
+                [1, 2],
+            ],
+            [
+                [1, 2, 3],
+                [1, 2, 3, 4],
+            ],
+        ]);
+        (0, vitest_1.expect)(s).toBe(1);
+    });
+    (0, vitest_1.it)('para suma con rango fijo, sensibilidad = rango', () => {
+        const fn = (d) => d.reduce((s, x) => s + x, 0);
+        const s = (0, differential_privacy_1.globalSensitivityL1)(fn, [
+            [
+                [1, 2, 3],
+                [1, 2, 3, 10],
+            ],
+            [
+                [5, 5],
+                [5, 5, 7],
+            ],
+        ]);
+        (0, vitest_1.expect)(s).toBe(10);
+    });
+    (0, vitest_1.it)('sin vecinos ⇒ 0', () => {
+        (0, vitest_1.expect)((0, differential_privacy_1.globalSensitivityL1)((d) => d.length, [])).toBe(0);
+    });
+});
+(0, vitest_1.describe)('differential-privacy / smoothSensitivity', () => {
+    (0, vitest_1.it)('decae exponencialmente con k', () => {
+        const data = [1, 2, 3, 4, 5];
+        const fn = (d) => d.reduce((s, x) => s + x, 0) / d.length;
+        const sLow = (0, differential_privacy_1.smoothSensitivity)(fn, data, 0.1);
+        const sHigh = (0, differential_privacy_1.smoothSensitivity)(fn, data, 2.0);
+        // β alto castiga más rápido la distancia ⇒ menor (o igual) sensibilidad suave.
+        (0, vitest_1.expect)(sHigh).toBeLessThanOrEqual(sLow);
+    });
+    (0, vitest_1.it)('data vacío ⇒ 0', () => {
+        (0, vitest_1.expect)((0, differential_privacy_1.smoothSensitivity)(() => 0, [], 0.1)).toBe(0);
+    });
+    (0, vitest_1.it)('rechaza beta ≤ 0', () => {
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.smoothSensitivity)(() => 0, [1, 2], 0)).toThrow();
+        (0, vitest_1.expect)(() => (0, differential_privacy_1.smoothSensitivity)(() => 0, [1, 2], -1)).toThrow();
+    });
+});
+// ------------------------------------------------------------
+// 7. Determinismo del PRNG
+// ------------------------------------------------------------
+(0, vitest_1.describe)('differential-privacy / determinismo con seed', () => {
+    (0, vitest_1.it)('mismo seed ⇒ misma secuencia Laplace', () => {
+        const r1 = (0, differential_privacy_1.makeDPRng)(123);
+        const r2 = (0, differential_privacy_1.makeDPRng)(123);
+        for (let i = 0; i < 10; i++) {
+            (0, vitest_1.expect)(r1.laplace(1)).toBe(r2.laplace(1));
+        }
+    });
+    (0, vitest_1.it)('mismo seed ⇒ misma secuencia Gaussian', () => {
+        const r1 = (0, differential_privacy_1.makeDPRng)(7);
+        const r2 = (0, differential_privacy_1.makeDPRng)(7);
+        for (let i = 0; i < 10; i++) {
+            (0, vitest_1.expect)(r1.gaussian(0, 1)).toBe(r2.gaussian(0, 1));
+        }
+    });
+    (0, vitest_1.it)('seeds distintos ⇒ secuencias distintas', () => {
+        const r1 = (0, differential_privacy_1.makeDPRng)(1);
+        const r2 = (0, differential_privacy_1.makeDPRng)(2);
+        (0, vitest_1.expect)(r1.uniform()).not.toBe(r2.uniform());
+    });
+    (0, vitest_1.it)('exponentialMechanism es determinista con seed fijo', () => {
+        const items = ['a', 'b', 'c'];
+        const score = (x) => ({ a: 0, b: 1, c: 2 })[x] ?? 0;
+        const r1 = (0, differential_privacy_1.makeDPRng)(99);
+        const r2 = (0, differential_privacy_1.makeDPRng)(99);
+        const a = [];
+        const b = [];
+        for (let i = 0; i < 20; i++) {
+            a.push((0, differential_privacy_1.exponentialMechanism)(items, score, 1, 1, r1));
+            b.push((0, differential_privacy_1.exponentialMechanism)(items, score, 1, 1, r2));
+        }
+        (0, vitest_1.expect)(a).toEqual(b);
+    });
+});
+//# sourceMappingURL=differential-privacy.test.js.map

package/dist/tests/reasoning/differential-privacy/differential-privacy.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"differential-privacy.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/differential-privacy/differential-privacy.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,kFAiBiD;AAEjD,+DAA+D;AAC/D,WAAW;AACX,+DAA+D;AAE/D,MAAM,IAAI,GAAG,EAAE,CAAC;AAEhB,SAAS,GAAG;IACV,OAAO,IAAA,gCAAS,EAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AAED,kDAAkD;AAClD,SAAS,aAAa,CAAC,OAAiB;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,CAAC,IAAI,CAAC,CAAC;IAChC,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AAC5B,CAAC;AAED,SAAS,YAAY,CAAC,OAAiB;IACrC,MAAM,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IAC5C,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AAC5B,CAAC;AAED,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,KAAK,CAAC;QAChB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,IAAA,mCAAY,EAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QACpC,mEAAmE;QACnE,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,KAAK,CAAC;QAChB,MAAM,WAAW,GAAG,CAAC,CAAC;QACtB,MAAM,OAAO,GAAG,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,WAAW,GAAG,OAAO,CAAC;QAChC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,IAAA,mCAAY,EAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,IAAA,eAAM,EAAC,IAAA,mCAAY,EAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,mCAAY,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,mCAAY,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,KAAK,CAAC;QAChB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,IAAA,oCAAa,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,KAAK,CAAC;QAChB,MAAM,WAAW,GAAG,CAAC,CAAC;QACtB,MAAM,OAAO,GAAG,GAAG,CAAC;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC;QACnB,MAAM,KAAK,GAAG,CAAC,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAC9E,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,IAAA,oCAAa,EAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,KAAK,GAAG,KAAK,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,oCAAa,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,2BAA2B;AAC3B,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC;YACvB,CAAC,KAAK,EAAE,CAAC,CAAC;YACV,CAAC,KAAK,EAAE,CAAC,CAAC;YACV,CAAC,MAAM,EAAE,CAAC,CAAC;SACZ,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAA,2CAAoB,EAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,uBAAuB;QACvB,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG;YACZ,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE;YACjB,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE;YAClB,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE;SAClB,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,2CAAoB,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,2CAAoB,EAAS,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,IAAA,gDAAyB,EAAC,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,IAAA,gDAAyB,EAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAA,yCAAkB,EAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,IAAI;gBAAE,MAAM,EAAE,CAAC;QAC1D,CAAC;QACD,eAAe;QACf,IAAA,eAAM,EAAC,MAAM,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,yCAAkB,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACpD,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,yCAAkB,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QAC3D,MAAM,OAAO,GAAG,GAAG,CAAC;QACpB,MAAM,CAAC,GAAG,GAAG,CAAC;QACd,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAA,8BAAO,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC;YACvC,IAAI,IAAI,GAAG,OAAO;gBAAE,OAAO,GAAG,IAAI,CAAC;QACrC,CAAC;QACD,4DAA4D;QAC5D,wEAAwE;QACxE,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAA,8BAAO,EAAC,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QACpE,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,GAAG,CAAC;QACd,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,IAAA,6BAAM,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QACzC,sFAAsF;QACtF,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,gEAAgE;QAChE,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,IAAA,6BAAM,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,6BAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,6BAAM,EAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,IAAA,kCAAW,EAAC,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC;QACxC,wEAAwE;QACxE,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,iBAAiB;AACjB,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,EAAE,GAAoB;YAC1B,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE;YAC7B,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE;YAC7B,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE;SAC3B,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,uCAAgB,EAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gBAAgB,EAAE,GAAG,EAAE;QACxB,MAAM,CAAC,GAAG,IAAA,uCAAgB,EAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,+CAA+C;QAC/C,MAAM,CAAC,GAAG,GAAG,CAAC;QACd,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,EAAE,GAAoB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,IAAI,CAAC;QACxB,MAAM,QAAQ,GAAG,IAAA,0CAAmB,EAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAA,uCAAgB,EAAC,EAAE,CAAC,CAAC;QACnC,gDAAgD;QAChD,IAAA,eAAM,EAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACrD,mCAAmC;QACnC,IAAA,eAAM,EAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,GAAG,CAAC;QAChB,MAAM,EAAE,GAAoB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,0CAAmB,EAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC9C,MAAM,QAAQ,GACZ,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACpF,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,CAAC,GAAG,IAAA,0CAAmB,EAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,0CAAmB,EAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,EAAE,GAAoB;YAC1B,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE;YAC7B,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE;YAC1B,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE;SAC9B,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0CAAmB,EAAC,EAAE,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,EAAE,GAAG,CAAC,CAAW,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,0CAAmB,EAAC,EAAE,EAAE;YAChC;gBACE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,CAAC;aACP;YACD;gBACE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACb;SACF,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,EAAE,GAAG,CAAC,CAAW,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,IAAA,0CAAmB,EAAC,EAAE,EAAE;YAChC;gBACE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;aACd;YACD;gBACE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACN,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACV;SACF,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,IAAA,eAAM,EAAC,IAAA,0CAAmB,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAW,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QACpE,MAAM,IAAI,GAAG,IAAA,wCAAiB,EAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,IAAA,wCAAiB,EAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC/C,+EAA+E;QAC/E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gBAAgB,EAAE,GAAG,EAAE;QACxB,IAAA,eAAM,EAAC,IAAA,wCAAiB,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,wCAAiB,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9D,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,wCAAiB,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,2BAA2B;AAC3B,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,GAAG,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAA,eAAM,EAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,CAAC,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAA,eAAM,EAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5D,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,EAAE,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,IAAA,gCAAS,EAAC,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,GAAa,EAAE,CAAC;QACvB,MAAM,CAAC,GAAa,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,CAAC,CAAC,IAAI,CAAC,IAAA,2CAAoB,EAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACrD,CAAC,CAAC,IAAI,CAAC,IAAA,2CAAoB,EAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/tooling/mathlib/mathlib.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=mathlib.test.d.ts.map

package/dist/tests/tooling/mathlib/mathlib.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mathlib.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/tooling/mathlib/mathlib.test.ts"],"names":[],"mappings":""}

package/dist/tests/tooling/mathlib/mathlib.test.js

@@ -0,0 +1,214 @@
+"use strict";
+// ============================================================
+// Tests: ST Mathlib — order theory, group theory, ring theory,
+// instancias estándar y lemas.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const mathlib_1 = require("../../../tooling/mathlib");
+// ============================================================
+// Order theory
+// ============================================================
+(0, vitest_1.describe)('order theory — divisibility poset on {1,2,3,6}', () => {
+    const divides = { leq: (a, b) => b % a === 0 };
+    const elements = [1, 2, 3, 6];
+    (0, vitest_1.it)('isReflexive: todo n divide a n', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isReflexive)(divides, elements)).toBe(true);
+    });
+    (0, vitest_1.it)('isAntisymmetric: a|b ∧ b|a ⇒ a=b sobre naturales positivos', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isAntisymmetric)(divides, elements)).toBe(true);
+    });
+    (0, vitest_1.it)('isTransitive: a|b ∧ b|c ⇒ a|c', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isTransitive)(divides, elements)).toBe(true);
+    });
+    (0, vitest_1.it)('verifyPartialOrder: divisibilidad es poset válido', () => {
+        const result = (0, mathlib_1.verifyPartialOrder)(divides, elements);
+        (0, vitest_1.expect)(result.valid).toBe(true);
+        (0, vitest_1.expect)(result.failures).toEqual([]);
+    });
+    (0, vitest_1.it)('isLattice: {1,2,3,6} con divisibilidad es lattice (mcm=6, mcd=1)', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isLattice)(divides, elements)).toBe(true);
+    });
+    (0, vitest_1.it)('isLattice: {2,3} sin 1 ni 6 NO es lattice (no hay join ni meet)', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isLattice)(divides, [2, 3])).toBe(false);
+    });
+    (0, vitest_1.it)('detecta no-transitividad en relación cooked-up', () => {
+        // a R b si |a-b| ≤ 1 — no transitiva: 1 R 2, 2 R 3, pero 1 ¬R 3.
+        const closeRel = { leq: (a, b) => Math.abs(a - b) <= 1 };
+        (0, vitest_1.expect)((0, mathlib_1.isTransitive)(closeRel, [1, 2, 3])).toBe(false);
+    });
+});
+// ============================================================
+// Group theory
+// ============================================================
+(0, vitest_1.describe)('group theory — Z aditivo', () => {
+    const sample = [-2n, -1n, 0n, 1n, 2n];
+    (0, vitest_1.it)('intAdditiveGroup: asociatividad', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isAssociative)(mathlib_1.intAdditiveGroup, sample)).toBe(true);
+    });
+    (0, vitest_1.it)('intAdditiveGroup: conmutatividad', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isCommutative)(mathlib_1.intAdditiveGroup, sample)).toBe(true);
+    });
+    (0, vitest_1.it)('intAdditiveGroup: 0 es identidad aditiva', () => {
+        (0, vitest_1.expect)((0, mathlib_1.hasIdentity)(mathlib_1.intAdditiveGroup, sample, mathlib_1.intAdditiveGroup.identity)).toBe(true);
+    });
+    (0, vitest_1.it)('intAdditiveGroup: cada n tiene inverso -n', () => {
+        (0, vitest_1.expect)((0, mathlib_1.hasInverses)(mathlib_1.intAdditiveGroup, sample)).toBe(true);
+    });
+    (0, vitest_1.it)('verifyGroup(Z, +) pasa todos los axiomas', () => {
+        const result = (0, mathlib_1.verifyGroup)(mathlib_1.intAdditiveGroup, sample);
+        (0, vitest_1.expect)(result.valid).toBe(true);
+        (0, vitest_1.expect)(result.failures).toEqual([]);
+    });
+    (0, vitest_1.it)('verifyAbelianGroup(Z, +) incluye conmutatividad y pasa', () => {
+        const result = (0, mathlib_1.verifyAbelianGroup)(mathlib_1.intAdditiveGroup, sample);
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+});
+(0, vitest_1.describe)('group theory — S_3 simétrico', () => {
+    (0, vitest_1.it)('sym3: es grupo (asociativo + identidad + inversos)', () => {
+        const result = (0, mathlib_1.verifyGroup)(mathlib_1.sym3, mathlib_1.sym3Elements, mathlib_1.perm3Eq);
+        (0, vitest_1.expect)(result.valid).toBe(true);
+        (0, vitest_1.expect)(result.failures).toEqual([]);
+    });
+    (0, vitest_1.it)('sym3: NO es abeliano — (0 1) ∘ (0 2) ≠ (0 2) ∘ (0 1)', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isCommutative)(mathlib_1.sym3, mathlib_1.sym3Elements, mathlib_1.perm3Eq)).toBe(false);
+    });
+    (0, vitest_1.it)('sym3: verifyAbelianGroup falla en conmutatividad', () => {
+        const result = (0, mathlib_1.verifyAbelianGroup)(mathlib_1.sym3, mathlib_1.sym3Elements, mathlib_1.perm3Eq);
+        (0, vitest_1.expect)(result.valid).toBe(false);
+        (0, vitest_1.expect)(result.failures).toContain('conmutatividad');
+    });
+    (0, vitest_1.it)('sym3: el inverso de un elemento aplicado dos veces es el original', () => {
+        for (const p of mathlib_1.sym3Elements) {
+            const inv = mathlib_1.sym3.inverse(p);
+            const reconstructed = mathlib_1.sym3.inverse(inv);
+            (0, vitest_1.expect)((0, mathlib_1.perm3Eq)(reconstructed, p)).toBe(true);
+        }
+    });
+});
+// ============================================================
+// Ring theory
+// ============================================================
+(0, vitest_1.describe)('ring theory — Z anillo', () => {
+    const sample = [-2n, -1n, 0n, 1n, 2n];
+    (0, vitest_1.it)('verifyRing(Z): pasa todos los axiomas', () => {
+        const result = (0, mathlib_1.verifyRing)(mathlib_1.intRing, sample);
+        (0, vitest_1.expect)(result.valid).toBe(true);
+        (0, vitest_1.expect)(result.failures).toEqual([]);
+    });
+    (0, vitest_1.it)('intRing: zero=0, one=1', () => {
+        (0, vitest_1.expect)(mathlib_1.intRing.zero).toBe(0n);
+        (0, vitest_1.expect)(mathlib_1.intRing.one).toBe(1n);
+    });
+    (0, vitest_1.it)('intRing: distributividad explícita 2*(3+4)=2*3+2*4', () => {
+        const left = mathlib_1.intRing.mul(2n, mathlib_1.intRing.add(3n, 4n));
+        const right = mathlib_1.intRing.add(mathlib_1.intRing.mul(2n, 3n), mathlib_1.intRing.mul(2n, 4n));
+        (0, vitest_1.expect)(left).toBe(right);
+    });
+    (0, vitest_1.it)('intRing NO es campo (2 no tiene inverso multiplicativo en Z)', () => {
+        // div definida solo cuando divide exacta — usamos undefined si no divisible.
+        const intDiv = (a, b) => b !== 0n && a % b === 0n ? a / b : undefined;
+        (0, vitest_1.expect)((0, mathlib_1.isField)(mathlib_1.intRing, sample, intDiv)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('ring theory — Z/nZ', () => {
+    (0, vitest_1.it)('zModN(5): es anillo válido', () => {
+        const r = (0, mathlib_1.zModN)(5n);
+        const result = (0, mathlib_1.verifyRing)(r, (0, mathlib_1.zModNElements)(5n));
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('zModN(5): es campo (5 es primo)', () => {
+        const r = (0, mathlib_1.zModN)(5n);
+        (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(5n), (0, mathlib_1.zModNDiv)(5n))).toBe(true);
+    });
+    (0, vitest_1.it)('zModN(7): es campo (7 es primo)', () => {
+        const r = (0, mathlib_1.zModN)(7n);
+        (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(7n), (0, mathlib_1.zModNDiv)(7n))).toBe(true);
+    });
+    (0, vitest_1.it)('zModN(4): NO es campo (4 no es primo, 2 no tiene inverso)', () => {
+        const r = (0, mathlib_1.zModN)(4n);
+        (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(4n), (0, mathlib_1.zModNDiv)(4n))).toBe(false);
+    });
+    (0, vitest_1.it)('zModN(6): NO es campo', () => {
+        const r = (0, mathlib_1.zModN)(6n);
+        (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(6n), (0, mathlib_1.zModNDiv)(6n))).toBe(false);
+    });
+    (0, vitest_1.it)('zModN(5): 3 + 4 = 2 (mod 5)', () => {
+        const r = (0, mathlib_1.zModN)(5n);
+        (0, vitest_1.expect)(r.add(3n, 4n)).toBe(2n);
+    });
+    (0, vitest_1.it)('zModN(5): 3 * 4 = 2 (mod 5)', () => {
+        const r = (0, mathlib_1.zModN)(5n);
+        (0, vitest_1.expect)(r.mul(3n, 4n)).toBe(2n);
+    });
+});
+(0, vitest_1.describe)('ring theory — racionales como campo', () => {
+    const sample = [
+        (0, mathlib_1.rational)(0n, 1n),
+        (0, mathlib_1.rational)(1n, 1n),
+        (0, mathlib_1.rational)(-1n, 1n),
+        (0, mathlib_1.rational)(1n, 2n),
+        (0, mathlib_1.rational)(2n, 3n),
+    ];
+    (0, vitest_1.it)('rationalsField: anillo válido sobre muestreo', () => {
+        const result = (0, mathlib_1.verifyRing)(mathlib_1.rationalsField, sample, mathlib_1.rationalEq);
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('rationalsField: es campo (todo no-cero invertible)', () => {
+        (0, vitest_1.expect)((0, mathlib_1.isField)(mathlib_1.rationalsField, sample, mathlib_1.rationalDiv, mathlib_1.rationalEq)).toBe(true);
+    });
+    (0, vitest_1.it)('rational: 2/4 se reduce a 1/2', () => {
+        const r = (0, mathlib_1.rational)(2n, 4n);
+        (0, vitest_1.expect)(r.num).toBe(1n);
+        (0, vitest_1.expect)(r.den).toBe(2n);
+    });
+    (0, vitest_1.it)('rationalDiv: división por cero devuelve undefined', () => {
+        (0, vitest_1.expect)((0, mathlib_1.rationalDiv)((0, mathlib_1.rational)(1n, 1n), (0, mathlib_1.rational)(0n, 1n))).toBeUndefined();
+    });
+    (0, vitest_1.it)('rational: normaliza signos (1/-2 → -1/2)', () => {
+        const r = (0, mathlib_1.rational)(1n, -2n);
+        (0, vitest_1.expect)(r.num).toBe(-1n);
+        (0, vitest_1.expect)(r.den).toBe(2n);
+    });
+    (0, vitest_1.it)('rational: error si denominador es 0', () => {
+        (0, vitest_1.expect)(() => (0, mathlib_1.rational)(1n, 0n)).toThrow();
+    });
+});
+// ============================================================
+// Lemmas
+// ============================================================
+(0, vitest_1.describe)('standard lemmas', () => {
+    (0, vitest_1.it)('STANDARD_LEMMAS contiene al menos 8 lemas', () => {
+        (0, vitest_1.expect)(mathlib_1.STANDARD_LEMMAS.length).toBeGreaterThanOrEqual(8);
+    });
+    (0, vitest_1.it)('cada lemma tiene name y statement no vacíos', () => {
+        for (const l of mathlib_1.STANDARD_LEMMAS) {
+            (0, vitest_1.expect)(l.name).toBeTruthy();
+            (0, vitest_1.expect)(l.statement.length).toBeGreaterThan(0);
+        }
+    });
+    (0, vitest_1.it)('group.inverse_unique es aplicable a estructura con op', () => {
+        const lemma = mathlib_1.STANDARD_LEMMAS.find((l) => l.name === 'group.inverse_unique');
+        (0, vitest_1.expect)(lemma).toBeDefined();
+        const struct = {
+            name: 'test',
+            elements: [],
+            operations: new Map([['op', (a, b) => [a, b]]]),
+            axioms: [],
+        };
+        (0, vitest_1.expect)(lemma.applicableTo(struct)).toBe(true);
+    });
+    (0, vitest_1.it)('ring.zero_times_anything requiere ops add y mul', () => {
+        const lemma = mathlib_1.STANDARD_LEMMAS.find((l) => l.name === 'ring.zero_times_anything');
+        (0, vitest_1.expect)(lemma).toBeDefined();
+        const onlyAdd = {
+            name: 'test',
+            elements: [],
+            operations: new Map([['add', (a, b) => [a, b]]]),
+            axioms: [],
+        };
+        (0, vitest_1.expect)(lemma.applicableTo(onlyAdd)).toBe(false);
+    });
+});
+//# sourceMappingURL=mathlib.test.js.map