@coinbase/cdp-core 0.0.101 → 0.0.102

package/dist/esm/index.native215.js

@@ -1,120 +1,81 @@
-import { isJWK as p } from "./index.native242.js";
-import { decode as m } from "./index.native210.js";
-import y from "./index.native243.js";
-import { isCryptoKey as S, isKeyObject as K } from "./index.native241.js";
-let c;
-const f = async (e, r, s, i = !1) => {
-  c ||= /* @__PURE__ */ new WeakMap();
-  let n = c.get(e);
-  if (n?.[s])
-    return n[s];
-  const t = await y({ ...r, alg: s });
-  return i && Object.freeze(e), n ? n[s] = t : c.set(e, { [s]: t }), t;
-}, E = (e, r) => {
-  c ||= /* @__PURE__ */ new WeakMap();
-  let s = c.get(e);
-  if (s?.[r])
-    return s[r];
-  const i = e.type === "public", n = !!i;
-  let t;
-  if (e.asymmetricKeyType === "x25519") {
-    switch (r) {
-      case "ECDH-ES":
-      case "ECDH-ES+A128KW":
-      case "ECDH-ES+A192KW":
-      case "ECDH-ES+A256KW":
-        break;
-      default:
-        throw new TypeError("given KeyObject instance cannot be used for this algorithm");
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.native216.js";
+function y(o, t, s, n) {
+  if (typeof o.setBigUint64 == "function")
+    return o.setBigUint64(t, s, n);
+  const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
+  o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
+}
+function U(o, t, s) {
+  return o & t ^ ~o & s;
+}
+function _(o, t, s) {
+  return o & t ^ o & s ^ t & s;
+}
+class m extends g {
+  constructor(t, s, n, i) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
+  }
+  update(t) {
+    b(this), t = a(t), d(t);
+    const { view: s, buffer: n, blockLen: i } = this, h = t.length;
+    for (let e = 0; e < h; ) {
+      const r = Math.min(i - this.pos, h - e);
+      if (r === i) {
+        const c = l(t);
+        for (; i <= h - e; e += i)
+          this.process(c, e);
+        continue;
+      }
+      n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
     }
-    t = e.toCryptoKey(e.asymmetricKeyType, n, i ? [] : ["deriveBits"]);
+    return this.length += t.length, this.roundClean(), this;
   }
-  if (e.asymmetricKeyType === "ed25519") {
-    if (r !== "EdDSA" && r !== "Ed25519")
-      throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-    t = e.toCryptoKey(e.asymmetricKeyType, n, [
-      i ? "verify" : "sign"
-    ]);
+  digestInto(t) {
+    b(this), x(t, this), this.finished = !0;
+    const { buffer: s, view: n, blockLen: i, isLE: h } = this;
+    let { pos: e } = this;
+    s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
+    for (let f = e; f < i; f++)
+      s[f] = 0;
+    y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
+    const r = l(t), c = this.outputLen;
+    if (c % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = c / 4, p = this.get();
+    if (u > p.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let f = 0; f < u; f++)
+      r.setUint32(4 * f, p[f], h);
   }
-  if (e.asymmetricKeyType === "rsa") {
-    let a;
-    switch (r) {
-      case "RSA-OAEP":
-        a = "SHA-1";
-        break;
-      case "RS256":
-      case "PS256":
-      case "RSA-OAEP-256":
-        a = "SHA-256";
-        break;
-      case "RS384":
-      case "PS384":
-      case "RSA-OAEP-384":
-        a = "SHA-384";
-        break;
-      case "RS512":
-      case "PS512":
-      case "RSA-OAEP-512":
-        a = "SHA-512";
-        break;
-      default:
-        throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-    }
-    if (r.startsWith("RSA-OAEP"))
-      return e.toCryptoKey({
-        name: "RSA-OAEP",
-        hash: a
-      }, n, i ? ["encrypt"] : ["decrypt"]);
-    t = e.toCryptoKey({
-      name: r.startsWith("PS") ? "RSA-PSS" : "RSASSA-PKCS1-v1_5",
-      hash: a
-    }, n, [i ? "verify" : "sign"]);
+  digest() {
+    const { buffer: t, outputLen: s } = this;
+    this.digestInto(t);
+    const n = t.slice(0, s);
+    return this.destroy(), n;
   }
-  if (e.asymmetricKeyType === "ec") {
-    const o = (/* @__PURE__ */ new Map([
-      ["prime256v1", "P-256"],
-      ["secp384r1", "P-384"],
-      ["secp521r1", "P-521"]
-    ])).get(e.asymmetricKeyDetails?.namedCurve);
-    if (!o)
-      throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-    r === "ES256" && o === "P-256" && (t = e.toCryptoKey({
-      name: "ECDSA",
-      namedCurve: o
-    }, n, [i ? "verify" : "sign"])), r === "ES384" && o === "P-384" && (t = e.toCryptoKey({
-      name: "ECDSA",
-      namedCurve: o
-    }, n, [i ? "verify" : "sign"])), r === "ES512" && o === "P-521" && (t = e.toCryptoKey({
-      name: "ECDSA",
-      namedCurve: o
-    }, n, [i ? "verify" : "sign"])), r.startsWith("ECDH-ES") && (t = e.toCryptoKey({
-      name: "ECDH",
-      namedCurve: o
-    }, n, i ? [] : ["deriveBits"]));
+  _cloneInto(t) {
+    t || (t = new this.constructor()), t.set(...this.get());
+    const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
+    return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
   }
-  if (!t)
-    throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-  return s ? s[r] = t : c.set(e, { [r]: t }), t;
-}, d = async (e, r) => {
-  if (e instanceof Uint8Array || S(e))
-    return e;
-  if (K(e)) {
-    if (e.type === "secret")
-      return e.export();
-    if ("toCryptoKey" in e && typeof e.toCryptoKey == "function")
-      try {
-        return E(e, r);
-      } catch (i) {
-        if (i instanceof TypeError)
-          throw i;
-      }
-    let s = e.export({ format: "jwk" });
-    return f(e, s, r);
+  clone() {
+    return this._cloneInto();
   }
-  if (p(e))
-    return e.k ? m(e.k) : f(e, e, r, !0);
-  throw new Error("unreachable");
-};
+}
+const B = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
 export {
-  d as default
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/esm/index.native216.js

@@ -1,106 +1,81 @@
-import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index.native217.js";
-import { createHasher as u, clean as C, rotr as i } from "./index.native218.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);
-  }
+function o(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function w(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error("positive integer expected, got " + e);
+}
+function r(e, ...t) {
+  if (!o(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
+}
+function h(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function l(e, t) {
+  r(e);
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error("digestInto() expects output buffer of length at least " + n);
+}
+function a(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function g(...e) {
+  for (let t = 0; t < e.length; t++)
+    e[t].fill(0);
+}
+function p(e) {
+  return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+function b(e, t) {
+  return e << 32 - t | e >>> t;
+}
+const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function u(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function c(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = u(e[t]);
+  return e;
+}
+const x = i ? (e) => e : c;
+function s(e) {
+  if (typeof e != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function y(e) {
+  return typeof e == "string" && (e = s(e)), r(e), e;
+}
+class d {
+}
+function E(e) {
+  const t = (f) => e().update(y(f)).digest(), n = e();
+  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-const y = /* @__PURE__ */ u(() => new E());
 export {
-  E as SHA256,
-  y as sha256
+  d as Hash,
+  r as abytes,
+  h as aexists,
+  w as anumber,
+  l as aoutput,
+  u as byteSwap,
+  c as byteSwap32,
+  g as clean,
+  E as createHasher,
+  p as createView,
+  o as isBytes,
+  i as isLE,
+  b as rotr,
+  x as swap32IfBE,
+  y as toBytes,
+  a as u32,
+  s as utf8ToBytes
 };

package/dist/esm/index.native217.js

@@ -1,81 +1,111 @@
-import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.native218.js";
-function y(o, t, s, n) {
-  if (typeof o.setBigUint64 == "function")
-    return o.setBigUint64(t, s, n);
-  const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
-  o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
-}
-function U(o, t, s) {
-  return o & t ^ ~o & s;
-}
-function _(o, t, s) {
-  return o & t ^ o & s ^ t & s;
-}
-class m extends g {
-  constructor(t, s, n, i) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
-  }
-  update(t) {
-    b(this), t = a(t), d(t);
-    const { view: s, buffer: n, blockLen: i } = this, h = t.length;
-    for (let e = 0; e < h; ) {
-      const r = Math.min(i - this.pos, h - e);
-      if (r === i) {
-        const c = l(t);
-        for (; i <= h - e; e += i)
-          this.process(c, e);
-        continue;
-      }
-      n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
+import { __module as x } from "./index.native218.js";
+var w;
+function O() {
+  return w ? x.exports : (w = 1, function(d) {
+    var g = Object.prototype.hasOwnProperty, c = "~";
+    function h() {
+    }
+    Object.create && (h.prototype = /* @__PURE__ */ Object.create(null), new h().__proto__ || (c = !1));
+    function b(s, t, n) {
+      this.fn = s, this.context = t, this.once = n || !1;
     }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    b(this), x(t, this), this.finished = !0;
-    const { buffer: s, view: n, blockLen: i, isLE: h } = this;
-    let { pos: e } = this;
-    s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
-    for (let f = e; f < i; f++)
-      s[f] = 0;
-    y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
-    const r = l(t), c = this.outputLen;
-    if (c % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = c / 4, p = this.get();
-    if (u > p.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let f = 0; f < u; f++)
-      r.setUint32(4 * f, p[f], h);
-  }
-  digest() {
-    const { buffer: t, outputLen: s } = this;
-    this.digestInto(t);
-    const n = t.slice(0, s);
-    return this.destroy(), n;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
-    return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
+    function m(s, t, n, r, l) {
+      if (typeof n != "function")
+        throw new TypeError("The listener must be a function");
+      var u = new b(n, r || s, l), o = c ? c + t : t;
+      return s._events[o] ? s._events[o].fn ? s._events[o] = [s._events[o], u] : s._events[o].push(u) : (s._events[o] = u, s._eventsCount++), s;
+    }
+    function y(s, t) {
+      --s._eventsCount === 0 ? s._events = new h() : delete s._events[t];
+    }
+    function f() {
+      this._events = new h(), this._eventsCount = 0;
+    }
+    f.prototype.eventNames = function() {
+      var t = [], n, r;
+      if (this._eventsCount === 0) return t;
+      for (r in n = this._events)
+        g.call(n, r) && t.push(c ? r.slice(1) : r);
+      return Object.getOwnPropertySymbols ? t.concat(Object.getOwnPropertySymbols(n)) : t;
+    }, f.prototype.listeners = function(t) {
+      var n = c ? c + t : t, r = this._events[n];
+      if (!r) return [];
+      if (r.fn) return [r.fn];
+      for (var l = 0, u = r.length, o = new Array(u); l < u; l++)
+        o[l] = r[l].fn;
+      return o;
+    }, f.prototype.listenerCount = function(t) {
+      var n = c ? c + t : t, r = this._events[n];
+      return r ? r.fn ? 1 : r.length : 0;
+    }, f.prototype.emit = function(t, n, r, l, u, o) {
+      var a = c ? c + t : t;
+      if (!this._events[a]) return !1;
+      var e = this._events[a], p = arguments.length, v, i;
+      if (e.fn) {
+        switch (e.once && this.removeListener(t, e.fn, void 0, !0), p) {
+          case 1:
+            return e.fn.call(e.context), !0;
+          case 2:
+            return e.fn.call(e.context, n), !0;
+          case 3:
+            return e.fn.call(e.context, n, r), !0;
+          case 4:
+            return e.fn.call(e.context, n, r, l), !0;
+          case 5:
+            return e.fn.call(e.context, n, r, l, u), !0;
+          case 6:
+            return e.fn.call(e.context, n, r, l, u, o), !0;
+        }
+        for (i = 1, v = new Array(p - 1); i < p; i++)
+          v[i - 1] = arguments[i];
+        e.fn.apply(e.context, v);
+      } else {
+        var E = e.length, _;
+        for (i = 0; i < E; i++)
+          switch (e[i].once && this.removeListener(t, e[i].fn, void 0, !0), p) {
+            case 1:
+              e[i].fn.call(e[i].context);
+              break;
+            case 2:
+              e[i].fn.call(e[i].context, n);
+              break;
+            case 3:
+              e[i].fn.call(e[i].context, n, r);
+              break;
+            case 4:
+              e[i].fn.call(e[i].context, n, r, l);
+              break;
+            default:
+              if (!v) for (_ = 1, v = new Array(p - 1); _ < p; _++)
+                v[_ - 1] = arguments[_];
+              e[i].fn.apply(e[i].context, v);
+          }
+      }
+      return !0;
+    }, f.prototype.on = function(t, n, r) {
+      return m(this, t, n, r, !1);
+    }, f.prototype.once = function(t, n, r) {
+      return m(this, t, n, r, !0);
+    }, f.prototype.removeListener = function(t, n, r, l) {
+      var u = c ? c + t : t;
+      if (!this._events[u]) return this;
+      if (!n)
+        return y(this, u), this;
+      var o = this._events[u];
+      if (o.fn)
+        o.fn === n && (!l || o.once) && (!r || o.context === r) && y(this, u);
+      else {
+        for (var a = 0, e = [], p = o.length; a < p; a++)
+          (o[a].fn !== n || l && !o[a].once || r && o[a].context !== r) && e.push(o[a]);
+        e.length ? this._events[u] = e.length === 1 ? e[0] : e : y(this, u);
+      }
+      return this;
+    }, f.prototype.removeAllListeners = function(t) {
+      var n;
+      return t ? (n = c ? c + t : t, this._events[n] && y(this, n)) : (this._events = new h(), this._eventsCount = 0), this;
+    }, f.prototype.off = f.prototype.removeListener, f.prototype.addListener = f.prototype.on, f.prefixed = c, f.EventEmitter = f, d.exports = f;
+  }(x), x.exports);
 }
-const B = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
 export {
-  U as Chi,
-  m as HashMD,
-  _ as Maj,
-  B as SHA256_IV,
-  y as setBigUint64
+  O as __require
 };

package/dist/esm/index.native218.js

@@ -1,81 +1,4 @@
-function o(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function w(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
-}
-function r(e, ...t) {
-  if (!o(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function h(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function l(e, t) {
-  r(e);
-  const n = t.outputLen;
-  if (e.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function a(e) {
-  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
-}
-function g(...e) {
-  for (let t = 0; t < e.length; t++)
-    e[t].fill(0);
-}
-function p(e) {
-  return new DataView(e.buffer, e.byteOffset, e.byteLength);
-}
-function b(e, t) {
-  return e << 32 - t | e >>> t;
-}
-const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function u(e) {
-  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
-}
-function c(e) {
-  for (let t = 0; t < e.length; t++)
-    e[t] = u(e[t]);
-  return e;
-}
-const x = i ? (e) => e : c;
-function s(e) {
-  if (typeof e != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(e));
-}
-function y(e) {
-  return typeof e == "string" && (e = s(e)), r(e), e;
-}
-class d {
-}
-function E(e) {
-  const t = (f) => e().update(y(f)).digest(), n = e();
-  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
-}
+var e = { exports: {} };
 export {
-  d as Hash,
-  r as abytes,
-  h as aexists,
-  w as anumber,
-  l as aoutput,
-  u as byteSwap,
-  c as byteSwap32,
-  g as clean,
-  E as createHasher,
-  p as createView,
-  o as isBytes,
-  i as isLE,
-  b as rotr,
-  x as swap32IfBE,
-  y as toBytes,
-  a as u32,
-  s as utf8ToBytes
+  e as __module
 };