@mikeargento/bitgraph-audit 0.1.0

package/dist/temporal.js

@@ -0,0 +1,461 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+import { byCounterThenHash, parseCounter, pushMap } from "./validity.js";
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+export function deriveTemporalBounds(ingest, reconstruction, identification, witnessAnalysis) {
+    const byHash = new Map(ingest.proofs.map((p) => [p.proofHash, p]));
+    // Verified wall-clock evidence per anchor. Multiple verified witnesses
+    // for one anchor are necessarily identical (the hash comparison pins
+    // the exact header bytes); the first is kept.
+    const evidence = new Map();
+    for (const outcome of witnessAnalysis.outcomes) {
+        if (!outcome.verified || outcome.anchorProofHash === undefined)
+            continue;
+        if (evidence.has(outcome.anchorProofHash))
+            continue;
+        evidence.set(outcome.anchorProofHash, {
+            anchorProofHash: outcome.anchorProofHash,
+            timestamp: outcome.timestamp,
+            blockHash: outcome.computedBlockHash,
+            ...(outcome.blockNumber !== undefined ? { blockNumber: outcome.blockNumber } : {}),
+        });
+    }
+    const verifiedAnchorProofHashes = [...evidence.keys()].sort();
+    const unverifiedAnchorProofHashes = identification.anchors
+        .map((a) => a.proofHash)
+        .filter((h) => !evidence.has(h))
+        .sort();
+    // Per-partition segments.
+    const segments = [];
+    for (const partition of reconstruction.partitions) {
+        segments.push(...buildPartitionSegments(partition, byHash, evidence));
+    }
+    // Epoch-level aggregation and cross-epoch ordering.
+    const anchorOrderedPairs = aggregateEpochs(reconstruction, segments);
+    return {
+        segments,
+        anchorOrderedPairs,
+        verifiedAnchorProofHashes,
+        unverifiedAnchorProofHashes,
+    };
+}
+function buildPartitionSegments(partition, byHash, evidence) {
+    const members = partition.memberProofHashes.map((h) => byHash.get(h));
+    const memberSet = new Map(members.map((m) => [m.proofHash, m]));
+    const anchors = members.filter((m) => evidence.has(m.proofHash));
+    // Hash-link structure within the partition.
+    const successors = new Map();
+    for (const m of members) {
+        if (m.prevB64 === undefined)
+            continue;
+        const pred = memberSet.get(m.prevB64);
+        if (pred === undefined || pred.proofHash === m.proofHash)
+            continue;
+        pushMap(successors, pred.proofHash, m);
+    }
+    // For each verified anchor: members causally after it (descendants via
+    // hash links) and causally before it (ancestors via the prevB64 walk).
+    const chainAfter = new Map();
+    const chainBefore = new Map();
+    for (const anchor of anchors) {
+        chainAfter.set(anchor.proofHash, collectDescendants(anchor, successors));
+        chainBefore.set(anchor.proofHash, collectAncestors(anchor, memberSet));
+    }
+    // Candidate bounds per member.
+    const memberBounds = members.map((member) => {
+        const lowerCandidates = new Map();
+        const upperCandidates = new Map();
+        const memberCounter = parseCounter(member.counter);
+        for (const anchor of anchors) {
+            const anchorHash = anchor.proofHash;
+            const anchorCounter = parseCounter(anchor.counter);
+            // Lower (not-before): the anchor itself consumed the block hash, so
+            // it is its own strongest lower bound; descendants inherit through
+            // the chain; counter ordering is the weaker fallback.
+            if (member.proofHash === anchorHash || chainAfter.get(anchorHash).has(member.proofHash)) {
+                lowerCandidates.set(anchorHash, "chain-link");
+            }
+            else if (memberCounter !== undefined &&
+                anchorCounter !== undefined &&
+                memberCounter > anchorCounter) {
+                if (!lowerCandidates.has(anchorHash))
+                    lowerCandidates.set(anchorHash, "counter-order");
+            }
+            // Upper (not-after): members the anchor's chain state commits to;
+            // counter ordering as the weaker fallback. Never from the anchor to
+            // itself.
+            if (chainBefore.get(anchorHash).has(member.proofHash)) {
+                upperCandidates.set(anchorHash, "chain-link");
+            }
+            else if (member.proofHash !== anchorHash &&
+                memberCounter !== undefined &&
+                anchorCounter !== undefined &&
+                memberCounter < anchorCounter) {
+                if (!upperCandidates.has(anchorHash))
+                    upperCandidates.set(anchorHash, "counter-order");
+            }
+        }
+        return {
+            member,
+            lower: selectBounds("not-before", lowerCandidates, evidence),
+            upper: selectBounds("not-after", upperCandidates, evidence),
+        };
+    });
+    // Group members sharing an identical bound set into segments.
+    const groups = new Map();
+    for (const mb of memberBounds) {
+        pushMap(groups, boundSetKey(mb), mb);
+    }
+    const segments = [];
+    for (const group of groups.values()) {
+        const groupMembers = group.map((g) => g.member).sort(byCounterThenHash);
+        const first = group[0];
+        const lowerBounds = first.lower;
+        const upperBounds = first.upper;
+        const status = lowerBounds.length > 0 && upperBounds.length > 0
+            ? "bracketed"
+            : lowerBounds.length > 0
+                ? "lower-bounded"
+                : upperBounds.length > 0
+                    ? "upper-bounded"
+                    : "ordered-but-unanchored";
+        const range = positionRange(groupMembers);
+        segments.push({
+            partition: partition.key,
+            memberProofHashes: groupMembers.map((m) => m.proofHash),
+            ...(range !== undefined ? { positionRange: range } : {}),
+            status,
+            lowerBounds,
+            upperBounds,
+        });
+    }
+    segments.sort(compareSegments);
+    return segments;
+}
+/**
+ * Select the reported bounds from the candidate set: the tightest bound
+ * overall (max timestamp for not-before, min for not-after), plus the
+ * tightest chain-link bound when the overall tightest rests only on
+ * counter ordering. At most two entries, tightest first.
+ */
+function selectBounds(kind, candidates, evidence) {
+    if (candidates.size === 0)
+        return [];
+    const entries = [...candidates.entries()].map(([anchorHash, evidenceKind]) => ({
+        anchorHash,
+        evidenceKind,
+        info: evidence.get(anchorHash),
+    }));
+    const better = (a, b) => {
+        if (b === undefined)
+            return true;
+        if (a.info.timestamp !== b.info.timestamp) {
+            return kind === "not-before"
+                ? a.info.timestamp > b.info.timestamp
+                : a.info.timestamp < b.info.timestamp;
+        }
+        // Tie: prefer chain-link evidence, then the lower anchor hash.
+        if (a.evidenceKind !== b.evidenceKind)
+            return a.evidenceKind === "chain-link";
+        return a.anchorHash < b.anchorHash;
+    };
+    let best;
+    let bestChain;
+    for (const entry of entries) {
+        if (better(entry, best))
+            best = entry;
+        if (entry.evidenceKind === "chain-link" && better(entry, bestChain))
+            bestChain = entry;
+    }
+    const bounds = [makeBound(kind, best)];
+    if (bestChain !== undefined &&
+        (best.anchorHash !== bestChain.anchorHash ||
+            best.evidenceKind !== "chain-link")) {
+        bounds.push(makeBound(kind, bestChain));
+    }
+    return bounds;
+}
+function makeBound(kind, entry) {
+    const { info, evidenceKind } = entry;
+    const iso = new Date(info.timestamp * 1000).toISOString();
+    const blockName = info.blockNumber !== undefined ? `Ethereum block ${info.blockNumber}` : "an Ethereum block";
+    const evidenceSentence = evidenceKind === "chain-link"
+        ? "Evidence: a verified hash-link path connects these proofs and the anchor."
+        : "Evidence: commit-counter ordering within the partition only, which relies on the " +
+            "authority's counter discipline rather than verifiable hash links (weaker).";
+    const claim = kind === "not-before"
+        ? `These proofs were committed no earlier than ${iso} (unix ${info.timestamp}), the ` +
+            `timestamp of ${blockName}: the block hash was unpredictable before that time and the ` +
+            `anchor commit consumed it. Reading this as a wall-clock floor additionally assumes the ` +
+            `anchored header is a genuine, publicly published Ethereum block: this offline audit checks ` +
+            `the header's structure and hash binding, not proof-of-work, consensus, or chain membership, ` +
+            `so it cannot confirm the block is real. ${evidenceSentence}`
+        : `These proofs existed before the anchor commit that consumed the hash of ${blockName} ` +
+            `(block timestamp ${iso}, unix ${info.timestamp}). The block timestamp proves the anchor ` +
+            `commit came at or after it, not how promptly; reading it as a wall-clock ceiling ` +
+            `additionally assumes the anchor consumed a recently published block. ${evidenceSentence}`;
+    return {
+        kind,
+        anchorProofHash: entry.anchorHash,
+        ...(info.blockNumber !== undefined ? { blockNumber: info.blockNumber } : {}),
+        blockHash: info.blockHash,
+        timestamp: info.timestamp,
+        evidence: evidenceKind,
+        weaker: evidenceKind === "counter-order",
+        basis: kind === "not-before" ? "block-hash-unpredictability" : "causal-precedence",
+        claim,
+    };
+}
+function boundSetKey(mb) {
+    const part = (bounds) => bounds.map((b) => `${b.anchorProofHash}:${b.evidence}`).join(",");
+    return `${part(mb.lower)}|${part(mb.upper)}`;
+}
+function collectDescendants(anchor, successors) {
+    const reached = new Set();
+    const stack = [...(successors.get(anchor.proofHash) ?? [])];
+    while (stack.length > 0) {
+        const node = stack.pop();
+        if (reached.has(node.proofHash))
+            continue;
+        reached.add(node.proofHash);
+        for (const next of successors.get(node.proofHash) ?? [])
+            stack.push(next);
+    }
+    return reached;
+}
+function collectAncestors(anchor, memberSet) {
+    const reached = new Set();
+    let cursor = anchor;
+    while (cursor !== undefined && cursor.prevB64 !== undefined) {
+        const pred = memberSet.get(cursor.prevB64);
+        if (pred === undefined || reached.has(pred.proofHash) || pred.proofHash === anchor.proofHash) {
+            break;
+        }
+        reached.add(pred.proofHash);
+        cursor = pred;
+    }
+    return reached;
+}
+function positionRange(members) {
+    let min;
+    let max;
+    for (const m of members) {
+        for (const value of [m.counter, m.slotCounter]) {
+            const n = parseCounter(value);
+            if (n === undefined)
+                continue;
+            if (min === undefined || n < min)
+                min = n;
+            if (max === undefined || n > max)
+                max = n;
+        }
+    }
+    return min !== undefined && max !== undefined
+        ? { min: String(min), max: String(max) }
+        : undefined;
+}
+function compareSegments(a, b) {
+    const ma = a.positionRange?.min;
+    const mb = b.positionRange?.min;
+    if (ma !== undefined && mb !== undefined && ma !== mb) {
+        return BigInt(ma) < BigInt(mb) ? -1 : 1;
+    }
+    if (ma !== undefined && mb === undefined)
+        return -1;
+    if (ma === undefined && mb !== undefined)
+        return 1;
+    const ha = a.memberProofHashes[0] ?? "";
+    const hb = b.memberProofHashes[0] ?? "";
+    return ha < hb ? -1 : ha > hb ? 1 : 0;
+}
+/**
+ * Populate EpochRecord.anchorBounds and derive covered-portion ordering
+ * pairs.
+ *
+ * The epoch-level not-before is the MINIMUM timestamp over the members'
+ * lower bounds (every covered member is not-before at least that), and
+ * the epoch-level not-after is the MAXIMUM over the members' upper bounds
+ * (every covered member existed before an anchor commit at or after that).
+ * These conservative representatives make the cross-epoch comparison
+ * sound for the covered portions: epoch A's not-after strictly below
+ * epoch B's not-before orders the covered portion of A before the covered
+ * portion of B, subject to the not-after freshness assumption.
+ */
+/** Sentence appended to an epoch-level claim when its representative bound rests on counter-order evidence. */
+function weakerCaveat(weaker) {
+    return weaker
+        ? " The representative bound rests on commit-counter ordering rather than a verified hash-link " +
+            "path, which relies on the authority's counter discipline (weaker evidence)."
+        : "";
+}
+function aggregateEpochs(reconstruction, segments) {
+    const coverage = new Map();
+    for (const epoch of reconstruction.epochRelationships.epochs) {
+        coverage.set(epoch.epochId, {
+            totalProofCount: epoch.proofCount,
+            lowerCovered: new Set(),
+            upperCovered: new Set(),
+        });
+    }
+    for (const segment of segments) {
+        const epochId = segment.partition.epochId;
+        if (epochId === undefined)
+            continue;
+        const cov = coverage.get(epochId);
+        if (cov === undefined)
+            continue;
+        // The tightest bound is entry 0 by construction; every listed bound
+        // covers the members, so the conservative representative scans all.
+        // Conservative representative: minimum timestamp for not-before. At an
+        // equal timestamp, prefer chain-link evidence so the epoch bound is
+        // never marked weaker when a hash-link bound justifies the same time.
+        for (const bound of segment.lowerBounds) {
+            for (const h of segment.memberProofHashes)
+                cov.lowerCovered.add(h);
+            if (cov.lowerMin === undefined ||
+                bound.timestamp < cov.lowerMin.timestamp ||
+                (bound.timestamp === cov.lowerMin.timestamp && cov.lowerMin.weaker && !bound.weaker)) {
+                cov.lowerMin = {
+                    timestamp: bound.timestamp,
+                    anchorProofHash: bound.anchorProofHash,
+                    blockHash: bound.blockHash,
+                    ...(bound.blockNumber !== undefined ? { blockNumber: bound.blockNumber } : {}),
+                    evidence: bound.evidence,
+                    weaker: bound.weaker,
+                };
+            }
+        }
+        // Maximum timestamp for not-after, same chain-link tie preference.
+        for (const bound of segment.upperBounds) {
+            for (const h of segment.memberProofHashes)
+                cov.upperCovered.add(h);
+            if (cov.upperMax === undefined ||
+                bound.timestamp > cov.upperMax.timestamp ||
+                (bound.timestamp === cov.upperMax.timestamp && cov.upperMax.weaker && !bound.weaker)) {
+                cov.upperMax = {
+                    timestamp: bound.timestamp,
+                    anchorProofHash: bound.anchorProofHash,
+                    blockHash: bound.blockHash,
+                    ...(bound.blockNumber !== undefined ? { blockNumber: bound.blockNumber } : {}),
+                    evidence: bound.evidence,
+                    weaker: bound.weaker,
+                };
+            }
+        }
+    }
+    // Populate EpochRecord.anchorBounds (the Phase 4c extension point).
+    for (const epoch of reconstruction.epochRelationships.epochs) {
+        const cov = coverage.get(epoch.epochId);
+        const bounds = [];
+        if (cov.lowerMin !== undefined) {
+            bounds.push({
+                kind: "not-before",
+                anchorProofHash: cov.lowerMin.anchorProofHash,
+                ...(cov.lowerMin.blockNumber !== undefined ? { blockNumber: cov.lowerMin.blockNumber } : {}),
+                blockHash: cov.lowerMin.blockHash,
+                witnessTimestamp: cov.lowerMin.timestamp,
+                coverage: "members-after-anchor",
+                coveredProofCount: cov.lowerCovered.size,
+                totalProofCount: cov.totalProofCount,
+                basis: "block-hash-unpredictability",
+                evidence: cov.lowerMin.evidence,
+                weaker: cov.lowerMin.weaker,
+                claim: `${cov.lowerCovered.size} of ${cov.totalProofCount} observed proofs of this epoch were ` +
+                    `committed no earlier than unix ${cov.lowerMin.timestamp}, grounded in block-hash ` +
+                    `unpredictability through verified anchor witnesses. This additionally assumes the anchored ` +
+                    `header is a genuine, publicly published Ethereum block, which this offline audit cannot ` +
+                    `confirm.` +
+                    weakerCaveat(cov.lowerMin.weaker) +
+                    ` The remaining proofs sit causally before the covering anchors and carry no lower bound ` +
+                    `from this evidence.`,
+            });
+        }
+        if (cov.upperMax !== undefined) {
+            bounds.push({
+                kind: "not-after",
+                anchorProofHash: cov.upperMax.anchorProofHash,
+                ...(cov.upperMax.blockNumber !== undefined ? { blockNumber: cov.upperMax.blockNumber } : {}),
+                blockHash: cov.upperMax.blockHash,
+                witnessTimestamp: cov.upperMax.timestamp,
+                coverage: "members-before-anchor",
+                coveredProofCount: cov.upperCovered.size,
+                totalProofCount: cov.totalProofCount,
+                basis: "causal-precedence",
+                evidence: cov.upperMax.evidence,
+                weaker: cov.upperMax.weaker,
+                claim: `${cov.upperCovered.size} of ${cov.totalProofCount} observed proofs of this epoch ` +
+                    `existed before an anchor commit that consumed a block published at unix ` +
+                    `${cov.upperMax.timestamp}. Reading that timestamp as a wall-clock ceiling additionally ` +
+                    `assumes the anchor consumed a recently published block; the causal precedence itself ` +
+                    `is verified.` +
+                    weakerCaveat(cov.upperMax.weaker) +
+                    ` Proofs after the covering anchors are not covered.`,
+            });
+        }
+        if (bounds.length > 0)
+            epoch.anchorBounds = bounds;
+    }
+    // Covered-portion ordering pairs. Strict inequality: equal timestamps
+    // order nothing. Overlaps produce no pair (concurrent-or-unordered),
+    // never divergence.
+    const pairs = [];
+    const epochs = reconstruction.epochRelationships.epochs;
+    for (const before of epochs) {
+        const covA = coverage.get(before.epochId);
+        if (covA.upperMax === undefined)
+            continue;
+        for (const after of epochs) {
+            if (after.epochId === before.epochId)
+                continue;
+            const covB = coverage.get(after.epochId);
+            if (covB.lowerMin === undefined)
+                continue;
+            if (covA.upperMax.timestamp >= covB.lowerMin.timestamp)
+                continue;
+            const upperEvidence = covA.upperMax.evidence;
+            const lowerEvidence = covB.lowerMin.evidence;
+            const weaker = covA.upperMax.weaker || covB.lowerMin.weaker;
+            pairs.push({
+                beforeEpochId: before.epochId,
+                afterEpochId: after.epochId,
+                upperAnchorProofHash: covA.upperMax.anchorProofHash,
+                upperBoundTimestamp: covA.upperMax.timestamp,
+                lowerAnchorProofHash: covB.lowerMin.anchorProofHash,
+                lowerBoundTimestamp: covB.lowerMin.timestamp,
+                basis: "anchor-bounds",
+                assumptionDependent: true,
+                upperEvidence,
+                lowerEvidence,
+                weaker,
+                beforeCoveredProofCount: covA.upperCovered.size,
+                beforeTotalProofCount: covA.totalProofCount,
+                afterCoveredProofCount: covB.lowerCovered.size,
+                afterTotalProofCount: covB.totalProofCount,
+                note: `The anchor-covered portion of epoch ${before.epochId} ` +
+                    `(${covA.upperCovered.size} of ${covA.totalProofCount} proofs) precedes the ` +
+                    `anchor-covered portion of epoch ${after.epochId} ` +
+                    `(${covB.lowerCovered.size} of ${covB.totalProofCount} proofs): the first is bounded ` +
+                    `not-after unix ${covA.upperMax.timestamp} and the second not-before unix ` +
+                    `${covB.lowerMin.timestamp}. One-sided evidence about the covered portions only; the ` +
+                    `not-after side rests on the anchor-freshness assumption documented on its bound.` +
+                    (weaker
+                        ? ` At least one side rests on commit-counter ordering rather than a verified hash-link ` +
+                            `path (weaker evidence), which relies on the authority's counter discipline.`
+                        : "") +
+                    ` This is ordering evidence, never divergence.`,
+            });
+        }
+    }
+    pairs.sort((a, b) => a.beforeEpochId !== b.beforeEpochId
+        ? a.beforeEpochId < b.beforeEpochId
+            ? -1
+            : 1
+        : a.afterEpochId < b.afterEpochId
+            ? -1
+            : a.afterEpochId > b.afterEpochId
+                ? 1
+                : 0);
+    return pairs;
+}
+//# sourceMappingURL=temporal.js.map

package/dist/temporal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal.js","sourceRoot":"","sources":["../src/temporal.ts"],"names":[],"mappings":"AAAA,qFAAqF;AAqErF,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAEzE,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,MAAM,UAAU,oBAAoB,CAClC,MAAoB,EACpB,cAAoC,EACpC,cAAoC,EACpC,eAAsC;IAEtC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAwB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1F,uEAAuE;IACvE,qEAAqE;IACrE,8CAA8C;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkC,CAAC;IAC3D,KAAK,MAAM,OAAO,IAAI,eAAe,CAAC,QAAQ,EAAE,CAAC;QAC/C,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,eAAe,KAAK,SAAS;YAAE,SAAS;QACzE,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC;YAAE,SAAS;QACpD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE;YACpC,eAAe,EAAE,OAAO,CAAC,eAAe;YACxC,SAAS,EAAE,OAAO,CAAC,SAAmB;YACtC,SAAS,EAAE,OAAO,CAAC,iBAA2B;YAC9C,GAAG,CAAC,OAAO,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,yBAAyB,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9D,MAAM,2BAA2B,GAAG,cAAc,CAAC,OAAO;SACvD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC/B,IAAI,EAAE,CAAC;IAEV,0BAA0B;IAC1B,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,UAAU,EAAE,CAAC;QAClD,QAAQ,CAAC,IAAI,CAAC,GAAG,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,oDAAoD;IACpD,MAAM,kBAAkB,GAAG,eAAe,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IAErE,OAAO;QACL,QAAQ;QACR,kBAAkB;QAClB,yBAAyB;QACzB,2BAA2B;KAC5B,CAAC;AACJ,CAAC;AAmBD,SAAS,sBAAsB,CAC7B,SAAyB,EACzB,MAAkC,EAClC,QAA6C;IAE7C,MAAM,OAAO,GAAG,SAAS,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAkB,CAAC,CAAC;IACvF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAwB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvF,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEjE,4CAA4C;IAC5C,MAAM,UAAU,GAAG,IAAI,GAAG,EAA2B,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS;YAAE,SAAS;QACtC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;YAAE,SAAS;QACnE,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,uEAAuE;IACvE,uEAAuE;IACvE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IACnD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,kBAAkB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACzE,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,gBAAgB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,+BAA+B;IAC/B,MAAM,YAAY,GAAmB,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAC1D,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB,CAAC;QACzD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB,CAAC;QACzD,MAAM,aAAa,GAAG,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAEnD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC;YACpC,MAAM,aAAa,GAAG,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAEnD,oEAAoE;YACpE,mEAAmE;YACnE,sDAAsD;YACtD,IAAI,MAAM,CAAC,SAAS,KAAK,UAAU,IAAK,UAAU,CAAC,GAAG,CAAC,UAAU,CAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;YAChD,CAAC;iBAAM,IACL,aAAa,KAAK,SAAS;gBAC3B,aAAa,KAAK,SAAS;gBAC3B,aAAa,GAAG,aAAa,EAC7B,CAAC;gBACD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;YACzF,CAAC;YAED,kEAAkE;YAClE,oEAAoE;YACpE,UAAU;YACV,IAAK,WAAW,CAAC,GAAG,CAAC,UAAU,CAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;gBACvE,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;YAChD,CAAC;iBAAM,IACL,MAAM,CAAC,SAAS,KAAK,UAAU;gBAC/B,aAAa,KAAK,SAAS;gBAC3B,aAAa,KAAK,SAAS;gBAC3B,aAAa,GAAG,aAAa,EAC7B,CAAC;gBACD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;YACzF,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM;YACN,KAAK,EAAE,YAAY,CAAC,YAAY,EAAE,eAAe,EAAE,QAAQ,CAAC;YAC5D,KAAK,EAAE,YAAY,CAAC,WAAW,EAAE,eAAe,EAAE,QAAQ,CAAC;SAC5D,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,8DAA8D;IAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;QAC9B,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAiB,CAAC;QACvC,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC;QAChC,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC;QAChC,MAAM,MAAM,GACV,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;YAC9C,CAAC,CAAE,WAAqB;YACxB,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;gBACtB,CAAC,CAAE,eAAyB;gBAC5B,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;oBACtB,CAAC,CAAE,eAAyB;oBAC5B,CAAC,CAAE,wBAAkC,CAAC;QAE9C,MAAM,KAAK,GAAG,aAAa,CAAC,YAAY,CAAC,CAAC;QAC1C,QAAQ,CAAC,IAAI,CAAC;YACZ,SAAS,EAAE,SAAS,CAAC,GAAG;YACxB,iBAAiB,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YACvD,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,MAAM;YACN,WAAW;YACX,WAAW;SACZ,CAAC,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC/B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,SAAS,YAAY,CACnB,IAAgC,EAChC,UAAsC,EACtC,QAA6C;IAE7C,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7E,UAAU;QACV,YAAY;QACZ,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,UAAU,CAA2B;KACzD,CAAC,CAAC,CAAC;IAEJ,MAAM,MAAM,GAAG,CACb,CAA2B,EAC3B,CAAuC,EAC9B,EAAE;QACX,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACjC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YAC1C,OAAO,IAAI,KAAK,YAAY;gBAC1B,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS;gBACrC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;QAC1C,CAAC;QACD,+DAA+D;QAC/D,IAAI,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,YAAY;YAAE,OAAO,CAAC,CAAC,YAAY,KAAK,YAAY,CAAC;QAC9E,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;IACrC,CAAC,CAAC;IAEF,IAAI,IAA0C,CAAC;IAC/C,IAAI,SAA+C,CAAC;IACpD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,IAAI,GAAG,KAAK,CAAC;QACtC,IAAI,KAAK,CAAC,YAAY,KAAK,YAAY,IAAI,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC;YAAE,SAAS,GAAG,KAAK,CAAC;IACzF,CAAC;IAED,MAAM,MAAM,GAAmB,CAAC,SAAS,CAAC,IAAI,EAAE,IAAgC,CAAC,CAAC,CAAC;IACnF,IACE,SAAS,KAAK,SAAS;QACvB,CAAE,IAAiC,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU;YACpE,IAAiC,CAAC,YAAY,KAAK,YAAY,CAAC,EACnE,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,SAAS,CAChB,IAAgC,EAChC,KAAwF;IAExF,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;IACrC,MAAM,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;IAC1D,MAAM,SAAS,GACb,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC;IAC9F,MAAM,gBAAgB,GACpB,YAAY,KAAK,YAAY;QAC3B,CAAC,CAAC,2EAA2E;QAC7E,CAAC,CAAC,mFAAmF;YACnF,4EAA4E,CAAC;IACnF,MAAM,KAAK,GACT,IAAI,KAAK,YAAY;QACnB,CAAC,CAAC,+CAA+C,GAAG,UAAU,IAAI,CAAC,SAAS,SAAS;YACnF,gBAAgB,SAAS,8DAA8D;YACvF,yFAAyF;YACzF,6FAA6F;YAC7F,8FAA8F;YAC9F,2CAA2C,gBAAgB,EAAE;QAC/D,CAAC,CAAC,2EAA2E,SAAS,GAAG;YACvF,oBAAoB,GAAG,UAAU,IAAI,CAAC,SAAS,2CAA2C;YAC1F,mFAAmF;YACnF,wEAAwE,gBAAgB,EAAE,CAAC;IAEjG,OAAO;QACL,IAAI;QACJ,eAAe,EAAE,KAAK,CAAC,UAAU;QACjC,GAAG,CAAC,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5E,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,QAAQ,EAAE,YAAY;QACtB,MAAM,EAAE,YAAY,KAAK,eAAe;QACxC,KAAK,EAAE,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,6BAA6B,CAAC,CAAC,CAAC,mBAAmB;QAClF,KAAK;KACN,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,EAAgB;IACnC,MAAM,IAAI,GAAG,CAAC,MAAsB,EAAU,EAAE,CAC9C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,eAAe,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpE,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;AAC/C,CAAC;AAED,SAAS,kBAAkB,CACzB,MAAqB,EACrB,UAAwC;IAExC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC5D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAmB,CAAC;QAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,SAAS;QAC1C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,gBAAgB,CACvB,MAAqB,EACrB,SAAqC;IAErC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,IAAI,MAAM,GAA8B,MAAM,CAAC;IAC/C,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAC5D,MAAM,IAAI,GAA8B,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtE,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,CAAC,SAAS,EAAE,CAAC;YAC7F,MAAM;QACR,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5B,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,aAAa,CACpB,OAAwB;IAExB,IAAI,GAAuB,CAAC;IAC5B,IAAI,GAAuB,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC;YAC/C,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YAC9B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG;gBAAE,GAAG,GAAG,CAAC,CAAC;YAC1C,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG;gBAAE,GAAG,GAAG,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACD,OAAO,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;QAC3C,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;QACxC,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC;AAED,SAAS,eAAe,CAAC,CAAkB,EAAE,CAAkB;IAC7D,MAAM,EAAE,GAAG,CAAC,CAAC,aAAa,EAAE,GAAG,CAAC;IAChC,MAAM,EAAE,GAAG,CAAC,CAAC,aAAa,EAAE,GAAG,CAAC;IAChC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACtD,OAAO,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,CAAC;IACpD,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACxC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACxC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AA2BD;;;;;;;;;;;;GAYG;AACH,+GAA+G;AAC/G,SAAS,YAAY,CAAC,MAAe;IACnC,OAAO,MAAM;QACX,CAAC,CAAC,8FAA8F;YAC5F,6EAA6E;QACjF,CAAC,CAAC,EAAE,CAAC;AACT,CAAC;AAED,SAAS,eAAe,CACtB,cAAoC,EACpC,QAA2B;IAE3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC;QAC7D,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE;YAC1B,eAAe,EAAE,KAAK,CAAC,UAAU;YACjC,YAAY,EAAE,IAAI,GAAG,EAAE;YACvB,YAAY,EAAE,IAAI,GAAG,EAAE;SACxB,CAAC,CAAC;IACL,CAAC;IAED,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC;QAC1C,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS;QACpC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QAEhC,oEAAoE;QACpE,oEAAoE;QACpE,uEAAuE;QACvE,oEAAoE;QACpE,sEAAsE;QACtE,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,iBAAiB;gBAAE,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnE,IACE,GAAG,CAAC,QAAQ,KAAK,SAAS;gBAC1B,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS;gBACxC,CAAC,KAAK,CAAC,SAAS,KAAK,GAAG,CAAC,QAAQ,CAAC,SAAS,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EACpF,CAAC;gBACD,GAAG,CAAC,QAAQ,GAAG;oBACb,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,eAAe,EAAE,KAAK,CAAC,eAAe;oBACtC,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,GAAG,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC9E,QAAQ,EAAE,KAAK,CAAC,QAAQ;oBACxB,MAAM,EAAE,KAAK,CAAC,MAAM;iBACrB,CAAC;YACJ,CAAC;QACH,CAAC;QACD,mEAAmE;QACnE,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,iBAAiB;gBAAE,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnE,IACE,GAAG,CAAC,QAAQ,KAAK,SAAS;gBAC1B,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS;gBACxC,CAAC,KAAK,CAAC,SAAS,KAAK,GAAG,CAAC,QAAQ,CAAC,SAAS,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EACpF,CAAC;gBACD,GAAG,CAAC,QAAQ,GAAG;oBACb,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,eAAe,EAAE,KAAK,CAAC,eAAe;oBACtC,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,GAAG,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC9E,QAAQ,EAAE,KAAK,CAAC,QAAQ;oBACxB,MAAM,EAAE,KAAK,CAAC,MAAM;iBACrB,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC;QAC7D,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAkB,CAAC;QACzD,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,YAAY;gBAClB,eAAe,EAAE,GAAG,CAAC,QAAQ,CAAC,eAAe;gBAC7C,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5F,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,SAAS;gBACjC,gBAAgB,EAAE,GAAG,CAAC,QAAQ,CAAC,SAAS;gBACxC,QAAQ,EAAE,sBAAsB;gBAChC,iBAAiB,EAAE,GAAG,CAAC,YAAY,CAAC,IAAI;gBACxC,eAAe,EAAE,GAAG,CAAC,eAAe;gBACpC,KAAK,EAAE,6BAA6B;gBACpC,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,QAAQ;gBAC/B,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM;gBAC3B,KAAK,EACH,GAAG,GAAG,CAAC,YAAY,CAAC,IAAI,OAAO,GAAG,CAAC,eAAe,sCAAsC;oBACxF,kCAAkC,GAAG,CAAC,QAAQ,CAAC,SAAS,2BAA2B;oBACnF,6FAA6F;oBAC7F,0FAA0F;oBAC1F,UAAU;oBACV,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC;oBACjC,0FAA0F;oBAC1F,qBAAqB;aACxB,CAAC,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,WAAW;gBACjB,eAAe,EAAE,GAAG,CAAC,QAAQ,CAAC,eAAe;gBAC7C,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5F,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,SAAS;gBACjC,gBAAgB,EAAE,GAAG,CAAC,QAAQ,CAAC,SAAS;gBACxC,QAAQ,EAAE,uBAAuB;gBACjC,iBAAiB,EAAE,GAAG,CAAC,YAAY,CAAC,IAAI;gBACxC,eAAe,EAAE,GAAG,CAAC,eAAe;gBACpC,KAAK,EAAE,mBAAmB;gBAC1B,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,QAAQ;gBAC/B,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM;gBAC3B,KAAK,EACH,GAAG,GAAG,CAAC,YAAY,CAAC,IAAI,OAAO,GAAG,CAAC,eAAe,iCAAiC;oBACnF,0EAA0E;oBAC1E,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS,gEAAgE;oBACzF,uFAAuF;oBACvF,cAAc;oBACd,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC;oBACjC,qDAAqD;aACxD,CAAC,CAAC;QACL,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,YAAY,GAAG,MAAM,CAAC;IACrD,CAAC;IAED,sEAAsE;IACtE,qEAAqE;IACrE,oBAAoB;IACpB,MAAM,KAAK,GAAwB,EAAE,CAAC;IACtC,MAAM,MAAM,GAAG,cAAc,CAAC,kBAAkB,CAAC,MAAM,CAAC;IACxD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAkB,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,SAAS;QAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,CAAC,OAAO;gBAAE,SAAS;YAC/C,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAkB,CAAC;YAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;gBAAE,SAAS;YAC1C,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS;gBAAE,SAAS;YACjE,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAC7C,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;YAC5D,KAAK,CAAC,IAAI,CAAC;gBACT,aAAa,EAAE,MAAM,CAAC,OAAO;gBAC7B,YAAY,EAAE,KAAK,CAAC,OAAO;gBAC3B,oBAAoB,EAAE,IAAI,CAAC,QAAQ,CAAC,eAAe;gBACnD,mBAAmB,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS;gBAC5C,oBAAoB,EAAE,IAAI,CAAC,QAAQ,CAAC,eAAe;gBACnD,mBAAmB,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS;gBAC5C,KAAK,EAAE,eAAe;gBACtB,mBAAmB,EAAE,IAAI;gBACzB,aAAa;gBACb,aAAa;gBACb,MAAM;gBACN,uBAAuB,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI;gBAC/C,qBAAqB,EAAE,IAAI,CAAC,eAAe;gBAC3C,sBAAsB,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI;gBAC9C,oBAAoB,EAAE,IAAI,CAAC,eAAe;gBAC1C,IAAI,EACF,uCAAuC,MAAM,CAAC,OAAO,GAAG;oBACxD,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,OAAO,IAAI,CAAC,eAAe,wBAAwB;oBAC7E,mCAAmC,KAAK,CAAC,OAAO,GAAG;oBACnD,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,OAAO,IAAI,CAAC,eAAe,iCAAiC;oBACtF,kBAAkB,IAAI,CAAC,QAAQ,CAAC,SAAS,kCAAkC;oBAC3E,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,4DAA4D;oBACtF,kFAAkF;oBAClF,CAAC,MAAM;wBACL,CAAC,CAAC,uFAAuF;4BACvF,6EAA6E;wBAC/E,CAAC,CAAC,EAAE,CAAC;oBACP,+CAA+C;aAClD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAClB,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,aAAa;QACjC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa;YACjC,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY;YAC/B,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY;gBAC/B,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,CAAC,CACV,CAAC;IACF,OAAO,KAAK,CAAC;AACf,CAAC"}