@gardenfi/swap 0.0.2 → 0.1.0-beta.1

package/dist/index349.js

@@ -1,29 +1,7 @@
-import { BaseError as u } from "./index189.js";
-function a(r) {
-  let l = !0, i = "", f = 0, t = "", o = !1;
-  for (let n = 0; n < r.length; n++) {
-    const e = r[n];
-    if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
-      if (f === 0) {
-        if (e === " " && ["event", "function", ""].includes(t))
-          t = "";
-        else if (t += e, e === ")") {
-          o = !0;
-          break;
-        }
-        continue;
-      }
-      if (e === " ") {
-        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
-        continue;
-      }
-      t += e, i += e;
-    }
-  }
-  if (!o)
-    throw new u("Unable to normalize signature.");
-  return t;
+import { version as r } from "./index381.js";
+function e() {
+  return r;
 }
 export {
-  a as normalizeSignature
+  e as getVersion
 };

package/dist/index350.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index378.cjs"),s=require("./index345.cjs"),o=require("./index379.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 B=require("./index351.cjs"),f=require("./index348.cjs"),d=require("./index278.cjs"),i=require("./index277.cjs"),y=require("./index352.cjs"),S=require("./index353.cjs"),g=require("./index282.cjs"),E=require("./index294.cjs"),$=require("./index286.cjs");function M(e,r,n={}){const{as:t="Array",checksumAddress:a=!1}=n,s=typeof r=="string"?f.fromHex(r):r,m=S.create(s);if(f.size(s)===0&&e.length>0)throw new P;if(f.size(s)&&f.size(s)<32)throw new A({data:typeof r=="string"?r:i.fromBytes(r),parameters:e,size:f.size(s)});let h=0;const c=t==="Array"?[]:{};for(let o=0;o<e.length;++o){const u=e[o];m.setPosition(h);const[l,z]=y.decodeParameter(m,u,{checksumAddress:a,staticPosition:0});h+=z,t==="Array"?c.push(l):c[u.name??o]=l}return c}function L(e,r,n){const{checksumAddress:t=!1}={};if(e.length!==r.length)throw new p({expectedLength:e.length,givenLength:r.length});const a=y.prepareParameters({checksumAddress:t,parameters:e,values:r}),s=y.encode(a);return s.length===0?"0x":s}function b(e,r){if(e.length!==r.length)throw new p({expectedLength:e.length,givenLength:r.length});const n=[];for(let t=0;t<e.length;t++){const a=e[t],s=r[t];n.push(b.encode(a,s))}return i.concat(...n)}(function(e){function r(n,t,a=!1){if(n==="address"){const c=t;return B.assert(c),i.padLeft(c.toLowerCase(),a?32:0)}if(n==="string")return i.fromString(t);if(n==="bytes")return t;if(n==="bool")return i.padLeft(i.fromBoolean(t),a?32:1);const s=n.match(g.integerRegex);if(s){const[c,o,u="256"]=s,l=Number.parseInt(u,10)/8;return i.fromNumber(t,{size:a?32:l,signed:o==="int"})}const m=n.match(g.bytesRegex);if(m){const[c,o]=m;if(Number.parseInt(o,10)!==(t.length-2)/2)throw new w({expectedSize:Number.parseInt(o,10),value:t});return i.padRight(t,a?32:0)}const h=n.match(g.arrayRegex);if(h&&Array.isArray(t)){const[c,o]=h,u=[];for(let l=0;l<t.length;l++)u.push(r(o,t[l],!0));return u.length===0?"0x":i.concat(...u)}throw new x(n)}e.encode=r})(b||(b={}));function v(e){return Array.isArray(e)&&typeof e[0]=="string"||typeof e=="string"?E.parseAbiParameters(e):e}class A extends d.BaseError{constructor({data:r,parameters:n,size:t}){super(`Data size of ${t} bytes is too small for given parameters.`,{metaMessages:[`Params: (${$.formatAbiParameters(n)})`,`Data:   ${r} (${t} bytes)`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.DataSizeTooSmallError"})}}class P extends d.BaseError{constructor(){super('Cannot decode zero data ("0x") with ABI parameters.'),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ZeroDataError"})}}class I extends d.BaseError{constructor({expectedLength:r,givenLength:n,type:t}){super(`Array length mismatch for type \`${t}\`. Expected: \`${r}\`. Given: \`${n}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class w extends d.BaseError{constructor({expectedSize:r,value:n}){super(`Size of bytes "${n}" (bytes${i.size(n)}) does not match expected size (bytes${r}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class p extends d.BaseError{constructor({expectedLength:r,givenLength:n}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${r}`,`Given length (values): ${n}`].join(`
+`)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class T extends d.BaseError{constructor(r){super(`Value \`${r}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class x extends d.BaseError{constructor(r){super(`Type \`${r}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=I;exports.BytesSizeMismatchError=w;exports.DataSizeTooSmallError=A;exports.InvalidArrayError=T;exports.InvalidTypeError=x;exports.LengthMismatchError=p;exports.ZeroDataError=P;exports.decode=M;exports.encode=L;exports.encodePacked=b;exports.from=v;

package/dist/index350.js

@@ -1,19 +1,196 @@
-import { hmac as c } from "./index378.js";
-import { randomBytes as m, concatBytes as n } from "./index345.js";
-import { weierstrass as a } from "./index379.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 { assert as P } from "./index351.js";
+import { fromHex as w, size as h } from "./index348.js";
+import { BaseError as m } from "./index278.js";
+import { fromBytes as x, size as E, padLeft as b, fromString as $, fromBoolean as z, fromNumber as I, padRight as L, concat as p } from "./index277.js";
+import { prepareParameters as M, encode as v, decodeParameter as S } from "./index352.js";
+import { create as j } from "./index353.js";
+import { integerRegex as B, bytesRegex as T, arrayRegex as O } from "./index282.js";
+import { parseAbiParameters as g } from "./index294.js";
+import { formatAbiParameters as D } from "./index286.js";
+function Q(e, r, n = {}) {
+  const { as: t = "Array", checksumAddress: a = !1 } = n, o = typeof r == "string" ? w(r) : r, l = j(o);
+  if (h(o) === 0 && e.length > 0)
+    throw new R();
+  if (h(o) && h(o) < 32)
+    throw new N({
+      data: typeof r == "string" ? r : x(r),
+      parameters: e,
+      size: h(o)
+    });
+  let f = 0;
+  const i = t === "Array" ? [] : {};
+  for (let s = 0; s < e.length; ++s) {
+    const c = e[s];
+    l.setPosition(f);
+    const [u, A] = S(l, c, {
+      checksumAddress: a,
+      staticPosition: 0
+    });
+    f += A, t === "Array" ? i.push(u) : i[c.name ?? s] = u;
+  }
+  return i;
+}
+function U(e, r, n) {
+  const { checksumAddress: t = !1 } = {};
+  if (e.length !== r.length)
+    throw new y({
+      expectedLength: e.length,
+      givenLength: r.length
+    });
+  const a = M({
+    checksumAddress: t,
+    parameters: e,
+    values: r
+  }), o = v(a);
+  return o.length === 0 ? "0x" : o;
+}
+function d(e, r) {
+  if (e.length !== r.length)
+    throw new y({
+      expectedLength: e.length,
+      givenLength: r.length
+    });
+  const n = [];
+  for (let t = 0; t < e.length; t++) {
+    const a = e[t], o = r[t];
+    n.push(d.encode(a, o));
+  }
+  return p(...n);
+}
+(function(e) {
+  function r(n, t, a = !1) {
+    if (n === "address") {
+      const i = t;
+      return P(i), b(i.toLowerCase(), a ? 32 : 0);
+    }
+    if (n === "string")
+      return $(t);
+    if (n === "bytes")
+      return t;
+    if (n === "bool")
+      return b(z(t), a ? 32 : 1);
+    const o = n.match(B);
+    if (o) {
+      const [i, s, c = "256"] = o, u = Number.parseInt(c, 10) / 8;
+      return I(t, {
+        size: a ? 32 : u,
+        signed: s === "int"
+      });
+    }
+    const l = n.match(T);
+    if (l) {
+      const [i, s] = l;
+      if (Number.parseInt(s, 10) !== (t.length - 2) / 2)
+        throw new _({
+          expectedSize: Number.parseInt(s, 10),
+          value: t
+        });
+      return L(t, a ? 32 : 0);
+    }
+    const f = n.match(O);
+    if (f && Array.isArray(t)) {
+      const [i, s] = f, c = [];
+      for (let u = 0; u < t.length; u++)
+        c.push(r(s, t[u], !0));
+      return c.length === 0 ? "0x" : p(...c);
+    }
+    throw new k(n);
+  }
+  e.encode = r;
+})(d || (d = {}));
+function W(e) {
+  return Array.isArray(e) && typeof e[0] == "string" ? g(e) : typeof e == "string" ? g(e) : e;
+}
+class N extends m {
+  constructor({ data: r, parameters: n, size: t }) {
+    super(`Data size of ${t} bytes is too small for given parameters.`, {
+      metaMessages: [
+        `Params: (${D(n)})`,
+        `Data:   ${r} (${t} bytes)`
+      ]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.DataSizeTooSmallError"
+    });
+  }
+}
+class R extends m {
+  constructor() {
+    super('Cannot decode zero data ("0x") with ABI parameters.'), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.ZeroDataError"
+    });
+  }
+}
+class X extends m {
+  constructor({ expectedLength: r, givenLength: n, type: t }) {
+    super(`Array length mismatch for type \`${t}\`. Expected: \`${r}\`. Given: \`${n}\`.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.ArrayLengthMismatchError"
+    });
+  }
+}
+class _ extends m {
+  constructor({ expectedSize: r, value: n }) {
+    super(`Size of bytes "${n}" (bytes${E(n)}) does not match expected size (bytes${r}).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.BytesSizeMismatchError"
+    });
+  }
+}
+class y extends m {
+  constructor({ expectedLength: r, givenLength: n }) {
+    super([
+      "ABI encoding parameters/values length mismatch.",
+      `Expected length (parameters): ${r}`,
+      `Given length (values): ${n}`
+    ].join(`
+`)), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.LengthMismatchError"
+    });
+  }
+}
+class Y extends m {
+  constructor(r) {
+    super(`Value \`${r}\` is not a valid array.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidArrayError"
+    });
+  }
+}
+class k extends m {
+  constructor(r) {
+    super(`Type \`${r}\` is not a valid ABI Type.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidTypeError"
+    });
+  }
 }
 export {
-  p as createCurve,
-  i as getHash
+  X as ArrayLengthMismatchError,
+  _ as BytesSizeMismatchError,
+  N as DataSizeTooSmallError,
+  Y as InvalidArrayError,
+  k as InvalidTypeError,
+  y as LengthMismatchError,
+  R as ZeroDataError,
+  Q as decode,
+  U as encode,
+  d as encodePacked,
+  W as from
 };

package/dist/index351.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index345.cjs"),a=require("./index359.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),f=BigInt(1),h=BigInt(2),K=BigInt(3),I=BigInt(4),L=BigInt(5),T=BigInt(8);function g(t,n){const o=t%n;return o>=d?o:n+o}function Q(t,n,o){let r=t;for(;n-- >d;)r*=r,r%=o;return r}function B(t,n){if(t===d)throw new Error("invert: expected non-zero number");if(n<=d)throw new Error("invert: expected positive modulus, got "+n);let o=g(t,n),r=n,s=d,l=f;for(;o!==d;){const c=r/o,e=r%o,i=s-l*c;r=o,o=e,s=l,l=i}if(r!==f)throw new Error("invert: does not exist");return g(s,n)}function x(t,n){const o=(t.ORDER+f)/I,r=t.pow(n,o);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function V(t,n){const o=(t.ORDER-L)/T,r=t.mul(n,h),s=t.pow(r,o),l=t.mul(n,s),u=t.mul(t.mul(l,h),s),c=t.mul(l,t.sub(u,t.ONE));if(!t.eql(t.sqr(c),n))throw new Error("Cannot find square root");return c}function _(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-f,o=0;for(;n%h===d;)n/=h,o++;let r=h;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 x;let l=s.pow(r,n);const u=(n+f)/h;return function(e,i){if(e.is0(i))return i;if(y(e,i)!==1)throw new Error("Cannot find square root");let w=o,v=e.mul(e.ONE,l),b=e.pow(i,n),E=e.pow(i,u);for(;!e.eql(b,e.ONE);){if(e.is0(b))return e.ZERO;let q=1,m=e.sqr(b);for(;!e.eql(m,e.ONE);)if(q++,m=e.sqr(m),q===w)throw new Error("Cannot find square root");const z=f<<BigInt(w-q-1),S=e.pow(v,z);w=q,v=e.sqr(S),b=e.mul(b,v),E=e.mul(E,S)}return E}}function M(t){return t%I===K?x:t%T===L?V:_(t)}const Y=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},o=Y.reduce((r,s)=>(r[s]="function",r),n);return a.validateObject(t,o)}function O(t,n,o){if(o<d)throw new Error("invalid exponent, negatives unsupported");if(o===d)return t.ONE;if(o===f)return n;let r=t.ONE,s=n;for(;o>d;)o&f&&(r=t.mul(r,s)),s=t.sqr(s),o>>=f;return r}function A(t,n,o=!1){const r=new Array(n.length).fill(o?t.ZERO:void 0),s=n.reduce((u,c,e)=>t.is0(c)?u:(r[e]=u,t.mul(u,c)),t.ONE),l=t.inv(s);return n.reduceRight((u,c,e)=>t.is0(c)?u:(r[e]=t.mul(u,r[e]),t.mul(u,c)),l),r}function y(t,n){const o=(t.ORDER-f)/h,r=t.pow(n,o),s=t.eql(r,t.ONE),l=t.eql(r,t.ZERO),u=t.eql(r,t.neg(t.ONE));if(!s&&!l&&!u)throw new Error("invalid Legendre symbol result");return s?1:l?0:-1}function C(t,n){n!==void 0&&H.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<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:l}=C(t,n);if(l>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let u;const c=Object.freeze({ORDER:t,isLE:o,BITS:s,BYTES:l,MASK:a.bitMask(s),ZERO:d,ONE:f,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&f)===f,neg:e=>g(-e,t),eql:(e,i)=>e===i,sqr:e=>g(e*e,t),add:(e,i)=>g(e+i,t),sub:(e,i)=>g(e-i,t),mul:(e,i)=>g(e*i,t),pow:(e,i)=>O(c,e,i),div:(e,i)=>g(e*B(i,t),t),sqrN:e=>e*e,addN:(e,i)=>e+i,subN:(e,i)=>e-i,mulN:(e,i)=>e*i,inv:e=>B(e,t),sqrt:r.sqrt||(e=>(u||(u=M(t)),u(c,e))),toBytes:e=>o?a.numberToBytesLE(e,l):a.numberToBytesBE(e,l),fromBytes:e=>{if(e.length!==l)throw new Error("Field.fromBytes: expected "+l+" bytes, got "+e.length);return o?a.bytesToNumberLE(e):a.bytesToNumberBE(e)},invertBatch:e=>A(c,e),cmov:(e,i,w)=>w?i:e});return Object.freeze(c)}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 j(t){const n=N(t);return n+Math.ceil(n/2)}function P(t,n,o=!1){const r=t.length,s=N(n),l=j(n);if(r<16||r<l||r>1024)throw new Error("expected "+l+"-1024 bytes of input, got "+r);const u=o?a.bytesToNumberLE(t):a.bytesToNumberBE(t),c=g(u,n-f)+f;return o?a.numberToBytesLE(c,s):a.numberToBytesBE(c,s)}exports.Field=Z;exports.FpInvertBatch=A;exports.FpLegendre=y;exports.FpPow=O;exports.FpSqrt=M;exports.getFieldBytesLength=N;exports.getMinHashLength=j;exports.invert=B;exports.mapHashToField=P;exports.mod=g;exports.nLength=C;exports.pow2=Q;exports.tonelliShanks=_;exports.validateField=k;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index348.cjs"),c=require("./index354.cjs"),o=require("./index278.cjs"),m=require("./index347.cjs"),b=/^0x[a-fA-F0-9]{40}$/;function i(e,t={}){const{strict:s=!0}=t;if(!b.test(e))throw new a({address:e,cause:new l});if(s){if(e.toLowerCase()===e)return;if(d(e)!==e)throw new a({address:e,cause:new h})}}function d(e){if(c.checksum.has(e))return c.checksum.get(e);i(e,{strict:!1});const t=e.substring(2).toLowerCase(),s=m.keccak256(f.fromString(t),{as:"Bytes"}),n=t.split("");for(let r=0;r<40;r+=2)s[r>>1]>>4>=8&&n[r]&&(n[r]=n[r].toUpperCase()),(s[r>>1]&15)>=8&&n[r+1]&&(n[r+1]=n[r+1].toUpperCase());const u=`0x${n.join("")}`;return c.checksum.set(e,u),u}function p(e,t={}){const{strict:s=!0}=t??{};try{return i(e,{strict:s}),!0}catch{return!1}}class a extends o.BaseError{constructor({address:t,cause:s}){super(`Address "${t}" is invalid.`,{cause:s}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidAddressError"})}}class l extends o.BaseError{constructor(){super("Address is not a 20 byte (40 hexadecimal character) value."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidInputError"})}}class h extends o.BaseError{constructor(){super("Address does not match its checksum counterpart."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidChecksumError"})}}exports.InvalidAddressError=a;exports.InvalidChecksumError=h;exports.InvalidInputError=l;exports.assert=i;exports.checksum=d;exports.validate=p;

package/dist/index351.js

@@ -1,217 +1,80 @@
-import { anumber as C } from "./index345.js";
-import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index359.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
-function w(t, n) {
-  const o = t % n;
-  return o >= d ? o : n + o;
-}
-function $(t, n, o) {
-  let r = t;
-  for (; n-- > d; )
-    r *= r, r %= o;
-  return r;
-}
-function B(t, n) {
-  if (t === d)
-    throw new Error("invert: expected non-zero number");
-  if (n <= d)
-    throw new Error("invert: expected positive modulus, got " + n);
-  let o = w(t, n), r = n, s = d, l = f;
-  for (; o !== d; ) {
-    const c = r / o, e = r % o, i = s - l * c;
-    r = o, o = e, s = l, l = i;
+import { fromString as d } from "./index348.js";
+import { checksum as o } from "./index354.js";
+import { BaseError as c } from "./index278.js";
+import { keccak256 as f } from "./index347.js";
+const l = /^0x[a-fA-F0-9]{40}$/;
+function u(r, t = {}) {
+  const { strict: s = !0 } = t;
+  if (!l.test(r))
+    throw new i({
+      address: r,
+      cause: new h()
+    });
+  if (s) {
+    if (r.toLowerCase() === r)
+      return;
+    if (m(r) !== r)
+      throw new i({
+        address: r,
+        cause: new p()
+      });
   }
-  if (r !== f)
-    throw new Error("invert: does not exist");
-  return w(s, n);
-}
-function M(t, n) {
-  const o = (t.ORDER + f) / L, 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, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
-  if (!t.eql(t.sqr(c), n))
-    throw new Error("Cannot find square root");
-  return c;
-}
-function K(t) {
-  if (t < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let n = t - f, o = 0;
-  for (; n % g === d; )
-    n /= g, o++;
-  let r = g;
-  const s = J(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 l = s.pow(r, n);
-  const u = (n + f) / g;
-  return function(e, i) {
-    if (e.is0(i))
-      return i;
-    if (N(e, i) !== 1)
-      throw new Error("Cannot find square root");
-    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
-    for (; !e.eql(a, e.ONE); ) {
-      if (e.is0(a))
-        return e.ZERO;
-      let q = 1, v = e.sqr(a);
-      for (; !e.eql(v, e.ONE); )
-        if (q++, v = e.sqr(v), q === h)
-          throw new Error("Cannot find square root");
-      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
-      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
-    }
-    return m;
-  };
-}
-function Q(t) {
-  return t % L === j ? M : t % T === _ ? H : K(t);
-}
-const V = [
-  "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: "isSafeInteger",
-    BITS: "isSafeInteger"
-  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
-  return z(t, o);
-}
-function Y(t, n, o) {
-  if (o < d)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (o === d)
-    return t.ONE;
-  if (o === f)
-    return n;
-  let r = t.ONE, s = n;
-  for (; o > d; )
-    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
-  return r;
 }
-function k(t, n, o = !1) {
-  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
-  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
-}
-function N(t, n) {
-  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
-  if (!s && !l && !u)
-    throw new Error("invalid Legendre symbol result");
-  return s ? 1 : l ? 0 : -1;
-}
-function G(t, n) {
-  n !== void 0 && C(n);
-  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
-  return { nBitLength: o, nByteLength: r };
-}
-function J(t, n, o = !1, r = {}) {
-  if (t <= d)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  const { nBitLength: s, nByteLength: l } = G(t, n);
-  if (l > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let u;
-  const c = Object.freeze({
-    ORDER: t,
-    isLE: o,
-    BITS: s,
-    BYTES: l,
-    MASK: Z(s),
-    ZERO: d,
-    ONE: f,
-    create: (e) => w(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 & f) === f,
-    neg: (e) => w(-e, t),
-    eql: (e, i) => e === i,
-    sqr: (e) => w(e * e, t),
-    add: (e, i) => w(e + i, t),
-    sub: (e, i) => w(e - i, t),
-    mul: (e, i) => w(e * i, t),
-    pow: (e, i) => Y(c, e, i),
-    div: (e, i) => w(e * B(i, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (e) => e * e,
-    addN: (e, i) => e + i,
-    subN: (e, i) => e - i,
-    mulN: (e, i) => e * i,
-    inv: (e) => B(e, t),
-    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
-    toBytes: (e) => o ? I(e, l) : y(e, l),
-    fromBytes: (e) => {
-      if (e.length !== l)
-        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
-      return o ? S(e) : x(e);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (e) => k(c, e),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (e, i, h) => h ? i : e
-  });
-  return Object.freeze(c);
+function m(r) {
+  if (o.has(r))
+    return o.get(r);
+  u(r, { strict: !1 });
+  const t = r.substring(2).toLowerCase(), s = f(d(t), { as: "Bytes" }), n = t.split("");
+  for (let e = 0; e < 40; e += 2)
+    s[e >> 1] >> 4 >= 8 && n[e] && (n[e] = n[e].toUpperCase()), (s[e >> 1] & 15) >= 8 && n[e + 1] && (n[e + 1] = n[e + 1].toUpperCase());
+  const a = `0x${n.join("")}`;
+  return o.set(r, a), a;
+}
+function k(r, t = {}) {
+  const { strict: s = !0 } = t ?? {};
+  try {
+    return u(r, { strict: s }), !0;
+  } catch {
+    return !1;
+  }
 }
-function O(t) {
-  if (typeof t != "bigint")
-    throw new Error("field order must be bigint");
-  const n = t.toString(2).length;
-  return Math.ceil(n / 8);
+class i extends c {
+  constructor({ address: t, cause: s }) {
+    super(`Address "${t}" is invalid.`, {
+      cause: s
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Address.InvalidAddressError"
+    });
+  }
 }
-function U(t) {
-  const n = O(t);
-  return n + Math.ceil(n / 2);
+class h extends c {
+  constructor() {
+    super("Address is not a 20 byte (40 hexadecimal character) value."), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Address.InvalidInputError"
+    });
+  }
 }
-function D(t, n, o = !1) {
-  const r = t.length, s = O(n), l = U(n);
-  if (r < 16 || r < l || r > 1024)
-    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
-  const u = o ? S(t) : x(t), c = w(u, n - f) + f;
-  return o ? I(c, s) : y(c, s);
+class p extends c {
+  constructor() {
+    super("Address does not match its checksum counterpart."), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Address.InvalidChecksumError"
+    });
+  }
 }
 export {
-  J as Field,
-  k as FpInvertBatch,
-  N as FpLegendre,
-  Y as FpPow,
-  Q as FpSqrt,
-  O as getFieldBytesLength,
-  U as getMinHashLength,
-  B as invert,
-  D as mapHashToField,
-  w as mod,
-  G as nLength,
-  $ as pow2,
-  K as tonelliShanks,
-  P as validateField
+  i as InvalidAddressError,
+  p as InvalidChecksumError,
+  h as InvalidInputError,
+  u as assert,
+  m as checksum,
+  k as validate
 };

package/dist/index352.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index281.cjs"),f=require("./index282.cjs"),d=require("./index278.cjs"),i=require("./index277.cjs"),y=require("./index381.cjs"),S=require("./index382.cjs"),g=require("./index287.cjs"),E=require("./index299.cjs"),$=require("./index291.cjs");function M(e,r,n={}){const{as:t="Array",checksumAddress:a=!1}=n,s=typeof r=="string"?f.fromHex(r):r,m=S.create(s);if(f.size(s)===0&&e.length>0)throw new P;if(f.size(s)&&f.size(s)<32)throw new A({data:typeof r=="string"?r:i.fromBytes(r),parameters:e,size:f.size(s)});let h=0;const c=t==="Array"?[]:{};for(let o=0;o<e.length;++o){const u=e[o];m.setPosition(h);const[l,z]=y.decodeParameter(m,u,{checksumAddress:a,staticPosition:0});h+=z,t==="Array"?c.push(l):c[u.name??o]=l}return c}function L(e,r,n){const{checksumAddress:t=!1}={};if(e.length!==r.length)throw new p({expectedLength:e.length,givenLength:r.length});const a=y.prepareParameters({checksumAddress:t,parameters:e,values:r}),s=y.encode(a);return s.length===0?"0x":s}function b(e,r){if(e.length!==r.length)throw new p({expectedLength:e.length,givenLength:r.length});const n=[];for(let t=0;t<e.length;t++){const a=e[t],s=r[t];n.push(b.encode(a,s))}return i.concat(...n)}(function(e){function r(n,t,a=!1){if(n==="address"){const c=t;return B.assert(c),i.padLeft(c.toLowerCase(),a?32:0)}if(n==="string")return i.fromString(t);if(n==="bytes")return t;if(n==="bool")return i.padLeft(i.fromBoolean(t),a?32:1);const s=n.match(g.integerRegex);if(s){const[c,o,u="256"]=s,l=Number.parseInt(u,10)/8;return i.fromNumber(t,{size:a?32:l,signed:o==="int"})}const m=n.match(g.bytesRegex);if(m){const[c,o]=m;if(Number.parseInt(o,10)!==(t.length-2)/2)throw new w({expectedSize:Number.parseInt(o,10),value:t});return i.padRight(t,a?32:0)}const h=n.match(g.arrayRegex);if(h&&Array.isArray(t)){const[c,o]=h,u=[];for(let l=0;l<t.length;l++)u.push(r(o,t[l],!0));return u.length===0?"0x":i.concat(...u)}throw new x(n)}e.encode=r})(b||(b={}));function v(e){return Array.isArray(e)&&typeof e[0]=="string"||typeof e=="string"?E.parseAbiParameters(e):e}class A extends d.BaseError{constructor({data:r,parameters:n,size:t}){super(`Data size of ${t} bytes is too small for given parameters.`,{metaMessages:[`Params: (${$.formatAbiParameters(n)})`,`Data:   ${r} (${t} bytes)`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.DataSizeTooSmallError"})}}class P extends d.BaseError{constructor(){super('Cannot decode zero data ("0x") with ABI parameters.'),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ZeroDataError"})}}class I extends d.BaseError{constructor({expectedLength:r,givenLength:n,type:t}){super(`Array length mismatch for type \`${t}\`. Expected: \`${r}\`. Given: \`${n}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class w extends d.BaseError{constructor({expectedSize:r,value:n}){super(`Size of bytes "${n}" (bytes${i.size(n)}) does not match expected size (bytes${r}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class p extends d.BaseError{constructor({expectedLength:r,givenLength:n}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${r}`,`Given length (values): ${n}`].join(`
-`)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class T extends d.BaseError{constructor(r){super(`Value \`${r}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class x extends d.BaseError{constructor(r){super(`Type \`${r}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=I;exports.BytesSizeMismatchError=w;exports.DataSizeTooSmallError=A;exports.InvalidArrayError=T;exports.InvalidTypeError=x;exports.LengthMismatchError=p;exports.ZeroDataError=P;exports.decode=M;exports.encode=L;exports.encodePacked=b;exports.from=v;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./index350.cjs"),x=require("./index351.cjs"),y=require("./index348.cjs"),U=require("./index278.cjs"),c=require("./index277.cjs"),V=require("./index282.cjs");function l(e,t,s){const{checksumAddress:n,staticPosition:o}=s,r=P(t.type);if(r){const[i,a]=r;return I(e,{...t,type:a},{checksumAddress:n,length:i,staticPosition:o})}if(t.type==="tuple")return k(e,t,{checksumAddress:n,staticPosition:o});if(t.type==="address")return C(e,{checksum:n});if(t.type==="bool")return L(e);if(t.type.startsWith("bytes"))return E(e,t,{staticPosition:o});if(t.type.startsWith("uint")||t.type.startsWith("int"))return W(e,t);if(t.type==="string")return O(e,{staticPosition:o});throw new g.InvalidTypeError(t.type)}const S=32,z=32;function C(e,t={}){const{checksum:s=!1}=t,n=e.readBytes(32);return[(r=>s?x.checksum(r):r)(c.fromBytes(y.slice(n,-20))),32]}function I(e,t,s){const{checksumAddress:n,length:o,staticPosition:r}=s;if(!o){const d=y.toNumber(e.readBytes(z)),f=r+d,u=f+S;e.setPosition(f);const m=y.toNumber(e.readBytes(S)),h=p(t);let b=0;const w=[];for(let N=0;N<m;++N){e.setPosition(u+(h?N*32:b));const[j,H]=l(e,t,{checksumAddress:n,staticPosition:u});b+=H,w.push(j)}return e.setPosition(r+32),[w,32]}if(p(t)){const d=y.toNumber(e.readBytes(z)),f=r+d,u=[];for(let m=0;m<o;++m){e.setPosition(f+m*32);const[h]=l(e,t,{checksumAddress:n,staticPosition:f});u.push(h)}return e.setPosition(r+32),[u,32]}let i=0;const a=[];for(let d=0;d<o;++d){const[f,u]=l(e,t,{checksumAddress:n,staticPosition:r+i});i+=u,a.push(f)}return[a,i]}function L(e){return[y.toBoolean(e.readBytes(32),{size:32}),32]}function E(e,t,{staticPosition:s}){const[n,o]=t.type.split("bytes");if(!o){const i=y.toNumber(e.readBytes(32));e.setPosition(s+i);const a=y.toNumber(e.readBytes(32));if(a===0)return e.setPosition(s+32),["0x",32];const d=e.readBytes(a);return e.setPosition(s+32),[c.fromBytes(d),32]}return[c.fromBytes(e.readBytes(Number.parseInt(o,10),32)),32]}function W(e,t){const s=t.type.startsWith("int"),n=Number.parseInt(t.type.split("int")[1]||"256",10),o=e.readBytes(32);return[n>48?y.toBigInt(o,{signed:s}):y.toNumber(o,{signed:s}),32]}function k(e,t,s){const{checksumAddress:n,staticPosition:o}=s,r=t.components.length===0||t.components.some(({name:d})=>!d),i=r?[]:{};let a=0;if(p(t)){const d=y.toNumber(e.readBytes(z)),f=o+d;for(let u=0;u<t.components.length;++u){const m=t.components[u];e.setPosition(f+a);const[h,b]=l(e,m,{checksumAddress:n,staticPosition:f});a+=b,i[r?u:m==null?void 0:m.name]=h}return e.setPosition(o+32),[i,32]}for(let d=0;d<t.components.length;++d){const f=t.components[d],[u,m]=l(e,f,{checksumAddress:n,staticPosition:o});i[r?d:f==null?void 0:f.name]=u,a+=m}return[i,a]}function O(e,{staticPosition:t}){const s=y.toNumber(e.readBytes(32)),n=t+s;e.setPosition(n);const o=y.toNumber(e.readBytes(32));if(o===0)return e.setPosition(t+32),["",32];const r=e.readBytes(o,32),i=y.toString(y.trimLeft(r));return e.setPosition(t+32),[i,32]}function F({checksumAddress:e,parameters:t,values:s}){const n=[];for(let o=0;o<t.length;o++)n.push(B({checksumAddress:e,parameter:t[o],value:s[o]}));return n}function B({checksumAddress:e=!1,parameter:t,value:s}){const n=t,o=P(n.type);if(o){const[r,i]=o;return _(s,{checksumAddress:e,length:r,parameter:{...n,type:i}})}if(n.type==="tuple")return D(s,{checksumAddress:e,parameter:n});if(n.type==="address")return T(s,{checksum:e});if(n.type==="bool")return R(s);if(n.type.startsWith("uint")||n.type.startsWith("int")){const r=n.type.startsWith("int"),[,,i="256"]=V.integerRegex.exec(n.type)??[];return M(s,{signed:r,size:Number(i)})}if(n.type.startsWith("bytes"))return q(s,{type:n.type});if(n.type==="string")return $(s);throw new g.InvalidTypeError(n.type)}function A(e){let t=0;for(let r=0;r<e.length;r++){const{dynamic:i,encoded:a}=e[r];i?t+=32:t+=c.size(a)}const s=[],n=[];let o=0;for(let r=0;r<e.length;r++){const{dynamic:i,encoded:a}=e[r];i?(s.push(c.fromNumber(t+o,{size:32})),n.push(a),o+=c.size(a)):s.push(a)}return c.concat(...s,...n)}function T(e,t){const{checksum:s=!1}=t;return x.assert(e,{strict:s}),{dynamic:!1,encoded:c.padLeft(e.toLowerCase())}}function _(e,t){const{checksumAddress:s,length:n,parameter:o}=t,r=n===null;if(!Array.isArray(e))throw new g.InvalidArrayError(e);if(!r&&e.length!==n)throw new g.ArrayLengthMismatchError({expectedLength:n,givenLength:e.length,type:`${o.type}[${n}]`});let i=!1;const a=[];for(let d=0;d<e.length;d++){const f=B({checksumAddress:s,parameter:o,value:e[d]});f.dynamic&&(i=!0),a.push(f)}if(r||i){const d=A(a);if(r){const f=c.fromNumber(a.length,{size:32});return{dynamic:!0,encoded:a.length>0?c.concat(f,d):f}}if(i)return{dynamic:!0,encoded:d}}return{dynamic:!1,encoded:c.concat(...a.map(({encoded:d})=>d))}}function q(e,{type:t}){const[,s]=t.split("bytes"),n=c.size(e);if(!s){let o=e;return n%32!==0&&(o=c.padRight(o,Math.ceil((e.length-2)/2/32)*32)),{dynamic:!0,encoded:c.concat(c.padLeft(c.fromNumber(n,{size:32})),o)}}if(n!==Number.parseInt(s,10))throw new g.BytesSizeMismatchError({expectedSize:Number.parseInt(s,10),value:e});return{dynamic:!1,encoded:c.padRight(e)}}function R(e){if(typeof e!="boolean")throw new U.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:c.padLeft(c.fromBoolean(e))}}function M(e,{signed:t,size:s}){if(typeof s=="number"){const n=2n**(BigInt(s)-(t?1n:0n))-1n,o=t?-n-1n:0n;if(e>n||e<o)throw new c.IntegerOutOfRangeError({max:n.toString(),min:o.toString(),signed:t,size:s/8,value:e.toString()})}return{dynamic:!1,encoded:c.fromNumber(e,{size:32,signed:t})}}function $(e){const t=c.fromString(e),s=Math.ceil(c.size(t)/32),n=[];for(let o=0;o<s;o++)n.push(c.padRight(c.slice(t,o*32,(o+1)*32)));return{dynamic:!0,encoded:c.concat(c.padRight(c.fromNumber(c.size(t),{size:32})),...n)}}function D(e,t){const{checksumAddress:s,parameter:n}=t;let o=!1;const r=[];for(let i=0;i<n.components.length;i++){const a=n.components[i],d=Array.isArray(e)?i:a.name,f=B({checksumAddress:s,parameter:a,value:e[d]});r.push(f),f.dynamic&&(o=!0)}return{dynamic:o,encoded:o?A(r):c.concat(...r.map(({encoded:i})=>i))}}function P(e){const t=e.match(/^(.*)\[(\d+)?\]$/);return t?[t[2]?Number(t[2]):null,t[1]]:void 0}function p(e){var n;const{type:t}=e;if(t==="string"||t==="bytes"||t.endsWith("[]"))return!0;if(t==="tuple")return(n=e.components)==null?void 0:n.some(p);const s=P(e.type);return!!(s&&p({...e,type:s[1]}))}exports.decodeAddress=C;exports.decodeArray=I;exports.decodeBool=L;exports.decodeBytes=E;exports.decodeNumber=W;exports.decodeParameter=l;exports.decodeString=O;exports.decodeTuple=k;exports.encode=A;exports.encodeAddress=T;exports.encodeArray=_;exports.encodeBoolean=R;exports.encodeBytes=q;exports.encodeNumber=M;exports.encodeString=$;exports.encodeTuple=D;exports.getArrayComponents=P;exports.hasDynamicChild=p;exports.prepareParameter=B;exports.prepareParameters=F;