@coinbase/cdp-core 0.0.20 → 0.0.21

package/dist/esm/index74.js

@@ -1,81 +1,23 @@
-import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index75.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);
-    }
-    return this.length += t.length, this.roundClean(), this;
+import { BaseError as o } from "./index47.js";
+class i extends o {
+  constructor({ offset: e }) {
+    super(`Offset \`${e}\` cannot be negative.`, {
+      name: "NegativeOffsetError"
+    });
   }
-  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;
+}
+class n extends o {
+  constructor({ length: e, position: r }) {
+    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
   }
-  clone() {
-    return this._cloneInto();
+}
+class c extends o {
+  constructor({ count: e, limit: r }) {
+    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
   }
 }
-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
+  i as NegativeOffsetError,
+  n as PositionOutOfBoundsError,
+  c as RecursiveReadLimitExceededError
 };

package/dist/esm/index75.js

@@ -1,82 +1,22 @@
-/*! 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;
-}
+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 };
+}
+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 {
-  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
+  s as fromBig,
+  B as rotlBH,
+  a as rotlBL,
+  m as rotlSH,
+  A as rotlSL,
+  h as split
 };

package/dist/esm/index76.js

@@ -1,4 +1,82 @@
-const o = "2.33.0";
+/*! 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 {
-  o as version
+  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/index77.js

@@ -1,23 +1,106 @@
-import { BaseError as o } from "./index48.js";
-class i extends o {
-  constructor({ offset: e }) {
-    super(`Offset \`${e}\` cannot be negative.`, {
-      name: "NegativeOffsetError"
-    });
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index86.js";
+import { createHasher as u, clean as C, rotr as i } from "./index76.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;
   }
-}
-class n extends o {
-  constructor({ length: e, position: r }) {
-    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
+  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];
   }
-}
-class c extends o {
-  constructor({ count: e, limit: r }) {
-    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+  // 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 {
-  i as NegativeOffsetError,
-  n as PositionOutOfBoundsError,
-  c as RecursiveReadLimitExceededError
+  E as SHA256,
+  y as sha256
 };

package/dist/esm/index78.js

@@ -1,22 +1,35 @@
-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 };
-}
-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];
+import { maxBytesPerTransaction as y, bytesPerBlob as a, fieldElementsPerBlob as f, bytesPerFieldElement as p } from "./index87.js";
+import { EmptyBlobError as c, BlobSizeTooLargeError as h } from "./index59.js";
+import { createCursor as B } from "./index48.js";
+import { size as u } from "./index37.js";
+import { hexToBytes as x } from "./index29.js";
+import { bytesToHex as d } from "./index27.js";
+function S(e) {
+  const m = e.to ?? (typeof e.data == "string" ? "hex" : "bytes"), i = typeof e.data == "string" ? x(e.data) : e.data, o = u(i);
+  if (!o)
+    throw new c();
+  if (o > y)
+    throw new h({
+      maxSize: y,
+      size: o
+    });
+  const s = [];
+  let n = !0, r = 0;
+  for (; n; ) {
+    const t = B(new Uint8Array(a));
+    let l = 0;
+    for (; l < f; ) {
+      const b = i.slice(r, r + (p - 1));
+      if (t.pushByte(0), t.pushBytes(b), b.length < 31) {
+        t.pushByte(128), n = !1;
+        break;
+      }
+      l++, r += 31;
+    }
+    s.push(t);
   }
-  return [l, c];
+  return m === "bytes" ? s.map((t) => t.bytes) : s.map((t) => d(t.bytes));
 }
-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
+  S as toBlobs
 };

package/dist/esm/index79.js

@@ -1,35 +1,9 @@
-import { maxBytesPerTransaction as y, bytesPerBlob as a, fieldElementsPerBlob as f, bytesPerFieldElement as p } from "./index87.js";
-import { EmptyBlobError as c, BlobSizeTooLargeError as h } from "./index59.js";
-import { createCursor as B } from "./index49.js";
-import { size as u } from "./index38.js";
-import { hexToBytes as x } from "./index31.js";
-import { bytesToHex as d } from "./index29.js";
-function S(e) {
-  const m = e.to ?? (typeof e.data == "string" ? "hex" : "bytes"), i = typeof e.data == "string" ? x(e.data) : e.data, o = u(i);
-  if (!o)
-    throw new c();
-  if (o > y)
-    throw new h({
-      maxSize: y,
-      size: o
-    });
-  const s = [];
-  let n = !0, r = 0;
-  for (; n; ) {
-    const t = B(new Uint8Array(a));
-    let l = 0;
-    for (; l < f; ) {
-      const b = i.slice(r, r + (p - 1));
-      if (t.pushByte(0), t.pushBytes(b), b.length < 31) {
-        t.pushByte(128), n = !1;
-        break;
-      }
-      l++, r += 31;
-    }
-    s.push(t);
-  }
-  return m === "bytes" ? s.map((t) => t.bytes) : s.map((t) => d(t.bytes));
+import { bytesToHex as i } from "./index27.js";
+import { sha256 as m } from "./index51.js";
+function f(t) {
+  const { commitment: e, version: s = 1 } = t, n = t.to ?? (typeof e == "string" ? "hex" : "bytes"), o = m(e);
+  return o.set([s], 0), n === "bytes" ? o : i(o);
 }
 export {
-  S as toBlobs
+  f as commitmentToVersionedHash
 };

package/dist/esm/index8.js

@@ -1,16 +1,18 @@
 import "@coinbase/cdp-api-client";
 import "viem";
-const c = async (t) => await t.isSignedIn();
-async function a(t, n, r) {
-  if (!await c(n))
+const o = async (t) => await t.isSignedIn();
+async function w(t, n, e) {
+  if (!await o(n))
     throw new Error("User not signed in");
-  const e = await n.getUser();
-  if (!e.evmAccounts?.find((o) => o === t.evmAccount))
+  const r = await n.getUser();
+  if ("evmAccount" in t && !r.evmAccounts?.find((c) => c === t.evmAccount))
     throw new Error("EVM account not found");
+  if ("evmSmartAccount" in t && !r.evmSmartAccounts?.find((c) => c === t.evmSmartAccount))
+    throw new Error("EVM Smart Account not found");
   const i = await n.getWalletSecretId();
-  return r({ ...t, user: e, walletSecretId: i });
+  return e({ ...t, user: r, walletSecretId: i });
 }
 export {
-  c as isSignedIn,
-  a as withAuth
+  o as isSignedIn,
+  w as withAuth
 };

package/dist/esm/index80.js

@@ -1,9 +1,57 @@
-import { bytesToHex as i } from "./index29.js";
-import { sha256 as m } from "./index52.js";
-function f(t) {
-  const { commitment: e, version: s = 1 } = t, n = t.to ?? (typeof e == "string" ? "hex" : "bytes"), o = m(e);
-  return o.set([s], 0), n === "bytes" ? o : i(o);
+import { encode as d } from "./index88.js";
+import y from "./index89.js";
+import b from "./index90.js";
+import { JWSInvalid as r } from "./index71.js";
+import { encoder as s, concat as u, decoder as h } from "./index81.js";
+import g from "./index91.js";
+import H from "./index92.js";
+import P from "./index93.js";
+class x {
+  #r;
+  #e;
+  #t;
+  constructor(e) {
+    if (!(e instanceof Uint8Array))
+      throw new TypeError("payload must be an instance of Uint8Array");
+    this.#r = e;
+  }
+  setProtectedHeader(e) {
+    if (this.#e)
+      throw new TypeError("setProtectedHeader can only be called once");
+    return this.#e = e, this;
+  }
+  setUnprotectedHeader(e) {
+    if (this.#t)
+      throw new TypeError("setUnprotectedHeader can only be called once");
+    return this.#t = e, this;
+  }
+  async sign(e, l) {
+    if (!this.#e && !this.#t)
+      throw new r("either setProtectedHeader or setUnprotectedHeader must be called before #sign()");
+    if (!b(this.#e, this.#t))
+      throw new r("JWS Protected and JWS Unprotected Header Parameter names must be disjoint");
+    const c = {
+      ...this.#e,
+      ...this.#t
+    }, p = H(r, /* @__PURE__ */ new Map([["b64", !0]]), l?.crit, this.#e, c);
+    let o = !0;
+    if (p.has("b64") && (o = this.#e.b64, typeof o != "boolean"))
+      throw new r('The "b64" (base64url-encode payload) Header Parameter must be a boolean');
+    const { alg: t } = c;
+    if (typeof t != "string" || !t)
+      throw new r('JWS "alg" (Algorithm) Header Parameter missing or invalid');
+    g(t, e, "sign");
+    let i = this.#r;
+    o && (i = s.encode(d(i)));
+    let n;
+    this.#e ? n = s.encode(d(JSON.stringify(this.#e))) : n = s.encode("");
+    const f = u(n, s.encode("."), i), m = await P(e, t), w = await y(t, m, f), a = {
+      signature: d(w),
+      payload: ""
+    };
+    return o && (a.payload = h.decode(i)), this.#t && (a.header = this.#t), this.#e && (a.protected = h.decode(n)), a;
+  }
 }
 export {
-  f as commitmentToVersionedHash
+  x as FlattenedSign
 };

package/dist/esm/index81.js

@@ -1,12 +1,13 @@
-import { contracts as o } from "./index88.js";
-import { formatters as r } from "./index89.js";
-import { serializers as t } from "./index90.js";
-const e = {
-  blockTime: 2e3,
-  contracts: o,
-  formatters: r,
-  serializers: t
-};
+const d = new TextEncoder(), s = new TextDecoder();
+function f(...n) {
+  const c = n.reduce((e, { length: r }) => e + r, 0), t = new Uint8Array(c);
+  let o = 0;
+  for (const e of n)
+    t.set(e, o), o += e.length;
+  return t;
+}
 export {
-  e as chainConfig
+  f as concat,
+  s as decoder,
+  d as encoder
 };