@gardenfi/swap 0.0.1-beta.9 → 0.0.2

package/dist/index406.js

@@ -1,209 +0,0 @@
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const w = /* @__PURE__ */ BigInt(0), p = /* @__PURE__ */ BigInt(1);
-function b(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function h(t) {
-  if (!b(t))
-    throw new Error("Uint8Array expected");
-}
-function k(t, n) {
-  if (typeof n != "boolean")
-    throw new Error(t + " boolean expected, got " + n);
-}
-function F(t) {
-  const n = t.toString(16);
-  return n.length & 1 ? "0" + n : n;
-}
-function E(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? w : BigInt("0x" + t);
-}
-const U = (
-  // @ts-ignore
-  typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
-), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
-function x(t) {
-  if (h(t), U)
-    return t.toHex();
-  let n = "";
-  for (let e = 0; e < t.length; e++)
-    n += S[t[e]];
-  return n;
-}
-const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-function m(t) {
-  if (t >= u._0 && t <= u._9)
-    return t - u._0;
-  if (t >= u.A && t <= u.F)
-    return t - (u.A - 10);
-  if (t >= u.a && t <= u.f)
-    return t - (u.a - 10);
-}
-function B(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  if (U)
-    return Uint8Array.fromHex(t);
-  const n = t.length, e = n / 2;
-  if (n % 2)
-    throw new Error("hex string expected, got unpadded hex of length " + n);
-  const r = new Uint8Array(e);
-  for (let o = 0, i = 0; o < e; o++, i += 2) {
-    const a = m(t.charCodeAt(i)), f = m(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);
-    }
-    r[o] = a * 16 + f;
-  }
-  return r;
-}
-function O(t) {
-  return E(x(t));
-}
-function V(t) {
-  return h(t), E(x(Uint8Array.from(t).reverse()));
-}
-function T(t, n) {
-  return B(t.toString(16).padStart(n * 2, "0"));
-}
-function C(t, n) {
-  return T(t, n).reverse();
-}
-function M(t, n, e) {
-  let r;
-  if (typeof n == "string")
-    try {
-      r = B(n);
-    } catch (i) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
-    }
-  else if (b(n))
-    r = Uint8Array.from(n);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const o = r.length;
-  if (typeof e == "number" && o !== e)
-    throw new Error(t + " of length " + e + " expected, got " + o);
-  return r;
-}
-function H(...t) {
-  let n = 0;
-  for (let r = 0; r < t.length; r++) {
-    const o = t[r];
-    h(o), n += o.length;
-  }
-  const e = new Uint8Array(n);
-  for (let r = 0, o = 0; r < t.length; r++) {
-    const i = t[r];
-    e.set(i, o), o += i.length;
-  }
-  return e;
-}
-const y = (t) => typeof t == "bigint" && w <= t;
-function I(t, n, e) {
-  return y(t) && y(n) && y(e) && n <= t && t < e;
-}
-function R(t, n, e, r) {
-  if (!I(n, e, r))
-    throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
-}
-function j(t) {
-  let n;
-  for (n = 0; t > w; t >>= p, n += 1)
-    ;
-  return n;
-}
-const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
-function D(t, n, e) {
-  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 e != "function")
-    throw new Error("hmacFn must be a function");
-  let r = d(t), o = d(t), i = 0;
-  const a = () => {
-    r.fill(1), o.fill(0), i = 0;
-  }, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
-    o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
-  }, v = () => {
-    if (i++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let s = 0;
-    const l = [];
-    for (; s < n; ) {
-      r = f();
-      const g = r.slice();
-      l.push(g), s += r.length;
-    }
-    return H(...l);
-  };
-  return (s, l) => {
-    a(), c(s);
-    let g;
-    for (; !(g = l(v())); )
-      c();
-    return a(), g;
-  };
-}
-const _ = {
-  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" || b(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 P(t, n, e = {}) {
-  const r = (o, i, a) => {
-    const f = _[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))
-    r(o, i, !1);
-  for (const [o, i] of Object.entries(e))
-    r(o, i, !0);
-  return t;
-}
-function W(t) {
-  const n = /* @__PURE__ */ new WeakMap();
-  return (e, ...r) => {
-    const o = n.get(e);
-    if (o !== void 0)
-      return o;
-    const i = t(e, ...r);
-    return n.set(e, i), i;
-  };
-}
-export {
-  R as aInRange,
-  k as abool,
-  h as abytes,
-  j as bitLen,
-  z as bitMask,
-  x as bytesToHex,
-  O as bytesToNumberBE,
-  V as bytesToNumberLE,
-  H as concatBytes,
-  D as createHmacDrbg,
-  M as ensureBytes,
-  B as hexToBytes,
-  E as hexToNumber,
-  I as inRange,
-  b as isBytes,
-  W as memoized,
-  T as numberToBytesBE,
-  C as numberToBytesLE,
-  F as numberToHexUnpadded,
-  P as validateObject
-};

package/dist/index407.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index366.cjs"),m=require("./index406.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const E=BigInt(0),A=BigInt(1);function N(e,a){const t=a.negate();return e?t:a}function x(e,a){if(!Number.isSafeInteger(e)||e<=0||e>a)throw new Error("invalid window size, expected [1.."+a+"], got W="+e)}function b(e,a){x(e,a);const t=Math.ceil(a/e)+1,n=2**(e-1),o=2**e,i=m.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function M(e,a,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),s=e>>r;f>n&&(f-=i,s+=A);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 O(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 S=new WeakMap,I=new WeakMap;function F(e){return I.get(e)||1}function k(e,a){return{constTimeNegate:N,hasPrecomputes(t){return F(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>E;)n&A&&(o=o.add(i)),i=i.double(),n>>=A;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,a),r=[];let f=t,s=f;for(let c=0;c<o;c++){s=f,r.push(s);for(let d=1;d<i;d++)s=s.add(f),r.push(s);f=s.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=b(t,a);for(let s=0;s<f.windows;s++){const{nextN:c,offset:d,isZero:g,isNeg:l,isNegF:u,offsetF:h}=M(o,s,f);o=c,g?r=r.add(N(u,n[h])):i=i.add(N(l,n[d]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=b(t,a);for(let f=0;f<r.windows&&o!==E;f++){const{nextN:s,offset:c,isZero:d,isNeg:g}=M(o,f,r);if(o=s,!d){const l=n[c];i=i.add(g?l.negate():l)}}return i},getPrecomputes(t,n,o){let i=S.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&S.set(n,o(i))),i},wNAFCached(t,n,o){const i=F(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=F(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){x(n,a),I.set(t,n),S.delete(t)}}}function L(e,a,t,n){O(t,e),z(n,a);const o=t.length,i=n.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const r=e.ZERO,f=m.bitLen(BigInt(o));let s=1;f>12?s=f-3:f>4?s=f-2:f>0&&(s=2);const c=m.bitMask(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<i;w++){const p=n[w],y=Number(p>>BigInt(u)&c);d[y]=d[y].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 Z(e){return B.validateField(e.Fp),m.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...B.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=L;exports.validateBasic=Z;exports.wNAF=k;

package/dist/index407.js

@@ -1,180 +0,0 @@
-import { validateField as M, nLength as z } from "./index366.js";
-import { validateObject as O, bitLen as k, bitMask as x } from "./index406.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 {
-  U as pippenger,
-  C as validateBasic,
-  v as wNAF
-};

package/dist/index408.cjs

@@ -1 +0,0 @@
-"use strict";function h(t,n){t=t||10;const f=new Array(t),o=new Array(t);let e=0,r=0,c;return n=n!==void 0?n:1e3,function(a){const i=Date.now(),s=o[r];c||(c=i),f[e]=a,o[e]=i;let d=r,u=0;for(;d!==e;)u+=f[d++],d=d%t;if(e=(e+1)%t,e===r&&(r=(r+1)%t),i-c<n)return;const w=s&&i-s;return w?Math.round(u*1e3/w):void 0}}module.exports=h;

package/dist/index408.js

@@ -1,19 +0,0 @@
-function y(t, n) {
-  t = t || 10;
-  const c = new Array(t), o = new Array(t);
-  let e = 0, r = 0, i;
-  return n = n !== void 0 ? n : 1e3, function(h) {
-    const d = Date.now(), a = o[r];
-    i || (i = d), c[e] = h, o[e] = d;
-    let f = r, u = 0;
-    for (; f !== e; )
-      u += c[f++], f = f % t;
-    if (e = (e + 1) % t, e === r && (r = (r + 1) % t), d - i < n)
-      return;
-    const w = a && d - a;
-    return w ? Math.round(u * 1e3 / w) : void 0;
-  };
-}
-export {
-  y as default
-};

package/dist/index409.cjs

@@ -1 +0,0 @@
-"use strict";function h(u,c){let n=0,i=1e3/c,e,t;const s=(l,o=Date.now())=>{n=o,e=null,t&&(clearTimeout(t),t=null),u(...l)};return[(...l)=>{const o=Date.now(),r=o-n;r>=i?s(l,o):(e=l,t||(t=setTimeout(()=>{t=null,s(e)},i-r)))},()=>e&&s(e)]}module.exports=h;

package/dist/index409.js

@@ -1,15 +0,0 @@
-function h(r, a) {
-  let s = 0, u = 1e3 / a, e, t;
-  const n = (l, o = Date.now()) => {
-    s = o, e = null, t && (clearTimeout(t), t = null), r(...l);
-  };
-  return [(...l) => {
-    const o = Date.now(), i = o - s;
-    i >= u ? n(l, o) : (e = l, t || (t = setTimeout(() => {
-      t = null, n(e);
-    }, u - i)));
-  }, () => e && n(e)];
-}
-export {
-  h as default
-};

package/dist/index410.cjs

@@ -1 +0,0 @@
-"use strict";const e=require("./index292.cjs"),n=e.hasStandardBrowserEnv?((o,r)=>t=>(t=new URL(t,e.origin),o.protocol===t.protocol&&o.host===t.host&&(r||o.port===t.port)))(new URL(e.origin),e.navigator&&/(msie|trident)/i.test(e.navigator.userAgent)):()=>!0;module.exports=n;

package/dist/index410.js

@@ -1,8 +0,0 @@
-import o from "./index292.js";
-const n = o.hasStandardBrowserEnv ? /* @__PURE__ */ ((r, e) => (t) => (t = new URL(t, o.origin), r.protocol === t.protocol && r.host === t.host && (e || r.port === t.port)))(
-  new URL(o.origin),
-  o.navigator && /(msie|trident)/i.test(o.navigator.userAgent)
-) : () => !0;
-export {
-  n as default
-};

package/dist/index411.cjs

@@ -1 +0,0 @@
-"use strict";const n=require("./index106.cjs"),u=require("./index292.cjs"),d=u.hasStandardBrowserEnv?{write(e,o,r,s,i,c){const t=[e+"="+encodeURIComponent(o)];n.isNumber(r)&&t.push("expires="+new Date(r).toGMTString()),n.isString(s)&&t.push("path="+s),n.isString(i)&&t.push("domain="+i),c===!0&&t.push("secure"),document.cookie=t.join("; ")},read(e){const o=document.cookie.match(new RegExp("(^|;\\s*)("+e+")=([^;]*)"));return o?decodeURIComponent(o[3]):null},remove(e){this.write(e,"",Date.now()-864e5)}}:{write(){},read(){return null},remove(){}};module.exports=d;

package/dist/index411.js

@@ -1,32 +0,0 @@
-import r from "./index106.js";
-import c from "./index292.js";
-const p = c.hasStandardBrowserEnv ? (
-  // Standard browser envs support document.cookie
-  {
-    write(e, t, n, i, s, u) {
-      const o = [e + "=" + encodeURIComponent(t)];
-      r.isNumber(n) && o.push("expires=" + new Date(n).toGMTString()), r.isString(i) && o.push("path=" + i), r.isString(s) && o.push("domain=" + s), u === !0 && o.push("secure"), document.cookie = o.join("; ");
-    },
-    read(e) {
-      const t = document.cookie.match(new RegExp("(^|;\\s*)(" + e + ")=([^;]*)"));
-      return t ? decodeURIComponent(t[3]) : null;
-    },
-    remove(e) {
-      this.write(e, "", Date.now() - 864e5);
-    }
-  }
-) : (
-  // Non-standard browser env (web workers, react-native) lack needed support.
-  {
-    write() {
-    },
-    read() {
-      return null;
-    },
-    remove() {
-    }
-  }
-);
-export {
-  p as default
-};

package/dist/index412.cjs

@@ -1 +0,0 @@
-"use strict";const a=require("./index367.cjs"),r=typeof URLSearchParams<"u"?URLSearchParams:a;module.exports=r;

package/dist/index412.js

@@ -1,5 +0,0 @@
-import a from "./index367.js";
-const e = typeof URLSearchParams < "u" ? URLSearchParams : a;
-export {
-  e as default
-};

package/dist/index413.cjs

@@ -1 +0,0 @@
-"use strict";const t=typeof FormData<"u"?FormData:null;module.exports=t;

package/dist/index413.js

@@ -1,4 +0,0 @@
-const a = typeof FormData < "u" ? FormData : null;
-export {
-  a as default
-};

package/dist/index414.cjs

@@ -1 +0,0 @@
-"use strict";const o=typeof Blob<"u"?Blob:null;module.exports=o;

package/dist/index414.js

@@ -1,4 +0,0 @@
-const l = typeof Blob < "u" ? Blob : null;
-export {
-  l as default
-};

package/dist/index415.cjs

@@ -1 +0,0 @@
-"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/index415.js

@@ -1,112 +0,0 @@
-/*! 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 {
-  S as base58
-};

package/dist/index416.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index431.cjs"),b=e.blake2b;exports.blake2b=b;

package/dist/index416.js

@@ -1,5 +0,0 @@
-import { blake2b as b } from "./index431.js";
-const e = b;
-export {
-  e as blake2b
-};

package/dist/index417.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index395.cjs");function n(t,e){if(i.size(t)>e)throw new i.SizeOverflowError({givenSize:i.size(t),maxSize:e})}function o(t,e){if(typeof e=="number"&&e>0&&e>i.size(t)-1)throw new i.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:i.size(t)})}function z(t,e,r){if(typeof e=="number"&&typeof r=="number"&&i.size(t)!==r-e)throw new i.SliceOffsetOutOfBoundsError({offset:r,position:"end",size:i.size(t)})}function a(t,e={}){const{dir:r,size:s=32}=e;if(s===0)return t;const f=t.replace("0x","");if(f.length>s*2)throw new i.SizeExceedsPaddingSizeError({size:Math.ceil(f.length/2),targetSize:s,type:"Hex"});return`0x${f[r==="right"?"padEnd":"padStart"](s*2,"0")}`}exports.assertEndOffset=z;exports.assertSize=n;exports.assertStartOffset=o;exports.pad=a;