@coinbase/cdp-hooks 0.0.52 → 0.0.54

package/dist/esm/index265.js

@@ -1,204 +1,12 @@
-import { bitLen as B, bitMask as z } from "./index263.js";
-import { validateField as Z, Field as O, FpInvertBatch as R } from "./index243.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const g = BigInt(0), h = BigInt(1);
-function b(t, r) {
-  const e = r.negate();
-  return t ? e : r;
-}
-function L(t, r, e) {
-  const n = (s) => s.pz, i = R(t.Fp, e.map(n));
-  return e.map((s, f) => s.toAffine(i[f])).map(t.fromAffine);
-}
-function I(t, r) {
-  if (!Number.isSafeInteger(t) || t <= 0 || t > r)
-    throw new Error("invalid window size, expected [1.." + r + "], got W=" + t);
-}
-function E(t, r) {
-  I(t, r);
-  const e = Math.ceil(r / t) + 1, n = 2 ** (t - 1), i = 2 ** t, o = z(t), s = BigInt(t);
-  return { windows: e, windowSize: n, mask: o, maxNumber: i, shiftBy: s };
-}
-function v(t, r, e) {
-  const { windowSize: n, mask: i, maxNumber: o, shiftBy: s } = e;
-  let f = Number(t & i), a = t >> s;
-  f > n && (f -= o, a += h);
-  const d = r * n, c = d + Math.abs(f) - 1, p = f === 0, l = f < 0, u = r % 2 !== 0;
-  return { nextN: a, offset: c, isZero: p, isNeg: l, isNegF: u, offsetF: d };
-}
-function j(t, r) {
-  if (!Array.isArray(t))
-    throw new Error("array expected");
-  t.forEach((e, n) => {
-    if (!(e instanceof r))
-      throw new Error("invalid point at index " + n);
-  });
-}
-function _(t, r) {
-  if (!Array.isArray(t))
-    throw new Error("array of scalars expected");
-  t.forEach((e, n) => {
-    if (!r.isValid(e))
-      throw new Error("invalid scalar at index " + n);
-  });
-}
-const N = /* @__PURE__ */ new WeakMap(), M = /* @__PURE__ */ new WeakMap();
-function A(t) {
-  return M.get(t) || 1;
-}
-function S(t) {
-  if (t !== g)
-    throw new Error("invalid wNAF");
-}
-function U(t, r) {
+import { fromNumber as e } from "./index264.js";
+function r(o) {
   return {
-    constTimeNegate: b,
-    hasPrecomputes(e) {
-      return A(e) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(e, n, i = t.ZERO) {
-      let o = e;
-      for (; n > g; )
-        n & h && (i = i.add(o)), o = o.double(), n >>= h;
-      return i;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(e, n) {
-      const { windows: i, windowSize: o } = E(n, r), s = [];
-      let f = e, a = f;
-      for (let d = 0; d < i; d++) {
-        a = f, s.push(a);
-        for (let c = 1; c < o; c++)
-          a = a.add(f), s.push(a);
-        f = a.double();
-      }
-      return s;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(e, n, i) {
-      let o = t.ZERO, s = t.BASE;
-      const f = E(e, r);
-      for (let a = 0; a < f.windows; a++) {
-        const { nextN: d, offset: c, isZero: p, isNeg: l, isNegF: u, offsetF: m } = v(i, a, f);
-        i = d, p ? s = s.add(b(u, n[m])) : o = o.add(b(l, n[c]));
-      }
-      return S(i), { p: o, f: s };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(e, n, i, o = t.ZERO) {
-      const s = E(e, r);
-      for (let f = 0; f < s.windows && i !== g; f++) {
-        const { nextN: a, offset: d, isZero: c, isNeg: p } = v(i, f, s);
-        if (i = a, !c) {
-          const l = n[d];
-          o = o.add(p ? l.negate() : l);
-        }
-      }
-      return S(i), o;
-    },
-    getPrecomputes(e, n, i) {
-      let o = N.get(n);
-      return o || (o = this.precomputeWindow(n, e), e !== 1 && (typeof i == "function" && (o = i(o)), N.set(n, o))), o;
-    },
-    wNAFCached(e, n, i) {
-      const o = A(e);
-      return this.wNAF(o, this.getPrecomputes(o, e, i), n);
-    },
-    wNAFCachedUnsafe(e, n, i, o) {
-      const s = A(e);
-      return s === 1 ? this.unsafeLadder(e, n, o) : this.wNAFUnsafe(s, this.getPrecomputes(s, e, i), n, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(e, n) {
-      I(n, r), M.set(e, n), N.delete(e);
-    }
+    address: o.address,
+    amount: e(o.amount),
+    index: e(o.index),
+    validatorIndex: e(o.validatorIndex)
   };
 }
-function $(t, r, e, n) {
-  let i = r, o = t.ZERO, s = t.ZERO;
-  for (; e > g || n > g; )
-    e & h && (o = o.add(i)), n & h && (s = s.add(i)), i = i.double(), e >>= h, n >>= h;
-  return { p1: o, p2: s };
-}
-function D(t, r, e, n) {
-  j(e, t), _(n, r);
-  const i = e.length, o = n.length;
-  if (i !== o)
-    throw new Error("arrays of points and scalars must have equal length");
-  const s = t.ZERO, f = B(BigInt(i));
-  let a = 1;
-  f > 12 ? a = f - 3 : f > 4 ? a = f - 2 : f > 0 && (a = 2);
-  const d = z(a), c = new Array(Number(d) + 1).fill(s), p = Math.floor((r.BITS - 1) / a) * a;
-  let l = s;
-  for (let u = p; u >= 0; u -= a) {
-    c.fill(s);
-    for (let w = 0; w < o; w++) {
-      const F = n[w], y = Number(F >> BigInt(u) & d);
-      c[y] = c[y].add(e[w]);
-    }
-    let m = s;
-    for (let w = c.length - 1, F = s; w > 0; w--)
-      F = F.add(c[w]), m = m.add(F);
-    if (l = l.add(m), u !== 0)
-      for (let w = 0; w < a; w++)
-        l = l.double();
-  }
-  return l;
-}
-function x(t, r) {
-  if (r) {
-    if (r.ORDER !== t)
-      throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-    return Z(r), r;
-  } else
-    return O(t);
-}
-function G(t, r, e = {}) {
-  if (!r || typeof r != "object")
-    throw new Error(`expected valid ${t} CURVE object`);
-  for (const f of ["p", "n", "h"]) {
-    const a = r[f];
-    if (!(typeof a == "bigint" && a > g))
-      throw new Error(`CURVE.${f} must be positive bigint`);
-  }
-  const n = x(r.p, e.Fp), i = x(r.n, e.Fn), s = ["Gx", "Gy", "a", "b"];
-  for (const f of s)
-    if (!n.isValid(r[f]))
-      throw new Error(`CURVE.${f} must be valid field element of CURVE.Fp`);
-  return { Fp: n, Fn: i };
-}
 export {
-  G as _createCurveFields,
-  $ as mulEndoUnsafe,
-  b as negateCt,
-  L as normalizeZ,
-  D as pippenger,
-  U as wNAF
+  r as toRpc
 };

package/dist/esm/index266.js

@@ -1,68 +1,116 @@
-import { getVersion as n } from "./index276.js";
-class s extends Error {
-  constructor(r, e = {}) {
-    const a = (() => {
-      if (e.cause instanceof s) {
-        if (e.cause.details)
-          return e.cause.details;
-        if (e.cause.shortMessage)
-          return e.cause.shortMessage;
+import { BaseError as y } from "./index275.js";
+import { keccak256 as v } from "./index278.js";
+import { validate as $, slice as A, fromString as S } from "./index264.js";
+import { isArgOfType as E, normalizeSignature as p, getAmbiguousTypes as B } from "./index279.js";
+import { parseAbiItem as l } from "./index212.js";
+import { formatAbiItem as h } from "./index204.js";
+function H(e, r = {}) {
+  const { prepare: i = !0 } = r, n = Array.isArray(e) ? l(e) : typeof e == "string" ? l(e) : e;
+  return {
+    ...n,
+    ...i ? { hash: s(n) } : {}
+  };
+}
+function M(e, r, i) {
+  const { args: n = [], prepare: f = !0 } = i ?? {}, b = $(r, { strict: !1 }), u = e.filter((t) => b ? t.type === "function" || t.type === "error" ? T(t) === A(r, 0, 4) : t.type === "event" ? s(t) === r : !1 : "name" in t && t.name === r);
+  if (u.length === 0)
+    throw new d({ name: r });
+  if (u.length === 1)
+    return {
+      ...u[0],
+      ...f ? { hash: s(u[0]) } : {}
+    };
+  let o;
+  for (const t of u) {
+    if (!("inputs" in t))
+      continue;
+    if (!n || n.length === 0) {
+      if (!t.inputs || t.inputs.length === 0)
+        return {
+          ...t,
+          ...f ? { hash: s(t) } : {}
+        };
+      continue;
+    }
+    if (!t.inputs || t.inputs.length === 0 || t.inputs.length !== n.length)
+      continue;
+    if (n.every((a, w) => {
+      const g = "inputs" in t && t.inputs[w];
+      return g ? E(a, g) : !1;
+    })) {
+      if (o && "inputs" in o && o.inputs) {
+        const a = B(t.inputs, o.inputs, n);
+        if (a)
+          throw new O({
+            abiItem: t,
+            type: a[0]
+          }, {
+            abiItem: o,
+            type: a[1]
+          });
       }
-      return e.cause && "details" in e.cause && typeof e.cause.details == "string" ? e.cause.details : e.cause?.message ? e.cause.message : e.details;
-    })(), u = e.cause instanceof s && e.cause.docsPath || e.docsPath, c = `https://oxlib.sh${u ?? ""}`, l = [
-      r || "An error occurred.",
-      ...e.metaMessages ? ["", ...e.metaMessages] : [],
-      ...a || u ? [
+      o = t;
+    }
+  }
+  const c = (() => {
+    if (o)
+      return o;
+    const [t, ...m] = u;
+    return { ...t, overloads: m };
+  })();
+  if (!c)
+    throw new d({ name: r });
+  return {
+    ...c,
+    ...f ? { hash: s(c) } : {}
+  };
+}
+function T(e) {
+  return A(s(e), 0, 4);
+}
+function F(e) {
+  const r = typeof e == "string" ? e : h(e);
+  return p(r);
+}
+function s(e) {
+  return typeof e != "string" && "hash" in e && e.hash ? e.hash : v(S(F(e)));
+}
+class O extends y {
+  constructor(r, i) {
+    super("Found ambiguous types in overloaded ABI Items.", {
+      metaMessages: [
+        // TODO: abitype to add support for signature-formatted ABI items.
+        `\`${r.type}\` in \`${p(h(r.abiItem))}\`, and`,
+        `\`${i.type}\` in \`${p(h(i.abiItem))}\``,
         "",
-        a ? `Details: ${a}` : void 0,
-        u ? `See: ${c}` : void 0
-      ] : []
-    ].filter((d) => typeof d == "string").join(`
-`);
-    super(l, e.cause ? { cause: e.cause } : void 0), Object.defineProperty(this, "details", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "docs", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "docsPath", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "shortMessage", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "cause", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
+        "These types encode differently and cannot be distinguished at runtime.",
+        "Remove one of the ambiguous items in the ABI."
+      ]
     }), Object.defineProperty(this, "name", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
-      value: "BaseError"
-    }), Object.defineProperty(this, "version", {
+      value: "AbiItem.AmbiguityError"
+    });
+  }
+}
+class d extends y {
+  constructor({ name: r, data: i, type: n = "item" }) {
+    const f = r ? ` with name "${r}"` : i ? ` with data "${i}"` : "";
+    super(`ABI ${n}${f} not found.`), Object.defineProperty(this, "name", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
-      value: `ox@${n()}`
-    }), this.cause = e.cause, this.details = a, this.docs = c, this.docsPath = u, this.shortMessage = r;
-  }
-  walk(r) {
-    return i(this, r);
+      value: "AbiItem.NotFoundError"
+    });
   }
 }
-function i(t, r) {
-  return r?.(t) ? t : t && typeof t == "object" && "cause" in t && t.cause ? i(t.cause, r) : r ? null : t;
-}
 export {
-  s as BaseError
+  O as AmbiguityError,
+  d as NotFoundError,
+  H as from,
+  M as fromAbi,
+  T as getSelector,
+  F as getSignature,
+  s as getSignatureHash
 };

package/dist/esm/index267.js

@@ -1,7 +1,137 @@
-const r = "#__bigint";
-function g(i, f, n) {
-  return JSON.stringify(i, (e, t) => typeof t == "bigint" ? t.toString() + r : t, n);
+import { assert as p } from "./index280.js";
+import { BaseError as u } from "./index275.js";
+import { size as y, padLeft as f, fromString as x, fromBoolean as w, fromNumber as E, padRight as P, concat as g } from "./index264.js";
+import { integerRegex as A, bytesRegex as $, arrayRegex as L } from "./index281.js";
+import { prepareParameters as z, encode as I } from "./index282.js";
+function N(n, e, t) {
+  const { checksumAddress: r = !1 } = {};
+  if (n.length !== e.length)
+    throw new b({
+      expectedLength: n.length,
+      givenLength: e.length
+    });
+  const a = z({
+    checksumAddress: r,
+    parameters: n,
+    values: e
+  }), s = I(a);
+  return s.length === 0 ? "0x" : s;
+}
+function m(n, e) {
+  if (n.length !== e.length)
+    throw new b({
+      expectedLength: n.length,
+      givenLength: e.length
+    });
+  const t = [];
+  for (let r = 0; r < n.length; r++) {
+    const a = n[r], s = e[r];
+    t.push(m.encode(a, s));
+  }
+  return g(...t);
+}
+(function(n) {
+  function e(t, r, a = !1) {
+    if (t === "address") {
+      const i = r;
+      return p(i), f(i.toLowerCase(), a ? 32 : 0);
+    }
+    if (t === "string")
+      return x(r);
+    if (t === "bytes")
+      return r;
+    if (t === "bool")
+      return f(w(r), a ? 32 : 1);
+    const s = t.match(A);
+    if (s) {
+      const [i, o, c = "256"] = s, h = Number.parseInt(c) / 8;
+      return E(r, {
+        size: a ? 32 : h,
+        signed: o === "int"
+      });
+    }
+    const d = t.match($);
+    if (d) {
+      const [i, o] = d;
+      if (Number.parseInt(o) !== (r.length - 2) / 2)
+        throw new M({
+          expectedSize: Number.parseInt(o),
+          value: r
+        });
+      return P(r, a ? 32 : 0);
+    }
+    const l = t.match(L);
+    if (l && Array.isArray(r)) {
+      const [i, o] = l, c = [];
+      for (let h = 0; h < r.length; h++)
+        c.push(e(o, r[h], !0));
+      return c.length === 0 ? "0x" : g(...c);
+    }
+    throw new j(t);
+  }
+  n.encode = e;
+})(m || (m = {}));
+class R extends u {
+  constructor({ expectedLength: e, givenLength: t, type: r }) {
+    super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.ArrayLengthMismatchError"
+    });
+  }
+}
+class M extends u {
+  constructor({ expectedSize: e, value: t }) {
+    super(`Size of bytes "${t}" (bytes${y(t)}) does not match expected size (bytes${e}).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.BytesSizeMismatchError"
+    });
+  }
+}
+class b extends u {
+  constructor({ expectedLength: e, givenLength: t }) {
+    super([
+      "ABI encoding parameters/values length mismatch.",
+      `Expected length (parameters): ${e}`,
+      `Given length (values): ${t}`
+    ].join(`
+`)), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.LengthMismatchError"
+    });
+  }
+}
+class _ extends u {
+  constructor(e) {
+    super(`Value \`${e}\` is not a valid array.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidArrayError"
+    });
+  }
+}
+class j extends u {
+  constructor(e) {
+    super(`Type \`${e}\` is not a valid ABI Type.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidTypeError"
+    });
+  }
 }
 export {
-  g as stringify
+  R as ArrayLengthMismatchError,
+  M as BytesSizeMismatchError,
+  _ as InvalidArrayError,
+  j as InvalidTypeError,
+  b as LengthMismatchError,
+  N as encode,
+  m as encodePacked
 };

package/dist/esm/index268.js

@@ -1,43 +1,81 @@
-import { SizeExceedsPaddingSizeError as s, size as i, SliceOffsetOutOfBoundsError as f, SizeOverflowError as p } from "./index255.js";
-function c(t, e) {
-  if (i(t) > e)
-    throw new p({
-      givenSize: i(t),
-      maxSize: e
-    });
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index251.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 S(t, e) {
-  if (typeof e == "number" && e > 0 && e > i(t) - 1)
-    throw new f({
-      offset: e,
-      position: "start",
-      size: i(t)
-    });
+function U(o, t, s) {
+  return o & t ^ ~o & s;
 }
-function d(t, e, r) {
-  if (typeof e == "number" && typeof r == "number" && i(t) !== r - e)
-    throw new f({
-      offset: r,
-      position: "end",
-      size: i(t)
-    });
+function _(o, t, s) {
+  return o & t ^ o & s ^ t & s;
 }
-function u(t, e = {}) {
-  const { dir: r, size: n = 32 } = e;
-  if (n === 0)
-    return t;
-  const o = t.replace("0x", "");
-  if (o.length > n * 2)
-    throw new s({
-      size: Math.ceil(o.length / 2),
-      targetSize: n,
-      type: "Hex"
-    });
-  return `0x${o[r === "right" ? "padEnd" : "padStart"](n * 2, "0")}`;
+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 assertEndOffset,
-  c as assertSize,
-  S as assertStartOffset,
-  u as pad
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/esm/index269.js

@@ -1,10 +1,4 @@
-import { keccak_256 as f } from "./index193.js";
-import { from as m } from "./index274.js";
-import { fromBytes as s } from "./index255.js";
-function p(t, o = {}) {
-  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
-  return e === "Bytes" ? r : s(r);
-}
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 export {
-  p as keccak256
+  o as crypto
 };