@stevenvo780/st-lang 4.7.0 → 4.9.0

package/dist/solver/smt-z3/z3-wasm-backend.js

@@ -0,0 +1,437 @@
+"use strict";
+// ============================================================
+// ST SMT-Z3 — Backend real basado en z3-solver (WASM in-process)
+// ============================================================
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Z3WasmBackend = void 0;
+exports.isZ3Available = isZ3Available;
+exports.detectAvailableSMT = detectAvailableSMT;
+let cachedZ3Module;
+let cachedInitError;
+/** Carga perezosa de z3-solver. Cachea el módulo entre instancias. */
+async function loadZ3() {
+    if (cachedZ3Module)
+        return cachedZ3Module;
+    if (cachedInitError !== undefined)
+        throw cachedInitError;
+    try {
+        // Import dinámico + cast a `any`: la API real de z3-solver expone
+        // genéricos por Context<Name> que harían el wrapper invasivo. El
+        // contrato externo del backend está fijado por AsyncSMTBackend, así
+        // que el cast queda contenido aquí.
+        const mod = (await Promise.resolve().then(() => __importStar(require('z3-solver'))));
+        cachedZ3Module = (await mod.init());
+        return cachedZ3Module;
+    }
+    catch (err) {
+        cachedInitError = err;
+        throw err;
+    }
+}
+/**
+ * `isZ3Available()` intenta inicializar z3-solver y devuelve true si
+ * obtiene un Context utilizable. No lanza. Útil para skip de tests y
+ * detección de runtime.
+ */
+async function isZ3Available() {
+    try {
+        const z3 = await loadZ3();
+        // Smoke: crear y liberar un Solver. Si falla el WASM, salimos por catch.
+        const ctx = z3.Context('detect-' + Date.now().toString(36));
+        const s = new ctx.Solver();
+        s.release();
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Detector unificado de runtime SMT con preferencia por el WASM in-process.
+ * - z3-wasm si la WASM bind carga.
+ * - z3-subprocess o cvc5-subprocess si hay binario en PATH.
+ * - 'none' si no hay nada.
+ */
+async function detectAvailableSMT() {
+    if (await isZ3Available())
+        return 'z3-wasm';
+    // Fallback: importar el detector subprocess sin acoplar build target.
+    try {
+        const { detectAvailableSMTDetailed } = await Promise.resolve().then(() => __importStar(require('../smt/subprocess-backend')));
+        const detected = detectAvailableSMTDetailed();
+        if (detected.solver === 'z3')
+            return 'z3-subprocess';
+        if (detected.solver === 'cvc5')
+            return 'cvc5-subprocess';
+    }
+    catch {
+        // ignore — subprocess backend opcional
+    }
+    return 'none';
+}
+let contextCounter = 0;
+/**
+ * Z3WasmBackend — wrapper sobre z3-solver con interfaz AsyncSMTBackend.
+ *
+ * Modelo de estado:
+ *  - Mantiene un único `Solver` Z3 cuyo stack push/pop se sincroniza con
+ *    `scopes[]` del host (espejo). Esto permite re-hidratar el solver con
+ *    `solver.reset()` + replay de scopes si fuera necesario (no se hace
+ *    en el flujo normal, sólo en `reset()`).
+ *  - `assertFormula(body)` mete `(assert body)` en el solver actual,
+ *    pero también lo registra en `scopes[top].assertions` por trazabilidad.
+ *  - `getUnsatCore()` requiere haber usado `assertNamed(name, body)`:
+ *    estos asserts se envuelven en `(=> <track> <body>)` y se pasan como
+ *    assumption literals al check(). El core devuelto es la lista de
+ *    nombres `track`.
+ */
+class Z3WasmBackend {
+    name = 'z3-wasm';
+    z3;
+    ctx;
+    solver;
+    logic;
+    produceUnsatCore;
+    produceModels;
+    timeoutMs;
+    scopes = [{ decls: [], assertions: [] }];
+    /** Tracks declarados como Bool y usados como assumption literals. */
+    trackNames = new Set();
+    lastModel;
+    lastUnsatCore = [];
+    lastStatistics = {};
+    constructor(z3, ctx, options = {}) {
+        this.z3 = z3;
+        this.ctx = ctx;
+        this.logic = options.logic;
+        this.produceUnsatCore = options.produceUnsatCore ?? true;
+        this.produceModels = options.produceModels ?? true;
+        this.timeoutMs = options.timeoutMs;
+        this.solver = this.buildSolver();
+    }
+    /** Crea un backend nuevo. Falla si z3-solver no puede inicializarse. */
+    static async create(logicOrOptions) {
+        const options = typeof logicOrOptions === 'string' ? { logic: logicOrOptions } : (logicOrOptions ?? {});
+        const z3 = await loadZ3();
+        // Cada backend usa su propio Context Z3 para evitar cross-talk entre tests.
+        contextCounter += 1;
+        const ctx = z3.Context(`st-z3-wasm-${contextCounter}`);
+        return new Z3WasmBackend(z3, ctx, options);
+    }
+    /** Resetea el solver (drop all asserts y scopes). */
+    reset() {
+        try {
+            this.solver.release();
+        }
+        catch {
+            // ignore — release es best-effort
+        }
+        this.solver = this.buildSolver();
+        this.scopes = [{ decls: [], assertions: [] }];
+        this.trackNames = new Set();
+        this.lastModel = undefined;
+        this.lastUnsatCore = [];
+        this.lastStatistics = {};
+    }
+    push() {
+        this.solver.push();
+        this.scopes.push({ decls: [], assertions: [] });
+    }
+    pop(levels = 1) {
+        const target = Math.min(levels, this.scopes.length - 1);
+        if (target <= 0)
+            return;
+        this.solver.pop(target);
+        for (let i = 0; i < target; i += 1) {
+            this.scopes.pop();
+        }
+    }
+    declareConst(name, sort, bvWidth) {
+        const decl = { name, sort };
+        if (sort === 'BitVec')
+            decl.bvWidth = bvWidth ?? 32;
+        this.currentScope().decls.push(decl);
+        this.solver.fromString(this.formatDecl(decl));
+    }
+    /**
+     * Inserta una aserción directa (sin tracking). El cuerpo es SMT-LIB v2
+     * SIN envolver en `(assert ...)`.
+     */
+    assertFormula(smtlib) {
+        const body = smtlib.trim();
+        if (!body)
+            return;
+        this.currentScope().assertions.push({ body });
+        this.solver.fromString(`(assert ${body})`);
+    }
+    /**
+     * Aserción nombrada para participar de unsat core. El `trackName` se
+     * declara como Bool fresco y la aserción real se mete como
+     * `(=> trackName body)`. En checkSat() esos tracks se pasan como
+     * assumption literals.
+     */
+    assertNamed(trackName, smtlib) {
+        if (!this.produceUnsatCore) {
+            // Si el solver no produce core, degradamos a assert simple.
+            this.assertFormula(smtlib);
+            return;
+        }
+        const body = smtlib.trim();
+        if (!body)
+            return;
+        if (this.trackNames.has(trackName)) {
+            throw new Error(`[z3-wasm] trackName "${trackName}" ya fue usado en este backend`);
+        }
+        this.trackNames.add(trackName);
+        this.currentScope().assertions.push({ body, trackName });
+        this.solver.fromString(`(declare-const ${trackName} Bool)`);
+        this.solver.fromString(`(assert (=> ${trackName} ${body}))`);
+    }
+    async checkSat() {
+        const assumptions = [];
+        if (this.produceUnsatCore) {
+            for (const name of this.trackNames) {
+                assumptions.push(this.ctx.Bool.const(name));
+            }
+        }
+        let result;
+        try {
+            result =
+                assumptions.length > 0
+                    ? await this.solver.check(...assumptions)
+                    : await this.solver.check();
+        }
+        catch (err) {
+            // WASM throw — devolver unknown en lugar de propagar, alineado con el
+            // resto de backends que nunca tiran en checkSat.
+            this.lastModel = undefined;
+            this.lastUnsatCore = [];
+            // Bug-friendly: pegar mensaje a las statistics para diagnóstico.
+            this.lastStatistics = { error: 1 };
+            void err;
+            return 'unknown';
+        }
+        if (result === 'sat') {
+            this.lastModel = this.extractModel();
+            this.lastUnsatCore = [];
+        }
+        else if (result === 'unsat') {
+            this.lastModel = undefined;
+            this.lastUnsatCore = this.extractUnsatCore();
+        }
+        else {
+            this.lastModel = undefined;
+            this.lastUnsatCore = [];
+        }
+        this.lastStatistics = this.extractStatistics();
+        return result;
+    }
+    getModel() {
+        return this.lastModel ? { ...this.lastModel } : undefined;
+    }
+    getUnsatCore() {
+        return [...this.lastUnsatCore];
+    }
+    /**
+     * `setOption` envuelve `solver.set(key, value)`. Acepta los nombres
+     * estándar Z3 (ej. `timeout`, `random_seed`).
+     */
+    setOption(key, value) {
+        this.solver.set(key, value);
+    }
+    /** Devuelve la última snapshot de stats Z3 capturada en checkSat(). */
+    getStatistics() {
+        return { ...this.lastStatistics };
+    }
+    /**
+     * Cierra el solver liberando memoria WASM. Después de close() el
+     * backend no debe usarse.
+     */
+    close() {
+        try {
+            this.solver.release();
+        }
+        catch {
+            // ignore — release es best-effort
+        }
+    }
+    // --------------------------------------------------------------
+    // Internals
+    // --------------------------------------------------------------
+    buildSolver() {
+        const solver = this.logic ? new this.ctx.Solver(this.logic) : new this.ctx.Solver();
+        if (this.produceUnsatCore) {
+            solver.set('unsat_core', true);
+        }
+        if (this.produceModels) {
+            solver.set('model', true);
+        }
+        if (this.timeoutMs !== undefined) {
+            solver.set('timeout', this.timeoutMs);
+        }
+        return solver;
+    }
+    currentScope() {
+        const top = this.scopes[this.scopes.length - 1];
+        if (!top) {
+            const fresh = { decls: [], assertions: [] };
+            this.scopes.push(fresh);
+            return fresh;
+        }
+        return top;
+    }
+    formatDecl(decl) {
+        if (decl.sort === 'BitVec') {
+            return `(declare-const ${decl.name} (_ BitVec ${decl.bvWidth ?? 32}))`;
+        }
+        return `(declare-const ${decl.name} ${decl.sort})`;
+    }
+    extractModel() {
+        let model;
+        try {
+            model = this.solver.model();
+        }
+        catch {
+            return undefined;
+        }
+        const out = {};
+        const decls = model.decls();
+        for (const d of decls) {
+            const nameAst = d.name();
+            const name = nameAst.toString();
+            // Saltamos los track names usados internamente para unsat-core.
+            if (this.trackNames.has(name))
+                continue;
+            let raw;
+            try {
+                raw = model.get(d).toString().trim();
+            }
+            catch {
+                continue;
+            }
+            out[name] = parseZ3Value(raw);
+        }
+        return Object.keys(out).length > 0 ? out : undefined;
+    }
+    extractUnsatCore() {
+        let core;
+        try {
+            core = this.solver.unsatCore();
+        }
+        catch {
+            return [];
+        }
+        const names = [];
+        const len = core.length();
+        for (let i = 0; i < len; i += 1) {
+            try {
+                const lit = core.get(i);
+                names.push(lit.toString());
+            }
+            catch {
+                // ignore literal corrupto
+            }
+        }
+        return names;
+    }
+    extractStatistics() {
+        let stats;
+        try {
+            stats = this.solver.statistics();
+        }
+        catch {
+            return {};
+        }
+        const out = {};
+        try {
+            const iter = stats[Symbol.iterator]();
+            while (true) {
+                const step = iter.next();
+                if (step.done)
+                    break;
+                const entry = step.value;
+                if (typeof entry.value === 'number' && Number.isFinite(entry.value)) {
+                    out[entry.key] = entry.value;
+                }
+            }
+        }
+        catch {
+            // Si la iteración de stats falla, mantenemos el snapshot vacío.
+        }
+        return out;
+    }
+}
+exports.Z3WasmBackend = Z3WasmBackend;
+/**
+ * Decodifica el `toString()` de un valor Z3 a una representación JS:
+ *  - "true"/"false" → boolean
+ *  - "#xFF" / "#b101" → number (con guard a Number.MAX_SAFE_INTEGER)
+ *  - decimales y enteros → number (cuando entran en safe range)
+ *  - resto → string crudo
+ */
+function parseZ3Value(raw) {
+    if (raw === 'true')
+        return true;
+    if (raw === 'false')
+        return false;
+    if (raw.startsWith('#x')) {
+        const n = Number.parseInt(raw.slice(2), 16);
+        return Number.isSafeInteger(n) ? n : raw;
+    }
+    if (raw.startsWith('#b')) {
+        const n = Number.parseInt(raw.slice(2), 2);
+        return Number.isSafeInteger(n) ? n : raw;
+    }
+    // (- 5) → -5
+    const negMatch = /^\(-\s+(\d+(?:\.\d+)?)\)$/.exec(raw);
+    if (negMatch && negMatch[1] !== undefined) {
+        const n = Number(`-${negMatch[1]}`);
+        return Number.isFinite(n) ? n : raw;
+    }
+    // Racional (/ a b) → a/b
+    const ratMatch = /^\(\/\s+(\d+(?:\.\d+)?)\s+(\d+(?:\.\d+)?)\)$/.exec(raw);
+    if (ratMatch && ratMatch[1] !== undefined && ratMatch[2] !== undefined) {
+        const a = Number(ratMatch[1]);
+        const b = Number(ratMatch[2]);
+        if (Number.isFinite(a) && Number.isFinite(b) && b !== 0)
+            return a / b;
+    }
+    const numeric = Number(raw);
+    if (!Number.isNaN(numeric) && Number.isFinite(numeric))
+        return numeric;
+    return raw;
+}
+//# sourceMappingURL=z3-wasm-backend.js.map

package/dist/solver/smt-z3/z3-wasm-backend.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"z3-wasm-backend.js","sourceRoot":"","sources":["../../../src/solver/smt-z3/z3-wasm-backend.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iEAAiE;AACjE,+DAA+D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmF/D,sCAWC;AAQD,gDAYC;AA3DD,IAAI,cAAoC,CAAC;AACzC,IAAI,eAAwB,CAAC;AAE7B,sEAAsE;AACtE,KAAK,UAAU,MAAM;IACnB,IAAI,cAAc;QAAE,OAAO,cAAc,CAAC;IAC1C,IAAI,eAAe,KAAK,SAAS;QAAE,MAAM,eAAe,CAAC;IACzD,IAAI,CAAC;QACH,kEAAkE;QAClE,iEAAiE;QACjE,oEAAoE;QACpE,oCAAoC;QACpC,MAAM,GAAG,GAAG,CAAC,wDAAa,WAAW,GAAC,CAErC,CAAC;QACF,cAAc,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAa,CAAC;QAChD,OAAO,cAAc,CAAC;IACxB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,eAAe,GAAG,GAAG,CAAC;QACtB,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;;GAIG;AACI,KAAK,UAAU,aAAa;IACjC,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,MAAM,EAAE,CAAC;QAC1B,yEAAyE;QACzE,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QAC3B,CAAC,CAAC,OAAO,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACI,KAAK,UAAU,kBAAkB;IACtC,IAAI,MAAM,aAAa,EAAE;QAAE,OAAO,SAAS,CAAC;IAC5C,sEAAsE;IACtE,IAAI,CAAC;QACH,MAAM,EAAE,0BAA0B,EAAE,GAAG,wDAAa,2BAA2B,GAAC,CAAC;QACjF,MAAM,QAAQ,GAAG,0BAA0B,EAAE,CAAC;QAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,IAAI;YAAE,OAAO,eAAe,CAAC;QACrD,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM;YAAE,OAAO,iBAAiB,CAAC;IAC3D,CAAC;IAAC,MAAM,CAAC;QACP,uCAAuC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,IAAI,cAAc,GAAG,CAAC,CAAC;AAEvB;;;;;;;;;;;;;;GAcG;AACH,MAAa,aAAa;IACf,IAAI,GAAG,SAAS,CAAC;IAET,EAAE,CAAW;IACb,GAAG,CAAY;IACxB,MAAM,CAAW;IACR,KAAK,CAAuB;IAC5B,gBAAgB,CAAU;IAC1B,aAAa,CAAU;IACvB,SAAS,CAAqB;IAEvC,MAAM,GAAc,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5D,qEAAqE;IAC7D,UAAU,GAAgB,IAAI,GAAG,EAAE,CAAC;IACpC,SAAS,CAAuB;IAChC,aAAa,GAAa,EAAE,CAAC;IAC7B,cAAc,GAA2B,EAAE,CAAC;IAEpD,YAAoB,EAAY,EAAE,GAAc,EAAE,UAAgC,EAAE;QAClF,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,IAAI,CAAC;QACzD,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,IAAI,CAAC;QACnD,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACnC,CAAC;IAED,wEAAwE;IACxE,MAAM,CAAC,KAAK,CAAC,MAAM,CACjB,cAAgD;QAEhD,MAAM,OAAO,GACX,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;QAC1F,MAAM,EAAE,GAAG,MAAM,MAAM,EAAE,CAAC;QAC1B,4EAA4E;QAC5E,cAAc,IAAI,CAAC,CAAC;QACpB,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,cAAc,cAAc,EAAE,CAAC,CAAC;QACvD,OAAO,IAAI,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAED,qDAAqD;IACrD,KAAK;QACH,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACxB,CAAC;QAAC,MAAM,CAAC;YACP,kCAAkC;QACpC,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;IAC3B,CAAC;IAED,IAAI;QACF,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,GAAG,CAAC,MAAM,GAAG,CAAC;QACZ,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxD,IAAI,MAAM,IAAI,CAAC;YAAE,OAAO;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IAED,YAAY,CAAC,IAAY,EAAE,IAAa,EAAE,OAAgB;QACxD,MAAM,IAAI,GAAiB,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QAC1C,IAAI,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;QACpD,IAAI,CAAC,YAAY,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAChD,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,MAAc;QAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,IAAI,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,SAAiB,EAAE,MAAc;QAC3C,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,4DAA4D;YAC5D,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC3B,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,wBAAwB,SAAS,gCAAgC,CAAC,CAAC;QACrF,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC/B,IAAI,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,kBAAkB,SAAS,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,eAAe,SAAS,IAAI,IAAI,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED,KAAK,CAAC,QAAQ;QACZ,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACnC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,IAAI,MAAiB,CAAC;QACtB,IAAI,CAAC;YACH,MAAM;gBACJ,WAAW,CAAC,MAAM,GAAG,CAAC;oBACpB,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC;oBACzC,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAClC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,sEAAsE;YACtE,iDAAiD;YACjD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;YACxB,iEAAiE;YACjE,IAAI,CAAC,cAAc,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACnC,KAAK,GAAG,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACrC,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QAC1B,CAAC;aAAM,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC/C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IAED,YAAY;QACV,OAAO,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,GAAW,EAAE,KAAgC;QACrD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,uEAAuE;IACvE,aAAa;QACX,OAAO,EAAE,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACxB,CAAC;QAAC,MAAM,CAAC;YACP,kCAAkC;QACpC,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,YAAY;IACZ,iEAAiE;IAEzD,WAAW;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;QACpF,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,YAAY;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,KAAK,GAAY,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;YACrD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,UAAU,CAAC,IAAkB;QACnC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,OAAO,kBAAkB,IAAI,CAAC,IAAI,cAAc,IAAI,CAAC,OAAO,IAAI,EAAE,IAAI,CAAC;QACzE,CAAC;QACD,OAAO,kBAAkB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC;IACrD,CAAC;IAEO,YAAY;QAClB,IAAI,KAAc,CAAC;QACnB,IAAI,CAAC;YACH,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC9B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YAChC,gEAAgE;YAChE,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YACxC,IAAI,GAAW,CAAC;YAChB,IAAI,CAAC;gBACH,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;YACvC,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAEO,gBAAgB;QACtB,IAAI,IAAkD,CAAC;QACvD,IAAI,CAAC;YACH,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;QACjC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC7B,CAAC;YAAC,MAAM,CAAC;gBACP,0BAA0B;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,iBAAiB;QACvB,IAAI,KAAmB,CAAC;QACxB,IAAI,CAAC;YACH,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;QACnC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,OAAO,IAAI,EAAE,CAAC;gBACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,IAAI;oBAAE,MAAM;gBACrB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;gBACzB,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;oBACpE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC/B,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,gEAAgE;QAClE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AA7RD,sCA6RC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,GAAW;IAC/B,IAAI,GAAG,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IAChC,IAAI,GAAG,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC3C,CAAC;IACD,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC3C,CAAC;IACD,aAAa;IACb,MAAM,QAAQ,GAAG,2BAA2B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvD,IAAI,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IACtC,CAAC;IACD,yBAAyB;IACzB,MAAM,QAAQ,GAAG,8CAA8C,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1E,IAAI,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;QACvE,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACxE,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IACvE,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/tests/logic/profiles/quantum/quantum.test.d.ts

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

package/dist/tests/logic/profiles/quantum/quantum.test.d.ts.map

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

package/dist/tests/logic/profiles/quantum/quantum.test.js

@@ -0,0 +1,209 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const quantum_1 = require("../../../../logic/profiles/quantum");
+(0, vitest_1.describe)('quantum logic — núcleo vectorial', () => {
+    (0, vitest_1.it)('dot de vectores ortogonales es 0; norma de e1 es 1', () => {
+        const e1 = (0, quantum_1.vec)([1, 0, 0]);
+        const e2 = (0, quantum_1.vec)([0, 1, 0]);
+        (0, vitest_1.expect)((0, quantum_1.dot)(e1, e2)).toBeCloseTo(0, 12);
+        (0, vitest_1.expect)((0, quantum_1.norm)(e1)).toBeCloseTo(1, 12);
+    });
+    (0, vitest_1.it)('normalize escala al unitario; norma de cero lanza', () => {
+        const v = (0, quantum_1.vec)([3, 4]);
+        const u = (0, quantum_1.normalize)(v);
+        (0, vitest_1.expect)((0, quantum_1.norm)(u)).toBeCloseTo(1, 9);
+        (0, vitest_1.expect)(() => (0, quantum_1.normalize)((0, quantum_1.vec)([0, 0, 0]))).toThrow();
+    });
+    (0, vitest_1.it)('isOrthogonal: e1 y e2 en R^3 son ortogonales; e1 y (1,1,0) no', () => {
+        (0, vitest_1.expect)((0, quantum_1.isOrthogonal)((0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0]))).toBe(true);
+        (0, vitest_1.expect)((0, quantum_1.isOrthogonal)((0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([1, 1, 0]))).toBe(false);
+    });
+    (0, vitest_1.it)('orthonormalBasis: 3 vectores LI en R^3 → 3 vectores ortonormales', () => {
+        const basis = (0, quantum_1.orthonormalBasis)([(0, quantum_1.vec)([1, 1, 0]), (0, quantum_1.vec)([0, 1, 1]), (0, quantum_1.vec)([1, 0, 1])]);
+        (0, vitest_1.expect)(basis).not.toBeNull();
+        (0, vitest_1.expect)(basis.length).toBe(3);
+        for (const v of basis)
+            (0, vitest_1.expect)((0, quantum_1.norm)(v)).toBeCloseTo(1, 9);
+        for (let i = 0; i < basis.length; i++)
+            for (let j = i + 1; j < basis.length; j++)
+                (0, vitest_1.expect)((0, quantum_1.dot)(basis[i], basis[j])).toBeCloseTo(0, 9);
+    });
+    (0, vitest_1.it)('orthonormalBasis: vectores LD colapsan a una dimensión inferior', () => {
+        const basis = (0, quantum_1.orthonormalBasis)([(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([2, 0, 0]), (0, quantum_1.vec)([0, 1, 0])]);
+        (0, vitest_1.expect)(basis).not.toBeNull();
+        (0, vitest_1.expect)(basis.length).toBe(2);
+    });
+});
+(0, vitest_1.describe)('quantum logic — subespacios', () => {
+    (0, vitest_1.it)('span de e1 y e2 tiene dimensión 2', () => {
+        const s = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0])]);
+        (0, vitest_1.expect)(s.dimension).toBe(2);
+        (0, vitest_1.expect)(s.ambientDim).toBe(3);
+    });
+    (0, vitest_1.it)('span de dos colineales tiene dimensión 1', () => {
+        const s = (0, quantum_1.span)([(0, quantum_1.vec)([1, 1, 0]), (0, quantum_1.vec)([3, 3, 0])]);
+        (0, vitest_1.expect)(s.dimension).toBe(1);
+    });
+    (0, vitest_1.it)('isContained: e1 ⊆ span(e1, e2); pero e3 ⊄ span(e1, e2)', () => {
+        const plane = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0])]);
+        const xLine = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0])]);
+        const zLine = (0, quantum_1.span)([(0, quantum_1.vec)([0, 0, 1])]);
+        (0, vitest_1.expect)((0, quantum_1.isContained)(xLine, plane)).toBe(true);
+        (0, vitest_1.expect)((0, quantum_1.isContained)(zLine, plane)).toBe(false);
+    });
+    (0, vitest_1.it)('meet de subespacios ortogonales (xy y z) es {0}', () => {
+        const xy = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0])]);
+        const z = (0, quantum_1.span)([(0, quantum_1.vec)([0, 0, 1])]);
+        const m = (0, quantum_1.meet)(xy, z);
+        (0, vitest_1.expect)(m.dimension).toBe(0);
+    });
+    (0, vitest_1.it)('meet de subespacios solapados (xy y xz) es la línea x', () => {
+        const xy = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0])]);
+        const xz = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 0, 1])]);
+        const m = (0, quantum_1.meet)(xy, xz);
+        (0, vitest_1.expect)(m.dimension).toBe(1);
+        const xLine = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0])]);
+        (0, vitest_1.expect)((0, quantum_1.equalsSubspace)(m, xLine)).toBe(true);
+    });
+    (0, vitest_1.it)('join de e1 y e2 es el plano xy (dim 2)', () => {
+        const a = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0, 0])]);
+        const b = (0, quantum_1.span)([(0, quantum_1.vec)([0, 1, 0])]);
+        const j = (0, quantum_1.join)(a, b);
+        (0, vitest_1.expect)(j.dimension).toBe(2);
+        (0, vitest_1.expect)(j.ambientDim).toBe(3);
+    });
+    (0, vitest_1.it)('orthocomplement en R^2: span(e1)⊥ ≡ span(e2)', () => {
+        const e1 = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0])], 2);
+        const perp = (0, quantum_1.orthocomplement)(e1);
+        (0, vitest_1.expect)(perp.dimension).toBe(1);
+        (0, vitest_1.expect)((0, quantum_1.equalsSubspace)(perp, (0, quantum_1.span)([(0, quantum_1.vec)([0, 1])], 2))).toBe(true);
+    });
+    (0, vitest_1.it)('orthocomplement doble es identidad: (a⊥)⊥ = a', () => {
+        const a = (0, quantum_1.span)([(0, quantum_1.vec)([1, 1, 0]), (0, quantum_1.vec)([0, 1, 1])]);
+        const aPerpPerp = (0, quantum_1.orthocomplement)((0, quantum_1.orthocomplement)(a));
+        (0, vitest_1.expect)((0, quantum_1.equalsSubspace)(aPerpPerp, a)).toBe(true);
+    });
+    (0, vitest_1.it)('orthocomplement: zero⊥ = top, top⊥ = zero', () => {
+        const Z = (0, quantum_1.zeroSubspace)(3);
+        const T = (0, quantum_1.topSubspace)(3);
+        (0, vitest_1.expect)((0, quantum_1.equalsSubspace)((0, quantum_1.orthocomplement)(Z, 3), T)).toBe(true);
+        (0, vitest_1.expect)((0, quantum_1.equalsSubspace)((0, quantum_1.orthocomplement)(T, 3), Z)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('quantum logic — lattice no-distributivo pero orthomodular', () => {
+    (0, vitest_1.it)('makeQuantumLattice expone zero, top y operaciones', () => {
+        const L = (0, quantum_1.makeQuantumLattice)(3);
+        (0, vitest_1.expect)(L.dimensions).toBe(3);
+        (0, vitest_1.expect)(L.zero.dimension).toBe(0);
+        (0, vitest_1.expect)(L.top.dimension).toBe(3);
+    });
+    (0, vitest_1.it)('CONTRAEJEMPLO de distributividad en R^2: tres rectas distintas', () => {
+        // En R^2, tomamos a = span(e1), b = span(e2), c = span(e1+e2).
+        // Entonces b ∨ c = todo R^2, así a ∧ (b ∨ c) = a (dimensión 1).
+        // Pero a ∧ b = {0} y a ∧ c = {0}, así (a ∧ b) ∨ (a ∧ c) = {0}.
+        const L = (0, quantum_1.makeQuantumLattice)(2);
+        const a = (0, quantum_1.span)([(0, quantum_1.vec)([1, 0])], 2);
+        const b = (0, quantum_1.span)([(0, quantum_1.vec)([0, 1])], 2);
+        const c = (0, quantum_1.span)([(0, quantum_1.vec)([1, 1])], 2);
+        const lhs = L.meet(a, L.join(b, c));
+        const rhs = L.join(L.meet(a, b), L.meet(a, c));
+        (0, vitest_1.expect)(lhs.dimension).toBe(1);
+        (0, vitest_1.expect)(rhs.dimension).toBe(0);
+        (0, vitest_1.expect)((0, quantum_1.equalsSubspace)(lhs, rhs)).toBe(false);
+    });
+    (0, vitest_1.it)('isDistributive devuelve false para R^2 (sampling encuentra contraejemplo)', () => {
+        const L = (0, quantum_1.makeQuantumLattice)(2);
+        (0, vitest_1.expect)((0, quantum_1.isDistributive)(L, 30)).toBe(false);
+    });
+    (0, vitest_1.it)('isDistributive devuelve false para R^3 con sampler que fuerza a ⊂ b ∨ c', () => {
+        const L = (0, quantum_1.makeQuantumLattice)(3);
+        (0, vitest_1.expect)((0, quantum_1.isDistributive)(L, 60)).toBe(false);
+    });
+    (0, vitest_1.it)('isModular: el lattice de subespacios de R^n SÍ es modular', () => {
+        const L = (0, quantum_1.makeQuantumLattice)(3);
+        (0, vitest_1.expect)((0, quantum_1.isModular)(L, 20)).toBe(true);
+    });
+    (0, vitest_1.it)('isOrthomodular: se cumple la ley orthomodular', () => {
+        const L = (0, quantum_1.makeQuantumLattice)(3);
+        (0, vitest_1.expect)((0, quantum_1.isOrthomodular)(L, 20)).toBe(true);
+    });
+    (0, vitest_1.it)('R^2 es modular pero NO distributivo — combinación que separa booleano de quantum', () => {
+        const L = (0, quantum_1.makeQuantumLattice)(2);
+        (0, vitest_1.expect)((0, quantum_1.isModular)(L, 30)).toBe(true);
+        (0, vitest_1.expect)((0, quantum_1.isDistributive)(L, 30)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('quantum logic — Kochen–Specker', () => {
+    (0, vitest_1.it)('findOrthogonalTriples: detecta la única base ortogonal canónica en R^3', () => {
+        const v = [(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0]), (0, quantum_1.vec)([0, 0, 1])];
+        const triples = (0, quantum_1.findOrthogonalTriples)(v);
+        (0, vitest_1.expect)(triples).toEqual([[0, 1, 2]]);
+    });
+    (0, vitest_1.it)('configuración trivial (una base ortonormal) SÍ es coloreable', () => {
+        const v = [(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0]), (0, quantum_1.vec)([0, 0, 1])];
+        const triples = (0, quantum_1.findOrthogonalTriples)(v);
+        (0, vitest_1.expect)(triples.length).toBe(1);
+        (0, vitest_1.expect)((0, quantum_1.isKSColorable)({ vectors: v, orthoTriples: triples })).toBe(true);
+    });
+    (0, vitest_1.it)('dos bases que comparten un eje en R^3: el eje compartido todavía permite coloración', () => {
+        const s = 1 / Math.sqrt(2);
+        const v = [(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([0, 1, 0]), (0, quantum_1.vec)([0, 0, 1]), (0, quantum_1.vec)([0, s, s]), (0, quantum_1.vec)([0, s, -s])];
+        const triples = (0, quantum_1.findOrthogonalTriples)(v);
+        (0, vitest_1.expect)(triples.length).toBeGreaterThanOrEqual(2);
+        (0, vitest_1.expect)((0, quantum_1.isKSColorable)({ vectors: v, orthoTriples: triples })).toBe(true);
+    });
+    (0, vitest_1.it)('rayo repetido en el mismo triple ⇒ no coloreable trivialmente', () => {
+        // Si por error armamos un triple con dos rayos iguales, la
+        // restricción "exactamente un 1" se vuelve imposible.
+        const v = [(0, quantum_1.vec)([1, 0, 0]), (0, quantum_1.vec)([2, 0, 0]), (0, quantum_1.vec)([0, 1, 0])];
+        const cfg = { vectors: v, orthoTriples: [[0, 1, 2]] };
+        (0, vitest_1.expect)((0, quantum_1.isKSColorable)(cfg)).toBe(false);
+    });
+    (0, vitest_1.it)('kochenSpeckerTheorem3D devuelve un set R^3 estilo-Peres con varios triples', () => {
+        const cfg = (0, quantum_1.kochenSpeckerTheorem3D)();
+        (0, vitest_1.expect)(cfg.vectors.length).toBeGreaterThanOrEqual(13);
+        (0, vitest_1.expect)(cfg.orthoTriples.length).toBeGreaterThanOrEqual(3);
+        // Todos los vectores son R^3
+        for (const v of cfg.vectors)
+            (0, vitest_1.expect)(v.values.length).toBe(3);
+    });
+    (0, vitest_1.it)('Cabello-18 tiene 18 vectores en R^4 y 9 contextos', () => {
+        const { vectors, contexts } = (0, quantum_1.kochenSpeckerCabello18)();
+        (0, vitest_1.expect)(vectors.length).toBe(18);
+        (0, vitest_1.expect)(contexts.length).toBe(9);
+        for (const v of vectors)
+            (0, vitest_1.expect)(v.values.length).toBe(4);
+        // Cada vector aparece en exactamente 2 contextos.
+        const appearance = new Array(vectors.length).fill(0);
+        for (const ctx of contexts)
+            for (const i of ctx)
+                appearance[i]++;
+        (0, vitest_1.expect)(appearance.every((c) => c === 2)).toBe(true);
+    });
+    (0, vitest_1.it)('Cabello-18: cada contexto consta de 4 vectores mutuamente ortogonales', () => {
+        const { vectors, contexts } = (0, quantum_1.kochenSpeckerCabello18)();
+        for (const ctx of contexts) {
+            (0, vitest_1.expect)(ctx.length).toBe(4);
+            for (let i = 0; i < ctx.length; i++) {
+                for (let j = i + 1; j < ctx.length; j++) {
+                    const d = (0, quantum_1.dot)(vectors[ctx[i]], vectors[ctx[j]]);
+                    (0, vitest_1.expect)(d).toBeCloseTo(0, 9);
+                }
+            }
+        }
+    });
+    (0, vitest_1.it)('TEOREMA Kochen-Specker (Cabello-18): la configuración NO es coloreable', () => {
+        const { vectors, contexts } = (0, quantum_1.kochenSpeckerCabello18)();
+        (0, vitest_1.expect)((0, quantum_1.isKSColorableContexts)(vectors, contexts)).toBe(false);
+    });
+    (0, vitest_1.it)('parity argument: 9 contextos × 1 uno/ctx = 9 (impar) vs 2 apariciones/vec = par ⇒ no coloreable', () => {
+        // Sanity check del razonamiento detrás del KS Cabello-18.
+        const { contexts } = (0, quantum_1.kochenSpeckerCabello18)();
+        (0, vitest_1.expect)(contexts.length % 2).toBe(1); // 9 es impar
+        const slots = contexts.reduce((s, c) => s + c.length, 0);
+        (0, vitest_1.expect)(slots).toBe(36); // 9 × 4
+        (0, vitest_1.expect)((slots / 2) % 2).toBe(0); // cada vector ocupa 2 slots ⇒ par
+    });
+});
+//# sourceMappingURL=quantum.test.js.map