@fluxpointstudios/orynq-sdk-midnight-prover 0.1.0

package/dist/proofs/selective-disclosure.js

@@ -0,0 +1,629 @@
+/**
+ * @fileoverview Selective disclosure proof generation and verification.
+ *
+ * Location: packages/midnight-prover/src/proofs/selective-disclosure.ts
+ *
+ * Summary:
+ * This module implements the SelectiveDisclosureProver class which generates ZK proofs
+ * demonstrating that a specific span exists in a trace bundle without revealing other
+ * spans. It uses Merkle proofs for inclusion verification and supports optional
+ * disclosure of the span and event data.
+ *
+ * Usage:
+ * - Used by the MidnightProver to generate selective disclosure proofs
+ * - Integrates with process-trace Merkle tree utilities
+ * - Binds proofs to Cardano anchor transactions for cross-chain verification
+ *
+ * @example
+ * ```typescript
+ * import { SelectiveDisclosureProver } from './selective-disclosure.js';
+ *
+ * const prover = new SelectiveDisclosureProver();
+ *
+ * const proof = await prover.generateProof({
+ *   bundle: traceBundle,
+ *   spanId: 'span-123',
+ *   merkleRoot: traceBundle.merkleRoot,
+ *   cardanoAnchorTxHash: 'txhash...',
+ * });
+ *
+ * const isValid = await prover.verifyProof(proof);
+ * ```
+ */
+import { sha256StringHex, canonicalize, } from "@fluxpointstudios/orynq-sdk-core/utils";
+import { MidnightProverError, MidnightProverException, } from "../types.js";
+/**
+ * Domain separation prefixes for selective disclosure proofs.
+ */
+const DISCLOSURE_DOMAIN_PREFIXES = {
+    proof: "poi-prover:disclosure:v1|",
+    witness: "poi-prover:disclosure-witness:v1|",
+    publicInput: "poi-prover:disclosure-input:v1|",
+    span: "poi-trace:span:v1|",
+    leaf: "poi-trace:leaf:v1|",
+    node: "poi-trace:node:v1|",
+};
+// =============================================================================
+// MERKLE UTILITIES
+// =============================================================================
+/**
+ * Compute the hash for a span including its event hashes.
+ *
+ * The span hash is computed as:
+ * H("poi-trace:span:v1|" + canon(spanHeaderWithoutHash) + "|" + eventHashes joined by "|")
+ *
+ * @param span - The span to compute hash for
+ * @param eventHashes - Array of event hashes in sequence order
+ * @returns Promise resolving to the span hash as a hex string
+ */
+export async function computeSpanHash(span, eventHashes) {
+    // Extract span header (all fields except hash)
+    const spanHeader = {
+        id: span.id,
+        spanSeq: span.spanSeq,
+        name: span.name,
+        status: span.status,
+        visibility: span.visibility,
+        startedAt: span.startedAt,
+        eventIds: span.eventIds,
+        childSpanIds: span.childSpanIds,
+    };
+    // Include optional fields only if they exist
+    if (span.parentSpanId !== undefined) {
+        spanHeader.parentSpanId = span.parentSpanId;
+    }
+    if (span.endedAt !== undefined) {
+        spanHeader.endedAt = span.endedAt;
+    }
+    if (span.durationMs !== undefined) {
+        spanHeader.durationMs = span.durationMs;
+    }
+    if (span.metadata !== undefined) {
+        spanHeader.metadata = span.metadata;
+    }
+    // Canonicalize the span header
+    const canonicalHeader = canonicalize(spanHeader, { removeNulls: true });
+    // Build the hash input: prefix + canon(header) + "|" + eventHashes joined by "|"
+    let hashInput = DISCLOSURE_DOMAIN_PREFIXES.span + canonicalHeader;
+    // Append event hashes if any exist
+    if (eventHashes.length > 0) {
+        hashInput += "|" + eventHashes.join("|");
+    }
+    return sha256StringHex(hashInput);
+}
+/**
+ * Compute the leaf hash for a span.
+ *
+ * The leaf hash is computed as: H("poi-trace:leaf:v1|" + spanHash)
+ *
+ * @param spanHash - The span hash
+ * @returns Promise resolving to the leaf hash
+ */
+export async function computeLeafHash(spanHash) {
+    return sha256StringHex(DISCLOSURE_DOMAIN_PREFIXES.leaf + spanHash);
+}
+/**
+ * Compute the parent node hash from two children.
+ *
+ * The node hash is computed as: H("poi-trace:node:v1|" + left + "|" + right)
+ *
+ * @param left - Left child hash
+ * @param right - Right child hash
+ * @returns Promise resolving to the parent node hash
+ */
+export async function computeNodeHash(left, right) {
+    return sha256StringHex(DISCLOSURE_DOMAIN_PREFIXES.node + left + "|" + right);
+}
+/**
+ * Generate a Merkle inclusion proof for a span in a bundle.
+ *
+ * @param bundle - The trace bundle containing the span
+ * @param spanId - ID of the span to prove inclusion for
+ * @returns MerkleInclusionResult with proof and span data
+ * @throws MidnightProverException if span not found
+ */
+export async function generateMerkleInclusionProof(bundle, spanId) {
+    const { privateRun } = bundle;
+    const spans = privateRun.spans;
+    const events = privateRun.events;
+    // Find the span
+    const span = spans.find((s) => s.id === spanId);
+    if (!span) {
+        throw new MidnightProverException(MidnightProverError.SPAN_NOT_FOUND, `Span not found: ${spanId}`);
+    }
+    // Create event map for quick lookup
+    const eventMap = new Map();
+    for (const event of events) {
+        eventMap.set(event.id, event);
+    }
+    // Get events for this span in seq order
+    const spanEvents = span.eventIds
+        .map((id) => eventMap.get(id))
+        .filter((e) => e !== undefined)
+        .sort((a, b) => a.seq - b.seq);
+    const eventHashes = spanEvents.map((e) => e.hash ?? "");
+    // Compute span hash
+    const spanHash = await computeSpanHash(span, eventHashes);
+    // Sort spans by spanSeq for consistent ordering
+    const sortedSpans = [...spans].sort((a, b) => a.spanSeq - b.spanSeq);
+    const spanIndex = sortedSpans.findIndex((s) => s.id === spanId);
+    if (spanIndex === -1) {
+        throw new MidnightProverException(MidnightProverError.SPAN_NOT_FOUND, `Span not found in sorted spans: ${spanId}`);
+    }
+    // Build leaf hashes for all spans
+    const leafHashes = [];
+    for (const s of sortedSpans) {
+        const sEvents = s.eventIds
+            .map((id) => eventMap.get(id))
+            .filter((e) => e !== undefined)
+            .sort((a, b) => a.seq - b.seq);
+        const sEventHashes = sEvents.map((e) => e.hash ?? "");
+        const sSpanHash = await computeSpanHash(s, sEventHashes);
+        const sLeafHash = await computeLeafHash(sSpanHash);
+        leafHashes.push(sLeafHash);
+    }
+    // Compute the leaf hash for the target span
+    const leafHash = await computeLeafHash(spanHash);
+    // Generate Merkle proof (sibling path from leaf to root)
+    const siblings = [];
+    if (leafHashes.length > 1) {
+        let currentLevel = [...leafHashes];
+        let currentIndex = spanIndex;
+        while (currentLevel.length > 1) {
+            const isLeftChild = currentIndex % 2 === 0;
+            const siblingIndex = isLeftChild ? currentIndex + 1 : currentIndex - 1;
+            // Handle odd-leaf case: if no sibling exists, duplicate current
+            let siblingHash;
+            if (siblingIndex >= currentLevel.length) {
+                const currentHash = currentLevel[currentIndex];
+                if (!currentHash) {
+                    throw new MidnightProverException(MidnightProverError.PROOF_GENERATION_FAILED, "Unexpected undefined hash at current index");
+                }
+                siblingHash = currentHash;
+            }
+            else {
+                const hash = currentLevel[siblingIndex];
+                if (!hash) {
+                    throw new MidnightProverException(MidnightProverError.PROOF_GENERATION_FAILED, "Unexpected undefined hash at sibling index");
+                }
+                siblingHash = hash;
+            }
+            siblings.push({
+                hash: siblingHash,
+                position: isLeftChild ? "right" : "left",
+            });
+            // Build next level
+            const nextLevel = [];
+            for (let i = 0; i < currentLevel.length; i += 2) {
+                const left = currentLevel[i] ?? "";
+                const right = i + 1 < currentLevel.length ? (currentLevel[i + 1] ?? left) : left;
+                const parentHash = await computeNodeHash(left, right);
+                nextLevel.push(parentHash);
+            }
+            currentLevel = nextLevel;
+            currentIndex = Math.floor(currentIndex / 2);
+        }
+    }
+    // Compute root hash for verification
+    const rootHash = leafHashes.length === 1 ? leafHashes[0] : await computeMerkleRoot(leafHashes);
+    if (!rootHash) {
+        throw new MidnightProverException(MidnightProverError.PROOF_GENERATION_FAILED, "Failed to compute Merkle root");
+    }
+    const merkleProof = {
+        leafHash,
+        leafIndex: spanIndex,
+        siblings,
+        rootHash,
+    };
+    return {
+        spanHash,
+        leafHash,
+        merkleProof,
+        span,
+        events: spanEvents,
+    };
+}
+/**
+ * Compute the Merkle root from leaf hashes.
+ *
+ * @param leafHashes - Array of leaf hashes
+ * @returns Promise resolving to the Merkle root hash
+ */
+export async function computeMerkleRoot(leafHashes) {
+    if (leafHashes.length === 0) {
+        return "";
+    }
+    if (leafHashes.length === 1) {
+        return leafHashes[0] ?? "";
+    }
+    let currentLevel = [...leafHashes];
+    while (currentLevel.length > 1) {
+        const nextLevel = [];
+        for (let i = 0; i < currentLevel.length; i += 2) {
+            const left = currentLevel[i] ?? "";
+            const right = i + 1 < currentLevel.length ? (currentLevel[i + 1] ?? left) : left;
+            const parentHash = await computeNodeHash(left, right);
+            nextLevel.push(parentHash);
+        }
+        currentLevel = nextLevel;
+    }
+    return currentLevel[0] ?? "";
+}
+/**
+ * Verify a Merkle inclusion proof.
+ *
+ * @param proof - The Merkle proof to verify
+ * @returns Promise resolving to true if valid
+ */
+export async function verifyMerkleProof(proof) {
+    let currentHash = proof.leafHash;
+    for (const sibling of proof.siblings) {
+        let left;
+        let right;
+        if (sibling.position === "left") {
+            left = sibling.hash;
+            right = currentHash;
+        }
+        else {
+            left = currentHash;
+            right = sibling.hash;
+        }
+        currentHash = await computeNodeHash(left, right);
+    }
+    return currentHash === proof.rootHash;
+}
+/**
+ * Verify span inclusion using the proof and span data.
+ *
+ * @param proof - The Merkle proof
+ * @param span - The span data
+ * @param events - The events belonging to the span
+ * @returns Promise resolving to true if span is validly included
+ */
+export async function verifySpanInclusion(proof, span, events) {
+    // Sort events by seq for deterministic order
+    const sortedEvents = [...events].sort((a, b) => a.seq - b.seq);
+    const eventHashes = sortedEvents.map((e) => e.hash ?? "");
+    // Recompute span hash
+    const spanHash = await computeSpanHash(span, eventHashes);
+    // Compute expected leaf hash
+    const computedLeafHash = await computeLeafHash(spanHash);
+    // Verify leaf hash matches
+    if (computedLeafHash !== proof.leafHash) {
+        return false;
+    }
+    // Verify Merkle proof
+    return verifyMerkleProof(proof);
+}
+// =============================================================================
+// SELECTIVE DISCLOSURE PROVER
+// =============================================================================
+/**
+ * SelectiveDisclosureProver generates and verifies ZK proofs of span membership.
+ *
+ * This prover creates a proof that a specific span exists in a trace bundle
+ * without revealing other spans. The proof uses Merkle tree inclusion proofs
+ * and optionally includes the disclosed span and event data.
+ *
+ * @example
+ * ```typescript
+ * const prover = new SelectiveDisclosureProver();
+ * const proof = await prover.generateProof(input);
+ *
+ * // Proof includes optional span data for verification
+ * console.log(proof.disclosedSpan?.name); // e.g., "inference"
+ * ```
+ */
+export class SelectiveDisclosureProver {
+    debug;
+    includeSpanData;
+    includeEventData;
+    /**
+     * Create a new SelectiveDisclosureProver instance.
+     *
+     * @param options - Configuration options
+     */
+    constructor(options = {}) {
+        this.debug = options.debug ?? false;
+        this.includeSpanData = options.includeSpanData ?? true;
+        this.includeEventData = options.includeEventData ?? true;
+    }
+    /**
+     * Generate a selective disclosure proof.
+     *
+     * This method creates a ZK proof that a specific span exists in the
+     * trace bundle's Merkle tree. The proof binds to the Cardano anchor
+     * transaction for cross-chain verification.
+     *
+     * @param input - Selective disclosure input
+     * @returns Promise resolving to the disclosure proof
+     * @throws MidnightProverException on validation or generation failure
+     */
+    async generateProof(input) {
+        const startTime = performance.now();
+        // Validate input
+        this.validateInput(input);
+        if (this.debug) {
+            console.log("[SelectiveDisclosureProver] Generating proof for span:", input.spanId);
+        }
+        // Generate Merkle inclusion proof
+        const inclusionResult = await generateMerkleInclusionProof(input.bundle, input.spanId);
+        // Verify the computed root matches the expected root
+        if (inclusionResult.merkleProof.rootHash !== input.merkleRoot) {
+            throw new MidnightProverException(MidnightProverError.HASH_MISMATCH, `Computed Merkle root ${inclusionResult.merkleProof.rootHash} does not match expected ${input.merkleRoot}`);
+        }
+        // Generate proof bytes (mock implementation)
+        const proofBytes = await this.generateProofBytes(input, inclusionResult);
+        const endTime = performance.now();
+        const provingTimeMs = Math.round(endTime - startTime);
+        // Construct public inputs
+        const publicInputs = {
+            spanHash: inclusionResult.spanHash,
+            merkleRoot: input.merkleRoot,
+            cardanoAnchorTxHash: input.cardanoAnchorTxHash,
+        };
+        // Generate proof ID
+        const proofId = await this.generateProofId(publicInputs);
+        const proof = {
+            proofType: "selective-disclosure",
+            proofId,
+            proof: proofBytes,
+            createdAt: new Date().toISOString(),
+            provingTimeMs,
+            proofSizeBytes: proofBytes.length,
+            publicInputs,
+            disclosedSpan: this.includeSpanData ? inclusionResult.span : undefined,
+            disclosedEvents: this.includeEventData ? inclusionResult.events : undefined,
+        };
+        if (this.debug) {
+            console.log("[SelectiveDisclosureProver] Proof generated:", {
+                proofId,
+                spanHash: inclusionResult.spanHash,
+                leafIndex: inclusionResult.merkleProof.leafIndex,
+                siblingCount: inclusionResult.merkleProof.siblings.length,
+                provingTimeMs,
+            });
+        }
+        return proof;
+    }
+    /**
+     * Verify a selective disclosure proof.
+     *
+     * This method verifies the cryptographic validity of the proof and
+     * optionally verifies that disclosed span data matches the proof.
+     *
+     * @param proof - The disclosure proof to verify
+     * @returns Promise resolving to true if valid
+     */
+    async verifyProof(proof) {
+        try {
+            // Validate proof structure
+            if (proof.proofType !== "selective-disclosure") {
+                return false;
+            }
+            if (!proof.proof || proof.proof.length === 0) {
+                return false;
+            }
+            // Validate public inputs
+            const { publicInputs } = proof;
+            if (!publicInputs.spanHash || publicInputs.spanHash.length !== 64) {
+                return false;
+            }
+            if (!publicInputs.merkleRoot || publicInputs.merkleRoot.length !== 64) {
+                return false;
+            }
+            if (!publicInputs.cardanoAnchorTxHash || publicInputs.cardanoAnchorTxHash.length === 0) {
+                return false;
+            }
+            // Verify proof ID matches public inputs
+            const expectedProofId = await this.generateProofId(publicInputs);
+            if (proof.proofId !== expectedProofId) {
+                return false;
+            }
+            // Extract Merkle proof from proof bytes and verify
+            const merkleProofValid = await this.verifyProofBytes(proof.proof, publicInputs);
+            if (!merkleProofValid) {
+                return false;
+            }
+            // If disclosed span data is provided, verify it matches the span hash
+            if (proof.disclosedSpan && proof.disclosedEvents) {
+                // Note: This simplified verification doesn't check full Merkle path
+                // In production, we'd extract and verify the full Merkle proof
+                const sortedEvents = [...proof.disclosedEvents].sort((a, b) => a.seq - b.seq);
+                const eventHashes = sortedEvents.map((e) => e.hash ?? "");
+                const recomputedSpanHash = await computeSpanHash(proof.disclosedSpan, eventHashes);
+                if (recomputedSpanHash !== publicInputs.spanHash) {
+                    return false;
+                }
+            }
+            return true;
+        }
+        catch (error) {
+            if (this.debug) {
+                console.error("[SelectiveDisclosureProver] Verification error:", error);
+            }
+            return false;
+        }
+    }
+    /**
+     * Generate a proof without disclosure (membership proof only).
+     *
+     * This creates a proof that demonstrates span existence without
+     * revealing any span or event data.
+     *
+     * @param input - Selective disclosure input
+     * @returns Promise resolving to the disclosure proof without span data
+     */
+    async generateMembershipProof(input) {
+        // Create a new prover instance with disclosure disabled
+        const membershipProver = new SelectiveDisclosureProver({
+            debug: this.debug,
+            includeSpanData: false,
+            includeEventData: false,
+        });
+        return membershipProver.generateProof(input);
+    }
+    // ===========================================================================
+    // PRIVATE METHODS
+    // ===========================================================================
+    /**
+     * Validate disclosure input.
+     */
+    validateInput(input) {
+        if (!input.bundle) {
+            throw new MidnightProverException(MidnightProverError.MISSING_REQUIRED_FIELD, "Trace bundle is required");
+        }
+        if (!input.spanId || input.spanId.length === 0) {
+            throw new MidnightProverException(MidnightProverError.MISSING_REQUIRED_FIELD, "Span ID is required");
+        }
+        if (!input.merkleRoot || input.merkleRoot.length !== 64) {
+            throw new MidnightProverException(MidnightProverError.INVALID_INPUT, "Invalid Merkle root: must be 64-character hex string");
+        }
+        if (!input.cardanoAnchorTxHash || input.cardanoAnchorTxHash.length === 0) {
+            throw new MidnightProverException(MidnightProverError.MISSING_REQUIRED_FIELD, "Cardano anchor transaction hash is required");
+        }
+    }
+    /**
+     * Generate mock proof bytes.
+     * In a real implementation, this would call the Midnight proof server.
+     */
+    async generateProofBytes(input, inclusion) {
+        // Construct witness data (private inputs)
+        const witnessData = canonicalize({
+            spanId: input.spanId,
+            spanHash: inclusion.spanHash,
+            leafHash: inclusion.leafHash,
+            leafIndex: inclusion.merkleProof.leafIndex,
+            siblings: inclusion.merkleProof.siblings,
+            merkleRoot: input.merkleRoot,
+            cardanoAnchorTxHash: input.cardanoAnchorTxHash,
+        });
+        // Generate witness hash
+        const witnessHash = await sha256StringHex(DISCLOSURE_DOMAIN_PREFIXES.witness + witnessData);
+        // Construct public input commitment
+        const publicInputData = canonicalize({
+            spanHash: inclusion.spanHash,
+            merkleRoot: input.merkleRoot,
+            cardanoAnchorTxHash: input.cardanoAnchorTxHash,
+        });
+        const publicInputHash = await sha256StringHex(DISCLOSURE_DOMAIN_PREFIXES.publicInput + publicInputData);
+        // Generate mock proof: commitment to witness + public inputs
+        const proofCommitment = await sha256StringHex(DISCLOSURE_DOMAIN_PREFIXES.proof + witnessHash + "|" + publicInputHash);
+        // Encode Merkle proof siblings for inclusion in proof bytes
+        const siblingData = inclusion.merkleProof.siblings.map((s) => ({
+            hash: s.hash,
+            pos: s.position === "left" ? 0 : 1,
+        }));
+        const siblingJson = JSON.stringify(siblingData);
+        const siblingBytes = new TextEncoder().encode(siblingJson);
+        // Construct proof bytes:
+        // - version (1 byte)
+        // - commitment (32 bytes)
+        // - witness hash (32 bytes)
+        // - sibling count (2 bytes)
+        // - sibling data (variable)
+        const proofBytes = new Uint8Array(67 + siblingBytes.length);
+        proofBytes[0] = 0x01; // Version 1
+        // Copy commitment hash
+        const commitmentBytes = this.hexToBytes(proofCommitment);
+        proofBytes.set(commitmentBytes, 1);
+        // Copy witness hash
+        const witnessBytes = this.hexToBytes(witnessHash);
+        proofBytes.set(witnessBytes, 33);
+        // Write sibling count (big-endian)
+        const siblingCount = inclusion.merkleProof.siblings.length;
+        proofBytes[65] = (siblingCount >> 8) & 0xff;
+        proofBytes[66] = siblingCount & 0xff;
+        // Copy sibling data
+        proofBytes.set(siblingBytes, 67);
+        return proofBytes;
+    }
+    /**
+     * Verify mock proof bytes.
+     */
+    async verifyProofBytes(proofBytes, publicInputs) {
+        // Check minimum proof size
+        if (proofBytes.length < 67) {
+            return false;
+        }
+        // Check version byte
+        if (proofBytes[0] !== 0x01) {
+            return false;
+        }
+        // Extract and verify commitment is non-zero
+        const commitmentBytes = proofBytes.slice(1, 33);
+        const witnessHashBytes = proofBytes.slice(33, 65);
+        const commitmentNonZero = commitmentBytes.some((b) => b !== 0);
+        const witnessNonZero = witnessHashBytes.some((b) => b !== 0);
+        if (!commitmentNonZero || !witnessNonZero) {
+            return false;
+        }
+        // Extract sibling count
+        const siblingCount = (proofBytes[65] << 8) | proofBytes[66];
+        // Extract and parse sibling data if present
+        if (siblingCount > 0 && proofBytes.length > 67) {
+            try {
+                const siblingJson = new TextDecoder().decode(proofBytes.slice(67));
+                const siblings = JSON.parse(siblingJson);
+                if (siblings.length !== siblingCount) {
+                    return false;
+                }
+                // Reconstruct Merkle proof and verify
+                const merkleProof = {
+                    leafHash: await computeLeafHash(publicInputs.spanHash),
+                    leafIndex: 0, // Not needed for verification
+                    siblings: siblings.map((s) => ({
+                        hash: s.hash,
+                        position: s.pos === 0 ? "left" : "right",
+                    })),
+                    rootHash: publicInputs.merkleRoot,
+                };
+                return verifyMerkleProof(merkleProof);
+            }
+            catch {
+                // JSON parse error or other issue
+                return false;
+            }
+        }
+        // For single-leaf trees (no siblings), verify leaf hash equals root
+        if (siblingCount === 0) {
+            const leafHash = await computeLeafHash(publicInputs.spanHash);
+            return leafHash === publicInputs.merkleRoot;
+        }
+        return true;
+    }
+    /**
+     * Generate proof ID from public inputs.
+     */
+    async generateProofId(publicInputs) {
+        const data = canonicalize({
+            type: "selective-disclosure",
+            ...publicInputs,
+        });
+        const hash = await sha256StringHex(data);
+        return `disclosure-proof-${hash.slice(0, 16)}`;
+    }
+    /**
+     * Convert hex string to bytes.
+     */
+    hexToBytes(hex) {
+        const bytes = new Uint8Array(hex.length / 2);
+        for (let i = 0; i < hex.length; i += 2) {
+            bytes[i / 2] = parseInt(hex.slice(i, i + 2), 16);
+        }
+        return bytes;
+    }
+}
+// =============================================================================
+// FACTORY FUNCTION
+// =============================================================================
+/**
+ * Create a new SelectiveDisclosureProver instance.
+ *
+ * @param options - Configuration options
+ * @returns New prover instance
+ */
+export function createSelectiveDisclosureProver(options) {
+    return new SelectiveDisclosureProver(options);
+}
+//# sourceMappingURL=selective-disclosure.js.map

package/dist/proofs/selective-disclosure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"selective-disclosure.js","sourceRoot":"","sources":["../../src/proofs/selective-disclosure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EACL,eAAe,EACf,YAAY,GACb,MAAM,wCAAwC,CAAC;AAehD,OAAO,EACL,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,aAAa,CAAC;AAuCrB;;GAEG;AACH,MAAM,0BAA0B,GAAG;IACjC,KAAK,EAAE,2BAA2B;IAClC,OAAO,EAAE,mCAAmC;IAC5C,WAAW,EAAE,iCAAiC;IAC9C,IAAI,EAAE,oBAAoB;IAC1B,IAAI,EAAE,oBAAoB;IAC1B,IAAI,EAAE,oBAAoB;CAClB,CAAC;AAEX,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,IAAe,EACf,WAAqB;IAErB,+CAA+C;IAC/C,MAAM,UAAU,GAA4B;QAC1C,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,YAAY,EAAE,IAAI,CAAC,YAAY;KAChC,CAAC;IAEF,6CAA6C;IAC7C,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QACnC,UAAsC,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;IAC3E,CAAC;IACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAC9B,UAAsC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;IACjE,CAAC;IACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;QACjC,UAAsC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACvE,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC/B,UAAsC,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IACnE,CAAC;IAED,+BAA+B;IAC/B,MAAM,eAAe,GAAG,YAAY,CAAC,UAAU,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;IAExE,iFAAiF;IACjF,IAAI,SAAS,GAAG,0BAA0B,CAAC,IAAI,GAAG,eAAe,CAAC;IAElE,mCAAmC;IACnC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,SAAS,IAAI,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,eAAe,CAAC,SAAS,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,QAAgB;IACpD,OAAO,eAAe,CAAC,0BAA0B,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAAY,EAAE,KAAa;IAC/D,OAAO,eAAe,CAAC,0BAA0B,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC;AAC/E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,MAAmB,EACnB,MAAc;IAEd,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IAC9B,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC;IAC/B,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;IAEjC,gBAAgB;IAChB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAChD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,cAAc,EAClC,mBAAmB,MAAM,EAAE,CAC5B,CAAC;IACJ,CAAC;IAED,oCAAoC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,wCAAwC;IACxC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ;SAC7B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;SAC/C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAEjC,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAExD,oBAAoB;IACpB,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAE1D,gDAAgD;IAChD,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IACrE,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAEhE,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,cAAc,EAClC,mCAAmC,MAAM,EAAE,CAC5C,CAAC;IACJ,CAAC;IAED,kCAAkC;IAClC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ;aACvB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAC7B,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;aAC/C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,MAAM,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,MAAM,eAAe,CAAC,SAAS,CAAC,CAAC;QACnD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IAED,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,QAAQ,CAAC,CAAC;IAEjD,yDAAyD;IACzD,MAAM,QAAQ,GAAwD,EAAE,CAAC;IAEzE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,IAAI,YAAY,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;QACnC,IAAI,YAAY,GAAG,SAAS,CAAC;QAE7B,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC;YAEvE,gEAAgE;YAChE,IAAI,WAAmB,CAAC;YACxB,IAAI,YAAY,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,WAAW,GAAG,YAAY,CAAC,YAAY,CAAC,CAAC;gBAC/C,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,uBAAuB,EAC3C,4CAA4C,CAC7C,CAAC;gBACJ,CAAC;gBACD,WAAW,GAAG,WAAW,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,YAAY,CAAC,YAAY,CAAC,CAAC;gBACxC,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,uBAAuB,EAC3C,4CAA4C,CAC7C,CAAC;gBACJ,CAAC;gBACD,WAAW,GAAG,IAAI,CAAC;YACrB,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM;aACzC,CAAC,CAAC;YAEH,mBAAmB;YACnB,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,CAAC,IAAI,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACjF,MAAM,UAAU,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACtD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7B,CAAC;YAED,YAAY,GAAG,SAAS,CAAC;YACzB,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAE/F,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,uBAAuB,EAC3C,+BAA+B,CAChC,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,GAAgB;QAC/B,QAAQ;QACR,SAAS,EAAE,SAAS;QACpB,QAAQ;QACR,QAAQ;KACT,CAAC;IAEF,OAAO;QACL,QAAQ;QACR,QAAQ;QACR,WAAW;QACX,IAAI;QACJ,MAAM,EAAE,UAAU;KACnB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,UAAoB;IAC1D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,IAAI,YAAY,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;IAEnC,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACjF,MAAM,UAAU,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACtD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7B,CAAC;QAED,YAAY,GAAG,SAAS,CAAC;IAC3B,CAAC;IAED,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,KAAkB;IACxD,IAAI,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC;IAEjC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrC,IAAI,IAAY,CAAC;QACjB,IAAI,KAAa,CAAC;QAElB,IAAI,OAAO,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YAChC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;YACpB,KAAK,GAAG,WAAW,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,WAAW,CAAC;YACnB,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC;QACvB,CAAC;QAED,WAAW,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACnD,CAAC;IAED,OAAO,WAAW,KAAK,KAAK,CAAC,QAAQ,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,KAAkB,EAClB,IAAe,EACf,MAAoB;IAEpB,6CAA6C;IAC7C,MAAM,YAAY,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/D,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAE1D,sBAAsB;IACtB,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAE1D,6BAA6B;IAC7B,MAAM,gBAAgB,GAAG,MAAM,eAAe,CAAC,QAAQ,CAAC,CAAC;IAEzD,2BAA2B;IAC3B,IAAI,gBAAgB,KAAK,KAAK,CAAC,QAAQ,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,sBAAsB;IACtB,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,gFAAgF;AAChF,8BAA8B;AAC9B,gFAAgF;AAEhF;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,yBAAyB;IACnB,KAAK,CAAU;IACf,eAAe,CAAU;IACzB,gBAAgB,CAAU;IAE3C;;;;OAIG;IACH,YAAY,UAA4C,EAAE;QACxD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC;QACpC,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,IAAI,CAAC;QACvD,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,IAAI,CAAC;IAC3D,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,aAAa,CAAC,KAAsB;QACxC,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,iBAAiB;QACjB,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAE1B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,GAAG,CAAC,wDAAwD,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACtF,CAAC;QAED,kCAAkC;QAClC,MAAM,eAAe,GAAG,MAAM,4BAA4B,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAEvF,qDAAqD;QACrD,IAAI,eAAe,CAAC,WAAW,CAAC,QAAQ,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;YAC9D,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,aAAa,EACjC,wBAAwB,eAAe,CAAC,WAAW,CAAC,QAAQ,4BAA4B,KAAK,CAAC,UAAU,EAAE,CAC3G,CAAC;QACJ,CAAC;QAED,6CAA6C;QAC7C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;QAEzE,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAClC,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC;QAEtD,0BAA0B;QAC1B,MAAM,YAAY,GAA2B;YAC3C,QAAQ,EAAE,eAAe,CAAC,QAAQ;YAClC,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;SAC/C,CAAC;QAEF,oBAAoB;QACpB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;QAEzD,MAAM,KAAK,GAAoB;YAC7B,SAAS,EAAE,sBAAsB;YACjC,OAAO;YACP,KAAK,EAAE,UAAU;YACjB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,aAAa;YACb,cAAc,EAAE,UAAU,CAAC,MAAM;YACjC,YAAY;YACZ,aAAa,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;YACtE,eAAe,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;SAC5E,CAAC;QAEF,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,GAAG,CAAC,8CAA8C,EAAE;gBAC1D,OAAO;gBACP,QAAQ,EAAE,eAAe,CAAC,QAAQ;gBAClC,SAAS,EAAE,eAAe,CAAC,WAAW,CAAC,SAAS;gBAChD,YAAY,EAAE,eAAe,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM;gBACzD,aAAa;aACd,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,WAAW,CAAC,KAAsB;QACtC,IAAI,CAAC;YACH,2BAA2B;YAC3B,IAAI,KAAK,CAAC,SAAS,KAAK,sBAAsB,EAAE,CAAC;gBAC/C,OAAO,KAAK,CAAC;YACf,CAAC;YAED,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7C,OAAO,KAAK,CAAC;YACf,CAAC;YAED,yBAAyB;YACzB,MAAM,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;gBAClE,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,UAAU,IAAI,YAAY,CAAC,UAAU,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;gBACtE,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,mBAAmB,IAAI,YAAY,CAAC,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvF,OAAO,KAAK,CAAC;YACf,CAAC;YAED,wCAAwC;YACxC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YACjE,IAAI,KAAK,CAAC,OAAO,KAAK,eAAe,EAAE,CAAC;gBACtC,OAAO,KAAK,CAAC;YACf,CAAC;YAED,mDAAmD;YACnD,MAAM,gBAAgB,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YAChF,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACtB,OAAO,KAAK,CAAC;YACf,CAAC;YAED,sEAAsE;YACtE,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;gBACjD,oEAAoE;gBACpE,+DAA+D;gBAC/D,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9E,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;gBAC1D,MAAM,kBAAkB,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;gBAEnF,IAAI,kBAAkB,KAAK,YAAY,CAAC,QAAQ,EAAE,CAAC;oBACjD,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,KAAK,CAAC,iDAAiD,EAAE,KAAK,CAAC,CAAC;YAC1E,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,uBAAuB,CAAC,KAAsB;QAClD,wDAAwD;QACxD,MAAM,gBAAgB,GAAG,IAAI,yBAAyB,CAAC;YACrD,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,eAAe,EAAE,KAAK;YACtB,gBAAgB,EAAE,KAAK;SACxB,CAAC,CAAC;QAEH,OAAO,gBAAgB,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E;;OAEG;IACK,aAAa,CAAC,KAAsB;QAC1C,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAClB,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,sBAAsB,EAC1C,0BAA0B,CAC3B,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,sBAAsB,EAC1C,qBAAqB,CACtB,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;YACxD,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,aAAa,EACjC,sDAAsD,CACvD,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,mBAAmB,IAAI,KAAK,CAAC,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzE,MAAM,IAAI,uBAAuB,CAC/B,mBAAmB,CAAC,sBAAsB,EAC1C,6CAA6C,CAC9C,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,kBAAkB,CAC9B,KAAsB,EACtB,SAAgC;QAEhC,0CAA0C;QAC1C,MAAM,WAAW,GAAG,YAAY,CAAC;YAC/B,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,QAAQ,EAAE,SAAS,CAAC,QAAQ;YAC5B,QAAQ,EAAE,SAAS,CAAC,QAAQ;YAC5B,SAAS,EAAE,SAAS,CAAC,WAAW,CAAC,SAAS;YAC1C,QAAQ,EAAE,SAAS,CAAC,WAAW,CAAC,QAAQ;YACxC,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;SAC/C,CAAC,CAAC;QAEH,wBAAwB;QACxB,MAAM,WAAW,GAAG,MAAM,eAAe,CAAC,0BAA0B,CAAC,OAAO,GAAG,WAAW,CAAC,CAAC;QAE5F,oCAAoC;QACpC,MAAM,eAAe,GAAG,YAAY,CAAC;YACnC,QAAQ,EAAE,SAAS,CAAC,QAAQ;YAC5B,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;SAC/C,CAAC,CAAC;QACH,MAAM,eAAe,GAAG,MAAM,eAAe,CAC3C,0BAA0B,CAAC,WAAW,GAAG,eAAe,CACzD,CAAC;QAEF,6DAA6D;QAC7D,MAAM,eAAe,GAAG,MAAM,eAAe,CAC3C,0BAA0B,CAAC,KAAK,GAAG,WAAW,GAAG,GAAG,GAAG,eAAe,CACvE,CAAC;QAEF,4DAA4D;QAC5D,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7D,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,GAAG,EAAE,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACnC,CAAC,CAAC,CAAC;QACJ,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAChD,MAAM,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE3D,yBAAyB;QACzB,qBAAqB;QACrB,0BAA0B;QAC1B,4BAA4B;QAC5B,4BAA4B;QAC5B,4BAA4B;QAC5B,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QAC5D,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,YAAY;QAElC,uBAAuB;QACvB,MAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;QACzD,UAAU,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QAEnC,oBAAoB;QACpB,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAClD,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QAEjC,mCAAmC;QACnC,MAAM,YAAY,GAAG,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC3D,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QAC5C,UAAU,CAAC,EAAE,CAAC,GAAG,YAAY,GAAG,IAAI,CAAC;QAErC,oBAAoB;QACpB,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QAEjC,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAC5B,UAAsB,EACtB,YAAoC;QAEpC,2BAA2B;QAC3B,IAAI,UAAU,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,qBAAqB;QACrB,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,4CAA4C;QAC5C,MAAM,eAAe,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChD,MAAM,gBAAgB,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAElD,MAAM,iBAAiB,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,MAAM,cAAc,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAE7D,IAAI,CAAC,iBAAiB,IAAI,CAAC,cAAc,EAAE,CAAC;YAC1C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,wBAAwB;QACxB,MAAM,YAAY,GAAG,CAAC,UAAU,CAAC,EAAE,CAAE,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,CAAE,CAAC;QAE9D,4CAA4C;QAC5C,IAAI,YAAY,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC;gBACH,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAyC,CAAC;gBAEjF,IAAI,QAAQ,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;oBACrC,OAAO,KAAK,CAAC;gBACf,CAAC;gBAED,sCAAsC;gBACtC,MAAM,WAAW,GAAgB;oBAC/B,QAAQ,EAAE,MAAM,eAAe,CAAC,YAAY,CAAC,QAAQ,CAAC;oBACtD,SAAS,EAAE,CAAC,EAAE,8BAA8B;oBAC5C,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBAC7B,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,QAAQ,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO;qBACzC,CAAC,CAAC;oBACH,QAAQ,EAAE,YAAY,CAAC,UAAU;iBAClC,CAAC;gBAEF,OAAO,iBAAiB,CAAC,WAAW,CAAC,CAAC;YACxC,CAAC;YAAC,MAAM,CAAC;gBACP,kCAAkC;gBAClC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC9D,OAAO,QAAQ,KAAK,YAAY,CAAC,UAAU,CAAC;QAC9C,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,eAAe,CAAC,YAAoC;QAChE,MAAM,IAAI,GAAG,YAAY,CAAC;YACxB,IAAI,EAAE,sBAAsB;YAC5B,GAAG,YAAY;SAChB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,CAAC;QACzC,OAAO,oBAAoB,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,GAAW;QAC5B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,UAAU,+BAA+B,CAC7C,OAA0C;IAE1C,OAAO,IAAI,yBAAyB,CAAC,OAAO,CAAC,CAAC;AAChD,CAAC"}