@gardenfi/utils 2.1.2 → 2.1.3-beta.10

package/dist/index298.js

@@ -0,0 +1,209 @@
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const w = /* @__PURE__ */ BigInt(0), p = /* @__PURE__ */ BigInt(1);
+function b(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function h(t) {
+  if (!b(t))
+    throw new Error("Uint8Array expected");
+}
+function k(t, n) {
+  if (typeof n != "boolean")
+    throw new Error(t + " boolean expected, got " + n);
+}
+function F(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? "0" + n : n;
+}
+function E(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? w : BigInt("0x" + t);
+}
+const U = (
+  // @ts-ignore
+  typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
+), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function x(t) {
+  if (h(t), U)
+    return t.toHex();
+  let n = "";
+  for (let e = 0; e < t.length; e++)
+    n += S[t[e]];
+  return n;
+}
+const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function m(t) {
+  if (t >= u._0 && t <= u._9)
+    return t - u._0;
+  if (t >= u.A && t <= u.F)
+    return t - (u.A - 10);
+  if (t >= u.a && t <= u.f)
+    return t - (u.a - 10);
+}
+function B(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  if (U)
+    return Uint8Array.fromHex(t);
+  const n = t.length, e = n / 2;
+  if (n % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + n);
+  const r = new Uint8Array(e);
+  for (let o = 0, i = 0; o < e; o++, i += 2) {
+    const a = m(t.charCodeAt(i)), f = m(t.charCodeAt(i + 1));
+    if (a === void 0 || f === void 0) {
+      const c = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
+    }
+    r[o] = a * 16 + f;
+  }
+  return r;
+}
+function O(t) {
+  return E(x(t));
+}
+function V(t) {
+  return h(t), E(x(Uint8Array.from(t).reverse()));
+}
+function T(t, n) {
+  return B(t.toString(16).padStart(n * 2, "0"));
+}
+function C(t, n) {
+  return T(t, n).reverse();
+}
+function M(t, n, e) {
+  let r;
+  if (typeof n == "string")
+    try {
+      r = B(n);
+    } catch (i) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
+    }
+  else if (b(n))
+    r = Uint8Array.from(n);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const o = r.length;
+  if (typeof e == "number" && o !== e)
+    throw new Error(t + " of length " + e + " expected, got " + o);
+  return r;
+}
+function H(...t) {
+  let n = 0;
+  for (let r = 0; r < t.length; r++) {
+    const o = t[r];
+    h(o), n += o.length;
+  }
+  const e = new Uint8Array(n);
+  for (let r = 0, o = 0; r < t.length; r++) {
+    const i = t[r];
+    e.set(i, o), o += i.length;
+  }
+  return e;
+}
+const y = (t) => typeof t == "bigint" && w <= t;
+function I(t, n, e) {
+  return y(t) && y(n) && y(e) && n <= t && t < e;
+}
+function R(t, n, e, r) {
+  if (!I(n, e, r))
+    throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
+}
+function j(t) {
+  let n;
+  for (n = 0; t > w; t >>= p, n += 1)
+    ;
+  return n;
+}
+const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
+function D(t, n, e) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof n != "number" || n < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof e != "function")
+    throw new Error("hmacFn must be a function");
+  let r = d(t), o = d(t), i = 0;
+  const a = () => {
+    r.fill(1), o.fill(0), i = 0;
+  }, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
+    o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
+  }, v = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let s = 0;
+    const l = [];
+    for (; s < n; ) {
+      r = f();
+      const g = r.slice();
+      l.push(g), s += r.length;
+    }
+    return H(...l);
+  };
+  return (s, l) => {
+    a(), c(s);
+    let g;
+    for (; !(g = l(v())); )
+      c();
+    return a(), g;
+  };
+}
+const _ = {
+  bigint: (t) => typeof t == "bigint",
+  function: (t) => typeof t == "function",
+  boolean: (t) => typeof t == "boolean",
+  string: (t) => typeof t == "string",
+  stringOrUint8Array: (t) => typeof t == "string" || b(t),
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, n) => n.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function P(t, n, e = {}) {
+  const r = (o, i, a) => {
+    const f = _[i];
+    if (typeof f != "function")
+      throw new Error("invalid validator function");
+    const c = t[o];
+    if (!(a && c === void 0) && !f(c, t))
+      throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
+  };
+  for (const [o, i] of Object.entries(n))
+    r(o, i, !1);
+  for (const [o, i] of Object.entries(e))
+    r(o, i, !0);
+  return t;
+}
+function W(t) {
+  const n = /* @__PURE__ */ new WeakMap();
+  return (e, ...r) => {
+    const o = n.get(e);
+    if (o !== void 0)
+      return o;
+    const i = t(e, ...r);
+    return n.set(e, i), i;
+  };
+}
+export {
+  R as aInRange,
+  k as abool,
+  h as abytes,
+  j as bitLen,
+  z as bitMask,
+  x as bytesToHex,
+  O as bytesToNumberBE,
+  V as bytesToNumberLE,
+  H as concatBytes,
+  D as createHmacDrbg,
+  M as ensureBytes,
+  B as hexToBytes,
+  E as hexToNumber,
+  I as inRange,
+  b as isBytes,
+  W as memoized,
+  T as numberToBytesBE,
+  C as numberToBytesLE,
+  F as numberToHexUnpadded,
+  P as validateObject
+};

package/dist/index299.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index279.cjs"),m=require("./index298.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const E=BigInt(0),A=BigInt(1);function N(e,a){const t=a.negate();return e?t:a}function x(e,a){if(!Number.isSafeInteger(e)||e<=0||e>a)throw new Error("invalid window size, expected [1.."+a+"], got W="+e)}function b(e,a){x(e,a);const t=Math.ceil(a/e)+1,n=2**(e-1),o=2**e,i=m.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function M(e,a,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),s=e>>r;f>n&&(f-=i,s+=A);const c=a*n,d=c+Math.abs(f)-1,g=f===0,l=f<0,u=a%2!==0;return{nextN:s,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:c}}function O(e,a){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof a))throw new Error("invalid point at index "+n)})}function z(e,a){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!a.isValid(t))throw new Error("invalid scalar at index "+n)})}const S=new WeakMap,I=new WeakMap;function F(e){return I.get(e)||1}function k(e,a){return{constTimeNegate:N,hasPrecomputes(t){return F(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>E;)n&A&&(o=o.add(i)),i=i.double(),n>>=A;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,a),r=[];let f=t,s=f;for(let c=0;c<o;c++){s=f,r.push(s);for(let d=1;d<i;d++)s=s.add(f),r.push(s);f=s.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=b(t,a);for(let s=0;s<f.windows;s++){const{nextN:c,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:h}=M(o,s,f);o=c,g?r=r.add(N(u,n[h])):i=i.add(N(l,n[d]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=b(t,a);for(let f=0;f<r.windows&&o!==E;f++){const{nextN:s,offset:c,isZero:d,isNeg:g}=M(o,f,r);if(o=s,!d){const l=n[c];i=i.add(g?l.negate():l)}}return i},getPrecomputes(t,n,o){let i=S.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&S.set(n,o(i))),i},wNAFCached(t,n,o){const i=F(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=F(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){x(n,a),I.set(t,n),S.delete(t)}}}function L(e,a,t,n){O(t,e),z(n,a);const o=t.length,i=n.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const r=e.ZERO,f=m.bitLen(BigInt(o));let s=1;f>12?s=f-3:f>4?s=f-2:f>0&&(s=2);const c=m.bitMask(s),d=new Array(Number(c)+1).fill(r),g=Math.floor((a.BITS-1)/s)*s;let l=r;for(let u=g;u>=0;u-=s){d.fill(r);for(let w=0;w<i;w++){const p=n[w],y=Number(p>>BigInt(u)&c);d[y]=d[y].add(t[w])}let h=r;for(let w=d.length-1,p=r;w>0;w--)p=p.add(d[w]),h=h.add(p);if(l=l.add(h),u!==0)for(let w=0;w<s;w++)l=l.double()}return l}function Z(e){return B.validateField(e.Fp),m.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...B.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=L;exports.validateBasic=Z;exports.wNAF=k;

package/dist/index299.js

@@ -0,0 +1,180 @@
+import { validateField as M, nLength as z } from "./index279.js";
+import { validateObject as O, bitLen as k, bitMask as x } from "./index298.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const E = BigInt(0), F = BigInt(1);
+function m(e, a) {
+  const t = a.negate();
+  return e ? t : a;
+}
+function y(e, a) {
+  if (!Number.isSafeInteger(e) || e <= 0 || e > a)
+    throw new Error("invalid window size, expected [1.." + a + "], got W=" + e);
+}
+function N(e, a) {
+  y(e, a);
+  const t = Math.ceil(a / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = x(e), r = BigInt(e);
+  return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
+}
+function B(e, a, t) {
+  const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
+  let f = Number(e & i), s = e >> r;
+  f > n && (f -= o, s += F);
+  const c = a * n, d = c + Math.abs(f) - 1, g = f === 0, l = f < 0, u = a % 2 !== 0;
+  return { nextN: s, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: c };
+}
+function L(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array expected");
+  e.forEach((t, n) => {
+    if (!(t instanceof a))
+      throw new Error("invalid point at index " + n);
+  });
+}
+function Z(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array of scalars expected");
+  e.forEach((t, n) => {
+    if (!a.isValid(t))
+      throw new Error("invalid scalar at index " + n);
+  });
+}
+const b = /* @__PURE__ */ new WeakMap(), I = /* @__PURE__ */ new WeakMap();
+function S(e) {
+  return I.get(e) || 1;
+}
+function v(e, a) {
+  return {
+    constTimeNegate: m,
+    hasPrecomputes(t) {
+      return S(t) !== 1;
+    },
+    // non-const time multiplication ladder
+    unsafeLadder(t, n, i = e.ZERO) {
+      let o = t;
+      for (; n > E; )
+        n & F && (i = i.add(o)), o = o.double(), n >>= F;
+      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(t, n) {
+      const { windows: i, windowSize: o } = N(n, a), r = [];
+      let f = t, s = f;
+      for (let c = 0; c < i; c++) {
+        s = f, r.push(s);
+        for (let d = 1; d < o; d++)
+          s = s.add(f), r.push(s);
+        f = s.double();
+      }
+      return r;
+    },
+    /**
+     * 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(t, n, i) {
+      let o = e.ZERO, r = e.BASE;
+      const f = N(t, a);
+      for (let s = 0; s < f.windows; s++) {
+        const { nextN: c, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: h } = B(i, s, f);
+        i = c, g ? r = r.add(m(u, n[h])) : o = o.add(m(l, n[d]));
+      }
+      return { p: o, f: r };
+    },
+    /**
+     * 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(t, n, i, o = e.ZERO) {
+      const r = N(t, a);
+      for (let f = 0; f < r.windows && i !== E; f++) {
+        const { nextN: s, offset: c, isZero: d, isNeg: g } = B(i, f, r);
+        if (i = s, !d) {
+          const l = n[c];
+          o = o.add(g ? l.negate() : l);
+        }
+      }
+      return o;
+    },
+    getPrecomputes(t, n, i) {
+      let o = b.get(n);
+      return o || (o = this.precomputeWindow(n, t), t !== 1 && b.set(n, i(o))), o;
+    },
+    wNAFCached(t, n, i) {
+      const o = S(t);
+      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
+    },
+    wNAFCachedUnsafe(t, n, i, o) {
+      const r = S(t);
+      return r === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(r, this.getPrecomputes(r, t, 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(t, n) {
+      y(n, a), I.set(t, n), b.delete(t);
+    }
+  };
+}
+function U(e, a, t, n) {
+  L(t, e), Z(n, a);
+  const i = t.length, o = n.length;
+  if (i !== o)
+    throw new Error("arrays of points and scalars must have equal length");
+  const r = e.ZERO, f = k(BigInt(i));
+  let s = 1;
+  f > 12 ? s = f - 3 : f > 4 ? s = f - 2 : f > 0 && (s = 2);
+  const c = x(s), d = new Array(Number(c) + 1).fill(r), g = Math.floor((a.BITS - 1) / s) * s;
+  let l = r;
+  for (let u = g; u >= 0; u -= s) {
+    d.fill(r);
+    for (let w = 0; w < o; w++) {
+      const p = n[w], A = Number(p >> BigInt(u) & c);
+      d[A] = d[A].add(t[w]);
+    }
+    let h = r;
+    for (let w = d.length - 1, p = r; w > 0; w--)
+      p = p.add(d[w]), h = h.add(p);
+    if (l = l.add(h), u !== 0)
+      for (let w = 0; w < s; w++)
+        l = l.double();
+  }
+  return l;
+}
+function C(e) {
+  return M(e.Fp), O(e, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...z(e.n, e.nBitLength),
+    ...e,
+    p: e.Fp.ORDER
+  });
+}
+export {
+  U as pippenger,
+  C as validateBasic,
+  v as wNAF
+};

package/dist/index3.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("jwt-decode"),u=t=>t.startsWith("0x")?t:`0x${t}`,l=t=>`Bearer ${t}`,h=t=>new Promise(r=>setTimeout(r,t)),T=t=>{try{return c.jwtDecode(t)}catch{return}};var s=(t=>(t.MAINNET="mainnet",t.TESTNET="testnet",t))(s||{}),a=(t=>(t.MAINNET="mainnet",t.TESTNET="testnet",t.LOCALNET="localnet",t))(a||{});const d=t=>t.startsWith("0x")?t:`0x${t}`;function w(t,r="big"){if(t=t.replace("0x",""),t.length!==64)throw new Error("Invalid hash length");const n=[];for(let e=0;e<8;e++){const o=t.slice(e*8,(e+1)*8).match(/.{2}/g);r==="little"&&o.reverse();const i=o.join("");n.push(parseInt(i,16))}return n}exports.Authorization=l;exports.Environment=a;exports.Network=s;exports.add0x=d;exports.hexToU32Array=w;exports.parseJwt=T;exports.sleep=h;exports.with0x=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("jwt-decode"),u=t=>t.startsWith("0x")?t:`0x${t}`,l=t=>`Bearer ${t}`,h=t=>new Promise(r=>setTimeout(r,t)),T=t=>{try{return i.jwtDecode(t)}catch{return}};var s=(t=>(t.MAINNET="mainnet",t.TESTNET="testnet",t.LOCALNET="localnet",t))(s||{}),a=(t=>(t.MAINNET="mainnet",t.TESTNET="testnet",t.LOCALNET="localnet",t))(a||{});const d=t=>t.startsWith("0x")?t:`0x${t}`;function x(t,r="big"){if(t=t.replace("0x",""),t.length!==64)throw new Error("Invalid hash length");const n=[];for(let e=0;e<8;e++){const o=t.slice(e*8,(e+1)*8).match(/.{2}/g);r==="little"&&o.reverse();const c=o.join("");n.push(parseInt(c,16))}return n}exports.Authorization=l;exports.Environment=a;exports.Network=s;exports.add0x=d;exports.hexToU32Array=x;exports.parseJwt=T;exports.sleep=h;exports.with0x=u;

package/dist/index3.js

@@ -6,7 +6,7 @@ const h = (t) => t.startsWith("0x") ? t : `0x${t}`, T = (t) => `Bearer ${t}`, f
     return;
   }
 };
-var c = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t))(c || {}), i = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t.LOCALNET = "localnet", t))(i || {});
+var c = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t.LOCALNET = "localnet", t))(c || {}), i = /* @__PURE__ */ ((t) => (t.MAINNET = "mainnet", t.TESTNET = "testnet", t.LOCALNET = "localnet", t))(i || {});
 const x = (t) => t.startsWith("0x") ? t : `0x${t}`;
 function E(t, r = "big") {
   if (t = t.replace("0x", ""), t.length !== 64)

package/dist/index30.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index39.cjs"),c=require("./index40.cjs"),o=require("./index27.cjs");async function u(i){const{privateKey:r,transaction:e,serializer:n=c.serializeTransaction}=i,a=e.type==="eip4844"?{...e,sidecars:!1}:e,s=await o.sign({hash:t.keccak256(n(a)),privateKey:r});return n(e,s)}exports.signTransaction=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index176.cjs"),s=require("./index150.cjs"),q=require("./index239.cjs");async function b(r,a){const{address:u,abi:n,args:c,eventName:e,fromBlock:t,strict:l,toBlock:o}=a,d=q.createFilterRequestScope(r,{method:"eth_newFilter"}),p=e?m.encodeEventTopics({abi:n,args:c,eventName:e}):void 0,i=await r.request({method:"eth_newFilter",params:[{address:u,fromBlock:typeof t=="bigint"?s.numberToHex(t):t,toBlock:typeof o=="bigint"?s.numberToHex(o):o,topics:p}]});return{abi:n,args:c,eventName:e,id:i,request:d(i),strict:!!l,type:"event"}}exports.createContractEventFilter=b;

package/dist/index30.js

@@ -1,16 +1,34 @@
-import { keccak256 as e } from "./index39.js";
-import { serializeTransaction as o } from "./index40.js";
-import { sign as c } from "./index27.js";
-async function u(n) {
-  const { privateKey: a, transaction: r, serializer: i = o } = n, t = r.type === "eip4844" ? {
-    ...r,
-    sidecars: !1
-  } : r, s = await c({
-    hash: e(i(t)),
-    privateKey: a
+import { encodeEventTopics as l } from "./index176.js";
+import { numberToHex as s } from "./index150.js";
+import { createFilterRequestScope as u } from "./index239.js";
+async function h(r, a) {
+  const { address: m, abi: n, args: i, eventName: e, fromBlock: t, strict: p, toBlock: o } = a, f = u(r, {
+    method: "eth_newFilter"
+  }), d = e ? l({
+    abi: n,
+    args: i,
+    eventName: e
+  }) : void 0, c = await r.request({
+    method: "eth_newFilter",
+    params: [
+      {
+        address: m,
+        fromBlock: typeof t == "bigint" ? s(t) : t,
+        toBlock: typeof o == "bigint" ? s(o) : o,
+        topics: d
+      }
+    ]
   });
-  return i(r, s);
+  return {
+    abi: n,
+    args: i,
+    eventName: e,
+    id: c,
+    request: f(c),
+    strict: !!p,
+    type: "event"
+  };
 }
 export {
-  u as signTransaction
+  h as createContractEventFilter
 };

package/dist/index300.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index310.cjs");class c extends Error{constructor(r,e={}){const a=(()=>{var s;if(e.cause instanceof c){if(e.cause.details)return e.cause.details;if(e.cause.shortMessage)return e.cause.shortMessage}return e.cause&&"details"in e.cause&&typeof e.cause.details=="string"?e.cause.details:(s=e.cause)!=null&&s.message?e.cause.message:e.details})(),u=e.cause instanceof c&&e.cause.docsPath||e.docsPath,i=`https://oxlib.sh${u??""}`,d=[r||"An error occurred.",...e.metaMessages?["",...e.metaMessages]:[],...a||u?["",a?`Details: ${a}`:void 0,u?`See: ${i}`:void 0]:[]].filter(s=>typeof s=="string").join(`
+`);super(d,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}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"BaseError"}),Object.defineProperty(this,"version",{enumerable:!0,configurable:!0,writable:!0,value:`ox@${n.getVersion()}`}),this.cause=e.cause,this.details=a,this.docs=i,this.docsPath=u,this.shortMessage=r}walk(r){return l(this,r)}}function l(t,r){return r!=null&&r(t)?t:t&&typeof t=="object"&&"cause"in t&&t.cause?l(t.cause,r):r?null:t}exports.BaseError=c;

package/dist/index300.js

@@ -0,0 +1,69 @@
+import { getVersion as n } from "./index310.js";
+class c extends Error {
+  constructor(t, e = {}) {
+    const a = (() => {
+      var s;
+      if (e.cause instanceof c) {
+        if (e.cause.details)
+          return e.cause.details;
+        if (e.cause.shortMessage)
+          return e.cause.shortMessage;
+      }
+      return e.cause && "details" in e.cause && typeof e.cause.details == "string" ? e.cause.details : (s = e.cause) != null && s.message ? e.cause.message : e.details;
+    })(), u = e.cause instanceof c && e.cause.docsPath || e.docsPath, i = `https://oxlib.sh${u ?? ""}`, d = [
+      t || "An error occurred.",
+      ...e.metaMessages ? ["", ...e.metaMessages] : [],
+      ...a || u ? [
+        "",
+        a ? `Details: ${a}` : void 0,
+        u ? `See: ${i}` : void 0
+      ] : []
+    ].filter((s) => typeof s == "string").join(`
+`);
+    super(d, 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
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "BaseError"
+    }), Object.defineProperty(this, "version", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: `ox@${n()}`
+    }), this.cause = e.cause, this.details = a, this.docs = i, this.docsPath = u, this.shortMessage = t;
+  }
+  walk(t) {
+    return l(this, t);
+  }
+}
+function l(r, t) {
+  return t != null && t(r) ? r : r && typeof r == "object" && "cause" in r && r.cause ? l(r.cause, t) : t ? null : r;
+}
+export {
+  c as BaseError
+};

package/dist/index301.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n="#__bigint";function e(i,f,r){return JSON.stringify(i,(g,t)=>typeof t=="bigint"?t.toString()+n:t,r)}exports.stringify=e;

package/dist/index301.js

@@ -0,0 +1,7 @@
+const r = "#__bigint";
+function g(i, f, n) {
+  return JSON.stringify(i, (e, t) => typeof t == "bigint" ? t.toString() + r : t, n);
+}
+export {
+  g as stringify
+};

package/dist/index302.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index287.cjs");function n(t,e){if(i.size(t)>e)throw new i.SizeOverflowError({givenSize:i.size(t),maxSize:e})}function o(t,e){if(typeof e=="number"&&e>0&&e>i.size(t)-1)throw new i.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:i.size(t)})}function z(t,e,r){if(typeof e=="number"&&typeof r=="number"&&i.size(t)!==r-e)throw new i.SliceOffsetOutOfBoundsError({offset:r,position:"end",size:i.size(t)})}function a(t,e={}){const{dir:r,size:s=32}=e;if(s===0)return t;const f=t.replace("0x","");if(f.length>s*2)throw new i.SizeExceedsPaddingSizeError({size:Math.ceil(f.length/2),targetSize:s,type:"Hex"});return`0x${f[r==="right"?"padEnd":"padStart"](s*2,"0")}`}exports.assertEndOffset=z;exports.assertSize=n;exports.assertStartOffset=o;exports.pad=a;

package/dist/index302.js

@@ -0,0 +1,43 @@
+import { SizeExceedsPaddingSizeError as s, size as i, SliceOffsetOutOfBoundsError as f, SizeOverflowError as p } from "./index287.js";
+function c(t, e) {
+  if (i(t) > e)
+    throw new p({
+      givenSize: i(t),
+      maxSize: e
+    });
+}
+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 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 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")}`;
+}
+export {
+  d as assertEndOffset,
+  c as assertSize,
+  S as assertStartOffset,
+  u as pad
+};

package/dist/index303.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index225.cjs"),o=require("./index308.cjs"),n=require("./index287.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;

package/dist/index303.js

@@ -0,0 +1,10 @@
+import { keccak_256 as f } from "./index225.js";
+import { from as m } from "./index308.js";
+import { fromBytes as s } from "./index287.js";
+function p(t, o = {}) {
+  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
+  return e === "Bytes" ? r : s(r);
+}
+export {
+  p as keccak256
+};

package/dist/index304.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index305.cjs"),a=require("./index300.cjs");function d(r){let i=!0,t="",e=0,n="",o=!1;for(let s=0;s<r.length;s++){const u=r[s];if(["(",")",","].includes(u)&&(i=!0),u==="("&&e++,u===")"&&e--,!!i){if(e===0){if(u===" "&&["event","function","error",""].includes(n))n="";else if(n+=u,u===")"){o=!0;break}continue}if(u===" "){r[s-1]!==","&&t!==","&&t!==",("&&(t="",i=!1);continue}n+=u,t+=u}}if(!o)throw new a.BaseError("Unable to normalize signature.");return n}function l(r,i){const t=typeof r,e=i.type;switch(e){case"address":return c.validate(r,{strict:!1});case"bool":return t==="boolean";case"function":return t==="string";case"string":return t==="string";default:return e==="tuple"&&"components"in i?Object.values(i.components).every((n,o)=>l(Object.values(r)[o],n)):/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e)?t==="number"||t==="bigint":/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e)?t==="string"||r instanceof Uint8Array:/[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e)?Array.isArray(r)&&r.every(n=>l(n,{...i,type:e.replace(/(\[[0-9]{0,}\])$/,"")})):!1}}function f(r,i,t){for(const e in r){const n=r[e],o=i[e];if(n.type==="tuple"&&o.type==="tuple"&&"components"in n&&"components"in o)return f(n.components,o.components,t[e]);const s=[n.type,o.type];if(s.includes("address")&&s.includes("bytes20")?!0:s.includes("address")&&s.includes("string")?c.validate(t[e],{strict:!1}):s.includes("address")&&s.includes("bytes")?c.validate(t[e],{strict:!1}):!1)return s}}exports.getAmbiguousTypes=f;exports.isArgOfType=l;exports.normalizeSignature=d;