@terkoizmy/intent-sdk 1.0.0

package/dist/solver/inventory/rebalancer.js

@@ -0,0 +1,210 @@
+/**
+ * Rebalancer
+ *
+ * Detects when inventory is unevenly distributed across chains
+ * and triggers cross-chain bridging to restore target distribution.
+ *
+ * Uses the Swing.xyz aggregator (Phase I) to find the best bridge route.
+ * Priority order: critical > high > medium > low.
+ *
+ * EXAMPLE:
+ *   Target: 50% ETH, 50% Polygon
+ *   Actual: 80% ETH, 20% Polygon
+ *   → RebalanceTask { fromChain: 1, toChain: 137, amount: 30% of total }
+ */
+export class Rebalancer {
+    inventoryManager;
+    bridgeProtocol;
+    config;
+    agentAddress;
+    constructor(inventoryManager, bridgeProtocol, config, 
+    /** Agent address to receive funds on destination */
+    agentAddress) {
+        this.inventoryManager = inventoryManager;
+        this.bridgeProtocol = bridgeProtocol;
+        this.config = config;
+        this.agentAddress = agentAddress;
+    }
+    // ─────────────────────────────────────────────
+    // Public API
+    // ─────────────────────────────────────────────
+    /**
+     * Detect chains whose balance deviates from target distribution.
+     *
+     * Uses **net available balance** (available − locked) per chain so the
+     * calculation is consistent with getTotalBalance(), which also uses net.
+     *
+     * @param token - Token symbol to check. Defaults to "USDC".
+     * @returns Array of RebalanceTasks sorted by priority (critical first)
+     */
+    needsRebalancing(token = "USDC") {
+        const total = this.inventoryManager.getTotalBalance(token);
+        if (total === 0n)
+            return [];
+        const snapshot = this.inventoryManager.getSnapshot();
+        const tasks = [];
+        // Group balances by chain using NET available (available − locked).
+        // Must match getTotalBalance() semantics — both use net — so that
+        // per-chain percentages add up to 100%.
+        const chainBalances = new Map();
+        for (const b of snapshot.balances) {
+            if (b.token === token) {
+                const net = b.available - b.locked;
+                chainBalances.set(b.chainId, net > 0n ? net : 0n);
+            }
+        }
+        // Clone targetDistribution to avoid mutating the config object.
+        // Record<string, number> is used because JS object keys are always strings;
+        // chain IDs are coerced to string when used as keys.
+        const targets = this.config.targetDistribution
+            ? { ...this.config.targetDistribution }
+            : {};
+        const chainIds = Array.from(chainBalances.keys());
+        // If no explicit targets, distribute equally among active chains
+        if (Object.keys(targets).length === 0 && chainIds.length > 0) {
+            const share = 1 / chainIds.length;
+            chainIds.forEach(id => {
+                targets[String(id)] = share;
+            });
+        }
+        // Calculate deviations
+        const excesses = [];
+        const deficits = [];
+        // Iterate over the union of chains with a balance and chains with a target
+        const allChains = new Set([...chainIds, ...Object.keys(targets).map(Number)]);
+        for (const chainId of allChains) {
+            const current = chainBalances.get(chainId) ?? 0n;
+            // Keys are stored as strings; coerce chainId to string for lookup
+            const targetPercent = targets[String(chainId)] ?? 0;
+            // Target amount = total * targetPercent using basis-point integer math
+            const bps = BigInt(Math.floor(targetPercent * 10000));
+            const targetAmount = (total * bps) / 10000n;
+            if (current > targetAmount) {
+                excesses.push({ chainId, amount: current - targetAmount });
+            }
+            else if (current < targetAmount) {
+                deficits.push({ chainId, amount: targetAmount - current });
+            }
+        }
+        // Match excesses to deficits.
+        // Greedy strategy: pair largest excess with largest deficit first.
+        // Use a safe bigint comparator to avoid Number precision loss for very
+        // large amounts (> Number.MAX_SAFE_INTEGER ≈ 9 quadrillion raw units).
+        const safeCmp = (a, b) => (a > b ? -1 : a < b ? 1 : 0);
+        excesses.sort((a, b) => safeCmp(a.amount, b.amount));
+        deficits.sort((a, b) => safeCmp(a.amount, b.amount));
+        // Pair tasks (token is the parameterised token, not hardcoded)
+        let eIdx = 0;
+        let dIdx = 0;
+        while (eIdx < excesses.length && dIdx < deficits.length) {
+            const source = excesses[eIdx];
+            const target = deficits[dIdx];
+            // Amount to move is min(excess, deficit)
+            let amount = source.amount < target.amount ? source.amount : target.amount;
+            // Check if this move is significant enough (deviation > threshold)
+            // Deviation = amount / total
+            const deviation = Number(amount) / Number(total);
+            if (deviation > this.config.rebalanceThreshold) {
+                let priority = "low";
+                if (deviation > 0.5)
+                    priority = "critical";
+                else if (deviation > 0.3)
+                    priority = "high";
+                else if (deviation > this.config.rebalanceThreshold)
+                    priority = "medium";
+                tasks.push({
+                    fromChain: source.chainId,
+                    toChain: target.chainId,
+                    token,
+                    amount,
+                    reason: `Deviation ${(deviation * 100).toFixed(1)}% exceeds threshold`,
+                    priority,
+                });
+            }
+            // Update remaining amounts
+            source.amount -= amount;
+            target.amount -= amount;
+            if (source.amount === 0n)
+                eIdx++;
+            if (target.amount === 0n)
+                dIdx++;
+        }
+        // Sort by priority
+        const priorityWeight = { "critical": 4, "high": 3, "medium": 2, "low": 1 };
+        return tasks.sort((a, b) => priorityWeight[b.priority] - priorityWeight[a.priority]);
+    }
+    /**
+     * Execute a single rebalance task.
+     */
+    async execute(task) {
+        console.log(`Executing rebalance: ${task.amount} ${task.token} from ${task.fromChain} to ${task.toChain}`);
+        try {
+            // 1. Get quote to verify feasibility
+            const quote = await this.bridgeProtocol.quote({
+                fromChain: task.fromChain,
+                toChain: task.toChain,
+                token: task.token,
+                amount: task.amount,
+            });
+            console.log(`Bridge quote: Fee ${quote.fee}, Output ${quote.outputAmount}`);
+            // 2. Lock funds BEFORE calling bridge.
+            //    Any concurrent canFulfill() check will immediately see the
+            //    reservation, preventing double-spending.
+            //    If lockAmount throws (e.g. insufficient balance), the bridge
+            //    is never called and the exception propagates to the catch block.
+            const rebalanceId = `rebalance-${Date.now()}`;
+            this.inventoryManager.lockAmount(task.fromChain, task.token, task.amount, rebalanceId);
+            // 3. Execute bridge
+            const result = await this.bridgeProtocol.bridge({
+                fromChain: task.fromChain,
+                toChain: task.toChain,
+                token: task.token,
+                amount: task.amount,
+                recipient: this.agentAddress,
+            });
+            if (result.success) {
+                // 4a. Success — confirm deduction (consumes the lock and reduces available).
+                this.inventoryManager.confirmDeduction(task.fromChain, task.token, task.amount, rebalanceId);
+                console.log(`Rebalance tx sent: ${result.txHash}`);
+            }
+            else {
+                // 4b. Failure — release the lock to restore available balance.
+                console.error("Rebalance failed execution:", result.error);
+                this.inventoryManager.unlockAmount(task.fromChain, task.token, task.amount, rebalanceId);
+            }
+            return result;
+        }
+        catch (error) {
+            console.error("Rebalance exception:", error);
+            return {
+                success: false,
+                error: error instanceof Error ? error.message : String(error),
+            };
+        }
+    }
+    /**
+     * Run full auto-rebalance cycle.
+     */
+    async autoRebalance() {
+        const tasks = this.needsRebalancing();
+        if (tasks.length === 0) {
+            console.log("Inventory balanced, no rebalancing needed.");
+            return;
+        }
+        console.log(`Found ${tasks.length} rebalance tasks`);
+        let totalCost = 0n;
+        for (const task of tasks) {
+            // Double check availability before executing
+            if (this.inventoryManager.canFulfill(task.fromChain, task.token, task.amount)) {
+                const result = await this.execute(task);
+                if (result.success) {
+                    totalCost += 0n; // TODO: Parse gas cost from result if available
+                }
+            }
+            else {
+                console.warn(`Skipping rebalance task due to insufficient funds: ${task.fromChain} -> ${task.toChain}`);
+            }
+        }
+    }
+}
+//# sourceMappingURL=rebalancer.js.map

package/dist/solver/inventory/rebalancer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rebalancer.js","sourceRoot":"","sources":["../../../src/solver/inventory/rebalancer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAqCH,MAAM,OAAO,UAAU;IAEE;IACA;IACA;IAEA;IALrB,YACqB,gBAAkC,EAClC,cAA+B,EAC/B,MAAuB;IACxC,oDAAoD;IACnC,YAAoB;QAJpB,qBAAgB,GAAhB,gBAAgB,CAAkB;QAClC,mBAAc,GAAd,cAAc,CAAiB;QAC/B,WAAM,GAAN,MAAM,CAAiB;QAEvB,iBAAY,GAAZ,YAAY,CAAQ;IACrC,CAAC;IAEL,gDAAgD;IAChD,aAAa;IACb,gDAAgD;IAEhD;;;;;;;;OAQG;IACH,gBAAgB,CAAC,KAAK,GAAG,MAAM;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC3D,IAAI,KAAK,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC;QAE5B,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,CAAC;QACrD,MAAM,KAAK,GAAoB,EAAE,CAAC;QAElC,oEAAoE;QACpE,kEAAkE;QAClE,wCAAwC;QACxC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAmB,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;gBACpB,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC;gBACnC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtD,CAAC;QACL,CAAC;QAED,gEAAgE;QAChE,4EAA4E;QAC5E,qDAAqD;QACrD,MAAM,OAAO,GAA2B,IAAI,CAAC,MAAM,CAAC,kBAAkB;YAClE,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE;YACvC,CAAC,CAAC,EAAE,CAAC;QACT,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;QAElD,iEAAiE;QACjE,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3D,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAClC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gBAClB,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;YAChC,CAAC,CAAC,CAAC;QACP,CAAC;QAED,uBAAuB;QACvB,MAAM,QAAQ,GAAgD,EAAE,CAAC;QACjE,MAAM,QAAQ,GAAgD,EAAE,CAAC;QAEjE,2EAA2E;QAC3E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE9E,KAAK,MAAM,OAAO,IAAI,SAAS,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACjD,kEAAkE;YAClE,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC;YAEpD,uEAAuE;YACvE,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC;YACtD,MAAM,YAAY,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;YAE5C,IAAI,OAAO,GAAG,YAAY,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,YAAY,EAAE,CAAC,CAAC;YAC/D,CAAC;iBAAM,IAAI,OAAO,GAAG,YAAY,EAAE,CAAC;gBAChC,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,GAAG,OAAO,EAAE,CAAC,CAAC;YAC/D,CAAC;QACL,CAAC;QAED,8BAA8B;QAC9B,mEAAmE;QACnE,uEAAuE;QACvE,uEAAuE;QACvE,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACrD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAErD,+DAA+D;QAE/D,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QAEb,OAAO,IAAI,GAAG,QAAQ,CAAC,MAAM,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YACtD,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC9B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;YAE9B,yCAAyC;YACzC,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;YAE3E,mEAAmE;YACnE,6BAA6B;YAC7B,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAEjD,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,IAAI,QAAQ,GAA2C,KAAK,CAAC;gBAC7D,IAAI,SAAS,GAAG,GAAG;oBAAE,QAAQ,GAAG,UAAU,CAAC;qBACtC,IAAI,SAAS,GAAG,GAAG;oBAAE,QAAQ,GAAG,MAAM,CAAC;qBACvC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB;oBAAE,QAAQ,GAAG,QAAQ,CAAC;gBAEzE,KAAK,CAAC,IAAI,CAAC;oBACP,SAAS,EAAE,MAAM,CAAC,OAAO;oBACzB,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,KAAK;oBACL,MAAM;oBACN,MAAM,EAAE,aAAa,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB;oBACtE,QAAQ;iBACX,CAAC,CAAC;YACP,CAAC;YAED,2BAA2B;YAC3B,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC;YACxB,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC;YAExB,IAAI,MAAM,CAAC,MAAM,KAAK,EAAE;gBAAE,IAAI,EAAE,CAAC;YACjC,IAAI,MAAM,CAAC,MAAM,KAAK,EAAE;gBAAE,IAAI,EAAE,CAAC;QACrC,CAAC;QAED,mBAAmB;QACnB,MAAM,cAAc,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC3E,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,IAAmB;QAC7B,OAAO,CAAC,GAAG,CAAC,wBAAwB,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,SAAS,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAE3G,IAAI,CAAC;YACD,qCAAqC;YACrC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;gBAC1C,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;aACtB,CAAC,CAAC;YAEH,OAAO,CAAC,GAAG,CAAC,qBAAqB,KAAK,CAAC,GAAG,YAAY,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;YAE5E,uCAAuC;YACvC,gEAAgE;YAChE,8CAA8C;YAC9C,kEAAkE;YAClE,sEAAsE;YACtE,MAAM,WAAW,GAAG,aAAa,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAEvF,oBAAoB;YACpB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC;gBAC5C,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,SAAS,EAAE,IAAI,CAAC,YAAY;aAC/B,CAAC,CAAC;YAEH,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACjB,6EAA6E;gBAC7E,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC7F,OAAO,CAAC,GAAG,CAAC,sBAAsB,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YACvD,CAAC;iBAAM,CAAC;gBACJ,+DAA+D;gBAC/D,OAAO,CAAC,KAAK,CAAC,6BAA6B,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC3D,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC7F,CAAC;YAED,OAAO,MAAM,CAAC;QAElB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,sBAAsB,EAAE,KAAK,CAAC,CAAC;YAC7C,OAAO;gBACH,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;aAChE,CAAC;QACN,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,4CAA4C,CAAC,CAAC;YAC1D,OAAO;QACX,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,SAAS,KAAK,CAAC,MAAM,kBAAkB,CAAC,CAAC;QACrD,IAAI,SAAS,GAAG,EAAE,CAAC;QAEnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,6CAA6C;YAC7C,IAAI,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5E,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACxC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACjB,SAAS,IAAI,EAAE,CAAC,CAAC,gDAAgD;gBACrE,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,OAAO,CAAC,IAAI,CAAC,sDAAsD,IAAI,CAAC,SAAS,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YAC5G,CAAC;QACL,CAAC;IACL,CAAC;CACJ"}

package/dist/solver/mempool/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Mempool Module — Barrel Export
+ */
+export * from "./mempool-client";
+export * from "./intent-filter";
+export * from "./mempool-monitor";
+export * from "./solution-submitter";
+//# sourceMappingURL=index.d.ts.map

package/dist/solver/mempool/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/solver/mempool/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC"}

package/dist/solver/mempool/index.js

@@ -0,0 +1,8 @@
+/**
+ * Mempool Module — Barrel Export
+ */
+export * from "./mempool-client";
+export * from "./intent-filter";
+export * from "./mempool-monitor";
+export * from "./solution-submitter";
+//# sourceMappingURL=index.js.map

package/dist/solver/mempool/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/solver/mempool/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC"}

package/dist/solver/mempool/intent-filter.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Intent Filter — Phase G
+ *
+ * Decides whether an incoming intent from the mempool should be
+ * attempted by this agent. Filters are applied in order from
+ * cheapest to most expensive to minimize wasted work.
+ *
+ * Filter pipeline:
+ *   1. Deduplication    — Skip if intentId already seen
+ *   2. Type check       — Only "bridge" intents
+ *   3. Agent capability — agent.canSolve(intent)
+ *
+ * Used by: MempoolMonitor
+ */
+import type { SolverIntent } from "../types/intent";
+import type { LiquidityAgent } from "../agent/liquidity-agent";
+export declare class IntentFilter {
+    private readonly agent;
+    /** Track seen intentIds to prevent duplicate processing */
+    private seen;
+    constructor(agent: LiquidityAgent);
+    /**
+     * Determine whether this agent should attempt solving the intent.
+     *
+     * Returns false immediately at the first failing check.
+     *
+     * @param intent - Incoming SolverIntent from the mempool
+     * @returns true if the agent should attempt solving, false otherwise
+     */
+    shouldSolve(intent: SolverIntent): boolean;
+    /**
+     * Mark an intent as "already solved" so it won't be attempted again
+     * if it re-appears in the mempool (e.g., rebroadcast).
+     *
+     * @param intentId - The intentId to mark as solved
+     */
+    markSolved(intentId: string): void;
+    /**
+     * Get count of unique intentIds seen so far.
+     * Useful for monitoring / debugging.
+     */
+    getSeenCount(): number;
+    /**
+     * Clear the deduplication cache.
+     * Use with caution — only if you intentionally want to reprocess intents.
+     */
+    clearCache(): void;
+}
+//# sourceMappingURL=intent-filter.d.ts.map

package/dist/solver/mempool/intent-filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent-filter.d.ts","sourceRoot":"","sources":["../../../src/solver/mempool/intent-filter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAE/D,qBAAa,YAAY;IAIT,OAAO,CAAC,QAAQ,CAAC,KAAK;IAHlC,2DAA2D;IAC3D,OAAO,CAAC,IAAI,CAA0B;gBAET,KAAK,EAAE,cAAc;IAMlD;;;;;;;OAOG;IACH,WAAW,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO;IAuB1C;;;;;OAKG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAIlC;;;OAGG;IACH,YAAY,IAAI,MAAM;IAItB;;;OAGG;IACH,UAAU,IAAI,IAAI;CAGrB"}

package/dist/solver/mempool/intent-filter.js

@@ -0,0 +1,75 @@
+/**
+ * Intent Filter — Phase G
+ *
+ * Decides whether an incoming intent from the mempool should be
+ * attempted by this agent. Filters are applied in order from
+ * cheapest to most expensive to minimize wasted work.
+ *
+ * Filter pipeline:
+ *   1. Deduplication    — Skip if intentId already seen
+ *   2. Type check       — Only "bridge" intents
+ *   3. Agent capability — agent.canSolve(intent)
+ *
+ * Used by: MempoolMonitor
+ */
+export class IntentFilter {
+    agent;
+    /** Track seen intentIds to prevent duplicate processing */
+    seen = new Set();
+    constructor(agent) {
+        this.agent = agent;
+    }
+    // ─────────────────────────────────────────
+    // Public API
+    // ─────────────────────────────────────────
+    /**
+     * Determine whether this agent should attempt solving the intent.
+     *
+     * Returns false immediately at the first failing check.
+     *
+     * @param intent - Incoming SolverIntent from the mempool
+     * @returns true if the agent should attempt solving, false otherwise
+     */
+    shouldSolve(intent) {
+        // 1. Deduplication — skip already-seen intents
+        if (this.seen.has(intent.intentId)) {
+            return false;
+        }
+        // Mark as seen immediately to prevent concurrent processors
+        // from racing on the same intent
+        this.seen.add(intent.intentId);
+        // 2. Type check — only handle bridge intents
+        if (intent.parsedIntent.intentType !== "bridge") {
+            return false;
+        }
+        // 3. Agent capability check — chains, tokens, expiry, inventory
+        if (!this.agent.canSolve(intent)) {
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Mark an intent as "already solved" so it won't be attempted again
+     * if it re-appears in the mempool (e.g., rebroadcast).
+     *
+     * @param intentId - The intentId to mark as solved
+     */
+    markSolved(intentId) {
+        this.seen.add(intentId);
+    }
+    /**
+     * Get count of unique intentIds seen so far.
+     * Useful for monitoring / debugging.
+     */
+    getSeenCount() {
+        return this.seen.size;
+    }
+    /**
+     * Clear the deduplication cache.
+     * Use with caution — only if you intentionally want to reprocess intents.
+     */
+    clearCache() {
+        this.seen.clear();
+    }
+}
+//# sourceMappingURL=intent-filter.js.map

package/dist/solver/mempool/intent-filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent-filter.js","sourceRoot":"","sources":["../../../src/solver/mempool/intent-filter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,MAAM,OAAO,YAAY;IAIQ;IAH7B,2DAA2D;IACnD,IAAI,GAAgB,IAAI,GAAG,EAAE,CAAC;IAEtC,YAA6B,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAI,CAAC;IAEvD,4CAA4C;IAC5C,aAAa;IACb,4CAA4C;IAE5C;;;;;;;OAOG;IACH,WAAW,CAAC,MAAoB;QAC5B,+CAA+C;QAC/C,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjC,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,4DAA4D;QAC5D,iCAAiC;QACjC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAE/B,6CAA6C;QAC7C,IAAI,MAAM,CAAC,YAAY,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;YAC9C,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,gEAAgE;QAChE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,QAAgB;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,YAAY;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,UAAU;QACN,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;CACJ"}

package/dist/solver/mempool/mempool-client.d.ts

@@ -0,0 +1,105 @@
+/**
+ * Mempool Client — Phase G
+ *
+ * WebSocket transport layer for connecting to the Intent Mempool server.
+ * Emits typed events when intents arrive or are solved by other solvers.
+ *
+ * Events:
+ *   "connected"      — WebSocket opened successfully
+ *   "disconnected"   — WebSocket closed (code, reason)
+ *   "new_intent"     — New SolverIntent broadcast from mempool
+ *   "intent_solved"  — Another solver claimed an intent first
+ *   "error"          — Transport-level error
+ *
+ * Design: Custom lightweight EventEmitter. No external dependencies.
+ * WebSocket is injected (or auto-created) so tests can mock it cleanly.
+ *
+ * Used by: MempoolMonitor
+ */
+import type { SolverIntent } from "../types/intent";
+/** Events emitted by MempoolClient */
+export type MempoolEvent = "connected" | "disconnected" | "new_intent" | "intent_solved" | "error";
+/** Payload for "intent_solved" event */
+export interface IntentSolvedPayload {
+    intentId: string;
+    solver: string;
+}
+/** Payload for "disconnected" event */
+export interface DisconnectedPayload {
+    code: number;
+    reason: string;
+}
+/** Union of all event payloads */
+export type MempoolEventPayload = SolverIntent | IntentSolvedPayload | DisconnectedPayload | Error | undefined;
+/** Callback shape for each event */
+export type EventCallback = (payload: any) => void;
+/** Minimal interface for WebSocket — mocked in tests */
+export interface IWebSocket {
+    send(data: string): void;
+    close(): void;
+    onopen?: (() => void) | null;
+    onclose?: ((event: {
+        code: number;
+        reason: string;
+    }) => void) | null;
+    onmessage?: ((event: {
+        data: string;
+    }) => void) | null;
+    onerror?: ((event: {
+        message?: string;
+    }) => void) | null;
+}
+/** Factory for creating WebSocket instances */
+export type WebSocketFactory = (url: string) => IWebSocket;
+export declare class MempoolClient {
+    private ws;
+    private listeners;
+    private connected;
+    private wsFactory;
+    constructor(wsFactory?: WebSocketFactory);
+    /**
+     * Connect to the mempool WebSocket server.
+     *
+     * Immediately attaches message handlers. Emits "connected"
+     * when the socket opens, or "error" if it fails.
+     *
+     * @param url - WebSocket URL (e.g. "ws://mempool.example.com/ws")
+     */
+    connect(url: string): void;
+    /**
+     * Gracefully close the WebSocket connection.
+     */
+    disconnect(): void;
+    /** Whether the client is currently connected */
+    isConnected(): boolean;
+    /**
+     * Send a solution to the mempool server.
+     *
+     * Payload format: { type: "submit_solution", intentId, txHash, solver, profit }
+     */
+    submitSolution(intentId: string, txHash?: string, solverAddress?: string, profit?: string): void;
+    /**
+     * Register a listener for a mempool event.
+     *
+     * @param event - Event name
+     * @param cb    - Callback to invoke with the event payload
+     */
+    on(event: MempoolEvent, cb: EventCallback): void;
+    /**
+     * Unregister a previously registered listener.
+     *
+     * @param event - Event name
+     * @param cb    - The exact callback reference to remove
+     */
+    off(event: MempoolEvent, cb: EventCallback): void;
+    /**
+     * Remove ALL listeners for all events.
+     * Called during disconnect / cleanup.
+     */
+    removeAllListeners(): void;
+    /** Dispatch incoming server message to the right event */
+    private handleMessage;
+    /** Emit an event to all registered listeners */
+    private emit;
+}
+//# sourceMappingURL=mempool-client.d.ts.map

package/dist/solver/mempool/mempool-client.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mempool-client.d.ts","sourceRoot":"","sources":["../../../src/solver/mempool/mempool-client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAMpD,sCAAsC;AACtC,MAAM,MAAM,YAAY,GAClB,WAAW,GACX,cAAc,GACd,YAAY,GACZ,eAAe,GACf,OAAO,CAAC;AAEd,wCAAwC;AACxC,MAAM,WAAW,mBAAmB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAClB;AAED,uCAAuC;AACvC,MAAM,WAAW,mBAAmB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAClB;AAED,kCAAkC;AAClC,MAAM,MAAM,mBAAmB,GACzB,YAAY,GACZ,mBAAmB,GACnB,mBAAmB,GACnB,KAAK,GACL,SAAS,CAAC;AAEhB,oCAAoC;AAEpC,MAAM,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,GAAG,KAAK,IAAI,CAAC;AAEnD,wDAAwD;AACxD,MAAM,WAAW,UAAU;IACvB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,IAAI,IAAI,CAAC;IACd,MAAM,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC;IAC7B,OAAO,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;IACrE,SAAS,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;IACvD,OAAO,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;CAC5D;AAED,+CAA+C;AAC/C,MAAM,MAAM,gBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK,UAAU,CAAC;AAM3D,qBAAa,aAAa;IACtB,OAAO,CAAC,EAAE,CAA2B;IACrC,OAAO,CAAC,SAAS,CAAoD;IACrE,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAmB;gBAExB,SAAS,CAAC,EAAE,gBAAgB;IASxC;;;;;;;OAOG;IACH,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IA+B1B;;OAEG;IACH,UAAU,IAAI,IAAI;IAQlB,gDAAgD;IAChD,WAAW,IAAI,OAAO;IAItB;;;;OAIG;IACH,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI;IAkBhG;;;;;OAKG;IACH,EAAE,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,GAAG,IAAI;IAOhD;;;;;OAKG;IACH,GAAG,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,GAAG,IAAI;IAIjD;;;OAGG;IACH,kBAAkB,IAAI,IAAI;IAQ1B,0DAA0D;IAC1D,OAAO,CAAC,aAAa;IAcrB,gDAAgD;IAChD,OAAO,CAAC,IAAI;CAYf"}

package/dist/solver/mempool/mempool-client.js

@@ -0,0 +1,161 @@
+/**
+ * Mempool Client — Phase G
+ *
+ * WebSocket transport layer for connecting to the Intent Mempool server.
+ * Emits typed events when intents arrive or are solved by other solvers.
+ *
+ * Events:
+ *   "connected"      — WebSocket opened successfully
+ *   "disconnected"   — WebSocket closed (code, reason)
+ *   "new_intent"     — New SolverIntent broadcast from mempool
+ *   "intent_solved"  — Another solver claimed an intent first
+ *   "error"          — Transport-level error
+ *
+ * Design: Custom lightweight EventEmitter. No external dependencies.
+ * WebSocket is injected (or auto-created) so tests can mock it cleanly.
+ *
+ * Used by: MempoolMonitor
+ */
+// ─────────────────────────────────────────────
+// MempoolClient
+// ─────────────────────────────────────────────
+export class MempoolClient {
+    ws = null;
+    listeners = new Map();
+    connected = false;
+    wsFactory;
+    constructor(wsFactory) {
+        // Default factory uses global WebSocket (Node.js 22+ / browser)
+        this.wsFactory = wsFactory ?? ((url) => new WebSocket(url));
+    }
+    // ─────────────────────────────────────────
+    // Connection
+    // ─────────────────────────────────────────
+    /**
+     * Connect to the mempool WebSocket server.
+     *
+     * Immediately attaches message handlers. Emits "connected"
+     * when the socket opens, or "error" if it fails.
+     *
+     * @param url - WebSocket URL (e.g. "ws://mempool.example.com/ws")
+     */
+    connect(url) {
+        if (this.ws) {
+            this.disconnect();
+        }
+        this.ws = this.wsFactory(url);
+        this.ws.onopen = () => {
+            this.connected = true;
+            this.emit("connected", undefined);
+        };
+        this.ws.onclose = (event) => {
+            this.connected = false;
+            this.emit("disconnected", { code: event.code, reason: event.reason });
+        };
+        this.ws.onmessage = (event) => {
+            try {
+                const msg = JSON.parse(event.data);
+                this.handleMessage(msg);
+            }
+            catch {
+                this.emit("error", new Error(`Failed to parse mempool message: ${event.data}`));
+            }
+        };
+        this.ws.onerror = (event) => {
+            this.emit("error", new Error(event.message ?? "WebSocket error"));
+        };
+    }
+    /**
+     * Gracefully close the WebSocket connection.
+     */
+    disconnect() {
+        if (this.ws) {
+            this.ws.close();
+            this.ws = null;
+        }
+        this.connected = false;
+    }
+    /** Whether the client is currently connected */
+    isConnected() {
+        return this.connected;
+    }
+    /**
+     * Send a solution to the mempool server.
+     *
+     * Payload format: { type: "submit_solution", intentId, txHash, solver, profit }
+     */
+    submitSolution(intentId, txHash, solverAddress, profit) {
+        if (!this.ws || !this.connected) {
+            console.warn("[MempoolClient] Cannot submit: not connected");
+            return;
+        }
+        const message = JSON.stringify({
+            type: "submit_solution",
+            payload: { intentId, txHash, solver: solverAddress, profit },
+        });
+        this.ws.send(message);
+    }
+    // ─────────────────────────────────────────
+    // Event Emitter
+    // ─────────────────────────────────────────
+    /**
+     * Register a listener for a mempool event.
+     *
+     * @param event - Event name
+     * @param cb    - Callback to invoke with the event payload
+     */
+    on(event, cb) {
+        if (!this.listeners.has(event)) {
+            this.listeners.set(event, new Set());
+        }
+        this.listeners.get(event).add(cb);
+    }
+    /**
+     * Unregister a previously registered listener.
+     *
+     * @param event - Event name
+     * @param cb    - The exact callback reference to remove
+     */
+    off(event, cb) {
+        this.listeners.get(event)?.delete(cb);
+    }
+    /**
+     * Remove ALL listeners for all events.
+     * Called during disconnect / cleanup.
+     */
+    removeAllListeners() {
+        this.listeners.clear();
+    }
+    // ─────────────────────────────────────────
+    // Private
+    // ─────────────────────────────────────────
+    /** Dispatch incoming server message to the right event */
+    handleMessage(msg) {
+        switch (msg.type) {
+            case "new_intent":
+                this.emit("new_intent", msg.payload);
+                break;
+            case "intent_solved":
+                this.emit("intent_solved", msg.payload);
+                break;
+            default:
+                // Unknown message type — ignore silently
+                break;
+        }
+    }
+    /** Emit an event to all registered listeners */
+    emit(event, payload) {
+        const callbacks = this.listeners.get(event);
+        if (!callbacks)
+            return;
+        for (const cb of callbacks) {
+            try {
+                cb(payload);
+            }
+            catch (err) {
+                console.error(`[MempoolClient] Error in "${event}" listener:`, err);
+            }
+        }
+    }
+}
+//# sourceMappingURL=mempool-client.js.map

package/dist/solver/mempool/mempool-client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mempool-client.js","sourceRoot":"","sources":["../../../src/solver/mempool/mempool-client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAqDH,gDAAgD;AAChD,gBAAgB;AAChB,gDAAgD;AAEhD,MAAM,OAAO,aAAa;IACd,EAAE,GAAsB,IAAI,CAAC;IAC7B,SAAS,GAA0C,IAAI,GAAG,EAAE,CAAC;IAC7D,SAAS,GAAG,KAAK,CAAC;IAClB,SAAS,CAAmB;IAEpC,YAAY,SAA4B;QACpC,gEAAgE;QAChE,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI,CAAC,CAAC,GAAW,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,GAAG,CAA0B,CAAC,CAAC;IACjG,CAAC;IAED,4CAA4C;IAC5C,aAAa;IACb,4CAA4C;IAE5C;;;;;;;OAOG;IACH,OAAO,CAAC,GAAW;QACf,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACV,IAAI,CAAC,UAAU,EAAE,CAAC;QACtB,CAAC;QAED,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAE9B,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,GAAG,EAAE;YAClB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QACtC,CAAC,CAAC;QAEF,IAAI,CAAC,EAAE,CAAC,OAAO,GAAG,CAAC,KAAK,EAAE,EAAE;YACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1E,CAAC,CAAC;QAEF,IAAI,CAAC,EAAE,CAAC,SAAS,GAAG,CAAC,KAAK,EAAE,EAAE;YAC1B,IAAI,CAAC;gBACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAuC,CAAC;gBACzE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACL,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,KAAK,CAAC,oCAAoC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACpF,CAAC;QACL,CAAC,CAAC;QAEF,IAAI,CAAC,EAAE,CAAC,OAAO,GAAG,CAAC,KAAK,EAAE,EAAE;YACxB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,IAAI,iBAAiB,CAAC,CAAC,CAAC;QACtE,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,UAAU;QACN,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACV,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED,gDAAgD;IAChD,WAAW;QACP,OAAO,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,QAAgB,EAAE,MAAe,EAAE,aAAsB,EAAE,MAAe;QACrF,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;YAC7D,OAAO;QACX,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;YAC3B,IAAI,EAAE,iBAAiB;YACvB,OAAO,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE;SAC/D,CAAC,CAAC;QAEH,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,4CAA4C;IAC5C,gBAAgB;IAChB,4CAA4C;IAE5C;;;;;OAKG;IACH,EAAE,CAAC,KAAmB,EAAE,EAAiB;QACrC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvC,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,KAAmB,EAAE,EAAiB;QACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACH,kBAAkB;QACd,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED,4CAA4C;IAC5C,UAAU;IACV,4CAA4C;IAE5C,0DAA0D;IAClD,aAAa,CAAC,GAAuC;QACzD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,YAAY;gBACb,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,OAAuB,CAAC,CAAC;gBACrD,MAAM;YACV,KAAK,eAAe;gBAChB,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,GAAG,CAAC,OAA8B,CAAC,CAAC;gBAC/D,MAAM;YACV;gBACI,yCAAyC;gBACzC,MAAM;QACd,CAAC;IACL,CAAC;IAED,gDAAgD;IACxC,IAAI,CAAC,KAAmB,EAAE,OAA4B;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,SAAS;YAAE,OAAO;QAEvB,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC;gBACD,EAAE,CAAC,OAAO,CAAC,CAAC;YAChB,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACX,OAAO,CAAC,KAAK,CAAC,6BAA6B,KAAK,aAAa,EAAE,GAAG,CAAC,CAAC;YACxE,CAAC;QACL,CAAC;IACL,CAAC;CACJ"}