digiid-ts 2.0.1-beta.0 → 2.0.1-beta.2

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 at(e, t = "") {
@@ -18,7 +18,7 @@ function at(e, t = "") {
   }
 }
 function N(e, t, r = "") {
-  const n = Vt(e), s = e == null ? void 0 : e.length, o = t !== void 0;
+  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);
@@ -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;
 }
@@ -918,7 +918,7 @@ function Zt(e) {
     throw new Error('Signature format must be "compact", "recovered", or "der"');
   return e;
 }
-function Dt(e, t) {
+function kt(e, t) {
   const r = {};
   for (let n of Object.keys(t))
     r[n] = e[n] === void 0 ? t[n] : e[n];
@@ -1057,8 +1057,8 @@ function An(e, t = {}) {
       let b;
       try {
         b = n.sqrt(v);
-      } catch (D) {
-        const H = D instanceof Error ? ": " + D.message : "";
+      } catch (k) {
+        const H = k instanceof Error ? ": " + k.message : "";
         throw new Error("bad point: is not on curve, sqrt error" + H);
       }
       h();
@@ -1095,7 +1095,7 @@ function An(e, t = {}) {
     if (!(S instanceof z))
       throw new Error("Weierstrass Point expected");
   }
-  function k(S) {
+  function D(S) {
     if (!f || !f.basises)
       throw new Error("no endo");
     return Bn(S, f.basises, s.ORDER);
@@ -1199,8 +1199,8 @@ function An(e, t = {}) {
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
       const { a: l, b: a } = o, w = n.mul(a, 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);
+      let v = n.ZERO, b = n.ZERO, R = n.ZERO, L = n.mul(p, p), k = 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(k, b), b = n.add(k, 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, k), R = n.add(R, R), R = n.add(R, R), new _(v, b, R);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -1210,11 +1210,11 @@ function An(e, t = {}) {
       Z(l);
       const { X: a, Y: w, Z: p } = this, { X: B, Y: E, Z: v } = l;
       let b = n.ZERO, R = n.ZERO, L = n.ZERO;
-      const D = o.a, H = n.mul(o.b, yt);
-      let A = n.mul(a, B), $ = n.mul(w, E), V = n.mul(p, v), K = n.add(a, w), q = n.add(B, E);
+      const k = o.a, H = n.mul(o.b, yt);
+      let A = n.mul(a, B), $ = n.mul(w, E), T = n.mul(p, v), K = n.add(a, w), q = n.add(B, E);
       K = n.mul(K, q), q = n.add(A, $), K = n.sub(K, q), q = n.add(a, 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(k, 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(k, T), q = n.mul(H, q), $ = n.add($, T), T = n.sub(A, T), T = n.mul(k, 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());
@@ -1238,8 +1238,8 @@ function An(e, t = {}) {
       let w, p;
       const B = (E) => ct.cached(this, E, (v) => te(_, v));
       if (a) {
-        const { k1neg: E, k1: v, k2neg: b, k2: R } = k(l), { p: L, f: D } = B(v), { p: H, f: A } = B(R);
-        p = D.add(A), w = ht(a.beta, L, H, E, b);
+        const { k1neg: E, k1: v, k2neg: b, k2: R } = D(l), { p: L, f: k } = B(v), { p: H, f: A } = B(R);
+        p = k.add(A), w = ht(a.beta, L, H, E, b);
       } else {
         const { p: E, f: v } = B(l);
         w = E, p = v;
@@ -1262,7 +1262,7 @@ function An(e, t = {}) {
       if (ct.hasCache(this))
         return this.multiply(l);
       if (a) {
-        const { k1neg: p, k1: B, k2neg: E, k2: v } = k(l), { p1: b, p2: R } = xn(_, w, B, v);
+        const { k1neg: p, k1: B, k2neg: E, k2: v } = D(l), { p1: b, p2: R } = xn(_, w, B, v);
         return ht(a.beta, b, R, p, E);
       } else
         return ct.unsafe(w, l);
@@ -1348,7 +1348,7 @@ function In(e, t = {}) {
   }
   function u(g) {
     const { secretKey: y, publicKey: U, publicKeyUncompressed: I } = s;
-    if (!Vt(g) || "_lengths" in r && r._lengths || y === U)
+    if (!Tt(g) || "_lengths" in r && r._lengths || y === U)
       return;
     const O = N(g, void 0, "key").length;
     return O === U || O === I;
@@ -1439,7 +1439,7 @@ function Ln(e, t, r = {}) {
       const { r: w, s: p } = this, B = this.assertRecovery(), E = B === 2 || B === 3 ? w + c : w;
       if (!o.isValid(E))
         throw new Error("invalid recovery id: sig.r+curve.n != R.x");
-      const v = o.toBytes(E), b = e.fromBytes(it(Oe((B & 1) === 0), v)), R = i.inv(E), L = G(N(a, void 0, "msgHash")), D = i.create(-L * R), H = i.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(a, void 0, "msgHash")), k = i.create(-L * R), H = i.create(p * R), A = e.BASE.multiplyUnsafe(k).add(b.multiplyUnsafe(H));
       if (A.is0())
         throw new Error("invalid recovery: point at infinify");
       return A.assertValidity(), A;
@@ -1458,13 +1458,13 @@ function Ln(e, t, r = {}) {
       return Lt(this.toBytes(a));
     }
   }
-  const k = r.bits2int || function(a) {
+  const D = r.bits2int || function(a) {
     if (a.length > 8192)
       throw new Error("input is too large");
     const w = Ut(a), p = a.length * 8 - f;
     return p > 0 ? w >> BigInt(p) : w;
   }, G = r.bits2int_modN || function(a) {
-    return i.create(k(a));
+    return i.create(D(a));
   }, _t = Yt(f);
   function ht(l) {
     return rn("num < 2^" + f, l, tt, _t), i.toBytes(l);
@@ -1473,7 +1473,7 @@ function Ln(e, t, r = {}) {
     return N(l, void 0, "message"), a ? N(t(l), void 0, "prehashed message") : l;
   }
   function bt(l, a, w) {
-    const { lowS: p, prehash: B, extraEntropy: E } = Dt(w, y);
+    const { lowS: p, prehash: B, extraEntropy: E } = kt(w, y);
     l = z(l, B);
     const v = G(l), b = i.fromBytes(a);
     if (!i.isValidNot0(b))
@@ -1483,19 +1483,19 @@ function Ln(e, t, r = {}) {
       const A = E === !0 ? n(g.secretKey) : E;
       R.push(N(A, void 0, "extraEntropy"));
     }
-    const L = it(...R), D = v;
+    const L = it(...R), k = v;
     function H(A) {
-      const $ = k(A);
+      const $ = D(A);
       if (!i.isValidNot0($))
         return;
-      const V = i.inv($), K = e.BASE.multiply($).toAffine(), q = i.create(K.x);
+      const T = i.inv($), K = e.BASE.multiply($).toAffine(), q = i.create(K.x);
       if (q === tt)
         return;
-      const T = i.create(V * i.create(D + q * b));
-      if (T === tt)
+      const V = i.create(T * i.create(k + q * b));
+      if (V === tt)
         return;
-      let zt = (K.x === q ? 0 : 2) | Number(K.y & lt), Ft = T;
-      return p && I(T) && (Ft = i.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 };
   }
@@ -1504,8 +1504,8 @@ function Ln(e, t, r = {}) {
     return on(t.outputLen, i.BYTES, s)(p, B).toBytes(w.format);
   }
   function _(l, a, w, p = {}) {
-    const { lowS: B, prehash: E, format: v } = Dt(p, y);
-    if (w = N(w, void 0, "publicKey"), a = z(a, E), !Vt(l)) {
+    const { lowS: B, prehash: E, format: v } = kt(p, y);
+    if (w = N(w, void 0, "publicKey"), a = z(a, E), !Tt(l)) {
       const b = l instanceof Z ? ", use sig.toBytes()" : "";
       throw new Error("verify expects Uint8Array signature" + b);
     }
@@ -1514,14 +1514,14 @@ 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(a), A = i.inv(D), $ = i.create(H * A), V = i.create(L * A), K = e.BASE.multiplyUnsafe($).add(R.multiplyUnsafe(V));
+      const { r: L, s: k } = b, H = G(a), A = i.inv(k), $ = 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, a, w = {}) {
-    const { prehash: p } = Dt(w, y);
+    const { prehash: p } = kt(w, y);
     return a = z(a, p), Z.fromBytes(l, "recovered").recoverPublicKey(a).toBytes();
   }
   return Object.freeze({
@@ -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), o = BigInt(22), i = BigInt(23), c = BigInt(44), f = BigInt(88), u = e * e * e % t, h = u * u * e % t, d = X(h, r, t) * h % t, x = X(d, r, t) * h % t, g = X(x, oe, t) * u % 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) * u % 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), u = e * e * e % t, h = u * u * e % t, d = X(h, r, t) * h % t, x = X(d, r, t) * h % t, g = X(x, oe, t) * u % 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, D = X(Z, n, t) * u % t, G = X(D, oe, t);
   if (!Ct.eql(Ct.sqr(G), e))
     throw new Error("Cannot find square root");
   return G;
@@ -1590,7 +1590,7 @@ function gt(...e) {
   for (let t = 0; t < e.length; t++)
     e[t].fill(0);
 }
-function kt(e) {
+function Dt(e) {
   return new DataView(e.buffer, e.byteOffset, e.byteLength);
 }
 function Q(e, t) {
@@ -1607,13 +1607,13 @@ function Nn(e) {
 function qe(e) {
   return typeof e == "string" && (e = Nn(e)), Xt(e), e;
 }
-class Dn {
+class kn {
 }
 function Ne(e) {
   const t = (n) => e().update(qe(n)).digest(), r = e();
   return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
 }
-function kn(e, t, r, n) {
+function Dn(e, t, r, n) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, r, n);
   const s = BigInt(32), o = BigInt(4294967295), i = Number(r >> s & o), c = Number(r & o), f = n ? 4 : 0, u = n ? 0 : 4;
@@ -1625,9 +1625,9 @@ function $n(e, t, r) {
 function Zn(e, t, r) {
   return e & t ^ e & r ^ t & r;
 }
-class De extends Dn {
+class ke extends kn {
   constructor(t, r, n, s) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = s, this.buffer = new Uint8Array(t), this.view = kt(this.buffer);
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = s, this.buffer = new Uint8Array(t), this.view = Dt(this.buffer);
   }
   update(t) {
     ie(this), t = qe(t), Xt(t);
@@ -1635,7 +1635,7 @@ class De extends Dn {
     for (let i = 0; i < o; ) {
       const c = Math.min(s - this.pos, o - i);
       if (c === s) {
-        const f = kt(t);
+        const f = Dt(t);
         for (; s <= o - i; i += s)
           this.process(f, i);
         continue;
@@ -1651,8 +1651,8 @@ class De extends Dn {
     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), o), this.process(n, 0);
-    const c = kt(t), f = this.outputLen;
+    Dn(n, s - 8, BigInt(this.length * 8), o), this.process(n, 0);
+    const c = Dt(t), f = this.outputLen;
     if (f % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const u = f / 4, h = this.get();
@@ -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]];
+]), De = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Tn = De.map((e) => (9 * e + 5) % 16), $e = /* @__PURE__ */ (() => {
+  const r = [[De], [Tn]];
   for (let n = 0; n < 4; n++)
     for (let s of r)
       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,
@@ -1731,7 +1731,7 @@ function ce(e, t, r, n) {
   return e === 0 ? t ^ r ^ n : e === 1 ? t & r | ~t & n : e === 2 ? (t | ~r) ^ n : e === 3 ? t & n | r & ~n : t ^ (r | ~n);
 }
 const mt = /* @__PURE__ */ new Uint32Array(16);
-class Kn extends De {
+class Kn extends ke {
   constructor() {
     super(64, 20, 8, !0), this.h0 = 1732584193, this.h1 = -271733879, this.h2 = -1732584194, this.h3 = 271733878, this.h4 = -1009589776;
   }
@@ -1747,13 +1747,13 @@ class Kn extends De {
       mt[g] = t.getUint32(r, !0);
     let n = this.h0 | 0, s = n, o = this.h1 | 0, i = o, c = this.h2 | 0, f = c, u = this.h3 | 0, h = u, d = this.h4 | 0, x = d;
     for (let g = 0; g < 5; g++) {
-      const y = 4 - g, U = Yn[g], I = jn[g], O = Ze[g], j = Ce[g], W = Tn[g], Z = Mn[g];
-      for (let k = 0; k < 16; k++) {
-        const G = xt(n + ce(g, o, c, u) + mt[O[k]] + U, W[k]) + d | 0;
+      const y = 4 - g, U = Yn[g], I = jn[g], O = Ze[g], j = Ce[g], W = Vn[g], Z = Mn[g];
+      for (let D = 0; D < 16; D++) {
+        const G = xt(n + ce(g, o, c, u) + mt[O[D]] + U, W[D]) + d | 0;
         n = d, d = u, u = xt(c, 10) | 0, c = o, o = G;
       }
-      for (let k = 0; k < 16; k++) {
-        const G = xt(s + ce(y, i, f, h) + mt[j[k]] + I, Z[k]) + x | 0;
+      for (let D = 0; D < 16; D++) {
+        const G = xt(s + ce(y, i, f, h) + mt[j[D]] + I, Z[D]) + x | 0;
         s = x, x = h, h = xt(f, 10) | 0, f = i, i = G;
       }
     }
@@ -1832,7 +1832,7 @@ const Gn = /* @__PURE__ */ Ne(() => new Kn()), Xn = Gn, zn = /* @__PURE__ */ Uin
   3204031479,
   3329325298
 ]), st = /* @__PURE__ */ new Uint32Array(64);
-class Fn extends De {
+class Fn extends ke {
   constructor(t = 32) {
     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;
   }
@@ -1917,44 +1917,44 @@ function tr(e, t, r, n) {
   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), 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(
+  const r = new TextEncoder().encode(t), n = new TextEncoder().encode(e), s = [];
+  let o = n.length;
+  if (o < 253)
+    s.push(o);
+  else if (o <= 65535)
+    s.push(253, o & 255, o >> 8 & 255);
+  else if (o <= 4294967295)
+    s.push(
       254,
-      i & 255,
-      i >> 8 & 255,
-      i >> 16 & 255,
-      i >> 24 & 255
+      o & 255,
+      o >> 8 & 255,
+      o >> 16 & 255,
+      o >> 24 & 255
     );
   else
     throw new Error("Message too long");
-  const c = new Uint8Array(o), f = n.length + r.length + c.length + s.length, u = new Uint8Array(f);
-  let h = 0;
-  return u.set(n, h), h += n.length, u.set(r, h), h += r.length, u.set(c, h), h += c.length, u.set(s, h), wt(wt(u));
+  const i = new Uint8Array(s), c = r.length + i.length + n.length, f = new Uint8Array(c);
+  let u = 0;
+  return f.set(r, u), u += r.length, f.set(i, u), u += i.length, f.set(n, u), wt(wt(f));
 }
 function nr(e, t) {
   if (t.length !== 65)
     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, o = n % 4;
-  if (o < 0 || o > 3)
-    throw new Error("Invalid recovery ID");
-  const i = t.slice(1, 33), c = t.slice(33, 65), f = new On.Signature(
-    BigInt("0x" + Array.from(i).map((u) => u.toString(16).padStart(2, "0")).join("")),
-    BigInt("0x" + Array.from(c).map((u) => u.toString(16).padStart(2, "0")).join(""))
-  ).addRecoveryBit(o);
-  try {
-    const u = f.recoverPublicKey(e), h = u.toBytes(!0), d = u.toBytes(!1);
-    return s ? [h] : [d, h];
-  } catch (u) {
-    throw new Error("Failed to recover public key: " + (u instanceof Error ? u.message : String(u)));
-  }
+  if (t[0] === void 0) throw new Error("Invalid signature");
+  const n = t.slice(1, 33), s = t.slice(33, 65), o = [];
+  for (let i = 0; i < 4; i++)
+    try {
+      const f = new On.Signature(
+        BigInt("0x" + Array.from(n).map((d) => d.toString(16).padStart(2, "0")).join("")),
+        BigInt("0x" + Array.from(s).map((d) => d.toString(16).padStart(2, "0")).join(""))
+      ).addRecoveryBit(i).recoverPublicKey(e), u = f.toBytes(!0), h = f.toBytes(!1);
+      o.push(u), o.push(h);
+    } catch {
+      continue;
+    }
+  if (o.length === 0)
+    throw new Error("Failed to recover any public keys");
+  return o;
 }
 function fe(e) {
   return Xn(wt(e));
@@ -1978,8 +1978,13 @@ function rr(e, t) {
       if (!r) return !1;
       const { version: n, program: s } = r;
       if (n === 0) {
-        const o = fe(t);
-        return s.every((i, c) => i === o[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 {