@gardenfi/utils 2.1.2-beta.9 → 2.1.3-beta.1

package/dist/index307.js

@@ -0,0 +1,197 @@
+import { InvalidTypeError as g, InvalidArrayError as b, ArrayLengthMismatchError as w, BytesSizeMismatchError as z } from "./index291.js";
+import { assert as x } from "./index305.js";
+import { BaseError as S } from "./index300.js";
+import { size as d, fromNumber as f, concat as p, padLeft as h, fromBoolean as A, IntegerOutOfRangeError as E, padRight as y, fromString as I, slice as B } from "./index288.js";
+import { integerRegex as L } from "./index306.js";
+function q({ checksumAddress: e, parameters: n, values: r }) {
+  const t = [];
+  for (let o = 0; o < n.length; o++)
+    t.push(u({
+      checksumAddress: e,
+      parameter: n[o],
+      value: r[o]
+    }));
+  return t;
+}
+function u({ checksumAddress: e = !1, parameter: n, value: r }) {
+  const t = n, o = k(t.type);
+  if (o) {
+    const [i, c] = o;
+    return P(r, {
+      checksumAddress: e,
+      length: i,
+      parameter: {
+        ...t,
+        type: c
+      }
+    });
+  }
+  if (t.type === "tuple")
+    return R(r, {
+      checksumAddress: e,
+      parameter: t
+    });
+  if (t.type === "address")
+    return N(r, {
+      checksum: e
+    });
+  if (t.type === "bool")
+    return C(r);
+  if (t.type.startsWith("uint") || t.type.startsWith("int")) {
+    const i = t.type.startsWith("int"), [, , c = "256"] = L.exec(t.type) ?? [];
+    return M(r, {
+      signed: i,
+      size: Number(c)
+    });
+  }
+  if (t.type.startsWith("bytes"))
+    return $(r, { type: t.type });
+  if (t.type === "string")
+    return W(r);
+  throw new g(t.type);
+}
+function l(e) {
+  let n = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? n += 32 : n += d(s);
+  }
+  const r = [], t = [];
+  let o = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? (r.push(f(n + o, { size: 32 })), t.push(s), o += d(s)) : r.push(s);
+  }
+  return p(...r, ...t);
+}
+function N(e, n) {
+  const { checksum: r = !1 } = n;
+  return x(e, { strict: r }), {
+    dynamic: !1,
+    encoded: h(e.toLowerCase())
+  };
+}
+function P(e, n) {
+  const { checksumAddress: r, length: t, parameter: o } = n, i = t === null;
+  if (!Array.isArray(e))
+    throw new b(e);
+  if (!i && e.length !== t)
+    throw new w({
+      expectedLength: t,
+      givenLength: e.length,
+      type: `${o.type}[${t}]`
+    });
+  let c = !1;
+  const s = [];
+  for (let a = 0; a < e.length; a++) {
+    const m = u({
+      checksumAddress: r,
+      parameter: o,
+      value: e[a]
+    });
+    m.dynamic && (c = !0), s.push(m);
+  }
+  if (i || c) {
+    const a = l(s);
+    if (i) {
+      const m = f(s.length, { size: 32 });
+      return {
+        dynamic: !0,
+        encoded: s.length > 0 ? p(m, a) : m
+      };
+    }
+    if (c)
+      return { dynamic: !0, encoded: a };
+  }
+  return {
+    dynamic: !1,
+    encoded: p(...s.map(({ encoded: a }) => a))
+  };
+}
+function $(e, { type: n }) {
+  const [, r] = n.split("bytes"), t = d(e);
+  if (!r) {
+    let o = e;
+    return t % 32 !== 0 && (o = y(o, Math.ceil((e.length - 2) / 2 / 32) * 32)), {
+      dynamic: !0,
+      encoded: p(h(f(t, { size: 32 })), o)
+    };
+  }
+  if (t !== Number.parseInt(r))
+    throw new z({
+      expectedSize: Number.parseInt(r),
+      value: e
+    });
+  return { dynamic: !1, encoded: y(e) };
+}
+function C(e) {
+  if (typeof e != "boolean")
+    throw new S(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
+  return { dynamic: !1, encoded: h(A(e)) };
+}
+function M(e, { signed: n, size: r }) {
+  if (typeof r == "number") {
+    const t = 2n ** (BigInt(r) - (n ? 1n : 0n)) - 1n, o = n ? -t - 1n : 0n;
+    if (e > t || e < o)
+      throw new E({
+        max: t.toString(),
+        min: o.toString(),
+        signed: n,
+        size: r / 8,
+        value: e.toString()
+      });
+  }
+  return {
+    dynamic: !1,
+    encoded: f(e, {
+      size: 32,
+      signed: n
+    })
+  };
+}
+function W(e) {
+  const n = I(e), r = Math.ceil(d(n) / 32), t = [];
+  for (let o = 0; o < r; o++)
+    t.push(y(B(n, o * 32, (o + 1) * 32)));
+  return {
+    dynamic: !0,
+    encoded: p(y(f(d(n), { size: 32 })), ...t)
+  };
+}
+function R(e, n) {
+  const { checksumAddress: r, parameter: t } = n;
+  let o = !1;
+  const i = [];
+  for (let c = 0; c < t.components.length; c++) {
+    const s = t.components[c], a = Array.isArray(e) ? c : s.name, m = u({
+      checksumAddress: r,
+      parameter: s,
+      value: e[a]
+    });
+    i.push(m), m.dynamic && (o = !0);
+  }
+  return {
+    dynamic: o,
+    encoded: o ? l(i) : p(...i.map(({ encoded: c }) => c))
+  };
+}
+function k(e) {
+  const n = e.match(/^(.*)\[(\d+)?\]$/);
+  return n ? (
+    // Return `null` if the array is dynamic.
+    [n[2] ? Number(n[2]) : null, n[1]]
+  ) : void 0;
+}
+export {
+  l as encode,
+  N as encodeAddress,
+  P as encodeArray,
+  C as encodeBoolean,
+  $ as encodeBytes,
+  M as encodeNumber,
+  W as encodeString,
+  R as encodeTuple,
+  k as getArrayComponents,
+  u as prepareParameter,
+  q as prepareParameters
+};

package/dist/index308.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index300.cjs"),y=require("./index288.cjs"),s=require("./index309.cjs"),z=require("./index302.cjs"),S=new TextEncoder;function x(e){return e instanceof Uint8Array?e:typeof e=="string"?h(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function h(e,t={}){const{size:r}=t;let n=e;r&&(z.assertSize(e,r),n=y.padRight(e,r));let i=n.slice(2);i.length%2&&(i=`0${i}`);const d=i.length/2,f=new Uint8Array(d);for(let c=0,o=0;c<d;c++){const u=s.charCodeToBase16(i.charCodeAt(o++)),b=s.charCodeToBase16(i.charCodeAt(o++));if(u===void 0||b===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[o-2]}${i[o-1]}" in "${i}").`);f[c]=u*16+b}return f}function m(e,t={}){const{size:r}=t,n=S.encode(e);return typeof r=="number"?(s.assertSize(n,r),l(n,r)):n}function l(e,t){return s.pad(e,{dir:"right",size:t})}function E(e){return e.length}class p extends a.BaseError{constructor({givenSize:t,maxSize:r}){super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class $ extends a.BaseError{constructor({size:t,targetSize:r,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=$;exports.SizeOverflowError=p;exports.from=x;exports.fromArray=g;exports.fromHex=h;exports.fromString=m;exports.padRight=l;exports.size=E;

package/dist/index308.js

@@ -0,0 +1,66 @@
+import { BaseError as c } from "./index300.js";
+import { padRight as h } from "./index288.js";
+import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index309.js";
+import { assertSize as p } from "./index302.js";
+const l = /* @__PURE__ */ new TextEncoder();
+function E(e) {
+  return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
+}
+function z(e) {
+  return e instanceof Uint8Array ? e : new Uint8Array(e);
+}
+function y(e, t = {}) {
+  const { size: r } = t;
+  let n = e;
+  r && (p(e, r), n = h(e, r));
+  let i = n.slice(2);
+  i.length % 2 && (i = `0${i}`);
+  const f = i.length / 2, a = new Uint8Array(f);
+  for (let s = 0, o = 0; s < f; s++) {
+    const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
+    if (d === void 0 || u === void 0)
+      throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
+    a[s] = d * 16 + u;
+  }
+  return a;
+}
+function C(e, t = {}) {
+  const { size: r } = t, n = l.encode(e);
+  return typeof r == "number" ? (g(n, r), x(n, r)) : n;
+}
+function x(e, t) {
+  return m(e, { dir: "right", size: t });
+}
+function U(e) {
+  return e.length;
+}
+class B extends c {
+  constructor({ givenSize: t, maxSize: r }) {
+    super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Bytes.SizeOverflowError"
+    });
+  }
+}
+class O extends c {
+  constructor({ size: t, targetSize: r, type: n }) {
+    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Bytes.SizeExceedsPaddingSizeError"
+    });
+  }
+}
+export {
+  O as SizeExceedsPaddingSizeError,
+  B as SizeOverflowError,
+  E as from,
+  z as fromArray,
+  y as fromHex,
+  C as fromString,
+  x as padRight,
+  U as size
+};

package/dist/index309.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index308.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;

package/dist/index309.js

@@ -0,0 +1,47 @@
+import { size as d, SizeOverflowError as u, SizeExceedsPaddingSizeError as a } from "./index308.js";
+function p(e, t) {
+  if (d(e) > t)
+    throw new u({
+      givenSize: d(e),
+      maxSize: t
+    });
+}
+const n = {
+  zero: 48,
+  nine: 57,
+  A: 65,
+  F: 70,
+  a: 97,
+  f: 102
+};
+function s(e) {
+  if (e >= n.zero && e <= n.nine)
+    return e - n.zero;
+  if (e >= n.A && e <= n.F)
+    return e - (n.A - 10);
+  if (e >= n.a && e <= n.f)
+    return e - (n.a - 10);
+}
+function S(e, t = {}) {
+  const { dir: z, size: i = 32 } = t;
+  if (i === 0)
+    return e;
+  if (e.length > i)
+    throw new a({
+      size: e.length,
+      targetSize: i,
+      type: "Bytes"
+    });
+  const o = new Uint8Array(i);
+  for (let r = 0; r < i; r++) {
+    const f = z === "right";
+    o[f ? r : i - r - 1] = e[f ? r : e.length - r - 1];
+  }
+  return o;
+}
+export {
+  p as assertSize,
+  n as charCodeMap,
+  s as charCodeToBase16,
+  S as pad
+};

package/dist/index31.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index41.cjs"),s=require("./index27.cjs");async function i(e){const{privateKey:t,...a}=e;return await s.sign({hash:n.hashTypedData(a),privateKey:t,to:"hex"})}exports.signTypedData=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./index45.cjs"),m=require("./index177.cjs"),f=require("./index221.cjs"),q=require("./index29.cjs"),G=require("./index64.cjs");async function C(i,u){const{abi:a,address:r,args:c,functionName:n,dataSuffix:o,...t}=u,d=m.encodeFunctionData({abi:a,args:c,functionName:n});try{return await q.getAction(i,G.estimateGas,"estimateGas")({data:`${d}${o?o.replace("0x",""):""}`,to:r,...t})}catch(s){const e=t.account?g.parseAccount(t.account):void 0;throw f.getContractError(s,{abi:a,address:r,args:c,docsPath:"/docs/contract/estimateContractGas",functionName:n,sender:e==null?void 0:e.address})}}exports.estimateContractGas=C;

package/dist/index31.js

@@ -1,13 +1,32 @@
-import { hashTypedData as o } from "./index41.js";
-import { sign as r } from "./index27.js";
-async function p(t) {
-  const { privateKey: a, ...e } = t;
-  return await r({
-    hash: o(e),
-    privateKey: a,
-    to: "hex"
+import { parseAccount as f } from "./index45.js";
+import { encodeFunctionData as u } from "./index177.js";
+import { getContractError as p } from "./index221.js";
+import { getAction as g } from "./index29.js";
+import { estimateGas as G } from "./index64.js";
+async function A(i, m) {
+  const { abi: o, address: r, args: e, functionName: s, dataSuffix: c, ...t } = m, d = u({
+    abi: o,
+    args: e,
+    functionName: s
   });
+  try {
+    return await g(i, G, "estimateGas")({
+      data: `${d}${c ? c.replace("0x", "") : ""}`,
+      to: r,
+      ...t
+    });
+  } catch (n) {
+    const a = t.account ? f(t.account) : void 0;
+    throw p(n, {
+      abi: o,
+      address: r,
+      args: e,
+      docsPath: "/docs/contract/estimateContractGas",
+      functionName: s,
+      sender: a == null ? void 0 : a.address
+    });
+  }
 }
 export {
-  p as signTypedData
+  A as estimateContractGas
 };

package/dist/index310.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index313.cjs");function r(){return e.version}exports.getVersion=r;

package/dist/index310.js

@@ -0,0 +1,7 @@
+import { version as r } from "./index313.js";
+function e() {
+  return r;
+}
+export {
+  e as getVersion
+};

package/dist/index311.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index314.cjs"),c=require("./index315.cjs"),A=BigInt(0),u=BigInt(1),H=BigInt(2),L=BigInt(7),S=BigInt(256),T=BigInt(113),O=[],y=[],w=[];for(let n=0,t=u,s=1,i=0;n<24;n++){[s,i]=[i,(2*s+3*i)%5],O.push(2*(5*i+s)),y.push((n+1)*(n+2)/2%64);let o=A;for(let r=0;r<7;r++)t=(t<<u^(t>>L)*T)%S,t&H&&(o^=u<<(u<<BigInt(r))-u);w.push(o)}const _=f.split(w,!0),F=_[0],X=_[1],I=(n,t,s)=>s>32?f.rotlBH(n,t,s):f.rotlSH(n,t,s),x=(n,t,s)=>s>32?f.rotlBL(n,t,s):f.rotlSL(n,t,s);function b(n,t=24){const s=new Uint32Array(10);for(let i=24-t;i<24;i++){for(let e=0;e<10;e++)s[e]=n[e]^n[e+10]^n[e+20]^n[e+30]^n[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,l=(e+2)%10,p=s[l],a=s[l+1],g=I(p,a,1)^s[h],B=x(p,a,1)^s[h+1];for(let d=0;d<50;d+=10)n[e+d]^=g,n[e+d+1]^=B}let o=n[2],r=n[3];for(let e=0;e<24;e++){const h=y[e],l=I(o,r,h),p=x(o,r,h),a=O[e];o=n[a],r=n[a+1],n[a]=l,n[a+1]=p}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=n[e+h];for(let h=0;h<10;h++)n[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}n[0]^=F[i],n[1]^=X[i]}c.clean(s)}class k extends c.Hash{constructor(t,s,i,o=!1,r=24){if(super(),this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,this.enableXOF=!1,this.blockLen=t,this.suffix=s,this.outputLen=i,this.enableXOF=o,this.rounds=r,c.anumber(i),!(0<t&&t<200))throw new Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}clone(){return this._cloneInto()}keccak(){c.swap32IfBE(this.state32),b(this.state32,this.rounds),c.swap32IfBE(this.state32),this.posOut=0,this.pos=0}update(t){c.aexists(this),t=c.toBytes(t),c.abytes(t);const{blockLen:s,state:i}=this,o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)i[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:i,blockLen:o}=this;t[i]^=s,s&128&&i===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){c.aexists(this,!1),c.abytes(t),this.finish();const s=this.state,{blockLen:i}=this;for(let o=0,r=t.length;o<r;){this.posOut>=i&&this.keccak();const e=Math.min(i-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return c.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(c.aoutput(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,c.clean(this.state)}_cloneInto(t){const{blockLen:s,suffix:i,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new k(s,i,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=i,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const m=(n,t,s)=>c.createHasher(()=>new k(t,n,s)),E=m(1,136,256/8);exports.Keccak=k;exports.keccakP=b;exports.keccak_256=E;

package/dist/index311.js

@@ -0,0 +1,107 @@
+import { split as L, rotlSH as T, rotlSL as S, rotlBH as m, rotlBL as F } from "./index314.js";
+import { createHasher as X, Hash as E, anumber as d, u32 as U, swap32IfBE as I, aexists as x, toBytes as P, abytes as k, aoutput as M, clean as y } from "./index315.js";
+const R = BigInt(0), f = BigInt(1), j = BigInt(2), q = BigInt(7), v = BigInt(256), z = BigInt(113), _ = [], g = [], B = [];
+for (let n = 0, t = f, s = 1, i = 0; n < 24; n++) {
+  [s, i] = [i, (2 * s + 3 * i) % 5], _.push(2 * (5 * i + s)), g.push((n + 1) * (n + 2) / 2 % 64);
+  let o = R;
+  for (let r = 0; r < 7; r++)
+    t = (t << f ^ (t >> q) * z) % v, t & j && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
+  B.push(o);
+}
+const A = L(B, !0), C = A[0], D = A[1], O = (n, t, s) => s > 32 ? m(n, t, s) : T(n, t, s), w = (n, t, s) => s > 32 ? F(n, t, s) : S(n, t, s);
+function G(n, t = 24) {
+  const s = new Uint32Array(10);
+  for (let i = 24 - t; i < 24; i++) {
+    for (let e = 0; e < 10; e++)
+      s[e] = n[e] ^ n[e + 10] ^ n[e + 20] ^ n[e + 30] ^ n[e + 40];
+    for (let e = 0; e < 10; e += 2) {
+      const h = (e + 8) % 10, l = (e + 2) % 10, u = s[l], c = s[l + 1], b = O(u, c, 1) ^ s[h], H = w(u, c, 1) ^ s[h + 1];
+      for (let a = 0; a < 50; a += 10)
+        n[e + a] ^= b, n[e + a + 1] ^= H;
+    }
+    let o = n[2], r = n[3];
+    for (let e = 0; e < 24; e++) {
+      const h = g[e], l = O(o, r, h), u = w(o, r, h), c = _[e];
+      o = n[c], r = n[c + 1], n[c] = l, n[c + 1] = u;
+    }
+    for (let e = 0; e < 50; e += 10) {
+      for (let h = 0; h < 10; h++)
+        s[h] = n[e + h];
+      for (let h = 0; h < 10; h++)
+        n[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+    }
+    n[0] ^= C[i], n[1] ^= D[i];
+  }
+  y(s);
+}
+class p extends E {
+  // NOTE: we accept arguments in bytes instead of bits here.
+  constructor(t, s, i, o = !1, r = 24) {
+    if (super(), this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, this.enableXOF = !1, this.blockLen = t, this.suffix = s, this.outputLen = i, this.enableXOF = o, this.rounds = r, d(i), !(0 < t && t < 200))
+      throw new Error("only keccak-f1600 function is supported");
+    this.state = new Uint8Array(200), this.state32 = U(this.state);
+  }
+  clone() {
+    return this._cloneInto();
+  }
+  keccak() {
+    I(this.state32), G(this.state32, this.rounds), I(this.state32), this.posOut = 0, this.pos = 0;
+  }
+  update(t) {
+    x(this), t = P(t), k(t);
+    const { blockLen: s, state: i } = this, o = t.length;
+    for (let r = 0; r < o; ) {
+      const e = Math.min(s - this.pos, o - r);
+      for (let h = 0; h < e; h++)
+        i[this.pos++] ^= t[r++];
+      this.pos === s && this.keccak();
+    }
+    return this;
+  }
+  finish() {
+    if (this.finished)
+      return;
+    this.finished = !0;
+    const { state: t, suffix: s, pos: i, blockLen: o } = this;
+    t[i] ^= s, s & 128 && i === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
+  }
+  writeInto(t) {
+    x(this, !1), k(t), this.finish();
+    const s = this.state, { blockLen: i } = this;
+    for (let o = 0, r = t.length; o < r; ) {
+      this.posOut >= i && this.keccak();
+      const e = Math.min(i - this.posOut, r - o);
+      t.set(s.subarray(this.posOut, this.posOut + e), o), this.posOut += e, o += e;
+    }
+    return t;
+  }
+  xofInto(t) {
+    if (!this.enableXOF)
+      throw new Error("XOF is not possible for this instance");
+    return this.writeInto(t);
+  }
+  xof(t) {
+    return d(t), this.xofInto(new Uint8Array(t));
+  }
+  digestInto(t) {
+    if (M(t, this), this.finished)
+      throw new Error("digest() was already called");
+    return this.writeInto(t), this.destroy(), t;
+  }
+  digest() {
+    return this.digestInto(new Uint8Array(this.outputLen));
+  }
+  destroy() {
+    this.destroyed = !0, y(this.state);
+  }
+  _cloneInto(t) {
+    const { blockLen: s, suffix: i, outputLen: o, rounds: r, enableXOF: e } = this;
+    return t || (t = new p(s, i, o, e, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = i, t.outputLen = o, t.enableXOF = e, t.destroyed = this.destroyed, t;
+  }
+}
+const J = (n, t, s) => X(() => new p(t, n, s)), Q = J(1, 136, 256 / 8);
+export {
+  p as Keccak,
+  G as keccakP,
+  Q as keccak_256
+};

package/dist/index312.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index316.cjs"),e={checksum:new c.LruMap(8192)},s=e.checksum;exports.checksum=s;

package/dist/index312.js

@@ -0,0 +1,7 @@
+import { LruMap as c } from "./index316.js";
+const e = {
+  checksum: /* @__PURE__ */ new c(8192)
+}, m = e.checksum;
+export {
+  m as checksum
+};

package/dist/index313.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.1.1";exports.version=e;

package/dist/index313.js

@@ -0,0 +1,4 @@
+const o = "0.1.1";
+export {
+  o as version
+};

package/dist/index314.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=BigInt(2**32-1),c=BigInt(32);function u(t,o=!1){return o?{h:Number(t&l),l:Number(t>>c&l)}:{h:Number(t>>c&l)|0,l:Number(t&l)|0}}function B(t,o=!1){const r=t.length;let n=new Uint32Array(r),i=new Uint32Array(r);for(let e=0;e<r;e++){const{h:f,l:s}=u(t[e],o);[n[e],i[e]]=[f,s]}return[n,i]}const g=(t,o,r)=>t<<r|o>>>32-r,m=(t,o,r)=>o<<r|t>>>32-r,S=(t,o,r)=>o<<r-32|t>>>64-r,a=(t,o,r)=>t<<r-32|o>>>64-r;exports.fromBig=u;exports.rotlBH=S;exports.rotlBL=a;exports.rotlSH=g;exports.rotlSL=m;exports.split=B;

package/dist/index314.js

@@ -0,0 +1,22 @@
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function s(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  const n = t.length;
+  let l = new Uint32Array(n), c = new Uint32Array(n);
+  for (let e = 0; e < n; e++) {
+    const { h: u, l: f } = s(t[e], r);
+    [l[e], c[e]] = [u, f];
+  }
+  return [l, c];
+}
+const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
+export {
+  s as fromBig,
+  B as rotlBH,
+  a as rotlBL,
+  m as rotlSH,
+  A as rotlSL,
+  h as split
+};

package/dist/index315.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function o(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function y(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function r(e,...t){if(!o(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error("Uint8Array expected of length "+t+", got length="+e.length)}function l(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function h(e,t){r(e);const n=t.outputLen;if(e.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}function p(e){return new Uint32Array(e.buffer,e.byteOffset,Math.floor(e.byteLength/4))}function w(...e){for(let t=0;t<e.length;t++)e[t].fill(0)}const i=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function f(e){return e<<24&4278190080|e<<8&16711680|e>>>8&65280|e>>>24&255}function u(e){for(let t=0;t<e.length;t++)e[t]=f(e[t]);return e}const g=i?e=>e:u;function s(e){if(typeof e!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(e))}function c(e){return typeof e=="string"&&(e=s(e)),r(e),e}class b{}function x(e){const t=a=>e().update(c(a)).digest(),n=e();return t.outputLen=n.outputLen,t.blockLen=n.blockLen,t.create=()=>e(),t}exports.Hash=b;exports.abytes=r;exports.aexists=l;exports.anumber=y;exports.aoutput=h;exports.byteSwap=f;exports.byteSwap32=u;exports.clean=w;exports.createHasher=x;exports.isBytes=o;exports.isLE=i;exports.swap32IfBE=g;exports.toBytes=c;exports.u32=p;exports.utf8ToBytes=s;

package/dist/index315.js

@@ -0,0 +1,74 @@
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function f(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function l(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error("positive integer expected, got " + e);
+}
+function r(e, ...t) {
+  if (!f(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
+}
+function y(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function w(e, t) {
+  r(e);
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error("digestInto() expects output buffer of length at least " + n);
+}
+function p(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function a(...e) {
+  for (let t = 0; t < e.length; t++)
+    e[t].fill(0);
+}
+const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function u(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function c(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = u(e[t]);
+  return e;
+}
+const g = i ? (e) => e : c;
+function s(e) {
+  if (typeof e != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function h(e) {
+  return typeof e == "string" && (e = s(e)), r(e), e;
+}
+class x {
+}
+function b(e) {
+  const t = (o) => e().update(h(o)).digest(), n = e();
+  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
+}
+export {
+  x as Hash,
+  r as abytes,
+  y as aexists,
+  l as anumber,
+  w as aoutput,
+  u as byteSwap,
+  c as byteSwap32,
+  a as clean,
+  b as createHasher,
+  f as isBytes,
+  i as isLE,
+  g as swap32IfBE,
+  h as toBytes,
+  p as u32,
+  s as utf8ToBytes
+};

package/dist/index316.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class i extends Map{constructor(e){super(),Object.defineProperty(this,"maxSize",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.maxSize=e}get(e){const t=super.get(e);return super.has(e)&&t!==void 0&&(this.delete(e),super.set(e,t)),t}set(e,t){if(super.set(e,t),this.maxSize&&this.size>this.maxSize){const s=this.keys().next().value;s&&this.delete(s)}return this}}exports.LruMap=i;

package/dist/index316.js

@@ -0,0 +1,24 @@
+class r extends Map {
+  constructor(e) {
+    super(), Object.defineProperty(this, "maxSize", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), this.maxSize = e;
+  }
+  get(e) {
+    const t = super.get(e);
+    return super.has(e) && t !== void 0 && (this.delete(e), super.set(e, t)), t;
+  }
+  set(e, t) {
+    if (super.set(e, t), this.maxSize && this.size > this.maxSize) {
+      const s = this.keys().next().value;
+      s && this.delete(s);
+    }
+    return this;
+  }
+}
+export {
+  r as LruMap
+};

package/dist/index32.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index50.cjs");class r extends s.BaseError{constructor({address:e}){super(`Address "${e}" is invalid.`,{metaMessages:["- Address must be a hex value of 20 bytes (40 hex characters).","- Address must match its checksum counterpart."],name:"InvalidAddressError"})}}exports.InvalidAddressError=r;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("./index131.cjs"),b=require("./index29.cjs"),f=require("./index78.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;