@stevenvo780/st-lang 4.10.0 → 4.11.0

package/dist/reasoning/group-presentation/todd-coxeter.js

@@ -0,0 +1,362 @@
+"use strict";
+// ============================================================
+// Todd-Coxeter coset enumeration.
+// ============================================================
+//
+// Enumera las clases laterales (cosets) de un subgrupo H ≤ G en
+// un grupo finitamente presentado G = ⟨S | R⟩. Si H es trivial,
+// enumera el grupo entero (los cosets son los elementos de G).
+//
+// Idea: representamos los cosets como enteros 1, 2, 3, ... El coset
+// 1 es el subgrupo H. Mantenemos una tabla `τ(c, x) = c'` que
+// significa "el coset `c` multiplicado por la letra `x` es el coset
+// `c'`". A medida que aplicamos las relaciones de R en cada coset
+// y los generadores subgrupales en el coset 1, descubrimos
+// igualdades (coset c ≡ coset c') que se procesan por
+// union-find (coincidence handling).
+//
+// Implementación: HLT (Haselgrove–Leech–Trotter) básico. Para los
+// tamaños de tests que necesitamos (Z/n, D_n, S_3) basta de sobra
+// y termina rápido. `maxCosets` actúa de poda: el algoritmo es
+// indecidible en general (problema de la palabra), así que si se
+// alcanza el límite devolvemos 'incomplete'.
+//
+// Referencias: Holt–Eick–O'Brien, "Handbook of Computational
+// Group Theory", cap. 5 — versión escolar.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.toddCoxeter = toddCoxeter;
+exports.groupOrder = groupOrder;
+exports.isInSubgroup = isInSubgroup;
+const words_1 = require("./words");
+function buildAlphabet(generators) {
+    const out = [];
+    for (const g of generators) {
+        out.push(g);
+        out.push((0, words_1.inverse)(g));
+    }
+    return out;
+}
+// rep: encuentra la raíz de la clase de equivalencia con path
+// compression. Si c nunca apareció en replaced, devuelve c.
+function rep(state, c) {
+    let cur = c;
+    // Encuentra raíz.
+    while (true) {
+        const parent = state.replaced.get(cur);
+        if (parent === undefined || parent === cur)
+            break;
+        cur = parent;
+    }
+    // Path compression.
+    let walker = c;
+    while (true) {
+        const parent = state.replaced.get(walker);
+        if (parent === undefined || parent === cur)
+            break;
+        state.replaced.set(walker, cur);
+        walker = parent;
+    }
+    return cur;
+}
+// newCoset: reserva el siguiente cosetId disponible.
+function newCoset(state) {
+    const c = state.next++;
+    state.alive.add(c);
+    state.table.set(c, new Map());
+    return c;
+}
+// get τ(c, x). Antes de leer canonicaliza c con rep().
+function getEdge(state, c, x) {
+    const rc = rep(state, c);
+    const row = state.table.get(rc);
+    if (!row)
+        return undefined;
+    const v = row.get(x);
+    return v === undefined ? undefined : rep(state, v);
+}
+// set τ(c, x) = d y τ(d, x⁻¹) = c (consistencia). Si ya había
+// un valor distinto, dispara una coincidencia (deducción de que
+// dos cosets son iguales).
+function setEdge(state, c, x, d, queue) {
+    const rc = rep(state, c);
+    const rd = rep(state, d);
+    const xi = (0, words_1.inverse)(x);
+    // Dirección c --x--> d
+    const rowC = state.table.get(rc);
+    if (!rowC)
+        throw new Error(`setEdge: coset ${rc} sin fila`);
+    const existing = rowC.get(x);
+    if (existing !== undefined) {
+        const re = rep(state, existing);
+        if (re !== rd) {
+            // Coincidencia: re ≡ rd
+            queue.push([re, rd]);
+        }
+        // No sobreescribimos; ya estaba apuntando a algo equivalente.
+    }
+    else {
+        rowC.set(x, rd);
+    }
+    // Dirección d --x⁻¹--> c
+    const rowD = state.table.get(rd);
+    if (!rowD)
+        throw new Error(`setEdge: coset ${rd} sin fila`);
+    const existingInv = rowD.get(xi);
+    if (existingInv !== undefined) {
+        const rei = rep(state, existingInv);
+        if (rei !== rc) {
+            queue.push([rei, rc]);
+        }
+    }
+    else {
+        rowD.set(xi, rc);
+    }
+}
+// processCoincidences: union-find sobre cosets, propaga igualdades.
+function processCoincidences(state, queue) {
+    while (queue.length > 0) {
+        const pair = queue.shift();
+        if (!pair)
+            break;
+        const a = rep(state, pair[0]);
+        const b = rep(state, pair[1]);
+        if (a === b)
+            continue;
+        // Por convenio, identificamos el mayor con el menor.
+        const keep = a < b ? a : b;
+        const drop = a < b ? b : a;
+        state.replaced.set(drop, keep);
+        state.alive.delete(drop);
+        // Volcar la fila de `drop` sobre `keep`.
+        const rowDrop = state.table.get(drop);
+        if (!rowDrop)
+            continue;
+        for (const [x, target] of rowDrop) {
+            const rTarget = rep(state, target);
+            const rowKeep = state.table.get(keep);
+            if (!rowKeep)
+                continue;
+            const existing = rowKeep.get(x);
+            if (existing === undefined) {
+                rowKeep.set(x, rTarget);
+            }
+            else {
+                const rExisting = rep(state, existing);
+                if (rExisting !== rTarget) {
+                    queue.push([rExisting, rTarget]);
+                }
+            }
+        }
+        state.table.delete(drop);
+    }
+}
+// scan: recorre la palabra `w` empezando en `start`. Si en algún
+// momento llega al final, deduce τ(prev, lastLetter) = start
+// (porque la relación = 1 obliga al ciclo). Si no llega, completa
+// con cosets nuevos hacia adelante.
+function scanAndFill(state, start, w, queue) {
+    if (w.length === 0)
+        return;
+    // Caminamos desde la izquierda.
+    let left = start;
+    let leftIdx = 0;
+    while (leftIdx < w.length) {
+        const x = w[leftIdx];
+        const next = getEdge(state, left, x);
+        if (next === undefined)
+            break;
+        left = next;
+        leftIdx++;
+    }
+    if (leftIdx === w.length) {
+        // Cerramos el ciclo: τ(left, ε) ya está en start.
+        if (rep(state, left) !== rep(state, start)) {
+            queue.push([left, start]);
+            processCoincidences(state, queue);
+        }
+        return;
+    }
+    // Caminamos desde la derecha (con inversos).
+    let right = start;
+    let rightIdx = w.length;
+    while (rightIdx > leftIdx) {
+        const x = w[rightIdx - 1];
+        const xi = (0, words_1.inverse)(x);
+        const prev = getEdge(state, right, xi);
+        if (prev === undefined)
+            break;
+        right = prev;
+        rightIdx--;
+    }
+    // En este punto, izquierda y derecha solo están separadas por
+    // una porción de la palabra (leftIdx .. rightIdx).
+    if (leftIdx === rightIdx) {
+        // Se encontraron: nada que hacer salvo cerrar si no eran iguales.
+        if (rep(state, left) !== rep(state, right)) {
+            queue.push([left, right]);
+            processCoincidences(state, queue);
+        }
+        return;
+    }
+    if (leftIdx + 1 === rightIdx) {
+        // Una sola letra entre medio: deducción τ(left, w[leftIdx]) = right.
+        const x = w[leftIdx];
+        setEdge(state, left, x, right, queue);
+        processCoincidences(state, queue);
+        return;
+    }
+    // Hay >1 letras entre medio: rellenamos con nuevos cosets desde
+    // la izquierda. (HLT clásico.)
+    while (leftIdx < rightIdx - 1) {
+        if (state.next > state.maxCosets) {
+            throw new Error('MAX_COSETS');
+        }
+        const x = w[leftIdx];
+        const fresh = newCoset(state);
+        setEdge(state, left, x, fresh, queue);
+        processCoincidences(state, queue);
+        left = rep(state, fresh);
+        leftIdx++;
+    }
+    // Última conexión.
+    const x = w[leftIdx];
+    setEdge(state, left, x, right, queue);
+    processCoincidences(state, queue);
+}
+// toddCoxeter: enumera cosets de ⟨subgroupGens⟩ en ⟨S | R⟩.
+// Si subgroupGens es vacío o no se pasa, enumera el grupo.
+// Devuelve la `CosetTable` si terminó, o 'incomplete' si alcanzó
+// el cap `maxCosets`.
+function toddCoxeter(presentation, subgroupGens = [], maxCosets = 4096) {
+    const alphabet = buildAlphabet(presentation.generators);
+    const state = {
+        table: new Map(),
+        replaced: new Map(),
+        alphabet,
+        generators: [...presentation.generators],
+        relations: presentation.relations.map((r) => (0, words_1.reduceWord)(r)),
+        next: 1,
+        alive: new Set(),
+        maxCosets,
+    };
+    // Coset 1 representa H.
+    const h = newCoset(state);
+    const queue = [];
+    try {
+        // Aplicar generadores de H en el coset 1: τ(1, w) debe volver
+        // a 1 para cada w ∈ subgroupGens.
+        for (const w of subgroupGens) {
+            scanAndFill(state, h, (0, words_1.reduceWord)(w), queue);
+            processCoincidences(state, queue);
+        }
+        // Bucle principal: escanea relaciones en cada coset vivo
+        // hasta que ya no haya cambios.
+        let changed = true;
+        while (changed) {
+            changed = false;
+            const alive = [...state.alive].sort((a, b) => a - b);
+            for (const c of alive) {
+                if (!state.alive.has(c))
+                    continue;
+                // Escaneamos cada relación.
+                for (const r of state.relations) {
+                    if (r.length === 0)
+                        continue;
+                    const before = state.next;
+                    scanAndFill(state, c, r, queue);
+                    processCoincidences(state, queue);
+                    if (state.next !== before)
+                        changed = true;
+                }
+                // Y completamos las celdas vacías de este coset con
+                // cosets nuevos (definition phase de HLT).
+                if (!state.alive.has(c))
+                    continue;
+                const row = state.table.get(rep(state, c));
+                if (!row)
+                    continue;
+                for (const x of alphabet) {
+                    if (row.get(x) === undefined) {
+                        if (state.next > state.maxCosets) {
+                            throw new Error('MAX_COSETS');
+                        }
+                        const fresh = newCoset(state);
+                        setEdge(state, c, x, fresh, queue);
+                        processCoincidences(state, queue);
+                        changed = true;
+                        break; // re-escanear desde el principio
+                    }
+                }
+            }
+        }
+    }
+    catch (e) {
+        if (e instanceof Error && e.message === 'MAX_COSETS') {
+            return 'incomplete';
+        }
+        throw e;
+    }
+    // Compacta los cosets vivos a 1..N.
+    const aliveSorted = [...state.alive].sort((a, b) => a - b);
+    const remap = new Map();
+    aliveSorted.forEach((c, i) => remap.set(c, i + 1));
+    const outTable = new Map();
+    for (const c of aliveSorted) {
+        const row = state.table.get(c);
+        if (!row)
+            continue;
+        const newRow = new Map();
+        for (const [x, target] of row) {
+            const rt = rep(state, target);
+            const mapped = remap.get(rt);
+            if (mapped !== undefined)
+                newRow.set(x, mapped);
+        }
+        const mappedC = remap.get(c);
+        if (mappedC !== undefined)
+            outTable.set(mappedC, newRow);
+    }
+    return {
+        numCosets: aliveSorted.length,
+        generators: [...presentation.generators],
+        table: outTable,
+    };
+}
+// groupOrder: orden del grupo. Enumera cosets del subgrupo trivial.
+// Devuelve número finito, 'infinite' si la conjetura por
+// presentación libre es inmediata, o 'unknown' si Todd-Coxeter no
+// terminó dentro del cap.
+function groupOrder(presentation, maxCosets = 4096) {
+    // Caso trivial: ⟨ | ⟩ es el grupo libre de rango 0, orden 1.
+    if (presentation.generators.length === 0) {
+        return presentation.relations.length === 0 ? 1 : 1;
+    }
+    // Heurística simple: si todas las relaciones se reducen
+    // libremente a la palabra vacía, no aportan información y el
+    // grupo es libre F_n (infinito para n ≥ 1).
+    if (presentation.relations.every((r) => (0, words_1.reduceWord)(r).length === 0)) {
+        return 'infinite';
+    }
+    const t = toddCoxeter(presentation, [], maxCosets);
+    if (t === 'incomplete')
+        return 'unknown';
+    return t.numCosets;
+}
+// isInSubgroup: dado un Word `w` y una tabla de cosets del par
+// (G, H), decide si w ∈ H comprobando si τ(1, w) = 1.
+function isInSubgroup(word, table) {
+    const w = (0, words_1.reduceWord)(word);
+    let cur = 1;
+    for (const letter of w) {
+        const row = table.table.get(cur);
+        if (!row)
+            return false;
+        const next = row.get(letter);
+        if (next === undefined)
+            return false;
+        cur = next;
+    }
+    return cur === 1;
+}
+//# sourceMappingURL=todd-coxeter.js.map

package/dist/reasoning/group-presentation/todd-coxeter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"todd-coxeter.js","sourceRoot":"","sources":["../../../src/reasoning/group-presentation/todd-coxeter.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kCAAkC;AAClC,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,gEAAgE;AAChE,+DAA+D;AAC/D,EAAE;AACF,oEAAoE;AACpE,8DAA8D;AAC9D,oEAAoE;AACpE,kEAAkE;AAClE,2DAA2D;AAC3D,sDAAsD;AACtD,qCAAqC;AACrC,EAAE;AACF,kEAAkE;AAClE,kEAAkE;AAClE,+DAA+D;AAC/D,iEAAiE;AACjE,6CAA6C;AAC7C,EAAE;AACF,6DAA6D;AAC7D,2CAA2C;AAC3C,+DAA+D;;AA4N/D,kCA6FC;AAMD,gCAiBC;AAID,oCAWC;AA5VD,mCAA8C;AA0B9C,SAAS,aAAa,CAAC,UAAuB;IAC5C,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,CAAC,IAAI,CAAC,IAAA,eAAO,EAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8DAA8D;AAC9D,4DAA4D;AAC5D,SAAS,GAAG,CAAC,KAAY,EAAE,CAAS;IAClC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,kBAAkB;IAClB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,GAAG;YAAE,MAAM;QAClD,GAAG,GAAG,MAAM,CAAC;IACf,CAAC;IACD,oBAAoB;IACpB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,GAAG;YAAE,MAAM;QAClD,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAChC,MAAM,GAAG,MAAM,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qDAAqD;AACrD,SAAS,QAAQ,CAAC,KAAY;IAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACvB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAqB,CAAC,CAAC;IACjD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,uDAAuD;AACvD,SAAS,OAAO,CAAC,KAAY,EAAE,CAAS,EAAE,CAAY;IACpD,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG;QAAE,OAAO,SAAS,CAAC;IAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACrD,CAAC;AAED,8DAA8D;AAC9D,gEAAgE;AAChE,2BAA2B;AAC3B,SAAS,OAAO,CAAC,KAAY,EAAE,CAAS,EAAE,CAAY,EAAE,CAAS,EAAE,KAAiB;IAClF,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,IAAA,eAAO,EAAC,CAAC,CAAC,CAAC;IACtB,uBAAuB;IACvB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,EAAE,WAAW,CAAC,CAAC;IAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAChC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACd,wBAAwB;YACxB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,8DAA8D;IAChE,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IACD,yBAAyB;IACzB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,EAAE,WAAW,CAAC,CAAC;IAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACpC,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,oEAAoE;AACpE,SAAS,mBAAmB,CAAC,KAAY,EAAE,KAAiB;IAC1D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,qDAAqD;QACrD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC/B,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzB,yCAAyC;QACzC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACnC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBACvC,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;oBAC1B,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC;AAED,iEAAiE;AACjE,6DAA6D;AAC7D,kEAAkE;AAClE,oCAAoC;AACpC,SAAS,WAAW,CAAC,KAAY,EAAE,KAAa,EAAE,CAAO,EAAE,KAAiB;IAC1E,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAC3B,gCAAgC;IAChC,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,OAAO,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACrB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM;QAC9B,IAAI,GAAG,IAAI,CAAC;QACZ,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,OAAO,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACzB,kDAAkD;QAClD,IAAI,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YAC1B,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO;IACT,CAAC;IACD,6CAA6C;IAC7C,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,IAAI,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC;IACxB,OAAO,QAAQ,GAAG,OAAO,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAA,eAAO,EAAC,CAAC,CAAC,CAAC;QACtB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM;QAC9B,KAAK,GAAG,IAAI,CAAC;QACb,QAAQ,EAAE,CAAC;IACb,CAAC;IACD,8DAA8D;IAC9D,mDAAmD;IACnD,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;QACzB,kEAAkE;QAClE,IAAI,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YAC1B,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO;IACT,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC7B,qEAAqE;QACrE,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACrB,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACtC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAClC,OAAO;IACT,CAAC;IACD,gEAAgE;IAChE,+BAA+B;IAC/B,OAAO,OAAO,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACtC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,mBAAmB;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IACrB,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACtC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AACpC,CAAC;AAED,4DAA4D;AAC5D,2DAA2D;AAC3D,iEAAiE;AACjE,sBAAsB;AACtB,SAAgB,WAAW,CACzB,YAA+B,EAC/B,eAAuB,EAAE,EACzB,SAAS,GAAG,IAAI;IAEhB,MAAM,QAAQ,GAAG,aAAa,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;IACxD,MAAM,KAAK,GAAU;QACnB,KAAK,EAAE,IAAI,GAAG,EAAkC;QAChD,QAAQ,EAAE,IAAI,GAAG,EAAkB;QACnC,QAAQ;QACR,UAAU,EAAE,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC;QACxC,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,CAAC;QAC3D,IAAI,EAAE,CAAC;QACP,KAAK,EAAE,IAAI,GAAG,EAAU;QACxB,SAAS;KACV,CAAC;IACF,wBAAwB;IACxB,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,IAAI,CAAC;QACH,8DAA8D;QAC9D,kCAAkC;QAClC,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAA,kBAAU,EAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC5C,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QAED,yDAAyD;QACzD,gCAAgC;QAChC,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;YAChB,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAClC,4BAA4B;gBAC5B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;oBAChC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;wBAAE,SAAS;oBAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;oBAC1B,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;oBAChC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;oBAClC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;wBAAE,OAAO,GAAG,IAAI,CAAC;gBAC5C,CAAC;gBACD,oDAAoD;gBACpD,2CAA2C;gBAC3C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAClC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;oBACzB,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;wBAC7B,IAAI,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;4BACjC,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;wBAChC,CAAC;wBACD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;wBAC9B,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;wBACnC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;wBAClC,OAAO,GAAG,IAAI,CAAC;wBACf,MAAM,CAAC,iCAAiC;oBAC1C,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,YAAY,EAAE,CAAC;YACrD,OAAO,YAAY,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,CAAC;IACV,CAAC;IAED,oCAAoC;IACpC,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkC,CAAC;IAC3D,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC5C,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,MAAM,KAAK,SAAS;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,OAAO,KAAK,SAAS;YAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED,OAAO;QACL,SAAS,EAAE,WAAW,CAAC,MAAM;QAC7B,UAAU,EAAE,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC;QACxC,KAAK,EAAE,QAAQ;KAChB,CAAC;AACJ,CAAC;AAED,oEAAoE;AACpE,yDAAyD;AACzD,kEAAkE;AAClE,0BAA0B;AAC1B,SAAgB,UAAU,CACxB,YAA+B,EAC/B,SAAS,GAAG,IAAI;IAEhB,6DAA6D;IAC7D,IAAI,YAAY,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,YAAY,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,wDAAwD;IACxD,6DAA6D;IAC7D,4CAA4C;IAC5C,IAAI,YAAY,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QACpE,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,MAAM,CAAC,GAAG,WAAW,CAAC,YAAY,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IACnD,IAAI,CAAC,KAAK,YAAY;QAAE,OAAO,SAAS,CAAC;IACzC,OAAO,CAAC,CAAC,SAAS,CAAC;AACrB,CAAC;AAED,+DAA+D;AAC/D,sDAAsD;AACtD,SAAgB,YAAY,CAAC,IAAU,EAAE,KAAiB;IACxD,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QACvB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACrC,GAAG,GAAG,IAAI,CAAC;IACb,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,CAAC;AACnB,CAAC"}

package/dist/reasoning/group-presentation/types.d.ts

@@ -0,0 +1,7 @@
+export type Generator = string;
+export type Word = Generator[];
+export interface GroupPresentation {
+    generators: Generator[];
+    relations: Word[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/reasoning/group-presentation/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/reasoning/group-presentation/types.ts"],"names":[],"mappings":"AAoBA,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAC/B,MAAM,MAAM,IAAI,GAAG,SAAS,EAAE,CAAC;AAE/B,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,SAAS,EAAE,IAAI,EAAE,CAAC;CACnB"}

package/dist/reasoning/group-presentation/types.js

@@ -0,0 +1,22 @@
+"use strict";
+// ============================================================
+// Tipos para presentaciones finitas de grupos ⟨S | R⟩.
+// ============================================================
+//
+// Un generador es un símbolo alfanumérico de un caracter. Su
+// inverso se representa intercambiando mayúscula/minúscula:
+//   'a'  ↔ 'A'         'r' ↔ 'R'
+// Esta convención (clásica en cómputo combinatorio de grupos)
+// hace que palabras sobre el alfabeto libre F(S) sean strings o
+// arrays cortos y la operación "inverso de letra" sea barata.
+//
+// Una `Word` es una secuencia ordenada de letras (generadores o
+// sus inversos). La palabra vacía `[]` representa el neutro `1`.
+//
+// Una `GroupPresentation` `⟨S | R⟩` consta de los generadores S
+// y un conjunto de relaciones R, donde cada relación r ∈ R es
+// una palabra que se interpreta como `r = 1` en el grupo cociente
+// F(S)/⟪R⟫.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/reasoning/group-presentation/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/reasoning/group-presentation/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,4DAA4D;AAC5D,iCAAiC;AACjC,8DAA8D;AAC9D,gEAAgE;AAChE,8DAA8D;AAC9D,EAAE;AACF,gEAAgE;AAChE,iEAAiE;AACjE,EAAE;AACF,gEAAgE;AAChE,8DAA8D;AAC9D,kEAAkE;AAClE,YAAY;AACZ,+DAA+D"}

package/dist/reasoning/group-presentation/words.d.ts

@@ -0,0 +1,10 @@
+import type { Generator, Word } from './types';
+export declare function inverse(g: Generator): Generator;
+export declare function reduceWord(w: Word): Word;
+export declare function multiplyWords(a: Word, b: Word): Word;
+export declare function invertWord(w: Word): Word;
+export declare function wordEquals(a: Word, b: Word): boolean;
+export declare function isReduced(w: Word): boolean;
+export declare function parseWord(s: string): Word;
+export declare function wordToString(w: Word): string;
+//# sourceMappingURL=words.d.ts.map

package/dist/reasoning/group-presentation/words.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"words.d.ts","sourceRoot":"","sources":["../../../src/reasoning/group-presentation/words.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAK/C,wBAAgB,OAAO,CAAC,CAAC,EAAE,SAAS,GAAG,SAAS,CAU/C;AAKD,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAWxC;AAID,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAEpD;AAGD,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAMxC;AAID,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAMpD;AAGD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAc1C;AAID,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAMzC;AAGD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAE5C"}

package/dist/reasoning/group-presentation/words.js

@@ -0,0 +1,109 @@
+"use strict";
+// ============================================================
+// Aritmética del grupo libre F(S) sobre palabras.
+// ============================================================
+//
+// Convención de inversos: letras a-z son generadores positivos;
+// A-Z son sus inversos. `inverse('a') === 'A'` y viceversa. Para
+// símbolos fuera de a-zA-Z (uso interno opcional), se asume que
+// el caller pasa pares (g, g⁻¹) ya emparejados — pero las APIs
+// públicas estándar (cyclic/dihedral/free/symmetric) viven en
+// el alfabeto a-z/A-Z.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inverse = inverse;
+exports.reduceWord = reduceWord;
+exports.multiplyWords = multiplyWords;
+exports.invertWord = invertWord;
+exports.wordEquals = wordEquals;
+exports.isReduced = isReduced;
+exports.parseWord = parseWord;
+exports.wordToString = wordToString;
+// inverse: invierte una letra (cambia caja). Lanza si no es una
+// letra alfabética ASCII de un caracter, porque eso indica error
+// del caller (las APIs expuestas siempre usan letras simples).
+function inverse(g) {
+    if (g.length !== 1) {
+        throw new Error(`inverse: se esperaba letra de 1 caracter, recibí "${g}"`);
+    }
+    const code = g.charCodeAt(0);
+    // a..z
+    if (code >= 97 && code <= 122)
+        return String.fromCharCode(code - 32);
+    // A..Z
+    if (code >= 65 && code <= 90)
+        return String.fromCharCode(code + 32);
+    throw new Error(`inverse: letra no alfabética ASCII: "${g}"`);
+}
+// reduceWord: reducción libre. Cancela pares adyacentes `x x⁻¹`.
+// Implementación O(n) con pila: lee secuencialmente y colapsa
+// con el tope si se anulan. Idempotente.
+function reduceWord(w) {
+    const stack = [];
+    for (const letter of w) {
+        const top = stack[stack.length - 1];
+        if (top !== undefined && top === inverse(letter)) {
+            stack.pop();
+        }
+        else {
+            stack.push(letter);
+        }
+    }
+    return stack;
+}
+// multiplyWords: concatena y reduce. La multiplicación en F(S)
+// es la concatenación módulo cancelación libre.
+function multiplyWords(a, b) {
+    return reduceWord([...a, ...b]);
+}
+// invertWord: w = x1 x2 ... xn ⇒ w⁻¹ = xn⁻¹ ... x1⁻¹.
+function invertWord(w) {
+    const out = [];
+    for (let i = w.length - 1; i >= 0; i--) {
+        out.push(inverse(w[i]));
+    }
+    return out;
+}
+// wordEquals: igualdad sintáctica (no semántica módulo relaciones).
+// Para igualdad módulo relaciones hay que pasar por Todd-Coxeter.
+function wordEquals(a, b) {
+    if (a.length !== b.length)
+        return false;
+    for (let i = 0; i < a.length; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+// isReduced: true si no hay cancelaciones libres pendientes.
+function isReduced(w) {
+    for (let i = 0; i < w.length - 1; i++) {
+        const a = w[i];
+        const b = w[i + 1];
+        if (a.length === 1 && b.length === 1) {
+            try {
+                if (inverse(a) === b)
+                    return false;
+            }
+            catch {
+                // Si la letra no es alfabética simple, no podemos
+                // verificar cancelación con inverse; asumimos reducido.
+            }
+        }
+    }
+    return true;
+}
+// parseWord: convierte un string como "abAb" en ['a','b','A','b'].
+// Útil para tests legibles. Acepta solo caracteres ASCII letra.
+function parseWord(s) {
+    const out = [];
+    for (const ch of s) {
+        out.push(ch);
+    }
+    return out;
+}
+// wordToString: inversa de parseWord. La palabra vacía → "1".
+function wordToString(w) {
+    return w.length === 0 ? '1' : w.join('');
+}
+//# sourceMappingURL=words.js.map

package/dist/reasoning/group-presentation/words.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"words.js","sourceRoot":"","sources":["../../../src/reasoning/group-presentation/words.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kDAAkD;AAClD,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,iEAAiE;AACjE,gEAAgE;AAChE,+DAA+D;AAC/D,8DAA8D;AAC9D,uBAAuB;AACvB,+DAA+D;;AAO/D,0BAUC;AAKD,gCAWC;AAID,sCAEC;AAGD,gCAMC;AAID,gCAMC;AAGD,8BAcC;AAID,8BAMC;AAGD,oCAEC;AAtFD,gEAAgE;AAChE,iEAAiE;AACjE,+DAA+D;AAC/D,SAAgB,OAAO,CAAC,CAAY;IAClC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,GAAG,CAAC,CAAC;IAC7E,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,OAAO;IACP,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG;QAAE,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;IACrE,OAAO;IACP,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE;QAAE,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;IACpE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,GAAG,CAAC,CAAC;AAChE,CAAC;AAED,iEAAiE;AACjE,8DAA8D;AAC9D,yCAAyC;AACzC,SAAgB,UAAU,CAAC,CAAO;IAChC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjD,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+DAA+D;AAC/D,gDAAgD;AAChD,SAAgB,aAAa,CAAC,CAAO,EAAE,CAAO;IAC5C,OAAO,UAAU,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,sDAAsD;AACtD,SAAgB,UAAU,CAAC,CAAO;IAChC,MAAM,GAAG,GAAS,EAAE,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,oEAAoE;AACpE,kEAAkE;AAClE,SAAgB,UAAU,CAAC,CAAO,EAAE,CAAO;IACzC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6DAA6D;AAC7D,SAAgB,SAAS,CAAC,CAAO;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC;gBACH,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;YACrC,CAAC;YAAC,MAAM,CAAC;gBACP,kDAAkD;gBAClD,wDAAwD;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,mEAAmE;AACnE,gEAAgE;AAChE,SAAgB,SAAS,CAAC,CAAS;IACjC,MAAM,GAAG,GAAS,EAAE,CAAC;IACrB,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QACnB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8DAA8D;AAC9D,SAAgB,YAAY,CAAC,CAAO;IAClC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC3C,CAAC"}

package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.d.ts

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

package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.d.ts.map

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