@gardenfi/swap 0.1.3-beta.1 → 0.1.3-beta.11

package/dist/index386.js

@@ -1,134 +1,65 @@
-import { BSIGMA as z } from "./index387.js";
-import { fromBig as G, add3H as H, rotr32L as M, rotr32H as S, add as U, rotrSL as C, rotrSH as O, rotrBL as _, rotrBH as K, add3L as X } from "./index339.js";
-import { createOptHasher as j, toBytes as L, u32 as k, swap8IfBE as y, clean as E, Hash as m, anumber as g, aexists as I, abytes as F, swap32IfBE as D, aoutput as V } from "./index340.js";
-const d = /* @__PURE__ */ Uint32Array.from([
-  4089235720,
-  1779033703,
-  2227873595,
-  3144134277,
-  4271175723,
-  1013904242,
-  1595750129,
-  2773480762,
-  2917565137,
-  1359893119,
-  725511199,
-  2600822924,
-  4215389547,
-  528734635,
-  327033209,
-  1541459225
-]), t = /* @__PURE__ */ new Uint32Array(32);
-function w(b, h, s, n, o, l) {
-  const i = o[l], e = o[l + 1];
-  let r = t[2 * b], u = t[2 * b + 1], f = t[2 * h], v = t[2 * h + 1], p = t[2 * s], B = t[2 * s + 1], a = t[2 * n], c = t[2 * n + 1], x = X(r, f, i);
-  u = H(x, u, v, e), r = x | 0, { Dh: c, Dl: a } = { Dh: c ^ u, Dl: a ^ r }, { Dh: c, Dl: a } = { Dh: S(c, a), Dl: M(c) }, { h: B, l: p } = U(B, p, c, a), { Bh: v, Bl: f } = { Bh: v ^ B, Bl: f ^ p }, { Bh: v, Bl: f } = { Bh: O(v, f, 24), Bl: C(v, f, 24) }, t[2 * b] = r, t[2 * b + 1] = u, t[2 * h] = f, t[2 * h + 1] = v, t[2 * s] = p, t[2 * s + 1] = B, t[2 * n] = a, t[2 * n + 1] = c;
-}
-function A(b, h, s, n, o, l) {
-  const i = o[l], e = o[l + 1];
-  let r = t[2 * b], u = t[2 * b + 1], f = t[2 * h], v = t[2 * h + 1], p = t[2 * s], B = t[2 * s + 1], a = t[2 * n], c = t[2 * n + 1], x = X(r, f, i);
-  u = H(x, u, v, e), r = x | 0, { Dh: c, Dl: a } = { Dh: c ^ u, Dl: a ^ r }, { Dh: c, Dl: a } = { Dh: O(c, a, 16), Dl: C(c, a, 16) }, { h: B, l: p } = U(B, p, c, a), { Bh: v, Bl: f } = { Bh: v ^ B, Bl: f ^ p }, { Bh: v, Bl: f } = { Bh: K(v, f, 63), Bl: _(v, f, 63) }, t[2 * b] = r, t[2 * b + 1] = u, t[2 * h] = f, t[2 * h + 1] = v, t[2 * s] = p, t[2 * s + 1] = B, t[2 * n] = a, t[2 * n + 1] = c;
-}
-function q(b, h = {}, s, n, o) {
-  if (g(s), b < 0 || b > s)
-    throw new Error("outputLen bigger than keyLen");
-  const { key: l, salt: i, personalization: e } = h;
-  if (l !== void 0 && (l.length < 1 || l.length > s))
-    throw new Error("key length must be undefined or 1.." + s);
-  if (i !== void 0 && i.length !== n)
-    throw new Error("salt must be undefined or " + n);
-  if (e !== void 0 && e.length !== o)
-    throw new Error("personalization must be undefined or " + o);
-}
-class J extends m {
-  constructor(h, s) {
-    super(), this.finished = !1, this.destroyed = !1, this.length = 0, this.pos = 0, g(h), g(s), this.blockLen = h, this.outputLen = s, this.buffer = new Uint8Array(h), this.buffer32 = k(this.buffer);
-  }
-  update(h) {
-    I(this), h = L(h), F(h);
-    const { blockLen: s, buffer: n, buffer32: o } = this, l = h.length, i = h.byteOffset, e = h.buffer;
-    for (let r = 0; r < l; ) {
-      this.pos === s && (D(o), this.compress(o, 0, !1), D(o), this.pos = 0);
-      const u = Math.min(s - this.pos, l - r), f = i + r;
-      if (u === s && !(f % 4) && r + u < l) {
-        const v = new Uint32Array(e, f, Math.floor((l - r) / 4));
-        D(v);
-        for (let p = 0; r + s < l; p += o.length, r += s)
-          this.length += s, this.compress(v, p, !1);
-        D(v);
+import { validate as c } from "./index352.js";
+import { BaseError as f } from "./index279.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;
       }
-      n.set(h.subarray(r, r + u), this.pos), this.pos += u, this.length += u, r += u;
+      if (u === " ") {
+        r[s - 1] !== "," && t !== "," && t !== ",(" && (t = "", i = !1);
+        continue;
+      }
+      n += u, t += u;
     }
-    return this;
-  }
-  digestInto(h) {
-    I(this), V(h, this);
-    const { pos: s, buffer32: n } = this;
-    this.finished = !0, E(this.buffer.subarray(s)), D(n), this.compress(n, 0, !0), D(n);
-    const o = k(h);
-    this.get().forEach((l, i) => o[i] = y(l));
-  }
-  digest() {
-    const { buffer: h, outputLen: s } = this;
-    this.digestInto(h);
-    const n = h.slice(0, s);
-    return this.destroy(), n;
-  }
-  _cloneInto(h) {
-    const { buffer: s, length: n, finished: o, destroyed: l, outputLen: i, pos: e } = this;
-    return h || (h = new this.constructor({ dkLen: i })), h.set(...this.get()), h.buffer.set(s), h.destroyed = l, h.finished = o, h.length = n, h.pos = e, h.outputLen = i, h;
-  }
-  clone() {
-    return this._cloneInto();
   }
+  if (!o)
+    throw new f("Unable to normalize signature.");
+  return n;
 }
-class N extends J {
-  constructor(h = {}) {
-    const s = h.dkLen === void 0 ? 64 : h.dkLen;
-    super(128, s), 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, q(s, h, 64, 16, 16);
-    let { key: n, personalization: o, salt: l } = h, i = 0;
-    if (n !== void 0 && (n = L(n), i = n.length), this.v0l ^= this.outputLen | i << 8 | 65536 | 1 << 24, l !== void 0) {
-      l = L(l);
-      const e = k(l);
-      this.v4l ^= y(e[0]), this.v4h ^= y(e[1]), this.v5l ^= y(e[2]), this.v5h ^= y(e[3]);
-    }
-    if (o !== void 0) {
-      o = L(o);
-      const e = k(o);
-      this.v6l ^= y(e[0]), this.v6h ^= y(e[1]), this.v7l ^= y(e[2]), this.v7h ^= y(e[3]);
-    }
-    if (n !== void 0) {
-      const e = new Uint8Array(this.blockLen);
-      e.set(n), this.update(e);
-    }
+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;
   }
-  // prettier-ignore
-  get() {
-    let { v0l: h, v0h: s, v1l: n, v1h: o, v2l: l, v2h: i, v3l: e, v3h: r, v4l: u, v4h: f, v5l: v, v5h: p, v6l: B, v6h: a, v7l: c, v7h: x } = this;
-    return [h, s, n, o, l, i, e, r, u, f, v, p, B, a, c, x];
-  }
-  // prettier-ignore
-  set(h, s, n, o, l, i, e, r, u, f, v, p, B, a, c, x) {
-    this.v0l = h | 0, this.v0h = s | 0, this.v1l = n | 0, this.v1h = o | 0, this.v2l = l | 0, this.v2h = i | 0, this.v3l = e | 0, this.v3h = r | 0, this.v4l = u | 0, this.v4h = f | 0, this.v5l = v | 0, this.v5h = p | 0, this.v6l = B | 0, this.v6h = a | 0, this.v7l = c | 0, this.v7h = x | 0;
-  }
-  compress(h, s, n) {
-    this.get().forEach((r, u) => t[u] = r), t.set(d, 16);
-    let { h: o, l } = G(BigInt(this.length));
-    t[24] = d[8] ^ l, t[25] = d[9] ^ o, n && (t[28] = ~t[28], t[29] = ~t[29]);
-    let i = 0;
-    const e = z;
-    for (let r = 0; r < 12; r++)
-      w(0, 4, 8, 12, h, s + 2 * e[i++]), A(0, 4, 8, 12, h, s + 2 * e[i++]), w(1, 5, 9, 13, h, s + 2 * e[i++]), A(1, 5, 9, 13, h, s + 2 * e[i++]), w(2, 6, 10, 14, h, s + 2 * e[i++]), A(2, 6, 10, 14, h, s + 2 * e[i++]), w(3, 7, 11, 15, h, s + 2 * e[i++]), A(3, 7, 11, 15, h, s + 2 * e[i++]), w(0, 5, 10, 15, h, s + 2 * e[i++]), A(0, 5, 10, 15, h, s + 2 * e[i++]), w(1, 6, 11, 12, h, s + 2 * e[i++]), A(1, 6, 11, 12, h, s + 2 * e[i++]), w(2, 7, 8, 13, h, s + 2 * e[i++]), A(2, 7, 8, 13, h, s + 2 * e[i++]), w(3, 4, 9, 14, h, s + 2 * e[i++]), A(3, 4, 9, 14, h, s + 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], E(t);
-  }
-  destroy() {
-    this.destroyed = !0, E(this.buffer32), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+}
+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;
   }
 }
-const T = /* @__PURE__ */ j((b) => new N(b));
 export {
-  J as BLAKE2,
-  N as BLAKE2b,
-  T as blake2b
+  a as getAmbiguousTypes,
+  l as isArgOfType,
+  y as normalizeSignature
 };

package/dist/index387.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=Uint8Array.from([0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,14,10,4,8,9,15,13,6,1,12,0,2,11,7,5,3,11,8,12,0,5,2,15,13,10,14,3,6,7,1,9,4,7,9,3,1,13,12,11,14,2,6,5,10,4,0,15,8,9,0,5,7,2,4,10,15,14,1,11,12,6,8,3,13,2,12,6,10,0,11,8,3,4,13,7,5,15,14,1,9,12,5,1,15,14,13,4,10,0,7,6,3,9,2,8,11,13,11,7,14,12,1,3,9,5,0,15,4,8,6,2,10,6,15,14,9,11,3,0,8,12,2,13,7,1,4,10,5,10,2,8,4,7,6,1,5,15,11,9,14,3,12,13,0,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,14,10,4,8,9,15,13,6,1,12,0,2,11,7,5,3,11,8,12,0,5,2,15,13,10,14,3,6,7,1,9,4,7,9,3,1,13,12,11,14,2,6,5,10,4,0,15,8,9,0,5,7,2,4,10,15,14,1,11,12,6,8,3,13,2,12,6,10,0,11,8,3,4,13,7,5,15,14,1,9]);exports.BSIGMA=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./index388.cjs"),w=require("./index340.cjs"),l=require("./index341.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;

package/dist/index387.js

@@ -1,262 +1,134 @@
-const r = /* @__PURE__ */ Uint8Array.from([
-  0,
-  1,
-  2,
-  3,
-  4,
-  5,
-  6,
-  7,
-  8,
-  9,
-  10,
-  11,
-  12,
-  13,
-  14,
-  15,
-  14,
-  10,
-  4,
-  8,
-  9,
-  15,
-  13,
-  6,
-  1,
-  12,
-  0,
-  2,
-  11,
-  7,
-  5,
-  3,
-  11,
-  8,
-  12,
-  0,
-  5,
-  2,
-  15,
-  13,
-  10,
-  14,
-  3,
-  6,
-  7,
-  1,
-  9,
-  4,
-  7,
-  9,
-  3,
-  1,
-  13,
-  12,
-  11,
-  14,
-  2,
-  6,
-  5,
-  10,
-  4,
-  0,
-  15,
-  8,
-  9,
-  0,
-  5,
-  7,
-  2,
-  4,
-  10,
-  15,
-  14,
-  1,
-  11,
-  12,
-  6,
-  8,
-  3,
-  13,
-  2,
-  12,
-  6,
-  10,
-  0,
-  11,
-  8,
-  3,
-  4,
-  13,
-  7,
-  5,
-  15,
-  14,
-  1,
-  9,
-  12,
-  5,
-  1,
-  15,
-  14,
-  13,
-  4,
-  10,
-  0,
-  7,
-  6,
-  3,
-  9,
-  2,
-  8,
-  11,
-  13,
-  11,
-  7,
-  14,
-  12,
-  1,
-  3,
-  9,
-  5,
-  0,
-  15,
-  4,
-  8,
-  6,
-  2,
-  10,
-  6,
-  15,
-  14,
-  9,
-  11,
-  3,
-  0,
-  8,
-  12,
-  2,
-  13,
-  7,
-  1,
-  4,
-  10,
-  5,
-  10,
-  2,
-  8,
-  4,
-  7,
-  6,
-  1,
-  5,
-  15,
-  11,
-  9,
-  14,
-  3,
-  12,
-  13,
-  0,
-  0,
-  1,
-  2,
-  3,
-  4,
-  5,
-  6,
-  7,
-  8,
-  9,
-  10,
-  11,
-  12,
-  13,
-  14,
-  15,
-  14,
-  10,
-  4,
-  8,
-  9,
-  15,
-  13,
-  6,
-  1,
-  12,
-  0,
-  2,
-  11,
-  7,
-  5,
-  3,
-  // Blake1, unused in others
-  11,
-  8,
-  12,
-  0,
-  5,
-  2,
-  15,
-  13,
-  10,
-  14,
-  3,
-  6,
-  7,
-  1,
-  9,
-  4,
-  7,
-  9,
-  3,
-  1,
-  13,
-  12,
-  11,
-  14,
-  2,
-  6,
-  5,
-  10,
-  4,
-  0,
-  15,
-  8,
-  9,
-  0,
-  5,
-  7,
-  2,
-  4,
-  10,
-  15,
-  14,
-  1,
-  11,
-  12,
-  6,
-  8,
-  3,
-  13,
-  2,
-  12,
-  6,
-  10,
-  0,
-  11,
-  8,
-  3,
-  4,
-  13,
-  7,
-  5,
-  15,
-  14,
-  1,
-  9
-]);
+import { BSIGMA as z } from "./index388.js";
+import { fromBig as G, add3H as H, rotr32L as M, rotr32H as S, add as U, rotrSL as C, rotrSH as O, rotrBL as _, rotrBH as K, add3L as X } from "./index340.js";
+import { createOptHasher as j, toBytes as L, u32 as k, swap8IfBE as y, clean as E, Hash as m, anumber as g, aexists as I, abytes as F, swap32IfBE as D, aoutput as V } from "./index341.js";
+const d = /* @__PURE__ */ Uint32Array.from([
+  4089235720,
+  1779033703,
+  2227873595,
+  3144134277,
+  4271175723,
+  1013904242,
+  1595750129,
+  2773480762,
+  2917565137,
+  1359893119,
+  725511199,
+  2600822924,
+  4215389547,
+  528734635,
+  327033209,
+  1541459225
+]), t = /* @__PURE__ */ new Uint32Array(32);
+function w(b, h, s, n, o, l) {
+  const i = o[l], e = o[l + 1];
+  let r = t[2 * b], u = t[2 * b + 1], f = t[2 * h], v = t[2 * h + 1], p = t[2 * s], B = t[2 * s + 1], a = t[2 * n], c = t[2 * n + 1], x = X(r, f, i);
+  u = H(x, u, v, e), r = x | 0, { Dh: c, Dl: a } = { Dh: c ^ u, Dl: a ^ r }, { Dh: c, Dl: a } = { Dh: S(c, a), Dl: M(c) }, { h: B, l: p } = U(B, p, c, a), { Bh: v, Bl: f } = { Bh: v ^ B, Bl: f ^ p }, { Bh: v, Bl: f } = { Bh: O(v, f, 24), Bl: C(v, f, 24) }, t[2 * b] = r, t[2 * b + 1] = u, t[2 * h] = f, t[2 * h + 1] = v, t[2 * s] = p, t[2 * s + 1] = B, t[2 * n] = a, t[2 * n + 1] = c;
+}
+function A(b, h, s, n, o, l) {
+  const i = o[l], e = o[l + 1];
+  let r = t[2 * b], u = t[2 * b + 1], f = t[2 * h], v = t[2 * h + 1], p = t[2 * s], B = t[2 * s + 1], a = t[2 * n], c = t[2 * n + 1], x = X(r, f, i);
+  u = H(x, u, v, e), r = x | 0, { Dh: c, Dl: a } = { Dh: c ^ u, Dl: a ^ r }, { Dh: c, Dl: a } = { Dh: O(c, a, 16), Dl: C(c, a, 16) }, { h: B, l: p } = U(B, p, c, a), { Bh: v, Bl: f } = { Bh: v ^ B, Bl: f ^ p }, { Bh: v, Bl: f } = { Bh: K(v, f, 63), Bl: _(v, f, 63) }, t[2 * b] = r, t[2 * b + 1] = u, t[2 * h] = f, t[2 * h + 1] = v, t[2 * s] = p, t[2 * s + 1] = B, t[2 * n] = a, t[2 * n + 1] = c;
+}
+function q(b, h = {}, s, n, o) {
+  if (g(s), b < 0 || b > s)
+    throw new Error("outputLen bigger than keyLen");
+  const { key: l, salt: i, personalization: e } = h;
+  if (l !== void 0 && (l.length < 1 || l.length > s))
+    throw new Error("key length must be undefined or 1.." + s);
+  if (i !== void 0 && i.length !== n)
+    throw new Error("salt must be undefined or " + n);
+  if (e !== void 0 && e.length !== o)
+    throw new Error("personalization must be undefined or " + o);
+}
+class J extends m {
+  constructor(h, s) {
+    super(), this.finished = !1, this.destroyed = !1, this.length = 0, this.pos = 0, g(h), g(s), this.blockLen = h, this.outputLen = s, this.buffer = new Uint8Array(h), this.buffer32 = k(this.buffer);
+  }
+  update(h) {
+    I(this), h = L(h), F(h);
+    const { blockLen: s, buffer: n, buffer32: o } = this, l = h.length, i = h.byteOffset, e = h.buffer;
+    for (let r = 0; r < l; ) {
+      this.pos === s && (D(o), this.compress(o, 0, !1), D(o), this.pos = 0);
+      const u = Math.min(s - this.pos, l - r), f = i + r;
+      if (u === s && !(f % 4) && r + u < l) {
+        const v = new Uint32Array(e, f, Math.floor((l - r) / 4));
+        D(v);
+        for (let p = 0; r + s < l; p += o.length, r += s)
+          this.length += s, this.compress(v, p, !1);
+        D(v);
+        continue;
+      }
+      n.set(h.subarray(r, r + u), this.pos), this.pos += u, this.length += u, r += u;
+    }
+    return this;
+  }
+  digestInto(h) {
+    I(this), V(h, this);
+    const { pos: s, buffer32: n } = this;
+    this.finished = !0, E(this.buffer.subarray(s)), D(n), this.compress(n, 0, !0), D(n);
+    const o = k(h);
+    this.get().forEach((l, i) => o[i] = y(l));
+  }
+  digest() {
+    const { buffer: h, outputLen: s } = this;
+    this.digestInto(h);
+    const n = h.slice(0, s);
+    return this.destroy(), n;
+  }
+  _cloneInto(h) {
+    const { buffer: s, length: n, finished: o, destroyed: l, outputLen: i, pos: e } = this;
+    return h || (h = new this.constructor({ dkLen: i })), h.set(...this.get()), h.buffer.set(s), h.destroyed = l, h.finished = o, h.length = n, h.pos = e, h.outputLen = i, h;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+}
+class N extends J {
+  constructor(h = {}) {
+    const s = h.dkLen === void 0 ? 64 : h.dkLen;
+    super(128, s), 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, q(s, h, 64, 16, 16);
+    let { key: n, personalization: o, salt: l } = h, i = 0;
+    if (n !== void 0 && (n = L(n), i = n.length), this.v0l ^= this.outputLen | i << 8 | 65536 | 1 << 24, l !== void 0) {
+      l = L(l);
+      const e = k(l);
+      this.v4l ^= y(e[0]), this.v4h ^= y(e[1]), this.v5l ^= y(e[2]), this.v5h ^= y(e[3]);
+    }
+    if (o !== void 0) {
+      o = L(o);
+      const e = k(o);
+      this.v6l ^= y(e[0]), this.v6h ^= y(e[1]), this.v7l ^= y(e[2]), this.v7h ^= y(e[3]);
+    }
+    if (n !== void 0) {
+      const e = new Uint8Array(this.blockLen);
+      e.set(n), this.update(e);
+    }
+  }
+  // prettier-ignore
+  get() {
+    let { v0l: h, v0h: s, v1l: n, v1h: o, v2l: l, v2h: i, v3l: e, v3h: r, v4l: u, v4h: f, v5l: v, v5h: p, v6l: B, v6h: a, v7l: c, v7h: x } = this;
+    return [h, s, n, o, l, i, e, r, u, f, v, p, B, a, c, x];
+  }
+  // prettier-ignore
+  set(h, s, n, o, l, i, e, r, u, f, v, p, B, a, c, x) {
+    this.v0l = h | 0, this.v0h = s | 0, this.v1l = n | 0, this.v1h = o | 0, this.v2l = l | 0, this.v2h = i | 0, this.v3l = e | 0, this.v3h = r | 0, this.v4l = u | 0, this.v4h = f | 0, this.v5l = v | 0, this.v5h = p | 0, this.v6l = B | 0, this.v6h = a | 0, this.v7l = c | 0, this.v7h = x | 0;
+  }
+  compress(h, s, n) {
+    this.get().forEach((r, u) => t[u] = r), t.set(d, 16);
+    let { h: o, l } = G(BigInt(this.length));
+    t[24] = d[8] ^ l, t[25] = d[9] ^ o, n && (t[28] = ~t[28], t[29] = ~t[29]);
+    let i = 0;
+    const e = z;
+    for (let r = 0; r < 12; r++)
+      w(0, 4, 8, 12, h, s + 2 * e[i++]), A(0, 4, 8, 12, h, s + 2 * e[i++]), w(1, 5, 9, 13, h, s + 2 * e[i++]), A(1, 5, 9, 13, h, s + 2 * e[i++]), w(2, 6, 10, 14, h, s + 2 * e[i++]), A(2, 6, 10, 14, h, s + 2 * e[i++]), w(3, 7, 11, 15, h, s + 2 * e[i++]), A(3, 7, 11, 15, h, s + 2 * e[i++]), w(0, 5, 10, 15, h, s + 2 * e[i++]), A(0, 5, 10, 15, h, s + 2 * e[i++]), w(1, 6, 11, 12, h, s + 2 * e[i++]), A(1, 6, 11, 12, h, s + 2 * e[i++]), w(2, 7, 8, 13, h, s + 2 * e[i++]), A(2, 7, 8, 13, h, s + 2 * e[i++]), w(3, 4, 9, 14, h, s + 2 * e[i++]), A(3, 4, 9, 14, h, s + 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], E(t);
+  }
+  destroy() {
+    this.destroyed = !0, E(this.buffer32), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+  }
+}
+const T = /* @__PURE__ */ j((b) => new N(b));
 export {
-  r as BSIGMA
+  J as BLAKE2,
+  N as BLAKE2b,
+  T as blake2b
 };

package/dist/index388.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=Uint8Array.from([0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,14,10,4,8,9,15,13,6,1,12,0,2,11,7,5,3,11,8,12,0,5,2,15,13,10,14,3,6,7,1,9,4,7,9,3,1,13,12,11,14,2,6,5,10,4,0,15,8,9,0,5,7,2,4,10,15,14,1,11,12,6,8,3,13,2,12,6,10,0,11,8,3,4,13,7,5,15,14,1,9,12,5,1,15,14,13,4,10,0,7,6,3,9,2,8,11,13,11,7,14,12,1,3,9,5,0,15,4,8,6,2,10,6,15,14,9,11,3,0,8,12,2,13,7,1,4,10,5,10,2,8,4,7,6,1,5,15,11,9,14,3,12,13,0,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,14,10,4,8,9,15,13,6,1,12,0,2,11,7,5,3,11,8,12,0,5,2,15,13,10,14,3,6,7,1,9,4,7,9,3,1,13,12,11,14,2,6,5,10,4,0,15,8,9,0,5,7,2,4,10,15,14,1,11,12,6,8,3,13,2,12,6,10,0,11,8,3,4,13,7,5,15,14,1,9]);exports.BSIGMA=t;