@gardenfi/swap 0.1.3-beta.14 → 0.1.3-beta.16

package/dist/index383.js

@@ -1,4 +1,180 @@
-const o = "0.1.1";
+import { validateField as M, nLength as z } from "./index349.js";
+import { validateObject as O, bitLen as k, bitMask as x } from "./index362.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const E = BigInt(0), F = BigInt(1);
+function m(e, a) {
+  const t = a.negate();
+  return e ? t : a;
+}
+function y(e, a) {
+  if (!Number.isSafeInteger(e) || e <= 0 || e > a)
+    throw new Error("invalid window size, expected [1.." + a + "], got W=" + e);
+}
+function N(e, a) {
+  y(e, a);
+  const t = Math.ceil(a / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = x(e), r = BigInt(e);
+  return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
+}
+function B(e, a, t) {
+  const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
+  let f = Number(e & i), s = e >> r;
+  f > n && (f -= o, s += F);
+  const c = a * n, d = c + Math.abs(f) - 1, g = f === 0, l = f < 0, u = a % 2 !== 0;
+  return { nextN: s, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: c };
+}
+function L(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array expected");
+  e.forEach((t, n) => {
+    if (!(t instanceof a))
+      throw new Error("invalid point at index " + n);
+  });
+}
+function Z(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array of scalars expected");
+  e.forEach((t, n) => {
+    if (!a.isValid(t))
+      throw new Error("invalid scalar at index " + n);
+  });
+}
+const b = /* @__PURE__ */ new WeakMap(), I = /* @__PURE__ */ new WeakMap();
+function S(e) {
+  return I.get(e) || 1;
+}
+function v(e, a) {
+  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 > E; )
+        n & F && (i = i.add(o)), o = o.double(), n >>= F;
+      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 } = N(n, a), r = [];
+      let f = t, s = f;
+      for (let c = 0; c < i; c++) {
+        s = f, r.push(s);
+        for (let d = 1; d < o; d++)
+          s = s.add(f), r.push(s);
+        f = s.double();
+      }
+      return r;
+    },
+    /**
+     * 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) {
+      let o = e.ZERO, r = e.BASE;
+      const f = N(t, a);
+      for (let s = 0; s < f.windows; s++) {
+        const { nextN: c, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: h } = B(i, s, f);
+        i = c, g ? r = r.add(m(u, n[h])) : o = o.add(m(l, n[d]));
+      }
+      return { p: o, f: r };
+    },
+    /**
+     * 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 r = N(t, a);
+      for (let f = 0; f < r.windows && i !== E; f++) {
+        const { nextN: s, offset: c, isZero: d, isNeg: g } = B(i, f, r);
+        if (i = s, !d) {
+          const l = n[c];
+          o = o.add(g ? l.negate() : l);
+        }
+      }
+      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 r = S(t);
+      return r === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(r, this.getPrecomputes(r, 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) {
+      y(n, a), I.set(t, n), b.delete(t);
+    }
+  };
+}
+function U(e, a, t, n) {
+  L(t, e), Z(n, a);
+  const i = t.length, o = n.length;
+  if (i !== o)
+    throw new Error("arrays of points and scalars must have equal length");
+  const r = e.ZERO, f = k(BigInt(i));
+  let s = 1;
+  f > 12 ? s = f - 3 : f > 4 ? s = f - 2 : f > 0 && (s = 2);
+  const c = x(s), d = new Array(Number(c) + 1).fill(r), g = Math.floor((a.BITS - 1) / s) * s;
+  let l = r;
+  for (let u = g; u >= 0; u -= s) {
+    d.fill(r);
+    for (let w = 0; w < o; w++) {
+      const p = n[w], A = Number(p >> BigInt(u) & c);
+      d[A] = d[A].add(t[w]);
+    }
+    let h = r;
+    for (let w = d.length - 1, p = r; w > 0; w--)
+      p = p.add(d[w]), h = h.add(p);
+    if (l = l.add(h), u !== 0)
+      for (let w = 0; w < s; w++)
+        l = l.double();
+  }
+  return l;
+}
+function C(e) {
+  return M(e.Fp), O(e, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...z(e.n, e.nBitLength),
+    ...e,
+    p: e.Fp.ORDER
+  });
+}
 export {
-  o as version
+  U as pippenger,
+  C as validateBasic,
+  v as wNAF
 };

package/dist/index384.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index351.cjs"),a=require("./index278.cjs");function d(r){let i=!0,t="",e=0,n="",o=!1;for(let s=0;s<r.length;s++){const u=r[s];if(["(",")",","].includes(u)&&(i=!0),u==="("&&e++,u===")"&&e--,!!i){if(e===0){if(u===" "&&["event","function","error",""].includes(n))n="";else if(n+=u,u===")"){o=!0;break}continue}if(u===" "){r[s-1]!==","&&t!==","&&t!==",("&&(t="",i=!1);continue}n+=u,t+=u}}if(!o)throw new a.BaseError("Unable to normalize signature.");return n}function l(r,i){const t=typeof r,e=i.type;switch(e){case"address":return c.validate(r,{strict:!1});case"bool":return t==="boolean";case"function":return t==="string";case"string":return t==="string";default:return e==="tuple"&&"components"in i?Object.values(i.components).every((n,o)=>l(Object.values(r)[o],n)):/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e)?t==="number"||t==="bigint":/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e)?t==="string"||r instanceof Uint8Array:/[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e)?Array.isArray(r)&&r.every(n=>l(n,{...i,type:e.replace(/(\[[0-9]{0,}\])$/,"")})):!1}}function f(r,i,t){for(const e in r){const n=r[e],o=i[e];if(n.type==="tuple"&&o.type==="tuple"&&"components"in n&&"components"in o)return f(n.components,o.components,t[e]);const s=[n.type,o.type];if(s.includes("address")&&s.includes("bytes20")?!0:s.includes("address")&&s.includes("string")?c.validate(t[e],{strict:!1}):s.includes("address")&&s.includes("bytes")?c.validate(t[e],{strict:!1}):!1)return s}}exports.getAmbiguousTypes=f;exports.isArgOfType=l;exports.normalizeSignature=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class i extends Map{constructor(e){super(),Object.defineProperty(this,"maxSize",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.maxSize=e}get(e){const t=super.get(e);return super.has(e)&&t!==void 0&&(this.delete(e),super.set(e,t)),t}set(e,t){if(super.set(e,t),this.maxSize&&this.size>this.maxSize){const s=this.keys().next().value;s&&this.delete(s)}return this}}exports.LruMap=i;

package/dist/index384.js

@@ -1,65 +1,24 @@
-import { validate as c } from "./index351.js";
-import { BaseError as f } from "./index278.js";
-function y(r) {
-  let i = !0, t = "", e = 0, n = "", o = !1;
-  for (let s = 0; s < r.length; s++) {
-    const u = r[s];
-    if (["(", ")", ","].includes(u) && (i = !0), u === "(" && e++, u === ")" && e--, !!i) {
-      if (e === 0) {
-        if (u === " " && ["event", "function", "error", ""].includes(n))
-          n = "";
-        else if (n += u, u === ")") {
-          o = !0;
-          break;
-        }
-        continue;
-      }
-      if (u === " ") {
-        r[s - 1] !== "," && t !== "," && t !== ",(" && (t = "", i = !1);
-        continue;
-      }
-      n += u, t += u;
-    }
+class r extends Map {
+  constructor(e) {
+    super(), Object.defineProperty(this, "maxSize", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), this.maxSize = e;
   }
-  if (!o)
-    throw new f("Unable to normalize signature.");
-  return n;
-}
-function l(r, i) {
-  const t = typeof r, e = i.type;
-  switch (e) {
-    case "address":
-      return c(r, { strict: !1 });
-    case "bool":
-      return t === "boolean";
-    case "function":
-      return t === "string";
-    case "string":
-      return t === "string";
-    default:
-      return e === "tuple" && "components" in i ? Object.values(i.components).every((n, o) => l(Object.values(r)[o], n)) : /^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e) ? t === "number" || t === "bigint" : /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e) ? t === "string" || r instanceof Uint8Array : /[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e) ? Array.isArray(r) && r.every((n) => l(n, {
-        ...i,
-        // Pop off `[]` or `[M]` from end of type
-        type: e.replace(/(\[[0-9]{0,}\])$/, "")
-      })) : !1;
+  get(e) {
+    const t = super.get(e);
+    return super.has(e) && t !== void 0 && (this.delete(e), super.set(e, t)), t;
   }
-}
-function a(r, i, t) {
-  for (const e in r) {
-    const n = r[e], o = i[e];
-    if (n.type === "tuple" && o.type === "tuple" && "components" in n && "components" in o)
-      return a(n.components, o.components, t[e]);
-    const s = [n.type, o.type];
-    if (s.includes("address") && s.includes("bytes20") ? !0 : s.includes("address") && s.includes("string") ? c(t[e], {
-      strict: !1
-    }) : s.includes("address") && s.includes("bytes") ? c(t[e], {
-      strict: !1
-    }) : !1)
-      return s;
+  set(e, t) {
+    if (super.set(e, t), this.maxSize && this.size > this.maxSize) {
+      const s = this.keys().next().value;
+      s && this.delete(s);
+    }
+    return this;
   }
 }
 export {
-  a as getAmbiguousTypes,
-  l as isArgOfType,
-  y as normalizeSignature
+  r as LruMap
 };

package/dist/index385.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function x(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function p(e,r){return Array.isArray(r)?r.length===0?!0:e?r.every(t=>typeof t=="string"):r.every(t=>Number.isSafeInteger(t)):!1}function w(e,r){if(typeof r!="string")throw new Error(`${e}: string expected`);return!0}function b(e){if(!Number.isSafeInteger(e))throw new Error(`invalid integer: ${e}`)}function h(e){if(!Array.isArray(e))throw new Error("array expected")}function A(e,r){if(!p(!0,r))throw new Error(`${e}: array of strings expected`)}function m(e,r){if(!p(!1,r))throw new Error(`${e}: array of numbers expected`)}function E(...e){const r=n=>n,t=(n,a)=>o=>n(a(o)),c=e.map(n=>n.encode).reduceRight(t,r),i=e.map(n=>n.decode).reduce(t,r);return{encode:c,decode:i}}function $(e){const r=typeof e=="string"?e.split(""):e,t=r.length;A("alphabet",r);const c=new Map(r.map((i,n)=>[i,n]));return{encode:i=>(h(i),i.map(n=>{if(!Number.isSafeInteger(n)||n<0||n>=t)throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);return r[n]})),decode:i=>(h(i),i.map(n=>{w("alphabet.decode",n);const a=c.get(n);if(a===void 0)throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);return a}))}}function S(e=""){return w("join",e),{encode:r=>(A("join.decode",r),r.join(e)),decode:r=>(w("join.decode",r),r.split(e))}}function g(e,r,t){if(r<2)throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);if(t<2)throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);if(h(e),!e.length)return[];let c=0;const i=[],n=Array.from(e,o=>{if(b(o),o<0||o>=r)throw new Error(`invalid integer: ${o}`);return o}),a=n.length;for(;;){let o=0,d=!0;for(let s=c;s<a;s++){const y=n[s],l=r*o,u=l+y;if(!Number.isSafeInteger(u)||l/r!==o||u-y!==l)throw new Error("convertRadix: carry overflow");const v=u/t;o=u%t;const f=Math.floor(v);if(n[s]=f,!Number.isSafeInteger(f)||f*t+o!==u)throw new Error("convertRadix: carry overflow");if(d)f?d=!1:c=s;else continue}if(i.push(o),d)break}for(let o=0;o<e.length-1&&e[o]===0;o++)i.push(0);return i.reverse()}function j(e){b(e);const r=2**8;return{encode:t=>{if(!x(t))throw new Error("radix.encode input should be Uint8Array");return g(Array.from(t),r,e)},decode:t=>(m("radix.decode",t),Uint8Array.from(g(t,e,r)))}}const R=e=>E(j(58),$(e),S("")),N=R("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");exports.base58=N;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.1.1";exports.version=e;

package/dist/index385.js

@@ -1,112 +1,4 @@
-/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function x(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function g(e, r) {
-  return Array.isArray(r) ? r.length === 0 ? !0 : e ? r.every((t) => typeof t == "string") : r.every((t) => Number.isSafeInteger(t)) : !1;
-}
-function w(e, r) {
-  if (typeof r != "string")
-    throw new Error(`${e}: string expected`);
-  return !0;
-}
-function b(e) {
-  if (!Number.isSafeInteger(e))
-    throw new Error(`invalid integer: ${e}`);
-}
-function h(e) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-}
-function A(e, r) {
-  if (!g(!0, r))
-    throw new Error(`${e}: array of strings expected`);
-}
-function E(e, r) {
-  if (!g(!1, r))
-    throw new Error(`${e}: array of numbers expected`);
-}
-// @__NO_SIDE_EFFECTS__
-function m(...e) {
-  const r = (n) => n, t = (n, a) => (o) => n(a(o)), c = e.map((n) => n.encode).reduceRight(t, r), i = e.map((n) => n.decode).reduce(t, r);
-  return { encode: c, decode: i };
-}
-// @__NO_SIDE_EFFECTS__
-function $(e) {
-  const r = typeof e == "string" ? e.split("") : e, t = r.length;
-  A("alphabet", r);
-  const c = new Map(r.map((i, n) => [i, n]));
-  return {
-    encode: (i) => (h(i), i.map((n) => {
-      if (!Number.isSafeInteger(n) || n < 0 || n >= t)
-        throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);
-      return r[n];
-    })),
-    decode: (i) => (h(i), i.map((n) => {
-      w("alphabet.decode", n);
-      const a = c.get(n);
-      if (a === void 0)
-        throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);
-      return a;
-    }))
-  };
-}
-// @__NO_SIDE_EFFECTS__
-function R(e = "") {
-  return w("join", e), {
-    encode: (r) => (A("join.decode", r), r.join(e)),
-    decode: (r) => (w("join.decode", r), r.split(e))
-  };
-}
-function p(e, r, t) {
-  if (r < 2)
-    throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);
-  if (t < 2)
-    throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);
-  if (h(e), !e.length)
-    return [];
-  let c = 0;
-  const i = [], n = Array.from(e, (o) => {
-    if (b(o), o < 0 || o >= r)
-      throw new Error(`invalid integer: ${o}`);
-    return o;
-  }), a = n.length;
-  for (; ; ) {
-    let o = 0, d = !0;
-    for (let s = c; s < a; s++) {
-      const y = n[s], l = r * o, f = l + y;
-      if (!Number.isSafeInteger(f) || l / r !== o || f - y !== l)
-        throw new Error("convertRadix: carry overflow");
-      const v = f / t;
-      o = f % t;
-      const u = Math.floor(v);
-      if (n[s] = u, !Number.isSafeInteger(u) || u * t + o !== f)
-        throw new Error("convertRadix: carry overflow");
-      if (d)
-        u ? d = !1 : c = s;
-      else continue;
-    }
-    if (i.push(o), d)
-      break;
-  }
-  for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
-    i.push(0);
-  return i.reverse();
-}
-// @__NO_SIDE_EFFECTS__
-function j(e) {
-  b(e);
-  const r = 2 ** 8;
-  return {
-    encode: (t) => {
-      if (!x(t))
-        throw new Error("radix.encode input should be Uint8Array");
-      return p(Array.from(t), r, e);
-    },
-    decode: (t) => (E("radix.decode", t), Uint8Array.from(p(t, e, r)))
-  };
-}
-const N = /* @__NO_SIDE_EFFECTS__ */ (e) => /* @__PURE__ */ m(/* @__PURE__ */ j(58), /* @__PURE__ */ $(e), /* @__PURE__ */ R("")), S = /* @__PURE__ */ N("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+const o = "0.1.1";
 export {
-  S as base58
+  o as version
 };

package/dist/index386.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index387.cjs"),b=e.blake2b;exports.blake2b=b;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function x(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function p(e,r){return Array.isArray(r)?r.length===0?!0:e?r.every(t=>typeof t=="string"):r.every(t=>Number.isSafeInteger(t)):!1}function w(e,r){if(typeof r!="string")throw new Error(`${e}: string expected`);return!0}function b(e){if(!Number.isSafeInteger(e))throw new Error(`invalid integer: ${e}`)}function h(e){if(!Array.isArray(e))throw new Error("array expected")}function A(e,r){if(!p(!0,r))throw new Error(`${e}: array of strings expected`)}function m(e,r){if(!p(!1,r))throw new Error(`${e}: array of numbers expected`)}function E(...e){const r=n=>n,t=(n,a)=>o=>n(a(o)),c=e.map(n=>n.encode).reduceRight(t,r),i=e.map(n=>n.decode).reduce(t,r);return{encode:c,decode:i}}function $(e){const r=typeof e=="string"?e.split(""):e,t=r.length;A("alphabet",r);const c=new Map(r.map((i,n)=>[i,n]));return{encode:i=>(h(i),i.map(n=>{if(!Number.isSafeInteger(n)||n<0||n>=t)throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);return r[n]})),decode:i=>(h(i),i.map(n=>{w("alphabet.decode",n);const a=c.get(n);if(a===void 0)throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);return a}))}}function S(e=""){return w("join",e),{encode:r=>(A("join.decode",r),r.join(e)),decode:r=>(w("join.decode",r),r.split(e))}}function g(e,r,t){if(r<2)throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);if(t<2)throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);if(h(e),!e.length)return[];let c=0;const i=[],n=Array.from(e,o=>{if(b(o),o<0||o>=r)throw new Error(`invalid integer: ${o}`);return o}),a=n.length;for(;;){let o=0,d=!0;for(let s=c;s<a;s++){const y=n[s],l=r*o,u=l+y;if(!Number.isSafeInteger(u)||l/r!==o||u-y!==l)throw new Error("convertRadix: carry overflow");const v=u/t;o=u%t;const f=Math.floor(v);if(n[s]=f,!Number.isSafeInteger(f)||f*t+o!==u)throw new Error("convertRadix: carry overflow");if(d)f?d=!1:c=s;else continue}if(i.push(o),d)break}for(let o=0;o<e.length-1&&e[o]===0;o++)i.push(0);return i.reverse()}function j(e){b(e);const r=2**8;return{encode:t=>{if(!x(t))throw new Error("radix.encode input should be Uint8Array");return g(Array.from(t),r,e)},decode:t=>(m("radix.decode",t),Uint8Array.from(g(t,e,r)))}}const R=e=>E(j(58),$(e),S("")),N=R("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");exports.base58=N;

package/dist/index386.js

@@ -1,5 +1,112 @@
-import { blake2b as b } from "./index387.js";
-const e = b;
+/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function x(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function g(e, r) {
+  return Array.isArray(r) ? r.length === 0 ? !0 : e ? r.every((t) => typeof t == "string") : r.every((t) => Number.isSafeInteger(t)) : !1;
+}
+function w(e, r) {
+  if (typeof r != "string")
+    throw new Error(`${e}: string expected`);
+  return !0;
+}
+function b(e) {
+  if (!Number.isSafeInteger(e))
+    throw new Error(`invalid integer: ${e}`);
+}
+function h(e) {
+  if (!Array.isArray(e))
+    throw new Error("array expected");
+}
+function A(e, r) {
+  if (!g(!0, r))
+    throw new Error(`${e}: array of strings expected`);
+}
+function E(e, r) {
+  if (!g(!1, r))
+    throw new Error(`${e}: array of numbers expected`);
+}
+// @__NO_SIDE_EFFECTS__
+function m(...e) {
+  const r = (n) => n, t = (n, a) => (o) => n(a(o)), c = e.map((n) => n.encode).reduceRight(t, r), i = e.map((n) => n.decode).reduce(t, r);
+  return { encode: c, decode: i };
+}
+// @__NO_SIDE_EFFECTS__
+function $(e) {
+  const r = typeof e == "string" ? e.split("") : e, t = r.length;
+  A("alphabet", r);
+  const c = new Map(r.map((i, n) => [i, n]));
+  return {
+    encode: (i) => (h(i), i.map((n) => {
+      if (!Number.isSafeInteger(n) || n < 0 || n >= t)
+        throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);
+      return r[n];
+    })),
+    decode: (i) => (h(i), i.map((n) => {
+      w("alphabet.decode", n);
+      const a = c.get(n);
+      if (a === void 0)
+        throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);
+      return a;
+    }))
+  };
+}
+// @__NO_SIDE_EFFECTS__
+function R(e = "") {
+  return w("join", e), {
+    encode: (r) => (A("join.decode", r), r.join(e)),
+    decode: (r) => (w("join.decode", r), r.split(e))
+  };
+}
+function p(e, r, t) {
+  if (r < 2)
+    throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);
+  if (t < 2)
+    throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);
+  if (h(e), !e.length)
+    return [];
+  let c = 0;
+  const i = [], n = Array.from(e, (o) => {
+    if (b(o), o < 0 || o >= r)
+      throw new Error(`invalid integer: ${o}`);
+    return o;
+  }), a = n.length;
+  for (; ; ) {
+    let o = 0, d = !0;
+    for (let s = c; s < a; s++) {
+      const y = n[s], l = r * o, f = l + y;
+      if (!Number.isSafeInteger(f) || l / r !== o || f - y !== l)
+        throw new Error("convertRadix: carry overflow");
+      const v = f / t;
+      o = f % t;
+      const u = Math.floor(v);
+      if (n[s] = u, !Number.isSafeInteger(u) || u * t + o !== f)
+        throw new Error("convertRadix: carry overflow");
+      if (d)
+        u ? d = !1 : c = s;
+      else continue;
+    }
+    if (i.push(o), d)
+      break;
+  }
+  for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
+    i.push(0);
+  return i.reverse();
+}
+// @__NO_SIDE_EFFECTS__
+function j(e) {
+  b(e);
+  const r = 2 ** 8;
+  return {
+    encode: (t) => {
+      if (!x(t))
+        throw new Error("radix.encode input should be Uint8Array");
+      return p(Array.from(t), r, e);
+    },
+    decode: (t) => (E("radix.decode", t), Uint8Array.from(p(t, e, r)))
+  };
+}
+const N = /* @__NO_SIDE_EFFECTS__ */ (e) => /* @__PURE__ */ m(/* @__PURE__ */ j(58), /* @__PURE__ */ $(e), /* @__PURE__ */ R("")), S = /* @__PURE__ */ N("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
 export {
-  e as blake2b
+  S as base58
 };

package/dist/index387.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./index388.cjs"),w=require("./index318.cjs"),l=require("./index319.cjs"),d=Uint32Array.from([4089235720,1779033703,2227873595,3144134277,4271175723,1013904242,1595750129,2773480762,2917565137,1359893119,725511199,2600822924,4215389547,528734635,327033209,1541459225]),t=new Uint32Array(32);function I(p,s,h,n,v,r){const i=v[r],e=v[r+1];let o=t[2*p],f=t[2*p+1],a=t[2*s],u=t[2*s+1],b=t[2*h],E=t[2*h+1],B=t[2*n],c=t[2*n+1],y=w.add3L(o,a,i);f=w.add3H(y,f,u,e),o=y|0,{Dh:c,Dl:B}={Dh:c^f,Dl:B^o},{Dh:c,Dl:B}={Dh:w.rotr32H(c,B),Dl:w.rotr32L(c)},{h:E,l:b}=w.add(E,b,c,B),{Bh:u,Bl:a}={Bh:u^E,Bl:a^b},{Bh:u,Bl:a}={Bh:w.rotrSH(u,a,24),Bl:w.rotrSL(u,a,24)},t[2*p]=o,t[2*p+1]=f,t[2*s]=a,t[2*s+1]=u,t[2*h]=b,t[2*h+1]=E,t[2*n]=B,t[2*n+1]=c}function x(p,s,h,n,v,r){const i=v[r],e=v[r+1];let o=t[2*p],f=t[2*p+1],a=t[2*s],u=t[2*s+1],b=t[2*h],E=t[2*h+1],B=t[2*n],c=t[2*n+1],y=w.add3L(o,a,i);f=w.add3H(y,f,u,e),o=y|0,{Dh:c,Dl:B}={Dh:c^f,Dl:B^o},{Dh:c,Dl:B}={Dh:w.rotrSH(c,B,16),Dl:w.rotrSL(c,B,16)},{h:E,l:b}=w.add(E,b,c,B),{Bh:u,Bl:a}={Bh:u^E,Bl:a^b},{Bh:u,Bl:a}={Bh:w.rotrBH(u,a,63),Bl:w.rotrBL(u,a,63)},t[2*p]=o,t[2*p+1]=f,t[2*s]=a,t[2*s+1]=u,t[2*h]=b,t[2*h+1]=E,t[2*n]=B,t[2*n+1]=c}function D(p,s={},h,n,v){if(l.anumber(h),p<0||p>h)throw new Error("outputLen bigger than keyLen");const{key:r,salt:i,personalization:e}=s;if(r!==void 0&&(r.length<1||r.length>h))throw new Error("key length must be undefined or 1.."+h);if(i!==void 0&&i.length!==n)throw new Error("salt must be undefined or "+n);if(e!==void 0&&e.length!==v)throw new Error("personalization must be undefined or "+v)}class L extends l.Hash{constructor(s,h){super(),this.finished=!1,this.destroyed=!1,this.length=0,this.pos=0,l.anumber(s),l.anumber(h),this.blockLen=s,this.outputLen=h,this.buffer=new Uint8Array(s),this.buffer32=l.u32(this.buffer)}update(s){l.aexists(this),s=l.toBytes(s),l.abytes(s);const{blockLen:h,buffer:n,buffer32:v}=this,r=s.length,i=s.byteOffset,e=s.buffer;for(let o=0;o<r;){this.pos===h&&(l.swap32IfBE(v),this.compress(v,0,!1),l.swap32IfBE(v),this.pos=0);const f=Math.min(h-this.pos,r-o),a=i+o;if(f===h&&!(a%4)&&o+f<r){const u=new Uint32Array(e,a,Math.floor((r-o)/4));l.swap32IfBE(u);for(let b=0;o+h<r;b+=v.length,o+=h)this.length+=h,this.compress(u,b,!1);l.swap32IfBE(u);continue}n.set(s.subarray(o,o+f),this.pos),this.pos+=f,this.length+=f,o+=f}return this}digestInto(s){l.aexists(this),l.aoutput(s,this);const{pos:h,buffer32:n}=this;this.finished=!0,l.clean(this.buffer.subarray(h)),l.swap32IfBE(n),this.compress(n,0,!0),l.swap32IfBE(n);const v=l.u32(s);this.get().forEach((r,i)=>v[i]=l.swap8IfBE(r))}digest(){const{buffer:s,outputLen:h}=this;this.digestInto(s);const n=s.slice(0,h);return this.destroy(),n}_cloneInto(s){const{buffer:h,length:n,finished:v,destroyed:r,outputLen:i,pos:e}=this;return s||(s=new this.constructor({dkLen:i})),s.set(...this.get()),s.buffer.set(h),s.destroyed=r,s.finished=v,s.length=n,s.pos=e,s.outputLen=i,s}clone(){return this._cloneInto()}}class A extends L{constructor(s={}){const h=s.dkLen===void 0?64:s.dkLen;super(128,h),this.v0l=d[0]|0,this.v0h=d[1]|0,this.v1l=d[2]|0,this.v1h=d[3]|0,this.v2l=d[4]|0,this.v2h=d[5]|0,this.v3l=d[6]|0,this.v3h=d[7]|0,this.v4l=d[8]|0,this.v4h=d[9]|0,this.v5l=d[10]|0,this.v5h=d[11]|0,this.v6l=d[12]|0,this.v6h=d[13]|0,this.v7l=d[14]|0,this.v7h=d[15]|0,D(h,s,64,16,16);let{key:n,personalization:v,salt:r}=s,i=0;if(n!==void 0&&(n=l.toBytes(n),i=n.length),this.v0l^=this.outputLen|i<<8|65536|1<<24,r!==void 0){r=l.toBytes(r);const e=l.u32(r);this.v4l^=l.swap8IfBE(e[0]),this.v4h^=l.swap8IfBE(e[1]),this.v5l^=l.swap8IfBE(e[2]),this.v5h^=l.swap8IfBE(e[3])}if(v!==void 0){v=l.toBytes(v);const e=l.u32(v);this.v6l^=l.swap8IfBE(e[0]),this.v6h^=l.swap8IfBE(e[1]),this.v7l^=l.swap8IfBE(e[2]),this.v7h^=l.swap8IfBE(e[3])}if(n!==void 0){const e=new Uint8Array(this.blockLen);e.set(n),this.update(e)}}get(){let{v0l:s,v0h:h,v1l:n,v1h:v,v2l:r,v2h:i,v3l:e,v3h:o,v4l:f,v4h:a,v5l:u,v5h:b,v6l:E,v6h:B,v7l:c,v7h:y}=this;return[s,h,n,v,r,i,e,o,f,a,u,b,E,B,c,y]}set(s,h,n,v,r,i,e,o,f,a,u,b,E,B,c,y){this.v0l=s|0,this.v0h=h|0,this.v1l=n|0,this.v1h=v|0,this.v2l=r|0,this.v2h=i|0,this.v3l=e|0,this.v3h=o|0,this.v4l=f|0,this.v4h=a|0,this.v5l=u|0,this.v5h=b|0,this.v6l=E|0,this.v6h=B|0,this.v7l=c|0,this.v7h=y|0}compress(s,h,n){this.get().forEach((o,f)=>t[f]=o),t.set(d,16);let{h:v,l:r}=w.fromBig(BigInt(this.length));t[24]=d[8]^r,t[25]=d[9]^v,n&&(t[28]=~t[28],t[29]=~t[29]);let i=0;const e=k.BSIGMA;for(let o=0;o<12;o++)I(0,4,8,12,s,h+2*e[i++]),x(0,4,8,12,s,h+2*e[i++]),I(1,5,9,13,s,h+2*e[i++]),x(1,5,9,13,s,h+2*e[i++]),I(2,6,10,14,s,h+2*e[i++]),x(2,6,10,14,s,h+2*e[i++]),I(3,7,11,15,s,h+2*e[i++]),x(3,7,11,15,s,h+2*e[i++]),I(0,5,10,15,s,h+2*e[i++]),x(0,5,10,15,s,h+2*e[i++]),I(1,6,11,12,s,h+2*e[i++]),x(1,6,11,12,s,h+2*e[i++]),I(2,7,8,13,s,h+2*e[i++]),x(2,7,8,13,s,h+2*e[i++]),I(3,4,9,14,s,h+2*e[i++]),x(3,4,9,14,s,h+2*e[i++]);this.v0l^=t[0]^t[16],this.v0h^=t[1]^t[17],this.v1l^=t[2]^t[18],this.v1h^=t[3]^t[19],this.v2l^=t[4]^t[20],this.v2h^=t[5]^t[21],this.v3l^=t[6]^t[22],this.v3h^=t[7]^t[23],this.v4l^=t[8]^t[24],this.v4h^=t[9]^t[25],this.v5l^=t[10]^t[26],this.v5h^=t[11]^t[27],this.v6l^=t[12]^t[28],this.v6h^=t[13]^t[29],this.v7l^=t[14]^t[30],this.v7h^=t[15]^t[31],l.clean(t)}destroy(){this.destroyed=!0,l.clean(this.buffer32),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}const g=l.createOptHasher(p=>new A(p));exports.BLAKE2=L;exports.BLAKE2b=A;exports.blake2b=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index389.cjs"),b=e.blake2b;exports.blake2b=b;