@anywalletkit/protocol-swap2-router 0.0.0-stage → 0.2.1

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,71 @@
-# Temporary Holding Version
+# @anywalletkit/protocol-swap2-router
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The optional swap2 aggregator. Every provider module (`-lifi`, `-near-intents`, `-thorchain`,
+`-omniston`, `-cctp`, `-uniswap`, `-balancer`, `-wrap`) works on its own; install this package when
+you want one protocol that auctions a route across the providers **you** pass in. It bundles none.
+
+## Three ways to offer cross-chain swaps
+
+**1. One protocol, no aggregator.** Install a single provider and use its own protocol class.
+
+```ts
+import {LifiSwap2Protocol} from "@anywalletkit/protocol-swap2-lifi";
+const swap2 = new LifiSwap2Protocol(account, {fromChain: "eip155:1"});
+```
+
+**2. Aggregator picks for the user.** Quotes every provider in parallel, validates each quote the
+same way and executes the winner.
+
+```ts
+import {RouterSwap2Protocol, usdValue} from "@anywalletkit/protocol-swap2-router";
+
+const swap2 = new RouterSwap2Protocol(account, {
+  fromChain: "eip155:1",
+  providers: [lifiProvider({}), nearIntentsProvider({}), cctpProvider({rpcUrls})],
+  valueUsd: usdValue(prices),   // optional: rank on net USD (see below)
+  prefer: "best",               // or "fastest"
+});
+await swap2.swap2({fromToken: "USDC", toToken, toChain: "eip155:8453", fromTokenAmount, minAmountOut});
+```
+
+**3. Aggregator with a route picker.** List every route with the best and the fastest tagged, let
+the user choose, then execute exactly that provider.
+
+```ts
+const routes = await swap2.quoteSwap2Routes(options, {
+  // Called each time another provider answers: show the first price at once,
+  // a "searching…" hint while `pending` is non-empty.
+  onUpdate: (routes, pending) => render(routes, pending),
+});
+// routes[i] = {provider, quote, netValueUsd, relativeValue, tags: ["best"] | ["fastest"] | …}
+await swap2.using(picked.provider).swap2({...options, minAmountOut: picked.quote.toTokenAmountMin});
+```
+
+The same is available one level down on `CrossChainRouter#getQuotes(params, {onUpdate})`.
+
+## How the winner is chosen
+
+1. **Value.** With `valueUsd` (e.g. `usdValue(prices, {gasUsd})`) each quote is worth its guaranteed
+   output in USD minus what the route charges on top: a native bridge fee and, when you can say it,
+   the source gas. Without prices for every quote the auction compares guaranteed outputs.
+2. **Price first.** Quotes within `tieBand` (default 0.2%) of the best value are the same price.
+3. **Speed and reliability inside the tie.** Among equal prices the faster, then the more reliable,
+   route wins (`weights`, default `price:0.6,speed:0.3,reliability:0.1`). A sliver of extra output no
+   longer beats a route that lands twenty times faster; a real price gap still wins.
+
+`fastest` is always the lowest ETA. Every quote passes the engine's checks before it is ranked, and
+the executed route is re-validated against its sealed quote before anything is signed.
+
+## Activity
+
+The router executes through whichever provider wins, so it has no transactions
+of its own: `describeActivity(tx, ctx)` asks every installed provider in order
+and returns the first description (null when none claims the transaction, or
+when the router holds no providers). Each provider package documents what it
+recognizes (`@anywalletkit/protocol-swap2-lifi` → LI.FI Diamond calls,
+`-thorchain` → router `depositWithExpiry` / `transferOut`, `-cctp` → burn and
+claim, `-uniswap` / `-balancer` / `-wrap` → the DEX router / Vault / WETH9 calls,
+`-omniston` → STON.fi router and Omniston escrow on TON, `-near-intents` → the
+`intents.near` legs). The conformance fixture here is a public WETH9 deposit
+recognized by an in-test provider, proving the delegation; the negative is a
+LI.FI swap no installed provider claims.

package/dist/chunk-6WXEWTIF.js

@@ -0,0 +1,296 @@
+// src/router.ts
+import { validQuote } from "@anywalletkit/protocol-swap2-core/validate";
+var DEFAULT_WEIGHTS = { price: 0.6, speed: 0.3, reliability: 0.1 };
+var DEFAULT_TIE_BAND = 2e-3;
+var QUOTE_TIMEOUT_MS = 8e3;
+var SOLO_QUOTE_TIMEOUT_MS = 25e3;
+function parseWeights(spec) {
+  if (!spec) return DEFAULT_WEIGHTS;
+  const w = { ...DEFAULT_WEIGHTS };
+  for (const part of spec.split(",")) {
+    const [k, v] = part.split(":");
+    const n = Number(v);
+    if ((k === "price" || k === "speed" || k === "reliability") && Number.isFinite(n)) {
+      w[k] = Math.max(0, n);
+    }
+  }
+  return w;
+}
+async function withTimeout(p, ms) {
+  return new Promise((resolve, reject) => {
+    const timer = setTimeout(() => reject(new Error(`quote timed out after ${ms}ms`)), ms);
+    p.then(resolve, reject).finally(() => clearTimeout(timer));
+  });
+}
+var CrossChainRouter = class _CrossChainRouter {
+  providers;
+  /** Why the venues of the LAST getBestQuote call sat out — for error surfaces. */
+  _lastRejections = [];
+  /** Why providers sat out the last auction, one line each. */
+  get lastRejections() {
+    return this._lastRejections;
+  }
+  weights;
+  valueUsd;
+  tieBand;
+  options;
+  constructor(providers, options) {
+    const opts = typeof options === "string" ? { weights: options } : { ...options ?? {} };
+    if (opts.tieBand !== void 0 && !(Number.isFinite(opts.tieBand) && opts.tieBand >= 0 && opts.tieBand < 1)) {
+      throw new Error("cross-chain router: tieBand must be a fraction in [0, 1)");
+    }
+    const names = /* @__PURE__ */ new Set();
+    for (const provider of providers) {
+      if (typeof provider.name !== "string" || !/^[A-Za-z0-9_-]+$/.test(provider.name) || names.has(provider.name)) {
+        throw new Error(`cross-chain router: invalid or duplicate provider name '${String(provider.name)}'`);
+      }
+      names.add(provider.name);
+    }
+    this.providers = providers.map((provider) => ({
+      name: provider.name,
+      enabled: provider.enabled.bind(provider),
+      supportsRoute: provider.supportsRoute.bind(provider),
+      getQuote: provider.getQuote.bind(provider),
+      buildDeposit: provider.buildDeposit.bind(provider),
+      trackIntent: provider.trackIntent.bind(provider),
+      ...provider.preflightDeposit ? { preflightDeposit: provider.preflightDeposit.bind(provider) } : {},
+      ...provider.notifyDeposit ? { notifyDeposit: provider.notifyDeposit.bind(provider) } : {},
+      ...provider.registerSignedOrder ? { registerSignedOrder: provider.registerSignedOrder.bind(provider) } : {},
+      // Two-phase routes (CCTP): the destination claim. Missing here, the engine
+      // and the server both reported "provider 'cctp' has no claim step" (2026-10-13).
+      ...provider.buildClaim ? { buildClaim: provider.buildClaim.bind(provider) } : {},
+      ...provider.close ? { close: provider.close.bind(provider) } : {},
+      ...provider.supportsChain ? { supportsChain: provider.supportsChain.bind(provider) } : {},
+      ...provider.supportsChainPair ? { supportsChainPair: provider.supportsChainPair.bind(provider) } : {},
+      ...provider.describeActivity ? { describeActivity: provider.describeActivity.bind(provider) } : {},
+      ...provider.supportsSameChain !== void 0 ? { supportsSameChain: provider.supportsSameChain } : {}
+    }));
+    this.weights = parseWeights(opts.weights);
+    this.valueUsd = opts.valueUsd;
+    this.tieBand = opts.tieBand ?? DEFAULT_TIE_BAND;
+    this.options = opts;
+  }
+  /** The same auction restricted to one provider — to execute the route a user picked. */
+  only(name) {
+    const provider = this.getProvider(name);
+    if (!provider) throw new Error(`cross-chain router: provider '${name}' is not registered`);
+    return new _CrossChainRouter([provider], this.options);
+  }
+  /**
+   * Activity recognition across the installed providers: the first one that
+   * claims the transaction describes it. Null when none does (or none is held).
+   */
+  describeActivity(tx, ctx) {
+    for (const provider of this.providers) {
+      const item = provider.describeActivity?.(tx, ctx);
+      if (item) return item;
+    }
+    return null;
+  }
+  /** A provider by name. */
+  getProvider(name) {
+    return this.providers.find((p) => p.name === name);
+  }
+  /** True when a provider of that name is installed. */
+  hasProvider(name) {
+    return this.providers.some((p) => p.name === name);
+  }
+  /** True when that provider is installed and enabled. */
+  hasEnabledProvider(name) {
+    return this.providers.some((p) => {
+      try {
+        return p.name === name && p.enabled();
+      } catch {
+        return false;
+      }
+    });
+  }
+  /** True when any enabled provider declares the chain. */
+  supportsChain(caip2) {
+    return this.providers.some((p) => {
+      try {
+        return p.enabled() && !!p.supportsChain?.(caip2);
+      } catch {
+        return false;
+      }
+    });
+  }
+  /** True when any enabled provider declares the chain pair. */
+  supportsChainPair(fromChain, toChain) {
+    return this.providers.some((p) => {
+      try {
+        return p.enabled() && (p.supportsChainPair?.(fromChain, toChain) ?? false);
+      } catch {
+        return false;
+      }
+    });
+  }
+  /**
+   * The auction's pick: the best price (net of native fees and gas when
+   * `valueUsd` is set; faster, then more reliable, among equal prices), or
+   * the fastest route with `prefer: "fastest"`.
+   */
+  async getBestQuote(params, options) {
+    const set = await this.getQuotes(params, options);
+    if (!set) return null;
+    const pick = options?.prefer === "fastest" ? set.fastest : set.best;
+    const { netValueUsd: _n, relativeValue: _r, tags: _t, ...quote } = pick;
+    return {
+      ...quote,
+      routeScore: {
+        score: pick.relativeValue,
+        weights: this.weights,
+        candidates: set.quotes.map((q) => ({
+          provider: q.provider,
+          sourceAmount: q.sourceAmount,
+          etaSeconds: q.etaSeconds,
+          score: q.relativeValue,
+          minDestAmount: q.minDestAmount,
+          netValueUsd: q.netValueUsd
+        }))
+      }
+    };
+  }
+  /**
+   * Every validated route, ranked — for a route picker that shows the best and
+   * the fastest and lets the user choose. Providers run in parallel; with
+   * `onUpdate` each one that answers re-publishes the ranked set at once (the
+   * first price shows in the time of the fastest venue, not the slowest).
+   */
+  async getQuotes(params, options) {
+    const rejections = [];
+    this._lastRejections = rejections;
+    const snapshot = Object.freeze({ ...params });
+    const from = Object.freeze({ chain: snapshot.sourceChain, token: snapshot.sourceToken });
+    const to = Object.freeze({ chain: snapshot.destChain, token: snapshot.destToken });
+    let eligible = this.providers.filter((p) => {
+      try {
+        return p.enabled() && p.supportsRoute(from, to);
+      } catch {
+        return false;
+      }
+    });
+    if (snapshot.sourceChain === snapshot.destChain) {
+      eligible = eligible.filter((p) => p.supportsSameChain === true);
+    }
+    if (eligible.length === 0) return null;
+    const timeoutMs = eligible.length === 1 ? SOLO_QUOTE_TIMEOUT_MS : QUOTE_TIMEOUT_MS;
+    const refusals = [];
+    const accepted = [];
+    const pending = new Set(eligible.map((p) => p.name));
+    const publish = () => {
+      if (!options?.onUpdate || accepted.length === 0) return;
+      const set = this.rank(accepted, snapshot, [...pending], rejections);
+      try {
+        options.onUpdate(set);
+      } catch {
+      }
+    };
+    await Promise.all(eligible.map(async (p, i) => {
+      const controller = new AbortController();
+      const own = Object.freeze({ ...snapshot, onRefusal: (reason) => {
+        refusals[i] ??= reason.startsWith(`${p.name}:`) ? reason : `${p.name}: ${reason}`;
+        try {
+          snapshot.onRefusal?.(reason);
+        } catch {
+        }
+      } });
+      let q = null;
+      try {
+        q = await withTimeout(p.getQuote(own, controller.signal), timeoutMs);
+        if (!q) {
+          rejections.push(refusals[i] ?? `${p.name}: returned no quote`);
+        } else if (!validQuote(q, snapshot, p.name)) {
+          const reason = `${p.name}: rejected by validation (minDest=${q.minDestAmount} vs floor=${snapshot.minAmountOut ?? "-"}, validUntil=${q.validUntilMs}, now=${Date.now()})`;
+          rejections.push(reason);
+          console.warn(`swap2-router: ${reason}`);
+          q = null;
+        } else if (options?.requireImmediateExecution && !(q.depositAddress.length > 0 || q.txRequest !== void 0)) {
+          q = null;
+        }
+      } catch (err) {
+        const reason = `${p.name}: ${err instanceof Error ? err.message.slice(0, 160) : String(err).slice(0, 160)}`;
+        rejections.push(reason);
+        console.warn(`swap2-router: quote failed \u2014 ${reason}`);
+        q = null;
+      } finally {
+        controller.abort();
+      }
+      pending.delete(p.name);
+      if (q) accepted.push({ ...q, provider: p.name });
+      publish();
+    }));
+    if (accepted.length === 0) return null;
+    return this.rank(accepted, snapshot, [], rejections);
+  }
+  /** Status from the named provider; `failed` when it is not installed. */
+  async trackIntent(providerName, ref) {
+    const provider = this.getProvider(providerName);
+    if (!provider) return { state: "failed" };
+    return provider.trackIntent(ref);
+  }
+  /** Forward a source-broadcast notification to the intent's provider. */
+  async notifyDeposit(providerName, intentId, txHash) {
+    await this.getProvider(providerName)?.notifyDeposit?.(intentId, txHash);
+  }
+  /** Release every provider's resources. */
+  close() {
+    for (const provider of this.providers) provider.close?.();
+  }
+  /**
+   * Price first: each quote's value is its net USD (`valueUsd`) — or, when any
+   * quote cannot be priced, its guaranteed output — against the best one.
+   * Quotes within `tieBand` of the best are the same price; among those the
+   * weights order speed and reliability. A $0.01 edge no longer beats a route
+   * that lands in seconds instead of twenty minutes, and a route that charges
+   * a native bridge fee on top no longer wins on its gross output.
+   */
+  rank(quotes, params, pending, rejections) {
+    const usd = this.valueUsd ? quotes.map((q) => {
+      try {
+        const v = this.valueUsd(q, params);
+        return typeof v === "number" && Number.isFinite(v) ? v : null;
+      } catch {
+        return null;
+      }
+    }) : quotes.map(() => null);
+    const priced = usd.every((v) => v !== null);
+    let relative;
+    if (priced) {
+      const values = usd;
+      const max = Math.max(...values);
+      relative = values.map((v) => max > 0 ? Math.max(0, v) / max : v >= max ? 1 : 0);
+    } else {
+      const outs = quotes.map((q) => BigInt(q.minDestAmount));
+      const max = outs.reduce((a, b) => b > a ? b : a);
+      relative = outs.map((o) => fraction(o, max));
+    }
+    const ranked = quotes.map((q, i) => ({
+      ...q,
+      netValueUsd: priced ? usd[i] : null,
+      relativeValue: relative[i],
+      tags: []
+    }));
+    const tier = ranked.filter((q) => q.relativeValue >= 1 - this.tieBand - 1e-12);
+    const etas = tier.map((q) => q.etaSeconds);
+    const minEta = Math.min(...etas);
+    const maxEta = Math.max(...etas);
+    const w = this.weights;
+    const tieScore = (q) => w.price * q.relativeValue + w.speed * (maxEta === minEta ? 1 : (maxEta - q.etaSeconds) / (maxEta - minEta)) + w.reliability * q.reliability;
+    const best = tier.reduce((a, b) => tieScore(b) > tieScore(a) ? b : a);
+    const fastest = ranked.reduce((a, b) => b.etaSeconds < a.etaSeconds || b.etaSeconds === a.etaSeconds && b.relativeValue > a.relativeValue ? b : a);
+    best.tags.push("best");
+    fastest.tags.push("fastest");
+    ranked.sort((a, b) => a === best ? -1 : b === best ? 1 : b.relativeValue - a.relativeValue || a.etaSeconds - b.etaSeconds);
+    return { quotes: ranked, best, fastest, pending, rejections: [...rejections] };
+  }
+};
+function fraction(num, den) {
+  if (den === 0n) return 1;
+  return Number(num * 10000n / den) / 1e4;
+}
+
+export {
+  CrossChainRouter
+};
+//# sourceMappingURL=chunk-6WXEWTIF.js.map

package/dist/chunk-6WXEWTIF.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/router.ts"],"sourcesContent":["/**\n * The auction engine of the optional aggregator: routes a cross-chain delivery\n * over whichever providers the caller installed and passed in. Protocol\n * modules never need it — each one runs standalone on @anywalletkit/protocol-swap2-core.\n */\nimport type {\n  CrossChainProvider,\n  IntentRef,\n  IntentStatus,\n  Quote,\n  QuoteParams,\n  RoutedQuote,\n  ScoreWeights,\n} from \"@anywalletkit/protocol-swap2-core/types\";\nimport {validQuote} from \"@anywalletkit/protocol-swap2-core/validate\";\nimport type {ActivityItem, ChainTx, DescribeActivityContext} from \"@anywalletkit/core\";\n\nconst DEFAULT_WEIGHTS: ScoreWeights = {price: 0.6, speed: 0.3, reliability: 0.1};\n/** Quotes within 0.2% of the best net value count as the same price. */\nconst DEFAULT_TIE_BAND = 0.002;\n\nexport interface RouterOptions {\n  /**\n   * \"price:0.6,speed:0.3,reliability:0.1\" — how quotes inside the tie band\n   * (same price, within `tieBand`) are ordered. Price itself always leads.\n   */\n  weights?: string;\n  /**\n   * What a quote is worth to the user in USD: its guaranteed output minus what\n   * the route charges on top (a native bridge fee, the source gas). Return null\n   * when it cannot be priced — the auction then compares guaranteed outputs.\n   * `usdValue(prices)` builds one from a symbol → USD price map.\n   */\n  valueUsd?: (quote: Quote, params: QuoteParams) => number | null;\n  /** Fraction of the best net value inside which quotes tie on price (default 0.002). */\n  tieBand?: number;\n}\n\n/** A validated quote with its place in the auction. */\nexport interface RankedQuote extends Quote {\n  /** Net USD value (`valueUsd`), or null when the auction compared raw outputs. */\n  netValueUsd: number | null;\n  /** This quote's value against the best one, 0..1 (1 = the best price). */\n  relativeValue: number;\n  /** \"best\": the pick (best price; faster/more reliable among equal prices). \"fastest\": the lowest ETA. */\n  tags: (\"best\" | \"fastest\")[];\n}\n\n/** Every validated route for one request, ranked by value. */\nexport interface RouteSet {\n  /** Every validated route, best first. */\n  quotes: RankedQuote[];\n  /** Most delivered value (net of fees when priced) within the tie band. */\n  best: RankedQuote;\n  /** Lowest ETA. */\n  fastest: RankedQuote;\n  /** Providers still quoting (only non-empty in progressive `onUpdate` snapshots). */\n  pending: string[];\n  /** Why the venues that sat out did (same as `lastRejections`). */\n  rejections: string[];\n}\n// LI.FI's /quote routinely takes ~3.5s (it builds executable calldata) — 4s\n// raced it out of every round. All providers still run in parallel.\nconst QUOTE_TIMEOUT_MS = 8000;\n/** Pinned single-venue (execution) budget — see the comment at the call site. */\nconst SOLO_QUOTE_TIMEOUT_MS = 25_000;\n\nfunction parseWeights(spec?: string): ScoreWeights {\n  if (!spec) return DEFAULT_WEIGHTS;\n  const w = {...DEFAULT_WEIGHTS};\n  for (const part of spec.split(\",\")) {\n    const [k, v] = part.split(\":\");\n    const n = Number(v);\n    if ((k === \"price\" || k === \"speed\" || k === \"reliability\") && Number.isFinite(n)) {\n      w[k] = Math.max(0, n);\n    }\n  }\n  return w;\n}\n\nasync function withTimeout<T>(p: Promise<T>, ms: number): Promise<T | null> {\n  return new Promise((resolve, reject) => {\n    // Timeouts and failures must REJECT: the old `() => resolve(null)` arm\n    // swallowed every provider error — including forwarded venue refusals —\n    // into a null indistinguishable from \"no route\", which made execution\n    // failures undiagnosable from the surface (the '(c2)' hunt of 2026-08-31).\n    const timer = setTimeout(() => reject(new Error(`quote timed out after ${ms}ms`)), ms);\n    p.then(resolve, reject).finally(() => clearTimeout(timer));\n  });\n}\n\n/**\n * Routes a cross-chain delivery over pluggable providers: queries all that\n * support the route in parallel (with a timeout so a slow provider can't block),\n * normalizes their quotes, scores by configurable weights, and returns the best\n * tagged with `routeScore`. A failed/slow provider simply doesn't participate.\n */\nexport class CrossChainRouter {\n  private readonly providers: CrossChainProvider[];\n  /** Why the venues of the LAST getBestQuote call sat out — for error surfaces. */\n  private _lastRejections: string[] = [];\n  /** Why providers sat out the last auction, one line each. */\n  get lastRejections(): readonly string[] {\n    return this._lastRejections;\n  }\n  private readonly weights: ScoreWeights;\n  private readonly valueUsd: RouterOptions[\"valueUsd\"];\n  private readonly tieBand: number;\n  private readonly options: RouterOptions;\n\n  constructor(providers: CrossChainProvider[], options?: string | RouterOptions) {\n    const opts: RouterOptions = typeof options === \"string\" ? {weights: options} : {...(options ?? {})};\n    if (opts.tieBand !== undefined && !(Number.isFinite(opts.tieBand) && opts.tieBand >= 0 && opts.tieBand < 1)) {\n      throw new Error(\"cross-chain router: tieBand must be a fraction in [0, 1)\");\n    }\n    const names = new Set<string>();\n    for (const provider of providers) {\n      if (typeof provider.name !== \"string\" || !/^[A-Za-z0-9_-]+$/.test(provider.name) || names.has(provider.name)) {\n        throw new Error(`cross-chain router: invalid or duplicate provider name '${String(provider.name)}'`);\n      }\n      names.add(provider.name);\n    }\n    // Snapshot the dispatch surface. A caller mutating provider.name or method\n    // properties after construction must not redirect quote→build/status.\n    this.providers = providers.map((provider) => ({\n      name: provider.name,\n      enabled: provider.enabled.bind(provider),\n      supportsRoute: provider.supportsRoute.bind(provider),\n      getQuote: provider.getQuote.bind(provider),\n      buildDeposit: provider.buildDeposit.bind(provider),\n      trackIntent: provider.trackIntent.bind(provider),\n      ...(provider.preflightDeposit ? {preflightDeposit: provider.preflightDeposit.bind(provider)} : {}),\n      ...(provider.notifyDeposit ? {notifyDeposit: provider.notifyDeposit.bind(provider)} : {}),\n      ...(provider.registerSignedOrder ? {registerSignedOrder: provider.registerSignedOrder.bind(provider)} : {}),\n      // Two-phase routes (CCTP): the destination claim. Missing here, the engine\n      // and the server both reported \"provider 'cctp' has no claim step\" (2026-10-13).\n      ...(provider.buildClaim ? {buildClaim: provider.buildClaim.bind(provider)} : {}),\n      ...(provider.close ? {close: provider.close.bind(provider)} : {}),\n      ...(provider.supportsChain ? {supportsChain: provider.supportsChain.bind(provider)} : {}),\n      ...(provider.supportsChainPair ? {supportsChainPair: provider.supportsChainPair.bind(provider)} : {}),\n      ...(provider.describeActivity ? {describeActivity: provider.describeActivity.bind(provider)} : {}),\n      ...(provider.supportsSameChain !== undefined ? {supportsSameChain: provider.supportsSameChain} : {}),\n    }));\n    this.weights = parseWeights(opts.weights);\n    this.valueUsd = opts.valueUsd;\n    this.tieBand = opts.tieBand ?? DEFAULT_TIE_BAND;\n    this.options = opts;\n  }\n\n  /** The same auction restricted to one provider — to execute the route a user picked. */\n  only(name: string): CrossChainRouter {\n    const provider = this.getProvider(name);\n    if (!provider) throw new Error(`cross-chain router: provider '${name}' is not registered`);\n    return new CrossChainRouter([provider], this.options);\n  }\n\n  /**\n   * Activity recognition across the installed providers: the first one that\n   * claims the transaction describes it. Null when none does (or none is held).\n   */\n  describeActivity(tx: ChainTx, ctx: DescribeActivityContext): ActivityItem | null {\n    for (const provider of this.providers) {\n      const item = provider.describeActivity?.(tx, ctx);\n      if (item) return item;\n    }\n    return null;\n  }\n\n  /** A provider by name. */\n  getProvider(name: string): CrossChainProvider | undefined {\n    return this.providers.find((p) => p.name === name);\n  }\n\n  /** True when a provider of that name is installed. */\n  hasProvider(name: string): boolean {\n    return this.providers.some((p) => p.name === name);\n  }\n\n  /** True when that provider is installed and enabled. */\n  hasEnabledProvider(name: string): boolean {\n    return this.providers.some((p) => {\n      try { return p.name === name && p.enabled(); } catch { return false; }\n    });\n  }\n\n  /** True when any enabled provider declares the chain. */\n  supportsChain(caip2: string): boolean {\n    return this.providers.some((p) => {\n      try { return p.enabled() && !!p.supportsChain?.(caip2); } catch { return false; }\n    });\n  }\n\n  /** True when any enabled provider declares the chain pair. */\n  supportsChainPair(fromChain: string, toChain: string): boolean {\n    return this.providers.some((p) => {\n      try {\n        return p.enabled() && (p.supportsChainPair?.(fromChain, toChain) ?? false);\n      } catch { return false; }\n    });\n  }\n\n  /**\n   * The auction's pick: the best price (net of native fees and gas when\n   * `valueUsd` is set; faster, then more reliable, among equal prices), or\n   * the fastest route with `prefer: \"fastest\"`.\n   */\n  async getBestQuote(\n    params: QuoteParams,\n    options?: {requireImmediateExecution?: boolean; prefer?: \"best\" | \"fastest\"},\n  ): Promise<RoutedQuote | null> {\n    const set = await this.getQuotes(params, options);\n    if (!set) return null;\n    const pick = options?.prefer === \"fastest\" ? set.fastest : set.best;\n    const {netValueUsd: _n, relativeValue: _r, tags: _t, ...quote} = pick;\n    return {\n      ...quote,\n      routeScore: {\n        score: pick.relativeValue,\n        weights: this.weights,\n        candidates: set.quotes.map((q) => ({\n          provider: q.provider,\n          sourceAmount: q.sourceAmount,\n          etaSeconds: q.etaSeconds,\n          score: q.relativeValue,\n          minDestAmount: q.minDestAmount,\n          netValueUsd: q.netValueUsd,\n        })),\n      },\n    };\n  }\n\n  /**\n   * Every validated route, ranked — for a route picker that shows the best and\n   * the fastest and lets the user choose. Providers run in parallel; with\n   * `onUpdate` each one that answers re-publishes the ranked set at once (the\n   * first price shows in the time of the fastest venue, not the slowest).\n   */\n  async getQuotes(\n    params: QuoteParams,\n    options?: {requireImmediateExecution?: boolean; onUpdate?: (set: RouteSet) => void},\n  ): Promise<RouteSet | null> {\n    // A public engine caller — or one provider running in the same auction —\n    // must not be able to rewrite another provider's request while async quote\n    // work is in flight. QuoteParams is intentionally flat, so a frozen copy is\n    // a complete execution snapshot.\n    const rejections: string[] = [];\n    this._lastRejections = rejections;\n    const snapshot = Object.freeze({...params});\n    const from = Object.freeze({chain: snapshot.sourceChain, token: snapshot.sourceToken});\n    const to = Object.freeze({chain: snapshot.destChain, token: snapshot.destToken});\n    // Only enabled (validated) providers that can serve the route participate.\n    let eligible = this.providers.filter((p) => {\n      try { return p.enabled() && p.supportsRoute(from, to); } catch { return false; }\n    });\n    if (snapshot.sourceChain === snapshot.destChain) {\n      eligible = eligible.filter((p) => p.supportsSameChain === true);\n    }\n    if (eligible.length === 0) return null;\n\n    // The short timeout protects the AUCTION — one slow venue must not hold\n    // the others hostage. With a single eligible provider (a pinned execution\n    // re-quote) there is nobody to protect, and a live deposit-creating quote\n    // legitimately takes longer than a dry one (serverless hop + upstream\n    // retries) — starving it surfaced as a terminal \"no route\" on execution.\n    const timeoutMs = eligible.length === 1 ? SOLO_QUOTE_TIMEOUT_MS : QUOTE_TIMEOUT_MS;\n    // Each venue names its own refusal (per call, so concurrent quotes cannot race).\n    const refusals: (string | undefined)[] = [];\n    const accepted: Quote[] = [];\n    const pending = new Set(eligible.map((p) => p.name));\n    const publish = () => {\n      if (!options?.onUpdate || accepted.length === 0) return;\n      const set = this.rank(accepted, snapshot, [...pending], rejections);\n      try { options.onUpdate(set); } catch { /* an observer must not break the auction */ }\n    };\n    await Promise.all(eligible.map(async (p, i) => {\n      const controller = new AbortController();\n      const own = Object.freeze({...snapshot, onRefusal: (reason: string) => {\n        refusals[i] ??= reason.startsWith(`${p.name}:`) ? reason : `${p.name}: ${reason}`;\n        try { snapshot.onRefusal?.(reason); } catch { /* diagnostics only */ }\n      }});\n      let q: Quote | null = null;\n      try {\n        q = await withTimeout(p.getQuote(own, controller.signal), timeoutMs);\n        if (!q) {\n          // A provider RETURNING null (vs throwing) was the one silent path\n          // left — record it so the surfaced no-route error names the venue.\n          rejections.push(refusals[i] ?? `${p.name}: returned no quote`);\n        } else if (!validQuote(q, snapshot, p.name)) {\n          const reason = `${p.name}: rejected by validation (minDest=${q.minDestAmount} vs floor=${snapshot.minAmountOut ?? \"-\"}, validUntil=${q.validUntilMs}, now=${Date.now()})`;\n          rejections.push(reason);\n          console.warn(`swap2-router: ${reason}`);\n          q = null;\n        } else if (options?.requireImmediateExecution && !(q.depositAddress.length > 0 || q.txRequest !== undefined)) {\n          // Legacy deposit-address screens cannot execute order-based quotes that\n          // require a separate build/sign/register lifecycle.\n          q = null;\n        }\n      } catch (err) {\n        // A failed venue sitting out silently is indistinguishable from \"no\n        // route\" — record why (surfaced through lastRejections) and say it in\n        // the console (same posture as onModuleSkipped).\n        const reason = `${p.name}: ${err instanceof Error ? err.message.slice(0, 160) : String(err).slice(0, 160)}`;\n        rejections.push(reason);\n        console.warn(`swap2-router: quote failed — ${reason}`);\n        q = null;\n      } finally {\n        controller.abort();\n      }\n      pending.delete(p.name);\n      // Provider identity is an execution security boundary. Never trust the\n      // provider field returned by an untrusted adapter; bind it to its slot.\n      if (q) accepted.push({...q, provider: p.name});\n      publish();\n    }));\n    if (accepted.length === 0) return null;\n    return this.rank(accepted, snapshot, [], rejections);\n  }\n\n  /** Status from the named provider; `failed` when it is not installed. */\n  async trackIntent(providerName: string, ref: IntentRef): Promise<IntentStatus> {\n    const provider = this.getProvider(providerName);\n    if (!provider) return {state: \"failed\"};\n    return provider.trackIntent(ref);\n  }\n\n  /** Forward a source-broadcast notification to the intent's provider. */\n  async notifyDeposit(providerName: string, intentId: string, txHash: string): Promise<void> {\n    await this.getProvider(providerName)?.notifyDeposit?.(intentId, txHash);\n  }\n\n  /** Release every provider's resources. */\n  close(): void {\n    for (const provider of this.providers) provider.close?.();\n  }\n\n  /**\n   * Price first: each quote's value is its net USD (`valueUsd`) — or, when any\n   * quote cannot be priced, its guaranteed output — against the best one.\n   * Quotes within `tieBand` of the best are the same price; among those the\n   * weights order speed and reliability. A $0.01 edge no longer beats a route\n   * that lands in seconds instead of twenty minutes, and a route that charges\n   * a native bridge fee on top no longer wins on its gross output.\n   */\n  private rank(quotes: Quote[], params: QuoteParams, pending: string[], rejections: string[]): RouteSet {\n    const usd = this.valueUsd ? quotes.map((q) => {\n      try {\n        const v = this.valueUsd!(q, params);\n        return typeof v === \"number\" && Number.isFinite(v) ? v : null;\n      } catch { return null; }\n    }) : quotes.map(() => null);\n    const priced = usd.every((v) => v !== null);\n    let relative: number[];\n    if (priced) {\n      const values = usd as number[];\n      const max = Math.max(...values);\n      relative = values.map((v) => (max > 0 ? Math.max(0, v) / max : v >= max ? 1 : 0));\n    } else {\n      const outs = quotes.map((q) => BigInt(q.minDestAmount));\n      const max = outs.reduce((a, b) => (b > a ? b : a));\n      relative = outs.map((o) => fraction(o, max));\n    }\n    const ranked: RankedQuote[] = quotes.map((q, i) => ({\n      ...q,\n      netValueUsd: priced ? usd[i]! : null,\n      relativeValue: relative[i]!,\n      tags: [],\n    }));\n\n    const tier = ranked.filter((q) => q.relativeValue >= 1 - this.tieBand - 1e-12);\n    const etas = tier.map((q) => q.etaSeconds);\n    const minEta = Math.min(...etas);\n    const maxEta = Math.max(...etas);\n    const w = this.weights;\n    const tieScore = (q: RankedQuote) =>\n      w.price * q.relativeValue +\n      w.speed * (maxEta === minEta ? 1 : (maxEta - q.etaSeconds) / (maxEta - minEta)) +\n      w.reliability * q.reliability;\n    const best = tier.reduce((a, b) => (tieScore(b) > tieScore(a) ? b : a));\n    const fastest = ranked.reduce((a, b) =>\n      b.etaSeconds < a.etaSeconds || (b.etaSeconds === a.etaSeconds && b.relativeValue > a.relativeValue) ? b : a);\n    best.tags.push(\"best\");\n    fastest.tags.push(\"fastest\");\n\n    // The list reads top-down by value; the pick leads its price tier.\n    ranked.sort((a, b) => (a === best ? -1 : b === best ? 1 : b.relativeValue - a.relativeValue || a.etaSeconds - b.etaSeconds));\n    return {quotes: ranked, best, fastest, pending, rejections: [...rejections]};\n  }\n}\n\n/** Ratio of two non-negative bigints as a 0..1 number. */\nfunction fraction(num: bigint, den: bigint): number {\n  if (den === 0n) return 1;\n  // scale to keep precision, then to float\n  return Number((num * 10_000n) / den) / 10_000;\n}\n"],"mappings":";AAcA,SAAQ,kBAAiB;AAGzB,IAAM,kBAAgC,EAAC,OAAO,KAAK,OAAO,KAAK,aAAa,IAAG;AAE/E,IAAM,mBAAmB;AA4CzB,IAAM,mBAAmB;AAEzB,IAAM,wBAAwB;AAE9B,SAAS,aAAa,MAA6B;AACjD,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,IAAI,EAAC,GAAG,gBAAe;AAC7B,aAAW,QAAQ,KAAK,MAAM,GAAG,GAAG;AAClC,UAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,GAAG;AAC7B,UAAM,IAAI,OAAO,CAAC;AAClB,SAAK,MAAM,WAAW,MAAM,WAAW,MAAM,kBAAkB,OAAO,SAAS,CAAC,GAAG;AACjF,QAAE,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAe,YAAe,GAAe,IAA+B;AAC1E,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAKtC,UAAM,QAAQ,WAAW,MAAM,OAAO,IAAI,MAAM,yBAAyB,EAAE,IAAI,CAAC,GAAG,EAAE;AACrF,MAAE,KAAK,SAAS,MAAM,EAAE,QAAQ,MAAM,aAAa,KAAK,CAAC;AAAA,EAC3D,CAAC;AACH;AAQO,IAAM,mBAAN,MAAM,kBAAiB;AAAA,EACX;AAAA;AAAA,EAET,kBAA4B,CAAC;AAAA;AAAA,EAErC,IAAI,iBAAoC;AACtC,WAAO,KAAK;AAAA,EACd;AAAA,EACiB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEjB,YAAY,WAAiC,SAAkC;AAC7E,UAAM,OAAsB,OAAO,YAAY,WAAW,EAAC,SAAS,QAAO,IAAI,EAAC,GAAI,WAAW,CAAC,EAAE;AAClG,QAAI,KAAK,YAAY,UAAa,EAAE,OAAO,SAAS,KAAK,OAAO,KAAK,KAAK,WAAW,KAAK,KAAK,UAAU,IAAI;AAC3G,YAAM,IAAI,MAAM,0DAA0D;AAAA,IAC5E;AACA,UAAM,QAAQ,oBAAI,IAAY;AAC9B,eAAW,YAAY,WAAW;AAChC,UAAI,OAAO,SAAS,SAAS,YAAY,CAAC,mBAAmB,KAAK,SAAS,IAAI,KAAK,MAAM,IAAI,SAAS,IAAI,GAAG;AAC5G,cAAM,IAAI,MAAM,2DAA2D,OAAO,SAAS,IAAI,CAAC,GAAG;AAAA,MACrG;AACA,YAAM,IAAI,SAAS,IAAI;AAAA,IACzB;AAGA,SAAK,YAAY,UAAU,IAAI,CAAC,cAAc;AAAA,MAC5C,MAAM,SAAS;AAAA,MACf,SAAS,SAAS,QAAQ,KAAK,QAAQ;AAAA,MACvC,eAAe,SAAS,cAAc,KAAK,QAAQ;AAAA,MACnD,UAAU,SAAS,SAAS,KAAK,QAAQ;AAAA,MACzC,cAAc,SAAS,aAAa,KAAK,QAAQ;AAAA,MACjD,aAAa,SAAS,YAAY,KAAK,QAAQ;AAAA,MAC/C,GAAI,SAAS,mBAAmB,EAAC,kBAAkB,SAAS,iBAAiB,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA,MAChG,GAAI,SAAS,gBAAgB,EAAC,eAAe,SAAS,cAAc,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA,MACvF,GAAI,SAAS,sBAAsB,EAAC,qBAAqB,SAAS,oBAAoB,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA;AAAA;AAAA,MAGzG,GAAI,SAAS,aAAa,EAAC,YAAY,SAAS,WAAW,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA,MAC9E,GAAI,SAAS,QAAQ,EAAC,OAAO,SAAS,MAAM,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA,MAC/D,GAAI,SAAS,gBAAgB,EAAC,eAAe,SAAS,cAAc,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA,MACvF,GAAI,SAAS,oBAAoB,EAAC,mBAAmB,SAAS,kBAAkB,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA,MACnG,GAAI,SAAS,mBAAmB,EAAC,kBAAkB,SAAS,iBAAiB,KAAK,QAAQ,EAAC,IAAI,CAAC;AAAA,MAChG,GAAI,SAAS,sBAAsB,SAAY,EAAC,mBAAmB,SAAS,kBAAiB,IAAI,CAAC;AAAA,IACpG,EAAE;AACF,SAAK,UAAU,aAAa,KAAK,OAAO;AACxC,SAAK,WAAW,KAAK;AACrB,SAAK,UAAU,KAAK,WAAW;AAC/B,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGA,KAAK,MAAgC;AACnC,UAAM,WAAW,KAAK,YAAY,IAAI;AACtC,QAAI,CAAC,SAAU,OAAM,IAAI,MAAM,iCAAiC,IAAI,qBAAqB;AACzF,WAAO,IAAI,kBAAiB,CAAC,QAAQ,GAAG,KAAK,OAAO;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,IAAa,KAAmD;AAC/E,eAAW,YAAY,KAAK,WAAW;AACrC,YAAM,OAAO,SAAS,mBAAmB,IAAI,GAAG;AAChD,UAAI,KAAM,QAAO;AAAA,IACnB;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,YAAY,MAA8C;AACxD,WAAO,KAAK,UAAU,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AAAA,EACnD;AAAA;AAAA,EAGA,YAAY,MAAuB;AACjC,WAAO,KAAK,UAAU,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AAAA,EACnD;AAAA;AAAA,EAGA,mBAAmB,MAAuB;AACxC,WAAO,KAAK,UAAU,KAAK,CAAC,MAAM;AAChC,UAAI;AAAE,eAAO,EAAE,SAAS,QAAQ,EAAE,QAAQ;AAAA,MAAG,QAAQ;AAAE,eAAO;AAAA,MAAO;AAAA,IACvE,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,cAAc,OAAwB;AACpC,WAAO,KAAK,UAAU,KAAK,CAAC,MAAM;AAChC,UAAI;AAAE,eAAO,EAAE,QAAQ,KAAK,CAAC,CAAC,EAAE,gBAAgB,KAAK;AAAA,MAAG,QAAQ;AAAE,eAAO;AAAA,MAAO;AAAA,IAClF,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,kBAAkB,WAAmB,SAA0B;AAC7D,WAAO,KAAK,UAAU,KAAK,CAAC,MAAM;AAChC,UAAI;AACF,eAAO,EAAE,QAAQ,MAAM,EAAE,oBAAoB,WAAW,OAAO,KAAK;AAAA,MACtE,QAAQ;AAAE,eAAO;AAAA,MAAO;AAAA,IAC1B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,aACJ,QACA,SAC6B;AAC7B,UAAM,MAAM,MAAM,KAAK,UAAU,QAAQ,OAAO;AAChD,QAAI,CAAC,IAAK,QAAO;AACjB,UAAM,OAAO,SAAS,WAAW,YAAY,IAAI,UAAU,IAAI;AAC/D,UAAM,EAAC,aAAa,IAAI,eAAe,IAAI,MAAM,IAAI,GAAG,MAAK,IAAI;AACjE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,OAAO,KAAK;AAAA,QACZ,SAAS,KAAK;AAAA,QACd,YAAY,IAAI,OAAO,IAAI,CAAC,OAAO;AAAA,UACjC,UAAU,EAAE;AAAA,UACZ,cAAc,EAAE;AAAA,UAChB,YAAY,EAAE;AAAA,UACd,OAAO,EAAE;AAAA,UACT,eAAe,EAAE;AAAA,UACjB,aAAa,EAAE;AAAA,QACjB,EAAE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,UACJ,QACA,SAC0B;AAK1B,UAAM,aAAuB,CAAC;AAC9B,SAAK,kBAAkB;AACvB,UAAM,WAAW,OAAO,OAAO,EAAC,GAAG,OAAM,CAAC;AAC1C,UAAM,OAAO,OAAO,OAAO,EAAC,OAAO,SAAS,aAAa,OAAO,SAAS,YAAW,CAAC;AACrF,UAAM,KAAK,OAAO,OAAO,EAAC,OAAO,SAAS,WAAW,OAAO,SAAS,UAAS,CAAC;AAE/E,QAAI,WAAW,KAAK,UAAU,OAAO,CAAC,MAAM;AAC1C,UAAI;AAAE,eAAO,EAAE,QAAQ,KAAK,EAAE,cAAc,MAAM,EAAE;AAAA,MAAG,QAAQ;AAAE,eAAO;AAAA,MAAO;AAAA,IACjF,CAAC;AACD,QAAI,SAAS,gBAAgB,SAAS,WAAW;AAC/C,iBAAW,SAAS,OAAO,CAAC,MAAM,EAAE,sBAAsB,IAAI;AAAA,IAChE;AACA,QAAI,SAAS,WAAW,EAAG,QAAO;AAOlC,UAAM,YAAY,SAAS,WAAW,IAAI,wBAAwB;AAElE,UAAM,WAAmC,CAAC;AAC1C,UAAM,WAAoB,CAAC;AAC3B,UAAM,UAAU,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACnD,UAAM,UAAU,MAAM;AACpB,UAAI,CAAC,SAAS,YAAY,SAAS,WAAW,EAAG;AACjD,YAAM,MAAM,KAAK,KAAK,UAAU,UAAU,CAAC,GAAG,OAAO,GAAG,UAAU;AAClE,UAAI;AAAE,gBAAQ,SAAS,GAAG;AAAA,MAAG,QAAQ;AAAA,MAA+C;AAAA,IACtF;AACA,UAAM,QAAQ,IAAI,SAAS,IAAI,OAAO,GAAG,MAAM;AAC7C,YAAM,aAAa,IAAI,gBAAgB;AACvC,YAAM,MAAM,OAAO,OAAO,EAAC,GAAG,UAAU,WAAW,CAAC,WAAmB;AACrE,iBAAS,CAAC,MAAM,OAAO,WAAW,GAAG,EAAE,IAAI,GAAG,IAAI,SAAS,GAAG,EAAE,IAAI,KAAK,MAAM;AAC/E,YAAI;AAAE,mBAAS,YAAY,MAAM;AAAA,QAAG,QAAQ;AAAA,QAAyB;AAAA,MACvE,EAAC,CAAC;AACF,UAAI,IAAkB;AACtB,UAAI;AACF,YAAI,MAAM,YAAY,EAAE,SAAS,KAAK,WAAW,MAAM,GAAG,SAAS;AACnE,YAAI,CAAC,GAAG;AAGN,qBAAW,KAAK,SAAS,CAAC,KAAK,GAAG,EAAE,IAAI,qBAAqB;AAAA,QAC/D,WAAW,CAAC,WAAW,GAAG,UAAU,EAAE,IAAI,GAAG;AAC3C,gBAAM,SAAS,GAAG,EAAE,IAAI,qCAAqC,EAAE,aAAa,aAAa,SAAS,gBAAgB,GAAG,gBAAgB,EAAE,YAAY,SAAS,KAAK,IAAI,CAAC;AACtK,qBAAW,KAAK,MAAM;AACtB,kBAAQ,KAAK,iBAAiB,MAAM,EAAE;AACtC,cAAI;AAAA,QACN,WAAW,SAAS,6BAA6B,EAAE,EAAE,eAAe,SAAS,KAAK,EAAE,cAAc,SAAY;AAG5G,cAAI;AAAA,QACN;AAAA,MACF,SAAS,KAAK;AAIZ,cAAM,SAAS,GAAG,EAAE,IAAI,KAAK,eAAe,QAAQ,IAAI,QAAQ,MAAM,GAAG,GAAG,IAAI,OAAO,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;AACzG,mBAAW,KAAK,MAAM;AACtB,gBAAQ,KAAK,qCAAgC,MAAM,EAAE;AACrD,YAAI;AAAA,MACN,UAAE;AACA,mBAAW,MAAM;AAAA,MACnB;AACA,cAAQ,OAAO,EAAE,IAAI;AAGrB,UAAI,EAAG,UAAS,KAAK,EAAC,GAAG,GAAG,UAAU,EAAE,KAAI,CAAC;AAC7C,cAAQ;AAAA,IACV,CAAC,CAAC;AACF,QAAI,SAAS,WAAW,EAAG,QAAO;AAClC,WAAO,KAAK,KAAK,UAAU,UAAU,CAAC,GAAG,UAAU;AAAA,EACrD;AAAA;AAAA,EAGA,MAAM,YAAY,cAAsB,KAAuC;AAC7E,UAAM,WAAW,KAAK,YAAY,YAAY;AAC9C,QAAI,CAAC,SAAU,QAAO,EAAC,OAAO,SAAQ;AACtC,WAAO,SAAS,YAAY,GAAG;AAAA,EACjC;AAAA;AAAA,EAGA,MAAM,cAAc,cAAsB,UAAkB,QAA+B;AACzF,UAAM,KAAK,YAAY,YAAY,GAAG,gBAAgB,UAAU,MAAM;AAAA,EACxE;AAAA;AAAA,EAGA,QAAc;AACZ,eAAW,YAAY,KAAK,UAAW,UAAS,QAAQ;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,KAAK,QAAiB,QAAqB,SAAmB,YAAgC;AACpG,UAAM,MAAM,KAAK,WAAW,OAAO,IAAI,CAAC,MAAM;AAC5C,UAAI;AACF,cAAM,IAAI,KAAK,SAAU,GAAG,MAAM;AAClC,eAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAAA,MAC3D,QAAQ;AAAE,eAAO;AAAA,MAAM;AAAA,IACzB,CAAC,IAAI,OAAO,IAAI,MAAM,IAAI;AAC1B,UAAM,SAAS,IAAI,MAAM,CAAC,MAAM,MAAM,IAAI;AAC1C,QAAI;AACJ,QAAI,QAAQ;AACV,YAAM,SAAS;AACf,YAAM,MAAM,KAAK,IAAI,GAAG,MAAM;AAC9B,iBAAW,OAAO,IAAI,CAAC,MAAO,MAAM,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI,MAAM,KAAK,MAAM,IAAI,CAAE;AAAA,IAClF,OAAO;AACL,YAAM,OAAO,OAAO,IAAI,CAAC,MAAM,OAAO,EAAE,aAAa,CAAC;AACtD,YAAM,MAAM,KAAK,OAAO,CAAC,GAAG,MAAO,IAAI,IAAI,IAAI,CAAE;AACjD,iBAAW,KAAK,IAAI,CAAC,MAAM,SAAS,GAAG,GAAG,CAAC;AAAA,IAC7C;AACA,UAAM,SAAwB,OAAO,IAAI,CAAC,GAAG,OAAO;AAAA,MAClD,GAAG;AAAA,MACH,aAAa,SAAS,IAAI,CAAC,IAAK;AAAA,MAChC,eAAe,SAAS,CAAC;AAAA,MACzB,MAAM,CAAC;AAAA,IACT,EAAE;AAEF,UAAM,OAAO,OAAO,OAAO,CAAC,MAAM,EAAE,iBAAiB,IAAI,KAAK,UAAU,KAAK;AAC7E,UAAM,OAAO,KAAK,IAAI,CAAC,MAAM,EAAE,UAAU;AACzC,UAAM,SAAS,KAAK,IAAI,GAAG,IAAI;AAC/B,UAAM,SAAS,KAAK,IAAI,GAAG,IAAI;AAC/B,UAAM,IAAI,KAAK;AACf,UAAM,WAAW,CAAC,MAChB,EAAE,QAAQ,EAAE,gBACZ,EAAE,SAAS,WAAW,SAAS,KAAK,SAAS,EAAE,eAAe,SAAS,WACvE,EAAE,cAAc,EAAE;AACpB,UAAM,OAAO,KAAK,OAAO,CAAC,GAAG,MAAO,SAAS,CAAC,IAAI,SAAS,CAAC,IAAI,IAAI,CAAE;AACtE,UAAM,UAAU,OAAO,OAAO,CAAC,GAAG,MAChC,EAAE,aAAa,EAAE,cAAe,EAAE,eAAe,EAAE,cAAc,EAAE,gBAAgB,EAAE,gBAAiB,IAAI,CAAC;AAC7G,SAAK,KAAK,KAAK,MAAM;AACrB,YAAQ,KAAK,KAAK,SAAS;AAG3B,WAAO,KAAK,CAAC,GAAG,MAAO,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,aAAa,EAAE,UAAW;AAC3H,WAAO,EAAC,QAAQ,QAAQ,MAAM,SAAS,SAAS,YAAY,CAAC,GAAG,UAAU,EAAC;AAAA,EAC7E;AACF;AAGA,SAAS,SAAS,KAAa,KAAqB;AAClD,MAAI,QAAQ,GAAI,QAAO;AAEvB,SAAO,OAAQ,MAAM,SAAW,GAAG,IAAI;AACzC;","names":[]}