digiid-ts 2.0.0 → 2.0.1-beta.1

package/dist/digiid-ts.es.js

@@ -1,5 +1,5 @@
-var Te = Object.defineProperty;
-var Me = (e, t, r) => t in e ? Te(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
+var Ve = Object.defineProperty;
+var Me = (e, t, r) => t in e ? Ve(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
 var m = (e, t, r) => Me(e, typeof t != "symbol" ? t + "" : t, r);
 import { randomBytes as Ye } from "crypto";
 class C extends Error {
@@ -8,7 +8,7 @@ class C extends Error {
   }
 }
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Vt(e) {
+function Tt(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
 function ut(e, t = "") {
@@ -18,10 +18,10 @@ function ut(e, t = "") {
   }
 }
 function N(e, t, r = "") {
-  const n = Vt(e), s = e == null ? void 0 : e.length, i = t !== void 0;
-  if (!n || i && s !== t) {
-    const o = r && `"${r}" `, c = i ? ` of length ${t}` : "", f = n ? `length=${s}` : `type=${typeof e}`;
-    throw new Error(o + "expected Uint8Array" + c + ", got " + f);
+  const n = Tt(e), s = e == null ? void 0 : e.length, o = t !== void 0;
+  if (!n || o && s !== t) {
+    const i = r && `"${r}" `, c = o ? ` of length ${t}` : "", f = n ? `length=${s}` : `type=${typeof e}`;
+    throw new Error(i + "expected Uint8Array" + c + ", got " + f);
   }
   return e;
 }
@@ -79,13 +79,13 @@ function Rt(e) {
   if (t % 2)
     throw new Error("hex string expected, got unpadded hex of length " + t);
   const n = new Uint8Array(r);
-  for (let s = 0, i = 0; s < r; s++, i += 2) {
-    const o = Wt(e.charCodeAt(i)), c = Wt(e.charCodeAt(i + 1));
-    if (o === void 0 || c === void 0) {
-      const f = e[i] + e[i + 1];
-      throw new Error('hex string expected, got non-hex character "' + f + '" at index ' + i);
+  for (let s = 0, o = 0; s < r; s++, o += 2) {
+    const i = Wt(e.charCodeAt(o)), c = Wt(e.charCodeAt(o + 1));
+    if (i === void 0 || c === void 0) {
+      const f = e[o] + e[o + 1];
+      throw new Error('hex string expected, got non-hex character "' + f + '" at index ' + o);
     }
-    n[s] = o * 16 + c;
+    n[s] = i * 16 + c;
   }
   return n;
 }
@@ -97,13 +97,13 @@ function it(...e) {
   }
   const r = new Uint8Array(t);
   for (let n = 0, s = 0; n < e.length; n++) {
-    const i = e[n];
-    r.set(i, s), s += i.length;
+    const o = e[n];
+    r.set(o, s), s += o.length;
   }
   return r;
 }
 function Ge(e, t = {}) {
-  const r = (s, i) => e(i).update(s).digest(), n = e(void 0);
+  const r = (s, o) => e(o).update(s).digest(), n = e(void 0);
   return r.outputLen = n.outputLen, r.blockLen = n.blockLen, r.create = (s) => e(s), Object.assign(r, t), Object.freeze(r);
 }
 function le(e = 32) {
@@ -138,27 +138,27 @@ let We = class {
   }
   update(t) {
     Bt(this), N(t);
-    const { view: r, buffer: n, blockLen: s } = this, i = t.length;
-    for (let o = 0; o < i; ) {
-      const c = Math.min(s - this.pos, i - o);
+    const { view: r, buffer: n, blockLen: s } = this, o = t.length;
+    for (let i = 0; i < o; ) {
+      const c = Math.min(s - this.pos, o - i);
       if (c === s) {
         const f = Ot(t);
-        for (; s <= i - o; o += s)
-          this.process(f, o);
+        for (; s <= o - i; i += s)
+          this.process(f, i);
         continue;
       }
-      n.set(t.subarray(o, o + c), this.pos), this.pos += c, o += c, this.pos === s && (this.process(r, 0), this.pos = 0);
+      n.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === s && (this.process(r, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
     Bt(this), je(t, this), this.finished = !0;
-    const { buffer: r, view: n, blockLen: s, isLE: i } = this;
-    let { pos: o } = this;
-    r[o++] = 128, vt(this.buffer.subarray(o)), this.padOffset > s - o && (this.process(n, 0), o = 0);
-    for (let d = o; d < s; d++)
+    const { buffer: r, view: n, blockLen: s, isLE: o } = this;
+    let { pos: i } = this;
+    r[i++] = 128, vt(this.buffer.subarray(i)), this.padOffset > s - i && (this.process(n, 0), i = 0);
+    for (let d = i; d < s; d++)
       r[d] = 0;
-    n.setBigUint64(s - 8, BigInt(this.length * 8), i), this.process(n, 0);
+    n.setBigUint64(s - 8, BigInt(this.length * 8), o), this.process(n, 0);
     const c = Ot(t), f = this.outputLen;
     if (f % 4)
       throw new Error("_sha2: outputLen must be aligned to 32bit");
@@ -166,7 +166,7 @@ let We = class {
     if (a > h.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let d = 0; d < a; d++)
-      c.setUint32(4 * d, h[d], i);
+      c.setUint32(4 * d, h[d], o);
   }
   digest() {
     const { buffer: t, outputLen: r } = this;
@@ -176,8 +176,8 @@ let We = class {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: r, buffer: n, length: s, finished: i, destroyed: o, pos: c } = this;
-    return t.destroyed = o, t.finished = i, t.length = s, t.pos = c, s % r && t.buffer.set(n), t;
+    const { blockLen: r, buffer: n, length: s, finished: o, destroyed: i, pos: c } = this;
+    return t.destroyed = i, t.finished = o, t.length = s, t.pos = c, s % r && t.buffer.set(n), t;
   }
   clone() {
     return this._cloneInto();
@@ -263,26 +263,26 @@ class Qe extends We {
     super(64, t, 8, !1);
   }
   get() {
-    const { A: t, B: r, C: n, D: s, E: i, F: o, G: c, H: f } = this;
-    return [t, r, n, s, i, o, c, f];
+    const { A: t, B: r, C: n, D: s, E: o, F: i, G: c, H: f } = this;
+    return [t, r, n, s, o, i, c, f];
   }
   // prettier-ignore
-  set(t, r, n, s, i, o, c, f) {
-    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = s | 0, this.E = i | 0, this.F = o | 0, this.G = c | 0, this.H = f | 0;
+  set(t, r, n, s, o, i, c, f) {
+    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = s | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = f | 0;
   }
   process(t, r) {
     for (let d = 0; d < 16; d++, r += 4)
       nt[d] = t.getUint32(r, !1);
     for (let d = 16; d < 64; d++) {
-      const y = nt[d - 15], g = nt[d - 2], x = P(y, 7) ^ P(y, 18) ^ y >>> 3, U = P(g, 17) ^ P(g, 19) ^ g >>> 10;
-      nt[d] = U + nt[d - 7] + x + nt[d - 16] | 0;
+      const x = nt[d - 15], g = nt[d - 2], y = P(x, 7) ^ P(x, 18) ^ x >>> 3, U = P(g, 17) ^ P(g, 19) ^ g >>> 10;
+      nt[d] = U + nt[d - 7] + y + nt[d - 16] | 0;
     }
-    let { A: n, B: s, C: i, D: o, E: c, F: f, G: a, H: h } = this;
+    let { A: n, B: s, C: o, D: i, E: c, F: f, G: a, H: h } = this;
     for (let d = 0; d < 64; d++) {
-      const y = P(c, 6) ^ P(c, 11) ^ P(c, 25), g = h + y + ze(c, f, a) + Pe[d] + nt[d] | 0, U = (P(n, 2) ^ P(n, 13) ^ P(n, 22)) + Fe(n, s, i) | 0;
-      h = a, a = f, f = c, c = o + g | 0, o = i, i = s, s = n, n = g + U | 0;
+      const x = P(c, 6) ^ P(c, 11) ^ P(c, 25), g = h + x + ze(c, f, a) + Pe[d] + nt[d] | 0, U = (P(n, 2) ^ P(n, 13) ^ P(n, 22)) + Fe(n, s, o) | 0;
+      h = a, a = f, f = c, c = i + g | 0, i = o, o = s, s = n, n = g + U | 0;
     }
-    n = n + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, a = a + this.G | 0, h = h + this.H | 0, this.set(n, s, i, o, c, f, a, h);
+    n = n + this.A | 0, s = s + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, a = a + this.G | 0, h = h + this.H | 0, this.set(n, s, o, i, c, f, a, h);
   }
   roundClean() {
     vt(nt);
@@ -311,7 +311,7 @@ const tn = /* @__PURE__ */ Ge(
   /* @__PURE__ */ Xe(1)
 );
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Tt = /* @__PURE__ */ BigInt(0), $t = /* @__PURE__ */ BigInt(1);
+const Vt = /* @__PURE__ */ BigInt(0), $t = /* @__PURE__ */ BigInt(1);
 function At(e, t = "") {
   if (typeof e != "boolean") {
     const r = t && `"${t}" `;
@@ -334,7 +334,7 @@ function pt(e) {
 function he(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
-  return e === "" ? Tt : BigInt("0x" + e);
+  return e === "" ? Vt : BigInt("0x" + e);
 }
 function Ut(e) {
   return he(Lt(e));
@@ -355,7 +355,7 @@ function we(e, t) {
 function en(e) {
   return Uint8Array.from(e);
 }
-const Et = (e) => typeof e == "bigint" && Tt <= e;
+const Et = (e) => typeof e == "bigint" && Vt <= e;
 function nn(e, t, r) {
   return Et(e) && Et(t) && Et(r) && t <= e && e < r;
 }
@@ -365,7 +365,7 @@ function rn(e, t, r, n) {
 }
 function sn(e) {
   let t;
-  for (t = 0; e > Tt; e >>= $t, t += 1)
+  for (t = 0; e > Vt; e >>= $t, t += 1)
     ;
   return t;
 }
@@ -373,19 +373,19 @@ const Yt = (e) => ($t << BigInt(e)) - $t;
 function on(e, t, r) {
   if (ut(e, "hashLen"), ut(t, "qByteLen"), typeof r != "function")
     throw new Error("hmacFn must be a function");
-  const n = (I) => new Uint8Array(I), s = Uint8Array.of(), i = Uint8Array.of(0), o = Uint8Array.of(1), c = 1e3;
+  const n = (I) => new Uint8Array(I), s = Uint8Array.of(), o = Uint8Array.of(0), i = Uint8Array.of(1), c = 1e3;
   let f = n(e), a = n(e), h = 0;
   const d = () => {
     f.fill(1), a.fill(0), h = 0;
-  }, y = (...I) => r(a, it(f, ...I)), g = (I = s) => {
-    a = y(i, I), f = y(), I.length !== 0 && (a = y(o, I), f = y());
-  }, x = () => {
+  }, x = (...I) => r(a, it(f, ...I)), g = (I = s) => {
+    a = x(o, I), f = x(), I.length !== 0 && (a = x(i, I), f = x());
+  }, y = () => {
     if (h++ >= c)
       throw new Error("drbg: tried max amount of iterations");
     let I = 0;
     const O = [];
     for (; I < t; ) {
-      f = y();
+      f = x();
       const j = f.slice();
       O.push(j), I += f.length;
     }
@@ -394,7 +394,7 @@ function on(e, t, r) {
   return (I, O) => {
     d(), g(I);
     let j;
-    for (; !(j = O(x())); )
+    for (; !(j = O(y())); )
       g();
     return d(), j;
   };
@@ -402,15 +402,15 @@ function on(e, t, r) {
 function jt(e, t = {}, r = {}) {
   if (!e || typeof e != "object")
     throw new Error("expected valid options object");
-  function n(i, o, c) {
-    const f = e[i];
+  function n(o, i, c) {
+    const f = e[o];
     if (c && f === void 0)
       return;
     const a = typeof f;
-    if (a !== o || f === null)
-      throw new Error(`param "${i}" is invalid: expected ${o}, got ${a}`);
+    if (a !== i || f === null)
+      throw new Error(`param "${o}" is invalid: expected ${i}, got ${a}`);
   }
-  const s = (i, o) => Object.entries(i).forEach(([c, f]) => n(c, f, o));
+  const s = (o, i) => Object.entries(o).forEach(([c, f]) => n(c, f, i));
   s(t, !1), s(r, !0);
 }
 function Pt(e) {
@@ -419,8 +419,8 @@ function Pt(e) {
     const s = t.get(r);
     if (s !== void 0)
       return s;
-    const i = e(r, ...n);
-    return t.set(r, i), i;
+    const o = e(r, ...n);
+    return t.set(r, o), o;
   };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
@@ -440,10 +440,10 @@ function Qt(e, t) {
     throw new Error("invert: expected non-zero number");
   if (t <= Y)
     throw new Error("invert: expected positive modulus, got " + t);
-  let r = F(e, t), n = t, s = Y, i = M;
+  let r = F(e, t), n = t, s = Y, o = M;
   for (; r !== Y; ) {
-    const c = n / r, f = n % r, a = s - i * c;
-    n = r, r = f, s = i, i = a;
+    const c = n / r, f = n % r, a = s - o * c;
+    n = r, r = f, s = o, o = a;
   }
   if (n !== M)
     throw new Error("invert: does not exist");
@@ -458,15 +458,15 @@ function Ee(e, t) {
   return Kt(e, n, t), n;
 }
 function an(e, t) {
-  const r = (e.ORDER - ye) / xe, n = e.mul(t, ft), s = e.pow(n, r), i = e.mul(t, s), o = e.mul(e.mul(i, ft), s), c = e.mul(i, e.sub(o, e.ONE));
+  const r = (e.ORDER - ye) / xe, n = e.mul(t, ft), s = e.pow(n, r), o = e.mul(t, s), i = e.mul(e.mul(o, ft), s), c = e.mul(o, e.sub(i, e.ONE));
   return Kt(e, c, t), c;
 }
 function un(e) {
-  const t = St(e), r = Be(e), n = r(t, t.neg(t.ONE)), s = r(t, n), i = r(t, t.neg(n)), o = (e + cn) / me;
+  const t = St(e), r = Be(e), n = r(t, t.neg(t.ONE)), s = r(t, n), o = r(t, t.neg(n)), i = (e + cn) / me;
   return (c, f) => {
-    let a = c.pow(f, o), h = c.mul(a, n);
-    const d = c.mul(a, s), y = c.mul(a, i), g = c.eql(c.sqr(h), f), x = c.eql(c.sqr(d), f);
-    a = c.cmov(a, h, g), h = c.cmov(y, d, x);
+    let a = c.pow(f, i), h = c.mul(a, n);
+    const d = c.mul(a, s), x = c.mul(a, o), g = c.eql(c.sqr(h), f), y = c.eql(c.sqr(d), f);
+    a = c.cmov(a, h, g), h = c.cmov(x, d, y);
     const U = c.eql(c.sqr(h), f), I = c.cmov(a, h, U);
     return Kt(c, I, f), I;
   };
@@ -484,23 +484,23 @@ function Be(e) {
       throw new Error("Cannot find square root: probably non-prime P");
   if (r === 1)
     return Ee;
-  let i = s.pow(n, t);
-  const o = (t + M) / ft;
+  let o = s.pow(n, t);
+  const i = (t + M) / ft;
   return function(f, a) {
     if (f.is0(a))
       return a;
     if (Jt(f, a) !== 1)
       throw new Error("Cannot find square root");
-    let h = r, d = f.mul(f.ONE, i), y = f.pow(a, t), g = f.pow(a, o);
-    for (; !f.eql(y, f.ONE); ) {
-      if (f.is0(y))
+    let h = r, d = f.mul(f.ONE, o), x = f.pow(a, t), g = f.pow(a, i);
+    for (; !f.eql(x, f.ONE); ) {
+      if (f.is0(x))
         return f.ZERO;
-      let x = 1, U = f.sqr(y);
+      let y = 1, U = f.sqr(x);
       for (; !f.eql(U, f.ONE); )
-        if (x++, U = f.sqr(U), x === h)
+        if (y++, U = f.sqr(U), y === h)
           throw new Error("Cannot find square root");
-      const I = M << BigInt(h - x - 1), O = f.pow(d, I);
-      h = x, d = f.sqr(O), y = f.mul(y, d), g = f.mul(g, O);
+      const I = M << BigInt(h - y - 1), O = f.pow(d, I);
+      h = y, d = f.sqr(O), x = f.mul(x, d), g = f.mul(g, O);
     }
     return g;
   };
@@ -548,14 +548,14 @@ function gn(e, t, r) {
   return n;
 }
 function ve(e, t, r = !1) {
-  const n = new Array(t.length).fill(r ? e.ZERO : void 0), s = t.reduce((o, c, f) => e.is0(c) ? o : (n[f] = o, e.mul(o, c)), e.ONE), i = e.inv(s);
-  return t.reduceRight((o, c, f) => e.is0(c) ? o : (n[f] = e.mul(o, n[f]), e.mul(o, c)), i), n;
+  const n = new Array(t.length).fill(r ? e.ZERO : void 0), s = t.reduce((i, c, f) => e.is0(c) ? i : (n[f] = i, e.mul(i, c)), e.ONE), o = e.inv(s);
+  return t.reduceRight((i, c, f) => e.is0(c) ? i : (n[f] = e.mul(i, n[f]), e.mul(i, c)), o), n;
 }
 function Jt(e, t) {
-  const r = (e.ORDER - M) / ft, n = e.pow(t, r), s = e.eql(n, e.ONE), i = e.eql(n, e.ZERO), o = e.eql(n, e.neg(e.ONE));
-  if (!s && !i && !o)
+  const r = (e.ORDER - M) / ft, n = e.pow(t, r), s = e.eql(n, e.ONE), o = e.eql(n, e.ZERO), i = e.eql(n, e.neg(e.ONE));
+  if (!s && !o && !i)
     throw new Error("invalid Legendre symbol result");
-  return s ? 1 : i ? 0 : -1;
+  return s ? 1 : o ? 0 : -1;
 }
 function wn(e, t) {
   t !== void 0 && ut(t);
@@ -574,15 +574,15 @@ class bn {
     m(this, "_sqrt");
     // cached sqrt
     m(this, "_mod");
-    var o;
+    var i;
     if (t <= Y)
       throw new Error("invalid field: expected ORDER > 0, got " + t);
     let n;
-    this.isLE = !1, r != null && typeof r == "object" && (typeof r.BITS == "number" && (n = r.BITS), typeof r.sqrt == "function" && (this.sqrt = r.sqrt), typeof r.isLE == "boolean" && (this.isLE = r.isLE), r.allowedLengths && (this._lengths = (o = r.allowedLengths) == null ? void 0 : o.slice()), typeof r.modFromBytes == "boolean" && (this._mod = r.modFromBytes));
-    const { nBitLength: s, nByteLength: i } = wn(t, n);
-    if (i > 2048)
+    this.isLE = !1, r != null && typeof r == "object" && (typeof r.BITS == "number" && (n = r.BITS), typeof r.sqrt == "function" && (this.sqrt = r.sqrt), typeof r.isLE == "boolean" && (this.isLE = r.isLE), r.allowedLengths && (this._lengths = (i = r.allowedLengths) == null ? void 0 : i.slice()), typeof r.modFromBytes == "boolean" && (this._mod = r.modFromBytes));
+    const { nBitLength: s, nByteLength: o } = wn(t, n);
+    if (o > 2048)
       throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-    this.ORDER = t, this.BITS = s, this.BYTES = i, this._sqrt = void 0, Object.preventExtensions(this);
+    this.ORDER = t, this.BITS = s, this.BYTES = o, this._sqrt = void 0, Object.preventExtensions(this);
   }
   create(t) {
     return F(t, this.ORDER);
@@ -650,17 +650,17 @@ class bn {
   }
   fromBytes(t, r = !1) {
     N(t);
-    const { _lengths: n, BYTES: s, isLE: i, ORDER: o, _mod: c } = this;
+    const { _lengths: n, BYTES: s, isLE: o, ORDER: i, _mod: c } = this;
     if (n) {
       if (!n.includes(t.length) || t.length > s)
         throw new Error("Field.fromBytes: expected " + n + " bytes, got " + t.length);
       const a = new Uint8Array(s);
-      a.set(t, i ? 0 : a.length - t.length), t = a;
+      a.set(t, o ? 0 : a.length - t.length), t = a;
     }
     if (t.length !== s)
       throw new Error("Field.fromBytes: expected " + s + " bytes, got " + t.length);
-    let f = i ? ge(t) : Ut(t);
-    if (c && (f = F(f, o)), !r && !this.isValid(f))
+    let f = o ? ge(t) : Ut(t);
+    if (c && (f = F(f, i)), !r && !this.isValid(f))
       throw new Error("invalid field element: outside of range 0..ORDER");
     return f;
   }
@@ -689,10 +689,10 @@ function Ae(e) {
 }
 function pn(e, t, r = !1) {
   N(e);
-  const n = e.length, s = Re(t), i = Ae(t);
-  if (n < 16 || n < i || n > 1024)
-    throw new Error("expected " + i + "-1024 bytes of input, got " + n);
-  const o = r ? ge(e) : Ut(e), c = F(o, t - M) + M;
+  const n = e.length, s = Re(t), o = Ae(t);
+  if (n < 16 || n < o || n > 1024)
+    throw new Error("expected " + o + "-1024 bytes of input, got " + n);
+  const i = r ? ge(e) : Ut(e), c = F(i, t - M) + M;
   return r ? we(c, s) : Mt(c, s);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
@@ -711,15 +711,15 @@ function Ie(e, t) {
 }
 function Ht(e, t) {
   Ie(e, t);
-  const r = Math.ceil(t / e) + 1, n = 2 ** (e - 1), s = 2 ** e, i = Yt(e), o = BigInt(e);
-  return { windows: r, windowSize: n, mask: i, maxNumber: s, shiftBy: o };
+  const r = Math.ceil(t / e) + 1, n = 2 ** (e - 1), s = 2 ** e, o = Yt(e), i = BigInt(e);
+  return { windows: r, windowSize: n, mask: o, maxNumber: s, shiftBy: i };
 }
 function ee(e, t, r) {
-  const { windowSize: n, mask: s, maxNumber: i, shiftBy: o } = r;
-  let c = Number(e & s), f = e >> o;
-  c > n && (c -= i, f += at);
-  const a = t * n, h = a + Math.abs(c) - 1, d = c === 0, y = c < 0, g = t % 2 !== 0;
-  return { nextN: f, offset: h, isZero: d, isNeg: y, isNegF: g, offsetF: a };
+  const { windowSize: n, mask: s, maxNumber: o, shiftBy: i } = r;
+  let c = Number(e & s), f = e >> i;
+  c > n && (c -= o, f += at);
+  const a = t * n, h = a + Math.abs(c) - 1, d = c === 0, x = c < 0, g = t % 2 !== 0;
+  return { nextN: f, offset: h, isZero: d, isNeg: x, isNegF: g, offsetF: a };
 }
 const qt = /* @__PURE__ */ new WeakMap(), Le = /* @__PURE__ */ new WeakMap();
 function Nt(e) {
@@ -758,15 +758,15 @@ class yn {
    * @returns precomputed point tables flattened to a single array
    */
   precomputeWindow(t, r) {
-    const { windows: n, windowSize: s } = Ht(r, this.bits), i = [];
-    let o = t, c = o;
+    const { windows: n, windowSize: s } = Ht(r, this.bits), o = [];
+    let i = t, c = i;
     for (let f = 0; f < n; f++) {
-      c = o, i.push(c);
+      c = i, o.push(c);
       for (let a = 1; a < s; a++)
-        c = c.add(o), i.push(c);
-      o = c.double();
+        c = c.add(i), o.push(c);
+      i = c.double();
     }
-    return i;
+    return o;
   }
   /**
    * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
@@ -777,13 +777,13 @@ class yn {
   wNAF(t, r, n) {
     if (!this.Fn.isValid(n))
       throw new Error("invalid scalar");
-    let s = this.ZERO, i = this.BASE;
-    const o = Ht(t, this.bits);
-    for (let c = 0; c < o.windows; c++) {
-      const { nextN: f, offset: a, isZero: h, isNeg: d, isNegF: y, offsetF: g } = ee(n, c, o);
-      n = f, h ? i = i.add(It(y, r[g])) : s = s.add(It(d, r[a]));
+    let s = this.ZERO, o = this.BASE;
+    const i = Ht(t, this.bits);
+    for (let c = 0; c < i.windows; c++) {
+      const { nextN: f, offset: a, isZero: h, isNeg: d, isNegF: x, offsetF: g } = ee(n, c, i);
+      n = f, h ? o = o.add(It(x, r[g])) : s = s.add(It(d, r[a]));
     }
-    return ne(n), { p: s, f: i };
+    return ne(n), { p: s, f: o };
   }
   /**
    * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
@@ -791,9 +791,9 @@ class yn {
    * @returns point
    */
   wNAFUnsafe(t, r, n, s = this.ZERO) {
-    const i = Ht(t, this.bits);
-    for (let o = 0; o < i.windows && n !== dt; o++) {
-      const { nextN: c, offset: f, isZero: a, isNeg: h } = ee(n, o, i);
+    const o = Ht(t, this.bits);
+    for (let i = 0; i < o.windows && n !== dt; i++) {
+      const { nextN: c, offset: f, isZero: a, isNeg: h } = ee(n, i, o);
       if (n = c, !a) {
         const d = r[f];
         s = s.add(h ? d.negate() : d);
@@ -810,8 +810,8 @@ class yn {
     return this.wNAF(s, this.getPrecomputes(s, t, n), r);
   }
   unsafe(t, r, n, s) {
-    const i = Nt(t);
-    return i === 1 ? this._unsafeLadder(t, r, s) : this.wNAFUnsafe(i, this.getPrecomputes(i, t, n), r, s);
+    const o = Nt(t);
+    return o === 1 ? this._unsafeLadder(t, r, s) : this.wNAFUnsafe(o, this.getPrecomputes(o, t, n), r, s);
   }
   // We calculate precomputes for elliptic curve point multiplication
   // using windowed method. This specifies window size and
@@ -824,10 +824,10 @@ class yn {
   }
 }
 function xn(e, t, r, n) {
-  let s = t, i = e.ZERO, o = e.ZERO;
+  let s = t, o = e.ZERO, i = e.ZERO;
   for (; r > dt || n > dt; )
-    r & at && (i = i.add(s)), n & at && (o = o.add(s)), s = s.double(), r >>= at, n >>= at;
-  return { p1: i, p2: o };
+    r & at && (o = o.add(s)), n & at && (i = i.add(s)), s = s.double(), r >>= at, n >>= at;
+  return { p1: o, p2: i };
 }
 function re(e, t, r) {
   if (t) {
@@ -845,11 +845,11 @@ function mn(e, t, r = {}, n) {
     if (!(typeof a == "bigint" && a > dt))
       throw new Error(`CURVE.${f} must be positive bigint`);
   }
-  const s = re(t.p, r.Fp, n), i = re(t.n, r.Fn, n), c = ["Gx", "Gy", "a", "b"];
+  const s = re(t.p, r.Fp, n), o = re(t.n, r.Fn, n), c = ["Gx", "Gy", "a", "b"];
   for (const f of c)
     if (!s.isValid(t[f]))
       throw new Error(`CURVE.${f} must be valid field element of CURVE.Fp`);
-  return t = Object.freeze(Object.assign({}, t)), { CURVE: t, Fp: s, Fn: i };
+  return t = Object.freeze(Object.assign({}, t)), { CURVE: t, Fp: s, Fn: o };
 }
 function En(e, t) {
   return function(n) {
@@ -870,11 +870,11 @@ class Ue {
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
     const n = this.blockLen, s = new Uint8Array(n);
     s.set(r.length > n ? t.create().update(r).digest() : r);
-    for (let i = 0; i < s.length; i++)
-      s[i] ^= 54;
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 54;
     this.iHash.update(s), this.oHash = t.create();
-    for (let i = 0; i < s.length; i++)
-      s[i] ^= 106;
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 106;
     this.oHash.update(s), vt(s);
   }
   update(t) {
@@ -889,8 +889,8 @@ class Ue {
   }
   _cloneInto(t) {
     t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: r, iHash: n, finished: s, destroyed: i, blockLen: o, outputLen: c } = this;
-    return t = t, t.finished = s, t.destroyed = i, t.blockLen = o, t.outputLen = c, t.oHash = r._cloneInto(t.oHash), t.iHash = n._cloneInto(t.iHash), t;
+    const { oHash: r, iHash: n, finished: s, destroyed: o, blockLen: i, outputLen: c } = this;
+    return t = t, t.finished = s, t.destroyed = o, t.blockLen = i, t.outputLen = c, t.oHash = r._cloneInto(t.oHash), t.iHash = n._cloneInto(t.iHash), t;
   }
   clone() {
     return this._cloneInto();
@@ -904,14 +904,14 @@ Se.create = (e, t) => new Ue(e, t);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const se = (e, t) => (e + (e >= 0 ? t : -t) / _e) / t;
 function Bn(e, t, r) {
-  const [[n, s], [i, o]] = t, c = se(o * e, r), f = se(-s * e, r);
-  let a = e - c * n - f * i, h = -c * s - f * o;
-  const d = a < tt, y = h < tt;
-  d && (a = -a), y && (h = -h);
+  const [[n, s], [o, i]] = t, c = se(i * e, r), f = se(-s * e, r);
+  let a = e - c * n - f * o, h = -c * s - f * i;
+  const d = a < tt, x = h < tt;
+  d && (a = -a), x && (h = -h);
   const g = Yt(Math.ceil(sn(r) / 2)) + lt;
   if (a < tt || a >= g || h < tt || h >= g)
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
-  return { k1neg: d, k1: a, k2neg: y, k2: h };
+  return { k1neg: d, k1: a, k2neg: x, k2: h };
 }
 function Zt(e) {
   if (!["compact", "recovered", "der"].includes(e))
@@ -943,8 +943,8 @@ const ot = {
       const n = t.length / 2, s = pt(n);
       if (s.length / 2 & 128)
         throw new r("tlv.encode: long form length too big");
-      const i = n > 127 ? pt(s.length / 2 | 128) : "";
-      return pt(e) + i + s + t;
+      const o = n > 127 ? pt(s.length / 2 | 128) : "";
+      return pt(e) + o + s + t;
     },
     // v - value, l - left bytes (unparsed)
     decode(e, t) {
@@ -954,10 +954,10 @@ const ot = {
         throw new r("tlv.encode: wrong tag");
       if (t.length < 2 || t[n++] !== e)
         throw new r("tlv.decode: wrong tlv");
-      const s = t[n++], i = !!(s & 128);
-      let o = 0;
-      if (!i)
-        o = s;
+      const s = t[n++], o = !!(s & 128);
+      let i = 0;
+      if (!o)
+        i = s;
       else {
         const f = s & 127;
         if (!f)
@@ -970,14 +970,14 @@ const ot = {
         if (a[0] === 0)
           throw new r("tlv.decode(long): zero leftmost byte");
         for (const h of a)
-          o = o << 8 | h;
-        if (n += f, o < 128)
+          i = i << 8 | h;
+        if (n += f, i < 128)
           throw new r("tlv.decode(long): not minimal encoding");
       }
-      const c = t.subarray(n, n + o);
-      if (c.length !== o)
+      const c = t.subarray(n, n + i);
+      if (c.length !== i)
         throw new r("tlv.decode: wrong value length");
-      return { v: c, l: t.subarray(n + o) };
+      return { v: c, l: t.subarray(n + i) };
     }
   },
   // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,
@@ -1004,23 +1004,23 @@ const ot = {
     }
   },
   toSig(e) {
-    const { Err: t, _int: r, _tlv: n } = ot, s = N(e, void 0, "signature"), { v: i, l: o } = n.decode(48, s);
-    if (o.length)
+    const { Err: t, _int: r, _tlv: n } = ot, s = N(e, void 0, "signature"), { v: o, l: i } = n.decode(48, s);
+    if (i.length)
       throw new t("invalid signature: left bytes after parsing");
-    const { v: c, l: f } = n.decode(2, i), { v: a, l: h } = n.decode(2, f);
+    const { v: c, l: f } = n.decode(2, o), { v: a, l: h } = n.decode(2, f);
     if (h.length)
       throw new t("invalid signature: left bytes after parsing");
     return { r: r.decode(c), s: r.decode(a) };
   },
   hexFromSig(e) {
-    const { _tlv: t, _int: r } = ot, n = t.encode(2, r.encode(e.r)), s = t.encode(2, r.encode(e.s)), i = n + s;
-    return t.encode(48, i);
+    const { _tlv: t, _int: r } = ot, n = t.encode(2, r.encode(e.r)), s = t.encode(2, r.encode(e.s)), o = n + s;
+    return t.encode(48, o);
   }
 }, tt = BigInt(0), lt = BigInt(1), _e = BigInt(2), yt = BigInt(3), Rn = BigInt(4);
 function An(e, t = {}) {
   const r = mn("weierstrass", e, t), { Fp: n, Fn: s } = r;
-  let i = r.CURVE;
-  const { h: o, n: c } = i;
+  let o = r.CURVE;
+  const { h: i, n: c } = o;
   jt(t, {}, {
     allowInfinityPoint: "boolean",
     clearCofactor: "function",
@@ -1030,7 +1030,7 @@ function An(e, t = {}) {
     endo: "object"
   });
   const { endo: f } = t;
-  if (f && (!n.is0(i.a) || typeof f.beta != "bigint" || !Array.isArray(f.basises)))
+  if (f && (!n.is0(o.a) || typeof f.beta != "bigint" || !Array.isArray(f.basises)))
     throw new Error('invalid endo: expected "beta": bigint and "basises": array');
   const a = He(n, s);
   function h() {
@@ -1046,7 +1046,7 @@ function An(e, t = {}) {
     } else
       return it(Uint8Array.of(4), B, n.toBytes(p));
   }
-  function y(S) {
+  function x(S) {
     N(S, void 0, "Point");
     const { publicKey: l, publicKeyUncompressed: u } = a, w = S.length, p = S[0], B = S.subarray(1);
     if (w === l && (p === 2 || p === 3)) {
@@ -1072,18 +1072,18 @@ function An(e, t = {}) {
     } else
       throw new Error(`bad point: got length ${w}, expected compressed=${l} or uncompressed=${u}`);
   }
-  const g = t.toBytes || d, x = t.fromBytes || y;
+  const g = t.toBytes || d, y = t.fromBytes || x;
   function U(S) {
     const l = n.sqr(S), u = n.mul(l, S);
-    return n.add(n.add(u, n.mul(S, i.a)), i.b);
+    return n.add(n.add(u, n.mul(S, o.a)), o.b);
   }
   function I(S, l) {
     const u = n.sqr(l), w = U(S);
     return n.eql(u, w);
   }
-  if (!I(i.Gx, i.Gy))
+  if (!I(o.Gx, o.Gy))
     throw new Error("bad curve params: generator point");
-  const O = n.mul(n.pow(i.a, yt), Rn), j = n.mul(n.sqr(i.b), BigInt(27));
+  const O = n.mul(n.pow(o.a, yt), Rn), j = n.mul(n.sqr(o.b), BigInt(27));
   if (n.is0(n.add(O, j)))
     throw new Error("bad curve params: a or b");
   function W(S, l, u = !1) {
@@ -1139,7 +1139,7 @@ function An(e, t = {}) {
       this.X = W("x", l), this.Y = W("y", u, !0), this.Z = W("z", w), Object.freeze(this);
     }
     static CURVE() {
-      return i;
+      return o;
     }
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
     static fromAffine(l) {
@@ -1151,7 +1151,7 @@ function An(e, t = {}) {
       return n.is0(u) && n.is0(w) ? _.ZERO : new _(u, w, n.ONE);
     }
     static fromBytes(l) {
-      const u = _.fromAffine(x(N(l, void 0, "point")));
+      const u = _.fromAffine(y(N(l, void 0, "point")));
       return u.assertValidity(), u;
     }
     static fromHex(l) {
@@ -1198,7 +1198,7 @@ function An(e, t = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: l, b: u } = i, w = n.mul(u, yt), { X: p, Y: B, Z: E } = this;
+      const { a: l, b: u } = o, w = n.mul(u, yt), { X: p, Y: B, Z: E } = this;
       let v = n.ZERO, b = n.ZERO, R = n.ZERO, L = n.mul(p, p), D = n.mul(B, B), H = n.mul(E, E), A = n.mul(p, B);
       return A = n.add(A, A), R = n.mul(p, E), R = n.add(R, R), v = n.mul(l, R), b = n.mul(w, H), b = n.add(v, b), v = n.sub(D, b), b = n.add(D, b), b = n.mul(v, b), v = n.mul(A, v), R = n.mul(w, R), H = n.mul(l, H), A = n.sub(L, H), A = n.mul(l, A), A = n.add(A, R), R = n.add(L, L), L = n.add(R, L), L = n.add(L, H), L = n.mul(L, A), b = n.add(b, L), H = n.mul(B, E), H = n.add(H, H), L = n.mul(H, A), v = n.sub(v, L), R = n.mul(H, D), R = n.add(R, R), R = n.add(R, R), new _(v, b, R);
     }
@@ -1210,11 +1210,11 @@ function An(e, t = {}) {
       Z(l);
       const { X: u, Y: w, Z: p } = this, { X: B, Y: E, Z: v } = l;
       let b = n.ZERO, R = n.ZERO, L = n.ZERO;
-      const D = i.a, H = n.mul(i.b, yt);
-      let A = n.mul(u, B), $ = n.mul(w, E), V = n.mul(p, v), K = n.add(u, w), q = n.add(B, E);
+      const D = o.a, H = n.mul(o.b, yt);
+      let A = n.mul(u, B), $ = n.mul(w, E), T = n.mul(p, v), K = n.add(u, w), q = n.add(B, E);
       K = n.mul(K, q), q = n.add(A, $), K = n.sub(K, q), q = n.add(u, p);
-      let T = n.add(B, v);
-      return q = n.mul(q, T), T = n.add(A, V), q = n.sub(q, T), T = n.add(w, p), b = n.add(E, v), T = n.mul(T, b), b = n.add($, V), T = n.sub(T, b), L = n.mul(D, q), b = n.mul(H, V), L = n.add(b, L), b = n.sub($, L), L = n.add($, L), R = n.mul(b, L), $ = n.add(A, A), $ = n.add($, A), V = n.mul(D, V), q = n.mul(H, q), $ = n.add($, V), V = n.sub(A, V), V = n.mul(D, V), q = n.add(q, V), A = n.mul($, q), R = n.add(R, A), A = n.mul(T, q), b = n.mul(K, b), b = n.sub(b, A), A = n.mul(K, $), L = n.mul(T, L), L = n.add(L, A), new _(b, R, L);
+      let V = n.add(B, v);
+      return q = n.mul(q, V), V = n.add(A, T), q = n.sub(q, V), V = n.add(w, p), b = n.add(E, v), V = n.mul(V, b), b = n.add($, T), V = n.sub(V, b), L = n.mul(D, q), b = n.mul(H, T), L = n.add(b, L), b = n.sub($, L), L = n.add($, L), R = n.mul(b, L), $ = n.add(A, A), $ = n.add($, A), T = n.mul(D, T), q = n.mul(H, q), $ = n.add($, T), T = n.sub(A, T), T = n.mul(D, T), q = n.add(q, T), A = n.mul($, q), R = n.add(R, A), A = n.mul(V, q), b = n.mul(K, b), b = n.sub(b, A), A = n.mul(K, $), L = n.mul(V, L), L = n.add(L, A), new _(b, R, L);
     }
     subtract(l) {
       return this.add(l.negate());
@@ -1280,14 +1280,14 @@ function An(e, t = {}) {
      */
     isTorsionFree() {
       const { isTorsionFree: l } = t;
-      return o === lt ? !0 : l ? l(_, this) : ct.unsafe(this, c).is0();
+      return i === lt ? !0 : l ? l(_, this) : ct.unsafe(this, c).is0();
     }
     clearCofactor() {
       const { clearCofactor: l } = t;
-      return o === lt ? this : l ? l(_, this) : this.multiplyUnsafe(o);
+      return i === lt ? this : l ? l(_, this) : this.multiplyUnsafe(i);
     }
     isSmallOrder() {
-      return this.multiplyUnsafe(o).is0();
+      return this.multiplyUnsafe(i).is0();
     }
     toBytes(l = !0) {
       return At(l, "isCompressed"), this.assertValidity(), g(_, this, l);
@@ -1300,7 +1300,7 @@ function An(e, t = {}) {
     }
   };
   // base / generator point
-  m(_, "BASE", new _(i.Gx, i.Gy, n.ONE)), // zero / infinity / identity point
+  m(_, "BASE", new _(o.Gx, o.Gy, n.ONE)), // zero / infinity / identity point
   m(_, "ZERO", new _(n.ZERO, n.ONE, n.ZERO)), // 0, 1, 0
   // math field
   m(_, "Fp", n), // scalar field
@@ -1323,19 +1323,19 @@ function He(e, t) {
 }
 function In(e, t = {}) {
   const { Fn: r } = e, n = t.randomBytes || le, s = Object.assign(He(e.Fp, r), { seed: Ae(r.ORDER) });
-  function i(g) {
+  function o(g) {
     try {
-      const x = r.fromBytes(g);
-      return r.isValidNot0(x);
+      const y = r.fromBytes(g);
+      return r.isValidNot0(y);
     } catch {
       return !1;
     }
   }
-  function o(g, x) {
+  function i(g, y) {
     const { publicKey: U, publicKeyUncompressed: I } = s;
     try {
       const O = g.length;
-      return x === !0 && O !== U || x === !1 && O !== I ? !1 : !!e.fromBytes(g);
+      return y === !0 && O !== U || y === !1 && O !== I ? !1 : !!e.fromBytes(g);
     } catch {
       return !1;
     }
@@ -1343,30 +1343,30 @@ function In(e, t = {}) {
   function c(g = n(s.seed)) {
     return pn(N(g, s.seed, "seed"), r.ORDER);
   }
-  function f(g, x = !0) {
-    return e.BASE.multiply(r.fromBytes(g)).toBytes(x);
+  function f(g, y = !0) {
+    return e.BASE.multiply(r.fromBytes(g)).toBytes(y);
   }
   function a(g) {
-    const { secretKey: x, publicKey: U, publicKeyUncompressed: I } = s;
-    if (!Vt(g) || "_lengths" in r && r._lengths || x === U)
+    const { secretKey: y, publicKey: U, publicKeyUncompressed: I } = s;
+    if (!Tt(g) || "_lengths" in r && r._lengths || y === U)
       return;
     const O = N(g, void 0, "key").length;
     return O === U || O === I;
   }
-  function h(g, x, U = !0) {
+  function h(g, y, U = !0) {
     if (a(g) === !0)
       throw new Error("first arg must be private key");
-    if (a(x) === !1)
+    if (a(y) === !1)
       throw new Error("second arg must be public key");
     const I = r.fromBytes(g);
-    return e.fromBytes(x).multiply(I).toBytes(U);
+    return e.fromBytes(y).multiply(I).toBytes(U);
   }
   const d = {
-    isValidSecretKey: i,
-    isValidPublicKey: o,
+    isValidSecretKey: o,
+    isValidPublicKey: i,
     randomSecretKey: c
-  }, y = En(c, f);
-  return Object.freeze({ getPublicKey: f, getSharedSecret: h, keygen: y, Point: e, utils: d, lengths: s });
+  }, x = En(c, f);
+  return Object.freeze({ getPublicKey: f, getSharedSecret: h, keygen: x, Point: e, utils: d, lengths: s });
 }
 function Ln(e, t, r = {}) {
   ae(t), jt(r, {}, {
@@ -1376,18 +1376,18 @@ function Ln(e, t, r = {}) {
     bits2int: "function",
     bits2int_modN: "function"
   }), r = Object.assign({}, r);
-  const n = r.randomBytes || le, s = r.hmac || ((l, u) => Se(t, l, u)), { Fp: i, Fn: o } = e, { ORDER: c, BITS: f } = o, { keygen: a, getPublicKey: h, getSharedSecret: d, utils: y, lengths: g } = In(e, r), x = {
+  const n = r.randomBytes || le, s = r.hmac || ((l, u) => Se(t, l, u)), { Fp: o, Fn: i } = e, { ORDER: c, BITS: f } = i, { keygen: a, getPublicKey: h, getSharedSecret: d, utils: x, lengths: g } = In(e, r), y = {
     prehash: !0,
     lowS: typeof r.lowS == "boolean" ? r.lowS : !0,
     format: "compact",
     extraEntropy: !1
-  }, U = c * _e < i.ORDER;
+  }, U = c * _e < o.ORDER;
   function I(l) {
     const u = c >> lt;
     return l > u;
   }
   function O(l, u) {
-    if (!o.isValidNot0(u))
+    if (!i.isValidNot0(u))
       throw new Error(`invalid signature ${l}: out of range 1..Point.Fn.ORDER`);
     return u;
   }
@@ -1412,7 +1412,7 @@ function Ln(e, t, r = {}) {
       }
       Object.freeze(this);
     }
-    static fromBytes(u, w = x.format) {
+    static fromBytes(u, w = y.format) {
       W(u, w);
       let p;
       if (w === "der") {
@@ -1421,7 +1421,7 @@ function Ln(e, t, r = {}) {
       }
       w === "recovered" && (p = u[0], w = "compact", u = u.subarray(1));
       const B = g.signature / 2, E = u.subarray(0, B), v = u.subarray(B, B * 2);
-      return new Z(o.fromBytes(E), o.fromBytes(v), p);
+      return new Z(i.fromBytes(E), i.fromBytes(v), p);
     }
     static fromHex(u, w) {
       return this.fromBytes(Rt(u), w);
@@ -1437,9 +1437,9 @@ function Ln(e, t, r = {}) {
     }
     recoverPublicKey(u) {
       const { r: w, s: p } = this, B = this.assertRecovery(), E = B === 2 || B === 3 ? w + c : w;
-      if (!i.isValid(E))
+      if (!o.isValid(E))
         throw new Error("invalid recovery id: sig.r+curve.n != R.x");
-      const v = i.toBytes(E), b = e.fromBytes(it(Oe((B & 1) === 0), v)), R = o.inv(E), L = G(N(u, void 0, "msgHash")), D = o.create(-L * R), H = o.create(p * R), A = e.BASE.multiplyUnsafe(D).add(b.multiplyUnsafe(H));
+      const v = o.toBytes(E), b = e.fromBytes(it(Oe((B & 1) === 0), v)), R = i.inv(E), L = G(N(u, void 0, "msgHash")), D = i.create(-L * R), H = i.create(p * R), A = e.BASE.multiplyUnsafe(D).add(b.multiplyUnsafe(H));
       if (A.is0())
         throw new Error("invalid recovery: point at infinify");
       return A.assertValidity(), A;
@@ -1448,10 +1448,10 @@ function Ln(e, t, r = {}) {
     hasHighS() {
       return I(this.s);
     }
-    toBytes(u = x.format) {
+    toBytes(u = y.format) {
       if (Zt(u), u === "der")
         return Rt(ot.hexFromSig(this));
-      const { r: w, s: p } = this, B = o.toBytes(w), E = o.toBytes(p);
+      const { r: w, s: p } = this, B = i.toBytes(w), E = i.toBytes(p);
       return u === "recovered" ? (j(), it(Uint8Array.of(this.assertRecovery()), B, E)) : it(B, E);
     }
     toHex(u) {
@@ -1464,19 +1464,19 @@ function Ln(e, t, r = {}) {
     const w = Ut(u), p = u.length * 8 - f;
     return p > 0 ? w >> BigInt(p) : w;
   }, G = r.bits2int_modN || function(u) {
-    return o.create(k(u));
+    return i.create(k(u));
   }, _t = Yt(f);
   function ht(l) {
-    return rn("num < 2^" + f, l, tt, _t), o.toBytes(l);
+    return rn("num < 2^" + f, l, tt, _t), i.toBytes(l);
   }
   function z(l, u) {
     return N(l, void 0, "message"), u ? N(t(l), void 0, "prehashed message") : l;
   }
   function bt(l, u, w) {
-    const { lowS: p, prehash: B, extraEntropy: E } = Dt(w, x);
+    const { lowS: p, prehash: B, extraEntropy: E } = Dt(w, y);
     l = z(l, B);
-    const v = G(l), b = o.fromBytes(u);
-    if (!o.isValidNot0(b))
+    const v = G(l), b = i.fromBytes(u);
+    if (!i.isValidNot0(b))
       throw new Error("invalid private key");
     const R = [ht(b), ht(v)];
     if (E != null && E !== !1) {
@@ -1486,26 +1486,26 @@ function Ln(e, t, r = {}) {
     const L = it(...R), D = v;
     function H(A) {
       const $ = k(A);
-      if (!o.isValidNot0($))
+      if (!i.isValidNot0($))
         return;
-      const V = o.inv($), K = e.BASE.multiply($).toAffine(), q = o.create(K.x);
+      const T = i.inv($), K = e.BASE.multiply($).toAffine(), q = i.create(K.x);
       if (q === tt)
         return;
-      const T = o.create(V * o.create(D + q * b));
-      if (T === tt)
+      const V = i.create(T * i.create(D + q * b));
+      if (V === tt)
         return;
-      let zt = (K.x === q ? 0 : 2) | Number(K.y & lt), Ft = T;
-      return p && I(T) && (Ft = o.neg(T), zt ^= 1), new Z(q, Ft, U ? void 0 : zt);
+      let zt = (K.x === q ? 0 : 2) | Number(K.y & lt), Ft = V;
+      return p && I(V) && (Ft = i.neg(V), zt ^= 1), new Z(q, Ft, U ? void 0 : zt);
     }
     return { seed: L, k2sig: H };
   }
   function ct(l, u, w = {}) {
     const { seed: p, k2sig: B } = bt(l, u, w);
-    return on(t.outputLen, o.BYTES, s)(p, B).toBytes(w.format);
+    return on(t.outputLen, i.BYTES, s)(p, B).toBytes(w.format);
   }
   function _(l, u, w, p = {}) {
-    const { lowS: B, prehash: E, format: v } = Dt(p, x);
-    if (w = N(w, void 0, "publicKey"), u = z(u, E), !Vt(l)) {
+    const { lowS: B, prehash: E, format: v } = Dt(p, y);
+    if (w = N(w, void 0, "publicKey"), u = z(u, E), !Tt(l)) {
       const b = l instanceof Z ? ", use sig.toBytes()" : "";
       throw new Error("verify expects Uint8Array signature" + b);
     }
@@ -1514,21 +1514,21 @@ function Ln(e, t, r = {}) {
       const b = Z.fromBytes(l, v), R = e.fromBytes(w);
       if (B && b.hasHighS())
         return !1;
-      const { r: L, s: D } = b, H = G(u), A = o.inv(D), $ = o.create(H * A), V = o.create(L * A), K = e.BASE.multiplyUnsafe($).add(R.multiplyUnsafe(V));
-      return K.is0() ? !1 : o.create(K.x) === L;
+      const { r: L, s: D } = b, H = G(u), A = i.inv(D), $ = i.create(H * A), T = i.create(L * A), K = e.BASE.multiplyUnsafe($).add(R.multiplyUnsafe(T));
+      return K.is0() ? !1 : i.create(K.x) === L;
     } catch {
       return !1;
     }
   }
   function S(l, u, w = {}) {
-    const { prehash: p } = Dt(w, x);
+    const { prehash: p } = Dt(w, y);
     return u = z(u, p), Z.fromBytes(l, "recovered").recoverPublicKey(u).toBytes();
   }
   return Object.freeze({
     keygen: a,
     getPublicKey: h,
     getSharedSecret: d,
-    utils: y,
+    utils: x,
     lengths: g,
     Point: e,
     sign: ct,
@@ -1555,7 +1555,7 @@ const Gt = {
   ]
 }, oe = /* @__PURE__ */ BigInt(2);
 function Sn(e) {
-  const t = Gt.p, r = BigInt(3), n = BigInt(6), s = BigInt(11), i = BigInt(22), o = BigInt(23), c = BigInt(44), f = BigInt(88), a = e * e * e % t, h = a * a * e % t, d = X(h, r, t) * h % t, y = X(d, r, t) * h % t, g = X(y, oe, t) * a % t, x = X(g, s, t) * g % t, U = X(x, i, t) * x % t, I = X(U, c, t) * U % t, O = X(I, f, t) * I % t, j = X(O, c, t) * U % t, W = X(j, r, t) * h % t, Z = X(W, o, t) * x % t, k = X(Z, n, t) * a % t, G = X(k, oe, t);
+  const t = Gt.p, r = BigInt(3), n = BigInt(6), s = BigInt(11), o = BigInt(22), i = BigInt(23), c = BigInt(44), f = BigInt(88), a = e * e * e % t, h = a * a * e % t, d = X(h, r, t) * h % t, x = X(d, r, t) * h % t, g = X(x, oe, t) * a % t, y = X(g, s, t) * g % t, U = X(y, o, t) * y % t, I = X(U, c, t) * U % t, O = X(I, f, t) * I % t, j = X(O, c, t) * U % t, W = X(j, r, t) * h % t, Z = X(W, i, t) * y % t, k = X(Z, n, t) * a % t, G = X(k, oe, t);
   if (!Ct.eql(Ct.sqr(G), e))
     throw new Error("Cannot find square root");
   return G;
@@ -1616,8 +1616,8 @@ function Ne(e) {
 function kn(e, t, r, n) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, r, n);
-  const s = BigInt(32), i = BigInt(4294967295), o = Number(r >> s & i), c = Number(r & i), f = n ? 4 : 0, a = n ? 0 : 4;
-  e.setUint32(t + f, o, n), e.setUint32(t + a, c, n);
+  const s = BigInt(32), o = BigInt(4294967295), i = Number(r >> s & o), c = Number(r & o), f = n ? 4 : 0, a = n ? 0 : 4;
+  e.setUint32(t + f, i, n), e.setUint32(t + a, c, n);
 }
 function $n(e, t, r) {
   return e & t ^ ~e & r;
@@ -1631,27 +1631,27 @@ class De extends Dn {
   }
   update(t) {
     ie(this), t = qe(t), Xt(t);
-    const { view: r, buffer: n, blockLen: s } = this, i = t.length;
-    for (let o = 0; o < i; ) {
-      const c = Math.min(s - this.pos, i - o);
+    const { view: r, buffer: n, blockLen: s } = this, o = t.length;
+    for (let i = 0; i < o; ) {
+      const c = Math.min(s - this.pos, o - i);
       if (c === s) {
         const f = kt(t);
-        for (; s <= i - o; o += s)
-          this.process(f, o);
+        for (; s <= o - i; i += s)
+          this.process(f, i);
         continue;
       }
-      n.set(t.subarray(o, o + c), this.pos), this.pos += c, o += c, this.pos === s && (this.process(r, 0), this.pos = 0);
+      n.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === s && (this.process(r, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
     ie(this), qn(t, this), this.finished = !0;
-    const { buffer: r, view: n, blockLen: s, isLE: i } = this;
-    let { pos: o } = this;
-    r[o++] = 128, gt(this.buffer.subarray(o)), this.padOffset > s - o && (this.process(n, 0), o = 0);
-    for (let d = o; d < s; d++)
+    const { buffer: r, view: n, blockLen: s, isLE: o } = this;
+    let { pos: i } = this;
+    r[i++] = 128, gt(this.buffer.subarray(i)), this.padOffset > s - i && (this.process(n, 0), i = 0);
+    for (let d = i; d < s; d++)
       r[d] = 0;
-    kn(n, s - 8, BigInt(this.length * 8), i), this.process(n, 0);
+    kn(n, s - 8, BigInt(this.length * 8), o), this.process(n, 0);
     const c = kt(t), f = this.outputLen;
     if (f % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
@@ -1659,7 +1659,7 @@ class De extends Dn {
     if (a > h.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let d = 0; d < a; d++)
-      c.setUint32(4 * d, h[d], i);
+      c.setUint32(4 * d, h[d], o);
   }
   digest() {
     const { buffer: t, outputLen: r } = this;
@@ -1669,8 +1669,8 @@ class De extends Dn {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: r, buffer: n, length: s, finished: i, destroyed: o, pos: c } = this;
-    return t.destroyed = o, t.finished = i, t.length = s, t.pos = c, s % r && t.buffer.set(n), t;
+    const { blockLen: r, buffer: n, length: s, finished: o, destroyed: i, pos: c } = this;
+    return t.destroyed = i, t.finished = o, t.length = s, t.pos = c, s % r && t.buffer.set(n), t;
   }
   clone() {
     return this._cloneInto();
@@ -1702,19 +1702,19 @@ const rt = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), ke = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Vn = ke.map((e) => (9 * e + 5) % 16), $e = /* @__PURE__ */ (() => {
-  const r = [[ke], [Vn]];
+]), ke = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Tn = ke.map((e) => (9 * e + 5) % 16), $e = /* @__PURE__ */ (() => {
+  const r = [[ke], [Tn]];
   for (let n = 0; n < 4; n++)
     for (let s of r)
-      s.push(s[n].map((i) => Cn[i]));
+      s.push(s[n].map((o) => Cn[o]));
   return r;
-})(), Ze = $e[0], Ce = $e[1], Ve = /* @__PURE__ */ [
+})(), Ze = $e[0], Ce = $e[1], Te = /* @__PURE__ */ [
   [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
   [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
   [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
   [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
   [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
-].map((e) => Uint8Array.from(e)), Tn = /* @__PURE__ */ Ze.map((e, t) => e.map((r) => Ve[t][r])), Mn = /* @__PURE__ */ Ce.map((e, t) => e.map((r) => Ve[t][r])), Yn = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), Vn = /* @__PURE__ */ Ze.map((e, t) => e.map((r) => Te[t][r])), Mn = /* @__PURE__ */ Ce.map((e, t) => e.map((r) => Te[t][r])), Yn = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
@@ -1736,28 +1736,28 @@ class Kn extends De {
     super(64, 20, 8, !0), this.h0 = 1732584193, this.h1 = -271733879, this.h2 = -1732584194, this.h3 = 271733878, this.h4 = -1009589776;
   }
   get() {
-    const { h0: t, h1: r, h2: n, h3: s, h4: i } = this;
-    return [t, r, n, s, i];
+    const { h0: t, h1: r, h2: n, h3: s, h4: o } = this;
+    return [t, r, n, s, o];
   }
-  set(t, r, n, s, i) {
-    this.h0 = t | 0, this.h1 = r | 0, this.h2 = n | 0, this.h3 = s | 0, this.h4 = i | 0;
+  set(t, r, n, s, o) {
+    this.h0 = t | 0, this.h1 = r | 0, this.h2 = n | 0, this.h3 = s | 0, this.h4 = o | 0;
   }
   process(t, r) {
     for (let g = 0; g < 16; g++, r += 4)
       mt[g] = t.getUint32(r, !0);
-    let n = this.h0 | 0, s = n, i = this.h1 | 0, o = i, c = this.h2 | 0, f = c, a = this.h3 | 0, h = a, d = this.h4 | 0, y = d;
+    let n = this.h0 | 0, s = n, o = this.h1 | 0, i = o, c = this.h2 | 0, f = c, a = this.h3 | 0, h = a, d = this.h4 | 0, x = d;
     for (let g = 0; g < 5; g++) {
-      const x = 4 - g, U = Yn[g], I = jn[g], O = Ze[g], j = Ce[g], W = Tn[g], Z = Mn[g];
+      const y = 4 - g, U = Yn[g], I = jn[g], O = Ze[g], j = Ce[g], W = Vn[g], Z = Mn[g];
       for (let k = 0; k < 16; k++) {
-        const G = xt(n + ce(g, i, c, a) + mt[O[k]] + U, W[k]) + d | 0;
-        n = d, d = a, a = xt(c, 10) | 0, c = i, i = G;
+        const G = xt(n + ce(g, o, c, a) + mt[O[k]] + U, W[k]) + d | 0;
+        n = d, d = a, a = xt(c, 10) | 0, c = o, o = G;
       }
       for (let k = 0; k < 16; k++) {
-        const G = xt(s + ce(x, o, f, h) + mt[j[k]] + I, Z[k]) + y | 0;
-        s = y, y = h, h = xt(f, 10) | 0, f = o, o = G;
+        const G = xt(s + ce(y, i, f, h) + mt[j[k]] + I, Z[k]) + x | 0;
+        s = x, x = h, h = xt(f, 10) | 0, f = i, i = G;
       }
     }
-    this.set(this.h1 + c + h | 0, this.h2 + a + y | 0, this.h3 + d + s | 0, this.h4 + n + o | 0, this.h0 + i + f | 0);
+    this.set(this.h1 + c + h | 0, this.h2 + a + x | 0, this.h3 + d + s | 0, this.h4 + n + i | 0, this.h0 + o + f | 0);
   }
   roundClean() {
     gt(mt);
@@ -1837,26 +1837,26 @@ class Fn extends De {
     super(64, t, 8, !1), this.A = rt[0] | 0, this.B = rt[1] | 0, this.C = rt[2] | 0, this.D = rt[3] | 0, this.E = rt[4] | 0, this.F = rt[5] | 0, this.G = rt[6] | 0, this.H = rt[7] | 0;
   }
   get() {
-    const { A: t, B: r, C: n, D: s, E: i, F: o, G: c, H: f } = this;
-    return [t, r, n, s, i, o, c, f];
+    const { A: t, B: r, C: n, D: s, E: o, F: i, G: c, H: f } = this;
+    return [t, r, n, s, o, i, c, f];
   }
   // prettier-ignore
-  set(t, r, n, s, i, o, c, f) {
-    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = s | 0, this.E = i | 0, this.F = o | 0, this.G = c | 0, this.H = f | 0;
+  set(t, r, n, s, o, i, c, f) {
+    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = s | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = f | 0;
   }
   process(t, r) {
     for (let d = 0; d < 16; d++, r += 4)
       st[d] = t.getUint32(r, !1);
     for (let d = 16; d < 64; d++) {
-      const y = st[d - 15], g = st[d - 2], x = Q(y, 7) ^ Q(y, 18) ^ y >>> 3, U = Q(g, 17) ^ Q(g, 19) ^ g >>> 10;
-      st[d] = U + st[d - 7] + x + st[d - 16] | 0;
+      const x = st[d - 15], g = st[d - 2], y = Q(x, 7) ^ Q(x, 18) ^ x >>> 3, U = Q(g, 17) ^ Q(g, 19) ^ g >>> 10;
+      st[d] = U + st[d - 7] + y + st[d - 16] | 0;
     }
-    let { A: n, B: s, C: i, D: o, E: c, F: f, G: a, H: h } = this;
+    let { A: n, B: s, C: o, D: i, E: c, F: f, G: a, H: h } = this;
     for (let d = 0; d < 64; d++) {
-      const y = Q(c, 6) ^ Q(c, 11) ^ Q(c, 25), g = h + y + $n(c, f, a) + zn[d] + st[d] | 0, U = (Q(n, 2) ^ Q(n, 13) ^ Q(n, 22)) + Zn(n, s, i) | 0;
-      h = a, a = f, f = c, c = o + g | 0, o = i, i = s, s = n, n = g + U | 0;
+      const x = Q(c, 6) ^ Q(c, 11) ^ Q(c, 25), g = h + x + $n(c, f, a) + zn[d] + st[d] | 0, U = (Q(n, 2) ^ Q(n, 13) ^ Q(n, 22)) + Zn(n, s, o) | 0;
+      h = a, a = f, f = c, c = i + g | 0, i = o, o = s, s = n, n = g + U | 0;
     }
-    n = n + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, a = a + this.G | 0, h = h + this.H | 0, this.set(n, s, i, o, c, f, a, h);
+    n = n + this.A | 0, s = s + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, a = a + this.G | 0, h = h + this.H | 0, this.set(n, s, o, i, c, f, a, h);
   }
   roundClean() {
     gt(st);
@@ -1873,16 +1873,16 @@ function Qn(e) {
     if (!n) continue;
     const s = Pn.indexOf(n);
     if (s === -1) throw new Error("Invalid base58 character");
-    for (let o = 0; o < t.length; o++)
-      t[o] *= 58;
+    for (let i = 0; i < t.length; i++)
+      t[i] *= 58;
     t[0] += s;
-    let i = 0;
-    for (let o = 0; o < t.length; o++) {
-      const c = t[o];
-      t[o] = c + i, i = t[o] >> 8, t[o] &= 255;
+    let o = 0;
+    for (let i = 0; i < t.length; i++) {
+      const c = t[i];
+      t[i] = c + o, o = t[i] >> 8, t[i] &= 255;
     }
-    for (; i > 0; )
-      t.push(i & 255), i >>= 8;
+    for (; o > 0; )
+      t.push(o & 255), o >>= 8;
   }
   for (let r = 0; r < e.length && e[r] === "1"; r++)
     t.push(0);
@@ -1891,15 +1891,15 @@ function Qn(e) {
 function Jn(e) {
   const t = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", n = e.toLowerCase().split("1");
   if (n.length !== 2) return null;
-  const s = n[0], i = n[1];
-  if (!s || !i || s !== "dgb") return null;
-  const o = [];
-  for (const h of i) {
+  const s = n[0], o = n[1];
+  if (!s || !o || s !== "dgb") return null;
+  const i = [];
+  for (const h of o) {
     const d = t.indexOf(h);
     if (d === -1) return null;
-    o.push(d);
+    i.push(d);
   }
-  const c = o.slice(0, -6);
+  const c = i.slice(0, -6);
   if (c.length < 1) return null;
   const f = c[0];
   if (f === void 0) return null;
@@ -1907,33 +1907,33 @@ function Jn(e) {
   return a ? { version: f, program: new Uint8Array(a) } : null;
 }
 function tr(e, t, r, n) {
-  let s = 0, i = 0;
-  const o = [], c = (1 << r) - 1;
+  let s = 0, o = 0;
+  const i = [], c = (1 << r) - 1;
   for (const f of e) {
     if (f < 0 || f >> t !== 0) return null;
-    for (s = s << t | f, i += t; i >= r; )
-      i -= r, o.push(s >> i & c);
+    for (s = s << t | f, o += t; o >= r; )
+      o -= r, i.push(s >> o & c);
   }
-  return i >= t || s << r - i & c ? null : o;
+  return o >= t || s << r - o & c ? null : i;
 }
 function er(e, t) {
-  const r = new TextEncoder().encode(t), n = new Uint8Array([r.length]), s = new TextEncoder().encode(e), i = [];
-  let o = s.length;
-  if (o < 253)
-    i.push(o);
-  else if (o <= 65535)
-    i.push(253, o & 255, o >> 8 & 255);
-  else if (o <= 4294967295)
-    i.push(
+  const r = new TextEncoder().encode(t), n = new Uint8Array([r.length]), s = new TextEncoder().encode(e), o = [];
+  let i = s.length;
+  if (i < 253)
+    o.push(i);
+  else if (i <= 65535)
+    o.push(253, i & 255, i >> 8 & 255);
+  else if (i <= 4294967295)
+    o.push(
       254,
-      o & 255,
-      o >> 8 & 255,
-      o >> 16 & 255,
-      o >> 24 & 255
+      i & 255,
+      i >> 8 & 255,
+      i >> 16 & 255,
+      i >> 24 & 255
     );
   else
     throw new Error("Message too long");
-  const c = new Uint8Array(i), f = n.length + r.length + c.length + s.length, a = new Uint8Array(f);
+  const c = new Uint8Array(o), f = n.length + r.length + c.length + s.length, a = new Uint8Array(f);
   let h = 0;
   return a.set(n, h), h += n.length, a.set(r, h), h += r.length, a.set(c, h), h += c.length, a.set(s, h), wt(wt(a));
 }
@@ -1942,22 +1942,18 @@ function nr(e, t) {
     throw new Error("Invalid signature length");
   const r = t[0];
   if (r === void 0) throw new Error("Invalid signature");
-  const n = r - 27, s = n >= 4;
-  if (n % 4 > 3)
+  const n = r - 27, s = n >= 4, o = n % 4;
+  if (o < 0 || o > 3)
     throw new Error("Invalid recovery ID");
-  const o = t.slice(1, 33), c = t.slice(33, 65), f = new On.Signature(
-    BigInt("0x" + Array.from(o).map((a) => a.toString(16).padStart(2, "0")).join("")),
+  const i = t.slice(1, 33), c = t.slice(33, 65), f = new On.Signature(
+    BigInt("0x" + Array.from(i).map((a) => a.toString(16).padStart(2, "0")).join("")),
     BigInt("0x" + Array.from(c).map((a) => a.toString(16).padStart(2, "0")).join(""))
-  );
+  ).addRecoveryBit(o);
   try {
-    return [f.recoverPublicKey(e).toHex(s)].map((h) => {
-      const d = new Uint8Array(h.length / 2);
-      for (let y = 0; y < h.length; y += 2)
-        d[y / 2] = parseInt(h.slice(y, y + 2), 16);
-      return d;
-    });
-  } catch {
-    throw new Error("Failed to recover public key");
+    const a = f.recoverPublicKey(e), h = a.toBytes(!0), d = a.toBytes(!1);
+    return s ? [h] : [d, h];
+  } catch (a) {
+    throw new Error("Failed to recover public key: " + (a instanceof Error ? a.message : String(a)));
   }
 }
 function fe(e) {
@@ -1968,8 +1964,8 @@ function rr(e, t) {
     try {
       const r = Qn(e);
       if (r.length < 25) return !1;
-      const n = r.slice(0, -4), s = r.slice(-4), o = wt(wt(n)).slice(0, 4);
-      if (!s.every((a, h) => a === o[h]))
+      const n = r.slice(0, -4), s = r.slice(-4), i = wt(wt(n)).slice(0, 4);
+      if (!s.every((a, h) => a === i[h]))
         return !1;
       const c = n.slice(1), f = fe(t);
       return c.every((a, h) => a === f[h]);
@@ -1982,8 +1978,13 @@ function rr(e, t) {
       if (!r) return !1;
       const { version: n, program: s } = r;
       if (n === 0) {
-        const i = fe(t);
-        return s.every((o, c) => o === i[c]);
+        let o = t;
+        if (t.length === 65) {
+          const c = t[64] % 2 === 0;
+          o = new Uint8Array(33), o[0] = c ? 2 : 3, o.set(t.slice(1, 33), 1);
+        }
+        const i = fe(o);
+        return s.every((c, f) => c === i[f]);
       }
       return !1;
     } catch {
@@ -1998,14 +1999,14 @@ async function sr(e, t, r) {
     const s = Uint8Array.from(atob(r), (c) => c.charCodeAt(0));
     if (s.length !== 65)
       throw new Error("Invalid signature length");
-    const i = er(e, n), o = nr(i, s);
-    for (const c of o)
+    const o = er(e, n), i = nr(o, s);
+    for (const c of i)
       if (rr(t, c))
         return !0;
     return !1;
   } catch (s) {
-    const i = s instanceof Error ? s.message : String(s);
-    throw new C(`Signature verification failed: ${i}`);
+    const o = s instanceof Error ? s.message : String(s);
+    throw new C(`Signature verification failed: ${o}`);
   }
 }
 function or(e = 16) {
@@ -2017,8 +2018,8 @@ function ar(e) {
   let t;
   try {
     t = new URL(e.callbackUrl);
-  } catch (o) {
-    throw new C(`Invalid callback URL: ${o.message}`);
+  } catch (i) {
+    throw new C(`Invalid callback URL: ${i.message}`);
   }
   const r = t.host + t.pathname, n = e.nonce || or(), s = e.unsecure ? "1" : "0";
   if (e.unsecure && t.protocol !== "http:")
@@ -2028,40 +2029,40 @@ function ar(e) {
   return `digiid://${r}?x=${n}&u=${s}`;
 }
 async function ur(e, t) {
-  const { address: r, uri: n, signature: s } = e, { expectedCallbackUrl: i, expectedNonce: o } = t;
+  const { address: r, uri: n, signature: s } = e, { expectedCallbackUrl: o, expectedNonce: i } = t;
   if (!r || !n || !s)
     throw new C("Missing required callback data: address, uri, or signature.");
   let c;
   try {
-    const x = n.replace(/^digiid:/, "http:");
-    c = new URL(x);
-  } catch (x) {
-    throw new C(`Invalid URI received in callback: ${x.message}`);
+    const y = n.replace(/^digiid:/, "http:");
+    c = new URL(y);
+  } catch (y) {
+    throw new C(`Invalid URI received in callback: ${y.message}`);
   }
   const f = c.searchParams.get("x"), a = c.searchParams.get("u"), h = c.host + c.pathname;
   if (f === null || a === null)
     throw new C("URI missing nonce (x) or unsecure (u) parameter.");
   let d;
   try {
-    d = typeof i == "string" ? new URL(i) : i;
-  } catch (x) {
-    throw new C(`Invalid expectedCallbackUrl provided: ${x.message}`);
+    d = typeof o == "string" ? new URL(o) : o;
+  } catch (y) {
+    throw new C(`Invalid expectedCallbackUrl provided: ${y.message}`);
   }
-  const y = d.host + d.pathname;
-  if (h !== y)
-    throw new C(`Callback URL mismatch: URI contained "${h}", expected "${y}"`);
+  const x = d.host + d.pathname;
+  if (h !== x)
+    throw new C(`Callback URL mismatch: URI contained "${h}", expected "${x}"`);
   const g = d.protocol;
   if (a === "1" && g !== "http:")
     throw new C("URI indicates unsecure (u=1), but expectedCallbackUrl is not http.");
   if (a === "0" && g !== "https:")
     throw new C("URI indicates secure (u=0), but expectedCallbackUrl is not https.");
-  if (o && f !== o)
-    throw new C(`Nonce mismatch: URI contained "${f}", expected "${o}". Possible replay attack.`);
+  if (i && f !== i)
+    throw new C(`Nonce mismatch: URI contained "${f}", expected "${i}". Possible replay attack.`);
   try {
     if (!await sr(n, r, s))
       throw new C("Invalid signature.");
-  } catch (x) {
-    throw x instanceof C ? x : new C(`Unexpected error during signature verification: ${x.message}`);
+  } catch (y) {
+    throw y instanceof C ? y : new C(`Unexpected error during signature verification: ${y.message}`);
   }
   return {
     isValid: !0,