@coinbase/cdp-hooks 0.0.51 → 0.0.53

package/dist/esm/index242.js

@@ -1,9 +1,14 @@
-import { weierstrass as s } from "./index262.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function c(e, t) {
-  const r = (o) => s({ ...e, hash: o });
-  return { ...r(t), create: r };
+import { LruMap as u } from "./index190.js";
+const t = /* @__PURE__ */ new u(8192);
+function s(r, { enabled: o = !0, id: e }) {
+  if (!o || !e)
+    return r();
+  if (t.get(e))
+    return t.get(e);
+  const n = r().finally(() => t.delete(e));
+  return t.set(e, n), n;
 }
 export {
-  c as createCurve
+  t as promiseCache,
+  s as withDedupe
 };

package/dist/esm/index243.js

@@ -1,227 +1,15 @@
-import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index263.js";
-import { anumber as z } from "./index248.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-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;
-  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;
-  }
-  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;
-}
-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);
+function r() {
+  return {
+    current: 0,
+    take() {
+      return this.current++;
+    },
+    reset() {
+      this.current = 0;
     }
-    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;
-}
-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);
-}
+const t = /* @__PURE__ */ r();
 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
+  t as idCache
 };

package/dist/esm/index244.js

@@ -1,9 +1,106 @@
-import { toBytes as o } from "./index117.js";
-import { keccak256 as r } from "./index119.js";
-const e = (t) => r(o(t));
-function c(t) {
-  return e(t);
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index268.js";
+import { createHasher as u, clean as C, rotr as i } from "./index251.js";
+const B = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class E extends D {
+  constructor(o = 32) {
+    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
+  }
+  get() {
+    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [o, r, t, s, a, f, c, e];
+  }
+  // prettier-ignore
+  set(o, r, t, s, a, f, c, e) {
+    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
+  }
+  process(o, r) {
+    for (let x = 0; x < 16; x++, r += 4)
+      h[x] = o.getUint32(r, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
+      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
+    }
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
+      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
+    }
+    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
+  }
+  roundClean() {
+    C(h);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
+  }
 }
+const y = /* @__PURE__ */ u(() => new E());
 export {
-  c as hashSignature
+  E as SHA256,
+  y as sha256
 };

package/dist/esm/index245.js

@@ -1,9 +1,9 @@
-import { normalizeSignature as o } from "./index246.js";
-import { formatAbiItem as n } from "./index201.js";
-const m = (r) => {
-  const t = typeof r == "string" ? r : n(r);
-  return o(t);
-};
+import { weierstrass as s } from "./index270.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function c(e, t) {
+  const r = (o) => s({ ...e, hash: o });
+  return { ...r(t), create: r };
+}
 export {
-  m as toSignature
+  c as createCurve
 };

package/dist/esm/index246.js

@@ -1,29 +1,227 @@
-import { BaseError as u } from "./index91.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;
-      }
-      if (e === " ") {
-        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
-        continue;
-      }
-      t += e, i += e;
-    }
+import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index271.js";
+import { anumber as z } from "./index251.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+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;
+  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;
   }
-  if (!o)
-    throw new u("Unable to normalize signature.");
-  return t;
+  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;
+}
+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;
+}
+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);
 }
 export {
-  a as normalizeSignature
+  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
 };

package/dist/esm/index247.js

@@ -1,22 +1,9 @@
-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 };
+import { toBytes as o } from "./index119.js";
+import { keccak256 as r } from "./index121.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
 }
-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 hashSignature
 };