@coinbase/cdp-hooks 0.0.55 → 0.0.57

package/dist/esm/index271.js

@@ -1,142 +1,137 @@
-import { hexToBytes as p, isBytes as B, abytes as v, bytesToHex as d, concatBytes as U } from "./index251.js";
-import { anumber as W, randomBytes as C, utf8ToBytes as G } from "./index251.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const y = /* @__PURE__ */ BigInt(0), g = /* @__PURE__ */ BigInt(1);
-function k(t, r) {
-  if (typeof r != "boolean")
-    throw new Error(t + " boolean expected, got " + r);
+import { assert as p } from "./index283.js";
+import { BaseError as u } from "./index278.js";
+import { size as y, padLeft as f, fromString as x, fromBoolean as w, fromNumber as E, padRight as P, concat as g } from "./index267.js";
+import { integerRegex as A, bytesRegex as $, arrayRegex as L } from "./index284.js";
+import { prepareParameters as z, encode as I } from "./index285.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 j(t) {
-  const r = t.toString(16);
-  return r.length & 1 ? "0" + r : r;
-}
-function h(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? y : BigInt("0x" + t);
-}
-function H(t) {
-  return h(d(t));
-}
-function O(t) {
-  return v(t), h(d(Uint8Array.from(t).reverse()));
-}
-function x(t, r) {
-  return p(t.toString(16).padStart(r * 2, "0"));
-}
-function S(t, r) {
-  return x(t, r).reverse();
+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 _(t, r, n) {
-  let o;
-  if (typeof r == "string")
-    try {
-      o = p(r);
-    } catch (e) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + e);
+(function(n) {
+  function e(t, r, a = !1) {
+    if (t === "address") {
+      const i = r;
+      return p(i), f(i.toLowerCase(), a ? 32 : 0);
     }
-  else if (B(r))
-    o = Uint8Array.from(r);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const i = o.length;
-  if (typeof n == "number" && i !== n)
-    throw new Error(t + " of length " + n + " expected, got " + i);
-  return o;
-}
-const w = (t) => typeof t == "bigint" && y <= t;
-function T(t, r, n) {
-  return w(t) && w(r) && w(n) && r <= t && t < n;
-}
-function $(t, r, n, o) {
-  if (!T(r, n, o))
-    throw new Error("expected valid " + t + ": " + n + " <= n < " + o + ", got " + r);
+    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"
+    });
+  }
 }
-function M(t) {
-  let r;
-  for (r = 0; t > y; t >>= g, r += 1)
-    ;
-  return r;
+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"
+    });
+  }
 }
-const N = (t) => (g << BigInt(t)) - g;
-function R(t, r, n) {
-  if (typeof t != "number" || t < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof r != "number" || r < 2)
-    throw new Error("qByteLen must be a number");
-  if (typeof n != "function")
-    throw new Error("hmacFn must be a function");
-  const o = (u) => new Uint8Array(u), i = (u) => Uint8Array.of(u);
-  let e = o(t), s = o(t), f = 0;
-  const c = () => {
-    e.fill(1), s.fill(0), f = 0;
-  }, l = (...u) => n(s, e, ...u), m = (u = o(0)) => {
-    s = l(i(0), u), e = l(), u.length !== 0 && (s = l(i(1), u), e = l());
-  }, E = () => {
-    if (f++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let u = 0;
-    const a = [];
-    for (; u < r; ) {
-      e = l();
-      const b = e.slice();
-      a.push(b), u += e.length;
-    }
-    return U(...a);
-  };
-  return (u, a) => {
-    c(), m(u);
-    let b;
-    for (; !(b = a(E())); )
-      m();
-    return c(), b;
-  };
+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"
+    });
+  }
 }
-function z(t, r, n = {}) {
-  if (!t || typeof t != "object")
-    throw new Error("expected valid options object");
-  function o(i, e, s) {
-    const f = t[i];
-    if (s && f === void 0)
-      return;
-    const c = typeof f;
-    if (c !== e || f === null)
-      throw new Error(`param "${i}" is invalid: expected ${e}, got ${c}`);
+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"
+    });
   }
-  Object.entries(r).forEach(([i, e]) => o(i, e, !1)), Object.entries(n).forEach(([i, e]) => o(i, e, !0));
 }
-function D(t) {
-  const r = /* @__PURE__ */ new WeakMap();
-  return (n, ...o) => {
-    const i = r.get(n);
-    if (i !== void 0)
-      return i;
-    const e = t(n, ...o);
-    return r.set(n, e), e;
-  };
+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 {
-  z as _validateObject,
-  $ as aInRange,
-  k as abool,
-  v as abytes,
-  W as anumber,
-  M as bitLen,
-  N as bitMask,
-  d as bytesToHex,
-  H as bytesToNumberBE,
-  O as bytesToNumberLE,
-  U as concatBytes,
-  R as createHmacDrbg,
-  _ as ensureBytes,
-  p as hexToBytes,
-  h as hexToNumber,
-  T as inRange,
-  B as isBytes,
-  D as memoized,
-  x as numberToBytesBE,
-  S as numberToBytesLE,
-  j as numberToHexUnpadded,
-  C as randomBytes,
-  G as utf8ToBytes
+  R as ArrayLengthMismatchError,
+  M as BytesSizeMismatchError,
+  _ as InvalidArrayError,
+  j as InvalidTypeError,
+  b as LengthMismatchError,
+  N as encode,
+  m as encodePacked
 };

package/dist/esm/index272.js

@@ -1,45 +1,81 @@
-import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index251.js";
-class r extends d {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, u(t);
-    const h = H(i);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const o = this.blockLen, e = new Uint8Array(o);
-    e.set(h.length > o ? t.create().update(h).digest() : h);
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 54;
-    this.iHash.update(e), this.oHash = t.create();
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 106;
-    this.oHash.update(e), l(e);
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index259.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) {
-    return a(this), this.iHash.update(t), this;
+    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) {
-    a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    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 t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
+    const { buffer: t, outputLen: s } = this;
+    this.digestInto(t);
+    const n = t.slice(0, s);
+    return this.destroy(), n;
   }
   _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
-    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), 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();
   }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
 }
-const y = (n, t, i) => new r(n, t).update(i).digest();
-y.create = (n, t) => new r(n, t);
+const B = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
 export {
-  r as HMAC,
-  y as hmac
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/esm/index273.js

@@ -1,204 +1,4 @@
-import { bitLen as B, bitMask as z } from "./index271.js";
-import { validateField as Z, Field as O, FpInvertBatch as R } from "./index246.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) {
-  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);
-    }
-  };
-}
-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 };
-}
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 export {
-  G as _createCurveFields,
-  $ as mulEndoUnsafe,
-  b as negateCt,
-  L as normalizeZ,
-  D as pippenger,
-  U as wNAF
+  o as crypto
 };