@gardenfi/utils 2.0.6-beta.1 → 2.0.6-beta.2

package/dist/index87.js

@@ -1,115 +1,174 @@
-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;
+import { InvalidLegacyVError as H } from "./index29.js";
+import { blobsToCommitments as g } from "./index59.js";
+import { blobsToProofs as B } from "./index60.js";
+import { commitmentsToVersionedHashes as V } from "./index61.js";
+import { toBlobSidecars as C } from "./index63.js";
+import { concatHex as h } from "./index76.js";
+import { trim as T } from "./index43.js";
+import { toHex as o, bytesToHex as k } from "./index24.js";
+import { toRlp as y } from "./index95.js";
+import { serializeAuthorizationList as w } from "./index104.js";
+import { assertTransactionEIP7702 as S, assertTransactionEIP4844 as _, assertTransactionEIP1559 as R, assertTransactionEIP2930 as Y, assertTransactionLegacy as j } from "./index102.js";
+import { getTransactionType as q } from "./index65.js";
+import { serializeAccessList as v } from "./index105.js";
+function te(e, r) {
+  const i = q(e);
+  return i === "eip1559" ? K(e, r) : i === "eip2930" ? M(e, r) : i === "eip4844" ? J(e, r) : i === "eip7702" ? D(e, r) : N(e, r);
+}
+function D(e, r) {
+  const { authorizationList: i, chainId: s, gas: n, nonce: c, to: f, value: a, maxFeePerGas: x, maxPriorityFeePerGas: t, accessList: p, data: l } = e;
+  S(e);
+  const d = v(p), m = w(i);
+  return h([
+    "0x04",
+    y([
+      o(s),
+      c ? o(c) : "0x",
+      t ? o(t) : "0x",
+      x ? o(x) : "0x",
+      n ? o(n) : "0x",
+      f ?? "0x",
+      a ? o(a) : "0x",
+      l ?? "0x",
+      d,
+      m,
+      ...I(e, r)
+    ])
+  ]);
+}
+function J(e, r) {
+  const { chainId: i, gas: s, nonce: n, to: c, value: f, maxFeePerBlobGas: a, maxFeePerGas: x, maxPriorityFeePerGas: t, accessList: p, data: l } = e;
+  _(e);
+  let d = e.blobVersionedHashes, m = e.sidecars;
+  if (e.blobs && (typeof d > "u" || typeof m > "u")) {
+    const u = typeof e.blobs[0] == "string" ? e.blobs : e.blobs.map((P) => k(P)), z = e.kzg, b = g({
+      blobs: u,
+      kzg: z
+    });
+    if (typeof d > "u" && (d = V({
+      commitments: b
+    })), typeof m > "u") {
+      const P = B({ blobs: u, commitments: b, kzg: z });
+      m = C({ blobs: u, commitments: b, proofs: P });
     }
-    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 L = v(p), E = [
+    o(i),
+    n ? o(n) : "0x",
+    t ? o(t) : "0x",
+    x ? o(x) : "0x",
+    s ? o(s) : "0x",
+    c ?? "0x",
+    f ? o(f) : "0x",
+    l ?? "0x",
+    L,
+    a ? o(a) : "0x",
+    d ?? [],
+    ...I(e, r)
+  ], A = [], F = [], G = [];
+  if (m)
+    for (let u = 0; u < m.length; u++) {
+      const { blob: z, commitment: b, proof: P } = m[u];
+      A.push(z), F.push(b), G.push(P);
+    }
+  return h([
+    "0x03",
+    m ? (
+      // If sidecars are enabled, envelope turns into a "wrapper":
+      y([E, A, F, G])
+    ) : (
+      // If sidecars are disabled, standard envelope is used:
+      y(E)
+    )
+  ]);
+}
+function K(e, r) {
+  const { chainId: i, gas: s, nonce: n, to: c, value: f, maxFeePerGas: a, maxPriorityFeePerGas: x, accessList: t, data: p } = e;
+  R(e);
+  const l = v(t), d = [
+    o(i),
+    n ? o(n) : "0x",
+    x ? o(x) : "0x",
+    a ? o(a) : "0x",
+    s ? o(s) : "0x",
+    c ?? "0x",
+    f ? o(f) : "0x",
+    p ?? "0x",
+    l,
+    ...I(e, r)
+  ];
+  return h([
+    "0x02",
+    y(d)
+  ]);
+}
+function M(e, r) {
+  const { chainId: i, gas: s, data: n, nonce: c, to: f, value: a, accessList: x, gasPrice: t } = e;
+  Y(e);
+  const p = v(x), l = [
+    o(i),
+    c ? o(c) : "0x",
+    t ? o(t) : "0x",
+    s ? o(s) : "0x",
+    f ?? "0x",
+    a ? o(a) : "0x",
+    n ?? "0x",
+    p,
+    ...I(e, r)
+  ];
+  return h([
+    "0x01",
+    y(l)
+  ]);
+}
+function N(e, r) {
+  const { chainId: i = 0, gas: s, data: n, nonce: c, to: f, value: a, gasPrice: x } = e;
+  j(e);
+  let t = [
+    c ? o(c) : "0x",
+    x ? o(x) : "0x",
+    s ? o(s) : "0x",
+    f ?? "0x",
+    a ? o(a) : "0x",
+    n ?? "0x"
+  ];
+  if (r) {
+    const p = (() => {
+      if (r.v >= 35n)
+        return (r.v - 35n) / 2n > 0 ? r.v : 27n + (r.v === 35n ? 0n : 1n);
+      if (i > 0)
+        return BigInt(i * 2) + BigInt(35n + r.v - 27n);
+      const m = 27n + (r.v === 27n ? 0n : 1n);
+      if (r.v !== m)
+        throw new H({ v: r.v });
+      return m;
+    })(), l = T(r.r), d = T(r.s);
+    t = [
+      ...t,
+      o(p),
+      l === "0x00" ? "0x" : l,
+      d === "0x00" ? "0x" : d
+    ];
+  } else i > 0 && (t = [
+    ...t,
+    o(i),
+    "0x",
+    "0x"
+  ]);
+  return y(t);
+}
+function I(e, r) {
+  const i = r ?? e, { v: s, yParity: n } = i;
+  if (typeof i.r > "u")
+    return [];
+  if (typeof i.s > "u")
+    return [];
+  if (typeof s > "u" && typeof n > "u")
+    return [];
+  const c = T(i.r), f = T(i.s);
+  return [typeof n == "number" ? n ? o(1) : "0x" : s === 0n ? "0x" : s === 1n ? o(1) : s === 27n ? "0x" : o(1), c === "0x00" ? "0x" : c, f === "0x00" ? "0x" : f];
 }
-const G = /* @__PURE__ */ D(() => new w());
 export {
-  w as SHA256,
-  G as sha256
+  te as serializeTransaction,
+  I as toYParitySignatureArray
 };

package/dist/index88.cjs

@@ -1 +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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function n(e){return{formatters:void 0,fees:void 0,serializers:void 0,...e}}exports.defineChain=n;

package/dist/index88.js

@@ -1,19 +1,11 @@
-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) {
+function n(e) {
   return {
-    hash: r,
-    hmac: (e, ...t) => c(r, e, m(...t)),
-    randomBytes: n
+    formatters: void 0,
+    fees: void 0,
+    serializers: void 0,
+    ...e
   };
 }
-function p(r, e) {
-  const t = (o) => a({ ...r, ...i(o) });
-  return { ...t(e), create: t };
-}
 export {
-  p as createCurve,
-  i as getHash
+  n as defineChain
 };

package/dist/index89.cjs

@@ -1 +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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index44.cjs");class i extends t.BaseError{constructor({offset:r,position:s,size:e}){super(`Slice ${s==="start"?"starting":"ending"} at offset "${r}" is out-of-bounds (size: ${e}).`,{name:"SliceOffsetOutOfBoundsError"})}}class d extends t.BaseError{constructor({size:r,targetSize:s,type:e}){super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`,{name:"SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=d;exports.SliceOffsetOutOfBoundsError=i;

package/dist/index89.js

@@ -1,226 +1,15 @@
-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;
+import { BaseError as o } from "./index44.js";
+class d extends o {
+  constructor({ offset: r, position: s, size: e }) {
+    super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${r}" is out-of-bounds (size: ${e}).`, { name: "SliceOffsetOutOfBoundsError" });
   }
-  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;
-    };
+class n extends o {
+  constructor({ size: r, targetSize: s, type: e }) {
+    super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
   }
-  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
+  n as SizeExceedsPaddingSizeError,
+  d as SliceOffsetOutOfBoundsError
 };

package/dist/index9.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index16.cjs"),l=require("./index7.cjs");class f{constructor(e){this.apiKey=e}async getToken(){const e=this.verifyToken();return e.error?t.Err(e.error):e.val?t.Ok(this.apiKey):t.Err("Token verification failed")}verifyToken(){const e=this.decodeBase64UrlSafe(this.apiKey),r=this.extractData(e);if(r.error)return t.Err(r.error);const{expiryTimestamp:i}=r.val;return i<new Date?t.Err("Token expired"):t.Ok(!0)}decodeBase64UrlSafe(e){let r=e.replace(/_/g,"/").replace(/-/g,"+");for(;r.length%4!==0;)r+="=";return Uint8Array.from(atob(r),i=>i.charCodeAt(0))}extractData(e){const r=new TextEncoder().encode("::"),i=e.findIndex((n,a)=>e.slice(a,a+r.length).every((u,d)=>u===r[d]));if(i===-1)return t.Err("Invalid format: delimiter not found");const o=e.slice(0,8),s=new DataView(o.buffer).getBigUint64(0,!1),c=e.slice(i+r.length);return t.Ok({expiryTimestamp:new Date(Number(s)*1e3),signature:Array.from(c).map(n=>n.toString(16).padStart(2,"0")).join("")})}async getAuthHeaders(){const e=await this.getToken();return e.ok?t.Ok({[l.AuthHeaderEnum.ApiKey]:e.val}):t.Err(e.error??"Failed to get auth token")}}exports.ApiKey=f;