@gardenfi/utils 2.0.3 → 2.0.5

package/dist/index116.js

@@ -0,0 +1,234 @@
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), I = /* @__PURE__ */ BigInt(2);
+function h(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function b(t) {
+  if (!h(t))
+    throw new Error("Uint8Array expected");
+}
+function O(t, n) {
+  if (typeof n != "boolean")
+    throw new Error(t + " boolean expected, got " + n);
+}
+const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function B(t) {
+  b(t);
+  let n = "";
+  for (let r = 0; r < t.length; r++)
+    n += T[t[r]];
+  return n;
+}
+function S(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? "0" + n : n;
+}
+function U(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? d : BigInt("0x" + t);
+}
+const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function E(t) {
+  if (t >= s._0 && t <= s._9)
+    return t - s._0;
+  if (t >= s.A && t <= s.F)
+    return t - (s.A - 10);
+  if (t >= s.a && t <= s.f)
+    return t - (s.a - 10);
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  const n = t.length, r = n / 2;
+  if (n % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + n);
+  const e = new Uint8Array(r);
+  for (let o = 0, i = 0; o < r; o++, i += 2) {
+    const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
+    if (a === void 0 || f === void 0) {
+      const c = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
+    }
+    e[o] = a * 16 + f;
+  }
+  return e;
+}
+function V(t) {
+  return U(B(t));
+}
+function H(t) {
+  return b(t), U(B(Uint8Array.from(t).reverse()));
+}
+function v(t, n) {
+  return m(t.toString(16).padStart(n * 2, "0"));
+}
+function C(t, n) {
+  return v(t, n).reverse();
+}
+function M(t) {
+  return m(S(t));
+}
+function R(t, n, r) {
+  let e;
+  if (typeof n == "string")
+    try {
+      e = m(n);
+    } catch (i) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
+    }
+  else if (h(n))
+    e = Uint8Array.from(n);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const o = e.length;
+  if (typeof r == "number" && o !== r)
+    throw new Error(t + " of length " + r + " expected, got " + o);
+  return e;
+}
+function _(...t) {
+  let n = 0;
+  for (let e = 0; e < t.length; e++) {
+    const o = t[e];
+    b(o), n += o.length;
+  }
+  const r = new Uint8Array(n);
+  for (let e = 0, o = 0; e < t.length; e++) {
+    const i = t[e];
+    r.set(i, o), o += i.length;
+  }
+  return r;
+}
+function j(t, n) {
+  if (t.length !== n.length)
+    return !1;
+  let r = 0;
+  for (let e = 0; e < t.length; e++)
+    r |= t[e] ^ n[e];
+  return r === 0;
+}
+function z(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+const w = (t) => typeof t == "bigint" && d <= t;
+function N(t, n, r) {
+  return w(t) && w(n) && w(r) && n <= t && t < r;
+}
+function D(t, n, r, e) {
+  if (!N(n, r, e))
+    throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
+}
+function G(t) {
+  let n;
+  for (n = 0; t > d; t >>= y, n += 1)
+    ;
+  return n;
+}
+function P(t, n) {
+  return t >> BigInt(n) & y;
+}
+function W(t, n, r) {
+  return t | (r ? y : d) << BigInt(n);
+}
+const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
+function J(t, n, r) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof n != "number" || n < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof r != "function")
+    throw new Error("hmacFn must be a function");
+  let e = p(t), o = p(t), i = 0;
+  const a = () => {
+    e.fill(1), o.fill(0), i = 0;
+  }, f = (...u) => r(o, e, ...u), c = (u = p()) => {
+    o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
+  }, x = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let u = 0;
+    const l = [];
+    for (; u < n; ) {
+      e = f();
+      const g = e.slice();
+      l.push(g), u += e.length;
+    }
+    return _(...l);
+  };
+  return (u, l) => {
+    a(), c(u);
+    let g;
+    for (; !(g = l(x())); )
+      c();
+    return a(), g;
+  };
+}
+const k = {
+  bigint: (t) => typeof t == "bigint",
+  function: (t) => typeof t == "function",
+  boolean: (t) => typeof t == "boolean",
+  string: (t) => typeof t == "string",
+  stringOrUint8Array: (t) => typeof t == "string" || h(t),
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, n) => n.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function K(t, n, r = {}) {
+  const e = (o, i, a) => {
+    const f = k[i];
+    if (typeof f != "function")
+      throw new Error("invalid validator function");
+    const c = t[o];
+    if (!(a && c === void 0) && !f(c, t))
+      throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
+  };
+  for (const [o, i] of Object.entries(n))
+    e(o, i, !1);
+  for (const [o, i] of Object.entries(r))
+    e(o, i, !0);
+  return t;
+}
+const Q = () => {
+  throw new Error("not implemented");
+};
+function X(t) {
+  const n = /* @__PURE__ */ new WeakMap();
+  return (r, ...e) => {
+    const o = n.get(r);
+    if (o !== void 0)
+      return o;
+    const i = t(r, ...e);
+    return n.set(r, i), i;
+  };
+}
+export {
+  D as aInRange,
+  O as abool,
+  b as abytes,
+  P as bitGet,
+  G as bitLen,
+  q as bitMask,
+  W as bitSet,
+  B as bytesToHex,
+  V as bytesToNumberBE,
+  H as bytesToNumberLE,
+  _ as concatBytes,
+  J as createHmacDrbg,
+  R as ensureBytes,
+  j as equalBytes,
+  m as hexToBytes,
+  U as hexToNumber,
+  N as inRange,
+  h as isBytes,
+  X as memoized,
+  Q as notImplemented,
+  v as numberToBytesBE,
+  C as numberToBytesLE,
+  S as numberToHexUnpadded,
+  M as numberToVarBytesBE,
+  z as utf8ToBytes,
+  K as validateObject
+};

package/dist/index117.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index108.cjs"),y=require("./index116.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;

package/dist/index117.js

@@ -0,0 +1,175 @@
+import { validateField as z, nLength as F } from "./index108.js";
+import { validateObject as x, bitLen as O } from "./index116.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();
+  }
+  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
+  });
+}
+export {
+  Z as pippenger,
+  U as validateBasic,
+  v as wNAF
+};

package/dist/index12.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const M=require("./index17.cjs"),k=require("./index23.cjs"),g=require("./index29.cjs"),O=require("./index30.cjs"),S=require("./index33.cjs"),y=require("./index34.cjs"),$=require("./index32.cjs"),P=require("./index16.cjs"),W=require("./index22.cjs"),q=require("./index25.cjs"),x=require("./index27.cjs");async function z(n,{confirmations:c=1,hash:p,onReplaced:h,pollingInterval:m=n.pollingInterval,retryCount:w=6,retryDelay:R=({count:d})=>~~(1<<d)*200,timeout:N=18e4}){const d=$.stringify(["waitForTransactionReceipt",n.uid,p]);let a,o,e,i=!1;const{promise:B,resolve:F,reject:v}=S.withResolvers(),A=N?setTimeout(()=>v(new k.WaitForTransactionReceiptTimeoutError({hash:p})),N):void 0,j=O.observe(d,{onReplaced:h,resolve:F,reject:v},r=>{const E=g.getAction(n,x.watchBlockNumber,"watchBlockNumber")({emitMissed:!0,emitOnBegin:!0,poll:!0,pollingInterval:m,async onBlockNumber(_){const u=b=>{clearTimeout(A),E(),b(),j()};let l=_;if(!i)try{if(e){if(c>1&&(!e.blockNumber||l-e.blockNumber+1n<c))return;u(()=>r.resolve(e));return}if(a||(i=!0,await y.withRetry(async()=>{a=await g.getAction(n,W.getTransaction,"getTransaction")({hash:p}),a.blockNumber&&(l=a.blockNumber)},{delay:R,retryCount:w}),i=!1),e=await g.getAction(n,q.getTransactionReceipt,"getTransactionReceipt")({hash:p}),c>1&&(!e.blockNumber||l-e.blockNumber+1n<c))return;u(()=>r.resolve(e))}catch(b){if(b instanceof k.TransactionNotFoundError||b instanceof k.TransactionReceiptNotFoundError){if(!a){i=!1;return}try{o=a,i=!0;const f=await y.withRetry(()=>g.getAction(n,P.getBlock,"getBlock")({blockNumber:l,includeTransactions:!0}),{delay:R,retryCount:w,shouldRetry:({error:s})=>s instanceof M.BlockNotFoundError});i=!1;const t=f.transactions.find(({from:s,nonce:I})=>s===o.from&&I===o.nonce);if(!t||(e=await g.getAction(n,q.getTransactionReceipt,"getTransactionReceipt")({hash:t.hash}),c>1&&(!e.blockNumber||l-e.blockNumber+1n<c)))return;let T="replaced";t.to===o.to&&t.value===o.value&&t.input===o.input?T="repriced":t.from===t.to&&t.value===0n&&(T="cancelled"),u(()=>{var s;(s=r.onReplaced)==null||s.call(r,{reason:T,replacedTransaction:o,transaction:t,transactionReceipt:e}),r.resolve(e)})}catch(f){u(()=>r.reject(f))}}else u(()=>r.reject(b))}}})});return B}exports.waitForTransactionReceipt=z;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class r{constructor(){this.memory=new Map}getItem(e){return this.memory.has(e)?this.memory.get(e):null}setItem(e,t){this.memory.set(e,t)}removeItem(e){this.memory.has(e)&&this.memory.delete(e)}}exports.MemoryStorage=r;

package/dist/index12.js

@@ -1,96 +1,17 @@
-import { BlockNotFoundError as A } from "./index17.js";
-import { WaitForTransactionReceiptTimeoutError as M, TransactionNotFoundError as O, TransactionReceiptNotFoundError as W } from "./index23.js";
-import { getAction as f } from "./index29.js";
-import { observe as q } from "./index30.js";
-import { withResolvers as z } from "./index33.js";
-import { withRetry as v } from "./index34.js";
-import { stringify as G } from "./index32.js";
-import { getBlock as H } from "./index16.js";
-import { getTransaction as J } from "./index22.js";
-import { getTransactionReceipt as R } from "./index25.js";
-import { watchBlockNumber as K } from "./index27.js";
-async function D(o, {
-  confirmations: a = 1,
-  hash: m,
-  onReplaced: y,
-  pollingInterval: B = o.pollingInterval,
-  retryCount: k = 6,
-  retryDelay: N = ({ count: b }) => ~~(1 << b) * 200,
-  // exponential backoff
-  timeout: w = 18e4
-}) {
-  const b = G(["waitForTransactionReceipt", o.uid, m]);
-  let c, n, r, i = !1;
-  const { promise: h, resolve: F, reject: g } = z(), E = w ? setTimeout(() => g(new M({ hash: m })), w) : void 0, _ = q(b, { onReplaced: y, resolve: F, reject: g }, (t) => {
-    const j = f(o, K, "watchBlockNumber")({
-      emitMissed: !0,
-      emitOnBegin: !0,
-      poll: !0,
-      pollingInterval: B,
-      async onBlockNumber(I) {
-        const l = (p) => {
-          clearTimeout(E), j(), p(), _();
-        };
-        let u = I;
-        if (!i)
-          try {
-            if (r) {
-              if (a > 1 && (!r.blockNumber || u - r.blockNumber + 1n < a))
-                return;
-              l(() => t.resolve(r));
-              return;
-            }
-            if (c || (i = !0, await v(async () => {
-              c = await f(o, J, "getTransaction")({ hash: m }), c.blockNumber && (u = c.blockNumber);
-            }, {
-              delay: N,
-              retryCount: k
-            }), i = !1), r = await f(o, R, "getTransactionReceipt")({ hash: m }), a > 1 && (!r.blockNumber || u - r.blockNumber + 1n < a))
-              return;
-            l(() => t.resolve(r));
-          } catch (p) {
-            if (p instanceof O || p instanceof W) {
-              if (!c) {
-                i = !1;
-                return;
-              }
-              try {
-                n = c, i = !0;
-                const d = await v(() => f(o, H, "getBlock")({
-                  blockNumber: u,
-                  includeTransactions: !0
-                }), {
-                  delay: N,
-                  retryCount: k,
-                  shouldRetry: ({ error: s }) => s instanceof A
-                });
-                i = !1;
-                const e = d.transactions.find(({ from: s, nonce: x }) => s === n.from && x === n.nonce);
-                if (!e || (r = await f(o, R, "getTransactionReceipt")({
-                  hash: e.hash
-                }), a > 1 && (!r.blockNumber || u - r.blockNumber + 1n < a)))
-                  return;
-                let T = "replaced";
-                e.to === n.to && e.value === n.value && e.input === n.input ? T = "repriced" : e.from === e.to && e.value === 0n && (T = "cancelled"), l(() => {
-                  var s;
-                  (s = t.onReplaced) == null || s.call(t, {
-                    reason: T,
-                    replacedTransaction: n,
-                    transaction: e,
-                    transactionReceipt: r
-                  }), t.resolve(r);
-                });
-              } catch (d) {
-                l(() => t.reject(d));
-              }
-            } else
-              l(() => t.reject(p));
-          }
-      }
-    });
-  });
-  return h;
+class m {
+  constructor() {
+    this.memory = /* @__PURE__ */ new Map();
+  }
+  getItem(e) {
+    return this.memory.has(e) ? this.memory.get(e) : null;
+  }
+  setItem(e, t) {
+    this.memory.set(e, t);
+  }
+  removeItem(e) {
+    this.memory.has(e) && this.memory.delete(e);
+  }
 }
 export {
-  D as waitForTransactionReceipt
+  m as MemoryStorage
 };

package/dist/index13.cjs

@@ -1,16 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index49.cjs"),M=require("./index42.cjs"),h=require("./index50.cjs");function R(r){const{chainId:o,domain:s,expirationTime:l,issuedAt:m=new Date,nonce:a,notBefore:f,requestId:w,resources:g,scheme:i,uri:c,version:d}=r;{if(o!==Math.floor(o))throw new e.SiweInvalidMessageFieldError({field:"chainId",metaMessages:["- Chain ID must be a EIP-155 chain ID.","- See https://eips.ethereum.org/EIPS/eip-155","",`Provided value: ${o}`]});if(!(E.test(s)||F.test(s)||b.test(s)))throw new e.SiweInvalidMessageFieldError({field:"domain",metaMessages:["- Domain must be an RFC 3986 authority.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${s}`]});if(!A.test(a))throw new e.SiweInvalidMessageFieldError({field:"nonce",metaMessages:["- Nonce must be at least 8 characters.","- Nonce must be alphanumeric.","",`Provided value: ${a}`]});if(!h.isUri(c))throw new e.SiweInvalidMessageFieldError({field:"uri",metaMessages:["- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${c}`]});if(d!=="1")throw new e.SiweInvalidMessageFieldError({field:"version",metaMessages:["- Version must be '1'.","",`Provided value: ${d}`]});if(i&&!P.test(i))throw new e.SiweInvalidMessageFieldError({field:"scheme",metaMessages:["- Scheme must be an RFC 3986 URI scheme.","- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1","",`Provided value: ${i}`]});const t=r.statement;if(t!=null&&t.includes(`
-`))throw new e.SiweInvalidMessageFieldError({field:"statement",metaMessages:["- Statement must not include '\\n'.","",`Provided value: ${t}`]})}const $=M.getAddress(r.address),v=i?`${i}://${s}`:s,I=r.statement?`${r.statement}
-`:"",S=`${v} wants you to sign in with your Ethereum account:
-${$}
-
-${I}`;let n=`URI: ${c}
-Version: ${d}
-Chain ID: ${o}
-Nonce: ${a}
-Issued At: ${m.toISOString()}`;if(l&&(n+=`
-Expiration Time: ${l.toISOString()}`),f&&(n+=`
-Not Before: ${f.toISOString()}`),w&&(n+=`
-Request ID: ${w}`),g){let t=`
-Resources:`;for(const u of g){if(!h.isUri(u))throw new e.SiweInvalidMessageFieldError({field:"resources",metaMessages:["- Every resource must be a RFC 3986 URI.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${u}`]});t+=`
-- ${u}`}n+=t}return`${S}
-${n}`}const E=/^([a-zA-Z0-9]([a-zA-Z0-9\-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/,F=/^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/,b=/^localhost(:[0-9]{1,5})?$/,A=/^[a-zA-Z0-9]{8,}$/,P=/^([a-zA-Z][a-zA-Z0-9+-.]*)$/;exports.createSiweMessage=R;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var t=(e=>(e.AUTH_TOKEN="auth_token",e))(t||{});exports.StoreKeys=t;

package/dist/index13.js

@@ -1,116 +1,4 @@
-import { SiweInvalidMessageFieldError as e } from "./index49.js";
-import { getAddress as S } from "./index42.js";
-import { isUri as $ } from "./index50.js";
-function C(n) {
-  const { chainId: i, domain: s, expirationTime: u, issuedAt: g = /* @__PURE__ */ new Date(), nonce: a, notBefore: m, requestId: h, resources: w, scheme: o, uri: c, version: f } = n;
-  {
-    if (i !== Math.floor(i))
-      throw new e({
-        field: "chainId",
-        metaMessages: [
-          "- Chain ID must be a EIP-155 chain ID.",
-          "- See https://eips.ethereum.org/EIPS/eip-155",
-          "",
-          `Provided value: ${i}`
-        ]
-      });
-    if (!(p.test(s) || M.test(s) || x.test(s)))
-      throw new e({
-        field: "domain",
-        metaMessages: [
-          "- Domain must be an RFC 3986 authority.",
-          "- See https://www.rfc-editor.org/rfc/rfc3986",
-          "",
-          `Provided value: ${s}`
-        ]
-      });
-    if (!A.test(a))
-      throw new e({
-        field: "nonce",
-        metaMessages: [
-          "- Nonce must be at least 8 characters.",
-          "- Nonce must be alphanumeric.",
-          "",
-          `Provided value: ${a}`
-        ]
-      });
-    if (!$(c))
-      throw new e({
-        field: "uri",
-        metaMessages: [
-          "- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.",
-          "- See https://www.rfc-editor.org/rfc/rfc3986",
-          "",
-          `Provided value: ${c}`
-        ]
-      });
-    if (f !== "1")
-      throw new e({
-        field: "version",
-        metaMessages: [
-          "- Version must be '1'.",
-          "",
-          `Provided value: ${f}`
-        ]
-      });
-    if (o && !P.test(o))
-      throw new e({
-        field: "scheme",
-        metaMessages: [
-          "- Scheme must be an RFC 3986 URI scheme.",
-          "- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1",
-          "",
-          `Provided value: ${o}`
-        ]
-      });
-    const t = n.statement;
-    if (t != null && t.includes(`
-`))
-      throw new e({
-        field: "statement",
-        metaMessages: [
-          "- Statement must not include '\\n'.",
-          "",
-          `Provided value: ${t}`
-        ]
-      });
-  }
-  const l = S(n.address), v = o ? `${o}://${s}` : s, I = n.statement ? `${n.statement}
-` : "", R = `${v} wants you to sign in with your Ethereum account:
-${l}
-
-${I}`;
-  let r = `URI: ${c}
-Version: ${f}
-Chain ID: ${i}
-Nonce: ${a}
-Issued At: ${g.toISOString()}`;
-  if (u && (r += `
-Expiration Time: ${u.toISOString()}`), m && (r += `
-Not Before: ${m.toISOString()}`), h && (r += `
-Request ID: ${h}`), w) {
-    let t = `
-Resources:`;
-    for (const d of w) {
-      if (!$(d))
-        throw new e({
-          field: "resources",
-          metaMessages: [
-            "- Every resource must be a RFC 3986 URI.",
-            "- See https://www.rfc-editor.org/rfc/rfc3986",
-            "",
-            `Provided value: ${d}`
-          ]
-        });
-      t += `
-- ${d}`;
-    }
-    r += t;
-  }
-  return `${R}
-${r}`;
-}
-const p = /^([a-zA-Z0-9]([a-zA-Z0-9\-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/, M = /^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/, x = /^localhost(:[0-9]{1,5})?$/, A = /^[a-zA-Z0-9]{8,}$/, P = /^([a-zA-Z][a-zA-Z0-9+-.]*)$/;
+var t = /* @__PURE__ */ ((r) => (r.AUTH_TOKEN = "auth_token", r))(t || {});
 export {
-  C as createSiweMessage
+  t as StoreKeys
 };

package/dist/index14.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index52.cjs"),t=e.defineChain({id:1,name:"Ethereum",nativeCurrency:{name:"Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://eth.merkle.io"]}},blockExplorers:{default:{name:"Etherscan",url:"https://etherscan.io",apiUrl:"https://api.etherscan.io/api"}},contracts:{ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xce01f8eee7E479C928F8919abD53E553a36CeF67",blockCreated:19258213},multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:14353601}}});exports.mainnet=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index16.cjs"),n=require("viem"),s=require("./index19.cjs"),l=require("./index21.cjs"),o={42161:s.mainnet,421614:l.sepolia},b=async e=>{const{chain:t}=e;if(!t)return r.Err("No chain found");const a=(u=>u in o)(t.id)?o[t.id]:t;return await i(a)},i=async e=>{const t=n.createPublicClient({chain:e,transport:n.http()});try{const c=await t.getBlockNumber();return r.Ok(Number(c))}catch(c){return r.Err("Failed to fetch evm block number",c)}},m=async e=>{try{const t=await e.getLatestTip();return r.Ok(t)}catch(t){return r.Err("Failed to fetch bitcoin block number",t)}};exports._fetchEVMBlockNumber=i;exports.fetchBitcoinBlockNumber=m;exports.fetchEVMBlockNumber=b;