@coinbase/cdp-hooks 0.0.71 → 0.0.72

package/dist/esm/index261.js

@@ -1,226 +1,148 @@
-import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index282.js";
-import { anumber as z } from "./index266.js";
-const g = BigInt(0), d = BigInt(1), q = /* @__PURE__ */ BigInt(2), V = /* @__PURE__ */ BigInt(3), x = /* @__PURE__ */ BigInt(4), T = /* @__PURE__ */ BigInt(5), L = /* @__PURE__ */ BigInt(8);
-function h(t, n) {
-  const o = t % n;
-  return o >= g ? o : n + o;
-}
-function O(t, n, o) {
-  let r = t;
-  for (; n-- > g; )
-    r *= r, r %= o;
+import { crypto as u } from "./index280.js";
+function w(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function l(t) {
+  if (!Number.isSafeInteger(t) || t < 0)
+    throw new Error("positive integer expected, got " + t);
+}
+function c(t, ...e) {
+  if (!w(t))
+    throw new Error("Uint8Array expected");
+  if (e.length > 0 && !e.includes(t.length))
+    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
+}
+function U(t) {
+  if (typeof t != "function" || typeof t.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  l(t.outputLen), l(t.blockLen);
+}
+function B(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function H(t, e) {
+  c(t);
+  const n = e.outputLen;
+  if (t.length < n)
+    throw new Error("digestInto() expects output buffer of length at least " + n);
+}
+function L(t) {
+  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
+}
+function V(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function _(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function S(t, e) {
+  return t << 32 - e | t >>> e;
+}
+const d = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function h(t) {
+  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
+}
+function x(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = h(t[e]);
+  return t;
+}
+const T = d ? (t) => t : x, p = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", A = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+function k(t) {
+  if (c(t), p)
+    return t.toHex();
+  let e = "";
+  for (let n = 0; n < t.length; n++)
+    e += A[t[n]];
+  return e;
+}
+const f = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function y(t) {
+  if (t >= f._0 && t <= f._9)
+    return t - f._0;
+  if (t >= f.A && t <= f.F)
+    return t - (f.A - 10);
+  if (t >= f.a && t <= f.f)
+    return t - (f.a - 10);
+}
+function I(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  if (p)
+    return Uint8Array.fromHex(t);
+  const e = t.length, n = e / 2;
+  if (e % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + e);
+  const r = new Uint8Array(n);
+  for (let o = 0, i = 0; o < n; o++, i += 2) {
+    const s = y(t.charCodeAt(i)), a = y(t.charCodeAt(i + 1));
+    if (s === void 0 || a === void 0) {
+      const g = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + g + '" at index ' + i);
+    }
+    r[o] = s * 16 + a;
+  }
   return r;
 }
-function B(t, n) {
-  if (t === g)
-    throw new Error("invert: expected non-zero number");
-  if (n <= g)
-    throw new Error("invert: expected positive modulus, got " + n);
-  let o = h(t, n), r = n, s = g, f = d;
-  for (; o !== g; ) {
-    const u = r / o, i = r % o, w = s - f * u;
-    r = o, o = i, s = f, f = w;
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function b(t) {
+  return typeof t == "string" && (t = m(t)), c(t), t;
+}
+function R(...t) {
+  let e = 0;
+  for (let r = 0; r < t.length; r++) {
+    const o = t[r];
+    c(o), e += o.length;
   }
-  if (r !== d)
-    throw new Error("invert: does not exist");
-  return h(s, n);
-}
-function M(t, n) {
-  const o = (t.ORDER + d) / x, r = t.pow(n, o);
-  if (!t.eql(t.sqr(r), n))
-    throw new Error("Cannot find square root");
-  return r;
+  const n = new Uint8Array(e);
+  for (let r = 0, o = 0; r < t.length; r++) {
+    const i = t[r];
+    n.set(i, o), o += i.length;
+  }
+  return n;
 }
-function H(t, n) {
-  const o = (t.ORDER - T) / L, r = t.mul(n, q), s = t.pow(r, o), f = t.mul(n, s), c = t.mul(t.mul(f, q), s), u = t.mul(f, t.sub(c, t.ONE));
-  if (!t.eql(t.sqr(u), n))
-    throw new Error("Cannot find square root");
-  return u;
-}
-function K(t) {
-  if (t < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let n = t - d, o = 0;
-  for (; n % q === g; )
-    n /= q, o++;
-  let r = q;
-  const s = U(t);
-  for (; N(s, r) === 1; )
-    if (r++ > 1e3)
-      throw new Error("Cannot find square root: probably non-prime P");
-  if (o === 1)
-    return M;
-  let f = s.pow(r, n);
-  const c = (n + d) / q;
-  return function(i, w) {
-    if (i.is0(w))
-      return w;
-    if (N(i, w) !== 1)
-      throw new Error("Cannot find square root");
-    let e = o, l = i.mul(i.ONE, f), a = i.pow(w, n), b = i.pow(w, c);
-    for (; !i.eql(a, i.ONE); ) {
-      if (i.is0(a))
-        return i.ZERO;
-      let m = 1, E = i.sqr(a);
-      for (; !i.eql(E, i.ONE); )
-        if (m++, E = i.sqr(E), m === e)
-          throw new Error("Cannot find square root");
-      const C = d << BigInt(e - m - 1), v = i.pow(l, C);
-      e = m, l = i.sqr(v), a = i.mul(a, l), b = i.mul(b, v);
-    }
-    return b;
-  };
-}
-function Q(t) {
-  return t % x === V ? M : t % L === T ? H : K(t);
-}
-const Y = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function P(t) {
-  const n = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "number",
-    BITS: "number"
-  }, o = Y.reduce((r, s) => (r[s] = "function", r), n);
-  return j(t, o), t;
-}
-function k(t, n, o) {
-  if (o < g)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (o === g)
-    return t.ONE;
-  if (o === d)
-    return n;
-  let r = t.ONE, s = n;
-  for (; o > g; )
-    o & d && (r = t.mul(r, s)), s = t.sqr(s), o >>= d;
-  return r;
+class F {
+}
+function O(t) {
+  const e = (r) => t().update(b(r)).digest(), n = t();
+  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
 }
-function G(t, n, o = !1) {
-  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((c, u, i) => t.is0(u) ? c : (r[i] = c, t.mul(c, u)), t.ONE), f = t.inv(s);
-  return n.reduceRight((c, u, i) => t.is0(u) ? c : (r[i] = t.mul(c, r[i]), t.mul(c, u)), f), r;
-}
-function N(t, n) {
-  const o = (t.ORDER - d) / q, r = t.pow(n, o), s = t.eql(r, t.ONE), f = t.eql(r, t.ZERO), c = t.eql(r, t.neg(t.ONE));
-  if (!s && !f && !c)
-    throw new Error("invalid Legendre symbol result");
-  return s ? 1 : f ? 0 : -1;
-}
-function J(t, n) {
-  n !== void 0 && z(n);
-  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
-  return { nBitLength: o, nByteLength: r };
-}
-function U(t, n, o = !1, r = {}) {
-  if (t <= g)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  let s, f;
-  if (typeof n == "object" && n != null) {
-    if (r.sqrt || o)
-      throw new Error("cannot specify opts in two arguments");
-    const e = n;
-    e.BITS && (s = e.BITS), e.sqrt && (f = e.sqrt), typeof e.isLE == "boolean" && (o = e.isLE);
-  } else
-    typeof n == "number" && (s = n), r.sqrt && (f = r.sqrt);
-  const { nBitLength: c, nByteLength: u } = J(t, s);
-  if (u > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let i;
-  const w = Object.freeze({
-    ORDER: t,
-    isLE: o,
-    BITS: c,
-    BYTES: u,
-    MASK: Z(c),
-    ZERO: g,
-    ONE: d,
-    create: (e) => h(e, t),
-    isValid: (e) => {
-      if (typeof e != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof e);
-      return g <= e && e < t;
-    },
-    is0: (e) => e === g,
-    // is valid and invertible
-    isValidNot0: (e) => !w.is0(e) && w.isValid(e),
-    isOdd: (e) => (e & d) === d,
-    neg: (e) => h(-e, t),
-    eql: (e, l) => e === l,
-    sqr: (e) => h(e * e, t),
-    add: (e, l) => h(e + l, t),
-    sub: (e, l) => h(e - l, t),
-    mul: (e, l) => h(e * l, t),
-    pow: (e, l) => k(w, e, l),
-    div: (e, l) => h(e * B(l, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (e) => e * e,
-    addN: (e, l) => e + l,
-    subN: (e, l) => e - l,
-    mulN: (e, l) => e * l,
-    inv: (e) => B(e, t),
-    sqrt: f || ((e) => (i || (i = Q(t)), i(w, e))),
-    toBytes: (e) => o ? y(e, u) : I(e, u),
-    fromBytes: (e) => {
-      if (e.length !== u)
-        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + e.length);
-      return o ? S(e) : _(e);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (e) => G(w, e),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (e, l, a) => a ? l : e
-  });
-  return Object.freeze(w);
-}
-function A(t) {
-  if (typeof t != "bigint")
-    throw new Error("field order must be bigint");
-  const n = t.toString(2).length;
-  return Math.ceil(n / 8);
-}
-function W(t) {
-  const n = A(t);
-  return n + Math.ceil(n / 2);
-}
-function D(t, n, o = !1) {
-  const r = t.length, s = A(n), f = W(n);
-  if (r < 16 || r < f || r > 1024)
-    throw new Error("expected " + f + "-1024 bytes of input, got " + r);
-  const c = o ? S(t) : _(t), u = h(c, n - d) + d;
-  return o ? y(u, s) : I(u, s);
+function v(t = 32) {
+  if (u && typeof u.getRandomValues == "function")
+    return u.getRandomValues(new Uint8Array(t));
+  if (u && typeof u.randomBytes == "function")
+    return Uint8Array.from(u.randomBytes(t));
+  throw new Error("crypto.getRandomValues must be defined");
 }
 export {
-  U as Field,
-  G as FpInvertBatch,
-  N as FpLegendre,
-  k as FpPow,
-  Q as FpSqrt,
-  A as getFieldBytesLength,
-  W as getMinHashLength,
-  B as invert,
-  D as mapHashToField,
-  h as mod,
-  J as nLength,
-  O as pow2,
-  K as tonelliShanks,
-  P as validateField
+  F as Hash,
+  c as abytes,
+  B as aexists,
+  U as ahash,
+  l as anumber,
+  H as aoutput,
+  h as byteSwap,
+  x as byteSwap32,
+  k as bytesToHex,
+  V as clean,
+  R as concatBytes,
+  O as createHasher,
+  _ as createView,
+  I as hexToBytes,
+  w as isBytes,
+  d as isLE,
+  v as randomBytes,
+  S as rotr,
+  T as swap32IfBE,
+  b as toBytes,
+  L as u32,
+  m as utf8ToBytes
 };

package/dist/esm/index262.js

@@ -1,9 +1,41 @@
-import { toBytes as o } from "./index130.js";
-import { keccak256 as r } from "./index132.js";
-const e = (t) => r(o(t));
-function c(t) {
-  return e(t);
+import { __module as h } from "./index263.js";
+import { __require as S } from "./index264.js";
+import { __require as q } from "./index265.js";
+import { __require as w } from "./index266.js";
+var x;
+function G() {
+  return x ? h.exports : (x = 1, function() {
+    var v = S(), p = q().utf8, B = w(), F = q().bin, d = function(o, f) {
+      o.constructor == String ? f && f.encoding === "binary" ? o = F.stringToBytes(o) : o = p.stringToBytes(o) : B(o) ? o = Array.prototype.slice.call(o, 0) : !Array.isArray(o) && o.constructor !== Uint8Array && (o = o.toString());
+      for (var u = v.bytesToWords(o), a = o.length * 8, n = 1732584193, r = -271733879, i = -1732584194, t = 271733878, e = 0; e < u.length; e++)
+        u[e] = (u[e] << 8 | u[e] >>> 24) & 16711935 | (u[e] << 24 | u[e] >>> 8) & 4278255360;
+      u[a >>> 5] |= 128 << a % 32, u[(a + 64 >>> 9 << 4) + 14] = a;
+      for (var _ = d._ff, c = d._gg, l = d._hh, y = d._ii, e = 0; e < u.length; e += 16) {
+        var T = n, b = r, A = i, I = t;
+        n = _(n, r, i, t, u[e + 0], 7, -680876936), t = _(t, n, r, i, u[e + 1], 12, -389564586), i = _(i, t, n, r, u[e + 2], 17, 606105819), r = _(r, i, t, n, u[e + 3], 22, -1044525330), n = _(n, r, i, t, u[e + 4], 7, -176418897), t = _(t, n, r, i, u[e + 5], 12, 1200080426), i = _(i, t, n, r, u[e + 6], 17, -1473231341), r = _(r, i, t, n, u[e + 7], 22, -45705983), n = _(n, r, i, t, u[e + 8], 7, 1770035416), t = _(t, n, r, i, u[e + 9], 12, -1958414417), i = _(i, t, n, r, u[e + 10], 17, -42063), r = _(r, i, t, n, u[e + 11], 22, -1990404162), n = _(n, r, i, t, u[e + 12], 7, 1804603682), t = _(t, n, r, i, u[e + 13], 12, -40341101), i = _(i, t, n, r, u[e + 14], 17, -1502002290), r = _(r, i, t, n, u[e + 15], 22, 1236535329), n = c(n, r, i, t, u[e + 1], 5, -165796510), t = c(t, n, r, i, u[e + 6], 9, -1069501632), i = c(i, t, n, r, u[e + 11], 14, 643717713), r = c(r, i, t, n, u[e + 0], 20, -373897302), n = c(n, r, i, t, u[e + 5], 5, -701558691), t = c(t, n, r, i, u[e + 10], 9, 38016083), i = c(i, t, n, r, u[e + 15], 14, -660478335), r = c(r, i, t, n, u[e + 4], 20, -405537848), n = c(n, r, i, t, u[e + 9], 5, 568446438), t = c(t, n, r, i, u[e + 14], 9, -1019803690), i = c(i, t, n, r, u[e + 3], 14, -187363961), r = c(r, i, t, n, u[e + 8], 20, 1163531501), n = c(n, r, i, t, u[e + 13], 5, -1444681467), t = c(t, n, r, i, u[e + 2], 9, -51403784), i = c(i, t, n, r, u[e + 7], 14, 1735328473), r = c(r, i, t, n, u[e + 12], 20, -1926607734), n = l(n, r, i, t, u[e + 5], 4, -378558), t = l(t, n, r, i, u[e + 8], 11, -2022574463), i = l(i, t, n, r, u[e + 11], 16, 1839030562), r = l(r, i, t, n, u[e + 14], 23, -35309556), n = l(n, r, i, t, u[e + 1], 4, -1530992060), t = l(t, n, r, i, u[e + 4], 11, 1272893353), i = l(i, t, n, r, u[e + 7], 16, -155497632), r = l(r, i, t, n, u[e + 10], 23, -1094730640), n = l(n, r, i, t, u[e + 13], 4, 681279174), t = l(t, n, r, i, u[e + 0], 11, -358537222), i = l(i, t, n, r, u[e + 3], 16, -722521979), r = l(r, i, t, n, u[e + 6], 23, 76029189), n = l(n, r, i, t, u[e + 9], 4, -640364487), t = l(t, n, r, i, u[e + 12], 11, -421815835), i = l(i, t, n, r, u[e + 15], 16, 530742520), r = l(r, i, t, n, u[e + 2], 23, -995338651), n = y(n, r, i, t, u[e + 0], 6, -198630844), t = y(t, n, r, i, u[e + 7], 10, 1126891415), i = y(i, t, n, r, u[e + 14], 15, -1416354905), r = y(r, i, t, n, u[e + 5], 21, -57434055), n = y(n, r, i, t, u[e + 12], 6, 1700485571), t = y(t, n, r, i, u[e + 3], 10, -1894986606), i = y(i, t, n, r, u[e + 10], 15, -1051523), r = y(r, i, t, n, u[e + 1], 21, -2054922799), n = y(n, r, i, t, u[e + 8], 6, 1873313359), t = y(t, n, r, i, u[e + 15], 10, -30611744), i = y(i, t, n, r, u[e + 6], 15, -1560198380), r = y(r, i, t, n, u[e + 13], 21, 1309151649), n = y(n, r, i, t, u[e + 4], 6, -145523070), t = y(t, n, r, i, u[e + 11], 10, -1120210379), i = y(i, t, n, r, u[e + 2], 15, 718787259), r = y(r, i, t, n, u[e + 9], 21, -343485551), n = n + T >>> 0, r = r + b >>> 0, i = i + A >>> 0, t = t + I >>> 0;
+      }
+      return v.endian([n, r, i, t]);
+    };
+    d._ff = function(o, f, u, a, n, r, i) {
+      var t = o + (f & u | ~f & a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._gg = function(o, f, u, a, n, r, i) {
+      var t = o + (f & a | u & ~a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._hh = function(o, f, u, a, n, r, i) {
+      var t = o + (f ^ u ^ a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._ii = function(o, f, u, a, n, r, i) {
+      var t = o + (u ^ (f | ~a)) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._blocksize = 16, d._digestsize = 16, h.exports = function(o, f) {
+      if (o == null)
+        throw new Error("Illegal argument " + o);
+      var u = v.wordsToBytes(d(o, f));
+      return f && f.asBytes ? u : f && f.asString ? F.bytesToString(u) : v.bytesToHex(u);
+    };
+  }(), h.exports);
 }
 export {
-  c as hashSignature
+  G as __require
 };

package/dist/esm/index263.js

@@ -1,9 +1,4 @@
-import { normalizeSignature as o } from "./index264.js";
-import { formatAbiItem as n } from "./index219.js";
-const m = (r) => {
-  const t = typeof r == "string" ? r : n(r);
-  return o(t);
-};
+var e = { exports: {} };
 export {
-  m as toSignature
+  e as __module
 };

package/dist/esm/index264.js

@@ -1,29 +1,72 @@
-import { BaseError as u } from "./index104.js";
-function a(r) {
-  let l = !0, i = "", f = 0, t = "", o = !1;
-  for (let n = 0; n < r.length; n++) {
-    const e = r[n];
-    if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
-      if (f === 0) {
-        if (e === " " && ["event", "function", ""].includes(t))
-          t = "";
-        else if (t += e, e === ")") {
-          o = !0;
-          break;
-        }
-        continue;
+import { __module as a } from "./index270.js";
+var h;
+function c() {
+  return h ? a.exports : (h = 1, function() {
+    var f = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", u = {
+      // Bit-wise rotation left
+      rotl: function(r, t) {
+        return r << t | r >>> 32 - t;
+      },
+      // Bit-wise rotation right
+      rotr: function(r, t) {
+        return r << 32 - t | r >>> t;
+      },
+      // Swap big-endian to little-endian and vice versa
+      endian: function(r) {
+        if (r.constructor == Number)
+          return u.rotl(r, 8) & 16711935 | u.rotl(r, 24) & 4278255360;
+        for (var t = 0; t < r.length; t++)
+          r[t] = u.endian(r[t]);
+        return r;
+      },
+      // Generate an array of any length of random bytes
+      randomBytes: function(r) {
+        for (var t = []; r > 0; r--)
+          t.push(Math.floor(Math.random() * 256));
+        return t;
+      },
+      // Convert a byte array to big-endian 32-bit words
+      bytesToWords: function(r) {
+        for (var t = [], n = 0, o = 0; n < r.length; n++, o += 8)
+          t[o >>> 5] |= r[n] << 24 - o % 32;
+        return t;
+      },
+      // Convert big-endian 32-bit words to a byte array
+      wordsToBytes: function(r) {
+        for (var t = [], n = 0; n < r.length * 32; n += 8)
+          t.push(r[n >>> 5] >>> 24 - n % 32 & 255);
+        return t;
+      },
+      // Convert a byte array to a hex string
+      bytesToHex: function(r) {
+        for (var t = [], n = 0; n < r.length; n++)
+          t.push((r[n] >>> 4).toString(16)), t.push((r[n] & 15).toString(16));
+        return t.join("");
+      },
+      // Convert a hex string to a byte array
+      hexToBytes: function(r) {
+        for (var t = [], n = 0; n < r.length; n += 2)
+          t.push(parseInt(r.substr(n, 2), 16));
+        return t;
+      },
+      // Convert a byte array to a base-64 string
+      bytesToBase64: function(r) {
+        for (var t = [], n = 0; n < r.length; n += 3)
+          for (var o = r[n] << 16 | r[n + 1] << 8 | r[n + 2], e = 0; e < 4; e++)
+            n * 8 + e * 6 <= r.length * 8 ? t.push(f.charAt(o >>> 6 * (3 - e) & 63)) : t.push("=");
+        return t.join("");
+      },
+      // Convert a base-64 string to a byte array
+      base64ToBytes: function(r) {
+        r = r.replace(/[^A-Z0-9+\/]/ig, "");
+        for (var t = [], n = 0, o = 0; n < r.length; o = ++n % 4)
+          o != 0 && t.push((f.indexOf(r.charAt(n - 1)) & Math.pow(2, -2 * o + 8) - 1) << o * 2 | f.indexOf(r.charAt(n)) >>> 6 - o * 2);
+        return t;
       }
-      if (e === " ") {
-        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
-        continue;
-      }
-      t += e, i += e;
-    }
-  }
-  if (!o)
-    throw new u("Unable to normalize signature.");
-  return t;
+    };
+    a.exports = u;
+  }(), a.exports);
 }
 export {
-  a as normalizeSignature
+  c as __require
 };

package/dist/esm/index265.js

@@ -1,22 +1,37 @@
-const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
-function s(t, r = !1) {
-  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+var o, u;
+function c() {
+  if (u) return o;
+  u = 1;
+  var t = {
+    // UTF-8 encoding
+    utf8: {
+      // Convert a string to a byte array
+      stringToBytes: function(n) {
+        return t.bin.stringToBytes(unescape(encodeURIComponent(n)));
+      },
+      // Convert a byte array to a string
+      bytesToString: function(n) {
+        return decodeURIComponent(escape(t.bin.bytesToString(n)));
+      }
+    },
+    // Binary encoding
+    bin: {
+      // Convert a string to a byte array
+      stringToBytes: function(n) {
+        for (var e = [], r = 0; r < n.length; r++)
+          e.push(n.charCodeAt(r) & 255);
+        return e;
+      },
+      // Convert a byte array to a string
+      bytesToString: function(n) {
+        for (var e = [], r = 0; r < n.length; r++)
+          e.push(String.fromCharCode(n[r]));
+        return e.join("");
+      }
+    }
+  };
+  return o = t, o;
 }
-function h(t, r = !1) {
-  const n = t.length;
-  let l = new Uint32Array(n), c = new Uint32Array(n);
-  for (let e = 0; e < n; e++) {
-    const { h: u, l: f } = s(t[e], r);
-    [l[e], c[e]] = [u, f];
-  }
-  return [l, c];
-}
-const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  s as fromBig,
-  B as rotlBH,
-  a as rotlBL,
-  m as rotlSH,
-  A as rotlSL,
-  h as split
+  c as __require
 };