@gardenfi/swap 0.1.1 → 0.1.3-beta.1

package/dist/index380.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index262.cjs"),o=require("./index385.cjs"),t=require("./index342.cjs");function u(i,r,s){const a=t.bcs.Address.serialize(i).toBytes(),n=t.bcs.TypeTag.serialize(r).toBytes(),d=t.bcs.u64().serialize(s.length).toBytes(),e=o.blake2b.create({dkLen:32});return e.update(new Uint8Array([240])),e.update(a),e.update(d),e.update(s),e.update(n),`0x${c.toHex(e.digest().slice(0,32))}`}exports.deriveDynamicFieldID=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index346.cjs"),m=require("./index359.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/index380.js

@@ -1,12 +1,180 @@
-import { toHex as n } from "./index262.js";
-import { blake2b as c } from "./index385.js";
-import { bcs as t } from "./index342.js";
-function m(r, a, s) {
-  const i = t.Address.serialize(r).toBytes(), o = t.TypeTag.serialize(a).toBytes(), d = t.u64().serialize(s.length).toBytes(), e = c.create({
-    dkLen: 32
+import { validateField as M, nLength as z } from "./index346.js";
+import { validateObject as O, bitLen as k, bitMask as x } from "./index359.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
   });
-  return e.update(new Uint8Array([240])), e.update(i), e.update(d), e.update(s), e.update(o), `0x${n(e.digest().slice(0, 32))}`;
 }
 export {
-  m as deriveDynamicFieldID
+  U as pippenger,
+  C as validateBasic,
+  v as wNAF
 };

package/dist/index381.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.1.1";exports.version=e;
+"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/index381.js

@@ -1,4 +1,24 @@
-const o = "0.1.1";
+class r 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;
+  }
+}
 export {
-  o as version
+  r as LruMap
 };

package/dist/index382.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.1.1";exports.version=e;

package/dist/index382.js

@@ -1,24 +1,4 @@
-class r 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;
-  }
-}
+const o = "0.1.1";
 export {
-  r as LruMap
+  o as version
 };

package/dist/index383.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"});/*! 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/index383.js

@@ -1,65 +1,112 @@
-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;
-    }
-  }
-  if (!o)
-    throw new f("Unable to normalize signature.");
-  return n;
+/*! 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 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;
-  }
+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 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;
+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 {
-  a as getAmbiguousTypes,
-  l as isArgOfType,
-  y as normalizeSignature
+  S as base58
 };

package/dist/index384.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=require("./index386.cjs"),b=e.blake2b;exports.blake2b=b;

package/dist/index384.js

@@ -1,112 +1,5 @@
-/*! 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");
+import { blake2b as b } from "./index386.js";
+const e = b;
 export {
-  S as base58
+  e as blake2b
 };

package/dist/index385.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index386.cjs"),b=e.blake2b;exports.blake2b=b;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index350.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;