@coinbase/cdp-core 0.0.125 → 0.0.127

package/dist/native/index.native229.js

@@ -0,0 +1,106 @@
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index.native230.js";
+import { createHasher as u, clean as C, rotr as i } from "./index.native231.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 SHA256,
+  y as sha256
+};

package/dist/native/index.native230.js

@@ -0,0 +1,81 @@
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.native231.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;
+  }
+  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 {
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
+};

package/dist/native/index.native231.js

@@ -0,0 +1,81 @@
+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 {
+  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.native232.js

@@ -0,0 +1,10 @@
+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);
+}
+export {
+  s as __require
+};

package/dist/native/index.native233.js

@@ -0,0 +1,4 @@
+var e = { exports: {} };
+export {
+  e as __module
+};

package/dist/native/index.native234.js

@@ -0,0 +1,363 @@
+import { __exports as n } from "./index.native255.js";
+var $;
+function Z() {
+  if ($) return n;
+  $ = 1;
+  var E = /* @__PURE__ */ Symbol.for("react.transitional.element"), N = /* @__PURE__ */ Symbol.for("react.portal"), Y = /* @__PURE__ */ Symbol.for("react.fragment"), I = /* @__PURE__ */ Symbol.for("react.strict_mode"), M = /* @__PURE__ */ Symbol.for("react.profiler"), L = /* @__PURE__ */ Symbol.for("react.consumer"), k = /* @__PURE__ */ Symbol.for("react.context"), U = /* @__PURE__ */ Symbol.for("react.forward_ref"), x = /* @__PURE__ */ Symbol.for("react.suspense"), b = /* @__PURE__ */ Symbol.for("react.memo"), A = /* @__PURE__ */ Symbol.for("react.lazy"), q = /* @__PURE__ */ Symbol.for("react.activity"), S = Symbol.iterator;
+  function D(t) {
+    return t === null || typeof t != "object" ? null : (t = S && t[S] || t["@@iterator"], typeof t == "function" ? t : null);
+  }
+  var d = {
+    isMounted: function() {
+      return !1;
+    },
+    enqueueForceUpdate: function() {
+    },
+    enqueueReplaceState: function() {
+    },
+    enqueueSetState: function() {
+    }
+  }, w = Object.assign, g = {};
+  function _(t, e, u) {
+    this.props = t, this.context = e, this.refs = g, this.updater = u || d;
+  }
+  _.prototype.isReactComponent = {}, _.prototype.setState = function(t, e) {
+    if (typeof t != "object" && typeof t != "function" && t != null)
+      throw Error(
+        "takes an object of state variables to update or a function which returns an object of state variables."
+      );
+    this.updater.enqueueSetState(this, t, e, "setState");
+  }, _.prototype.forceUpdate = function(t) {
+    this.updater.enqueueForceUpdate(this, t, "forceUpdate");
+  };
+  function h() {
+  }
+  h.prototype = _.prototype;
+  function y(t, e, u) {
+    this.props = t, this.context = e, this.refs = g, this.updater = u || d;
+  }
+  var v = y.prototype = new h();
+  v.constructor = y, w(v, _.prototype), v.isPureReactComponent = !0;
+  var H = Array.isArray;
+  function R() {
+  }
+  var f = { H: null, A: null, T: null, S: null }, O = Object.prototype.hasOwnProperty;
+  function T(t, e, u) {
+    var r = u.ref;
+    return {
+      $$typeof: E,
+      type: t,
+      key: e,
+      ref: r !== void 0 ? r : null,
+      props: u
+    };
+  }
+  function z(t, e) {
+    return T(t.type, e, t.props);
+  }
+  function m(t) {
+    return typeof t == "object" && t !== null && t.$$typeof === E;
+  }
+  function G(t) {
+    var e = { "=": "=0", ":": "=2" };
+    return "$" + t.replace(/[=:]/g, function(u) {
+      return e[u];
+    });
+  }
+  var P = /\/+/g;
+  function C(t, e) {
+    return typeof t == "object" && t !== null && t.key != null ? G("" + t.key) : e.toString(36);
+  }
+  function K(t) {
+    switch (t.status) {
+      case "fulfilled":
+        return t.value;
+      case "rejected":
+        throw t.reason;
+      default:
+        switch (typeof t.status == "string" ? t.then(R, R) : (t.status = "pending", t.then(
+          function(e) {
+            t.status === "pending" && (t.status = "fulfilled", t.value = e);
+          },
+          function(e) {
+            t.status === "pending" && (t.status = "rejected", t.reason = e);
+          }
+        )), t.status) {
+          case "fulfilled":
+            return t.value;
+          case "rejected":
+            throw t.reason;
+        }
+    }
+    throw t;
+  }
+  function l(t, e, u, r, o) {
+    var s = typeof t;
+    (s === "undefined" || s === "boolean") && (t = null);
+    var i = !1;
+    if (t === null) i = !0;
+    else
+      switch (s) {
+        case "bigint":
+        case "string":
+        case "number":
+          i = !0;
+          break;
+        case "object":
+          switch (t.$$typeof) {
+            case E:
+            case N:
+              i = !0;
+              break;
+            case A:
+              return i = t._init, l(
+                i(t._payload),
+                e,
+                u,
+                r,
+                o
+              );
+          }
+      }
+    if (i)
+      return o = o(t), i = r === "" ? "." + C(t, 0) : r, H(o) ? (u = "", i != null && (u = i.replace(P, "$&/") + "/"), l(o, e, u, "", function(Q) {
+        return Q;
+      })) : o != null && (m(o) && (o = z(
+        o,
+        u + (o.key == null || t && t.key === o.key ? "" : ("" + o.key).replace(
+          P,
+          "$&/"
+        ) + "/") + i
+      )), e.push(o)), 1;
+    i = 0;
+    var p = r === "" ? "." : r + ":";
+    if (H(t))
+      for (var c = 0; c < t.length; c++)
+        r = t[c], s = p + C(r, c), i += l(
+          r,
+          e,
+          u,
+          s,
+          o
+        );
+    else if (c = D(t), typeof c == "function")
+      for (t = c.call(t), c = 0; !(r = t.next()).done; )
+        r = r.value, s = p + C(r, c++), i += l(
+          r,
+          e,
+          u,
+          s,
+          o
+        );
+    else if (s === "object") {
+      if (typeof t.then == "function")
+        return l(
+          K(t),
+          e,
+          u,
+          r,
+          o
+        );
+      throw e = String(t), Error(
+        "Objects are not valid as a React child (found: " + (e === "[object Object]" ? "object with keys {" + Object.keys(t).join(", ") + "}" : e) + "). If you meant to render a collection of children, use an array instead."
+      );
+    }
+    return i;
+  }
+  function a(t, e, u) {
+    if (t == null) return t;
+    var r = [], o = 0;
+    return l(t, r, "", "", function(s) {
+      return e.call(u, s, o++);
+    }), r;
+  }
+  function B(t) {
+    if (t._status === -1) {
+      var e = t._result;
+      e = e(), e.then(
+        function(u) {
+          (t._status === 0 || t._status === -1) && (t._status = 1, t._result = u);
+        },
+        function(u) {
+          (t._status === 0 || t._status === -1) && (t._status = 2, t._result = u);
+        }
+      ), t._status === -1 && (t._status = 0, t._result = e);
+    }
+    if (t._status === 1) return t._result.default;
+    throw t._result;
+  }
+  var j = typeof reportError == "function" ? reportError : function(t) {
+    if (typeof window == "object" && typeof window.ErrorEvent == "function") {
+      var e = new window.ErrorEvent("error", {
+        bubbles: !0,
+        cancelable: !0,
+        message: typeof t == "object" && t !== null && typeof t.message == "string" ? String(t.message) : String(t),
+        error: t
+      });
+      if (!window.dispatchEvent(e)) return;
+    } else if (typeof process == "object" && typeof process.emit == "function") {
+      process.emit("uncaughtException", t);
+      return;
+    }
+    console.error(t);
+  }, W = {
+    map: a,
+    forEach: function(t, e, u) {
+      a(
+        t,
+        function() {
+          e.apply(this, arguments);
+        },
+        u
+      );
+    },
+    count: function(t) {
+      var e = 0;
+      return a(t, function() {
+        e++;
+      }), e;
+    },
+    toArray: function(t) {
+      return a(t, function(e) {
+        return e;
+      }) || [];
+    },
+    only: function(t) {
+      if (!m(t))
+        throw Error(
+          "React.Children.only expected to receive a single React element child."
+        );
+      return t;
+    }
+  };
+  return n.Activity = q, n.Children = W, n.Component = _, n.Fragment = Y, n.Profiler = M, n.PureComponent = y, n.StrictMode = I, n.Suspense = x, n.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE = f, n.__COMPILER_RUNTIME = {
+    __proto__: null,
+    c: function(t) {
+      return f.H.useMemoCache(t);
+    }
+  }, n.cache = function(t) {
+    return function() {
+      return t.apply(null, arguments);
+    };
+  }, n.cacheSignal = function() {
+    return null;
+  }, n.cloneElement = function(t, e, u) {
+    if (t == null)
+      throw Error(
+        "The argument must be a React element, but you passed " + t + "."
+      );
+    var r = w({}, t.props), o = t.key;
+    if (e != null)
+      for (s in e.key !== void 0 && (o = "" + e.key), e)
+        !O.call(e, s) || s === "key" || s === "__self" || s === "__source" || s === "ref" && e.ref === void 0 || (r[s] = e[s]);
+    var s = arguments.length - 2;
+    if (s === 1) r.children = u;
+    else if (1 < s) {
+      for (var i = Array(s), p = 0; p < s; p++)
+        i[p] = arguments[p + 2];
+      r.children = i;
+    }
+    return T(t.type, o, r);
+  }, n.createContext = function(t) {
+    return t = {
+      $$typeof: k,
+      _currentValue: t,
+      _currentValue2: t,
+      _threadCount: 0,
+      Provider: null,
+      Consumer: null
+    }, t.Provider = t, t.Consumer = {
+      $$typeof: L,
+      _context: t
+    }, t;
+  }, n.createElement = function(t, e, u) {
+    var r, o = {}, s = null;
+    if (e != null)
+      for (r in e.key !== void 0 && (s = "" + e.key), e)
+        O.call(e, r) && r !== "key" && r !== "__self" && r !== "__source" && (o[r] = e[r]);
+    var i = arguments.length - 2;
+    if (i === 1) o.children = u;
+    else if (1 < i) {
+      for (var p = Array(i), c = 0; c < i; c++)
+        p[c] = arguments[c + 2];
+      o.children = p;
+    }
+    if (t && t.defaultProps)
+      for (r in i = t.defaultProps, i)
+        o[r] === void 0 && (o[r] = i[r]);
+    return T(t, s, o);
+  }, n.createRef = function() {
+    return { current: null };
+  }, n.forwardRef = function(t) {
+    return { $$typeof: U, render: t };
+  }, n.isValidElement = m, n.lazy = function(t) {
+    return {
+      $$typeof: A,
+      _payload: { _status: -1, _result: t },
+      _init: B
+    };
+  }, n.memo = function(t, e) {
+    return {
+      $$typeof: b,
+      type: t,
+      compare: e === void 0 ? null : e
+    };
+  }, n.startTransition = function(t) {
+    var e = f.T, u = {};
+    f.T = u;
+    try {
+      var r = t(), o = f.S;
+      o !== null && o(u, r), typeof r == "object" && r !== null && typeof r.then == "function" && r.then(R, j);
+    } catch (s) {
+      j(s);
+    } finally {
+      e !== null && u.types !== null && (e.types = u.types), f.T = e;
+    }
+  }, n.unstable_useCacheRefresh = function() {
+    return f.H.useCacheRefresh();
+  }, n.use = function(t) {
+    return f.H.use(t);
+  }, n.useActionState = function(t, e, u) {
+    return f.H.useActionState(t, e, u);
+  }, n.useCallback = function(t, e) {
+    return f.H.useCallback(t, e);
+  }, n.useContext = function(t) {
+    return f.H.useContext(t);
+  }, n.useDebugValue = function() {
+  }, n.useDeferredValue = function(t, e) {
+    return f.H.useDeferredValue(t, e);
+  }, n.useEffect = function(t, e) {
+    return f.H.useEffect(t, e);
+  }, n.useEffectEvent = function(t) {
+    return f.H.useEffectEvent(t);
+  }, n.useId = function() {
+    return f.H.useId();
+  }, n.useImperativeHandle = function(t, e, u) {
+    return f.H.useImperativeHandle(t, e, u);
+  }, n.useInsertionEffect = function(t, e) {
+    return f.H.useInsertionEffect(t, e);
+  }, n.useLayoutEffect = function(t, e) {
+    return f.H.useLayoutEffect(t, e);
+  }, n.useMemo = function(t, e) {
+    return f.H.useMemo(t, e);
+  }, n.useOptimistic = function(t, e) {
+    return f.H.useOptimistic(t, e);
+  }, n.useReducer = function(t, e, u) {
+    return f.H.useReducer(t, e, u);
+  }, n.useRef = function(t) {
+    return f.H.useRef(t);
+  }, n.useState = function(t) {
+    return f.H.useState(t);
+  }, n.useSyncExternalStore = function(t, e, u) {
+    return f.H.useSyncExternalStore(
+      t,
+      e,
+      u
+    );
+  }, n.useTransition = function() {
+    return f.H.useTransition();
+  }, n.version = "19.2.7", n;
+}
+export {
+  Z as __require
+};