@coinbase/cdp-core 0.0.86 → 0.0.88

package/dist/esm/index.web186.js

@@ -1,81 +1,106 @@
-import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.web187.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);
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index.web187.js";
+import { createHasher as u, clean as C, rotr as i } from "./index.web188.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;
   }
-  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);
-    }
-    return this.length += t.length, this.roundClean(), this;
+  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];
   }
-  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);
+  // 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;
   }
-  digest() {
-    const { buffer: t, outputLen: s } = this;
-    this.digestInto(t);
-    const n = t.slice(0, s);
-    return this.destroy(), n;
+  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);
   }
-  _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;
+  roundClean() {
+    C(h);
   }
-  clone() {
-    return this._cloneInto();
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
   }
 }
-const B = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
+const y = /* @__PURE__ */ u(() => new E());
 export {
-  U as Chi,
-  m as HashMD,
-  _ as Maj,
-  B as SHA256_IV,
-  y as setBigUint64
+  E as SHA256,
+  y as sha256
 };

package/dist/esm/index.web187.js

@@ -1,82 +1,81 @@
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function o(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.web188.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 w(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
+function U(o, t, s) {
+  return o & t ^ ~o & s;
 }
-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 _(o, t, s) {
+  return o & t ^ o & s ^ t & s;
 }
-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;
+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);
+    }
+    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();
+  }
 }
+const B = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
 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
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/esm/index.web188.js

@@ -1,23 +1,82 @@
-import { encoder as t, decoder as o } from "./index.web118.js";
-import { encodeBase64 as c, decodeBase64 as a } from "./index.web212.js";
-function i(r) {
-  if (Uint8Array.fromBase64)
-    return Uint8Array.fromBase64(typeof r == "string" ? r : o.decode(r), {
-      alphabet: "base64url"
-    });
-  let e = r;
-  e instanceof Uint8Array && (e = o.decode(e)), e = e.replace(/-/g, "+").replace(/_/g, "/").replace(/\s/g, "");
-  try {
-    return a(e);
-  } catch {
-    throw new TypeError("The input to be decoded is not correctly encoded.");
-  }
-}
-function p(r) {
-  let e = r;
-  return typeof e == "string" && (e = t.encode(e)), Uint8Array.prototype.toBase64 ? e.toBase64({ alphabet: "base64url", omitPadding: !0 }) : c(e).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+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;
 }
 export {
-  i as decode,
-  p as encode
+  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.web189.js

@@ -1,12 +1,23 @@
-import n from "./index.web213.js";
-import s from "./index.web214.js";
-import a from "./index.web215.js";
-const y = async (t, o, e) => {
-  const r = await a(t, o, "sign");
-  s(t, r);
-  const i = await crypto.subtle.sign(n(t, r.algorithm), r, e);
-  return new Uint8Array(i);
-};
+import { encoder as t, decoder as o } from "./index.web119.js";
+import { encodeBase64 as c, decodeBase64 as a } from "./index.web214.js";
+function i(r) {
+  if (Uint8Array.fromBase64)
+    return Uint8Array.fromBase64(typeof r == "string" ? r : o.decode(r), {
+      alphabet: "base64url"
+    });
+  let e = r;
+  e instanceof Uint8Array && (e = o.decode(e)), e = e.replace(/-/g, "+").replace(/_/g, "/").replace(/\s/g, "");
+  try {
+    return a(e);
+  } catch {
+    throw new TypeError("The input to be decoded is not correctly encoded.");
+  }
+}
+function p(r) {
+  let e = r;
+  return typeof e == "string" && (e = t.encode(e)), Uint8Array.prototype.toBase64 ? e.toBase64({ alphabet: "base64url", omitPadding: !0 }) : c(e).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
+}
 export {
-  y as default
+  i as decode,
+  p as encode
 };

package/dist/esm/index.web19.js

@@ -1,6 +1,6 @@
 import { Analytics as i } from "./index.web2.js";
 import "./index.web3.js";
-import { getConfig as t, getCoreAuthManager as n } from "./index.web74.js";
+import { getConfig as t, getCoreAuthManager as n } from "./index.web55.js";
 const a = async () => {
   if (i.sendActionCallEvent({ name: "sign_out" }), t().useMock) {
     await n().signOut();

package/dist/esm/index.web190.js

@@ -1,22 +1,12 @@
-const a = (...o) => {
-  const t = o.filter(Boolean);
-  if (t.length === 0 || t.length === 1)
-    return !0;
-  let e;
-  for (const s of t) {
-    const r = Object.keys(s);
-    if (!e || e.size === 0) {
-      e = new Set(r);
-      continue;
-    }
-    for (const n of r) {
-      if (e.has(n))
-        return !1;
-      e.add(n);
-    }
-  }
-  return !0;
+import n from "./index.web215.js";
+import s from "./index.web216.js";
+import a from "./index.web217.js";
+const y = async (t, o, e) => {
+  const r = await a(t, o, "sign");
+  s(t, r);
+  const i = await crypto.subtle.sign(n(t, r.algorithm), r, e);
+  return new Uint8Array(i);
 };
 export {
-  a as default
+  y as default
 };

package/dist/esm/index.web191.js

@@ -1,96 +1,22 @@
-import { withAlg as n } from "./index.web216.js";
-import c from "./index.web217.js";
-import { isJWK as p, isSecretJWK as a, isPublicJWK as y, isPrivateJWK as f } from "./index.web218.js";
-const s = (r) => r?.[Symbol.toStringTag], o = (r, e, t) => {
-  if (e.use !== void 0) {
-    let i;
-    switch (t) {
-      case "sign":
-      case "verify":
-        i = "sig";
-        break;
-      case "encrypt":
-      case "decrypt":
-        i = "enc";
-        break;
+const a = (...o) => {
+  const t = o.filter(Boolean);
+  if (t.length === 0 || t.length === 1)
+    return !0;
+  let e;
+  for (const s of t) {
+    const r = Object.keys(s);
+    if (!e || e.size === 0) {
+      e = new Set(r);
+      continue;
     }
-    if (e.use !== i)
-      throw new TypeError(`Invalid key for this operation, its "use" must be "${i}" when present`);
-  }
-  if (e.alg !== void 0 && e.alg !== r)
-    throw new TypeError(`Invalid key for this operation, its "alg" must be "${r}" when present`);
-  if (Array.isArray(e.key_ops)) {
-    let i;
-    switch (!0) {
-      case t === "sign":
-      case r === "dir":
-      case r.includes("CBC-HS"):
-        i = t;
-        break;
-      case r.startsWith("PBES2"):
-        i = "deriveBits";
-        break;
-      case /^A\d{3}(?:GCM)?(?:KW)?$/.test(r):
-        !r.includes("GCM") && r.endsWith("KW") ? i = "unwrapKey" : i = t;
-        break;
-      case t === "encrypt":
-        i = "wrapKey";
-        break;
-      case t === "decrypt":
-        i = r.startsWith("RSA") ? "unwrapKey" : "deriveBits";
-        break;
+    for (const n of r) {
+      if (e.has(n))
+        return !1;
+      e.add(n);
     }
-    if (i && e.key_ops?.includes?.(i) === !1)
-      throw new TypeError(`Invalid key for this operation, its "key_ops" must include "${i}" when present`);
   }
   return !0;
-}, h = (r, e, t) => {
-  if (!(e instanceof Uint8Array)) {
-    if (p(e)) {
-      if (a(e) && o(r, e, t))
-        return;
-      throw new TypeError('JSON Web Key for symmetric algorithms must have JWK "kty" (Key Type) equal to "oct" and the JWK "k" (Key Value) present');
-    }
-    if (!c(e))
-      throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key", "Uint8Array"));
-    if (e.type !== "secret")
-      throw new TypeError(`${s(e)} instances for symmetric algorithms must be of type "secret"`);
-  }
-}, m = (r, e, t) => {
-  if (p(e))
-    switch (t) {
-      case "decrypt":
-      case "sign":
-        if (f(e) && o(r, e, t))
-          return;
-        throw new TypeError("JSON Web Key for this operation be a private JWK");
-      case "encrypt":
-      case "verify":
-        if (y(e) && o(r, e, t))
-          return;
-        throw new TypeError("JSON Web Key for this operation be a public JWK");
-    }
-  if (!c(e))
-    throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key"));
-  if (e.type === "secret")
-    throw new TypeError(`${s(e)} instances for asymmetric algorithms must not be of type "secret"`);
-  if (e.type === "public")
-    switch (t) {
-      case "sign":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm signing must be of type "private"`);
-      case "decrypt":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm decryption must be of type "private"`);
-    }
-  if (e.type === "private")
-    switch (t) {
-      case "verify":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm verifying must be of type "public"`);
-      case "encrypt":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm encryption must be of type "public"`);
-    }
-}, d = (r, e, t) => {
-  r.startsWith("HS") || r === "dir" || r.startsWith("PBES2") || /^A(?:128|192|256)(?:GCM)?(?:KW)?$/.test(r) || /^A(?:128|192|256)CBC-HS(?:256|384|512)$/.test(r) ? h(r, e, t) : m(r, e, t);
 };
 export {
-  d as default
+  a as default
 };