@atlasauth/pca-mpc 0.0.0-stage → 0.2.0

package/dist/ec.js

@@ -0,0 +1,475 @@
+"use strict";
+/**
+ * A small, self-contained prime-order elliptic-curve group, used by the base oblivious transfer in
+ * `ot.ts`. The no-dealer offline phase (MASCOT-style triple generation) rests on real OT, and real OT
+ * rests on a real group with a hard discrete log — this module provides that group with nothing but
+ * BigInt arithmetic, so the whole stack stays dependency-free and testable in-process.
+ *
+ * Curve: **Ed25519** (twisted Edwards `−x² + y² = 1 + d·x²·y²` over `F_q`, `q = 2^255 − 19`). We work
+ * exclusively in the prime-order subgroup of order `L = 2^252 + 27742317777372353535851937790883648493`
+ * generated by the standard base point `B`, keeping every scalar in `[0, L)`; all group elements we
+ * ever form are scalar multiples of subgroup points, so they stay in the subgroup. Points are held in
+ * **extended coordinates** `(X, Y, Z, T)` with `x = X/Z`, `y = Y/Z`, `T = XY/Z`, and combined with the
+ * unified ("hwcd-3") addition law, which is *complete* on the subgroup — there are no special cases to
+ * branch on, which is exactly what keeps the implementation free of the subtle point-at-infinity bugs
+ * that plague short-Weierstrass code.
+ *
+ * SECURITY NOTES (prototype honesty, mirrored in docs §7.1):
+ *  - **Point validation IS implemented** (`isOnCurve` / `hasPrimeOrder` / `assertInSubgroup`): every
+ *    point a party RECEIVES across the OT trust boundary is validated to be on the curve and in the
+ *    prime-order subgroup (cofactor check `[L]·P = O`), and non-identity, so a malicious party cannot
+ *    inject an off-curve / small-order / mixed-order point to mount a small-subgroup attack. A
+ *    `schnorrProve`/`schnorrVerify` NIZK of knowledge of the sender's discrete log `y` (`S = y·B`)
+ *    binds `S` to a known exponent, which — with validation — is what makes the base OT malicious-secure.
+ *  - **Constant-time: the secret-scalar multiplications now run in a constant-time WASM core by
+ *    DEFAULT.** BigInt modular arithmetic branches on operand size and is not constant-time; rather than
+ *    pretend otherwise, the security-critical ops (every secret-scalar multiply/point-combine: `mulBase`,
+ *    `mul`, `add`, `sub`, `neg`, and the `[L]·P` cofactor ladder) are routed through `@atlasauth/pca-mpc-wasm`
+ *    (a `curve25519-dalek` core compiled to WebAssembly) whenever it loads, which is the default. The
+ *    pure-BigInt path below is retained verbatim as a graceful fallback for when the WASM core is
+ *    unavailable, and is proven byte-for-byte equivalent to it (see the backend section and
+ *    `ec-wasm.test.ts`). The remaining BigInt marshalling (point compress/decompress) operates on
+ *    public point values, never the secret scalar, and is not claimed constant-time (docs §7.1).
+ *  - Discrete log in the order-`L` subgroup is the hardness the OT's receiver-choice privacy relies on.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PointValidationError = exports.BASE = exports.IDENTITY = exports.L = exports.Q = void 0;
+exports.modFq = modFq;
+exports.dbl = dbl;
+exports.isWasmCurveActive = isWasmCurveActive;
+exports.compressPoint = compressPoint;
+exports.decompressPoint = decompressPoint;
+exports.add = add;
+exports.mul = mul;
+exports.mulBase = mulBase;
+exports.sub = sub;
+exports.neg = neg;
+exports.toAffine = toAffine;
+exports.equal = equal;
+exports.encodePoint = encodePoint;
+exports.isOnCurve = isOnCurve;
+exports.isIdentity = isIdentity;
+exports.hasPrimeOrder = hasPrimeOrder;
+exports.isInSubgroup = isInSubgroup;
+exports.assertInSubgroup = assertInSubgroup;
+exports.schnorrProve = schnorrProve;
+exports.schnorrVerify = schnorrVerify;
+const node_crypto_1 = require("node:crypto");
+const node_module_1 = require("node:module");
+const node_path_1 = require("node:path");
+/** Field prime q = 2^255 − 19. */
+exports.Q = 2n ** 255n - 19n;
+/** Prime order of the base-point subgroup. Scalars live in [0, L). */
+exports.L = 2n ** 252n + 27742317777372353535851937790883648493n;
+// d = −121665 / 121666 (mod q).
+const D = modFq(-121665n * invFq(121666n));
+// √(−1) mod q = 2^((q−1)/4) (used by the point decompression that round-trips the WASM core's
+// canonical 32-byte compressed encoding back into an extended-coordinate `Point`).
+const SQRT_M1 = powFq(2n, (exports.Q - 1n) / 4n);
+/** The identity (neutral) element, affine (0, 1). */
+exports.IDENTITY = { X: 0n, Y: 1n, Z: 1n, T: 0n };
+/** The standard Ed25519 base point B (a generator of the order-L subgroup). */
+exports.BASE = fromAffine(15112221349535400772501151409588531511454012693041857206046113283949847762202n, 46316835694926478169428394003475163141307993866256225615783033603165251855960n);
+/** Canonical representative in [0, q). */
+function modFq(x) {
+    const r = x % exports.Q;
+    return r >= 0n ? r : r + exports.Q;
+}
+/** Modular inverse in F_q via Fermat (q prime): a^(q−2). */
+function invFq(a) {
+    return powFq(modFq(a), exports.Q - 2n);
+}
+function powFq(base, exp) {
+    let b = modFq(base);
+    let e = exp;
+    let acc = 1n;
+    while (e > 0n) {
+        if (e & 1n)
+            acc = (acc * b) % exports.Q;
+        b = (b * b) % exports.Q;
+        e >>= 1n;
+    }
+    return acc;
+}
+function fromAffine(x, y) {
+    const X = modFq(x);
+    const Y = modFq(y);
+    return { X, Y, Z: 1n, T: modFq(X * Y) };
+}
+/**
+ * Unified complete addition (twisted Edwards a=−1, "add-2008-hwcd-3"). Works for P=Q too (so doubling
+ * is just `add(P, P)`), and is complete on the prime-order subgroup — no exceptional cases.
+ */
+function addPure(p1, p2) {
+    const A = (modFq(p1.Y - p1.X) * modFq(p2.Y - p2.X)) % exports.Q;
+    const B = (modFq(p1.Y + p1.X) * modFq(p2.Y + p2.X)) % exports.Q;
+    const C = (((p1.T * 2n) % exports.Q) * D % exports.Q) * p2.T % exports.Q;
+    const Dd = (((p1.Z * 2n) % exports.Q) * p2.Z) % exports.Q;
+    const E = modFq(B - A);
+    const F = modFq(Dd - C);
+    const G = modFq(Dd + C);
+    const H = modFq(B + A);
+    return {
+        X: (E * F) % exports.Q,
+        Y: (G * H) % exports.Q,
+        T: (E * H) % exports.Q,
+        Z: (F * G) % exports.Q,
+    };
+}
+/**
+ * Dedicated doubling (twisted Edwards a=−1, "dbl-2008-hwcd") — cheaper than the unified add, used to
+ * speed up the scalar ladder. Complete on the subgroup.
+ */
+function dbl(p) {
+    const A = (p.X * p.X) % exports.Q;
+    const B = (p.Y * p.Y) % exports.Q;
+    const C = (2n * ((p.Z * p.Z) % exports.Q)) % exports.Q;
+    const Dd = modFq(-A); // a·A with a = −1
+    const s = modFq(p.X + p.Y);
+    const E = modFq((s * s) % exports.Q - A - B);
+    const G = modFq(Dd + B);
+    const F = modFq(G - C);
+    const H = modFq(Dd - B);
+    return {
+        X: (E * F) % exports.Q,
+        Y: (G * H) % exports.Q,
+        T: (E * H) % exports.Q,
+        Z: (F * G) % exports.Q,
+    };
+}
+/** Scalar multiplication [k]P (double-and-add), pure-BigInt. k is reduced mod L; k=0 ⇒ identity. */
+function mulPure(k, p) {
+    let e = k % exports.L;
+    if (e < 0n)
+        e += exports.L;
+    let acc = exports.IDENTITY;
+    let base = p;
+    while (e > 0n) {
+        if (e & 1n)
+            acc = addPure(acc, base);
+        base = dbl(base);
+        e >>= 1n;
+    }
+    return acc;
+}
+/** [k]·BASE, pure-BigInt. */
+function mulBasePure(k) {
+    return mulPure(k, exports.BASE);
+}
+/** P − Q, pure-BigInt. */
+function subPure(p1, p2) {
+    return addPure(p1, negPure(p2));
+}
+/** −P = (−X : Y : Z : −T), pure-BigInt. */
+function negPure(p) {
+    return { X: modFq(-p.X), Y: p.Y, Z: p.Z, T: modFq(-p.T) };
+}
+/** `undefined` = not yet probed; `null` = probed and unavailable (use the pure fallback). */
+let wasmBackend;
+/** Narrow an opaque module to the `WasmCurve` surface without using `any` — every op must be present. */
+function asWasmCurve(mod) {
+    if (typeof mod !== 'object' || mod === null)
+        return null;
+    const m = mod;
+    const needed = ['mulBase', 'mul', 'add', 'sub', 'neg', 'isOnCurve', 'isIdentity', 'isInSubgroup'];
+    for (const name of needed) {
+        if (typeof m[name] !== 'function')
+            return null;
+    }
+    return mod;
+}
+/**
+ * Lazily load the constant-time WASM curve core, once. Tries the resolved workspace dependency first,
+ * then the sibling package's built `dist` (the stable path whether this module runs from `src` under
+ * vitest or from `dist` after a build — `__dirname/../../pca-mpc-wasm/dist` is the same in both). Any
+ * failure (package missing, wasm cannot instantiate) is swallowed and pins the pure-BigInt fallback.
+ */
+function wasmCurve() {
+    if (wasmBackend !== undefined)
+        return wasmBackend;
+    wasmBackend = null;
+    try {
+        const require = (0, node_module_1.createRequire)(__filename);
+        const candidates = [
+            '@atlasauth/pca-mpc-wasm',
+            (0, node_path_1.join)(__dirname, '..', '..', 'pca-mpc-wasm', 'dist', 'index.js'),
+        ];
+        for (const spec of candidates) {
+            try {
+                const loaded = asWasmCurve(require(spec));
+                if (loaded !== null) {
+                    wasmBackend = loaded;
+                    break;
+                }
+            }
+            catch {
+                // try the next candidate
+            }
+        }
+    }
+    catch {
+        wasmBackend = null;
+    }
+    return wasmBackend;
+}
+/** Whether the constant-time WASM curve backend is active (else the pure-BigInt path is in use). */
+function isWasmCurveActive() {
+    return wasmCurve() !== null;
+}
+/**
+ * Canonical 32-byte compressed Ed25519 encoding of a point (little-endian `y`, sign of `x` in bit 255)
+ * — the wire form the WASM core speaks. Faithful for on-curve points; the matching inverse is
+ * `decompressPoint`.
+ */
+function compressPoint(p) {
+    const { x, y } = toAffine(p);
+    const out = feBytes(y);
+    out[31] = (out[31] | (Number(x & 1n) << 7)) & 0xff;
+    return out;
+}
+/**
+ * Decode a canonical 32-byte compressed encoding back into an extended-coordinate `Point` (RFC 8032
+ * §5.1.3 x-recovery). Used to bring a WASM-core result back into the `Point` representation so the rest
+ * of `ec.ts`/`ot.ts` (affine encoding, KDF hashing, equality) sees byte-identical values to the pure
+ * path. Throws `PointValidationError` on a non-canonical / off-curve encoding.
+ */
+function decompressPoint(bytes) {
+    if (bytes.length !== 32)
+        throw new PointValidationError('decompressPoint: expected 32 bytes');
+    const sign = (bytes[31] >> 7) & 1;
+    let y = 0n;
+    for (let i = 0; i < 32; i++)
+        y |= BigInt(bytes[i]) << BigInt(8 * i);
+    y &= (1n << 255n) - 1n; // clear the sign bit
+    if (y >= exports.Q)
+        throw new PointValidationError('decompressPoint: non-canonical y (≥ q)');
+    const y2 = modFq(y * y);
+    const u = modFq(y2 - 1n);
+    const v = modFq(D * y2 + 1n);
+    const v3 = modFq(modFq(v * v) * v);
+    const v7 = modFq(modFq(v3 * v3) * v);
+    let x = modFq(modFq(u * v3) * powFq(modFq(u * v7), (exports.Q - 5n) / 8n));
+    const vx2 = modFq(v * modFq(x * x));
+    if (vx2 === modFq(u)) {
+        // x is correct as-is
+    }
+    else if (vx2 === modFq(-u)) {
+        x = modFq(x * SQRT_M1);
+    }
+    else {
+        throw new PointValidationError('decompressPoint: not on curve');
+    }
+    if (x === 0n && sign === 1)
+        throw new PointValidationError('decompressPoint: non-canonical sign');
+    if (Number(x & 1n) !== sign)
+        x = modFq(exports.Q - x);
+    return fromAffine(x, y);
+}
+// --- Public group-op dispatchers: constant-time WASM core when loaded, pure BigInt otherwise. ---
+/**
+ * Unified complete addition P + Q. Routes through the constant-time WASM core when available (inputs
+ * are on-curve points everywhere the OT stack calls this), else the pure-BigInt `add-2008-hwcd-3`.
+ */
+function add(p1, p2) {
+    const w = wasmCurve();
+    if (w !== null)
+        return decompressPoint(w.add(compressPoint(p1), compressPoint(p2)));
+    return addPure(p1, p2);
+}
+/** Scalar multiplication [k]P (k reduced mod L; k=0 ⇒ identity). WASM core when available. */
+function mul(k, p) {
+    const w = wasmCurve();
+    if (w !== null)
+        return decompressPoint(w.mul(k, compressPoint(p)));
+    return mulPure(k, p);
+}
+/** [k]·BASE. WASM core when available (the fixed-base secret-scalar multiply). */
+function mulBase(k) {
+    const w = wasmCurve();
+    if (w !== null)
+        return decompressPoint(w.mulBase(k));
+    return mulBasePure(k);
+}
+/** P − Q. WASM core when available. */
+function sub(p1, p2) {
+    const w = wasmCurve();
+    if (w !== null)
+        return decompressPoint(w.sub(compressPoint(p1), compressPoint(p2)));
+    return subPure(p1, p2);
+}
+/** −P. WASM core when available. */
+function neg(p) {
+    const w = wasmCurve();
+    if (w !== null)
+        return decompressPoint(w.neg(compressPoint(p)));
+    return negPure(p);
+}
+/** Affine (x, y) of a point (one inversion). Identity ⇒ (0, 1). */
+function toAffine(p) {
+    const zinv = invFq(p.Z);
+    return { x: modFq(p.X * zinv), y: modFq(p.Y * zinv) };
+}
+/** Whether two points are equal as group elements (compare in affine). */
+function equal(p1, p2) {
+    // X1*Z2 == X2*Z1 and Y1*Z2 == Y2*Z1 (projective equality, no inversion).
+    return (modFq(p1.X * p2.Z) === modFq(p2.X * p1.Z) && modFq(p1.Y * p2.Z) === modFq(p2.Y * p1.Z));
+}
+/** 32-byte little-endian encoding of a field element (for hashing points deterministically). */
+function feBytes(a) {
+    const out = new Uint8Array(32);
+    let v = modFq(a);
+    for (let i = 0; i < 32; i++) {
+        out[i] = Number(v & 0xffn);
+        v >>= 8n;
+    }
+    return out;
+}
+/** Canonical 64-byte encoding of a point (affine x‖y), the input to the OT key-derivation hash. */
+function encodePoint(p) {
+    const { x, y } = toAffine(p);
+    const out = new Uint8Array(64);
+    out.set(feBytes(x), 0);
+    out.set(feBytes(y), 32);
+    return out;
+}
+// ==================================================================================================
+// POINT VALIDATION (malicious-security hardening, docs §7.1 item b).
+//
+// A party must never trust a group element received from a (possibly malicious) peer. Three checks
+// together reject every point that could enable a small-subgroup / invalid-curve attack:
+//   (1) on-curve:   the extended coordinates satisfy the twisted-Edwards equation (and the T-invariant),
+//   (2) subgroup:   [L]·P = O, the cofactor check — rejects small-order (order | 8) AND mixed-order
+//                   points, so only genuine order-L (prime-order subgroup) points survive,
+//   (3) non-identity where the protocol forbids it (S = y·B with y = 0, or a degenerate R).
+// These are wired into every OT point decode in `ot.ts`.
+// ==================================================================================================
+/** Raised when a received point fails on-curve / subgroup / identity validation. */
+class PointValidationError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'PointValidationError';
+    }
+}
+exports.PointValidationError = PointValidationError;
+/**
+ * Scalar multiplication `[k]·P` WITHOUT the mod-L reduction that `mul` applies. `mul` reduces `k mod L`
+ * (correct for subgroup scalars, but it would turn `[L]·P` into `[0]·P = O` for every P and so cannot
+ * test subgroup membership). This raw ladder is used only by `hasPrimeOrder`.
+ */
+function scalarMulRaw(k, p) {
+    let e = k < 0n ? -k : k;
+    let acc = exports.IDENTITY;
+    let base = p;
+    while (e > 0n) {
+        if (e & 1n)
+            acc = addPure(acc, base);
+        base = dbl(base);
+        e >>= 1n;
+    }
+    return acc;
+}
+/**
+ * Whether `p`'s extended coordinates lie on the Ed25519 curve. Checks projectively (no inversion):
+ *   - `Z ≠ 0` (a valid projective point),
+ *   - the T-invariant `T·Z ≡ X·Y`,
+ *   - the twisted-Edwards equation (`a = −1`) cleared of denominators: `(Y² − X²)·Z² ≡ Z⁴ + d·X²·Y²`.
+ * An off-curve / malformed point fails here before any scalar work.
+ */
+function isOnCurve(p) {
+    if (modFq(p.Z) === 0n)
+        return false;
+    if (modFq(p.T * p.Z) !== modFq(p.X * p.Y))
+        return false;
+    const X2 = modFq(p.X * p.X);
+    const Y2 = modFq(p.Y * p.Y);
+    const Z2 = modFq(p.Z * p.Z);
+    const lhs = modFq((Y2 - X2) * Z2);
+    const Z4 = modFq(Z2 * Z2);
+    const dxy = modFq(modFq(D * X2) * Y2);
+    const rhs = modFq(Z4 + dxy);
+    return lhs === rhs;
+}
+/** Whether `p` is the identity (neutral) element (affine `(0, 1)`). */
+function isIdentity(p) {
+    return equal(p, exports.IDENTITY);
+}
+/**
+ * The cofactor check: whether `[L]·P = O`, i.e. `p` lies in the prime-order-`L` subgroup. For an
+ * on-curve point this is true iff `p` has order dividing `L`; since `L` is prime this means order `1`
+ * (identity) or order `L`. So on-curve ∧ `hasPrimeOrder` ∧ ¬identity ⟺ a genuine prime-order point.
+ * Rejects every small-order point (order | 8) and every mixed-order point (order `h·L`, `h | 8`, `h>1`).
+ */
+function hasPrimeOrderPure(p) {
+    return equal(scalarMulRaw(exports.L, p), exports.IDENTITY);
+}
+/**
+ * The cofactor check `[L]·P = O`. When the constant-time WASM core is loaded, the `[L]·P` scalar work
+ * runs inside it (the point is compressed to its canonical 32-byte form — faithful for ON-curve points,
+ * which is the only case this is reached with in the validation flow — and the core's torsion check is
+ * exactly `[L]·P = O`); otherwise it falls back to the pure-BigInt raw ladder. Both agree bit-for-bit
+ * (the `[L]·P = O ⟺ torsion-free ∨ identity` equivalence), so the observable result is identical.
+ */
+function hasPrimeOrder(p) {
+    const w = wasmCurve();
+    if (w !== null && isOnCurve(p)) {
+        const c = compressPoint(p);
+        // torsion-free ⟺ order 1 or L; include the identity explicitly so this matches the pure
+        // `[L]·O = O ⇒ true` semantics (the pure ladder returns true for the identity too).
+        return w.isInSubgroup(c) || w.isIdentity(c);
+    }
+    return hasPrimeOrderPure(p);
+}
+/** Whether `p` is a valid non-identity point of the prime-order subgroup (the OT point contract). */
+function isInSubgroup(p) {
+    return isOnCurve(p) && !isIdentity(p) && hasPrimeOrder(p);
+}
+/** Assert `p` is a valid non-identity prime-order-subgroup point, else throw `PointValidationError`. */
+function assertInSubgroup(p, label = 'point') {
+    if (!isOnCurve(p))
+        throw new PointValidationError(`${label}: not on curve`);
+    if (isIdentity(p))
+        throw new PointValidationError(`${label}: identity element (forbidden here)`);
+    if (!hasPrimeOrder(p)) {
+        throw new PointValidationError(`${label}: not in the prime-order subgroup (small-order/cofactor)`);
+    }
+}
+const TAG_SCHNORR = new TextEncoder().encode('atlas-pca-mpc/schnorr-dlog');
+/** Fiat–Shamir challenge `e = H(tag ‖ B ‖ S ‖ U) mod L` (64 hash bytes ⇒ negligible modular bias). */
+function schnorrChallenge(S, U) {
+    const d = (0, node_crypto_1.createHash)('sha512')
+        .update(TAG_SCHNORR)
+        .update(encodePoint(exports.BASE))
+        .update(encodePoint(S))
+        .update(encodePoint(U))
+        .digest();
+    let acc = 0n;
+    for (const b of d)
+        acc = (acc << 8n) | BigInt(b);
+    return acc % exports.L;
+}
+/** Prove knowledge of `y` with `S = y·B`. `rnd` draws the (secret) nonce `r ∈ [1, L)`. */
+function schnorrProve(y, S, rnd) {
+    // The nonce must be a non-zero subgroup scalar; `rnd` already draws from [1, L), the guard is belt-and-braces.
+    let r = ((rnd() % exports.L) + exports.L) % exports.L;
+    if (r === 0n)
+        r = 1n;
+    const U = mulBase(r);
+    const e = schnorrChallenge(S, U);
+    let z = (r + e * (((y % exports.L) + exports.L) % exports.L)) % exports.L;
+    if (z < 0n)
+        z += exports.L;
+    return { U, z };
+}
+/**
+ * Verify a Schnorr proof for `S`: `z` is in range, `U` is a valid subgroup point, and `z·B = U + e·S`
+ * for the recomputed challenge `e`. Returns false on any failure (the OT layer turns that into an abort).
+ */
+function schnorrVerify(S, proof) {
+    if (proof.z < 0n || proof.z >= exports.L)
+        return false;
+    if (!isInSubgroup(proof.U))
+        return false;
+    const e = schnorrChallenge(S, proof.U);
+    return equal(mulBase(proof.z), add(proof.U, mul(e, S)));
+}
+//# sourceMappingURL=ec.js.map

package/dist/ec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ec.js","sourceRoot":"","sources":["../src/ec.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;;;AAqCH,sBAGC;AAkDD,kBAgBC;AAiHD,8CAEC;AAOD,sCAKC;AAQD,0CAwBC;AAQD,kBAIC;AAGD,kBAIC;AAGD,0BAIC;AAGD,kBAIC;AAGD,kBAIC;AAGD,4BAGC;AAGD,sBAKC;AAcD,kCAMC;AA8CD,8BAWC;AAGD,gCAEC;AAmBD,sCASC;AAGD,oCAEC;AAGD,4CAMC;AAiCD,oCASC;AAMD,sCAKC;AA9eD,6CAAyC;AACzC,6CAA4C;AAC5C,yCAAiC;AAEjC,kCAAkC;AACrB,QAAA,CAAC,GAAG,EAAE,IAAI,IAAI,GAAG,GAAG,CAAC;AAElC,sEAAsE;AACzD,QAAA,CAAC,GAAG,EAAE,IAAI,IAAI,GAAG,uCAAuC,CAAC;AAEtE,gCAAgC;AAChC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;AAE3C,8FAA8F;AAC9F,mFAAmF;AACnF,MAAM,OAAO,GAAG,KAAK,CAAC,EAAE,EAAE,CAAC,SAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAUzC,qDAAqD;AACxC,QAAA,QAAQ,GAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;AAE9D,+EAA+E;AAClE,QAAA,IAAI,GAAU,UAAU,CACnC,8EAA8E,EAC9E,8EAA8E,CAC/E,CAAC;AAEF,0CAA0C;AAC1C,SAAgB,KAAK,CAAC,CAAS;IAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,SAAC,CAAC;IAChB,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC;AAC7B,CAAC;AAED,4DAA4D;AAC5D,SAAS,KAAK,CAAC,CAAS;IACtB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAC,GAAG,EAAE,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,KAAK,CAAC,IAAY,EAAE,GAAW;IACtC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,GAAG,CAAC;IACZ,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC;QACd,IAAI,CAAC,GAAG,EAAE;YAAE,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAC,CAAC;QAChC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC,CAAC;QAChB,CAAC,KAAK,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACnB,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,EAAS,EAAE,EAAS;IACnC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC;IACxD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC;IACxD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,SAAC,CAAC,GAAG,CAAC,GAAG,SAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,SAAC,CAAC;IACjD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,SAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC;IAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,OAAO;QACL,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;QACd,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;QACd,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;QACd,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;KACf,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,GAAG,CAAC,CAAQ;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC,CAAC,GAAG,SAAC,CAAC;IACvC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB;IACxC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACxB,OAAO;QACL,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;QACd,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;QACd,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;QACd,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAC;KACf,CAAC;AACJ,CAAC;AAED,oGAAoG;AACpG,SAAS,OAAO,CAAC,CAAS,EAAE,CAAQ;IAClC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAC,CAAC;IACd,IAAI,CAAC,GAAG,EAAE;QAAE,CAAC,IAAI,SAAC,CAAC;IACnB,IAAI,GAAG,GAAG,gBAAQ,CAAC;IACnB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC;QACd,IAAI,CAAC,GAAG,EAAE;YAAE,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC,KAAK,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6BAA6B;AAC7B,SAAS,WAAW,CAAC,CAAS;IAC5B,OAAO,OAAO,CAAC,CAAC,EAAE,YAAI,CAAC,CAAC;AAC1B,CAAC;AAED,0BAA0B;AAC1B,SAAS,OAAO,CAAC,EAAS,EAAE,EAAS;IACnC,OAAO,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,2CAA2C;AAC3C,SAAS,OAAO,CAAC,CAAQ;IACvB,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC5D,CAAC;AAqCD,6FAA6F;AAC7F,IAAI,WAAyC,CAAC;AAE9C,yGAAyG;AACzG,SAAS,WAAW,CAAC,GAAY;IAC/B,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACzD,MAAM,CAAC,GAAG,GAA8B,CAAC;IACzC,MAAM,MAAM,GAAG,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;IAClG,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,UAAU;YAAE,OAAO,IAAI,CAAC;IACjD,CAAC;IACD,OAAO,GAAgB,CAAC;AAC1B,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS;IAChB,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,WAAW,CAAC;IAClD,WAAW,GAAG,IAAI,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,IAAA,2BAAa,EAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,UAAU,GAAG;YACjB,yBAAyB;YACzB,IAAA,gBAAI,EAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,UAAU,CAAC;SAChE,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC1C,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;oBACpB,WAAW,GAAG,MAAM,CAAC;oBACrB,MAAM;gBACR,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,yBAAyB;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,WAAW,GAAG,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,oGAAoG;AACpG,SAAgB,iBAAiB;IAC/B,OAAO,SAAS,EAAE,KAAK,IAAI,CAAC;AAC9B,CAAC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAAC,CAAQ;IACpC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACvB,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACpD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAgB,eAAe,CAAC,KAAiB;IAC/C,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE;QAAE,MAAM,IAAI,oBAAoB,CAAC,oCAAoC,CAAC,CAAC;IAC9F,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,qBAAqB;IAC7C,IAAI,CAAC,IAAI,SAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,wCAAwC,CAAC,CAAC;IACrF,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,SAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,qBAAqB;IACvB,CAAC;SAAM,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7B,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;IACzB,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,oBAAoB,CAAC,+BAA+B,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,qCAAqC,CAAC,CAAC;IAClG,IAAI,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,IAAI;QAAE,CAAC,GAAG,KAAK,CAAC,SAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED,mGAAmG;AAEnG;;;GAGG;AACH,SAAgB,GAAG,CAAC,EAAS,EAAE,EAAS;IACtC,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpF,OAAO,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACzB,CAAC;AAED,8FAA8F;AAC9F,SAAgB,GAAG,CAAC,CAAS,EAAE,CAAQ;IACrC,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,OAAO,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvB,CAAC;AAED,kFAAkF;AAClF,SAAgB,OAAO,CAAC,CAAS;IAC/B,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,uCAAuC;AACvC,SAAgB,GAAG,CAAC,EAAS,EAAE,EAAS;IACtC,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpF,OAAO,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACzB,CAAC;AAED,oCAAoC;AACpC,SAAgB,GAAG,CAAC,CAAQ;IAC1B,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC;AAED,mEAAmE;AACnE,SAAgB,QAAQ,CAAC,CAAQ;IAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AACxD,CAAC;AAED,0EAA0E;AAC1E,SAAgB,KAAK,CAAC,EAAS,EAAE,EAAS;IACxC,yEAAyE;IACzE,OAAO,CACL,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CACvF,CAAC;AACJ,CAAC;AAED,gGAAgG;AAChG,SAAS,OAAO,CAAC,CAAS;IACxB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC3B,CAAC,KAAK,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mGAAmG;AACnG,SAAgB,WAAW,CAAC,CAAQ;IAClC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAC/B,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACxB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qGAAqG;AACrG,qEAAqE;AACrE,EAAE;AACF,mGAAmG;AACnG,yFAAyF;AACzF,yGAAyG;AACzG,oGAAoG;AACpG,2FAA2F;AAC3F,4FAA4F;AAC5F,yDAAyD;AACzD,qGAAqG;AAErG,oFAAoF;AACpF,MAAa,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;IACrC,CAAC;CACF;AALD,oDAKC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,CAAS,EAAE,CAAQ;IACvC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,GAAG,GAAG,gBAAQ,CAAC;IACnB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC;QACd,IAAI,CAAC,GAAG,EAAE;YAAE,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC,KAAK,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CAAC,CAAQ;IAChC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACxD,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IAC5B,OAAO,GAAG,KAAK,GAAG,CAAC;AACrB,CAAC;AAED,uEAAuE;AACvE,SAAgB,UAAU,CAAC,CAAQ;IACjC,OAAO,KAAK,CAAC,CAAC,EAAE,gBAAQ,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,CAAQ;IACjC,OAAO,KAAK,CAAC,YAAY,CAAC,SAAC,EAAE,CAAC,CAAC,EAAE,gBAAQ,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,aAAa,CAAC,CAAQ;IACpC,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,wFAAwF;QACxF,oFAAoF;QACpF,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,iBAAiB,CAAC,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,qGAAqG;AACrG,SAAgB,YAAY,CAAC,CAAQ;IACnC,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED,wGAAwG;AACxG,SAAgB,gBAAgB,CAAC,CAAQ,EAAE,KAAK,GAAG,OAAO;IACxD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,GAAG,KAAK,gBAAgB,CAAC,CAAC;IAC5E,IAAI,UAAU,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,GAAG,KAAK,qCAAqC,CAAC,CAAC;IACjG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,oBAAoB,CAAC,GAAG,KAAK,0DAA0D,CAAC,CAAC;IACrG,CAAC;AACH,CAAC;AAiBD,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,4BAA4B,CAAC,CAAC;AAE3E,sGAAsG;AACtG,SAAS,gBAAgB,CAAC,CAAQ,EAAE,CAAQ;IAC1C,MAAM,CAAC,GAAG,IAAA,wBAAU,EAAC,QAAQ,CAAC;SAC3B,MAAM,CAAC,WAAW,CAAC;SACnB,MAAM,CAAC,WAAW,CAAC,YAAI,CAAC,CAAC;SACzB,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SACtB,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SACtB,MAAM,EAAE,CAAC;IACZ,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACjD,OAAO,GAAG,GAAG,SAAC,CAAC;AACjB,CAAC;AAED,0FAA0F;AAC1F,SAAgB,YAAY,CAAC,CAAS,EAAE,CAAQ,EAAE,GAAiB;IACjE,+GAA+G;IAC/G,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,SAAC,CAAC,GAAG,SAAC,CAAC,GAAG,SAAC,CAAC;IAC9B,IAAI,CAAC,KAAK,EAAE;QAAE,CAAC,GAAG,EAAE,CAAC;IACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,SAAC,CAAC,GAAG,SAAC,CAAC,GAAG,SAAC,CAAC,CAAC,GAAG,SAAC,CAAC;IAC1C,IAAI,CAAC,GAAG,EAAE;QAAE,CAAC,IAAI,SAAC,CAAC;IACnB,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAAC,CAAQ,EAAE,KAAmB;IACzD,IAAI,KAAK,CAAC,CAAC,GAAG,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,SAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,MAAM,CAAC,GAAG,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC"}