@gardenfi/utils 2.1.2-beta.1 → 2.1.2-beta.10

package/dist/index92.js

@@ -1,72 +1,12 @@
-import { crypto as o } from "./index95.js";
-import { abytes as i } from "./index91.js";
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function g(t) {
-  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-}
-function m(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function w(t, e) {
-  return t << 32 - e | t >>> e;
-}
-const b = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function c(t) {
-  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-}
-function a(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = c(t[e]);
-}
-function s(t) {
-  if (typeof t != "string")
-    throw new Error("utf8ToBytes expected string, got " + typeof t);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function y(t) {
-  return typeof t == "string" && (t = s(t)), i(t), t;
-}
-function x(...t) {
-  let e = 0;
-  for (let n = 0; n < t.length; n++) {
-    const r = t[n];
-    i(r), e += r.length;
-  }
-  const f = new Uint8Array(e);
-  for (let n = 0, r = 0; n < t.length; n++) {
-    const u = t[n];
-    f.set(u, r), r += u.length;
-  }
-  return f;
-}
-class h {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
-  }
-}
-function B(t) {
-  const e = (n) => t().update(y(n)).digest(), f = t();
-  return e.outputLen = f.outputLen, e.blockLen = f.blockLen, e.create = () => t(), e;
-}
-function d(t = 32) {
-  if (o && typeof o.getRandomValues == "function")
-    return o.getRandomValues(new Uint8Array(t));
-  if (o && typeof o.randomBytes == "function")
-    return o.randomBytes(t);
-  throw new Error("crypto.getRandomValues must be defined");
+import { numberToHex as u } from "./index30.js";
+async function i(o, { address: d, blockNumber: e, blockTag: r = "latest" }) {
+  const n = e !== void 0 ? u(e) : void 0, t = await o.request({
+    method: "eth_getCode",
+    params: [d, n || r]
+  }, { dedupe: !!n });
+  if (t !== "0x")
+    return t;
 }
 export {
-  h as Hash,
-  c as byteSwap,
-  a as byteSwap32,
-  x as concatBytes,
-  m as createView,
-  b as isLE,
-  d as randomBytes,
-  w as rotr,
-  y as toBytes,
-  g as u32,
-  s as utf8ToBytes,
-  B as wrapConstructor
+  i as getCode
 };

package/dist/index93.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index94.cjs"),s=require("./index92.cjs"),S=new Uint32Array([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]),b=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),f=new Uint32Array(64);class g extends H.HashMD{constructor(){super(64,32,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:d,B:o,C:x,D:e,E:a,F:i,G:c,H:r}=this;return[d,o,x,e,a,i,c,r]}set(d,o,x,e,a,i,c,r){this.A=d|0,this.B=o|0,this.C=x|0,this.D=e|0,this.E=a|0,this.F=i|0,this.G=c|0,this.H=r|0}process(d,o){for(let t=0;t<16;t++,o+=4)f[t]=d.getUint32(o,!1);for(let t=16;t<64;t++){const A=f[t-15],n=f[t-2],C=s.rotr(A,7)^s.rotr(A,18)^A>>>3,u=s.rotr(n,17)^s.rotr(n,19)^n>>>10;f[t]=u+f[t-7]+C+f[t-16]|0}let{A:x,B:e,C:a,D:i,E:c,F:r,G:h,H:l}=this;for(let t=0;t<64;t++){const A=s.rotr(c,6)^s.rotr(c,11)^s.rotr(c,25),n=l+A+H.Chi(c,r,h)+S[t]+f[t]|0,u=(s.rotr(x,2)^s.rotr(x,13)^s.rotr(x,22))+H.Maj(x,e,a)|0;l=h,h=r,r=c,c=i+n|0,i=a,a=e,e=x,x=n+u|0}x=x+this.A|0,e=e+this.B|0,a=a+this.C|0,i=i+this.D|0,c=c+this.E|0,r=r+this.F|0,h=h+this.G|0,l=l+this.H|0,this.set(x,e,a,i,c,r,h,l)}roundClean(){f.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const y=s.wrapConstructor(()=>new g);exports.SHA256=g;exports.sha256=y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("./index94.cjs"),b=require("./index43.cjs"),f=require("./index95.cjs");async function m(o,s){const{abi:e,address:r,args:c,blockHash:i,eventName:t,fromBlock:g,toBlock:a,strict:u}=s,n=t?v.getAbiItem({abi:e,name:t}):void 0,d=n?void 0:e.filter(l=>l.type==="event");return b.getAction(o,f.getLogs,"getLogs")({address:r,args:c,blockHash:i,event:n,events:d,fromBlock:g,toBlock:a,strict:u})}exports.getContractEvents=m;

package/dist/index93.js

@@ -1,115 +1,19 @@
-import { HashMD as m, Chi as p, Maj as u } from "./index94.js";
-import { wrapConstructor as D, rotr as i } from "./index92.js";
-const g = /* @__PURE__ */ new Uint32Array([
-  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
-]), b = /* @__PURE__ */ new Uint32Array([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]), h = /* @__PURE__ */ new Uint32Array(64);
-class w extends m {
-  constructor() {
-    super(64, 32, 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: d, B: o, C: t, D: s, E: a, F: f, G: c, H: e } = this;
-    return [d, o, t, s, a, f, c, e];
-  }
-  // prettier-ignore
-  set(d, o, t, s, a, f, c, e) {
-    this.A = d | 0, this.B = o | 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(d, o) {
-    for (let x = 0; x < 16; x++, o += 4)
-      h[x] = d.getUint32(o, !1);
-    for (let x = 16; x < 64; x++) {
-      const A = h[x - 15], n = h[x - 2], C = i(A, 7) ^ i(A, 18) ^ A >>> 3, H = i(n, 17) ^ i(n, 19) ^ n >>> 10;
-      h[x] = H + h[x - 7] + C + h[x - 16] | 0;
-    }
-    let { A: t, B: s, C: a, D: f, E: c, F: e, G: r, H: l } = this;
-    for (let x = 0; x < 64; x++) {
-      const A = i(c, 6) ^ i(c, 11) ^ i(c, 25), n = l + A + p(c, e, r) + g[x] + h[x] | 0, H = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + u(t, s, a) | 0;
-      l = r, r = e, e = c, c = f + n | 0, f = a, a = s, s = t, t = n + H | 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, r = r + this.G | 0, l = l + this.H | 0, this.set(t, s, a, f, c, e, r, l);
-  }
-  roundClean() {
-    h.fill(0);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
-  }
+import { getAbiItem as p } from "./index94.js";
+import { getAction as v } from "./index43.js";
+import { getLogs as l } from "./index95.js";
+async function y(n, r) {
+  const { abi: t, address: s, args: c, blockHash: i, eventName: e, fromBlock: m, toBlock: a, strict: f } = r, o = e ? p({ abi: t, name: e }) : void 0, g = o ? void 0 : t.filter((d) => d.type === "event");
+  return v(n, l, "getLogs")({
+    address: s,
+    args: c,
+    blockHash: i,
+    event: o,
+    events: g,
+    fromBlock: m,
+    toBlock: a,
+    strict: f
+  });
 }
-const G = /* @__PURE__ */ D(() => new w());
 export {
-  w as SHA256,
-  G as sha256
+  y as getContractEvents
 };

package/dist/index94.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index91.cjs"),c=require("./index92.cjs");function a(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function d(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class w extends c.Hash{constructor(t,s,i,n){super(),this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=c.createView(this.buffer)}update(t){p.aexists(this);const{view:s,buffer:i,blockLen:n}=this;t=c.toBytes(t);const r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=c.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){p.aexists(this),p.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,this.buffer.subarray(e).fill(0),this.padOffset>n-e&&(this.process(i,0),e=0);for(let f=e;f<n;f++)s[f]=0;a(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=c.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let f=0;f<l;f++)h.setUint32(4*f,g[f],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.length=n,t.pos=h,t.finished=r,t.destroyed=e,n%s&&t.buffer.set(i),t}}exports.Chi=d;exports.HashMD=w;exports.Maj=b;exports.setBigUint64=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index112.cjs"),g=require("./index166.cjs"),p=require("./index222.cjs"),m=require("./index219.cjs"),b=require("./index218.cjs");function A(s){const{abi:o,args:n=[],name:t}=s,u=g.isHex(t,{strict:!1}),i=o.filter(e=>u?e.type==="function"?b.toFunctionSelector(e)===t:e.type==="event"?m.toEventSelector(e)===t:!1:"name"in e&&e.name===t);if(i.length===0)return;if(i.length===1)return i[0];let r;for(const e of i){if(!("inputs"in e))continue;if(!n||n.length===0){if(!e.inputs||e.inputs.length===0)return e;continue}if(!e.inputs||e.inputs.length===0||e.inputs.length!==n.length)continue;if(n.every((c,d)=>{const a="inputs"in e&&e.inputs[d];return a?f(c,a):!1})){if(r&&"inputs"in r&&r.inputs){const c=l(e.inputs,r.inputs,n);if(c)throw new y.AbiItemAmbiguityError({abiItem:e,type:c[0]},{abiItem:r,type:c[1]})}r=e}}return r||i[0]}function f(s,o){const n=typeof s,t=o.type;switch(t){case"address":return p.isAddress(s,{strict:!1});case"bool":return n==="boolean";case"function":return n==="string";case"string":return n==="string";default:return t==="tuple"&&"components"in o?Object.values(o.components).every((u,i)=>f(Object.values(s)[i],u)):/^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(t)?n==="number"||n==="bigint":/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(t)?n==="string"||s instanceof Uint8Array:/[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(t)?Array.isArray(s)&&s.every(u=>f(u,{...o,type:t.replace(/(\[[0-9]{0,}\])$/,"")})):!1}}function l(s,o,n){for(const t in s){const u=s[t],i=o[t];if(u.type==="tuple"&&i.type==="tuple"&&"components"in u&&"components"in i)return l(u.components,i.components,n[t]);const r=[u.type,i.type];if(r.includes("address")&&r.includes("bytes20")?!0:r.includes("address")&&r.includes("string")?p.isAddress(n[t],{strict:!1}):r.includes("address")&&r.includes("bytes")?p.isAddress(n[t],{strict:!1}):!1)return r}}exports.getAbiItem=A;exports.getAmbiguousTypes=l;exports.isArgOfType=f;

package/dist/index94.js

@@ -1,70 +1,76 @@
-import { aexists as g, aoutput as d } from "./index91.js";
-import { Hash as b, createView as p, toBytes as a } from "./index92.js";
-function w(o, t, s, i) {
-  if (typeof o.setBigUint64 == "function")
-    return o.setBigUint64(t, s, i);
-  const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), u = i ? 4 : 0, c = i ? 0 : 4;
-  o.setUint32(t + u, e, i), o.setUint32(t + c, r, i);
-}
-function B(o, t, s) {
-  return o & t ^ ~o & s;
-}
-function L(o, t, s) {
-  return o & t ^ o & s ^ t & s;
-}
-class U extends b {
-  constructor(t, s, i, n) {
-    super(), this.blockLen = t, this.outputLen = s, this.padOffset = i, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
-  }
-  update(t) {
-    g(this);
-    const { view: s, buffer: i, blockLen: n } = this;
-    t = a(t);
-    const h = t.length;
-    for (let e = 0; e < h; ) {
-      const r = Math.min(n - this.pos, h - e);
-      if (r === n) {
-        const u = p(t);
-        for (; n <= h - e; e += n)
-          this.process(u, e);
-        continue;
+import { AbiItemAmbiguityError as y } from "./index112.js";
+import { isHex as d } from "./index166.js";
+import { isAddress as f } from "./index222.js";
+import { toEventSelector as g } from "./index219.js";
+import { toFunctionSelector as b } from "./index218.js";
+function x(s) {
+  const { abi: o, args: n = [], name: e } = s, u = d(e, { strict: !1 }), i = o.filter((t) => u ? t.type === "function" ? b(t) === e : t.type === "event" ? g(t) === e : !1 : "name" in t && t.name === e);
+  if (i.length === 0)
+    return;
+  if (i.length === 1)
+    return i[0];
+  let r;
+  for (const t of i) {
+    if (!("inputs" in t))
+      continue;
+    if (!n || n.length === 0) {
+      if (!t.inputs || t.inputs.length === 0)
+        return t;
+      continue;
+    }
+    if (!t.inputs || t.inputs.length === 0 || t.inputs.length !== n.length)
+      continue;
+    if (n.every((c, m) => {
+      const l = "inputs" in t && t.inputs[m];
+      return l ? p(c, l) : !1;
+    })) {
+      if (r && "inputs" in r && r.inputs) {
+        const c = a(t.inputs, r.inputs, n);
+        if (c)
+          throw new y({
+            abiItem: t,
+            type: c[0]
+          }, {
+            abiItem: r,
+            type: c[1]
+          });
       }
-      i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
+      r = t;
     }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    g(this), d(t, this), this.finished = !0;
-    const { buffer: s, view: i, blockLen: n, isLE: h } = this;
-    let { pos: e } = this;
-    s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
-    for (let f = e; f < n; f++)
-      s[f] = 0;
-    w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
-    const r = p(t), u = this.outputLen;
-    if (u % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const c = u / 4, l = this.get();
-    if (c > l.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let f = 0; f < c; f++)
-      r.setUint32(4 * f, l[f], h);
   }
-  digest() {
-    const { buffer: t, outputLen: s } = this;
-    this.digestInto(t);
-    const i = t.slice(0, s);
-    return this.destroy(), i;
+  return r || i[0];
+}
+function p(s, o) {
+  const n = typeof s, e = o.type;
+  switch (e) {
+    case "address":
+      return f(s, { strict: !1 });
+    case "bool":
+      return n === "boolean";
+    case "function":
+      return n === "string";
+    case "string":
+      return n === "string";
+    default:
+      return e === "tuple" && "components" in o ? Object.values(o.components).every((u, i) => p(Object.values(s)[i], u)) : /^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) ? n === "number" || n === "bigint" : /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e) ? n === "string" || s instanceof Uint8Array : /[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e) ? Array.isArray(s) && s.every((u) => p(u, {
+        ...o,
+        // Pop off `[]` or `[M]` from end of type
+        type: e.replace(/(\[[0-9]{0,}\])$/, "")
+      })) : !1;
   }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
-    return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
+}
+function a(s, o, n) {
+  for (const e in s) {
+    const u = s[e], i = o[e];
+    if (u.type === "tuple" && i.type === "tuple" && "components" in u && "components" in i)
+      return a(u.components, i.components, n[e]);
+    const r = [u.type, i.type];
+    if (r.includes("address") && r.includes("bytes20") ? !0 : r.includes("address") && r.includes("string") ? f(n[e], { strict: !1 }) : r.includes("address") && r.includes("bytes") ? f(n[e], { strict: !1 }) : !1)
+      return r;
   }
 }
 export {
-  B as Chi,
-  U as HashMD,
-  L as Maj,
-  w as setBigUint64
+  x as getAbiItem,
+  a as getAmbiguousTypes,
+  p as isArgOfType
 };

package/dist/index95.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index69.cjs"),q=require("./index101.cjs"),m=require("./index30.cjs"),y=require("./index102.cjs");async function T(i,{address:a,blockHash:g,fromBlock:o,toBlock:s,event:n,events:c,args:u,strict:L}={}){const b=L??!1,t=c??(n?[n]:void 0);let e=[];t&&(e=[t.flatMap(p=>l.encodeEventTopics({abi:[p],eventName:p.name,args:c?void 0:u}))],n&&(e=e[0]));let r;g?r=await i.request({method:"eth_getLogs",params:[{address:a,topics:e,blockHash:g}]}):r=await i.request({method:"eth_getLogs",params:[{address:a,topics:e,fromBlock:typeof o=="bigint"?m.numberToHex(o):o,toBlock:typeof s=="bigint"?m.numberToHex(s):s}]});const d=r.map(f=>y.formatLog(f));return t?q.parseEventLogs({abi:t,args:u,logs:d,strict:b}):d}exports.getLogs=T;

package/dist/index95.js

@@ -1,4 +1,38 @@
-const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+import { encodeEventTopics as h } from "./index69.js";
+import { parseEventLogs as l } from "./index101.js";
+import { numberToHex as u } from "./index30.js";
+import { formatLog as y } from "./index102.js";
+async function T(n, { address: a, blockHash: m, fromBlock: o, toBlock: i, event: r, events: f, args: g, strict: L } = {}) {
+  const b = L ?? !1, e = f ?? (r ? [r] : void 0);
+  let t = [];
+  e && (t = [e.flatMap((c) => h({
+    abi: [c],
+    eventName: c.name,
+    args: f ? void 0 : g
+  }))], r && (t = t[0]));
+  let s;
+  m ? s = await n.request({
+    method: "eth_getLogs",
+    params: [{ address: a, topics: t, blockHash: m }]
+  }) : s = await n.request({
+    method: "eth_getLogs",
+    params: [
+      {
+        address: a,
+        topics: t,
+        fromBlock: typeof o == "bigint" ? u(o) : o,
+        toBlock: typeof i == "bigint" ? u(i) : i
+      }
+    ]
+  });
+  const p = s.map((d) => y(d));
+  return e ? l({
+    abi: e,
+    args: g,
+    logs: p,
+    strict: b
+  }) : p;
+}
 export {
-  o as crypto
+  T as getLogs
 };

package/dist/index96.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index90.cjs"),s=require("./index92.cjs"),o=require("./index117.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,s.concatBytes(...t)),randomBytes:s.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...c(n)});return{...t(r),create:t}}exports.createCurve=u;exports.getHash=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index97.cjs"),d=require("./index43.cjs"),f=require("./index44.cjs");async function g(a,i){const{address:n,factory:r,factoryData:o}=i;try{const[e,t,c,s,u,m,y]=await d.getAction(a,f.readContract,"readContract")({abi:l,address:n,functionName:"eip712Domain",factory:r,factoryData:o});return{domain:{name:t,version:c,chainId:Number(s),verifyingContract:u,salt:m},extensions:y,fields:e}}catch(e){const t=e;throw t.name==="ContractFunctionExecutionError"&&t.cause.name==="ContractFunctionZeroDataError"?new p.Eip712DomainNotFoundError({address:n}):t}}const l=[{inputs:[],name:"eip712Domain",outputs:[{name:"fields",type:"bytes1"},{name:"name",type:"string"},{name:"version",type:"string"},{name:"chainId",type:"uint256"},{name:"verifyingContract",type:"address"},{name:"salt",type:"bytes32"},{name:"extensions",type:"uint256[]"}],stateMutability:"view",type:"function"}];exports.getEip712Domain=g;

package/dist/index96.js

@@ -1,19 +1,49 @@
-import { hmac as c } from "./index90.js";
-import { randomBytes as m, concatBytes as n } from "./index92.js";
-import { weierstrass as a } from "./index117.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function i(r) {
-  return {
-    hash: r,
-    hmac: (e, ...t) => c(r, e, n(...t)),
-    randomBytes: m
-  };
-}
-function p(r, e) {
-  const t = (o) => a({ ...r, ...i(o) });
-  return { ...t(e), create: t };
+import { Eip712DomainNotFoundError as u } from "./index97.js";
+import { getAction as d } from "./index43.js";
+import { readContract as f } from "./index44.js";
+async function E(a, o) {
+  const { address: e, factory: r, factoryData: i } = o;
+  try {
+    const [n, t, s, c, m, p, y] = await d(a, f, "readContract")({
+      abi: g,
+      address: e,
+      functionName: "eip712Domain",
+      factory: r,
+      factoryData: i
+    });
+    return {
+      domain: {
+        name: t,
+        version: s,
+        chainId: Number(c),
+        verifyingContract: m,
+        salt: p
+      },
+      extensions: y,
+      fields: n
+    };
+  } catch (n) {
+    const t = n;
+    throw t.name === "ContractFunctionExecutionError" && t.cause.name === "ContractFunctionZeroDataError" ? new u({ address: e }) : t;
+  }
 }
+const g = [
+  {
+    inputs: [],
+    name: "eip712Domain",
+    outputs: [
+      { name: "fields", type: "bytes1" },
+      { name: "name", type: "string" },
+      { name: "version", type: "string" },
+      { name: "chainId", type: "uint256" },
+      { name: "verifyingContract", type: "address" },
+      { name: "salt", type: "bytes32" },
+      { name: "extensions", type: "uint256[]" }
+    ],
+    stateMutability: "view",
+    type: "function"
+  }
+];
 export {
-  p as createCurve,
-  i as getHash
+  E as getEip712Domain
 };

package/dist/index97.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index98.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),c=BigInt(1),w=BigInt(2),j=BigInt(3),E=BigInt(4),S=BigInt(5),I=BigInt(8);function g(t,i){const r=t%i;return r>=d?r:i+r}function L(t,i,r){if(i<d)throw new Error("invalid exponent, negatives unsupported");if(r<=d)throw new Error("invalid modulus");if(r===c)return d;let n=c;for(;i>d;)i&c&&(n=n*t%r),t=t*t%r,i>>=c;return n}function H(t,i,r){let n=t;for(;i-- >d;)n*=n,n%=r;return n}function m(t,i){if(t===d)throw new Error("invert: expected non-zero number");if(i<=d)throw new Error("invert: expected positive modulus, got "+i);let r=g(t,i),n=i,s=d,u=c;for(;r!==d;){const o=n/r,e=n%r,l=s-u*o;n=r,r=e,s=u,u=l}if(n!==c)throw new Error("invert: does not exist");return g(s,i)}function T(t){const i=(t-c)/w;let r,n,s;for(r=t-c,n=0;r%w===d;r/=w,n++);for(s=w;s<t&&L(s,i,t)!==t-c;s++)if(s>1e3)throw new Error("Cannot find square root: likely non-prime P");if(n===1){const f=(t+c)/E;return function(e,l){const h=e.pow(l,f);if(!e.eql(e.sqr(h),l))throw new Error("Cannot find square root");return h}}const u=(r+c)/w;return function(o,e){if(o.pow(e,i)===o.neg(o.ONE))throw new Error("Cannot find square root");let l=n,h=o.pow(o.mul(o.ONE,s),r),v=o.pow(e,u),q=o.pow(e,r);for(;!o.eql(q,o.ONE);){if(o.eql(q,o.ZERO))return o.ZERO;let b=1;for(let B=o.sqr(q);b<l&&!o.eql(B,o.ONE);b++)B=o.sqr(B);const y=o.pow(h,c<<BigInt(l-b-1));h=o.sqr(y),v=o.mul(v,y),q=o.mul(q,h),l=b}return v}}function x(t){if(t%E===j){const i=(t+c)/E;return function(n,s){const u=n.pow(s,i);if(!n.eql(n.sqr(u),s))throw new Error("Cannot find square root");return u}}if(t%I===S){const i=(t-S)/I;return function(n,s){const u=n.mul(s,w),f=n.pow(u,i),o=n.mul(s,f),e=n.mul(n.mul(o,w),f),l=n.mul(o,n.sub(e,n.ONE));if(!n.eql(n.sqr(l),s))throw new Error("Cannot find square root");return l}}return T(t)}const Z=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const i={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},r=Z.reduce((n,s)=>(n[s]="function",n),i);return a.validateObject(t,r)}function M(t,i,r){if(r<d)throw new Error("invalid exponent, negatives unsupported");if(r===d)return t.ONE;if(r===c)return i;let n=t.ONE,s=i;for(;r>d;)r&c&&(n=t.mul(n,s)),s=t.sqr(s),r>>=c;return n}function _(t,i){const r=new Array(i.length),n=i.reduce((u,f,o)=>t.is0(f)?u:(r[o]=u,t.mul(u,f)),t.ONE),s=t.inv(n);return i.reduceRight((u,f,o)=>t.is0(f)?u:(r[o]=t.mul(u,r[o]),t.mul(u,f)),s),r}function p(t,i){const r=i!==void 0?i:t.toString(2).length,n=Math.ceil(r/8);return{nBitLength:r,nByteLength:n}}function z(t,i,r=!1,n={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:u}=p(t,i);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let f;const o=Object.freeze({ORDER:t,isLE:r,BITS:s,BYTES:u,MASK:a.bitMask(s),ZERO:d,ONE:c,create:e=>g(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&c)===c,neg:e=>g(-e,t),eql:(e,l)=>e===l,sqr:e=>g(e*e,t),add:(e,l)=>g(e+l,t),sub:(e,l)=>g(e-l,t),mul:(e,l)=>g(e*l,t),pow:(e,l)=>M(o,e,l),div:(e,l)=>g(e*m(l,t),t),sqrN:e=>e*e,addN:(e,l)=>e+l,subN:(e,l)=>e-l,mulN:(e,l)=>e*l,inv:e=>m(e,t),sqrt:n.sqrt||(e=>(f||(f=x(t)),f(o,e))),invertBatch:e=>_(o,e),cmov:(e,l,h)=>h?l:e,toBytes:e=>r?a.numberToBytesLE(e,u):a.numberToBytesBE(e,u),fromBytes:e=>{if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);return r?a.bytesToNumberLE(e):a.bytesToNumberBE(e)}});return Object.freeze(o)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const i=t.toString(2).length;return Math.ceil(i/8)}function C(t){const i=N(t);return i+Math.ceil(i/2)}function A(t,i,r=!1){const n=t.length,s=N(i),u=C(i);if(n<16||n<u||n>1024)throw new Error("expected "+u+"-1024 bytes of input, got "+n);const f=r?a.bytesToNumberLE(t):a.bytesToNumberBE(t),o=g(f,i-c)+c;return r?a.numberToBytesLE(o,s):a.numberToBytesBE(o,s)}exports.Field=z;exports.FpInvertBatch=_;exports.FpPow=M;exports.FpSqrt=x;exports.getFieldBytesLength=N;exports.getMinHashLength=C;exports.invert=m;exports.mapHashToField=A;exports.mod=g;exports.nLength=p;exports.pow=L;exports.pow2=H;exports.tonelliShanks=T;exports.validateField=k;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index55.cjs");class e extends t.BaseError{constructor({address:o}){super(`No EIP-712 domain found on contract "${o}".`,{metaMessages:["Ensure that:",`- The contract is deployed at the address "${o}".`,"- `eip712Domain()` function exists on the contract.","- `eip712Domain()` function matches signature to ERC-5267 specification."],name:"Eip712DomainNotFoundError"})}}exports.Eip712DomainNotFoundError=e;