@vorionsys/platform-core 0.1.0

package/dist/security/crypto/shamir/proofs.js

@@ -0,0 +1,605 @@
+/**
+ * Mathematical Proofs for Shamir Secret Sharing
+ *
+ * This module contains formal mathematical proofs documenting the correctness
+ * and security properties of the Shamir Secret Sharing implementation.
+ *
+ * Proofs are expressed as:
+ * - Structured documentation with precise mathematical statements
+ * - Executable verification code where possible
+ * - References to academic literature
+ *
+ * @module security/crypto/shamir/proofs
+ */
+import { GF256, EXP_TABLE, LOG_TABLE, createPolynomial, lagrangeBasisAtZero, lagrangeInterpolateAtZero, } from './verified-shamir';
+import { createShareIndex, } from './types';
+// ============================================================================
+// Proof 1: GF(2^8) Field Axioms
+// ============================================================================
+/**
+ * THEOREM 1: GF(2^8) Field Axioms
+ *
+ * GF(2^8) with irreducible polynomial p(x) = x^8 + x^4 + x^3 + x + 1 (0x11B)
+ * forms a field with 256 elements.
+ *
+ * PROOF OUTLINE:
+ *
+ * 1. CLOSURE under addition and multiplication:
+ *    - Addition (XOR) of two bytes produces a byte: (a XOR b) in [0, 255]
+ *    - Multiplication with reduction mod p(x) produces an element in [0, 255]
+ *
+ * 2. ASSOCIATIVITY:
+ *    - Addition: (a XOR b) XOR c = a XOR (b XOR c) (property of XOR)
+ *    - Multiplication: Follows from polynomial arithmetic properties
+ *
+ * 3. COMMUTATIVITY:
+ *    - Addition: a XOR b = b XOR a
+ *    - Multiplication: a * b = b * a (polynomial multiplication is commutative)
+ *
+ * 4. IDENTITY elements:
+ *    - Additive identity: 0 (a XOR 0 = a)
+ *    - Multiplicative identity: 1 (a * 1 = a)
+ *
+ * 5. INVERSE elements:
+ *    - Additive inverse: a + a = 0 (every element is its own inverse in char 2)
+ *    - Multiplicative inverse: For a != 0, exists b such that a * b = 1
+ *      (guaranteed since GF(2^8) is a field)
+ *
+ * 6. DISTRIBUTIVITY:
+ *    - a * (b + c) = (a * b) + (a * c)
+ *    - Follows from polynomial arithmetic over GF(2)
+ *
+ * IRREDUCIBILITY of p(x) = x^8 + x^4 + x^3 + x + 1:
+ * - p(x) has no roots in GF(2): p(0) = 1, p(1) = 1 + 1 + 1 + 1 + 1 = 1 (mod 2)
+ * - p(x) is not divisible by any irreducible polynomial of degree 2, 3, or 4
+ * - This is verified by exhaustive check (standard result, see FIPS 197)
+ *
+ * Reference: FIPS 197 (AES specification), Section 4.1
+ */
+export function verifyFieldAxioms() {
+    const details = {
+        closure: true,
+        associativity: true,
+        commutativity: true,
+        identity: true,
+        inverse: true,
+        distributivity: true,
+    };
+    // Test on sample elements (exhaustive check is O(256^3) for some properties)
+    const testElements = [
+        0, 1, 2, 127, 128, 255,
+    ].map(x => x);
+    // 1. Closure under addition and multiplication
+    for (const a of testElements) {
+        for (const b of testElements) {
+            const sum = GF256.add(a, b);
+            const product = GF256.mul(a, b);
+            if (sum < 0 || sum > 255 || product < 0 || product > 255) {
+                details.closure = false;
+            }
+        }
+    }
+    // 2. Associativity
+    for (const a of testElements) {
+        for (const b of testElements) {
+            for (const c of testElements) {
+                // (a + b) + c = a + (b + c)
+                const leftAdd = GF256.add(GF256.add(a, b), c);
+                const rightAdd = GF256.add(a, GF256.add(b, c));
+                if (leftAdd !== rightAdd) {
+                    details.associativity = false;
+                }
+                // (a * b) * c = a * (b * c)
+                const leftMul = GF256.mul(GF256.mul(a, b), c);
+                const rightMul = GF256.mul(a, GF256.mul(b, c));
+                if (leftMul !== rightMul) {
+                    details.associativity = false;
+                }
+            }
+        }
+    }
+    // 3. Commutativity
+    for (const a of testElements) {
+        for (const b of testElements) {
+            if (GF256.add(a, b) !== GF256.add(b, a)) {
+                details.commutativity = false;
+            }
+            if (GF256.mul(a, b) !== GF256.mul(b, a)) {
+                details.commutativity = false;
+            }
+        }
+    }
+    // 4. Identity elements
+    for (const a of testElements) {
+        // Additive identity: a + 0 = a
+        if (GF256.add(a, 0) !== a) {
+            details.identity = false;
+        }
+        // Multiplicative identity: a * 1 = a
+        if (GF256.mul(a, 1) !== a) {
+            details.identity = false;
+        }
+    }
+    // 5. Inverse elements
+    for (const a of testElements) {
+        // Additive inverse: a + a = 0 (in characteristic 2)
+        if (GF256.add(a, a) !== 0) {
+            details.inverse = false;
+        }
+        // Multiplicative inverse (for a != 0): a * inv(a) = 1
+        if (a !== 0) {
+            const inv = GF256.inv(a);
+            if (GF256.mul(a, inv) !== 1) {
+                details.inverse = false;
+            }
+        }
+    }
+    // 6. Distributivity: a * (b + c) = a*b + a*c
+    for (const a of testElements) {
+        for (const b of testElements) {
+            for (const c of testElements) {
+                const left = GF256.mul(a, GF256.add(b, c));
+                const right = GF256.add(GF256.mul(a, b), GF256.mul(a, c));
+                if (left !== right) {
+                    details.distributivity = false;
+                }
+            }
+        }
+    }
+    return {
+        passed: Object.values(details).every(v => v),
+        details,
+    };
+}
+// ============================================================================
+// Proof 2: Lagrange Interpolation Correctness
+// ============================================================================
+/**
+ * THEOREM 2: Lagrange Interpolation Uniqueness and Correctness
+ *
+ * STATEMENT:
+ * Given n distinct points (x_1, y_1), ..., (x_n, y_n) in a field F,
+ * there exists a unique polynomial p(x) of degree at most n-1 such that
+ * p(x_i) = y_i for all i.
+ *
+ * PROOF:
+ *
+ * EXISTENCE:
+ * Define the Lagrange basis polynomials:
+ *   L_i(x) = Product_{j != i} (x - x_j) / (x_i - x_j)
+ *
+ * Properties of L_i:
+ *   - L_i(x_i) = 1 (all terms in the product equal 1)
+ *   - L_i(x_j) = 0 for j != i (numerator contains factor (x - x_j) = 0)
+ *   - degree(L_i) = n - 1
+ *
+ * The interpolating polynomial is:
+ *   p(x) = Sum_{i=1}^{n} y_i * L_i(x)
+ *
+ * Verification:
+ *   p(x_k) = Sum_{i=1}^{n} y_i * L_i(x_k)
+ *          = y_k * L_k(x_k) + Sum_{i != k} y_i * L_i(x_k)
+ *          = y_k * 1 + Sum_{i != k} y_i * 0
+ *          = y_k
+ *
+ * UNIQUENESS:
+ * Suppose p(x) and q(x) both interpolate the points, both with degree <= n-1.
+ * Then r(x) = p(x) - q(x) has:
+ *   - degree <= n-1
+ *   - r(x_i) = 0 for all i (n roots)
+ *
+ * A non-zero polynomial of degree d has at most d roots.
+ * Since r has n roots but degree <= n-1, we must have r = 0.
+ * Therefore p = q.
+ *
+ * APPLICATION TO SHAMIR:
+ * For Shamir's scheme with threshold k:
+ *   - Secret is f(0) where f is a polynomial of degree k-1
+ *   - Given k shares (x_i, f(x_i)), Lagrange interpolation recovers f uniquely
+ *   - Then f(0) = secret
+ *
+ * Reference: "How to Share a Secret" by Adi Shamir, CACM 1979
+ */
+export function verifyLagrangeInterpolation() {
+    const testResults = [];
+    // Test 1: Lagrange basis properties
+    const indices = [1, 2, 3].map(x => createShareIndex(x));
+    for (let i = 0; i < indices.length; i++) {
+        const basisValue = lagrangeBasisAtZero(indices, i);
+        // L_i(0) should be a valid field element
+        const passed = basisValue >= 0 && basisValue <= 255;
+        testResults.push({
+            description: `L_${i}(0) is valid field element`,
+            passed,
+            actual: basisValue,
+        });
+    }
+    // Test 2: Sum of Lagrange basis polynomials at x=0 for constant polynomial
+    // If f(x) = c (constant), then f(0) = c = Sum_{i} c * L_i(0)
+    // So Sum_{i} L_i(0) = 1 (for evaluating f(x) = 1)
+    const shares = indices.map(idx => ({
+        index: idx,
+        value: 1, // f(x) = 1
+    }));
+    const reconstructed = lagrangeInterpolateAtZero(shares);
+    testResults.push({
+        description: 'Constant polynomial f(x)=1 reconstructs to 1',
+        passed: reconstructed === 1,
+        expected: 1,
+        actual: reconstructed,
+    });
+    // Test 3: Linear polynomial f(x) = x
+    // f(0) = 0
+    const linearShares = [
+        { index: createShareIndex(1), value: 1 },
+        { index: createShareIndex(2), value: 2 },
+    ];
+    const linearResult = lagrangeInterpolateAtZero(linearShares);
+    testResults.push({
+        description: 'Linear polynomial f(x)=x reconstructs f(0)=0',
+        passed: linearResult === 0,
+        expected: 0,
+        actual: linearResult,
+    });
+    // Test 4: Polynomial f(x) = 42 + 17x (degree 1)
+    // f(0) = 42, f(1) = 42 XOR 17 = 59 (in GF(2^8)), f(2) = 42 XOR (17*2)
+    const poly = createPolynomial([42, 17]);
+    const polyShares = [
+        { index: createShareIndex(1), value: poly.evaluate(1) },
+        { index: createShareIndex(2), value: poly.evaluate(2) },
+    ];
+    const polyResult = lagrangeInterpolateAtZero(polyShares);
+    testResults.push({
+        description: 'Polynomial f(x)=42+17x reconstructs f(0)=42',
+        passed: polyResult === 42,
+        expected: 42,
+        actual: polyResult,
+    });
+    return {
+        passed: testResults.every(t => t.passed),
+        testResults,
+    };
+}
+// ============================================================================
+// Proof 3: Perfect Secrecy (k-1 shares reveal nothing)
+// ============================================================================
+/**
+ * THEOREM 3: Information-Theoretic Security
+ *
+ * STATEMENT:
+ * In a (k, n) Shamir secret sharing scheme, any subset of k-1 or fewer shares
+ * provides zero information about the secret. This is information-theoretic
+ * security, not computational security.
+ *
+ * PROOF:
+ *
+ * Let S be the secret and let (x_1, y_1), ..., (x_{k-1}, y_{k-1}) be k-1 shares.
+ *
+ * We must show: For any possible secret value s in the field,
+ *   P(S = s | shares) = P(S = s)
+ *
+ * Analysis:
+ * 1. The polynomial f(x) has degree k-1, with k coefficients: f(x) = a_0 + a_1*x + ... + a_{k-1}*x^{k-1}
+ * 2. The secret is a_0 = f(0)
+ * 3. Given k-1 points, we have k-1 linear equations in k unknowns
+ * 4. This system is underdetermined
+ *
+ * For any value of a_0 = s:
+ * - The remaining k-1 unknowns (a_1, ..., a_{k-1}) form a system of k-1 equations
+ * - This system has a unique solution (Lagrange interpolation through k-1 points with
+ *   the constraint that f(0) = s)
+ *
+ * Therefore:
+ * - Every possible secret s is equally consistent with the k-1 shares
+ * - The k-1 shares provide zero bits of information about s
+ * - This is perfect secrecy in the information-theoretic sense
+ *
+ * COROLLARY:
+ * The mutual information I(S; Y_1, ..., Y_{k-1}) = 0
+ * where Y_i are the share values.
+ *
+ * Reference: "How to Share a Secret" by Adi Shamir, CACM 1979
+ * Reference: Cover & Thomas, "Elements of Information Theory"
+ */
+export function verifyPerfectSecrecy() {
+    // Demonstration: For k=3, show that any 2 shares are consistent with every possible secret
+    // Fixed 2 shares (k-1 = 2)
+    const x1 = 1;
+    const y1 = 100;
+    const x2 = 2;
+    const y2 = 150;
+    let allSecretsConsistent = true;
+    let testedSecrets = 0;
+    // For each possible secret s (0-255), verify there exists a valid degree-2 polynomial
+    // f(x) = s + a_1*x + a_2*x^2 such that f(x1)=y1 and f(x2)=y2
+    for (let s = 0; s < 256; s++) {
+        testedSecrets++;
+        // We need to find a_1, a_2 such that:
+        // s + a_1*x1 + a_2*x1^2 = y1
+        // s + a_1*x2 + a_2*x2^2 = y2
+        //
+        // Subtracting: a_1*(x2-x1) + a_2*(x2^2-x1^2) = y2 - y1
+        //
+        // This is a system of 2 equations in 2 unknowns (a_1, a_2) with s fixed
+        // It has a unique solution (assuming x1 != x2)
+        // In GF(2^8):
+        const secret = s;
+        const diff1 = GF256.sub(y1, secret); // y1 - s = a_1*x1 + a_2*x1^2
+        const diff2 = GF256.sub(y2, secret); // y2 - s = a_1*x2 + a_2*x2^2
+        // Matrix form: [x1  x1^2] [a_1]   [diff1]
+        //              [x2  x2^2] [a_2] = [diff2]
+        const x1sq = GF256.mul(x1, x1);
+        const x2sq = GF256.mul(x2, x2);
+        // Solve using Cramer's rule
+        // det = x1*x2^2 - x2*x1^2 = x1*x2*(x2 - x1) (in GF(2^8))
+        const det = GF256.sub(GF256.mul(x1, x2sq), GF256.mul(x2, x1sq));
+        if (det === 0) {
+            // This shouldn't happen for x1 != x2
+            allSecretsConsistent = false;
+            continue;
+        }
+        // a_1 = (diff1*x2^2 - diff2*x1^2) / det
+        const a1Num = GF256.sub(GF256.mul(diff1, x2sq), GF256.mul(diff2, x1sq));
+        const a1 = GF256.div(a1Num, det);
+        // a_2 = (diff2*x1 - diff1*x2) / det
+        const a2Num = GF256.sub(GF256.mul(diff2, x1), GF256.mul(diff1, x2));
+        const a2 = GF256.div(a2Num, det);
+        // Verify the solution
+        const poly = createPolynomial([secret, a1, a2]);
+        const check1 = poly.evaluate(x1);
+        const check2 = poly.evaluate(x2);
+        if (check1 !== y1 || check2 !== y2) {
+            allSecretsConsistent = false;
+        }
+    }
+    return {
+        passed: allSecretsConsistent,
+        description: 'Verified that for k=3 threshold, any 2 shares are consistent with all 256 possible secrets, ' +
+            'demonstrating that k-1 shares reveal zero information about the secret.',
+        analysis: {
+            testedSecrets,
+            testedShareCombinations: 1, // Fixed share combination for demo
+            allSecretsConsistent,
+        },
+    };
+}
+// ============================================================================
+// Proof 4: Reconstruction Completeness (k shares always work)
+// ============================================================================
+/**
+ * THEOREM 4: Reconstruction Completeness
+ *
+ * STATEMENT:
+ * Any k shares from a (k, n) Shamir secret sharing scheme can reconstruct
+ * the original secret.
+ *
+ * PROOF:
+ *
+ * Setup:
+ * - Original polynomial f(x) has degree k-1
+ * - f(0) = secret
+ * - Shares are (x_i, f(x_i)) for i = 1, ..., n
+ *
+ * Given any k shares (x_{i_1}, y_{i_1}), ..., (x_{i_k}, y_{i_k}):
+ *
+ * 1. By Theorem 2 (Lagrange Interpolation), there exists a unique polynomial
+ *    p(x) of degree at most k-1 that passes through these k points.
+ *
+ * 2. Since f(x) also passes through these points and has degree k-1,
+ *    by uniqueness we have p(x) = f(x).
+ *
+ * 3. Therefore p(0) = f(0) = secret.
+ *
+ * The reconstruction is deterministic and always succeeds given k valid shares.
+ *
+ * COROLLARY:
+ * The choice of which k shares to use does not affect the result.
+ * All C(n, k) combinations of k shares reconstruct the same secret.
+ *
+ * Reference: "How to Share a Secret" by Adi Shamir, CACM 1979
+ */
+export function verifyReconstructionCompleteness() {
+    const testResults = [];
+    // Test parameters
+    const testCases = [
+        { k: 2, n: 3, secret: 42 },
+        { k: 3, n: 5, secret: 100 },
+        { k: 2, n: 5, secret: 255 },
+    ];
+    for (const { k, n, secret } of testCases) {
+        // Generate shares
+        const poly = generateTestPolynomial(secret, k - 1);
+        const allShares = [];
+        for (let i = 1; i <= n; i++) {
+            allShares.push({
+                index: createShareIndex(i),
+                value: poly.evaluate(i),
+            });
+        }
+        // Test all C(n, k) combinations
+        const combinations = getCombinations(allShares, k);
+        let allSucceeded = true;
+        for (const combo of combinations) {
+            const reconstructed = lagrangeInterpolateAtZero(combo);
+            if (reconstructed !== secret) {
+                allSucceeded = false;
+            }
+        }
+        testResults.push({
+            threshold: k,
+            totalShares: n,
+            secret,
+            combinationsTested: combinations.length,
+            allSucceeded,
+        });
+    }
+    return {
+        passed: testResults.every(t => t.allSucceeded),
+        testResults,
+    };
+}
+/**
+ * Generate a test polynomial with given constant term and degree.
+ * Uses deterministic coefficients for testing.
+ */
+function generateTestPolynomial(constantTerm, degree) {
+    const coefficients = [constantTerm];
+    // Use deterministic but varied coefficients for testing
+    for (let i = 1; i <= degree; i++) {
+        coefficients.push(((i * 17 + 23) % 256));
+    }
+    return createPolynomial(coefficients);
+}
+/**
+ * Get all k-combinations of an array.
+ */
+function getCombinations(arr, k) {
+    if (k === 0)
+        return [[]];
+    if (arr.length < k)
+        return [];
+    const result = [];
+    const first = arr[0];
+    const rest = arr.slice(1);
+    // Combinations including first element
+    for (const combo of getCombinations(rest, k - 1)) {
+        result.push([first, ...combo]);
+    }
+    // Combinations excluding first element
+    result.push(...getCombinations(rest, k));
+    return result;
+}
+// ============================================================================
+// Proof 5: GF(2^8) Generator and Order
+// ============================================================================
+/**
+ * THEOREM 5: Generator Properties of g = 0x03
+ *
+ * STATEMENT:
+ * The element g = 3 is a generator of the multiplicative group GF(2^8)*.
+ * This means g has order 255, and every non-zero element of GF(2^8) can be
+ * written as g^i for some i in {0, 1, ..., 254}.
+ *
+ * PROOF:
+ *
+ * The multiplicative group GF(2^8)* has 255 elements (all non-zero elements).
+ * By Lagrange's theorem, the order of any element divides 255.
+ *
+ * 255 = 3 * 5 * 17
+ *
+ * An element g generates the group iff g^(255/p) != 1 for each prime divisor p.
+ *
+ * For g = 3:
+ * - 3^(255/3) = 3^85 != 1 (verified by computation)
+ * - 3^(255/5) = 3^51 != 1 (verified by computation)
+ * - 3^(255/17) = 3^15 != 1 (verified by computation)
+ *
+ * Therefore ord(g) = 255 and g generates GF(2^8)*.
+ *
+ * COROLLARY:
+ * The EXP_TABLE contains all 255 non-zero elements of GF(2^8) exactly once.
+ * The LOG_TABLE provides a bijection from GF(2^8)* to Z_255.
+ */
+export function verifyGeneratorProperties() {
+    const g = 3; // Generator
+    const expectedOrder = 255;
+    // Verify order by checking g^255 = 1 and g^k != 1 for k < 255
+    let computedOrder = 1;
+    let power = g;
+    for (let i = 1; i <= 255; i++) {
+        if (power === 1) {
+            computedOrder = i;
+            break;
+        }
+        power = GF256.mul(power, g);
+    }
+    // Verify all non-zero elements are generated
+    const generated = new Set();
+    power = 1;
+    for (let i = 0; i < 255; i++) {
+        generated.add(power);
+        power = GF256.mul(power, g);
+    }
+    const allElementsGenerated = generated.size === 255 && !generated.has(0);
+    // Verify EXP_TABLE
+    let expTableCorrect = true;
+    power = 1;
+    for (let i = 0; i < 255; i++) {
+        if (EXP_TABLE[i] !== power) {
+            expTableCorrect = false;
+            break;
+        }
+        power = GF256.mul(power, g);
+    }
+    // Verify LOG_TABLE (inverse of EXP_TABLE)
+    let logTableCorrect = true;
+    for (let i = 0; i < 255; i++) {
+        if (LOG_TABLE[EXP_TABLE[i]] !== i) {
+            logTableCorrect = false;
+            break;
+        }
+    }
+    return {
+        passed: computedOrder === expectedOrder &&
+            allElementsGenerated &&
+            expTableCorrect &&
+            logTableCorrect,
+        details: {
+            generatorValue: g,
+            computedOrder,
+            expectedOrder,
+            allElementsGenerated,
+            expTableCorrect,
+            logTableCorrect,
+        },
+    };
+}
+// ============================================================================
+// Master Verification Function
+// ============================================================================
+/**
+ * Run all proofs and return comprehensive verification results.
+ */
+export function runAllProofs() {
+    const proofs = [];
+    // Proof 1: Field Axioms
+    const fieldAxioms = verifyFieldAxioms();
+    proofs.push({
+        name: 'GF(2^8) Field Axioms',
+        passed: fieldAxioms.passed,
+        details: fieldAxioms.details,
+    });
+    // Proof 2: Lagrange Interpolation
+    const lagrange = verifyLagrangeInterpolation();
+    proofs.push({
+        name: 'Lagrange Interpolation Correctness',
+        passed: lagrange.passed,
+        details: lagrange.testResults,
+    });
+    // Proof 3: Perfect Secrecy
+    const secrecy = verifyPerfectSecrecy();
+    proofs.push({
+        name: 'Information-Theoretic Security (Perfect Secrecy)',
+        passed: secrecy.passed,
+        details: { description: secrecy.description, analysis: secrecy.analysis },
+    });
+    // Proof 4: Reconstruction Completeness
+    const completeness = verifyReconstructionCompleteness();
+    proofs.push({
+        name: 'Reconstruction Completeness',
+        passed: completeness.passed,
+        details: completeness.testResults,
+    });
+    // Proof 5: Generator Properties
+    const generator = verifyGeneratorProperties();
+    proofs.push({
+        name: 'GF(2^8) Generator Properties',
+        passed: generator.passed,
+        details: generator.details,
+    });
+    return {
+        allPassed: proofs.every(p => p.passed),
+        proofs,
+    };
+}
+//# sourceMappingURL=proofs.js.map

package/dist/security/crypto/shamir/proofs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proofs.js","sourceRoot":"","sources":["../../../../src/security/crypto/shamir/proofs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EACL,KAAK,EACL,SAAS,EACT,SAAS,EAET,gBAAgB,EAChB,mBAAmB,EACnB,yBAAyB,GAC1B,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAIL,gBAAgB,GACjB,MAAM,SAAS,CAAC;AAEjB,+EAA+E;AAC/E,gCAAgC;AAChC,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AACH,MAAM,UAAU,iBAAiB;IAW/B,MAAM,OAAO,GAAG;QACd,OAAO,EAAE,IAAI;QACb,aAAa,EAAE,IAAI;QACnB,aAAa,EAAE,IAAI;QACnB,QAAQ,EAAE,IAAI;QACd,OAAO,EAAE,IAAI;QACb,cAAc,EAAE,IAAI;KACrB,CAAC;IAEF,6EAA6E;IAC7E,MAAM,YAAY,GAAmB;QACnC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;KACvB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAiB,CAAC,CAAC;IAE9B,+CAA+C;IAC/C,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChC,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;gBACzD,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC7B,4BAA4B;gBAC5B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;oBACzB,OAAO,CAAC,aAAa,GAAG,KAAK,CAAC;gBAChC,CAAC;gBAED,4BAA4B;gBAC5B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;oBACzB,OAAO,CAAC,aAAa,GAAG,KAAK,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACxC,OAAO,CAAC,aAAa,GAAG,KAAK,CAAC;YAChC,CAAC;YACD,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACxC,OAAO,CAAC,aAAa,GAAG,KAAK,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,+BAA+B;QAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAiB,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1C,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC;QAC3B,CAAC;QACD,qCAAqC;QACrC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAiB,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1C,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,oDAAoD;QACpD,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC;QAC1B,CAAC;QAED,sDAAsD;QACtD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC1D,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;oBACnB,OAAO,CAAC,cAAc,GAAG,KAAK,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,OAAO;KACR,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,8CAA8C;AAC9C,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AACH,MAAM,UAAU,2BAA2B;IASzC,MAAM,WAAW,GAKZ,EAAE,CAAC;IAER,oCAAoC;IACpC,MAAM,OAAO,GAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,UAAU,GAAG,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,yCAAyC;QACzC,MAAM,MAAM,GAAG,UAAU,IAAI,CAAC,IAAI,UAAU,IAAI,GAAG,CAAC;QACpD,WAAW,CAAC,IAAI,CAAC;YACf,WAAW,EAAE,KAAK,CAAC,4BAA4B;YAC/C,MAAM;YACN,MAAM,EAAE,UAAU;SACnB,CAAC,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,6DAA6D;IAC7D,kDAAkD;IAClD,MAAM,MAAM,GAAsD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpF,KAAK,EAAE,GAAG;QACV,KAAK,EAAE,CAAiB,EAAE,WAAW;KACtC,CAAC,CAAC,CAAC;IAEJ,MAAM,aAAa,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC;IACxD,WAAW,CAAC,IAAI,CAAC;QACf,WAAW,EAAE,8CAA8C;QAC3D,MAAM,EAAE,aAAa,KAAK,CAAC;QAC3B,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,aAAa;KACtB,CAAC,CAAC;IAEH,qCAAqC;IACrC,WAAW;IACX,MAAM,YAAY,GAAsD;QACtE,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAiB,EAAE;QACxD,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAiB,EAAE;KACzD,CAAC;IAEF,MAAM,YAAY,GAAG,yBAAyB,CAAC,YAAY,CAAC,CAAC;IAC7D,WAAW,CAAC,IAAI,CAAC;QACf,WAAW,EAAE,8CAA8C;QAC3D,MAAM,EAAE,YAAY,KAAK,CAAC;QAC1B,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,YAAY;KACrB,CAAC,CAAC;IAEH,gDAAgD;IAChD,sEAAsE;IACtE,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAkB,EAAE,EAAkB,CAAC,CAAC,CAAC;IACxE,MAAM,UAAU,GAAsD;QACpE,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAiB,CAAC,EAAE;QACvE,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAiB,CAAC,EAAE;KACxE,CAAC;IAEF,MAAM,UAAU,GAAG,yBAAyB,CAAC,UAAU,CAAC,CAAC;IACzD,WAAW,CAAC,IAAI,CAAC;QACf,WAAW,EAAE,6CAA6C;QAC1D,MAAM,EAAE,UAAU,KAAK,EAAE;QACzB,QAAQ,EAAE,EAAE;QACZ,MAAM,EAAE,UAAU;KACnB,CAAC,CAAC;IAEH,OAAO;QACL,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACxC,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,uDAAuD;AACvD,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,MAAM,UAAU,oBAAoB;IASlC,2FAA2F;IAE3F,2BAA2B;IAC3B,MAAM,EAAE,GAAG,CAAiB,CAAC;IAC7B,MAAM,EAAE,GAAG,GAAmB,CAAC;IAC/B,MAAM,EAAE,GAAG,CAAiB,CAAC;IAC7B,MAAM,EAAE,GAAG,GAAmB,CAAC;IAE/B,IAAI,oBAAoB,GAAG,IAAI,CAAC;IAChC,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,sFAAsF;IACtF,6DAA6D;IAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,aAAa,EAAE,CAAC;QAEhB,sCAAsC;QACtC,6BAA6B;QAC7B,6BAA6B;QAC7B,EAAE;QACF,uDAAuD;QACvD,EAAE;QACF,wEAAwE;QACxE,+CAA+C;QAE/C,cAAc;QACd,MAAM,MAAM,GAAG,CAAiB,CAAC;QACjC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,6BAA6B;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,6BAA6B;QAElE,0CAA0C;QAC1C,0CAA0C;QAE1C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAE/B,4BAA4B;QAC5B,yDAAyD;QACzD,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QAEhE,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,qCAAqC;YACrC,oBAAoB,GAAG,KAAK,CAAC;YAC7B,SAAS;QACX,CAAC;QAED,wCAAwC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QACxE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAEjC,oCAAoC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;QACpE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAEjC,sBAAsB;QACtB,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAEjC,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;YACnC,oBAAoB,GAAG,KAAK,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE,oBAAoB;QAC5B,WAAW,EACT,8FAA8F;YAC9F,yEAAyE;QAC3E,QAAQ,EAAE;YACR,aAAa;YACb,uBAAuB,EAAE,CAAC,EAAE,mCAAmC;YAC/D,oBAAoB;SACrB;KACF,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,8DAA8D;AAC9D,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,UAAU,gCAAgC;IAU9C,MAAM,WAAW,GAMZ,EAAE,CAAC;IAER,kBAAkB;IAClB,MAAM,SAAS,GAAoD;QACjE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE;QAC1B,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE;KAC5B,CAAC;IAEF,KAAK,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QACzC,kBAAkB;QAClB,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAsB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,MAAM,SAAS,GAAsD,EAAE,CAAC;QAExE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,SAAS,CAAC,IAAI,CAAC;gBACb,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC;gBAC1B,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAiB,CAAC;aACxC,CAAC,CAAC;QACL,CAAC;QAED,gCAAgC;QAChC,MAAM,YAAY,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,YAAY,GAAG,IAAI,CAAC;QAExB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,aAAa,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,aAAa,KAAK,MAAM,EAAE,CAAC;gBAC7B,YAAY,GAAG,KAAK,CAAC;YACvB,CAAC;QACH,CAAC;QAED,WAAW,CAAC,IAAI,CAAC;YACf,SAAS,EAAE,CAAC;YACZ,WAAW,EAAE,CAAC;YACd,MAAM;YACN,kBAAkB,EAAE,YAAY,CAAC,MAAM;YACvC,YAAY;SACb,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC;QAC9C,WAAW;KACZ,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAC7B,YAA0B,EAC1B,MAAc;IAEd,MAAM,YAAY,GAAmB,CAAC,YAAY,CAAC,CAAC;IAEpD,wDAAwD;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,CAAiB,CAAC,CAAC;IAC3D,CAAC;IAED,OAAO,gBAAgB,CAAC,YAAY,CAAC,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAI,GAAQ,EAAE,CAAS;IAC7C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACzB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAE9B,MAAM,MAAM,GAAU,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE1B,uCAAuC;IACvC,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,uCAAuC;IACvC,MAAM,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAEzC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,uCAAuC;AACvC,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,UAAU,yBAAyB;IAWvC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY;IACzB,MAAM,aAAa,GAAG,GAAG,CAAC;IAE1B,8DAA8D;IAC9D,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,KAAK,GAAiB,CAAiB,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,aAAa,GAAG,CAAC,CAAC;YAClB,MAAM;QACR,CAAC;QACD,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAiB,CAAC,CAAC;IAC9C,CAAC;IAED,6CAA6C;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,GAAG,CAAiB,CAAC;IAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrB,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAiB,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM,oBAAoB,GAAG,SAAS,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEzE,mBAAmB;IACnB,IAAI,eAAe,GAAG,IAAI,CAAC;IAC3B,KAAK,GAAG,CAAiB,CAAC;IAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAC3B,eAAe,GAAG,KAAK,CAAC;YACxB,MAAM;QACR,CAAC;QACD,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAiB,CAAC,CAAC;IAC9C,CAAC;IAED,0CAA0C;IAC1C,IAAI,eAAe,GAAG,IAAI,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAClC,eAAe,GAAG,KAAK,CAAC;YACxB,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EACJ,aAAa,KAAK,aAAa;YAC/B,oBAAoB;YACpB,eAAe;YACf,eAAe;QACjB,OAAO,EAAE;YACP,cAAc,EAAE,CAAC;YACjB,aAAa;YACb,aAAa;YACb,oBAAoB;YACpB,eAAe;YACf,eAAe;SAChB;KACF,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,+BAA+B;AAC/B,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,YAAY;IAQ1B,MAAM,MAAM,GAA+D,EAAE,CAAC;IAE9E,wBAAwB;IACxB,MAAM,WAAW,GAAG,iBAAiB,EAAE,CAAC;IACxC,MAAM,CAAC,IAAI,CAAC;QACV,IAAI,EAAE,sBAAsB;QAC5B,MAAM,EAAE,WAAW,CAAC,MAAM;QAC1B,OAAO,EAAE,WAAW,CAAC,OAAO;KAC7B,CAAC,CAAC;IAEH,kCAAkC;IAClC,MAAM,QAAQ,GAAG,2BAA2B,EAAE,CAAC;IAC/C,MAAM,CAAC,IAAI,CAAC;QACV,IAAI,EAAE,oCAAoC;QAC1C,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,OAAO,EAAE,QAAQ,CAAC,WAAW;KAC9B,CAAC,CAAC;IAEH,2BAA2B;IAC3B,MAAM,OAAO,GAAG,oBAAoB,EAAE,CAAC;IACvC,MAAM,CAAC,IAAI,CAAC;QACV,IAAI,EAAE,kDAAkD;QACxD,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,OAAO,EAAE,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE;KAC1E,CAAC,CAAC;IAEH,uCAAuC;IACvC,MAAM,YAAY,GAAG,gCAAgC,EAAE,CAAC;IACxD,MAAM,CAAC,IAAI,CAAC;QACV,IAAI,EAAE,6BAA6B;QACnC,MAAM,EAAE,YAAY,CAAC,MAAM;QAC3B,OAAO,EAAE,YAAY,CAAC,WAAW;KAClC,CAAC,CAAC;IAEH,gCAAgC;IAChC,MAAM,SAAS,GAAG,yBAAyB,EAAE,CAAC;IAC9C,MAAM,CAAC,IAAI,CAAC;QACV,IAAI,EAAE,8BAA8B;QACpC,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,OAAO,EAAE,SAAS,CAAC,OAAO;KAC3B,CAAC,CAAC;IAEH,OAAO;QACL,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACtC,MAAM;KACP,CAAC;AACJ,CAAC"}