@coinbase/cdp-core 0.0.120 → 0.0.121

package/dist/native/index.native228.js

@@ -1,4 +1,106 @@
-var e = { exports: {} };
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index.native229.js";
+import { createHasher as u, clean as C, rotr as i } from "./index.native230.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 {
-  e as __module
+  E as SHA256,
+  y as sha256
 };

package/dist/native/index.native229.js

@@ -1,72 +1,81 @@
-import { __module as a } from "./index.native245.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;
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.native230.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;
       }
-    };
-    a.exports = u;
-  })(), a.exports);
+      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 {
-  c as __require
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/native/index.native23.js

@@ -1,7 +1,7 @@
 import { getAuthenticatedEndUser as n } from "@coinbase/cdp-api-client";
 import { Analytics as o } from "./index.native2.js";
 import "./index.native3.js";
-import { toAuthStateUser as s } from "./index.native103.js";
+import { toAuthStateUser as s } from "./index.native104.js";
 import { getCoreAuthManager as u, getConfig as a } from "./index.native76.js";
 import "viem";
 const h = async (e) => {

package/dist/native/index.native230.js

@@ -1,37 +1,81 @@
-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 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 {
-  c as __require
+  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/native/index.native231.js

@@ -1,17 +1,23 @@
-var f, e;
-function t() {
-  if (e) return f;
-  e = 1, f = function(r) {
-    return r != null && (u(r) || n(r) || !!r._isBuffer);
-  };
-  function u(r) {
-    return !!r.constructor && typeof r.constructor.isBuffer == "function" && r.constructor.isBuffer(r);
+import { encoder as t, decoder as o } from "./index.native152.js";
+import { encodeBase64 as c, decodeBase64 as a } from "./index.native247.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 n(r) {
-    return typeof r.readFloatLE == "function" && typeof r.slice == "function" && u(r.slice(0, 0));
-  }
-  return f;
+}
+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 {
-  t as __require
+  i as decode,
+  p as encode
 };

package/dist/native/index.native232.js

@@ -1,10 +1,12 @@
-import { __module as e } from "./index.native233.js";
-import { __require as o } from "./index.native234.js";
-import { __require as t } from "./index.native235.js";
-var r;
-function s() {
-  return r ? e.exports : (r = 1, process.env.NODE_ENV === "production" ? e.exports = o() : e.exports = t(), e.exports);
-}
+import n from "./index.native248.js";
+import s from "./index.native249.js";
+import a from "./index.native250.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 {
-  s as __require
+  y as default
 };

package/dist/native/index.native233.js

@@ -1,4 +1,22 @@
-var e = { exports: {} };
+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;
+};
 export {
-  e as __module
+  a as default
 };