@gardenfi/utils 2.0.6 → 2.1.0

package/dist/index103.js

@@ -1,4 +1,22 @@
-const e = 1;
+function o(e) {
+  if (/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
+    return !1;
+  const s = a(e), f = s[1], t = s[2], i = s[3], r = s[4], l = s[5];
+  if (!(f != null && f.length && i.length >= 0))
+    return !1;
+  if (t != null && t.length) {
+    if (!(i.length === 0 || /^\//.test(i)))
+      return !1;
+  } else if (/^\/\//.test(i))
+    return !1;
+  if (!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))
+    return !1;
+  let n = "";
+  return n += `${f}:`, t != null && t.length && (n += `//${t}`), n += i, r != null && r.length && (n += `?${r}`), l != null && l.length && (n += `#${l}`), n;
+}
+function a(e) {
+  return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
+}
 export {
-  e as versionedHashVersionKzg
+  o as isUri
 };

package/dist/index104.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index24.cjs"),c=require("./index88.cjs");function u(t){if(!t||t.length===0)return[];const e=[];for(const n of t){const{contractAddress:s,chainId:r,nonce:i,...a}=n;e.push([r?o.toHex(r):"0x",s,i?o.toHex(i):"0x",...c.toYParitySignatureArray({},a)])}return e}exports.serializeAuthorizationList=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index63.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/index104.js

@@ -1,20 +1,15 @@
-import { toHex as i } from "./index24.js";
-import { toYParitySignatureArray as c } from "./index88.js";
-function d(r) {
-  if (!r || r.length === 0)
-    return [];
-  const t = [];
-  for (const e of r) {
-    const { contractAddress: s, chainId: o, nonce: n, ...a } = e;
-    t.push([
-      o ? i(o) : "0x",
-      s,
-      n ? i(n) : "0x",
-      ...c({}, a)
-    ]);
+import { BaseError as o } from "./index63.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" });
+  }
+}
+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" });
   }
-  return t;
 }
 export {
-  d as serializeAuthorizationList
+  n as SizeExceedsPaddingSizeError,
+  d as SliceOffsetOutOfBoundsError
 };

package/dist/index105.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index54.cjs"),d=require("./index29.cjs"),l=require("./index58.cjs");function a(e){if(!e||e.length===0)return[];const n=[];for(let t=0;t<e.length;t++){const{address:i,storageKeys:r}=e[t];for(let s=0;s<r.length;s++)if(r[s].length-2!==64)throw new d.InvalidStorageKeySizeError({storageKey:r[s]});if(!l.isAddress(i,{strict:!1}))throw new o.InvalidAddressError({address:i});n.push([i,r])}return n}exports.serializeAccessList=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index104.cjs"),O=require("./index84.cjs"),n=require("./index67.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/index105.js

@@ -1,21 +1,41 @@
-import { InvalidAddressError as s } from "./index54.js";
-import { InvalidStorageKeySizeError as l } from "./index29.js";
-import { isAddress as f } from "./index58.js";
-function a(r) {
-  if (!r || r.length === 0)
-    return [];
-  const n = [];
-  for (let o = 0; o < r.length; o++) {
-    const { address: i, storageKeys: e } = r[o];
-    for (let t = 0; t < e.length; t++)
-      if (e[t].length - 2 !== 64)
-        throw new l({ storageKey: e[t] });
-    if (!f(i, { strict: !1 }))
-      throw new s({ address: i });
-    n.push([i, e]);
-  }
-  return n;
+import { SliceOffsetOutOfBoundsError as t } from "./index104.js";
+import { isHex as p } from "./index84.js";
+import { size as r } from "./index67.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;
 }
 export {
-  a as serializeAccessList
+  w as slice,
+  m as sliceBytes,
+  u as sliceHex
 };

package/dist/index106.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"});const e={ether:-9,wei:9};exports.gweiUnits=e;

package/dist/index106.js

@@ -1,19 +1,7 @@
-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 };
-}
+const e = {
+  ether: -9,
+  wei: 9
+};
 export {
-  p as createCurve,
-  i as getHash
+  e as gweiUnits
 };

package/dist/index107.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"});function o(r,i){let t=r.toString();const n=t.startsWith("-");n&&(t=t.slice(1)),t=t.padStart(i,"0");let[l,e]=[t.slice(0,t.length-i),t.slice(t.length-i)];return e=e.replace(/(0+)$/,""),`${n?"-":""}${l||"0"}${e?`.${e}`:""}`}exports.formatUnits=o;

package/dist/index107.js

@@ -1,226 +1,13 @@
-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);
+function a(r, n) {
+  let t = r.toString();
+  const i = t.startsWith("-");
+  i && (t = t.slice(1)), t = t.padStart(n, "0");
+  let [l, e] = [
+    t.slice(0, t.length - n),
+    t.slice(t.length - n)
+  ];
+  return e = e.replace(/(0+)$/, ""), `${i ? "-" : ""}${l || "0"}${e ? `.${e}` : ""}`;
 }
 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
+  a as formatUnits
 };

package/dist/index108.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 t=2n**256n-1n;exports.maxUint256=t;

package/dist/index108.js

@@ -1,5 +1,4 @@
-const e = `Ethereum Signed Message:
-`;
+const n = 2n ** 256n - 1n;
 export {
-  e as presignMessagePrefix
+  n as maxUint256
 };

package/dist/index109.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function i(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!i(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error("Uint8Array expected of length "+t+", got length="+e.length)}function a(e){if(typeof e!="function"||typeof e.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");r(e.outputLen),r(e.blockLen)}function s(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function u(e,t){o(e);const n=t.outputLen;if(e.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}exports.abytes=o;exports.aexists=s;exports.ahash=a;exports.anumber=r;exports.aoutput=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index63.cjs");class t extends o.BaseError{constructor({offset:e}){super(`Offset \`${e}\` cannot be negative.`,{name:"NegativeOffsetError"})}}class i extends o.BaseError{constructor({length:e,position:r}){super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`,{name:"PositionOutOfBoundsError"})}}class n extends o.BaseError{constructor({count:e,limit:r}){super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`,{name:"RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=t;exports.PositionOutOfBoundsError=i;exports.RecursiveReadLimitExceededError=n;

package/dist/index109.js

@@ -1,37 +1,23 @@
-function n(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
+import { BaseError as o } from "./index63.js";
+class i extends o {
+  constructor({ offset: e }) {
+    super(`Offset \`${e}\` cannot be negative.`, {
+      name: "NegativeOffsetError"
+    });
+  }
 }
-function o(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+class n extends o {
+  constructor({ length: e, position: r }) {
+    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
+  }
 }
-function i(e, ...t) {
-  if (!o(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function f(e) {
-  if (typeof e != "function" || typeof e.create != "function")
-    throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  n(e.outputLen), n(e.blockLen);
-}
-function s(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function u(e, t) {
-  i(e);
-  const r = t.outputLen;
-  if (e.length < r)
-    throw new Error("digestInto() expects output buffer of length at least " + r);
+class c extends o {
+  constructor({ count: e, limit: r }) {
+    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+  }
 }
 export {
-  i as abytes,
-  s as aexists,
-  f as ahash,
-  n as anumber,
-  u as aoutput
+  i as NegativeOffsetError,
+  n as PositionOutOfBoundsError,
+  c as RecursiveReadLimitExceededError
 };

package/dist/index11.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index16.cjs"),l=require("@simplewebauthn/browser");class c{constructor(r,t){if(this.storeKey="passkey-auth",!window)throw new Error("Passkey is only supported in the browser environment.");this.url=r.endpoint("passkey"),this.store=t}getPasskeyFromStore(){if(this.token&&this.userName)return e.Ok({token:this.token,gardenUserName:this.userName});const r=this.store.getItem(this.storeKey);if(r){const t=JSON.parse(r);return e.Ok(t)}return e.Err("Passkey is not set")}validateUsername(r){return!r||r.length===0?e.Err("Username cannot be empty"):r.length<3||r.length>32?e.Err("Username must be between 3 and 32 characters"):r.includes(" ")?e.Err("Username cannot contain spaces"):e.Ok(r.trim().toLowerCase())}async register(r){var i;const t=this.validateUsername(r);if(t.error)return e.Err(t.error);try{const n=await e.Fetcher.post(this.url.endpoint("register/begin"),{body:JSON.stringify({username:t}),headers:{credentials:"include","Content-Type":"application/json"}});if(n.error)return e.Err("Failed to start registration",n.error);const s=(i=n.result)==null?void 0:i.challenge;if(!s)return e.Err("No challenge found");if(!s.publicKey.authenticatorSelection)return e.Err("No authenticator selection found");s.publicKey.authenticatorSelection.requireResidentKey=!0,s.publicKey.authenticatorSelection.residentKey="required";const a=await l.startRegistration({optionsJSON:s.publicKey}),o=await e.Fetcher.post(this.url.endpoint("register/finish"),{body:JSON.stringify({username:t,credential:a}),headers:{credentials:"include","Content-Type":"application/json"}});return o.error?e.Err("Failed to verify registration: "+o.error):o.result?(this.token=o.result.token,this.userName=t.val,e.Ok(o.result)):e.Err("No verification result found")}catch(n){return e.Err("Registration error",n)}}async login(r){var i;const t=this.validateUsername(r);if(t.error)return e.Err(t.error);try{const n=await e.Fetcher.post(this.url.endpoint("login/begin"),{body:JSON.stringify({username:t}),headers:{credentials:"include","Content-Type":"application/json"}});if(n.error)return e.Err("Failed to start login",n.error);const s=(i=n.result)==null?void 0:i.challenge;if(!s)return e.Err("No challenge found");const a=await l.startAuthentication({optionsJSON:s.publicKey}),o=await e.Fetcher.post(this.url.endpoint("login/finish"),{body:JSON.stringify({username:t,credential:a}),headers:{credentials:"include","Content-Type":"application/json"}});return o.error?e.Err("Failed to verify login",o.error):o.result?(this.token=o.result.token,this.userName=t.val,e.Ok(o.result)):e.Err("No verification result found")}catch(n){return e.Err("Login error",n)}}async conditionalLogin(){var r,t;try{const i=await e.Fetcher.get(this.url.endpoint("conditional-login/begin"),{headers:{credentials:"include"}});if(i.error)return e.Err("Failed to start login",i.error);const n=(r=i.result)==null?void 0:r.challenge;if(!n)return e.Err("No challenge found");const s=await l.startAuthentication({optionsJSON:n.publicKey}),a=await e.Fetcher.post(this.url.endpoint("conditional-login/finish"),{body:JSON.stringify({login_id:(t=i.result)==null?void 0:t.login_id,credential:s}),headers:{credentials:"include","Content-Type":"application/json"}});return a.error?e.Err("Failed to verify login",a.error):a.result?(this.token=a.result.token,this.userName=a.result.gardenUserName,e.Ok(a.result)):e.Err("No verification result found")}catch(i){return e.Err("Conditional login error",i)}}}exports.PasskeyLogin=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index17.cjs"),o=require("./index8.cjs"),s=require("./index3.cjs");class i{constructor(e){this.token=e}async getToken(){return this.token?this.verifyToken(this.token).ok?t.Ok(this.token):t.Err("Token is invalid"):t.Err("Token is not set")}verifyToken(e){try{const r=s.parseJwt(e);if(!r)return t.Ok(!1);const n=Math.floor(Date.now()/1e3)+120;return t.Ok(r.exp>n)}catch{return t.Ok(!1)}}async getAuthHeaders(){const e=await this.getToken();return e.ok?t.Ok({[o.AuthHeaderEnum.Authorization]:e.val}):t.Err(e.error??"Failed to get auth token")}}exports.Passkey=i;