@meshwhisper/sdk 0.1.0

package/dist/routing/index.js

@@ -0,0 +1,478 @@
+// ============================================================
+// MeshWhisper SDK — Social Graph Routing
+// Uses social proximity (not geographic or DHT) as routing
+// topology.  Implements Bubble-Rap-inspired discovery with
+// small-world properties (~6 hop average path length).
+// See PRD section 7.1.
+// ============================================================
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+/** Default TTL for proximity table entries (1 hour). */
+const DEFAULT_PEER_TTL_MS = 60 * 60 * 1000;
+/** Default TTL for cached routes (5 minutes). */
+const DEFAULT_ROUTE_TTL_MS = 5 * 60 * 1000;
+/** Default timeout for pending route requests (5 seconds). */
+const DEFAULT_REQUEST_TIMEOUT_MS = 5 * 1000;
+/** Maximum number of recent packet hashes kept for deduplication. */
+const SEEN_PACKET_CAPACITY = 10_000;
+/** Number of socially-closest peers to gossip route requests to. */
+const GOSSIP_FANOUT = 5;
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+/** Convert a Uint8Array to a hex string for use as a Map key. */
+function hashToHex(hash) {
+    let out = '';
+    for (let i = 0; i < hash.length; i++) {
+        out += hash[i].toString(16).padStart(2, '0');
+    }
+    return out;
+}
+/** Constant-time-ish byte array equality. */
+function bytesEqual(a, b) {
+    if (a.length !== b.length)
+        return false;
+    let diff = 0;
+    for (let i = 0; i < a.length; i++) {
+        diff |= a[i] ^ b[i];
+    }
+    return diff === 0;
+}
+/**
+ * XOR distance between two destination hashes.
+ * Returns a number usable for comparison (lower = closer).
+ * Works on up to 8-byte hashes.
+ */
+function xorDistance(a, b) {
+    const len = Math.min(a.length, b.length);
+    let distance = 0;
+    for (let i = 0; i < len; i++) {
+        distance = distance * 256 + (a[i] ^ b[i]);
+    }
+    return distance;
+}
+/**
+ * Compute a simple hash of a packet for deduplication.
+ * Uses destHash + senderEphemeralId + first 8 bytes of payload.
+ */
+function packetFingerprint(packet) {
+    const parts = [];
+    for (let i = 0; i < packet.destHash.length; i++) {
+        parts.push(packet.destHash[i]);
+    }
+    for (let i = 0; i < packet.senderEphemeralId.length; i++) {
+        parts.push(packet.senderEphemeralId[i]);
+    }
+    const payloadSample = Math.min(8, packet.encryptedPayload.length);
+    for (let i = 0; i < payloadSample; i++) {
+        parts.push(packet.encryptedPayload[i]);
+    }
+    return parts.map(b => b.toString(16).padStart(2, '0')).join('');
+}
+// ---------------------------------------------------------------------------
+// PeerProximityTable
+// ---------------------------------------------------------------------------
+/**
+ * Maintains a table of known peers indexed by social proximity.
+ * Entries are keyed by peerId and can also be looked up by destHash.
+ */
+export class PeerProximityTable {
+    entries = new Map();
+    destHashIndex = new Map(); // hex(destHash) -> peerId
+    ttlMs;
+    constructor(ttlMs = DEFAULT_PEER_TTL_MS) {
+        this.ttlMs = ttlMs;
+    }
+    /** Add or replace a peer entry. */
+    addPeer(entry) {
+        this.entries.set(entry.peerId, entry);
+        this.destHashIndex.set(hashToHex(entry.destHash), entry.peerId);
+    }
+    /** Remove a peer by ID. */
+    removePeer(peerId) {
+        const existing = this.entries.get(peerId);
+        if (existing) {
+            this.destHashIndex.delete(hashToHex(existing.destHash));
+            this.entries.delete(peerId);
+        }
+    }
+    /** Partially update an existing peer entry. */
+    updatePeer(peerId, updates) {
+        const existing = this.entries.get(peerId);
+        if (!existing)
+            return;
+        // If destHash changes, update the index.
+        if (updates.destHash && !bytesEqual(updates.destHash, existing.destHash)) {
+            this.destHashIndex.delete(hashToHex(existing.destHash));
+            this.destHashIndex.set(hashToHex(updates.destHash), peerId);
+        }
+        const updated = { ...existing, ...updates };
+        this.entries.set(peerId, updated);
+    }
+    /** Find a peer that owns the given destination hash. */
+    findPeer(destHash) {
+        const hex = hashToHex(destHash);
+        const peerId = this.destHashIndex.get(hex);
+        if (peerId === undefined)
+            return null;
+        const entry = this.entries.get(peerId);
+        if (!entry) {
+            // Stale index entry — clean up.
+            this.destHashIndex.delete(hex);
+            return null;
+        }
+        return entry;
+    }
+    /**
+     * Return the N peers whose known destHash is closest (by XOR distance) to
+     * the target destination hash.  Results are sorted closest-first.
+     */
+    getClosestPeers(destHash, count) {
+        const scored = [];
+        for (const entry of this.entries.values()) {
+            scored.push({
+                entry,
+                distance: xorDistance(entry.destHash, destHash),
+            });
+        }
+        scored.sort((a, b) => a.distance - b.distance);
+        return scored.slice(0, count).map(s => s.entry);
+    }
+    /** Remove entries whose lastSeen is older than maxAgeMs. */
+    pruneStale(maxAgeMs = this.ttlMs) {
+        const cutoff = Date.now() - maxAgeMs;
+        for (const [peerId, entry] of this.entries) {
+            if (entry.lastSeen < cutoff) {
+                this.removePeer(peerId);
+            }
+        }
+    }
+    /** Number of entries currently in the table. */
+    get size() {
+        return this.entries.size;
+    }
+    /** Iterate all entries (snapshot). */
+    allEntries() {
+        return Array.from(this.entries.values());
+    }
+}
+// ---------------------------------------------------------------------------
+// Seen-packet LRU set (bounded ring buffer)
+// ---------------------------------------------------------------------------
+class SeenPacketSet {
+    capacity;
+    set = new Set();
+    ring;
+    cursor = 0;
+    constructor(capacity = SEEN_PACKET_CAPACITY) {
+        this.capacity = capacity;
+        this.ring = new Array(capacity).fill('');
+    }
+    /** Returns true if the fingerprint was already in the set. */
+    testAndAdd(fingerprint) {
+        if (this.set.has(fingerprint))
+            return true;
+        // Evict oldest if at capacity.
+        if (this.set.size >= this.capacity) {
+            const evict = this.ring[this.cursor];
+            if (evict)
+                this.set.delete(evict);
+        }
+        this.ring[this.cursor] = fingerprint;
+        this.set.add(fingerprint);
+        this.cursor = (this.cursor + 1) % this.capacity;
+        return false;
+    }
+    has(fingerprint) {
+        return this.set.has(fingerprint);
+    }
+}
+// ---------------------------------------------------------------------------
+// Route cache
+// ---------------------------------------------------------------------------
+class RouteCache {
+    routes = new Map();
+    getCachedRoute(destHash) {
+        const key = hashToHex(destHash);
+        const route = this.routes.get(key);
+        if (!route)
+            return null;
+        if (Date.now() > route.expiresAt) {
+            this.routes.delete(key);
+            return null;
+        }
+        return route;
+    }
+    cacheRoute(route) {
+        this.routes.set(hashToHex(route.destHash), route);
+    }
+    invalidateRoute(destHash) {
+        this.routes.delete(hashToHex(destHash));
+    }
+}
+// ---------------------------------------------------------------------------
+// SocialGraphRouter
+// ---------------------------------------------------------------------------
+/**
+ * Core social graph router.
+ *
+ * Uses the peer proximity table as the routing topology.
+ * Route discovery gossips route requests to socially proximate peers
+ * and selects the shortest/fastest offered route.
+ */
+export class SocialGraphRouter {
+    localPeerId;
+    proximityTable;
+    routeCache = new RouteCache();
+    seenPackets = new SeenPacketSet();
+    pendingRequests = new Map();
+    routeTtlMs;
+    requestTimeoutMs;
+    constructor(localPeerId, proximityTable, options) {
+        this.localPeerId = localPeerId;
+        this.proximityTable = proximityTable;
+        this.routeTtlMs = options?.routeTtlMs ?? DEFAULT_ROUTE_TTL_MS;
+        this.requestTimeoutMs = options?.requestTimeoutMs ?? DEFAULT_REQUEST_TIMEOUT_MS;
+    }
+    // -----------------------------------------------------------------------
+    // Route cache public API
+    // -----------------------------------------------------------------------
+    /** Retrieve a cached route if it exists and has not expired. */
+    getCachedRoute(destHash) {
+        return this.routeCache.getCachedRoute(destHash);
+    }
+    /** Store a route in the cache. */
+    cacheRoute(route) {
+        this.routeCache.cacheRoute(route);
+    }
+    /** Remove a cached route. */
+    invalidateRoute(destHash) {
+        this.routeCache.invalidateRoute(destHash);
+    }
+    // -----------------------------------------------------------------------
+    // Route discovery (PRD section 7.1)
+    // -----------------------------------------------------------------------
+    /**
+     * Discover a route to the given destination hash.
+     *
+     * Algorithm:
+     *   1. Check the route cache for a non-expired entry.
+     *   2. Check if any connected peer in the proximity table has a recent
+     *      relay path to the destination.
+     *   3. If not, create a RouteRequest (containing only dest_hash, not
+     *      sender identity) and gossip it to socially proximate peers.
+     *   4. Collect RouteOffer responses within the request timeout.
+     *   5. Select the shortest/fastest offered route.
+     *
+     * Returns the route, or null if no route could be discovered within the
+     * timeout window.
+     */
+    findRoute(destHash) {
+        // 1. Check cache.
+        const cached = this.routeCache.getCachedRoute(destHash);
+        if (cached)
+            return Promise.resolve(cached);
+        // 2. Check proximity table for a direct or relay path.
+        const directPeer = this.proximityTable.findPeer(destHash);
+        if (directPeer && this.isRecent(directPeer.lastSeen)) {
+            const route = this.peerToRoute(directPeer, destHash);
+            this.routeCache.cacheRoute(route);
+            return Promise.resolve(route);
+        }
+        // 3. Create a RouteRequest and gossip to close peers.
+        const requestId = this.generateRequestId();
+        const request = {
+            destHash,
+            requestId,
+            ttl: 6, // small-world average path length
+            timestamp: Date.now(),
+        };
+        return new Promise((resolve) => {
+            const pending = {
+                request,
+                createdAt: Date.now(),
+                timeoutMs: this.requestTimeoutMs,
+                offers: [],
+                resolve,
+            };
+            const key = hashToHex(requestId);
+            this.pendingRequests.set(key, pending);
+            // 4-5. Timeout: after the window closes, pick the best offer.
+            setTimeout(() => {
+                this.resolvePendingRequest(key);
+            }, this.requestTimeoutMs);
+        });
+    }
+    /**
+     * Handle an incoming route request from a neighbouring peer.
+     *
+     * If this node knows the destination (via its proximity table), it
+     * returns a RouteOffer.  Otherwise returns null (the caller should
+     * decide whether to forward the request further).
+     */
+    handleRouteRequest(request, fromPeer) {
+        const peer = this.proximityTable.findPeer(request.destHash);
+        if (!peer)
+            return null;
+        if (!this.isRecent(peer.lastSeen))
+            return null;
+        return {
+            requestId: request.requestId,
+            hopCount: peer.hopCount + 1, // +1 for this node in the path
+            estimatedLatency: peer.latency,
+            offeredBy: this.localPeerId,
+        };
+    }
+    /**
+     * Register a received route offer against the matching pending request.
+     * If no pending request exists for the offer's requestId, the offer is
+     * silently dropped.
+     */
+    handleRouteOffer(offer) {
+        const key = hashToHex(offer.requestId);
+        const pending = this.pendingRequests.get(key);
+        if (!pending)
+            return;
+        pending.offers.push(offer);
+    }
+    /**
+     * Return a list of the RouteRequests that are still awaiting responses.
+     * Expired requests are pruned as a side-effect.
+     */
+    getPendingRequests() {
+        this.pruneExpiredRequests();
+        const result = [];
+        for (const pending of this.pendingRequests.values()) {
+            result.push(pending.request);
+        }
+        return result;
+    }
+    /**
+     * Return the list of socially proximate peers that a route request
+     * should be gossiped to.  Useful for the transport layer to know where
+     * to send route requests produced by findRoute.
+     */
+    getGossipTargets(destHash) {
+        return this.proximityTable.getClosestPeers(destHash, GOSSIP_FANOUT);
+    }
+    // -----------------------------------------------------------------------
+    // Message forwarding
+    // -----------------------------------------------------------------------
+    /**
+     * Determine the next-hop peer to forward a message to for the given
+     * destination hash.
+     *
+     * Returns null if no route is known.
+     */
+    getNextHop(destHash) {
+        // Try cache first.
+        const cached = this.routeCache.getCachedRoute(destHash);
+        if (cached)
+            return cached.nextHop;
+        // Try direct peer from proximity table.
+        const peer = this.proximityTable.findPeer(destHash);
+        if (peer && this.isRecent(peer.lastSeen)) {
+            return peer.relayPath.length > 0 ? peer.relayPath[0] : peer.peerId;
+        }
+        // Try closest peer as a heuristic relay.
+        const closest = this.proximityTable.getClosestPeers(destHash, 1);
+        if (closest.length > 0 && this.isRecent(closest[0].lastSeen)) {
+            return closest[0].peerId;
+        }
+        return null;
+    }
+    /**
+     * Determine whether this device should relay a given packet.
+     *
+     * A packet is relayed when:
+     *   - Its TTL is greater than 0
+     *   - It has not been seen before (deduplication)
+     */
+    shouldRelay(packet) {
+        if (packet.ttl <= 0)
+            return false;
+        const fp = packetFingerprint(packet);
+        const alreadySeen = this.seenPackets.testAndAdd(fp);
+        return !alreadySeen;
+    }
+    /**
+     * Return a copy of the packet with TTL decremented by 1.
+     * Callers must ensure TTL > 0 before calling (see shouldRelay).
+     */
+    decrementTTL(packet) {
+        if (packet.ttl <= 0) {
+            throw new RangeError('Cannot decrement TTL below 0');
+        }
+        return {
+            ...packet,
+            ttl: packet.ttl - 1,
+        };
+    }
+    // -----------------------------------------------------------------------
+    // Internal helpers
+    // -----------------------------------------------------------------------
+    /** Check if a timestamp is recent enough to trust. */
+    isRecent(timestamp) {
+        return (Date.now() - timestamp) < DEFAULT_PEER_TTL_MS;
+    }
+    /** Convert a proximity entry to a Route. */
+    peerToRoute(peer, destHash) {
+        const now = Date.now();
+        return {
+            destHash,
+            nextHop: peer.relayPath.length > 0 ? peer.relayPath[0] : peer.peerId,
+            hopCount: peer.hopCount,
+            estimatedLatency: peer.latency,
+            discoveredAt: now,
+            expiresAt: now + this.routeTtlMs,
+        };
+    }
+    /** Resolve a pending request by selecting the best offer. */
+    resolvePendingRequest(key) {
+        const pending = this.pendingRequests.get(key);
+        if (!pending)
+            return;
+        this.pendingRequests.delete(key);
+        if (pending.offers.length === 0) {
+            pending.resolve(null);
+            return;
+        }
+        // Select best offer: prefer fewest hops, then lowest latency.
+        pending.offers.sort((a, b) => {
+            if (a.hopCount !== b.hopCount)
+                return a.hopCount - b.hopCount;
+            return a.estimatedLatency - b.estimatedLatency;
+        });
+        const best = pending.offers[0];
+        const now = Date.now();
+        const route = {
+            destHash: pending.request.destHash,
+            nextHop: best.offeredBy,
+            hopCount: best.hopCount,
+            estimatedLatency: best.estimatedLatency,
+            discoveredAt: now,
+            expiresAt: now + this.routeTtlMs,
+        };
+        this.routeCache.cacheRoute(route);
+        pending.resolve(route);
+    }
+    /** Remove pending requests that have exceeded their timeout. */
+    pruneExpiredRequests() {
+        const now = Date.now();
+        for (const [key, pending] of this.pendingRequests) {
+            if (now - pending.createdAt > pending.timeoutMs) {
+                this.pendingRequests.delete(key);
+                pending.resolve(null);
+            }
+        }
+    }
+    /** Generate a random 16-byte request ID. */
+    generateRequestId() {
+        const id = new Uint8Array(16);
+        // globalThis.crypto is available in Node.js 19+ and all modern browsers.
+        globalThis.crypto.getRandomValues(id);
+        return id;
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/routing/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/routing/index.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAC/D,yCAAyC;AACzC,2DAA2D;AAC3D,2DAA2D;AAC3D,uDAAuD;AACvD,uBAAuB;AACvB,+DAA+D;AAI/D,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,wDAAwD;AACxD,MAAM,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE3C,iDAAiD;AACjD,MAAM,oBAAoB,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;AAE3C,8DAA8D;AAC9D,MAAM,0BAA0B,GAAG,CAAC,GAAG,IAAI,CAAC;AAE5C,qEAAqE;AACrE,MAAM,oBAAoB,GAAG,MAAM,CAAC;AAEpC,oEAAoE;AACpE,MAAM,aAAa,GAAG,CAAC,CAAC;AAexB,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,iEAAiE;AACjE,SAAS,SAAS,CAAC,IAAgB;IACjC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6CAA6C;AAC7C,SAAS,UAAU,CAAC,CAAa,EAAE,CAAa;IAC9C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,CAAa,EAAE,CAAa;IAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,QAAQ,GAAG,QAAQ,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,MAAc;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAClE,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IACZ,OAAO,GAAoC,IAAI,GAAG,EAAE,CAAC;IACrD,aAAa,GAAwB,IAAI,GAAG,EAAE,CAAC,CAAC,0BAA0B;IAC1E,KAAK,CAAS;IAE/B,YAAY,QAAgB,mBAAmB;QAC7C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,mCAAmC;IACnC,OAAO,CAAC,KAAyB;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAClE,CAAC;IAED,2BAA2B;IAC3B,UAAU,CAAC,MAAc;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,UAAU,CAAC,MAAc,EAAE,OAAoC;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,yCAAyC;QACzC,IAAI,OAAO,CAAC,QAAQ,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,OAAO,GAAuB,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC;QAChE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,wDAAwD;IACxD,QAAQ,CAAC,QAAoB;QAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3C,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAEtC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,gCAAgC;YAChC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC/B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,QAAoB,EAAE,KAAa;QACjD,MAAM,MAAM,GAA2D,EAAE,CAAC;QAE1E,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC;gBACV,KAAK;gBACL,QAAQ,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC;aAChD,CAAC,CAAC;QACL,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC/C,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;IAED,4DAA4D;IAC5D,UAAU,CAAC,WAAmB,IAAI,CAAC,KAAK;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;QACrC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC3C,IAAI,KAAK,CAAC,QAAQ,GAAG,MAAM,EAAE,CAAC;gBAC5B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,sCAAsC;IACtC,UAAU;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3C,CAAC;CACF;AAED,8EAA8E;AAC9E,4CAA4C;AAC5C,8EAA8E;AAE9E,MAAM,aAAa;IACA,QAAQ,CAAS;IACjB,GAAG,GAAgB,IAAI,GAAG,EAAE,CAAC;IAC7B,IAAI,CAAW;IACxB,MAAM,GAAG,CAAC,CAAC;IAEnB,YAAY,WAAmB,oBAAoB;QACjD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAS,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnD,CAAC;IAED,8DAA8D;IAC9D,UAAU,CAAC,WAAmB;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC;YAAE,OAAO,IAAI,CAAC;QAE3C,+BAA+B;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,KAAK;gBAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,GAAG,CAAC,WAAmB;QACrB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACnC,CAAC;CACF;AAcD,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E,MAAM,UAAU;IACG,MAAM,GAAuB,IAAI,GAAG,EAAE,CAAC;IAExD,cAAc,CAAC,QAAoB;QACjC,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,UAAU,CAAC,KAAY;QACrB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,eAAe,CAAC,QAAoB;QAClC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC1C,CAAC;CACF;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,OAAO,iBAAiB;IACnB,WAAW,CAAS;IACpB,cAAc,CAAqB;IAE3B,UAAU,GAAe,IAAI,UAAU,EAAE,CAAC;IAC1C,WAAW,GAAkB,IAAI,aAAa,EAAE,CAAC;IACjD,eAAe,GAAgC,IAAI,GAAG,EAAE,CAAC;IACzD,UAAU,CAAS;IACnB,gBAAgB,CAAS;IAE1C,YACE,WAAmB,EACnB,cAAkC,EAClC,OAGC;QAED,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,oBAAoB,CAAC;QAC9D,IAAI,CAAC,gBAAgB,GAAG,OAAO,EAAE,gBAAgB,IAAI,0BAA0B,CAAC;IAClF,CAAC;IAED,0EAA0E;IAC1E,yBAAyB;IACzB,0EAA0E;IAE1E,gEAAgE;IAChE,cAAc,CAAC,QAAoB;QACjC,OAAO,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC;IAED,kCAAkC;IAClC,UAAU,CAAC,KAAY;QACrB,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED,6BAA6B;IAC7B,eAAe,CAAC,QAAoB;QAClC,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,0EAA0E;IAC1E,oCAAoC;IACpC,0EAA0E;IAE1E;;;;;;;;;;;;;;OAcG;IACH,SAAS,CAAC,QAAoB;QAC5B,kBAAkB;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,MAAM;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAE3C,uDAAuD;QACvD,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,UAAU,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QAED,sDAAsD;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAiB;YAC5B,QAAQ;YACR,SAAS;YACT,GAAG,EAAE,CAAC,EAAE,kCAAkC;YAC1C,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC;QAEF,OAAO,IAAI,OAAO,CAAe,CAAC,OAAO,EAAE,EAAE;YAC3C,MAAM,OAAO,GAAmB;gBAC9B,OAAO;gBACP,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,SAAS,EAAE,IAAI,CAAC,gBAAgB;gBAChC,MAAM,EAAE,EAAE;gBACV,OAAO;aACR,CAAC;YAEF,MAAM,GAAG,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACjC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAEvC,8DAA8D;YAC9D,UAAU,CAAC,GAAG,EAAE;gBACd,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,kBAAkB,CAAC,OAAqB,EAAE,QAAgB;QACxD,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QAE/C,OAAO;YACL,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,QAAQ,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,+BAA+B;YAC5D,gBAAgB,EAAE,IAAI,CAAC,OAAO;YAC9B,SAAS,EAAE,IAAI,CAAC,WAAW;SAC5B,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,KAAiB;QAChC,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,kBAAkB;QAChB,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACpD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,QAAoB;QACnC,OAAO,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IACtE,CAAC;IAED,0EAA0E;IAC1E,qBAAqB;IACrB,0EAA0E;IAE1E;;;;;OAKG;IACH,UAAU,CAAC,QAAoB;QAC7B,mBAAmB;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC,OAAO,CAAC;QAElC,wCAAwC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACpD,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzC,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACrE,CAAC;QAED,yCAAyC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACjE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7D,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC3B,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,MAAc;QACxB,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAElC,MAAM,EAAE,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACpD,OAAO,CAAC,WAAW,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,MAAc;QACzB,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;QACvD,CAAC;QACD,OAAO;YACL,GAAG,MAAM;YACT,GAAG,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC;SACpB,CAAC;IACJ,CAAC;IAED,0EAA0E;IAC1E,mBAAmB;IACnB,0EAA0E;IAE1E,sDAAsD;IAC9C,QAAQ,CAAC,SAAiB;QAChC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,mBAAmB,CAAC;IACxD,CAAC;IAED,4CAA4C;IACpC,WAAW,CAAC,IAAwB,EAAE,QAAoB;QAChE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO;YACL,QAAQ;YACR,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;YACpE,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,gBAAgB,EAAE,IAAI,CAAC,OAAO;YAC9B,YAAY,EAAE,GAAG;YACjB,SAAS,EAAE,GAAG,GAAG,IAAI,CAAC,UAAU;SACjC,CAAC;IACJ,CAAC;IAED,6DAA6D;IACrD,qBAAqB,CAAC,GAAW;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAEjC,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACtB,OAAO;QACT,CAAC;QAED,8DAA8D;QAC9D,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ;gBAAE,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;YAC9D,OAAO,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,KAAK,GAAU;YACnB,QAAQ,EAAE,OAAO,CAAC,OAAO,CAAC,QAAQ;YAClC,OAAO,EAAE,IAAI,CAAC,SAAS;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;YACvC,YAAY,EAAE,GAAG;YACjB,SAAS,EAAE,GAAG,GAAG,IAAI,CAAC,UAAU;SACjC,CAAC;QAEF,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,gEAAgE;IACxD,oBAAoB;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YAClD,IAAI,GAAG,GAAG,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;gBAChD,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,4CAA4C;IACpC,iBAAiB;QACvB,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,yEAAyE;QACzE,UAAU,CAAC,MAAM,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACtC,OAAO,EAAE,CAAC;IACZ,CAAC;CACF"}