@orbs-network/spot-react 0.0.102 → 0.0.104

package/dist/{index-Bym4mjAW.js → index-CvVYP5KB.js}

@@ -707,7 +707,7 @@ const c5 = { chainName: "ftm", chainId: 250, twapVersion: 4, twapAddress: "0xd3B
     ]
   }
 ], G5 = L5, vY = z5, j5 = H5, V5 = $5;
-var xe = /* @__PURE__ */ ((e) => (e.TWAP = "TWAP", e.LIMIT = "LIMIT", e.STOP_LOSS = "STOP_LOSS", e.TAKE_PROFIT = "TAKE_PROFIT", e))(xe || {}), gt = /* @__PURE__ */ ((e) => (e.Open = "OPEN", e.Canceled = "CANCELED", e.Completed = "COMPLETED", e.Expired = "EXPIRED", e))(gt || {}), Ar = /* @__PURE__ */ ((e) => (e.All = "ALL", e.Open = "OPEN", e.Canceled = "CANCELED", e.Completed = "COMPLETED", e.Expired = "EXPIRED", e))(Ar || {}), Jt = /* @__PURE__ */ ((e) => (e[e.Minutes = 6e4] = "Minutes", e[e.Hours = 36e5] = "Hours", e[e.Weeks = 6048e5] = "Weeks", e[e.Days = 864e5] = "Days", e[e.Months = 2592e6] = "Months", e[e.Years = 31536e6] = "Years", e))(Jt || {}), We = /* @__PURE__ */ ((e) => (e.LIMIT = "limit", e.TWAP_LIMIT = "twap-limit", e.TWAP_MARKET = "twap-market", e.TAKE_PROFIT = "take-profit", e.STOP_LOSS_LIMIT = "stop-loss-limit", e.STOP_LOSS_MARKET = "stop-loss-market", e))(We || {}), Sn = /* @__PURE__ */ ((e) => (e.Arbidex = "arbidex", e.Blackhole = "blackhole", e.Chronos = "chronos", e.Dragon = "dragon", e.Kodiak = "kodiak", e.Lynex = "lynex", e.Nami = "nami", e.Newera = "newera", e.Omni = "omni", e.Pancake = "pancake", e.Quick = "quick", e.Ramses = "ramses", e.Shadow = "shadow", e.Spark = "spark", e.Spooky = "spooky", e.Swapx = "swapx", e.Teafi = "teafi", e.Thena = "thena", e.Yowie = "yowie", e.Pangolin = "pangolin", e.Sushiswap = "sushiswap", e.Agent = "agent", e))(Sn || {}), Wt = /* @__PURE__ */ ((e) => (e[e.EMPTY_LIMIT_PRICE = 0] = "EMPTY_LIMIT_PRICE", e[e.MAX_CHUNKS = 1] = "MAX_CHUNKS", e[e.MIN_CHUNKS = 2] = "MIN_CHUNKS", e[e.MIN_TRADE_SIZE = 3] = "MIN_TRADE_SIZE", e[e.MAX_FILL_DELAY = 4] = "MAX_FILL_DELAY", e[e.MIN_FILL_DELAY = 5] = "MIN_FILL_DELAY", e[e.MAX_ORDER_DURATION = 6] = "MAX_ORDER_DURATION", e[e.MIN_ORDER_DURATION = 7] = "MIN_ORDER_DURATION", e[e.MISSING_LIMIT_PRICE = 8] = "MISSING_LIMIT_PRICE", e[e.STOP_LOSS_TRIGGER_PRICE_GREATER_THAN_MARKET_PRICE = 9] = "STOP_LOSS_TRIGGER_PRICE_GREATER_THAN_MARKET_PRICE", e[e.TRIGGER_LIMIT_PRICE_GREATER_THAN_TRIGGER_PRICE = 10] = "TRIGGER_LIMIT_PRICE_GREATER_THAN_TRIGGER_PRICE", e[e.TAKE_PROFIT_TRIGGER_PRICE_LESS_THAN_MARKET_PRICE = 11] = "TAKE_PROFIT_TRIGGER_PRICE_LESS_THAN_MARKET_PRICE", e[e.EMPTY_TRIGGER_PRICE = 12] = "EMPTY_TRIGGER_PRICE", e[e.INSUFFICIENT_BALANCE = 13] = "INSUFFICIENT_BALANCE", e[e.MAX_ORDER_SIZE = 14] = "MAX_ORDER_SIZE", e[e.MIN_TRADE_SIZE_ERROR = 15] = "MIN_TRADE_SIZE_ERROR", e))(Wt || {});
+var xe = /* @__PURE__ */ ((e) => (e.TWAP = "TWAP", e.LIMIT = "LIMIT", e.STOP_LOSS = "STOP_LOSS", e.TAKE_PROFIT = "TAKE_PROFIT", e))(xe || {}), gt = /* @__PURE__ */ ((e) => (e.Open = "OPEN", e.Cancelled = "CANCELLED", e.Completed = "COMPLETED", e.Expired = "EXPIRED", e))(gt || {}), Ar = /* @__PURE__ */ ((e) => (e.All = "ALL", e.Open = "OPEN", e.Cancelled = "CANCELLED", e.Completed = "COMPLETED", e.Expired = "EXPIRED", e))(Ar || {}), Jt = /* @__PURE__ */ ((e) => (e[e.Minutes = 6e4] = "Minutes", e[e.Hours = 36e5] = "Hours", e[e.Weeks = 6048e5] = "Weeks", e[e.Days = 864e5] = "Days", e[e.Months = 2592e6] = "Months", e[e.Years = 31536e6] = "Years", e))(Jt || {}), We = /* @__PURE__ */ ((e) => (e.LIMIT = "limit", e.TWAP_LIMIT = "twap-limit", e.TWAP_MARKET = "twap-market", e.TAKE_PROFIT = "take-profit", e.STOP_LOSS_LIMIT = "stop-loss-limit", e.STOP_LOSS_MARKET = "stop-loss-market", e))(We || {}), Sn = /* @__PURE__ */ ((e) => (e.Arbidex = "arbidex", e.Blackhole = "blackhole", e.Chronos = "chronos", e.Dragon = "dragon", e.Kodiak = "kodiak", e.Lynex = "lynex", e.Nami = "nami", e.Newera = "newera", e.Omni = "omni", e.Pancake = "pancake", e.Quick = "quick", e.Ramses = "ramses", e.Shadow = "shadow", e.Spark = "spark", e.Spooky = "spooky", e.Swapx = "swapx", e.Teafi = "teafi", e.Thena = "thena", e.Yowie = "yowie", e.Pangolin = "pangolin", e.Sushiswap = "sushiswap", e.Agent = "agent", e))(Sn || {}), Wt = /* @__PURE__ */ ((e) => (e[e.EMPTY_LIMIT_PRICE = 0] = "EMPTY_LIMIT_PRICE", e[e.MAX_CHUNKS = 1] = "MAX_CHUNKS", e[e.MIN_CHUNKS = 2] = "MIN_CHUNKS", e[e.MIN_TRADE_SIZE = 3] = "MIN_TRADE_SIZE", e[e.MAX_FILL_DELAY = 4] = "MAX_FILL_DELAY", e[e.MIN_FILL_DELAY = 5] = "MIN_FILL_DELAY", e[e.MAX_ORDER_DURATION = 6] = "MAX_ORDER_DURATION", e[e.MIN_ORDER_DURATION = 7] = "MIN_ORDER_DURATION", e[e.MISSING_LIMIT_PRICE = 8] = "MISSING_LIMIT_PRICE", e[e.STOP_LOSS_TRIGGER_PRICE_GREATER_THAN_MARKET_PRICE = 9] = "STOP_LOSS_TRIGGER_PRICE_GREATER_THAN_MARKET_PRICE", e[e.TRIGGER_LIMIT_PRICE_GREATER_THAN_TRIGGER_PRICE = 10] = "TRIGGER_LIMIT_PRICE_GREATER_THAN_TRIGGER_PRICE", e[e.TAKE_PROFIT_TRIGGER_PRICE_LESS_THAN_MARKET_PRICE = 11] = "TAKE_PROFIT_TRIGGER_PRICE_LESS_THAN_MARKET_PRICE", e[e.EMPTY_TRIGGER_PRICE = 12] = "EMPTY_TRIGGER_PRICE", e[e.INSUFFICIENT_BALANCE = 13] = "INSUFFICIENT_BALANCE", e[e.MAX_ORDER_SIZE = 14] = "MAX_ORDER_SIZE", e[e.MIN_TRADE_SIZE_ERROR = 15] = "MIN_TRADE_SIZE_ERROR", e))(Wt || {});
 const wt = "0x0000000000000000000000000000000000000000", Rt = {
   eth: {
     id: 1,
@@ -1172,7 +1172,7 @@ function bb(e) {
     suffix: ""
   }, E = "0123456789abcdefghijklmnopqrstuvwxyz", v = !0;
   function w(h, y) {
-    var x, T, I, B, _, k, S, O, U = this;
+    var x, T, I, B, _, k, P, O, U = this;
     if (!(U instanceof w)) return new w(h, y);
     if (y == null) {
       if (h && h._isBigNumber === !0) {
@@ -1200,11 +1200,11 @@ function bb(e) {
           throw Error($m + h);
       } else
         U.s = O.charCodeAt(0) === 45 ? (O = O.slice(1), -1) : 1;
-      for (x = E.slice(0, y), B = _ = 0, S = O.length; _ < S; _++)
+      for (x = E.slice(0, y), B = _ = 0, P = O.length; _ < P; _++)
         if (x.indexOf(T = O.charAt(_)) < 0) {
           if (T == ".") {
             if (_ > B) {
-              B = S;
+              B = P;
               continue;
             }
           } else if (!I && (O == O.toUpperCase() && (O = O.toLowerCase()) || O == O.toLowerCase() && (O = O.toUpperCase()))) {
@@ -1216,21 +1216,21 @@ function bb(e) {
       k = !1, O = r(O, y, 10, U.s), (B = O.indexOf(".")) > -1 ? O = O.replace(".", "") : B = O.length;
     }
     for (_ = 0; O.charCodeAt(_) === 48; _++) ;
-    for (S = O.length; O.charCodeAt(--S) === 48; ) ;
-    if (O = O.slice(_, ++S)) {
-      if (S -= _, k && w.DEBUG && S > 15 && (h > id || h !== wr(h)))
+    for (P = O.length; O.charCodeAt(--P) === 48; ) ;
+    if (O = O.slice(_, ++P)) {
+      if (P -= _, k && w.DEBUG && P > 15 && (h > id || h !== wr(h)))
         throw Error($m + U.s * h);
       if ((B = B - _ - 1) > d)
         U.c = U.e = null;
       else if (B < u)
         U.c = [U.e = 0];
       else {
-        if (U.e = B, U.c = [], _ = (B + 1) % ke, B < 0 && (_ += ke), _ < S) {
-          for (_ && U.c.push(+O.slice(0, _)), S -= ke; _ < S; )
+        if (U.e = B, U.c = [], _ = (B + 1) % ke, B < 0 && (_ += ke), _ < P) {
+          for (_ && U.c.push(+O.slice(0, _)), P -= ke; _ < P; )
             U.c.push(+O.slice(_, _ += ke));
           _ = ke - (O = O.slice(_)).length;
         } else
-          _ -= S;
+          _ -= P;
         for (; _--; O += "0") ;
         U.c.push(+O);
       }
@@ -1310,28 +1310,28 @@ function bb(e) {
       return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
     };
     return function(x) {
-      var T, I, B, _, k, S = 0, O = [], U = new w(a);
+      var T, I, B, _, k, P = 0, O = [], U = new w(a);
       if (x == null ? x = o : ut(x, 0, It), _ = od(x / ke), f)
         if (crypto.getRandomValues) {
-          for (T = crypto.getRandomValues(new Uint32Array(_ *= 2)); S < _; )
-            k = T[S] * 131072 + (T[S + 1] >>> 11), k >= 9e15 ? (I = crypto.getRandomValues(new Uint32Array(2)), T[S] = I[0], T[S + 1] = I[1]) : (O.push(k % 1e14), S += 2);
-          S = _ / 2;
+          for (T = crypto.getRandomValues(new Uint32Array(_ *= 2)); P < _; )
+            k = T[P] * 131072 + (T[P + 1] >>> 11), k >= 9e15 ? (I = crypto.getRandomValues(new Uint32Array(2)), T[P] = I[0], T[P + 1] = I[1]) : (O.push(k % 1e14), P += 2);
+          P = _ / 2;
         } else if (crypto.randomBytes) {
-          for (T = crypto.randomBytes(_ *= 7); S < _; )
-            k = (T[S] & 31) * 281474976710656 + T[S + 1] * 1099511627776 + T[S + 2] * 4294967296 + T[S + 3] * 16777216 + (T[S + 4] << 16) + (T[S + 5] << 8) + T[S + 6], k >= 9e15 ? crypto.randomBytes(7).copy(T, S) : (O.push(k % 1e14), S += 7);
-          S = _ / 7;
+          for (T = crypto.randomBytes(_ *= 7); P < _; )
+            k = (T[P] & 31) * 281474976710656 + T[P + 1] * 1099511627776 + T[P + 2] * 4294967296 + T[P + 3] * 16777216 + (T[P + 4] << 16) + (T[P + 5] << 8) + T[P + 6], k >= 9e15 ? crypto.randomBytes(7).copy(T, P) : (O.push(k % 1e14), P += 7);
+          P = _ / 7;
         } else
           throw f = !1, Error(Yt + "crypto unavailable");
       if (!f)
-        for (; S < _; )
-          k = y(), k < 9e15 && (O[S++] = k % 1e14);
-      for (_ = O[--S], x %= ke, _ && x && (k = cd[ke - x], O[S] = wr(_ / k) * k); O[S] === 0; O.pop(), S--) ;
-      if (S < 0)
+        for (; P < _; )
+          k = y(), k < 9e15 && (O[P++] = k % 1e14);
+      for (_ = O[--P], x %= ke, _ && x && (k = cd[ke - x], O[P] = wr(_ / k) * k); O[P] === 0; O.pop(), P--) ;
+      if (P < 0)
         O = [B = 0];
       else {
         for (B = -1; O[0] === 0; O.splice(0, 1), B -= ke) ;
-        for (S = 1, k = O[0]; k >= 10; k /= 10, S++) ;
-        S < ke && (B -= ke - S);
+        for (P = 1, k = O[0]; k >= 10; k /= 10, P++) ;
+        P < ke && (B -= ke - P);
       }
       return U.e = B, U.c = O, U;
     };
@@ -1341,15 +1341,15 @@ function bb(e) {
   }, r = /* @__PURE__ */ (function() {
     var h = "0123456789";
     function y(x, T, I, B) {
-      for (var _, k = [0], S, O = 0, U = x.length; O < U; ) {
-        for (S = k.length; S--; k[S] *= T) ;
+      for (var _, k = [0], P, O = 0, U = x.length; O < U; ) {
+        for (P = k.length; P--; k[P] *= T) ;
         for (k[0] += B.indexOf(x.charAt(O++)), _ = 0; _ < k.length; _++)
           k[_] > I - 1 && (k[_ + 1] == null && (k[_ + 1] = 0), k[_ + 1] += k[_] / I | 0, k[_] %= I);
       }
       return k.reverse();
     }
     return function(x, T, I, B, _) {
-      var k, S, O, U, N, L, H, Z, fe = x.indexOf("."), ye = o, ie = i;
+      var k, P, O, U, N, L, H, Z, fe = x.indexOf("."), ye = o, ie = i;
       for (fe >= 0 && (U = b, b = 0, x = x.replace(".", ""), Z = new w(T), L = Z.pow(x.length - fe), b = U, Z.c = y(
         wn(gr(L.c), L.e, "0"),
         10,
@@ -1357,12 +1357,12 @@ function bb(e) {
         h
       ), Z.e = Z.c.length), H = y(x, T, I, _ ? (k = E, h) : (k = h, E)), O = U = H.length; H[--U] == 0; H.pop()) ;
       if (!H[0]) return k.charAt(0);
-      if (fe < 0 ? --O : (L.c = H, L.e = O, L.s = B, L = t(L, Z, ye, ie, I), H = L.c, N = L.r, O = L.e), S = O + ye + 1, fe = H[S], U = I / 2, N = N || S < 0 || H[S + 1] != null, N = ie < 4 ? (fe != null || N) && (ie == 0 || ie == (L.s < 0 ? 3 : 2)) : fe > U || fe == U && (ie == 4 || N || ie == 6 && H[S - 1] & 1 || ie == (L.s < 0 ? 8 : 7)), S < 1 || !H[0])
+      if (fe < 0 ? --O : (L.c = H, L.e = O, L.s = B, L = t(L, Z, ye, ie, I), H = L.c, N = L.r, O = L.e), P = O + ye + 1, fe = H[P], U = I / 2, N = N || P < 0 || H[P + 1] != null, N = ie < 4 ? (fe != null || N) && (ie == 0 || ie == (L.s < 0 ? 3 : 2)) : fe > U || fe == U && (ie == 4 || N || ie == 6 && H[P - 1] & 1 || ie == (L.s < 0 ? 8 : 7)), P < 1 || !H[0])
         x = N ? wn(k.charAt(1), -ye, k.charAt(0)) : k.charAt(0);
       else {
-        if (H.length = S, N)
-          for (--I; ++H[--S] > I; )
-            H[S] = 0, S || (++O, H = [1].concat(H));
+        if (H.length = P, N)
+          for (--I; ++H[--P] > I; )
+            H[P] = 0, P || (++O, H = [1].concat(H));
         for (U = H.length; !H[--U]; ) ;
         for (fe = 0, x = ""; fe <= U; x += k.charAt(H[fe++])) ;
         x = wn(x, O, k.charAt(0));
@@ -1371,22 +1371,22 @@ function bb(e) {
     };
   })(), t = /* @__PURE__ */ (function() {
     function h(T, I, B) {
-      var _, k, S, O, U = 0, N = T.length, L = I % Jn, H = I / Jn | 0;
+      var _, k, P, O, U = 0, N = T.length, L = I % Jn, H = I / Jn | 0;
       for (T = T.slice(); N--; )
-        S = T[N] % Jn, O = T[N] / Jn | 0, _ = H * S + O * L, k = L * S + _ % Jn * Jn + U, U = (k / B | 0) + (_ / Jn | 0) + H * O, T[N] = k % B;
+        P = T[N] % Jn, O = T[N] / Jn | 0, _ = H * P + O * L, k = L * P + _ % Jn * Jn + U, U = (k / B | 0) + (_ / Jn | 0) + H * O, T[N] = k % B;
       return U && (T = [U].concat(T)), T;
     }
     function y(T, I, B, _) {
-      var k, S;
+      var k, P;
       if (B != _)
-        S = B > _ ? 1 : -1;
+        P = B > _ ? 1 : -1;
       else
-        for (k = S = 0; k < B; k++)
+        for (k = P = 0; k < B; k++)
           if (T[k] != I[k]) {
-            S = T[k] > I[k] ? 1 : -1;
+            P = T[k] > I[k] ? 1 : -1;
             break;
           }
-      return S;
+      return P;
     }
     function x(T, I, B, _) {
       for (var k = 0; B--; )
@@ -1394,7 +1394,7 @@ function bb(e) {
       for (; !T[0] && T.length > 1; T.splice(0, 1)) ;
     }
     return function(T, I, B, _, k) {
-      var S, O, U, N, L, H, Z, fe, ye, ie, pe, Ue, K, ve, De, He, at, Ae = T.s == I.s ? 1 : -1, Ee = T.c, ge = I.c;
+      var P, O, U, N, L, H, Z, fe, ye, ie, pe, Ue, K, ve, De, He, at, Ae = T.s == I.s ? 1 : -1, Ee = T.c, ge = I.c;
       if (!Ee || !Ee[0] || !ge || !ge[0])
         return new w(
           // Return NaN if either NaN, or both Infinity or 0.
@@ -1410,16 +1410,16 @@ function bb(e) {
         for (ve = Ee.length, He = ge.length, U = 0, Ae += 2, L = wr(k / (ge[0] + 1)), L > 1 && (ge = h(ge, L, k), Ee = h(Ee, L, k), He = ge.length, ve = Ee.length), K = He, ie = Ee.slice(0, He), pe = ie.length; pe < He; ie[pe++] = 0) ;
         at = ge.slice(), at = [0].concat(at), De = ge[0], ge[1] >= k / 2 && De++;
         do {
-          if (L = 0, S = y(ge, ie, He, pe), S < 0) {
+          if (L = 0, P = y(ge, ie, He, pe), P < 0) {
             if (Ue = ie[0], He != pe && (Ue = Ue * k + (ie[1] || 0)), L = wr(Ue / De), L > 1)
               for (L >= k && (L = k - 1), H = h(ge, L, k), Z = H.length, pe = ie.length; y(H, ie, Z, pe) == 1; )
-                L--, x(H, He < Z ? at : ge, Z, k), Z = H.length, S = 1;
+                L--, x(H, He < Z ? at : ge, Z, k), Z = H.length, P = 1;
             else
-              L == 0 && (S = L = 1), H = ge.slice(), Z = H.length;
-            if (Z < pe && (H = [0].concat(H)), x(ie, H, pe, k), pe = ie.length, S == -1)
+              L == 0 && (P = L = 1), H = ge.slice(), Z = H.length;
+            if (Z < pe && (H = [0].concat(H)), x(ie, H, pe, k), pe = ie.length, P == -1)
               for (; y(ge, ie, He, pe) < 1; )
                 L++, x(ie, He < pe ? at : ge, pe, k), pe = ie.length;
-          } else S === 0 && (L++, ie = [0]);
+          } else P === 0 && (L++, ie = [0]);
           ye[U++] = L, ie[0] ? ie[pe++] = Ee[K] || 0 : (ie = [Ee[K]], pe = 1);
         } while ((K++ < ve || ie[0] != null) && Ae--);
         N = ie[0] != null, ye[0] || ye.splice(0, 1);
@@ -1433,18 +1433,18 @@ function bb(e) {
     };
   })();
   function A(h, y, x, T) {
-    var I, B, _, k, S;
+    var I, B, _, k, P;
     if (x == null ? x = i : ut(x, 0, 8), !h.c) return h.toString();
     if (I = h.c[0], _ = h.e, y == null)
-      S = gr(h.c), S = T == 1 || T == 2 && (_ <= c || _ >= l) ? Lc(S, _) : wn(S, _, "0");
-    else if (h = R(new w(h), y, x), B = h.e, S = gr(h.c), k = S.length, T == 1 || T == 2 && (y <= B || B <= c)) {
-      for (; k < y; S += "0", k++) ;
-      S = Lc(S, B);
-    } else if (y -= _ + (T === 2 && B > _), S = wn(S, B, "0"), B + 1 > k) {
-      if (--y > 0) for (S += "."; y--; S += "0") ;
+      P = gr(h.c), P = T == 1 || T == 2 && (_ <= c || _ >= l) ? Lc(P, _) : wn(P, _, "0");
+    else if (h = R(new w(h), y, x), B = h.e, P = gr(h.c), k = P.length, T == 1 || T == 2 && (y <= B || B <= c)) {
+      for (; k < y; P += "0", k++) ;
+      P = Lc(P, B);
+    } else if (y -= _ + (T === 2 && B > _), P = wn(P, B, "0"), B + 1 > k) {
+      if (--y > 0) for (P += "."; y--; P += "0") ;
     } else if (y += B - k, y > 0)
-      for (B + 1 == k && (S += "."); y--; S += "0") ;
-    return h.s < 0 && I ? "-" + S : S;
+      for (B + 1 == k && (P += "."); y--; P += "0") ;
+    return h.s < 0 && I ? "-" + P : P;
   }
   function C(h, y) {
     for (var x, T, I = 1, B = new w(h[0]); I < h.length; I++)
@@ -1458,46 +1458,46 @@ function bb(e) {
   }
   n = /* @__PURE__ */ (function() {
     var h = /^(-?)0([xbo])(?=\w[\w.]*$)/i, y = /^([^.]+)\.$/, x = /^\.([^.]+)$/, T = /^-?(Infinity|NaN)$/, I = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-    return function(B, _, k, S) {
+    return function(B, _, k, P) {
       var O, U = k ? _ : _.replace(I, "");
       if (T.test(U))
         B.s = isNaN(U) ? null : U < 0 ? -1 : 1;
       else {
         if (!k && (U = U.replace(h, function(N, L, H) {
-          return O = (H = H.toLowerCase()) == "x" ? 16 : H == "b" ? 2 : 8, !S || S == O ? L : N;
-        }), S && (O = S, U = U.replace(y, "$1").replace(x, "0.$1")), _ != U))
+          return O = (H = H.toLowerCase()) == "x" ? 16 : H == "b" ? 2 : 8, !P || P == O ? L : N;
+        }), P && (O = P, U = U.replace(y, "$1").replace(x, "0.$1")), _ != U))
           return new w(U, O);
         if (w.DEBUG)
-          throw Error(Yt + "Not a" + (S ? " base " + S : "") + " number: " + _);
+          throw Error(Yt + "Not a" + (P ? " base " + P : "") + " number: " + _);
         B.s = null;
       }
       B.c = B.e = null;
     };
   })();
   function R(h, y, x, T) {
-    var I, B, _, k, S, O, U, N = h.c, L = cd;
+    var I, B, _, k, P, O, U, N = h.c, L = cd;
     if (N) {
       e: {
         for (I = 1, k = N[0]; k >= 10; k /= 10, I++) ;
         if (B = y - I, B < 0)
-          B += ke, _ = y, S = N[O = 0], U = wr(S / L[I - _ - 1] % 10);
+          B += ke, _ = y, P = N[O = 0], U = wr(P / L[I - _ - 1] % 10);
         else if (O = od((B + 1) / ke), O >= N.length)
           if (T) {
             for (; N.length <= O; N.push(0)) ;
-            S = U = 0, I = 1, B %= ke, _ = B - ke + 1;
+            P = U = 0, I = 1, B %= ke, _ = B - ke + 1;
           } else
             break e;
         else {
-          for (S = k = N[O], I = 1; k >= 10; k /= 10, I++) ;
-          B %= ke, _ = B - ke + I, U = _ < 0 ? 0 : wr(S / L[I - _ - 1] % 10);
+          for (P = k = N[O], I = 1; k >= 10; k /= 10, I++) ;
+          B %= ke, _ = B - ke + I, U = _ < 0 ? 0 : wr(P / L[I - _ - 1] % 10);
         }
         if (T = T || y < 0 || // Are there any non-zero digits after the rounding digit?
         // The expression  n % pows10[d - j - 1]  returns all digits of n to the right
         // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
-        N[O + 1] != null || (_ < 0 ? S : S % L[I - _ - 1]), T = x < 4 ? (U || T) && (x == 0 || x == (h.s < 0 ? 3 : 2)) : U > 5 || U == 5 && (x == 4 || T || x == 6 && // Check whether the digit to the left of the rounding digit is odd.
-        (B > 0 ? _ > 0 ? S / L[I - _] : 0 : N[O - 1]) % 10 & 1 || x == (h.s < 0 ? 8 : 7)), y < 1 || !N[0])
+        N[O + 1] != null || (_ < 0 ? P : P % L[I - _ - 1]), T = x < 4 ? (U || T) && (x == 0 || x == (h.s < 0 ? 3 : 2)) : U > 5 || U == 5 && (x == 4 || T || x == 6 && // Check whether the digit to the left of the rounding digit is odd.
+        (B > 0 ? _ > 0 ? P / L[I - _] : 0 : N[O - 1]) % 10 & 1 || x == (h.s < 0 ? 8 : 7)), y < 1 || !N[0])
           return N.length = 0, T ? (y -= h.e + 1, N[0] = L[(ke - y % ke) % ke], h.e = -y || 0) : N[0] = h.e = 0, h;
-        if (B == 0 ? (N.length = O, k = 1, O--) : (N.length = O + 1, k = L[ke - B], N[O] = _ > 0 ? wr(S / L[I - _] % L[_]) * k : 0), T)
+        if (B == 0 ? (N.length = O, k = 1, O--) : (N.length = O + 1, k = L[ke - B], N[O] = _ > 0 ? wr(P / L[I - _] % L[_]) * k : 0), T)
           for (; ; )
             if (O == 0) {
               for (B = 1, _ = N[0]; _ >= 10; _ /= 10, B++) ;
@@ -1514,7 +1514,7 @@ function bb(e) {
     }
     return h;
   }
-  function P(h) {
+  function S(h) {
     var y, x = h.e;
     return x === null ? h.toString() : (y = gr(h.c), y = x <= c || x >= l ? Lc(y, x) : wn(y, x, "0"), h.s < 0 ? "-" + y : y);
   }
@@ -1535,20 +1535,20 @@ function bb(e) {
   }, s.dividedToIntegerBy = s.idiv = function(h, y) {
     return t(this, new w(h, y), 0, 1);
   }, s.exponentiatedBy = s.pow = function(h, y) {
-    var x, T, I, B, _, k, S, O, U, N = this;
+    var x, T, I, B, _, k, P, O, U, N = this;
     if (h = new w(h), h.c && !h.isInteger())
-      throw Error(Yt + "Exponent not an integer: " + P(h));
+      throw Error(Yt + "Exponent not an integer: " + S(h));
     if (y != null && (y = new w(y)), k = h.e > 14, !N.c || !N.c[0] || N.c[0] == 1 && !N.e && N.c.length == 1 || !h.c || !h.c[0])
-      return U = new w(Math.pow(+P(N), k ? h.s * (2 - Nc(h)) : +P(h))), y ? U.mod(y) : U;
-    if (S = h.s < 0, y) {
+      return U = new w(Math.pow(+S(N), k ? h.s * (2 - Nc(h)) : +S(h))), y ? U.mod(y) : U;
+    if (P = h.s < 0, y) {
       if (y.c ? !y.c[0] : !y.s) return new w(NaN);
-      T = !S && N.isInteger() && y.isInteger(), T && (N = N.mod(y));
+      T = !P && N.isInteger() && y.isInteger(), T && (N = N.mod(y));
     } else {
       if (h.e > 9 && (N.e > 0 || N.e < -1 || (N.e == 0 ? N.c[0] > 1 || k && N.c[1] >= 24e7 : N.c[0] < 8e13 || k && N.c[0] <= 9999975e7)))
-        return B = N.s < 0 && Nc(h) ? -0 : 0, N.e > -1 && (B = 1 / B), new w(S ? 1 / B : B);
+        return B = N.s < 0 && Nc(h) ? -0 : 0, N.e > -1 && (B = 1 / B), new w(P ? 1 / B : B);
       b && (B = od(b / ke + 2));
     }
-    for (k ? (x = new w(0.5), S && (h.s = 1), O = Nc(h)) : (I = Math.abs(+P(h)), O = I % 2), U = new w(a); ; ) {
+    for (k ? (x = new w(0.5), P && (h.s = 1), O = Nc(h)) : (I = Math.abs(+S(h)), O = I % 2), U = new w(a); ; ) {
       if (O) {
         if (U = U.times(N), !U.c) break;
         B ? U.c.length > B && (U.c.length = B) : T && (U = U.mod(y));
@@ -1559,12 +1559,12 @@ function bb(e) {
       } else if (h = h.times(x), R(h, h.e + 1, 1), h.e > 14)
         O = Nc(h);
       else {
-        if (I = +P(h), I === 0) break;
+        if (I = +S(h), I === 0) break;
         O = I % 2;
       }
       N = N.times(N), B ? N.c && N.c.length > B && (N.c.length = B) : T && (N = N.mod(y));
     }
-    return T ? U : (S && (U = a.div(U)), y ? U.mod(y) : B ? R(U, b, i, _) : U);
+    return T ? U : (P && (U = a.div(U)), y ? U.mod(y) : B ? R(U, b, i, _) : U);
   }, s.integerValue = function(h) {
     var y = new w(this);
     return h == null ? h = i : ut(h, 0, 8), R(y, y.e + 1, h);
@@ -1595,8 +1595,8 @@ function bb(e) {
     if (h = new w(h, y), y = h.s, !k || !y) return new w(NaN);
     if (k != y)
       return h.s = -y, _.plus(h);
-    var S = _.e / ke, O = h.e / ke, U = _.c, N = h.c;
-    if (!S || !O) {
+    var P = _.e / ke, O = h.e / ke, U = _.c, N = h.c;
+    if (!P || !O) {
       if (!U || !N) return U ? (h.s = -y, h) : new w(N ? _ : NaN);
       if (!U[0] || !N[0])
         return N[0] ? (h.s = -y, h) : new w(U[0] ? _ : (
@@ -1604,8 +1604,8 @@ function bb(e) {
           i == 3 ? -0 : 0
         ));
     }
-    if (S = vr(S), O = vr(O), U = U.slice(), k = S - O) {
-      for ((B = k < 0) ? (k = -k, I = U) : (O = S, I = N), I.reverse(), y = k; y--; I.push(0)) ;
+    if (P = vr(P), O = vr(O), U = U.slice(), k = P - O) {
+      for ((B = k < 0) ? (k = -k, I = U) : (O = P, I = N), I.reverse(), y = k; y--; I.push(0)) ;
       I.reverse();
     } else
       for (T = (B = (k = U.length) < (y = N.length)) ? k : y, k = y = 0; y < T; y++)
@@ -1627,12 +1627,12 @@ function bb(e) {
     var x, T, I = this;
     return h = new w(h, y), !I.c || !h.s || h.c && !h.c[0] ? new w(NaN) : !h.c || I.c && !I.c[0] ? new w(I) : (m == 9 ? (T = h.s, h.s = 1, x = t(I, h, 0, 3), h.s = T, x.s *= T) : x = t(I, h, 0, m), h = I.minus(x.times(h)), !h.c[0] && m == 1 && (h.s = I.s), h);
   }, s.multipliedBy = s.times = function(h, y) {
-    var x, T, I, B, _, k, S, O, U, N, L, H, Z, fe, ye, ie = this, pe = ie.c, Ue = (h = new w(h, y)).c;
+    var x, T, I, B, _, k, P, O, U, N, L, H, Z, fe, ye, ie = this, pe = ie.c, Ue = (h = new w(h, y)).c;
     if (!pe || !Ue || !pe[0] || !Ue[0])
       return !ie.s || !h.s || pe && !pe[0] && !Ue || Ue && !Ue[0] && !pe ? h.c = h.e = h.s = null : (h.s *= ie.s, !pe || !Ue ? h.c = h.e = null : (h.c = [0], h.e = 0)), h;
-    for (T = vr(ie.e / ke) + vr(h.e / ke), h.s *= ie.s, S = pe.length, N = Ue.length, S < N && (Z = pe, pe = Ue, Ue = Z, I = S, S = N, N = I), I = S + N, Z = []; I--; Z.push(0)) ;
+    for (T = vr(ie.e / ke) + vr(h.e / ke), h.s *= ie.s, P = pe.length, N = Ue.length, P < N && (Z = pe, pe = Ue, Ue = Z, I = P, P = N, N = I), I = P + N, Z = []; I--; Z.push(0)) ;
     for (fe = Dr, ye = Jn, I = N; --I >= 0; ) {
-      for (x = 0, L = Ue[I] % ye, H = Ue[I] / ye | 0, _ = S, B = I + _; B > I; )
+      for (x = 0, L = Ue[I] % ye, H = Ue[I] / ye | 0, _ = P, B = I + _; B > I; )
         O = pe[--_] % ye, U = pe[_] / ye | 0, k = H * O + U * L, O = L * O + k % ye * ye + Z[B] + x, x = (O / fe | 0) + (k / ye | 0) + H * U, Z[B--] = O % fe;
       Z[B] = x;
     }
@@ -1645,17 +1645,17 @@ function bb(e) {
     if (h = new w(h, y), y = h.s, !I || !y) return new w(NaN);
     if (I != y)
       return h.s = -y, T.minus(h);
-    var B = T.e / ke, _ = h.e / ke, k = T.c, S = h.c;
+    var B = T.e / ke, _ = h.e / ke, k = T.c, P = h.c;
     if (!B || !_) {
-      if (!k || !S) return new w(I / 0);
-      if (!k[0] || !S[0]) return S[0] ? h : new w(k[0] ? T : I * 0);
+      if (!k || !P) return new w(I / 0);
+      if (!k[0] || !P[0]) return P[0] ? h : new w(k[0] ? T : I * 0);
     }
     if (B = vr(B), _ = vr(_), k = k.slice(), I = B - _) {
-      for (I > 0 ? (_ = B, x = S) : (I = -I, x = k), x.reverse(); I--; x.push(0)) ;
+      for (I > 0 ? (_ = B, x = P) : (I = -I, x = k), x.reverse(); I--; x.push(0)) ;
       x.reverse();
     }
-    for (I = k.length, y = S.length, I - y < 0 && (x = S, S = k, k = x, y = I), I = 0; y; )
-      I = (k[--y] = k[y] + S[y] + I) / Dr | 0, k[y] = Dr === k[y] ? 0 : k[y] % Dr;
+    for (I = k.length, y = P.length, I - y < 0 && (x = P, P = k, k = x, y = I), I = 0; y; )
+      I = (k[--y] = k[y] + P[y] + I) / Dr | 0, k[y] = Dr === k[y] ? 0 : k[y] % Dr;
     return I && (k = [I].concat(k), ++_), F(h, k, _);
   }, s.precision = s.sd = function(h, y) {
     var x, T, I, B = this;
@@ -1670,13 +1670,13 @@ function bb(e) {
   }, s.shiftedBy = function(h) {
     return ut(h, -id, id), this.times("1e" + h);
   }, s.squareRoot = s.sqrt = function() {
-    var h, y, x, T, I, B = this, _ = B.c, k = B.s, S = B.e, O = o + 4, U = new w("0.5");
+    var h, y, x, T, I, B = this, _ = B.c, k = B.s, P = B.e, O = o + 4, U = new w("0.5");
     if (k !== 1 || !_ || !_[0])
       return new w(!k || k < 0 && (!_ || _[0]) ? NaN : _ ? B : 1 / 0);
-    if (k = Math.sqrt(+P(B)), k == 0 || k == 1 / 0 ? (y = gr(_), (y.length + S) % 2 == 0 && (y += "0"), k = Math.sqrt(+y), S = vr((S + 1) / 2) - (S < 0 || S % 2), k == 1 / 0 ? y = "5e" + S : (y = k.toExponential(), y = y.slice(0, y.indexOf("e") + 1) + S), x = new w(y)) : x = new w(k + ""), x.c[0]) {
-      for (S = x.e, k = S + O, k < 3 && (k = 0); ; )
+    if (k = Math.sqrt(+S(B)), k == 0 || k == 1 / 0 ? (y = gr(_), (y.length + P) % 2 == 0 && (y += "0"), k = Math.sqrt(+y), P = vr((P + 1) / 2) - (P < 0 || P % 2), k == 1 / 0 ? y = "5e" + P : (y = k.toExponential(), y = y.slice(0, y.indexOf("e") + 1) + P), x = new w(y)) : x = new w(k + ""), x.c[0]) {
+      for (P = x.e, k = P + O, k < 3 && (k = 0); ; )
         if (I = x, x = U.times(I.plus(t(B, I, O, 1))), gr(I.c).slice(0, k) === (y = gr(x.c)).slice(0, k))
-          if (x.e < S && --k, y = y.slice(k - 3, k + 1), y == "9999" || !T && y == "4999") {
+          if (x.e < P && --k, y = y.slice(k - 3, k + 1), y == "9999" || !T && y == "4999") {
             if (!T && (R(I, I.e + o + 2, 0), I.times(I).eq(B))) {
               x = I;
               break;
@@ -1699,36 +1699,36 @@ function bb(e) {
     else if (typeof x != "object")
       throw Error(Yt + "Argument not an object: " + x);
     if (T = I.toFixed(h, y), I.c) {
-      var B, _ = T.split("."), k = +x.groupSize, S = +x.secondaryGroupSize, O = x.groupSeparator || "", U = _[0], N = _[1], L = I.s < 0, H = L ? U.slice(1) : U, Z = H.length;
-      if (S && (B = k, k = S, S = B, Z -= B), k > 0 && Z > 0) {
+      var B, _ = T.split("."), k = +x.groupSize, P = +x.secondaryGroupSize, O = x.groupSeparator || "", U = _[0], N = _[1], L = I.s < 0, H = L ? U.slice(1) : U, Z = H.length;
+      if (P && (B = k, k = P, P = B, Z -= B), k > 0 && Z > 0) {
         for (B = Z % k || k, U = H.substr(0, B); B < Z; B += k) U += O + H.substr(B, k);
-        S > 0 && (U += O + H.slice(B)), L && (U = "-" + U);
+        P > 0 && (U += O + H.slice(B)), L && (U = "-" + U);
       }
-      T = N ? U + (x.decimalSeparator || "") + ((S = +x.fractionGroupSize) ? N.replace(
-        new RegExp("\\d{" + S + "}\\B", "g"),
+      T = N ? U + (x.decimalSeparator || "") + ((P = +x.fractionGroupSize) ? N.replace(
+        new RegExp("\\d{" + P + "}\\B", "g"),
         "$&" + (x.fractionGroupSeparator || "")
       ) : N) : U;
     }
     return (x.prefix || "") + T + (x.suffix || "");
   }, s.toFraction = function(h) {
-    var y, x, T, I, B, _, k, S, O, U, N, L, H = this, Z = H.c;
+    var y, x, T, I, B, _, k, P, O, U, N, L, H = this, Z = H.c;
     if (h != null && (k = new w(h), !k.isInteger() && (k.c || k.s !== 1) || k.lt(a)))
-      throw Error(Yt + "Argument " + (k.isInteger() ? "out of range: " : "not an integer: ") + P(k));
+      throw Error(Yt + "Argument " + (k.isInteger() ? "out of range: " : "not an integer: ") + S(k));
     if (!Z) return new w(H);
-    for (y = new w(a), O = x = new w(a), T = S = new w(a), L = gr(Z), B = y.e = L.length - H.e - 1, y.c[0] = cd[(_ = B % ke) < 0 ? ke + _ : _], h = !h || k.comparedTo(y) > 0 ? B > 0 ? y : O : k, _ = d, d = 1 / 0, k = new w(L), S.c[0] = 0; U = t(k, y, 0, 1), I = x.plus(U.times(T)), I.comparedTo(h) != 1; )
-      x = T, T = I, O = S.plus(U.times(I = O)), S = I, y = k.minus(U.times(I = y)), k = I;
-    return I = t(h.minus(x), T, 0, 1), S = S.plus(I.times(O)), x = x.plus(I.times(T)), S.s = O.s = H.s, B = B * 2, N = t(O, T, B, i).minus(H).abs().comparedTo(
-      t(S, x, B, i).minus(H).abs()
-    ) < 1 ? [O, T] : [S, x], d = _, N;
+    for (y = new w(a), O = x = new w(a), T = P = new w(a), L = gr(Z), B = y.e = L.length - H.e - 1, y.c[0] = cd[(_ = B % ke) < 0 ? ke + _ : _], h = !h || k.comparedTo(y) > 0 ? B > 0 ? y : O : k, _ = d, d = 1 / 0, k = new w(L), P.c[0] = 0; U = t(k, y, 0, 1), I = x.plus(U.times(T)), I.comparedTo(h) != 1; )
+      x = T, T = I, O = P.plus(U.times(I = O)), P = I, y = k.minus(U.times(I = y)), k = I;
+    return I = t(h.minus(x), T, 0, 1), P = P.plus(I.times(O)), x = x.plus(I.times(T)), P.s = O.s = H.s, B = B * 2, N = t(O, T, B, i).minus(H).abs().comparedTo(
+      t(P, x, B, i).minus(H).abs()
+    ) < 1 ? [O, T] : [P, x], d = _, N;
   }, s.toNumber = function() {
-    return +P(this);
+    return +S(this);
   }, s.toPrecision = function(h, y) {
     return h != null && ut(h, 1, It), A(this, h, y, 2);
   }, s.toString = function(h) {
     var y, x = this, T = x.s, I = x.e;
     return I === null ? T ? (y = "Infinity", T < 0 && (y = "-" + y)) : y = "NaN" : (h == null ? y = I <= c || I >= l ? Lc(gr(x.c), I) : wn(gr(x.c), I, "0") : h === 10 && v ? (x = R(new w(x), o + I + 1, i), y = wn(gr(x.c), x.e, "0")) : (ut(h, 2, E.length, "Base"), y = r(wn(gr(x.c), I, "0"), 10, h, T, !0)), T < 0 && x.c[0] && (y = "-" + y)), y;
   }, s.valueOf = s.toJSON = function() {
-    return P(this);
+    return S(this);
   }, s._isBigNumber = !0, s[Symbol.toStringTag] = "BigNumber", s[Symbol.for("nodejs.util.inspect.custom")] = s.valueOf, e != null && w.set(e), w;
 }
 function vr(e) {
@@ -2187,18 +2187,18 @@ function fw(e) {
 const mw = {
   1: { dex: { sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
   14: { dex: { spark: { type: "default:spark", adapter: "0xB18c633B6584A33E45a8840a759f56dF17117b1D", fee: "0xaeA8C3e1a129A77686E115b1a46D9aD8405F7D2b" } } },
-  56: { dex: { agent: { type: "default:odos-v2", router: "0x89b8AA89FDd0507a99d334CBe3C808fAFC7d850E", adapter: "0x67Feba015c968c76cCB2EEabf197b4578640BE2C", fee: "0x03A70aC8126340d3cd6b5828816172693C398661" }, thena: { type: "default:odos-v2", adapter: "0xB75218ba5A99bF57Fd02556B70F05A4A0f1Dbe67", fee: "0x15eBc8b5b3877512FFF23650188694A9a8891FAc" }, pancake: { type: "p2:pancakeswap-v2", adapter: "0x654272F7e6e6E912D38650f783eFd44452fD6ee5", fee: "0x37A957f10F458e0d7fDECBE2917971b57F15c927" }, newera: { type: "default:odos-v2", adapter: "0x845f459271D800f6Ab32D78400b8Aa18414E80b0", fee: "0x4E7454909eB6D539111D56b50d68897E933D2d11" } } },
+  56: { dex: { thena: { type: "default:odos-v2", adapter: "0xB75218ba5A99bF57Fd02556B70F05A4A0f1Dbe67", fee: "0x15eBc8b5b3877512FFF23650188694A9a8891FAc" }, pancake: { type: "p2:pancakeswap-v2", adapter: "0x654272F7e6e6E912D38650f783eFd44452fD6ee5", fee: "0x37A957f10F458e0d7fDECBE2917971b57F15c927" }, newera: { type: "default:odos-v2", adapter: "0x845f459271D800f6Ab32D78400b8Aa18414E80b0", fee: "0x4E7454909eB6D539111D56b50d68897E933D2d11" } } },
   137: { dex: { quick: { type: "paraswap:paraswap-v5", adapter: "0x023fD6848234f2655818705237F77F02215FEfe5", fee: "0xd207DC6a6dA88f27c8DB78201F974161b1d84b1f" }, teafi: { type: "paraswap:paraswap-v5", adapter: "0xe95db7a60164B112C64cE67bA8587b1d4a0E0D29", fee: "0x04Ff96e2c4D62b5771795d307AD679a25b3D2D50" } } },
   143: { dex: { yowie: { type: "default:openocean-v2", adapter: "0x18bc9533c3539073B9A9acF12b0AbF7cB73e0F1f", fee: "0x6AF3eE77A3A3257777F5649aFa611b4C7Fd975Ef" }, pangolin: { type: "default:kyber-v2", adapter: "0xd7D9CAA2910f49F37AC3447f5cAd27153944354A", fee: "0xde92da99D188Ceb54A11ec711EF52D808A6260B5" } } },
   146: { dex: { spooky: { type: "default:magpie-v3", adapter: "0xdCee7FDdB932104329d528144Cd17A408722B7e2", fee: "0x840Df4684B35BC68BcdA3F6707A3c82A0D662f8b" }, swapx: { type: "default:openocean-v2", adapter: "0xecc733D6F6f2DEa341832D650E30822118884FEb", fee: "0x6E03f7BC0f141894612AA017796096399623895F" }, shadow: { type: "default:magpie-v3", adapter: "0x5f3E5F6ACCfc65243A01Da3E93b5A700285592C3", fee: "0xb9e3751fAF3187E1bC468E56a707a8A91754460e" } } },
   1329: { dex: { dragon: { type: "default:dragon", adapter: "0x02d9d5882129241b67ec21Ebc2C86e1BE9BC9890", fee: "0x0dc1E0525202b32e89bA78ed55b1e5cEdB751334" }, nami: { type: "default:openocean-v2", adapter: "0x2D4A1237A98f8cb03C3C85960e859aA44036a306", fee: "0xeB58450e23632003f013568703F54446070E2E80" } } },
   8453: { dex: { quick: { type: "default:kyber-v2", adapter: "0xc73F03c929A123Ee2f3A98EC18BB240f03980AE5", fee: "0xd207DC6a6dA88f27c8DB78201F974161b1d84b1f" }, sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
-  42161: { dex: { agent: { type: "default:odos-v2", router: "0xa669e7A0d4b3e4Fa48af2dE86BD4CD7126Be4e13", adapter: "0x026B8977319F67078e932a08feAcB59182B5380f", fee: "0x03A70aC8126340d3cd6b5828816172693C398661" }, arbidex: { type: "default:odos-v2", adapter: "0xa734b32151108139e48dCA06eE721538d90A9Ef6", fee: "0xa0c11852f8A44e32F9EC10AD25986A53842f72Ca" }, ramses: { type: "paraswap:paraswap-v5", adapter: "0x023fD6848234f2655818705237F77F02215FEfe5", fee: "0xB5BaCB60ECDa0bEF809B2A26eC9B4B926835D7af" }, omni: { type: "paraswap:paraswap-v5", adapter: "0xa1baE146161223cd9dCa7137F68eb385934130BE", fee: "0xba5291526c30B097E9F1Fd1Be301E2ab6E0782aa" }, chronos: { type: "default:odos-v2", adapter: "0x4Ff90F32aceD08b3e3257B018EA495Fd1Bfe4455", fee: "0x5729af83240EFecAa18eafaAE82961c2DD045Dbe" }, sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
+  42161: { dex: { arbidex: { type: "default:odos-v2", adapter: "0xa734b32151108139e48dCA06eE721538d90A9Ef6", fee: "0xa0c11852f8A44e32F9EC10AD25986A53842f72Ca" }, ramses: { type: "paraswap:paraswap-v5", adapter: "0x023fD6848234f2655818705237F77F02215FEfe5", fee: "0xB5BaCB60ECDa0bEF809B2A26eC9B4B926835D7af" }, omni: { type: "paraswap:paraswap-v5", adapter: "0xa1baE146161223cd9dCa7137F68eb385934130BE", fee: "0xba5291526c30B097E9F1Fd1Be301E2ab6E0782aa" }, chronos: { type: "default:odos-v2", adapter: "0x4Ff90F32aceD08b3e3257B018EA495Fd1Bfe4455", fee: "0x5729af83240EFecAa18eafaAE82961c2DD045Dbe" }, sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
   43114: { dex: { blackhole: { type: "default:kyber-v2", adapter: "0x426ec4bc0d58B80959CDE77576a1942dd40592Fa", fee: "0x7f8B62520D9B5DA0ED517cc36e8dcb2a356f1928" }, pangolin: { type: "default:kyber-v2", adapter: "0xd7D9CAA2910f49F37AC3447f5cAd27153944354A", fee: "0xde92da99D188Ceb54A11ec711EF52D808A6260B5" } } },
   59144: { dex: { lynex: { type: "default:openocean", adapter: "0x4FF6A97A67fe395212f168f011D71fE79E4396f2", fee: "0xcb36ed1B1BfAD8F7FC9651f52d21f04A68677423" } } },
   80094: { dex: { kodiak: { type: "default:kodiak", adapter: "0xBbaa527Aac00b1Ee9A3909D4D8c4447630E29B1F", fee: "0xBA47Ec15aFbCF6e7e9F52900632049530bB6bAe4" } } },
   747474: { dex: { sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
-  "*": { wm: "0x0005d5cE0dB57e5BE3b2b8b6FeB75f0ccd015000", repermit: "0x00002a9C4D9497df5Bd31768eC5d30eEf5405000", cosigner: "0x000ECFa392ecDEfEE6e2a5C095d39B7A32f1E000", reactor: "0x000000b33fE4fB9d999Dd684F79b110731c3d000", executor: "0x000642A0966d9bd49870D9519f76b5cf823f3000", refinery: "0x000E474c0D7084EAA35A501035E73269f4b009A5", salt: { wm: "0xc9b46eae42dfeba3222a0315bf682f33cd5cc9d60c9625642e88406f8415f152", repermit: "0x4871dc9008e605821ea9677b65ea2a60ffb774afb31e0dcaea2e192880096be7", cosigner: "0x1117fe6f4e25c9380d10b2b3314a1e9b33e5f65ba0e55e0c63d0640db0dd60a2", reactor: "0xec73677f3a465a9755d4c9eab9509b59a24613fdb8b78719682930373e9876f5", executor: "0x9abc67d936f79e493f1f14050c2f6adb87ec208ff7aaae2e7ae788a7cb4796d7", refinery: "0x9746de29f1dd31b2c8460d71e92a7aefa34911130e61f274f37776e598c48bec" } }
+  "*": { wm: "0x0005d5cE0dB57e5BE3b2b8b6FeB75f0ccd015000", repermit: "0x00002a9C4D9497df5Bd31768eC5d30eEf5405000", cosigner: "0x0007ec53404c423C935e830ec21903e184690000", reactor: "0x0006a959430e8fBB858D81B2D1140B0ae5c26001", executor: "0x000eBA869d76C618ddc4A6D685A0820A620Ce002", refinery: "0x000E474c0D7084EAA35A501035E73269f4b009A5", salt: { wm: "0xc9b46eae42dfeba3222a0315bf682f33cd5cc9d60c9625642e88406f8415f152", repermit: "0x4871dc9008e605821ea9677b65ea2a60ffb774afb31e0dcaea2e192880096be7", cosigner: "0x37576f2ac1d2a602f00777611edf6f0cbc27611b0980b29bc7856fa79b2b8073", reactor: "0x034169222370f2fd587ef8998082d762cceef58a272330215f5110ec0d76d400", executor: "0xea139bc421fa5e272bed3db74233b2e02077e0aacf8b855f87961e98f2fb467f", refinery: "0x9746de29f1dd31b2c8460d71e92a7aefa34911130e61f274f37776e598c48bec" } }
 };
 var ud, Gm;
 function hw() {
@@ -2210,17 +2210,13 @@ function hw() {
     reactor: t("OrderReactor"),
     executor: t("Executor"),
     refinery: t("Refinery"),
-    settler: t("Settler"),
     adapter: t("DefaultDexAdapter")
   });
   function n(s, a) {
-    if (!s) return;
+    if (!s || !(a != null && a.trim())) return;
     const { dex: o, ...i } = e["*"] ?? {}, c = e[s];
     if (!c) return;
-    const { dex: l, ...u } = c;
-    if (!(a != null && a.trim()))
-      return { ...i, ...u };
-    const d = l == null ? void 0 : l[a];
+    const { dex: l, ...u } = c, d = l == null ? void 0 : l[a];
     if (d)
       return { ...i, ...u, ...d };
   }
@@ -2495,37 +2491,38 @@ const bw = (e, t, r) => {
   dstMinAmountPerTrade: l = "0",
   triggerAmountPerTrade: u = "0",
   config: d,
-  module: f
+  module: f,
+  feePercentage: m
 }) => {
-  const { nonce: m, epoch: b, deadline: g, freshness: E } = Cb(
+  const { nonce: b, epoch: g, deadline: E, freshness: v } = Cb(
     a,
     s
-  ), v = Math.floor(Date.now() / 1e3).toString(), w = l, A = f === xe.STOP_LOSS ? u : "0", C = f === xe.TAKE_PROFIT ? u : "0", F = {
+  ), w = Math.floor(Date.now() / 1e3).toString(), A = l, C = m * 100, F = f === xe.STOP_LOSS ? u : "0", R = f === xe.TAKE_PROFIT ? u : "0", S = {
     permitted: {
       token: t,
       amount: n
     },
     spender: d.reactor,
-    nonce: m,
-    deadline: g,
+    nonce: b,
+    deadline: E,
     witness: {
       reactor: d.reactor,
       executor: d.executor,
       exchange: {
         adapter: d.adapter,
         ref: d.fee,
-        share: 0,
+        share: C,
         data: "0x"
       },
       swapper: i,
-      nonce: m,
-      start: v,
-      deadline: g,
+      nonce: b,
+      start: w,
+      deadline: E,
       chainid: e,
       exclusivity: 0,
-      epoch: b,
+      epoch: g,
       slippage: o,
-      freshness: E,
+      freshness: v,
       input: {
         token: t,
         amount: c,
@@ -2533,9 +2530,9 @@ const bw = (e, t, r) => {
       },
       output: {
         token: r,
-        limit: z(w || 0).toFixed(),
-        triggerLower: z(A || 0).toFixed(),
-        triggerUpper: z(C || 0).toFixed(),
+        limit: z(A || 0).toFixed(),
+        triggerLower: z(F || 0).toFixed(),
+        triggerUpper: z(R || 0).toFixed(),
         recipient: i
       }
     }
@@ -2547,11 +2544,11 @@ const bw = (e, t, r) => {
       chainId: e,
       verifyingContract: d.repermit
     },
-    order: F,
+    order: S,
     types: iw,
     primaryType: wb
   };
-}, zw = (e) => iu() ? Lw(e) : Nw(e), $w = "1.9.4", Hw = {
+}, zw = (e) => iu() ? Lw(e) : Nw(e), $w = "1.10.0", Hw = {
   version: $w
 }, Gw = 0.7, jw = `https://bi.orbs.network/putes/twap-ui-${Gw}`, Tb = Hw.version;
 let cp = "unknown";
@@ -2801,7 +2798,7 @@ const bt = new qw(), Kw = (e) => {
   var s;
   const t = ((s = e.metadata.chunks) == null ? void 0 : s.filter((a) => a.status === "success").length) || 0, r = e.metadata.expectedChunks || 0, n = z(t).dividedBy(r).toNumber();
   return n >= 0.99 ? 100 : n <= 0 ? 0 : Number((n * 100).toFixed(2));
-}, Zw = (e, t) => e.metadata.status === "completed" || t >= 99 ? gt.Completed : ["pending", "eligible"].includes(e.metadata.status) ? gt.Open : e.metadata.description.toLowerCase() === "cancelled by contract" ? gt.Canceled : gt.Expired, Xw = (e) => {
+}, Zw = (e, t) => e.metadata.status === "completed" || t >= 99 ? gt.Completed : ["pending", "eligible"].includes(e.metadata.status) ? gt.Open : e.metadata.description.toLowerCase() === "cancelled by contract" ? gt.Cancelled : gt.Expired, Xw = (e) => {
   var r;
   return (((r = e.metadata.chunks) == null ? void 0 : r.filter((n) => n.status === "success")) || []).map((n) => ({
     inAmount: n.inAmount,
@@ -3229,7 +3226,7 @@ const p3 = async ({
   if (!t || !e) return 0;
   const r = z(t).dividedBy(e).toNumber();
   return r >= 0.99 ? 100 : r <= 0 ? 0 : Number((r * 100).toFixed(2));
-}, m3 = (e, t, r) => e === 100 ? gt.Completed : r === "CANCELED" ? gt.Canceled : r === "COMPLETED" ? gt.Completed : t > Date.now() ? gt.Open : gt.Expired, h3 = async ({
+}, m3 = (e, t, r) => e === 100 ? gt.Completed : r === "CANCELLED" ? gt.Cancelled : r === "COMPLETED" ? gt.Completed : t > Date.now() ? gt.Open : gt.Expired, h3 = async ({
   signal: e,
   page: t,
   chainId: r,
@@ -3239,7 +3236,7 @@ const p3 = async ({
 }) => (await Promise.all([
   s ? p3({ chainId: r, signal: e, page: t, limit: n, filters: { accounts: [a], configs: s.twapConfig ? [s.twapConfig] : [] } }) : Promise.resolve([]),
   n3({ chainId: r, signal: e, account: a, exchange: s == null ? void 0 : s.adapter })
-]).then(([c, l]) => [...c, ...l])).sort((c, l) => l.createdAt - c.createdAt), b3 = "0.0.102", y3 = {
+]).then(([c, l]) => [...c, ...l])).sort((c, l) => l.createdAt - c.createdAt), b3 = "0.0.104", y3 = {
   version: b3
 };
 var vo = class {
@@ -3828,12 +3825,12 @@ var Ws, cb, Db = (cb = class {
       });
     }, a = () => {
       const C = Bb(this.options, r), R = (() => {
-        const P = {
+        const S = {
           client: M(this, Ks),
           queryKey: this.queryKey,
           meta: this.meta
         };
-        return s(P), P;
+        return s(S), S;
       })();
       return X(this, Ys, !1), this.options.persister ? this.options.persister(
         C,
@@ -4321,7 +4318,7 @@ function eh(e) {
             return Promise.reject();
           if (C == null && A.pages.length)
             return Promise.resolve(A);
-          const P = (() => {
+          const S = (() => {
             const T = {
               client: t.client,
               queryKey: t.queryKey,
@@ -4330,7 +4327,7 @@ function eh(e) {
               meta: t.options.meta
             };
             return E(T), T;
-          })(), h = await v(P), { maxPages: y } = t.options, x = F ? T3 : C3;
+          })(), h = await v(S), { maxPages: y } = t.options, x = F ? T3 : C3;
           return {
             pages: x(A.pages, h, y),
             pageParams: x(A.pageParams, C, y)
@@ -4422,7 +4419,7 @@ var Ji, nn, jt, Js, sn, ss, db, M3 = (db = class extends Db {
     this.execute(this.state.variables);
   }
   async execute(t) {
-    var o, i, c, l, u, d, f, m, b, g, E, v, w, A, C, F, R, P, h, y;
+    var o, i, c, l, u, d, f, m, b, g, E, v, w, A, C, F, R, S, h, y;
     const r = () => {
       Se(this, sn, ss).call(this, { type: "continue" });
     }, n = {
@@ -4512,7 +4509,7 @@ var Ji, nn, jt, Js, sn, ss, db, M3 = (db = class extends Db {
           t,
           this.state.context,
           n
-        )), await ((P = (R = M(this, jt).config).onSettled) == null ? void 0 : P.call(
+        )), await ((S = (R = M(this, jt).config).onSettled) == null ? void 0 : S.call(
           R,
           void 0,
           x,
@@ -9821,12 +9818,12 @@ class Hy extends zy {
     for (let A = 0; A < 16; A++, r += 4)
       rs[A] = t.getUint32(r), ns[A] = t.getUint32(r += 4);
     for (let A = 16; A < 80; A++) {
-      const C = rs[A - 15] | 0, F = ns[A - 15] | 0, R = Ta(C, F, 1) ^ Ta(C, F, 8) ^ xh(C, F, 7), P = Aa(C, F, 1) ^ Aa(C, F, 8) ^ wh(C, F, 7), h = rs[A - 2] | 0, y = ns[A - 2] | 0, x = Ta(h, y, 19) ^ Hc(h, y, 61) ^ xh(h, y, 6), T = Aa(h, y, 19) ^ Gc(h, y, 61) ^ wh(h, y, 6), I = Hv(P, T, ns[A - 7], ns[A - 16]), B = Gv(I, R, x, rs[A - 7], rs[A - 16]);
+      const C = rs[A - 15] | 0, F = ns[A - 15] | 0, R = Ta(C, F, 1) ^ Ta(C, F, 8) ^ xh(C, F, 7), S = Aa(C, F, 1) ^ Aa(C, F, 8) ^ wh(C, F, 7), h = rs[A - 2] | 0, y = ns[A - 2] | 0, x = Ta(h, y, 19) ^ Hc(h, y, 61) ^ xh(h, y, 6), T = Aa(h, y, 19) ^ Gc(h, y, 61) ^ wh(h, y, 6), I = Hv(S, T, ns[A - 7], ns[A - 16]), B = Gv(I, R, x, rs[A - 7], rs[A - 16]);
       rs[A] = B | 0, ns[A] = I | 0;
     }
     let { Ah: n, Al: s, Bh: a, Bl: o, Ch: i, Cl: c, Dh: l, Dl: u, Eh: d, El: f, Fh: m, Fl: b, Gh: g, Gl: E, Hh: v, Hl: w } = this;
     for (let A = 0; A < 80; A++) {
-      const C = Ta(d, f, 14) ^ Ta(d, f, 18) ^ Hc(d, f, 41), F = Aa(d, f, 14) ^ Aa(d, f, 18) ^ Gc(d, f, 41), R = d & m ^ ~d & g, P = f & b ^ ~f & E, h = jv(w, F, P, Ck[A], ns[A]), y = Vv(h, v, C, R, kk[A], rs[A]), x = h | 0, T = Ta(n, s, 28) ^ Hc(n, s, 34) ^ Hc(n, s, 39), I = Aa(n, s, 28) ^ Gc(n, s, 34) ^ Gc(n, s, 39), B = n & a ^ n & i ^ a & i, _ = s & o ^ s & c ^ o & c;
+      const C = Ta(d, f, 14) ^ Ta(d, f, 18) ^ Hc(d, f, 41), F = Aa(d, f, 14) ^ Aa(d, f, 18) ^ Gc(d, f, 41), R = d & m ^ ~d & g, S = f & b ^ ~f & E, h = jv(w, F, S, Ck[A], ns[A]), y = Vv(h, v, C, R, kk[A], rs[A]), x = h | 0, T = Ta(n, s, 28) ^ Hc(n, s, 34) ^ Hc(n, s, 39), I = Aa(n, s, 28) ^ Gc(n, s, 34) ^ Gc(n, s, 39), B = n & a ^ n & i ^ a & i, _ = s & o ^ s & c ^ o & c;
       v = g | 0, w = E | 0, g = m | 0, E = b | 0, m = d | 0, b = f | 0, { h: d, l: f } = kn(l | 0, u | 0, y | 0, x | 0), l = i | 0, u = c | 0, i = a | 0, c = o | 0, a = n | 0, o = s | 0;
       const k = zv(x, I, _);
       n = $v(k, y, T, B), s = k | 0;
@@ -9977,7 +9974,7 @@ async function s0(e, t) {
     });
   })();
   bn(t);
-  const F = (y = (h = a == null ? void 0 : a.formatters) == null ? void 0 : h.transactionRequest) == null ? void 0 : y.format, P = (F || Xr)({
+  const F = (y = (h = a == null ? void 0 : a.formatters) == null ? void 0 : h.transactionRequest) == null ? void 0 : y.format, S = (F || Xr)({
     // Pick out extra data that might exist on the chain's transaction request type.
     ...ga(A, { format: F }),
     account: r ? Je(r) : void 0,
@@ -9999,10 +9996,10 @@ async function s0(e, t) {
   try {
     const B = await e.request({
       method: "eth_fillTransaction",
-      params: [P]
+      params: [S]
     }), k = (((T = (x = a == null ? void 0 : a.formatters) == null ? void 0 : x.transaction) == null ? void 0 : T.format) || xa)(B.tx);
     delete k.blockHash, delete k.blockNumber, delete k.r, delete k.s, delete k.transactionIndex, delete k.v, delete k.yParity, k.data = k.input, k.gas && (k.gas = t.gas ?? k.gas), k.gasPrice && (k.gasPrice = t.gasPrice ?? k.gasPrice), k.maxFeePerBlobGas && (k.maxFeePerBlobGas = t.maxFeePerBlobGas ?? k.maxFeePerBlobGas), k.maxFeePerGas && (k.maxFeePerGas = t.maxFeePerGas ?? k.maxFeePerGas), k.maxPriorityFeePerGas && (k.maxPriorityFeePerGas = t.maxPriorityFeePerGas ?? k.maxPriorityFeePerGas), k.nonce && (k.nonce = t.nonce ?? k.nonce);
-    const S = await (async () => {
+    const P = await (async () => {
       var L, H;
       if (typeof ((L = a == null ? void 0 : a.fees) == null ? void 0 : L.baseFeeMultiplier) == "function") {
         const Z = await se(e, zr, "getBlock")({});
@@ -10014,13 +10011,13 @@ async function s0(e, t) {
       }
       return ((H = a == null ? void 0 : a.fees) == null ? void 0 : H.baseFeeMultiplier) ?? 1.2;
     })();
-    if (S < 1)
+    if (P < 1)
       throw new My();
-    const U = 10 ** (((I = S.toString().split(".")[1]) == null ? void 0 : I.length) ?? 0), N = (L) => L * BigInt(Math.ceil(S * U)) / BigInt(U);
+    const U = 10 ** (((I = P.toString().split(".")[1]) == null ? void 0 : I.length) ?? 0), N = (L) => L * BigInt(Math.ceil(P * U)) / BigInt(U);
     return k.maxFeePerGas && !t.maxFeePerGas && (k.maxFeePerGas = N(k.maxFeePerGas)), k.gasPrice && !t.gasPrice && (k.gasPrice = N(k.gasPrice)), {
       raw: B.raw,
       transaction: {
-        from: P.from,
+        from: S.from,
         ...k
       }
     };
@@ -10062,22 +10059,22 @@ async function dc(e, t) {
   const u = n && Je(n);
   let d = r.nonce;
   if (o.includes("nonce") && typeof d > "u" && u && a) {
-    const P = await l();
+    const S = await l();
     d = await a.consume({
       address: u.address,
-      chainId: P,
+      chainId: S,
       client: e
     });
   }
   i != null && i.fn && ((C = i.runAt) != null && C.includes("beforeFillTransaction")) && (r = await i.fn({ ...r, chain: s }, {
     phase: "beforeFillTransaction"
   }), d ?? (d = r.nonce));
-  const m = ((o.includes("blobVersionedHashes") || o.includes("sidecars")) && r.kzg && r.blobs || gd.get(e.uid) === !1 || !["fees", "gas"].some((h) => o.includes(h)) ? !1 : !!(o.includes("chainId") && typeof r.chainId != "number" || o.includes("nonce") && typeof d != "number" || o.includes("fees") && typeof r.gasPrice != "bigint" && (typeof r.maxFeePerGas != "bigint" || typeof r.maxPriorityFeePerGas != "bigint") || o.includes("gas") && typeof r.gas != "bigint")) ? await se(e, s0, "fillTransaction")({ ...r, nonce: d }).then((P) => {
-    const { chainId: h, from: y, gas: x, gasPrice: T, nonce: I, maxFeePerBlobGas: B, maxFeePerGas: _, maxPriorityFeePerGas: k, type: S, ...O } = P.transaction;
+  const m = ((o.includes("blobVersionedHashes") || o.includes("sidecars")) && r.kzg && r.blobs || gd.get(e.uid) === !1 || !["fees", "gas"].some((h) => o.includes(h)) ? !1 : !!(o.includes("chainId") && typeof r.chainId != "number" || o.includes("nonce") && typeof d != "number" || o.includes("fees") && typeof r.gasPrice != "bigint" && (typeof r.maxFeePerGas != "bigint" || typeof r.maxPriorityFeePerGas != "bigint") || o.includes("gas") && typeof r.gas != "bigint")) ? await se(e, s0, "fillTransaction")({ ...r, nonce: d }).then((S) => {
+    const { chainId: h, from: y, gas: x, gasPrice: T, nonce: I, maxFeePerBlobGas: B, maxFeePerGas: _, maxPriorityFeePerGas: k, type: P, ...O } = S.transaction;
     return gd.set(e.uid, !0), {
       ...r,
       ...y ? { from: y } : {},
-      ...S ? { type: S } : {},
+      ...P ? { type: P } : {},
       ...typeof h < "u" ? { chainId: h } : {},
       ...typeof x < "u" ? { gas: x } : {},
       ...typeof T < "u" ? { gasPrice: T } : {},
@@ -10087,9 +10084,9 @@ async function dc(e, t) {
       ...typeof k < "u" ? { maxPriorityFeePerGas: k } : {},
       ..."nonceKey" in O && typeof O.nonceKey < "u" ? { nonceKey: O.nonceKey } : {}
     };
-  }).catch((P) => {
+  }).catch((S) => {
     var x;
-    const h = P;
+    const h = S;
     return h.name !== "TransactionExecutionError" || ((x = h.walk) == null ? void 0 : x.call(h, (T) => {
       const I = T;
       return I.name === "MethodNotFoundRpcError" || I.name === "MethodNotSupportedRpcError";
@@ -10112,18 +10109,18 @@ async function dc(e, t) {
     address: u.address,
     blockTag: "pending"
   })), (o.includes("blobVersionedHashes") || o.includes("sidecars")) && b && E) {
-    const P = Jf({ blobs: b, kzg: E });
+    const S = Jf({ blobs: b, kzg: E });
     if (o.includes("blobVersionedHashes")) {
       const h = Vy({
-        commitments: P,
+        commitments: S,
         to: "hex"
       });
       r.blobVersionedHashes = h;
     }
     if (o.includes("sidecars")) {
-      const h = e0({ blobs: b, commitments: P, kzg: E }), y = Zy({
+      const h = e0({ blobs: b, commitments: S, kzg: E }), y = Zy({
         blobs: b,
-        commitments: P,
+        commitments: S,
         proofs: h,
         to: "hex"
       });
@@ -10134,18 +10131,18 @@ async function dc(e, t) {
     try {
       r.type = n0(r);
     } catch {
-      let P = _h.get(e.uid);
-      if (typeof P > "u") {
+      let S = _h.get(e.uid);
+      if (typeof S > "u") {
         const h = await A();
-        P = typeof (h == null ? void 0 : h.baseFeePerGas) == "bigint", _h.set(e.uid, P);
+        S = typeof (h == null ? void 0 : h.baseFeePerGas) == "bigint", _h.set(e.uid, S);
       }
-      r.type = P ? "eip1559" : "legacy";
+      r.type = S ? "eip1559" : "legacy";
     }
   if (o.includes("fees"))
     if (r.type !== "legacy" && r.type !== "eip2930") {
       if (typeof r.maxFeePerGas > "u" || typeof r.maxPriorityFeePerGas > "u") {
-        const P = await A(), { maxFeePerGas: h, maxPriorityFeePerGas: y } = await Hp(e, {
-          block: P,
+        const S = await A(), { maxFeePerGas: h, maxPriorityFeePerGas: y } = await Hp(e, {
+          block: S,
           chain: s,
           request: r
         });
@@ -10159,8 +10156,8 @@ async function dc(e, t) {
       if (typeof r.maxFeePerGas < "u" || typeof r.maxPriorityFeePerGas < "u")
         throw new Kf();
       if (typeof r.gasPrice > "u") {
-        const P = await A(), { gasPrice: h } = await Hp(e, {
-          block: P,
+        const S = await A(), { gasPrice: h } = await Hp(e, {
+          block: S,
           chain: s,
           request: r,
           type: "legacy"
@@ -10194,7 +10191,7 @@ async function o0(e, t) {
         }).catch(() => {
           throw new $("`to` is required. Could not infer from `authorizationList`");
         });
-    })(), { accessList: u, authorizationList: d, blobs: f, blobVersionedHashes: m, blockNumber: b, blockTag: g, data: E, gas: v, gasPrice: w, maxFeePerBlobGas: A, maxFeePerGas: C, maxPriorityFeePerGas: F, nonce: R, value: P, stateOverride: h, ...y } = n ? await dc(e, {
+    })(), { accessList: u, authorizationList: d, blobs: f, blobVersionedHashes: m, blockNumber: b, blockTag: g, data: E, gas: v, gasPrice: w, maxFeePerBlobGas: A, maxFeePerGas: C, maxPriorityFeePerGas: F, nonce: R, value: S, stateOverride: h, ...y } = n ? await dc(e, {
       ...t,
       parameters: a,
       to: l
@@ -10218,7 +10215,7 @@ async function o0(e, t) {
       maxPriorityFeePerGas: F,
       nonce: R,
       to: l,
-      value: P
+      value: S
     }, "estimateGas");
     return BigInt(await e.request({
       method: "eth_estimateGas",
@@ -11843,8 +11840,8 @@ function wg({ fn: e, id: t, shouldSplitBatch: r, wait: n = 0, sort: s }) {
   };
 }
 async function Au(e, t) {
-  var B, _, k, S;
-  const { account: r = e.account, authorizationList: n, batch: s = !!((B = e.batch) != null && B.multicall), blockNumber: a, blockTag: o = e.experimental_blockTag ?? "latest", accessList: i, blobs: c, blockOverrides: l, code: u, data: d, factory: f, factoryData: m, gas: b, gasPrice: g, maxFeePerBlobGas: E, maxFeePerGas: v, maxPriorityFeePerGas: w, nonce: A, to: C, value: F, stateOverride: R, ...P } = t, h = r ? Je(r) : void 0;
+  var B, _, k, P;
+  const { account: r = e.account, authorizationList: n, batch: s = !!((B = e.batch) != null && B.multicall), blockNumber: a, blockTag: o = e.experimental_blockTag ?? "latest", accessList: i, blobs: c, blockOverrides: l, code: u, data: d, factory: f, factoryData: m, gas: b, gasPrice: g, maxFeePerBlobGas: E, maxFeePerGas: v, maxPriorityFeePerGas: w, nonce: A, to: C, value: F, stateOverride: R, ...S } = t, h = r ? Je(r) : void 0;
   if (u && (f || m))
     throw new $("Cannot provide both `code` & `factory`/`factoryData` as parameters.");
   if (u && C)
@@ -11860,9 +11857,9 @@ async function Au(e, t) {
   }) : d;
   try {
     bn(t);
-    const U = (typeof a == "bigint" ? V(a) : void 0) || o, N = l ? fg(l) : void 0, L = qf(R), H = (S = (k = (_ = e.chain) == null ? void 0 : _.formatters) == null ? void 0 : k.transactionRequest) == null ? void 0 : S.format, fe = (H || Xr)({
+    const U = (typeof a == "bigint" ? V(a) : void 0) || o, N = l ? fg(l) : void 0, L = qf(R), H = (P = (k = (_ = e.chain) == null ? void 0 : _.formatters) == null ? void 0 : k.transactionRequest) == null ? void 0 : P.format, fe = (H || Xr)({
       // Pick out extra data that might exist on the chain's transaction request type.
-      ...ga(P, { format: H }),
+      ...ga(S, { format: H }),
       accessList: i,
       account: h,
       authorizationList: n,
@@ -11900,7 +11897,7 @@ async function Au(e, t) {
     });
     return ie === "0x" ? { data: void 0 } : { data: ie };
   } catch (O) {
-    const U = C7(O), { offchainLookup: N, offchainLookupSignature: L } = await import("./ccip-AR1zTcOj.js");
+    const U = C7(O), { offchainLookup: N, offchainLookupSignature: L } = await import("./ccip-C5v4Xtc9.js");
     if (e.ccipRead !== !1 && (U == null ? void 0 : U.slice(0, 10)) === L && C)
       return { data: await N(e, { data: U, to: C }) };
     throw T && (U == null ? void 0 : U.slice(0, 10)) === "0x101bb98d" ? new JE({ factory: f }) : m0(O, {
@@ -12184,7 +12181,7 @@ function U7(e, t) {
       i !== void 0 && (A = i - 1n);
       let C, F = !1;
       const R = So(async () => {
-        var P;
+        var S;
         if (!F) {
           try {
             C = await se(e, Cy, "createContractEventFilter")({
@@ -12224,7 +12221,7 @@ function U7(e, t) {
             for (const y of h)
               w.onLogs([y]);
         } catch (h) {
-          C && h instanceof Es && (F = !1), (P = w.onError) == null || P.call(w, h);
+          C && h instanceof Es && (F = !1), (S = w.onError) == null || S.call(w, h);
         }
       }, {
         emitOnBegin: !0,
@@ -12258,7 +12255,7 @@ function U7(e, t) {
           abi: r,
           eventName: o,
           args: s
-        }) : [], { unsubscribe: P } = await F.subscribe({
+        }) : [], { unsubscribe: S } = await F.subscribe({
           params: ["logs", { address: n, topics: R }],
           onData(h) {
             var x;
@@ -12295,7 +12292,7 @@ function U7(e, t) {
             (y = C.onError) == null || y.call(C, h);
           }
         });
-        A = P, w || A();
+        A = S, w || A();
       } catch (F) {
         c == null || c(F);
       }
@@ -12358,9 +12355,9 @@ async function Iu(e, t) {
         });
     })();
     if ((v == null ? void 0 : v.type) === "json-rpc" || v === null) {
-      let P;
-      n !== null && (P = await se(e, Ps, "getChainId")({}), b0({
-        currentChainId: P,
+      let S;
+      n !== null && (S = await se(e, Ps, "getChainId")({}), b0({
+        currentChainId: S,
         chain: n
       }));
       const h = (C = (A = (w = e.chain) == null ? void 0 : w.formatters) == null ? void 0 : A.transactionRequest) == null ? void 0 : C.format, x = (h || Xr)({
@@ -12370,7 +12367,7 @@ async function Iu(e, t) {
         account: v,
         authorizationList: a,
         blobs: o,
-        chainId: P,
+        chainId: S,
         data: i,
         gas: c,
         gasPrice: l,
@@ -12396,14 +12393,14 @@ async function Iu(e, t) {
             method: "wallet_sendTransaction",
             params: [x]
           }, { retryCount: 0 }).then((k) => (Td.set(e.uid, !0), k)).catch((k) => {
-            const S = k;
-            throw S.name === "MethodNotFoundRpcError" || S.name === "MethodNotSupportedRpcError" ? (Td.set(e.uid, !1), _) : S;
+            const P = k;
+            throw P.name === "MethodNotFoundRpcError" || P.name === "MethodNotSupportedRpcError" ? (Td.set(e.uid, !1), _) : P;
           });
         throw _;
       }
     }
     if ((v == null ? void 0 : v.type) === "local") {
-      const P = await se(e, dc, "prepareTransactionRequest")({
+      const S = await se(e, dc, "prepareTransactionRequest")({
         account: v,
         accessList: s,
         authorizationList: a,
@@ -12422,7 +12419,7 @@ async function Iu(e, t) {
         value: g,
         ...E,
         to: R
-      }), h = (F = n == null ? void 0 : n.serializers) == null ? void 0 : F.transaction, y = await v.signTransaction(P, {
+      }), h = (F = n == null ? void 0 : n.serializers) == null ? void 0 : F.transaction, y = await v.signTransaction(S, {
         serializer: h
       });
       return await se(e, y0, "sendRawTransaction")({
@@ -12733,8 +12730,8 @@ function Ig(e) {
   function w(A) {
     return (C) => {
       const F = C(A);
-      for (const P in v)
-        delete F[P];
+      for (const S in v)
+        delete F[S];
       const R = { ...A, ...F };
       return Object.assign(R, { extend: w(R) });
     };
@@ -13237,7 +13234,7 @@ async function Dg(e, t) {
   const { account: r = e.account, blockNumber: n, blockTag: s = "latest", blobs: a, data: o, gas: i, gasPrice: c, maxFeePerBlobGas: l, maxFeePerGas: u, maxPriorityFeePerGas: d, to: f, value: m, ...b } = t, g = r ? Je(r) : void 0;
   try {
     bn(t);
-    const C = (typeof n == "bigint" ? V(n) : void 0) || s, F = (w = (v = (E = e.chain) == null ? void 0 : E.formatters) == null ? void 0 : v.transactionRequest) == null ? void 0 : w.format, P = (F || Xr)({
+    const C = (typeof n == "bigint" ? V(n) : void 0) || s, F = (w = (v = (E = e.chain) == null ? void 0 : E.formatters) == null ? void 0 : v.transactionRequest) == null ? void 0 : w.format, S = (F || Xr)({
       // Pick out extra data that might exist on the chain's transaction request type.
       ...ga(b, { format: F }),
       account: g,
@@ -13252,7 +13249,7 @@ async function Dg(e, t) {
       value: m
     }, "createAccessList"), h = await e.request({
       method: "eth_createAccessList",
-      params: [P, C]
+      params: [S, C]
     });
     return {
       accessList: h.accessList,
@@ -15667,8 +15664,8 @@ function Z9(e) {
     return { x: F, y: R };
   });
   function o(A) {
-    const { a: C, b: F } = t, R = r.sqr(A), P = r.mul(R, A);
-    return r.add(r.add(P, r.mul(A, C)), F);
+    const { a: C, b: F } = t, R = r.sqr(A), S = r.mul(R, A);
+    return r.add(r.add(S, r.mul(A, C)), F);
   }
   function i(A, C) {
     const F = r.sqr(C), R = o(A);
@@ -15683,7 +15680,7 @@ function Z9(e) {
     return d0(A, Ft, t.n);
   }
   function d(A) {
-    const { allowedPrivateKeyLengths: C, nByteLength: F, wrapPrivateKey: R, n: P } = t;
+    const { allowedPrivateKeyLengths: C, nByteLength: F, wrapPrivateKey: R, n: S } = t;
     if (C && typeof A != "bigint") {
       if (fc(A) && (A = Oi(A)), typeof A != "string" || !C.includes(A.length))
         throw new Error("invalid private key");
@@ -15695,19 +15692,19 @@ function Z9(e) {
     } catch {
       throw new Error("invalid private key, expected hex or " + F + " bytes, got " + typeof A);
     }
-    return R && (h = er(h, P)), Ha("private key", h, Ft, P), h;
+    return R && (h = er(h, S)), Ha("private key", h, Ft, S), h;
   }
   function f(A) {
     if (!(A instanceof g))
       throw new Error("ProjectivePoint expected");
   }
   const m = Lh((A, C) => {
-    const { px: F, py: R, pz: P } = A;
-    if (r.eql(P, r.ONE))
+    const { px: F, py: R, pz: S } = A;
+    if (r.eql(S, r.ONE))
       return { x: F, y: R };
     const h = A.is0();
-    C == null && (C = h ? r.ONE : r.inv(P));
-    const y = r.mul(F, C), x = r.mul(R, C), T = r.mul(P, C);
+    C == null && (C = h ? r.ONE : r.inv(S));
+    const y = r.mul(F, C), x = r.mul(R, C), T = r.mul(S, C);
     if (h)
       return { x: r.ZERO, y: r.ZERO };
     if (!r.eql(T, r.ONE))
@@ -15746,8 +15743,8 @@ function Z9(e) {
         throw new Error("invalid affine point");
       if (C instanceof g)
         throw new Error("projective point not allowed");
-      const P = (h) => r.eql(h, r.ZERO);
-      return P(F) && P(R) ? g.ZERO : new g(F, R, r.ONE);
+      const S = (h) => r.eql(h, r.ZERO);
+      return S(F) && S(R) ? g.ZERO : new g(F, R, r.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -15763,7 +15760,7 @@ function Z9(e) {
      */
     static normalizeZ(C) {
       const F = a6(r, C.map((R) => R.pz));
-      return C.map((R, P) => R.toAffine(F[P])).map(g.fromAffine);
+      return C.map((R, S) => R.toAffine(F[S])).map(g.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -15800,7 +15797,7 @@ function Z9(e) {
      */
     equals(C) {
       f(C);
-      const { px: F, py: R, pz: P } = this, { px: h, py: y, pz: x } = C, T = r.eql(r.mul(F, x), r.mul(h, P)), I = r.eql(r.mul(R, x), r.mul(y, P));
+      const { px: F, py: R, pz: S } = this, { px: h, py: y, pz: x } = C, T = r.eql(r.mul(F, x), r.mul(h, S)), I = r.eql(r.mul(R, x), r.mul(y, S));
       return T && I;
     }
     /**
@@ -15814,9 +15811,9 @@ function Z9(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: C, b: F } = t, R = r.mul(F, Dd), { px: P, py: h, pz: y } = this;
-      let x = r.ZERO, T = r.ZERO, I = r.ZERO, B = r.mul(P, P), _ = r.mul(h, h), k = r.mul(y, y), S = r.mul(P, h);
-      return S = r.add(S, S), I = r.mul(P, y), I = r.add(I, I), x = r.mul(C, I), T = r.mul(R, k), T = r.add(x, T), x = r.sub(_, T), T = r.add(_, T), T = r.mul(x, T), x = r.mul(S, x), I = r.mul(R, I), k = r.mul(C, k), S = r.sub(B, k), S = r.mul(C, S), S = r.add(S, I), I = r.add(B, B), B = r.add(I, B), B = r.add(B, k), B = r.mul(B, S), T = r.add(T, B), k = r.mul(h, y), k = r.add(k, k), B = r.mul(k, S), x = r.sub(x, B), I = r.mul(k, _), I = r.add(I, I), I = r.add(I, I), new g(x, T, I);
+      const { a: C, b: F } = t, R = r.mul(F, Dd), { px: S, py: h, pz: y } = this;
+      let x = r.ZERO, T = r.ZERO, I = r.ZERO, B = r.mul(S, S), _ = r.mul(h, h), k = r.mul(y, y), P = r.mul(S, h);
+      return P = r.add(P, P), I = r.mul(S, y), I = r.add(I, I), x = r.mul(C, I), T = r.mul(R, k), T = r.add(x, T), x = r.sub(_, T), T = r.add(_, T), T = r.mul(x, T), x = r.mul(P, x), I = r.mul(R, I), k = r.mul(C, k), P = r.sub(B, k), P = r.mul(C, P), P = r.add(P, I), I = r.add(B, B), B = r.add(I, B), B = r.add(B, k), B = r.mul(B, P), T = r.add(T, B), k = r.mul(h, y), k = r.add(k, k), B = r.mul(k, P), x = r.sub(x, B), I = r.mul(k, _), I = r.add(I, I), I = r.add(I, I), new g(x, T, I);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -15824,13 +15821,13 @@ function Z9(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(C) {
       f(C);
-      const { px: F, py: R, pz: P } = this, { px: h, py: y, pz: x } = C;
+      const { px: F, py: R, pz: S } = this, { px: h, py: y, pz: x } = C;
       let T = r.ZERO, I = r.ZERO, B = r.ZERO;
       const _ = t.a, k = r.mul(t.b, Dd);
-      let S = r.mul(F, h), O = r.mul(R, y), U = r.mul(P, x), N = r.add(F, R), L = r.add(h, y);
-      N = r.mul(N, L), L = r.add(S, O), N = r.sub(N, L), L = r.add(F, P);
+      let P = r.mul(F, h), O = r.mul(R, y), U = r.mul(S, x), N = r.add(F, R), L = r.add(h, y);
+      N = r.mul(N, L), L = r.add(P, O), N = r.sub(N, L), L = r.add(F, S);
       let H = r.add(h, x);
-      return L = r.mul(L, H), H = r.add(S, U), L = r.sub(L, H), H = r.add(R, P), T = r.add(y, x), H = r.mul(H, T), T = r.add(O, U), H = r.sub(H, T), B = r.mul(_, L), T = r.mul(k, U), B = r.add(T, B), T = r.sub(O, B), B = r.add(O, B), I = r.mul(T, B), O = r.add(S, S), O = r.add(O, S), U = r.mul(_, U), L = r.mul(k, L), O = r.add(O, U), U = r.sub(S, U), U = r.mul(_, U), L = r.add(L, U), S = r.mul(O, L), I = r.add(I, S), S = r.mul(H, L), T = r.mul(N, T), T = r.sub(T, S), S = r.mul(N, O), B = r.mul(H, B), B = r.add(B, S), new g(T, I, B);
+      return L = r.mul(L, H), H = r.add(P, U), L = r.sub(L, H), H = r.add(R, S), T = r.add(y, x), H = r.mul(H, T), T = r.add(O, U), H = r.sub(H, T), B = r.mul(_, L), T = r.mul(k, U), B = r.add(T, B), T = r.sub(O, B), B = r.add(O, B), I = r.mul(T, B), O = r.add(P, P), O = r.add(O, P), U = r.mul(_, U), L = r.mul(k, L), O = r.add(O, U), U = r.sub(P, U), U = r.mul(_, U), L = r.add(L, U), P = r.mul(O, L), I = r.add(I, P), P = r.mul(H, L), T = r.mul(N, T), T = r.sub(T, P), P = r.mul(N, O), B = r.mul(H, B), B = r.add(B, P), new g(T, I, B);
     }
     subtract(C) {
       return this.add(C.negate());
@@ -15849,14 +15846,14 @@ function Z9(e) {
     multiplyUnsafe(C) {
       const { endo: F, n: R } = t;
       Ha("scalar", C, _n, R);
-      const P = g.ZERO;
+      const S = g.ZERO;
       if (C === _n)
-        return P;
+        return S;
       if (this.is0() || C === Ft)
         return this;
       if (!F || w.hasPrecomputes(this))
         return w.wNAFCachedUnsafe(this, C, g.normalizeZ);
-      let { k1neg: h, k1: y, k2neg: x, k2: T } = F.splitScalar(C), I = P, B = P, _ = this;
+      let { k1neg: h, k1: y, k2neg: x, k2: T } = F.splitScalar(C), I = S, B = S, _ = this;
       for (; y > _n || T > _n; )
         y & Ft && (I = I.add(_)), T & Ft && (B = B.add(_)), _ = _.double(), y >>= Ft, T >>= Ft;
       return h && (I = I.negate()), x && (B = B.negate()), B = new g(r.mul(B.px, F.beta), B.py, B.pz), I.add(B);
@@ -15873,16 +15870,16 @@ function Z9(e) {
     multiply(C) {
       const { endo: F, n: R } = t;
       Ha("scalar", C, Ft, R);
-      let P, h;
+      let S, h;
       if (F) {
         const { k1neg: y, k1: x, k2neg: T, k2: I } = F.splitScalar(C);
-        let { p: B, f: _ } = this.wNAF(x), { p: k, f: S } = this.wNAF(I);
-        B = w.constTimeNegate(y, B), k = w.constTimeNegate(T, k), k = new g(r.mul(k.px, F.beta), k.py, k.pz), P = B.add(k), h = _.add(S);
+        let { p: B, f: _ } = this.wNAF(x), { p: k, f: P } = this.wNAF(I);
+        B = w.constTimeNegate(y, B), k = w.constTimeNegate(T, k), k = new g(r.mul(k.px, F.beta), k.py, k.pz), S = B.add(k), h = _.add(P);
       } else {
         const { p: y, f: x } = this.wNAF(C);
-        P = y, h = x;
+        S = y, h = x;
       }
-      return g.normalizeZ([P, h])[0];
+      return g.normalizeZ([S, h])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -15891,7 +15888,7 @@ function Z9(e) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(C, F, R) {
-      const P = g.BASE, h = (x, T) => T === _n || T === Ft || !x.equals(P) ? x.multiplyUnsafe(T) : x.multiply(T), y = h(this, F).add(h(C, R));
+      const S = g.BASE, h = (x, T) => T === _n || T === Ft || !x.equals(S) ? x.multiplyUnsafe(T) : x.multiply(T), y = h(this, F).add(h(C, R));
       return y.is0() ? void 0 : y;
     }
     // Converts Projective point to affine (x, y) coordinates.
@@ -15951,13 +15948,13 @@ function Q9(e) {
   }
   const { ProjectivePoint: u, normPrivateKeyToScalar: d, weierstrassEquation: f, isWithinCurveOrder: m } = Z9({
     ...t,
-    toBytes(k, S, O) {
-      const U = S.toAffine(), N = r.toBytes(U.x), L = Vl;
-      return Ui("isCompressed", O), O ? L(Uint8Array.from([S.hasEvenY() ? 2 : 3]), N) : L(Uint8Array.from([4]), N, r.toBytes(U.y));
+    toBytes(k, P, O) {
+      const U = P.toAffine(), N = r.toBytes(U.x), L = Vl;
+      return Ui("isCompressed", O), O ? L(Uint8Array.from([P.hasEvenY() ? 2 : 3]), N) : L(Uint8Array.from([4]), N, r.toBytes(U.y));
     },
     fromBytes(k) {
-      const S = k.length, O = k[0], U = k.subarray(1);
-      if (S === o && (O === 2 || O === 3)) {
+      const P = k.length, O = k[0], U = k.subarray(1);
+      if (P === o && (O === 2 || O === 3)) {
         const N = ta(U);
         if (!d0(N, Ft, r.ORDER))
           throw new Error("Point is not on curve");
@@ -15971,36 +15968,36 @@ function Q9(e) {
         }
         const Z = (H & Ft) === Ft;
         return (O & 1) === 1 !== Z && (H = r.neg(H)), { x: N, y: H };
-      } else if (S === i && O === 4) {
+      } else if (P === i && O === 4) {
         const N = r.fromBytes(U.subarray(0, r.BYTES)), L = r.fromBytes(U.subarray(r.BYTES, 2 * r.BYTES));
         return { x: N, y: L };
       } else {
         const N = o, L = i;
-        throw new Error("invalid Point, expected length of " + N + ", or uncompressed " + L + ", got " + S);
+        throw new Error("invalid Point, expected length of " + N + ", or uncompressed " + L + ", got " + P);
       }
     }
   });
   function b(k) {
-    const S = n >> Ft;
-    return k > S;
+    const P = n >> Ft;
+    return k > P;
   }
   function g(k) {
     return b(k) ? c(-k) : k;
   }
-  const E = (k, S, O) => ta(k.slice(S, O));
+  const E = (k, P, O) => ta(k.slice(P, O));
   class v {
-    constructor(S, O, U) {
-      Ha("r", S, Ft, n), Ha("s", O, Ft, n), this.r = S, this.s = O, U != null && (this.recovery = U), Object.freeze(this);
+    constructor(P, O, U) {
+      Ha("r", P, Ft, n), Ha("s", O, Ft, n), this.r = P, this.s = O, U != null && (this.recovery = U), Object.freeze(this);
     }
     // pair (bytes of r, bytes of s)
-    static fromCompact(S) {
+    static fromCompact(P) {
       const O = s;
-      return S = Er("compactSignature", S, O * 2), new v(E(S, 0, O), E(S, O, 2 * O));
+      return P = Er("compactSignature", P, O * 2), new v(E(P, 0, O), E(P, O, 2 * O));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
-    static fromDER(S) {
-      const { r: O, s: U } = Bn.toSig(Er("DER", S));
+    static fromDER(P) {
+      const { r: O, s: U } = Bn.toSig(Er("DER", P));
       return new v(O, U);
     }
     /**
@@ -16009,11 +16006,11 @@ function Q9(e) {
      */
     assertValidity() {
     }
-    addRecoveryBit(S) {
-      return new v(this.r, this.s, S);
+    addRecoveryBit(P) {
+      return new v(this.r, this.s, P);
     }
-    recoverPublicKey(S) {
-      const { r: O, s: U, recovery: N } = this, L = P(Er("msgHash", S));
+    recoverPublicKey(P) {
+      const { r: O, s: U, recovery: N } = this, L = S(Er("msgHash", P));
       if (N == null || ![0, 1, 2, 3].includes(N))
         throw new Error("recovery id invalid");
       const H = N === 2 || N === 3 ? O + t.n : O;
@@ -16043,8 +16040,8 @@ function Q9(e) {
       return jl(this.toCompactHex());
     }
     toCompactHex() {
-      const S = s;
-      return Od(this.r, S) + Od(this.s, S);
+      const P = s;
+      return Od(this.r, P) + Od(this.s, P);
     }
   }
   const w = {
@@ -16072,12 +16069,12 @@ function Q9(e) {
      * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
      * fast.multiply(privKey); // much faster ECDH now
      */
-    precompute(k = 8, S = u.BASE) {
-      return S._setWindowSize(k), S.multiply(BigInt(3)), S;
+    precompute(k = 8, P = u.BASE) {
+      return P._setWindowSize(k), P.multiply(BigInt(3)), P;
     }
   };
-  function A(k, S = !0) {
-    return u.fromPrivateKey(k).toRawBytes(S);
+  function A(k, P = !0) {
+    return u.fromPrivateKey(k).toRawBytes(P);
   }
   function C(k) {
     if (typeof k == "bigint")
@@ -16088,31 +16085,31 @@ function Q9(e) {
     if (!(t.allowedPrivateKeyLengths || s === N))
       return O === N || O === L;
   }
-  function F(k, S, O = !0) {
+  function F(k, P, O = !0) {
     if (C(k) === !0)
       throw new Error("first arg must be private key");
-    if (C(S) === !1)
+    if (C(P) === !1)
       throw new Error("second arg must be public key");
-    return u.fromHex(S).multiply(d(k)).toRawBytes(O);
+    return u.fromHex(P).multiply(d(k)).toRawBytes(O);
   }
   const R = t.bits2int || function(k) {
     if (k.length > 8192)
       throw new Error("input is too large");
-    const S = ta(k), O = k.length * 8 - a;
-    return O > 0 ? S >> BigInt(O) : S;
-  }, P = t.bits2int_modN || function(k) {
+    const P = ta(k), O = k.length * 8 - a;
+    return O > 0 ? P >> BigInt(O) : P;
+  }, S = t.bits2int_modN || function(k) {
     return c(R(k));
   }, h = vu(a);
   function y(k) {
     return Ha("num < 2^" + a, k, _n, h), mc(k, s);
   }
-  function x(k, S, O = T) {
+  function x(k, P, O = T) {
     if (["recovered", "canonical"].some((ve) => ve in O))
       throw new Error("sign() legacy options not supported");
     const { hash: U, randomBytes: N } = t;
     let { lowS: L, prehash: H, extraEntropy: Z } = O;
     L == null && (L = !0), k = Er("msgHash", k), a1(O), H && (k = Er("prehashed msgHash", U(k)));
-    const fe = P(k), ye = d(S), ie = [y(ye), y(fe)];
+    const fe = S(k), ye = d(P), ie = [y(ye), y(fe)];
     if (Z != null && Z !== !1) {
       const ve = Z === !0 ? N(r.BYTES) : Z;
       ie.push(Er("extraEntropy", ve));
@@ -16134,15 +16131,15 @@ function Q9(e) {
     return { seed: pe, k2sig: K };
   }
   const T = { lowS: t.lowS, prehash: !1 }, I = { lowS: t.lowS, prehash: !1 };
-  function B(k, S, O = T) {
-    const { seed: U, k2sig: N } = x(k, S, O), L = t;
+  function B(k, P, O = T) {
+    const { seed: U, k2sig: N } = x(k, P, O), L = t;
     return Nk(L.hash.outputLen, L.nByteLength, L.hmac)(U, N);
   }
   u.BASE._setWindowSize(8);
-  function _(k, S, O, U = I) {
+  function _(k, P, O, U = I) {
     var ge;
     const N = k;
-    S = Er("msgHash", S), O = Er("publicKey", O);
+    P = Er("msgHash", P), O = Er("publicKey", O);
     const { lowS: L, prehash: H, format: Z } = U;
     if (a1(U), "strict" in U)
       throw new Error("options.strict was renamed to lowS");
@@ -16168,8 +16165,8 @@ function Q9(e) {
     }
     if (!ie || L && ie.hasHighS())
       return !1;
-    H && (S = t.hash(S));
-    const { r: Ue, s: K } = ie, ve = P(S), De = l(K), He = c(ve * De), at = c(Ue * De), Ae = (ge = u.BASE.multiplyAndAddUnsafe(pe, He, at)) == null ? void 0 : ge.toAffine();
+    H && (P = t.hash(P));
+    const { r: Ue, s: K } = ie, ve = S(P), De = l(K), He = c(ve * De), at = c(Ue * De), Ae = (ge = u.BASE.multiplyAndAddUnsafe(pe, He, at)) == null ? void 0 : ge.toAffine();
     return Ae ? c(Ae.x) === Ue : !1;
   }
   return {
@@ -16608,9 +16605,9 @@ async function FT(e, t) {
   })(), m = [[]];
   let b = 0, g = 0;
   for (let A = 0; A < l.length; A++) {
-    const { abi: C, address: F, args: R, functionName: P } = l[A];
+    const { abi: C, address: F, args: R, functionName: S } = l[A];
     try {
-      const h = fr({ abi: C, args: R, functionName: P });
+      const h = fr({ abi: C, args: R, functionName: S });
       g += (h.length - 2) / 2, // Check if batching is enabled.
       u > 0 && // Check if the current size of the batch exceeds the size limit.
       g > u && // Check if the current chunk is not already empty.
@@ -16628,7 +16625,7 @@ async function FT(e, t) {
         address: F,
         args: R,
         docsPath: "/docs/contract/multicall",
-        functionName: P,
+        functionName: S,
         sender: r
       });
       if (!s)
@@ -16670,16 +16667,16 @@ async function FT(e, t) {
     }
     const F = C.value;
     for (let R = 0; R < F.length; R++) {
-      const { returnData: P, success: h } = F[R], { callData: y } = m[A][R], { abi: x, address: T, functionName: I, args: B } = l[v.length];
+      const { returnData: S, success: h } = F[R], { callData: y } = m[A][R], { abi: x, address: T, functionName: I, args: B } = l[v.length];
       try {
         if (y === "0x")
           throw new sc();
         if (!h)
-          throw new hu({ data: P });
+          throw new hu({ data: S });
         const _ = wa({
           abi: x,
           args: B,
-          data: P,
+          data: S,
           functionName: I
         });
         v.push(s ? { result: _, status: "success" } : _);
@@ -16732,13 +16729,13 @@ async function nf(e, t) {
       ...Yf(f),
       calls: f.calls.map((b, g) => {
         var x, T;
-        const { abi: E, args: v, functionName: w, to: A } = s[m].calls[g], C = ((x = b.error) == null ? void 0 : x.data) ?? b.returnData, F = BigInt(b.gasUsed), R = (T = b.logs) == null ? void 0 : T.map((I) => pn(I)), P = b.status === "0x1" ? "success" : "failure", h = E && P === "success" && C !== "0x" ? wa({
+        const { abi: E, args: v, functionName: w, to: A } = s[m].calls[g], C = ((x = b.error) == null ? void 0 : x.data) ?? b.returnData, F = BigInt(b.gasUsed), R = (T = b.logs) == null ? void 0 : T.map((I) => pn(I)), S = b.status === "0x1" ? "success" : "failure", h = E && S === "success" && C !== "0x" ? wa({
           abi: E,
           data: C,
           functionName: w
         }) : null, y = (() => {
           var B;
-          if (P === "success")
+          if (S === "success")
             return;
           let I;
           if (((B = b.error) == null ? void 0 : B.data) === "0x" ? I = new sc() : b.error && (I = new hu(b.error)), !!I)
@@ -16753,8 +16750,8 @@ async function nf(e, t) {
           data: C,
           gasUsed: F,
           logs: R,
-          status: P,
-          ...P === "success" ? {
+          status: S,
+          ...S === "success" ? {
             result: h
           } : {
             error: y
@@ -17129,12 +17126,12 @@ async function $T(e, t) {
     ],
     traceTransfers: i,
     validation: c
-  }), m = o ? f[2] : f[0], [b, g, , E, v, w, A, C] = o ? f : [], { calls: F, ...R } = m, P = F.slice(0, -1) ?? [], h = (b == null ? void 0 : b.calls) ?? [], y = (g == null ? void 0 : g.calls) ?? [], x = [...h, ...y].map((U) => U.status === "success" ? Le(U.data) : null), T = (E == null ? void 0 : E.calls) ?? [], I = (v == null ? void 0 : v.calls) ?? [], B = [...T, ...I].map((U) => U.status === "success" ? Le(U.data) : null), _ = ((w == null ? void 0 : w.calls) ?? []).map((U) => U.status === "success" ? U.result : null), k = ((C == null ? void 0 : C.calls) ?? []).map((U) => U.status === "success" ? U.result : null), S = ((A == null ? void 0 : A.calls) ?? []).map((U) => U.status === "success" ? U.result : null), O = [];
+  }), m = o ? f[2] : f[0], [b, g, , E, v, w, A, C] = o ? f : [], { calls: F, ...R } = m, S = F.slice(0, -1) ?? [], h = (b == null ? void 0 : b.calls) ?? [], y = (g == null ? void 0 : g.calls) ?? [], x = [...h, ...y].map((U) => U.status === "success" ? Le(U.data) : null), T = (E == null ? void 0 : E.calls) ?? [], I = (v == null ? void 0 : v.calls) ?? [], B = [...T, ...I].map((U) => U.status === "success" ? Le(U.data) : null), _ = ((w == null ? void 0 : w.calls) ?? []).map((U) => U.status === "success" ? U.result : null), k = ((C == null ? void 0 : C.calls) ?? []).map((U) => U.status === "success" ? U.result : null), P = ((A == null ? void 0 : A.calls) ?? []).map((U) => U.status === "success" ? U.result : null), O = [];
   for (const [U, N] of B.entries()) {
     const L = x[U];
     if (typeof N != "bigint" || typeof L != "bigint")
       continue;
-    const H = _[U - 1], Z = k[U - 1], fe = S[U - 1], ye = U === 0 ? {
+    const H = _[U - 1], Z = k[U - 1], fe = P[U - 1], ye = U === 0 ? {
       address: LT,
       decimals: 18,
       symbol: "ETH"
@@ -17155,7 +17152,7 @@ async function $T(e, t) {
   return {
     assetChanges: O,
     block: R,
-    results: P
+    results: S
   };
 }
 const v6 = "0x6492649264926492649264926492649264926492649264926492649264926492";
@@ -17453,7 +17450,7 @@ async function k6(e, t) {
       poll: !0,
       pollingInterval: u,
       async onBlockNumber(R) {
-        const P = (y) => {
+        const S = (y) => {
           clearTimeout(C), E == null || E(), y(), g == null || g();
         };
         let h = R;
@@ -17462,7 +17459,7 @@ async function k6(e, t) {
             if (m) {
               if (n > 1 && (!m.blockNumber || h - m.blockNumber + 1n < n))
                 return;
-              P(() => F.resolve(m));
+              S(() => F.resolve(m));
               return;
             }
             if (r && !d && (b = !0, await ql(async () => {
@@ -17472,7 +17469,7 @@ async function k6(e, t) {
               retryCount: o
             }), b = !1), m = await se(e, Fl, "getTransactionReceipt")({ hash: s }), n > 1 && (!m.blockNumber || h - m.blockNumber + 1n < n))
               return;
-            P(() => F.resolve(m));
+            S(() => F.resolve(m));
           } catch (y) {
             if (y instanceof Py || y instanceof Iy) {
               if (!d) {
@@ -17496,7 +17493,7 @@ async function k6(e, t) {
                 }), n > 1 && (!m.blockNumber || h - m.blockNumber + 1n < n)))
                   return;
                 let I = "replaced";
-                T.to === f.to && T.value === f.value && T.input === f.input ? I = "repriced" : T.from === T.to && T.value === 0n && (I = "cancelled"), P(() => {
+                T.to === f.to && T.value === f.value && T.input === f.input ? I = "repriced" : T.from === T.to && T.value === 0n && (I = "cancelled"), S(() => {
                   var B;
                   (B = F.onReplaced) == null || B.call(F, {
                     reason: I,
@@ -17506,10 +17503,10 @@ async function k6(e, t) {
                   }), F.resolve(m);
                 });
               } catch (x) {
-                P(() => F.reject(x));
+                S(() => F.reject(x));
               }
             } else
-              P(() => F.reject(y));
+              S(() => F.reject(y));
           }
       }
     });
@@ -17634,29 +17631,29 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
           return;
         }
         try {
-          let P;
+          let S;
           if (A)
-            P = await se(e, Su, "getFilterChanges")({ filter: A });
+            S = await se(e, Su, "getFilterChanges")({ filter: A });
           else {
             const h = await se(e, yc, "getBlockNumber")({});
-            w && w !== h ? P = await se(e, c0, "getLogs")({
+            w && w !== h ? S = await se(e, c0, "getLogs")({
               address: t,
               args: r,
               event: s,
               events: a,
               fromBlock: w + 1n,
               toBlock: h
-            }) : P = [], w = h;
+            }) : S = [], w = h;
           }
-          if (P.length === 0)
+          if (S.length === 0)
             return;
           if (n)
-            v.onLogs(P);
+            v.onLogs(S);
           else
-            for (const h of P)
+            for (const h of S)
               v.onLogs([h]);
-        } catch (P) {
-          A && P instanceof Es && (C = !1), (R = v.onError) == null || R.call(v, P);
+        } catch (S) {
+          A && S instanceof Es && (C = !1), (R = v.onError) == null || R.call(v, S);
         }
       }, {
         emitOnBegin: !0,
@@ -17672,15 +17669,15 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
       try {
         const w = (() => {
           if (e.transport.type === "fallback") {
-            const R = e.transport.transports.find((P) => P.config.type === "webSocket" || P.config.type === "ipc");
+            const R = e.transport.transports.find((S) => S.config.type === "webSocket" || S.config.type === "ipc");
             return R ? R.value : e.transport;
           }
           return e.transport;
         })(), A = a ?? (s ? [s] : void 0);
         let C = [];
-        A && (C = [A.flatMap((P) => ic({
-          abi: [P],
-          eventName: P.name,
+        A && (C = [A.flatMap((S) => ic({
+          abi: [S],
+          eventName: S.name,
           args: r
         }))], s && (C = C[0]));
         const { unsubscribe: F } = await w.subscribe({
@@ -17689,14 +17686,14 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
             var h;
             if (!E)
               return;
-            const P = R.result;
+            const S = R.result;
             try {
               const { eventName: y, args: x } = Gl({
                 abi: A ?? [],
-                data: P.data,
-                topics: P.topics,
+                data: S.data,
+                topics: S.topics,
                 strict: m
-              }), T = pn(P, { args: x, eventName: y });
+              }), T = pn(S, { args: x, eventName: y });
               c([T]);
             } catch (y) {
               let x, T;
@@ -17705,7 +17702,7 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
                   return;
                 x = y.abiItem.name, T = (h = y.abiItem.inputs) == null ? void 0 : h.some((B) => !("name" in B && B.name));
               }
-              const I = pn(P, {
+              const I = pn(S, {
                 args: T ? [] : {},
                 eventName: x
               });
@@ -17995,7 +17992,7 @@ async function h4(e, t) {
 }
 const Md = new ko(128);
 async function T6(e, t) {
-  var F, R, P, h;
+  var F, R, S, h;
   const { account: r = e.account, chain: n = e.chain, accessList: s, authorizationList: a, blobs: o, data: i, gas: c, gasPrice: l, maxFeePerBlobGas: u, maxFeePerGas: d, maxPriorityFeePerGas: f, nonce: m, pollingInterval: b, throwOnReceiptRevert: g, type: E, value: v, ...w } = t, A = t.timeout ?? Math.max(((n == null ? void 0 : n.blockTime) ?? 0) * 3, 5e3);
   if (typeof r > "u")
     throw new Zn({
@@ -18020,7 +18017,7 @@ async function T6(e, t) {
         currentChainId: x,
         chain: n
       }));
-      const T = (P = (R = (F = e.chain) == null ? void 0 : F.formatters) == null ? void 0 : R.transactionRequest) == null ? void 0 : P.format, B = (T || Xr)({
+      const T = (S = (R = (F = e.chain) == null ? void 0 : F.formatters) == null ? void 0 : R.transactionRequest) == null ? void 0 : S.format, B = (T || Xr)({
         // Pick out extra data that might exist on the chain's transaction request type.
         ...ga(w, { format: T }),
         accessList: s,
@@ -18038,7 +18035,7 @@ async function T6(e, t) {
         to: y,
         type: E,
         value: v
-      }, "sendTransaction"), _ = Md.get(e.uid), k = _ ? "wallet_sendTransaction" : "eth_sendTransaction", S = await (async () => {
+      }, "sendTransaction"), _ = Md.get(e.uid), k = _ ? "wallet_sendTransaction" : "eth_sendTransaction", P = await (async () => {
         try {
           return await e.request({
             method: k,
@@ -18060,7 +18057,7 @@ async function T6(e, t) {
         }
       })(), O = await se(e, k6, "waitForTransactionReceipt")({
         checkReplacement: !1,
-        hash: S,
+        hash: P,
         pollingInterval: b,
         timeout: A
       });
@@ -18322,7 +18319,7 @@ function P4(e, t = {}) {
       methods: o,
       name: i,
       async request({ method: F, params: R }) {
-        const P = { method: F, params: R }, { schedule: h } = wg({
+        const S = { method: F, params: R }, { schedule: h } = wg({
           id: A,
           wait: E,
           shouldSplitBatch(I) {
@@ -18336,12 +18333,12 @@ function P4(e, t = {}) {
           await C.request({
             body: I
           })
-        ], [{ error: x, result: T }] = await y(P);
+        ], [{ error: x, result: T }] = await y(S);
         if (d)
           return { error: x, result: T };
         if (x)
           throw new Vf({
-            body: P,
+            body: S,
             error: x,
             url: A
           });
@@ -26269,7 +26266,7 @@ async function gU(e, t) {
   try {
     const { accessList: i, blockNumber: c, blockTag: l, data: u, gas: d, gasPrice: f, maxFeePerGas: m, maxPriorityFeePerGas: b, nonce: g, to: E, value: v, ...w } = t, C = (typeof c == "bigint" ? V(c) : void 0) || l;
     bn(t);
-    const F = (o = (a = (s = e.chain) == null ? void 0 : s.formatters) == null ? void 0 : a.transactionRequest) == null ? void 0 : o.format, P = (F || Xr)({
+    const F = (o = (a = (s = e.chain) == null ? void 0 : s.formatters) == null ? void 0 : a.transactionRequest) == null ? void 0 : o.format, S = (F || Xr)({
       // Pick out extra data that might exist on the chain's transaction request type.
       ...ga(w, { format: F }),
       account: n,
@@ -26284,7 +26281,7 @@ async function gU(e, t) {
       value: v
     }, "estimateGas"), { baseFeePerGas: h, gasLimit: y, priorityFeePerGas: x } = await e.request({
       method: "linea_estimateGas",
-      params: C ? [P, C] : [P]
+      params: C ? [S, C] : [S]
     });
     return {
       baseFeePerGas: BigInt(h),
@@ -33045,8 +33042,8 @@ function qR(e) {
   if (Mr(a) && a !== "0x" && (A.gas = BigInt(a)), Mr(l) && (A.nonce = l === "0x" ? 0n : BigInt(l)), Mr(s) && s !== "0x" && (A.maxFeePerGas = BigInt(s)), Mr(n) && n !== "0x" && (A.maxPriorityFeePerGas = BigInt(n)), Mr(c) && (A.nonceKey = c === "0x" ? 0n : BigInt(c)), Mr(u) && u !== "0x" && (A.validBefore = Number(u)), Mr(d) && d !== "0x" && (A.validAfter = Number(d)), Mr(f) && f !== "0x" && (A.feeToken = f), o && o !== "0x") {
     const F = o;
     A.calls = F.map((R) => {
-      const [P, h, y] = R, x = {};
-      return P && P !== "0x" && (x.to = P), h && h !== "0x" && (x.value = BigInt(h)), y && y !== "0x" && (x.data = y), x;
+      const [S, h, y] = R, x = {};
+      return S && S !== "0x" && (x.to = S), h && h !== "0x" && (x.value = BigInt(h)), y && y !== "0x" && (x.data = y), x;
     });
   }
   (i == null ? void 0 : i.length) !== 0 && i !== "0x" && (A.accessList = RR(i)), (b == null ? void 0 : b.length) !== 0 && b !== "0x" && (A.authorizationList = ER(b)), m !== "0x" && m !== void 0 && (m === "0x00" || Zl(m) ? A.feePayerSignature = null : A.feePayerSignature = oT(m)), v && (A.keyAuthorization = PR(v));
@@ -39320,8 +39317,8 @@ function xj(e, t, r) {
     return H && (Z = 2), Z && (O = O.substring(Z), U -= Z, N -= Z), { value: O, start: U, end: N, hasNegation: L };
   }, w = v(e, u, d), A = w.hasNegation;
   n = w, e = n.value, u = n.start, d = n.end;
-  var C = v(t.lastValue, c.start, c.end), F = C.start, R = C.end, P = C.value, h = e.substring(u, d);
-  e.length && P.length && (F > P.length - o.length || R < a.length) && !(h && o.startsWith(h)) && (e = P);
+  var C = v(t.lastValue, c.start, c.end), F = C.start, R = C.end, S = C.value, h = e.substring(u, d);
+  e.length && S.length && (F > S.length - o.length || R < a.length) && !(h && o.startsWith(h)) && (e = S);
   var y = 0;
   e.startsWith(a) ? y += a.length : u < a.length && (y = u), e = e.substring(y), d -= y;
   var x = e.length, T = e.length - o.length;
@@ -39330,8 +39327,8 @@ function xj(e, t, r) {
   e = e.replace(new RegExp(Z2(b), "g"), function(O, U) {
     return U === I ? "." : "";
   });
-  var B = ym(e, s), _ = B.beforeDecimal, k = B.afterDecimal, S = B.addNegation;
-  return l.end - l.start < c.end - c.start && _ === "" && g && !parseFloat(k) && (e = S ? "-" : ""), e;
+  var B = ym(e, s), _ = B.beforeDecimal, k = B.afterDecimal, P = B.addNegation;
+  return l.end - l.start < c.end - c.start && _ === "" && g && !parseFloat(k) && (e = P ? "-" : ""), e;
 }
 function wj(e, t) {
   var r = t.prefix;
@@ -39369,28 +39366,28 @@ function Ej(e) {
   a === void 0 && (a = xf);
   var o = e.thousandSeparator, i = e.decimalScale, c = e.fixedDecimalScale, l = e.prefix;
   l === void 0 && (l = "");
-  var u = e.defaultValue, d = e.value, f = e.valueIsNumericString, m = e.onValueChange, b = oj(e, ["decimalSeparator", "allowedDecimalSeparators", "thousandsGroupStyle", "suffix", "allowNegative", "allowLeadingZeros", "onKeyDown", "onBlur", "thousandSeparator", "decimalScale", "fixedDecimalScale", "prefix", "defaultValue", "value", "valueIsNumericString", "onValueChange"]), g = Zu(e), E = g.decimalSeparator, v = g.allowedDecimalSeparators, w = function(S) {
-    return U1(S, e);
-  }, A = function(S, O) {
-    return xj(S, O, e);
+  var u = e.defaultValue, d = e.value, f = e.valueIsNumericString, m = e.onValueChange, b = oj(e, ["decimalSeparator", "allowedDecimalSeparators", "thousandsGroupStyle", "suffix", "allowNegative", "allowLeadingZeros", "onKeyDown", "onBlur", "thousandSeparator", "decimalScale", "fixedDecimalScale", "prefix", "defaultValue", "value", "valueIsNumericString", "onValueChange"]), g = Zu(e), E = g.decimalSeparator, v = g.allowedDecimalSeparators, w = function(P) {
+    return U1(P, e);
+  }, A = function(P, O) {
+    return xj(P, O, e);
   }, C = qa(d) ? u : d, F = f ?? gj(C, l, t);
   qa(d) ? qa(u) || (F = F || typeof u == "number") : F = F || typeof d == "number";
-  var R = function(S) {
-    return Y2(S) ? S : (typeof S == "number" && (S = Q2(S)), F && typeof i == "number" ? F1(S, i, !!c) : S);
-  }, P = hj(R(d), R(u), !!F, w, A, m), h = P[0], y = h.numAsString, x = h.formattedValue, T = P[1], I = function(S) {
-    var O = S.target, U = S.key, N = O.selectionStart, L = O.selectionEnd, H = O.value;
+  var R = function(P) {
+    return Y2(P) ? P : (typeof P == "number" && (P = Q2(P)), F && typeof i == "number" ? F1(P, i, !!c) : P);
+  }, S = hj(R(d), R(u), !!F, w, A, m), h = S[0], y = h.numAsString, x = h.formattedValue, T = S[1], I = function(P) {
+    var O = P.target, U = P.key, N = O.selectionStart, L = O.selectionEnd, H = O.value;
     if (H === void 0 && (H = ""), (U === "Backspace" || U === "Delete") && L < l.length) {
-      S.preventDefault();
+      P.preventDefault();
       return;
     }
     if (N !== L) {
-      s(S);
+      s(P);
       return;
     }
-    U === "Backspace" && H[0] === "-" && N === l.length + 1 && r && ei(O, 1), i && c && (U === "Backspace" && H[N - 1] === E ? (ei(O, N - 1), S.preventDefault()) : U === "Delete" && H[N] === E && S.preventDefault()), v != null && v.includes(U) && H[N] === E && ei(O, N + 1);
+    U === "Backspace" && H[0] === "-" && N === l.length + 1 && r && ei(O, 1), i && c && (U === "Backspace" && H[N - 1] === E ? (ei(O, N - 1), P.preventDefault()) : U === "Delete" && H[N] === E && P.preventDefault()), v != null && v.includes(U) && H[N] === E && ei(O, N + 1);
     var Z = o === !0 ? "," : o;
-    U === "Backspace" && H[N - 1] === Z && ei(O, N - 1), U === "Delete" && H[N] === Z && ei(O, N + 1), s(S);
-  }, B = function(S) {
+    U === "Backspace" && H[N - 1] === Z && ei(O, N - 1), U === "Delete" && H[N] === Z && ei(O, N + 1), s(P);
+  }, B = function(P) {
     var O = y;
     if (O.match(/\d/g) || (O = ""), n || (O = pj(O)), c && i && (O = F1(O, i, c)), O !== y) {
       var U = U1(O, e);
@@ -39399,15 +39396,15 @@ function Ej(e) {
         value: O,
         floatValue: parseFloat(O)
       }, {
-        event: S,
+        event: P,
         source: gf.event
       });
     }
-    a(S);
-  }, _ = function(S) {
-    return S === E ? !0 : K2(S);
-  }, k = function(S) {
-    var O = S.currentValue, U = S.lastValue, N = S.formattedValue, L = S.currentValueIndex, H = S.formattedValueIndex, Z = O[L], fe = N[H], ye = fj(U, O), ie = ye.to, pe = function(Ue) {
+    a(P);
+  }, _ = function(P) {
+    return P === E ? !0 : K2(P);
+  }, k = function(P) {
+    var O = P.currentValue, U = P.lastValue, N = P.formattedValue, L = P.currentValueIndex, H = P.formattedValueIndex, Z = O[L], fe = N[H], ye = fj(U, O), ie = ye.to, pe = function(Ue) {
       return A(Ue).indexOf(".") + l.length;
     };
     return d === 0 && c && i && O[ie.start] === E && pe(O) < L && pe(N) > H ? !1 : L >= ie.start && L < ie.end && v && v.includes(Z) && fe === E ? !0 : Z === fe;
@@ -39420,8 +39417,8 @@ function Ej(e) {
     onValueChange: T,
     format: w,
     removeFormatting: A,
-    getCaretBoundary: function(S) {
-      return wj(S, e);
+    getCaretBoundary: function(P) {
+      return wj(P, e);
     },
     onKeyDown: I,
     onBlur: B
@@ -39475,7 +39472,7 @@ const Sj = (e, t) => Q(() => F4(e == null ? void 0 : e.toString(), t), [e, t]),
     suffix: n
   });
   return o ? o(e || "") : (c = i.value) == null ? void 0 : c.toString();
-}, Pj = "This is the date and time marking the end of the period which you have selected for your order to be executed.", Ij = "The number of input tokens that will be removed from your balance and swapped for the output token in each individual trade.", Bj = "The total number of individual trades that will be scheduled as part of your order. Note that in limit orders, not all trades that are scheduled will be executed.", Fj = " This is the minimum number of tokens that may be received. NOTE: This minimum only refers to executed trades. Some trades may not be executed if the limit price is higher than the available market prices and your order may only be partially filled.", Uj = "Trades will only execute if the available market price is better than the limit price, potentially resulting in partial fills or orders remaining unfilled upon expiration.", Oj = "This is the time period during which the order will be active. Please note that orders may be completed earlier than this time, partially filled, or remain unfilled based on the specified parameters.", Dj = "The estimated time that will elapse between each trade in your order. Note that as this time includes an allowance of two minutes for bidder auction and block settlement, which cannot be predicted exactly, actual time may vary.", _j = "The price at which the order will be executed. If the market price is higher than the trigger price, the order will be executed at the market price.", Mj = "Place order", Rj = "Enter an amount", Nj = "Limit price is required", Lj = "Insufficient Balance", zj = "Trade interval", $j = "Expiration", Hj = "Limit Price", Gj = "Final execution price", jj = "Market price", Vj = "From", Wj = "To", qj = "Open", Kj = "Completed", Yj = "Expired", Zj = "Canceled", Xj = "Cancel Order", Qj = "Min. received per trade", Jj = "Trigger Price per trade", eV = "Max. trades amount is {maxChunks}", tV = "Min. trades amount is {minChunks}", rV = "Min. trade size is ${minTradeSize}", nV = "All", sV = "Min. trade interval is {fillDelay}", aV = "Max. trade interval is {fillDelay}", oV = "Recipient", iV = "Each individual trade in this order will be filled at the current market price at the time of execution.", cV = "Limit orders may not execute when the token's price is equal or close to the limit price, due to gas and standard swap fees.", lV = "Limit", uV = "Max. expiry is {duration}", dV = "Min. expiry is {duration}", pV = "Expiry", fV = "Individual trade size", mV = "No. of trades", hV = "Avg. execution price", bV = "TWAP-market", yV = "TWAP-limit", gV = "Stop-loss", xV = "Stop-loss market", wV = "Stop-loss limit", vV = "Take-profit", EV = "Min. received", kV = "No {status} orders", CV = "No liquidity for this pair", TV = "Execution summary", AV = "Order info", SV = "Order fills", PV = "Transaction hash", IV = "No fills yet", BV = "Back to {type} order", FV = "Amount out", UV = "Amount received", OV = "Index", DV = "Timestamp", _V = "Tx hash", MV = "Wrap {symbol}", RV = "Approve {symbol}", NV = "Create {name} order", LV = "Amount received", zV = "Created at", $V = "Amount out", HV = "Status", GV = "Progress", jV = "minutes", VV = "days", WV = "Every", qV = "Over", KV = "The trigger price at which your stop-loss order will be activated.", YV = "The trigger price at which your take-profit order will be activated.", ZV = "Trigger Price", XV = "Trigger price must be less than market price", QV = "Trigger price must be greater than market price", JV = "Limit price must be less than trigger price", eW = "Trigger Price", tW = "Trade Price", rW = " In extreme market movements, slippage may occur and the executed price of the market order may be worse than the specified trigger price.", nW = "The stop loss order will execute at the specified limit price or better, once the stop price is triggered.", sW = "This is the time period during which the order will be active. Please note that orders may be completed earlier than this time, or remain unfilled based on the specified parameters.", aW = "Trigger price is required", oW = "ID", iW = "Fees {value}", cW = "Version", lW = "Max. trade size is {maxOrderSize} USD", uW = "View on explorer", dW = "Proceed in wallet", pW = "Note: {symbol} was wrapped to {wSymbol}", fW = "{name} order placed", mW = {
+}, Pj = "This is the date and time marking the end of the period which you have selected for your order to be executed.", Ij = "The number of input tokens that will be removed from your balance and swapped for the output token in each individual trade.", Bj = "The total number of individual trades that will be scheduled as part of your order. Note that in limit orders, not all trades that are scheduled will be executed.", Fj = " This is the minimum number of tokens that may be received. NOTE: This minimum only refers to executed trades. Some trades may not be executed if the limit price is higher than the available market prices and your order may only be partially filled.", Uj = "Trades will only execute if the available market price is better than the limit price, potentially resulting in partial fills or orders remaining unfilled upon expiration.", Oj = "This is the time period during which the order will be active. Please note that orders may be completed earlier than this time, partially filled, or remain unfilled based on the specified parameters.", Dj = "The estimated time that will elapse between each trade in your order. Note that as this time includes an allowance of two minutes for bidder auction and block settlement, which cannot be predicted exactly, actual time may vary.", _j = "The price at which the order will be executed. If the market price is higher than the trigger price, the order will be executed at the market price.", Mj = "Place order", Rj = "Enter an amount", Nj = "Limit price is required", Lj = "Insufficient Balance", zj = "Trade interval", $j = "Expiration", Hj = "Limit Price", Gj = "Final execution price", jj = "Market price", Vj = "From", Wj = "To", qj = "Open", Kj = "Completed", Yj = "Expired", Zj = "Cancelled", Xj = "Cancel Order", Qj = "Min. received per trade", Jj = "Trigger Price per trade", eV = "Max. trades amount is {maxChunks}", tV = "Min. trades amount is {minChunks}", rV = "Min. trade size is ${minTradeSize}", nV = "All", sV = "Min. trade interval is {fillDelay}", aV = "Max. trade interval is {fillDelay}", oV = "Recipient", iV = "Each individual trade in this order will be filled at the current market price at the time of execution.", cV = "Limit orders may not execute when the token's price is equal or close to the limit price, due to gas and standard swap fees.", lV = "Limit", uV = "Max. expiry is {duration}", dV = "Min. expiry is {duration}", pV = "Expiry", fV = "Individual trade size", mV = "No. of trades", hV = "Avg. execution price", bV = "TWAP-market", yV = "TWAP-limit", gV = "Stop-loss", xV = "Stop-loss market", wV = "Stop-loss limit", vV = "Take-profit", EV = "Min. received", kV = "No {status} orders", CV = "No liquidity for this pair", TV = "Execution summary", AV = "Order info", SV = "Order fills", PV = "Transaction hash", IV = "No fills yet", BV = "Back to {type} order", FV = "Amount out", UV = "Amount received", OV = "Index", DV = "Timestamp", _V = "Tx hash", MV = "Wrap {symbol}", RV = "Approve {symbol}", NV = "Create {name} order", LV = "Amount received", zV = "Created at", $V = "Amount out", HV = "Status", GV = "Progress", jV = "minutes", VV = "days", WV = "Every", qV = "Over", KV = "The trigger price at which your stop-loss order will be activated.", YV = "The trigger price at which your take-profit order will be activated.", ZV = "Trigger Price", XV = "Trigger price must be less than market price", QV = "Trigger price must be greater than market price", JV = "Limit price must be less than trigger price", eW = "Trigger Price", tW = "Trade Price", rW = " In extreme market movements, slippage may occur and the executed price of the market order may be worse than the specified trigger price.", nW = "The stop loss order will execute at the specified limit price or better, once the stop price is triggered.", sW = "This is the time period during which the order will be active. Please note that orders may be completed earlier than this time, or remain unfilled based on the specified parameters.", aW = "Trigger price is required", oW = "ID", iW = "Fees {value}", cW = "Version", lW = "Max. trade size is {maxOrderSize} USD", uW = "View on explorer", dW = "Proceed in wallet", pW = "Note: {symbol} was wrapped to {wSymbol}", fW = "{name} order placed", mW = {
   expirationTooltip: Pj,
   tradeSizeTooltip: Ij,
   totalTradesTooltip: Bj,
@@ -39498,7 +39495,7 @@ const Sj = (e, t) => Q(() => F4(e == null ? void 0 : e.toString(), t), [e, t]),
   Open: qj,
   Completed: Kj,
   Expired: Yj,
-  Canceled: Zj,
+  Cancelled: Zj,
   cancelOrder: Xj,
   minReceivedPerTrade: Qj,
   triggerPricePerChunk: Jj,
@@ -39954,7 +39951,7 @@ const gm = () => {
   });
 }, ix = (e = [], t = Ar.All) => {
   let r = e ?? [];
-  return t === Ar.Open && (r = r.filter((n) => n.status === gt.Open)), t === Ar.Completed && (r = r.filter((n) => n.status === gt.Completed)), t === Ar.Canceled && (r = r.filter((n) => n.status === gt.Canceled)), t === Ar.Expired && (r = r.filter((n) => n.status === gt.Expired)), r.sort((n, s) => s.createdAt - n.createdAt);
+  return t === Ar.Open && (r = r.filter((n) => n.status === gt.Open)), t === Ar.Completed && (r = r.filter((n) => n.status === gt.Completed)), t === Ar.Cancelled && (r = r.filter((n) => n.status === gt.Cancelled)), t === Ar.Expired && (r = r.filter((n) => n.status === gt.Expired)), r.sort((n, s) => s.createdAt - n.createdAt);
 }, cx = () => {
   const e = J(
     (r) => r.state.orderHistoryStatusFilter
@@ -40000,8 +39997,8 @@ const gm = () => {
           return e("Completed");
         case Ar.Expired:
           return e("Expired");
-        case Ar.Canceled:
-          return e("Canceled");
+        case Ar.Cancelled:
+          return e("Cancelled");
         default:
           return e("allOrders");
       }
@@ -40083,7 +40080,7 @@ const gm = () => {
           throw new Error("orders not found");
         if (t.every((a) => {
           const o = n.find((i) => i.id === a);
-          return (o == null ? void 0 : o.status) === gt.Canceled;
+          return (o == null ? void 0 : o.status) === gt.Cancelled;
         }))
           break;
         await new Promise((a) => setTimeout(a, 1e3));
@@ -40891,31 +40888,31 @@ const sq = {
   offsetWidth: "width"
 }, xn = Ve(
   ([{ log: e }, { recalcInProgress: t }]) => {
-    const r = Re(), n = Re(), s = Lt(n, 0), a = Re(), o = Re(), i = q(0), c = q([]), l = q(void 0), u = q(void 0), d = q(void 0), f = q(void 0), m = q((P, h) => Ts(P, sq[h])), b = q(void 0), g = q(0), E = YW(), v = Lt(
+    const r = Re(), n = Re(), s = Lt(n, 0), a = Re(), o = Re(), i = q(0), c = q([]), l = q(void 0), u = q(void 0), d = q(void 0), f = q(void 0), m = q((S, h) => Ts(S, sq[h])), b = q(void 0), g = q(0), E = YW(), v = Lt(
       j(r, Pe(c, e, g), ln(eq, E), tt()),
       E
     ), w = Lt(
       j(
         c,
         tt(),
-        ln((P, h) => ({ current: h, prev: P.current }), {
+        ln((S, h) => ({ current: h, prev: S.current }), {
           current: [],
           prev: []
         }),
-        re(({ prev: P }) => P)
+        re(({ prev: S }) => S)
       ),
       []
     );
     ce(
       j(
         c,
-        he((P) => P.length > 0),
+        he((S) => S.length > 0),
         Pe(v, g),
-        re(([P, h, y]) => {
-          const x = P.reduce((T, I, B) => cr(T, I, Wi(I, h.offsetTree, y) || B), Ka());
+        re(([S, h, y]) => {
+          const x = S.reduce((T, I, B) => cr(T, I, Wi(I, h.offsetTree, y) || B), Ka());
           return {
             ...h,
-            groupIndices: P,
+            groupIndices: S,
             groupOffsetTree: x
           };
         })
@@ -40925,12 +40922,12 @@ const sq = {
       j(
         n,
         Pe(v),
-        he(([P, { lastIndex: h }]) => P < h),
-        re(([P, { lastIndex: h, lastSize: y }]) => [
+        he(([S, { lastIndex: h }]) => S < h),
+        re(([S, { lastIndex: h, lastSize: y }]) => [
           {
             endIndex: h,
             size: y,
-            startIndex: P
+            startIndex: S
           }
         ])
       ),
@@ -40939,32 +40936,32 @@ const sq = {
     const A = Lt(
       j(
         l,
-        re((P) => P === void 0)
+        re((S) => S === void 0)
       ),
       !0
     );
     ce(
       j(
         u,
-        he((P) => P !== void 0 && Ze(ct(v).sizeTree)),
-        re((P) => {
+        he((S) => S !== void 0 && Ze(ct(v).sizeTree)),
+        re((S) => {
           const h = ct(d), y = ct(c).length > 0;
           return h ? y ? [
             { endIndex: 0, size: h, startIndex: 0 },
-            { endIndex: 1, size: P, startIndex: 1 }
-          ] : [] : [{ endIndex: 0, size: P, startIndex: 0 }];
+            { endIndex: 1, size: S, startIndex: 1 }
+          ] : [] : [{ endIndex: 0, size: S, startIndex: 0 }];
         })
       ),
       r
     ), ce(
       j(
         f,
-        he((P) => P !== void 0 && P.length > 0 && Ze(ct(v).sizeTree)),
-        re((P) => {
+        he((S) => S !== void 0 && S.length > 0 && Ze(ct(v).sizeTree)),
+        re((S) => {
           const h = [];
-          let y = P[0], x = 0;
-          for (let T = 1; T < P.length; T++) {
-            const I = P[T];
+          let y = S[0], x = 0;
+          for (let T = 1; T < S.length; T++) {
+            const I = S[T];
             I !== y && (h.push({
               endIndex: T - 1,
               size: y,
@@ -40972,7 +40969,7 @@ const sq = {
             }), y = I, x = T);
           }
           return h.push({
-            endIndex: P.length - 1,
+            endIndex: S.length - 1,
             size: y,
             startIndex: x
           }), h;
@@ -40983,11 +40980,11 @@ const sq = {
       j(
         c,
         Pe(d, u),
-        he(([, P, h]) => P !== void 0 && h !== void 0),
-        re(([P, h, y]) => {
+        he(([, S, h]) => S !== void 0 && h !== void 0),
+        re(([S, h, y]) => {
           const x = [];
-          for (let T = 0; T < P.length; T++) {
-            const I = P[T], B = P[T + 1];
+          for (let T = 0; T < S.length; T++) {
+            const I = S[T], B = S[T + 1];
             x.push({
               startIndex: I,
               endIndex: I,
@@ -41008,35 +41005,35 @@ const sq = {
         r,
         Pe(v),
         ln(
-          ({ sizes: P }, [h, y]) => ({
-            changed: y !== P,
+          ({ sizes: S }, [h, y]) => ({
+            changed: y !== S,
             sizes: y
           }),
           { changed: !1, sizes: E }
         ),
-        re((P) => P.changed)
+        re((S) => S.changed)
       )
     );
     qe(
       j(
         i,
         ln(
-          (P, h) => ({ diff: P.prev - h, prev: h }),
+          (S, h) => ({ diff: S.prev - h, prev: h }),
           { diff: 0, prev: 0 }
         ),
-        re((P) => P.diff)
+        re((S) => S.diff)
       ),
-      (P) => {
+      (S) => {
         const { groupIndices: h } = ct(v);
-        if (P > 0)
-          Te(t, !0), Te(a, P + N1(P, h));
-        else if (P < 0) {
+        if (S > 0)
+          Te(t, !0), Te(a, S + N1(S, h));
+        else if (S < 0) {
           const y = ct(w);
-          y.length > 0 && (P -= N1(-P, y)), Te(o, P);
+          y.length > 0 && (S -= N1(-S, y)), Te(o, S);
         }
       }
-    ), qe(j(i, Pe(e)), ([P, h]) => {
-      P < 0 && h(
+    ), qe(j(i, Pe(e)), ([S, h]) => {
+      S < 0 && h(
         "`firstItemIndex` prop should not be set to less than zero. If you don't know the total count, just use a very high value",
         { firstItemIndex: i },
         sr.ERROR
@@ -41047,42 +41044,42 @@ const sq = {
       j(
         a,
         Pe(v),
-        re(([P, h]) => {
+        re(([S, h]) => {
           const y = h.groupIndices.length > 0, x = [], T = h.lastSize;
           if (y) {
             const I = ji(h.sizeTree, 0);
             let B = 0, _ = 0;
-            for (; B < P; ) {
-              const S = h.groupIndices[_], O = h.groupIndices.length === _ + 1 ? 1 / 0 : h.groupIndices[_ + 1] - S - 1;
+            for (; B < S; ) {
+              const P = h.groupIndices[_], O = h.groupIndices.length === _ + 1 ? 1 / 0 : h.groupIndices[_ + 1] - P - 1;
               x.push({
-                endIndex: S,
+                endIndex: P,
                 size: I,
-                startIndex: S
+                startIndex: P
               }), x.push({
-                endIndex: S + 1 + O - 1,
+                endIndex: P + 1 + O - 1,
                 size: T,
-                startIndex: S + 1
+                startIndex: P + 1
               }), _++, B += O + 1;
             }
             const k = Gs(h.sizeTree);
-            return B !== P && k.shift(), k.reduce(
-              (S, { k: O, v: U }) => {
-                let N = S.ranges;
-                return S.prevSize !== 0 && (N = [
-                  ...S.ranges,
+            return B !== S && k.shift(), k.reduce(
+              (P, { k: O, v: U }) => {
+                let N = P.ranges;
+                return P.prevSize !== 0 && (N = [
+                  ...P.ranges,
                   {
-                    endIndex: O + P - 1,
-                    size: S.prevSize,
-                    startIndex: S.prevIndex
+                    endIndex: O + S - 1,
+                    size: P.prevSize,
+                    startIndex: P.prevIndex
                   }
                 ]), {
-                  prevIndex: O + P,
+                  prevIndex: O + S,
                   prevSize: U,
                   ranges: N
                 };
               },
               {
-                prevIndex: P,
+                prevIndex: S,
                 prevSize: 0,
                 ranges: x
               }
@@ -41090,9 +41087,9 @@ const sq = {
           }
           return Gs(h.sizeTree).reduce(
             (I, { k: B, v: _ }) => ({
-              prevIndex: B + P,
+              prevIndex: B + S,
               prevSize: _,
-              ranges: [...I.ranges, { endIndex: B + P - 1, size: I.prevSize, startIndex: I.prevIndex }]
+              ranges: [...I.ranges, { endIndex: B + S - 1, size: I.prevSize, startIndex: I.prevIndex }]
             }),
             {
               prevIndex: 0,
@@ -41108,8 +41105,8 @@ const sq = {
       j(
         o,
         Pe(v, g),
-        re(([P, { offsetTree: h }, y]) => {
-          const x = -P;
+        re(([S, { offsetTree: h }, y]) => {
+          const x = -S;
           return Wi(x, h, y);
         })
       )
@@ -41118,23 +41115,23 @@ const sq = {
       j(
         o,
         Pe(v, g),
-        re(([P, h, y]) => {
+        re(([S, h, y]) => {
           if (h.groupIndices.length > 0) {
             if (Ze(h.sizeTree))
               return h;
             let x = Ka();
             const T = ct(w);
             let I = 0, B = 0, _ = 0;
-            for (; I < -P; ) {
+            for (; I < -S; ) {
               _ = T[B];
               const k = T[B + 1] - _ - 1;
               B++, I += k + 1;
             }
-            if (x = Gs(h.sizeTree).reduce((k, { k: S, v: O }) => cr(k, Math.max(0, S + P), O), x), I !== -P) {
+            if (x = Gs(h.sizeTree).reduce((k, { k: P, v: O }) => cr(k, Math.max(0, P + S), O), x), I !== -S) {
               const k = ji(h.sizeTree, _);
               x = cr(x, 0, k);
-              const S = Yr(h.sizeTree, -P + 1)[1];
-              x = cr(x, 1, S);
+              const P = Yr(h.sizeTree, -S + 1)[1];
+              x = cr(x, 1, P);
             }
             return {
               ...h,
@@ -41142,7 +41139,7 @@ const sq = {
               ...Cf(h.offsetTree, 0, x, y)
             };
           } else {
-            const x = Gs(h.sizeTree).reduce((T, { k: I, v: B }) => cr(T, Math.max(0, I + P), B), Ka());
+            const x = Gs(h.sizeTree).reduce((T, { k: I, v: B }) => cr(T, Math.max(0, I + S), B), Ka());
             return {
               ...h,
               sizeTree: x,
@@ -41262,14 +41259,14 @@ const Ic = Ve(
         Pe(e, a, s),
         re(
           ([
-            [C, F, R, P, h, y, x, T],
+            [C, F, R, S, h, y, x, T],
             I,
             B,
             _
           ]) => {
-            const k = Tx(C), { align: S, behavior: O, offset: U } = k, N = P - 1, L = kx(k, F, N);
+            const k = Tx(C), { align: P, behavior: O, offset: U } = k, N = S - 1, L = kx(k, F, N);
             let H = Wi(L, F.offsetTree, I) + y;
-            S === "end" ? (H += B + Yr(F.sizeTree, L)[1] - R + _, L === N && (H += x)) : S === "center" ? H += (B + Yr(F.sizeTree, L)[1] - R + _) / 2 : H -= h, U && (H += U);
+            P === "end" ? (H += B + Yr(F.sizeTree, L)[1] - R + _, L === N && (H += x)) : P === "center" ? H += (B + Yr(F.sizeTree, L)[1] - R + _) / 2 : H -= h, U && (H += U);
             const Z = (fe) => {
               A(), fe ? (T("retrying to scroll to", { location: C }, sr.DEBUG), Te(m, C)) : (Te(b, !0), T("list did not change, scroll successful", {}, sr.DEBUG));
             };
@@ -41395,7 +41392,7 @@ const qi = "up", ii = "down", cq = "none", lq = {
   const b = ur(
     j(
       vt(n, me(a), me(t), me(e), me(u)),
-      ln((w, [{ scrollHeight: A, scrollTop: C }, F, R, P, h]) => {
+      ln((w, [{ scrollHeight: A, scrollTop: C }, F, R, S, h]) => {
         const y = C + F - A > -h, x = {
           scrollHeight: A,
           scrollTop: C,
@@ -41541,11 +41538,11 @@ const Am = Ve(
             A
           ]) => {
             const C = u - w, F = E + v, R = Math.max(f - C, 0);
-            let P = L1;
+            let S = L1;
             const h = $1(A, Ki), y = $1(A, Yi);
-            return m -= w, m += f + v, b += f + v, b -= w, m > u + F - h && (P = qi), b < u - R + d + y && (P = ii), P !== L1 ? [
-              Math.max(C - f - z1(g, Ki, P) - h, 0),
-              C - R - v + d + z1(g, Yi, P) + y
+            return m -= w, m += f + v, b += f + v, b -= w, m > u + F - h && (S = qi), b < u - R + d + y && (S = ii), S !== L1 ? [
+              Math.max(C - f - z1(g, Ki, S) - h, 0),
+              C - R - v + d + z1(g, Yi, S) + y
             ] : null;
           }
         ),
@@ -41684,15 +41681,15 @@ const ka = Ve(
           me(w),
           e
         ),
-        he(([P, h, , y, , , , , , , , x]) => {
+        he(([S, h, , y, , , , , , , , x]) => {
           const T = x && x.length !== y;
-          return P && !h && !T;
+          return S && !h && !T;
         }),
         re(
           ([
             ,
             ,
-            [P, h],
+            [S, h],
             y,
             x,
             T,
@@ -41700,14 +41697,14 @@ const ka = Ve(
             B,
             _,
             k,
-            S,
+            P,
             O
           ]) => {
             var U, N, L, H;
             const Z = x, { offsetTree: fe, sizeTree: ye } = Z, ie = ct(E);
             if (y === 0)
               return { ...Xd, totalCount: y };
-            if (P === 0 && h === 0)
+            if (S === 0 && h === 0)
               return ie === 0 ? { ...Xd, totalCount: y } : Sx(ie, T, x, _, k, O || []);
             if (Ze(ye))
               return ie > 0 ? null : Rl(
@@ -41730,7 +41727,7 @@ const ka = Ve(
             }
             if (!I)
               return Rl([], pe, y, k, Z, _);
-            const Ue = B.length > 0 ? B[B.length - 1] + 1 : 0, K = JW(fe, P, h, Ue);
+            const Ue = B.length > 0 ? B[B.length - 1] + 1 : 0, K = JW(fe, S, h, Ue);
             if (K.length === 0)
               return null;
             const ve = y - 1, De = ed([], (Ae) => {
@@ -41738,8 +41735,8 @@ const ka = Ve(
                 const ge = Ee.value;
                 let Qe = ge.offset, Ye = Ee.start;
                 const et = ge.size;
-                if (ge.offset < P) {
-                  Ye += Math.floor((P - ge.offset + k) / (et + k));
+                if (ge.offset < S) {
+                  Ye += Math.floor((S - ge.offset + k) / (et + k));
                   const Ot = Ye - Ee.start;
                   Qe += Ot * et + Ot * k;
                 }
@@ -41748,7 +41745,7 @@ const ka = Ve(
                 for (let Ot = Ye; Ot <= yr && !(Qe >= h); Ot++)
                   Ae.push({ data: O == null ? void 0 : O[Ot], index: Ot, offset: Qe, size: et }), Qe += et + k;
               }
-            }), He = G1(S, Ki), at = G1(S, Yi);
+            }), He = G1(P, Ki), at = G1(P, Yi);
             if (De.length > 0 && (He > 0 || at > 0)) {
               const Ae = De[0], Ee = De[De.length - 1];
               if (He > 0 && Ae.index > Ue) {
@@ -41773,7 +41770,7 @@ const ka = Ve(
           }
         ),
         //@ts-expect-error filter needs to be fixed
-        he((P) => P !== null),
+        he((S) => S !== null),
         tt()
       ),
       Xd
@@ -41782,59 +41779,59 @@ const ka = Ve(
       j(
         e,
         he(xm),
-        re((P) => P == null ? void 0 : P.length)
+        re((S) => S == null ? void 0 : S.length)
       ),
       s
     ), ce(
       j(
         A,
-        re((P) => P.topListHeight)
+        re((S) => S.topListHeight)
       ),
       d
     ), ce(d, i), ce(
       j(
         A,
-        re((P) => [P.top, P.bottom])
+        re((S) => [S.top, S.bottom])
       ),
       o
     ), ce(
       j(
         A,
-        re((P) => P.items)
+        re((S) => S.items)
       ),
       v
     );
     const C = ur(
       j(
         A,
-        he(({ items: P }) => P.length > 0),
+        he(({ items: S }) => S.length > 0),
         Pe(s, e),
-        he(([{ items: P }, h]) => P[P.length - 1].originalIndex === h - 1),
-        re(([, P, h]) => [P - 1, h]),
+        he(([{ items: S }, h]) => S[S.length - 1].originalIndex === h - 1),
+        re(([, S, h]) => [S - 1, h]),
         tt(Vi),
-        re(([P]) => P)
+        re(([S]) => S)
       )
     ), F = ur(
       j(
         A,
         Nn(200),
-        he(({ items: P, topItems: h }) => P.length > 0 && P[0].originalIndex === h.length),
-        re(({ items: P }) => P[0].index),
+        he(({ items: S, topItems: h }) => S.length > 0 && S[0].originalIndex === h.length),
+        re(({ items: S }) => S[0].index),
         tt()
       )
     ), R = ur(
       j(
         A,
-        he(({ items: P }) => P.length > 0),
-        re(({ items: P }) => {
-          let h = 0, y = P.length - 1;
-          for (; P[h].type === "group" && h < y; )
+        he(({ items: S }) => S.length > 0),
+        re(({ items: S }) => {
+          let h = 0, y = S.length - 1;
+          for (; S[h].type === "group" && h < y; )
             h++;
-          for (; P[y].type === "group" && y > h; )
+          for (; S[y].type === "group" && y > h; )
             y--;
           return {
-            endIndex: P[y].index,
-            startIndex: P[h].index
+            endIndex: S[y].index,
+            startIndex: S[h].index
           };
         }),
         tt(wx)
@@ -41913,14 +41910,14 @@ const ka = Ve(
         Pe(t, c, r, a, s, n, i),
         Pe(e),
         re(([[d, f, m, b, g, E, v, w], A]) => {
-          const { align: C, behavior: F, calculateViewLocation: R = fq, done: P, ...h } = d, y = kx(d, f, b - 1), x = Wi(y, f.offsetTree, A) + g + E, T = x + Yr(f.sizeTree, y)[1], I = w + E, B = w + m - v, _ = R({
+          const { align: C, behavior: F, calculateViewLocation: R = fq, done: S, ...h } = d, y = kx(d, f, b - 1), x = Wi(y, f.offsetTree, A) + g + E, T = x + Yr(f.sizeTree, y)[1], I = w + E, B = w + m - v, _ = R({
             itemBottom: T,
             itemTop: x,
             locationParams: { align: C, behavior: F, ...h },
             viewportBottom: B,
             viewportTop: I
           });
-          return _ ? P && Hr(
+          return _ ? S && Hr(
             j(
               o,
               he((k) => !k),
@@ -41928,8 +41925,8 @@ const ka = Ve(
               // but if scrollingInProgress is true, we skip the initial publish.
               ma(ct(o) ? 1 : 2)
             ),
-            P
-          ) : P && P(), _;
+            S
+          ) : S && S(), _;
         }),
         he((d) => d !== null)
       ),
@@ -41969,9 +41966,9 @@ const mq = (e, t) => typeof e == "function" ? j1(e(t)) : t && j1(e), hq = Ve(
       j(
         vt(j(me(t), ma(1)), c),
         Pe(me(b), a, i, d),
-        re(([[F, R], P, h, y, x]) => {
+        re(([[F, R], S, h, y, x]) => {
           let T = R && y, I = "auto";
-          return T && (I = mq(P, h || x), T = T && !!I), { followOutputBehavior: I, shouldFollow: T, totalCount: F };
+          return T && (I = mq(S, h || x), T = T && !!I), { followOutputBehavior: I, shouldFollow: T, totalCount: F };
         }),
         he(({ shouldFollow: F }) => F)
       ),
@@ -41984,8 +41981,8 @@ const mq = (e, t) => typeof e == "function" ? j1(e(t)) : t && j1(e), hq = Ve(
       }
     );
     function w(F) {
-      const R = Hr(s, (P) => {
-        F && !P.atBottom && P.notAtBottomBecause === "SIZE_INCREASED" && !E && (ct(u)("scrolling to bottom due to increased size", {}, sr.DEBUG), v("auto"));
+      const R = Hr(s, (S) => {
+        F && !S.atBottom && S.notAtBottomBecause === "SIZE_INCREASED" && !E && (ct(u)("scrolling to bottom due to increased size", {}, sr.DEBUG), v("auto"));
       });
       setTimeout(R, 100);
     }
@@ -42025,7 +42022,7 @@ const mq = (e, t) => typeof e == "function" ? j1(e(t)) : t && j1(e), hq = Ve(
       j(
         vt(j(C, ma(1)), c),
         Pe(me(A), i, d, f),
-        re(([[F, R], P, h, y, x]) => R && h && (P == null ? void 0 : P({ context: x, totalCount: F, scrollingInProgress: y }))),
+        re(([[F, R], S, h, y, x]) => R && h && (S == null ? void 0 : S({ context: x, totalCount: F, scrollingInProgress: y }))),
         he((F) => !!F),
         Nn(0)
       ),
@@ -42219,10 +42216,10 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
         c,
         Pe(o),
         ln(
-          ([, v, w, A], [{ bottom: C, items: F, offsetBottom: R, totalCount: P }, h]) => {
+          ([, v, w, A], [{ bottom: C, items: F, offsetBottom: R, totalCount: S }, h]) => {
             const y = C + R;
             let x = 0;
-            return w === P && v.length > 0 && F.length > 0 && (F[0].originalIndex === 0 && v[0].originalIndex === 0 || (x = y - A, x !== 0 && (x += h))), [x, F, P, y];
+            return w === S && v.length > 0 && F.length > 0 && (F[0].originalIndex === 0 && v[0].originalIndex === 0 || (x = y - A, x !== 0 && (x += h))), [x, F, S, y];
           },
           [0, [], 0, 0]
         ),
@@ -42256,21 +42253,21 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
         l,
         Pe(f, u),
         re(([v, { groupIndices: w, lastSize: A, sizeTree: C }, F]) => {
-          function R(P) {
-            return P * (A + F);
+          function R(S) {
+            return S * (A + F);
           }
           if (w.length === 0)
             return R(v);
           {
-            let P = 0;
+            let S = 0;
             const h = ji(C, 0);
             let y = 0, x = 0;
             for (; y < v; ) {
-              y++, P += h;
+              y++, S += h;
               let T = w.length === x + 1 ? 1 / 0 : w[x + 1] - w[x] - 1;
-              y + T > v && (P -= h, T = v - y + 1), y += T, P += R(T), x++;
+              y + T > v && (S -= h, T = v - y + 1), y += T, S += R(T), x++;
             }
-            return P;
+            return S;
           }
         })
       ),
@@ -42348,7 +42345,7 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
     C,
     { scrollToIndex: F },
     R,
-    { topItemCount: P },
+    { topItemCount: S },
     { groupCounts: h },
     y
   ]) => {
@@ -42372,7 +42369,7 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
       initialTopMostItemIndex: g,
       scrolledToInitialItem: E,
       sizeRanges: l,
-      topItemCount: P,
+      topItemCount: S,
       topItemsIndexes: I,
       // input
       totalCount: f,
@@ -42445,12 +42442,12 @@ function Dx(e, t, r) {
     return o.reduce((v, w) => (v[w] = zW(E[t.events[w]]), v), {});
   }
   const d = te.forwardRef((E, v) => {
-    const { children: w, ...A } = E, [C] = te.useState(() => ed(HW(e), (P) => {
-      c(P, A);
+    const { children: w, ...A } = E, [C] = te.useState(() => ed(HW(e), (S) => {
+      c(S, A);
     })), [F] = te.useState(D1(u, C));
     Sl(() => {
-      for (const P of o)
-        P in A && qe(F[P], A[P]);
+      for (const S of o)
+        S in A && qe(F[S], A[S]);
       return () => {
         Object.values(F).map(wm);
       };
@@ -42607,7 +42604,7 @@ const Aq = /* @__PURE__ */ Ve(() => {
   Bm("deviation", (_) => {
     v !== _ && w(_);
   });
-  const A = we("EmptyPlaceholder"), C = we("ScrollSeekPlaceholder") || Pq, F = we("ListComponent"), R = we("ItemComponent"), P = we("GroupComponent"), h = we("computeItemKey"), y = we("isSeeking"), x = we("groupIndices").length > 0, T = we("alignToBottom"), I = we("initialItemFinalLocationReached"), B = e ? {} : {
+  const A = we("EmptyPlaceholder"), C = we("ScrollSeekPlaceholder") || Pq, F = we("ListComponent"), R = we("ItemComponent"), S = we("GroupComponent"), h = we("computeItemKey"), y = we("isSeeking"), x = we("groupIndices").length > 0, T = we("alignToBottom"), I = we("initialItemFinalLocationReached"), B = e ? {} : {
     boxSizing: "border-box",
     ...g ? {
       display: "inline-block",
@@ -42631,25 +42628,25 @@ const Aq = /* @__PURE__ */ Ve(() => {
       ref: E,
       style: B,
       children: (e ? t.topItems : t.items).map((_) => {
-        const k = _.originalIndex, S = h(k + t.firstItemIndex, _.data, l);
+        const k = _.originalIndex, P = h(k + t.firstItemIndex, _.data, l);
         return y ? /* @__PURE__ */ Na(
           C,
           {
             ...Nt(C, l),
             height: _.size,
             index: _.index,
-            key: S,
+            key: P,
             type: _.type || "item",
             ..._.type === "group" ? {} : { groupIndex: _.groupIndex }
           }
         ) : _.type === "group" ? /* @__PURE__ */ Na(
-          P,
+          S,
           {
-            ...Nt(P, l),
+            ...Nt(S, l),
             "data-index": k,
             "data-item-index": _.index,
             "data-known-size": _.size,
-            key: S,
+            key: P,
             style: Iq
           },
           u(_.index, l)
@@ -42662,7 +42659,7 @@ const Aq = /* @__PURE__ */ Ve(() => {
             "data-item-group-index": _.groupIndex,
             "data-item-index": _.index,
             "data-known-size": _.size,
-            key: S,
+            key: P,
             style: g ? Bq : Lx
           },
           x ? c(_.index, _.groupIndex, _.data, l) : c(_.index, _.data, l)
@@ -42954,7 +42951,7 @@ const Kq = /* @__PURE__ */ Ve(
     { customScrollParent: E, useWindowScroll: v, windowScrollContainerState: w, windowScrollTo: A, windowViewportRect: C },
     F
   ]) => {
-    const R = q(0), P = q(0), h = q(q1), y = q({ height: 0, width: 0 }), x = q({ height: 0, width: 0 }), T = Re(), I = Re(), B = q(0), _ = q(null), k = q({ column: 0, row: 0 }), S = Re(), O = Re(), U = q(!1), N = q(0), L = q(!0), H = q(!1), Z = q(!1);
+    const R = q(0), S = q(0), h = q(q1), y = q({ height: 0, width: 0 }), x = q({ height: 0, width: 0 }), T = Re(), I = Re(), B = q(0), _ = q(null), k = q({ column: 0, row: 0 }), P = Re(), O = Re(), U = q(!1), N = q(0), L = q(!0), H = q(!1), Z = q(!1);
     qe(
       j(
         b,
@@ -42982,7 +42979,7 @@ const Kq = /* @__PURE__ */ Ve(
         he((K) => K != null && K.scrollTop > 0),
         on(0)
       ),
-      P
+      S
     ), qe(
       j(
         b,
@@ -43015,7 +43012,7 @@ const Kq = /* @__PURE__ */ Ve(
           viewport: K
         }))
       ),
-      S
+      P
     ), ce(
       j(
         vt(
@@ -43025,7 +43022,7 @@ const Kq = /* @__PURE__ */ Ve(
           me(x, Pl),
           me(y, Pl),
           me(_),
-          me(P),
+          me(S),
           me(U),
           me(L),
           me(N)
@@ -43156,7 +43153,7 @@ const Kq = /* @__PURE__ */ Ve(
       gap: k,
       headerHeight: a,
       increaseViewportBy: e,
-      initialItemCount: P,
+      initialItemCount: S,
       itemDimensions: x,
       overscan: r,
       restoreStateFrom: O,
@@ -43184,7 +43181,7 @@ const Kq = /* @__PURE__ */ Ve(
       propsReady: g,
       rangeChanged: pe,
       startReached: ie,
-      stateChanged: S,
+      stateChanged: P,
       stateRestoreInProgress: U,
       ...F
     };
@@ -43760,8 +43757,8 @@ const uK = ({ count: e }) => {
         return t("Completed") || "";
       case gt.Expired:
         return t("Expired") || "";
-      case gt.Canceled:
-        return t("Canceled") || "";
+      case gt.Cancelled:
+        return t("Cancelled") || "";
     }
   }, [e.original.status, t]);
 }, BK = () => {
@@ -44374,23 +44371,24 @@ const gZ = () => {
     usd: Cs(n, t)
   };
 }, JK = () => {
-  const { srcToken: e, dstToken: t, account: r, chainId: n, slippage: s, config: a, module: o } = ne(), { amountWei: i } = Jr(), { amountPerTradeWei: c, totalTrades: l } = Fr(), u = nd(), { amountWei: d } = Dc(), { pricePerChunkWei: f } = Ds(), { milliseconds: m } = Os();
+  const { srcToken: e, dstToken: t, account: r, chainId: n, slippage: s, config: a, module: o, fees: i } = ne(), { amountWei: c } = Jr(), { amountPerTradeWei: l, totalTrades: u } = Fr(), d = nd(), { amountWei: f } = Dc(), { pricePerChunkWei: m } = Ds(), { milliseconds: b } = Os();
   return Q(() => {
-    var b;
+    var g;
     return zw({
       chainId: n,
-      srcToken: xo((e == null ? void 0 : e.address) || "") ? ((b = wo(n)) == null ? void 0 : b.wToken.address) || "" : (e == null ? void 0 : e.address) || "",
+      srcToken: xo((e == null ? void 0 : e.address) || "") ? ((g = wo(n)) == null ? void 0 : g.wToken.address) || "" : (e == null ? void 0 : e.address) || "",
       dstToken: (t == null ? void 0 : t.address) || "",
-      srcAmount: i,
-      deadlineMillis: u,
-      fillDelayMillis: !l || l === 1 ? 0 : m,
+      srcAmount: c,
+      deadlineMillis: d,
+      fillDelayMillis: !u || u === 1 ? 0 : b,
       slippage: s * 100,
       account: r,
-      srcAmountPerTrade: c,
-      dstMinAmountPerTrade: d,
-      triggerAmountPerTrade: f,
+      srcAmountPerTrade: l,
+      dstMinAmountPerTrade: f,
+      triggerAmountPerTrade: m,
       config: a,
-      module: o
+      module: o,
+      feePercentage: i
     });
   }, [
     e,
@@ -44400,12 +44398,13 @@ const gZ = () => {
     s,
     a,
     o,
-    i,
     c,
     l,
+    u,
+    b,
+    f,
     m,
-    d,
-    f
+    i
   ]);
 }, eY = () => {
   const { srcToken: e, dstToken: t, account: r } = ne(), { amountWei: n } = Jr(), { amountWei: s } = Uc(), { amountPerTradeWei: a, totalTrades: o } = Fr(), i = nd(), { amountWei: c } = Dc(), { pricePerChunkWei: l } = Ds(), { milliseconds: u } = Os(), d = JK();
@@ -44445,7 +44444,7 @@ const gZ = () => {
     amount: b,
     percent: g,
     usd: E
-  } = QK(), { milliseconds: v } = Os(), { amountUI: w } = Oc(), { srcAmountUsd: A, dstAmountUsd: C } = XK(), F = Jr().amountUI, R = J((T) => T.state.isMarketOrder), P = J((T) => T.state.currentTime), h = ex({
+  } = QK(), { milliseconds: v } = Os(), { amountUI: w } = Oc(), { srcAmountUsd: A, dstAmountUsd: C } = XK(), F = Jr().amountUI, R = J((T) => T.state.isMarketOrder), S = J((T) => T.state.currentTime), h = ex({
     srcToken: e,
     dstToken: t,
     account: r,
@@ -44465,7 +44464,7 @@ const gZ = () => {
     dstUsd: C,
     dstAmount: w,
     orderType: nx(),
-    createdAt: P
+    createdAt: S
   }), y = Kr({ value: b }), x = Kr({ value: E });
   return Q(() => ({
     ...h,