@btc-vision/transaction 1.7.31 → 1.8.0-alpha.2

package/browser/noble-curves.js

@@ -1,36 +1,9 @@
-import { r as We, a as ln, b as dn, c as Me, i as yt, h as Qe, d as hn, e as Ae, f as yn, g as mn, j as kt, k as bn, s as wn } from "./noble-hashes.js";
-function er(e) {
-  return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
-}
-function tr(e) {
-  if (Object.prototype.hasOwnProperty.call(e, "__esModule")) return e;
-  var n = e.default;
-  if (typeof n == "function") {
-    var c = function t() {
-      var u = !1;
-      try {
-        u = this instanceof t;
-      } catch {
-      }
-      return u ? Reflect.construct(n, arguments, this.constructor) : n.apply(this, arguments);
-    };
-    c.prototype = n.prototype;
-  } else c = {};
-  return Object.defineProperty(c, "__esModule", { value: !0 }), Object.keys(e).forEach(function(t) {
-    var u = Object.getOwnPropertyDescriptor(e, t);
-    Object.defineProperty(c, t, u.get ? u : {
-      enumerable: !0,
-      get: function() {
-        return e[t];
-      }
-    });
-  }), c;
-}
+import { m as We, b as ln, n as dn, o as Me, q as yt, t as Qe, u as hn, v as Ae, w as yn, x as mn, y as Vt, k as bn, z as wn } from "./noble-hashes.js";
 var tt = {}, Ke = {}, nt = {}, rt = {}, _t;
 function Ce() {
   return _t || (_t = 1, (function(e) {
-    Object.defineProperty(e, "__esModule", { value: !0 }), e.notImplemented = e.bitMask = e.utf8ToBytes = e.randomBytes = e.isBytes = e.hexToBytes = e.concatBytes = e.bytesToUtf8 = e.bytesToHex = e.anumber = e.abytes = void 0, e.abool = m, e._abool2 = g, e._abytes2 = p, e.numberToHexUnpadded = v, e.hexToNumber = U, e.bytesToNumberBE = H, e.bytesToNumberLE = V, e.numberToBytesBE = E, e.numberToBytesLE = b, e.numberToVarBytesBE = S, e.ensureBytes = A, e.equalBytes = M, e.copyBytes = Q, e.asciiToBytes = F, e.inRange = se, e.aInRange = ie, e.bitLen = j, e.bitGet = R, e.bitSet = L, e.createHmacDrbg = K, e.validateObject = D, e.isHash = d, e._validateObject = l, e.memoized = a;
-    const n = /* @__PURE__ */ We();
+    Object.defineProperty(e, "__esModule", { value: !0 }), e.notImplemented = e.bitMask = e.utf8ToBytes = e.randomBytes = e.isBytes = e.hexToBytes = e.concatBytes = e.bytesToUtf8 = e.bytesToHex = e.anumber = e.abytes = void 0, e.abool = m, e._abool2 = g, e._abytes2 = p, e.numberToHexUnpadded = v, e.hexToNumber = U, e.bytesToNumberBE = H, e.bytesToNumberLE = k, e.numberToBytesBE = E, e.numberToBytesLE = b, e.numberToVarBytesBE = S, e.ensureBytes = A, e.equalBytes = M, e.copyBytes = Q, e.asciiToBytes = F, e.inRange = se, e.aInRange = ie, e.bitLen = j, e.bitGet = O, e.bitSet = L, e.createHmacDrbg = K, e.validateObject = z, e.isHash = d, e._validateObject = u, e.memoized = a;
+    const r = /* @__PURE__ */ We();
     var c = /* @__PURE__ */ We();
     Object.defineProperty(e, "abytes", { enumerable: !0, get: function() {
       return c.abytes;
@@ -51,7 +24,7 @@ function Ce() {
     } }), Object.defineProperty(e, "utf8ToBytes", { enumerable: !0, get: function() {
       return c.utf8ToBytes;
     } });
-    const t = /* @__PURE__ */ BigInt(0), u = /* @__PURE__ */ BigInt(1);
+    const t = /* @__PURE__ */ BigInt(0), l = /* @__PURE__ */ BigInt(1);
     function m(i, o) {
       if (typeof o != "boolean")
         throw new Error(i + " boolean expected, got " + o);
@@ -64,10 +37,10 @@ function Ce() {
       return i;
     }
     function p(i, o, h = "") {
-      const w = (0, n.isBytes)(i), s = i?.length, f = o !== void 0;
+      const w = (0, r.isBytes)(i), s = i?.length, f = o !== void 0;
       if (!w || f && s !== o) {
-        const y = h && `"${h}" `, B = f ? ` of length ${o}` : "", O = w ? `length=${s}` : `type=${typeof i}`;
-        throw new Error(y + "expected Uint8Array" + B + ", got " + O);
+        const y = h && `"${h}" `, B = f ? ` of length ${o}` : "", T = w ? `length=${s}` : `type=${typeof i}`;
+        throw new Error(y + "expected Uint8Array" + B + ", got " + T);
       }
       return i;
     }
@@ -81,29 +54,29 @@ function Ce() {
       return i === "" ? t : BigInt("0x" + i);
     }
     function H(i) {
-      return U((0, n.bytesToHex)(i));
+      return U((0, r.bytesToHex)(i));
     }
-    function V(i) {
-      return (0, n.abytes)(i), U((0, n.bytesToHex)(Uint8Array.from(i).reverse()));
+    function k(i) {
+      return (0, r.abytes)(i), U((0, r.bytesToHex)(Uint8Array.from(i).reverse()));
     }
     function E(i, o) {
-      return (0, n.hexToBytes)(i.toString(16).padStart(o * 2, "0"));
+      return (0, r.hexToBytes)(i.toString(16).padStart(o * 2, "0"));
     }
     function b(i, o) {
       return E(i, o).reverse();
     }
     function S(i) {
-      return (0, n.hexToBytes)(v(i));
+      return (0, r.hexToBytes)(v(i));
     }
     function A(i, o, h) {
       let w;
       if (typeof o == "string")
         try {
-          w = (0, n.hexToBytes)(o);
+          w = (0, r.hexToBytes)(o);
         } catch (f) {
           throw new Error(i + " must be hex string or Uint8Array, cause: " + f);
         }
-      else if ((0, n.isBytes)(o))
+      else if ((0, r.isBytes)(o))
         w = Uint8Array.from(o);
       else
         throw new Error(i + " must be hex string or Uint8Array");
@@ -141,17 +114,17 @@ function Ce() {
     }
     function j(i) {
       let o;
-      for (o = 0; i > t; i >>= u, o += 1)
+      for (o = 0; i > t; i >>= l, o += 1)
         ;
       return o;
     }
-    function R(i, o) {
-      return i >> BigInt(o) & u;
+    function O(i, o) {
+      return i >> BigInt(o) & l;
     }
     function L(i, o, h) {
-      return i | (h ? u : t) << BigInt(o);
+      return i | (h ? l : t) << BigInt(o);
     }
-    const _ = (i) => (u << BigInt(i)) - u;
+    const _ = (i) => (l << BigInt(i)) - l;
     e.bitMask = _;
     function K(i, o, h) {
       if (typeof i != "number" || i < 2)
@@ -162,28 +135,28 @@ function Ce() {
         throw new Error("hmacFn must be a function");
       const w = (C) => new Uint8Array(C), s = (C) => Uint8Array.of(C);
       let f = w(i), y = w(i), B = 0;
-      const O = () => {
+      const T = () => {
         f.fill(1), y.fill(0), B = 0;
-      }, k = (...C) => h(y, f, ...C), Y = (C = w(0)) => {
-        y = k(s(0), C), f = k(), C.length !== 0 && (y = k(s(1), C), f = k());
+      }, V = (...C) => h(y, f, ...C), Y = (C = w(0)) => {
+        y = V(s(0), C), f = V(), C.length !== 0 && (y = V(s(1), C), f = V());
       }, I = () => {
         if (B++ >= 1e3)
           throw new Error("drbg: tried 1000 values");
         let C = 0;
         const te = [];
         for (; C < o; ) {
-          f = k();
+          f = V();
           const $ = f.slice();
           te.push($), C += f.length;
         }
-        return (0, n.concatBytes)(...te);
+        return (0, r.concatBytes)(...te);
       };
       return (C, te) => {
-        O(), Y(C);
+        T(), Y(C);
         let $;
         for (; !($ = te(I())); )
           Y();
-        return O(), $;
+        return T(), $;
       };
     }
     const W = {
@@ -191,20 +164,20 @@ function Ce() {
       function: (i) => typeof i == "function",
       boolean: (i) => typeof i == "boolean",
       string: (i) => typeof i == "string",
-      stringOrUint8Array: (i) => typeof i == "string" || (0, n.isBytes)(i),
+      stringOrUint8Array: (i) => typeof i == "string" || (0, r.isBytes)(i),
       isSafeInteger: (i) => Number.isSafeInteger(i),
       array: (i) => Array.isArray(i),
       field: (i, o) => o.Fp.isValid(i),
       hash: (i) => typeof i == "function" && Number.isSafeInteger(i.outputLen)
     };
-    function D(i, o, h = {}) {
+    function z(i, o, h = {}) {
       const w = (s, f, y) => {
         const B = W[f];
         if (typeof B != "function")
           throw new Error("invalid validator function");
-        const O = i[s];
-        if (!(y && O === void 0) && !B(O, i))
-          throw new Error("param " + String(s) + " is invalid. Expected " + f + ", got " + O);
+        const T = i[s];
+        if (!(y && T === void 0) && !B(T, i))
+          throw new Error("param " + String(s) + " is invalid. Expected " + f + ", got " + T);
       };
       for (const [s, f] of Object.entries(o))
         w(s, f, !1);
@@ -215,23 +188,23 @@ function Ce() {
     function d(i) {
       return typeof i == "function" && Number.isSafeInteger(i.outputLen);
     }
-    function l(i, o, h = {}) {
+    function u(i, o, h = {}) {
       if (!i || typeof i != "object")
         throw new Error("expected valid options object");
       function w(s, f, y) {
         const B = i[s];
         if (y && B === void 0)
           return;
-        const O = typeof B;
-        if (O !== f || B === null)
-          throw new Error(`param "${s}" is invalid: expected ${f}, got ${O}`);
+        const T = typeof B;
+        if (T !== f || B === null)
+          throw new Error(`param "${s}" is invalid: expected ${f}, got ${T}`);
       }
       Object.entries(o).forEach(([s, f]) => w(s, f, !1)), Object.entries(h).forEach(([s, f]) => w(s, f, !0));
     }
-    const r = () => {
+    const n = () => {
       throw new Error("not implemented");
     };
-    e.notImplemented = r;
+    e.notImplemented = n;
     function a(i) {
       const o = /* @__PURE__ */ new WeakMap();
       return (h, ...w) => {
@@ -244,37 +217,37 @@ function Ce() {
     }
   })(rt)), rt;
 }
-var Re = {}, he = {}, St;
+var Oe = {}, he = {}, St;
 function $e() {
   if (St) return he;
-  St = 1, Object.defineProperty(he, "__esModule", { value: !0 }), he.isNegativeLE = void 0, he.mod = V, he.pow = E, he.pow2 = b, he.invert = S, he.tonelliShanks = G, he.FpSqrt = se, he.validateField = R, he.FpPow = L, he.FpInvertBatch = _, he.FpDiv = K, he.FpLegendre = W, he.FpIsSquare = D, he.nLength = d, he.Field = l, he.FpSqrtOdd = r, he.FpSqrtEven = a, he.hashToPrivateScalar = i, he.getFieldBytesLength = o, he.getMinHashLength = h, he.mapHashToField = w;
-  const e = /* @__PURE__ */ Ce(), n = BigInt(0), c = BigInt(1), t = /* @__PURE__ */ BigInt(2), u = /* @__PURE__ */ BigInt(3), m = /* @__PURE__ */ BigInt(4), g = /* @__PURE__ */ BigInt(5), p = /* @__PURE__ */ BigInt(7), v = /* @__PURE__ */ BigInt(8), U = /* @__PURE__ */ BigInt(9), H = /* @__PURE__ */ BigInt(16);
-  function V(s, f) {
+  St = 1, Object.defineProperty(he, "__esModule", { value: !0 }), he.isNegativeLE = void 0, he.mod = k, he.pow = E, he.pow2 = b, he.invert = S, he.tonelliShanks = G, he.FpSqrt = se, he.validateField = O, he.FpPow = L, he.FpInvertBatch = _, he.FpDiv = K, he.FpLegendre = W, he.FpIsSquare = z, he.nLength = d, he.Field = u, he.FpSqrtOdd = n, he.FpSqrtEven = a, he.hashToPrivateScalar = i, he.getFieldBytesLength = o, he.getMinHashLength = h, he.mapHashToField = w;
+  const e = /* @__PURE__ */ Ce(), r = BigInt(0), c = BigInt(1), t = /* @__PURE__ */ BigInt(2), l = /* @__PURE__ */ BigInt(3), m = /* @__PURE__ */ BigInt(4), g = /* @__PURE__ */ BigInt(5), p = /* @__PURE__ */ BigInt(7), v = /* @__PURE__ */ BigInt(8), U = /* @__PURE__ */ BigInt(9), H = /* @__PURE__ */ BigInt(16);
+  function k(s, f) {
     const y = s % f;
-    return y >= n ? y : f + y;
+    return y >= r ? y : f + y;
   }
   function E(s, f, y) {
-    return L(l(y), s, f);
+    return L(u(y), s, f);
   }
   function b(s, f, y) {
     let B = s;
-    for (; f-- > n; )
+    for (; f-- > r; )
       B *= B, B %= y;
     return B;
   }
   function S(s, f) {
-    if (s === n)
+    if (s === r)
       throw new Error("invert: expected non-zero number");
-    if (f <= n)
+    if (f <= r)
       throw new Error("invert: expected positive modulus, got " + f);
-    let y = V(s, f), B = f, O = n, k = c;
-    for (; y !== n; ) {
-      const I = B / y, q = B % y, C = O - k * I;
-      B = y, y = q, O = k, k = C;
+    let y = k(s, f), B = f, T = r, V = c;
+    for (; y !== r; ) {
+      const I = B / y, q = B % y, C = T - V * I;
+      B = y, y = q, T = V, V = C;
     }
     if (B !== c)
       throw new Error("invert: does not exist");
-    return V(O, f);
+    return k(T, f);
   }
   function A(s, f, y) {
     if (!s.eql(s.sqr(f), y))
@@ -285,57 +258,57 @@ function $e() {
     return A(s, B, f), B;
   }
   function Q(s, f) {
-    const y = (s.ORDER - g) / v, B = s.mul(f, t), O = s.pow(B, y), k = s.mul(f, O), Y = s.mul(s.mul(k, t), O), I = s.mul(k, s.sub(Y, s.ONE));
+    const y = (s.ORDER - g) / v, B = s.mul(f, t), T = s.pow(B, y), V = s.mul(f, T), Y = s.mul(s.mul(V, t), T), I = s.mul(V, s.sub(Y, s.ONE));
     return A(s, I, f), I;
   }
   function F(s) {
-    const f = l(s), y = G(s), B = y(f, f.neg(f.ONE)), O = y(f, B), k = y(f, f.neg(B)), Y = (s + p) / H;
+    const f = u(s), y = G(s), B = y(f, f.neg(f.ONE)), T = y(f, B), V = y(f, f.neg(B)), Y = (s + p) / H;
     return (I, q) => {
       let C = I.pow(q, Y), te = I.mul(C, B);
-      const $ = I.mul(C, O), T = I.mul(C, k), X = I.eql(I.sqr(te), q), ae = I.eql(I.sqr($), q);
-      C = I.cmov(C, te, X), te = I.cmov(T, $, ae);
+      const $ = I.mul(C, T), x = I.mul(C, V), X = I.eql(I.sqr(te), q), ae = I.eql(I.sqr($), q);
+      C = I.cmov(C, te, X), te = I.cmov(x, $, ae);
       const ye = I.eql(I.sqr(te), q), pe = I.cmov(C, te, ye);
       return A(I, pe, q), pe;
     };
   }
   function G(s) {
-    if (s < u)
+    if (s < l)
       throw new Error("sqrt is not defined for small field");
     let f = s - c, y = 0;
-    for (; f % t === n; )
+    for (; f % t === r; )
       f /= t, y++;
     let B = t;
-    const O = l(s);
-    for (; W(O, B) === 1; )
+    const T = u(s);
+    for (; W(T, B) === 1; )
       if (B++ > 1e3)
         throw new Error("Cannot find square root: probably non-prime P");
     if (y === 1)
       return M;
-    let k = O.pow(B, f);
+    let V = T.pow(B, f);
     const Y = (f + c) / t;
     return function(q, C) {
       if (q.is0(C))
         return C;
       if (W(q, C) !== 1)
         throw new Error("Cannot find square root");
-      let te = y, $ = q.mul(q.ONE, k), T = q.pow(C, f), X = q.pow(C, Y);
-      for (; !q.eql(T, q.ONE); ) {
-        if (q.is0(T))
+      let te = y, $ = q.mul(q.ONE, V), x = q.pow(C, f), X = q.pow(C, Y);
+      for (; !q.eql(x, q.ONE); ) {
+        if (q.is0(x))
           return q.ZERO;
-        let ae = 1, ye = q.sqr(T);
+        let ae = 1, ye = q.sqr(x);
         for (; !q.eql(ye, q.ONE); )
           if (ae++, ye = q.sqr(ye), ae === te)
             throw new Error("Cannot find square root");
         const pe = c << BigInt(te - ae - 1), ve = q.pow($, pe);
-        te = ae, $ = q.sqr(ve), T = q.mul(T, $), X = q.mul(X, ve);
+        te = ae, $ = q.sqr(ve), x = q.mul(x, $), X = q.mul(X, ve);
       }
       return X;
     };
   }
   function se(s) {
-    return s % m === u ? M : s % v === g ? Q : s % H === U ? F(s) : G(s);
+    return s % m === l ? M : s % v === g ? Q : s % H === U ? F(s) : G(s);
   }
-  const ie = (s, f) => (V(s, f) & c) === c;
+  const ie = (s, f) => (k(s, f) & c) === c;
   he.isNegativeLE = ie;
   const j = [
     "create",
@@ -356,41 +329,41 @@ function $e() {
     "mulN",
     "sqrN"
   ];
-  function R(s) {
+  function O(s) {
     const f = {
       ORDER: "bigint",
       MASK: "bigint",
       BYTES: "number",
       BITS: "number"
-    }, y = j.reduce((B, O) => (B[O] = "function", B), f);
+    }, y = j.reduce((B, T) => (B[T] = "function", B), f);
     return (0, e._validateObject)(s, y), s;
   }
   function L(s, f, y) {
-    if (y < n)
+    if (y < r)
       throw new Error("invalid exponent, negatives unsupported");
-    if (y === n)
+    if (y === r)
       return s.ONE;
     if (y === c)
       return f;
-    let B = s.ONE, O = f;
-    for (; y > n; )
-      y & c && (B = s.mul(B, O)), O = s.sqr(O), y >>= c;
+    let B = s.ONE, T = f;
+    for (; y > r; )
+      y & c && (B = s.mul(B, T)), T = s.sqr(T), y >>= c;
     return B;
   }
   function _(s, f, y = !1) {
-    const B = new Array(f.length).fill(y ? s.ZERO : void 0), O = f.reduce((Y, I, q) => s.is0(I) ? Y : (B[q] = Y, s.mul(Y, I)), s.ONE), k = s.inv(O);
-    return f.reduceRight((Y, I, q) => s.is0(I) ? Y : (B[q] = s.mul(Y, B[q]), s.mul(Y, I)), k), B;
+    const B = new Array(f.length).fill(y ? s.ZERO : void 0), T = f.reduce((Y, I, q) => s.is0(I) ? Y : (B[q] = Y, s.mul(Y, I)), s.ONE), V = s.inv(T);
+    return f.reduceRight((Y, I, q) => s.is0(I) ? Y : (B[q] = s.mul(Y, B[q]), s.mul(Y, I)), V), B;
   }
   function K(s, f, y) {
     return s.mul(f, typeof y == "bigint" ? S(y, s.ORDER) : s.inv(y));
   }
   function W(s, f) {
-    const y = (s.ORDER - c) / t, B = s.pow(f, y), O = s.eql(B, s.ONE), k = s.eql(B, s.ZERO), Y = s.eql(B, s.neg(s.ONE));
-    if (!O && !k && !Y)
+    const y = (s.ORDER - c) / t, B = s.pow(f, y), T = s.eql(B, s.ONE), V = s.eql(B, s.ZERO), Y = s.eql(B, s.neg(s.ONE));
+    if (!T && !V && !Y)
       throw new Error("invalid Legendre symbol result");
-    return O ? 1 : k ? 0 : -1;
+    return T ? 1 : V ? 0 : -1;
   }
-  function D(s, f) {
+  function z(s, f) {
     return W(s, f) === 1;
   }
   function d(s, f) {
@@ -398,18 +371,18 @@ function $e() {
     const y = f !== void 0 ? f : s.toString(2).length, B = Math.ceil(y / 8);
     return { nBitLength: y, nByteLength: B };
   }
-  function l(s, f, y = !1, B = {}) {
-    if (s <= n)
+  function u(s, f, y = !1, B = {}) {
+    if (s <= r)
       throw new Error("invalid field: expected ORDER > 0, got " + s);
-    let O, k, Y = !1, I;
+    let T, V, Y = !1, I;
     if (typeof f == "object" && f != null) {
       if (B.sqrt || y)
         throw new Error("cannot specify opts in two arguments");
-      const T = f;
-      T.BITS && (O = T.BITS), T.sqrt && (k = T.sqrt), typeof T.isLE == "boolean" && (y = T.isLE), typeof T.modFromBytes == "boolean" && (Y = T.modFromBytes), I = T.allowedLengths;
+      const x = f;
+      x.BITS && (T = x.BITS), x.sqrt && (V = x.sqrt), typeof x.isLE == "boolean" && (y = x.isLE), typeof x.modFromBytes == "boolean" && (Y = x.modFromBytes), I = x.allowedLengths;
     } else
-      typeof f == "number" && (O = f), B.sqrt && (k = B.sqrt);
-    const { nBitLength: q, nByteLength: C } = d(s, O);
+      typeof f == "number" && (T = f), B.sqrt && (V = B.sqrt);
+    const { nBitLength: q, nByteLength: C } = d(s, T);
     if (C > 2048)
       throw new Error("invalid field: expected ORDER of <= 2048 bytes");
     let te;
@@ -419,58 +392,58 @@ function $e() {
       BITS: q,
       BYTES: C,
       MASK: (0, e.bitMask)(q),
-      ZERO: n,
+      ZERO: r,
       ONE: c,
       allowedLengths: I,
-      create: (T) => V(T, s),
-      isValid: (T) => {
-        if (typeof T != "bigint")
-          throw new Error("invalid field element: expected bigint, got " + typeof T);
-        return n <= T && T < s;
+      create: (x) => k(x, s),
+      isValid: (x) => {
+        if (typeof x != "bigint")
+          throw new Error("invalid field element: expected bigint, got " + typeof x);
+        return r <= x && x < s;
       },
-      is0: (T) => T === n,
+      is0: (x) => x === r,
       // is valid and invertible
-      isValidNot0: (T) => !$.is0(T) && $.isValid(T),
-      isOdd: (T) => (T & c) === c,
-      neg: (T) => V(-T, s),
-      eql: (T, X) => T === X,
-      sqr: (T) => V(T * T, s),
-      add: (T, X) => V(T + X, s),
-      sub: (T, X) => V(T - X, s),
-      mul: (T, X) => V(T * X, s),
-      pow: (T, X) => L($, T, X),
-      div: (T, X) => V(T * S(X, s), s),
+      isValidNot0: (x) => !$.is0(x) && $.isValid(x),
+      isOdd: (x) => (x & c) === c,
+      neg: (x) => k(-x, s),
+      eql: (x, X) => x === X,
+      sqr: (x) => k(x * x, s),
+      add: (x, X) => k(x + X, s),
+      sub: (x, X) => k(x - X, s),
+      mul: (x, X) => k(x * X, s),
+      pow: (x, X) => L($, x, X),
+      div: (x, X) => k(x * S(X, s), s),
       // Same as above, but doesn't normalize
-      sqrN: (T) => T * T,
-      addN: (T, X) => T + X,
-      subN: (T, X) => T - X,
-      mulN: (T, X) => T * X,
-      inv: (T) => S(T, s),
-      sqrt: k || ((T) => (te || (te = se(s)), te($, T))),
-      toBytes: (T) => y ? (0, e.numberToBytesLE)(T, C) : (0, e.numberToBytesBE)(T, C),
-      fromBytes: (T, X = !0) => {
+      sqrN: (x) => x * x,
+      addN: (x, X) => x + X,
+      subN: (x, X) => x - X,
+      mulN: (x, X) => x * X,
+      inv: (x) => S(x, s),
+      sqrt: V || ((x) => (te || (te = se(s)), te($, x))),
+      toBytes: (x) => y ? (0, e.numberToBytesLE)(x, C) : (0, e.numberToBytesBE)(x, C),
+      fromBytes: (x, X = !0) => {
         if (I) {
-          if (!I.includes(T.length) || T.length > C)
-            throw new Error("Field.fromBytes: expected " + I + " bytes, got " + T.length);
+          if (!I.includes(x.length) || x.length > C)
+            throw new Error("Field.fromBytes: expected " + I + " bytes, got " + x.length);
           const ye = new Uint8Array(C);
-          ye.set(T, y ? 0 : ye.length - T.length), T = ye;
+          ye.set(x, y ? 0 : ye.length - x.length), x = ye;
         }
-        if (T.length !== C)
-          throw new Error("Field.fromBytes: expected " + C + " bytes, got " + T.length);
-        let ae = y ? (0, e.bytesToNumberLE)(T) : (0, e.bytesToNumberBE)(T);
-        if (Y && (ae = V(ae, s)), !X && !$.isValid(ae))
+        if (x.length !== C)
+          throw new Error("Field.fromBytes: expected " + C + " bytes, got " + x.length);
+        let ae = y ? (0, e.bytesToNumberLE)(x) : (0, e.bytesToNumberBE)(x);
+        if (Y && (ae = k(ae, s)), !X && !$.isValid(ae))
           throw new Error("invalid field element: outside of range 0..ORDER");
         return ae;
       },
       // TODO: we don't need it here, move out to separate fn
-      invertBatch: (T) => _($, T),
+      invertBatch: (x) => _($, x),
       // We can't move this out because Fp6, Fp12 implement it
       // and it's unclear what to return in there.
-      cmov: (T, X, ae) => ae ? X : T
+      cmov: (x, X, ae) => ae ? X : x
     });
     return Object.freeze($);
   }
-  function r(s, f) {
+  function n(s, f) {
     if (!s.isOdd)
       throw new Error("Field doesn't have isOdd");
     const y = s.sqrt(f);
@@ -484,11 +457,11 @@ function $e() {
   }
   function i(s, f, y = !1) {
     s = (0, e.ensureBytes)("privateHash", s);
-    const B = s.length, O = d(f).nByteLength + 8;
-    if (O < 24 || B < O || B > 1024)
-      throw new Error("hashToPrivateScalar: expected " + O + "-1024 bytes of input, got " + B);
-    const k = y ? (0, e.bytesToNumberLE)(s) : (0, e.bytesToNumberBE)(s);
-    return V(k, f - c) + c;
+    const B = s.length, T = d(f).nByteLength + 8;
+    if (T < 24 || B < T || B > 1024)
+      throw new Error("hashToPrivateScalar: expected " + T + "-1024 bytes of input, got " + B);
+    const V = y ? (0, e.bytesToNumberLE)(s) : (0, e.bytesToNumberBE)(s);
+    return k(V, f - c) + c;
   }
   function o(s) {
     if (typeof s != "bigint")
@@ -501,60 +474,60 @@ function $e() {
     return f + Math.ceil(f / 2);
   }
   function w(s, f, y = !1) {
-    const B = s.length, O = o(f), k = h(f);
-    if (B < 16 || B < k || B > 1024)
-      throw new Error("expected " + k + "-1024 bytes of input, got " + B);
-    const Y = y ? (0, e.bytesToNumberLE)(s) : (0, e.bytesToNumberBE)(s), I = V(Y, f - c) + c;
-    return y ? (0, e.numberToBytesLE)(I, O) : (0, e.numberToBytesBE)(I, O);
+    const B = s.length, T = o(f), V = h(f);
+    if (B < 16 || B < V || B > 1024)
+      throw new Error("expected " + V + "-1024 bytes of input, got " + B);
+    const Y = y ? (0, e.bytesToNumberLE)(s) : (0, e.bytesToNumberBE)(s), I = k(Y, f - c) + c;
+    return y ? (0, e.numberToBytesLE)(I, T) : (0, e.numberToBytesBE)(I, T);
   }
   return he;
 }
-var Ot;
+var Tt;
 function gn() {
-  if (Ot) return Re;
-  Ot = 1, Object.defineProperty(Re, "__esModule", { value: !0 }), Re.wNAF = void 0, Re.negateCt = u, Re.normalizeZ = m, Re.mulEndoUnsafe = M, Re.pippenger = Q, Re.precomputeMSMUnsafe = F, Re.validateBasic = G, Re._createCurveFields = ie;
-  const e = /* @__PURE__ */ Ce(), n = /* @__PURE__ */ $e(), c = BigInt(0), t = BigInt(1);
-  function u(j, R) {
-    const L = R.negate();
-    return j ? L : R;
-  }
-  function m(j, R) {
-    const L = (0, n.FpInvertBatch)(j.Fp, R.map((_) => _.Z));
-    return R.map((_, K) => j.fromAffine(_.toAffine(L[K])));
-  }
-  function g(j, R) {
-    if (!Number.isSafeInteger(j) || j <= 0 || j > R)
-      throw new Error("invalid window size, expected [1.." + R + "], got W=" + j);
-  }
-  function p(j, R) {
-    g(j, R);
-    const L = Math.ceil(R / j) + 1, _ = 2 ** (j - 1), K = 2 ** j, W = (0, e.bitMask)(j), D = BigInt(j);
-    return { windows: L, windowSize: _, mask: W, maxNumber: K, shiftBy: D };
-  }
-  function v(j, R, L) {
-    const { windowSize: _, mask: K, maxNumber: W, shiftBy: D } = L;
-    let d = Number(j & K), l = j >> D;
-    d > _ && (d -= W, l += t);
-    const r = R * _, a = r + Math.abs(d) - 1, i = d === 0, o = d < 0, h = R % 2 !== 0;
-    return { nextN: l, offset: a, isZero: i, isNeg: o, isNegF: h, offsetF: r };
-  }
-  function U(j, R) {
+  if (Tt) return Oe;
+  Tt = 1, Object.defineProperty(Oe, "__esModule", { value: !0 }), Oe.wNAF = void 0, Oe.negateCt = l, Oe.normalizeZ = m, Oe.mulEndoUnsafe = M, Oe.pippenger = Q, Oe.precomputeMSMUnsafe = F, Oe.validateBasic = G, Oe._createCurveFields = ie;
+  const e = /* @__PURE__ */ Ce(), r = /* @__PURE__ */ $e(), c = BigInt(0), t = BigInt(1);
+  function l(j, O) {
+    const L = O.negate();
+    return j ? L : O;
+  }
+  function m(j, O) {
+    const L = (0, r.FpInvertBatch)(j.Fp, O.map((_) => _.Z));
+    return O.map((_, K) => j.fromAffine(_.toAffine(L[K])));
+  }
+  function g(j, O) {
+    if (!Number.isSafeInteger(j) || j <= 0 || j > O)
+      throw new Error("invalid window size, expected [1.." + O + "], got W=" + j);
+  }
+  function p(j, O) {
+    g(j, O);
+    const L = Math.ceil(O / j) + 1, _ = 2 ** (j - 1), K = 2 ** j, W = (0, e.bitMask)(j), z = BigInt(j);
+    return { windows: L, windowSize: _, mask: W, maxNumber: K, shiftBy: z };
+  }
+  function v(j, O, L) {
+    const { windowSize: _, mask: K, maxNumber: W, shiftBy: z } = L;
+    let d = Number(j & K), u = j >> z;
+    d > _ && (d -= W, u += t);
+    const n = O * _, a = n + Math.abs(d) - 1, i = d === 0, o = d < 0, h = O % 2 !== 0;
+    return { nextN: u, offset: a, isZero: i, isNeg: o, isNegF: h, offsetF: n };
+  }
+  function U(j, O) {
     if (!Array.isArray(j))
       throw new Error("array expected");
     j.forEach((L, _) => {
-      if (!(L instanceof R))
+      if (!(L instanceof O))
         throw new Error("invalid point at index " + _);
     });
   }
-  function H(j, R) {
+  function H(j, O) {
     if (!Array.isArray(j))
       throw new Error("array of scalars expected");
     j.forEach((L, _) => {
-      if (!R.isValid(L))
+      if (!O.isValid(L))
         throw new Error("invalid scalar at index " + _);
     });
   }
-  const V = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap();
+  const k = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap();
   function b(j) {
     return E.get(j) || 1;
   }
@@ -564,12 +537,12 @@ function gn() {
   }
   class A {
     // Parametrized with a given Point class (not individual point)
-    constructor(R, L) {
-      this.BASE = R.BASE, this.ZERO = R.ZERO, this.Fn = R.Fn, this.bits = L;
+    constructor(O, L) {
+      this.BASE = O.BASE, this.ZERO = O.ZERO, this.Fn = O.Fn, this.bits = L;
     }
     // non-const time multiplication ladder
-    _unsafeLadder(R, L, _ = this.ZERO) {
-      let K = R;
+    _unsafeLadder(O, L, _ = this.ZERO) {
+      let K = O;
       for (; L > c; )
         L & t && (_ = _.add(K)), K = K.double(), L >>= t;
       return _;
@@ -586,14 +559,14 @@ function gn() {
      * @param W window size
      * @returns precomputed point tables flattened to a single array
      */
-    precomputeWindow(R, L) {
+    precomputeWindow(O, L) {
       const { windows: _, windowSize: K } = p(L, this.bits), W = [];
-      let D = R, d = D;
-      for (let l = 0; l < _; l++) {
-        d = D, W.push(d);
-        for (let r = 1; r < K; r++)
-          d = d.add(D), W.push(d);
-        D = d.double();
+      let z = O, d = z;
+      for (let u = 0; u < _; u++) {
+        d = z, W.push(d);
+        for (let n = 1; n < K; n++)
+          d = d.add(z), W.push(d);
+        z = d.double();
       }
       return W;
     }
@@ -603,14 +576,14 @@ function gn() {
      * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541
      * @returns real and fake (for const-time) points
      */
-    wNAF(R, L, _) {
+    wNAF(O, L, _) {
       if (!this.Fn.isValid(_))
         throw new Error("invalid scalar");
       let K = this.ZERO, W = this.BASE;
-      const D = p(R, this.bits);
-      for (let d = 0; d < D.windows; d++) {
-        const { nextN: l, offset: r, isZero: a, isNeg: i, isNegF: o, offsetF: h } = v(_, d, D);
-        _ = l, a ? W = W.add(u(o, L[h])) : K = K.add(u(i, L[r]));
+      const z = p(O, this.bits);
+      for (let d = 0; d < z.windows; d++) {
+        const { nextN: u, offset: n, isZero: a, isNeg: i, isNegF: o, offsetF: h } = v(_, d, z);
+        _ = u, a ? W = W.add(l(o, L[h])) : K = K.add(l(i, L[n]));
       }
       return S(_), { p: K, f: W };
     }
@@ -619,98 +592,98 @@ function gn() {
      * @param acc accumulator point to add result of multiplication
      * @returns point
      */
-    wNAFUnsafe(R, L, _, K = this.ZERO) {
-      const W = p(R, this.bits);
-      for (let D = 0; D < W.windows && _ !== c; D++) {
-        const { nextN: d, offset: l, isZero: r, isNeg: a } = v(_, D, W);
-        if (_ = d, !r) {
-          const i = L[l];
+    wNAFUnsafe(O, L, _, K = this.ZERO) {
+      const W = p(O, this.bits);
+      for (let z = 0; z < W.windows && _ !== c; z++) {
+        const { nextN: d, offset: u, isZero: n, isNeg: a } = v(_, z, W);
+        if (_ = d, !n) {
+          const i = L[u];
           K = K.add(a ? i.negate() : i);
         }
       }
       return S(_), K;
     }
-    getPrecomputes(R, L, _) {
-      let K = V.get(L);
-      return K || (K = this.precomputeWindow(L, R), R !== 1 && (typeof _ == "function" && (K = _(K)), V.set(L, K))), K;
+    getPrecomputes(O, L, _) {
+      let K = k.get(L);
+      return K || (K = this.precomputeWindow(L, O), O !== 1 && (typeof _ == "function" && (K = _(K)), k.set(L, K))), K;
     }
-    cached(R, L, _) {
-      const K = b(R);
-      return this.wNAF(K, this.getPrecomputes(K, R, _), L);
+    cached(O, L, _) {
+      const K = b(O);
+      return this.wNAF(K, this.getPrecomputes(K, O, _), L);
     }
-    unsafe(R, L, _, K) {
-      const W = b(R);
-      return W === 1 ? this._unsafeLadder(R, L, K) : this.wNAFUnsafe(W, this.getPrecomputes(W, R, _), L, K);
+    unsafe(O, L, _, K) {
+      const W = b(O);
+      return W === 1 ? this._unsafeLadder(O, L, K) : this.wNAFUnsafe(W, this.getPrecomputes(W, O, _), L, K);
     }
     // We calculate precomputes for elliptic curve point multiplication
     // using windowed method. This specifies window size and
     // stores precomputed values. Usually only base point would be precomputed.
-    createCache(R, L) {
-      g(L, this.bits), E.set(R, L), V.delete(R);
+    createCache(O, L) {
+      g(L, this.bits), E.set(O, L), k.delete(O);
     }
-    hasCache(R) {
-      return b(R) !== 1;
+    hasCache(O) {
+      return b(O) !== 1;
     }
   }
-  Re.wNAF = A;
-  function M(j, R, L, _) {
-    let K = R, W = j.ZERO, D = j.ZERO;
+  Oe.wNAF = A;
+  function M(j, O, L, _) {
+    let K = O, W = j.ZERO, z = j.ZERO;
     for (; L > c || _ > c; )
-      L & t && (W = W.add(K)), _ & t && (D = D.add(K)), K = K.double(), L >>= t, _ >>= t;
-    return { p1: W, p2: D };
+      L & t && (W = W.add(K)), _ & t && (z = z.add(K)), K = K.double(), L >>= t, _ >>= t;
+    return { p1: W, p2: z };
   }
-  function Q(j, R, L, _) {
-    U(L, j), H(_, R);
+  function Q(j, O, L, _) {
+    U(L, j), H(_, O);
     const K = L.length, W = _.length;
     if (K !== W)
       throw new Error("arrays of points and scalars must have equal length");
-    const D = j.ZERO, d = (0, e.bitLen)(BigInt(K));
-    let l = 1;
-    d > 12 ? l = d - 3 : d > 4 ? l = d - 2 : d > 0 && (l = 2);
-    const r = (0, e.bitMask)(l), a = new Array(Number(r) + 1).fill(D), i = Math.floor((R.BITS - 1) / l) * l;
-    let o = D;
-    for (let h = i; h >= 0; h -= l) {
-      a.fill(D);
+    const z = j.ZERO, d = (0, e.bitLen)(BigInt(K));
+    let u = 1;
+    d > 12 ? u = d - 3 : d > 4 ? u = d - 2 : d > 0 && (u = 2);
+    const n = (0, e.bitMask)(u), a = new Array(Number(n) + 1).fill(z), i = Math.floor((O.BITS - 1) / u) * u;
+    let o = z;
+    for (let h = i; h >= 0; h -= u) {
+      a.fill(z);
       for (let s = 0; s < W; s++) {
-        const f = _[s], y = Number(f >> BigInt(h) & r);
+        const f = _[s], y = Number(f >> BigInt(h) & n);
         a[y] = a[y].add(L[s]);
       }
-      let w = D;
-      for (let s = a.length - 1, f = D; s > 0; s--)
+      let w = z;
+      for (let s = a.length - 1, f = z; s > 0; s--)
         f = f.add(a[s]), w = w.add(f);
       if (o = o.add(w), h !== 0)
-        for (let s = 0; s < l; s++)
+        for (let s = 0; s < u; s++)
           o = o.double();
     }
     return o;
   }
-  function F(j, R, L, _) {
-    g(_, R.BITS), U(L, j);
-    const K = j.ZERO, W = 2 ** _ - 1, D = Math.ceil(R.BITS / _), d = (0, e.bitMask)(_), l = L.map((r) => {
+  function F(j, O, L, _) {
+    g(_, O.BITS), U(L, j);
+    const K = j.ZERO, W = 2 ** _ - 1, z = Math.ceil(O.BITS / _), d = (0, e.bitMask)(_), u = L.map((n) => {
       const a = [];
-      for (let i = 0, o = r; i < W; i++)
-        a.push(o), o = o.add(r);
+      for (let i = 0, o = n; i < W; i++)
+        a.push(o), o = o.add(n);
       return a;
     });
-    return (r) => {
-      if (H(r, R), r.length > L.length)
+    return (n) => {
+      if (H(n, O), n.length > L.length)
         throw new Error("array of scalars must be smaller than array of points");
       let a = K;
-      for (let i = 0; i < D; i++) {
+      for (let i = 0; i < z; i++) {
         if (a !== K)
           for (let h = 0; h < _; h++)
             a = a.double();
-        const o = BigInt(D * _ - (i + 1) * _);
-        for (let h = 0; h < r.length; h++) {
-          const w = r[h], s = Number(w >> o & d);
-          s && (a = a.add(l[h][s - 1]));
+        const o = BigInt(z * _ - (i + 1) * _);
+        for (let h = 0; h < n.length; h++) {
+          const w = n[h], s = Number(w >> o & d);
+          s && (a = a.add(u[h][s - 1]));
         }
       }
       return a;
     };
   }
   function G(j) {
-    return (0, n.validateField)(j.Fp), (0, e.validateObject)(j, {
+    return (0, r.validateField)(j.Fp), (0, e.validateObject)(j, {
       n: "bigint",
       h: "bigint",
       Gx: "field",
@@ -719,59 +692,59 @@ function gn() {
       nBitLength: "isSafeInteger",
       nByteLength: "isSafeInteger"
     }), Object.freeze({
-      ...(0, n.nLength)(j.n, j.nBitLength),
+      ...(0, r.nLength)(j.n, j.nBitLength),
       ...j,
       p: j.Fp.ORDER
     });
   }
-  function se(j, R, L) {
-    if (R) {
-      if (R.ORDER !== j)
+  function se(j, O, L) {
+    if (O) {
+      if (O.ORDER !== j)
         throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-      return (0, n.validateField)(R), R;
+      return (0, r.validateField)(O), O;
     } else
-      return (0, n.Field)(j, { isLE: L });
+      return (0, r.Field)(j, { isLE: L });
   }
-  function ie(j, R, L = {}, _) {
-    if (_ === void 0 && (_ = j === "edwards"), !R || typeof R != "object")
+  function ie(j, O, L = {}, _) {
+    if (_ === void 0 && (_ = j === "edwards"), !O || typeof O != "object")
       throw new Error(`expected valid ${j} CURVE object`);
-    for (const l of ["p", "n", "h"]) {
-      const r = R[l];
-      if (!(typeof r == "bigint" && r > c))
-        throw new Error(`CURVE.${l} must be positive bigint`);
+    for (const u of ["p", "n", "h"]) {
+      const n = O[u];
+      if (!(typeof n == "bigint" && n > c))
+        throw new Error(`CURVE.${u} must be positive bigint`);
     }
-    const K = se(R.p, L.Fp, _), W = se(R.n, L.Fn, _), d = ["Gx", "Gy", "a", j === "weierstrass" ? "b" : "d"];
-    for (const l of d)
-      if (!K.isValid(R[l]))
-        throw new Error(`CURVE.${l} must be valid field element of CURVE.Fp`);
-    return R = Object.freeze(Object.assign({}, R)), { CURVE: R, Fp: K, Fn: W };
+    const K = se(O.p, L.Fp, _), W = se(O.n, L.Fn, _), d = ["Gx", "Gy", "a", j === "weierstrass" ? "b" : "d"];
+    for (const u of d)
+      if (!K.isValid(O[u]))
+        throw new Error(`CURVE.${u} must be valid field element of CURVE.Fp`);
+    return O = Object.freeze(Object.assign({}, O)), { CURVE: O, Fp: K, Fn: W };
   }
-  return Re;
+  return Oe;
 }
-var Tt;
+var xt;
 function Ct() {
-  return Tt || (Tt = 1, (function(e) {
-    Object.defineProperty(e, "__esModule", { value: !0 }), e.DER = e.DERErr = void 0, e._splitEndoScalar = p, e._normFnElement = M, e.weierstrassN = Q, e.SWUFpSqrtRatio = G, e.mapToCurveSimpleSWU = se, e.ecdh = j, e.ecdsa = R, e.weierstrassPoints = L, e._legacyHelperEquat = W, e.weierstrass = l;
-    const n = /* @__PURE__ */ ln(), c = /* @__PURE__ */ We(), t = /* @__PURE__ */ Ce(), u = /* @__PURE__ */ gn(), m = /* @__PURE__ */ $e(), g = (r, a) => (r + (r >= 0 ? a : -a) / b) / a;
-    function p(r, a, i) {
-      const [[o, h], [w, s]] = a, f = g(s * r, i), y = g(-h * r, i);
-      let B = r - f * o - y * w, O = -f * h - y * s;
-      const k = B < V, Y = O < V;
-      k && (B = -B), Y && (O = -O);
+  return xt || (xt = 1, (function(e) {
+    Object.defineProperty(e, "__esModule", { value: !0 }), e.DER = e.DERErr = void 0, e._splitEndoScalar = p, e._normFnElement = M, e.weierstrassN = Q, e.SWUFpSqrtRatio = G, e.mapToCurveSimpleSWU = se, e.ecdh = j, e.ecdsa = O, e.weierstrassPoints = L, e._legacyHelperEquat = W, e.weierstrass = u;
+    const r = /* @__PURE__ */ ln(), c = /* @__PURE__ */ We(), t = /* @__PURE__ */ Ce(), l = /* @__PURE__ */ gn(), m = /* @__PURE__ */ $e(), g = (n, a) => (n + (n >= 0 ? a : -a) / b) / a;
+    function p(n, a, i) {
+      const [[o, h], [w, s]] = a, f = g(s * n, i), y = g(-h * n, i);
+      let B = n - f * o - y * w, T = -f * h - y * s;
+      const V = B < k, Y = T < k;
+      V && (B = -B), Y && (T = -T);
       const I = (0, t.bitMask)(Math.ceil((0, t.bitLen)(i) / 2)) + E;
-      if (B < V || B >= I || O < V || O >= I)
-        throw new Error("splitScalar (endomorphism): failed, k=" + r);
-      return { k1neg: k, k1: B, k2neg: Y, k2: O };
+      if (B < k || B >= I || T < k || T >= I)
+        throw new Error("splitScalar (endomorphism): failed, k=" + n);
+      return { k1neg: V, k1: B, k2neg: Y, k2: T };
     }
-    function v(r) {
-      if (!["compact", "recovered", "der"].includes(r))
+    function v(n) {
+      if (!["compact", "recovered", "der"].includes(n))
         throw new Error('Signature format must be "compact", "recovered", or "der"');
-      return r;
+      return n;
     }
-    function U(r, a) {
+    function U(n, a) {
       const i = {};
       for (let o of Object.keys(a))
-        i[o] = r[o] === void 0 ? a[o] : r[o];
+        i[o] = n[o] === void 0 ? a[o] : n[o];
       return (0, t._abool2)(i.lowS, "lowS"), (0, t._abool2)(i.prehash, "prehash"), i.format !== void 0 && v(i.format), i;
     }
     class H extends Error {
@@ -784,9 +757,9 @@ function Ct() {
       Err: H,
       // Basic building block is TLV (Tag-Length-Value)
       _tlv: {
-        encode: (r, a) => {
+        encode: (n, a) => {
           const { Err: i } = e.DER;
-          if (r < 0 || r > 256)
+          if (n < 0 || n > 256)
             throw new i("tlv.encode: wrong tag");
           if (a.length & 1)
             throw new i("tlv.encode: unpadded data");
@@ -794,15 +767,15 @@ function Ct() {
           if (h.length / 2 & 128)
             throw new i("tlv.encode: long form length too big");
           const w = o > 127 ? (0, t.numberToHexUnpadded)(h.length / 2 | 128) : "";
-          return (0, t.numberToHexUnpadded)(r) + w + h + a;
+          return (0, t.numberToHexUnpadded)(n) + w + h + a;
         },
         // v - value, l - left bytes (unparsed)
-        decode(r, a) {
+        decode(n, a) {
           const { Err: i } = e.DER;
           let o = 0;
-          if (r < 0 || r > 256)
+          if (n < 0 || n > 256)
             throw new i("tlv.encode: wrong tag");
-          if (a.length < 2 || a[o++] !== r)
+          if (a.length < 2 || a[o++] !== n)
             throw new i("tlv.decode: wrong tlv");
           const h = a[o++], w = !!(h & 128);
           let s = 0;
@@ -819,8 +792,8 @@ function Ct() {
               throw new i("tlv.decode: length bytes not complete");
             if (B[0] === 0)
               throw new i("tlv.decode(long): zero leftmost byte");
-            for (const O of B)
-              s = s << 8 | O;
+            for (const T of B)
+              s = s << 8 | T;
             if (o += y, s < 128)
               throw new i("tlv.decode(long): not minimal encoding");
           }
@@ -835,58 +808,58 @@ function Ct() {
       // - add zero byte if exists
       // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)
       _int: {
-        encode(r) {
+        encode(n) {
           const { Err: a } = e.DER;
-          if (r < V)
+          if (n < k)
             throw new a("integer: negative integers are not allowed");
-          let i = (0, t.numberToHexUnpadded)(r);
+          let i = (0, t.numberToHexUnpadded)(n);
           if (Number.parseInt(i[0], 16) & 8 && (i = "00" + i), i.length & 1)
             throw new a("unexpected DER parsing assertion: unpadded hex");
           return i;
         },
-        decode(r) {
+        decode(n) {
           const { Err: a } = e.DER;
-          if (r[0] & 128)
+          if (n[0] & 128)
             throw new a("invalid signature integer: negative");
-          if (r[0] === 0 && !(r[1] & 128))
+          if (n[0] === 0 && !(n[1] & 128))
             throw new a("invalid signature integer: unnecessary leading zero");
-          return (0, t.bytesToNumberBE)(r);
+          return (0, t.bytesToNumberBE)(n);
         }
       },
-      toSig(r) {
-        const { Err: a, _int: i, _tlv: o } = e.DER, h = (0, t.ensureBytes)("signature", r), { v: w, l: s } = o.decode(48, h);
+      toSig(n) {
+        const { Err: a, _int: i, _tlv: o } = e.DER, h = (0, t.ensureBytes)("signature", n), { v: w, l: s } = o.decode(48, h);
         if (s.length)
           throw new a("invalid signature: left bytes after parsing");
-        const { v: f, l: y } = o.decode(2, w), { v: B, l: O } = o.decode(2, y);
-        if (O.length)
+        const { v: f, l: y } = o.decode(2, w), { v: B, l: T } = o.decode(2, y);
+        if (T.length)
           throw new a("invalid signature: left bytes after parsing");
         return { r: i.decode(f), s: i.decode(B) };
       },
-      hexFromSig(r) {
-        const { _tlv: a, _int: i } = e.DER, o = a.encode(2, i.encode(r.r)), h = a.encode(2, i.encode(r.s)), w = o + h;
+      hexFromSig(n) {
+        const { _tlv: a, _int: i } = e.DER, o = a.encode(2, i.encode(n.r)), h = a.encode(2, i.encode(n.s)), w = o + h;
         return a.encode(48, w);
       }
     };
-    const V = BigInt(0), E = BigInt(1), b = BigInt(2), S = BigInt(3), A = BigInt(4);
-    function M(r, a) {
-      const { BYTES: i } = r;
+    const k = BigInt(0), E = BigInt(1), b = BigInt(2), S = BigInt(3), A = BigInt(4);
+    function M(n, a) {
+      const { BYTES: i } = n;
       let o;
       if (typeof a == "bigint")
         o = a;
       else {
         let h = (0, t.ensureBytes)("private key", a);
         try {
-          o = r.fromBytes(h);
+          o = n.fromBytes(h);
         } catch {
           throw new Error(`invalid private key: expected ui8a of size ${i}, got ${typeof a}`);
         }
       }
-      if (!r.isValidNot0(o))
+      if (!n.isValidNot0(o))
         throw new Error("invalid private key: out of range [1..N-1]");
       return o;
     }
-    function Q(r, a = {}) {
-      const i = (0, u._createCurveFields)("weierstrass", r, a), { Fp: o, Fn: h } = i;
+    function Q(n, a = {}) {
+      const i = (0, l._createCurveFields)("weierstrass", n, a), { Fp: o, Fn: h } = i;
       let w = i.CURVE;
       const { h: s, n: f } = w;
       (0, t._validateObject)(a, {}, {
@@ -902,23 +875,23 @@ function Ct() {
       if (y && (!o.is0(w.a) || typeof y.beta != "bigint" || !Array.isArray(y.basises)))
         throw new Error('invalid endo: expected "beta": bigint and "basises": array');
       const B = ie(o, h);
-      function O() {
+      function T() {
         if (!o.isOdd)
           throw new Error("compression is not supported: Field does not have .isOdd()");
       }
-      function k(le, Z, N) {
-        const { x, y: z } = Z.toAffine(), J = o.toBytes(x);
+      function V(le, Z, N) {
+        const { x: R, y: D } = Z.toAffine(), J = o.toBytes(R);
         if ((0, t._abool2)(N, "isCompressed"), N) {
-          O();
-          const re = !o.isOdd(z);
+          T();
+          const re = !o.isOdd(D);
           return (0, t.concatBytes)(F(re), J);
         } else
-          return (0, t.concatBytes)(Uint8Array.of(4), J, o.toBytes(z));
+          return (0, t.concatBytes)(Uint8Array.of(4), J, o.toBytes(D));
       }
       function Y(le) {
         (0, t._abytes2)(le, void 0, "Point");
-        const { publicKey: Z, publicKeyUncompressed: N } = B, x = le.length, z = le[0], J = le.subarray(1);
-        if (x === Z && (z === 2 || z === 3)) {
+        const { publicKey: Z, publicKeyUncompressed: N } = B, R = le.length, D = le[0], J = le.subarray(1);
+        if (R === Z && (D === 2 || D === 3)) {
           const re = o.fromBytes(J);
           if (!o.isValid(re))
             throw new Error("bad point: is not on curve, wrong x");
@@ -930,30 +903,30 @@ function Ct() {
             const de = we instanceof Error ? ": " + we.message : "";
             throw new Error("bad point: is not on curve, sqrt error" + de);
           }
-          O();
+          T();
           const oe = o.isOdd(ee);
-          return (z & 1) === 1 !== oe && (ee = o.neg(ee)), { x: re, y: ee };
-        } else if (x === N && z === 4) {
+          return (D & 1) === 1 !== oe && (ee = o.neg(ee)), { x: re, y: ee };
+        } else if (R === N && D === 4) {
           const re = o.BYTES, ne = o.fromBytes(J.subarray(0, re)), ee = o.fromBytes(J.subarray(re, re * 2));
           if (!te(ne, ee))
             throw new Error("bad point: is not on curve");
           return { x: ne, y: ee };
         } else
-          throw new Error(`bad point: got length ${x}, expected compressed=${Z} or uncompressed=${N}`);
+          throw new Error(`bad point: got length ${R}, expected compressed=${Z} or uncompressed=${N}`);
       }
-      const I = a.toBytes || k, q = a.fromBytes || Y;
+      const I = a.toBytes || V, q = a.fromBytes || Y;
       function C(le) {
         const Z = o.sqr(le), N = o.mul(Z, le);
         return o.add(o.add(N, o.mul(le, w.a)), w.b);
       }
       function te(le, Z) {
-        const N = o.sqr(Z), x = C(le);
-        return o.eql(N, x);
+        const N = o.sqr(Z), R = C(le);
+        return o.eql(N, R);
       }
       if (!te(w.Gx, w.Gy))
         throw new Error("bad curve params: generator point");
-      const $ = o.mul(o.pow(w.a, S), A), T = o.mul(o.sqr(w.b), BigInt(27));
-      if (o.is0(o.add($, T)))
+      const $ = o.mul(o.pow(w.a, S), A), x = o.mul(o.sqr(w.b), BigInt(27));
+      if (o.is0(o.add($, x)))
         throw new Error("bad curve params: a or b");
       function X(le, Z, N = !1) {
         if (!o.isValid(Z) || N && o.is0(Z))
@@ -970,12 +943,12 @@ function Ct() {
         return p(le, y.basises, h.ORDER);
       }
       const pe = (0, t.memoized)((le, Z) => {
-        const { X: N, Y: x, Z: z } = le;
-        if (o.eql(z, o.ONE))
-          return { x: N, y: x };
+        const { X: N, Y: R, Z: D } = le;
+        if (o.eql(D, o.ONE))
+          return { x: N, y: R };
         const J = le.is0();
-        Z == null && (Z = J ? o.ONE : o.inv(z));
-        const re = o.mul(N, Z), ne = o.mul(x, Z), ee = o.mul(z, Z);
+        Z == null && (Z = J ? o.ONE : o.inv(D));
+        const re = o.mul(N, Z), ne = o.mul(R, Z), ee = o.mul(D, Z);
         if (J)
           return { x: o.ZERO, y: o.ZERO };
         if (!o.eql(ee, o.ONE))
@@ -996,25 +969,25 @@ function Ct() {
           throw new Error("bad point: not in prime-order subgroup");
         return !0;
       });
-      function Te(le, Z, N, x, z) {
-        return N = new fe(o.mul(N.X, le), N.Y, N.Z), Z = (0, u.negateCt)(x, Z), N = (0, u.negateCt)(z, N), Z.add(N);
+      function xe(le, Z, N, R, D) {
+        return N = new fe(o.mul(N.X, le), N.Y, N.Z), Z = (0, l.negateCt)(R, Z), N = (0, l.negateCt)(D, N), Z.add(N);
       }
       class fe {
         /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-        constructor(Z, N, x) {
-          this.X = X("x", Z), this.Y = X("y", N, !0), this.Z = X("z", x), Object.freeze(this);
+        constructor(Z, N, R) {
+          this.X = X("x", Z), this.Y = X("y", N, !0), this.Z = X("z", R), Object.freeze(this);
         }
         static CURVE() {
           return w;
         }
         /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
         static fromAffine(Z) {
-          const { x: N, y: x } = Z || {};
-          if (!Z || !o.isValid(N) || !o.isValid(x))
+          const { x: N, y: R } = Z || {};
+          if (!Z || !o.isValid(N) || !o.isValid(R))
             throw new Error("invalid affine point");
           if (Z instanceof fe)
             throw new Error("projective point not allowed");
-          return o.is0(N) && o.is0(x) ? fe.ZERO : new fe(N, x, o.ONE);
+          return o.is0(N) && o.is0(R) ? fe.ZERO : new fe(N, R, o.ONE);
         }
         static fromBytes(Z) {
           const N = fe.fromAffine(q((0, t._abytes2)(Z, void 0, "point")));
@@ -1052,7 +1025,7 @@ function Ct() {
         /** Compare one point to another. */
         equals(Z) {
           ae(Z);
-          const { X: N, Y: x, Z: z } = this, { X: J, Y: re, Z: ne } = Z, ee = o.eql(o.mul(N, ne), o.mul(J, z)), oe = o.eql(o.mul(x, ne), o.mul(re, z));
+          const { X: N, Y: R, Z: D } = this, { X: J, Y: re, Z: ne } = Z, ee = o.eql(o.mul(N, ne), o.mul(J, D)), oe = o.eql(o.mul(R, ne), o.mul(re, D));
           return ee && oe;
         }
         /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
@@ -1064,9 +1037,9 @@ function Ct() {
         // https://eprint.iacr.org/2015/1060, algorithm 3
         // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
         double() {
-          const { a: Z, b: N } = w, x = o.mul(N, S), { X: z, Y: J, Z: re } = this;
-          let ne = o.ZERO, ee = o.ZERO, oe = o.ZERO, ce = o.mul(z, z), we = o.mul(J, J), de = o.mul(re, re), ue = o.mul(z, J);
-          return ue = o.add(ue, ue), oe = o.mul(z, re), oe = o.add(oe, oe), ne = o.mul(Z, oe), ee = o.mul(x, de), ee = o.add(ne, ee), ne = o.sub(we, ee), ee = o.add(we, ee), ee = o.mul(ne, ee), ne = o.mul(ue, ne), oe = o.mul(x, oe), de = o.mul(Z, de), ue = o.sub(ce, de), ue = o.mul(Z, ue), ue = o.add(ue, oe), oe = o.add(ce, ce), ce = o.add(oe, ce), ce = o.add(ce, de), ce = o.mul(ce, ue), ee = o.add(ee, ce), de = o.mul(J, re), de = o.add(de, de), ce = o.mul(de, ue), ne = o.sub(ne, ce), oe = o.mul(de, we), oe = o.add(oe, oe), oe = o.add(oe, oe), new fe(ne, ee, oe);
+          const { a: Z, b: N } = w, R = o.mul(N, S), { X: D, Y: J, Z: re } = this;
+          let ne = o.ZERO, ee = o.ZERO, oe = o.ZERO, ce = o.mul(D, D), we = o.mul(J, J), de = o.mul(re, re), ue = o.mul(D, J);
+          return ue = o.add(ue, ue), oe = o.mul(D, re), oe = o.add(oe, oe), ne = o.mul(Z, oe), ee = o.mul(R, de), ee = o.add(ne, ee), ne = o.sub(we, ee), ee = o.add(we, ee), ee = o.mul(ne, ee), ne = o.mul(ue, ne), oe = o.mul(R, oe), de = o.mul(Z, de), ue = o.sub(ce, de), ue = o.mul(Z, ue), ue = o.add(ue, oe), oe = o.add(ce, ce), ce = o.add(oe, ce), ce = o.add(ce, de), ce = o.mul(ce, ue), ee = o.add(ee, ce), de = o.mul(J, re), de = o.add(de, de), ce = o.mul(de, ue), ne = o.sub(ne, ce), oe = o.mul(de, we), oe = o.add(oe, oe), oe = o.add(oe, oe), new fe(ne, ee, oe);
         }
         // Renes-Costello-Batina exception-free addition formula.
         // There is 30% faster Jacobian formula, but it is not complete.
@@ -1074,13 +1047,13 @@ function Ct() {
         // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
         add(Z) {
           ae(Z);
-          const { X: N, Y: x, Z: z } = this, { X: J, Y: re, Z: ne } = Z;
+          const { X: N, Y: R, Z: D } = this, { X: J, Y: re, Z: ne } = Z;
           let ee = o.ZERO, oe = o.ZERO, ce = o.ZERO;
           const we = w.a, de = o.mul(w.b, S);
-          let ue = o.mul(N, J), me = o.mul(x, re), ge = o.mul(z, ne), _e = o.add(N, x), be = o.add(J, re);
-          _e = o.mul(_e, be), be = o.add(ue, me), _e = o.sub(_e, be), be = o.add(N, z);
+          let ue = o.mul(N, J), me = o.mul(R, re), ge = o.mul(D, ne), _e = o.add(N, R), be = o.add(J, re);
+          _e = o.mul(_e, be), be = o.add(ue, me), _e = o.sub(_e, be), be = o.add(N, D);
           let Ee = o.add(J, ne);
-          return be = o.mul(be, Ee), Ee = o.add(ue, ge), be = o.sub(be, Ee), Ee = o.add(x, z), ee = o.add(re, ne), Ee = o.mul(Ee, ee), ee = o.add(me, ge), Ee = o.sub(Ee, ee), ce = o.mul(we, be), ee = o.mul(de, ge), ce = o.add(ee, ce), ee = o.sub(me, ce), ce = o.add(me, ce), oe = o.mul(ee, ce), me = o.add(ue, ue), me = o.add(me, ue), ge = o.mul(we, ge), be = o.mul(de, be), me = o.add(me, ge), ge = o.sub(ue, ge), ge = o.mul(we, ge), be = o.add(be, ge), ue = o.mul(me, be), oe = o.add(oe, ue), ue = o.mul(Ee, be), ee = o.mul(_e, ee), ee = o.sub(ee, ue), ue = o.mul(_e, me), ce = o.mul(Ee, ce), ce = o.add(ce, ue), new fe(ee, oe, ce);
+          return be = o.mul(be, Ee), Ee = o.add(ue, ge), be = o.sub(be, Ee), Ee = o.add(R, D), ee = o.add(re, ne), Ee = o.mul(Ee, ee), ee = o.add(me, ge), Ee = o.sub(Ee, ee), ce = o.mul(we, be), ee = o.mul(de, ge), ce = o.add(ee, ce), ee = o.sub(me, ce), ce = o.add(me, ce), oe = o.mul(ee, ce), me = o.add(ue, ue), me = o.add(me, ue), ge = o.mul(we, ge), be = o.mul(de, be), me = o.add(me, ge), ge = o.sub(ue, ge), ge = o.mul(we, ge), be = o.add(be, ge), ue = o.mul(me, be), oe = o.add(oe, ue), ue = o.mul(Ee, be), ee = o.mul(_e, ee), ee = o.sub(ee, ue), ue = o.mul(_e, me), ce = o.mul(Ee, ce), ce = o.add(ce, ue), new fe(ee, oe, ce);
         }
         subtract(Z) {
           return this.add(Z.negate());
@@ -1101,16 +1074,16 @@ function Ct() {
           const { endo: N } = a;
           if (!h.isValidNot0(Z))
             throw new Error("invalid scalar: out of range");
-          let x, z;
-          const J = (re) => Ue.cached(this, re, (ne) => (0, u.normalizeZ)(fe, ne));
+          let R, D;
+          const J = (re) => Ue.cached(this, re, (ne) => (0, l.normalizeZ)(fe, ne));
           if (N) {
             const { k1neg: re, k1: ne, k2neg: ee, k2: oe } = ye(Z), { p: ce, f: we } = J(ne), { p: de, f: ue } = J(oe);
-            z = we.add(ue), x = Te(N.beta, ce, de, re, ee);
+            D = we.add(ue), R = xe(N.beta, ce, de, re, ee);
           } else {
             const { p: re, f: ne } = J(Z);
-            x = re, z = ne;
+            R = re, D = ne;
           }
-          return (0, u.normalizeZ)(fe, [x, z])[0];
+          return (0, l.normalizeZ)(fe, [R, D])[0];
         }
         /**
          * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -1118,24 +1091,24 @@ function Ct() {
          * an exposed secret key e.g. sig verification, which works over *public* keys.
          */
         multiplyUnsafe(Z) {
-          const { endo: N } = a, x = this;
+          const { endo: N } = a, R = this;
           if (!h.isValid(Z))
             throw new Error("invalid scalar: out of range");
-          if (Z === V || x.is0())
+          if (Z === k || R.is0())
             return fe.ZERO;
           if (Z === E)
-            return x;
+            return R;
           if (Ue.hasCache(this))
             return this.multiply(Z);
           if (N) {
-            const { k1neg: z, k1: J, k2neg: re, k2: ne } = ye(Z), { p1: ee, p2: oe } = (0, u.mulEndoUnsafe)(fe, x, J, ne);
-            return Te(N.beta, ee, oe, z, re);
+            const { k1neg: D, k1: J, k2neg: re, k2: ne } = ye(Z), { p1: ee, p2: oe } = (0, l.mulEndoUnsafe)(fe, R, J, ne);
+            return xe(N.beta, ee, oe, D, re);
           } else
-            return Ue.unsafe(x, Z);
+            return Ue.unsafe(R, Z);
         }
-        multiplyAndAddUnsafe(Z, N, x) {
-          const z = this.multiplyUnsafe(N).add(Z.multiplyUnsafe(x));
-          return z.is0() ? void 0 : z;
+        multiplyAndAddUnsafe(Z, N, R) {
+          const D = this.multiplyUnsafe(N).add(Z.multiplyUnsafe(R));
+          return D.is0() ? void 0 : D;
         }
         /**
          * Converts Projective point to affine (x, y) coordinates.
@@ -1185,91 +1158,91 @@ function Ct() {
           this.precompute(Z);
         }
         static normalizeZ(Z) {
-          return (0, u.normalizeZ)(fe, Z);
+          return (0, l.normalizeZ)(fe, Z);
         }
         static msm(Z, N) {
-          return (0, u.pippenger)(fe, h, Z, N);
+          return (0, l.pippenger)(fe, h, Z, N);
         }
         static fromPrivateKey(Z) {
           return fe.BASE.multiply(M(h, Z));
         }
       }
       fe.BASE = new fe(w.Gx, w.Gy, o.ONE), fe.ZERO = new fe(o.ZERO, o.ONE, o.ZERO), fe.Fp = o, fe.Fn = h;
-      const Ye = h.BITS, Ue = new u.wNAF(fe, a.endo ? Math.ceil(Ye / 2) : Ye);
+      const Ye = h.BITS, Ue = new l.wNAF(fe, a.endo ? Math.ceil(Ye / 2) : Ye);
       return fe.BASE.precompute(8), fe;
     }
-    function F(r) {
-      return Uint8Array.of(r ? 2 : 3);
+    function F(n) {
+      return Uint8Array.of(n ? 2 : 3);
     }
-    function G(r, a) {
-      const i = r.ORDER;
-      let o = V;
-      for (let q = i - E; q % b === V; q /= b)
+    function G(n, a) {
+      const i = n.ORDER;
+      let o = k;
+      for (let q = i - E; q % b === k; q /= b)
         o += E;
-      const h = o, w = b << h - E - E, s = w * b, f = (i - E) / s, y = (f - E) / b, B = s - E, O = w, k = r.pow(a, f), Y = r.pow(a, (f + E) / b);
+      const h = o, w = b << h - E - E, s = w * b, f = (i - E) / s, y = (f - E) / b, B = s - E, T = w, V = n.pow(a, f), Y = n.pow(a, (f + E) / b);
       let I = (q, C) => {
-        let te = k, $ = r.pow(C, B), T = r.sqr($);
-        T = r.mul(T, C);
-        let X = r.mul(q, T);
-        X = r.pow(X, y), X = r.mul(X, $), $ = r.mul(X, C), T = r.mul(X, q);
-        let ae = r.mul(T, $);
-        X = r.pow(ae, O);
-        let ye = r.eql(X, r.ONE);
-        $ = r.mul(T, Y), X = r.mul(ae, te), T = r.cmov($, T, ye), ae = r.cmov(X, ae, ye);
+        let te = V, $ = n.pow(C, B), x = n.sqr($);
+        x = n.mul(x, C);
+        let X = n.mul(q, x);
+        X = n.pow(X, y), X = n.mul(X, $), $ = n.mul(X, C), x = n.mul(X, q);
+        let ae = n.mul(x, $);
+        X = n.pow(ae, T);
+        let ye = n.eql(X, n.ONE);
+        $ = n.mul(x, Y), X = n.mul(ae, te), x = n.cmov($, x, ye), ae = n.cmov(X, ae, ye);
         for (let pe = h; pe > E; pe--) {
           let ve = pe - b;
           ve = b << ve - E;
-          let Te = r.pow(ae, ve);
-          const fe = r.eql(Te, r.ONE);
-          $ = r.mul(T, te), te = r.mul(te, te), Te = r.mul(ae, te), T = r.cmov($, T, fe), ae = r.cmov(Te, ae, fe);
+          let xe = n.pow(ae, ve);
+          const fe = n.eql(xe, n.ONE);
+          $ = n.mul(x, te), te = n.mul(te, te), xe = n.mul(ae, te), x = n.cmov($, x, fe), ae = n.cmov(xe, ae, fe);
         }
-        return { isValid: ye, value: T };
+        return { isValid: ye, value: x };
       };
-      if (r.ORDER % A === S) {
-        const q = (r.ORDER - S) / A, C = r.sqrt(r.neg(a));
+      if (n.ORDER % A === S) {
+        const q = (n.ORDER - S) / A, C = n.sqrt(n.neg(a));
         I = (te, $) => {
-          let T = r.sqr($);
-          const X = r.mul(te, $);
-          T = r.mul(T, X);
-          let ae = r.pow(T, q);
-          ae = r.mul(ae, X);
-          const ye = r.mul(ae, C), pe = r.mul(r.sqr(ae), $), ve = r.eql(pe, te);
-          let Te = r.cmov(ye, ae, ve);
-          return { isValid: ve, value: Te };
+          let x = n.sqr($);
+          const X = n.mul(te, $);
+          x = n.mul(x, X);
+          let ae = n.pow(x, q);
+          ae = n.mul(ae, X);
+          const ye = n.mul(ae, C), pe = n.mul(n.sqr(ae), $), ve = n.eql(pe, te);
+          let xe = n.cmov(ye, ae, ve);
+          return { isValid: ve, value: xe };
         };
       }
       return I;
     }
-    function se(r, a) {
-      (0, m.validateField)(r);
+    function se(n, a) {
+      (0, m.validateField)(n);
       const { A: i, B: o, Z: h } = a;
-      if (!r.isValid(i) || !r.isValid(o) || !r.isValid(h))
+      if (!n.isValid(i) || !n.isValid(o) || !n.isValid(h))
         throw new Error("mapToCurveSimpleSWU: invalid opts");
-      const w = G(r, h);
-      if (!r.isOdd)
+      const w = G(n, h);
+      if (!n.isOdd)
         throw new Error("Field does not have .isOdd()");
       return (s) => {
-        let f, y, B, O, k, Y, I, q;
-        f = r.sqr(s), f = r.mul(f, h), y = r.sqr(f), y = r.add(y, f), B = r.add(y, r.ONE), B = r.mul(B, o), O = r.cmov(h, r.neg(y), !r.eql(y, r.ZERO)), O = r.mul(O, i), y = r.sqr(B), Y = r.sqr(O), k = r.mul(Y, i), y = r.add(y, k), y = r.mul(y, B), Y = r.mul(Y, O), k = r.mul(Y, o), y = r.add(y, k), I = r.mul(f, B);
+        let f, y, B, T, V, Y, I, q;
+        f = n.sqr(s), f = n.mul(f, h), y = n.sqr(f), y = n.add(y, f), B = n.add(y, n.ONE), B = n.mul(B, o), T = n.cmov(h, n.neg(y), !n.eql(y, n.ZERO)), T = n.mul(T, i), y = n.sqr(B), Y = n.sqr(T), V = n.mul(Y, i), y = n.add(y, V), y = n.mul(y, B), Y = n.mul(Y, T), V = n.mul(Y, o), y = n.add(y, V), I = n.mul(f, B);
         const { isValid: C, value: te } = w(y, Y);
-        q = r.mul(f, s), q = r.mul(q, te), I = r.cmov(I, B, C), q = r.cmov(q, te, C);
-        const $ = r.isOdd(s) === r.isOdd(q);
-        q = r.cmov(r.neg(q), q, $);
-        const T = (0, m.FpInvertBatch)(r, [O], !0)[0];
-        return I = r.mul(I, T), { x: I, y: q };
+        q = n.mul(f, s), q = n.mul(q, te), I = n.cmov(I, B, C), q = n.cmov(q, te, C);
+        const $ = n.isOdd(s) === n.isOdd(q);
+        q = n.cmov(n.neg(q), q, $);
+        const x = (0, m.FpInvertBatch)(n, [T], !0)[0];
+        return I = n.mul(I, x), { x: I, y: q };
       };
     }
-    function ie(r, a) {
+    function ie(n, a) {
       return {
         secretKey: a.BYTES,
-        publicKey: 1 + r.BYTES,
-        publicKeyUncompressed: 1 + 2 * r.BYTES,
+        publicKey: 1 + n.BYTES,
+        publicKeyUncompressed: 1 + 2 * n.BYTES,
         publicKeyHasPrefix: !0,
         signature: 2 * a.BYTES
       };
     }
-    function j(r, a = {}) {
-      const { Fn: i } = r, o = a.randomBytes || t.randomBytes, h = Object.assign(ie(r.Fp, i), { seed: (0, m.getMinHashLength)(i.ORDER) });
+    function j(n, a = {}) {
+      const { Fn: i } = n, o = a.randomBytes || t.randomBytes, h = Object.assign(ie(n.Fp, i), { seed: (0, m.getMinHashLength)(i.ORDER) });
       function w(I) {
         try {
           return !!M(i, I);
@@ -1281,7 +1254,7 @@ function Ct() {
         const { publicKey: C, publicKeyUncompressed: te } = h;
         try {
           const $ = I.length;
-          return q === !0 && $ !== C || q === !1 && $ !== te ? !1 : !!r.fromBytes(I);
+          return q === !0 && $ !== C || q === !1 && $ !== te ? !1 : !!n.fromBytes(I);
         } catch {
           return !1;
         }
@@ -1290,16 +1263,16 @@ function Ct() {
         return (0, m.mapHashToField)((0, t._abytes2)(I, h.seed, "seed"), i.ORDER);
       }
       function y(I, q = !0) {
-        return r.BASE.multiply(M(i, I)).toBytes(q);
+        return n.BASE.multiply(M(i, I)).toBytes(q);
       }
       function B(I) {
         const q = f(I);
         return { secretKey: q, publicKey: y(q) };
       }
-      function O(I) {
+      function T(I) {
         if (typeof I == "bigint")
           return !1;
-        if (I instanceof r)
+        if (I instanceof n)
           return !0;
         const { secretKey: q, publicKey: C, publicKeyUncompressed: te } = h;
         if (i.allowedLengths || q === C)
@@ -1307,15 +1280,15 @@ function Ct() {
         const $ = (0, t.ensureBytes)("key", I).length;
         return $ === C || $ === te;
       }
-      function k(I, q, C = !0) {
-        if (O(I) === !0)
+      function V(I, q, C = !0) {
+        if (T(I) === !0)
           throw new Error("first arg must be private key");
-        if (O(q) === !1)
+        if (T(q) === !1)
           throw new Error("second arg must be public key");
         const te = M(i, I);
-        return r.fromHex(q).multiply(te).toBytes(C);
+        return n.fromHex(q).multiply(te).toBytes(C);
       }
-      return Object.freeze({ getPublicKey: y, getSharedSecret: k, keygen: B, Point: r, utils: {
+      return Object.freeze({ getPublicKey: y, getSharedSecret: V, keygen: B, Point: n, utils: {
         isValidSecretKey: w,
         isValidPublicKey: s,
         randomSecretKey: f,
@@ -1323,12 +1296,12 @@ function Ct() {
         isValidPrivateKey: w,
         randomPrivateKey: f,
         normPrivateKeyToScalar: (I) => M(i, I),
-        precompute(I = 8, q = r.BASE) {
+        precompute(I = 8, q = n.BASE) {
           return q.precompute(I, !1);
         }
       }, lengths: h });
     }
-    function R(r, a, i = {}) {
+    function O(n, a, i = {}) {
       (0, c.ahash)(a), (0, t._validateObject)(i, {}, {
         hmac: "function",
         lowS: "boolean",
@@ -1336,7 +1309,7 @@ function Ct() {
         bits2int: "function",
         bits2int_modN: "function"
       });
-      const o = i.randomBytes || t.randomBytes, h = i.hmac || ((N, ...x) => (0, n.hmac)(a, N, (0, t.concatBytes)(...x))), { Fp: w, Fn: s } = r, { ORDER: f, BITS: y } = s, { keygen: B, getPublicKey: O, getSharedSecret: k, utils: Y, lengths: I } = j(r, i), q = {
+      const o = i.randomBytes || t.randomBytes, h = i.hmac || ((N, ...R) => (0, r.hmac)(a, N, (0, t.concatBytes)(...R))), { Fp: w, Fn: s } = n, { ORDER: f, BITS: y } = s, { keygen: B, getPublicKey: T, getSharedSecret: V, utils: Y, lengths: I } = j(n, i), q = {
         prehash: !1,
         lowS: typeof i.lowS == "boolean" ? i.lowS : !1,
         format: void 0,
@@ -1344,50 +1317,50 @@ function Ct() {
         extraEntropy: !1
       }, C = "compact";
       function te(N) {
-        const x = f >> E;
-        return N > x;
+        const R = f >> E;
+        return N > R;
       }
-      function $(N, x) {
-        if (!s.isValidNot0(x))
+      function $(N, R) {
+        if (!s.isValidNot0(R))
           throw new Error(`invalid signature ${N}: out of range 1..Point.Fn.ORDER`);
-        return x;
+        return R;
       }
-      function T(N, x) {
-        v(x);
-        const z = I.signature, J = x === "compact" ? z : x === "recovered" ? z + 1 : void 0;
-        return (0, t._abytes2)(N, J, `${x} signature`);
+      function x(N, R) {
+        v(R);
+        const D = I.signature, J = R === "compact" ? D : R === "recovered" ? D + 1 : void 0;
+        return (0, t._abytes2)(N, J, `${R} signature`);
       }
       class X {
-        constructor(x, z, J) {
-          this.r = $("r", x), this.s = $("s", z), J != null && (this.recovery = J), Object.freeze(this);
+        constructor(R, D, J) {
+          this.r = $("r", R), this.s = $("s", D), J != null && (this.recovery = J), Object.freeze(this);
         }
-        static fromBytes(x, z = C) {
-          T(x, z);
+        static fromBytes(R, D = C) {
+          x(R, D);
           let J;
-          if (z === "der") {
-            const { r: oe, s: ce } = e.DER.toSig((0, t._abytes2)(x));
+          if (D === "der") {
+            const { r: oe, s: ce } = e.DER.toSig((0, t._abytes2)(R));
             return new X(oe, ce);
           }
-          z === "recovered" && (J = x[0], z = "compact", x = x.subarray(1));
-          const re = s.BYTES, ne = x.subarray(0, re), ee = x.subarray(re, re * 2);
+          D === "recovered" && (J = R[0], D = "compact", R = R.subarray(1));
+          const re = s.BYTES, ne = R.subarray(0, re), ee = R.subarray(re, re * 2);
           return new X(s.fromBytes(ne), s.fromBytes(ee), J);
         }
-        static fromHex(x, z) {
-          return this.fromBytes((0, t.hexToBytes)(x), z);
+        static fromHex(R, D) {
+          return this.fromBytes((0, t.hexToBytes)(R), D);
         }
-        addRecoveryBit(x) {
-          return new X(this.r, this.s, x);
+        addRecoveryBit(R) {
+          return new X(this.r, this.s, R);
         }
-        recoverPublicKey(x) {
-          const z = w.ORDER, { r: J, s: re, recovery: ne } = this;
+        recoverPublicKey(R) {
+          const D = w.ORDER, { r: J, s: re, recovery: ne } = this;
           if (ne == null || ![0, 1, 2, 3].includes(ne))
             throw new Error("recovery id invalid");
-          if (f * b < z && ne > 1)
+          if (f * b < D && ne > 1)
             throw new Error("recovery id is ambiguous for h>1 curve");
           const oe = ne === 2 || ne === 3 ? J + f : J;
           if (!w.isValid(oe))
             throw new Error("recovery id 2 or 3 invalid");
-          const ce = w.toBytes(oe), we = r.fromBytes((0, t.concatBytes)(F((ne & 1) === 0), ce)), de = s.inv(oe), ue = ye((0, t.ensureBytes)("msgHash", x)), me = s.create(-ue * de), ge = s.create(re * de), _e = r.BASE.multiplyUnsafe(me).add(we.multiplyUnsafe(ge));
+          const ce = w.toBytes(oe), we = n.fromBytes((0, t.concatBytes)(F((ne & 1) === 0), ce)), de = s.inv(oe), ue = ye((0, t.ensureBytes)("msgHash", R)), me = s.create(-ue * de), ge = s.create(re * de), _e = n.BASE.multiplyUnsafe(me).add(we.multiplyUnsafe(ge));
           if (_e.is0())
             throw new Error("point at infinify");
           return _e.assertValidity(), _e;
@@ -1396,28 +1369,28 @@ function Ct() {
         hasHighS() {
           return te(this.s);
         }
-        toBytes(x = C) {
-          if (v(x), x === "der")
+        toBytes(R = C) {
+          if (v(R), R === "der")
             return (0, t.hexToBytes)(e.DER.hexFromSig(this));
-          const z = s.toBytes(this.r), J = s.toBytes(this.s);
-          if (x === "recovered") {
+          const D = s.toBytes(this.r), J = s.toBytes(this.s);
+          if (R === "recovered") {
             if (this.recovery == null)
               throw new Error("recovery bit must be present");
-            return (0, t.concatBytes)(Uint8Array.of(this.recovery), z, J);
+            return (0, t.concatBytes)(Uint8Array.of(this.recovery), D, J);
           }
-          return (0, t.concatBytes)(z, J);
+          return (0, t.concatBytes)(D, J);
         }
-        toHex(x) {
-          return (0, t.bytesToHex)(this.toBytes(x));
+        toHex(R) {
+          return (0, t.bytesToHex)(this.toBytes(R));
         }
         // TODO: remove
         assertValidity() {
         }
-        static fromCompact(x) {
-          return X.fromBytes((0, t.ensureBytes)("sig", x), "compact");
+        static fromCompact(R) {
+          return X.fromBytes((0, t.ensureBytes)("sig", R), "compact");
         }
-        static fromDER(x) {
-          return X.fromBytes((0, t.ensureBytes)("sig", x), "der");
+        static fromDER(R) {
+          return X.fromBytes((0, t.ensureBytes)("sig", R), "der");
         }
         normalizeS() {
           return this.hasHighS() ? new X(this.r, s.neg(this.s), this.recovery) : this;
@@ -1435,26 +1408,26 @@ function Ct() {
           return (0, t.bytesToHex)(this.toBytes("compact"));
         }
       }
-      const ae = i.bits2int || function(x) {
-        if (x.length > 8192)
+      const ae = i.bits2int || function(R) {
+        if (R.length > 8192)
           throw new Error("input is too large");
-        const z = (0, t.bytesToNumberBE)(x), J = x.length * 8 - y;
-        return J > 0 ? z >> BigInt(J) : z;
-      }, ye = i.bits2int_modN || function(x) {
-        return s.create(ae(x));
+        const D = (0, t.bytesToNumberBE)(R), J = R.length * 8 - y;
+        return J > 0 ? D >> BigInt(J) : D;
+      }, ye = i.bits2int_modN || function(R) {
+        return s.create(ae(R));
       }, pe = (0, t.bitMask)(y);
       function ve(N) {
-        return (0, t.aInRange)("num < 2^" + y, N, V, pe), s.toBytes(N);
+        return (0, t.aInRange)("num < 2^" + y, N, k, pe), s.toBytes(N);
       }
-      function Te(N, x) {
-        return (0, t._abytes2)(N, void 0, "message"), x ? (0, t._abytes2)(a(N), void 0, "prehashed message") : N;
+      function xe(N, R) {
+        return (0, t._abytes2)(N, void 0, "message"), R ? (0, t._abytes2)(a(N), void 0, "prehashed message") : N;
       }
-      function fe(N, x, z) {
-        if (["recovered", "canonical"].some((me) => me in z))
+      function fe(N, R, D) {
+        if (["recovered", "canonical"].some((me) => me in D))
           throw new Error("sign() legacy options not supported");
-        const { lowS: J, prehash: re, extraEntropy: ne } = U(z, q);
-        N = Te(N, re);
-        const ee = ye(N), oe = M(s, x), ce = [ve(oe), ve(ee)];
+        const { lowS: J, prehash: re, extraEntropy: ne } = U(D, q);
+        N = xe(N, re);
+        const ee = ye(N), oe = M(s, R), ce = [ve(oe), ve(ee)];
         if (ne != null && ne !== !1) {
           const me = ne === !0 ? o(I.secretKey) : ne;
           ce.push((0, t.ensureBytes)("extraEntropy", me));
@@ -1464,73 +1437,73 @@ function Ct() {
           const ge = ae(me);
           if (!s.isValidNot0(ge))
             return;
-          const _e = s.inv(ge), be = r.BASE.multiply(ge).toAffine(), Ee = s.create(be.x);
-          if (Ee === V)
+          const _e = s.inv(ge), be = n.BASE.multiply(ge).toAffine(), Ee = s.create(be.x);
+          if (Ee === k)
             return;
           const Pe = s.create(_e * s.create(de + Ee * oe));
-          if (Pe === V)
+          if (Pe === k)
             return;
           let pt = (be.x === Ee ? 0 : 2) | Number(be.y & E), vt = Pe;
           return J && te(Pe) && (vt = s.neg(Pe), pt ^= 1), new X(Ee, vt, pt);
         }
         return { seed: we, k2sig: ue };
       }
-      function Ye(N, x, z = {}) {
+      function Ye(N, R, D = {}) {
         N = (0, t.ensureBytes)("message", N);
-        const { seed: J, k2sig: re } = fe(N, x, z);
+        const { seed: J, k2sig: re } = fe(N, R, D);
         return (0, t.createHmacDrbg)(a.outputLen, s.BYTES, h)(J, re);
       }
       function Ue(N) {
-        let x;
-        const z = typeof N == "string" || (0, t.isBytes)(N), J = !z && N !== null && typeof N == "object" && typeof N.r == "bigint" && typeof N.s == "bigint";
-        if (!z && !J)
+        let R;
+        const D = typeof N == "string" || (0, t.isBytes)(N), J = !D && N !== null && typeof N == "object" && typeof N.r == "bigint" && typeof N.s == "bigint";
+        if (!D && !J)
           throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
         if (J)
-          x = new X(N.r, N.s);
-        else if (z) {
+          R = new X(N.r, N.s);
+        else if (D) {
           try {
-            x = X.fromBytes((0, t.ensureBytes)("sig", N), "der");
+            R = X.fromBytes((0, t.ensureBytes)("sig", N), "der");
           } catch (re) {
             if (!(re instanceof e.DER.Err))
               throw re;
           }
-          if (!x)
+          if (!R)
             try {
-              x = X.fromBytes((0, t.ensureBytes)("sig", N), "compact");
+              R = X.fromBytes((0, t.ensureBytes)("sig", N), "compact");
             } catch {
               return !1;
             }
         }
-        return x || !1;
+        return R || !1;
       }
-      function le(N, x, z, J = {}) {
+      function le(N, R, D, J = {}) {
         const { lowS: re, prehash: ne, format: ee } = U(J, q);
-        if (z = (0, t.ensureBytes)("publicKey", z), x = Te((0, t.ensureBytes)("message", x), ne), "strict" in J)
+        if (D = (0, t.ensureBytes)("publicKey", D), R = xe((0, t.ensureBytes)("message", R), ne), "strict" in J)
           throw new Error("options.strict was renamed to lowS");
         const oe = ee === void 0 ? Ue(N) : X.fromBytes((0, t.ensureBytes)("sig", N), ee);
         if (oe === !1)
           return !1;
         try {
-          const ce = r.fromBytes(z);
+          const ce = n.fromBytes(D);
           if (re && oe.hasHighS())
             return !1;
-          const { r: we, s: de } = oe, ue = ye(x), me = s.inv(de), ge = s.create(ue * me), _e = s.create(we * me), be = r.BASE.multiplyUnsafe(ge).add(ce.multiplyUnsafe(_e));
+          const { r: we, s: de } = oe, ue = ye(R), me = s.inv(de), ge = s.create(ue * me), _e = s.create(we * me), be = n.BASE.multiplyUnsafe(ge).add(ce.multiplyUnsafe(_e));
           return be.is0() ? !1 : s.create(be.x) === we;
         } catch {
           return !1;
         }
       }
-      function Z(N, x, z = {}) {
-        const { prehash: J } = U(z, q);
-        return x = Te(x, J), X.fromBytes(N, "recovered").recoverPublicKey(x).toBytes();
+      function Z(N, R, D = {}) {
+        const { prehash: J } = U(D, q);
+        return R = xe(R, J), X.fromBytes(N, "recovered").recoverPublicKey(R).toBytes();
       }
       return Object.freeze({
         keygen: B,
-        getPublicKey: O,
-        getSharedSecret: k,
+        getPublicKey: T,
+        getSharedSecret: V,
         utils: Y,
         lengths: I,
-        Point: r,
+        Point: n,
         sign: Ye,
         verify: le,
         recoverPublicKey: Z,
@@ -1538,62 +1511,62 @@ function Ct() {
         hash: a
       });
     }
-    function L(r) {
-      const { CURVE: a, curveOpts: i } = _(r), o = Q(a, i);
-      return D(r, o);
+    function L(n) {
+      const { CURVE: a, curveOpts: i } = _(n), o = Q(a, i);
+      return z(n, o);
     }
-    function _(r) {
+    function _(n) {
       const a = {
-        a: r.a,
-        b: r.b,
-        p: r.Fp.ORDER,
-        n: r.n,
-        h: r.h,
-        Gx: r.Gx,
-        Gy: r.Gy
-      }, i = r.Fp;
-      let o = r.allowedPrivateKeyLengths ? Array.from(new Set(r.allowedPrivateKeyLengths.map((s) => Math.ceil(s / 2)))) : void 0;
+        a: n.a,
+        b: n.b,
+        p: n.Fp.ORDER,
+        n: n.n,
+        h: n.h,
+        Gx: n.Gx,
+        Gy: n.Gy
+      }, i = n.Fp;
+      let o = n.allowedPrivateKeyLengths ? Array.from(new Set(n.allowedPrivateKeyLengths.map((s) => Math.ceil(s / 2)))) : void 0;
       const h = (0, m.Field)(a.n, {
-        BITS: r.nBitLength,
+        BITS: n.nBitLength,
         allowedLengths: o,
-        modFromBytes: r.wrapPrivateKey
+        modFromBytes: n.wrapPrivateKey
       }), w = {
         Fp: i,
         Fn: h,
-        allowInfinityPoint: r.allowInfinityPoint,
-        endo: r.endo,
-        isTorsionFree: r.isTorsionFree,
-        clearCofactor: r.clearCofactor,
-        fromBytes: r.fromBytes,
-        toBytes: r.toBytes
+        allowInfinityPoint: n.allowInfinityPoint,
+        endo: n.endo,
+        isTorsionFree: n.isTorsionFree,
+        clearCofactor: n.clearCofactor,
+        fromBytes: n.fromBytes,
+        toBytes: n.toBytes
       };
       return { CURVE: a, curveOpts: w };
     }
-    function K(r) {
-      const { CURVE: a, curveOpts: i } = _(r), o = {
-        hmac: r.hmac,
-        randomBytes: r.randomBytes,
-        lowS: r.lowS,
-        bits2int: r.bits2int,
-        bits2int_modN: r.bits2int_modN
+    function K(n) {
+      const { CURVE: a, curveOpts: i } = _(n), o = {
+        hmac: n.hmac,
+        randomBytes: n.randomBytes,
+        lowS: n.lowS,
+        bits2int: n.bits2int,
+        bits2int_modN: n.bits2int_modN
       };
-      return { CURVE: a, curveOpts: i, hash: r.hash, ecdsaOpts: o };
+      return { CURVE: a, curveOpts: i, hash: n.hash, ecdsaOpts: o };
     }
-    function W(r, a, i) {
+    function W(n, a, i) {
       function o(h) {
-        const w = r.sqr(h), s = r.mul(w, h);
-        return r.add(r.add(s, r.mul(h, a)), i);
+        const w = n.sqr(h), s = n.mul(w, h);
+        return n.add(n.add(s, n.mul(h, a)), i);
       }
       return o;
     }
-    function D(r, a) {
+    function z(n, a) {
       const { Fp: i, Fn: o } = a;
       function h(s) {
         return (0, t.inRange)(s, E, o.ORDER);
       }
-      const w = W(i, r.a, r.b);
+      const w = W(i, n.a, n.b);
       return Object.assign({}, {
-        CURVE: r,
+        CURVE: n,
         Point: a,
         ProjectivePoint: a,
         normPrivateKeyToScalar: (s) => M(o, s),
@@ -1601,39 +1574,39 @@ function Ct() {
         isWithinCurveOrder: h
       });
     }
-    function d(r, a) {
+    function d(n, a) {
       const i = a.Point;
       return Object.assign({}, a, {
         ProjectivePoint: i,
-        CURVE: Object.assign({}, r, (0, m.nLength)(i.Fn.ORDER, i.Fn.BITS))
+        CURVE: Object.assign({}, n, (0, m.nLength)(i.Fn.ORDER, i.Fn.BITS))
       });
     }
-    function l(r) {
-      const { CURVE: a, curveOpts: i, hash: o, ecdsaOpts: h } = K(r), w = Q(a, i), s = R(w, o, h);
-      return d(r, s);
+    function u(n) {
+      const { CURVE: a, curveOpts: i, hash: o, ecdsaOpts: h } = K(n), w = Q(a, i), s = O(w, o, h);
+      return d(n, s);
     }
   })(nt)), nt;
 }
-var Rt;
+var Ot;
 function En() {
-  if (Rt) return Ke;
-  Rt = 1, Object.defineProperty(Ke, "__esModule", { value: !0 }), Ke.getHash = n, Ke.createCurve = c;
+  if (Ot) return Ke;
+  Ot = 1, Object.defineProperty(Ke, "__esModule", { value: !0 }), Ke.getHash = r, Ke.createCurve = c;
   const e = /* @__PURE__ */ Ct();
-  function n(t) {
+  function r(t) {
     return { hash: t };
   }
-  function c(t, u) {
+  function c(t, l) {
     const m = (g) => (0, e.weierstrass)({ ...t, hash: g });
-    return { ...m(u), create: m };
+    return { ...m(l), create: m };
   }
   return Ke;
 }
-var ot = {}, xt;
+var ot = {}, Rt;
 function Bn() {
-  return xt || (xt = 1, (function(e) {
-    Object.defineProperty(e, "__esModule", { value: !0 }), e._DST_scalar = void 0, e.expand_message_xmd = v, e.expand_message_xof = U, e.hash_to_field = H, e.isogenyMap = V, e.createHasher = E;
-    const n = /* @__PURE__ */ Ce(), c = /* @__PURE__ */ $e(), t = n.bytesToNumberBE;
-    function u(b, S) {
+  return Rt || (Rt = 1, (function(e) {
+    Object.defineProperty(e, "__esModule", { value: !0 }), e._DST_scalar = void 0, e.expand_message_xmd = v, e.expand_message_xof = U, e.hash_to_field = H, e.isogenyMap = k, e.createHasher = E;
+    const r = /* @__PURE__ */ Ce(), c = /* @__PURE__ */ $e(), t = r.bytesToNumberBE;
+    function l(b, S) {
       if (g(b), g(S), b < 0 || b >= 1 << 8 * S)
         throw new Error("invalid I2OSP input: " + b);
       const A = Array.from({ length: S }).fill(0);
@@ -1652,44 +1625,44 @@ function Bn() {
         throw new Error("number expected");
     }
     function p(b) {
-      if (!(0, n.isBytes)(b) && typeof b != "string")
+      if (!(0, r.isBytes)(b) && typeof b != "string")
         throw new Error("DST must be Uint8Array or string");
-      return typeof b == "string" ? (0, n.utf8ToBytes)(b) : b;
+      return typeof b == "string" ? (0, r.utf8ToBytes)(b) : b;
     }
     function v(b, S, A, M) {
-      (0, n.abytes)(b), g(A), S = p(S), S.length > 255 && (S = M((0, n.concatBytes)((0, n.utf8ToBytes)("H2C-OVERSIZE-DST-"), S)));
+      (0, r.abytes)(b), g(A), S = p(S), S.length > 255 && (S = M((0, r.concatBytes)((0, r.utf8ToBytes)("H2C-OVERSIZE-DST-"), S)));
       const { outputLen: Q, blockLen: F } = M, G = Math.ceil(A / Q);
       if (A > 65535 || G > 255)
         throw new Error("expand_message_xmd: invalid lenInBytes");
-      const se = (0, n.concatBytes)(S, u(S.length, 1)), ie = u(0, F), j = u(A, 2), R = new Array(G), L = M((0, n.concatBytes)(ie, b, j, u(0, 1), se));
-      R[0] = M((0, n.concatBytes)(L, u(1, 1), se));
+      const se = (0, r.concatBytes)(S, l(S.length, 1)), ie = l(0, F), j = l(A, 2), O = new Array(G), L = M((0, r.concatBytes)(ie, b, j, l(0, 1), se));
+      O[0] = M((0, r.concatBytes)(L, l(1, 1), se));
       for (let K = 1; K <= G; K++) {
-        const W = [m(L, R[K - 1]), u(K + 1, 1), se];
-        R[K] = M((0, n.concatBytes)(...W));
+        const W = [m(L, O[K - 1]), l(K + 1, 1), se];
+        O[K] = M((0, r.concatBytes)(...W));
       }
-      return (0, n.concatBytes)(...R).slice(0, A);
+      return (0, r.concatBytes)(...O).slice(0, A);
     }
     function U(b, S, A, M, Q) {
-      if ((0, n.abytes)(b), g(A), S = p(S), S.length > 255) {
+      if ((0, r.abytes)(b), g(A), S = p(S), S.length > 255) {
         const F = Math.ceil(2 * M / 8);
-        S = Q.create({ dkLen: F }).update((0, n.utf8ToBytes)("H2C-OVERSIZE-DST-")).update(S).digest();
+        S = Q.create({ dkLen: F }).update((0, r.utf8ToBytes)("H2C-OVERSIZE-DST-")).update(S).digest();
       }
       if (A > 65535 || S.length > 255)
         throw new Error("expand_message_xof: invalid lenInBytes");
-      return Q.create({ dkLen: A }).update(b).update(u(A, 2)).update(S).update(u(S.length, 1)).digest();
+      return Q.create({ dkLen: A }).update(b).update(l(A, 2)).update(S).update(l(S.length, 1)).digest();
     }
     function H(b, S, A) {
-      (0, n._validateObject)(A, {
+      (0, r._validateObject)(A, {
         p: "bigint",
         m: "number",
         k: "number",
         hash: "function"
       });
       const { p: M, k: Q, m: F, hash: G, expand: se, DST: ie } = A;
-      if (!(0, n.isHash)(A.hash))
+      if (!(0, r.isHash)(A.hash))
         throw new Error("expected valid hash");
-      (0, n.abytes)(b), g(S);
-      const j = M.toString(2).length, R = Math.ceil((j + Q) / 8), L = S * F * R;
+      (0, r.abytes)(b), g(S);
+      const j = M.toString(2).length, O = Math.ceil((j + Q) / 8), L = S * F * O;
       let _;
       if (se === "xmd")
         _ = v(b, ie, L, G);
@@ -1701,23 +1674,23 @@ function Bn() {
         throw new Error('expand must be "xmd" or "xof"');
       const K = new Array(S);
       for (let W = 0; W < S; W++) {
-        const D = new Array(F);
+        const z = new Array(F);
         for (let d = 0; d < F; d++) {
-          const l = R * (d + W * F), r = _.subarray(l, l + R);
-          D[d] = (0, c.mod)(t(r), M);
+          const u = O * (d + W * F), n = _.subarray(u, u + O);
+          z[d] = (0, c.mod)(t(n), M);
         }
-        K[W] = D;
+        K[W] = z;
       }
       return K;
     }
-    function V(b, S) {
+    function k(b, S) {
       const A = S.map((M) => Array.from(M).reverse());
       return (M, Q) => {
-        const [F, G, se, ie] = A.map((L) => L.reduce((_, K) => b.add(b.mul(_, M), K))), [j, R] = (0, c.FpInvertBatch)(b, [G, ie], !0);
-        return M = b.mul(F, j), Q = b.mul(Q, b.mul(se, R)), { x: M, y: Q };
+        const [F, G, se, ie] = A.map((L) => L.reduce((_, K) => b.add(b.mul(_, M), K))), [j, O] = (0, c.FpInvertBatch)(b, [G, ie], !0);
+        return M = b.mul(F, j), Q = b.mul(Q, b.mul(se, O)), { x: M, y: Q };
       };
     }
-    e._DST_scalar = (0, n.utf8ToBytes)("HashToScalar-");
+    e._DST_scalar = (0, r.utf8ToBytes)("HashToScalar-");
     function E(b, S, A) {
       if (typeof S != "function")
         throw new Error("mapToCurve() must be defined");
@@ -1731,12 +1704,12 @@ function Bn() {
       return {
         defaults: A,
         hashToCurve(F, G) {
-          const se = Object.assign({}, A, G), ie = H(F, 2, se), j = M(ie[0]), R = M(ie[1]);
-          return Q(j.add(R));
+          const se = Object.assign({}, A, G), ie = H(F, 2, se), j = M(ie[0]), O = M(ie[1]);
+          return Q(j.add(O));
         },
         encodeToCurve(F, G) {
-          const se = A.encodeDST ? { DST: A.encodeDST } : {}, ie = Object.assign({}, A, se, G), j = H(F, 1, ie), R = M(j[0]);
-          return Q(R);
+          const se = A.encodeDST ? { DST: A.encodeDST } : {}, ie = Object.assign({}, A, se, G), j = H(F, 1, ie), O = M(j[0]);
+          return Q(O);
         },
         /** See {@link H2CHasher} */
         mapToCurve(F) {
@@ -1758,10 +1731,10 @@ function Bn() {
   })(ot)), ot;
 }
 var qt;
-function nr() {
+function er() {
   return qt || (qt = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.encodeToCurve = e.hashToCurve = e.secp256k1_hasher = e.schnorr = e.secp256k1 = void 0;
-    const n = /* @__PURE__ */ dn(), c = /* @__PURE__ */ We(), t = /* @__PURE__ */ En(), u = /* @__PURE__ */ Bn(), m = /* @__PURE__ */ $e(), g = /* @__PURE__ */ Ct(), p = /* @__PURE__ */ Ce(), v = {
+    const r = /* @__PURE__ */ dn(), c = /* @__PURE__ */ We(), t = /* @__PURE__ */ En(), l = /* @__PURE__ */ Bn(), m = /* @__PURE__ */ $e(), g = /* @__PURE__ */ Ct(), p = /* @__PURE__ */ Ce(), v = {
       p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
       n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
       h: BigInt(1),
@@ -1775,72 +1748,72 @@ function nr() {
         [BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],
         [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]
       ]
-    }, H = /* @__PURE__ */ BigInt(0), V = /* @__PURE__ */ BigInt(1), E = /* @__PURE__ */ BigInt(2);
+    }, H = /* @__PURE__ */ BigInt(0), k = /* @__PURE__ */ BigInt(1), E = /* @__PURE__ */ BigInt(2);
     function b(d) {
-      const l = v.p, r = BigInt(3), a = BigInt(6), i = BigInt(11), o = BigInt(22), h = BigInt(23), w = BigInt(44), s = BigInt(88), f = d * d * d % l, y = f * f * d % l, B = (0, m.pow2)(y, r, l) * y % l, O = (0, m.pow2)(B, r, l) * y % l, k = (0, m.pow2)(O, E, l) * f % l, Y = (0, m.pow2)(k, i, l) * k % l, I = (0, m.pow2)(Y, o, l) * Y % l, q = (0, m.pow2)(I, w, l) * I % l, C = (0, m.pow2)(q, s, l) * q % l, te = (0, m.pow2)(C, w, l) * I % l, $ = (0, m.pow2)(te, r, l) * y % l, T = (0, m.pow2)($, h, l) * Y % l, X = (0, m.pow2)(T, a, l) * f % l, ae = (0, m.pow2)(X, E, l);
+      const u = v.p, n = BigInt(3), a = BigInt(6), i = BigInt(11), o = BigInt(22), h = BigInt(23), w = BigInt(44), s = BigInt(88), f = d * d * d % u, y = f * f * d % u, B = (0, m.pow2)(y, n, u) * y % u, T = (0, m.pow2)(B, n, u) * y % u, V = (0, m.pow2)(T, E, u) * f % u, Y = (0, m.pow2)(V, i, u) * V % u, I = (0, m.pow2)(Y, o, u) * Y % u, q = (0, m.pow2)(I, w, u) * I % u, C = (0, m.pow2)(q, s, u) * q % u, te = (0, m.pow2)(C, w, u) * I % u, $ = (0, m.pow2)(te, n, u) * y % u, x = (0, m.pow2)($, h, u) * Y % u, X = (0, m.pow2)(x, a, u) * f % u, ae = (0, m.pow2)(X, E, u);
       if (!S.eql(S.sqr(ae), d))
         throw new Error("Cannot find square root");
       return ae;
     }
     const S = (0, m.Field)(v.p, { sqrt: b });
-    e.secp256k1 = (0, t.createCurve)({ ...v, Fp: S, lowS: !0, endo: U }, n.sha256);
+    e.secp256k1 = (0, t.createCurve)({ ...v, Fp: S, lowS: !0, endo: U }, r.sha256);
     const A = {};
-    function M(d, ...l) {
-      let r = A[d];
-      if (r === void 0) {
-        const a = (0, n.sha256)((0, p.utf8ToBytes)(d));
-        r = (0, p.concatBytes)(a, a), A[d] = r;
+    function M(d, ...u) {
+      let n = A[d];
+      if (n === void 0) {
+        const a = (0, r.sha256)((0, p.utf8ToBytes)(d));
+        n = (0, p.concatBytes)(a, a), A[d] = n;
       }
-      return (0, n.sha256)((0, p.concatBytes)(r, ...l));
+      return (0, r.sha256)((0, p.concatBytes)(n, ...u));
     }
     const Q = (d) => d.toBytes(!0).slice(1), F = e.secp256k1.Point, G = (d) => d % E === H;
     function se(d) {
-      const { Fn: l, BASE: r } = F, a = (0, g._normFnElement)(l, d), i = r.multiply(a);
-      return { scalar: G(i.y) ? a : l.neg(a), bytes: Q(i) };
+      const { Fn: u, BASE: n } = F, a = (0, g._normFnElement)(u, d), i = n.multiply(a);
+      return { scalar: G(i.y) ? a : u.neg(a), bytes: Q(i) };
     }
     function ie(d) {
-      const l = S;
-      if (!l.isValidNot0(d))
+      const u = S;
+      if (!u.isValidNot0(d))
         throw new Error("invalid x: Fail if x ≥ p");
-      const r = l.create(d * d), a = l.create(r * d + BigInt(7));
-      let i = l.sqrt(a);
-      G(i) || (i = l.neg(i));
+      const n = u.create(d * d), a = u.create(n * d + BigInt(7));
+      let i = u.sqrt(a);
+      G(i) || (i = u.neg(i));
       const o = F.fromAffine({ x: d, y: i });
       return o.assertValidity(), o;
     }
     const j = p.bytesToNumberBE;
-    function R(...d) {
+    function O(...d) {
       return F.Fn.create(j(M("BIP0340/challenge", ...d)));
     }
     function L(d) {
       return se(d).bytes;
     }
-    function _(d, l, r = (0, c.randomBytes)(32)) {
-      const { Fn: a } = F, i = (0, p.ensureBytes)("message", d), { bytes: o, scalar: h } = se(l), w = (0, p.ensureBytes)("auxRand", r, 32), s = a.toBytes(h ^ j(M("BIP0340/aux", w))), f = M("BIP0340/nonce", s, o, i), { bytes: y, scalar: B } = se(f), O = R(y, o, i), k = new Uint8Array(64);
-      if (k.set(y, 0), k.set(a.toBytes(a.create(B + O * h)), 32), !K(k, i, o))
+    function _(d, u, n = (0, c.randomBytes)(32)) {
+      const { Fn: a } = F, i = (0, p.ensureBytes)("message", d), { bytes: o, scalar: h } = se(u), w = (0, p.ensureBytes)("auxRand", n, 32), s = a.toBytes(h ^ j(M("BIP0340/aux", w))), f = M("BIP0340/nonce", s, o, i), { bytes: y, scalar: B } = se(f), T = O(y, o, i), V = new Uint8Array(64);
+      if (V.set(y, 0), V.set(a.toBytes(a.create(B + T * h)), 32), !K(V, i, o))
         throw new Error("sign: Invalid signature produced");
-      return k;
+      return V;
     }
-    function K(d, l, r) {
-      const { Fn: a, BASE: i } = F, o = (0, p.ensureBytes)("signature", d, 64), h = (0, p.ensureBytes)("message", l), w = (0, p.ensureBytes)("publicKey", r, 32);
+    function K(d, u, n) {
+      const { Fn: a, BASE: i } = F, o = (0, p.ensureBytes)("signature", d, 64), h = (0, p.ensureBytes)("message", u), w = (0, p.ensureBytes)("publicKey", n, 32);
       try {
         const s = ie(j(w)), f = j(o.subarray(0, 32));
-        if (!(0, p.inRange)(f, V, v.p))
+        if (!(0, p.inRange)(f, k, v.p))
           return !1;
         const y = j(o.subarray(32, 64));
-        if (!(0, p.inRange)(y, V, v.n))
+        if (!(0, p.inRange)(y, k, v.n))
           return !1;
-        const B = R(a.toBytes(f), Q(s), h), O = i.multiplyUnsafe(y).add(s.multiplyUnsafe(a.neg(B))), { x: k, y: Y } = O.toAffine();
-        return !(O.is0() || !G(Y) || k !== f);
+        const B = O(a.toBytes(f), Q(s), h), T = i.multiplyUnsafe(y).add(s.multiplyUnsafe(a.neg(B))), { x: V, y: Y } = T.toAffine();
+        return !(T.is0() || !G(Y) || V !== f);
       } catch {
         return !1;
       }
     }
     e.schnorr = (() => {
-      const r = (i = (0, c.randomBytes)(48)) => (0, m.mapHashToField)(i, v.n);
+      const n = (i = (0, c.randomBytes)(48)) => (0, m.mapHashToField)(i, v.n);
       e.secp256k1.utils.randomSecretKey;
       function a(i) {
-        const o = r(i);
+        const o = n(i);
         return { secretKey: o, publicKey: L(o) };
       }
       return {
@@ -1850,8 +1823,8 @@ function nr() {
         verify: K,
         Point: F,
         utils: {
-          randomSecretKey: r,
-          randomPrivateKey: r,
+          randomSecretKey: n,
+          randomPrivateKey: n,
           taggedHash: M,
           // TODO: remove
           lift_x: ie,
@@ -1869,7 +1842,7 @@ function nr() {
         }
       };
     })();
-    const W = (0, u.isogenyMap)(S, [
+    const W = (0, l.isogenyMap)(S, [
       // xNum
       [
         "0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7",
@@ -1899,14 +1872,14 @@ function nr() {
         "0x0000000000000000000000000000000000000000000000000000000000000001"
         // LAST 1
       ]
-    ].map((d) => d.map((l) => BigInt(l)))), D = (0, g.mapToCurveSimpleSWU)(S, {
+    ].map((d) => d.map((u) => BigInt(u)))), z = (0, g.mapToCurveSimpleSWU)(S, {
       A: BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),
       B: BigInt("1771"),
       Z: S.create(BigInt("-11"))
     });
-    e.secp256k1_hasher = (0, u.createHasher)(e.secp256k1.Point, (d) => {
-      const { x: l, y: r } = D(S.create(d[0]));
-      return W(l, r);
+    e.secp256k1_hasher = (0, l.createHasher)(e.secp256k1.Point, (d) => {
+      const { x: u, y: n } = z(S.create(d[0]));
+      return W(u, n);
     }, {
       DST: "secp256k1_XMD:SHA-256_SSWU_RO_",
       encodeDST: "secp256k1_XMD:SHA-256_SSWU_NU_",
@@ -1914,20 +1887,20 @@ function nr() {
       m: 1,
       k: 128,
       expand: "xmd",
-      hash: n.sha256
+      hash: r.sha256
     }), e.hashToCurve = e.secp256k1_hasher.hashToCurve, e.encodeToCurve = e.secp256k1_hasher.encodeToCurve;
   })(tt)), tt;
 }
 var P = {}, It;
-function rr() {
+function tr() {
   if (It) return P;
   It = 1, Object.defineProperty(P, "__esModule", { value: !0 }), P.isHash = P.validateObject = P.memoized = P.notImplemented = P.createHmacDrbg = P.bitMask = P.bitSet = P.bitGet = P.bitLen = P.aInRange = P.inRange = P.asciiToBytes = P.copyBytes = P.equalBytes = P.ensureBytes = P.numberToVarBytesBE = P.numberToBytesLE = P.numberToBytesBE = P.bytesToNumberLE = P.bytesToNumberBE = P.hexToNumber = P.numberToHexUnpadded = P.abool = P.utf8ToBytes = P.randomBytes = P.isBytes = P.hexToBytes = P.concatBytes = P.bytesToUtf8 = P.bytesToHex = P.anumber = P.abytes = void 0;
   const e = /* @__PURE__ */ Ce();
   return P.abytes = e.abytes, P.anumber = e.anumber, P.bytesToHex = e.bytesToHex, P.bytesToUtf8 = e.bytesToUtf8, P.concatBytes = e.concatBytes, P.hexToBytes = e.hexToBytes, P.isBytes = e.isBytes, P.randomBytes = e.randomBytes, P.utf8ToBytes = e.utf8ToBytes, P.abool = e.abool, P.numberToHexUnpadded = e.numberToHexUnpadded, P.hexToNumber = e.hexToNumber, P.bytesToNumberBE = e.bytesToNumberBE, P.bytesToNumberLE = e.bytesToNumberLE, P.numberToBytesBE = e.numberToBytesBE, P.numberToBytesLE = e.numberToBytesLE, P.numberToVarBytesBE = e.numberToVarBytesBE, P.ensureBytes = e.ensureBytes, P.equalBytes = e.equalBytes, P.copyBytes = e.copyBytes, P.asciiToBytes = e.asciiToBytes, P.inRange = e.inRange, P.aInRange = e.aInRange, P.bitLen = e.bitLen, P.bitGet = e.bitGet, P.bitSet = e.bitSet, P.bitMask = e.bitMask, P.createHmacDrbg = e.createHmacDrbg, P.notImplemented = e.notImplemented, P.memoized = e.memoized, P.validateObject = e.validateObject, P.isHash = e.isHash, P;
 }
-function or(e, n = "") {
+function nr(e, r = "") {
   if (typeof e != "boolean") {
-    const c = n && `"${n}" `;
+    const c = r && `"${r}" `;
     throw new Error(c + "expected boolean, got type=" + typeof e);
   }
   return e;
@@ -1940,138 +1913,138 @@ function mt(e) {
 function Kt(e) {
   return mt(e), (e & e - 1) === 0 && e !== 0;
 }
-function pn(e, n) {
+function pn(e, r) {
   mt(e);
   let c = 0;
-  for (let t = 0; t < n; t++, e >>>= 1)
+  for (let t = 0; t < r; t++, e >>>= 1)
     c = c << 1 | e & 1;
   return c;
 }
-function Dt(e) {
+function zt(e) {
   return mt(e), 31 - Math.clz32(e);
 }
 function Nt(e) {
-  const n = e.length;
-  if (n < 2 || !Kt(n))
-    throw new Error("n must be a power of 2 and greater than 1. Got " + n);
-  const c = Dt(n);
-  for (let t = 0; t < n; t++) {
-    const u = pn(t, c);
-    if (t < u) {
+  const r = e.length;
+  if (r < 2 || !Kt(r))
+    throw new Error("n must be a power of 2 and greater than 1. Got " + r);
+  const c = zt(r);
+  for (let t = 0; t < r; t++) {
+    const l = pn(t, c);
+    if (t < l) {
       const m = e[t];
-      e[t] = e[u], e[u] = m;
+      e[t] = e[l], e[l] = m;
     }
   }
   return e;
 }
-const sr = (e, n) => {
-  const { N: c, roots: t, dit: u, invertButterflies: m = !1, skipStages: g = 0, brp: p = !0 } = n, v = Dt(c);
+const rr = (e, r) => {
+  const { N: c, roots: t, dit: l, invertButterflies: m = !1, skipStages: g = 0, brp: p = !0 } = r, v = zt(c);
   if (!Kt(c))
     throw new Error("FFT: Polynomial size should be power of two");
-  const U = u !== m;
+  const U = l !== m;
   return (H) => {
     if (H.length !== c)
       throw new Error("FFT: wrong Polynomial length");
-    u && p && Nt(H);
-    for (let V = 0, E = 1; V < v - g; V++) {
-      const b = u ? V + 1 + g : v - V, S = 1 << b, A = S >> 1, M = c >> b;
+    l && p && Nt(H);
+    for (let k = 0, E = 1; k < v - g; k++) {
+      const b = l ? k + 1 + g : v - k, S = 1 << b, A = S >> 1, M = c >> b;
       for (let Q = 0; Q < c; Q += S)
         for (let F = 0, G = E++; F < A; F++) {
-          const se = m ? u ? c - G : G : F * M, ie = Q + F, j = Q + F + A, R = t[se], L = H[j], _ = H[ie];
+          const se = m ? l ? c - G : G : F * M, ie = Q + F, j = Q + F + A, O = t[se], L = H[j], _ = H[ie];
           if (U) {
-            const K = e.mul(L, R);
+            const K = e.mul(L, O);
             H[ie] = e.add(_, K), H[j] = e.sub(_, K);
-          } else m ? (H[ie] = e.add(L, _), H[j] = e.mul(e.sub(L, _), R)) : (H[ie] = e.add(_, L), H[j] = e.mul(e.sub(_, L), R));
+          } else m ? (H[ie] = e.add(L, _), H[j] = e.mul(e.sub(L, _), O)) : (H[ie] = e.add(_, L), H[j] = e.mul(e.sub(_, L), O));
         }
     }
-    return !u && p && Nt(H), H;
+    return !l && p && Nt(H), H;
   };
 };
 const bt = /* @__PURE__ */ BigInt(0), lt = /* @__PURE__ */ BigInt(1);
-function Je(e, n = "") {
+function Je(e, r = "") {
   if (typeof e != "boolean") {
-    const c = n && `"${n}"`;
+    const c = r && `"${r}"`;
     throw new Error(c + "expected boolean, got type=" + typeof e);
   }
   return e;
 }
-function Ze(e, n, c = "") {
-  const t = yt(e), u = e?.length, m = n !== void 0;
-  if (!t || m && u !== n) {
-    const g = c && `"${c}" `, p = m ? ` of length ${n}` : "", v = t ? `length=${u}` : `type=${typeof e}`;
+function Ze(e, r, c = "") {
+  const t = yt(e), l = e?.length, m = r !== void 0;
+  if (!t || m && l !== r) {
+    const g = c && `"${c}" `, p = m ? ` of length ${r}` : "", v = t ? `length=${l}` : `type=${typeof e}`;
     throw new Error(g + "expected Uint8Array" + p + ", got " + v);
   }
   return e;
 }
 function Xe(e) {
-  const n = e.toString(16);
-  return n.length & 1 ? "0" + n : n;
+  const r = e.toString(16);
+  return r.length & 1 ? "0" + r : r;
 }
-function zt(e) {
+function Dt(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return e === "" ? bt : BigInt("0x" + e);
 }
 function et(e) {
-  return zt(Me(e));
+  return Dt(Me(e));
 }
 function Yt(e) {
-  return hn(e), zt(Me(Uint8Array.from(e).reverse()));
+  return hn(e), Dt(Me(Uint8Array.from(e).reverse()));
 }
-function wt(e, n) {
-  return Qe(e.toString(16).padStart(n * 2, "0"));
+function wt(e, r) {
+  return Qe(e.toString(16).padStart(r * 2, "0"));
 }
-function Pt(e, n) {
-  return wt(e, n).reverse();
+function Pt(e, r) {
+  return wt(e, r).reverse();
 }
-function Se(e, n, c) {
+function Se(e, r, c) {
   let t;
-  if (typeof n == "string")
+  if (typeof r == "string")
     try {
-      t = Qe(n);
-    } catch (u) {
-      throw new Error(e + " must be hex string or Uint8Array, cause: " + u);
+      t = Qe(r);
+    } catch (l) {
+      throw new Error(e + " must be hex string or Uint8Array, cause: " + l);
     }
-  else if (yt(n))
-    t = Uint8Array.from(n);
+  else if (yt(r))
+    t = Uint8Array.from(r);
   else
     throw new Error(e + " must be hex string or Uint8Array");
   return t.length, t;
 }
 const st = (e) => typeof e == "bigint" && bt <= e;
-function vn(e, n, c) {
-  return st(e) && st(n) && st(c) && n <= e && e < c;
+function vn(e, r, c) {
+  return st(e) && st(r) && st(c) && r <= e && e < c;
 }
-function _n(e, n, c, t) {
-  if (!vn(n, c, t))
-    throw new Error("expected valid " + e + ": " + c + " <= n < " + t + ", got " + n);
+function _n(e, r, c, t) {
+  if (!vn(r, c, t))
+    throw new Error("expected valid " + e + ": " + c + " <= n < " + t + ", got " + r);
 }
 function Xt(e) {
-  let n;
-  for (n = 0; e > bt; e >>= lt, n += 1)
+  let r;
+  for (r = 0; e > bt; e >>= lt, r += 1)
     ;
-  return n;
+  return r;
 }
-const De = (e) => (lt << BigInt(e)) - lt;
-function Sn(e, n, c) {
+const ze = (e) => (lt << BigInt(e)) - lt;
+function Sn(e, r, c) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
-  if (typeof n != "number" || n < 2)
+  if (typeof r != "number" || r < 2)
     throw new Error("qByteLen must be a number");
   if (typeof c != "function")
     throw new Error("hmacFn must be a function");
-  const t = (b) => new Uint8Array(b), u = (b) => Uint8Array.of(b);
+  const t = (b) => new Uint8Array(b), l = (b) => Uint8Array.of(b);
   let m = t(e), g = t(e), p = 0;
   const v = () => {
     m.fill(1), g.fill(0), p = 0;
   }, U = (...b) => c(g, m, ...b), H = (b = t(0)) => {
-    g = U(u(0), b), m = U(), b.length !== 0 && (g = U(u(1), b), m = U());
-  }, V = () => {
+    g = U(l(0), b), m = U(), b.length !== 0 && (g = U(l(1), b), m = U());
+  }, k = () => {
     if (p++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let b = 0;
     const S = [];
-    for (; b < n; ) {
+    for (; b < r; ) {
       m = U();
       const A = m.slice();
       S.push(A), b += m.length;
@@ -2081,77 +2054,77 @@ function Sn(e, n, c) {
   return (b, S) => {
     v(), H(b);
     let A;
-    for (; !(A = S(V())); )
+    for (; !(A = S(k())); )
       H();
     return v(), A;
   };
 }
-function gt(e, n, c = {}) {
+function gt(e, r, c = {}) {
   if (!e || typeof e != "object")
     throw new Error("expected valid options object");
-  function t(u, m, g) {
-    const p = e[u];
+  function t(l, m, g) {
+    const p = e[l];
     if (g && p === void 0)
       return;
     const v = typeof p;
     if (v !== m || p === null)
-      throw new Error(`param "${u}" is invalid: expected ${m}, got ${v}`);
+      throw new Error(`param "${l}" is invalid: expected ${m}, got ${v}`);
   }
-  Object.entries(n).forEach(([u, m]) => t(u, m, !1)), Object.entries(c).forEach(([u, m]) => t(u, m, !0));
+  Object.entries(r).forEach(([l, m]) => t(l, m, !1)), Object.entries(c).forEach(([l, m]) => t(l, m, !0));
 }
 function At(e) {
-  const n = /* @__PURE__ */ new WeakMap();
+  const r = /* @__PURE__ */ new WeakMap();
   return (c, ...t) => {
-    const u = n.get(c);
-    if (u !== void 0)
-      return u;
+    const l = r.get(c);
+    if (l !== void 0)
+      return l;
     const m = e(c, ...t);
-    return n.set(c, m), m;
+    return r.set(c, m), m;
   };
 }
-const Oe = BigInt(0), Be = BigInt(1), je = /* @__PURE__ */ BigInt(2), Gt = /* @__PURE__ */ BigInt(3), Wt = /* @__PURE__ */ BigInt(4), Qt = /* @__PURE__ */ BigInt(5), On = /* @__PURE__ */ BigInt(7), Jt = /* @__PURE__ */ BigInt(8), Tn = /* @__PURE__ */ BigInt(9), Ft = /* @__PURE__ */ BigInt(16);
-function qe(e, n) {
-  const c = e % n;
-  return c >= Oe ? c : n + c;
+const Te = BigInt(0), Be = BigInt(1), je = /* @__PURE__ */ BigInt(2), Gt = /* @__PURE__ */ BigInt(3), Wt = /* @__PURE__ */ BigInt(4), Qt = /* @__PURE__ */ BigInt(5), Tn = /* @__PURE__ */ BigInt(7), Jt = /* @__PURE__ */ BigInt(8), xn = /* @__PURE__ */ BigInt(9), Ft = /* @__PURE__ */ BigInt(16);
+function qe(e, r) {
+  const c = e % r;
+  return c >= Te ? c : r + c;
 }
-function xe(e, n, c) {
+function Re(e, r, c) {
   let t = e;
-  for (; n-- > Oe; )
+  for (; r-- > Te; )
     t *= t, t %= c;
   return t;
 }
-function Ut(e, n) {
-  if (e === Oe)
+function Ut(e, r) {
+  if (e === Te)
     throw new Error("invert: expected non-zero number");
-  if (n <= Oe)
-    throw new Error("invert: expected positive modulus, got " + n);
-  let c = qe(e, n), t = n, u = Oe, m = Be;
-  for (; c !== Oe; ) {
-    const p = t / c, v = t % c, U = u - m * p;
-    t = c, c = v, u = m, m = U;
+  if (r <= Te)
+    throw new Error("invert: expected positive modulus, got " + r);
+  let c = qe(e, r), t = r, l = Te, m = Be;
+  for (; c !== Te; ) {
+    const p = t / c, v = t % c, U = l - m * p;
+    t = c, c = v, l = m, m = U;
   }
   if (t !== Be)
     throw new Error("invert: does not exist");
-  return qe(u, n);
+  return qe(l, r);
 }
-function Et(e, n, c) {
-  if (!e.eql(e.sqr(n), c))
+function Et(e, r, c) {
+  if (!e.eql(e.sqr(r), c))
     throw new Error("Cannot find square root");
 }
-function $t(e, n) {
-  const c = (e.ORDER + Be) / Wt, t = e.pow(n, c);
-  return Et(e, t, n), t;
+function $t(e, r) {
+  const c = (e.ORDER + Be) / Wt, t = e.pow(r, c);
+  return Et(e, t, r), t;
 }
-function Rn(e, n) {
-  const c = (e.ORDER - Qt) / Jt, t = e.mul(n, je), u = e.pow(t, c), m = e.mul(n, u), g = e.mul(e.mul(m, je), u), p = e.mul(m, e.sub(g, e.ONE));
-  return Et(e, p, n), p;
+function On(e, r) {
+  const c = (e.ORDER - Qt) / Jt, t = e.mul(r, je), l = e.pow(t, c), m = e.mul(r, l), g = e.mul(e.mul(m, je), l), p = e.mul(m, e.sub(g, e.ONE));
+  return Et(e, p, r), p;
 }
-function xn(e) {
-  const n = ze(e), c = en(e), t = c(n, n.neg(n.ONE)), u = c(n, t), m = c(n, n.neg(t)), g = (e + On) / Ft;
+function Rn(e) {
+  const r = De(e), c = en(e), t = c(r, r.neg(r.ONE)), l = c(r, t), m = c(r, r.neg(t)), g = (e + Tn) / Ft;
   return (p, v) => {
     let U = p.pow(v, g), H = p.mul(U, t);
-    const V = p.mul(U, u), E = p.mul(U, m), b = p.eql(p.sqr(H), v), S = p.eql(p.sqr(V), v);
-    U = p.cmov(U, H, b), H = p.cmov(E, V, S);
+    const k = p.mul(U, l), E = p.mul(U, m), b = p.eql(p.sqr(H), v), S = p.eql(p.sqr(k), v);
+    U = p.cmov(U, H, b), H = p.cmov(E, k, S);
     const A = p.eql(p.sqr(H), v), M = p.cmov(U, H, A);
     return Et(p, M, v), M;
   };
@@ -2159,24 +2132,24 @@ function xn(e) {
 function en(e) {
   if (e < Gt)
     throw new Error("sqrt is not defined for small field");
-  let n = e - Be, c = 0;
-  for (; n % je === Oe; )
-    n /= je, c++;
+  let r = e - Be, c = 0;
+  for (; r % je === Te; )
+    r /= je, c++;
   let t = je;
-  const u = ze(e);
-  for (; Zt(u, t) === 1; )
+  const l = De(e);
+  for (; Zt(l, t) === 1; )
     if (t++ > 1e3)
       throw new Error("Cannot find square root: probably non-prime P");
   if (c === 1)
     return $t;
-  let m = u.pow(t, n);
-  const g = (n + Be) / je;
+  let m = l.pow(t, r);
+  const g = (r + Be) / je;
   return function(v, U) {
     if (v.is0(U))
       return U;
     if (Zt(v, U) !== 1)
       throw new Error("Cannot find square root");
-    let H = c, V = v.mul(v.ONE, m), E = v.pow(U, n), b = v.pow(U, g);
+    let H = c, k = v.mul(v.ONE, m), E = v.pow(U, r), b = v.pow(U, g);
     for (; !v.eql(E, v.ONE); ) {
       if (v.is0(E))
         return v.ZERO;
@@ -2184,14 +2157,14 @@ function en(e) {
       for (; !v.eql(A, v.ONE); )
         if (S++, A = v.sqr(A), S === H)
           throw new Error("Cannot find square root");
-      const M = Be << BigInt(H - S - 1), Q = v.pow(V, M);
-      H = S, V = v.sqr(Q), E = v.mul(E, V), b = v.mul(b, Q);
+      const M = Be << BigInt(H - S - 1), Q = v.pow(k, M);
+      H = S, k = v.sqr(Q), E = v.mul(E, k), b = v.mul(b, Q);
     }
     return b;
   };
 }
 function qn(e) {
-  return e % Wt === Gt ? $t : e % Jt === Qt ? Rn : e % Ft === Tn ? xn(e) : en(e);
+  return e % Wt === Gt ? $t : e % Jt === Qt ? On : e % Ft === xn ? Rn(e) : en(e);
 }
 const In = [
   "create",
@@ -2213,74 +2186,74 @@ const In = [
   "sqrN"
 ];
 function Nn(e) {
-  const n = {
+  const r = {
     ORDER: "bigint",
     MASK: "bigint",
     BYTES: "number",
     BITS: "number"
-  }, c = In.reduce((t, u) => (t[u] = "function", t), n);
+  }, c = In.reduce((t, l) => (t[l] = "function", t), r);
   return gt(e, c), e;
 }
-function An(e, n, c) {
-  if (c < Oe)
+function An(e, r, c) {
+  if (c < Te)
     throw new Error("invalid exponent, negatives unsupported");
-  if (c === Oe)
+  if (c === Te)
     return e.ONE;
   if (c === Be)
-    return n;
-  let t = e.ONE, u = n;
-  for (; c > Oe; )
-    c & Be && (t = e.mul(t, u)), u = e.sqr(u), c >>= Be;
+    return r;
+  let t = e.ONE, l = r;
+  for (; c > Te; )
+    c & Be && (t = e.mul(t, l)), l = e.sqr(l), c >>= Be;
   return t;
 }
-function tn(e, n, c = !1) {
-  const t = new Array(n.length).fill(c ? e.ZERO : void 0), u = n.reduce((g, p, v) => e.is0(p) ? g : (t[v] = g, e.mul(g, p)), e.ONE), m = e.inv(u);
-  return n.reduceRight((g, p, v) => e.is0(p) ? g : (t[v] = e.mul(g, t[v]), e.mul(g, p)), m), t;
+function tn(e, r, c = !1) {
+  const t = new Array(r.length).fill(c ? e.ZERO : void 0), l = r.reduce((g, p, v) => e.is0(p) ? g : (t[v] = g, e.mul(g, p)), e.ONE), m = e.inv(l);
+  return r.reduceRight((g, p, v) => e.is0(p) ? g : (t[v] = e.mul(g, t[v]), e.mul(g, p)), m), t;
 }
-function Zt(e, n) {
-  const c = (e.ORDER - Be) / je, t = e.pow(n, c), u = e.eql(t, e.ONE), m = e.eql(t, e.ZERO), g = e.eql(t, e.neg(e.ONE));
-  if (!u && !m && !g)
+function Zt(e, r) {
+  const c = (e.ORDER - Be) / je, t = e.pow(r, c), l = e.eql(t, e.ONE), m = e.eql(t, e.ZERO), g = e.eql(t, e.neg(e.ONE));
+  if (!l && !m && !g)
     throw new Error("invalid Legendre symbol result");
-  return u ? 1 : m ? 0 : -1;
+  return l ? 1 : m ? 0 : -1;
 }
-function nn(e, n) {
-  n !== void 0 && yn(n);
-  const c = n !== void 0 ? n : e.toString(2).length, t = Math.ceil(c / 8);
+function nn(e, r) {
+  r !== void 0 && yn(r);
+  const c = r !== void 0 ? r : e.toString(2).length, t = Math.ceil(c / 8);
   return { nBitLength: c, nByteLength: t };
 }
-function ze(e, n, c = !1, t = {}) {
-  if (e <= Oe)
+function De(e, r, c = !1, t = {}) {
+  if (e <= Te)
     throw new Error("invalid field: expected ORDER > 0, got " + e);
-  let u, m, g = !1, p;
-  if (typeof n == "object" && n != null) {
+  let l, m, g = !1, p;
+  if (typeof r == "object" && r != null) {
     if (t.sqrt || c)
       throw new Error("cannot specify opts in two arguments");
-    const E = n;
-    E.BITS && (u = E.BITS), E.sqrt && (m = E.sqrt), typeof E.isLE == "boolean" && (c = E.isLE), typeof E.modFromBytes == "boolean" && (g = E.modFromBytes), p = E.allowedLengths;
+    const E = r;
+    E.BITS && (l = E.BITS), E.sqrt && (m = E.sqrt), typeof E.isLE == "boolean" && (c = E.isLE), typeof E.modFromBytes == "boolean" && (g = E.modFromBytes), p = E.allowedLengths;
   } else
-    typeof n == "number" && (u = n), t.sqrt && (m = t.sqrt);
-  const { nBitLength: v, nByteLength: U } = nn(e, u);
+    typeof r == "number" && (l = r), t.sqrt && (m = t.sqrt);
+  const { nBitLength: v, nByteLength: U } = nn(e, l);
   if (U > 2048)
     throw new Error("invalid field: expected ORDER of <= 2048 bytes");
   let H;
-  const V = Object.freeze({
+  const k = Object.freeze({
     ORDER: e,
     isLE: c,
     BITS: v,
     BYTES: U,
-    MASK: De(v),
-    ZERO: Oe,
+    MASK: ze(v),
+    ZERO: Te,
     ONE: Be,
     allowedLengths: p,
     create: (E) => qe(E, e),
     isValid: (E) => {
       if (typeof E != "bigint")
         throw new Error("invalid field element: expected bigint, got " + typeof E);
-      return Oe <= E && E < e;
+      return Te <= E && E < e;
     },
-    is0: (E) => E === Oe,
+    is0: (E) => E === Te,
     // is valid and invertible
-    isValidNot0: (E) => !V.is0(E) && V.isValid(E),
+    isValidNot0: (E) => !k.is0(E) && k.isValid(E),
     isOdd: (E) => (E & Be) === Be,
     neg: (E) => qe(-E, e),
     eql: (E, b) => E === b,
@@ -2288,7 +2261,7 @@ function ze(e, n, c = !1, t = {}) {
     add: (E, b) => qe(E + b, e),
     sub: (E, b) => qe(E - b, e),
     mul: (E, b) => qe(E * b, e),
-    pow: (E, b) => An(V, E, b),
+    pow: (E, b) => An(k, E, b),
     div: (E, b) => qe(E * Ut(b, e), e),
     // Same as above, but doesn't normalize
     sqrN: (E) => E * E,
@@ -2296,7 +2269,7 @@ function ze(e, n, c = !1, t = {}) {
     subN: (E, b) => E - b,
     mulN: (E, b) => E * b,
     inv: (E) => Ut(E, e),
-    sqrt: m || ((E) => (H || (H = qn(e)), H(V, E))),
+    sqrt: m || ((E) => (H || (H = qn(e)), H(k, E))),
     toBytes: (E) => c ? Pt(E, U) : wt(E, U),
     fromBytes: (E, b = !0) => {
       if (p) {
@@ -2308,73 +2281,73 @@ function ze(e, n, c = !1, t = {}) {
       if (E.length !== U)
         throw new Error("Field.fromBytes: expected " + U + " bytes, got " + E.length);
       let S = c ? Yt(E) : et(E);
-      if (g && (S = qe(S, e)), !b && !V.isValid(S))
+      if (g && (S = qe(S, e)), !b && !k.isValid(S))
         throw new Error("invalid field element: outside of range 0..ORDER");
       return S;
     },
     // TODO: we don't need it here, move out to separate fn
-    invertBatch: (E) => tn(V, E),
+    invertBatch: (E) => tn(k, E),
     // We can't move this out because Fp6, Fp12 implement it
     // and it's unclear what to return in there.
     cmov: (E, b, S) => S ? b : E
   });
-  return Object.freeze(V);
+  return Object.freeze(k);
 }
 function rn(e) {
   if (typeof e != "bigint")
     throw new Error("field order must be bigint");
-  const n = e.toString(2).length;
-  return Math.ceil(n / 8);
+  const r = e.toString(2).length;
+  return Math.ceil(r / 8);
 }
 function on(e) {
-  const n = rn(e);
-  return n + Math.ceil(n / 2);
+  const r = rn(e);
+  return r + Math.ceil(r / 2);
 }
-function Un(e, n, c = !1) {
-  const t = e.length, u = rn(n), m = on(n);
+function Un(e, r, c = !1) {
+  const t = e.length, l = rn(r), m = on(r);
   if (t < 16 || t < m || t > 1024)
     throw new Error("expected " + m + "-1024 bytes of input, got " + t);
-  const g = c ? Yt(e) : et(e), p = qe(g, n - Be) + Be;
-  return c ? Pt(p, u) : wt(p, u);
-}
-const ke = BigInt(0), Le = BigInt(1);
-function Fe(e, n) {
-  const c = n.negate();
-  return e ? c : n;
-}
-function it(e, n) {
-  const c = tn(e.Fp, n.map((t) => t.Z));
-  return n.map((t, u) => e.fromAffine(t.toAffine(c[u])));
-}
-function sn(e, n) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > n)
-    throw new Error("invalid window size, expected [1.." + n + "], got W=" + e);
-}
-function ct(e, n) {
-  sn(e, n);
-  const c = Math.ceil(n / e) + 1, t = 2 ** (e - 1), u = 2 ** e, m = De(e), g = BigInt(e);
-  return { windows: c, windowSize: t, mask: m, maxNumber: u, shiftBy: g };
-}
-function jt(e, n, c) {
-  const { windowSize: t, mask: u, maxNumber: m, shiftBy: g } = c;
-  let p = Number(e & u), v = e >> g;
+  const g = c ? Yt(e) : et(e), p = qe(g, r - Be) + Be;
+  return c ? Pt(p, l) : wt(p, l);
+}
+const Ve = BigInt(0), Le = BigInt(1);
+function Fe(e, r) {
+  const c = r.negate();
+  return e ? c : r;
+}
+function it(e, r) {
+  const c = tn(e.Fp, r.map((t) => t.Z));
+  return r.map((t, l) => e.fromAffine(t.toAffine(c[l])));
+}
+function sn(e, r) {
+  if (!Number.isSafeInteger(e) || e <= 0 || e > r)
+    throw new Error("invalid window size, expected [1.." + r + "], got W=" + e);
+}
+function ct(e, r) {
+  sn(e, r);
+  const c = Math.ceil(r / e) + 1, t = 2 ** (e - 1), l = 2 ** e, m = ze(e), g = BigInt(e);
+  return { windows: c, windowSize: t, mask: m, maxNumber: l, shiftBy: g };
+}
+function jt(e, r, c) {
+  const { windowSize: t, mask: l, maxNumber: m, shiftBy: g } = c;
+  let p = Number(e & l), v = e >> g;
   p > t && (p -= m, v += Le);
-  const U = n * t, H = U + Math.abs(p) - 1, V = p === 0, E = p < 0, b = n % 2 !== 0;
-  return { nextN: v, offset: H, isZero: V, isNeg: E, isNegF: b, offsetF: U };
+  const U = r * t, H = U + Math.abs(p) - 1, k = p === 0, E = p < 0, b = r % 2 !== 0;
+  return { nextN: v, offset: H, isZero: k, isNeg: E, isNegF: b, offsetF: U };
 }
-function Zn(e, n) {
+function Zn(e, r) {
   if (!Array.isArray(e))
     throw new Error("array expected");
   e.forEach((c, t) => {
-    if (!(c instanceof n))
+    if (!(c instanceof r))
       throw new Error("invalid point at index " + t);
   });
 }
-function jn(e, n) {
+function jn(e, r) {
   if (!Array.isArray(e))
     throw new Error("array of scalars expected");
   e.forEach((c, t) => {
-    if (!n.isValid(c))
+    if (!r.isValid(c))
       throw new Error("invalid scalar at index " + t);
   });
 }
@@ -2383,19 +2356,19 @@ function ft(e) {
   return cn.get(e) || 1;
 }
 function Lt(e) {
-  if (e !== ke)
+  if (e !== Ve)
     throw new Error("invalid wNAF");
 }
 class Ln {
   // Parametrized with a given Point class (not individual point)
-  constructor(n, c) {
-    this.BASE = n.BASE, this.ZERO = n.ZERO, this.Fn = n.Fn, this.bits = c;
+  constructor(r, c) {
+    this.BASE = r.BASE, this.ZERO = r.ZERO, this.Fn = r.Fn, this.bits = c;
   }
   // non-const time multiplication ladder
-  _unsafeLadder(n, c, t = this.ZERO) {
-    let u = n;
-    for (; c > ke; )
-      c & Le && (t = t.add(u)), u = u.double(), c >>= Le;
+  _unsafeLadder(r, c, t = this.ZERO) {
+    let l = r;
+    for (; c > Ve; )
+      c & Le && (t = t.add(l)), l = l.double(), c >>= Le;
     return t;
   }
   /**
@@ -2410,12 +2383,12 @@ class Ln {
    * @param W window size
    * @returns precomputed point tables flattened to a single array
    */
-  precomputeWindow(n, c) {
-    const { windows: t, windowSize: u } = ct(c, this.bits), m = [];
-    let g = n, p = g;
+  precomputeWindow(r, c) {
+    const { windows: t, windowSize: l } = ct(c, this.bits), m = [];
+    let g = r, p = g;
     for (let v = 0; v < t; v++) {
       p = g, m.push(p);
-      for (let U = 1; U < u; U++)
+      for (let U = 1; U < l; U++)
         p = p.add(g), m.push(p);
       g = p.double();
     }
@@ -2427,72 +2400,72 @@ class Ln {
    * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541
    * @returns real and fake (for const-time) points
    */
-  wNAF(n, c, t) {
+  wNAF(r, c, t) {
     if (!this.Fn.isValid(t))
       throw new Error("invalid scalar");
-    let u = this.ZERO, m = this.BASE;
-    const g = ct(n, this.bits);
+    let l = this.ZERO, m = this.BASE;
+    const g = ct(r, this.bits);
     for (let p = 0; p < g.windows; p++) {
-      const { nextN: v, offset: U, isZero: H, isNeg: V, isNegF: E, offsetF: b } = jt(t, p, g);
-      t = v, H ? m = m.add(Fe(E, c[b])) : u = u.add(Fe(V, c[U]));
+      const { nextN: v, offset: U, isZero: H, isNeg: k, isNegF: E, offsetF: b } = jt(t, p, g);
+      t = v, H ? m = m.add(Fe(E, c[b])) : l = l.add(Fe(k, c[U]));
     }
-    return Lt(t), { p: u, f: m };
+    return Lt(t), { p: l, f: m };
   }
   /**
    * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
    * @param acc accumulator point to add result of multiplication
    * @returns point
    */
-  wNAFUnsafe(n, c, t, u = this.ZERO) {
-    const m = ct(n, this.bits);
-    for (let g = 0; g < m.windows && t !== ke; g++) {
+  wNAFUnsafe(r, c, t, l = this.ZERO) {
+    const m = ct(r, this.bits);
+    for (let g = 0; g < m.windows && t !== Ve; g++) {
       const { nextN: p, offset: v, isZero: U, isNeg: H } = jt(t, g, m);
       if (t = p, !U) {
-        const V = c[v];
-        u = u.add(H ? V.negate() : V);
+        const k = c[v];
+        l = l.add(H ? k.negate() : k);
       }
     }
-    return Lt(t), u;
+    return Lt(t), l;
   }
-  getPrecomputes(n, c, t) {
-    let u = at.get(c);
-    return u || (u = this.precomputeWindow(c, n), n !== 1 && (typeof t == "function" && (u = t(u)), at.set(c, u))), u;
+  getPrecomputes(r, c, t) {
+    let l = at.get(c);
+    return l || (l = this.precomputeWindow(c, r), r !== 1 && (typeof t == "function" && (l = t(l)), at.set(c, l))), l;
   }
-  cached(n, c, t) {
-    const u = ft(n);
-    return this.wNAF(u, this.getPrecomputes(u, n, t), c);
+  cached(r, c, t) {
+    const l = ft(r);
+    return this.wNAF(l, this.getPrecomputes(l, r, t), c);
   }
-  unsafe(n, c, t, u) {
-    const m = ft(n);
-    return m === 1 ? this._unsafeLadder(n, c, u) : this.wNAFUnsafe(m, this.getPrecomputes(m, n, t), c, u);
+  unsafe(r, c, t, l) {
+    const m = ft(r);
+    return m === 1 ? this._unsafeLadder(r, c, l) : this.wNAFUnsafe(m, this.getPrecomputes(m, r, t), c, l);
   }
   // We calculate precomputes for elliptic curve point multiplication
   // using windowed method. This specifies window size and
   // stores precomputed values. Usually only base point would be precomputed.
-  createCache(n, c) {
-    sn(c, this.bits), cn.set(n, c), at.delete(n);
+  createCache(r, c) {
+    sn(c, this.bits), cn.set(r, c), at.delete(r);
   }
-  hasCache(n) {
-    return ft(n) !== 1;
+  hasCache(r) {
+    return ft(r) !== 1;
   }
 }
-function Hn(e, n, c, t) {
-  let u = n, m = e.ZERO, g = e.ZERO;
-  for (; c > ke || t > ke; )
-    c & Le && (m = m.add(u)), t & Le && (g = g.add(u)), u = u.double(), c >>= Le, t >>= Le;
+function Hn(e, r, c, t) {
+  let l = r, m = e.ZERO, g = e.ZERO;
+  for (; c > Ve || t > Ve; )
+    c & Le && (m = m.add(l)), t & Le && (g = g.add(l)), l = l.double(), c >>= Le, t >>= Le;
   return { p1: m, p2: g };
 }
-function Mn(e, n, c, t) {
-  Zn(c, e), jn(t, n);
-  const u = c.length, m = t.length;
-  if (u !== m)
+function Mn(e, r, c, t) {
+  Zn(c, e), jn(t, r);
+  const l = c.length, m = t.length;
+  if (l !== m)
     throw new Error("arrays of points and scalars must have equal length");
-  const g = e.ZERO, p = Xt(BigInt(u));
+  const g = e.ZERO, p = Xt(BigInt(l));
   let v = 1;
   p > 12 ? v = p - 3 : p > 4 ? v = p - 2 : p > 0 && (v = 2);
-  const U = De(v), H = new Array(Number(U) + 1).fill(g), V = Math.floor((n.BITS - 1) / v) * v;
+  const U = ze(v), H = new Array(Number(U) + 1).fill(g), k = Math.floor((r.BITS - 1) / v) * v;
   let E = g;
-  for (let b = V; b >= 0; b -= v) {
+  for (let b = k; b >= 0; b -= v) {
     H.fill(g);
     for (let A = 0; A < m; A++) {
       const M = t[A], Q = Number(M >> BigInt(b) & U);
@@ -2507,53 +2480,53 @@ function Mn(e, n, c, t) {
   }
   return E;
 }
-function Ht(e, n, c) {
-  if (n) {
-    if (n.ORDER !== e)
+function Ht(e, r, c) {
+  if (r) {
+    if (r.ORDER !== e)
       throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-    return Nn(n), n;
+    return Nn(r), r;
   } else
-    return ze(e, { isLE: c });
+    return De(e, { isLE: c });
 }
-function Vn(e, n, c = {}, t) {
-  if (t === void 0 && (t = e === "edwards"), !n || typeof n != "object")
+function kn(e, r, c = {}, t) {
+  if (t === void 0 && (t = e === "edwards"), !r || typeof r != "object")
     throw new Error(`expected valid ${e} CURVE object`);
   for (const v of ["p", "n", "h"]) {
-    const U = n[v];
-    if (!(typeof U == "bigint" && U > ke))
+    const U = r[v];
+    if (!(typeof U == "bigint" && U > Ve))
       throw new Error(`CURVE.${v} must be positive bigint`);
   }
-  const u = Ht(n.p, c.Fp, t), m = Ht(n.n, c.Fn, t), p = ["Gx", "Gy", "a", "b"];
+  const l = Ht(r.p, c.Fp, t), m = Ht(r.n, c.Fn, t), p = ["Gx", "Gy", "a", "b"];
   for (const v of p)
-    if (!u.isValid(n[v]))
+    if (!l.isValid(r[v]))
       throw new Error(`CURVE.${v} must be valid field element of CURVE.Fp`);
-  return n = Object.freeze(Object.assign({}, n)), { CURVE: n, Fp: u, Fn: m };
-}
-const Mt = (e, n) => (e + (e >= 0 ? n : -n) / an) / n;
-function kn(e, n, c) {
-  const [[t, u], [m, g]] = n, p = Mt(g * e, c), v = Mt(-u * e, c);
-  let U = e - p * t - v * m, H = -p * u - v * g;
-  const V = U < Ne, E = H < Ne;
-  V && (U = -U), E && (H = -H);
-  const b = De(Math.ceil(Xt(c) / 2)) + Ve;
+  return r = Object.freeze(Object.assign({}, r)), { CURVE: r, Fp: l, Fn: m };
+}
+const Mt = (e, r) => (e + (e >= 0 ? r : -r) / an) / r;
+function Vn(e, r, c) {
+  const [[t, l], [m, g]] = r, p = Mt(g * e, c), v = Mt(-l * e, c);
+  let U = e - p * t - v * m, H = -p * l - v * g;
+  const k = U < Ne, E = H < Ne;
+  k && (U = -U), E && (H = -H);
+  const b = ze(Math.ceil(Xt(c) / 2)) + ke;
   if (U < Ne || U >= b || H < Ne || H >= b)
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
-  return { k1neg: V, k1: U, k2neg: E, k2: H };
+  return { k1neg: k, k1: U, k2neg: E, k2: H };
 }
 function dt(e) {
   if (!["compact", "recovered", "der"].includes(e))
     throw new Error('Signature format must be "compact", "recovered", or "der"');
   return e;
 }
-function ut(e, n) {
+function ut(e, r) {
   const c = {};
-  for (let t of Object.keys(n))
-    c[t] = e[t] === void 0 ? n[t] : e[t];
+  for (let t of Object.keys(r))
+    c[t] = e[t] === void 0 ? r[t] : e[t];
   return Je(c.lowS, "lowS"), Je(c.prehash, "prehash"), c.format !== void 0 && dt(c.format), c;
 }
 class Cn extends Error {
-  constructor(n = "") {
-    super(n);
+  constructor(r = "") {
+    super(r);
   }
 }
 const Ie = {
@@ -2561,37 +2534,37 @@ const Ie = {
   Err: Cn,
   // Basic building block is TLV (Tag-Length-Value)
   _tlv: {
-    encode: (e, n) => {
+    encode: (e, r) => {
       const { Err: c } = Ie;
       if (e < 0 || e > 256)
         throw new c("tlv.encode: wrong tag");
-      if (n.length & 1)
+      if (r.length & 1)
         throw new c("tlv.encode: unpadded data");
-      const t = n.length / 2, u = Xe(t);
-      if (u.length / 2 & 128)
+      const t = r.length / 2, l = Xe(t);
+      if (l.length / 2 & 128)
         throw new c("tlv.encode: long form length too big");
-      const m = t > 127 ? Xe(u.length / 2 | 128) : "";
-      return Xe(e) + m + u + n;
+      const m = t > 127 ? Xe(l.length / 2 | 128) : "";
+      return Xe(e) + m + l + r;
     },
     // v - value, l - left bytes (unparsed)
-    decode(e, n) {
+    decode(e, r) {
       const { Err: c } = Ie;
       let t = 0;
       if (e < 0 || e > 256)
         throw new c("tlv.encode: wrong tag");
-      if (n.length < 2 || n[t++] !== e)
+      if (r.length < 2 || r[t++] !== e)
         throw new c("tlv.decode: wrong tlv");
-      const u = n[t++], m = !!(u & 128);
+      const l = r[t++], m = !!(l & 128);
       let g = 0;
       if (!m)
-        g = u;
+        g = l;
       else {
-        const v = u & 127;
+        const v = l & 127;
         if (!v)
           throw new c("tlv.decode(long): indefinite length not supported");
         if (v > 4)
           throw new c("tlv.decode(long): byte length is too big");
-        const U = n.subarray(t, t + v);
+        const U = r.subarray(t, t + v);
         if (U.length !== v)
           throw new c("tlv.decode: length bytes not complete");
         if (U[0] === 0)
@@ -2601,10 +2574,10 @@ const Ie = {
         if (t += v, g < 128)
           throw new c("tlv.decode(long): not minimal encoding");
       }
-      const p = n.subarray(t, t + g);
+      const p = r.subarray(t, t + g);
       if (p.length !== g)
         throw new c("tlv.decode: wrong value length");
-      return { v: p, l: n.subarray(t + g) };
+      return { v: p, l: r.subarray(t + g) };
     }
   },
   // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,
@@ -2613,59 +2586,59 @@ const Ie = {
   // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)
   _int: {
     encode(e) {
-      const { Err: n } = Ie;
+      const { Err: r } = Ie;
       if (e < Ne)
-        throw new n("integer: negative integers are not allowed");
+        throw new r("integer: negative integers are not allowed");
       let c = Xe(e);
       if (Number.parseInt(c[0], 16) & 8 && (c = "00" + c), c.length & 1)
-        throw new n("unexpected DER parsing assertion: unpadded hex");
+        throw new r("unexpected DER parsing assertion: unpadded hex");
       return c;
     },
     decode(e) {
-      const { Err: n } = Ie;
+      const { Err: r } = Ie;
       if (e[0] & 128)
-        throw new n("invalid signature integer: negative");
+        throw new r("invalid signature integer: negative");
       if (e[0] === 0 && !(e[1] & 128))
-        throw new n("invalid signature integer: unnecessary leading zero");
+        throw new r("invalid signature integer: unnecessary leading zero");
       return et(e);
     }
   },
   toSig(e) {
-    const { Err: n, _int: c, _tlv: t } = Ie, u = Se("signature", e), { v: m, l: g } = t.decode(48, u);
+    const { Err: r, _int: c, _tlv: t } = Ie, l = Se("signature", e), { v: m, l: g } = t.decode(48, l);
     if (g.length)
-      throw new n("invalid signature: left bytes after parsing");
+      throw new r("invalid signature: left bytes after parsing");
     const { v: p, l: v } = t.decode(2, m), { v: U, l: H } = t.decode(2, v);
     if (H.length)
-      throw new n("invalid signature: left bytes after parsing");
+      throw new r("invalid signature: left bytes after parsing");
     return { r: c.decode(p), s: c.decode(U) };
   },
   hexFromSig(e) {
-    const { _tlv: n, _int: c } = Ie, t = n.encode(2, c.encode(e.r)), u = n.encode(2, c.encode(e.s)), m = t + u;
-    return n.encode(48, m);
+    const { _tlv: r, _int: c } = Ie, t = r.encode(2, c.encode(e.r)), l = r.encode(2, c.encode(e.s)), m = t + l;
+    return r.encode(48, m);
   }
-}, Ne = BigInt(0), Ve = BigInt(1), an = BigInt(2), Ge = BigInt(3), Kn = BigInt(4);
-function He(e, n) {
+}, Ne = BigInt(0), ke = BigInt(1), an = BigInt(2), Ge = BigInt(3), Kn = BigInt(4);
+function He(e, r) {
   const { BYTES: c } = e;
   let t;
-  if (typeof n == "bigint")
-    t = n;
+  if (typeof r == "bigint")
+    t = r;
   else {
-    let u = Se("private key", n);
+    let l = Se("private key", r);
     try {
-      t = e.fromBytes(u);
+      t = e.fromBytes(l);
     } catch {
-      throw new Error(`invalid private key: expected ui8a of size ${c}, got ${typeof n}`);
+      throw new Error(`invalid private key: expected ui8a of size ${c}, got ${typeof r}`);
     }
   }
   if (!e.isValidNot0(t))
     throw new Error("invalid private key: out of range [1..N-1]");
   return t;
 }
-function Dn(e, n = {}) {
-  const c = Vn("weierstrass", e, n), { Fp: t, Fn: u } = c;
+function zn(e, r = {}) {
+  const c = kn("weierstrass", e, r), { Fp: t, Fn: l } = c;
   let m = c.CURVE;
   const { h: g, n: p } = m;
-  gt(n, {}, {
+  gt(r, {}, {
     allowInfinityPoint: "boolean",
     clearCofactor: "function",
     isTorsionFree: "function",
@@ -2674,27 +2647,27 @@ function Dn(e, n = {}) {
     endo: "object",
     wrapPrivateKey: "boolean"
   });
-  const { endo: v } = n;
+  const { endo: v } = r;
   if (v && (!t.is0(m.a) || typeof v.beta != "bigint" || !Array.isArray(v.basises)))
     throw new Error('invalid endo: expected "beta": bigint and "basises": array');
-  const U = un(t, u);
+  const U = un(t, l);
   function H() {
     if (!t.isOdd)
       throw new Error("compression is not supported: Field does not have .isOdd()");
   }
-  function V(D, d, l) {
-    const { x: r, y: a } = d.toAffine(), i = t.toBytes(r);
-    if (Je(l, "isCompressed"), l) {
+  function k(z, d, u) {
+    const { x: n, y: a } = d.toAffine(), i = t.toBytes(n);
+    if (Je(u, "isCompressed"), u) {
       H();
       const o = !t.isOdd(a);
       return Ae(fn(o), i);
     } else
       return Ae(Uint8Array.of(4), i, t.toBytes(a));
   }
-  function E(D) {
-    Ze(D, void 0, "Point");
-    const { publicKey: d, publicKeyUncompressed: l } = U, r = D.length, a = D[0], i = D.subarray(1);
-    if (r === d && (a === 2 || a === 3)) {
+  function E(z) {
+    Ze(z, void 0, "Point");
+    const { publicKey: d, publicKeyUncompressed: u } = U, n = z.length, a = z[0], i = z.subarray(1);
+    if (n === d && (a === 2 || a === 3)) {
       const o = t.fromBytes(i);
       if (!t.isValid(o))
         throw new Error("bad point: is not on curve, wrong x");
@@ -2709,92 +2682,92 @@ function Dn(e, n = {}) {
       H();
       const s = t.isOdd(w);
       return (a & 1) === 1 !== s && (w = t.neg(w)), { x: o, y: w };
-    } else if (r === l && a === 4) {
+    } else if (n === u && a === 4) {
       const o = t.BYTES, h = t.fromBytes(i.subarray(0, o)), w = t.fromBytes(i.subarray(o, o * 2));
       if (!M(h, w))
         throw new Error("bad point: is not on curve");
       return { x: h, y: w };
     } else
-      throw new Error(`bad point: got length ${r}, expected compressed=${d} or uncompressed=${l}`);
+      throw new Error(`bad point: got length ${n}, expected compressed=${d} or uncompressed=${u}`);
   }
-  const b = n.toBytes || V, S = n.fromBytes || E;
-  function A(D) {
-    const d = t.sqr(D), l = t.mul(d, D);
-    return t.add(t.add(l, t.mul(D, m.a)), m.b);
+  const b = r.toBytes || k, S = r.fromBytes || E;
+  function A(z) {
+    const d = t.sqr(z), u = t.mul(d, z);
+    return t.add(t.add(u, t.mul(z, m.a)), m.b);
   }
-  function M(D, d) {
-    const l = t.sqr(d), r = A(D);
-    return t.eql(l, r);
+  function M(z, d) {
+    const u = t.sqr(d), n = A(z);
+    return t.eql(u, n);
   }
   if (!M(m.Gx, m.Gy))
     throw new Error("bad curve params: generator point");
   const Q = t.mul(t.pow(m.a, Ge), Kn), F = t.mul(t.sqr(m.b), BigInt(27));
   if (t.is0(t.add(Q, F)))
     throw new Error("bad curve params: a or b");
-  function G(D, d, l = !1) {
-    if (!t.isValid(d) || l && t.is0(d))
-      throw new Error(`bad point coordinate ${D}`);
+  function G(z, d, u = !1) {
+    if (!t.isValid(d) || u && t.is0(d))
+      throw new Error(`bad point coordinate ${z}`);
     return d;
   }
-  function se(D) {
-    if (!(D instanceof _))
+  function se(z) {
+    if (!(z instanceof _))
       throw new Error("ProjectivePoint expected");
   }
-  function ie(D) {
+  function ie(z) {
     if (!v || !v.basises)
       throw new Error("no endo");
-    return kn(D, v.basises, u.ORDER);
+    return Vn(z, v.basises, l.ORDER);
   }
-  const j = At((D, d) => {
-    const { X: l, Y: r, Z: a } = D;
+  const j = At((z, d) => {
+    const { X: u, Y: n, Z: a } = z;
     if (t.eql(a, t.ONE))
-      return { x: l, y: r };
-    const i = D.is0();
+      return { x: u, y: n };
+    const i = z.is0();
     d == null && (d = i ? t.ONE : t.inv(a));
-    const o = t.mul(l, d), h = t.mul(r, d), w = t.mul(a, d);
+    const o = t.mul(u, d), h = t.mul(n, d), w = t.mul(a, d);
     if (i)
       return { x: t.ZERO, y: t.ZERO };
     if (!t.eql(w, t.ONE))
       throw new Error("invZ was invalid");
     return { x: o, y: h };
-  }), R = At((D) => {
-    if (D.is0()) {
-      if (n.allowInfinityPoint && !t.is0(D.Y))
+  }), O = At((z) => {
+    if (z.is0()) {
+      if (r.allowInfinityPoint && !t.is0(z.Y))
         return;
       throw new Error("bad point: ZERO");
     }
-    const { x: d, y: l } = D.toAffine();
-    if (!t.isValid(d) || !t.isValid(l))
+    const { x: d, y: u } = z.toAffine();
+    if (!t.isValid(d) || !t.isValid(u))
       throw new Error("bad point: x or y not field elements");
-    if (!M(d, l))
+    if (!M(d, u))
       throw new Error("bad point: equation left != right");
-    if (!D.isTorsionFree())
+    if (!z.isTorsionFree())
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function L(D, d, l, r, a) {
-    return l = new _(t.mul(l.X, D), l.Y, l.Z), d = Fe(r, d), l = Fe(a, l), d.add(l);
+  function L(z, d, u, n, a) {
+    return u = new _(t.mul(u.X, z), u.Y, u.Z), d = Fe(n, d), u = Fe(a, u), d.add(u);
   }
   class _ {
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(d, l, r) {
-      this.X = G("x", d), this.Y = G("y", l, !0), this.Z = G("z", r), Object.freeze(this);
+    constructor(d, u, n) {
+      this.X = G("x", d), this.Y = G("y", u, !0), this.Z = G("z", n), Object.freeze(this);
     }
     static CURVE() {
       return m;
     }
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
     static fromAffine(d) {
-      const { x: l, y: r } = d || {};
-      if (!d || !t.isValid(l) || !t.isValid(r))
+      const { x: u, y: n } = d || {};
+      if (!d || !t.isValid(u) || !t.isValid(n))
         throw new Error("invalid affine point");
       if (d instanceof _)
         throw new Error("projective point not allowed");
-      return t.is0(l) && t.is0(r) ? _.ZERO : new _(l, r, t.ONE);
+      return t.is0(u) && t.is0(n) ? _.ZERO : new _(u, n, t.ONE);
     }
     static fromBytes(d) {
-      const l = _.fromAffine(S(Ze(d, void 0, "point")));
-      return l.assertValidity(), l;
+      const u = _.fromAffine(S(Ze(d, void 0, "point")));
+      return u.assertValidity(), u;
     }
     static fromHex(d) {
       return _.fromBytes(Se("pointHex", d));
@@ -2811,13 +2784,13 @@ function Dn(e, n = {}) {
      * @param isLazy true will defer table computation until the first multiplication
      * @returns
      */
-    precompute(d = 8, l = !0) {
-      return W.createCache(this, d), l || this.multiply(Ge), this;
+    precompute(d = 8, u = !0) {
+      return W.createCache(this, d), u || this.multiply(Ge), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
     assertValidity() {
-      R(this);
+      O(this);
     }
     hasEvenY() {
       const { y: d } = this.toAffine();
@@ -2828,7 +2801,7 @@ function Dn(e, n = {}) {
     /** Compare one point to another. */
     equals(d) {
       se(d);
-      const { X: l, Y: r, Z: a } = this, { X: i, Y: o, Z: h } = d, w = t.eql(t.mul(l, h), t.mul(i, a)), s = t.eql(t.mul(r, h), t.mul(o, a));
+      const { X: u, Y: n, Z: a } = this, { X: i, Y: o, Z: h } = d, w = t.eql(t.mul(u, h), t.mul(i, a)), s = t.eql(t.mul(n, h), t.mul(o, a));
       return w && s;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
@@ -2840,9 +2813,9 @@ function Dn(e, n = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: d, b: l } = m, r = t.mul(l, Ge), { X: a, Y: i, Z: o } = this;
-      let h = t.ZERO, w = t.ZERO, s = t.ZERO, f = t.mul(a, a), y = t.mul(i, i), B = t.mul(o, o), O = t.mul(a, i);
-      return O = t.add(O, O), s = t.mul(a, o), s = t.add(s, s), h = t.mul(d, s), w = t.mul(r, B), w = t.add(h, w), h = t.sub(y, w), w = t.add(y, w), w = t.mul(h, w), h = t.mul(O, h), s = t.mul(r, s), B = t.mul(d, B), O = t.sub(f, B), O = t.mul(d, O), O = t.add(O, s), s = t.add(f, f), f = t.add(s, f), f = t.add(f, B), f = t.mul(f, O), w = t.add(w, f), B = t.mul(i, o), B = t.add(B, B), f = t.mul(B, O), h = t.sub(h, f), s = t.mul(B, y), s = t.add(s, s), s = t.add(s, s), new _(h, w, s);
+      const { a: d, b: u } = m, n = t.mul(u, Ge), { X: a, Y: i, Z: o } = this;
+      let h = t.ZERO, w = t.ZERO, s = t.ZERO, f = t.mul(a, a), y = t.mul(i, i), B = t.mul(o, o), T = t.mul(a, i);
+      return T = t.add(T, T), s = t.mul(a, o), s = t.add(s, s), h = t.mul(d, s), w = t.mul(n, B), w = t.add(h, w), h = t.sub(y, w), w = t.add(y, w), w = t.mul(h, w), h = t.mul(T, h), s = t.mul(n, s), B = t.mul(d, B), T = t.sub(f, B), T = t.mul(d, T), T = t.add(T, s), s = t.add(f, f), f = t.add(s, f), f = t.add(f, B), f = t.mul(f, T), w = t.add(w, f), B = t.mul(i, o), B = t.add(B, B), f = t.mul(B, T), h = t.sub(h, f), s = t.mul(B, y), s = t.add(s, s), s = t.add(s, s), new _(h, w, s);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -2850,13 +2823,13 @@ function Dn(e, n = {}) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(d) {
       se(d);
-      const { X: l, Y: r, Z: a } = this, { X: i, Y: o, Z: h } = d;
+      const { X: u, Y: n, Z: a } = this, { X: i, Y: o, Z: h } = d;
       let w = t.ZERO, s = t.ZERO, f = t.ZERO;
       const y = m.a, B = t.mul(m.b, Ge);
-      let O = t.mul(l, i), k = t.mul(r, o), Y = t.mul(a, h), I = t.add(l, r), q = t.add(i, o);
-      I = t.mul(I, q), q = t.add(O, k), I = t.sub(I, q), q = t.add(l, a);
+      let T = t.mul(u, i), V = t.mul(n, o), Y = t.mul(a, h), I = t.add(u, n), q = t.add(i, o);
+      I = t.mul(I, q), q = t.add(T, V), I = t.sub(I, q), q = t.add(u, a);
       let C = t.add(i, h);
-      return q = t.mul(q, C), C = t.add(O, Y), q = t.sub(q, C), C = t.add(r, a), w = t.add(o, h), C = t.mul(C, w), w = t.add(k, Y), C = t.sub(C, w), f = t.mul(y, q), w = t.mul(B, Y), f = t.add(w, f), w = t.sub(k, f), f = t.add(k, f), s = t.mul(w, f), k = t.add(O, O), k = t.add(k, O), Y = t.mul(y, Y), q = t.mul(B, q), k = t.add(k, Y), Y = t.sub(O, Y), Y = t.mul(y, Y), q = t.add(q, Y), O = t.mul(k, q), s = t.add(s, O), O = t.mul(C, q), w = t.mul(I, w), w = t.sub(w, O), O = t.mul(I, k), f = t.mul(C, f), f = t.add(f, O), new _(w, s, f);
+      return q = t.mul(q, C), C = t.add(T, Y), q = t.sub(q, C), C = t.add(n, a), w = t.add(o, h), C = t.mul(C, w), w = t.add(V, Y), C = t.sub(C, w), f = t.mul(y, q), w = t.mul(B, Y), f = t.add(w, f), w = t.sub(V, f), f = t.add(V, f), s = t.mul(w, f), V = t.add(T, T), V = t.add(V, T), Y = t.mul(y, Y), q = t.mul(B, q), V = t.add(V, Y), Y = t.sub(T, Y), Y = t.mul(y, Y), q = t.add(q, Y), T = t.mul(V, q), s = t.add(s, T), T = t.mul(C, q), w = t.mul(I, w), w = t.sub(w, T), T = t.mul(I, V), f = t.mul(C, f), f = t.add(f, T), new _(w, s, f);
     }
     subtract(d) {
       return this.add(d.negate());
@@ -2874,19 +2847,19 @@ function Dn(e, n = {}) {
      * @returns New point
      */
     multiply(d) {
-      const { endo: l } = n;
-      if (!u.isValidNot0(d))
+      const { endo: u } = r;
+      if (!l.isValidNot0(d))
         throw new Error("invalid scalar: out of range");
-      let r, a;
+      let n, a;
       const i = (o) => W.cached(this, o, (h) => it(_, h));
-      if (l) {
-        const { k1neg: o, k1: h, k2neg: w, k2: s } = ie(d), { p: f, f: y } = i(h), { p: B, f: O } = i(s);
-        a = y.add(O), r = L(l.beta, f, B, o, w);
+      if (u) {
+        const { k1neg: o, k1: h, k2neg: w, k2: s } = ie(d), { p: f, f: y } = i(h), { p: B, f: T } = i(s);
+        a = y.add(T), n = L(u.beta, f, B, o, w);
       } else {
         const { p: o, f: h } = i(d);
-        r = o, a = h;
+        n = o, a = h;
       }
-      return it(_, [r, a])[0];
+      return it(_, [n, a])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -2894,23 +2867,23 @@ function Dn(e, n = {}) {
      * an exposed secret key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(d) {
-      const { endo: l } = n, r = this;
-      if (!u.isValid(d))
+      const { endo: u } = r, n = this;
+      if (!l.isValid(d))
         throw new Error("invalid scalar: out of range");
-      if (d === Ne || r.is0())
+      if (d === Ne || n.is0())
         return _.ZERO;
-      if (d === Ve)
-        return r;
+      if (d === ke)
+        return n;
       if (W.hasCache(this))
         return this.multiply(d);
-      if (l) {
-        const { k1neg: a, k1: i, k2neg: o, k2: h } = ie(d), { p1: w, p2: s } = Hn(_, r, i, h);
-        return L(l.beta, w, s, a, o);
+      if (u) {
+        const { k1neg: a, k1: i, k2neg: o, k2: h } = ie(d), { p1: w, p2: s } = Hn(_, n, i, h);
+        return L(u.beta, w, s, a, o);
       } else
-        return W.unsafe(r, d);
+        return W.unsafe(n, d);
     }
-    multiplyAndAddUnsafe(d, l, r) {
-      const a = this.multiplyUnsafe(l).add(d.multiplyUnsafe(r));
+    multiplyAndAddUnsafe(d, u, n) {
+      const a = this.multiplyUnsafe(u).add(d.multiplyUnsafe(n));
       return a.is0() ? void 0 : a;
     }
     /**
@@ -2925,12 +2898,12 @@ function Dn(e, n = {}) {
      * Always torsion-free for cofactor=1 curves.
      */
     isTorsionFree() {
-      const { isTorsionFree: d } = n;
-      return g === Ve ? !0 : d ? d(_, this) : W.unsafe(this, p).is0();
+      const { isTorsionFree: d } = r;
+      return g === ke ? !0 : d ? d(_, this) : W.unsafe(this, p).is0();
     }
     clearCofactor() {
-      const { clearCofactor: d } = n;
-      return g === Ve ? this : d ? d(_, this) : this.multiplyUnsafe(g);
+      const { clearCofactor: d } = r;
+      return g === ke ? this : d ? d(_, this) : this.multiplyUnsafe(g);
     }
     isSmallOrder() {
       return this.multiplyUnsafe(g).is0();
@@ -2963,31 +2936,31 @@ function Dn(e, n = {}) {
     static normalizeZ(d) {
       return it(_, d);
     }
-    static msm(d, l) {
-      return Mn(_, u, d, l);
+    static msm(d, u) {
+      return Mn(_, l, d, u);
     }
     static fromPrivateKey(d) {
-      return _.BASE.multiply(He(u, d));
+      return _.BASE.multiply(He(l, d));
     }
   }
-  _.BASE = new _(m.Gx, m.Gy, t.ONE), _.ZERO = new _(t.ZERO, t.ONE, t.ZERO), _.Fp = t, _.Fn = u;
-  const K = u.BITS, W = new Ln(_, n.endo ? Math.ceil(K / 2) : K);
+  _.BASE = new _(m.Gx, m.Gy, t.ONE), _.ZERO = new _(t.ZERO, t.ONE, t.ZERO), _.Fp = t, _.Fn = l;
+  const K = l.BITS, W = new Ln(_, r.endo ? Math.ceil(K / 2) : K);
   return _.BASE.precompute(8), _;
 }
 function fn(e) {
   return Uint8Array.of(e ? 2 : 3);
 }
-function un(e, n) {
+function un(e, r) {
   return {
-    secretKey: n.BYTES,
+    secretKey: r.BYTES,
     publicKey: 1 + e.BYTES,
     publicKeyUncompressed: 1 + 2 * e.BYTES,
     publicKeyHasPrefix: !0,
-    signature: 2 * n.BYTES
+    signature: 2 * r.BYTES
   };
 }
-function zn(e, n = {}) {
-  const { Fn: c } = e, t = n.randomBytes || kt, u = Object.assign(un(e.Fp, c), { seed: on(c.ORDER) });
+function Dn(e, r = {}) {
+  const { Fn: c } = e, t = r.randomBytes || Vt, l = Object.assign(un(e.Fp, c), { seed: on(c.ORDER) });
   function m(b) {
     try {
       return !!He(c, b);
@@ -2996,7 +2969,7 @@ function zn(e, n = {}) {
     }
   }
   function g(b, S) {
-    const { publicKey: A, publicKeyUncompressed: M } = u;
+    const { publicKey: A, publicKeyUncompressed: M } = l;
     try {
       const Q = b.length;
       return S === !0 && Q !== A || S === !1 && Q !== M ? !1 : !!e.fromBytes(b);
@@ -3004,8 +2977,8 @@ function zn(e, n = {}) {
       return !1;
     }
   }
-  function p(b = t(u.seed)) {
-    return Un(Ze(b, u.seed, "seed"), c.ORDER);
+  function p(b = t(l.seed)) {
+    return Un(Ze(b, l.seed, "seed"), c.ORDER);
   }
   function v(b, S = !0) {
     return e.BASE.multiply(He(c, b)).toBytes(S);
@@ -3019,13 +2992,13 @@ function zn(e, n = {}) {
       return !1;
     if (b instanceof e)
       return !0;
-    const { secretKey: S, publicKey: A, publicKeyUncompressed: M } = u;
+    const { secretKey: S, publicKey: A, publicKeyUncompressed: M } = l;
     if (c.allowedLengths || S === A)
       return;
     const Q = Se("key", b).length;
     return Q === A || Q === M;
   }
-  function V(b, S, A = !0) {
+  function k(b, S, A = !0) {
     if (H(b) === !0)
       throw new Error("first arg must be private key");
     if (H(S) === !1)
@@ -3033,7 +3006,7 @@ function zn(e, n = {}) {
     const M = He(c, b);
     return e.fromHex(S).multiply(M).toBytes(A);
   }
-  return Object.freeze({ getPublicKey: v, getSharedSecret: V, keygen: U, Point: e, utils: {
+  return Object.freeze({ getPublicKey: v, getSharedSecret: k, keygen: U, Point: e, utils: {
     isValidSecretKey: m,
     isValidPublicKey: g,
     randomSecretKey: p,
@@ -3044,59 +3017,59 @@ function zn(e, n = {}) {
     precompute(b = 8, S = e.BASE) {
       return S.precompute(b, !1);
     }
-  }, lengths: u });
+  }, lengths: l });
 }
-function Yn(e, n, c = {}) {
-  mn(n), gt(c, {}, {
+function Yn(e, r, c = {}) {
+  mn(r), gt(c, {}, {
     hmac: "function",
     lowS: "boolean",
     randomBytes: "function",
     bits2int: "function",
     bits2int_modN: "function"
   });
-  const t = c.randomBytes || kt, u = c.hmac || ((l, ...r) => bn(n, l, Ae(...r))), { Fp: m, Fn: g } = e, { ORDER: p, BITS: v } = g, { keygen: U, getPublicKey: H, getSharedSecret: V, utils: E, lengths: b } = zn(e, c), S = {
+  const t = c.randomBytes || Vt, l = c.hmac || ((u, ...n) => bn(r, u, Ae(...n))), { Fp: m, Fn: g } = e, { ORDER: p, BITS: v } = g, { keygen: U, getPublicKey: H, getSharedSecret: k, utils: E, lengths: b } = Dn(e, c), S = {
     prehash: !1,
     lowS: typeof c.lowS == "boolean" ? c.lowS : !1,
     format: void 0,
     //'compact' as ECDSASigFormat,
     extraEntropy: !1
   }, A = "compact";
-  function M(l) {
-    const r = p >> Ve;
-    return l > r;
+  function M(u) {
+    const n = p >> ke;
+    return u > n;
   }
-  function Q(l, r) {
-    if (!g.isValidNot0(r))
-      throw new Error(`invalid signature ${l}: out of range 1..Point.Fn.ORDER`);
-    return r;
+  function Q(u, n) {
+    if (!g.isValidNot0(n))
+      throw new Error(`invalid signature ${u}: out of range 1..Point.Fn.ORDER`);
+    return n;
   }
-  function F(l, r) {
-    dt(r);
-    const a = b.signature, i = r === "compact" ? a : r === "recovered" ? a + 1 : void 0;
-    return Ze(l, i, `${r} signature`);
+  function F(u, n) {
+    dt(n);
+    const a = b.signature, i = n === "compact" ? a : n === "recovered" ? a + 1 : void 0;
+    return Ze(u, i, `${n} signature`);
   }
   class G {
-    constructor(r, a, i) {
-      this.r = Q("r", r), this.s = Q("s", a), i != null && (this.recovery = i), Object.freeze(this);
+    constructor(n, a, i) {
+      this.r = Q("r", n), this.s = Q("s", a), i != null && (this.recovery = i), Object.freeze(this);
     }
-    static fromBytes(r, a = A) {
-      F(r, a);
+    static fromBytes(n, a = A) {
+      F(n, a);
       let i;
       if (a === "der") {
-        const { r: s, s: f } = Ie.toSig(Ze(r));
+        const { r: s, s: f } = Ie.toSig(Ze(n));
         return new G(s, f);
       }
-      a === "recovered" && (i = r[0], a = "compact", r = r.subarray(1));
-      const o = g.BYTES, h = r.subarray(0, o), w = r.subarray(o, o * 2);
+      a === "recovered" && (i = n[0], a = "compact", n = n.subarray(1));
+      const o = g.BYTES, h = n.subarray(0, o), w = n.subarray(o, o * 2);
       return new G(g.fromBytes(h), g.fromBytes(w), i);
     }
-    static fromHex(r, a) {
-      return this.fromBytes(Qe(r), a);
+    static fromHex(n, a) {
+      return this.fromBytes(Qe(n), a);
     }
-    addRecoveryBit(r) {
-      return new G(this.r, this.s, r);
+    addRecoveryBit(n) {
+      return new G(this.r, this.s, n);
     }
-    recoverPublicKey(r) {
+    recoverPublicKey(n) {
       const a = m.ORDER, { r: i, s: o, recovery: h } = this;
       if (h == null || ![0, 1, 2, 3].includes(h))
         throw new Error("recovery id invalid");
@@ -3105,7 +3078,7 @@ function Yn(e, n, c = {}) {
       const s = h === 2 || h === 3 ? i + p : i;
       if (!m.isValid(s))
         throw new Error("recovery id 2 or 3 invalid");
-      const f = m.toBytes(s), y = e.fromBytes(Ae(fn((h & 1) === 0), f)), B = g.inv(s), O = ie(Se("msgHash", r)), k = g.create(-O * B), Y = g.create(o * B), I = e.BASE.multiplyUnsafe(k).add(y.multiplyUnsafe(Y));
+      const f = m.toBytes(s), y = e.fromBytes(Ae(fn((h & 1) === 0), f)), B = g.inv(s), T = ie(Se("msgHash", n)), V = g.create(-T * B), Y = g.create(o * B), I = e.BASE.multiplyUnsafe(V).add(y.multiplyUnsafe(Y));
       if (I.is0())
         throw new Error("point at infinify");
       return I.assertValidity(), I;
@@ -3114,28 +3087,28 @@ function Yn(e, n, c = {}) {
     hasHighS() {
       return M(this.s);
     }
-    toBytes(r = A) {
-      if (dt(r), r === "der")
+    toBytes(n = A) {
+      if (dt(n), n === "der")
         return Qe(Ie.hexFromSig(this));
       const a = g.toBytes(this.r), i = g.toBytes(this.s);
-      if (r === "recovered") {
+      if (n === "recovered") {
         if (this.recovery == null)
           throw new Error("recovery bit must be present");
         return Ae(Uint8Array.of(this.recovery), a, i);
       }
       return Ae(a, i);
     }
-    toHex(r) {
-      return Me(this.toBytes(r));
+    toHex(n) {
+      return Me(this.toBytes(n));
     }
     // TODO: remove
     assertValidity() {
     }
-    static fromCompact(r) {
-      return G.fromBytes(Se("sig", r), "compact");
+    static fromCompact(n) {
+      return G.fromBytes(Se("sig", n), "compact");
     }
-    static fromDER(r) {
-      return G.fromBytes(Se("sig", r), "der");
+    static fromDER(n) {
+      return G.fromBytes(Se("sig", n), "der");
     }
     normalizeS() {
       return this.hasHighS() ? new G(this.r, g.neg(this.s), this.recovery) : this;
@@ -3153,33 +3126,33 @@ function Yn(e, n, c = {}) {
       return Me(this.toBytes("compact"));
     }
   }
-  const se = c.bits2int || function(r) {
-    if (r.length > 8192)
+  const se = c.bits2int || function(n) {
+    if (n.length > 8192)
       throw new Error("input is too large");
-    const a = et(r), i = r.length * 8 - v;
+    const a = et(n), i = n.length * 8 - v;
     return i > 0 ? a >> BigInt(i) : a;
-  }, ie = c.bits2int_modN || function(r) {
-    return g.create(se(r));
-  }, j = De(v);
-  function R(l) {
-    return _n("num < 2^" + v, l, Ne, j), g.toBytes(l);
+  }, ie = c.bits2int_modN || function(n) {
+    return g.create(se(n));
+  }, j = ze(v);
+  function O(u) {
+    return _n("num < 2^" + v, u, Ne, j), g.toBytes(u);
   }
-  function L(l, r) {
-    return Ze(l, void 0, "message"), r ? Ze(n(l), void 0, "prehashed message") : l;
+  function L(u, n) {
+    return Ze(u, void 0, "message"), n ? Ze(r(u), void 0, "prehashed message") : u;
   }
-  function _(l, r, a) {
-    if (["recovered", "canonical"].some((k) => k in a))
+  function _(u, n, a) {
+    if (["recovered", "canonical"].some((V) => V in a))
       throw new Error("sign() legacy options not supported");
     const { lowS: i, prehash: o, extraEntropy: h } = ut(a, S);
-    l = L(l, o);
-    const w = ie(l), s = He(g, r), f = [R(s), R(w)];
+    u = L(u, o);
+    const w = ie(u), s = He(g, n), f = [O(s), O(w)];
     if (h != null && h !== !1) {
-      const k = h === !0 ? t(b.secretKey) : h;
-      f.push(Se("extraEntropy", k));
+      const V = h === !0 ? t(b.secretKey) : h;
+      f.push(Se("extraEntropy", V));
     }
     const y = Ae(...f), B = w;
-    function O(k) {
-      const Y = se(k);
+    function T(V) {
+      const Y = se(V);
       if (!g.isValidNot0(Y))
         return;
       const I = g.inv(Y), q = e.BASE.multiply(Y).toAffine(), C = g.create(q.x);
@@ -3188,76 +3161,76 @@ function Yn(e, n, c = {}) {
       const te = g.create(I * g.create(B + C * s));
       if (te === Ne)
         return;
-      let $ = (q.x === C ? 0 : 2) | Number(q.y & Ve), T = te;
-      return i && M(te) && (T = g.neg(te), $ ^= 1), new G(C, T, $);
+      let $ = (q.x === C ? 0 : 2) | Number(q.y & ke), x = te;
+      return i && M(te) && (x = g.neg(te), $ ^= 1), new G(C, x, $);
     }
-    return { seed: y, k2sig: O };
+    return { seed: y, k2sig: T };
   }
-  function K(l, r, a = {}) {
-    l = Se("message", l);
-    const { seed: i, k2sig: o } = _(l, r, a);
-    return Sn(n.outputLen, g.BYTES, u)(i, o);
+  function K(u, n, a = {}) {
+    u = Se("message", u);
+    const { seed: i, k2sig: o } = _(u, n, a);
+    return Sn(r.outputLen, g.BYTES, l)(i, o);
   }
-  function W(l) {
-    let r;
-    const a = typeof l == "string" || yt(l), i = !a && l !== null && typeof l == "object" && typeof l.r == "bigint" && typeof l.s == "bigint";
+  function W(u) {
+    let n;
+    const a = typeof u == "string" || yt(u), i = !a && u !== null && typeof u == "object" && typeof u.r == "bigint" && typeof u.s == "bigint";
     if (!a && !i)
       throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
     if (i)
-      r = new G(l.r, l.s);
+      n = new G(u.r, u.s);
     else if (a) {
       try {
-        r = G.fromBytes(Se("sig", l), "der");
+        n = G.fromBytes(Se("sig", u), "der");
       } catch (o) {
         if (!(o instanceof Ie.Err))
           throw o;
       }
-      if (!r)
+      if (!n)
         try {
-          r = G.fromBytes(Se("sig", l), "compact");
+          n = G.fromBytes(Se("sig", u), "compact");
         } catch {
           return !1;
         }
     }
-    return r || !1;
+    return n || !1;
   }
-  function D(l, r, a, i = {}) {
+  function z(u, n, a, i = {}) {
     const { lowS: o, prehash: h, format: w } = ut(i, S);
-    if (a = Se("publicKey", a), r = L(Se("message", r), h), "strict" in i)
+    if (a = Se("publicKey", a), n = L(Se("message", n), h), "strict" in i)
       throw new Error("options.strict was renamed to lowS");
-    const s = w === void 0 ? W(l) : G.fromBytes(Se("sig", l), w);
+    const s = w === void 0 ? W(u) : G.fromBytes(Se("sig", u), w);
     if (s === !1)
       return !1;
     try {
       const f = e.fromBytes(a);
       if (o && s.hasHighS())
         return !1;
-      const { r: y, s: B } = s, O = ie(r), k = g.inv(B), Y = g.create(O * k), I = g.create(y * k), q = e.BASE.multiplyUnsafe(Y).add(f.multiplyUnsafe(I));
+      const { r: y, s: B } = s, T = ie(n), V = g.inv(B), Y = g.create(T * V), I = g.create(y * V), q = e.BASE.multiplyUnsafe(Y).add(f.multiplyUnsafe(I));
       return q.is0() ? !1 : g.create(q.x) === y;
     } catch {
       return !1;
     }
   }
-  function d(l, r, a = {}) {
+  function d(u, n, a = {}) {
     const { prehash: i } = ut(a, S);
-    return r = L(r, i), G.fromBytes(l, "recovered").recoverPublicKey(r).toBytes();
+    return n = L(n, i), G.fromBytes(u, "recovered").recoverPublicKey(n).toBytes();
   }
   return Object.freeze({
     keygen: U,
     getPublicKey: H,
-    getSharedSecret: V,
+    getSharedSecret: k,
     utils: E,
     lengths: b,
     Point: e,
     sign: K,
-    verify: D,
+    verify: z,
     recoverPublicKey: d,
     Signature: G,
-    hash: n
+    hash: r
   });
 }
 function Pn(e) {
-  const n = {
+  const r = {
     a: e.a,
     b: e.b,
     p: e.Fp.ORDER,
@@ -3267,13 +3240,13 @@ function Pn(e) {
     Gy: e.Gy
   }, c = e.Fp;
   let t = e.allowedPrivateKeyLengths ? Array.from(new Set(e.allowedPrivateKeyLengths.map((g) => Math.ceil(g / 2)))) : void 0;
-  const u = ze(n.n, {
+  const l = De(r.n, {
     BITS: e.nBitLength,
     allowedLengths: t,
     modFromBytes: e.wrapPrivateKey
   }), m = {
     Fp: c,
-    Fn: u,
+    Fn: l,
     allowInfinityPoint: e.allowInfinityPoint,
     endo: e.endo,
     isTorsionFree: e.isTorsionFree,
@@ -3281,32 +3254,32 @@ function Pn(e) {
     fromBytes: e.fromBytes,
     toBytes: e.toBytes
   };
-  return { CURVE: n, curveOpts: m };
+  return { CURVE: r, curveOpts: m };
 }
 function Xn(e) {
-  const { CURVE: n, curveOpts: c } = Pn(e), t = {
+  const { CURVE: r, curveOpts: c } = Pn(e), t = {
     hmac: e.hmac,
     randomBytes: e.randomBytes,
     lowS: e.lowS,
     bits2int: e.bits2int,
     bits2int_modN: e.bits2int_modN
   };
-  return { CURVE: n, curveOpts: c, hash: e.hash, ecdsaOpts: t };
+  return { CURVE: r, curveOpts: c, hash: e.hash, ecdsaOpts: t };
 }
-function Gn(e, n) {
-  const c = n.Point;
-  return Object.assign({}, n, {
+function Gn(e, r) {
+  const c = r.Point;
+  return Object.assign({}, r, {
     ProjectivePoint: c,
     CURVE: Object.assign({}, e, nn(c.Fn.ORDER, c.Fn.BITS))
   });
 }
 function Wn(e) {
-  const { CURVE: n, curveOpts: c, hash: t, ecdsaOpts: u } = Xn(e), m = Dn(n, c), g = Yn(m, t, u);
+  const { CURVE: r, curveOpts: c, hash: t, ecdsaOpts: l } = Xn(e), m = zn(r, c), g = Yn(m, t, l);
   return Gn(e, g);
 }
-function Qn(e, n) {
+function Qn(e, r) {
   const c = (t) => Wn({ ...e, hash: t });
-  return { ...c(n), create: c };
+  return { ...c(r), create: c };
 }
 const Bt = {
   p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
@@ -3322,24 +3295,22 @@ const Bt = {
     [BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],
     [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]
   ]
-}, Vt = /* @__PURE__ */ BigInt(2);
+}, kt = /* @__PURE__ */ BigInt(2);
 function Fn(e) {
-  const n = Bt.p, c = BigInt(3), t = BigInt(6), u = BigInt(11), m = BigInt(22), g = BigInt(23), p = BigInt(44), v = BigInt(88), U = e * e * e % n, H = U * U * e % n, V = xe(H, c, n) * H % n, E = xe(V, c, n) * H % n, b = xe(E, Vt, n) * U % n, S = xe(b, u, n) * b % n, A = xe(S, m, n) * S % n, M = xe(A, p, n) * A % n, Q = xe(M, v, n) * M % n, F = xe(Q, p, n) * A % n, G = xe(F, c, n) * H % n, se = xe(G, g, n) * S % n, ie = xe(se, t, n) * U % n, j = xe(ie, Vt, n);
+  const r = Bt.p, c = BigInt(3), t = BigInt(6), l = BigInt(11), m = BigInt(22), g = BigInt(23), p = BigInt(44), v = BigInt(88), U = e * e * e % r, H = U * U * e % r, k = Re(H, c, r) * H % r, E = Re(k, c, r) * H % r, b = Re(E, kt, r) * U % r, S = Re(b, l, r) * b % r, A = Re(S, m, r) * S % r, M = Re(A, p, r) * A % r, Q = Re(M, v, r) * M % r, F = Re(Q, p, r) * A % r, G = Re(F, c, r) * H % r, se = Re(G, g, r) * S % r, ie = Re(se, t, r) * U % r, j = Re(ie, kt, r);
   if (!ht.eql(ht.sqr(j), e))
     throw new Error("Cannot find square root");
   return j;
 }
-const ht = ze(Bt.p, { sqrt: Fn }), ir = Qn({ ...Bt, Fp: ht, lowS: !0, endo: Jn }, wn);
+const ht = De(Bt.p, { sqrt: Fn }), or = Qn({ ...Bt, Fp: ht, lowS: !0, endo: Jn }, wn);
 export {
-  sr as F,
-  rr as a,
+  rr as F,
+  tr as a,
   $e as b,
-  tr as c,
-  pn as d,
-  or as e,
-  et as f,
-  er as g,
+  pn as c,
+  nr as d,
+  et as e,
   qe as m,
-  nr as r,
-  ir as s
+  er as r,
+  or as s
 };