@digitaldefiance/ecies-lib 4.17.2 → 4.17.3

package/src/lib/voting/threshold/threshold-key-generator.js

@@ -0,0 +1,275 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ThresholdKeyGenerator = exports.KeyGenerationFailedError = exports.InvalidThresholdConfigError = void 0;
+/**
+ * Error thrown when threshold configuration is invalid.
+ */
+class InvalidThresholdConfigError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'InvalidThresholdConfigError';
+    }
+}
+exports.InvalidThresholdConfigError = InvalidThresholdConfigError;
+/**
+ * Error thrown when key generation fails.
+ */
+class KeyGenerationFailedError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'KeyGenerationFailedError';
+    }
+}
+exports.KeyGenerationFailedError = KeyGenerationFailedError;
+/**
+ * Default key bit length for Paillier keys.
+ */
+const DEFAULT_KEY_BIT_LENGTH = 2048;
+/**
+ * Generates threshold Paillier keys with n shares and threshold k.
+ *
+ * Uses Shamir's Secret Sharing to split the private key into n shares,
+ * where any k shares can reconstruct decryption capability.
+ *
+ * @example
+ * ```typescript
+ * const generator = new ThresholdKeyGenerator();
+ * const keyPair = await generator.generate({
+ *   totalShares: 9,
+ *   threshold: 5,
+ *   keyBitLength: 2048
+ * });
+ *
+ * // Distribute keyPair.keyShares to Guardians
+ * // Use keyPair.publicKey for encryption
+ * ```
+ */
+class ThresholdKeyGenerator {
+    /**
+     * Validate a threshold configuration.
+     *
+     * @param config - The threshold configuration to validate
+     * @throws InvalidThresholdConfigError if configuration is invalid
+     */
+    validateConfig(config) {
+        const { totalShares: n, threshold: k } = config;
+        if (!Number.isInteger(n) || n < 2) {
+            throw new InvalidThresholdConfigError(`Total shares (n) must be an integer >= 2, got ${n}`);
+        }
+        if (!Number.isInteger(k) || k < 2) {
+            throw new InvalidThresholdConfigError(`Threshold (k) must be an integer >= 2, got ${k}`);
+        }
+        if (k > n) {
+            throw new InvalidThresholdConfigError(`Threshold (k=${k}) cannot exceed total shares (n=${n})`);
+        }
+        if (config.keyBitLength !== undefined) {
+            if (!Number.isInteger(config.keyBitLength) || config.keyBitLength < 512) {
+                throw new InvalidThresholdConfigError(`Key bit length must be an integer >= 512, got ${config.keyBitLength}`);
+            }
+        }
+    }
+    /**
+     * Generate a new threshold key pair.
+     *
+     * @param config - The threshold configuration
+     * @returns A promise that resolves to the threshold key pair
+     * @throws InvalidThresholdConfigError if configuration is invalid
+     * @throws KeyGenerationFailedError if key generation fails
+     */
+    async generate(config) {
+        this.validateConfig(config);
+        const { totalShares: n, threshold: k } = config;
+        const keyBitLength = config.keyBitLength ?? DEFAULT_KEY_BIT_LENGTH;
+        try {
+            // Dynamically import paillier-bigint to support both browser and Node.js
+            const paillier = await import('paillier-bigint');
+            // Generate the base Paillier key pair
+            const baseKeyPair = await paillier.generateRandomKeys(keyBitLength);
+            const publicKey = baseKeyPair.publicKey;
+            // Get the private key components
+            // In Paillier, the private key contains lambda and mu
+            // For threshold, we need to split lambda using Shamir's Secret Sharing
+            const lambda = baseKeyPair.privateKey.lambda;
+            const n2 = publicKey.n * publicKey.n;
+            // The Shamir modulus must be a multiple of the group order of Z*_{n²}.
+            // The order of Z*_{n²} divides n·λ, so we split modulo n·λ.
+            // This ensures that Lagrange reconstruction in the exponent is correct:
+            // Σ λ_i'·s_i ≡ Δ·λ (mod n·λ) implies c^(Σ ...) ≡ c^(Δ·λ) (mod n²).
+            const shamirModulus = publicKey.n * lambda;
+            // Generate key shares using Shamir's Secret Sharing
+            const { shares, coefficients } = this.shamirSplit(lambda, k, n, shamirModulus);
+            // Generate verification keys for each share
+            // The verification key allows ZK proof verification without revealing the share
+            const verificationKeys = await this.generateVerificationKeys(shares, publicKey, coefficients[0]);
+            // Create KeyShare objects
+            const keyShares = shares.map((share, i) => ({
+                index: i + 1, // 1-indexed
+                share: share,
+                verificationKey: verificationKeys[i],
+            }));
+            // Compute the threshold decryption constant theta.
+            // θ = L(g^(4·Δ·λ) mod n²) mod n, where Δ = n! (totalShares factorial).
+            // The combiner uses θ⁻¹ to convert combined partial decryptions
+            // into the final plaintext. This value is public and safe to share.
+            const delta = this.factorial(BigInt(n));
+            const g = publicKey.g;
+            const thetaBase = this.modPow(g, 4n * delta * lambda, n2);
+            const theta = this.mod((thetaBase - 1n) / publicKey.n, publicKey.n);
+            return {
+                publicKey,
+                verificationKeys,
+                keyShares,
+                config: {
+                    totalShares: n,
+                    threshold: k,
+                    keyBitLength,
+                },
+                theta,
+            };
+        }
+        catch (error) {
+            if (error instanceof InvalidThresholdConfigError ||
+                error instanceof KeyGenerationFailedError) {
+                throw error;
+            }
+            throw new KeyGenerationFailedError(`Failed to generate threshold keys: ${error instanceof Error ? error.message : String(error)}`);
+        }
+    }
+    /**
+     * Split a secret using Shamir's Secret Sharing.
+     *
+     * Creates a random polynomial of degree k-1 where the constant term is the secret.
+     * Evaluates the polynomial at points 1, 2, ..., n to generate n shares.
+     *
+     * @param secret - The secret to split
+     * @param k - The threshold (minimum shares needed to reconstruct)
+     * @param n - The total number of shares
+     * @param modulus - The modulus for arithmetic operations
+     * @returns The shares and polynomial coefficients
+     */
+    shamirSplit(secret, k, n, modulus) {
+        // Generate random coefficients for polynomial of degree k-1
+        // f(x) = secret + a1*x + a2*x^2 + ... + a(k-1)*x^(k-1)
+        const coefficients = [secret];
+        for (let i = 1; i < k; i++) {
+            coefficients.push(this.randomBigInt(modulus));
+        }
+        // Evaluate polynomial at points 1, 2, ..., n
+        const shares = [];
+        for (let i = 1; i <= n; i++) {
+            const x = BigInt(i);
+            let y = 0n;
+            let xPower = 1n;
+            for (const coeff of coefficients) {
+                y = this.mod(y + this.mod(coeff * xPower, modulus), modulus);
+                xPower = this.mod(xPower * x, modulus);
+            }
+            shares.push(y);
+        }
+        return { shares, coefficients };
+    }
+    /**
+     * Generate verification keys for each share.
+     *
+     * The verification key is used to verify ZK proofs of correct partial decryption.
+     * It's computed as g^share mod n^2 where g is the Paillier generator.
+     *
+     * @param shares - The key shares
+     * @param publicKey - The Paillier public key
+     * @param _secret - The original secret (for verification)
+     * @returns Array of verification keys as Uint8Array
+     */
+    async generateVerificationKeys(shares, publicKey, _secret) {
+        const n2 = publicKey.n * publicKey.n;
+        const g = publicKey.g;
+        const verificationKeys = [];
+        for (const share of shares) {
+            // Verification key: v_i = g^(share_i) mod n^2
+            const vk = this.modPow(g, share, n2);
+            verificationKeys.push(this.bigintToUint8Array(vk));
+        }
+        return verificationKeys;
+    }
+    /**
+     * Generate a cryptographically secure random bigint less than max.
+     *
+     * @param max - The upper bound (exclusive)
+     * @returns A random bigint in [0, max)
+     */
+    randomBigInt(max) {
+        const byteLength = Math.ceil(max.toString(2).length / 8) + 8;
+        const randomBytes = new Uint8Array(byteLength);
+        crypto.getRandomValues(randomBytes);
+        let result = 0n;
+        for (const byte of randomBytes) {
+            result = (result << 8n) | BigInt(byte);
+        }
+        return this.mod(result, max);
+    }
+    /**
+     * Compute a mod m, handling negative numbers correctly.
+     *
+     * @param a - The dividend
+     * @param m - The modulus
+     * @returns a mod m (always non-negative)
+     */
+    mod(a, m) {
+        const result = a % m;
+        return result >= 0n ? result : result + m;
+    }
+    /**
+     * Compute base^exp mod m using square-and-multiply.
+     *
+     * @param base - The base
+     * @param exp - The exponent
+     * @param m - The modulus
+     * @returns base^exp mod m
+     */
+    modPow(base, exp, m) {
+        if (m === 1n)
+            return 0n;
+        let result = 1n;
+        base = this.mod(base, m);
+        while (exp > 0n) {
+            if (exp % 2n === 1n) {
+                result = this.mod(result * base, m);
+            }
+            exp = exp >> 1n;
+            base = this.mod(base * base, m);
+        }
+        return result;
+    }
+    /**
+     * Convert a bigint to Uint8Array.
+     *
+     * @param value - The bigint to convert
+     * @returns The Uint8Array representation
+     */
+    bigintToUint8Array(value) {
+        if (value === 0n) {
+            return new Uint8Array([0]);
+        }
+        const hex = value.toString(16);
+        const paddedHex = hex.length % 2 === 0 ? hex : '0' + hex;
+        const bytes = new Uint8Array(paddedHex.length / 2);
+        for (let i = 0; i < bytes.length; i++) {
+            bytes[i] = parseInt(paddedHex.slice(i * 2, i * 2 + 2), 16);
+        }
+        return bytes;
+    }
+    /**
+     * Compute n! (factorial).
+     *
+     * @param n - The number to compute factorial of
+     * @returns n!
+     */
+    factorial(n) {
+        let result = 1n;
+        for (let i = 2n; i <= n; i++) {
+            result *= i;
+        }
+        return result;
+    }
+}
+exports.ThresholdKeyGenerator = ThresholdKeyGenerator;
+//# sourceMappingURL=threshold-key-generator.js.map

package/src/lib/voting/threshold/threshold-key-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"threshold-key-generator.js","sourceRoot":"","sources":["../../../../../../../packages/digitaldefiance-ecies-lib/src/lib/voting/threshold/threshold-key-generator.ts"],"names":[],"mappings":";;;AAkBA;;GAEG;AACH,MAAa,2BAA4B,SAAQ,KAAK;IACpD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,6BAA6B,CAAC;IAC5C,CAAC;CACF;AALD,kEAKC;AAED;;GAEG;AACH,MAAa,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;IACzC,CAAC;CACF;AALD,4DAKC;AAED;;GAEG;AACH,MAAM,sBAAsB,GAAG,IAAI,CAAC;AAEpC;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAa,qBAAqB;IAChC;;;;;OAKG;IACH,cAAc,CAAC,MAA0B;QACvC,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC;QAEhD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,2BAA2B,CACnC,iDAAiD,CAAC,EAAE,CACrD,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,2BAA2B,CACnC,8CAA8C,CAAC,EAAE,CAClD,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,2BAA2B,CACnC,gBAAgB,CAAC,mCAAmC,CAAC,GAAG,CACzD,CAAC;QACJ,CAAC;QAED,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACtC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,MAAM,CAAC,YAAY,GAAG,GAAG,EAAE,CAAC;gBACxE,MAAM,IAAI,2BAA2B,CACnC,iDAAiD,MAAM,CAAC,YAAY,EAAE,CACvE,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,QAAQ,CAAC,MAA0B;QACvC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAE5B,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC;QAChD,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,IAAI,sBAAsB,CAAC;QAEnE,IAAI,CAAC;YACH,yEAAyE;YACzE,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAEjD,sCAAsC;YACtC,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;YACpE,MAAM,SAAS,GAAc,WAAW,CAAC,SAAS,CAAC;YAEnD,iCAAiC;YACjC,sDAAsD;YACtD,uEAAuE;YACvE,MAAM,MAAM,GAAG,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC;YAC7C,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;YAErC,uEAAuE;YACvE,4DAA4D;YAC5D,wEAAwE;YACxE,mEAAmE;YACnE,MAAM,aAAa,GAAG,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC;YAE3C,oDAAoD;YACpD,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;YAE/E,4CAA4C;YAC5C,gFAAgF;YAChF,MAAM,gBAAgB,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAC1D,MAAM,EACN,SAAS,EACT,YAAY,CAAC,CAAC,CAAC,CAChB,CAAC;YAEF,0BAA0B;YAC1B,MAAM,SAAS,GAAe,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtD,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,YAAY;gBAC1B,KAAK,EAAE,KAAK;gBACZ,eAAe,EAAE,gBAAgB,CAAC,CAAC,CAAC;aACrC,CAAC,CAAC,CAAC;YAEJ,mDAAmD;YACnD,uEAAuE;YACvE,gEAAgE;YAChE,oEAAoE;YACpE,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;YACtB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,GAAG,MAAM,EAAE,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;YAEpE,OAAO;gBACL,SAAS;gBACT,gBAAgB;gBAChB,SAAS;gBACT,MAAM,EAAE;oBACN,WAAW,EAAE,CAAC;oBACd,SAAS,EAAE,CAAC;oBACZ,YAAY;iBACb;gBACD,KAAK;aACN,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IACE,KAAK,YAAY,2BAA2B;gBAC5C,KAAK,YAAY,wBAAwB,EACzC,CAAC;gBACD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,MAAM,IAAI,wBAAwB,CAChC,sCAAsC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAC/F,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;;;;;;;;;OAWG;IACK,WAAW,CACjB,MAAc,EACd,CAAS,EACT,CAAS,EACT,OAAe;QAEf,4DAA4D;QAC5D,uDAAuD;QACvD,MAAM,YAAY,GAAa,CAAC,MAAM,CAAC,CAAC;QAExC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,IAAI,MAAM,GAAG,EAAE,CAAC;YAEhB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC7D,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;YACzC,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;IAClC,CAAC;IAED;;;;;;;;;;OAUG;IACK,KAAK,CAAC,wBAAwB,CACpC,MAAgB,EAChB,SAAoB,EACpB,OAAe;QAEf,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QAEtB,MAAM,gBAAgB,GAAiB,EAAE,CAAC;QAE1C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,8CAA8C;YAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACrC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAAC,GAAW;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;QAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;OAMG;IACK,GAAG,CAAC,CAAS,EAAE,CAAS;QAC9B,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,OAAO,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;;OAOG;IACK,MAAM,CAAC,IAAY,EAAE,GAAW,EAAE,CAAS;QACjD,IAAI,CAAC,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC;QAExB,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAEzB,OAAO,GAAG,GAAG,EAAE,EAAE,CAAC;YAChB,IAAI,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;gBACpB,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;YACtC,CAAC;YACD,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC;YAChB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CAAC,KAAa;QACtC,IAAI,KAAK,KAAK,EAAE,EAAE,CAAC;YACjB,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;QACzD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7D,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACK,SAAS,CAAC,CAAS;QACzB,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,IAAI,CAAC,CAAC;QACd,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA/RD,sDA+RC"}