@coinbase/cdp-hooks 0.0.95 → 0.0.97

package/dist/esm/index325.js

@@ -1,137 +1,216 @@
-import { assert as p } from "./index338.js";
-import { BaseError as u } from "./index333.js";
-import { size as y, padLeft as f, fromString as x, fromBoolean as w, fromNumber as E, padRight as P, concat as g } from "./index321.js";
-import { integerRegex as A, bytesRegex as $, arrayRegex as L } from "./index339.js";
-import { prepareParameters as z, encode as I } from "./index340.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));
+import { anumber as C } from "./index319.js";
+import { bytesToNumberLE as I, bytesToNumberBE as y, numberToBytesLE as S, numberToBytesBE as x, bitMask as Z, validateObject as z } from "./index345.js";
+const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
+function w(t, n) {
+  const o = t % n;
+  return o >= d ? o : n + o;
+}
+function $(t, n, o) {
+  let r = t;
+  for (; n-- > d; )
+    r *= r, r %= o;
+  return r;
+}
+function B(t, n) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (n <= d)
+    throw new Error("invert: expected positive modulus, got " + n);
+  let o = w(t, n), r = n, s = d, l = f;
+  for (; o !== d; ) {
+    const c = r / o, e = r % o, i = s - l * c;
+    r = o, o = e, s = l, l = i;
   }
-  return g(...t);
+  if (r !== f)
+    throw new Error("invert: does not exist");
+  return w(s, n);
 }
-(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);
+function M(t, n) {
+  const o = (t.ORDER + f) / L, r = t.pow(n, o);
+  if (!t.eql(t.sqr(r), n))
+    throw new Error("Cannot find square root");
+  return r;
+}
+function H(t, n) {
+  const o = (t.ORDER - _) / T, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
+  if (!t.eql(t.sqr(c), n))
+    throw new Error("Cannot find square root");
+  return c;
+}
+function K(t) {
+  if (t < BigInt(3))
+    throw new Error("sqrt is not defined for small field");
+  let n = t - f, o = 0;
+  for (; n % g === d; )
+    n /= g, o++;
+  let r = g;
+  const s = J(t);
+  for (; N(s, r) === 1; )
+    if (r++ > 1e3)
+      throw new Error("Cannot find square root: probably non-prime P");
+  if (o === 1)
+    return M;
+  let l = s.pow(r, n);
+  const u = (n + f) / g;
+  return function(e, i) {
+    if (e.is0(i))
+      return i;
+    if (N(e, i) !== 1)
+      throw new Error("Cannot find square root");
+    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
+    for (; !e.eql(a, e.ONE); ) {
+      if (e.is0(a))
+        return e.ZERO;
+      let q = 1, v = e.sqr(a);
+      for (; !e.eql(v, e.ONE); )
+        if (q++, v = e.sqr(v), q === h)
+          throw new Error("Cannot find square root");
+      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
+      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
     }
-    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"
-    });
-  }
+    return m;
+  };
 }
-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"
-    });
-  }
+function Q(t) {
+  return t % L === j ? M : t % T === _ ? H : K(t);
 }
-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"
-    });
-  }
+const V = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function P(t) {
+  const n = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
+  return z(t, o);
 }
-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"
-    });
-  }
+function Y(t, n, o) {
+  if (o < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (o === d)
+    return t.ONE;
+  if (o === f)
+    return n;
+  let r = t.ONE, s = n;
+  for (; o > d; )
+    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
+  return r;
 }
-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"
-    });
-  }
+function k(t, n, o = !1) {
+  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
+  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
+}
+function N(t, n) {
+  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
+  if (!s && !l && !u)
+    throw new Error("invalid Legendre symbol result");
+  return s ? 1 : l ? 0 : -1;
+}
+function G(t, n) {
+  n !== void 0 && C(n);
+  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
+  return { nBitLength: o, nByteLength: r };
+}
+function J(t, n, o = !1, r = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: l } = G(t, n);
+  if (l > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let u;
+  const c = Object.freeze({
+    ORDER: t,
+    isLE: o,
+    BITS: s,
+    BYTES: l,
+    MASK: Z(s),
+    ZERO: d,
+    ONE: f,
+    create: (e) => w(e, t),
+    isValid: (e) => {
+      if (typeof e != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof e);
+      return d <= e && e < t;
+    },
+    is0: (e) => e === d,
+    isOdd: (e) => (e & f) === f,
+    neg: (e) => w(-e, t),
+    eql: (e, i) => e === i,
+    sqr: (e) => w(e * e, t),
+    add: (e, i) => w(e + i, t),
+    sub: (e, i) => w(e - i, t),
+    mul: (e, i) => w(e * i, t),
+    pow: (e, i) => Y(c, e, i),
+    div: (e, i) => w(e * B(i, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, i) => e + i,
+    subN: (e, i) => e - i,
+    mulN: (e, i) => e * i,
+    inv: (e) => B(e, t),
+    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
+    toBytes: (e) => o ? S(e, l) : x(e, l),
+    fromBytes: (e) => {
+      if (e.length !== l)
+        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
+      return o ? I(e) : y(e);
+    },
+    // TODO: we don't need it here, move out to separate fn
+    invertBatch: (e) => k(c, e),
+    // We can't move this out because Fp6, Fp12 implement it
+    // and it's unclear what to return in there.
+    cmov: (e, i, h) => h ? i : e
+  });
+  return Object.freeze(c);
+}
+function O(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const n = t.toString(2).length;
+  return Math.ceil(n / 8);
+}
+function U(t) {
+  const n = O(t);
+  return n + Math.ceil(n / 2);
+}
+function D(t, n, o = !1) {
+  const r = t.length, s = O(n), l = U(n);
+  if (r < 16 || r < l || r > 1024)
+    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
+  const u = o ? I(t) : y(t), c = w(u, n - f) + f;
+  return o ? S(c, s) : x(c, s);
 }
 export {
-  R as ArrayLengthMismatchError,
-  M as BytesSizeMismatchError,
-  _ as InvalidArrayError,
-  j as InvalidTypeError,
-  b as LengthMismatchError,
-  N as encode,
-  m as encodePacked
+  J as Field,
+  k as FpInvertBatch,
+  N as FpLegendre,
+  Y as FpPow,
+  Q as FpSqrt,
+  O as getFieldBytesLength,
+  U as getMinHashLength,
+  B as invert,
+  D as mapHashToField,
+  w as mod,
+  G as nLength,
+  $ as pow2,
+  K as tonelliShanks,
+  P as validateField
 };

package/dist/esm/index326.js

@@ -1,81 +1,15 @@
-import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index313.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);
+const s = {
+  gasPriceOracle: { address: "0x420000000000000000000000000000000000000F" },
+  l1Block: { address: "0x4200000000000000000000000000000000000015" },
+  l2CrossDomainMessenger: {
+    address: "0x4200000000000000000000000000000000000007"
+  },
+  l2Erc721Bridge: { address: "0x4200000000000000000000000000000000000014" },
+  l2StandardBridge: { address: "0x4200000000000000000000000000000000000010" },
+  l2ToL1MessagePasser: {
+    address: "0x4200000000000000000000000000000000000016"
   }
-  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
+  s as contracts
 };

package/dist/esm/index327.js

@@ -1,4 +1,38 @@
-const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+import { hexToBigInt as n } from "./index235.js";
+import { defineBlock as r } from "./index241.js";
+import { defineTransaction as s, formatTransaction as m } from "./index243.js";
+import { defineTransactionReceipt as l } from "./index244.js";
+const p = {
+  block: /* @__PURE__ */ r({
+    format(e) {
+      return {
+        transactions: e.transactions?.map((t) => {
+          if (typeof t == "string")
+            return t;
+          const i = m(t);
+          return i.typeHex === "0x7e" && (i.isSystemTx = t.isSystemTx, i.mint = t.mint ? n(t.mint) : void 0, i.sourceHash = t.sourceHash, i.type = "deposit"), i;
+        }),
+        stateRoot: e.stateRoot
+      };
+    }
+  }),
+  transaction: /* @__PURE__ */ s({
+    format(e) {
+      const o = {};
+      return e.type === "0x7e" && (o.isSystemTx = e.isSystemTx, o.mint = e.mint ? n(e.mint) : void 0, o.sourceHash = e.sourceHash, o.type = "deposit"), o;
+    }
+  }),
+  transactionReceipt: /* @__PURE__ */ l({
+    format(e) {
+      return {
+        l1GasPrice: e.l1GasPrice ? n(e.l1GasPrice) : null,
+        l1GasUsed: e.l1GasUsed ? n(e.l1GasUsed) : null,
+        l1Fee: e.l1Fee ? n(e.l1Fee) : null,
+        l1FeeScalar: e.l1FeeScalar ? Number(e.l1FeeScalar) : null
+      };
+    }
+  })
+};
 export {
-  o as crypto
+  p as formatters
 };