@vorionsys/platform-core 0.1.0

package/dist/security/zkp/commitment.js

@@ -0,0 +1,591 @@
+/**
+ * Commitment Schemes for Zero-Knowledge Proofs
+ *
+ * Implements various cryptographic commitment schemes used in ZK proofs:
+ * - Pedersen commitments (additively homomorphic)
+ * - Merkle tree commitments (for set membership)
+ * - Accumulator commitments (for dynamic sets)
+ * - Commitment opening proofs
+ *
+ * These primitives are foundational for building privacy-preserving protocols.
+ *
+ * @packageDocumentation
+ */
+import { createLogger } from '../../common/logger.js';
+import { VorionError } from '../../common/errors.js';
+import { CommitmentScheme, commitmentSchema, merkleProofSchema, pedersenCommitmentSchema, } from './types.js';
+const logger = createLogger({ component: 'zkp-commitment' });
+// =============================================================================
+// ERRORS
+// =============================================================================
+/**
+ * Commitment-related errors
+ */
+export class CommitmentError extends VorionError {
+    scheme;
+    code = 'COMMITMENT_ERROR';
+    statusCode = 400;
+    constructor(message, scheme, details) {
+        super(message, { scheme, ...details });
+        this.scheme = scheme;
+        this.name = 'CommitmentError';
+    }
+}
+// =============================================================================
+// PEDERSEN COMMITMENT
+// =============================================================================
+/**
+ * Pedersen Commitment Service
+ *
+ * Implements Pedersen commitments which are:
+ * - Perfectly hiding (computationally binding)
+ * - Additively homomorphic: C(v1) * C(v2) = C(v1 + v2)
+ *
+ * Commitment: C = g^v * h^r
+ * where:
+ * - g, h are generators of a prime-order group
+ * - v is the value being committed
+ * - r is a random blinding factor
+ *
+ * Note: This implementation uses SHA-256 hash-based simulation.
+ * For production, use elliptic curve implementations (e.g., ristretto255).
+ *
+ * @example
+ * ```typescript
+ * const pedersen = new PedersenCommitmentService();
+ *
+ * // Create a commitment
+ * const { commitment, opening } = await pedersen.commit(BigInt(42));
+ *
+ * // Verify the commitment
+ * const valid = await pedersen.verify(commitment, BigInt(42), opening);
+ * ```
+ */
+export class PedersenCommitmentService {
+    generatorG;
+    generatorH;
+    constructor() {
+        // In production, these would be verifiably random group elements
+        // For simulation, we use hash-based "generators"
+        this.generatorG = 'pedersen_generator_g_v1';
+        this.generatorH = 'pedersen_generator_h_v1';
+        logger.info('Pedersen commitment service initialized');
+    }
+    /**
+     * Create a commitment to a value
+     *
+     * @param value - The value to commit to (as bigint for large numbers)
+     * @param blindingFactor - Optional blinding factor (random if not provided)
+     * @returns Commitment and opening information
+     */
+    async commit(value, blindingFactor) {
+        const v = typeof value === 'number' ? BigInt(Math.floor(value)) : value;
+        const r = blindingFactor ?? await this.generateRandomScalar();
+        // Simulate C = g^v * h^r using hash
+        const gv = await this.hashToPoint(`${this.generatorG}:${v.toString()}`);
+        const hr = await this.hashToPoint(`${this.generatorH}:${r}`);
+        const commitmentValue = await this.combinePoints(gv, hr);
+        const commitment = {
+            commitment: commitmentValue,
+            generatorG: this.generatorG,
+            generatorH: this.generatorH,
+        };
+        const opening = {
+            value: v.toString(),
+            blindingFactor: r,
+        };
+        pedersenCommitmentSchema.parse(commitment);
+        logger.debug('Created Pedersen commitment');
+        return { commitment, opening };
+    }
+    /**
+     * Verify a commitment opening
+     *
+     * @param commitment - The commitment to verify
+     * @param value - The claimed value
+     * @param blindingFactor - The blinding factor used
+     * @returns Whether the opening is valid
+     */
+    async verify(commitment, value, blindingFactor) {
+        const v = typeof value === 'number' ? BigInt(Math.floor(value)) : value;
+        // Recompute commitment
+        const gv = await this.hashToPoint(`${commitment.generatorG}:${v.toString()}`);
+        const hr = await this.hashToPoint(`${commitment.generatorH}:${blindingFactor}`);
+        const recomputed = await this.combinePoints(gv, hr);
+        return recomputed === commitment.commitment;
+    }
+    /**
+     * Add two commitments (homomorphic addition)
+     *
+     * C(v1, r1) + C(v2, r2) = C(v1 + v2, r1 + r2)
+     */
+    async add(c1, c2) {
+        // In elliptic curve setting, this would be point addition
+        // For simulation, we concatenate and hash
+        const combined = await this.hashToPoint(`add:${c1.commitment}:${c2.commitment}`);
+        return {
+            commitment: combined,
+            generatorG: c1.generatorG,
+            generatorH: c1.generatorH,
+        };
+    }
+    /**
+     * Create a commitment to zero for zero-knowledge proofs
+     */
+    async commitToZero() {
+        const { commitment, opening } = await this.commit(BigInt(0));
+        return { commitment, blindingFactor: opening.blindingFactor };
+    }
+    /**
+     * Generate a random scalar for blinding
+     */
+    async generateRandomScalar() {
+        const array = new Uint8Array(32);
+        crypto.getRandomValues(array);
+        return Array.from(array, b => b.toString(16).padStart(2, '0')).join('');
+    }
+    async hashToPoint(data) {
+        const hashBuffer = await crypto.subtle.digest('SHA-256', new TextEncoder().encode(data));
+        return Array.from(new Uint8Array(hashBuffer))
+            .map(b => b.toString(16).padStart(2, '0'))
+            .join('');
+    }
+    async combinePoints(p1, p2) {
+        return this.hashToPoint(`combine:${p1}:${p2}`);
+    }
+}
+// =============================================================================
+// MERKLE TREE COMMITMENT
+// =============================================================================
+/**
+ * Merkle Tree Commitment Service
+ *
+ * Implements Merkle tree commitments for set membership proofs.
+ * The root of the tree commits to all elements in the set.
+ *
+ * Features:
+ * - Efficient O(log n) membership proofs
+ * - Dynamic tree updates (add/remove elements)
+ * - Sparse tree support for large sets
+ *
+ * @example
+ * ```typescript
+ * const merkle = new MerkleTreeService();
+ *
+ * // Build tree from elements
+ * const { root, tree } = await merkle.buildTree(['alice', 'bob', 'charlie']);
+ *
+ * // Generate membership proof
+ * const proof = merkle.generateProof(tree, 'bob');
+ *
+ * // Verify proof
+ * const valid = await merkle.verifyProof(root, 'bob', proof);
+ * ```
+ */
+export class MerkleTreeService {
+    hashPrefix = 'merkle_v1';
+    constructor() {
+        logger.info('Merkle tree service initialized');
+    }
+    /**
+     * Build a Merkle tree from elements
+     */
+    async buildTree(elements) {
+        if (elements.length === 0) {
+            throw new CommitmentError('Cannot build tree from empty set', CommitmentScheme.MERKLE);
+        }
+        // Remove duplicates and sort for determinism
+        const uniqueElements = Array.from(new Set(elements)).sort();
+        // Pad to power of 2
+        const size = Math.pow(2, Math.ceil(Math.log2(uniqueElements.length)));
+        const paddedElements = [...uniqueElements];
+        while (paddedElements.length < size) {
+            paddedElements.push(''); // Empty leaves
+        }
+        // Hash leaves
+        const leaves = await Promise.all(paddedElements.map(e => this.hashLeaf(e)));
+        // Build tree levels
+        const levels = [leaves];
+        let currentLevel = leaves;
+        while (currentLevel.length > 1) {
+            const nextLevel = [];
+            for (let i = 0; i < currentLevel.length; i += 2) {
+                const left = currentLevel[i];
+                const right = currentLevel[i + 1] ?? left;
+                nextLevel.push(await this.hashNode(left, right));
+            }
+            levels.push(nextLevel);
+            currentLevel = nextLevel;
+        }
+        const root = currentLevel[0];
+        // Create tree structure
+        const tree = {
+            root,
+            levels,
+            elements: paddedElements,
+            depth: levels.length - 1,
+        };
+        // Generate proofs for all original elements
+        const proofs = new Map();
+        for (let i = 0; i < uniqueElements.length; i++) {
+            const element = uniqueElements[i];
+            const proof = this.generateProofInternal(tree, i);
+            proofs.set(element, proof);
+        }
+        logger.debug({ elementCount: uniqueElements.length, depth: tree.depth }, 'Built Merkle tree');
+        return { root, tree, proofs };
+    }
+    /**
+     * Generate a membership proof for an element
+     */
+    generateProof(tree, element) {
+        const index = tree.elements.indexOf(element);
+        if (index === -1) {
+            throw new CommitmentError('Element not found in tree', CommitmentScheme.MERKLE);
+        }
+        return this.generateProofInternal(tree, index);
+    }
+    /**
+     * Verify a membership proof
+     */
+    async verifyProof(root, element, proof) {
+        merkleProofSchema.parse(proof);
+        // Compute root from leaf and proof
+        let currentHash = await this.hashLeaf(element);
+        for (let i = 0; i < proof.siblings.length; i++) {
+            const sibling = proof.siblings[i];
+            const isRight = proof.pathIndices[i] === 1;
+            if (isRight) {
+                currentHash = await this.hashNode(sibling, currentHash);
+            }
+            else {
+                currentHash = await this.hashNode(currentHash, sibling);
+            }
+        }
+        return currentHash === root;
+    }
+    /**
+     * Update a leaf in the tree
+     */
+    async updateLeaf(tree, oldElement, newElement) {
+        const index = tree.elements.indexOf(oldElement);
+        if (index === -1) {
+            throw new CommitmentError('Element not found in tree', CommitmentScheme.MERKLE);
+        }
+        // Update elements
+        const newElements = [...tree.elements];
+        newElements[index] = newElement;
+        // Rebuild tree (could be optimized to only update affected path)
+        const { root, tree: newTree } = await this.buildTree(newElements.filter(e => e !== ''));
+        return { newRoot: root, newTree };
+    }
+    /**
+     * Add an element to the tree
+     */
+    async addElement(tree, element) {
+        const elements = tree.elements.filter(e => e !== '');
+        elements.push(element);
+        return this.buildTree(elements).then(result => ({
+            newRoot: result.root,
+            newTree: result.tree,
+        }));
+    }
+    /**
+     * Create a sparse Merkle tree with a default empty value
+     */
+    async createSparseTree(depth) {
+        // Compute empty roots for each level
+        const emptyRoots = [];
+        let currentEmpty = await this.hashLeaf('');
+        for (let i = 0; i < depth; i++) {
+            emptyRoots.push(currentEmpty);
+            currentEmpty = await this.hashNode(currentEmpty, currentEmpty);
+        }
+        return {
+            root: currentEmpty,
+            emptyRoots,
+        };
+    }
+    generateProofInternal(tree, leafIndex) {
+        const siblings = [];
+        const pathIndices = [];
+        let index = leafIndex;
+        for (let i = 0; i < tree.depth; i++) {
+            const level = tree.levels[i];
+            const isRight = index % 2 === 1;
+            const siblingIndex = isRight ? index - 1 : index + 1;
+            if (siblingIndex < level.length) {
+                siblings.push(level[siblingIndex]);
+            }
+            else {
+                siblings.push(level[index]);
+            }
+            pathIndices.push(isRight ? 1 : 0);
+            index = Math.floor(index / 2);
+        }
+        return {
+            leaf: tree.elements[leafIndex],
+            root: tree.root,
+            siblings,
+            pathIndices,
+            leafIndex,
+        };
+    }
+    async hashLeaf(value) {
+        const data = `${this.hashPrefix}:leaf:${value}`;
+        const hashBuffer = await crypto.subtle.digest('SHA-256', new TextEncoder().encode(data));
+        return Array.from(new Uint8Array(hashBuffer))
+            .map(b => b.toString(16).padStart(2, '0'))
+            .join('');
+    }
+    async hashNode(left, right) {
+        const data = `${this.hashPrefix}:node:${left}:${right}`;
+        const hashBuffer = await crypto.subtle.digest('SHA-256', new TextEncoder().encode(data));
+        return Array.from(new Uint8Array(hashBuffer))
+            .map(b => b.toString(16).padStart(2, '0'))
+            .join('');
+    }
+}
+// =============================================================================
+// ACCUMULATOR COMMITMENT
+// =============================================================================
+/**
+ * Cryptographic Accumulator Service
+ *
+ * Implements accumulator commitments for dynamic set membership.
+ * Unlike Merkle trees, accumulators have constant-size proofs.
+ *
+ * Features:
+ * - Constant-size membership proofs
+ * - Efficient batch updates
+ * - Non-membership proofs
+ *
+ * Note: This implementation uses hash-based simulation.
+ * For production, use RSA or bilinear accumulator implementations.
+ *
+ * @example
+ * ```typescript
+ * const accumulator = new AccumulatorService();
+ *
+ * // Add elements
+ * let state = await accumulator.initialize();
+ * state = await accumulator.add(state, 'element1');
+ *
+ * // Generate witness
+ * const witness = await accumulator.createWitness(state, 'element1');
+ *
+ * // Verify
+ * const valid = await accumulator.verify(state.value, 'element1', witness);
+ * ```
+ */
+export class AccumulatorService {
+    accumulatorSeed;
+    constructor() {
+        // In production, this would be the RSA modulus or group parameters
+        this.accumulatorSeed = 'accumulator_seed_v1';
+        logger.info('Accumulator service initialized');
+    }
+    /**
+     * Initialize a new accumulator
+     */
+    async initialize() {
+        const initialValue = await this.hash(`${this.accumulatorSeed}:init`);
+        return {
+            value: initialValue,
+            elements: new Set(),
+            version: 0,
+        };
+    }
+    /**
+     * Add an element to the accumulator
+     */
+    async add(state, element) {
+        if (state.elements.has(element)) {
+            return state; // Element already present
+        }
+        // In RSA accumulator: acc' = acc^hash(element) mod N
+        // Simulation: hash(acc || element)
+        const newValue = await this.hash(`${state.value}:add:${element}`);
+        const newElements = new Set(state.elements);
+        newElements.add(element);
+        return {
+            value: newValue,
+            elements: newElements,
+            version: state.version + 1,
+        };
+    }
+    /**
+     * Remove an element from the accumulator
+     */
+    async remove(state, element) {
+        if (!state.elements.has(element)) {
+            return state; // Element not present
+        }
+        // Rebuild accumulator without the element
+        let newState = await this.initialize();
+        const elementsArray = Array.from(state.elements);
+        for (const e of elementsArray) {
+            if (e !== element) {
+                newState = await this.add(newState, e);
+            }
+        }
+        return {
+            ...newState,
+            version: state.version + 1,
+        };
+    }
+    /**
+     * Create a membership witness for an element
+     */
+    async createWitness(state, element) {
+        if (!state.elements.has(element)) {
+            throw new CommitmentError('Element not in accumulator', CommitmentScheme.ACCUMULATOR);
+        }
+        // In RSA accumulator: witness = acc without element
+        // Simulation: compute accumulator of all other elements
+        let witnessState = await this.initialize();
+        const elementsArray = Array.from(state.elements);
+        for (const e of elementsArray) {
+            if (e !== element) {
+                witnessState = await this.add(witnessState, e);
+            }
+        }
+        return {
+            element,
+            witness: witnessState.value,
+            accumulatorValue: state.value,
+            version: state.version,
+        };
+    }
+    /**
+     * Verify a membership witness
+     */
+    async verify(accumulatorValue, element, witness) {
+        // Recompute: acc should equal witness^hash(element)
+        // Simulation: hash(witness || element) should equal acc
+        const recomputed = await this.hash(`${witness.witness}:add:${element}`);
+        return recomputed === accumulatorValue;
+    }
+    /**
+     * Batch add multiple elements
+     */
+    async batchAdd(state, elements) {
+        let currentState = state;
+        for (const element of elements) {
+            currentState = await this.add(currentState, element);
+        }
+        return currentState;
+    }
+    /**
+     * Update a witness after accumulator changes
+     */
+    async updateWitness(oldWitness, newState, addedElements, removedElements) {
+        // For efficiency, witnesses can be updated without recomputing from scratch
+        // This is a simplified version that recomputes
+        if (!newState.elements.has(oldWitness.element)) {
+            throw new CommitmentError('Element no longer in accumulator', CommitmentScheme.ACCUMULATOR);
+        }
+        return this.createWitness(newState, oldWitness.element);
+    }
+    async hash(data) {
+        const hashBuffer = await crypto.subtle.digest('SHA-256', new TextEncoder().encode(data));
+        return Array.from(new Uint8Array(hashBuffer))
+            .map(b => b.toString(16).padStart(2, '0'))
+            .join('');
+    }
+}
+// =============================================================================
+// HASH COMMITMENT
+// =============================================================================
+/**
+ * Simple Hash Commitment Service
+ *
+ * Implements basic hash-based commitments.
+ * Computationally binding but not perfectly hiding.
+ *
+ * Commitment: C = H(value || nonce)
+ *
+ * @example
+ * ```typescript
+ * const hash = new HashCommitmentService();
+ *
+ * // Create commitment
+ * const { commitment, nonce } = await hash.commit('secret');
+ *
+ * // Verify
+ * const valid = await hash.verify(commitment, 'secret', nonce);
+ * ```
+ */
+export class HashCommitmentService {
+    constructor() {
+        logger.info('Hash commitment service initialized');
+    }
+    /**
+     * Create a hash commitment
+     */
+    async commit(value) {
+        const nonce = await this.generateNonce();
+        const commitmentValue = await this.hash(`${value}:${nonce}`);
+        const commitment = {
+            scheme: CommitmentScheme.HASH,
+            value: commitmentValue,
+            createdAt: new Date(),
+        };
+        commitmentSchema.parse(commitment);
+        return { commitment, nonce };
+    }
+    /**
+     * Verify a hash commitment opening
+     */
+    async verify(commitment, value, nonce) {
+        const recomputed = await this.hash(`${value}:${nonce}`);
+        return recomputed === commitment.value;
+    }
+    /**
+     * Create a time-locked commitment
+     */
+    async commitWithExpiry(value, expiresAt) {
+        const nonce = await this.generateNonce();
+        const commitmentValue = await this.hash(`${value}:${nonce}:${expiresAt.getTime()}`);
+        const commitment = {
+            scheme: CommitmentScheme.HASH,
+            value: commitmentValue,
+            createdAt: new Date(),
+            parameters: { expiresAt: expiresAt.toISOString() },
+        };
+        commitmentSchema.parse(commitment);
+        return { commitment, nonce };
+    }
+    async hash(data) {
+        const hashBuffer = await crypto.subtle.digest('SHA-256', new TextEncoder().encode(data));
+        return Array.from(new Uint8Array(hashBuffer))
+            .map(b => b.toString(16).padStart(2, '0'))
+            .join('');
+    }
+    async generateNonce() {
+        const array = new Uint8Array(32);
+        crypto.getRandomValues(array);
+        return Array.from(array, b => b.toString(16).padStart(2, '0')).join('');
+    }
+}
+// =============================================================================
+// FACTORY
+// =============================================================================
+/**
+ * Create commitment service for the specified scheme
+ */
+export function createCommitmentService(scheme) {
+    switch (scheme) {
+        case CommitmentScheme.PEDERSEN:
+            return new PedersenCommitmentService();
+        case CommitmentScheme.MERKLE:
+            return new MerkleTreeService();
+        case CommitmentScheme.ACCUMULATOR:
+            return new AccumulatorService();
+        case CommitmentScheme.HASH:
+            return new HashCommitmentService();
+        default:
+            throw new CommitmentError(`Unknown commitment scheme: ${scheme}`);
+    }
+}
+//# sourceMappingURL=commitment.js.map

package/dist/security/zkp/commitment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"commitment.js","sourceRoot":"","sources":["../../../src/security/zkp/commitment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAIL,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,EACjB,wBAAwB,GACzB,MAAM,YAAY,CAAC;AAEpB,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC,CAAC;AAE7D,gFAAgF;AAChF,SAAS;AACT,gFAAgF;AAEhF;;GAEG;AACH,MAAM,OAAO,eAAgB,SAAQ,WAAW;IAID;IAHpC,IAAI,GAAG,kBAAkB,CAAC;IAC1B,UAAU,GAAG,GAAG,CAAC;IAE1B,YAAY,OAAe,EAAkB,MAAyB,EAAE,OAAiC;QACvG,KAAK,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;QADI,WAAM,GAAN,MAAM,CAAmB;QAEpE,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;IAChC,CAAC;CACF;AAED,gFAAgF;AAChF,sBAAsB;AACtB,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,OAAO,yBAAyB;IAC5B,UAAU,CAAS;IACnB,UAAU,CAAS;IAE3B;QACE,iEAAiE;QACjE,iDAAiD;QACjD,IAAI,CAAC,UAAU,GAAG,yBAAyB,CAAC;QAC5C,IAAI,CAAC,UAAU,GAAG,yBAAyB,CAAC;QAE5C,MAAM,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,MAAM,CACV,KAAsB,EACtB,cAAuB;QAEvB,MAAM,CAAC,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACxE,MAAM,CAAC,GAAG,cAAc,IAAI,MAAM,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAE9D,oCAAoC;QACpC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACxE,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7D,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAEzD,MAAM,UAAU,GAAuB;YACrC,UAAU,EAAE,eAAe;YAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;QAEF,MAAM,OAAO,GAAoB;YAC/B,KAAK,EAAE,CAAC,CAAC,QAAQ,EAAE;YACnB,cAAc,EAAE,CAAC;SAClB,CAAC;QAEF,wBAAwB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC;QAE5C,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;IACjC,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,MAAM,CACV,UAA8B,EAC9B,KAAsB,EACtB,cAAsB;QAEtB,MAAM,CAAC,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAExE,uBAAuB;QACvB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,UAAU,CAAC,UAAU,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC9E,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,UAAU,CAAC,UAAU,IAAI,cAAc,EAAE,CAAC,CAAC;QAChF,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAEpD,OAAO,UAAU,KAAK,UAAU,CAAC,UAAU,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,GAAG,CACP,EAAsB,EACtB,EAAsB;QAEtB,0DAA0D;QAC1D,0CAA0C;QAC1C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,UAAU,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC;QAEjF,OAAO;YACL,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,EAAE,CAAC,UAAU;YACzB,UAAU,EAAE,EAAE,CAAC,UAAU;SAC1B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY;QAChB,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC;IAChE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB;QACxB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;IAEO,KAAK,CAAC,WAAW,CAAC,IAAY;QACpC,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAC3C,SAAS,EACT,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAC/B,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;aACzC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,aAAa,CAAC,EAAU,EAAE,EAAU;QAChD,OAAO,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;IACjD,CAAC;CACF;AAYD,gFAAgF;AAChF,yBAAyB;AACzB,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,OAAO,iBAAiB;IACX,UAAU,GAAG,WAAW,CAAC;IAE1C;QACE,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,QAAkB;QAKhC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,eAAe,CAAC,kCAAkC,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACzF,CAAC;QAED,6CAA6C;QAC7C,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAE5D,oBAAoB;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,cAAc,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC;QAC3C,OAAO,cAAc,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;YACpC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe;QAC1C,CAAC;QAED,cAAc;QACd,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAC9B,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAC1C,CAAC;QAEF,oBAAoB;QACpB,MAAM,MAAM,GAAe,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,YAAY,GAAG,MAAM,CAAC;QAE1B,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChD,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAE,CAAC;gBAC9B,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC;gBAC1C,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACnD,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,YAAY,GAAG,SAAS,CAAC;QAC3B,CAAC;QAED,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAE,CAAC;QAE9B,wBAAwB;QACxB,MAAM,IAAI,GAAe;YACvB,IAAI;YACJ,MAAM;YACN,QAAQ,EAAE,cAAc;YACxB,KAAK,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC;SACzB,CAAC;QAEF,4CAA4C;QAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,CAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,mBAAmB,CAAC,CAAC;QAE9F,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,IAAgB,EAAE,OAAe;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,eAAe,CAAC,2BAA2B,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAClF,CAAC;QAED,OAAO,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,IAAY,EAAE,OAAe,EAAE,KAAkB;QACjE,iBAAiB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAE/B,mCAAmC;QACnC,IAAI,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;YACnC,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAE3C,IAAI,OAAO,EAAE,CAAC;gBACZ,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAC1D,CAAC;iBAAM,CAAC;gBACN,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;QAED,OAAO,WAAW,KAAK,IAAI,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,IAAgB,EAChB,UAAkB,EAClB,UAAkB;QAElB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,eAAe,CAAC,2BAA2B,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAClF,CAAC;QAED,kBAAkB;QAClB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,WAAW,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC;QAEhC,iEAAiE;QACjE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAExF,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,IAAgB,EAChB,OAAe;QAEf,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACrD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAEvB,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC9C,OAAO,EAAE,MAAM,CAAC,IAAI;YACpB,OAAO,EAAE,MAAM,CAAC,IAAI;SACrB,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CAAC,KAAa;QAIlC,qCAAqC;QACrC,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,IAAI,YAAY,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC9B,YAAY,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QACjE,CAAC;QAED,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,UAAU;SACX,CAAC;IACJ,CAAC;IAEO,qBAAqB,CAAC,IAAgB,EAAE,SAAiB;QAC/D,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;YAErD,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAChC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAE,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,CAAC;YAC/B,CAAC;YAED,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAE;YAC/B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ;YACR,WAAW;YACX,SAAS;SACV,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,KAAa;QAClC,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,SAAS,KAAK,EAAE,CAAC;QAChD,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAC3C,SAAS,EACT,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAC/B,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;aACzC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,IAAY,EAAE,KAAa;QAChD,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,SAAS,IAAI,IAAI,KAAK,EAAE,CAAC;QACxD,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAC3C,SAAS,EACT,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAC/B,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;aACzC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;CACF;AAgBD,gFAAgF;AAChF,yBAAyB;AACzB,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,OAAO,kBAAkB;IACZ,eAAe,CAAS;IAEzC;QACE,mEAAmE;QACnE,IAAI,CAAC,eAAe,GAAG,qBAAqB,CAAC;QAC7C,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,OAAO,CAAC,CAAC;QAErE,OAAO;YACL,KAAK,EAAE,YAAY;YACnB,QAAQ,EAAE,IAAI,GAAG,EAAE;YACnB,OAAO,EAAE,CAAC;SACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,KAAuB,EAAE,OAAe;QAChD,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,OAAO,KAAK,CAAC,CAAC,0BAA0B;QAC1C,CAAC;QAED,qDAAqD;QACrD,mCAAmC;QACnC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,QAAQ,OAAO,EAAE,CAAC,CAAC;QAElE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC5C,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAEzB,OAAO;YACL,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,WAAW;YACrB,OAAO,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC;SAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,KAAuB,EAAE,OAAe;QACnD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACjC,OAAO,KAAK,CAAC,CAAC,sBAAsB;QACtC,CAAC;QAED,0CAA0C;QAC1C,IAAI,QAAQ,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QACvC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;gBAClB,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,OAAO;YACL,GAAG,QAAQ;YACX,OAAO,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC;SAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,KAAuB,EAAE,OAAe;QAC1D,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,eAAe,CAAC,4BAA4B,EAAE,gBAAgB,CAAC,WAAW,CAAC,CAAC;QACxF,CAAC;QAED,oDAAoD;QACpD,wDAAwD;QACxD,IAAI,YAAY,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;gBAClB,YAAY,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,OAAO;YACL,OAAO;YACP,OAAO,EAAE,YAAY,CAAC,KAAK;YAC3B,gBAAgB,EAAE,KAAK,CAAC,KAAK;YAC7B,OAAO,EAAE,KAAK,CAAC,OAAO;SACvB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,gBAAwB,EACxB,OAAe,EACf,OAA2B;QAE3B,oDAAoD;QACpD,wDAAwD;QACxD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,QAAQ,OAAO,EAAE,CAAC,CAAC;QACxE,OAAO,UAAU,KAAK,gBAAgB,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,KAAuB,EAAE,QAAkB;QACxD,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,YAAY,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,UAA8B,EAC9B,QAA0B,EAC1B,aAAuB,EACvB,eAAyB;QAEzB,4EAA4E;QAC5E,+CAA+C;QAC/C,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,eAAe,CAAC,kCAAkC,EAAE,gBAAgB,CAAC,WAAW,CAAC,CAAC;QAC9F,CAAC;QAED,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAC1D,CAAC;IAEO,KAAK,CAAC,IAAI,CAAC,IAAY;QAC7B,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAC3C,SAAS,EACT,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAC/B,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;aACzC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;CACF;AA4BD,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,OAAO,qBAAqB;IAChC;QACE,MAAM,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa;QACxB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;QACzC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;QAE7D,MAAM,UAAU,GAAe;YAC7B,MAAM,EAAE,gBAAgB,CAAC,IAAI;YAC7B,KAAK,EAAE,eAAe;YACtB,SAAS,EAAE,IAAI,IAAI,EAAE;SACtB,CAAC;QAEF,gBAAgB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAEnC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,UAAsB,EAAE,KAAa,EAAE,KAAa;QAC/D,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;QACxD,OAAO,UAAU,KAAK,UAAU,CAAC,KAAK,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CACpB,KAAa,EACb,SAAe;QAEf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;QACzC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,KAAK,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAEpF,MAAM,UAAU,GAAe;YAC7B,MAAM,EAAE,gBAAgB,CAAC,IAAI;YAC7B,KAAK,EAAE,eAAe;YACtB,SAAS,EAAE,IAAI,IAAI,EAAE;YACrB,UAAU,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,WAAW,EAAE,EAAE;SACnD,CAAC;QAEF,gBAAgB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAEnC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC/B,CAAC;IAEO,KAAK,CAAC,IAAI,CAAC,IAAY;QAC7B,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAC3C,SAAS,EACT,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAC/B,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;aACzC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,aAAa;QACzB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;CACF;AAED,gFAAgF;AAChF,UAAU;AACV,gFAAgF;AAEhF;;GAEG;AACH,MAAM,UAAU,uBAAuB,CAAC,MAAwB;IAE9D,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,gBAAgB,CAAC,QAAQ;YAC5B,OAAO,IAAI,yBAAyB,EAAE,CAAC;QACzC,KAAK,gBAAgB,CAAC,MAAM;YAC1B,OAAO,IAAI,iBAAiB,EAAE,CAAC;QACjC,KAAK,gBAAgB,CAAC,WAAW;YAC/B,OAAO,IAAI,kBAAkB,EAAE,CAAC;QAClC,KAAK,gBAAgB,CAAC,IAAI;YACxB,OAAO,IAAI,qBAAqB,EAAE,CAAC;QACrC;YACE,MAAM,IAAI,eAAe,CAAC,8BAA8B,MAAM,EAAE,CAAC,CAAC;IACtE,CAAC;AACH,CAAC"}