@gardenfi/utils 2.1.2-beta.7 → 2.1.2-beta.9

package/dist/index93.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index54.cjs"),y=require("./index55.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const I=BigInt(0),p=BigInt(1);function m(e,r){const t=r.negate();return e?t:r}function E(e,r){if(!Number.isSafeInteger(e)||e<=0||e>r)throw new Error("invalid window size, expected [1.."+r+"], got W="+e)}function b(e,r){E(e,r);const t=Math.ceil(r/e)+1,n=2**(e-1);return{windows:t,windowSize:n}}function O(e,r){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof r))throw new Error("invalid point at index "+n)})}function x(e,r){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!r.isValid(t))throw new Error("invalid scalar at index "+n)})}const B=new WeakMap,N=new WeakMap;function S(e){return N.get(e)||1}function L(e,r){return{constTimeNegate:m,hasPrecomputes(t){return S(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>I;)n&p&&(o=o.add(i)),i=i.double(),n>>=p;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,r),a=[];let c=t,d=c;for(let g=0;g<o;g++){d=c,a.push(d);for(let l=1;l<i;l++)d=d.add(c),a.push(d);c=d.double()}return a},wNAF(t,n,o){const{windows:i,windowSize:a}=b(t,r);let c=e.ZERO,d=e.BASE;const g=BigInt(2**t-1),l=2**t,w=BigInt(t);for(let u=0;u<i;u++){const s=u*a;let f=Number(o&g);o>>=w,f>a&&(f-=l,o+=p);const h=s,M=s+Math.abs(f)-1,F=u%2!==0,z=f<0;f===0?d=d.add(m(F,n[h])):c=c.add(m(z,n[M]))}return{p:c,f:d}},wNAFUnsafe(t,n,o,i=e.ZERO){const{windows:a,windowSize:c}=b(t,r),d=BigInt(2**t-1),g=2**t,l=BigInt(t);for(let w=0;w<a;w++){const u=w*c;if(o===I)break;let s=Number(o&d);if(o>>=l,s>c&&(s-=g,o+=p),s===0)continue;let f=n[u+Math.abs(s)-1];s<0&&(f=f.negate()),i=i.add(f)}return i},getPrecomputes(t,n,o){let i=B.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&B.set(n,o(i))),i},wNAFCached(t,n,o){const i=S(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const a=S(t);return a===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(a,this.getPrecomputes(a,t,o),n,i)},setWindowSize(t,n){E(n,r),N.set(t,n),B.delete(t)}}}function j(e,r,t,n){if(O(t,e),x(n,r),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=y.bitLen(BigInt(t.length)),a=i>12?i-3:i>4?i-2:i?2:1,c=(1<<a)-1,d=new Array(c+1).fill(o),g=Math.floor((r.BITS-1)/a)*a;let l=o;for(let w=g;w>=0;w-=a){d.fill(o);for(let s=0;s<n.length;s++){const f=n[s],h=Number(f>>BigInt(w)&BigInt(c));d[h]=d[h].add(t[s])}let u=o;for(let s=d.length-1,f=o;s>0;s--)f=f.add(d[s]),u=u.add(f);if(l=l.add(u),w!==0)for(let s=0;s<a;s++)l=l.double()}return l}function k(e){return A.validateField(e.Fp),y.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=j;exports.validateBasic=k;exports.wNAF=L;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;

package/dist/index93.js

@@ -1,175 +1,21 @@
-import { validateField as z, nLength as F } from "./index54.js";
-import { validateObject as x, bitLen as O } from "./index55.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const I = BigInt(0), p = BigInt(1);
-function m(e, r) {
-  const t = r.negate();
-  return e ? t : r;
-}
-function A(e, r) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > r)
-    throw new Error("invalid window size, expected [1.." + r + "], got W=" + e);
-}
-function b(e, r) {
-  A(e, r);
-  const t = Math.ceil(r / e) + 1, n = 2 ** (e - 1);
-  return { windows: t, windowSize: n };
-}
-function L(e, r) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-  e.forEach((t, n) => {
-    if (!(t instanceof r))
-      throw new Error("invalid point at index " + n);
-  });
-}
-function k(e, r) {
-  if (!Array.isArray(e))
-    throw new Error("array of scalars expected");
-  e.forEach((t, n) => {
-    if (!r.isValid(t))
-      throw new Error("invalid scalar at index " + n);
-  });
-}
-const B = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap();
-function S(e) {
-  return E.get(e) || 1;
-}
-function v(e, r) {
-  return {
-    constTimeNegate: m,
-    hasPrecomputes(t) {
-      return S(t) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(t, n, i = e.ZERO) {
-      let o = t;
-      for (; n > I; )
-        n & p && (i = i.add(o)), o = o.double(), n >>= p;
-      return i;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(t, n) {
-      const { windows: i, windowSize: o } = b(n, r), a = [];
-      let c = t, d = c;
-      for (let h = 0; h < i; h++) {
-        d = c, a.push(d);
-        for (let w = 1; w < o; w++)
-          d = d.add(c), a.push(d);
-        c = d.double();
-      }
-      return a;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(t, n, i) {
-      const { windows: o, windowSize: a } = b(t, r);
-      let c = e.ZERO, d = e.BASE;
-      const h = BigInt(2 ** t - 1), w = 2 ** t, l = BigInt(t);
-      for (let u = 0; u < o; u++) {
-        const s = u * a;
-        let f = Number(i & h);
-        i >>= l, f > a && (f -= w, i += p);
-        const g = s, N = s + Math.abs(f) - 1, y = u % 2 !== 0, M = f < 0;
-        f === 0 ? d = d.add(m(y, n[g])) : c = c.add(m(M, n[N]));
-      }
-      return { p: c, f: d };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(t, n, i, o = e.ZERO) {
-      const { windows: a, windowSize: c } = b(t, r), d = BigInt(2 ** t - 1), h = 2 ** t, w = BigInt(t);
-      for (let l = 0; l < a; l++) {
-        const u = l * c;
-        if (i === I)
-          break;
-        let s = Number(i & d);
-        if (i >>= w, s > c && (s -= h, i += p), s === 0)
-          continue;
-        let f = n[u + Math.abs(s) - 1];
-        s < 0 && (f = f.negate()), o = o.add(f);
-      }
-      return o;
-    },
-    getPrecomputes(t, n, i) {
-      let o = B.get(n);
-      return o || (o = this.precomputeWindow(n, t), t !== 1 && B.set(n, i(o))), o;
-    },
-    wNAFCached(t, n, i) {
-      const o = S(t);
-      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
-    },
-    wNAFCachedUnsafe(t, n, i, o) {
-      const a = S(t);
-      return a === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(a, this.getPrecomputes(a, t, i), n, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(t, n) {
-      A(n, r), E.set(t, n), B.delete(t);
-    }
-  };
-}
-function Z(e, r, t, n) {
-  if (L(t, e), k(n, r), t.length !== n.length)
-    throw new Error("arrays of points and scalars must have equal length");
-  const i = e.ZERO, o = O(BigInt(t.length)), a = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, c = (1 << a) - 1, d = new Array(c + 1).fill(i), h = Math.floor((r.BITS - 1) / a) * a;
-  let w = i;
-  for (let l = h; l >= 0; l -= a) {
-    d.fill(i);
-    for (let s = 0; s < n.length; s++) {
-      const f = n[s], g = Number(f >> BigInt(l) & BigInt(c));
-      d[g] = d[g].add(t[s]);
-    }
-    let u = i;
-    for (let s = d.length - 1, f = i; s > 0; s--)
-      f = f.add(d[s]), u = u.add(f);
-    if (w = w.add(u), l !== 0)
-      for (let s = 0; s < a; s++)
-        w = w.double();
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function f(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
+  for (let e = 0; e < t.length; e++) {
+    const { h: c, l: u } = f(t[e], r);
+    [n[e], l[e]] = [c, u];
   }
-  return w;
-}
-function U(e) {
-  return z(e.Fp), x(e, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...F(e.n, e.nBitLength),
-    ...e,
-    p: e.Fp.ORDER
-  });
+  return [n, l];
 }
+const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  Z as pippenger,
-  U as validateBasic,
-  v as wNAF
+  f as fromBig,
+  A as rotlBH,
+  B as rotlBL,
+  g as rotlSH,
+  m as rotlSL,
+  h as split
 };

package/dist/index95.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=`Ethereum Signed Message:
-`;exports.presignMessagePrefix=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=1;exports.versionedHashVersionKzg=e;

package/dist/index95.js

@@ -1,5 +1,4 @@
-const e = `Ethereum Signed Message:
-`;
+const e = 1;
 export {
-  e as presignMessagePrefix
+  e as versionedHashVersionKzg
 };

package/dist/index96.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=1;exports.versionedHashVersionKzg=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=2n**256n-1n;exports.maxUint256=t;

package/dist/index96.js

@@ -1,4 +1,4 @@
-const e = 1;
+const n = 2n ** 256n - 1n;
 export {
-  e as versionedHashVersionKzg
+  n as maxUint256
 };

package/dist/index97.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=2n**256n-1n;exports.maxUint256=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index95.cjs"),s=require("./index50.cjs");class i extends s.BaseError{constructor({maxSize:e,size:r}){super("Blob size is too large.",{metaMessages:[`Max: ${e} bytes`,`Given: ${r} bytes`],name:"BlobSizeTooLargeError"})}}class n extends s.BaseError{constructor(){super("Blob data must not be empty.",{name:"EmptyBlobError"})}}class t extends s.BaseError{constructor({hash:e,size:r}){super(`Versioned hash "${e}" size is invalid.`,{metaMessages:["Expected: 32",`Received: ${r}`],name:"InvalidVersionedHashSizeError"})}}class d extends s.BaseError{constructor({hash:e,version:r}){super(`Versioned hash "${e}" version is invalid.`,{metaMessages:[`Expected: ${a.versionedHashVersionKzg}`,`Received: ${r}`],name:"InvalidVersionedHashVersionError"})}}exports.BlobSizeTooLargeError=i;exports.EmptyBlobError=n;exports.InvalidVersionedHashSizeError=t;exports.InvalidVersionedHashVersionError=d;

package/dist/index97.js

@@ -1,4 +1,40 @@
-const n = 2n ** 256n - 1n;
+import { versionedHashVersionKzg as a } from "./index95.js";
+import { BaseError as s } from "./index50.js";
+class t extends s {
+  constructor({ maxSize: e, size: r }) {
+    super("Blob size is too large.", {
+      metaMessages: [`Max: ${e} bytes`, `Given: ${r} bytes`],
+      name: "BlobSizeTooLargeError"
+    });
+  }
+}
+class d extends s {
+  constructor() {
+    super("Blob data must not be empty.", { name: "EmptyBlobError" });
+  }
+}
+class l extends s {
+  constructor({ hash: e, size: r }) {
+    super(`Versioned hash "${e}" size is invalid.`, {
+      metaMessages: ["Expected: 32", `Received: ${r}`],
+      name: "InvalidVersionedHashSizeError"
+    });
+  }
+}
+class c extends s {
+  constructor({ hash: e, version: r }) {
+    super(`Versioned hash "${e}" version is invalid.`, {
+      metaMessages: [
+        `Expected: ${a}`,
+        `Received: ${r}`
+      ],
+      name: "InvalidVersionedHashVersionError"
+    });
+  }
+}
 export {
-  n as maxUint256
+  t as BlobSizeTooLargeError,
+  d as EmptyBlobError,
+  l as InvalidVersionedHashSizeError,
+  c as InvalidVersionedHashVersionError
 };

package/dist/index98.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index96.cjs"),s=require("./index56.cjs");class i extends s.BaseError{constructor({maxSize:e,size:r}){super("Blob size is too large.",{metaMessages:[`Max: ${e} bytes`,`Given: ${r} bytes`],name:"BlobSizeTooLargeError"})}}class n extends s.BaseError{constructor(){super("Blob data must not be empty.",{name:"EmptyBlobError"})}}class t extends s.BaseError{constructor({hash:e,size:r}){super(`Versioned hash "${e}" size is invalid.`,{metaMessages:["Expected: 32",`Received: ${r}`],name:"InvalidVersionedHashSizeError"})}}class d extends s.BaseError{constructor({hash:e,version:r}){super(`Versioned hash "${e}" version is invalid.`,{metaMessages:[`Expected: ${a.versionedHashVersionKzg}`,`Received: ${r}`],name:"InvalidVersionedHashVersionError"})}}exports.BlobSizeTooLargeError=i;exports.EmptyBlobError=n;exports.InvalidVersionedHashSizeError=t;exports.InvalidVersionedHashVersionError=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index89.cjs"),O=require("./index53.cjs"),n=require("./index68.cjs");function p(i,e,s,{strict:f}={}){return O.isHex(i,{strict:!1})?l(i,e,s,{strict:f}):u(i,e,s,{strict:f})}function r(i,e){if(typeof e=="number"&&e>0&&e>n.size(i)-1)throw new t.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:n.size(i)})}function c(i,e,s){if(typeof e=="number"&&typeof s=="number"&&n.size(i)!==s-e)throw new t.SliceOffsetOutOfBoundsError({offset:s,position:"end",size:n.size(i)})}function u(i,e,s,{strict:f}={}){r(i,e);const o=i.slice(e,s);return f&&c(o,e,s),o}function l(i,e,s,{strict:f}={}){r(i,e);const o=`0x${i.replace("0x","").slice((e??0)*2,(s??i.length)*2)}`;return f&&c(o,e,s),o}exports.slice=p;exports.sliceBytes=u;exports.sliceHex=l;

package/dist/index98.js

@@ -1,40 +1,41 @@
-import { versionedHashVersionKzg as a } from "./index96.js";
-import { BaseError as s } from "./index56.js";
-class t extends s {
-  constructor({ maxSize: e, size: r }) {
-    super("Blob size is too large.", {
-      metaMessages: [`Max: ${e} bytes`, `Given: ${r} bytes`],
-      name: "BlobSizeTooLargeError"
-    });
-  }
-}
-class d extends s {
-  constructor() {
-    super("Blob data must not be empty.", { name: "EmptyBlobError" });
-  }
+import { SliceOffsetOutOfBoundsError as t } from "./index89.js";
+import { isHex as p } from "./index53.js";
+import { size as r } from "./index68.js";
+function w(e, f, i, { strict: o } = {}) {
+  return p(e, { strict: !1 }) ? u(e, f, i, {
+    strict: o
+  }) : m(e, f, i, {
+    strict: o
+  });
 }
-class l extends s {
-  constructor({ hash: e, size: r }) {
-    super(`Versioned hash "${e}" size is invalid.`, {
-      metaMessages: ["Expected: 32", `Received: ${r}`],
-      name: "InvalidVersionedHashSizeError"
+function s(e, f) {
+  if (typeof f == "number" && f > 0 && f > r(e) - 1)
+    throw new t({
+      offset: f,
+      position: "start",
+      size: r(e)
     });
-  }
 }
-class c extends s {
-  constructor({ hash: e, version: r }) {
-    super(`Versioned hash "${e}" version is invalid.`, {
-      metaMessages: [
-        `Expected: ${a}`,
-        `Received: ${r}`
-      ],
-      name: "InvalidVersionedHashVersionError"
+function c(e, f, i) {
+  if (typeof f == "number" && typeof i == "number" && r(e) !== i - f)
+    throw new t({
+      offset: i,
+      position: "end",
+      size: r(e)
     });
-  }
+}
+function m(e, f, i, { strict: o } = {}) {
+  s(e, f);
+  const n = e.slice(f, i);
+  return o && c(n, f, i), n;
+}
+function u(e, f, i, { strict: o } = {}) {
+  s(e, f);
+  const n = `0x${e.replace("0x", "").slice((f ?? 0) * 2, (i ?? e.length) * 2)}`;
+  return o && c(n, f, i), n;
 }
 export {
-  t as BlobSizeTooLargeError,
-  d as EmptyBlobError,
-  l as InvalidVersionedHashSizeError,
-  c as InvalidVersionedHashVersionError
+  w as slice,
+  m as sliceBytes,
+  u as sliceHex
 };

package/dist/index99.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index90.cjs"),O=require("./index59.cjs"),n=require("./index74.cjs");function p(i,e,s,{strict:f}={}){return O.isHex(i,{strict:!1})?l(i,e,s,{strict:f}):u(i,e,s,{strict:f})}function r(i,e){if(typeof e=="number"&&e>0&&e>n.size(i)-1)throw new t.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:n.size(i)})}function c(i,e,s){if(typeof e=="number"&&typeof s=="number"&&n.size(i)!==s-e)throw new t.SliceOffsetOutOfBoundsError({offset:s,position:"end",size:n.size(i)})}function u(i,e,s,{strict:f}={}){r(i,e);const o=i.slice(e,s);return f&&c(o,e,s),o}function l(i,e,s,{strict:f}={}){r(i,e);const o=`0x${i.replace("0x","").slice((e??0)*2,(s??i.length)*2)}`;return f&&c(o,e,s),o}exports.slice=p;exports.sliceBytes=u;exports.sliceHex=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=`Ethereum Signed Message:
+`;exports.presignMessagePrefix=e;

package/dist/index99.js

@@ -1,41 +1,5 @@
-import { SliceOffsetOutOfBoundsError as t } from "./index90.js";
-import { isHex as p } from "./index59.js";
-import { size as r } from "./index74.js";
-function w(e, f, i, { strict: o } = {}) {
-  return p(e, { strict: !1 }) ? u(e, f, i, {
-    strict: o
-  }) : m(e, f, i, {
-    strict: o
-  });
-}
-function s(e, f) {
-  if (typeof f == "number" && f > 0 && f > r(e) - 1)
-    throw new t({
-      offset: f,
-      position: "start",
-      size: r(e)
-    });
-}
-function c(e, f, i) {
-  if (typeof f == "number" && typeof i == "number" && r(e) !== i - f)
-    throw new t({
-      offset: i,
-      position: "end",
-      size: r(e)
-    });
-}
-function m(e, f, i, { strict: o } = {}) {
-  s(e, f);
-  const n = e.slice(f, i);
-  return o && c(n, f, i), n;
-}
-function u(e, f, i, { strict: o } = {}) {
-  s(e, f);
-  const n = `0x${e.replace("0x", "").slice((f ?? 0) * 2, (i ?? e.length) * 2)}`;
-  return o && c(n, f, i), n;
-}
+const e = `Ethereum Signed Message:
+`;
 export {
-  w as slice,
-  m as sliceBytes,
-  u as sliceHex
+  e as presignMessagePrefix
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gardenfi/utils",
-  "version": "2.1.2-beta.7",
+  "version": "2.1.2-beta.9",
   "type": "module",
   "scripts": {
     "build": "vite build",