@gardenfi/utils 2.0.4 → 2.0.6-alpha.0

package/dist/index85.js

@@ -0,0 +1,194 @@
+import { AbiEncodingLengthMismatchError as y, InvalidAbiEncodingTypeError as u, InvalidArrayError as g, AbiEncodingArrayLengthMismatchError as l, AbiEncodingBytesSizeMismatchError as b } from "./index68.js";
+import { InvalidAddressError as w } from "./index50.js";
+import { BaseError as A } from "./index63.js";
+import { IntegerOutOfRangeError as x } from "./index60.js";
+import { isAddress as z } from "./index51.js";
+import { concat as f } from "./index86.js";
+import { padHex as d } from "./index61.js";
+import { size as a } from "./index66.js";
+import { slice as E } from "./index99.js";
+import { numberToHex as m, boolToHex as P, stringToHex as S } from "./index25.js";
+import { integerRegex as I } from "./index82.js";
+function K(e, t) {
+  if (e.length !== t.length)
+    throw new y({
+      expectedLength: e.length,
+      givenLength: t.length
+    });
+  const o = L({
+    params: e,
+    values: t
+  }), n = h(o);
+  return n.length === 0 ? "0x" : n;
+}
+function L({ params: e, values: t }) {
+  const o = [];
+  for (let n = 0; n < e.length; n++)
+    o.push(p({ param: e[n], value: t[n] }));
+  return o;
+}
+function p({ param: e, value: t }) {
+  const o = W(e.type);
+  if (o) {
+    const [n, r] = o;
+    return M(t, { length: n, param: { ...e, type: r } });
+  }
+  if (e.type === "tuple")
+    return H(t, {
+      param: e
+    });
+  if (e.type === "address")
+    return B(t);
+  if (e.type === "bool")
+    return T(t);
+  if (e.type.startsWith("uint") || e.type.startsWith("int")) {
+    const n = e.type.startsWith("int"), [, , r = "256"] = I.exec(e.type) ?? [];
+    return $(t, {
+      signed: n,
+      size: Number(r)
+    });
+  }
+  if (e.type.startsWith("bytes"))
+    return N(t, { param: e });
+  if (e.type === "string")
+    return C(t);
+  throw new u(e.type, {
+    docsPath: "/docs/contract/encodeAbiParameters"
+  });
+}
+function h(e) {
+  let t = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? t += 32 : t += a(s);
+  }
+  const o = [], n = [];
+  let r = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? (o.push(m(t + r, { size: 32 })), n.push(s), r += a(s)) : o.push(s);
+  }
+  return f([...o, ...n]);
+}
+function B(e) {
+  if (!z(e))
+    throw new w({ address: e });
+  return { dynamic: !1, encoded: d(e.toLowerCase()) };
+}
+function M(e, { length: t, param: o }) {
+  const n = t === null;
+  if (!Array.isArray(e))
+    throw new g(e);
+  if (!n && e.length !== t)
+    throw new l({
+      expectedLength: t,
+      givenLength: e.length,
+      type: `${o.type}[${t}]`
+    });
+  let r = !1;
+  const i = [];
+  for (let c = 0; c < e.length; c++) {
+    const s = p({ param: o, value: e[c] });
+    s.dynamic && (r = !0), i.push(s);
+  }
+  if (n || r) {
+    const c = h(i);
+    if (n) {
+      const s = m(i.length, { size: 32 });
+      return {
+        dynamic: !0,
+        encoded: i.length > 0 ? f([s, c]) : s
+      };
+    }
+    if (r)
+      return { dynamic: !0, encoded: c };
+  }
+  return {
+    dynamic: !1,
+    encoded: f(i.map(({ encoded: c }) => c))
+  };
+}
+function N(e, { param: t }) {
+  const [, o] = t.type.split("bytes"), n = a(e);
+  if (!o) {
+    let r = e;
+    return n % 32 !== 0 && (r = d(r, {
+      dir: "right",
+      size: Math.ceil((e.length - 2) / 2 / 32) * 32
+    })), {
+      dynamic: !0,
+      encoded: f([d(m(n, { size: 32 })), r])
+    };
+  }
+  if (n !== Number.parseInt(o))
+    throw new b({
+      expectedSize: Number.parseInt(o),
+      value: e
+    });
+  return { dynamic: !1, encoded: d(e, { dir: "right" }) };
+}
+function T(e) {
+  if (typeof e != "boolean")
+    throw new A(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
+  return { dynamic: !1, encoded: d(P(e)) };
+}
+function $(e, { signed: t, size: o = 256 }) {
+  if (typeof o == "number") {
+    const n = 2n ** (BigInt(o) - (t ? 1n : 0n)) - 1n, r = t ? -n - 1n : 0n;
+    if (e > n || e < r)
+      throw new x({
+        max: n.toString(),
+        min: r.toString(),
+        signed: t,
+        size: o / 8,
+        value: e.toString()
+      });
+  }
+  return {
+    dynamic: !1,
+    encoded: m(e, {
+      size: 32,
+      signed: t
+    })
+  };
+}
+function C(e) {
+  const t = S(e), o = Math.ceil(a(t) / 32), n = [];
+  for (let r = 0; r < o; r++)
+    n.push(d(E(t, r * 32, (r + 1) * 32), {
+      dir: "right"
+    }));
+  return {
+    dynamic: !0,
+    encoded: f([
+      d(m(a(t), { size: 32 })),
+      ...n
+    ])
+  };
+}
+function H(e, { param: t }) {
+  let o = !1;
+  const n = [];
+  for (let r = 0; r < t.components.length; r++) {
+    const i = t.components[r], c = Array.isArray(e) ? r : i.name, s = p({
+      param: i,
+      value: e[c]
+    });
+    n.push(s), s.dynamic && (o = !0);
+  }
+  return {
+    dynamic: o,
+    encoded: o ? h(n) : f(n.map(({ encoded: r }) => r))
+  };
+}
+function W(e) {
+  const t = e.match(/^(.*)\[(\d+)?\]$/);
+  return t ? (
+    // Return `null` if the array is dynamic.
+    [t[2] ? Number(t[2]) : null, t[1]]
+  ) : void 0;
+}
+export {
+  K as encodeAbiParameters,
+  W as getArrayComponents
+};

package/dist/index86.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function a(t){return typeof t[0]=="string"?f(t):o(t)}function o(t){let n=0;for(const r of t)n+=r.length;const e=new Uint8Array(n);let c=0;for(const r of t)e.set(r,c),c+=r.length;return e}function f(t){return`0x${t.reduce((n,e)=>n+e.replace("0x",""),"")}`}exports.concat=a;exports.concatBytes=o;exports.concatHex=f;

package/dist/index86.js

@@ -0,0 +1,21 @@
+function i(t) {
+  return typeof t[0] == "string" ? f(t) : c(t);
+}
+function c(t) {
+  let n = 0;
+  for (const e of t)
+    n += e.length;
+  const r = new Uint8Array(n);
+  let o = 0;
+  for (const e of t)
+    r.set(e, o), o += e.length;
+  return r;
+}
+function f(t) {
+  return `0x${t.reduce((n, r) => n + r.replace("0x", ""), "")}`;
+}
+export {
+  i as concat,
+  c as concatBytes,
+  f as concatHex
+};

package/dist/index87.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index110.cjs"),s=require("./index111.cjs"),S=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),b=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),f=new Uint32Array(64);class g extends H.HashMD{constructor(){super(64,32,8,!1),this.A=b[0]|0,this.B=b[1]|0,this.C=b[2]|0,this.D=b[3]|0,this.E=b[4]|0,this.F=b[5]|0,this.G=b[6]|0,this.H=b[7]|0}get(){const{A:d,B:o,C:x,D:e,E:a,F:i,G:c,H:r}=this;return[d,o,x,e,a,i,c,r]}set(d,o,x,e,a,i,c,r){this.A=d|0,this.B=o|0,this.C=x|0,this.D=e|0,this.E=a|0,this.F=i|0,this.G=c|0,this.H=r|0}process(d,o){for(let t=0;t<16;t++,o+=4)f[t]=d.getUint32(o,!1);for(let t=16;t<64;t++){const A=f[t-15],n=f[t-2],C=s.rotr(A,7)^s.rotr(A,18)^A>>>3,u=s.rotr(n,17)^s.rotr(n,19)^n>>>10;f[t]=u+f[t-7]+C+f[t-16]|0}let{A:x,B:e,C:a,D:i,E:c,F:r,G:h,H:l}=this;for(let t=0;t<64;t++){const A=s.rotr(c,6)^s.rotr(c,11)^s.rotr(c,25),n=l+A+H.Chi(c,r,h)+S[t]+f[t]|0,u=(s.rotr(x,2)^s.rotr(x,13)^s.rotr(x,22))+H.Maj(x,e,a)|0;l=h,h=r,r=c,c=i+n|0,i=a,a=e,e=x,x=n+u|0}x=x+this.A|0,e=e+this.B|0,a=a+this.C|0,i=i+this.D|0,c=c+this.E|0,r=r+this.F|0,h=h+this.G|0,l=l+this.H|0,this.set(x,e,a,i,c,r,h,l)}roundClean(){f.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const y=s.wrapConstructor(()=>new g);exports.SHA256=g;exports.sha256=y;

package/dist/index87.js

@@ -0,0 +1,115 @@
+import { HashMD as m, Chi as p, Maj as u } from "./index110.js";
+import { wrapConstructor as D, rotr as i } from "./index111.js";
+const g = /* @__PURE__ */ new Uint32Array([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), b = /* @__PURE__ */ new Uint32Array([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class w extends m {
+  constructor() {
+    super(64, 32, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
+  }
+  get() {
+    const { A: d, B: o, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [d, o, t, s, a, f, c, e];
+  }
+  // prettier-ignore
+  set(d, o, t, s, a, f, c, e) {
+    this.A = d | 0, this.B = o | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
+  }
+  process(d, o) {
+    for (let x = 0; x < 16; x++, o += 4)
+      h[x] = d.getUint32(o, !1);
+    for (let x = 16; x < 64; x++) {
+      const A = h[x - 15], n = h[x - 2], C = i(A, 7) ^ i(A, 18) ^ A >>> 3, H = i(n, 17) ^ i(n, 19) ^ n >>> 10;
+      h[x] = H + h[x - 7] + C + h[x - 16] | 0;
+    }
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: r, H: l } = this;
+    for (let x = 0; x < 64; x++) {
+      const A = i(c, 6) ^ i(c, 11) ^ i(c, 25), n = l + A + p(c, e, r) + g[x] + h[x] | 0, H = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + u(t, s, a) | 0;
+      l = r, r = e, e = c, c = f + n | 0, f = a, a = s, s = t, t = n + H | 0;
+    }
+    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, r = r + this.G | 0, l = l + this.H | 0, this.set(t, s, a, f, c, e, r, l);
+  }
+  roundClean() {
+    h.fill(0);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
+  }
+}
+const G = /* @__PURE__ */ D(() => new w());
+export {
+  w as SHA256,
+  G as sha256
+};

package/dist/index88.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index114.cjs"),s=require("./index111.cjs"),o=require("./index115.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;

package/dist/index88.js

@@ -0,0 +1,19 @@
+import { hmac as c } from "./index114.js";
+import { concatBytes as m, randomBytes as n } from "./index111.js";
+import { weierstrass as a } from "./index115.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function i(r) {
+  return {
+    hash: r,
+    hmac: (e, ...t) => c(r, e, m(...t)),
+    randomBytes: n
+  };
+}
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
+}
+export {
+  p as createCurve,
+  i as getHash
+};

package/dist/index89.cjs

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

package/dist/index89.js

@@ -0,0 +1,226 @@
+import { bitMask as _, numberToBytesLE as S, numberToBytesBE as x, bytesToNumberLE as y, bytesToNumberBE as L, validateObject as M } from "./index116.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), c = BigInt(1), w = /* @__PURE__ */ BigInt(2), C = /* @__PURE__ */ BigInt(3), b = /* @__PURE__ */ BigInt(4), N = /* @__PURE__ */ BigInt(5), m = /* @__PURE__ */ BigInt(8);
+function g(t, i) {
+  const r = t % i;
+  return r >= d ? r : i + r;
+}
+function Z(t, i, r) {
+  if (i < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r <= d)
+    throw new Error("invalid modulus");
+  if (r === c)
+    return d;
+  let e = c;
+  for (; i > d; )
+    i & c && (e = e * t % r), t = t * t % r, i >>= c;
+  return e;
+}
+function V(t, i, r) {
+  let e = t;
+  for (; i-- > d; )
+    e *= e, e %= r;
+  return e;
+}
+function I(t, i) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (i <= d)
+    throw new Error("invert: expected positive modulus, got " + i);
+  let r = g(t, i), e = i, s = d, u = c;
+  for (; r !== d; ) {
+    const o = e / r, n = e % r, l = s - u * o;
+    e = r, r = n, s = u, u = l;
+  }
+  if (e !== c)
+    throw new Error("invert: does not exist");
+  return g(s, i);
+}
+function j(t) {
+  const i = (t - c) / w;
+  let r, e, s;
+  for (r = t - c, e = 0; r % w === d; r /= w, e++)
+    ;
+  for (s = w; s < t && Z(s, i, t) !== t - c; s++)
+    if (s > 1e3)
+      throw new Error("Cannot find square root: likely non-prime P");
+  if (e === 1) {
+    const f = (t + c) / b;
+    return function(n, l) {
+      const h = n.pow(l, f);
+      if (!n.eql(n.sqr(h), l))
+        throw new Error("Cannot find square root");
+      return h;
+    };
+  }
+  const u = (r + c) / w;
+  return function(o, n) {
+    if (o.pow(n, i) === o.neg(o.ONE))
+      throw new Error("Cannot find square root");
+    let l = e, h = o.pow(o.mul(o.ONE, s), r), v = o.pow(n, u), a = o.pow(n, r);
+    for (; !o.eql(a, o.ONE); ) {
+      if (o.eql(a, o.ZERO))
+        return o.ZERO;
+      let q = 1;
+      for (let B = o.sqr(a); q < l && !o.eql(B, o.ONE); q++)
+        B = o.sqr(B);
+      const E = o.pow(h, c << BigInt(l - q - 1));
+      h = o.sqr(E), v = o.mul(v, E), a = o.mul(a, h), l = q;
+    }
+    return v;
+  };
+}
+function z(t) {
+  if (t % b === C) {
+    const i = (t + c) / b;
+    return function(e, s) {
+      const u = e.pow(s, i);
+      if (!e.eql(e.sqr(u), s))
+        throw new Error("Cannot find square root");
+      return u;
+    };
+  }
+  if (t % m === N) {
+    const i = (t - N) / m;
+    return function(e, s) {
+      const u = e.mul(s, w), f = e.pow(u, i), o = e.mul(s, f), n = e.mul(e.mul(o, w), f), l = e.mul(o, e.sub(n, e.ONE));
+      if (!e.eql(e.sqr(l), s))
+        throw new Error("Cannot find square root");
+      return l;
+    };
+  }
+  return j(t);
+}
+const A = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function Y(t) {
+  const i = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, r = A.reduce((e, s) => (e[s] = "function", e), i);
+  return M(t, r);
+}
+function k(t, i, r) {
+  if (r < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r === d)
+    return t.ONE;
+  if (r === c)
+    return i;
+  let e = t.ONE, s = i;
+  for (; r > d; )
+    r & c && (e = t.mul(e, s)), s = t.sqr(s), r >>= c;
+  return e;
+}
+function H(t, i) {
+  const r = new Array(i.length), e = i.reduce((u, f, o) => t.is0(f) ? u : (r[o] = u, t.mul(u, f)), t.ONE), s = t.inv(e);
+  return i.reduceRight((u, f, o) => t.is0(f) ? u : (r[o] = t.mul(u, r[o]), t.mul(u, f)), s), r;
+}
+function K(t, i) {
+  const r = i !== void 0 ? i : t.toString(2).length, e = Math.ceil(r / 8);
+  return { nBitLength: r, nByteLength: e };
+}
+function p(t, i, r = !1, e = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: u } = K(t, i);
+  if (u > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let f;
+  const o = Object.freeze({
+    ORDER: t,
+    isLE: r,
+    BITS: s,
+    BYTES: u,
+    MASK: _(s),
+    ZERO: d,
+    ONE: c,
+    create: (n) => g(n, t),
+    isValid: (n) => {
+      if (typeof n != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof n);
+      return d <= n && n < t;
+    },
+    is0: (n) => n === d,
+    isOdd: (n) => (n & c) === c,
+    neg: (n) => g(-n, t),
+    eql: (n, l) => n === l,
+    sqr: (n) => g(n * n, t),
+    add: (n, l) => g(n + l, t),
+    sub: (n, l) => g(n - l, t),
+    mul: (n, l) => g(n * l, t),
+    pow: (n, l) => k(o, n, l),
+    div: (n, l) => g(n * I(l, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (n) => n * n,
+    addN: (n, l) => n + l,
+    subN: (n, l) => n - l,
+    mulN: (n, l) => n * l,
+    inv: (n) => I(n, t),
+    sqrt: e.sqrt || ((n) => (f || (f = z(t)), f(o, n))),
+    invertBatch: (n) => H(o, n),
+    // TODO: do we really need constant cmov?
+    // We don't have const-time bigints anyway, so probably will be not very useful
+    cmov: (n, l, h) => h ? l : n,
+    toBytes: (n) => r ? S(n, u) : x(n, u),
+    fromBytes: (n) => {
+      if (n.length !== u)
+        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + n.length);
+      return r ? y(n) : L(n);
+    }
+  });
+  return Object.freeze(o);
+}
+function T(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const i = t.toString(2).length;
+  return Math.ceil(i / 8);
+}
+function O(t) {
+  const i = T(t);
+  return i + Math.ceil(i / 2);
+}
+function G(t, i, r = !1) {
+  const e = t.length, s = T(i), u = O(i);
+  if (e < 16 || e < u || e > 1024)
+    throw new Error("expected " + u + "-1024 bytes of input, got " + e);
+  const f = r ? y(t) : L(t), o = g(f, i - c) + c;
+  return r ? S(o, s) : x(o, s);
+}
+export {
+  p as Field,
+  H as FpInvertBatch,
+  k as FpPow,
+  z as FpSqrt,
+  T as getFieldBytesLength,
+  O as getMinHashLength,
+  I as invert,
+  G as mapHashToField,
+  g as mod,
+  K as nLength,
+  Z as pow,
+  V as pow2,
+  j as tonelliShanks,
+  Y as validateField
+};

package/dist/index9.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var t=(e=>(e.AUTH_TOKEN="auth_token",e))(t||{});exports.StoreKeys=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index17.cjs"),f=require("./index13.cjs"),h=require("./index14.cjs"),d=require("viem"),o=require("./index3.cjs"),g=require("./index7.cjs"),w=require("./index19.cjs"),m=require("./index20.cjs"),y=require("./index21.cjs");class c{constructor(n,i,e){this.API=new g.Url("https://api.garden.finance"),this.url=n??this.API,this.walletClient=i,this.domain=(e==null?void 0:e.domain)||"app.garden.finance",this.domain.startsWith("https://")&&(this.domain=this.domain.split("https://")[1]),this.signingStatement=(e==null?void 0:e.signingStatement)??"Garden.fi",this.store=(e==null?void 0:e.store)??new f.MemoryStorage}static fromDigestKey(n,i,e){const r=d.createWalletClient({account:w.privateKeyToAccount(o.add0x(i.digestKey)),transport:d.http(),chain:m.mainnet});return new c(n,r,e)}verifyToken(n,i){try{const e=o.parseJwt(n);if(!e)return t.Ok(!1);const r=Math.floor(Date.now()/1e3)+120;return t.Ok(e.exp>r&&e.user_id.toLowerCase()===i.toLowerCase())}catch{return t.Ok(!1)}}async getToken(){var a;if(!((a=this.walletClient.account)!=null&&a.address))return t.Err("Wallet client does not have an account");const n=this.store.getItem(h.StoreKeys.AUTH_TOKEN);if(n){const s=this.verifyToken(n,this.walletClient.account.address);if(s.ok&&s.val)return t.Ok(n)}const i=await this.signStatement();if(i.error)return t.Err(i.error);const e=await t.Fetcher.post(this.url.endpoint("verify"),{body:JSON.stringify({...i.val}),headers:{"Content-Type":"application/json"}});if(e.error)return t.Err(e.error);const r=e.result;if(!r)return t.Err("Failed to get token");if(!this.verifyToken(r,this.walletClient.account.address).val)throw new Error("Token verification failed");return this.store.setItem(h.StoreKeys.AUTH_TOKEN,r),t.Ok(r)}async signStatement(){var u;if(!((u=this.walletClient.account)!=null&&u.address))return t.Err("Wallet client does not have a valid account");const n=new Date,i=new Date(n.getTime()+300*1e3),r=(await t.Fetcher.get(this.url.endpoint("nonce"))).result;if(!r)return t.Err("Failed to get nonce");const l=await this.walletClient.getChainId(),a=y.createSiweMessage({domain:this.domain,address:this.walletClient.account.address,statement:this.signingStatement,nonce:r,uri:"https://"+this.domain,version:"1",chainId:l,notBefore:i}),s=await this.walletClient.signMessage({account:this.walletClient.account,message:a});return t.Ok({message:a,signature:s,nonce:r})}async getAuthHeaders(){const n=await this.getToken();return n.error?t.Err(n.error):t.Ok({Authorization:o.Authorization(n.val)})}}exports.Siwe=c;