@brightchain/brightchain-lib 0.19.0 → 0.21.0

package/src/lib/services/membershipProofService.js

@@ -0,0 +1,361 @@
+"use strict";
+/**
+ * @fileoverview MembershipProofService — generates and verifies ring signatures
+ * proving quorum membership without revealing which specific member created content.
+ *
+ * Uses an Abe-Ohkubo-Suzuki (AOS) style ring signature scheme built on
+ * secp256k1 ECDSA primitives. The proof is bound to a specific content hash,
+ * preventing reuse across different content items.
+ *
+ * Ring Signature Scheme:
+ * - For a ring of n public keys, the signer (at index s) generates a ring
+ *   of challenges and responses such that the verification equation holds
+ *   for all members, but only the signer knows which position is theirs.
+ * - The challenge chain is: c_{i+1} = H(L || m || g^{r_i} * y_i^{c_i})
+ *   where L is the key set, m is the message, g is the generator, y_i is
+ *   the public key at index i, r_i is the response, and c_i is the challenge.
+ * - The ring closes when c_0 (computed) matches c_0 (stored).
+ *
+ * @see Requirements 18
+ * @see Design: MembershipProofService (Section 7)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MembershipProofService = void 0;
+const sha3_1 = require("@noble/hashes/sha3");
+const secp256k1 = require("secp256k1");
+/** Proof format version byte for forward compatibility */
+const PROOF_VERSION = 0x01;
+/**
+ * Compute a 32-byte challenge hash from the ring context.
+ *
+ * H(keyRing || contentHash || point) → 32 bytes
+ *
+ * Uses SHA3-512 truncated to 32 bytes to produce a scalar suitable
+ * for secp256k1 operations.
+ */
+function computeChallenge(keyRing, contentHash, point) {
+    const input = new Uint8Array(keyRing.length + contentHash.length + point.length);
+    input.set(keyRing, 0);
+    input.set(contentHash, keyRing.length);
+    input.set(point, keyRing.length + contentHash.length);
+    const fullHash = (0, sha3_1.sha3_512)(input);
+    // Truncate to 32 bytes for secp256k1 scalar
+    return fullHash.slice(0, 32);
+}
+/**
+ * Serialize the sorted key ring into a single buffer for hashing.
+ * Keys are sorted lexicographically to ensure deterministic ordering
+ * regardless of input order.
+ */
+function serializeKeyRing(memberPublicKeys) {
+    // Sort keys lexicographically for deterministic ring ordering
+    const sorted = [...memberPublicKeys].sort((a, b) => {
+        const len = Math.min(a.length, b.length);
+        for (let i = 0; i < len; i++) {
+            if (a[i] !== b[i])
+                return a[i] - b[i];
+        }
+        return a.length - b.length;
+    });
+    const totalLen = sorted.reduce((sum, k) => sum + k.length, 0);
+    const result = new Uint8Array(totalLen);
+    let offset = 0;
+    for (const key of sorted) {
+        result.set(key, offset);
+        offset += key.length;
+    }
+    return result;
+}
+/**
+ * Find the index of the signer's public key in the member key array.
+ * Derives the public key from the private key and matches against
+ * compressed public keys.
+ */
+function findSignerIndex(signerPrivateKey, memberPublicKeys) {
+    const signerPubKey = secp256k1.publicKeyCreate(signerPrivateKey, true);
+    for (let i = 0; i < memberPublicKeys.length; i++) {
+        const compressed = secp256k1.publicKeyConvert(memberPublicKeys[i], true);
+        if (compressed.length === signerPubKey.length &&
+            compressed.every((byte, idx) => byte === signerPubKey[idx])) {
+            return i;
+        }
+    }
+    return -1;
+}
+/**
+ * Generate cryptographically secure random bytes.
+ */
+function getRandomBytes(length) {
+    const bytes = new Uint8Array(length);
+    // Use Node.js crypto for secure random generation
+    // eslint-disable-next-line @typescript-eslint/no-require-imports
+    const crypto = require('crypto');
+    crypto.randomFillSync(bytes);
+    return bytes;
+}
+/**
+ * Generate a valid random secp256k1 private key (scalar).
+ * Ensures the key is valid (non-zero, less than curve order).
+ */
+function generateRandomScalar() {
+    let key;
+    do {
+        key = getRandomBytes(32);
+    } while (!secp256k1.privateKeyVerify(key));
+    return key;
+}
+/**
+ * Compute g^response * pubKey^challenge (EC point addition).
+ *
+ * This is the core ring signature verification equation for one step:
+ *   R_i = g * r_i + y_i * c_i
+ *
+ * Where g is the secp256k1 generator, r_i is the response scalar,
+ * y_i is the public key, and c_i is the challenge scalar.
+ */
+function computeRingPoint(response, publicKey, challenge) {
+    // g * response = publicKeyCreate(response)
+    const gR = secp256k1.publicKeyCreate(response, true);
+    // pubKey * challenge = publicKeyTweakMul(pubKey, challenge)
+    const compressed = secp256k1.publicKeyConvert(publicKey, true);
+    const yC = secp256k1.publicKeyTweakMul(compressed, challenge);
+    // Point addition: gR + yC
+    return secp256k1.publicKeyCombine([gR, yC], true);
+}
+/**
+ * Subtract two 32-byte scalars modulo the secp256k1 curve order.
+ * result = (a - b) mod n
+ *
+ * Uses privateKeyNegate and privateKeyTweakAdd:
+ *   a - b = a + (-b)
+ */
+function scalarSubtract(a, b) {
+    // Negate b: -b mod n
+    const negB = new Uint8Array(b);
+    secp256k1.privateKeyNegate(negB);
+    // a + (-b) mod n
+    const result = new Uint8Array(a);
+    secp256k1.privateKeyTweakAdd(result, negB);
+    return result;
+}
+/**
+ * Multiply two 32-byte scalars modulo the secp256k1 curve order.
+ * result = (a * b) mod n
+ *
+ * Uses privateKeyTweakMul which computes (key * tweak) mod n.
+ */
+function scalarMultiply(a, b) {
+    const result = new Uint8Array(a);
+    secp256k1.privateKeyTweakMul(result, b);
+    return result;
+}
+/**
+ * MembershipProofService generates and verifies ring signatures
+ * proving quorum membership without revealing which member.
+ *
+ * The ring signature scheme ensures:
+ * - Any member can generate a valid proof
+ * - The proof is bound to specific content (content hash)
+ * - Verification succeeds against the full member key set
+ * - No information about which member generated the proof is leaked
+ *
+ * Proof format (serialized):
+ * [version: 1 byte] [n: 2 bytes (uint16 BE)] [c0: 32 bytes] [r0: 32 bytes] ... [r_{n-1}: 32 bytes]
+ *
+ * @template TID - Platform ID type for frontend/backend DTO compatibility
+ */
+class MembershipProofService {
+    /**
+     * Generate a ring signature proving the signer is one of the current
+     * quorum members. The proof is bound to the specific content hash.
+     *
+     * Algorithm (AOS ring signature):
+     * 1. Find signer's index s in the key ring
+     * 2. Generate random k (nonce) for the signer's position
+     * 3. Compute initial point: g^k
+     * 4. For positions (s+1) to (s-1) mod n, generate random responses
+     *    and compute the challenge chain
+     * 5. Close the ring by computing the signer's response:
+     *    r_s = k - c_s * privateKey mod n
+     *
+     * @param signerPrivateKey - The signer's secp256k1 private key (32 bytes)
+     * @param memberPublicKeys - Public keys of all current quorum members
+     * @param contentHash - Hash of the content being signed
+     * @returns The serialized ring signature proof
+     * @throws Error if signer is not in the member set or member set is empty
+     */
+    async generateProof(signerPrivateKey, memberPublicKeys, contentHash) {
+        const n = memberPublicKeys.length;
+        if (n === 0) {
+            throw new Error('Member public key set must not be empty');
+        }
+        // Find signer's position in the ring
+        const signerIndex = findSignerIndex(signerPrivateKey, memberPublicKeys);
+        if (signerIndex === -1) {
+            throw new Error('Signer is not a member of the provided key set');
+        }
+        const keyRing = serializeKeyRing(memberPublicKeys);
+        // Step 1: Generate random nonce k for the signer
+        const k = generateRandomScalar();
+        // Step 2: Compute the initial point g^k
+        const gK = secp256k1.publicKeyCreate(k, true);
+        // Step 3: Compute challenge at position (signerIndex + 1) mod n
+        const challenges = new Array(n);
+        const responses = new Array(n);
+        const nextIdx = (signerIndex + 1) % n;
+        challenges[nextIdx] = computeChallenge(keyRing, contentHash, gK);
+        // Step 4: For each position from (s+1) to (s-1), generate random
+        // responses and compute the challenge chain
+        for (let offset = 1; offset < n; offset++) {
+            const i = (signerIndex + offset) % n;
+            const nextI = (i + 1) % n;
+            // Generate random response for position i
+            responses[i] = generateRandomScalar();
+            // Compute ring point: g^{r_i} * y_i^{c_i}
+            const point = computeRingPoint(responses[i], memberPublicKeys[i], challenges[i]);
+            // Compute next challenge
+            challenges[nextI] = computeChallenge(keyRing, contentHash, point);
+        }
+        // Step 5: Close the ring — compute signer's response
+        // r_s = k - c_s * privateKey mod n
+        const cTimesKey = scalarMultiply(challenges[signerIndex], signerPrivateKey);
+        responses[signerIndex] = scalarSubtract(k, cTimesKey);
+        // Wipe the nonce from memory
+        k.fill(0);
+        // Serialize the proof
+        return this.serializeProof(challenges[0], responses, n);
+    }
+    /**
+     * Verify a membership proof against the current member set and content hash.
+     *
+     * Algorithm:
+     * 1. Deserialize the proof to extract c_0 and all responses
+     * 2. Recompute the challenge chain starting from c_0:
+     *    For each i: point_i = g^{r_i} * y_i^{c_i}, c_{i+1} = H(L, m, point_i)
+     * 3. The ring is valid if the recomputed c_0 matches the stored c_0
+     *
+     * @param proof - The serialized ring signature proof
+     * @param memberPublicKeys - Public keys of all current quorum members
+     * @param contentHash - Hash of the content the proof should be bound to
+     * @returns True if the proof is valid
+     */
+    async verifyProof(proof, memberPublicKeys, contentHash) {
+        try {
+            const n = memberPublicKeys.length;
+            if (n === 0) {
+                return false;
+            }
+            // Deserialize the proof
+            const parsed = this.deserializeProof(proof);
+            if (!parsed) {
+                return false;
+            }
+            const { c0, responses } = parsed;
+            // The proof must have the same number of responses as member keys
+            if (responses.length !== n) {
+                return false;
+            }
+            // Validate all public keys
+            for (const key of memberPublicKeys) {
+                if (!secp256k1.publicKeyVerify(key)) {
+                    return false;
+                }
+            }
+            const keyRing = serializeKeyRing(memberPublicKeys);
+            // Recompute the challenge chain
+            let currentChallenge = c0;
+            for (let i = 0; i < n; i++) {
+                // Validate the response is a valid scalar
+                if (!secp256k1.privateKeyVerify(responses[i])) {
+                    return false;
+                }
+                // Compute ring point: g^{r_i} * y_i^{c_i}
+                const point = computeRingPoint(responses[i], memberPublicKeys[i], currentChallenge);
+                // Compute next challenge
+                currentChallenge = computeChallenge(keyRing, contentHash, point);
+            }
+            // The ring is valid if we arrive back at c_0
+            if (currentChallenge.length !== c0.length) {
+                return false;
+            }
+            // Constant-time comparison to prevent timing attacks
+            let diff = 0;
+            for (let i = 0; i < c0.length; i++) {
+                diff |= currentChallenge[i] ^ c0[i];
+            }
+            return diff === 0;
+        }
+        catch {
+            return false;
+        }
+    }
+    /**
+     * Serialize a ring signature proof into bytes.
+     *
+     * Format:
+     * [version: 1 byte] [n: 2 bytes uint16 BE] [c0: 32 bytes] [r_0: 32 bytes] ... [r_{n-1}: 32 bytes]
+     */
+    serializeProof(c0, responses, n) {
+        // 1 (version) + 2 (n) + 32 (c0) + n * 32 (responses)
+        const totalLen = 1 + 2 + 32 + n * 32;
+        const result = new Uint8Array(totalLen);
+        let offset = 0;
+        // Version byte
+        result[offset] = PROOF_VERSION;
+        offset += 1;
+        // Ring size as uint16 big-endian
+        result[offset] = (n >> 8) & 0xff;
+        result[offset + 1] = n & 0xff;
+        offset += 2;
+        // Initial challenge c0
+        result.set(c0, offset);
+        offset += 32;
+        // Responses
+        for (let i = 0; i < n; i++) {
+            result.set(responses[i], offset);
+            offset += 32;
+        }
+        return result;
+    }
+    /**
+     * Deserialize a ring signature proof from bytes.
+     *
+     * @returns Parsed proof components or null if the format is invalid
+     */
+    deserializeProof(proof) {
+        // Minimum size: 1 (version) + 2 (n) + 32 (c0) + 32 (at least 1 response)
+        if (proof.length < 1 + 2 + 32 + 32) {
+            return null;
+        }
+        let offset = 0;
+        // Check version
+        const version = proof[offset];
+        if (version !== PROOF_VERSION) {
+            return null;
+        }
+        offset += 1;
+        // Read ring size
+        const n = (proof[offset] << 8) | proof[offset + 1];
+        offset += 2;
+        if (n === 0) {
+            return null;
+        }
+        // Verify total length matches
+        const expectedLen = 1 + 2 + 32 + n * 32;
+        if (proof.length !== expectedLen) {
+            return null;
+        }
+        // Read c0
+        const c0 = proof.slice(offset, offset + 32);
+        offset += 32;
+        // Read responses
+        const responses = [];
+        for (let i = 0; i < n; i++) {
+            responses.push(proof.slice(offset, offset + 32));
+            offset += 32;
+        }
+        return { c0, responses };
+    }
+}
+exports.MembershipProofService = MembershipProofService;
+//# sourceMappingURL=membershipProofService.js.map

package/src/lib/services/membershipProofService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"membershipProofService.js","sourceRoot":"","sources":["../../../../../brightchain-lib/src/lib/services/membershipProofService.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;GAmBG;;;AAGH,6CAA8C;AAC9C,uCAAuC;AAIvC,0DAA0D;AAC1D,MAAM,aAAa,GAAG,IAAI,CAAC;AAE3B;;;;;;;GAOG;AACH,SAAS,gBAAgB,CACvB,OAAmB,EACnB,WAAuB,EACvB,KAAiB;IAEjB,MAAM,KAAK,GAAG,IAAI,UAAU,CAC1B,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CACnD,CAAC;IACF,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IACvC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAEtD,MAAM,QAAQ,GAAG,IAAA,eAAQ,EAAC,KAAK,CAAC,CAAC;IACjC,4CAA4C;IAC5C,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC/B,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,gBAA8B;IACtD,8DAA8D;IAC9D,MAAM,MAAM,GAAG,CAAC,GAAG,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;IACxC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CACtB,gBAA4B,EAC5B,gBAA8B;IAE9B,MAAM,YAAY,GAAG,SAAS,CAAC,eAAe,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;IAEvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,MAAM,UAAU,GAAG,SAAS,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACzE,IACE,UAAU,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM;YACzC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,KAAK,YAAY,CAAC,GAAG,CAAC,CAAC,EAC3D,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,MAAc;IACpC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACrC,kDAAkD;IAClD,iEAAiE;IACjE,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB;IAC3B,IAAI,GAAe,CAAC;IACpB,GAAG,CAAC;QACF,GAAG,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC,QAAQ,CAAC,SAAS,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE;IAC3C,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACvB,QAAoB,EACpB,SAAqB,EACrB,SAAqB;IAErB,2CAA2C;IAC3C,MAAM,EAAE,GAAG,SAAS,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAErD,4DAA4D;IAC5D,MAAM,UAAU,GAAG,SAAS,CAAC,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAC/D,MAAM,EAAE,GAAG,SAAS,CAAC,iBAAiB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAE9D,0BAA0B;IAC1B,OAAO,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACpD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,CAAa,EAAE,CAAa;IAClD,qBAAqB;IACrB,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAEjC,iBAAiB;IACjB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACjC,SAAS,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,CAAa,EAAE,CAAa;IAClD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACjC,SAAS,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAa,sBAAsB;IAMjC;;;;;;;;;;;;;;;;;;OAkBG;IACH,KAAK,CAAC,aAAa,CACjB,gBAA4B,EAC5B,gBAA8B,EAC9B,WAAuB;QAEvB,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QAED,qCAAqC;QACrC,MAAM,WAAW,GAAG,eAAe,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;QACxE,IAAI,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;QAEnD,iDAAiD;QACjD,MAAM,CAAC,GAAG,oBAAoB,EAAE,CAAC;QAEjC,wCAAwC;QACxC,MAAM,EAAE,GAAG,SAAS,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAE9C,gEAAgE;QAChE,MAAM,UAAU,GAAiB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,SAAS,GAAiB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QAE7C,MAAM,OAAO,GAAG,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACtC,UAAU,CAAC,OAAO,CAAC,GAAG,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC;QAEjE,iEAAiE;QACjE,4CAA4C;QAC5C,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,CAAC,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAE1B,0CAA0C;YAC1C,SAAS,CAAC,CAAC,CAAC,GAAG,oBAAoB,EAAE,CAAC;YAEtC,0CAA0C;YAC1C,MAAM,KAAK,GAAG,gBAAgB,CAC5B,SAAS,CAAC,CAAC,CAAC,EACZ,gBAAgB,CAAC,CAAC,CAAC,EACnB,UAAU,CAAC,CAAC,CAAC,CACd,CAAC;YAEF,yBAAyB;YACzB,UAAU,CAAC,KAAK,CAAC,GAAG,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;QACpE,CAAC;QAED,qDAAqD;QACrD,mCAAmC;QACnC,MAAM,SAAS,GAAG,cAAc,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAC5E,SAAS,CAAC,WAAW,CAAC,GAAG,cAAc,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAEtD,6BAA6B;QAC7B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEV,sBAAsB;QACtB,OAAO,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,WAAW,CACf,KAAiB,EACjB,gBAA8B,EAC9B,WAAuB;QAEvB,IAAI,CAAC;YACH,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC;YAClC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,OAAO,KAAK,CAAC;YACf,CAAC;YAED,wBAAwB;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,KAAK,CAAC;YACf,CAAC;YAED,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;YAEjC,kEAAkE;YAClE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC3B,OAAO,KAAK,CAAC;YACf,CAAC;YAED,2BAA2B;YAC3B,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBACnC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;oBACpC,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;YAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;YAEnD,gCAAgC;YAChC,IAAI,gBAAgB,GAAG,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,0CAA0C;gBAC1C,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC9C,OAAO,KAAK,CAAC;gBACf,CAAC;gBAED,0CAA0C;gBAC1C,MAAM,KAAK,GAAG,gBAAgB,CAC5B,SAAS,CAAC,CAAC,CAAC,EACZ,gBAAgB,CAAC,CAAC,CAAC,EACnB,gBAAgB,CACjB,CAAC;gBAEF,yBAAyB;gBACzB,gBAAgB,GAAG,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YACnE,CAAC;YAED,6CAA6C;YAC7C,IAAI,gBAAgB,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC;gBAC1C,OAAO,KAAK,CAAC;YACf,CAAC;YAED,qDAAqD;YACrD,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;YACD,OAAO,IAAI,KAAK,CAAC,CAAC;QACpB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,cAAc,CACpB,EAAc,EACd,SAAuB,EACvB,CAAS;QAET,qDAAqD;QACrD,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;QAExC,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,eAAe;QACf,MAAM,CAAC,MAAM,CAAC,GAAG,aAAa,CAAC;QAC/B,MAAM,IAAI,CAAC,CAAC;QAEZ,iCAAiC;QACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QACjC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QAC9B,MAAM,IAAI,CAAC,CAAC;QAEZ,uBAAuB;QACvB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACvB,MAAM,IAAI,EAAE,CAAC;QAEb,YAAY;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACjC,MAAM,IAAI,EAAE,CAAC;QACf,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,gBAAgB,CACtB,KAAiB;QAEjB,yEAAyE;QACzE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,gBAAgB;QAChB,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAI,OAAO,KAAK,aAAa,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,IAAI,CAAC,CAAC;QAEZ,iBAAiB;QACjB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,IAAI,CAAC,CAAC;QAEZ,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACd,CAAC;QAED,8BAA8B;QAC9B,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,UAAU;QACV,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC;QAC5C,MAAM,IAAI,EAAE,CAAC;QAEb,iBAAiB;QACjB,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;YACjD,MAAM,IAAI,EAAE,CAAC;QACf,CAAC;QAED,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;IAC3B,CAAC;CACF;AAlQD,wDAkQC"}