@gardenfi/utils 2.2.0-beta.1 → 2.2.0

package/dist/index289.js

@@ -1,12 +1,116 @@
-import { fromNumber as e } from "./index288.js";
-function r(o) {
+import { BaseError as y } from "./index300.js";
+import { keccak256 as v } from "./index303.js";
+import { validate as $, slice as A, fromString as S } from "./index287.js";
+import { isArgOfType as E, normalizeSignature as p, getAmbiguousTypes as B } from "./index304.js";
+import { parseAbiItem as l } from "./index267.js";
+import { formatAbiItem as h } from "./index260.js";
+function H(e, r = {}) {
+  const { prepare: i = !0 } = r, n = Array.isArray(e) ? l(e) : typeof e == "string" ? l(e) : e;
   return {
-    address: o.address,
-    amount: e(o.amount),
-    index: e(o.index),
-    validatorIndex: e(o.validatorIndex)
+    ...n,
+    ...i ? { hash: s(n) } : {}
   };
 }
+function M(e, r, i) {
+  const { args: n = [], prepare: f = !0 } = i ?? {}, b = $(r, { strict: !1 }), u = e.filter((t) => b ? t.type === "function" || t.type === "error" ? T(t) === A(r, 0, 4) : t.type === "event" ? s(t) === r : !1 : "name" in t && t.name === r);
+  if (u.length === 0)
+    throw new d({ name: r });
+  if (u.length === 1)
+    return {
+      ...u[0],
+      ...f ? { hash: s(u[0]) } : {}
+    };
+  let o;
+  for (const t of u) {
+    if (!("inputs" in t))
+      continue;
+    if (!n || n.length === 0) {
+      if (!t.inputs || t.inputs.length === 0)
+        return {
+          ...t,
+          ...f ? { hash: s(t) } : {}
+        };
+      continue;
+    }
+    if (!t.inputs || t.inputs.length === 0 || t.inputs.length !== n.length)
+      continue;
+    if (n.every((a, w) => {
+      const g = "inputs" in t && t.inputs[w];
+      return g ? E(a, g) : !1;
+    })) {
+      if (o && "inputs" in o && o.inputs) {
+        const a = B(t.inputs, o.inputs, n);
+        if (a)
+          throw new O({
+            abiItem: t,
+            type: a[0]
+          }, {
+            abiItem: o,
+            type: a[1]
+          });
+      }
+      o = t;
+    }
+  }
+  const c = (() => {
+    if (o)
+      return o;
+    const [t, ...m] = u;
+    return { ...t, overloads: m };
+  })();
+  if (!c)
+    throw new d({ name: r });
+  return {
+    ...c,
+    ...f ? { hash: s(c) } : {}
+  };
+}
+function T(e) {
+  return A(s(e), 0, 4);
+}
+function F(e) {
+  const r = typeof e == "string" ? e : h(e);
+  return p(r);
+}
+function s(e) {
+  return typeof e != "string" && "hash" in e && e.hash ? e.hash : v(S(F(e)));
+}
+class O extends y {
+  constructor(r, i) {
+    super("Found ambiguous types in overloaded ABI Items.", {
+      metaMessages: [
+        // TODO: abitype to add support for signature-formatted ABI items.
+        `\`${r.type}\` in \`${p(h(r.abiItem))}\`, and`,
+        `\`${i.type}\` in \`${p(h(i.abiItem))}\``,
+        "",
+        "These types encode differently and cannot be distinguished at runtime.",
+        "Remove one of the ambiguous items in the ABI."
+      ]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiItem.AmbiguityError"
+    });
+  }
+}
+class d extends y {
+  constructor({ name: r, data: i, type: n = "item" }) {
+    const f = r ? ` with name "${r}"` : i ? ` with data "${i}"` : "";
+    super(`ABI ${n}${f} not found.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiItem.NotFoundError"
+    });
+  }
+}
 export {
-  r as toRpc
+  O as AmbiguityError,
+  d as NotFoundError,
+  H as from,
+  M as fromAbi,
+  T as getSelector,
+  F as getSignature,
+  s as getSignatureHash
 };

package/dist/index29.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index216.cjs"),t=e.defineChain({id:1,name:"Ethereum",nativeCurrency:{name:"Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://eth.merkle.io"]}},blockExplorers:{default:{name:"Etherscan",url:"https://etherscan.io",apiUrl:"https://api.etherscan.io/api"}},contracts:{ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xce01f8eee7E479C928F8919abD53E553a36CeF67",blockCreated:19258213},multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:14353601}}});exports.mainnet=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(t,e,o){const i=t[e.name];if(typeof i=="function")return i;const n=t[o];return typeof n=="function"?n:c=>e(t,c)}exports.getAction=r;

package/dist/index29.js

@@ -1,34 +1,10 @@
-import { defineChain as e } from "./index216.js";
-const t = /* @__PURE__ */ e({
-  id: 1,
-  name: "Ethereum",
-  nativeCurrency: { name: "Ether", symbol: "ETH", decimals: 18 },
-  rpcUrls: {
-    default: {
-      http: ["https://eth.merkle.io"]
-    }
-  },
-  blockExplorers: {
-    default: {
-      name: "Etherscan",
-      url: "https://etherscan.io",
-      apiUrl: "https://api.etherscan.io/api"
-    }
-  },
-  contracts: {
-    ensRegistry: {
-      address: "0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"
-    },
-    ensUniversalResolver: {
-      address: "0xce01f8eee7E479C928F8919abD53E553a36CeF67",
-      blockCreated: 19258213
-    },
-    multicall3: {
-      address: "0xca11bde05977b3631167028862be2a173976ca11",
-      blockCreated: 14353601
-    }
-  }
-});
+function f(t, n, c) {
+  const i = t[n.name];
+  if (typeof i == "function")
+    return i;
+  const o = t[c];
+  return typeof o == "function" ? o : (e) => n(t, e);
+}
 export {
-  t as mainnet
+  f as getAction
 };

package/dist/index290.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index304.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 x=require("./index305.cjs"),d=require("./index300.cjs"),a=require("./index287.cjs"),g=require("./index306.cjs"),p=require("./index307.cjs");function P(n,e,t){const{checksumAddress:r=!1}={};if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const s=p.prepareParameters({checksumAddress:r,parameters:n,values:e}),o=p.encode(s);return o.length===0?"0x":o}function l(n,e){if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const t=[];for(let r=0;r<n.length;r++){const s=n[r],o=e[r];t.push(l.encode(s,o))}return a.concat(...t)}(function(n){function e(t,r,s=!1){if(t==="address"){const c=r;return x.assert(c),a.padLeft(c.toLowerCase(),s?32:0)}if(t==="string")return a.fromString(r);if(t==="bytes")return r;if(t==="bool")return a.padLeft(a.fromBoolean(r),s?32:1);const o=t.match(g.integerRegex);if(o){const[c,i,u="256"]=o,h=Number.parseInt(u)/8;return a.fromNumber(r,{size:s?32:h,signed:i==="int"})}const b=t.match(g.bytesRegex);if(b){const[c,i]=b;if(Number.parseInt(i)!==(r.length-2)/2)throw new y({expectedSize:Number.parseInt(i),value:r});return a.padRight(r,s?32:0)}const f=t.match(g.arrayRegex);if(f&&Array.isArray(r)){const[c,i]=f,u=[];for(let h=0;h<r.length;h++)u.push(e(i,r[h],!0));return u.length===0?"0x":a.concat(...u)}throw new E(t)}n.encode=e})(l||(l={}));class A extends d.BaseError{constructor({expectedLength:e,givenLength:t,type:r}){super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class y extends d.BaseError{constructor({expectedSize:e,value:t}){super(`Size of bytes "${t}" (bytes${a.size(t)}) does not match expected size (bytes${e}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class m extends d.BaseError{constructor({expectedLength:e,givenLength:t}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${e}`,`Given length (values): ${t}`].join(`
+`)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class w extends d.BaseError{constructor(e){super(`Value \`${e}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class E extends d.BaseError{constructor(e){super(`Type \`${e}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=A;exports.BytesSizeMismatchError=y;exports.InvalidArrayError=w;exports.InvalidTypeError=E;exports.LengthMismatchError=m;exports.encode=P;exports.encodePacked=l;

package/dist/index290.js

@@ -1,9 +1,137 @@
-import { weierstrass as s } from "./index304.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 { assert as p } from "./index305.js";
+import { BaseError as u } from "./index300.js";
+import { size as y, padLeft as f, fromString as x, fromBoolean as w, fromNumber as E, padRight as P, concat as g } from "./index287.js";
+import { integerRegex as A, bytesRegex as $, arrayRegex as L } from "./index306.js";
+import { prepareParameters as z, encode as I } from "./index307.js";
+function N(n, e, t) {
+  const { checksumAddress: r = !1 } = {};
+  if (n.length !== e.length)
+    throw new b({
+      expectedLength: n.length,
+      givenLength: e.length
+    });
+  const a = z({
+    checksumAddress: r,
+    parameters: n,
+    values: e
+  }), s = I(a);
+  return s.length === 0 ? "0x" : s;
+}
+function m(n, e) {
+  if (n.length !== e.length)
+    throw new b({
+      expectedLength: n.length,
+      givenLength: e.length
+    });
+  const t = [];
+  for (let r = 0; r < n.length; r++) {
+    const a = n[r], s = e[r];
+    t.push(m.encode(a, s));
+  }
+  return g(...t);
+}
+(function(n) {
+  function e(t, r, a = !1) {
+    if (t === "address") {
+      const i = r;
+      return p(i), f(i.toLowerCase(), a ? 32 : 0);
+    }
+    if (t === "string")
+      return x(r);
+    if (t === "bytes")
+      return r;
+    if (t === "bool")
+      return f(w(r), a ? 32 : 1);
+    const s = t.match(A);
+    if (s) {
+      const [i, o, c = "256"] = s, h = Number.parseInt(c) / 8;
+      return E(r, {
+        size: a ? 32 : h,
+        signed: o === "int"
+      });
+    }
+    const d = t.match($);
+    if (d) {
+      const [i, o] = d;
+      if (Number.parseInt(o) !== (r.length - 2) / 2)
+        throw new M({
+          expectedSize: Number.parseInt(o),
+          value: r
+        });
+      return P(r, a ? 32 : 0);
+    }
+    const l = t.match(L);
+    if (l && Array.isArray(r)) {
+      const [i, o] = l, c = [];
+      for (let h = 0; h < r.length; h++)
+        c.push(e(o, r[h], !0));
+      return c.length === 0 ? "0x" : g(...c);
+    }
+    throw new j(t);
+  }
+  n.encode = e;
+})(m || (m = {}));
+class R extends u {
+  constructor({ expectedLength: e, givenLength: t, type: r }) {
+    super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.ArrayLengthMismatchError"
+    });
+  }
+}
+class M extends u {
+  constructor({ expectedSize: e, value: t }) {
+    super(`Size of bytes "${t}" (bytes${y(t)}) does not match expected size (bytes${e}).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.BytesSizeMismatchError"
+    });
+  }
+}
+class b extends u {
+  constructor({ expectedLength: e, givenLength: t }) {
+    super([
+      "ABI encoding parameters/values length mismatch.",
+      `Expected length (parameters): ${e}`,
+      `Given length (values): ${t}`
+    ].join(`
+`)), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.LengthMismatchError"
+    });
+  }
+}
+class _ extends u {
+  constructor(e) {
+    super(`Value \`${e}\` is not a valid array.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidArrayError"
+    });
+  }
+}
+class j extends u {
+  constructor(e) {
+    super(`Type \`${e}\` is not a valid ABI Type.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidTypeError"
+    });
+  }
 }
 export {
-  c as createCurve
+  R as ArrayLengthMismatchError,
+  M as BytesSizeMismatchError,
+  _ as InvalidArrayError,
+  j as InvalidTypeError,
+  b as LengthMismatchError,
+  N as encode,
+  m as encodePacked
 };

package/dist/index291.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("./index296.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 a=require("./index38.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;

package/dist/index291.js

@@ -1,227 +1,14 @@
-import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index296.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 i } from "./index38.js";
+class d extends i {
+  constructor(e) {
+    const { docsPath: s, field: r, metaMessages: a } = e;
+    super(`Invalid Sign-In with Ethereum message field "${r}".`, {
+      docsPath: s,
+      metaMessages: a,
+      name: "SiweInvalidMessageFieldError"
+    });
   }
-  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);
-}
-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);
 }
 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
+  d as SiweInvalidMessageFieldError
 };

package/dist/index292.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./index301.cjs"),$=require("./index306.cjs"),g=require("./index288.cjs"),c=require("./index307.cjs"),y=require("./index270.cjs"),h=require("./index263.cjs");function I(t,r={}){const{prepare:i=!0}=r,n=Array.isArray(t)||typeof t=="string"?y.parseAbiItem(t):t;return{...n,...i?{hash:o(n)}:{}}}function q(t,r,i){const{args:n=[],prepare:a=!0}=i??{},v=g.validate(r,{strict:!1}),s=t.filter(e=>v?e.type==="function"||e.type==="error"?A(e)===g.slice(r,0,4):e.type==="event"?o(e)===r:!1:"name"in e&&e.name===r);if(s.length===0)throw new l({name:r});if(s.length===1)return{...s[0],...a?{hash:o(s[0])}:{}};let u;for(const e of s){if(!("inputs"in e))continue;if(!n||n.length===0){if(!e.inputs||e.inputs.length===0)return{...e,...a?{hash:o(e)}:{}};continue}if(!e.inputs||e.inputs.length===0||e.inputs.length!==n.length)continue;if(n.every((f,E)=>{const d="inputs"in e&&e.inputs[E];return d?c.isArgOfType(f,d):!1})){if(u&&"inputs"in u&&u.inputs){const f=c.getAmbiguousTypes(e.inputs,u.inputs,n);if(f)throw new w({abiItem:e,type:f[0]},{abiItem:u,type:f[1]})}u=e}}const p=(()=>{if(u)return u;const[e,...m]=s;return{...e,overloads:m}})();if(!p)throw new l({name:r});return{...p,...a?{hash:o(p)}:{}}}function A(t){return g.slice(o(t),0,4)}function S(t){const r=typeof t=="string"?t:h.formatAbiItem(t);return c.normalizeSignature(r)}function o(t){return typeof t!="string"&&"hash"in t&&t.hash?t.hash:$.keccak256(g.fromString(S(t)))}class w extends b.BaseError{constructor(r,i){super("Found ambiguous types in overloaded ABI Items.",{metaMessages:[`\`${r.type}\` in \`${c.normalizeSignature(h.formatAbiItem(r.abiItem))}\`, and`,`\`${i.type}\` in \`${c.normalizeSignature(h.formatAbiItem(i.abiItem))}\``,"","These types encode differently and cannot be distinguished at runtime.","Remove one of the ambiguous items in the ABI."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.AmbiguityError"})}}class l extends b.BaseError{constructor({name:r,data:i,type:n="item"}){const a=r?` with name "${r}"`:i?` with data "${i}"`:"";super(`ABI ${n}${a} not found.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.NotFoundError"})}}exports.AmbiguityError=w;exports.NotFoundError=l;exports.from=I;exports.fromAbi=q;exports.getSelector=A;exports.getSignature=S;exports.getSignatureHash=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e)||/%[^0-9a-f]/i.test(e)||/%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))return!1;const s=a(e),f=s[1],t=s[2],i=s[3],r=s[4],l=s[5];if(!(f!=null&&f.length&&i.length>=0))return!1;if(t!=null&&t.length){if(!(i.length===0||/^\//.test(i)))return!1}else if(/^\/\//.test(i))return!1;if(!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))return!1;let n="";return n+=`${f}:`,t!=null&&t.length&&(n+=`//${t}`),n+=i,r!=null&&r.length&&(n+=`?${r}`),l!=null&&l.length&&(n+=`#${l}`),n}function a(e){return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;