@gardenfi/utils 0.0.1-beta.13 → 0.0.1-beta.15

package/dist/index46.js

@@ -1,14 +1,9 @@
-import { LruMap as u } from "./index45.js";
-import { checksumAddress as c } from "./index32.js";
-const i = /^0x[a-fA-F0-9]{40}$/, r = /* @__PURE__ */ new u(8192);
-function h(t, s) {
-  const { strict: n = !0 } = s ?? {}, e = `${t}.${n}`;
-  if (r.has(e))
-    return r.get(e);
-  const o = i.test(t) ? t.toLowerCase() === t ? !0 : n ? c(t) === t : !0 : !1;
-  return r.set(e, o), o;
+import { BaseError as i } from "./index34.js";
+class a extends i {
+  constructor({ size: r, targetSize: s, type: e }) {
+    super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
+  }
 }
 export {
-  h as isAddress,
-  r as isAddressCache
+  a as SizeExceedsPaddingSizeError
 };

package/dist/index47.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(t,{strict:e=!0}={}){return!t||typeof t!="string"?!1:e?/^0x[0-9a-fA-F]*$/.test(t):t.startsWith("0x")}exports.isHex=r;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index34.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;

package/dist/index47.js

@@ -1,6 +1,14 @@
-function e(t, { strict: r = !0 } = {}) {
-  return !t || typeof t != "string" ? !1 : r ? /^0x[0-9a-fA-F]*$/.test(t) : t.startsWith("0x");
+import { BaseError as i } from "./index34.js";
+class d extends i {
+  constructor(e) {
+    const { docsPath: s, field: r, metaMessages: a } = e;
+    super(`Invalid Sign-In with Ethereum message field "${r}".`, {
+      docsPath: s,
+      metaMessages: a,
+      name: "SiweInvalidMessageFieldError"
+    });
+  }
 }
 export {
-  e as isHex
+  d as SiweInvalidMessageFieldError
 };

package/dist/index48.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index34.cjs");class d extends i.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});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(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;

package/dist/index48.js

@@ -1,9 +1,22 @@
-import { BaseError as i } from "./index34.js";
-class a extends i {
-  constructor({ size: r, targetSize: s, type: e }) {
-    super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
-  }
+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 {
-  a as SizeExceedsPaddingSizeError
+  o as isUri
 };

package/dist/index49.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index50.cjs"),a=require("./index51.cjs"),c=require("./index52.cjs"),I=[],O=[],w=[],B=BigInt(0),f=BigInt(1),A=BigInt(2),S=BigInt(7),H=BigInt(256),T=BigInt(113);for(let i=0,t=f,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],I.push(2*(5*n+s)),O.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<f^(t>>S)*T)%H,t&A&&(o^=f<<(f<<BigInt(r))-f);w.push(o)}const[m,E]=a.split(w,!0),y=(i,t,s)=>s>32?a.rotlBH(i,t,s):a.rotlSH(i,t,s),b=(i,t,s)=>s>32?a.rotlBL(i,t,s):a.rotlSL(i,t,s);function L(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,p=(e+2)%10,d=s[p],u=s[p+1],_=y(d,u,1)^s[h],g=b(d,u,1)^s[h+1];for(let k=0;k<50;k+=10)i[e+k]^=_,i[e+k+1]^=g}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=O[e],p=y(o,r,h),d=b(o,r,h),u=I[e];o=i[u],r=i[u+1],i[u]=p,i[u+1]=d}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=E[n]}s.fill(0)}class x extends c.Hash{constructor(t,s,n,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=n,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,l.number(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}keccak(){c.isLE||c.byteSwap32(this.state32),L(this.state32,this.rounds),c.isLE||c.byteSwap32(this.state32),this.posOut=0,this.pos=0}update(t){l.exists(this);const{blockLen:s,state:n}=this;t=c.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)n[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:n,blockLen:o}=this;t[n]^=s,s&128&&n===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){l.exists(this,!1),l.bytes(t),this.finish();const s=this.state,{blockLen:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return l.number(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(l.output(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=n,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const F=(i,t,s)=>c.wrapConstructor(()=>new x(t,i,s)),P=F(1,136,256/8);exports.Keccak=x;exports.keccakP=L;exports.keccak_256=P;
+"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/index49.js

@@ -1,107 +1,11 @@
-import { number as d, exists as k, bytes as B, output as A } from "./index50.js";
-import { split as H, rotlBH as m, rotlSH as S, rotlBL as T, rotlSL as F } from "./index51.js";
-import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index52.js";
-const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
-for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
-  [s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
-  let o = M;
-  for (let r = 0; r < 7; r++)
-    t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  b.push(o);
+function n(e) {
+  return {
+    formatters: void 0,
+    fees: void 0,
+    serializers: void 0,
+    ...e
+  };
 }
-const [v, z] = /* @__PURE__ */ H(b, !0), O = (e, t, s) => s > 32 ? m(e, t, s) : S(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : F(e, t, s);
-function D(e, t = 24) {
-  const s = new Uint32Array(10);
-  for (let n = 24 - t; n < 24; n++) {
-    for (let i = 0; i < 10; i++)
-      s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
-    for (let i = 0; i < 10; i += 2) {
-      const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
-      for (let a = 0; a < 50; a += 10)
-        e[i + a] ^= _, e[i + a + 1] ^= g;
-    }
-    let o = e[2], r = e[3];
-    for (let i = 0; i < 24; i++) {
-      const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
-      o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
-    }
-    for (let i = 0; i < 50; i += 10) {
-      for (let h = 0; h < 10; h++)
-        s[h] = e[i + h];
-      for (let h = 0; h < 10; h++)
-        e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
-    }
-    e[0] ^= v[n], e[1] ^= z[n];
-  }
-  s.fill(0);
-}
-class p extends E {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, n, o = !1, r = 24) {
-    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
-      throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = U(this.state);
-  }
-  keccak() {
-    x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    k(this);
-    const { blockLen: s, state: n } = this;
-    t = P(t);
-    const o = t.length;
-    for (let r = 0; r < o; ) {
-      const i = Math.min(s - this.pos, o - r);
-      for (let h = 0; h < i; h++)
-        n[this.pos++] ^= t[r++];
-      this.pos === s && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: t, suffix: s, pos: n, blockLen: o } = this;
-    t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
-  }
-  writeInto(t) {
-    k(this, !1), B(t), this.finish();
-    const s = this.state, { blockLen: n } = this;
-    for (let o = 0, r = t.length; o < r; ) {
-      this.posOut >= n && this.keccak();
-      const i = Math.min(n - this.posOut, r - o);
-      t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
-    }
-    return t;
-  }
-  xofInto(t) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(t);
-  }
-  xof(t) {
-    return d(t), this.xofInto(new Uint8Array(t));
-  }
-  digestInto(t) {
-    if (A(t, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(t), this.destroy(), t;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, this.state.fill(0);
-  }
-  _cloneInto(t) {
-    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
-    return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
-  }
-}
-const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
 export {
-  p as Keccak,
-  D as keccakP,
-  Q as keccak_256
+  n as defineChain
 };

package/dist/index50.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function n(e){return e instanceof Uint8Array||e!=null&&typeof e=="object"&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!n(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}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 r=t.outputLen;if(e.length<r)throw new Error(`digestInto() expects output buffer of length at least ${r}`)}exports.bytes=o;exports.exists=s;exports.isBytes=n;exports.number=i;exports.output=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index51.cjs"),a=require("./index52.cjs"),c=require("./index53.cjs"),I=[],O=[],w=[],B=BigInt(0),f=BigInt(1),A=BigInt(2),S=BigInt(7),H=BigInt(256),T=BigInt(113);for(let i=0,t=f,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],I.push(2*(5*n+s)),O.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<f^(t>>S)*T)%H,t&A&&(o^=f<<(f<<BigInt(r))-f);w.push(o)}const[m,E]=a.split(w,!0),y=(i,t,s)=>s>32?a.rotlBH(i,t,s):a.rotlSH(i,t,s),b=(i,t,s)=>s>32?a.rotlBL(i,t,s):a.rotlSL(i,t,s);function L(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,p=(e+2)%10,d=s[p],u=s[p+1],_=y(d,u,1)^s[h],g=b(d,u,1)^s[h+1];for(let k=0;k<50;k+=10)i[e+k]^=_,i[e+k+1]^=g}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=O[e],p=y(o,r,h),d=b(o,r,h),u=I[e];o=i[u],r=i[u+1],i[u]=p,i[u+1]=d}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=E[n]}s.fill(0)}class x extends c.Hash{constructor(t,s,n,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=n,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,l.number(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}keccak(){c.isLE||c.byteSwap32(this.state32),L(this.state32,this.rounds),c.isLE||c.byteSwap32(this.state32),this.posOut=0,this.pos=0}update(t){l.exists(this);const{blockLen:s,state:n}=this;t=c.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)n[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:n,blockLen:o}=this;t[n]^=s,s&128&&n===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){l.exists(this,!1),l.bytes(t),this.finish();const s=this.state,{blockLen:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return l.number(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(l.output(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=n,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const F=(i,t,s)=>c.wrapConstructor(()=>new x(t,i,s)),P=F(1,136,256/8);exports.Keccak=x;exports.keccakP=L;exports.keccak_256=P;

package/dist/index50.js

@@ -1,32 +1,107 @@
-function i(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error(`positive integer expected, not ${e}`);
+import { number as d, exists as k, bytes as B, output as A } from "./index51.js";
+import { split as H, rotlBH as m, rotlSH as S, rotlBL as T, rotlSL as F } from "./index52.js";
+import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index53.js";
+const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
+for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
+  [s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
+  let o = M;
+  for (let r = 0; r < 7; r++)
+    t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
+  b.push(o);
 }
-function n(e) {
-  return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
+const [v, z] = /* @__PURE__ */ H(b, !0), O = (e, t, s) => s > 32 ? m(e, t, s) : S(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : F(e, t, s);
+function D(e, t = 24) {
+  const s = new Uint32Array(10);
+  for (let n = 24 - t; n < 24; n++) {
+    for (let i = 0; i < 10; i++)
+      s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
+    for (let i = 0; i < 10; i += 2) {
+      const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
+      for (let a = 0; a < 50; a += 10)
+        e[i + a] ^= _, e[i + a + 1] ^= g;
+    }
+    let o = e[2], r = e[3];
+    for (let i = 0; i < 24; i++) {
+      const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
+      o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
+    }
+    for (let i = 0; i < 50; i += 10) {
+      for (let h = 0; h < 10; h++)
+        s[h] = e[i + h];
+      for (let h = 0; h < 10; h++)
+        e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+    }
+    e[0] ^= v[n], e[1] ^= z[n];
+  }
+  s.fill(0);
 }
-function o(e, ...t) {
-  if (!n(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
-}
-function f(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 s(e, t) {
-  o(e);
-  const r = t.outputLen;
-  if (e.length < r)
-    throw new Error(`digestInto() expects output buffer of length at least ${r}`);
+class p extends E {
+  // NOTE: we accept arguments in bytes instead of bits here.
+  constructor(t, s, n, o = !1, r = 24) {
+    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
+      throw new Error("Sha3 supports only keccak-f1600 function");
+    this.state = new Uint8Array(200), this.state32 = U(this.state);
+  }
+  keccak() {
+    x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
+  }
+  update(t) {
+    k(this);
+    const { blockLen: s, state: n } = this;
+    t = P(t);
+    const o = t.length;
+    for (let r = 0; r < o; ) {
+      const i = Math.min(s - this.pos, o - r);
+      for (let h = 0; h < i; h++)
+        n[this.pos++] ^= t[r++];
+      this.pos === s && this.keccak();
+    }
+    return this;
+  }
+  finish() {
+    if (this.finished)
+      return;
+    this.finished = !0;
+    const { state: t, suffix: s, pos: n, blockLen: o } = this;
+    t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
+  }
+  writeInto(t) {
+    k(this, !1), B(t), this.finish();
+    const s = this.state, { blockLen: n } = this;
+    for (let o = 0, r = t.length; o < r; ) {
+      this.posOut >= n && this.keccak();
+      const i = Math.min(n - this.posOut, r - o);
+      t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
+    }
+    return t;
+  }
+  xofInto(t) {
+    if (!this.enableXOF)
+      throw new Error("XOF is not possible for this instance");
+    return this.writeInto(t);
+  }
+  xof(t) {
+    return d(t), this.xofInto(new Uint8Array(t));
+  }
+  digestInto(t) {
+    if (A(t, this), this.finished)
+      throw new Error("digest() was already called");
+    return this.writeInto(t), this.destroy(), t;
+  }
+  digest() {
+    return this.digestInto(new Uint8Array(this.outputLen));
+  }
+  destroy() {
+    this.destroyed = !0, this.state.fill(0);
+  }
+  _cloneInto(t) {
+    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
+    return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
+  }
 }
+const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
 export {
-  o as bytes,
-  f as exists,
-  n as isBytes,
-  i as number,
-  s as output
+  p as Keccak,
+  D as keccakP,
+  Q as keccak_256
 };

package/dist/index51.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function n(e){return e instanceof Uint8Array||e!=null&&typeof e=="object"&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!n(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}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 r=t.outputLen;if(e.length<r)throw new Error(`digestInto() expects output buffer of length at least ${r}`)}exports.bytes=o;exports.exists=s;exports.isBytes=n;exports.number=i;exports.output=u;

package/dist/index51.js

@@ -1,21 +1,32 @@
-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 i(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error(`positive integer expected, not ${e}`);
 }
-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 [n, l];
+function n(e) {
+  return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
+}
+function o(e, ...t) {
+  if (!n(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
+}
+function f(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 s(e, t) {
+  o(e);
+  const r = t.outputLen;
+  if (e.length < r)
+    throw new Error(`digestInto() expects output buffer of length at least ${r}`);
 }
-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 {
-  f as fromBig,
-  A as rotlBH,
-  B as rotlBL,
-  g as rotlSH,
-  m as rotlSL,
-  h as split
+  o as bytes,
+  f as exists,
+  n as isBytes,
+  i as number,
+  s as output
 };

package/dist/index52.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index50.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const c=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),i=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68,o=t=>t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255;function y(t){for(let e=0;e<t.length;e++)t[e]=o(t[e])}function f(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function r(t){return typeof t=="string"&&(t=f(t)),s.bytes(t),t}class p{clone(){return this._cloneInto()}}function b(t){const e=u=>t().update(r(u)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=p;exports.byteSwap=o;exports.byteSwap32=y;exports.isLE=i;exports.toBytes=r;exports.u32=c;exports.utf8ToBytes=f;exports.wrapConstructor=b;
+"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/index52.js

@@ -1,35 +1,21 @@
-import { bytes as f } from "./index50.js";
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const s = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4)), y = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, r = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-function p(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = r(t[e]);
+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 c(t) {
-  if (typeof t != "string")
-    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function u(t) {
-  return typeof t == "string" && (t = c(t)), f(t), t;
-}
-class b {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
+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 [n, l];
 }
-function x(t) {
-  const e = (o) => t().update(u(o)).digest(), n = t();
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
-}
+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 {
-  b as Hash,
-  r as byteSwap,
-  p as byteSwap32,
-  y as isLE,
-  u as toBytes,
-  s as u32,
-  c as utf8ToBytes,
-  x as wrapConstructor
+  f as fromBig,
+  A as rotlBH,
+  B as rotlBL,
+  g as rotlSH,
+  m as rotlSL,
+  h as split
 };

package/dist/index53.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index51.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const c=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),i=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68,o=t=>t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255;function y(t){for(let e=0;e<t.length;e++)t[e]=o(t[e])}function f(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function r(t){return typeof t=="string"&&(t=f(t)),s.bytes(t),t}class p{clone(){return this._cloneInto()}}function b(t){const e=u=>t().update(r(u)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=p;exports.byteSwap=o;exports.byteSwap32=y;exports.isLE=i;exports.toBytes=r;exports.u32=c;exports.utf8ToBytes=f;exports.wrapConstructor=b;

package/dist/index53.js

@@ -0,0 +1,35 @@
+import { bytes as f } from "./index51.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const s = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4)), y = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, r = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
+function p(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = r(t[e]);
+}
+function c(t) {
+  if (typeof t != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function u(t) {
+  return typeof t == "string" && (t = c(t)), f(t), t;
+}
+class b {
+  // Safe version that clones internal state
+  clone() {
+    return this._cloneInto();
+  }
+}
+function x(t) {
+  const e = (o) => t().update(u(o)).digest(), n = t();
+  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
+}
+export {
+  b as Hash,
+  r as byteSwap,
+  p as byteSwap32,
+  y as isLE,
+  u as toBytes,
+  s as u32,
+  c as utf8ToBytes,
+  x as wrapConstructor
+};

package/dist/index9.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("@catalogfi/utils"),n=require("viem"),i=require("./index12.cjs"),u=[42161,421614],a=async t=>{if(!t.chain)return e.Err("No chain found");const c=u.includes(t.chain.id)?i.mainnet:t.chain;return await o(c)},o=async t=>{const c=n.createPublicClient({chain:t,transport:n.http()});try{const r=await c.getBlockNumber();return e.Ok(Number(r))}catch(r){return e.Err("Failed to fetch evm block number",r)}},b=async t=>{try{const c=await t.getLatestTip();return e.Ok(c)}catch(c){return e.Err("Failed to fetch bitcoin block number",c)}};exports._fetchEVMBlockNumber=o;exports.fetchBitcoinBlockNumber=b;exports.fetchEVMBlockNumber=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("@catalogfi/utils"),n=require("viem"),u=require("./index12.cjs"),a=require("./index13.cjs"),o={42161:u.mainnet,421614:a.sepolia},s=async e=>{if(!e.chain)return c.Err("No chain found");const t=Object.keys(o).includes(e.chain.id.toString())?o[e.chain.id]:e.chain;return await i(t)},i=async e=>{const t=n.createPublicClient({chain:e,transport:n.http()});try{const r=await t.getBlockNumber();return c.Ok(Number(r))}catch(r){return c.Err("Failed to fetch evm block number",r)}},b=async e=>{try{const t=await e.getLatestTip();return c.Ok(t)}catch(t){return c.Err("Failed to fetch bitcoin block number",t)}};exports._fetchEVMBlockNumber=i;exports.fetchBitcoinBlockNumber=b;exports.fetchEVMBlockNumber=s;

package/dist/index9.js

@@ -1,31 +1,37 @@
-import { Err as o, Ok as e } from "@catalogfi/utils";
-import { createPublicClient as n, http as i } from "viem";
-import { mainnet as a } from "./index12.js";
-const u = [42161, 421614], f = async (t) => {
-  if (!t.chain) return o("No chain found");
-  const r = u.includes(t.chain.id) ? a : t.chain;
-  return await m(r);
-}, m = async (t) => {
-  const r = n({
-    chain: t,
-    transport: i()
+import { Err as o, Ok as n } from "@catalogfi/utils";
+import { createPublicClient as i, http as a } from "viem";
+import { mainnet as m } from "./index12.js";
+import { sepolia as u } from "./index13.js";
+const e = {
+  42161: m,
+  421614: u
+}, p = async (r) => {
+  if (!r.chain) return o("No chain found");
+  const t = Object.keys(e).includes(
+    r.chain.id.toString()
+  ) ? e[r.chain.id] : r.chain;
+  return await b(t);
+}, b = async (r) => {
+  const t = i({
+    chain: r,
+    transport: a()
   });
   try {
-    const c = await r.getBlockNumber();
-    return e(Number(c));
+    const c = await t.getBlockNumber();
+    return n(Number(c));
   } catch (c) {
     return o("Failed to fetch evm block number", c);
   }
-}, k = async (t) => {
+}, N = async (r) => {
   try {
-    const r = await t.getLatestTip();
-    return e(r);
-  } catch (r) {
-    return o("Failed to fetch bitcoin block number", r);
+    const t = await r.getLatestTip();
+    return n(t);
+  } catch (t) {
+    return o("Failed to fetch bitcoin block number", t);
   }
 };
 export {
-  m as _fetchEVMBlockNumber,
-  k as fetchBitcoinBlockNumber,
-  f as fetchEVMBlockNumber
+  b as _fetchEVMBlockNumber,
+  N as fetchBitcoinBlockNumber,
+  p as fetchEVMBlockNumber
 };

package/dist/src/lib/approve.d.ts

@@ -1,7 +1,4 @@
 import { AsyncResult } from '@catalogfi/utils';
 import { WalletClient } from 'viem';
 
-/**
- * @description approves the staking contract to spend the SEED tokens.
- */
 export declare const checkAllowanceAndApprove: (amount: number, tokenAddress: string, contractAddress: string, walletClient: WalletClient) => AsyncResult<string, string>;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gardenfi/utils",
-  "version": "0.0.1-beta.13",
+  "version": "0.0.1-beta.15",
   "type": "module",
   "scripts": {
     "build": "vite build",