@gardenfi/swap 0.1.3-beta.13 → 0.1.3-beta.15

package/dist/index319.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index366.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function u(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function f(t,...e){if(!p(t))throw new Error("Uint8Array expected");if(e.length>0&&!e.includes(t.length))throw new Error("Uint8Array expected of length "+e+", got length="+t.length)}function h(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");u(t.outputLen),u(t.blockLen)}function g(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function b(t,e){f(t);const r=e.outputLen;if(t.length<r)throw new Error("digestInto() expects output buffer of length at least "+r)}function d(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function m(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function B(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function E(t,e){return t<<32-e|t>>>e}const c=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function s(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}const x=c?t=>t:t=>s(t);function l(t){for(let e=0;e<t.length;e++)t[e]=s(t[e]);return t}const L=c?t=>t:l;function w(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function a(t){return typeof t=="string"&&(t=w(t)),f(t),t}function A(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];f(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const y=t[n];r.set(y,o),o+=y.length}return r}class U{}function H(t){const e=n=>t().update(a(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function S(t){const e=(n,o)=>t(o).update(a(n)).digest(),r=t({});return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=n=>t(n),e}function V(t=32){if(i.crypto&&typeof i.crypto.getRandomValues=="function")return i.crypto.getRandomValues(new Uint8Array(t));if(i.crypto&&typeof i.crypto.randomBytes=="function")return Uint8Array.from(i.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=U;exports.abytes=f;exports.aexists=g;exports.ahash=h;exports.anumber=u;exports.aoutput=b;exports.byteSwap=s;exports.byteSwap32=l;exports.clean=m;exports.concatBytes=A;exports.createHasher=H;exports.createOptHasher=S;exports.createView=B;exports.isBytes=p;exports.isLE=c;exports.randomBytes=V;exports.rotr=E;exports.swap32IfBE=L;exports.swap8IfBE=x;exports.toBytes=a;exports.u32=d;exports.utf8ToBytes=w;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function e(){return{current:0,take(){return this.current++},reset(){this.current=0}}}const t=e();exports.idCache=t;

package/dist/index319.js

@@ -1,118 +1,15 @@
-import { crypto as f } from "./index366.js";
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function p(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function c(t) {
-  if (!Number.isSafeInteger(t) || t < 0)
-    throw new Error("positive integer expected, got " + t);
-}
-function i(t, ...e) {
-  if (!p(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
-}
-function g(t) {
-  if (typeof t != "function" || typeof t.create != "function")
-    throw new Error("Hash should be wrapped by utils.createHasher");
-  c(t.outputLen), c(t.blockLen);
-}
-function d(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function b(t, e) {
-  i(t);
-  const r = e.outputLen;
-  if (t.length < r)
-    throw new Error("digestInto() expects output buffer of length at least " + r);
-}
-function m(t) {
-  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-}
-function x(...t) {
-  for (let e = 0; e < t.length; e++)
-    t[e].fill(0);
-}
-function E(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function L(t, e) {
-  return t << 32 - e | t >>> e;
-}
-const s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function a(t) {
-  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-}
-const A = s ? (t) => t : (t) => a(t);
-function y(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = a(t[e]);
-  return t;
-}
-const U = s ? (t) => t : y;
-function w(t) {
-  if (typeof t != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function l(t) {
-  return typeof t == "string" && (t = w(t)), i(t), t;
-}
-function B(...t) {
-  let e = 0;
-  for (let n = 0; n < t.length; n++) {
-    const o = t[n];
-    i(o), e += o.length;
-  }
-  const r = new Uint8Array(e);
-  for (let n = 0, o = 0; n < t.length; n++) {
-    const u = t[n];
-    r.set(u, o), o += u.length;
-  }
-  return r;
-}
-class H {
-}
-function V(t) {
-  const e = (n) => t().update(l(n)).digest(), r = t();
-  return e.outputLen = r.outputLen, e.blockLen = r.blockLen, e.create = () => t(), e;
-}
-function k(t) {
-  const e = (n, o) => t(o).update(l(n)).digest(), r = t({});
-  return e.outputLen = r.outputLen, e.blockLen = r.blockLen, e.create = (n) => t(n), e;
-}
-function I(t = 32) {
-  if (f && typeof f.getRandomValues == "function")
-    return f.getRandomValues(new Uint8Array(t));
-  if (f && typeof f.randomBytes == "function")
-    return Uint8Array.from(f.randomBytes(t));
-  throw new Error("crypto.getRandomValues must be defined");
-}
+function r() {
+  return {
+    current: 0,
+    take() {
+      return this.current++;
+    },
+    reset() {
+      this.current = 0;
+    }
+  };
+}
+const t = /* @__PURE__ */ r();
 export {
-  H as Hash,
-  i as abytes,
-  d as aexists,
-  g as ahash,
-  c as anumber,
-  b as aoutput,
-  a as byteSwap,
-  y as byteSwap32,
-  x as clean,
-  B as concatBytes,
-  V as createHasher,
-  k as createOptHasher,
-  E as createView,
-  p as isBytes,
-  s as isLE,
-  I as randomBytes,
-  L as rotr,
-  U as swap32IfBE,
-  A as swap8IfBE,
-  l as toBytes,
-  m as u32,
-  w as utf8ToBytes
+  t as idCache
 };

package/dist/index32.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index67.cjs"),t=e.defineChain({id:5115,name:"Citrea Testnet",nativeCurrency:{name:"cBTC",symbol:"cBTC",decimals:18},rpcUrls:{default:{http:["https://rpc.testnet.citrea.xyz"]}},blockExplorers:{default:{name:"Citrea Explorer",url:"https://explorer.testnet.citrea.xyz",apiUrl:"https://explorer.testnet.citrea.xyz/api"}},testnet:!0});exports.citreaTestnet=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index69.cjs"),t=e.defineChain({id:5115,name:"Citrea Testnet",nativeCurrency:{name:"cBTC",symbol:"cBTC",decimals:18},rpcUrls:{default:{http:["https://rpc.testnet.citrea.xyz"]}},blockExplorers:{default:{name:"Citrea Explorer",url:"https://explorer.testnet.citrea.xyz",apiUrl:"https://explorer.testnet.citrea.xyz/api"}},testnet:!0});exports.citreaTestnet=t;

package/dist/index32.js

@@ -1,4 +1,4 @@
-import { defineChain as t } from "./index67.js";
+import { defineChain as t } from "./index69.js";
 const r = /* @__PURE__ */ t({
   id: 5115,
   name: "Citrea Testnet",

package/dist/index320.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index365.cjs"),x=require("./index319.cjs"),_=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),f=new Uint32Array(64);class u extends e.HashMD{constructor(o=32){super(64,o,8,!1),this.A=e.SHA256_IV[0]|0,this.B=e.SHA256_IV[1]|0,this.C=e.SHA256_IV[2]|0,this.D=e.SHA256_IV[3]|0,this.E=e.SHA256_IV[4]|0,this.F=e.SHA256_IV[5]|0,this.G=e.SHA256_IV[6]|0,this.H=e.SHA256_IV[7]|0}get(){const{A:o,B:h,C:s,D:a,E:r,F:b,G:c,H:i}=this;return[o,h,s,a,r,b,c,i]}set(o,h,s,a,r,b,c,i){this.A=o|0,this.B=h|0,this.C=s|0,this.D=a|0,this.E=r|0,this.F=b|0,this.G=c|0,this.H=i|0}process(o,h){for(let t=0;t<16;t++,h+=4)f[t]=o.getUint32(h,!1);for(let t=16;t<64;t++){const H=f[t-15],d=f[t-2],S=x.rotr(H,7)^x.rotr(H,18)^H>>>3,l=x.rotr(d,17)^x.rotr(d,19)^d>>>10;f[t]=l+f[t-7]+S+f[t-16]|0}let{A:s,B:a,C:r,D:b,E:c,F:i,G:n,H:A}=this;for(let t=0;t<64;t++){const H=x.rotr(c,6)^x.rotr(c,11)^x.rotr(c,25),d=A+H+e.Chi(c,i,n)+_[t]+f[t]|0,l=(x.rotr(s,2)^x.rotr(s,13)^x.rotr(s,22))+e.Maj(s,a,r)|0;A=n,n=i,i=c,c=b+d|0,b=r,r=a,a=s,s=d+l|0}s=s+this.A|0,a=a+this.B|0,r=r+this.C|0,b=b+this.D|0,c=c+this.E|0,i=i+this.F|0,n=n+this.G|0,A=A+this.H|0,this.set(s,a,r,b,c,i,n,A)}roundClean(){x.clean(f)}destroy(){this.set(0,0,0,0,0,0,0,0),x.clean(this.buffer)}}const I=x.createHasher(()=>new u);exports.SHA256=u;exports.sha256=I;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=BigInt(2**32-1),i=BigInt(32);function d(r,o=!1){return o?{h:Number(r&c),l:Number(r>>i&c)}:{h:Number(r>>i&c)|0,l:Number(r&c)|0}}function a(r,o=!1){const t=r.length;let n=new Uint32Array(t),l=new Uint32Array(t);for(let e=0;e<t;e++){const{h:s,l:u}=d(r[e],o);[n[e],l[e]]=[s,u]}return[n,l]}const B=(r,o,t)=>r>>>t|o<<32-t,H=(r,o,t)=>r<<32-t|o>>>t,L=(r,o,t)=>r<<64-t|o>>>t-32,S=(r,o,t)=>r>>>t-32|o<<64-t,f=(r,o)=>o,g=(r,o)=>r,h=(r,o,t)=>r<<t|o>>>32-t,m=(r,o,t)=>o<<t|r>>>32-t,b=(r,o,t)=>o<<t-32|r>>>64-t,A=(r,o,t)=>r<<t-32|o>>>64-t;function y(r,o,t,n){const l=(o>>>0)+(n>>>0);return{h:r+t+(l/2**32|0)|0,l:l|0}}const N=(r,o,t)=>(r>>>0)+(o>>>0)+(t>>>0),_=(r,o,t,n)=>o+t+n+(r/2**32|0)|0;exports.add=y;exports.add3H=_;exports.add3L=N;exports.fromBig=d;exports.rotlBH=b;exports.rotlBL=A;exports.rotlSH=h;exports.rotlSL=m;exports.rotr32H=f;exports.rotr32L=g;exports.rotrBH=L;exports.rotrBL=S;exports.rotrSH=B;exports.rotrSL=H;exports.split=a;

package/dist/index320.js

@@ -1,106 +1,36 @@
-import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index365.js";
-import { createHasher as u, clean as C, rotr as i } from "./index319.js";
-const B = /* @__PURE__ */ Uint32Array.from([
-  1116352408,
-  1899447441,
-  3049323471,
-  3921009573,
-  961987163,
-  1508970993,
-  2453635748,
-  2870763221,
-  3624381080,
-  310598401,
-  607225278,
-  1426881987,
-  1925078388,
-  2162078206,
-  2614888103,
-  3248222580,
-  3835390401,
-  4022224774,
-  264347078,
-  604807628,
-  770255983,
-  1249150122,
-  1555081692,
-  1996064986,
-  2554220882,
-  2821834349,
-  2952996808,
-  3210313671,
-  3336571891,
-  3584528711,
-  113926993,
-  338241895,
-  666307205,
-  773529912,
-  1294757372,
-  1396182291,
-  1695183700,
-  1986661051,
-  2177026350,
-  2456956037,
-  2730485921,
-  2820302411,
-  3259730800,
-  3345764771,
-  3516065817,
-  3600352804,
-  4094571909,
-  275423344,
-  430227734,
-  506948616,
-  659060556,
-  883997877,
-  958139571,
-  1322822218,
-  1537002063,
-  1747873779,
-  1955562222,
-  2024104815,
-  2227730452,
-  2361852424,
-  2428436474,
-  2756734187,
-  3204031479,
-  3329325298
-]), h = /* @__PURE__ */ new Uint32Array(64);
-class E extends D {
-  constructor(o = 32) {
-    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
-  }
-  get() {
-    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
-    return [o, r, t, s, a, f, c, e];
-  }
-  // prettier-ignore
-  set(o, r, t, s, a, f, c, e) {
-    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
-  }
-  process(o, r) {
-    for (let x = 0; x < 16; x++, r += 4)
-      h[x] = o.getUint32(r, !1);
-    for (let x = 16; x < 64; x++) {
-      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
-      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
-    }
-    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
-    for (let x = 0; x < 64; x++) {
-      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
-      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
-    }
-    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
-  }
-  roundClean() {
-    C(h);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
+const l = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function f(r, n = !1) {
+  return n ? { h: Number(r & l), l: Number(r >> i & l) } : { h: Number(r >> i & l) | 0, l: Number(r & l) | 0 };
+}
+function a(r, n = !1) {
+  const t = r.length;
+  let o = new Uint32Array(t), c = new Uint32Array(t);
+  for (let e = 0; e < t; e++) {
+    const { h: s, l: u } = f(r[e], n);
+    [o[e], c[e]] = [s, u];
   }
+  return [o, c];
+}
+const h = (r, n, t) => r >>> t | n << 32 - t, B = (r, n, t) => r << 32 - t | n >>> t, d = (r, n, t) => r << 64 - t | n >>> t - 32, H = (r, n, t) => r >>> t - 32 | n << 64 - t, L = (r, n) => n, m = (r, n) => r, A = (r, n, t) => r << t | n >>> 32 - t, S = (r, n, t) => n << t | r >>> 32 - t, b = (r, n, t) => n << t - 32 | r >>> 64 - t, g = (r, n, t) => r << t - 32 | n >>> 64 - t;
+function N(r, n, t, o) {
+  const c = (n >>> 0) + (o >>> 0);
+  return { h: r + t + (c / 2 ** 32 | 0) | 0, l: c | 0 };
 }
-const y = /* @__PURE__ */ u(() => new E());
+const _ = (r, n, t) => (r >>> 0) + (n >>> 0) + (t >>> 0), U = (r, n, t, o) => n + t + o + (r / 2 ** 32 | 0) | 0;
 export {
-  E as SHA256,
-  y as sha256
+  N as add,
+  U as add3H,
+  _ as add3L,
+  f as fromBig,
+  b as rotlBH,
+  g as rotlBL,
+  A as rotlSH,
+  S as rotlSL,
+  L as rotr32H,
+  m as rotr32L,
+  d as rotrBH,
+  H as rotrBL,
+  h as rotrSH,
+  B as rotrSL,
+  a as split
 };

package/dist/index321.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index203.cjs"),r=require("./index215.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index368.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function u(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function f(t,...e){if(!p(t))throw new Error("Uint8Array expected");if(e.length>0&&!e.includes(t.length))throw new Error("Uint8Array expected of length "+e+", got length="+t.length)}function h(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");u(t.outputLen),u(t.blockLen)}function g(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function b(t,e){f(t);const r=e.outputLen;if(t.length<r)throw new Error("digestInto() expects output buffer of length at least "+r)}function d(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function m(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function B(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function E(t,e){return t<<32-e|t>>>e}const c=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function s(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}const x=c?t=>t:t=>s(t);function l(t){for(let e=0;e<t.length;e++)t[e]=s(t[e]);return t}const L=c?t=>t:l;function w(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function a(t){return typeof t=="string"&&(t=w(t)),f(t),t}function A(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];f(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const y=t[n];r.set(y,o),o+=y.length}return r}class U{}function H(t){const e=n=>t().update(a(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function S(t){const e=(n,o)=>t(o).update(a(n)).digest(),r=t({});return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=n=>t(n),e}function V(t=32){if(i.crypto&&typeof i.crypto.getRandomValues=="function")return i.crypto.getRandomValues(new Uint8Array(t));if(i.crypto&&typeof i.crypto.randomBytes=="function")return Uint8Array.from(i.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=U;exports.abytes=f;exports.aexists=g;exports.ahash=h;exports.anumber=u;exports.aoutput=b;exports.byteSwap=s;exports.byteSwap32=l;exports.clean=m;exports.concatBytes=A;exports.createHasher=H;exports.createOptHasher=S;exports.createView=B;exports.isBytes=p;exports.isLE=c;exports.randomBytes=V;exports.rotr=E;exports.swap32IfBE=L;exports.swap8IfBE=x;exports.toBytes=a;exports.u32=d;exports.utf8ToBytes=w;

package/dist/index321.js

@@ -1,9 +1,118 @@
-import { toBytes as o } from "./index203.js";
-import { keccak256 as r } from "./index215.js";
-const e = (t) => r(o(t));
+import { crypto as f } from "./index368.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function p(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
 function c(t) {
-  return e(t);
+  if (!Number.isSafeInteger(t) || t < 0)
+    throw new Error("positive integer expected, got " + t);
+}
+function i(t, ...e) {
+  if (!p(t))
+    throw new Error("Uint8Array expected");
+  if (e.length > 0 && !e.includes(t.length))
+    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
+}
+function g(t) {
+  if (typeof t != "function" || typeof t.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  c(t.outputLen), c(t.blockLen);
+}
+function d(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function b(t, e) {
+  i(t);
+  const r = e.outputLen;
+  if (t.length < r)
+    throw new Error("digestInto() expects output buffer of length at least " + r);
+}
+function m(t) {
+  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
+}
+function x(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function E(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function L(t, e) {
+  return t << 32 - e | t >>> e;
+}
+const s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function a(t) {
+  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
+}
+const A = s ? (t) => t : (t) => a(t);
+function y(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = a(t[e]);
+  return t;
+}
+const U = s ? (t) => t : y;
+function w(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function l(t) {
+  return typeof t == "string" && (t = w(t)), i(t), t;
+}
+function B(...t) {
+  let e = 0;
+  for (let n = 0; n < t.length; n++) {
+    const o = t[n];
+    i(o), e += o.length;
+  }
+  const r = new Uint8Array(e);
+  for (let n = 0, o = 0; n < t.length; n++) {
+    const u = t[n];
+    r.set(u, o), o += u.length;
+  }
+  return r;
+}
+class H {
+}
+function V(t) {
+  const e = (n) => t().update(l(n)).digest(), r = t();
+  return e.outputLen = r.outputLen, e.blockLen = r.blockLen, e.create = () => t(), e;
+}
+function k(t) {
+  const e = (n, o) => t(o).update(l(n)).digest(), r = t({});
+  return e.outputLen = r.outputLen, e.blockLen = r.blockLen, e.create = (n) => t(n), e;
+}
+function I(t = 32) {
+  if (f && typeof f.getRandomValues == "function")
+    return f.getRandomValues(new Uint8Array(t));
+  if (f && typeof f.randomBytes == "function")
+    return Uint8Array.from(f.randomBytes(t));
+  throw new Error("crypto.getRandomValues must be defined");
 }
 export {
-  c as hashSignature
+  H as Hash,
+  i as abytes,
+  d as aexists,
+  g as ahash,
+  c as anumber,
+  b as aoutput,
+  a as byteSwap,
+  y as byteSwap32,
+  x as clean,
+  B as concatBytes,
+  V as createHasher,
+  k as createOptHasher,
+  E as createView,
+  p as isBytes,
+  s as isLE,
+  I as randomBytes,
+  L as rotr,
+  U as swap32IfBE,
+  A as swap8IfBE,
+  l as toBytes,
+  m as u32,
+  w as utf8ToBytes
 };

package/dist/index322.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index323.cjs"),n=require("./index286.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index367.cjs"),x=require("./index321.cjs"),_=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),f=new Uint32Array(64);class u extends e.HashMD{constructor(o=32){super(64,o,8,!1),this.A=e.SHA256_IV[0]|0,this.B=e.SHA256_IV[1]|0,this.C=e.SHA256_IV[2]|0,this.D=e.SHA256_IV[3]|0,this.E=e.SHA256_IV[4]|0,this.F=e.SHA256_IV[5]|0,this.G=e.SHA256_IV[6]|0,this.H=e.SHA256_IV[7]|0}get(){const{A:o,B:h,C:s,D:a,E:r,F:b,G:c,H:i}=this;return[o,h,s,a,r,b,c,i]}set(o,h,s,a,r,b,c,i){this.A=o|0,this.B=h|0,this.C=s|0,this.D=a|0,this.E=r|0,this.F=b|0,this.G=c|0,this.H=i|0}process(o,h){for(let t=0;t<16;t++,h+=4)f[t]=o.getUint32(h,!1);for(let t=16;t<64;t++){const H=f[t-15],d=f[t-2],S=x.rotr(H,7)^x.rotr(H,18)^H>>>3,l=x.rotr(d,17)^x.rotr(d,19)^d>>>10;f[t]=l+f[t-7]+S+f[t-16]|0}let{A:s,B:a,C:r,D:b,E:c,F:i,G:n,H:A}=this;for(let t=0;t<64;t++){const H=x.rotr(c,6)^x.rotr(c,11)^x.rotr(c,25),d=A+H+e.Chi(c,i,n)+_[t]+f[t]|0,l=(x.rotr(s,2)^x.rotr(s,13)^x.rotr(s,22))+e.Maj(s,a,r)|0;A=n,n=i,i=c,c=b+d|0,b=r,r=a,a=s,s=d+l|0}s=s+this.A|0,a=a+this.B|0,r=r+this.C|0,b=b+this.D|0,c=c+this.E|0,i=i+this.F|0,n=n+this.G|0,A=A+this.H|0,this.set(s,a,r,b,c,i,n,A)}roundClean(){x.clean(f)}destroy(){this.set(0,0,0,0,0,0,0,0),x.clean(this.buffer)}}const I=x.createHasher(()=>new u);exports.SHA256=u;exports.sha256=I;

package/dist/index322.js

@@ -1,9 +1,106 @@
-import { normalizeSignature as o } from "./index323.js";
-import { formatAbiItem as n } from "./index286.js";
-const m = (r) => {
-  const t = typeof r == "string" ? r : n(r);
-  return o(t);
-};
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index367.js";
+import { createHasher as u, clean as C, rotr as i } from "./index321.js";
+const B = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class E extends D {
+  constructor(o = 32) {
+    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
+  }
+  get() {
+    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [o, r, t, s, a, f, c, e];
+  }
+  // prettier-ignore
+  set(o, r, t, s, a, f, c, e) {
+    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
+  }
+  process(o, r) {
+    for (let x = 0; x < 16; x++, r += 4)
+      h[x] = o.getUint32(r, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
+      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
+    }
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
+      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
+    }
+    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
+  }
+  roundClean() {
+    C(h);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
+  }
+}
+const y = /* @__PURE__ */ u(() => new E());
 export {
-  m as toSignature
+  E as SHA256,
+  y as sha256
 };

package/dist/index323.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index178.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index205.cjs"),r=require("./index217.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;

package/dist/index323.js

@@ -1,29 +1,9 @@
-import { BaseError as u } from "./index178.js";
-function a(r) {
-  let l = !0, i = "", f = 0, t = "", o = !1;
-  for (let n = 0; n < r.length; n++) {
-    const e = r[n];
-    if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
-      if (f === 0) {
-        if (e === " " && ["event", "function", ""].includes(t))
-          t = "";
-        else if (t += e, e === ")") {
-          o = !0;
-          break;
-        }
-        continue;
-      }
-      if (e === " ") {
-        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
-        continue;
-      }
-      t += e, i += e;
-    }
-  }
-  if (!o)
-    throw new u("Unable to normalize signature.");
-  return t;
+import { toBytes as o } from "./index205.js";
+import { keccak256 as r } from "./index217.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
 }
 export {
-  a as normalizeSignature
+  c as hashSignature
 };

package/dist/index324.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index367.cjs"),s=require("./index319.cjs"),o=require("./index368.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,s.concatBytes(...t)),randomBytes:s.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...c(n)});return{...t(r),create:t}}exports.createCurve=u;exports.getHash=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index325.cjs"),n=require("./index288.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;

package/dist/index324.js

@@ -1,19 +1,9 @@
-import { hmac as c } from "./index367.js";
-import { randomBytes as m, concatBytes as n } from "./index319.js";
-import { weierstrass as a } from "./index368.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function i(r) {
-  return {
-    hash: r,
-    hmac: (e, ...t) => c(r, e, n(...t)),
-    randomBytes: m
-  };
-}
-function p(r, e) {
-  const t = (o) => a({ ...r, ...i(o) });
-  return { ...t(e), create: t };
-}
+import { normalizeSignature as o } from "./index325.js";
+import { formatAbiItem as n } from "./index288.js";
+const m = (r) => {
+  const t = typeof r == "string" ? r : n(r);
+  return o(t);
+};
 export {
-  p as createCurve,
-  i as getHash
+  m as toSignature
 };

package/dist/index325.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index319.cjs"),a=require("./index360.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),f=BigInt(1),h=BigInt(2),K=BigInt(3),I=BigInt(4),L=BigInt(5),T=BigInt(8);function g(t,n){const o=t%n;return o>=d?o:n+o}function Q(t,n,o){let r=t;for(;n-- >d;)r*=r,r%=o;return r}function B(t,n){if(t===d)throw new Error("invert: expected non-zero number");if(n<=d)throw new Error("invert: expected positive modulus, got "+n);let o=g(t,n),r=n,s=d,l=f;for(;o!==d;){const c=r/o,e=r%o,i=s-l*c;r=o,o=e,s=l,l=i}if(r!==f)throw new Error("invert: does not exist");return g(s,n)}function x(t,n){const o=(t.ORDER+f)/I,r=t.pow(n,o);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function V(t,n){const o=(t.ORDER-L)/T,r=t.mul(n,h),s=t.pow(r,o),l=t.mul(n,s),u=t.mul(t.mul(l,h),s),c=t.mul(l,t.sub(u,t.ONE));if(!t.eql(t.sqr(c),n))throw new Error("Cannot find square root");return c}function _(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-f,o=0;for(;n%h===d;)n/=h,o++;let r=h;const s=Z(t);for(;y(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(o===1)return x;let l=s.pow(r,n);const u=(n+f)/h;return function(e,i){if(e.is0(i))return i;if(y(e,i)!==1)throw new Error("Cannot find square root");let w=o,v=e.mul(e.ONE,l),b=e.pow(i,n),E=e.pow(i,u);for(;!e.eql(b,e.ONE);){if(e.is0(b))return e.ZERO;let q=1,m=e.sqr(b);for(;!e.eql(m,e.ONE);)if(q++,m=e.sqr(m),q===w)throw new Error("Cannot find square root");const z=f<<BigInt(w-q-1),S=e.pow(v,z);w=q,v=e.sqr(S),b=e.mul(b,v),E=e.mul(E,S)}return E}}function M(t){return t%I===K?x:t%T===L?V:_(t)}const Y=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},o=Y.reduce((r,s)=>(r[s]="function",r),n);return a.validateObject(t,o)}function O(t,n,o){if(o<d)throw new Error("invalid exponent, negatives unsupported");if(o===d)return t.ONE;if(o===f)return n;let r=t.ONE,s=n;for(;o>d;)o&f&&(r=t.mul(r,s)),s=t.sqr(s),o>>=f;return r}function A(t,n,o=!1){const r=new Array(n.length).fill(o?t.ZERO:void 0),s=n.reduce((u,c,e)=>t.is0(c)?u:(r[e]=u,t.mul(u,c)),t.ONE),l=t.inv(s);return n.reduceRight((u,c,e)=>t.is0(c)?u:(r[e]=t.mul(u,r[e]),t.mul(u,c)),l),r}function y(t,n){const o=(t.ORDER-f)/h,r=t.pow(n,o),s=t.eql(r,t.ONE),l=t.eql(r,t.ZERO),u=t.eql(r,t.neg(t.ONE));if(!s&&!l&&!u)throw new Error("invalid Legendre symbol result");return s?1:l?0:-1}function C(t,n){n!==void 0&&H.anumber(n);const o=n!==void 0?n:t.toString(2).length,r=Math.ceil(o/8);return{nBitLength:o,nByteLength:r}}function Z(t,n,o=!1,r={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:l}=C(t,n);if(l>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let u;const c=Object.freeze({ORDER:t,isLE:o,BITS:s,BYTES:l,MASK:a.bitMask(s),ZERO:d,ONE:f,create:e=>g(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return d<=e&&e<t},is0:e=>e===d,isOdd:e=>(e&f)===f,neg:e=>g(-e,t),eql:(e,i)=>e===i,sqr:e=>g(e*e,t),add:(e,i)=>g(e+i,t),sub:(e,i)=>g(e-i,t),mul:(e,i)=>g(e*i,t),pow:(e,i)=>O(c,e,i),div:(e,i)=>g(e*B(i,t),t),sqrN:e=>e*e,addN:(e,i)=>e+i,subN:(e,i)=>e-i,mulN:(e,i)=>e*i,inv:e=>B(e,t),sqrt:r.sqrt||(e=>(u||(u=M(t)),u(c,e))),toBytes:e=>o?a.numberToBytesLE(e,l):a.numberToBytesBE(e,l),fromBytes:e=>{if(e.length!==l)throw new Error("Field.fromBytes: expected "+l+" bytes, got "+e.length);return o?a.bytesToNumberLE(e):a.bytesToNumberBE(e)},invertBatch:e=>A(c,e),cmov:(e,i,w)=>w?i:e});return Object.freeze(c)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function j(t){const n=N(t);return n+Math.ceil(n/2)}function P(t,n,o=!1){const r=t.length,s=N(n),l=j(n);if(r<16||r<l||r>1024)throw new Error("expected "+l+"-1024 bytes of input, got "+r);const u=o?a.bytesToNumberLE(t):a.bytesToNumberBE(t),c=g(u,n-f)+f;return o?a.numberToBytesLE(c,s):a.numberToBytesBE(c,s)}exports.Field=Z;exports.FpInvertBatch=A;exports.FpLegendre=y;exports.FpPow=O;exports.FpSqrt=M;exports.getFieldBytesLength=N;exports.getMinHashLength=j;exports.invert=B;exports.mapHashToField=P;exports.mod=g;exports.nLength=C;exports.pow2=Q;exports.tonelliShanks=_;exports.validateField=k;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index180.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;