@gardenfi/utils 2.2.0 → 2.2.1-beta.2

package/dist/index277.js

@@ -1,106 +1,189 @@
-import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index295.js";
-import { createHasher as u, clean as C, rotr as i } from "./index284.js";
-const B = /* @__PURE__ */ Uint32Array.from([
-  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
-]), h = /* @__PURE__ */ new Uint32Array(64);
-class E extends D {
-  constructor(o = 32) {
-    super(64, o, 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: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
-    return [o, r, t, s, a, f, c, e];
+import { execTyped as E, bytesRegex as x, integerRegex as $, isTupleRegex as P } from "./index274.js";
+import { UnknownSolidityTypeError as M } from "./index279.js";
+import { InvalidParameterError as R, SolidityProtectedKeywordError as k, InvalidModifierError as z, InvalidFunctionModifierError as A } from "./index280.js";
+import { UnknownSignatureError as F, InvalidSignatureError as m } from "./index281.js";
+import { InvalidParenthesisError as T } from "./index282.js";
+import { getParameterCacheKey as _, parameterCache as p } from "./index302.js";
+import { isFunctionSignature as C, isEventSignature as I, isErrorSignature as Z, isConstructorSignature as K, isFallbackSignature as L, isReceiveSignature as U, functionModifiers as h, execFunctionSignature as W, execEventSignature as D, eventModifiers as V, execErrorSignature as j, execConstructorSignature as q, execFallbackSignature as B } from "./index275.js";
+function le(e, t = {}) {
+  if (C(e))
+    return G(e, t);
+  if (I(e))
+    return H(e, t);
+  if (Z(e))
+    return J(e, t);
+  if (K(e))
+    return N(e, t);
+  if (L(e))
+    return O(e);
+  if (U(e))
+    return {
+      type: "receive",
+      stateMutability: "payable"
+    };
+  throw new F({ signature: e });
+}
+function G(e, t = {}) {
+  const n = W(e);
+  if (!n)
+    throw new m({ signature: e, type: "function" });
+  const a = s(n.parameters), r = [], c = a.length;
+  for (let o = 0; o < c; o++)
+    r.push(l(a[o], {
+      modifiers: h,
+      structs: t,
+      type: "function"
+    }));
+  const i = [];
+  if (n.returns) {
+    const o = s(n.returns), u = o.length;
+    for (let f = 0; f < u; f++)
+      i.push(l(o[f], {
+        modifiers: h,
+        structs: t,
+        type: "function"
+      }));
   }
-  // prettier-ignore
-  set(o, r, t, s, a, f, c, e) {
-    this.A = o | 0, this.B = r | 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;
+  return {
+    name: n.name,
+    type: "function",
+    stateMutability: n.stateMutability ?? "nonpayable",
+    inputs: r,
+    outputs: i
+  };
+}
+function H(e, t = {}) {
+  const n = D(e);
+  if (!n)
+    throw new m({ signature: e, type: "event" });
+  const a = s(n.parameters), r = [], c = a.length;
+  for (let i = 0; i < c; i++)
+    r.push(l(a[i], {
+      modifiers: V,
+      structs: t,
+      type: "event"
+    }));
+  return { name: n.name, type: "event", inputs: r };
+}
+function J(e, t = {}) {
+  const n = j(e);
+  if (!n)
+    throw new m({ signature: e, type: "error" });
+  const a = s(n.parameters), r = [], c = a.length;
+  for (let i = 0; i < c; i++)
+    r.push(l(a[i], { structs: t, type: "error" }));
+  return { name: n.name, type: "error", inputs: r };
+}
+function N(e, t = {}) {
+  const n = q(e);
+  if (!n)
+    throw new m({ signature: e, type: "constructor" });
+  const a = s(n.parameters), r = [], c = a.length;
+  for (let i = 0; i < c; i++)
+    r.push(l(a[i], { structs: t, type: "constructor" }));
+  return {
+    type: "constructor",
+    stateMutability: n.stateMutability ?? "nonpayable",
+    inputs: r
+  };
+}
+function O(e) {
+  const t = B(e);
+  if (!t)
+    throw new m({ signature: e, type: "fallback" });
+  return {
+    type: "fallback",
+    stateMutability: t.stateMutability ?? "nonpayable"
+  };
+}
+const Q = /^(?<type>[a-zA-Z$_][a-zA-Z0-9$_]*)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/, X = /^\((?<type>.+?)\)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/, Y = /^u?int$/;
+function l(e, t) {
+  var y, b;
+  const n = _(e, t == null ? void 0 : t.type, t == null ? void 0 : t.structs);
+  if (p.has(n))
+    return p.get(n);
+  const a = P.test(e), r = E(a ? X : Q, e);
+  if (!r)
+    throw new R({ param: e });
+  if (r.name && re(r.name))
+    throw new k({ param: e, name: r.name });
+  const c = r.name ? { name: r.name } : {}, i = r.modifier === "indexed" ? { indexed: !0 } : {}, o = (t == null ? void 0 : t.structs) ?? {};
+  let u, f = {};
+  if (a) {
+    u = "tuple";
+    const w = s(r.type), S = [], v = w.length;
+    for (let d = 0; d < v; d++)
+      S.push(l(w[d], { structs: o }));
+    f = { components: S };
+  } else if (r.type in o)
+    u = "tuple", f = { components: o[r.type] };
+  else if (Y.test(r.type))
+    u = `${r.type}256`;
+  else if (u = r.type, (t == null ? void 0 : t.type) !== "struct" && !ee(u))
+    throw new M({ type: u });
+  if (r.modifier) {
+    if (!((b = (y = t == null ? void 0 : t.modifiers) == null ? void 0 : y.has) != null && b.call(y, r.modifier)))
+      throw new z({
+        param: e,
+        type: t == null ? void 0 : t.type,
+        modifier: r.modifier
+      });
+    if (h.has(r.modifier) && !ne(u, !!r.array))
+      throw new A({
+        param: e,
+        type: t == null ? void 0 : t.type,
+        modifier: r.modifier
+      });
   }
-  process(o, r) {
-    for (let x = 0; x < 16; x++, r += 4)
-      h[x] = o.getUint32(r, !1);
-    for (let x = 16; x < 64; x++) {
-      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
-      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
-    }
-    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
-    for (let x = 0; x < 64; x++) {
-      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
-      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
+  const g = {
+    type: `${u}${r.array ?? ""}`,
+    ...c,
+    ...i,
+    ...f
+  };
+  return p.set(n, g), g;
+}
+function s(e, t = [], n = "", a = 0) {
+  const r = e.trim().length;
+  for (let c = 0; c < r; c++) {
+    const i = e[c], o = e.slice(c + 1);
+    switch (i) {
+      case ",":
+        return a === 0 ? s(o, [...t, n.trim()]) : s(o, t, `${n}${i}`, a);
+      case "(":
+        return s(o, t, `${n}${i}`, a + 1);
+      case ")":
+        return s(o, t, `${n}${i}`, a - 1);
+      default:
+        return s(o, t, `${n}${i}`, a);
     }
-    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, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
-  }
-  roundClean() {
-    C(h);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
   }
+  if (n === "")
+    return t;
+  if (a !== 0)
+    throw new T({ current: n, depth: a });
+  return t.push(n.trim()), t;
+}
+function ee(e) {
+  return e === "address" || e === "bool" || e === "function" || e === "string" || x.test(e) || $.test(e);
+}
+const te = /^(?:after|alias|anonymous|apply|auto|byte|calldata|case|catch|constant|copyof|default|defined|error|event|external|false|final|function|immutable|implements|in|indexed|inline|internal|let|mapping|match|memory|mutable|null|of|override|partial|private|promise|public|pure|reference|relocatable|return|returns|sizeof|static|storage|struct|super|supports|switch|this|true|try|typedef|typeof|var|view|virtual)$/;
+function re(e) {
+  return e === "address" || e === "bool" || e === "function" || e === "string" || e === "tuple" || x.test(e) || $.test(e) || te.test(e);
+}
+function ne(e, t) {
+  return t || e === "bytes" || e === "string" || e === "tuple";
 }
-const y = /* @__PURE__ */ u(() => new E());
 export {
-  E as SHA256,
-  y as sha256
+  re as isSolidityKeyword,
+  ee as isSolidityType,
+  ne as isValidDataLocation,
+  l as parseAbiParameter,
+  N as parseConstructorSignature,
+  J as parseErrorSignature,
+  H as parseEventSignature,
+  O as parseFallbackSignature,
+  G as parseFunctionSignature,
+  le as parseSignature,
+  s as splitParameters
 };

package/dist/index278.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index298.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(r,t){const e=s=>a.weierstrass({...r,hash:s});return{...e(t),create:e}}exports.createCurve=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index279.cjs"),u=require("./index275.cjs"),a=require("./index276.cjs"),s=require("./index277.cjs");function l(t){let e;if(typeof t=="string")e=s.parseSignature(t);else{const n=a.parseStructs(t),o=t.length;for(let r=0;r<o;r++){const i=t[r];if(!u.isStructSignature(i)){e=s.parseSignature(i,n);break}}}if(!e)throw new c.InvalidAbiItemError({signature:t});return e}exports.parseAbiItem=l;

package/dist/index278.js

@@ -1,9 +1,25 @@
-import { weierstrass as s } from "./index298.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function c(e, t) {
-  const r = (o) => s({ ...e, hash: o });
-  return { ...r(t), create: r };
+import { InvalidAbiItemError as f } from "./index279.js";
+import { isStructSignature as p } from "./index275.js";
+import { parseStructs as c } from "./index276.js";
+import { parseSignature as i } from "./index277.js";
+function u(t) {
+  let r;
+  if (typeof t == "string")
+    r = i(t);
+  else {
+    const m = c(t), n = t.length;
+    for (let o = 0; o < n; o++) {
+      const e = t[o];
+      if (!p(e)) {
+        r = i(e, m);
+        break;
+      }
+    }
+  }
+  if (!r)
+    throw new f({ signature: t });
+  return r;
 }
 export {
-  c as createCurve
+  u as parseAbiItem
 };

package/dist/index279.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("./index293.cjs"),V=require("./index284.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const g=BigInt(0),d=BigInt(1),b=BigInt(2),K=BigInt(3),I=BigInt(4),T=BigInt(5),_=BigInt(8);function h(t,n){const o=t%n;return o>=g?o:n+o}function Q(t,n,o){let r=t;for(;n-- >g;)r*=r,r%=o;return r}function v(t,n){if(t===g)throw new Error("invert: expected non-zero number");if(n<=g)throw new Error("invert: expected positive modulus, got "+n);let o=h(t,n),r=n,s=g,c=d;for(;o!==g;){const u=r/o,i=r%o,a=s-c*u;r=o,o=i,s=c,c=a}if(r!==d)throw new Error("invert: does not exist");return h(s,n)}function L(t,n){const o=(t.ORDER+d)/I,r=t.pow(n,o);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function Y(t,n){const o=(t.ORDER-T)/_,r=t.mul(n,b),s=t.pow(r,o),c=t.mul(n,s),f=t.mul(t.mul(c,b),s),u=t.mul(c,t.sub(f,t.ONE));if(!t.eql(t.sqr(u),n))throw new Error("Cannot find square root");return u}function x(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-d,o=0;for(;n%b===g;)n/=b,o++;let r=b;const s=Z(t);for(;y(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(o===1)return L;let c=s.pow(r,n);const f=(n+d)/b;return function(i,a){if(i.is0(a))return a;if(y(i,a)!==1)throw new Error("Cannot find square root");let e=o,l=i.mul(i.ONE,c),q=i.pow(a,n),B=i.pow(a,f);for(;!i.eql(q,i.ONE);){if(i.is0(q))return i.ZERO;let m=1,E=i.sqr(q);for(;!i.eql(E,i.ONE);)if(m++,E=i.sqr(E),m===e)throw new Error("Cannot find square root");const H=d<<BigInt(e-m-1),S=i.pow(l,H);e=m,l=i.sqr(S),q=i.mul(q,l),B=i.mul(B,S)}return B}}function M(t){return t%I===K?L:t%_===T?Y:x(t)}const k=["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:"number",BITS:"number"},o=k.reduce((r,s)=>(r[s]="function",r),n);return w._validateObject(t,o),t}function j(t,n,o){if(o<g)throw new Error("invalid exponent, negatives unsupported");if(o===g)return t.ONE;if(o===d)return n;let r=t.ONE,s=n;for(;o>g;)o&d&&(r=t.mul(r,s)),s=t.sqr(s),o>>=d;return r}function A(t,n,o=!1){const r=new Array(n.length).fill(o?t.ZERO:void 0),s=n.reduce((f,u,i)=>t.is0(u)?f:(r[i]=f,t.mul(f,u)),t.ONE),c=t.inv(s);return n.reduceRight((f,u,i)=>t.is0(u)?f:(r[i]=t.mul(f,r[i]),t.mul(f,u)),c),r}function y(t,n){const o=(t.ORDER-d)/b,r=t.pow(n,o),s=t.eql(r,t.ONE),c=t.eql(r,t.ZERO),f=t.eql(r,t.neg(t.ONE));if(!s&&!c&&!f)throw new Error("invalid Legendre symbol result");return s?1:c?0:-1}function C(t,n){n!==void 0&&V.anumber(n);const o=n!==void 0?n:t.toString(2).length,r=Math.ceil(o/8);return{nBitLength:o,nByteLength:r}}function Z(t,n,o=!1,r={}){if(t<=g)throw new Error("invalid field: expected ORDER > 0, got "+t);let s,c;if(typeof n=="object"&&n!=null){if(r.sqrt||o)throw new Error("cannot specify opts in two arguments");const e=n;e.BITS&&(s=e.BITS),e.sqrt&&(c=e.sqrt),typeof e.isLE=="boolean"&&(o=e.isLE)}else typeof n=="number"&&(s=n),r.sqrt&&(c=r.sqrt);const{nBitLength:f,nByteLength:u}=C(t,s);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let i;const a=Object.freeze({ORDER:t,isLE:o,BITS:f,BYTES:u,MASK:w.bitMask(f),ZERO:g,ONE:d,create:e=>h(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return g<=e&&e<t},is0:e=>e===g,isValidNot0:e=>!a.is0(e)&&a.isValid(e),isOdd:e=>(e&d)===d,neg:e=>h(-e,t),eql:(e,l)=>e===l,sqr:e=>h(e*e,t),add:(e,l)=>h(e+l,t),sub:(e,l)=>h(e-l,t),mul:(e,l)=>h(e*l,t),pow:(e,l)=>j(a,e,l),div:(e,l)=>h(e*v(l,t),t),sqrN:e=>e*e,addN:(e,l)=>e+l,subN:(e,l)=>e-l,mulN:(e,l)=>e*l,inv:e=>v(e,t),sqrt:c||(e=>(i||(i=M(t)),i(a,e))),toBytes:e=>o?w.numberToBytesLE(e,u):w.numberToBytesBE(e,u),fromBytes:e=>{if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);return o?w.bytesToNumberLE(e):w.bytesToNumberBE(e)},invertBatch:e=>A(a,e),cmov:(e,l,q)=>q?l:e});return Object.freeze(a)}function N(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 z(t){const n=N(t);return n+Math.ceil(n/2)}function $(t,n,o=!1){const r=t.length,s=N(n),c=z(n);if(r<16||r<c||r>1024)throw new Error("expected "+c+"-1024 bytes of input, got "+r);const f=o?w.bytesToNumberLE(t):w.bytesToNumberBE(t),u=h(f,n-d)+d;return o?w.numberToBytesLE(u,s):w.numberToBytesBE(u,s)}exports.Field=Z;exports.FpInvertBatch=A;exports.FpLegendre=y;exports.FpPow=j;exports.FpSqrt=M;exports.getFieldBytesLength=N;exports.getMinHashLength=z;exports.invert=v;exports.mapHashToField=$;exports.mod=h;exports.nLength=C;exports.pow2=Q;exports.tonelliShanks=x;exports.validateField=P;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index269.cjs");class n extends r.BaseError{constructor({signature:e}){super("Failed to parse ABI item.",{details:`parseAbiItem(${JSON.stringify(e,null,2)})`,docsPath:"/api/human#parseabiitem-1"}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"InvalidAbiItemError"})}}class o extends r.BaseError{constructor({type:e}){super("Unknown type.",{metaMessages:[`Type "${e}" is not a valid ABI type. Perhaps you forgot to include a struct signature?`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"UnknownTypeError"})}}class a extends r.BaseError{constructor({type:e}){super("Unknown type.",{metaMessages:[`Type "${e}" is not a valid ABI type.`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"UnknownSolidityTypeError"})}}exports.InvalidAbiItemError=n;exports.UnknownSolidityTypeError=a;exports.UnknownTypeError=o;

package/dist/index279.js

@@ -1,227 +1,45 @@
-import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index293.js";
-import { anumber as z } from "./index284.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const g = BigInt(0), d = BigInt(1), q = /* @__PURE__ */ BigInt(2), V = /* @__PURE__ */ BigInt(3), x = /* @__PURE__ */ BigInt(4), T = /* @__PURE__ */ BigInt(5), L = /* @__PURE__ */ BigInt(8);
-function h(t, n) {
-  const o = t % n;
-  return o >= g ? o : n + o;
-}
-function O(t, n, o) {
-  let r = t;
-  for (; n-- > g; )
-    r *= r, r %= o;
-  return r;
-}
-function B(t, n) {
-  if (t === g)
-    throw new Error("invert: expected non-zero number");
-  if (n <= g)
-    throw new Error("invert: expected positive modulus, got " + n);
-  let o = h(t, n), r = n, s = g, f = d;
-  for (; o !== g; ) {
-    const u = r / o, i = r % o, w = s - f * u;
-    r = o, o = i, s = f, f = w;
+import { BaseError as r } from "./index269.js";
+class a extends r {
+  constructor({ signature: e }) {
+    super("Failed to parse ABI item.", {
+      details: `parseAbiItem(${JSON.stringify(e, null, 2)})`,
+      docsPath: "/api/human#parseabiitem-1"
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "InvalidAbiItemError"
+    });
   }
-  if (r !== d)
-    throw new Error("invert: does not exist");
-  return h(s, n);
-}
-function M(t, n) {
-  const o = (t.ORDER + d) / x, 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) / L, r = t.mul(n, q), s = t.pow(r, o), f = t.mul(n, s), c = t.mul(t.mul(f, q), s), u = t.mul(f, t.sub(c, t.ONE));
-  if (!t.eql(t.sqr(u), n))
-    throw new Error("Cannot find square root");
-  return u;
-}
-function K(t) {
-  if (t < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let n = t - d, o = 0;
-  for (; n % q === g; )
-    n /= q, o++;
-  let r = q;
-  const s = U(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 f = s.pow(r, n);
-  const c = (n + d) / q;
-  return function(i, w) {
-    if (i.is0(w))
-      return w;
-    if (N(i, w) !== 1)
-      throw new Error("Cannot find square root");
-    let e = o, l = i.mul(i.ONE, f), a = i.pow(w, n), b = i.pow(w, c);
-    for (; !i.eql(a, i.ONE); ) {
-      if (i.is0(a))
-        return i.ZERO;
-      let m = 1, E = i.sqr(a);
-      for (; !i.eql(E, i.ONE); )
-        if (m++, E = i.sqr(E), m === e)
-          throw new Error("Cannot find square root");
-      const C = d << BigInt(e - m - 1), v = i.pow(l, C);
-      e = m, l = i.sqr(v), a = i.mul(a, l), b = i.mul(b, v);
-    }
-    return b;
-  };
-}
-function Q(t) {
-  return t % x === V ? M : t % L === T ? H : K(t);
-}
-const Y = [
-  "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: "number",
-    BITS: "number"
-  }, o = Y.reduce((r, s) => (r[s] = "function", r), n);
-  return j(t, o), t;
-}
-function k(t, n, o) {
-  if (o < g)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (o === g)
-    return t.ONE;
-  if (o === d)
-    return n;
-  let r = t.ONE, s = n;
-  for (; o > g; )
-    o & d && (r = t.mul(r, s)), s = t.sqr(s), o >>= d;
-  return r;
 }
-function G(t, n, o = !1) {
-  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((c, u, i) => t.is0(u) ? c : (r[i] = c, t.mul(c, u)), t.ONE), f = t.inv(s);
-  return n.reduceRight((c, u, i) => t.is0(u) ? c : (r[i] = t.mul(c, r[i]), t.mul(c, u)), f), r;
-}
-function N(t, n) {
-  const o = (t.ORDER - d) / q, r = t.pow(n, o), s = t.eql(r, t.ONE), f = t.eql(r, t.ZERO), c = t.eql(r, t.neg(t.ONE));
-  if (!s && !f && !c)
-    throw new Error("invalid Legendre symbol result");
-  return s ? 1 : f ? 0 : -1;
-}
-function J(t, n) {
-  n !== void 0 && z(n);
-  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
-  return { nBitLength: o, nByteLength: r };
-}
-function U(t, n, o = !1, r = {}) {
-  if (t <= g)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  let s, f;
-  if (typeof n == "object" && n != null) {
-    if (r.sqrt || o)
-      throw new Error("cannot specify opts in two arguments");
-    const e = n;
-    e.BITS && (s = e.BITS), e.sqrt && (f = e.sqrt), typeof e.isLE == "boolean" && (o = e.isLE);
-  } else
-    typeof n == "number" && (s = n), r.sqrt && (f = r.sqrt);
-  const { nBitLength: c, nByteLength: u } = J(t, s);
-  if (u > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let i;
-  const w = Object.freeze({
-    ORDER: t,
-    isLE: o,
-    BITS: c,
-    BYTES: u,
-    MASK: Z(c),
-    ZERO: g,
-    ONE: d,
-    create: (e) => h(e, t),
-    isValid: (e) => {
-      if (typeof e != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof e);
-      return g <= e && e < t;
-    },
-    is0: (e) => e === g,
-    // is valid and invertible
-    isValidNot0: (e) => !w.is0(e) && w.isValid(e),
-    isOdd: (e) => (e & d) === d,
-    neg: (e) => h(-e, t),
-    eql: (e, l) => e === l,
-    sqr: (e) => h(e * e, t),
-    add: (e, l) => h(e + l, t),
-    sub: (e, l) => h(e - l, t),
-    mul: (e, l) => h(e * l, t),
-    pow: (e, l) => k(w, e, l),
-    div: (e, l) => h(e * B(l, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (e) => e * e,
-    addN: (e, l) => e + l,
-    subN: (e, l) => e - l,
-    mulN: (e, l) => e * l,
-    inv: (e) => B(e, t),
-    sqrt: f || ((e) => (i || (i = Q(t)), i(w, e))),
-    toBytes: (e) => o ? y(e, u) : I(e, u),
-    fromBytes: (e) => {
-      if (e.length !== u)
-        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + e.length);
-      return o ? S(e) : _(e);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (e) => G(w, e),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (e, l, a) => a ? l : e
-  });
-  return Object.freeze(w);
-}
-function A(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 W(t) {
-  const n = A(t);
-  return n + Math.ceil(n / 2);
+class o extends r {
+  constructor({ type: e }) {
+    super("Unknown type.", {
+      metaMessages: [
+        `Type "${e}" is not a valid ABI type. Perhaps you forgot to include a struct signature?`
+      ]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "UnknownTypeError"
+    });
+  }
 }
-function D(t, n, o = !1) {
-  const r = t.length, s = A(n), f = W(n);
-  if (r < 16 || r < f || r > 1024)
-    throw new Error("expected " + f + "-1024 bytes of input, got " + r);
-  const c = o ? S(t) : _(t), u = h(c, n - d) + d;
-  return o ? y(u, s) : I(u, s);
+class i extends r {
+  constructor({ type: e }) {
+    super("Unknown type.", {
+      metaMessages: [`Type "${e}" is not a valid ABI type.`]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "UnknownSolidityTypeError"
+    });
+  }
 }
 export {
-  U as Field,
-  G as FpInvertBatch,
-  N as FpLegendre,
-  k as FpPow,
-  Q as FpSqrt,
-  A as getFieldBytesLength,
-  W as getMinHashLength,
-  B as invert,
-  D as mapHashToField,
-  h as mod,
-  J as nLength,
-  O as pow2,
-  K as tonelliShanks,
-  P as validateField
+  a as InvalidAbiItemError,
+  i as UnknownSolidityTypeError,
+  o as UnknownTypeError
 };

package/dist/index28.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index44.cjs"),n=require("./index52.cjs");function l(e){const{key:t="public",name:i="Public Client"}=e;return c.createClient({...e,key:t,name:i,type:"publicClient"}).extend(n.publicActions)}exports.createPublicClient=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index68.cjs"),n=require("./index75.cjs");function l(e){const{key:t="public",name:i="Public Client"}=e;return c.createClient({...e,key:t,name:i,type:"publicClient"}).extend(n.publicActions)}exports.createPublicClient=l;

package/dist/index28.js

@@ -1,5 +1,5 @@
-import { createClient as n } from "./index44.js";
-import { publicActions as c } from "./index52.js";
+import { createClient as n } from "./index68.js";
+import { publicActions as c } from "./index75.js";
 function u(t) {
   const { key: e = "public", name: i = "Public Client" } = t;
   return n({

package/dist/index280.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index149.cjs"),r=require("./index151.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index269.cjs");class o extends t.BaseError{constructor({param:e}){super("Invalid ABI parameter.",{details:e}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"InvalidParameterError"})}}class n extends t.BaseError{constructor({param:e,name:r}){super("Invalid ABI parameter.",{details:e,metaMessages:[`"${r}" is a protected Solidity keyword. More info: https://docs.soliditylang.org/en/latest/cheatsheet.html`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"SolidityProtectedKeywordError"})}}class s extends t.BaseError{constructor({param:e,type:r,modifier:i}){super("Invalid ABI parameter.",{details:e,metaMessages:[`Modifier "${i}" not allowed${r?` in "${r}" type`:""}.`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"InvalidModifierError"})}}class l extends t.BaseError{constructor({param:e,type:r,modifier:i}){super("Invalid ABI parameter.",{details:e,metaMessages:[`Modifier "${i}" not allowed${r?` in "${r}" type`:""}.`,`Data location can only be specified for array, struct, or mapping types, but "${i}" was given.`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"InvalidFunctionModifierError"})}}class d extends t.BaseError{constructor({abiParameter:e}){super("Invalid ABI parameter.",{details:JSON.stringify(e,null,2),metaMessages:["ABI parameter type is invalid."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"InvalidAbiTypeParameterError"})}}exports.InvalidAbiTypeParameterError=d;exports.InvalidFunctionModifierError=l;exports.InvalidModifierError=s;exports.InvalidParameterError=o;exports.SolidityProtectedKeywordError=n;