@solarpunkltd/swarm-chat-js 6.2.2 → 6.2.3

package/dist/index.esm.js

@@ -109,7 +109,7 @@ var di = {};
   }
   async function u(e, t = 1) {
     const n = As(e, t), s = [], o = n.map(async (d) => {
-      for (const f of d) s.push(await f());
+      for (const h of d) s.push(await h());
     });
     return await Promise.all(o), s;
   }
@@ -120,7 +120,7 @@ var di = {};
       }, e)
     );
   }
-  function h(e, t = Math.random) {
+  function f(e, t = Math.random) {
     for (let n = e.length - 1; n > 0; n--) {
       const s = Math.floor(t() * (n + 1)), o = e[n];
       e[n] = e[s], e[s] = o;
@@ -169,7 +169,7 @@ var di = {};
     return !0;
   }
   function Oe(e, t, n = Math.random) {
-    return h(Jn(0, e.length - 1), n).slice(0, t);
+    return f(Jn(0, e.length - 1), n).slice(0, t);
   }
   function Jt(e, t) {
     return e.map((n) => n[t]);
@@ -218,17 +218,17 @@ var di = {};
     const o = [];
     for (; o.length < t; ) {
       const d = Yt(e, s);
-      o.some((f) => n(f, d)) || o.push(d);
+      o.some((h) => n(h, d)) || o.push(d);
     }
     return o;
   }
   function Ri(e, t, n, s, o, d = Math.random) {
-    const f = e.filter((m) => m !== t && m !== n), v = [];
-    for (t !== null && v.push(t); f.length && v.length < s; ) {
-      const m = a.Random.intBetween(0, f.length - 1, d);
-      o(f[m], v) && v.push(f[m]), f.splice(m, 1);
+    const h = e.filter((m) => m !== t && m !== n), v = [];
+    for (t !== null && v.push(t); h.length && v.length < s; ) {
+      const m = a.Random.intBetween(0, h.length - 1, d);
+      o(h[m], v) && v.push(h[m]), h.splice(m, 1);
     }
-    return h(v, d), { values: v, indexOfGuaranteed: t !== null ? v.indexOf(t) : -1 };
+    return f(v, d), { values: v, indexOfGuaranteed: t !== null ? v.indexOf(t) : -1 };
   }
   function qe(e) {
     if (!e.length) throw Error("Received empty array");
@@ -242,7 +242,7 @@ var di = {};
   }
   function Ni(e, t, n) {
     if (n === void 0 && (n = Math.random()), e.length !== t.length) throw new Error("Array length mismatch");
-    let s = t.reduce((d, f) => d + f, 0);
+    let s = t.reduce((d, h) => d + h, 0);
     const o = n * s;
     for (let d = 0; d < e.length - 1; d++) if (s -= t[d], o >= s) return e[d];
     return qe(e);
@@ -250,7 +250,7 @@ var di = {};
   function ji(e, t, n = Math.random) {
     const s = t.map((d) => n() * d), o = [];
     for (let d = 0; d < e.length; d++) o.push([e[d], s[d]]);
-    return o.sort((d, f) => f[1] - d[1]).map((d) => d[0]);
+    return o.sort((d, h) => h[1] - d[1]).map((d) => d[0]);
   }
   function ye(e, t) {
     if (e == null) return null;
@@ -266,7 +266,7 @@ var di = {};
     const s = t.split(/\.|\[/);
     let o = e;
     for (let d = 0; d < s.length; d++) {
-      const f = s[d], v = d < s.length - 1 && s[d + 1].includes("]"), m = f.includes("]") ? f.replace(/\[|\]/g, "") : f;
+      const h = s[d], v = d < s.length - 1 && s[d + 1].includes("]"), m = h.includes("]") ? h.replace(/\[|\]/g, "") : h;
       if (d === s.length - 1) return o[m] = n, n;
       ce(o[m]) || (v ? o[m] = [] : o[m] = {}), o = o[m];
     }
@@ -333,7 +333,7 @@ var di = {};
     return "#" + e.map((t) => t.toString(16).padStart(2, "0")).join("");
   }
   function qi(e, t, n, s) {
-    const o = e * Math.PI / 180, d = n * Math.PI / 180, f = (n - e) * Math.PI / 180, v = (s - t) * Math.PI / 180, m = Math.sin(f / 2) * Math.sin(f / 2) + Math.cos(o) * Math.cos(d) * Math.sin(v / 2) * Math.sin(v / 2);
+    const o = e * Math.PI / 180, d = n * Math.PI / 180, h = (n - e) * Math.PI / 180, v = (s - t) * Math.PI / 180, m = Math.sin(h / 2) * Math.sin(h / 2) + Math.cos(o) * Math.cos(d) * Math.sin(v / 2) * Math.sin(v / 2);
     return 6371e3 * (2 * Math.atan2(Math.sqrt(m), Math.sqrt(1 - m)));
   }
   function St(e, t) {
@@ -810,12 +810,12 @@ var di = {};
     const t = /\{(.+?)\}/, n = e.match(t);
     if (!n || !n.index) return [e];
     const s = n[1].split(","), o = e.slice(0, n.index), d = e.slice(n.index + n[0].length);
-    let f = [];
+    let h = [];
     for (const v of s) {
       const m = Xn(o + v + d);
-      f = f.concat(m);
+      h = h.concat(m);
     }
-    return f;
+    return h;
   }
   function Je(e) {
     return e.split(
@@ -1039,21 +1039,21 @@ var di = {};
   function ls(e, t) {
     const n = "=", s = t.length;
     let o = 0, d = 0;
-    const f = [];
+    const h = [];
     for (let v = 0; v < e.length; v++) {
       const m = e[v];
       if (m === n) break;
       const x = t.indexOf(m);
       if (x === -1) throw new Error(`Invalid character: ${m}`);
-      d = d << Math.log2(s) | x, o += Math.log2(s), o >= 8 && (o -= 8, f.push(d >> o & 255));
+      d = d << Math.log2(s) | x, o += Math.log2(s), o >= 8 && (o -= 8, h.push(d >> o & 255));
     }
-    return new Uint8Array(f);
+    return new Uint8Array(h);
   }
   function ds(e, t) {
     const n = t.length;
     let s = 0, o = 0, d = "";
-    for (let f = 0; f < e.length; f++)
-      for (o = o << 8 | e[f], s += 8; s >= Math.log2(n); ) s -= Math.log2(n), d += t[o >> s & n - 1];
+    for (let h = 0; h < e.length; h++)
+      for (o = o << 8 | e[h], s += 8; s >= Math.log2(n); ) s -= Math.log2(n), d += t[o >> s & n - 1];
     return s > 0 && (d += t[o << Math.log2(n) - s & n - 1]), d.length % 4 !== 0 && (d += "=".repeat(4 - d.length % 4)), d;
   }
   function Co(e) {
@@ -1073,9 +1073,9 @@ var di = {};
     if (n.length !== s.length) return null;
     const o = {};
     for (let d = 0; d < n.length; d++) {
-      const f = n[d];
-      if (f.startsWith(":")) o[f.slice(1)] = s[d];
-      else if (f !== s[d]) return null;
+      const h = n[d];
+      if (h.startsWith(":")) o[h.slice(1)] = s[d];
+      else if (h !== s[d]) return null;
     }
     return o;
   }
@@ -1086,23 +1086,23 @@ var di = {};
   }
   function Do(e, t, n, s = Math.random) {
     const o = a.Arrays.shuffle(
-      t.map((f) => ({
+      t.map((h) => ({
         variants: a.Arrays.shuffle(
-          f.variants.map((v) => v),
+          h.variants.map((v) => v),
           s
         ),
-        avoid: f.avoid
+        avoid: h.avoid
       })),
       s
     ), d = [];
-    for (const f of o) {
-      const v = f.variants.filter((x) => x !== f.avoid), m = v.find((x) => e.includes(x));
+    for (const h of o) {
+      const v = h.variants.filter((x) => x !== h.avoid), m = v.find((x) => e.includes(x));
       if (m && (It(d, lr(e, m, v)), d.length >= n)) break;
     }
     if (d.length < n)
-      for (const f of o) {
-        const v = f.variants.find((m) => e.includes(m));
-        if (v && (It(d, lr(e, v, f.variants)), d.length >= n)) break;
+      for (const h of o) {
+        const v = h.variants.find((m) => e.includes(m));
+        if (v && (It(d, lr(e, v, h.variants)), d.length >= n)) break;
       }
     return d.slice(0, n);
   }
@@ -1129,8 +1129,8 @@ var di = {};
   function Lo(e, t, n = {}) {
     const s = [];
     let o = "", d = 0;
-    for (let f = 0; f < e.length; f++) {
-      const v = e[f], m = n[v] || 1;
+    for (let h = 0; h < e.length; h++) {
+      const v = e[h], m = n[v] || 1;
       if (o += v, d += m, d > t) {
         const { line: x, rest: M } = fs(o);
         s.push(x), o = M, d = M.split("").map((U) => n[U] || 1).reduce((U, je) => U + je, 0);
@@ -1180,8 +1180,8 @@ var di = {};
       if (e[d + t.length + 1] === o)
         if (e[d + t.length + 2] === o) e = e.replace(`${s}${t}${o}${o}`, n);
         else {
-          const f = Rt(e, d + t.length + 2, ["_"]);
-          e = e.replace(`${s}${t}${o}${f}`, n);
+          const h = Rt(e, d + t.length + 2, ["_"]);
+          e = e.replace(`${s}${t}${o}${h}`, n);
         }
       else e = e.replace(`${s}${t}`, n);
       d = e.indexOf(`${s}${t}`, d + n.length);
@@ -1207,7 +1207,7 @@ var di = {};
     for (; n !== -1; ) {
       const s = is(e, "[", n), o = e.indexOf(")", n);
       if (s !== -1 && o !== -1) {
-        const [d, f] = e.slice(s + 1, o).split("]("), v = t(d, f);
+        const [d, h] = e.slice(s + 1, o).split("]("), v = t(d, h);
         e = e.slice(0, s) + v + e.slice(o + 1);
       }
       n = e.indexOf("](", n + 1);
@@ -1232,14 +1232,14 @@ var di = {};
   function Jo(e, t) {
     let n = null, s = -1 / 0;
     for (const [o, d] of Object.entries(e)) {
-      const f = t(d);
-      f > s && (s = f, n = o);
+      const h = t(d);
+      h > s && (s = h, n = o);
     }
     return n ? [n, e[n]] : null;
   }
   function Ko(e, t, n, s) {
-    const o = e.find((f) => f[t] === n), d = e.find((f) => f[t] === n + s);
-    o && d ? (o[t] = n + s, d[t] = n) : o && (o[t] = n + s), e.sort((f, v) => At(f[t]) - At(v[t])), e.forEach((f, v) => f[t] = v + 1);
+    const o = e.find((h) => h[t] === n), d = e.find((h) => h[t] === n + s);
+    o && d ? (o[t] = n + s, d[t] = n) : o && (o[t] = n + s), e.sort((h, v) => At(h[t]) - At(v[t])), e.forEach((h, v) => h[t] = v + 1);
   }
   function Yo(e) {
     const t = Object.keys(e);
@@ -1257,8 +1257,8 @@ var di = {};
   function ec(e, t = ",", n = '"') {
     const s = [];
     let o = "", d = !1;
-    const f = e.split("");
-    for (const v of f) v === t && !d ? (s.push(o), o = "") : v === n && (!o && !d || d) ? d = !d : o += v;
+    const h = e.split("");
+    for (const v of h) v === t && !d ? (s.push(o), o = "") : v === n && (!o && !d || d) ? d = !d : o += v;
     return s.push(o), s;
   }
   function tc(e) {
@@ -1369,8 +1369,8 @@ var di = {};
   }
   function vc(e, t, n, s) {
     s || (s = Date.now());
-    const o = t / n, d = s - e, f = d / t, v = f * n, m = v - d;
-    return { deltaMs: d, progress: o, baseTimeMs: f, totalTimeMs: v, remainingTimeMs: m };
+    const o = t / n, d = s - e, h = d / t, v = h * n, m = v - d;
+    return { deltaMs: d, progress: o, baseTimeMs: h, totalTimeMs: v, remainingTimeMs: m };
   }
   const wc = {
     0: "sunday",
@@ -1469,8 +1469,8 @@ var di = {};
   async function Mc(e, t, n) {
     const s = Date.now(), o = pr[e];
     if (o && o.validUntil > s) return o.value;
-    const d = await n(), f = s + t;
-    return pr[e] = { value: d, validUntil: f }, d;
+    const d = await n(), h = s + t;
+    return pr[e] = { value: d, validUntil: h }, d;
   }
   function $c(e) {
     delete pr[e];
@@ -1479,9 +1479,9 @@ var di = {};
     return e.filter((t) => t).join("/").replace(new RegExp("(?<!:)\\/+", "g"), "/");
   }
   function Rc(e, t, n, s, o = !0) {
-    const d = e.indexOf(t), f = e.indexOf(n, d + t.length);
-    if (d === -1 || f === -1) throw Error("Start or end not found");
-    return o ? e.substring(0, d + t.length) + s + e.substring(f) : e.substring(0, d) + s + e.substring(f + n.length);
+    const d = e.indexOf(t), h = e.indexOf(n, d + t.length);
+    if (d === -1 || h === -1) throw Error("Start or end not found");
+    return o ? e.substring(0, d + t.length) + s + e.substring(h) : e.substring(0, d) + s + e.substring(h + n.length);
   }
   function Cc(e) {
     let t = "p";
@@ -1545,11 +1545,11 @@ var di = {};
   }
   function Lc(e, t, n, s, o) {
     const d = {};
-    for (const f of Object.keys(t)) d[f] = [];
+    for (const h of Object.keys(t)) d[h] = [];
     d[s] = [], o && (e = e.sort(o));
-    for (const f of e) {
-      const v = f[n], m = t[v] ? v : s;
-      d[m].length >= t[m] ? d[s].push(f) : d[m].push(f);
+    for (const h of e) {
+      const v = h[n], m = t[v] ? v : s;
+      d[m].length >= t[m] ? d[s].push(h) : d[m].push(h);
     }
     return d;
   }
@@ -1599,8 +1599,8 @@ var di = {};
   function qc(e, t) {
     const n = (t == null ? void 0 : t.longForm) ?? !1, s = t != null && t.unit ? ` ${t.unit}` : "", o = n ? Wc : Es, d = (t == null ? void 0 : t.precision) ?? 1;
     if (e < le[0]) return `${e}${s}`;
-    for (let f = 0; f < le.length - 1; f++)
-      if (e < le[f + 1]) return `${(e / le[f]).toFixed(d)}${n ? " " : ""}${o[f]}${s}`;
+    for (let h = 0; h < le.length - 1; h++)
+      if (e < le[h + 1]) return `${(e / le[h]).toFixed(d)}${n ? " " : ""}${o[h]}${s}`;
     return `${(e / le[le.length - 1]).toFixed(d)}${n ? " " : ""}${o[le.length - 1]}${s}`;
   }
   function mr(e) {
@@ -1688,16 +1688,16 @@ var di = {};
     let o = 1;
     const d = [1];
     for (let v = 0; v < n.length - 1; v++) o *= n[v], d.push(o);
-    const f = [];
+    const h = [];
     for (let v = 0; v < s; v++) {
       const m = {};
       for (let x = 0; x < t.length; x++) {
         const M = e[t[x]], U = Math.floor(v / d[x]) % M.length;
         m[t[x]] = M[U];
       }
-      f.push(m);
+      h.push(m);
     }
-    return f;
+    return h;
   }
   function du(e) {
     return Object.values(e).filter((t) => t).length;
@@ -1707,9 +1707,9 @@ var di = {};
   }
   function Nt(e, t, n, s, o) {
     if (!ce(t)) return t;
-    for (const [d, f] of Object.entries(t)) {
+    for (const [d, h] of Object.entries(t)) {
       const v = fu(n, d, s);
-      Array.isArray(f) ? o ? Nt(e, f, v, !0, o) : e[v] = f.map((m) => Nt(Array.isArray(m) ? [] : {}, m, "", !1, o)) : ce(f) ? Nt(e, f, v, !1, o) : e[v] = f;
+      Array.isArray(h) ? o ? Nt(e, h, v, !0, o) : e[v] = h.map((m) => Nt(Array.isArray(m) ? [] : {}, m, "", !1, o)) : ce(h) ? Nt(e, h, v, !1, o) : e[v] = h;
     }
     return e;
   }
@@ -1769,9 +1769,9 @@ var di = {};
     return Object.values(Ts(e, t));
   }
   function wu(e, t, n, s, o) {
-    const d = t ? e.map(t) : e, f = {};
-    for (const m of d) f[m] = (f[m] || 0) + 1;
-    const v = s ? Is(f, o ? (m, x) => m[1] - x[1] : (m, x) => x[1] - m[1]) : f;
+    const d = t ? e.map(t) : e, h = {};
+    for (const m of d) h[m] = (h[m] || 0) + 1;
+    const v = s ? Is(h, o ? (m, x) => m[1] - x[1] : (m, x) => x[1] - m[1]) : h;
     return n ? Object.keys(v) : v;
   }
   function Is(e, t) {
@@ -1781,7 +1781,7 @@ var di = {};
     const t = [], n = Object.keys(e), s = e[n[0]].length;
     for (let o = 0; o < s; o++) {
       const d = {};
-      for (const f of n) d[f] = e[f][o];
+      for (const h of n) d[h] = e[h][o];
       t.push(d);
     }
     return t;
@@ -1917,7 +1917,7 @@ var di = {};
     }
   }
   function Uu(e, t, n, s, o = !1) {
-    const d = /* @__PURE__ */ new Map(), f = [];
+    const d = /* @__PURE__ */ new Map(), h = [];
     e.forEach((m) => {
       const x = new Du(m);
       d.set(m[t], x);
@@ -1928,7 +1928,7 @@ var di = {};
       if (M) {
         const U = d.get(M);
         U && U.children.push(x);
-      } else f.push(x);
+      } else h.push(x);
     });
     const v = (m) => {
       m.children.sort((x, M) => {
@@ -1936,7 +1936,7 @@ var di = {};
         return o ? je - U : U - je;
       }), m.children.forEach(v);
     };
-    return f.forEach(v), f;
+    return h.forEach(v), h;
   }
   function $s(e, t) {
     if (Math.log2(e.length) % 1 !== 0) throw new Error("Array length must be a power of 2");
@@ -2079,7 +2079,7 @@ var di = {};
   ];
   function qu(e) {
     for (let t = 0; t < 24; t++) {
-      const n = e[0] ^ e[10] ^ e[20] ^ e[30] ^ e[40], s = e[1] ^ e[11] ^ e[21] ^ e[31] ^ e[41], o = e[2] ^ e[12] ^ e[22] ^ e[32] ^ e[42], d = e[3] ^ e[13] ^ e[23] ^ e[33] ^ e[43], f = e[4] ^ e[14] ^ e[24] ^ e[34] ^ e[44], v = e[5] ^ e[15] ^ e[25] ^ e[35] ^ e[45], m = e[6] ^ e[16] ^ e[26] ^ e[36] ^ e[46], x = e[7] ^ e[17] ^ e[27] ^ e[37] ^ e[47], M = e[8] ^ e[18] ^ e[28] ^ e[38] ^ e[48], U = e[9] ^ e[19] ^ e[29] ^ e[39] ^ e[49], je = o << 1 | d >>> 31, Il = d << 1 | o >>> 31, Xe = M ^ je, et = U ^ Il, Ml = f << 1 | v >>> 31, $l = v << 1 | f >>> 31, tt = n ^ Ml, rt = s ^ $l, Rl = m << 1 | x >>> 31, Cl = x << 1 | m >>> 31, nt = o ^ Rl, st = d ^ Cl, Nl = M << 1 | U >>> 31, jl = U << 1 | M >>> 31, it = f ^ Nl, at = v ^ jl, Dl = n << 1 | s >>> 31, Ul = s << 1 | n >>> 31, ot = m ^ Dl, ct = x ^ Ul;
+      const n = e[0] ^ e[10] ^ e[20] ^ e[30] ^ e[40], s = e[1] ^ e[11] ^ e[21] ^ e[31] ^ e[41], o = e[2] ^ e[12] ^ e[22] ^ e[32] ^ e[42], d = e[3] ^ e[13] ^ e[23] ^ e[33] ^ e[43], h = e[4] ^ e[14] ^ e[24] ^ e[34] ^ e[44], v = e[5] ^ e[15] ^ e[25] ^ e[35] ^ e[45], m = e[6] ^ e[16] ^ e[26] ^ e[36] ^ e[46], x = e[7] ^ e[17] ^ e[27] ^ e[37] ^ e[47], M = e[8] ^ e[18] ^ e[28] ^ e[38] ^ e[48], U = e[9] ^ e[19] ^ e[29] ^ e[39] ^ e[49], je = o << 1 | d >>> 31, Il = d << 1 | o >>> 31, Xe = M ^ je, et = U ^ Il, Ml = h << 1 | v >>> 31, $l = v << 1 | h >>> 31, tt = n ^ Ml, rt = s ^ $l, Rl = m << 1 | x >>> 31, Cl = x << 1 | m >>> 31, nt = o ^ Rl, st = d ^ Cl, Nl = M << 1 | U >>> 31, jl = U << 1 | M >>> 31, it = h ^ Nl, at = v ^ jl, Dl = n << 1 | s >>> 31, Ul = s << 1 | n >>> 31, ot = m ^ Dl, ct = x ^ Ul;
       e[0] ^= Xe, e[1] ^= et, e[2] ^= tt, e[3] ^= rt, e[4] ^= nt, e[5] ^= st, e[6] ^= it, e[7] ^= at, e[8] ^= ot, e[9] ^= ct, e[10] ^= Xe, e[11] ^= et, e[12] ^= tt, e[13] ^= rt, e[14] ^= nt, e[15] ^= st, e[16] ^= it, e[17] ^= at, e[18] ^= ot, e[19] ^= ct, e[20] ^= Xe, e[21] ^= et, e[22] ^= tt, e[23] ^= rt, e[24] ^= nt, e[25] ^= st, e[26] ^= it, e[27] ^= at, e[28] ^= ot, e[29] ^= ct, e[30] ^= Xe, e[31] ^= et, e[32] ^= tt, e[33] ^= rt, e[34] ^= nt, e[35] ^= st, e[36] ^= it, e[37] ^= at, e[38] ^= ot, e[39] ^= ct, e[40] ^= Xe, e[41] ^= et, e[42] ^= tt, e[43] ^= rt, e[44] ^= nt, e[45] ^= st, e[46] ^= it, e[47] ^= at, e[48] ^= ot, e[49] ^= ct;
       const Sr = e[0], Tr = e[1], Ar = e[2] << 1 | e[3] >>> 31, Or = e[3] << 1 | e[2] >>> 31, Ir = e[5] << 30 | e[4] >>> 2, Mr = e[4] << 30 | e[5] >>> 2, $r = e[6] << 28 | e[7] >>> 4, Rr = e[7] << 28 | e[6] >>> 4, Cr = e[8] << 27 | e[9] >>> 5, Nr = e[9] << 27 | e[8] >>> 5, jr = e[11] << 4 | e[10] >>> 28, Dr = e[10] << 4 | e[11] >>> 28, Ur = e[13] << 12 | e[12] >>> 20, Pr = e[12] << 12 | e[13] >>> 20, Zr = e[14] << 6 | e[15] >>> 26, Br = e[15] << 6 | e[14] >>> 26, Lr = e[17] << 23 | e[16] >>> 9, zr = e[16] << 23 | e[17] >>> 9, Vr = e[18] << 20 | e[19] >>> 12, Fr = e[19] << 20 | e[18] >>> 12, Wr = e[20] << 3 | e[21] >>> 29, Hr = e[21] << 3 | e[20] >>> 29, qr = e[22] << 10 | e[23] >>> 22, Gr = e[23] << 10 | e[22] >>> 22, Jr = e[25] << 11 | e[24] >>> 21, Kr = e[24] << 11 | e[25] >>> 21, Yr = e[26] << 25 | e[27] >>> 7, Qr = e[27] << 25 | e[26] >>> 7, Xr = e[29] << 7 | e[28] >>> 25, en = e[28] << 7 | e[29] >>> 25, tn = e[31] << 9 | e[30] >>> 23, rn = e[30] << 9 | e[31] >>> 23, nn = e[33] << 13 | e[32] >>> 19, sn = e[32] << 13 | e[33] >>> 19, an = e[34] << 15 | e[35] >>> 17, on = e[35] << 15 | e[34] >>> 17, cn = e[36] << 21 | e[37] >>> 11, un = e[37] << 21 | e[36] >>> 11, ln = e[38] << 8 | e[39] >>> 24, dn = e[39] << 8 | e[38] >>> 24, fn = e[40] << 18 | e[41] >>> 14, hn = e[41] << 18 | e[40] >>> 14, pn = e[42] << 2 | e[43] >>> 30, mn = e[43] << 2 | e[42] >>> 30, gn = e[45] << 29 | e[44] >>> 3, yn = e[44] << 29 | e[45] >>> 3, vn = e[47] << 24 | e[46] >>> 8, wn = e[46] << 24 | e[47] >>> 8, bn = e[48] << 14 | e[49] >>> 18, _n = e[49] << 14 | e[48] >>> 18;
       e[0] = Sr ^ ~Ur & Jr, e[1] = Tr ^ ~Pr & Kr, e[2] = Ur ^ ~Jr & cn, e[3] = Pr ^ ~Kr & un, e[4] = Jr ^ ~cn & bn, e[5] = Kr ^ ~un & _n, e[6] = cn ^ ~bn & Sr, e[7] = un ^ ~_n & Tr, e[8] = bn ^ ~Sr & Ur, e[9] = _n ^ ~Tr & Pr, e[10] = $r ^ ~Vr & Wr, e[11] = Rr ^ ~Fr & Hr, e[12] = Vr ^ ~Wr & nn, e[13] = Fr ^ ~Hr & sn, e[14] = Wr ^ ~nn & gn, e[15] = Hr ^ ~sn & yn, e[16] = nn ^ ~gn & $r, e[17] = sn ^ ~yn & Rr, e[18] = gn ^ ~$r & Vr, e[19] = yn ^ ~Rr & Fr, e[20] = Ar ^ ~Zr & Yr, e[21] = Or ^ ~Br & Qr, e[22] = Zr ^ ~Yr & ln, e[23] = Br ^ ~Qr & dn, e[24] = Yr ^ ~ln & fn, e[25] = Qr ^ ~dn & hn, e[26] = ln ^ ~fn & Ar, e[27] = dn ^ ~hn & Or, e[28] = fn ^ ~Ar & Zr, e[29] = hn ^ ~Or & Br, e[30] = Cr ^ ~jr & qr, e[31] = Nr ^ ~Dr & Gr, e[32] = jr ^ ~qr & an, e[33] = Dr ^ ~Gr & on, e[34] = qr ^ ~an & vn, e[35] = Gr ^ ~on & wn, e[36] = an ^ ~vn & Cr, e[37] = on ^ ~wn & Nr, e[38] = vn ^ ~Cr & jr, e[39] = wn ^ ~Nr & Dr, e[40] = Ir ^ ~Lr & Xr, e[41] = Mr ^ ~zr & en, e[42] = Lr ^ ~Xr & tn, e[43] = zr ^ ~en & rn, e[44] = Xr ^ ~tn & pn, e[45] = en ^ ~rn & mn, e[46] = tn ^ ~pn & Ir, e[47] = rn ^ ~mn & Mr, e[48] = pn ^ ~Ir & Lr, e[49] = mn ^ ~Mr & zr, e[0] ^= js[t * 2], e[1] ^= js[t * 2 + 1];
@@ -2159,7 +2159,7 @@ var di = {};
     const s = Math.min(e.length, t.length, n / 8 + 1);
     for (let o = 0; o < s; o++) {
       const d = e[o] ^ t[o];
-      for (let f = 0; f < 8; f++) if (d >> 7 - f & 1) return o * 8 + f;
+      for (let h = 0; h < 8; h++) if (d >> 7 - h & 1) return o * 8 + h;
     }
     return n;
   }
@@ -2216,8 +2216,8 @@ var di = {};
     e = $(e, t);
     let [n, s] = [0n, 1n], [o, d] = [t, e];
     for (; d !== 0n; ) {
-      const f = o / d;
-      [n, s] = [s, n - f * s], [o, d] = [d, o - f * d];
+      const h = o / d;
+      [n, s] = [s, n - h * s], [o, d] = [d, o - h * d];
     }
     if (o > 1n) throw new Error("a is not invertible");
     return n < 0n && (n += t), n;
@@ -2241,8 +2241,8 @@ var di = {};
     if (n === 0n && s === 0n) return [e, t];
     if (e === n && t === $(-s, o)) return [0n, 0n];
     if (e === n && t === s) return br(e, t, o);
-    const d = $((s - t) * Ye(n - e, o), o), f = $(d * d - e - n, o), v = $(d * (e - f) - t, o);
-    return [f, v];
+    const d = $((s - t) * Ye(n - e, o), o), h = $(d * d - e - n, o), v = $(d * (e - h) - t, o);
+    return [h, v];
   }
   function il(e) {
     if (e <= 0n || e >= D) throw new Error("Invalid private key");
@@ -2271,8 +2271,8 @@ var di = {};
   }
   function xe(e, t, n, s) {
     let o = [0n, 0n], d = [e, t];
-    const f = n.toString(2);
-    for (const v of f)
+    const h = n.toString(2);
+    for (const v of h)
       v === "0" ? (d = Ut(o[0], o[1], d[0], d[1], s), o = br(o[0], o[1], s)) : (o = Ut(o[0], o[1], d[0], d[1], s), d = br(d[0], d[1], s));
     return o;
   }
@@ -2290,19 +2290,19 @@ var di = {};
     )), n <= 0n || n >= D)
       throw new Error("Invalid nonce");
     const s = $(e, D), o = xe(jt, Dt, n, Z), d = $(o[0], D);
-    let f = $((s + $(d, D) * t) * Ye(n, D), D);
-    if (d === 0n || f === 0n) throw new Error("Invalid r or s value");
+    let h = $((s + $(d, D) * t) * Ye(n, D), D);
+    if (d === 0n || h === 0n) throw new Error("Invalid r or s value");
     let v = o[1] % 2n === 0n ? 27n : 28n;
-    return f > D / 2n && (f = D - f, v = v === 27n ? 28n : 27n), [d, f, v];
+    return h > D / 2n && (h = D - h, v = v === 27n ? 28n : 27n), [d, h, v];
   }
   function dl(e, t, n, s) {
     const o = zs($(t ** 3n + 7n, Z), Z);
     if (!o) throw new Error("Invalid r: does not correspond to a valid curve point");
-    const d = s === 27n ? 0n : 1n, f = o % 2n === d ? o : Z - o, v = $(Ne(se(e), "BE"), D), m = xe(t, f, n, Z), x = xe(jt, Dt, v, Z), M = Ut(m[0], m[1], x[0], $(-x[1], Z), Z);
+    const d = s === 27n ? 0n : 1n, h = o % 2n === d ? o : Z - o, v = $(Ne(se(e), "BE"), D), m = xe(t, h, n, Z), x = xe(jt, Dt, v, Z), M = Ut(m[0], m[1], x[0], $(-x[1], Z), Z);
     return xe(M[0], M[1], Ye(t, D), Z);
   }
   function fl(e, t, n, s) {
-    const o = $(Ne(se(e), "BE"), D), d = Ye(s, D), f = $(o * d, D), v = $(n * d, D), m = xe(jt, Dt, f, Z), x = xe(t[0], t[1], v, Z), M = Ut(m[0], m[1], x[0], x[1], Z);
+    const o = $(Ne(se(e), "BE"), D), d = Ye(s, D), h = $(o * d, D), v = $(n * d, D), m = xe(jt, Dt, h, Z), x = xe(t[0], t[1], v, Z), M = Ut(m[0], m[1], x[0], x[1], Z);
     return n === $(M[0], D);
   }
   class Fs {
@@ -2429,8 +2429,8 @@ var di = {};
     const o = e.findIndex((v) => v === `--${t}` || v.startsWith(`--${t}=`)), d = e[o];
     if (!d) return (n || {})[s || t || ""] || null;
     if (d.includes("=")) return d.split("=")[1];
-    const f = e[o + 1];
-    return f && !f.startsWith("-") ? f : (n || {})[s || t || ""] || null;
+    const h = e[o + 1];
+    return h && !h.startsWith("-") ? h : (n || {})[s || t || ""] || null;
   }
   function pl(e, t, n, s) {
     const o = Zt(e, t, n, s);
@@ -2445,8 +2445,8 @@ var di = {};
     const o = e.some((m) => m.endsWith("-" + t)), d = Zt(e, t, n, s);
     if (!d && o) return !0;
     if (!d && !o) return null;
-    const f = ["true", "1", "yes", "y", "on"], v = ["false", "0", "no", "n", "off"];
-    if (f.includes(d.toLowerCase())) return !0;
+    const h = ["true", "1", "yes", "y", "on"], v = ["false", "0", "no", "n", "off"];
+    if (h.includes(d.toLowerCase())) return !0;
     if (v.includes(d.toLowerCase())) return !1;
     throw Error(`Invalid boolean argument ${t}: ${d}`);
   }
@@ -2520,9 +2520,9 @@ var di = {};
     return !e[t][n + 1];
   }
   function xl(e, t, n) {
-    var o, d, f, v, m, x, M, U;
+    var o, d, h, v, m, x, M, U;
     const s = [];
-    return e[t][n] ? bl(e, t, n) || _l(e, t, n) ? [] : (!((o = e[t - 1]) != null && o[n - 1]) && Ys(e, t, n) && Xs(e, t, n) && s.push({ x: t, y: n }), !((d = e[t + 1]) != null && d[n - 1]) && Qs(e, t, n) && Xs(e, t, n) && s.push({ x: t + 1, y: n }), !((f = e[t - 1]) != null && f[n + 1]) && Ys(e, t, n) && ei(e, t, n) && s.push({ x: t, y: n + 1 }), !((v = e[t + 1]) != null && v[n + 1]) && Qs(e, t, n) && ei(e, t, n) && s.push({ x: t + 1, y: n + 1 }), s) : ((m = e[t - 1]) != null && m[n] && e[t][n - 1] && s.push({ x: t, y: n }), (x = e[t + 1]) != null && x[n] && e[t][n - 1] && s.push({ x: t + 1, y: n }), (M = e[t - 1]) != null && M[n] && e[t][n + 1] && s.push({ x: t, y: n + 1 }), (U = e[t + 1]) != null && U[n] && e[t][n + 1] && s.push({ x: t + 1, y: n + 1 }), s);
+    return e[t][n] ? bl(e, t, n) || _l(e, t, n) ? [] : (!((o = e[t - 1]) != null && o[n - 1]) && Ys(e, t, n) && Xs(e, t, n) && s.push({ x: t, y: n }), !((d = e[t + 1]) != null && d[n - 1]) && Qs(e, t, n) && Xs(e, t, n) && s.push({ x: t + 1, y: n }), !((h = e[t - 1]) != null && h[n + 1]) && Ys(e, t, n) && ei(e, t, n) && s.push({ x: t, y: n + 1 }), !((v = e[t + 1]) != null && v[n + 1]) && Qs(e, t, n) && ei(e, t, n) && s.push({ x: t + 1, y: n + 1 }), s) : ((m = e[t - 1]) != null && m[n] && e[t][n - 1] && s.push({ x: t, y: n }), (x = e[t + 1]) != null && x[n] && e[t][n - 1] && s.push({ x: t + 1, y: n }), (M = e[t - 1]) != null && M[n] && e[t][n + 1] && s.push({ x: t, y: n + 1 }), (U = e[t + 1]) != null && U[n] && e[t][n + 1] && s.push({ x: t + 1, y: n + 1 }), s);
   }
   function kl(e, t, n, s) {
     const o = [
@@ -2532,8 +2532,8 @@ var di = {};
       { x: n, y: s }
     ];
     for (let d = 0; d < e.length; d++)
-      for (let f = 0; f < e[0].length; f++) {
-        const v = xl(e, d, f);
+      for (let h = 0; h < e[0].length; h++) {
+        const v = xl(e, d, h);
         for (const m of v) o.some((x) => x.x === m.x && x.y === m.y) || o.push(m);
       }
     return o.map((d) => ({ x: d.x * t, y: d.y * t }));
@@ -2563,8 +2563,8 @@ var di = {};
       dy: 1
     }));
     n.forEach((m) => m.y++), d.forEach((m) => m.x++);
-    const f = yr([...o, ...d], (m, x) => m.x === x.x && m.y - 1 === x.y), v = yr([...s, ...n], (m, x) => m.y === x.y && m.x - 1 === x.x);
-    return [...f, ...v].map((m) => ({ start: m[0], end: qe(m) })).map((m) => ({
+    const h = yr([...o, ...d], (m, x) => m.x === x.x && m.y - 1 === x.y), v = yr([...s, ...n], (m, x) => m.y === x.y && m.x - 1 === x.x);
+    return [...h, ...v].map((m) => ({ start: m[0], end: qe(m) })).map((m) => ({
       start: xr(m.start, t),
       end: xr(Gs(m.end, { x: m.start.dx, y: m.start.dy }), t)
     }));
@@ -2578,26 +2578,26 @@ var di = {};
   function ti(e, t, n, s) {
     const o = (s.y - n.y) * (t.x - e.x) - (s.x - n.x) * (t.y - e.y);
     if (o === 0) return null;
-    let d = e.y - n.y, f = e.x - n.x;
-    const v = (s.x - n.x) * d - (s.y - n.y) * f, m = (t.x - e.x) * d - (t.y - e.y) * f;
-    return d = v / o, f = m / o, d > 0 && d < 1 && f > 0 && f < 1 ? { x: e.x + d * (t.x - e.x), y: e.y + d * (t.y - e.y) } : null;
+    let d = e.y - n.y, h = e.x - n.x;
+    const v = (s.x - n.x) * d - (s.y - n.y) * h, m = (t.x - e.x) * d - (t.y - e.y) * h;
+    return d = v / o, h = m / o, d > 0 && d < 1 && h > 0 && h < 1 ? { x: e.x + d * (t.x - e.x), y: e.y + d * (t.y - e.y) } : null;
   }
   function kr(e, t, n) {
     const s = [], o = Js(e, n, 1e4);
     for (const d of t) {
-      const f = ti(e, o, d.start, d.end);
-      f && s.push(f);
+      const h = ti(e, o, d.start, d.end);
+      h && s.push(h);
     }
-    return s.length ? s.reduce((d, f) => {
-      const v = Ks(e, f), m = Ks(e, d);
-      return v < m ? f : d;
+    return s.length ? s.reduce((d, h) => {
+      const v = Ks(e, h), m = Ks(e, d);
+      return v < m ? h : d;
     }) : null;
   }
   function Al(e, t, n) {
     const s = Tl(e, n), o = [];
     for (const d of s) {
-      const f = kr(e, t, d - 1e-3), v = kr(e, t, d + 1e-3);
-      f && o.push(f), v && o.push(v);
+      const h = kr(e, t, d - 1e-3), v = kr(e, t, d + 1e-3);
+      h && o.push(h), v && o.push(v);
     }
     return o;
   }
@@ -2714,7 +2714,7 @@ var di = {};
     onlyOrNull: g,
     firstOrThrow: E,
     firstOrNull: y,
-    shuffle: h,
+    shuffle: f,
     initialize: N,
     initialize2D: ne,
     rotate2D: re,
@@ -3073,12 +3073,12 @@ function ed(a, r) {
 }
 function ai(a, r, i) {
   r = new Bt(r), i = new ke(i);
-  const c = ed(r, i.publicKey().address()), u = i.sign(B.concatBytes(r.toUint8Array(), a.address.toUint8Array())), l = B.concatBytes(r.toUint8Array(), u.toUint8Array(), a.data), h = Le.fromSlice(a.data, 0), p = Pe.fromSlice(a.data, Le.LENGTH);
+  const c = ed(r, i.publicKey().address()), u = i.sign(B.concatBytes(r.toUint8Array(), a.address.toUint8Array())), l = B.concatBytes(r.toUint8Array(), u.toUint8Array(), a.data), f = Le.fromSlice(a.data, 0), p = Pe.fromSlice(a.data, Le.LENGTH);
   return {
     data: l,
     identifier: r,
     signature: u,
-    span: h,
+    span: f,
     payload: p,
     address: c,
     owner: i.publicKey().address()
@@ -3132,28 +3132,28 @@ var I;
   }
   a.assertNever = i, a.arrayToEnum = (u) => {
     const l = {};
-    for (const h of u)
-      l[h] = h;
+    for (const f of u)
+      l[f] = f;
     return l;
   }, a.getValidEnumValues = (u) => {
-    const l = a.objectKeys(u).filter((p) => typeof u[u[p]] != "number"), h = {};
+    const l = a.objectKeys(u).filter((p) => typeof u[u[p]] != "number"), f = {};
     for (const p of l)
-      h[p] = u[p];
-    return a.objectValues(h);
+      f[p] = u[p];
+    return a.objectValues(f);
   }, a.objectValues = (u) => a.objectKeys(u).map(function(l) {
     return u[l];
   }), a.objectKeys = typeof Object.keys == "function" ? (u) => Object.keys(u) : (u) => {
     const l = [];
-    for (const h in u)
-      Object.prototype.hasOwnProperty.call(u, h) && l.push(h);
+    for (const f in u)
+      Object.prototype.hasOwnProperty.call(u, f) && l.push(f);
     return l;
   }, a.find = (u, l) => {
-    for (const h of u)
-      if (l(h))
-        return h;
+    for (const f of u)
+      if (l(f))
+        return f;
   }, a.isInteger = typeof Number.isInteger == "function" ? (u) => Number.isInteger(u) : (u) => typeof u == "number" && isFinite(u) && Math.floor(u) === u;
   function c(u, l = " | ") {
-    return u.map((h) => typeof h == "string" ? `'${h}'` : h).join(l);
+    return u.map((f) => typeof f == "string" ? `'${f}'` : f).join(l);
   }
   a.joinValues = c, a.jsonStringifyReplacer = (u, l) => typeof l == "bigint" ? l.toString() : l;
 })(I || (I = {}));
@@ -3242,20 +3242,20 @@ class V extends Error {
     const i = r || function(l) {
       return l.message;
     }, c = { _errors: [] }, u = (l) => {
-      for (const h of l.issues)
-        if (h.code === "invalid_union")
-          h.unionErrors.map(u);
-        else if (h.code === "invalid_return_type")
-          u(h.returnTypeError);
-        else if (h.code === "invalid_arguments")
-          u(h.argumentsError);
-        else if (h.path.length === 0)
-          c._errors.push(i(h));
+      for (const f of l.issues)
+        if (f.code === "invalid_union")
+          f.unionErrors.map(u);
+        else if (f.code === "invalid_return_type")
+          u(f.returnTypeError);
+        else if (f.code === "invalid_arguments")
+          u(f.argumentsError);
+        else if (f.path.length === 0)
+          c._errors.push(i(f));
         else {
           let p = c, g = 0;
-          for (; g < h.path.length; ) {
-            const y = h.path[g];
-            g === h.path.length - 1 ? (p[y] = p[y] || { _errors: [] }, p[y]._errors.push(i(h))) : p[y] = p[y] || { _errors: [] }, p = p[y], g++;
+          for (; g < f.path.length; ) {
+            const y = f.path[g];
+            g === f.path.length - 1 ? (p[y] = p[y] || { _errors: [] }, p[y]._errors.push(i(f))) : p[y] = p[y] || { _errors: [] }, p = p[y], g++;
           }
         }
     };
@@ -3349,7 +3349,7 @@ function Lt() {
   return hi;
 }
 const zt = (a) => {
-  const { data: r, path: i, errorMaps: c, issueData: u } = a, l = [...i, ...u.path || []], h = {
+  const { data: r, path: i, errorMaps: c, issueData: u } = a, l = [...i, ...u.path || []], f = {
     ...u,
     path: l
   };
@@ -3362,7 +3362,7 @@ const zt = (a) => {
   let p = "";
   const g = c.filter((y) => !!y).slice().reverse();
   for (const y of g)
-    p = y(h, { data: r, defaultError: p }).message;
+    p = y(f, { data: r, defaultError: p }).message;
   return {
     ...u,
     path: l,
@@ -3409,10 +3409,10 @@ class L {
   static async mergeObjectAsync(r, i) {
     const c = [];
     for (const u of i) {
-      const l = await u.key, h = await u.value;
+      const l = await u.key, f = await u.value;
       c.push({
         key: l,
-        value: h
+        value: f
       });
     }
     return L.mergeObjectSync(r, c);
@@ -3420,10 +3420,10 @@ class L {
   static mergeObjectSync(r, i) {
     const c = {};
     for (const u of i) {
-      const { key: l, value: h } = u;
-      if (l.status === "aborted" || h.status === "aborted")
+      const { key: l, value: f } = u;
+      if (l.status === "aborted" || f.status === "aborted")
         return T;
-      l.status === "dirty" && r.dirty(), h.status === "dirty" && r.dirty(), l.value !== "__proto__" && (typeof h.value < "u" || u.alwaysSet) && (c[l.value] = h.value);
+      l.status === "dirty" && r.dirty(), f.status === "dirty" && r.dirty(), l.value !== "__proto__" && (typeof f.value < "u" || u.alwaysSet) && (c[l.value] = f.value);
     }
     return { status: r.value, value: c };
   }
@@ -3473,10 +3473,10 @@ function A(a) {
   const { errorMap: r, invalid_type_error: i, required_error: c, description: u } = a;
   if (r && (i || c))
     throw new Error(`Can't use "invalid_type_error" or "required_error" in conjunction with custom error map.`);
-  return r ? { errorMap: r, description: u } : { errorMap: (h, p) => {
+  return r ? { errorMap: r, description: u } : { errorMap: (f, p) => {
     var g, y;
     const { message: E } = a;
-    return h.code === "invalid_enum_value" ? { message: E ?? p.defaultError } : typeof p.data > "u" ? { message: (g = E ?? c) !== null && g !== void 0 ? g : p.defaultError } : h.code !== "invalid_type" ? { message: p.defaultError } : { message: (y = E ?? i) !== null && y !== void 0 ? y : p.defaultError };
+    return f.code === "invalid_enum_value" ? { message: E ?? p.defaultError } : typeof p.data > "u" ? { message: (g = E ?? c) !== null && g !== void 0 ? g : p.defaultError } : f.code !== "invalid_type" ? { message: p.defaultError } : { message: (y = E ?? i) !== null && y !== void 0 ? y : p.defaultError };
   }, description: u };
 }
 class O {
@@ -3598,11 +3598,11 @@ class O {
   refine(r, i) {
     const c = (u) => typeof i == "string" || typeof i > "u" ? { message: i } : typeof i == "function" ? i(u) : i;
     return this._refinement((u, l) => {
-      const h = r(u), p = () => l.addIssue({
+      const f = r(u), p = () => l.addIssue({
         code: w.custom,
         ...c(u)
       });
-      return typeof Promise < "u" && h instanceof Promise ? h.then((g) => g ? !0 : (p(), !1)) : h ? !0 : (p(), !1);
+      return typeof Promise < "u" && f instanceof Promise ? f.then((g) => g ? !0 : (p(), !1)) : f ? !0 : (p(), !1);
     });
   }
   refinement(r, i) {
@@ -3762,8 +3762,8 @@ class q extends O {
           message: l.message
         }), c.dirty());
       else if (l.kind === "length") {
-        const h = r.data.length > l.value, p = r.data.length < l.value;
-        (h || p) && (u = this._getOrReturnCtx(r, u), h ? b(u, {
+        const f = r.data.length > l.value, p = r.data.length < l.value;
+        (f || p) && (u = this._getOrReturnCtx(r, u), f ? b(u, {
           code: w.too_big,
           maximum: l.value,
           type: "string",
@@ -4118,8 +4118,8 @@ q.create = (a) => {
   });
 };
 function Od(a, r) {
-  const i = (a.toString().split(".")[1] || "").length, c = (r.toString().split(".")[1] || "").length, u = i > c ? i : c, l = parseInt(a.toFixed(u).replace(".", "")), h = parseInt(r.toFixed(u).replace(".", ""));
-  return l % h / Math.pow(10, u);
+  const i = (a.toString().split(".")[1] || "").length, c = (r.toString().split(".")[1] || "").length, u = i > c ? i : c, l = parseInt(a.toFixed(u).replace(".", "")), f = parseInt(r.toFixed(u).replace(".", ""));
+  return l % f / Math.pow(10, u);
 }
 class fe extends O {
   constructor() {
@@ -4641,11 +4641,11 @@ class G extends O {
         received: i.parsedType
       }), T;
     if (u.exactLength !== null) {
-      const h = i.data.length > u.exactLength.value, p = i.data.length < u.exactLength.value;
-      (h || p) && (b(i, {
-        code: h ? w.too_big : w.too_small,
+      const f = i.data.length > u.exactLength.value, p = i.data.length < u.exactLength.value;
+      (f || p) && (b(i, {
+        code: f ? w.too_big : w.too_small,
         minimum: p ? u.exactLength.value : void 0,
-        maximum: h ? u.exactLength.value : void 0,
+        maximum: f ? u.exactLength.value : void 0,
         type: "array",
         inclusive: !0,
         exact: !0,
@@ -4667,8 +4667,8 @@ class G extends O {
       exact: !1,
       message: u.maxLength.message
     }), c.dirty()), i.common.async)
-      return Promise.all([...i.data].map((h, p) => u.type._parseAsync(new ee(i, h, i.path, p)))).then((h) => L.mergeArray(c, h));
-    const l = [...i.data].map((h, p) => u.type._parseSync(new ee(i, h, i.path, p)));
+      return Promise.all([...i.data].map((f, p) => u.type._parseAsync(new ee(i, f, i.path, p)))).then((f) => L.mergeArray(c, f));
+    const l = [...i.data].map((f, p) => u.type._parseSync(new ee(i, f, i.path, p)));
     return L.mergeArray(c, l);
   }
   get element() {
@@ -4739,12 +4739,12 @@ class C extends O {
         received: y.parsedType
       }), T;
     }
-    const { status: c, ctx: u } = this._processInputParams(r), { shape: l, keys: h } = this._getCached(), p = [];
+    const { status: c, ctx: u } = this._processInputParams(r), { shape: l, keys: f } = this._getCached(), p = [];
     if (!(this._def.catchall instanceof oe && this._def.unknownKeys === "strip"))
       for (const y in u.data)
-        h.includes(y) || p.push(y);
+        f.includes(y) || p.push(y);
     const g = [];
-    for (const y of h) {
+    for (const y of f) {
       const E = l[y], N = u.data[y];
       g.push({
         key: { status: "valid", value: y },
@@ -4802,8 +4802,8 @@ class C extends O {
       unknownKeys: "strict",
       ...r !== void 0 ? {
         errorMap: (i, c) => {
-          var u, l, h, p;
-          const g = (h = (l = (u = this._def).errorMap) === null || l === void 0 ? void 0 : l.call(u, i, c).message) !== null && h !== void 0 ? h : c.defaultError;
+          var u, l, f, p;
+          const g = (f = (l = (u = this._def).errorMap) === null || l === void 0 ? void 0 : l.call(u, i, c).message) !== null && f !== void 0 ? f : c.defaultError;
           return i.code === "unrecognized_keys" ? {
             message: (p = k.errToObj(r).message) !== null && p !== void 0 ? p : g
           } : {
@@ -5017,15 +5017,15 @@ class mt extends O {
       for (const p of l)
         if (p.result.status === "dirty")
           return i.common.issues.push(...p.ctx.common.issues), p.result;
-      const h = l.map((p) => new V(p.ctx.common.issues));
+      const f = l.map((p) => new V(p.ctx.common.issues));
       return b(i, {
         code: w.invalid_union,
-        unionErrors: h
+        unionErrors: f
       }), T;
     }
     if (i.common.async)
       return Promise.all(c.map(async (l) => {
-        const h = {
+        const f = {
           ...i,
           common: {
             ...i.common,
@@ -5037,14 +5037,14 @@ class mt extends O {
           result: await l._parseAsync({
             data: i.data,
             path: i.path,
-            parent: h
+            parent: f
           }),
-          ctx: h
+          ctx: f
         };
       })).then(u);
     {
       let l;
-      const h = [];
+      const f = [];
       for (const g of c) {
         const y = {
           ...i,
@@ -5060,11 +5060,11 @@ class mt extends O {
         });
         if (E.status === "valid")
           return E;
-        E.status === "dirty" && !l && (l = { result: E, ctx: y }), y.common.issues.length && h.push(y.common.issues);
+        E.status === "dirty" && !l && (l = { result: E, ctx: y }), y.common.issues.length && f.push(y.common.issues);
       }
       if (l)
         return i.common.issues.push(...l.ctx.common.issues), l.result;
-      const p = h.map((g) => new V(g));
+      const p = f.map((g) => new V(g));
       return b(i, {
         code: w.invalid_union,
         unionErrors: p
@@ -5125,10 +5125,10 @@ class Gt extends O {
   static create(r, i, c) {
     const u = /* @__PURE__ */ new Map();
     for (const l of i) {
-      const h = ie(l.shape[r]);
-      if (!h.length)
+      const f = ie(l.shape[r]);
+      if (!f.length)
         throw new Error(`A discriminator value for key \`${r}\` could not be extracted from all schema options`);
-      for (const p of h) {
+      for (const p of f) {
         if (u.has(p))
           throw new Error(`Discriminator property ${String(r)} has duplicate value ${String(p)}`);
         u.set(p, l);
@@ -5148,20 +5148,20 @@ function $n(a, r) {
   if (a === r)
     return { valid: !0, data: a };
   if (i === _.object && c === _.object) {
-    const u = I.objectKeys(r), l = I.objectKeys(a).filter((p) => u.indexOf(p) !== -1), h = { ...a, ...r };
+    const u = I.objectKeys(r), l = I.objectKeys(a).filter((p) => u.indexOf(p) !== -1), f = { ...a, ...r };
     for (const p of l) {
       const g = $n(a[p], r[p]);
       if (!g.valid)
         return { valid: !1 };
-      h[p] = g.data;
+      f[p] = g.data;
     }
-    return { valid: !0, data: h };
+    return { valid: !0, data: f };
   } else if (i === _.array && c === _.array) {
     if (a.length !== r.length)
       return { valid: !1 };
     const u = [];
     for (let l = 0; l < a.length; l++) {
-      const h = a[l], p = r[l], g = $n(h, p);
+      const f = a[l], p = r[l], g = $n(f, p);
       if (!g.valid)
         return { valid: !1 };
       u.push(g.data);
@@ -5171,11 +5171,11 @@ function $n(a, r) {
 }
 class gt extends O {
   _parse(r) {
-    const { status: i, ctx: c } = this._processInputParams(r), u = (l, h) => {
-      if (In(l) || In(h))
+    const { status: i, ctx: c } = this._processInputParams(r), u = (l, f) => {
+      if (In(l) || In(f))
         return T;
-      const p = $n(l.value, h.value);
-      return p.valid ? ((Mn(l) || Mn(h)) && i.dirty(), { status: i.value, value: p.data }) : (b(c, {
+      const p = $n(l.value, f.value);
+      return p.valid ? ((Mn(l) || Mn(f)) && i.dirty(), { status: i.value, value: p.data }) : (b(c, {
         code: w.invalid_intersection_types
       }), T);
     };
@@ -5190,7 +5190,7 @@ class gt extends O {
         path: c.path,
         parent: c
       })
-    ]).then(([l, h]) => u(l, h)) : u(this._def.left._parseSync({
+    ]).then(([l, f]) => u(l, f)) : u(this._def.left._parseSync({
       data: c.data,
       path: c.path,
       parent: c
@@ -5231,11 +5231,11 @@ class te extends O {
       exact: !1,
       type: "array"
     }), i.dirty());
-    const l = [...c.data].map((h, p) => {
+    const l = [...c.data].map((f, p) => {
       const g = this._def.items[p] || this._def.rest;
-      return g ? g._parse(new ee(c, h, c.path, p)) : null;
-    }).filter((h) => !!h);
-    return c.common.async ? Promise.all(l).then((h) => L.mergeArray(i, h)) : L.mergeArray(i, l);
+      return g ? g._parse(new ee(c, f, c.path, p)) : null;
+    }).filter((f) => !!f);
+    return c.common.async ? Promise.all(l).then((f) => L.mergeArray(i, f)) : L.mergeArray(i, l);
   }
   get items() {
     return this._def.items;
@@ -5272,11 +5272,11 @@ class yt extends O {
         expected: _.object,
         received: c.parsedType
       }), T;
-    const u = [], l = this._def.keyType, h = this._def.valueType;
+    const u = [], l = this._def.keyType, f = this._def.valueType;
     for (const p in c.data)
       u.push({
         key: l._parse(new ee(c, p, c.path, p)),
-        value: h._parse(new ee(c, c.data[p], c.path, p)),
+        value: f._parse(new ee(c, c.data[p], c.path, p)),
         alwaysSet: p in c.data
       });
     return c.common.async ? L.mergeObjectAsync(i, u) : L.mergeObjectSync(i, u);
@@ -5313,14 +5313,14 @@ class Ht extends O {
         expected: _.map,
         received: c.parsedType
       }), T;
-    const u = this._def.keyType, l = this._def.valueType, h = [...c.data.entries()].map(([p, g], y) => ({
+    const u = this._def.keyType, l = this._def.valueType, f = [...c.data.entries()].map(([p, g], y) => ({
       key: u._parse(new ee(c, p, c.path, [y, "key"])),
       value: l._parse(new ee(c, g, c.path, [y, "value"]))
     }));
     if (c.common.async) {
       const p = /* @__PURE__ */ new Map();
       return Promise.resolve().then(async () => {
-        for (const g of h) {
+        for (const g of f) {
           const y = await g.key, E = await g.value;
           if (y.status === "aborted" || E.status === "aborted")
             return T;
@@ -5330,7 +5330,7 @@ class Ht extends O {
       });
     } else {
       const p = /* @__PURE__ */ new Map();
-      for (const g of h) {
+      for (const g of f) {
         const y = g.key, E = g.value;
         if (y.status === "aborted" || E.status === "aborted")
           return T;
@@ -5372,7 +5372,7 @@ class Ae extends O {
       message: u.maxSize.message
     }), i.dirty());
     const l = this._def.valueType;
-    function h(g) {
+    function f(g) {
       const y = /* @__PURE__ */ new Set();
       for (const E of g) {
         if (E.status === "aborted")
@@ -5382,7 +5382,7 @@ class Ae extends O {
       return { status: i.value, value: y };
     }
     const p = [...c.data.values()].map((g, y) => l._parse(new ee(c, g, c.path, y)));
-    return c.common.async ? Promise.all(p).then((g) => h(g)) : h(p);
+    return c.common.async ? Promise.all(p).then((g) => f(g)) : f(p);
   }
   min(r, i) {
     return new Ae({
@@ -5454,13 +5454,13 @@ class Be extends O {
         }
       });
     }
-    const l = { errorMap: i.common.contextualErrorMap }, h = i.data;
+    const l = { errorMap: i.common.contextualErrorMap }, f = i.data;
     if (this._def.returns instanceof Fe) {
       const p = this;
       return z(async function(...g) {
         const y = new V([]), E = await p._def.args.parseAsync(g, l).catch((ne) => {
           throw y.addIssue(c(g, ne)), y;
-        }), N = await Reflect.apply(h, this, E);
+        }), N = await Reflect.apply(f, this, E);
         return await p._def.returns._def.type.parseAsync(N, l).catch((ne) => {
           throw y.addIssue(u(N, ne)), y;
         });
@@ -5471,7 +5471,7 @@ class Be extends O {
         const y = p._def.args.safeParse(g, l);
         if (!y.success)
           throw new V([c(g, y.error)]);
-        const E = Reflect.apply(h, this, y.data), N = p._def.returns.safeParse(E, l);
+        const E = Reflect.apply(f, this, y.data), N = p._def.returns.safeParse(E, l);
         if (!N.success)
           throw new V([u(E, N.error)]);
         return N.data;
@@ -5679,17 +5679,17 @@ class J extends O {
   }
   _parse(r) {
     const { status: i, ctx: c } = this._processInputParams(r), u = this._def.effect || null, l = {
-      addIssue: (h) => {
-        b(c, h), h.fatal ? i.abort() : i.dirty();
+      addIssue: (f) => {
+        b(c, f), f.fatal ? i.abort() : i.dirty();
       },
       get path() {
         return c.path;
       }
     };
     if (l.addIssue = l.addIssue.bind(l), u.type === "preprocess") {
-      const h = u.transform(c.data, l);
+      const f = u.transform(c.data, l);
       if (c.common.async)
-        return Promise.resolve(h).then(async (p) => {
+        return Promise.resolve(f).then(async (p) => {
           if (i.value === "aborted")
             return T;
           const g = await this._def.schema._parseAsync({
@@ -5703,7 +5703,7 @@ class J extends O {
         if (i.value === "aborted")
           return T;
         const p = this._def.schema._parseSync({
-          data: h,
+          data: f,
           path: c.path,
           parent: c
         });
@@ -5711,7 +5711,7 @@ class J extends O {
       }
     }
     if (u.type === "refinement") {
-      const h = (p) => {
+      const f = (p) => {
         const g = u.refinement(p, l);
         if (c.common.async)
           return Promise.resolve(g);
@@ -5725,25 +5725,25 @@ class J extends O {
           path: c.path,
           parent: c
         });
-        return p.status === "aborted" ? T : (p.status === "dirty" && i.dirty(), h(p.value), { status: i.value, value: p.value });
+        return p.status === "aborted" ? T : (p.status === "dirty" && i.dirty(), f(p.value), { status: i.value, value: p.value });
       } else
-        return this._def.schema._parseAsync({ data: c.data, path: c.path, parent: c }).then((p) => p.status === "aborted" ? T : (p.status === "dirty" && i.dirty(), h(p.value).then(() => ({ status: i.value, value: p.value }))));
+        return this._def.schema._parseAsync({ data: c.data, path: c.path, parent: c }).then((p) => p.status === "aborted" ? T : (p.status === "dirty" && i.dirty(), f(p.value).then(() => ({ status: i.value, value: p.value }))));
     }
     if (u.type === "transform")
       if (c.common.async === !1) {
-        const h = this._def.schema._parseSync({
+        const f = this._def.schema._parseSync({
           data: c.data,
           path: c.path,
           parent: c
         });
-        if (!Se(h))
-          return h;
-        const p = u.transform(h.value, l);
+        if (!Se(f))
+          return f;
+        const p = u.transform(f.value, l);
         if (p instanceof Promise)
           throw new Error("Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead.");
         return { status: i.value, value: p };
       } else
-        return this._def.schema._parseAsync({ data: c.data, path: c.path, parent: c }).then((h) => Se(h) ? Promise.resolve(u.transform(h.value, l)).then((p) => ({ status: i.value, value: p })) : h);
+        return this._def.schema._parseAsync({ data: c.data, path: c.path, parent: c }).then((f) => Se(f) ? Promise.resolve(u.transform(f.value, l)).then((p) => ({ status: i.value, value: p })) : f);
     I.assertNever(u);
   }
 }
@@ -5935,9 +5935,9 @@ kt.create = (a, r) => new kt({
 });
 function wi(a, r = {}, i) {
   return a ? Ve.create().superRefine((c, u) => {
-    var l, h;
+    var l, f;
     if (!a(c)) {
-      const p = typeof r == "function" ? r(c) : typeof r == "string" ? { message: r } : r, g = (h = (l = p.fatal) !== null && l !== void 0 ? l : i) !== null && h !== void 0 ? h : !0, y = typeof p == "string" ? { message: p } : p;
+      const p = typeof r == "function" ? r(c) : typeof r == "string" ? { message: r } : r, g = (f = (l = p.fatal) !== null && l !== void 0 ? l : i) !== null && f !== void 0 ? f : !0, y = typeof p == "string" ? { message: p } : p;
       u.addIssue({ code: "custom", ...y, fatal: g });
     }
   }) : Ve.create();
@@ -6161,15 +6161,15 @@ function wf(a) {
   const i = JSON.stringify(a), c = new TextEncoder().encode(i).length, u = 1 * 1024;
   c > u && r.push(`Additional properties too large: ${c} bytes (max: ${u} bytes)`);
   const l = 5;
-  function h(g, y = 0) {
+  function f(g, y = 0) {
     if (y > l) return !1;
     if (typeof g == "object" && g !== null && !Array.isArray(g)) {
       for (const E of Object.values(g))
-        if (!h(E, y + 1)) return !1;
+        if (!f(E, y + 1)) return !1;
     }
     return !0;
   }
-  h(a) || r.push(`Additional properties nested too deeply (max depth: ${l})`);
+  f(a) || r.push(`Additional properties nested too deeply (max depth: ${l})`);
   for (const [g, y] of Object.entries(a))
     if (g.length > 100 && r.push(`Property key '${g}' too long (max: 100 characters)`), typeof y == "string" && y.length > 1e3 && r.push(`Property '${g}' value too long (max: 1000 characters)`), typeof y == "string") {
       const E = [
@@ -6319,14 +6319,14 @@ class xf {
       throw new Error("Enveloped mode is enabled, but stamp is not provided");
   }
   async writeOwnFeedDataByIndexOwned(r, i) {
-    const { bee: c, stamp: u, chatTopic: l } = this.swarmSettings, { privateKey: h, ownAddress: p } = this.userDetails, g = this.generateUserOwnedFeedId(l, p), y = De.fromString(g);
-    await c.makeFeedWriter(y, new ke(h)).uploadPayload(u, JSON.stringify(i), {
+    const { bee: c, stamp: u, chatTopic: l } = this.swarmSettings, { privateKey: f, ownAddress: p } = this.userDetails, g = this.generateUserOwnedFeedId(l, p), y = De.fromString(g);
+    await c.makeFeedWriter(y, new ke(f)).uploadPayload(u, JSON.stringify(i), {
       index: r
     });
   }
   // TODO: support for wrapped chunks
   async writeOwnFeedDataByIndexEnvelope(r, i) {
-    const { bee: c, stamp: u, chatTopic: l } = this.swarmSettings, { privateKey: h, ownAddress: p } = this.userDetails, g = new ke(h), y = xn.fromBlank(h, u, this.depth), E = this.generateUserOwnedFeedId(l, p), N = De.fromString(E), re = fi(N, r), ne = ii(i), We = ai(ne, re, g), Oe = {
+    const { bee: c, stamp: u, chatTopic: l } = this.swarmSettings, { privateKey: f, ownAddress: p } = this.userDetails, g = new ke(f), y = xn.fromBlank(f, u, this.depth), E = this.generateUserOwnedFeedId(l, p), N = De.fromString(E), re = fi(N, r), ne = ii(i), We = ai(ne, re, g), Oe = {
       hash: () => We.address.toUint8Array()
     }, Jt = y.stamp(Oe), { upload: Kt } = c.makeSOCWriter(g), He = Pe.fromUtf8(i);
     return (await Kt(Jt, re, He.toUint8Array())).reference.toHex();
@@ -6360,10 +6360,10 @@ class xf {
   }
   async uploadObjectToBeeEnvelope(r) {
     try {
-      const { bee: i, stamp: c } = this.swarmSettings, { privateKey: u } = this.userDetails, l = xn.fromBlank(u, c, this.depth), h = Pe.fromUtf8(JSON.stringify(r)), p = new Jl(async (y) => {
+      const { bee: i, stamp: c } = this.swarmSettings, { privateKey: u } = this.userDetails, l = xn.fromBlank(u, c, this.depth), f = Pe.fromUtf8(JSON.stringify(r)), p = new Jl(async (y) => {
         await i.uploadChunk(l.stamp(y), y.build());
       });
-      await p.append(h.toUint8Array());
+      await p.append(f.toUint8Array());
       const g = await p.finalize();
       return B.uint8ArrayToHex(g.hash());
     } catch (i) {
@@ -6381,7 +6381,9 @@ class xf {
     }
   }
   async fetchLatestChatMessage() {
-    const { bee: r, chatTopic: i, chatAddress: c } = this.swarmSettings, l = await r.makeFeedReader(De.fromString(i), Tn(c)).downloadPayload();
+    const { bee: r, chatTopic: i, chatAddress: c } = this.swarmSettings, l = await r.makeFeedReader(De.fromString(i), Tn(c), {
+      timeout: 12e3
+    }).downloadPayload();
     return { data: l.payload.toJSON(), index: l.feedIndex };
   }
   async fetchChatMessage(r) {
@@ -6398,25 +6400,33 @@ class xf {
       throw new Error("Enveloped mode is enabled, but stamp is not provided");
   }
   async rawSocDownload(r, i) {
-    const { beeUrl: c } = this.swarmSettings, u = await fetch(`${c}/soc/${r}/${i}`, {
-      headers: {
-        "swarm-chunk-retrieval-timeout": "2000ms"
+    const { beeUrl: c } = this.swarmSettings, u = new AbortController(), l = setTimeout(() => u.abort(), 5e3);
+    try {
+      const f = await fetch(`${c}/soc/${r}/${i}`, {
+        headers: {
+          "swarm-chunk-retrieval-timeout": "2000ms"
+        },
+        signal: u.signal
+      });
+      if (!f.ok) {
+        const p = new Error(`Failed to fetch: ${r}/${i} [${f.status}]`);
+        throw p.status = f.status, p;
       }
-    });
-    if (!u.ok) {
-      const l = new Error(`Failed to fetch: ${r}/${i} [${u.status}]`);
-      throw l.status = u.status, l;
+      return await f.text();
+    } catch (f) {
+      throw f.name === "AbortError" ? new Error(`Request timeout: ${r}/${i}`) : f;
+    } finally {
+      clearTimeout(l);
     }
-    return u.text();
   }
   async sendMessageToGsocOwn(r) {
-    const { bee: i, stamp: c, gsocTopic: u, gsocResourceId: l } = this.swarmSettings, h = new ke(l), p = Bt.fromString(u), g = Pe.fromUtf8(r), { upload: y } = i.makeSOCWriter(h, {
+    const { bee: i, stamp: c, gsocTopic: u, gsocResourceId: l } = this.swarmSettings, f = new ke(l), p = Bt.fromString(u), g = Pe.fromUtf8(r), { upload: y } = i.makeSOCWriter(f, {
       timeout: this.UPLOAD_GSOC_TIMEOUT
     });
     await y(c, p, g.toUint8Array());
   }
   async sendMessageToGsocEnvelope(r) {
-    const { bee: i, stamp: c, gsocTopic: u, gsocResourceId: l } = this.swarmSettings, { privateKey: h } = this.userDetails, p = xn.fromBlank(h, c, this.depth), g = new ke(l), y = Bt.fromString(u), E = Pe.fromUtf8(r), N = ii(E.toUint8Array()), re = ai(N, y, g), ne = {
+    const { bee: i, stamp: c, gsocTopic: u, gsocResourceId: l } = this.swarmSettings, { privateKey: f } = this.userDetails, p = xn.fromBlank(f, c, this.depth), g = new ke(l), y = Bt.fromString(u), E = Pe.fromUtf8(r), N = ii(E.toUint8Array()), re = ai(N, y, g), ne = {
       hash: () => re.address.toUint8Array()
     }, We = p.stamp(ne), { upload: Oe } = i.makeSOCWriter(g, {
       timeout: this.UPLOAD_GSOC_TIMEOUT
@@ -6481,7 +6491,7 @@ class Ef {
     return this.utils.orderMessages(r);
   }
   async sendMessage(r, i, c, u, l) {
-    const h = this.userDetails.ownIndex === -1 ? 0 : this.userDetails.ownIndex + 1, p = {
+    const f = this.userDetails.ownIndex === -1 ? 0 : this.userDetails.ownIndex + 1, p = {
       id: u || Hl(),
       username: this.userDetails.nickname,
       address: this.userDetails.ownAddress,
@@ -6489,7 +6499,7 @@ class Ef {
       userTopic: this.utils.generateUserOwnedFeedId(this.swarmSettings.chatTopic, this.userDetails.ownAddress),
       signature: this.getSignature(r),
       timestamp: Date.now(),
-      index: h,
+      index: f,
       type: i,
       targetMessageId: c,
       message: r,
@@ -6500,7 +6510,7 @@ class Ef {
       throw this.logger.error(y), new Error(y);
     }
     try {
-      this.emitter.emit(W.MESSAGE_REQUEST_INITIATED, p), await this.utils.writeOwnFeedDataByIndex(h, JSON.stringify(p)), this.userDetails.ownIndex = h, this.emitter.emit(W.MESSAGE_REQUEST_UPLOADED, p), await this.broadcastUserMessage(p);
+      this.emitter.emit(W.MESSAGE_REQUEST_INITIATED, p), await this.utils.writeOwnFeedDataByIndex(f, JSON.stringify(p)), this.userDetails.ownIndex = f, this.emitter.emit(W.MESSAGE_REQUEST_UPLOADED, p), await this.broadcastUserMessage(p);
     } catch (y) {
       this.emitter.emit(W.MESSAGE_REQUEST_ERROR, p), this.errorHandler.handleError(y, "Chat.sendMessage");
     }
@@ -6544,11 +6554,11 @@ class Ef {
     }
   }
   getSignature(r) {
-    const { ownAddress: i, privateKey: c, nickname: u } = this.userDetails, l = new Ll(i).toString(), h = new ke(c);
-    if (h.publicKey().address().toString() !== l)
+    const { ownAddress: i, privateKey: c, nickname: u } = this.userDetails, l = new Ll(i).toString(), f = new ke(c);
+    if (f.publicKey().address().toString() !== l)
       throw new Error("The provided address does not match the address derived from the private key");
     const g = Date.now();
-    return h.sign(JSON.stringify({ username: u, address: l, message: r, timestamp: g })).toHex();
+    return f.sign(JSON.stringify({ username: u, address: l, message: r, timestamp: g })).toHex();
   }
 }
 export {