@protontech/openpgp 6.0.0-alpha.0 → 6.0.0-alpha.1.patch.0

package/dist/lightweight/sha3.min.mjs

@@ -1,4 +1,4 @@
-/*! OpenPGP.js v6.0.0-alpha.0 - 2023-12-12 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
-const t="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:{};import{B as e}from"./interface.min.mjs";import s from"./native.interface.min.mjs";import i from"./bn.interface.min.mjs";function r(t){if(!Number.isSafeInteger(t)||t<0)throw Error("Wrong positive integer: "+t)}function n(t,...e){if(!(t instanceof Uint8Array))throw Error("Expected Uint8Array");if(e.length>0&&!e.includes(t.length))throw Error(`Expected Uint8Array of length ${e}, not of length=${t.length}`)}function h(t){if("function"!=typeof t||"function"!=typeof t.create)throw Error("Hash should be wrapped by utils.wrapConstructor");r(t.outputLen),r(t.blockLen)}function o(t,e=!0){if(t.destroyed)throw Error("Hash instance has been destroyed");if(e&&t.finished)throw Error("Hash#digest() has already been called")}function f(t,e){n(t);const s=e.outputLen;if(t.length<s)throw Error("digestInto() expects output buffer of length at least "+s)}const c="object"==typeof t&&"crypto"in t?t.crypto:void 0,a=t=>t instanceof Uint8Array,d=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),l=(t,e)=>t<<32-e|t>>>e;
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */if(!(68===new Uint8Array(new Uint32Array([287454020]).buffer)[0]))throw Error("Non little-endian hardware is not supported");function b(t){if("string"!=typeof t)throw Error("utf8ToBytes expected string, got "+typeof t);return new Uint8Array((new TextEncoder).encode(t))}function u(t){if("string"==typeof t&&(t=b(t)),!a(t))throw Error("expected Uint8Array, got "+typeof t);return t}function p(...t){const e=new Uint8Array(t.reduce(((t,e)=>t+e.length),0));let s=0;return t.forEach((t=>{if(!a(t))throw Error("Uint8Array expected");e.set(t,s),s+=t.length})),e}class x{clone(){return this._cloneInto()}}function w(t){const e=e=>t().update(u(e)).digest(),s=t();return e.outputLen=s.outputLen,e.blockLen=s.blockLen,e.create=()=>t(),e}function g(t=32){if(c&&"function"==typeof c.getRandomValues)return c.getRandomValues(new Uint8Array(t));throw Error("crypto.getRandomValues must be defined")}e.setImplementation("undefined"!=typeof BigInt?s:i);class y extends x{constructor(t,e,s,i){super(),this.blockLen=t,this.outputLen=e,this.padOffset=s,this.isLE=i,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=d(this.buffer)}update(t){o(this);const{view:e,buffer:s,blockLen:i}=this,r=(t=u(t)).length;for(let n=0;n<r;){const h=Math.min(i-this.pos,r-n);if(h!==i)s.set(t.subarray(n,n+h),this.pos),this.pos+=h,n+=h,this.pos===i&&(this.process(e,0),this.pos=0);else{const e=d(t);for(;i<=r-n;n+=i)this.process(e,n)}}return this.length+=t.length,this.roundClean(),this}digestInto(t){o(this),f(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:r,isLE:n}=this;let{pos:h}=this;s[h++]=128,this.buffer.subarray(h).fill(0),this.padOffset>r-h&&(this.process(i,0),h=0);for(let t=h;t<r;t++)s[t]=0;!function(t,s,i,r){if("function"==typeof t.setBigUint64)return t.setBigUint64(s,BigInt(i.toString()),r);const n=Object.freeze(e.new(32)),h=Object.freeze(e.new(4294967295)),o=i.rightShift(n).bitwiseAnd(h).toNumber(),f=i.bitwiseAnd(h).toNumber(),c=r?4:0,a=r?0:4;t.setUint32(s+c,o,r),t.setUint32(s+a,f,r)}(i,r-8,e.new(8*this.length),n),this.process(i,0);const c=d(t),a=this.outputLen;if(a%4)throw Error("_sha2: outputLen should be aligned to 32bit");const l=a/4,b=this.get();if(l>b.length)throw Error("_sha2: outputLen bigger than state");for(let t=0;t<l;t++)c.setUint32(4*t,b[t],n)}digest(){const{buffer:t,outputLen:e}=this;this.digestInto(t);const s=t.slice(0,e);return this.destroy(),s}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:e,buffer:s,length:i,finished:r,destroyed:n,pos:h}=this;return t.length=i,t.pos=h,t.finished=r,t.destroyed=n,i%e&&t.buffer.set(s),t}}const L=(t,e,s)=>t&e^t&s^e&s,A=new Uint32Array([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=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),E=new Uint32Array(64);class B extends y{constructor(){super(64,32,8,!1),this.A=0|H[0],this.B=0|H[1],this.C=0|H[2],this.D=0|H[3],this.E=0|H[4],this.F=0|H[5],this.G=0|H[6],this.H=0|H[7]}get(){const{A:t,B:e,C:s,D:i,E:r,F:n,G:h,H:o}=this;return[t,e,s,i,r,n,h,o]}set(t,e,s,i,r,n,h,o){this.A=0|t,this.B=0|e,this.C=0|s,this.D=0|i,this.E=0|r,this.F=0|n,this.G=0|h,this.H=0|o}process(t,e){for(let s=0;s<16;s++,e+=4)E[s]=t.getUint32(e,!1);for(let t=16;t<64;t++){const e=E[t-15],s=E[t-2],i=l(e,7)^l(e,18)^e>>>3,r=l(s,17)^l(s,19)^s>>>10;E[t]=r+E[t-7]+i+E[t-16]|0}let{A:s,B:i,C:r,D:n,E:h,F:o,G:f,H:c}=this;for(let t=0;t<64;t++){const e=c+(l(h,6)^l(h,11)^l(h,25))+((a=h)&o^~a&f)+A[t]+E[t]|0,d=(l(s,2)^l(s,13)^l(s,22))+L(s,i,r)|0;c=f,f=o,o=h,h=n+e|0,n=r,r=i,i=s,s=e+d|0}var a;s=s+this.A|0,i=i+this.B|0,r=r+this.C|0,n=n+this.D|0,h=h+this.E|0,o=o+this.F|0,f=f+this.G|0,c=c+this.H|0,this.set(s,i,r,n,h,o,f,c)}roundClean(){E.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}class S extends B{constructor(){super(),this.A=-1056596264,this.B=914150663,this.C=812702999,this.D=-150054599,this.E=-4191439,this.F=1750603025,this.G=1694076839,this.H=-1090891868,this.outputLen=28}}const m=w((()=>new B)),U=w((()=>new S)),k=Object.freeze(e.new(2**32-1)),O=Object.freeze(e.new(32));function F(t,e=!1){return e?{h:t.bitwiseAnd(k).toNumber(),l:t.rightShift(O).bitwiseAnd(k).toNumber()}:{h:0|t.rightShift(O).bitwiseAnd(k).toNumber(),l:0|t.bitwiseAnd(k).toNumber()}}function C(t,e=!1){let s=new Uint32Array(t.length),i=new Uint32Array(t.length);for(let r=0;r<t.length;r++){const{h:n,l:h}=F(t[r],e);[s[r],i[r]]=[n,h]}return[s,i]}const D=(t,e,s)=>t<<s|e>>>32-s,G=(t,e,s)=>e<<s|t>>>32-s,I=(t,e,s)=>e<<s-32|t>>>64-s,j=(t,e,s)=>t<<s-32|e>>>64-s;var v={fromBig:F,split:C,toBig:(t,s)=>e.new(t>>>0).ileftShift(O).ibitwiseOr(e.new(s>>>0)),shrSH:(t,e,s)=>t>>>s,shrSL:(t,e,s)=>t<<32-s|e>>>s,rotrSH:(t,e,s)=>t>>>s|e<<32-s,rotrSL:(t,e,s)=>t<<32-s|e>>>s,rotrBH:(t,e,s)=>t<<64-s|e>>>s-32,rotrBL:(t,e,s)=>t>>>s-32|e<<64-s,rotr32H:(t,e)=>e,rotr32L:(t,e)=>t,rotlSH:D,rotlSL:G,rotlBH:I,rotlBL:j,add:function(t,e,s,i){const r=(e>>>0)+(i>>>0);return{h:t+s+(r/2**32|0)|0,l:0|r}},add3L:(t,e,s)=>(t>>>0)+(e>>>0)+(s>>>0),add3H:(t,e,s,i)=>e+s+i+(t/2**32|0)|0,add4L:(t,e,s,i)=>(t>>>0)+(e>>>0)+(s>>>0)+(i>>>0),add4H:(t,e,s,i,r)=>e+s+i+r+(t/2**32|0)|0,add5H:(t,e,s,i,r,n)=>e+s+i+r+n+(t/2**32|0)|0,add5L:(t,e,s,i,r)=>(t>>>0)+(e>>>0)+(s>>>0)+(i>>>0)+(r>>>0)};const[z,N]=(()=>v.split(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map((t=>e.new(t)))))(),X=new Uint32Array(80),_=new Uint32Array(80);class M extends y{constructor(){super(128,64,16,!1),this.Ah=1779033703,this.Al=-205731576,this.Bh=-1150833019,this.Bl=-2067093701,this.Ch=1013904242,this.Cl=-23791573,this.Dh=-1521486534,this.Dl=1595750129,this.Eh=1359893119,this.El=-1377402159,this.Fh=-1694144372,this.Fl=725511199,this.Gh=528734635,this.Gl=-79577749,this.Hh=1541459225,this.Hl=327033209}get(){const{Ah:t,Al:e,Bh:s,Bl:i,Ch:r,Cl:n,Dh:h,Dl:o,Eh:f,El:c,Fh:a,Fl:d,Gh:l,Gl:b,Hh:u,Hl:p}=this;return[t,e,s,i,r,n,h,o,f,c,a,d,l,b,u,p]}set(t,e,s,i,r,n,h,o,f,c,a,d,l,b,u,p){this.Ah=0|t,this.Al=0|e,this.Bh=0|s,this.Bl=0|i,this.Ch=0|r,this.Cl=0|n,this.Dh=0|h,this.Dl=0|o,this.Eh=0|f,this.El=0|c,this.Fh=0|a,this.Fl=0|d,this.Gh=0|l,this.Gl=0|b,this.Hh=0|u,this.Hl=0|p}process(t,e){for(let s=0;s<16;s++,e+=4)X[s]=t.getUint32(e),_[s]=t.getUint32(e+=4);for(let t=16;t<80;t++){const e=0|X[t-15],s=0|_[t-15],i=v.rotrSH(e,s,1)^v.rotrSH(e,s,8)^v.shrSH(e,s,7),r=v.rotrSL(e,s,1)^v.rotrSL(e,s,8)^v.shrSL(e,s,7),n=0|X[t-2],h=0|_[t-2],o=v.rotrSH(n,h,19)^v.rotrBH(n,h,61)^v.shrSH(n,h,6),f=v.rotrSL(n,h,19)^v.rotrBL(n,h,61)^v.shrSL(n,h,6),c=v.add4L(r,f,_[t-7],_[t-16]),a=v.add4H(c,i,o,X[t-7],X[t-16]);X[t]=0|a,_[t]=0|c}let{Ah:s,Al:i,Bh:r,Bl:n,Ch:h,Cl:o,Dh:f,Dl:c,Eh:a,El:d,Fh:l,Fl:b,Gh:u,Gl:p,Hh:x,Hl:w}=this;for(let t=0;t<80;t++){const e=v.rotrSH(a,d,14)^v.rotrSH(a,d,18)^v.rotrBH(a,d,41),g=v.rotrSL(a,d,14)^v.rotrSL(a,d,18)^v.rotrBL(a,d,41),y=a&l^~a&u,L=d&b^~d&p,A=v.add5L(w,g,L,N[t],_[t]),H=v.add5H(A,x,e,y,z[t],X[t]),E=0|A,B=v.rotrSH(s,i,28)^v.rotrBH(s,i,34)^v.rotrBH(s,i,39),S=v.rotrSL(s,i,28)^v.rotrBL(s,i,34)^v.rotrBL(s,i,39),m=s&r^s&h^r&h,U=i&n^i&o^n&o;x=0|u,w=0|p,u=0|l,p=0|b,l=0|a,b=0|d,({h:a,l:d}=v.add(0|f,0|c,0|H,0|E)),f=0|h,c=0|o,h=0|r,o=0|n,r=0|s,n=0|i;const k=v.add3L(E,S,U);s=v.add3H(k,H,B,m),i=0|k}({h:s,l:i}=v.add(0|this.Ah,0|this.Al,0|s,0|i)),({h:r,l:n}=v.add(0|this.Bh,0|this.Bl,0|r,0|n)),({h,l:o}=v.add(0|this.Ch,0|this.Cl,0|h,0|o)),({h:f,l:c}=v.add(0|this.Dh,0|this.Dl,0|f,0|c)),({h:a,l:d}=v.add(0|this.Eh,0|this.El,0|a,0|d)),({h:l,l:b}=v.add(0|this.Fh,0|this.Fl,0|l,0|b)),({h:u,l:p}=v.add(0|this.Gh,0|this.Gl,0|u,0|p)),({h:x,l:w}=v.add(0|this.Hh,0|this.Hl,0|x,0|w)),this.set(s,i,r,n,h,o,f,c,a,d,l,b,u,p,x,w)}roundClean(){X.fill(0),_.fill(0)}destroy(){this.buffer.fill(0),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class V extends M{constructor(){super(),this.Ah=-876896931,this.Al=-1056596264,this.Bh=1654270250,this.Bl=914150663,this.Ch=-1856437926,this.Cl=812702999,this.Dh=355462360,this.Dl=-150054599,this.Eh=1731405415,this.El=-4191439,this.Fh=-1900787065,this.Fl=1750603025,this.Gh=-619958771,this.Gl=1694076839,this.Hh=1203062813,this.Hl=-1090891868,this.outputLen=48}}const R=w((()=>new M)),T=w((()=>new V)),[$,W,Z]=[[],[],[]],q=Object.freeze(e.new(0)),J=Object.freeze(e.new(1)),K=Object.freeze(e.new(2)),P=Object.freeze(e.new(7)),Q=Object.freeze(e.new(256)),Y=Object.freeze(e.new(113));for(let t=0,s=J,i=1,r=0;t<24;t++){[i,r]=[r,(2*i+3*r)%5],$.push(2*(5*r+i)),W.push((t+1)*(t+2)/2%64);const n=q.clone();for(let t=0;t<7;t++)s=s.leftShift(J).ixor(s.rightShift(P).imul(Y)).imod(Q),s.bitwiseAnd(K).isZero()||n.ixor(J.leftShift(J.leftShift(e.new(t)).idec()));Z.push(n)}const[tt,et]=C(Z,!0),st=(t,e,s)=>s>32?I(t,e,s):D(t,e,s),it=(t,e,s)=>s>32?j(t,e,s):G(t,e,s);class rt extends x{constructor(t,e,s,i=!1,n=24){if(super(),this.blockLen=t,this.suffix=e,this.outputLen=s,this.enableXOF=i,this.rounds=n,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,r(s),0>=this.blockLen||this.blockLen>=200)throw Error("Sha3 supports only keccak-f1600 function");var h;this.state=new Uint8Array(200),this.state32=(h=this.state,new Uint32Array(h.buffer,h.byteOffset,Math.floor(h.byteLength/4)))}keccak(){!function(t,e=24){const s=new Uint32Array(10);for(let i=24-e;i<24;i++){for(let e=0;e<10;e++)s[e]=t[e]^t[e+10]^t[e+20]^t[e+30]^t[e+40];for(let e=0;e<10;e+=2){const i=(e+8)%10,r=(e+2)%10,n=s[r],h=s[r+1],o=st(n,h,1)^s[i],f=it(n,h,1)^s[i+1];for(let s=0;s<50;s+=10)t[e+s]^=o,t[e+s+1]^=f}let e=t[2],r=t[3];for(let s=0;s<24;s++){const i=W[s],n=st(e,r,i),h=it(e,r,i),o=$[s];e=t[o],r=t[o+1],t[o]=n,t[o+1]=h}for(let e=0;e<50;e+=10){for(let i=0;i<10;i++)s[i]=t[e+i];for(let i=0;i<10;i++)t[e+i]^=~s[(i+2)%10]&s[(i+4)%10]}t[0]^=tt[i],t[1]^=et[i]}s.fill(0)}(this.state32,this.rounds),this.posOut=0,this.pos=0}update(t){o(this);const{blockLen:e,state:s}=this,i=(t=u(t)).length;for(let r=0;r<i;){const n=Math.min(e-this.pos,i-r);for(let e=0;e<n;e++)s[this.pos++]^=t[r++];this.pos===e&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:e,pos:s,blockLen:i}=this;t[s]^=e,0!=(128&e)&&s===i-1&&this.keccak(),t[i-1]^=128,this.keccak()}writeInto(t){o(this,!1),n(t),this.finish();const e=this.state,{blockLen:s}=this;for(let i=0,r=t.length;i<r;){this.posOut>=s&&this.keccak();const n=Math.min(s-this.posOut,r-i);t.set(e.subarray(this.posOut,this.posOut+n),i),this.posOut+=n,i+=n}return t}xofInto(t){if(!this.enableXOF)throw Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return r(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(f(t,this),this.finished)throw Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:e,suffix:s,outputLen:i,rounds:r,enableXOF:n}=this;return t||(t=new rt(e,s,i,n,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=s,t.outputLen=i,t.enableXOF=n,t.destroyed=this.destroyed,t}}const nt=(t,e,s)=>w((()=>new rt(e,t,s))),ht=nt(6,136,32),ot=nt(6,72,64),ft=((t,e,s)=>function(t){const e=(e,s)=>t(s).update(u(e)).digest(),s=t({});return e.outputLen=s.outputLen,e.blockLen=s.blockLen,e.create=e=>t(e),e}(((i={})=>new rt(e,t,void 0===i.dkLen?s:i.dkLen,!0))))(31,136,32);export{x as H,y as S,T as a,n as b,p as c,R as d,o as e,ft as f,U as g,h,ht as i,ot as j,g as r,m as s,u as t,b as u,w};
+/*! OpenPGP.js v6.0.0-alpha.1.patch.0 - 2024-03-01 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+const t="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:{};import{B as e}from"./interface.min.mjs";import s from"./native.interface.min.mjs";import i from"./bn.interface.min.mjs";function r(t){if(!Number.isSafeInteger(t)||t<0)throw Error("Wrong positive integer: "+t)}function n(t,...e){if(!((s=t)instanceof Uint8Array||null!=s&&"object"==typeof s&&"Uint8Array"===s.constructor.name))throw Error("Expected Uint8Array");var s;if(e.length>0&&!e.includes(t.length))throw Error(`Expected Uint8Array of length ${e}, not of length=${t.length}`)}function h(t){if("function"!=typeof t||"function"!=typeof t.create)throw Error("Hash should be wrapped by utils.wrapConstructor");r(t.outputLen),r(t.blockLen)}function o(t,e=!0){if(t.destroyed)throw Error("Hash instance has been destroyed");if(e&&t.finished)throw Error("Hash#digest() has already been called")}function f(t,e){n(t);const s=e.outputLen;if(t.length<s)throw Error("digestInto() expects output buffer of length at least "+s)}const c="object"==typeof t&&"crypto"in t?t.crypto:void 0;
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function a(t){return t instanceof Uint8Array||null!=t&&"object"==typeof t&&"Uint8Array"===t.constructor.name}const d=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),l=(t,e)=>t<<32-e|t>>>e;if(!(68===new Uint8Array(new Uint32Array([287454020]).buffer)[0]))throw Error("Non little-endian hardware is not supported");function b(t){if("string"!=typeof t)throw Error("utf8ToBytes expected string, got "+typeof t);return new Uint8Array((new TextEncoder).encode(t))}function u(t){if("string"==typeof t&&(t=b(t)),!a(t))throw Error("expected Uint8Array, got "+typeof t);return t}function p(...t){let e=0;for(let s=0;s<t.length;s++){const i=t[s];if(!a(i))throw Error("Uint8Array expected");e+=i.length}const s=new Uint8Array(e);for(let e=0,i=0;e<t.length;e++){const r=t[e];s.set(r,i),i+=r.length}return s}class x{clone(){return this._cloneInto()}}function w(t){const e=e=>t().update(u(e)).digest(),s=t();return e.outputLen=s.outputLen,e.blockLen=s.blockLen,e.create=()=>t(),e}function g(t=32){if(c&&"function"==typeof c.getRandomValues)return c.getRandomValues(new Uint8Array(t));throw Error("crypto.getRandomValues must be defined")}e.setImplementation("undefined"!=typeof BigInt?s:i);class y extends x{constructor(t,e,s,i){super(),this.blockLen=t,this.outputLen=e,this.padOffset=s,this.isLE=i,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=d(this.buffer)}update(t){o(this);const{view:e,buffer:s,blockLen:i}=this,r=(t=u(t)).length;for(let n=0;n<r;){const h=Math.min(i-this.pos,r-n);if(h!==i)s.set(t.subarray(n,n+h),this.pos),this.pos+=h,n+=h,this.pos===i&&(this.process(e,0),this.pos=0);else{const e=d(t);for(;i<=r-n;n+=i)this.process(e,n)}}return this.length+=t.length,this.roundClean(),this}digestInto(t){o(this),f(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:r,isLE:n}=this;let{pos:h}=this;s[h++]=128,this.buffer.subarray(h).fill(0),this.padOffset>r-h&&(this.process(i,0),h=0);for(let t=h;t<r;t++)s[t]=0;!function(t,s,i,r){if("function"==typeof t.setBigUint64)return t.setBigUint64(s,BigInt(i.toString()),r);const n=Object.freeze(e.new(32)),h=Object.freeze(e.new(4294967295)),o=i.rightShift(n).bitwiseAnd(h).toNumber(),f=i.bitwiseAnd(h).toNumber(),c=r?4:0,a=r?0:4;t.setUint32(s+c,o,r),t.setUint32(s+a,f,r)}(i,r-8,e.new(8*this.length),n),this.process(i,0);const c=d(t),a=this.outputLen;if(a%4)throw Error("_sha2: outputLen should be aligned to 32bit");const l=a/4,b=this.get();if(l>b.length)throw Error("_sha2: outputLen bigger than state");for(let t=0;t<l;t++)c.setUint32(4*t,b[t],n)}digest(){const{buffer:t,outputLen:e}=this;this.digestInto(t);const s=t.slice(0,e);return this.destroy(),s}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:e,buffer:s,length:i,finished:r,destroyed:n,pos:h}=this;return t.length=i,t.pos=h,t.finished=r,t.destroyed=n,i%e&&t.buffer.set(s),t}}const L=(t,e,s)=>t&e^t&s^e&s,A=/* @__PURE__ */new Uint32Array([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([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),E=/* @__PURE__ */new Uint32Array(64);class B extends y{constructor(){super(64,32,8,!1),this.A=0|H[0],this.B=0|H[1],this.C=0|H[2],this.D=0|H[3],this.E=0|H[4],this.F=0|H[5],this.G=0|H[6],this.H=0|H[7]}get(){const{A:t,B:e,C:s,D:i,E:r,F:n,G:h,H:o}=this;return[t,e,s,i,r,n,h,o]}set(t,e,s,i,r,n,h,o){this.A=0|t,this.B=0|e,this.C=0|s,this.D=0|i,this.E=0|r,this.F=0|n,this.G=0|h,this.H=0|o}process(t,e){for(let s=0;s<16;s++,e+=4)E[s]=t.getUint32(e,!1);for(let t=16;t<64;t++){const e=E[t-15],s=E[t-2],i=l(e,7)^l(e,18)^e>>>3,r=l(s,17)^l(s,19)^s>>>10;E[t]=r+E[t-7]+i+E[t-16]|0}let{A:s,B:i,C:r,D:n,E:h,F:o,G:f,H:c}=this;for(let t=0;t<64;t++){const e=c+(l(h,6)^l(h,11)^l(h,25))+((a=h)&o^~a&f)+A[t]+E[t]|0,d=(l(s,2)^l(s,13)^l(s,22))+L(s,i,r)|0;c=f,f=o,o=h,h=n+e|0,n=r,r=i,i=s,s=e+d|0}var a;s=s+this.A|0,i=i+this.B|0,r=r+this.C|0,n=n+this.D|0,h=h+this.E|0,o=o+this.F|0,f=f+this.G|0,c=c+this.H|0,this.set(s,i,r,n,h,o,f,c)}roundClean(){E.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}class m extends B{constructor(){super(),this.A=-1056596264,this.B=914150663,this.C=812702999,this.D=-150054599,this.E=-4191439,this.F=1750603025,this.G=1694076839,this.H=-1090891868,this.outputLen=28}}const S=/* @__PURE__ */w((()=>new B)),U=/* @__PURE__ */w((()=>new m)),k=Object.freeze(e.new(2**32-1)),O=Object.freeze(e.new(32));function F(t,e=!1){return e?{h:t.bitwiseAnd(k).toNumber(),l:t.rightShift(O).bitwiseAnd(k).toNumber()}:{h:0|t.rightShift(O).bitwiseAnd(k).toNumber(),l:0|t.bitwiseAnd(k).toNumber()}}function C(t,e=!1){let s=new Uint32Array(t.length),i=new Uint32Array(t.length);for(let r=0;r<t.length;r++){const{h:n,l:h}=F(t[r],e);[s[r],i[r]]=[n,h]}return[s,i]}const D=(t,e,s)=>t<<s|e>>>32-s,G=(t,e,s)=>e<<s|t>>>32-s,j=(t,e,s)=>e<<s-32|t>>>64-s,I=(t,e,s)=>t<<s-32|e>>>64-s;const v={fromBig:F,split:C,toBig:(t,s)=>e.new(t>>>0).ileftShift(O).ibitwiseOr(e.new(s>>>0)),shrSH:(t,e,s)=>t>>>s,shrSL:(t,e,s)=>t<<32-s|e>>>s,rotrSH:(t,e,s)=>t>>>s|e<<32-s,rotrSL:(t,e,s)=>t<<32-s|e>>>s,rotrBH:(t,e,s)=>t<<64-s|e>>>s-32,rotrBL:(t,e,s)=>t>>>s-32|e<<64-s,rotr32H:(t,e)=>e,rotr32L:(t,e)=>t,rotlSH:D,rotlSL:G,rotlBH:j,rotlBL:I,add:function(t,e,s,i){const r=(e>>>0)+(i>>>0);return{h:t+s+(r/2**32|0)|0,l:0|r}},add3L:(t,e,s)=>(t>>>0)+(e>>>0)+(s>>>0),add3H:(t,e,s,i)=>e+s+i+(t/2**32|0)|0,add4L:(t,e,s,i)=>(t>>>0)+(e>>>0)+(s>>>0)+(i>>>0),add4H:(t,e,s,i,r)=>e+s+i+r+(t/2**32|0)|0,add5H:(t,e,s,i,r,n)=>e+s+i+r+n+(t/2**32|0)|0,add5L:(t,e,s,i,r)=>(t>>>0)+(e>>>0)+(s>>>0)+(i>>>0)+(r>>>0)},[z,N]=/* @__PURE__ */(()=>v.split(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map((t=>e.new(t)))))(),X=/* @__PURE__ */new Uint32Array(80),_=/* @__PURE__ */new Uint32Array(80);class M extends y{constructor(){super(128,64,16,!1),this.Ah=1779033703,this.Al=-205731576,this.Bh=-1150833019,this.Bl=-2067093701,this.Ch=1013904242,this.Cl=-23791573,this.Dh=-1521486534,this.Dl=1595750129,this.Eh=1359893119,this.El=-1377402159,this.Fh=-1694144372,this.Fl=725511199,this.Gh=528734635,this.Gl=-79577749,this.Hh=1541459225,this.Hl=327033209}get(){const{Ah:t,Al:e,Bh:s,Bl:i,Ch:r,Cl:n,Dh:h,Dl:o,Eh:f,El:c,Fh:a,Fl:d,Gh:l,Gl:b,Hh:u,Hl:p}=this;return[t,e,s,i,r,n,h,o,f,c,a,d,l,b,u,p]}set(t,e,s,i,r,n,h,o,f,c,a,d,l,b,u,p){this.Ah=0|t,this.Al=0|e,this.Bh=0|s,this.Bl=0|i,this.Ch=0|r,this.Cl=0|n,this.Dh=0|h,this.Dl=0|o,this.Eh=0|f,this.El=0|c,this.Fh=0|a,this.Fl=0|d,this.Gh=0|l,this.Gl=0|b,this.Hh=0|u,this.Hl=0|p}process(t,e){for(let s=0;s<16;s++,e+=4)X[s]=t.getUint32(e),_[s]=t.getUint32(e+=4);for(let t=16;t<80;t++){const e=0|X[t-15],s=0|_[t-15],i=v.rotrSH(e,s,1)^v.rotrSH(e,s,8)^v.shrSH(e,s,7),r=v.rotrSL(e,s,1)^v.rotrSL(e,s,8)^v.shrSL(e,s,7),n=0|X[t-2],h=0|_[t-2],o=v.rotrSH(n,h,19)^v.rotrBH(n,h,61)^v.shrSH(n,h,6),f=v.rotrSL(n,h,19)^v.rotrBL(n,h,61)^v.shrSL(n,h,6),c=v.add4L(r,f,_[t-7],_[t-16]),a=v.add4H(c,i,o,X[t-7],X[t-16]);X[t]=0|a,_[t]=0|c}let{Ah:s,Al:i,Bh:r,Bl:n,Ch:h,Cl:o,Dh:f,Dl:c,Eh:a,El:d,Fh:l,Fl:b,Gh:u,Gl:p,Hh:x,Hl:w}=this;for(let t=0;t<80;t++){const e=v.rotrSH(a,d,14)^v.rotrSH(a,d,18)^v.rotrBH(a,d,41),g=v.rotrSL(a,d,14)^v.rotrSL(a,d,18)^v.rotrBL(a,d,41),y=a&l^~a&u,L=d&b^~d&p,A=v.add5L(w,g,L,N[t],_[t]),H=v.add5H(A,x,e,y,z[t],X[t]),E=0|A,B=v.rotrSH(s,i,28)^v.rotrBH(s,i,34)^v.rotrBH(s,i,39),m=v.rotrSL(s,i,28)^v.rotrBL(s,i,34)^v.rotrBL(s,i,39),S=s&r^s&h^r&h,U=i&n^i&o^n&o;x=0|u,w=0|p,u=0|l,p=0|b,l=0|a,b=0|d,({h:a,l:d}=v.add(0|f,0|c,0|H,0|E)),f=0|h,c=0|o,h=0|r,o=0|n,r=0|s,n=0|i;const k=v.add3L(E,m,U);s=v.add3H(k,H,B,S),i=0|k}({h:s,l:i}=v.add(0|this.Ah,0|this.Al,0|s,0|i)),({h:r,l:n}=v.add(0|this.Bh,0|this.Bl,0|r,0|n)),({h,l:o}=v.add(0|this.Ch,0|this.Cl,0|h,0|o)),({h:f,l:c}=v.add(0|this.Dh,0|this.Dl,0|f,0|c)),({h:a,l:d}=v.add(0|this.Eh,0|this.El,0|a,0|d)),({h:l,l:b}=v.add(0|this.Fh,0|this.Fl,0|l,0|b)),({h:u,l:p}=v.add(0|this.Gh,0|this.Gl,0|u,0|p)),({h:x,l:w}=v.add(0|this.Hh,0|this.Hl,0|x,0|w)),this.set(s,i,r,n,h,o,f,c,a,d,l,b,u,p,x,w)}roundClean(){X.fill(0),_.fill(0)}destroy(){this.buffer.fill(0),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class V extends M{constructor(){super(),this.Ah=-876896931,this.Al=-1056596264,this.Bh=1654270250,this.Bl=914150663,this.Ch=-1856437926,this.Cl=812702999,this.Dh=355462360,this.Dl=-150054599,this.Eh=1731405415,this.El=-4191439,this.Fh=-1900787065,this.Fl=1750603025,this.Gh=-619958771,this.Gl=1694076839,this.Hh=1203062813,this.Hl=-1090891868,this.outputLen=48}}const R=/* @__PURE__ */w((()=>new M)),T=/* @__PURE__ */w((()=>new V)),[$,W,Z]=[[],[],[]],q=/* @__PURE__ */Object.freeze(e.new(0)),J=/* @__PURE__ */Object.freeze(e.new(1)),K=/* @__PURE__ */Object.freeze(e.new(2)),P=/* @__PURE__ */Object.freeze(e.new(7)),Q=/* @__PURE__ */Object.freeze(e.new(256)),Y=/* @__PURE__ */Object.freeze(e.new(113));for(let t=0,s=J,i=1,r=0;t<24;t++){[i,r]=[r,(2*i+3*r)%5],$.push(2*(5*r+i)),W.push((t+1)*(t+2)/2%64);const n=q.clone();for(let t=0;t<7;t++)s=s.leftShift(J).ixor(s.rightShift(P).imul(Y)).imod(Q),s.bitwiseAnd(K).isZero()||n.ixor(J.leftShift(J.leftShift(/* @__PURE__ */e.new(t)).idec()));Z.push(n)}const[tt,et]=/* @__PURE__ */C(Z,!0),st=(t,e,s)=>s>32?j(t,e,s):D(t,e,s),it=(t,e,s)=>s>32?I(t,e,s):G(t,e,s);class rt extends x{constructor(t,e,s,i=!1,n=24){if(super(),this.blockLen=t,this.suffix=e,this.outputLen=s,this.enableXOF=i,this.rounds=n,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,r(s),0>=this.blockLen||this.blockLen>=200)throw Error("Sha3 supports only keccak-f1600 function");var h;this.state=new Uint8Array(200),this.state32=(h=this.state,new Uint32Array(h.buffer,h.byteOffset,Math.floor(h.byteLength/4)))}keccak(){!function(t,e=24){const s=new Uint32Array(10);for(let i=24-e;i<24;i++){for(let e=0;e<10;e++)s[e]=t[e]^t[e+10]^t[e+20]^t[e+30]^t[e+40];for(let e=0;e<10;e+=2){const i=(e+8)%10,r=(e+2)%10,n=s[r],h=s[r+1],o=st(n,h,1)^s[i],f=it(n,h,1)^s[i+1];for(let s=0;s<50;s+=10)t[e+s]^=o,t[e+s+1]^=f}let e=t[2],r=t[3];for(let s=0;s<24;s++){const i=W[s],n=st(e,r,i),h=it(e,r,i),o=$[s];e=t[o],r=t[o+1],t[o]=n,t[o+1]=h}for(let e=0;e<50;e+=10){for(let i=0;i<10;i++)s[i]=t[e+i];for(let i=0;i<10;i++)t[e+i]^=~s[(i+2)%10]&s[(i+4)%10]}t[0]^=tt[i],t[1]^=et[i]}s.fill(0)}(this.state32,this.rounds),this.posOut=0,this.pos=0}update(t){o(this);const{blockLen:e,state:s}=this,i=(t=u(t)).length;for(let r=0;r<i;){const n=Math.min(e-this.pos,i-r);for(let e=0;e<n;e++)s[this.pos++]^=t[r++];this.pos===e&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:e,pos:s,blockLen:i}=this;t[s]^=e,0!=(128&e)&&s===i-1&&this.keccak(),t[i-1]^=128,this.keccak()}writeInto(t){o(this,!1),n(t),this.finish();const e=this.state,{blockLen:s}=this;for(let i=0,r=t.length;i<r;){this.posOut>=s&&this.keccak();const n=Math.min(s-this.posOut,r-i);t.set(e.subarray(this.posOut,this.posOut+n),i),this.posOut+=n,i+=n}return t}xofInto(t){if(!this.enableXOF)throw Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return r(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(f(t,this),this.finished)throw Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:e,suffix:s,outputLen:i,rounds:r,enableXOF:n}=this;return t||(t=new rt(e,s,i,n,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=s,t.outputLen=i,t.enableXOF=n,t.destroyed=this.destroyed,t}}const nt=(t,e,s)=>w((()=>new rt(e,t,s))),ht=/* @__PURE__ */nt(6,136,32),ot=/* @__PURE__ */nt(6,72,64),ft=/* @__PURE__ */((t,e,s)=>function(t){const e=(e,s)=>t(s).update(u(e)).digest(),s=t({});return e.outputLen=s.outputLen,e.blockLen=s.blockLen,e.create=e=>t(e),e}(((i={})=>new rt(e,t,void 0===i.dkLen?s:i.dkLen,!0))))(31,136,32);export{x as H,y as S,T as a,n as b,p as c,R as d,o as e,ft as f,U as g,h,ht as i,ot as j,g as r,S as s,u as t,b as u,w};
 //# sourceMappingURL=sha3.min.mjs.map

package/dist/lightweight/sha3.min.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"sha3.min.mjs","sources":["../../node_modules/@openpgp/noble-hashes/esm/_assert.js","../../node_modules/@openpgp/noble-hashes/esm/cryptoBrowser.js","../../node_modules/@openpgp/noble-hashes/esm/utils.js","../../node_modules/@openpgp/noble-hashes/esm/biginteger/index.js","../../node_modules/@openpgp/noble-hashes/esm/_sha2.js","../../node_modules/@openpgp/noble-hashes/esm/sha256.js","../../node_modules/@openpgp/noble-hashes/esm/_u64.js","../../node_modules/@openpgp/noble-hashes/esm/sha512.js","../../node_modules/@openpgp/noble-hashes/esm/sha3.js"],"sourcesContent":["function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`Wrong positive integer: ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`Expected boolean, not ${b}`);\n}\nfunction bytes(b, ...lengths) {\n    if (!(b instanceof Uint8Array))\n        throw new Error('Expected Uint8Array');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(hash) {\n    if (typeof hash !== 'function' || typeof hash.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(hash.outputLen);\n    number(hash.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","// declare const globalThis: Record<string, any> | undefined;\nexport const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=cryptoBrowser.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated, we can just drop the import.\nimport { crypto } from './crypto.js';\nconst u8a = (a) => a instanceof Uint8Array;\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n    throw new Error('Non little-endian hardware is not supported');\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    if (!u8a(data))\n        throw new Error(`expected Uint8Array, got ${typeof data}`);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\n// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","import BigInteger from './interface.js';\nimport NativeBigInteger from './native.interface.js';\nimport FallbackBigInteger from './bn.interface.js';\nconst detectBigInt = () => typeof BigInt !== 'undefined';\nBigInteger.setImplementation(detectBigInt() ? NativeBigInteger : FallbackBigInteger);\nexport { BigInteger, BigInteger as default };\n// About BigInteger interface and bigint replacement:\n// - some functions get a bigint and change its value without reassingment (eg i++). Note that with BigIntegers, you must clone the value before doing so!!!\n//# sourceMappingURL=index.js.map","import { exists, output } from './_assert.js';\nimport { BigInteger } from './biginteger/index.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari <= 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, BigInt(value.toString()), isLE);\n    const _32n = Object.freeze(BigInteger.new(32));\n    const _u32_max = Object.freeze(BigInteger.new(0xffffffff));\n    const wh = value.rightShift(_32n).bitwiseAnd(_u32_max).toNumber();\n    const wl = value.bitwiseAnd(_u32_max).toNumber();\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nexport class SHA2 extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        exists(this);\n        const { view, buffer, blockLen } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        exists(this);\n        output(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInteger.new(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_sha2.js.map","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = /* @__PURE__ */ new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends SHA2 {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n        this.F = IV[5] | 0;\n        this.G = IV[6] | 0;\n        this.H = IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","import { BigInteger } from './biginteger/index.js';\nconst U32_MASK64 = Object.freeze(BigInteger.new(2 ** 32 - 1));\nconst _32n = Object.freeze(BigInteger.new(32));\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n    if (le)\n        return { h: n.bitwiseAnd(U32_MASK64).toNumber(), l: n.rightShift(_32n).bitwiseAnd(U32_MASK64).toNumber() };\n    return { h: n.rightShift(_32n).bitwiseAnd(U32_MASK64).toNumber() | 0, l: n.bitwiseAnd(U32_MASK64).toNumber() | 0 };\n}\nfunction split(lst, le = false) {\n    let Ah = new Uint32Array(lst.length);\n    let Al = new Uint32Array(lst.length);\n    for (let i = 0; i < lst.length; i++) {\n        const { h, l } = fromBig(lst[i], le);\n        [Ah[i], Al[i]] = [h, l];\n    }\n    return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInteger.new(h >>> 0)\n    .ileftShift(_32n)\n    .ibitwiseOr(BigInteger.new(l >>> 0)));\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n    const l = (Al >>> 0) + (Bl >>> 0);\n    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\n// prettier-ignore\nconst u64 = {\n    fromBig, split, toBig,\n    shrSH, shrSL,\n    rotrSH, rotrSL, rotrBH, rotrBL,\n    rotr32H, rotr32L,\n    rotlSH, rotlSL, rotlBH, rotlBL,\n    add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","import { SHA2 } from './_sha2.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\nimport BigInteger from './biginteger/index.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([\n    '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n    '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n    '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n    '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n    '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n    '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n    '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n    '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n    '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n    '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n    '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n    '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n    '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n    '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n    '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n    '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n    '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n    '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n    '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n    '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInteger.new(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends SHA2 {\n    constructor() {\n        super(128, 64, 16, false);\n        // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n        // Also looks cleaner and easier to verify with spec.\n        // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x6a09e667 | 0;\n        this.Al = 0xf3bcc908 | 0;\n        this.Bh = 0xbb67ae85 | 0;\n        this.Bl = 0x84caa73b | 0;\n        this.Ch = 0x3c6ef372 | 0;\n        this.Cl = 0xfe94f82b | 0;\n        this.Dh = 0xa54ff53a | 0;\n        this.Dl = 0x5f1d36f1 | 0;\n        this.Eh = 0x510e527f | 0;\n        this.El = 0xade682d1 | 0;\n        this.Fh = 0x9b05688c | 0;\n        this.Fl = 0x2b3e6c1f | 0;\n        this.Gh = 0x1f83d9ab | 0;\n        this.Gl = 0xfb41bd6b | 0;\n        this.Hh = 0x5be0cd19 | 0;\n        this.Hl = 0x137e2179 | 0;\n    }\n    // prettier-ignore\n    get() {\n        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n    }\n    // prettier-ignore\n    set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n        this.Ah = Ah | 0;\n        this.Al = Al | 0;\n        this.Bh = Bh | 0;\n        this.Bl = Bl | 0;\n        this.Ch = Ch | 0;\n        this.Cl = Cl | 0;\n        this.Dh = Dh | 0;\n        this.Dl = Dl | 0;\n        this.Eh = Eh | 0;\n        this.El = El | 0;\n        this.Fh = Fh | 0;\n        this.Fl = Fl | 0;\n        this.Gh = Gh | 0;\n        this.Gl = Gl | 0;\n        this.Hh = Hh | 0;\n        this.Hl = Hl | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4) {\n            SHA512_W_H[i] = view.getUint32(offset);\n            SHA512_W_L[i] = view.getUint32((offset += 4));\n        }\n        for (let i = 16; i < 80; i++) {\n            // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n            const W15h = SHA512_W_H[i - 15] | 0;\n            const W15l = SHA512_W_L[i - 15] | 0;\n            const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n            const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n            // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n            const W2h = SHA512_W_H[i - 2] | 0;\n            const W2l = SHA512_W_L[i - 2] | 0;\n            const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n            const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n            SHA512_W_H[i] = SUMh | 0;\n            SHA512_W_L[i] = SUMl | 0;\n        }\n        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        // Compression function main loop, 80 rounds\n        for (let i = 0; i < 80; i++) {\n            // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n            const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n            const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n            //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n            const CHIl = (El & Fl) ^ (~El & Gl);\n            // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n            // prettier-ignore\n            const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n            const T1l = T1ll | 0;\n            // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n            const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n            const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n            const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n            const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n            Hh = Gh | 0;\n            Hl = Gl | 0;\n            Gh = Fh | 0;\n            Gl = Fl | 0;\n            Fh = Eh | 0;\n            Fl = El | 0;\n            ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n            Dh = Ch | 0;\n            Dl = Cl | 0;\n            Ch = Bh | 0;\n            Cl = Bl | 0;\n            Bh = Ah | 0;\n            Bl = Al | 0;\n            const All = u64.add3L(T1l, sigma0l, MAJl);\n            Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n            Al = All | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n    }\n    roundClean() {\n        SHA512_W_H.fill(0);\n        SHA512_W_L.fill(0);\n    }\n    destroy() {\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\nclass SHA512_224 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x8c3d37c8 | 0;\n        this.Al = 0x19544da2 | 0;\n        this.Bh = 0x73e19966 | 0;\n        this.Bl = 0x89dcd4d6 | 0;\n        this.Ch = 0x1dfab7ae | 0;\n        this.Cl = 0x32ff9c82 | 0;\n        this.Dh = 0x679dd514 | 0;\n        this.Dl = 0x582f9fcf | 0;\n        this.Eh = 0x0f6d2b69 | 0;\n        this.El = 0x7bd44da8 | 0;\n        this.Fh = 0x77e36f73 | 0;\n        this.Fl = 0x04c48942 | 0;\n        this.Gh = 0x3f9d85a8 | 0;\n        this.Gl = 0x6a1d36c8 | 0;\n        this.Hh = 0x1112e6ad | 0;\n        this.Hl = 0x91d692a1 | 0;\n        this.outputLen = 28;\n    }\n}\nclass SHA512_256 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x22312194 | 0;\n        this.Al = 0xfc2bf72c | 0;\n        this.Bh = 0x9f555fa3 | 0;\n        this.Bl = 0xc84c64c2 | 0;\n        this.Ch = 0x2393b86b | 0;\n        this.Cl = 0x6f53b151 | 0;\n        this.Dh = 0x96387719 | 0;\n        this.Dl = 0x5940eabd | 0;\n        this.Eh = 0x96283ee2 | 0;\n        this.El = 0xa88effe3 | 0;\n        this.Fh = 0xbe5e1e25 | 0;\n        this.Fl = 0x53863992 | 0;\n        this.Gh = 0x2b0199fc | 0;\n        this.Gl = 0x2c85b8aa | 0;\n        this.Hh = 0x0eb72ddc | 0;\n        this.Hl = 0x81c52ca2 | 0;\n        this.outputLen = 32;\n    }\n}\nclass SHA384 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0xcbbb9d5d | 0;\n        this.Al = 0xc1059ed8 | 0;\n        this.Bh = 0x629a292a | 0;\n        this.Bl = 0x367cd507 | 0;\n        this.Ch = 0x9159015a | 0;\n        this.Cl = 0x3070dd17 | 0;\n        this.Dh = 0x152fecd8 | 0;\n        this.Dl = 0xf70e5939 | 0;\n        this.Eh = 0x67332667 | 0;\n        this.El = 0xffc00b31 | 0;\n        this.Fh = 0x8eb44a87 | 0;\n        this.Fl = 0x68581511 | 0;\n        this.Gh = 0xdb0c2e0d | 0;\n        this.Gl = 0x64f98fa7 | 0;\n        this.Hh = 0x47b5481d | 0;\n        this.Hl = 0xbefa4fa4 | 0;\n        this.outputLen = 48;\n    }\n}\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","import { bytes, exists, number, output } from './_assert.js';\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.js';\nimport { Hash, u32, toBytes, wrapConstructor, wrapXOFConstructorWithOpts, } from './utils.js';\nimport { BigInteger } from './biginteger/index.js';\n// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.\n// It's called a sponge function.\n// Various per round constants calculations\nconst [SHA3_PI, SHA3_ROTL, _SHA3_IOTA] = [[], [], []];\nconst _0n = /* @__PURE__ */ Object.freeze(BigInteger.new(0));\nconst _1n = /* @__PURE__ */ Object.freeze(BigInteger.new(1));\nconst _2n = /* @__PURE__ */ Object.freeze(BigInteger.new(2));\nconst _7n = /* @__PURE__ */ Object.freeze(BigInteger.new(7));\nconst _256n = /* @__PURE__ */ Object.freeze(BigInteger.new(256));\nconst _0x71n = /* @__PURE__ */ Object.freeze(BigInteger.new(0x71));\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n    // Pi\n    [x, y] = [y, (2 * x + 3 * y) % 5];\n    SHA3_PI.push(2 * (5 * y + x));\n    // Rotational\n    SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n    // Iota\n    const t = _0n.clone();\n    for (let j = 0; j < 7; j++) {\n        R = R.leftShift(_1n).ixor(R.rightShift(_7n).imul(_0x71n)).imod(_256n);\n        if (!R.bitwiseAnd(_2n).isZero())\n            t.ixor(_1n.leftShift(_1n.leftShift(/* @__PURE__ */ BigInteger.new(j)).idec()));\n    }\n    _SHA3_IOTA.push(t);\n}\nconst [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n// Same as keccakf1600, but allows to skip some rounds\nexport function keccakP(s, rounds = 24) {\n    const B = new Uint32Array(5 * 2);\n    // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n    for (let round = 24 - rounds; round < 24; round++) {\n        // Theta θ\n        for (let x = 0; x < 10; x++)\n            B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n        for (let x = 0; x < 10; x += 2) {\n            const idx1 = (x + 8) % 10;\n            const idx0 = (x + 2) % 10;\n            const B0 = B[idx0];\n            const B1 = B[idx0 + 1];\n            const Th = rotlH(B0, B1, 1) ^ B[idx1];\n            const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n            for (let y = 0; y < 50; y += 10) {\n                s[x + y] ^= Th;\n                s[x + y + 1] ^= Tl;\n            }\n        }\n        // Rho (ρ) and Pi (π)\n        let curH = s[2];\n        let curL = s[3];\n        for (let t = 0; t < 24; t++) {\n            const shift = SHA3_ROTL[t];\n            const Th = rotlH(curH, curL, shift);\n            const Tl = rotlL(curH, curL, shift);\n            const PI = SHA3_PI[t];\n            curH = s[PI];\n            curL = s[PI + 1];\n            s[PI] = Th;\n            s[PI + 1] = Tl;\n        }\n        // Chi (χ)\n        for (let y = 0; y < 50; y += 10) {\n            for (let x = 0; x < 10; x++)\n                B[x] = s[y + x];\n            for (let x = 0; x < 10; x++)\n                s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n        }\n        // Iota (ι)\n        s[0] ^= SHA3_IOTA_H[round];\n        s[1] ^= SHA3_IOTA_L[round];\n    }\n    B.fill(0);\n}\nexport class Keccak extends Hash {\n    // NOTE: we accept arguments in bytes instead of bits here.\n    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n        super();\n        this.blockLen = blockLen;\n        this.suffix = suffix;\n        this.outputLen = outputLen;\n        this.enableXOF = enableXOF;\n        this.rounds = rounds;\n        this.pos = 0;\n        this.posOut = 0;\n        this.finished = false;\n        this.destroyed = false;\n        // Can be passed from user as dkLen\n        number(outputLen);\n        // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes\n        if (0 >= this.blockLen || this.blockLen >= 200)\n            throw new Error('Sha3 supports only keccak-f1600 function');\n        this.state = new Uint8Array(200);\n        this.state32 = u32(this.state);\n    }\n    keccak() {\n        keccakP(this.state32, this.rounds);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        exists(this);\n        const { blockLen, state } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            for (let i = 0; i < take; i++)\n                state[this.pos++] ^= data[pos++];\n            if (this.pos === blockLen)\n                this.keccak();\n        }\n        return this;\n    }\n    finish() {\n        if (this.finished)\n            return;\n        this.finished = true;\n        const { state, suffix, pos, blockLen } = this;\n        // Do the padding\n        state[pos] ^= suffix;\n        if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n            this.keccak();\n        state[blockLen - 1] ^= 0x80;\n        this.keccak();\n    }\n    writeInto(out) {\n        exists(this, false);\n        bytes(out);\n        this.finish();\n        const bufferOut = this.state;\n        const { blockLen } = this;\n        for (let pos = 0, len = out.length; pos < len;) {\n            if (this.posOut >= blockLen)\n                this.keccak();\n            const take = Math.min(blockLen - this.posOut, len - pos);\n            out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n            this.posOut += take;\n            pos += take;\n        }\n        return out;\n    }\n    xofInto(out) {\n        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n        if (!this.enableXOF)\n            throw new Error('XOF is not possible for this instance');\n        return this.writeInto(out);\n    }\n    xof(bytes) {\n        number(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        output(out, this);\n        if (this.finished)\n            throw new Error('digest() was already called');\n        this.writeInto(out);\n        this.destroy();\n        return out;\n    }\n    digest() {\n        return this.digestInto(new Uint8Array(this.outputLen));\n    }\n    destroy() {\n        this.destroyed = true;\n        this.state.fill(0);\n    }\n    _cloneInto(to) {\n        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n        to || (to = new Keccak(blockLen, suffix, outputLen, enableXOF, rounds));\n        to.state32.set(this.state32);\n        to.pos = this.pos;\n        to.posOut = this.posOut;\n        to.finished = this.finished;\n        to.rounds = rounds;\n        // Suffix can change in cSHAKE\n        to.suffix = suffix;\n        to.outputLen = outputLen;\n        to.enableXOF = enableXOF;\n        to.destroyed = this.destroyed;\n        return to;\n    }\n}\nconst gen = (suffix, blockLen, outputLen) => wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));\nexport const sha3_224 = /* @__PURE__ */ gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexport const sha3_256 = /* @__PURE__ */ gen(0x06, 136, 256 / 8);\nexport const sha3_384 = /* @__PURE__ */ gen(0x06, 104, 384 / 8);\nexport const sha3_512 = /* @__PURE__ */ gen(0x06, 72, 512 / 8);\nexport const keccak_224 = /* @__PURE__ */ gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexport const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);\nexport const keccak_384 = /* @__PURE__ */ gen(0x01, 104, 384 / 8);\nexport const keccak_512 = /* @__PURE__ */ gen(0x01, 72, 512 / 8);\nconst genShake = (suffix, blockLen, outputLen) => wrapXOFConstructorWithOpts((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nexport const shake128 = /* @__PURE__ */ genShake(0x1f, 168, 128 / 8);\nexport const shake256 = /* @__PURE__ */ genShake(0x1f, 136, 256 / 8);\n//# sourceMappingURL=sha3.js.map"],"names":["number","n","Number","isSafeInteger","Error","bytes","b","lengths","Uint8Array","length","includes","hash","create","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","output","out","min","crypto","globalThis","undefined","u8a","a","createView","arr","DataView","buffer","byteOffset","byteLength","rotr","word","shift","Uint32Array","utf8ToBytes","str","TextEncoder","encode","toBytes","data","concatBytes","arrays","r","reduce","sum","pad","forEach","set","Hash","clone","this","_cloneInto","wrapConstructor","hashCons","hashC","msg","update","digest","tmp","randomBytes","bytesLength","getRandomValues","BigInteger","setImplementation","BigInt","NativeBigInteger","FallbackBigInteger","SHA2","constructor","padOffset","isLE","super","pos","view","len","take","Math","subarray","process","dataView","roundClean","digestInto","fill","i","value","setBigUint64","toString","_32n","Object","freeze","new","_u32_max","wh","rightShift","bitwiseAnd","toNumber","wl","h","l","setUint32","oview","outLen","state","get","res","slice","destroy","to","Maj","c","SHA256_K","IV","SHA256_W","SHA256","A","B","C","D","E","F","G","H","offset","getUint32","W15","W2","s0","s1","T1","T2","SHA224","sha256","sha224","U32_MASK64","fromBig","le","split","lst","Ah","Al","rotlSH","s","rotlSL","rotlBH","rotlBL","u64$1","toBig","ileftShift","ibitwiseOr","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","rotr32H","_h","rotr32L","add","Bh","Bl","add3L","Cl","add3H","low","Ch","add4L","Dl","add4H","Dh","add5H","Eh","add5L","El","SHA512_Kh","SHA512_Kl","u64","map","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","SHA384","sha512","sha384","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","_0n","_1n","_2n","_7n","_256n","_0x71n","round","R","x","y","push","t","j","leftShift","ixor","imul","imod","isZero","idec","SHA3_IOTA_H","SHA3_IOTA_L","rotlH","rotlL","Keccak","suffix","enableXOF","rounds","posOut","state32","floor","keccak","idx1","idx0","B0","B1","Th","Tl","curH","curL","PI","keccakP","finish","writeInto","bufferOut","xofInto","xof","gen","sha3_256","sha3_512","shake256","opts","wrapXOFConstructorWithOpts","dkLen","genShake"],"mappings":";qOAAA,SAASA,EAAOC,GACZ,IAAKC,OAAOC,cAAcF,IAAMA,EAAI,EAChC,MAAUG,MAAM,2BAA2BH,EACnD,CAKA,SAASI,EAAMC,KAAMC,GACjB,KAAMD,aAAaE,YACf,MAAUJ,MAAM,uBACpB,GAAIG,EAAQE,OAAS,IAAMF,EAAQG,SAASJ,EAAEG,QAC1C,MAAUL,MAAM,iCAAiCG,oBAA0BD,EAAEG,SACrF,CACA,SAASE,EAAKA,GACV,GAAoB,mBAATA,GAA8C,mBAAhBA,EAAKC,OAC1C,MAAUR,MAAM,mDACpBJ,EAAOW,EAAKE,WACZb,EAAOW,EAAKG,SAChB,CACA,SAASC,EAAOC,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAUd,MAAM,oCACpB,GAAIa,GAAiBD,EAASG,SAC1B,MAAUf,MAAM,wCACxB,CACA,SAASgB,EAAOC,EAAKL,GACjBX,EAAMgB,GACN,MAAMC,EAAMN,EAASH,UACrB,GAAIQ,EAAIZ,OAASa,EACb,MAAUlB,MAAM,yDAAyDkB,EAEjF,CC/BO,MAAMC,EAA+B,iBAAfC,GAA2B,WAAYA,EAAaA,EAAWD,YAASE,ECO/FC,EAAOC,GAAMA,aAAanB,WAKnBoB,EAAcC,GAAQ,IAAIC,SAASD,EAAIE,OAAQF,EAAIG,WAAYH,EAAII,YAEnEC,EAAO,CAACC,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC;sEAIxE,KADgF,KAA5D,IAAI5B,WAAW,IAAI6B,YAAY,CAAC,YAAaN,QAAQ,IAErE,MAAU3B,MAAM,+CAuDb,SAASkC,EAAYC,GACxB,GAAmB,iBAARA,EACP,MAAUnC,MAAM,2CAA2CmC,GAC/D,OAAO,IAAI/B,YAAW,IAAIgC,aAAcC,OAAOF,GACnD,CAMO,SAASG,EAAQC,GAGpB,GAFoB,iBAATA,IACPA,EAAOL,EAAYK,KAClBjB,EAAIiB,GACL,MAAUvC,MAAM,mCAAmCuC,GACvD,OAAOA,CACX,CAIO,SAASC,KAAeC,GAC3B,MAAMC,EAAI,IAAItC,WAAWqC,EAAOE,QAAO,CAACC,EAAKrB,IAAMqB,EAAMrB,EAAElB,QAAQ,IACnE,IAAIwC,EAAM,EAOV,OANAJ,EAAOK,SAASvB,IACZ,IAAKD,EAAIC,GACL,MAAUvB,MAAM,uBACpB0C,EAAEK,IAAIxB,EAAGsB,GACTA,GAAOtB,EAAElB,MAAM,IAEZqC,CACX,CAEO,MAAMM,EAETC,QACI,OAAOC,KAAKC,YACf,EASE,SAASC,EAAgBC,GAC5B,MAAMC,EAASC,GAAQF,IAAWG,OAAOlB,EAAQiB,IAAME,SACjDC,EAAML,IAIZ,OAHAC,EAAM7C,UAAYiD,EAAIjD,UACtB6C,EAAM5C,SAAWgD,EAAIhD,SACrB4C,EAAM9C,OAAS,IAAM6C,IACdC,CACX,CAoBO,SAASK,EAAYC,EAAc,IACtC,GAAIzC,GAA4C,mBAA3BA,EAAO0C,gBACxB,OAAO1C,EAAO0C,gBAAgB,IAAIzD,WAAWwD,IAEjD,MAAU5D,MAAM,yCACpB,CCpJA8D,EAAWC,kBADkC,oBAAXC,OACYC,EAAmBC,GCa1D,MAAMC,UAAanB,EACtBoB,YAAY1D,EAAUD,EAAW4D,EAAWC,GACxCC,QACArB,KAAKxC,SAAWA,EAChBwC,KAAKzC,UAAYA,EACjByC,KAAKmB,UAAYA,EACjBnB,KAAKoB,KAAOA,EACZpB,KAAKnC,UAAW,EAChBmC,KAAK7C,OAAS,EACd6C,KAAKsB,IAAM,EACXtB,KAAKpC,WAAY,EACjBoC,KAAKvB,OAAS,IAAIvB,WAAWM,GAC7BwC,KAAKuB,KAAOjD,EAAW0B,KAAKvB,OAC/B,CACD6B,OAAOjB,GACH5B,EAAOuC,MACP,MAAMuB,KAAEA,EAAI9C,OAAEA,EAAMjB,SAAEA,GAAawC,KAE7BwB,GADNnC,EAAOD,EAAQC,IACElC,OACjB,IAAK,IAAImE,EAAM,EAAGA,EAAME,GAAM,CAC1B,MAAMC,EAAOC,KAAK1D,IAAIR,EAAWwC,KAAKsB,IAAKE,EAAMF,GAEjD,GAAIG,IAASjE,EAMbiB,EAAOoB,IAAIR,EAAKsC,SAASL,EAAKA,EAAMG,GAAOzB,KAAKsB,KAChDtB,KAAKsB,KAAOG,EACZH,GAAOG,EACHzB,KAAKsB,MAAQ9D,IACbwC,KAAK4B,QAAQL,EAAM,GACnBvB,KAAKsB,IAAM,OAXf,CACI,MAAMO,EAAWvD,EAAWe,GAC5B,KAAO7B,GAAYgE,EAAMF,EAAKA,GAAO9D,EACjCwC,KAAK4B,QAAQC,EAAUP,EAE9B,CAQJ,CAGD,OAFAtB,KAAK7C,QAAUkC,EAAKlC,OACpB6C,KAAK8B,aACE9B,IACV,CACD+B,WAAWhE,GACPN,EAAOuC,MACPlC,EAAOC,EAAKiC,MACZA,KAAKnC,UAAW,EAIhB,MAAMY,OAAEA,EAAM8C,KAAEA,EAAI/D,SAAEA,EAAQ4D,KAAEA,GAASpB,KACzC,IAAIsB,IAAEA,GAAQtB,KAEdvB,EAAO6C,KAAS,IAChBtB,KAAKvB,OAAOkD,SAASL,GAAKU,KAAK,GAE3BhC,KAAKmB,UAAY3D,EAAW8D,IAC5BtB,KAAK4B,QAAQL,EAAM,GACnBD,EAAM,GAGV,IAAK,IAAIW,EAAIX,EAAKW,EAAIzE,EAAUyE,IAC5BxD,EAAOwD,GAAK,GAxExB,SAAsBV,EAAM7C,EAAYwD,EAAOd,GAC3C,GAAiC,mBAAtBG,EAAKY,aACZ,OAAOZ,EAAKY,aAAazD,EAAYoC,OAAOoB,EAAME,YAAahB,GACnE,MAAMiB,EAAOC,OAAOC,OAAO3B,EAAW4B,IAAI,KACpCC,EAAWH,OAAOC,OAAO3B,EAAW4B,IAAI,aACxCE,EAAKR,EAAMS,WAAWN,GAAMO,WAAWH,GAAUI,WACjDC,EAAKZ,EAAMU,WAAWH,GAAUI,WAChCE,EAAI3B,EAAO,EAAI,EACf4B,EAAI5B,EAAO,EAAI,EACrBG,EAAK0B,UAAUvE,EAAaqE,EAAGL,EAAItB,GACnCG,EAAK0B,UAAUvE,EAAasE,EAAGF,EAAI1B,EACvC,CAiEQe,CAAaZ,EAAM/D,EAAW,EAAGoD,EAAW4B,IAAkB,EAAdxC,KAAK7C,QAAaiE,GAClEpB,KAAK4B,QAAQL,EAAM,GACnB,MAAM2B,EAAQ5E,EAAWP,GACnByD,EAAMxB,KAAKzC,UAEjB,GAAIiE,EAAM,EACN,MAAU1E,MAAM,+CACpB,MAAMqG,EAAS3B,EAAM,EACf4B,EAAQpD,KAAKqD,MACnB,GAAIF,EAASC,EAAMjG,OACf,MAAUL,MAAM,sCACpB,IAAK,IAAImF,EAAI,EAAGA,EAAIkB,EAAQlB,IACxBiB,EAAMD,UAAU,EAAIhB,EAAGmB,EAAMnB,GAAIb,EACxC,CACDb,SACI,MAAM9B,OAAEA,EAAMlB,UAAEA,GAAcyC,KAC9BA,KAAK+B,WAAWtD,GAChB,MAAM6E,EAAM7E,EAAO8E,MAAM,EAAGhG,GAE5B,OADAyC,KAAKwD,UACEF,CACV,CACDrD,WAAWwD,GACPA,IAAOA,EAAK,IAAIzD,KAAKkB,aACrBuC,EAAG5D,OAAOG,KAAKqD,OACf,MAAM7F,SAAEA,EAAQiB,OAAEA,EAAMtB,OAAEA,EAAMU,SAAEA,EAAQD,UAAEA,EAAS0D,IAAEA,GAAQtB,KAO/D,OANAyD,EAAGtG,OAASA,EACZsG,EAAGnC,IAAMA,EACTmC,EAAG5F,SAAWA,EACd4F,EAAG7F,UAAYA,EACXT,EAASK,GACTiG,EAAGhF,OAAOoB,IAAIpB,GACXgF,CACV,EC3GL,MAEMC,EAAM,CAACrF,EAAGrB,EAAG2G,IAAOtF,EAAIrB,EAAMqB,EAAIsF,EAAM3G,EAAI2G,EAI5CC,EAA2B,IAAI7E,YAAY,CAC7C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAIlF8E,EAAqB,IAAI9E,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlF+E,EAA2B,IAAI/E,YAAY,IACjD,MAAMgF,UAAe9C,EACjBC,cACIG,MAAM,GAAI,GAAI,GAAG,GAGjBrB,KAAKgE,EAAY,EAARH,EAAG,GACZ7D,KAAKiE,EAAY,EAARJ,EAAG,GACZ7D,KAAKkE,EAAY,EAARL,EAAG,GACZ7D,KAAKmE,EAAY,EAARN,EAAG,GACZ7D,KAAKoE,EAAY,EAARP,EAAG,GACZ7D,KAAKqE,EAAY,EAARR,EAAG,GACZ7D,KAAKsE,EAAY,EAART,EAAG,GACZ7D,KAAKuE,EAAY,EAARV,EAAG,EACf,CACDR,MACI,MAAMW,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMvE,KACnC,MAAO,CAACgE,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAChC,CAED1E,IAAImE,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrBvE,KAAKgE,EAAQ,EAAJA,EACThE,KAAKiE,EAAQ,EAAJA,EACTjE,KAAKkE,EAAQ,EAAJA,EACTlE,KAAKmE,EAAQ,EAAJA,EACTnE,KAAKoE,EAAQ,EAAJA,EACTpE,KAAKqE,EAAQ,EAAJA,EACTrE,KAAKsE,EAAQ,EAAJA,EACTtE,KAAKuE,EAAQ,EAAJA,CACZ,CACD3C,QAAQL,EAAMiD,GAEV,IAAK,IAAIvC,EAAI,EAAGA,EAAI,GAAIA,IAAKuC,GAAU,EACnCV,EAAS7B,GAAKV,EAAKkD,UAAUD,GAAQ,GACzC,IAAK,IAAIvC,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMyC,EAAMZ,EAAS7B,EAAI,IACnB0C,EAAKb,EAAS7B,EAAI,GAClB2C,EAAKhG,EAAK8F,EAAK,GAAK9F,EAAK8F,EAAK,IAAOA,IAAQ,EAC7CG,EAAKjG,EAAK+F,EAAI,IAAM/F,EAAK+F,EAAI,IAAOA,IAAO,GACjDb,EAAS7B,GAAM4C,EAAKf,EAAS7B,EAAI,GAAK2C,EAAKd,EAAS7B,EAAI,IAAO,CAClE,CAED,IAAI+B,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMvE,KACjC,IAAK,IAAIiC,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACM6C,EAAMP,GADG3F,EAAKwF,EAAG,GAAKxF,EAAKwF,EAAG,IAAMxF,EAAKwF,EAAG,OAnEjD/F,EAoE4B+F,GAAGC,GApEPhG,EAoEUiG,GAAKV,EAAS3B,GAAK6B,EAAS7B,GAAM,EAE/D8C,GADSnG,EAAKoF,EAAG,GAAKpF,EAAKoF,EAAG,IAAMpF,EAAKoF,EAAG,KAC7BN,EAAIM,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CACnB,CA/EG,IAAC1G,EAiFL2F,EAAKA,EAAIhE,KAAKgE,EAAK,EACnBC,EAAKA,EAAIjE,KAAKiE,EAAK,EACnBC,EAAKA,EAAIlE,KAAKkE,EAAK,EACnBC,EAAKA,EAAInE,KAAKmE,EAAK,EACnBC,EAAKA,EAAIpE,KAAKoE,EAAK,EACnBC,EAAKA,EAAIrE,KAAKqE,EAAK,EACnBC,EAAKA,EAAItE,KAAKsE,EAAK,EACnBC,EAAKA,EAAIvE,KAAKuE,EAAK,EACnBvE,KAAKH,IAAImE,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CACDzC,aACIgC,EAAS9B,KAAK,EACjB,CACDwB,UACIxD,KAAKH,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BG,KAAKvB,OAAOuD,KAAK,EACpB,EAGL,MAAMgD,UAAejB,EACjB7C,cACIG,QACArB,KAAKgE,GAAI,WACThE,KAAKiE,EAAI,UACTjE,KAAKkE,EAAI,UACTlE,KAAKmE,GAAI,UACTnE,KAAKoE,GAAI,QACTpE,KAAKqE,EAAI,WACTrE,KAAKsE,EAAI,WACTtE,KAAKuE,GAAI,WACTvE,KAAKzC,UAAY,EACpB,EAMO,MAAC0H,EAAyB/E,GAAgB,IAAM,IAAI6D,IACnDmB,EAAyBhF,GAAgB,IAAM,IAAI8E,IC3H1DG,EAAa7C,OAAOC,OAAO3B,EAAW4B,IAAI,GAAK,GAAK,IACpDH,EAAOC,OAAOC,OAAO3B,EAAW4B,IAAI,KAE1C,SAAS4C,EAAQzI,EAAG0I,GAAK,GACrB,OAAIA,EACO,CAAEtC,EAAGpG,EAAEiG,WAAWuC,GAAYtC,WAAYG,EAAGrG,EAAEgG,WAAWN,GAAMO,WAAWuC,GAAYtC,YAC3F,CAAEE,EAA0D,EAAvDpG,EAAEgG,WAAWN,GAAMO,WAAWuC,GAAYtC,WAAgBG,EAAyC,EAAtCrG,EAAEiG,WAAWuC,GAAYtC,WACtG,CACA,SAASyC,EAAMC,EAAKF,GAAK,GACrB,IAAIG,EAAK,IAAIzG,YAAYwG,EAAIpI,QACzBsI,EAAK,IAAI1G,YAAYwG,EAAIpI,QAC7B,IAAK,IAAI8E,EAAI,EAAGA,EAAIsD,EAAIpI,OAAQ8E,IAAK,CACjC,MAAMc,EAAEA,EAACC,EAAEA,GAAMoC,EAAQG,EAAItD,GAAIoD,IAChCG,EAAGvD,GAAIwD,EAAGxD,IAAM,CAACc,EAAGC,EACxB,CACD,MAAO,CAACwC,EAAIC,EAChB,CACA,MAgBMC,EAAS,CAAC3C,EAAGC,EAAG2C,IAAO5C,GAAK4C,EAAM3C,IAAO,GAAK2C,EAC9CC,EAAS,CAAC7C,EAAGC,EAAG2C,IAAO3C,GAAK2C,EAAM5C,IAAO,GAAK4C,EAE9CE,EAAS,CAAC9C,EAAGC,EAAG2C,IAAO3C,GAAM2C,EAAI,GAAQ5C,IAAO,GAAK4C,EACrDG,EAAS,CAAC/C,EAAGC,EAAG2C,IAAO5C,GAAM4C,EAAI,GAAQ3C,IAAO,GAAK2C,EAyB3D,IAAAI,EARY,CACRX,UAASE,QAAOU,MAtCN,CAACjD,EAAGC,IAAOpC,EAAW4B,IAAIO,IAAM,GACzCkD,WAAW5D,GACX6D,WAAWtF,EAAW4B,IAAIQ,IAAM,IAqCjCmD,MAnCU,CAACpD,EAAGqD,EAAIT,IAAM5C,IAAM4C,EAmCvBU,MAlCG,CAACtD,EAAGC,EAAG2C,IAAO5C,GAAM,GAAK4C,EAAO3C,IAAM2C,EAmChDW,OAjCW,CAACvD,EAAGC,EAAG2C,IAAO5C,IAAM4C,EAAM3C,GAAM,GAAK2C,EAiCxCY,OAhCG,CAACxD,EAAGC,EAAG2C,IAAO5C,GAAM,GAAK4C,EAAO3C,IAAM2C,EAgCjCa,OA9BL,CAACzD,EAAGC,EAAG2C,IAAO5C,GAAM,GAAK4C,EAAO3C,IAAO2C,EAAI,GA8B9Bc,OA7Bb,CAAC1D,EAAGC,EAAG2C,IAAO5C,IAAO4C,EAAI,GAAQ3C,GAAM,GAAK2C,EA8BvDe,QA5BY,CAACC,EAAI3D,IAAMA,EA4Bd4D,QA3BG,CAAC7D,EAAGqD,IAAOrD,EA4BvB2C,SAAQE,SAAQC,SAAQC,SACxBe,IApBJ,SAAarB,EAAIC,EAAIqB,EAAIC,GACrB,MAAM/D,GAAKyC,IAAO,IAAMsB,IAAO,GAC/B,MAAO,CAAEhE,EAAIyC,EAAKsB,GAAO9D,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBSgE,MAfK,CAACvB,EAAIsB,EAAIE,KAAQxB,IAAO,IAAMsB,IAAO,IAAME,IAAO,GAehDC,MAdF,CAACC,EAAK3B,EAAIsB,EAAIM,IAAQ5B,EAAKsB,EAAKM,GAAOD,EAAM,GAAK,GAAM,GAAM,EAcrDE,MAbT,CAAC5B,EAAIsB,EAAIE,EAAIK,KAAQ7B,IAAO,IAAMsB,IAAO,IAAME,IAAO,IAAMK,IAAO,GAanDC,MAZhB,CAACJ,EAAK3B,EAAIsB,EAAIM,EAAII,IAAQhC,EAAKsB,EAAKM,EAAKI,GAAOL,EAAM,GAAK,GAAM,GAAM,EAYhDM,MAVvB,CAACN,EAAK3B,EAAIsB,EAAIM,EAAII,EAAIE,IAAQlC,EAAKsB,EAAKM,EAAKI,EAAKE,GAAOP,EAAM,GAAK,GAAM,GAAM,EAUlDQ,MAX9B,CAAClC,EAAIsB,EAAIE,EAAIK,EAAIM,KAAQnC,IAAO,IAAMsB,IAAO,IAAME,IAAO,IAAMK,IAAO,IAAMM,IAAO,IC5ClG,MAAOC,EAAWC,GAA6B,KAAOC,EAAIzC,MAAM,CAC5D,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,sBACpE0C,KAAIrL,GAAKiE,EAAW4B,IAAI7F,MArBqB,GAuBzCsL,EAA6B,IAAIlJ,YAAY,IAC7CmJ,EAA6B,IAAInJ,YAAY,IAC5C,MAAMoJ,UAAelH,EACxBC,cACIG,MAAM,IAAK,GAAI,IAAI,GAKnBrB,KAAKwF,GAAK,WACVxF,KAAKyF,IAAK,UACVzF,KAAK8G,IAAK,WACV9G,KAAK+G,IAAK,WACV/G,KAAKoH,GAAK,WACVpH,KAAKiH,IAAK,SACVjH,KAAKwH,IAAK,WACVxH,KAAKsH,GAAK,WACVtH,KAAK0H,GAAK,WACV1H,KAAK4H,IAAK,WACV5H,KAAKoI,IAAK,WACVpI,KAAKqI,GAAK,UACVrI,KAAKsI,GAAK,UACVtI,KAAKuI,IAAK,SACVvI,KAAKwI,GAAK,WACVxI,KAAKyI,GAAK,SACb,CAEDpF,MACI,MAAMmC,GAAEA,EAAEC,GAAEA,EAAEqB,GAAEA,EAAEC,GAAEA,EAAEK,GAAEA,EAAEH,GAAEA,EAAEO,GAAEA,EAAEF,GAAEA,EAAEI,GAAEA,EAAEE,GAAEA,EAAEQ,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOzI,KAC3E,MAAO,CAACwF,EAAIC,EAAIqB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIQ,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACvE,CAED5I,IAAI2F,EAAIC,EAAIqB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIQ,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5DzI,KAAKwF,GAAU,EAALA,EACVxF,KAAKyF,GAAU,EAALA,EACVzF,KAAK8G,GAAU,EAALA,EACV9G,KAAK+G,GAAU,EAALA,EACV/G,KAAKoH,GAAU,EAALA,EACVpH,KAAKiH,GAAU,EAALA,EACVjH,KAAKwH,GAAU,EAALA,EACVxH,KAAKsH,GAAU,EAALA,EACVtH,KAAK0H,GAAU,EAALA,EACV1H,KAAK4H,GAAU,EAALA,EACV5H,KAAKoI,GAAU,EAALA,EACVpI,KAAKqI,GAAU,EAALA,EACVrI,KAAKsI,GAAU,EAALA,EACVtI,KAAKuI,GAAU,EAALA,EACVvI,KAAKwI,GAAU,EAALA,EACVxI,KAAKyI,GAAU,EAALA,CACb,CACD7G,QAAQL,EAAMiD,GAEV,IAAK,IAAIvC,EAAI,EAAGA,EAAI,GAAIA,IAAKuC,GAAU,EACnCyD,EAAWhG,GAAKV,EAAKkD,UAAUD,GAC/B0D,EAAWjG,GAAKV,EAAKkD,UAAWD,GAAU,GAE9C,IAAK,IAAIvC,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAMyG,EAA4B,EAArBT,EAAWhG,EAAI,IACtB0G,EAA4B,EAArBT,EAAWjG,EAAI,IACtB2G,EAAMb,EAAIzB,OAAOoC,EAAMC,EAAM,GAAKZ,EAAIzB,OAAOoC,EAAMC,EAAM,GAAKZ,EAAI5B,MAAMuC,EAAMC,EAAM,GACpFE,EAAMd,EAAIxB,OAAOmC,EAAMC,EAAM,GAAKZ,EAAIxB,OAAOmC,EAAMC,EAAM,GAAKZ,EAAI1B,MAAMqC,EAAMC,EAAM,GAEpFG,EAA0B,EAApBb,EAAWhG,EAAI,GACrB8G,EAA0B,EAApBb,EAAWjG,EAAI,GACrB+G,EAAMjB,EAAIzB,OAAOwC,EAAKC,EAAK,IAAMhB,EAAIvB,OAAOsC,EAAKC,EAAK,IAAMhB,EAAI5B,MAAM2C,EAAKC,EAAK,GAChFE,EAAMlB,EAAIxB,OAAOuC,EAAKC,EAAK,IAAMhB,EAAItB,OAAOqC,EAAKC,EAAK,IAAMhB,EAAI1B,MAAMyC,EAAKC,EAAK,GAEhFG,EAAOnB,EAAIV,MAAMwB,EAAKI,EAAKf,EAAWjG,EAAI,GAAIiG,EAAWjG,EAAI,KAC7DkH,EAAOpB,EAAIR,MAAM2B,EAAMN,EAAKI,EAAKf,EAAWhG,EAAI,GAAIgG,EAAWhG,EAAI,KACzEgG,EAAWhG,GAAY,EAAPkH,EAChBjB,EAAWjG,GAAY,EAAPiH,CACnB,CACD,IAAI1D,GAAEA,EAAEC,GAAEA,EAAEqB,GAAEA,EAAEC,GAAEA,EAAEK,GAAEA,EAAEH,GAAEA,EAAEO,GAAEA,EAAEF,GAAEA,EAAEI,GAAEA,EAAEE,GAAEA,EAAEQ,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOzI,KAEzE,IAAK,IAAIiC,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAMmH,EAAUrB,EAAIzB,OAAOoB,EAAIE,EAAI,IAAMG,EAAIzB,OAAOoB,EAAIE,EAAI,IAAMG,EAAIvB,OAAOkB,EAAIE,EAAI,IAC/EyB,EAAUtB,EAAIxB,OAAOmB,EAAIE,EAAI,IAAMG,EAAIxB,OAAOmB,EAAIE,EAAI,IAAMG,EAAItB,OAAOiB,EAAIE,EAAI,IAE/E0B,EAAQ5B,EAAKU,GAAQV,EAAKY,EAC1BiB,EAAQ3B,EAAKS,GAAQT,EAAKW,EAG1BiB,EAAOzB,EAAIJ,MAAMc,EAAIY,EAASE,EAAMzB,EAAU7F,GAAIiG,EAAWjG,IAC7DwH,EAAM1B,EAAIN,MAAM+B,EAAMhB,EAAIY,EAASE,EAAMzB,EAAU5F,GAAIgG,EAAWhG,IAClEyH,EAAa,EAAPF,EAENG,EAAU5B,EAAIzB,OAAOd,EAAIC,EAAI,IAAMsC,EAAIvB,OAAOhB,EAAIC,EAAI,IAAMsC,EAAIvB,OAAOhB,EAAIC,EAAI,IAC/EmE,EAAU7B,EAAIxB,OAAOf,EAAIC,EAAI,IAAMsC,EAAItB,OAAOjB,EAAIC,EAAI,IAAMsC,EAAItB,OAAOjB,EAAIC,EAAI,IAC/EoE,EAAQrE,EAAKsB,EAAOtB,EAAK4B,EAAON,EAAKM,EACrC0C,EAAQrE,EAAKsB,EAAOtB,EAAKwB,EAAOF,EAAKE,EAC3CuB,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALV,EACLW,EAAU,EAALT,IACF7E,EAAG2E,EAAI1E,EAAG4E,GAAOG,EAAIlB,IAAS,EAALW,EAAa,EAALF,EAAc,EAANmC,EAAe,EAANC,IACrDlC,EAAU,EAALJ,EACLE,EAAU,EAALL,EACLG,EAAU,EAALN,EACLG,EAAU,EAALF,EACLD,EAAU,EAALtB,EACLuB,EAAU,EAALtB,EACL,MAAMsE,EAAMhC,EAAIf,MAAM0C,EAAKE,EAASE,GACpCtE,EAAKuC,EAAIb,MAAM6C,EAAKN,EAAKE,EAASE,GAClCpE,EAAW,EAANsE,CACR,GAEEhH,EAAGyC,EAAIxC,EAAGyC,GAAOsC,EAAIlB,IAAc,EAAV7G,KAAKwF,GAAkB,EAAVxF,KAAKyF,GAAa,EAALD,EAAa,EAALC,MAC3D1C,EAAG+D,EAAI9D,EAAG+D,GAAOgB,EAAIlB,IAAc,EAAV7G,KAAK8G,GAAkB,EAAV9G,KAAK+G,GAAa,EAALD,EAAa,EAALC,MAC3DhE,EAAOC,EAAGiE,GAAOc,EAAIlB,IAAc,EAAV7G,KAAKoH,GAAkB,EAAVpH,KAAKiH,GAAa,EAALG,EAAa,EAALH,MAC3DlE,EAAGyE,EAAIxE,EAAGsE,GAAOS,EAAIlB,IAAc,EAAV7G,KAAKwH,GAAkB,EAAVxH,KAAKsH,GAAa,EAALE,EAAa,EAALF,MAC3DvE,EAAG2E,EAAI1E,EAAG4E,GAAOG,EAAIlB,IAAc,EAAV7G,KAAK0H,GAAkB,EAAV1H,KAAK4H,GAAa,EAALF,EAAa,EAALE,MAC3D7E,EAAGqF,EAAIpF,EAAGqF,GAAON,EAAIlB,IAAc,EAAV7G,KAAKoI,GAAkB,EAAVpI,KAAKqI,GAAa,EAALD,EAAa,EAALC,MAC3DtF,EAAGuF,EAAItF,EAAGuF,GAAOR,EAAIlB,IAAc,EAAV7G,KAAKsI,GAAkB,EAAVtI,KAAKuI,GAAa,EAALD,EAAa,EAALC,MAC3DxF,EAAGyF,EAAIxF,EAAGyF,GAAOV,EAAIlB,IAAc,EAAV7G,KAAKwI,GAAkB,EAAVxI,KAAKyI,GAAa,EAALD,EAAa,EAALC,IAC9DzI,KAAKH,IAAI2F,EAAIC,EAAIqB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIQ,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CACD3G,aACImG,EAAWjG,KAAK,GAChBkG,EAAWlG,KAAK,EACnB,CACDwB,UACIxD,KAAKvB,OAAOuD,KAAK,GACjBhC,KAAKH,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACzD,EAgDL,MAAMmK,UAAe7B,EACjBjH,cACIG,QAEArB,KAAKwF,IAAK,UACVxF,KAAKyF,IAAK,WACVzF,KAAK8G,GAAK,WACV9G,KAAK+G,GAAK,UACV/G,KAAKoH,IAAK,WACVpH,KAAKiH,GAAK,UACVjH,KAAKwH,GAAK,UACVxH,KAAKsH,IAAK,UACVtH,KAAK0H,GAAK,WACV1H,KAAK4H,IAAK,QACV5H,KAAKoI,IAAK,WACVpI,KAAKqI,GAAK,WACVrI,KAAKsI,IAAK,UACVtI,KAAKuI,GAAK,WACVvI,KAAKwI,GAAK,WACVxI,KAAKyI,IAAK,WACVzI,KAAKzC,UAAY,EACpB,EAEO,MAAC0M,EAAyB/J,GAAgB,IAAM,IAAIiI,IAGnD+B,EAAyBhK,GAAgB,IAAM,IAAI8J,KC/NzDG,EAASC,EAAWC,GAAc,CAAC,GAAI,GAAI,IAC5CC,EAAsBhI,OAAOC,OAAO3B,EAAW4B,IAAI,IACnD+H,EAAsBjI,OAAOC,OAAO3B,EAAW4B,IAAI,IACnDgI,EAAsBlI,OAAOC,OAAO3B,EAAW4B,IAAI,IACnDiI,EAAsBnI,OAAOC,OAAO3B,EAAW4B,IAAI,IACnDkI,EAAwBpI,OAAOC,OAAO3B,EAAW4B,IAAI,MACrDmI,EAAyBrI,OAAOC,OAAO3B,EAAW4B,IAAI,MAC5D,IAAK,IAAIoI,EAAQ,EAAGC,EAAIN,EAAKO,EAAI,EAAGC,EAAI,EAAGH,EAAQ,GAAIA,IAAS,EAE3DE,EAAGC,GAAK,CAACA,GAAI,EAAID,EAAI,EAAIC,GAAK,GAC/BZ,EAAQa,KAAK,GAAK,EAAID,EAAID,IAE1BV,EAAUY,MAAQJ,EAAQ,IAAMA,EAAQ,GAAM,EAAK,IAEnD,MAAMK,EAAIX,EAAIvK,QACd,IAAK,IAAImL,EAAI,EAAGA,EAAI,EAAGA,IACnBL,EAAIA,EAAEM,UAAUZ,GAAKa,KAAKP,EAAElI,WAAW8H,GAAKY,KAAKV,IAASW,KAAKZ,GAC1DG,EAAEjI,WAAW4H,GAAKe,UACnBN,EAAEG,KAAKb,EAAIY,UAAUZ,EAAIY,UAA0BvK,EAAW4B,IAAI0I,IAAIM,SAE9EnB,EAAWW,KAAKC,EACpB,CACA,MAAOQ,GAAaC,IAA+BpG,EAAM+E,GAAY,GAE/DsB,GAAQ,CAAC5I,EAAGC,EAAG2C,IAAOA,EAAI,GAAKE,EAAO9C,EAAGC,EAAG2C,GAAKD,EAAO3C,EAAGC,EAAG2C,GAC9DiG,GAAQ,CAAC7I,EAAGC,EAAG2C,IAAOA,EAAI,GAAKG,EAAO/C,EAAGC,EAAG2C,GAAKC,EAAO7C,EAAGC,EAAG2C,GA+C7D,MAAMkG,WAAe/L,EAExBoB,YAAY1D,EAAUsO,EAAQvO,EAAWwO,GAAY,EAAOC,EAAS,IAcjE,GAbA3K,QACArB,KAAKxC,SAAWA,EAChBwC,KAAK8L,OAASA,EACd9L,KAAKzC,UAAYA,EACjByC,KAAK+L,UAAYA,EACjB/L,KAAKgM,OAASA,EACdhM,KAAKsB,IAAM,EACXtB,KAAKiM,OAAS,EACdjM,KAAKnC,UAAW,EAChBmC,KAAKpC,WAAY,EAEjBlB,EAAOa,GAEH,GAAKyC,KAAKxC,UAAYwC,KAAKxC,UAAY,IACvC,MAAUV,MAAM,4CNrFT,IAACyB,EMsFZyB,KAAKoD,MAAQ,IAAIlG,WAAW,KAC5B8C,KAAKkM,SNvFO3N,EMuFOyB,KAAKoD,MNvFJ,IAAIrE,YAAYR,EAAIE,OAAQF,EAAIG,WAAYgD,KAAKyK,MAAM5N,EAAII,WAAa,IMwF/F,CACDyN,UAlEG,SAAiBzG,EAAGqG,EAAS,IAChC,MAAM/H,EAAI,IAAIlF,YAAY,IAE1B,IAAK,IAAI6L,EAAQ,GAAKoB,EAAQpB,EAAQ,GAAIA,IAAS,CAE/C,IAAK,IAAIE,EAAI,EAAGA,EAAI,GAAIA,IACpB7G,EAAE6G,GAAKnF,EAAEmF,GAAKnF,EAAEmF,EAAI,IAAMnF,EAAEmF,EAAI,IAAMnF,EAAEmF,EAAI,IAAMnF,EAAEmF,EAAI,IAC5D,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC5B,MAAMuB,GAAQvB,EAAI,GAAK,GACjBwB,GAAQxB,EAAI,GAAK,GACjByB,EAAKtI,EAAEqI,GACPE,EAAKvI,EAAEqI,EAAO,GACdG,EAAKd,GAAMY,EAAIC,EAAI,GAAKvI,EAAEoI,GAC1BK,EAAKd,GAAMW,EAAIC,EAAI,GAAKvI,EAAEoI,EAAO,GACvC,IAAK,IAAItB,EAAI,EAAGA,EAAI,GAAIA,GAAK,GACzBpF,EAAEmF,EAAIC,IAAM0B,EACZ9G,EAAEmF,EAAIC,EAAI,IAAM2B,CAEvB,CAED,IAAIC,EAAOhH,EAAE,GACTiH,EAAOjH,EAAE,GACb,IAAK,IAAIsF,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMnM,EAAQsL,EAAUa,GAClBwB,EAAKd,GAAMgB,EAAMC,EAAM9N,GACvB4N,EAAKd,GAAMe,EAAMC,EAAM9N,GACvB+N,EAAK1C,EAAQc,GACnB0B,EAAOhH,EAAEkH,GACTD,EAAOjH,EAAEkH,EAAK,GACdlH,EAAEkH,GAAMJ,EACR9G,EAAEkH,EAAK,GAAKH,CACf,CAED,IAAK,IAAI3B,EAAI,EAAGA,EAAI,GAAIA,GAAK,GAAI,CAC7B,IAAK,IAAID,EAAI,EAAGA,EAAI,GAAIA,IACpB7G,EAAE6G,GAAKnF,EAAEoF,EAAID,GACjB,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,IACpBnF,EAAEoF,EAAID,KAAO7G,GAAG6G,EAAI,GAAK,IAAM7G,GAAG6G,EAAI,GAAK,GAClD,CAEDnF,EAAE,IAAM8F,GAAYb,GACpBjF,EAAE,IAAM+F,GAAYd,EACvB,CACD3G,EAAEjC,KAAK,EACX,CAuBQ8K,CAAQ9M,KAAKkM,QAASlM,KAAKgM,QAC3BhM,KAAKiM,OAAS,EACdjM,KAAKsB,IAAM,CACd,CACDhB,OAAOjB,GACH5B,EAAOuC,MACP,MAAMxC,SAAEA,EAAQ4F,MAAEA,GAAUpD,KAEtBwB,GADNnC,EAAOD,EAAQC,IACElC,OACjB,IAAK,IAAImE,EAAM,EAAGA,EAAME,GAAM,CAC1B,MAAMC,EAAOC,KAAK1D,IAAIR,EAAWwC,KAAKsB,IAAKE,EAAMF,GACjD,IAAK,IAAIW,EAAI,EAAGA,EAAIR,EAAMQ,IACtBmB,EAAMpD,KAAKsB,QAAUjC,EAAKiC,KAC1BtB,KAAKsB,MAAQ9D,GACbwC,KAAKoM,QACZ,CACD,OAAOpM,IACV,CACD+M,SACI,GAAI/M,KAAKnC,SACL,OACJmC,KAAKnC,UAAW,EAChB,MAAMuF,MAAEA,EAAK0I,OAAEA,EAAMxK,IAAEA,EAAG9D,SAAEA,GAAawC,KAEzCoD,EAAM9B,IAAQwK,EACU,IAAV,IAATA,IAAwBxK,IAAQ9D,EAAW,GAC5CwC,KAAKoM,SACThJ,EAAM5F,EAAW,IAAM,IACvBwC,KAAKoM,QACR,CACDY,UAAUjP,GACNN,EAAOuC,MAAM,GACbjD,EAAMgB,GACNiC,KAAK+M,SACL,MAAME,EAAYjN,KAAKoD,OACjB5F,SAAEA,GAAawC,KACrB,IAAK,IAAIsB,EAAM,EAAGE,EAAMzD,EAAIZ,OAAQmE,EAAME,GAAM,CACxCxB,KAAKiM,QAAUzO,GACfwC,KAAKoM,SACT,MAAM3K,EAAOC,KAAK1D,IAAIR,EAAWwC,KAAKiM,OAAQzK,EAAMF,GACpDvD,EAAI8B,IAAIoN,EAAUtL,SAAS3B,KAAKiM,OAAQjM,KAAKiM,OAASxK,GAAOH,GAC7DtB,KAAKiM,QAAUxK,EACfH,GAAOG,CACV,CACD,OAAO1D,CACV,CACDmP,QAAQnP,GAEJ,IAAKiC,KAAK+L,UACN,MAAUjP,MAAM,yCACpB,OAAOkD,KAAKgN,UAAUjP,EACzB,CACDoP,IAAIpQ,GAEA,OADAL,EAAOK,GACAiD,KAAKkN,QAAQ,IAAIhQ,WAAWH,GACtC,CACDgF,WAAWhE,GAEP,GADAD,EAAOC,EAAKiC,MACRA,KAAKnC,SACL,MAAUf,MAAM,+BAGpB,OAFAkD,KAAKgN,UAAUjP,GACfiC,KAAKwD,UACEzF,CACV,CACDwC,SACI,OAAOP,KAAK+B,WAAW,IAAI7E,WAAW8C,KAAKzC,WAC9C,CACDiG,UACIxD,KAAKpC,WAAY,EACjBoC,KAAKoD,MAAMpB,KAAK,EACnB,CACD/B,WAAWwD,GACP,MAAMjG,SAAEA,EAAQsO,OAAEA,EAAMvO,UAAEA,EAASyO,OAAEA,EAAMD,UAAEA,GAAc/L,KAY3D,OAXAyD,IAAOA,EAAK,IAAIoI,GAAOrO,EAAUsO,EAAQvO,EAAWwO,EAAWC,IAC/DvI,EAAGyI,QAAQrM,IAAIG,KAAKkM,SACpBzI,EAAGnC,IAAMtB,KAAKsB,IACdmC,EAAGwI,OAASjM,KAAKiM,OACjBxI,EAAG5F,SAAWmC,KAAKnC,SACnB4F,EAAGuI,OAASA,EAEZvI,EAAGqI,OAASA,EACZrI,EAAGlG,UAAYA,EACfkG,EAAGsI,UAAYA,EACftI,EAAG7F,UAAYoC,KAAKpC,UACb6F,CACV,EAEL,MAAM2J,GAAM,CAACtB,EAAQtO,EAAUD,IAAc2C,GAAgB,IAAM,IAAI2L,GAAOrO,EAAUsO,EAAQvO,KAMnF8P,GAA2BD,GAAI,EAAM,IAAK,IAE1CE,GAA2BF,GAAI,EAAM,GAAI,IAWzCG,GAFI,EAACzB,EAAQtO,EAAUD,INrE7B,SAAoC4C,GACvC,MAAMC,EAAQ,CAACC,EAAKmN,IAASrN,EAASqN,GAAMlN,OAAOlB,EAAQiB,IAAME,SAC3DC,EAAML,EAAS,CAAA,GAIrB,OAHAC,EAAM7C,UAAYiD,EAAIjD,UACtB6C,EAAM5C,SAAWgD,EAAIhD,SACrB4C,EAAM9C,OAAUkQ,GAASrN,EAASqN,GAC3BpN,CACX,CM8DkDqN,EAA2B,CAACD,EAAO,CAAE,IAAK,IAAI3B,GAAOrO,EAAUsO,OAAuB3N,IAAfqP,EAAKE,MAAsBnQ,EAAYiQ,EAAKE,OAAO,KAEpIC,CAAS,GAAM,IAAK","x_google_ignoreList":[0,1,2,3,4,5,6,7,8]}
+{"version":3,"file":"sha3.min.mjs","sources":["../../node_modules/@openpgp/noble-hashes/esm/_assert.js","../../node_modules/@openpgp/noble-hashes/esm/cryptoBrowser.js","../../node_modules/@openpgp/noble-hashes/esm/utils.js","../../node_modules/@openpgp/noble-hashes/esm/biginteger/index.js","../../node_modules/@openpgp/noble-hashes/esm/_sha2.js","../../node_modules/@openpgp/noble-hashes/esm/sha256.js","../../node_modules/@openpgp/noble-hashes/esm/_u64.js","../../node_modules/@openpgp/noble-hashes/esm/sha512.js","../../node_modules/@openpgp/noble-hashes/esm/sha3.js"],"sourcesContent":["function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`Wrong positive integer: ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`Expected boolean, not ${b}`);\n}\n// copied from utils\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Expected Uint8Array');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(hash) {\n    if (typeof hash !== 'function' || typeof hash.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(hash.outputLen);\n    number(hash.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","// declare const globalThis: Record<string, any> | undefined;\nexport const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=cryptoBrowser.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from './crypto.js';\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\n// Other libraries would silently corrupt the data instead of throwing an error,\n// when they don't support it.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n    throw new Error('Non little-endian hardware is not supported');\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!isBytes(bytes))\n        throw new Error('Uint8Array expected');\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2;\n    }\n    return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    if (!isBytes(data))\n        throw new Error(`expected Uint8Array, got ${typeof data}`);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        if (!isBytes(a))\n            throw new Error('Uint8Array expected');\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","import BigInteger from './interface.js';\nimport NativeBigInteger from './native.interface.js';\nimport FallbackBigInteger from './bn.interface.js';\nconst detectBigInt = () => typeof BigInt !== 'undefined';\nBigInteger.setImplementation(detectBigInt() ? NativeBigInteger : FallbackBigInteger);\nexport { BigInteger, BigInteger as default };\n// About BigInteger interface and bigint replacement:\n// - some functions get a bigint and change its value without reassingment (eg i++). Note that with BigIntegers, you must clone the value before doing so!!!\n//# sourceMappingURL=index.js.map","import { exists, output } from './_assert.js';\nimport { BigInteger } from './biginteger/index.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari <= 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, BigInt(value.toString()), isLE);\n    const _32n = Object.freeze(BigInteger.new(32));\n    const _u32_max = Object.freeze(BigInteger.new(0xffffffff));\n    const wh = value.rightShift(_32n).bitwiseAnd(_u32_max).toNumber();\n    const wl = value.bitwiseAnd(_u32_max).toNumber();\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nexport class SHA2 extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        exists(this);\n        const { view, buffer, blockLen } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        exists(this);\n        output(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInteger.new(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_sha2.js.map","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = /* @__PURE__ */ new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends SHA2 {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n        this.F = IV[5] | 0;\n        this.G = IV[6] | 0;\n        this.H = IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","import { BigInteger } from './biginteger/index.js';\nconst U32_MASK64 = Object.freeze(BigInteger.new(2 ** 32 - 1));\nconst _32n = Object.freeze(BigInteger.new(32));\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n    if (le)\n        return { h: n.bitwiseAnd(U32_MASK64).toNumber(), l: n.rightShift(_32n).bitwiseAnd(U32_MASK64).toNumber() };\n    return { h: n.rightShift(_32n).bitwiseAnd(U32_MASK64).toNumber() | 0, l: n.bitwiseAnd(U32_MASK64).toNumber() | 0 };\n}\nfunction split(lst, le = false) {\n    let Ah = new Uint32Array(lst.length);\n    let Al = new Uint32Array(lst.length);\n    for (let i = 0; i < lst.length; i++) {\n        const { h, l } = fromBig(lst[i], le);\n        [Ah[i], Al[i]] = [h, l];\n    }\n    return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInteger.new(h >>> 0)\n    .ileftShift(_32n)\n    .ibitwiseOr(BigInteger.new(l >>> 0)));\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n    const l = (Al >>> 0) + (Bl >>> 0);\n    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\n// prettier-ignore\nconst u64 = {\n    fromBig, split, toBig,\n    shrSH, shrSL,\n    rotrSH, rotrSL, rotrBH, rotrBL,\n    rotr32H, rotr32L,\n    rotlSH, rotlSL, rotlBH, rotlBL,\n    add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","import { SHA2 } from './_sha2.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\nimport BigInteger from './biginteger/index.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([\n    '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n    '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n    '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n    '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n    '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n    '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n    '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n    '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n    '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n    '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n    '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n    '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n    '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n    '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n    '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n    '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n    '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n    '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n    '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n    '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInteger.new(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends SHA2 {\n    constructor() {\n        super(128, 64, 16, false);\n        // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n        // Also looks cleaner and easier to verify with spec.\n        // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x6a09e667 | 0;\n        this.Al = 0xf3bcc908 | 0;\n        this.Bh = 0xbb67ae85 | 0;\n        this.Bl = 0x84caa73b | 0;\n        this.Ch = 0x3c6ef372 | 0;\n        this.Cl = 0xfe94f82b | 0;\n        this.Dh = 0xa54ff53a | 0;\n        this.Dl = 0x5f1d36f1 | 0;\n        this.Eh = 0x510e527f | 0;\n        this.El = 0xade682d1 | 0;\n        this.Fh = 0x9b05688c | 0;\n        this.Fl = 0x2b3e6c1f | 0;\n        this.Gh = 0x1f83d9ab | 0;\n        this.Gl = 0xfb41bd6b | 0;\n        this.Hh = 0x5be0cd19 | 0;\n        this.Hl = 0x137e2179 | 0;\n    }\n    // prettier-ignore\n    get() {\n        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n    }\n    // prettier-ignore\n    set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n        this.Ah = Ah | 0;\n        this.Al = Al | 0;\n        this.Bh = Bh | 0;\n        this.Bl = Bl | 0;\n        this.Ch = Ch | 0;\n        this.Cl = Cl | 0;\n        this.Dh = Dh | 0;\n        this.Dl = Dl | 0;\n        this.Eh = Eh | 0;\n        this.El = El | 0;\n        this.Fh = Fh | 0;\n        this.Fl = Fl | 0;\n        this.Gh = Gh | 0;\n        this.Gl = Gl | 0;\n        this.Hh = Hh | 0;\n        this.Hl = Hl | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4) {\n            SHA512_W_H[i] = view.getUint32(offset);\n            SHA512_W_L[i] = view.getUint32((offset += 4));\n        }\n        for (let i = 16; i < 80; i++) {\n            // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n            const W15h = SHA512_W_H[i - 15] | 0;\n            const W15l = SHA512_W_L[i - 15] | 0;\n            const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n            const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n            // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n            const W2h = SHA512_W_H[i - 2] | 0;\n            const W2l = SHA512_W_L[i - 2] | 0;\n            const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n            const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n            SHA512_W_H[i] = SUMh | 0;\n            SHA512_W_L[i] = SUMl | 0;\n        }\n        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        // Compression function main loop, 80 rounds\n        for (let i = 0; i < 80; i++) {\n            // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n            const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n            const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n            //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n            const CHIl = (El & Fl) ^ (~El & Gl);\n            // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n            // prettier-ignore\n            const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n            const T1l = T1ll | 0;\n            // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n            const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n            const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n            const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n            const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n            Hh = Gh | 0;\n            Hl = Gl | 0;\n            Gh = Fh | 0;\n            Gl = Fl | 0;\n            Fh = Eh | 0;\n            Fl = El | 0;\n            ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n            Dh = Ch | 0;\n            Dl = Cl | 0;\n            Ch = Bh | 0;\n            Cl = Bl | 0;\n            Bh = Ah | 0;\n            Bl = Al | 0;\n            const All = u64.add3L(T1l, sigma0l, MAJl);\n            Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n            Al = All | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n    }\n    roundClean() {\n        SHA512_W_H.fill(0);\n        SHA512_W_L.fill(0);\n    }\n    destroy() {\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\nclass SHA512_224 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x8c3d37c8 | 0;\n        this.Al = 0x19544da2 | 0;\n        this.Bh = 0x73e19966 | 0;\n        this.Bl = 0x89dcd4d6 | 0;\n        this.Ch = 0x1dfab7ae | 0;\n        this.Cl = 0x32ff9c82 | 0;\n        this.Dh = 0x679dd514 | 0;\n        this.Dl = 0x582f9fcf | 0;\n        this.Eh = 0x0f6d2b69 | 0;\n        this.El = 0x7bd44da8 | 0;\n        this.Fh = 0x77e36f73 | 0;\n        this.Fl = 0x04c48942 | 0;\n        this.Gh = 0x3f9d85a8 | 0;\n        this.Gl = 0x6a1d36c8 | 0;\n        this.Hh = 0x1112e6ad | 0;\n        this.Hl = 0x91d692a1 | 0;\n        this.outputLen = 28;\n    }\n}\nclass SHA512_256 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x22312194 | 0;\n        this.Al = 0xfc2bf72c | 0;\n        this.Bh = 0x9f555fa3 | 0;\n        this.Bl = 0xc84c64c2 | 0;\n        this.Ch = 0x2393b86b | 0;\n        this.Cl = 0x6f53b151 | 0;\n        this.Dh = 0x96387719 | 0;\n        this.Dl = 0x5940eabd | 0;\n        this.Eh = 0x96283ee2 | 0;\n        this.El = 0xa88effe3 | 0;\n        this.Fh = 0xbe5e1e25 | 0;\n        this.Fl = 0x53863992 | 0;\n        this.Gh = 0x2b0199fc | 0;\n        this.Gl = 0x2c85b8aa | 0;\n        this.Hh = 0x0eb72ddc | 0;\n        this.Hl = 0x81c52ca2 | 0;\n        this.outputLen = 32;\n    }\n}\nclass SHA384 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0xcbbb9d5d | 0;\n        this.Al = 0xc1059ed8 | 0;\n        this.Bh = 0x629a292a | 0;\n        this.Bl = 0x367cd507 | 0;\n        this.Ch = 0x9159015a | 0;\n        this.Cl = 0x3070dd17 | 0;\n        this.Dh = 0x152fecd8 | 0;\n        this.Dl = 0xf70e5939 | 0;\n        this.Eh = 0x67332667 | 0;\n        this.El = 0xffc00b31 | 0;\n        this.Fh = 0x8eb44a87 | 0;\n        this.Fl = 0x68581511 | 0;\n        this.Gh = 0xdb0c2e0d | 0;\n        this.Gl = 0x64f98fa7 | 0;\n        this.Hh = 0x47b5481d | 0;\n        this.Hl = 0xbefa4fa4 | 0;\n        this.outputLen = 48;\n    }\n}\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","import { bytes, exists, number, output } from './_assert.js';\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.js';\nimport { Hash, u32, toBytes, wrapConstructor, wrapXOFConstructorWithOpts, } from './utils.js';\nimport { BigInteger } from './biginteger/index.js';\n// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.\n// It's called a sponge function.\n// Various per round constants calculations\nconst [SHA3_PI, SHA3_ROTL, _SHA3_IOTA] = [[], [], []];\nconst _0n = /* @__PURE__ */ Object.freeze(BigInteger.new(0));\nconst _1n = /* @__PURE__ */ Object.freeze(BigInteger.new(1));\nconst _2n = /* @__PURE__ */ Object.freeze(BigInteger.new(2));\nconst _7n = /* @__PURE__ */ Object.freeze(BigInteger.new(7));\nconst _256n = /* @__PURE__ */ Object.freeze(BigInteger.new(256));\nconst _0x71n = /* @__PURE__ */ Object.freeze(BigInteger.new(0x71));\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n    // Pi\n    [x, y] = [y, (2 * x + 3 * y) % 5];\n    SHA3_PI.push(2 * (5 * y + x));\n    // Rotational\n    SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n    // Iota\n    const t = _0n.clone();\n    for (let j = 0; j < 7; j++) {\n        R = R.leftShift(_1n).ixor(R.rightShift(_7n).imul(_0x71n)).imod(_256n);\n        if (!R.bitwiseAnd(_2n).isZero())\n            t.ixor(_1n.leftShift(_1n.leftShift(/* @__PURE__ */ BigInteger.new(j)).idec()));\n    }\n    _SHA3_IOTA.push(t);\n}\nconst [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n// Same as keccakf1600, but allows to skip some rounds\nexport function keccakP(s, rounds = 24) {\n    const B = new Uint32Array(5 * 2);\n    // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n    for (let round = 24 - rounds; round < 24; round++) {\n        // Theta θ\n        for (let x = 0; x < 10; x++)\n            B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n        for (let x = 0; x < 10; x += 2) {\n            const idx1 = (x + 8) % 10;\n            const idx0 = (x + 2) % 10;\n            const B0 = B[idx0];\n            const B1 = B[idx0 + 1];\n            const Th = rotlH(B0, B1, 1) ^ B[idx1];\n            const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n            for (let y = 0; y < 50; y += 10) {\n                s[x + y] ^= Th;\n                s[x + y + 1] ^= Tl;\n            }\n        }\n        // Rho (ρ) and Pi (π)\n        let curH = s[2];\n        let curL = s[3];\n        for (let t = 0; t < 24; t++) {\n            const shift = SHA3_ROTL[t];\n            const Th = rotlH(curH, curL, shift);\n            const Tl = rotlL(curH, curL, shift);\n            const PI = SHA3_PI[t];\n            curH = s[PI];\n            curL = s[PI + 1];\n            s[PI] = Th;\n            s[PI + 1] = Tl;\n        }\n        // Chi (χ)\n        for (let y = 0; y < 50; y += 10) {\n            for (let x = 0; x < 10; x++)\n                B[x] = s[y + x];\n            for (let x = 0; x < 10; x++)\n                s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n        }\n        // Iota (ι)\n        s[0] ^= SHA3_IOTA_H[round];\n        s[1] ^= SHA3_IOTA_L[round];\n    }\n    B.fill(0);\n}\nexport class Keccak extends Hash {\n    // NOTE: we accept arguments in bytes instead of bits here.\n    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n        super();\n        this.blockLen = blockLen;\n        this.suffix = suffix;\n        this.outputLen = outputLen;\n        this.enableXOF = enableXOF;\n        this.rounds = rounds;\n        this.pos = 0;\n        this.posOut = 0;\n        this.finished = false;\n        this.destroyed = false;\n        // Can be passed from user as dkLen\n        number(outputLen);\n        // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes\n        if (0 >= this.blockLen || this.blockLen >= 200)\n            throw new Error('Sha3 supports only keccak-f1600 function');\n        this.state = new Uint8Array(200);\n        this.state32 = u32(this.state);\n    }\n    keccak() {\n        keccakP(this.state32, this.rounds);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        exists(this);\n        const { blockLen, state } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            for (let i = 0; i < take; i++)\n                state[this.pos++] ^= data[pos++];\n            if (this.pos === blockLen)\n                this.keccak();\n        }\n        return this;\n    }\n    finish() {\n        if (this.finished)\n            return;\n        this.finished = true;\n        const { state, suffix, pos, blockLen } = this;\n        // Do the padding\n        state[pos] ^= suffix;\n        if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n            this.keccak();\n        state[blockLen - 1] ^= 0x80;\n        this.keccak();\n    }\n    writeInto(out) {\n        exists(this, false);\n        bytes(out);\n        this.finish();\n        const bufferOut = this.state;\n        const { blockLen } = this;\n        for (let pos = 0, len = out.length; pos < len;) {\n            if (this.posOut >= blockLen)\n                this.keccak();\n            const take = Math.min(blockLen - this.posOut, len - pos);\n            out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n            this.posOut += take;\n            pos += take;\n        }\n        return out;\n    }\n    xofInto(out) {\n        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n        if (!this.enableXOF)\n            throw new Error('XOF is not possible for this instance');\n        return this.writeInto(out);\n    }\n    xof(bytes) {\n        number(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        output(out, this);\n        if (this.finished)\n            throw new Error('digest() was already called');\n        this.writeInto(out);\n        this.destroy();\n        return out;\n    }\n    digest() {\n        return this.digestInto(new Uint8Array(this.outputLen));\n    }\n    destroy() {\n        this.destroyed = true;\n        this.state.fill(0);\n    }\n    _cloneInto(to) {\n        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n        to || (to = new Keccak(blockLen, suffix, outputLen, enableXOF, rounds));\n        to.state32.set(this.state32);\n        to.pos = this.pos;\n        to.posOut = this.posOut;\n        to.finished = this.finished;\n        to.rounds = rounds;\n        // Suffix can change in cSHAKE\n        to.suffix = suffix;\n        to.outputLen = outputLen;\n        to.enableXOF = enableXOF;\n        to.destroyed = this.destroyed;\n        return to;\n    }\n}\nconst gen = (suffix, blockLen, outputLen) => wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));\nexport const sha3_224 = /* @__PURE__ */ gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexport const sha3_256 = /* @__PURE__ */ gen(0x06, 136, 256 / 8);\nexport const sha3_384 = /* @__PURE__ */ gen(0x06, 104, 384 / 8);\nexport const sha3_512 = /* @__PURE__ */ gen(0x06, 72, 512 / 8);\nexport const keccak_224 = /* @__PURE__ */ gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexport const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);\nexport const keccak_384 = /* @__PURE__ */ gen(0x01, 104, 384 / 8);\nexport const keccak_512 = /* @__PURE__ */ gen(0x01, 72, 512 / 8);\nconst genShake = (suffix, blockLen, outputLen) => wrapXOFConstructorWithOpts((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nexport const shake128 = /* @__PURE__ */ genShake(0x1f, 168, 128 / 8);\nexport const shake256 = /* @__PURE__ */ genShake(0x1f, 136, 256 / 8);\n//# sourceMappingURL=sha3.js.map"],"names":["number","n","Number","isSafeInteger","Error","bytes","b","lengths","a","Uint8Array","constructor","name","length","includes","hash","create","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","output","out","min","crypto","globalThis","undefined","isBytes","createView","arr","DataView","buffer","byteOffset","byteLength","rotr","word","shift","Uint32Array","utf8ToBytes","str","TextEncoder","encode","toBytes","data","concatBytes","arrays","sum","i","res","pad","set","Hash","clone","this","_cloneInto","wrapConstructor","hashCons","hashC","msg","update","digest","tmp","randomBytes","bytesLength","getRandomValues","BigInteger","setImplementation","BigInt","NativeBigInteger","FallbackBigInteger","SHA2","padOffset","isLE","super","pos","view","len","take","Math","subarray","process","dataView","roundClean","digestInto","fill","value","setBigUint64","toString","_32n","Object","freeze","new","_u32_max","wh","rightShift","bitwiseAnd","toNumber","wl","h","l","setUint32","oview","outLen","state","get","slice","destroy","to","Maj","c","SHA256_K","IV","SHA256_W","SHA256","A","B","C","D","E","F","G","H","offset","getUint32","W15","W2","s0","s1","T1","T2","SHA224","sha256","sha224","U32_MASK64","fromBig","le","split","lst","Ah","Al","rotlSH","s","rotlSL","rotlBH","rotlBL","u64","toBig","ileftShift","ibitwiseOr","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","rotr32H","_h","rotr32L","add","Bh","Bl","add3L","Cl","add3H","low","Ch","add4L","Dl","add4H","Dh","add5H","Eh","add5L","El","SHA512_Kh","SHA512_Kl","map","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","SHA384","sha512","sha384","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","_0n","_1n","_2n","_7n","_256n","_0x71n","round","R","x","y","push","t","j","leftShift","ixor","imul","imod","isZero","idec","SHA3_IOTA_H","SHA3_IOTA_L","rotlH","rotlL","Keccak","suffix","enableXOF","rounds","posOut","state32","floor","keccak","idx1","idx0","B0","B1","Th","Tl","curH","curL","PI","keccakP","finish","writeInto","bufferOut","xofInto","xof","gen","sha3_256","sha3_512","shake256","opts","wrapXOFConstructorWithOpts","dkLen","genShake"],"mappings":";qOAAA,SAASA,EAAOC,GACZ,IAAKC,OAAOC,cAAcF,IAAMA,EAAI,EAChC,MAAUG,MAAM,2BAA2BH,EACnD,CAUA,SAASI,EAAMC,KAAMC,GACjB,MALaC,EAKAF,aAJQG,YACX,MAALD,GAA0B,iBAANA,GAAyC,eAAvBA,EAAEE,YAAYC,MAIrD,MAAUP,MAAM,uBANxB,IAAiBI,EAOb,GAAID,EAAQK,OAAS,IAAML,EAAQM,SAASP,EAAEM,QAC1C,MAAUR,MAAM,iCAAiCG,oBAA0BD,EAAEM,SACrF,CACA,SAASE,EAAKA,GACV,GAAoB,mBAATA,GAA8C,mBAAhBA,EAAKC,OAC1C,MAAUX,MAAM,mDACpBJ,EAAOc,EAAKE,WACZhB,EAAOc,EAAKG,SAChB,CACA,SAASC,EAAOC,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAUjB,MAAM,oCACpB,GAAIgB,GAAiBD,EAASG,SAC1B,MAAUlB,MAAM,wCACxB,CACA,SAASmB,EAAOC,EAAKL,GACjBd,EAAMmB,GACN,MAAMC,EAAMN,EAASH,UACrB,GAAIQ,EAAIZ,OAASa,EACb,MAAUrB,MAAM,yDAAyDqB,EAEjF,CCpCO,MAAMC,EAA+B,iBAAfC,GAA2B,WAAYA,EAAaA,EAAWD,YAASE;sECUrG,SAASC,EAAQrB,GACb,OAAQA,aAAaC,YACX,MAALD,GAA0B,iBAANA,GAAyC,eAAvBA,EAAEE,YAAYC,IAC7D,CAEO,MAAMmB,EAAcC,GAAQ,IAAIC,SAASD,EAAIE,OAAQF,EAAIG,WAAYH,EAAII,YAEnEC,EAAO,CAACC,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAMxE,KADgF,KAA5D,IAAI7B,WAAW,IAAI8B,YAAY,CAAC,YAAaN,QAAQ,IAErE,MAAU7B,MAAM,+CAqEb,SAASoC,EAAYC,GACxB,GAAmB,iBAARA,EACP,MAAUrC,MAAM,2CAA2CqC,GAC/D,OAAO,IAAIhC,YAAW,IAAIiC,aAAcC,OAAOF,GACnD,CAMO,SAASG,EAAQC,GAGpB,GAFoB,iBAATA,IACPA,EAAOL,EAAYK,KAClBhB,EAAQgB,GACT,MAAUzC,MAAM,mCAAmCyC,GACvD,OAAOA,CACX,CAIO,SAASC,KAAeC,GAC3B,IAAIC,EAAM,EACV,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAOnC,OAAQqC,IAAK,CACpC,MAAMzC,EAAIuC,EAAOE,GACjB,IAAKpB,EAAQrB,GACT,MAAUJ,MAAM,uBACpB4C,GAAOxC,EAAEI,MACZ,CACD,MAAMsC,EAAM,IAAIzC,WAAWuC,GAC3B,IAAK,IAAIC,EAAI,EAAGE,EAAM,EAAGF,EAAIF,EAAOnC,OAAQqC,IAAK,CAC7C,MAAMzC,EAAIuC,EAAOE,GACjBC,EAAIE,IAAI5C,EAAG2C,GACXA,GAAO3C,EAAEI,MACZ,CACD,OAAOsC,CACX,CAEO,MAAMG,EAET,KAAAC,GACI,OAAOC,KAAKC,YACf,EASE,SAASC,EAAgBC,GAC5B,MAAMC,EAASC,GAAQF,IAAWG,OAAOjB,EAAQgB,IAAME,SACjDC,EAAML,IAIZ,OAHAC,EAAM3C,UAAY+C,EAAI/C,UACtB2C,EAAM1C,SAAW8C,EAAI9C,SACrB0C,EAAM5C,OAAS,IAAM2C,IACdC,CACX,CAoBO,SAASK,EAAYC,EAAc,IACtC,GAAIvC,GAA4C,mBAA3BA,EAAOwC,gBACxB,OAAOxC,EAAOwC,gBAAgB,IAAIzD,WAAWwD,IAEjD,MAAU7D,MAAM,yCACpB,CC5KA+D,EAAWC,kBADkC,oBAAXC,OACYC,EAAmBC,GCa1D,MAAMC,UAAanB,EACtB,WAAA3C,CAAYO,EAAUD,EAAWyD,EAAWC,GACxCC,QACApB,KAAKtC,SAAWA,EAChBsC,KAAKvC,UAAYA,EACjBuC,KAAKkB,UAAYA,EACjBlB,KAAKmB,KAAOA,EACZnB,KAAKjC,UAAW,EAChBiC,KAAK3C,OAAS,EACd2C,KAAKqB,IAAM,EACXrB,KAAKlC,WAAY,EACjBkC,KAAKtB,OAAS,IAAIxB,WAAWQ,GAC7BsC,KAAKsB,KAAO/C,EAAWyB,KAAKtB,OAC/B,CACD,MAAA4B,CAAOhB,GACH3B,EAAOqC,MACP,MAAMsB,KAAEA,EAAI5C,OAAEA,EAAMhB,SAAEA,GAAasC,KAE7BuB,GADNjC,EAAOD,EAAQC,IACEjC,OACjB,IAAK,IAAIgE,EAAM,EAAGA,EAAME,GAAM,CAC1B,MAAMC,EAAOC,KAAKvD,IAAIR,EAAWsC,KAAKqB,IAAKE,EAAMF,GAEjD,GAAIG,IAAS9D,EAMbgB,EAAOmB,IAAIP,EAAKoC,SAASL,EAAKA,EAAMG,GAAOxB,KAAKqB,KAChDrB,KAAKqB,KAAOG,EACZH,GAAOG,EACHxB,KAAKqB,MAAQ3D,IACbsC,KAAK2B,QAAQL,EAAM,GACnBtB,KAAKqB,IAAM,OAXf,CACI,MAAMO,EAAWrD,EAAWe,GAC5B,KAAO5B,GAAY6D,EAAMF,EAAKA,GAAO3D,EACjCsC,KAAK2B,QAAQC,EAAUP,EAE9B,CAQJ,CAGD,OAFArB,KAAK3C,QAAUiC,EAAKjC,OACpB2C,KAAK6B,aACE7B,IACV,CACD,UAAA8B,CAAW7D,GACPN,EAAOqC,MACPhC,EAAOC,EAAK+B,MACZA,KAAKjC,UAAW,EAIhB,MAAMW,OAAEA,EAAM4C,KAAEA,EAAI5D,SAAEA,EAAQyD,KAAEA,GAASnB,KACzC,IAAIqB,IAAEA,GAAQrB,KAEdtB,EAAO2C,KAAS,IAChBrB,KAAKtB,OAAOgD,SAASL,GAAKU,KAAK,GAE3B/B,KAAKkB,UAAYxD,EAAW2D,IAC5BrB,KAAK2B,QAAQL,EAAM,GACnBD,EAAM,GAGV,IAAK,IAAI3B,EAAI2B,EAAK3B,EAAIhC,EAAUgC,IAC5BhB,EAAOgB,GAAK,GAxExB,SAAsB4B,EAAM3C,EAAYqD,EAAOb,GAC3C,GAAiC,mBAAtBG,EAAKW,aACZ,OAAOX,EAAKW,aAAatD,EAAYmC,OAAOkB,EAAME,YAAaf,GACnE,MAAMgB,EAAOC,OAAOC,OAAOzB,EAAW0B,IAAI,KACpCC,EAAWH,OAAOC,OAAOzB,EAAW0B,IAAI,aACxCE,EAAKR,EAAMS,WAAWN,GAAMO,WAAWH,GAAUI,WACjDC,EAAKZ,EAAMU,WAAWH,GAAUI,WAChCE,EAAI1B,EAAO,EAAI,EACf2B,EAAI3B,EAAO,EAAI,EACrBG,EAAKyB,UAAUpE,EAAakE,EAAGL,EAAIrB,GACnCG,EAAKyB,UAAUpE,EAAamE,EAAGF,EAAIzB,EACvC,CAiEQc,CAAaX,EAAM5D,EAAW,EAAGkD,EAAW0B,IAAkB,EAAdtC,KAAK3C,QAAa8D,GAClEnB,KAAK2B,QAAQL,EAAM,GACnB,MAAM0B,EAAQzE,EAAWN,GACnBsD,EAAMvB,KAAKvC,UAEjB,GAAI8D,EAAM,EACN,MAAU1E,MAAM,+CACpB,MAAMoG,EAAS1B,EAAM,EACf2B,EAAQlD,KAAKmD,MACnB,GAAIF,EAASC,EAAM7F,OACf,MAAUR,MAAM,sCACpB,IAAK,IAAI6C,EAAI,EAAGA,EAAIuD,EAAQvD,IACxBsD,EAAMD,UAAU,EAAIrD,EAAGwD,EAAMxD,GAAIyB,EACxC,CACD,MAAAZ,GACI,MAAM7B,OAAEA,EAAMjB,UAAEA,GAAcuC,KAC9BA,KAAK8B,WAAWpD,GAChB,MAAMiB,EAAMjB,EAAO0E,MAAM,EAAG3F,GAE5B,OADAuC,KAAKqD,UACE1D,CACV,CACD,UAAAM,CAAWqD,GACPA,IAAOA,EAAK,IAAItD,KAAK7C,aACrBmG,EAAGzD,OAAOG,KAAKmD,OACf,MAAMzF,SAAEA,EAAQgB,OAAEA,EAAMrB,OAAEA,EAAMU,SAAEA,EAAQD,UAAEA,EAASuD,IAAEA,GAAQrB,KAO/D,OANAsD,EAAGjG,OAASA,EACZiG,EAAGjC,IAAMA,EACTiC,EAAGvF,SAAWA,EACduF,EAAGxF,UAAYA,EACXT,EAASK,GACT4F,EAAG5E,OAAOmB,IAAInB,GACX4E,CACV,EC3GL,MAEMC,EAAM,CAACtG,EAAGF,EAAGyG,IAAOvG,EAAIF,EAAME,EAAIuG,EAAMzG,EAAIyG,EAI5CC,iBAA2B,IAAIzE,YAAY,CAC7C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAIlF0E,iBAAqB,IAAI1E,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlF2E,iBAA2B,IAAI3E,YAAY,IACjD,MAAM4E,UAAe3C,EACjB,WAAA9D,GACIiE,MAAM,GAAI,GAAI,GAAG,GAGjBpB,KAAK6D,EAAY,EAARH,EAAG,GACZ1D,KAAK8D,EAAY,EAARJ,EAAG,GACZ1D,KAAK+D,EAAY,EAARL,EAAG,GACZ1D,KAAKgE,EAAY,EAARN,EAAG,GACZ1D,KAAKiE,EAAY,EAARP,EAAG,GACZ1D,KAAKkE,EAAY,EAARR,EAAG,GACZ1D,KAAKmE,EAAY,EAART,EAAG,GACZ1D,KAAKoE,EAAY,EAARV,EAAG,EACf,CACD,GAAAP,GACI,MAAMU,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMpE,KACnC,MAAO,CAAC6D,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAChC,CAED,GAAAvE,CAAIgE,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrBpE,KAAK6D,EAAQ,EAAJA,EACT7D,KAAK8D,EAAQ,EAAJA,EACT9D,KAAK+D,EAAQ,EAAJA,EACT/D,KAAKgE,EAAQ,EAAJA,EACThE,KAAKiE,EAAQ,EAAJA,EACTjE,KAAKkE,EAAQ,EAAJA,EACTlE,KAAKmE,EAAQ,EAAJA,EACTnE,KAAKoE,EAAQ,EAAJA,CACZ,CACD,OAAAzC,CAAQL,EAAM+C,GAEV,IAAK,IAAI3E,EAAI,EAAGA,EAAI,GAAIA,IAAK2E,GAAU,EACnCV,EAASjE,GAAK4B,EAAKgD,UAAUD,GAAQ,GACzC,IAAK,IAAI3E,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAM6E,EAAMZ,EAASjE,EAAI,IACnB8E,EAAKb,EAASjE,EAAI,GAClB+E,EAAK5F,EAAK0F,EAAK,GAAK1F,EAAK0F,EAAK,IAAOA,IAAQ,EAC7CG,EAAK7F,EAAK2F,EAAI,IAAM3F,EAAK2F,EAAI,IAAOA,IAAO,GACjDb,EAASjE,GAAMgF,EAAKf,EAASjE,EAAI,GAAK+E,EAAKd,EAASjE,EAAI,IAAO,CAClE,CAED,IAAImE,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMpE,KACjC,IAAK,IAAIN,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACMiF,EAAMP,GADGvF,EAAKoF,EAAG,GAAKpF,EAAKoF,EAAG,IAAMpF,EAAKoF,EAAG,OAnEjDhH,EAoE4BgH,GAAGC,GApEPjH,EAoEUkH,GAAKV,EAAS/D,GAAKiE,EAASjE,GAAM,EAE/DkF,GADS/F,EAAKgF,EAAG,GAAKhF,EAAKgF,EAAG,IAAMhF,EAAKgF,EAAG,KAC7BN,EAAIM,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CACnB,CA/EG,IAAC3H,EAiFL4G,EAAKA,EAAI7D,KAAK6D,EAAK,EACnBC,EAAKA,EAAI9D,KAAK8D,EAAK,EACnBC,EAAKA,EAAI/D,KAAK+D,EAAK,EACnBC,EAAKA,EAAIhE,KAAKgE,EAAK,EACnBC,EAAKA,EAAIjE,KAAKiE,EAAK,EACnBC,EAAKA,EAAIlE,KAAKkE,EAAK,EACnBC,EAAKA,EAAInE,KAAKmE,EAAK,EACnBC,EAAKA,EAAIpE,KAAKoE,EAAK,EACnBpE,KAAKH,IAAIgE,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CACD,UAAAvC,GACI8B,EAAS5B,KAAK,EACjB,CACD,OAAAsB,GACIrD,KAAKH,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BG,KAAKtB,OAAOqD,KAAK,EACpB,EAGL,MAAM8C,UAAejB,EACjB,WAAAzG,GACIiE,QACApB,KAAK6D,GAAI,WACT7D,KAAK8D,EAAI,UACT9D,KAAK+D,EAAI,UACT/D,KAAKgE,GAAI,UACThE,KAAKiE,GAAI,QACTjE,KAAKkE,EAAI,WACTlE,KAAKmE,EAAI,WACTnE,KAAKoE,GAAI,WACTpE,KAAKvC,UAAY,EACpB,EAMO,MAACqH,iBAAyB5E,GAAgB,IAAM,IAAI0D,IACnDmB,iBAAyB7E,GAAgB,IAAM,IAAI2E,IC3H1DG,EAAa5C,OAAOC,OAAOzB,EAAW0B,IAAI,GAAK,GAAK,IACpDH,EAAOC,OAAOC,OAAOzB,EAAW0B,IAAI,KAE1C,SAAS2C,EAAQvI,EAAGwI,GAAK,GACrB,OAAIA,EACO,CAAErC,EAAGnG,EAAEgG,WAAWsC,GAAYrC,WAAYG,EAAGpG,EAAE+F,WAAWN,GAAMO,WAAWsC,GAAYrC,YAC3F,CAAEE,EAA0D,EAAvDnG,EAAE+F,WAAWN,GAAMO,WAAWsC,GAAYrC,WAAgBG,EAAyC,EAAtCpG,EAAEgG,WAAWsC,GAAYrC,WACtG,CACA,SAASwC,EAAMC,EAAKF,GAAK,GACrB,IAAIG,EAAK,IAAIrG,YAAYoG,EAAI/H,QACzBiI,EAAK,IAAItG,YAAYoG,EAAI/H,QAC7B,IAAK,IAAIqC,EAAI,EAAGA,EAAI0F,EAAI/H,OAAQqC,IAAK,CACjC,MAAMmD,EAAEA,EAACC,EAAEA,GAAMmC,EAAQG,EAAI1F,GAAIwF,IAChCG,EAAG3F,GAAI4F,EAAG5F,IAAM,CAACmD,EAAGC,EACxB,CACD,MAAO,CAACuC,EAAIC,EAChB,CACA,MAgBMC,EAAS,CAAC1C,EAAGC,EAAG0C,IAAO3C,GAAK2C,EAAM1C,IAAO,GAAK0C,EAC9CC,EAAS,CAAC5C,EAAGC,EAAG0C,IAAO1C,GAAK0C,EAAM3C,IAAO,GAAK2C,EAE9CE,EAAS,CAAC7C,EAAGC,EAAG0C,IAAO1C,GAAM0C,EAAI,GAAQ3C,IAAO,GAAK2C,EACrDG,EAAS,CAAC9C,EAAGC,EAAG0C,IAAO3C,GAAM2C,EAAI,GAAQ1C,IAAO,GAAK0C,EAQ3D,MASMI,EAAM,CACRX,UAASE,QAAOU,MAtCN,CAAChD,EAAGC,IAAOlC,EAAW0B,IAAIO,IAAM,GACzCiD,WAAW3D,GACX4D,WAAWnF,EAAW0B,IAAIQ,IAAM,IAqCjCkD,MAnCU,CAACnD,EAAGoD,EAAIT,IAAM3C,IAAM2C,EAmCvBU,MAlCG,CAACrD,EAAGC,EAAG0C,IAAO3C,GAAM,GAAK2C,EAAO1C,IAAM0C,EAmChDW,OAjCW,CAACtD,EAAGC,EAAG0C,IAAO3C,IAAM2C,EAAM1C,GAAM,GAAK0C,EAiCxCY,OAhCG,CAACvD,EAAGC,EAAG0C,IAAO3C,GAAM,GAAK2C,EAAO1C,IAAM0C,EAgCjCa,OA9BL,CAACxD,EAAGC,EAAG0C,IAAO3C,GAAM,GAAK2C,EAAO1C,IAAO0C,EAAI,GA8B9Bc,OA7Bb,CAACzD,EAAGC,EAAG0C,IAAO3C,IAAO2C,EAAI,GAAQ1C,GAAM,GAAK0C,EA8BvDe,QA5BY,CAACC,EAAI1D,IAAMA,EA4Bd2D,QA3BG,CAAC5D,EAAGoD,IAAOpD,EA4BvB0C,SAAQE,SAAQC,SAAQC,SACxBe,IApBJ,SAAarB,EAAIC,EAAIqB,EAAIC,GACrB,MAAM9D,GAAKwC,IAAO,IAAMsB,IAAO,GAC/B,MAAO,CAAE/D,EAAIwC,EAAKsB,GAAO7D,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBS+D,MAfK,CAACvB,EAAIsB,EAAIE,KAAQxB,IAAO,IAAMsB,IAAO,IAAME,IAAO,GAehDC,MAdF,CAACC,EAAK3B,EAAIsB,EAAIM,IAAQ5B,EAAKsB,EAAKM,GAAOD,EAAM,GAAK,GAAM,GAAM,EAcrDE,MAbT,CAAC5B,EAAIsB,EAAIE,EAAIK,KAAQ7B,IAAO,IAAMsB,IAAO,IAAME,IAAO,IAAMK,IAAO,GAanDC,MAZhB,CAACJ,EAAK3B,EAAIsB,EAAIM,EAAII,IAAQhC,EAAKsB,EAAKM,EAAKI,GAAOL,EAAM,GAAK,GAAM,GAAM,EAYhDM,MAVvB,CAACN,EAAK3B,EAAIsB,EAAIM,EAAII,EAAIE,IAAQlC,EAAKsB,EAAKM,EAAKI,EAAKE,GAAOP,EAAM,GAAK,GAAM,GAAM,EAUlDQ,MAX9B,CAAClC,EAAIsB,EAAIE,EAAIK,EAAIM,KAAQnC,IAAO,IAAMsB,IAAO,IAAME,IAAO,IAAMK,IAAO,IAAMM,IAAO,KC5C3FC,EAAWC,kBAA6B,KAAO/B,EAAIT,MAAM,CAC5D,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,sBACpEyC,KAAIlL,GAAKkE,EAAW0B,IAAI5F,MArBqB,GAuBzCmL,iBAA6B,IAAI7I,YAAY,IAC7C8I,iBAA6B,IAAI9I,YAAY,IAC5C,MAAM+I,UAAe9G,EACxB,WAAA9D,GACIiE,MAAM,IAAK,GAAI,IAAI,GAKnBpB,KAAKqF,GAAK,WACVrF,KAAKsF,IAAK,UACVtF,KAAK2G,IAAK,WACV3G,KAAK4G,IAAK,WACV5G,KAAKiH,GAAK,WACVjH,KAAK8G,IAAK,SACV9G,KAAKqH,IAAK,WACVrH,KAAKmH,GAAK,WACVnH,KAAKuH,GAAK,WACVvH,KAAKyH,IAAK,WACVzH,KAAKgI,IAAK,WACVhI,KAAKiI,GAAK,UACVjI,KAAKkI,GAAK,UACVlI,KAAKmI,IAAK,SACVnI,KAAKoI,GAAK,WACVpI,KAAKqI,GAAK,SACb,CAED,GAAAlF,GACI,MAAMkC,GAAEA,EAAEC,GAAEA,EAAEqB,GAAEA,EAAEC,GAAEA,EAAEK,GAAEA,EAAEH,GAAEA,EAAEO,GAAEA,EAAEF,GAAEA,EAAEI,GAAEA,EAAEE,GAAEA,EAAEO,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOrI,KAC3E,MAAO,CAACqF,EAAIC,EAAIqB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIO,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACvE,CAED,GAAAxI,CAAIwF,EAAIC,EAAIqB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIO,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5DrI,KAAKqF,GAAU,EAALA,EACVrF,KAAKsF,GAAU,EAALA,EACVtF,KAAK2G,GAAU,EAALA,EACV3G,KAAK4G,GAAU,EAALA,EACV5G,KAAKiH,GAAU,EAALA,EACVjH,KAAK8G,GAAU,EAALA,EACV9G,KAAKqH,GAAU,EAALA,EACVrH,KAAKmH,GAAU,EAALA,EACVnH,KAAKuH,GAAU,EAALA,EACVvH,KAAKyH,GAAU,EAALA,EACVzH,KAAKgI,GAAU,EAALA,EACVhI,KAAKiI,GAAU,EAALA,EACVjI,KAAKkI,GAAU,EAALA,EACVlI,KAAKmI,GAAU,EAALA,EACVnI,KAAKoI,GAAU,EAALA,EACVpI,KAAKqI,GAAU,EAALA,CACb,CACD,OAAA1G,CAAQL,EAAM+C,GAEV,IAAK,IAAI3E,EAAI,EAAGA,EAAI,GAAIA,IAAK2E,GAAU,EACnCwD,EAAWnI,GAAK4B,EAAKgD,UAAUD,GAC/ByD,EAAWpI,GAAK4B,EAAKgD,UAAWD,GAAU,GAE9C,IAAK,IAAI3E,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAM4I,EAA4B,EAArBT,EAAWnI,EAAI,IACtB6I,EAA4B,EAArBT,EAAWpI,EAAI,IACtB8I,EAAM5C,EAAIO,OAAOmC,EAAMC,EAAM,GAAK3C,EAAIO,OAAOmC,EAAMC,EAAM,GAAK3C,EAAII,MAAMsC,EAAMC,EAAM,GACpFE,EAAM7C,EAAIQ,OAAOkC,EAAMC,EAAM,GAAK3C,EAAIQ,OAAOkC,EAAMC,EAAM,GAAK3C,EAAIM,MAAMoC,EAAMC,EAAM,GAEpFG,EAA0B,EAApBb,EAAWnI,EAAI,GACrBiJ,EAA0B,EAApBb,EAAWpI,EAAI,GACrBkJ,EAAMhD,EAAIO,OAAOuC,EAAKC,EAAK,IAAM/C,EAAIS,OAAOqC,EAAKC,EAAK,IAAM/C,EAAII,MAAM0C,EAAKC,EAAK,GAChFE,EAAMjD,EAAIQ,OAAOsC,EAAKC,EAAK,IAAM/C,EAAIU,OAAOoC,EAAKC,EAAK,IAAM/C,EAAIM,MAAMwC,EAAKC,EAAK,GAEhFG,EAAOlD,EAAIsB,MAAMuB,EAAKI,EAAKf,EAAWpI,EAAI,GAAIoI,EAAWpI,EAAI,KAC7DqJ,EAAOnD,EAAIwB,MAAM0B,EAAMN,EAAKI,EAAKf,EAAWnI,EAAI,GAAImI,EAAWnI,EAAI,KACzEmI,EAAWnI,GAAY,EAAPqJ,EAChBjB,EAAWpI,GAAY,EAAPoJ,CACnB,CACD,IAAIzD,GAAEA,EAAEC,GAAEA,EAAEqB,GAAEA,EAAEC,GAAEA,EAAEK,GAAEA,EAAEH,GAAEA,EAAEO,GAAEA,EAAEF,GAAEA,EAAEI,GAAEA,EAAEE,GAAEA,EAAEO,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOrI,KAEzE,IAAK,IAAIN,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAMsJ,EAAUpD,EAAIO,OAAOoB,EAAIE,EAAI,IAAM7B,EAAIO,OAAOoB,EAAIE,EAAI,IAAM7B,EAAIS,OAAOkB,EAAIE,EAAI,IAC/EwB,EAAUrD,EAAIQ,OAAOmB,EAAIE,EAAI,IAAM7B,EAAIQ,OAAOmB,EAAIE,EAAI,IAAM7B,EAAIU,OAAOiB,EAAIE,EAAI,IAE/EyB,EAAQ3B,EAAKS,GAAQT,EAAKW,EAC1BiB,EAAQ1B,EAAKQ,GAAQR,EAAKU,EAG1BiB,EAAOxD,EAAI4B,MAAMa,EAAIY,EAASE,EAAMxB,EAAUjI,GAAIoI,EAAWpI,IAC7D2J,EAAMzD,EAAI0B,MAAM8B,EAAMhB,EAAIY,EAASE,EAAMxB,EAAUhI,GAAImI,EAAWnI,IAClE4J,EAAa,EAAPF,EAENG,EAAU3D,EAAIO,OAAOd,EAAIC,EAAI,IAAMM,EAAIS,OAAOhB,EAAIC,EAAI,IAAMM,EAAIS,OAAOhB,EAAIC,EAAI,IAC/EkE,EAAU5D,EAAIQ,OAAOf,EAAIC,EAAI,IAAMM,EAAIU,OAAOjB,EAAIC,EAAI,IAAMM,EAAIU,OAAOjB,EAAIC,EAAI,IAC/EmE,EAAQpE,EAAKsB,EAAOtB,EAAK4B,EAAON,EAAKM,EACrCyC,EAAQpE,EAAKsB,EAAOtB,EAAKwB,EAAOF,EAAKE,EAC3CsB,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALT,EACLU,EAAU,EAALR,IACF5E,EAAG0E,EAAIzE,EAAG2E,GAAO7B,EAAIc,IAAS,EAALW,EAAa,EAALF,EAAc,EAANkC,EAAe,EAANC,IACrDjC,EAAU,EAALJ,EACLE,EAAU,EAALL,EACLG,EAAU,EAALN,EACLG,EAAU,EAALF,EACLD,EAAU,EAALtB,EACLuB,EAAU,EAALtB,EACL,MAAMqE,EAAM/D,EAAIiB,MAAMyC,EAAKE,EAASE,GACpCrE,EAAKO,EAAImB,MAAM4C,EAAKN,EAAKE,EAASE,GAClCnE,EAAW,EAANqE,CACR,GAEE9G,EAAGwC,EAAIvC,EAAGwC,GAAOM,EAAIc,IAAc,EAAV1G,KAAKqF,GAAkB,EAAVrF,KAAKsF,GAAa,EAALD,EAAa,EAALC,MAC3DzC,EAAG8D,EAAI7D,EAAG8D,GAAOhB,EAAIc,IAAc,EAAV1G,KAAK2G,GAAkB,EAAV3G,KAAK4G,GAAa,EAALD,EAAa,EAALC,MAC3D/D,EAAOC,EAAGgE,GAAOlB,EAAIc,IAAc,EAAV1G,KAAKiH,GAAkB,EAAVjH,KAAK8G,GAAa,EAALG,EAAa,EAALH,MAC3DjE,EAAGwE,EAAIvE,EAAGqE,GAAOvB,EAAIc,IAAc,EAAV1G,KAAKqH,GAAkB,EAAVrH,KAAKmH,GAAa,EAALE,EAAa,EAALF,MAC3DtE,EAAG0E,EAAIzE,EAAG2E,GAAO7B,EAAIc,IAAc,EAAV1G,KAAKuH,GAAkB,EAAVvH,KAAKyH,GAAa,EAALF,EAAa,EAALE,MAC3D5E,EAAGmF,EAAIlF,EAAGmF,GAAOrC,EAAIc,IAAc,EAAV1G,KAAKgI,GAAkB,EAAVhI,KAAKiI,GAAa,EAALD,EAAa,EAALC,MAC3DpF,EAAGqF,EAAIpF,EAAGqF,GAAOvC,EAAIc,IAAc,EAAV1G,KAAKkI,GAAkB,EAAVlI,KAAKmI,GAAa,EAALD,EAAa,EAALC,MAC3DtF,EAAGuF,EAAItF,EAAGuF,GAAOzC,EAAIc,IAAc,EAAV1G,KAAKoI,GAAkB,EAAVpI,KAAKqI,GAAa,EAALD,EAAa,EAALC,IAC9DrI,KAAKH,IAAIwF,EAAIC,EAAIqB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIO,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CACD,UAAAxG,GACIgG,EAAW9F,KAAK,GAChB+F,EAAW/F,KAAK,EACnB,CACD,OAAAsB,GACIrD,KAAKtB,OAAOqD,KAAK,GACjB/B,KAAKH,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACzD,EAgDL,MAAM+J,UAAe7B,EACjB,WAAA5K,GACIiE,QAEApB,KAAKqF,IAAK,UACVrF,KAAKsF,IAAK,WACVtF,KAAK2G,GAAK,WACV3G,KAAK4G,GAAK,UACV5G,KAAKiH,IAAK,WACVjH,KAAK8G,GAAK,UACV9G,KAAKqH,GAAK,UACVrH,KAAKmH,IAAK,UACVnH,KAAKuH,GAAK,WACVvH,KAAKyH,IAAK,QACVzH,KAAKgI,IAAK,WACVhI,KAAKiI,GAAK,WACVjI,KAAKkI,IAAK,UACVlI,KAAKmI,GAAK,WACVnI,KAAKoI,GAAK,WACVpI,KAAKqI,IAAK,WACVrI,KAAKvC,UAAY,EACpB,EAEO,MAACoM,iBAAyB3J,GAAgB,IAAM,IAAI6H,IAGnD+B,iBAAyB5J,GAAgB,IAAM,IAAI0J,KC/NzDG,EAASC,EAAWC,GAAc,CAAC,GAAI,GAAI,IAC5CC,iBAAsB9H,OAAOC,OAAOzB,EAAW0B,IAAI,IACnD6H,iBAAsB/H,OAAOC,OAAOzB,EAAW0B,IAAI,IACnD8H,iBAAsBhI,OAAOC,OAAOzB,EAAW0B,IAAI,IACnD+H,iBAAsBjI,OAAOC,OAAOzB,EAAW0B,IAAI,IACnDgI,iBAAwBlI,OAAOC,OAAOzB,EAAW0B,IAAI,MACrDiI,iBAAyBnI,OAAOC,OAAOzB,EAAW0B,IAAI,MAC5D,IAAK,IAAIkI,EAAQ,EAAGC,EAAIN,EAAKO,EAAI,EAAGC,EAAI,EAAGH,EAAQ,GAAIA,IAAS,EAE3DE,EAAGC,GAAK,CAACA,GAAI,EAAID,EAAI,EAAIC,GAAK,GAC/BZ,EAAQa,KAAK,GAAK,EAAID,EAAID,IAE1BV,EAAUY,MAAQJ,EAAQ,IAAMA,EAAQ,GAAM,EAAK,IAEnD,MAAMK,EAAIX,EAAInK,QACd,IAAK,IAAI+K,EAAI,EAAGA,EAAI,EAAGA,IACnBL,EAAIA,EAAEM,UAAUZ,GAAKa,KAAKP,EAAEhI,WAAW4H,GAAKY,KAAKV,IAASW,KAAKZ,GAC1DG,EAAE/H,WAAW0H,GAAKe,UACnBN,EAAEG,KAAKb,EAAIY,UAAUZ,EAAIY,yBAA0BnK,EAAW0B,IAAIwI,IAAIM,SAE9EnB,EAAWW,KAAKC,EACpB,CACA,MAAOQ,GAAaC,mBAA+BnG,EAAM8E,GAAY,GAE/DsB,GAAQ,CAAC1I,EAAGC,EAAG0C,IAAOA,EAAI,GAAKE,EAAO7C,EAAGC,EAAG0C,GAAKD,EAAO1C,EAAGC,EAAG0C,GAC9DgG,GAAQ,CAAC3I,EAAGC,EAAG0C,IAAOA,EAAI,GAAKG,EAAO9C,EAAGC,EAAG0C,GAAKC,EAAO5C,EAAGC,EAAG0C,GA+C7D,MAAMiG,WAAe3L,EAExB,WAAA3C,CAAYO,EAAUgO,EAAQjO,EAAWkO,GAAY,EAAOC,EAAS,IAcjE,GAbAxK,QACApB,KAAKtC,SAAWA,EAChBsC,KAAK0L,OAASA,EACd1L,KAAKvC,UAAYA,EACjBuC,KAAK2L,UAAYA,EACjB3L,KAAK4L,OAASA,EACd5L,KAAKqB,IAAM,EACXrB,KAAK6L,OAAS,EACd7L,KAAKjC,UAAW,EAChBiC,KAAKlC,WAAY,EAEjBrB,EAAOgB,GAEH,GAAKuC,KAAKtC,UAAYsC,KAAKtC,UAAY,IACvC,MAAUb,MAAM,4CNtFT,IAAC2B,EMuFZwB,KAAKkD,MAAQ,IAAIhG,WAAW,KAC5B8C,KAAK8L,SNxFOtN,EMwFOwB,KAAKkD,MNxFJ,IAAIlE,YAAYR,EAAIE,OAAQF,EAAIG,WAAY8C,KAAKsK,MAAMvN,EAAII,WAAa,IMyF/F,CACD,MAAAoN,IAlEG,SAAiBxG,EAAGoG,EAAS,IAChC,MAAM9H,EAAI,IAAI9E,YAAY,IAE1B,IAAK,IAAIwL,EAAQ,GAAKoB,EAAQpB,EAAQ,GAAIA,IAAS,CAE/C,IAAK,IAAIE,EAAI,EAAGA,EAAI,GAAIA,IACpB5G,EAAE4G,GAAKlF,EAAEkF,GAAKlF,EAAEkF,EAAI,IAAMlF,EAAEkF,EAAI,IAAMlF,EAAEkF,EAAI,IAAMlF,EAAEkF,EAAI,IAC5D,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC5B,MAAMuB,GAAQvB,EAAI,GAAK,GACjBwB,GAAQxB,EAAI,GAAK,GACjByB,EAAKrI,EAAEoI,GACPE,EAAKtI,EAAEoI,EAAO,GACdG,EAAKd,GAAMY,EAAIC,EAAI,GAAKtI,EAAEmI,GAC1BK,EAAKd,GAAMW,EAAIC,EAAI,GAAKtI,EAAEmI,EAAO,GACvC,IAAK,IAAItB,EAAI,EAAGA,EAAI,GAAIA,GAAK,GACzBnF,EAAEkF,EAAIC,IAAM0B,EACZ7G,EAAEkF,EAAIC,EAAI,IAAM2B,CAEvB,CAED,IAAIC,EAAO/G,EAAE,GACTgH,EAAOhH,EAAE,GACb,IAAK,IAAIqF,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM9L,EAAQiL,EAAUa,GAClBwB,EAAKd,GAAMgB,EAAMC,EAAMzN,GACvBuN,EAAKd,GAAMe,EAAMC,EAAMzN,GACvB0N,EAAK1C,EAAQc,GACnB0B,EAAO/G,EAAEiH,GACTD,EAAOhH,EAAEiH,EAAK,GACdjH,EAAEiH,GAAMJ,EACR7G,EAAEiH,EAAK,GAAKH,CACf,CAED,IAAK,IAAI3B,EAAI,EAAGA,EAAI,GAAIA,GAAK,GAAI,CAC7B,IAAK,IAAID,EAAI,EAAGA,EAAI,GAAIA,IACpB5G,EAAE4G,GAAKlF,EAAEmF,EAAID,GACjB,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,IACpBlF,EAAEmF,EAAID,KAAO5G,GAAG4G,EAAI,GAAK,IAAM5G,GAAG4G,EAAI,GAAK,GAClD,CAEDlF,EAAE,IAAM6F,GAAYb,GACpBhF,EAAE,IAAM8F,GAAYd,EACvB,CACD1G,EAAE/B,KAAK,EACX,CAuBQ2K,CAAQ1M,KAAK8L,QAAS9L,KAAK4L,QAC3B5L,KAAK6L,OAAS,EACd7L,KAAKqB,IAAM,CACd,CACD,MAAAf,CAAOhB,GACH3B,EAAOqC,MACP,MAAMtC,SAAEA,EAAQwF,MAAEA,GAAUlD,KAEtBuB,GADNjC,EAAOD,EAAQC,IACEjC,OACjB,IAAK,IAAIgE,EAAM,EAAGA,EAAME,GAAM,CAC1B,MAAMC,EAAOC,KAAKvD,IAAIR,EAAWsC,KAAKqB,IAAKE,EAAMF,GACjD,IAAK,IAAI3B,EAAI,EAAGA,EAAI8B,EAAM9B,IACtBwD,EAAMlD,KAAKqB,QAAU/B,EAAK+B,KAC1BrB,KAAKqB,MAAQ3D,GACbsC,KAAKgM,QACZ,CACD,OAAOhM,IACV,CACD,MAAA2M,GACI,GAAI3M,KAAKjC,SACL,OACJiC,KAAKjC,UAAW,EAChB,MAAMmF,MAAEA,EAAKwI,OAAEA,EAAMrK,IAAEA,EAAG3D,SAAEA,GAAasC,KAEzCkD,EAAM7B,IAAQqK,EACU,IAAV,IAATA,IAAwBrK,IAAQ3D,EAAW,GAC5CsC,KAAKgM,SACT9I,EAAMxF,EAAW,IAAM,IACvBsC,KAAKgM,QACR,CACD,SAAAY,CAAU3O,GACNN,EAAOqC,MAAM,GACblD,EAAMmB,GACN+B,KAAK2M,SACL,MAAME,EAAY7M,KAAKkD,OACjBxF,SAAEA,GAAasC,KACrB,IAAK,IAAIqB,EAAM,EAAGE,EAAMtD,EAAIZ,OAAQgE,EAAME,GAAM,CACxCvB,KAAK6L,QAAUnO,GACfsC,KAAKgM,SACT,MAAMxK,EAAOC,KAAKvD,IAAIR,EAAWsC,KAAK6L,OAAQtK,EAAMF,GACpDpD,EAAI4B,IAAIgN,EAAUnL,SAAS1B,KAAK6L,OAAQ7L,KAAK6L,OAASrK,GAAOH,GAC7DrB,KAAK6L,QAAUrK,EACfH,GAAOG,CACV,CACD,OAAOvD,CACV,CACD,OAAA6O,CAAQ7O,GAEJ,IAAK+B,KAAK2L,UACN,MAAU9O,MAAM,yCACpB,OAAOmD,KAAK4M,UAAU3O,EACzB,CACD,GAAA8O,CAAIjQ,GAEA,OADAL,EAAOK,GACAkD,KAAK8M,QAAQ,IAAI5P,WAAWJ,GACtC,CACD,UAAAgF,CAAW7D,GAEP,GADAD,EAAOC,EAAK+B,MACRA,KAAKjC,SACL,MAAUlB,MAAM,+BAGpB,OAFAmD,KAAK4M,UAAU3O,GACf+B,KAAKqD,UACEpF,CACV,CACD,MAAAsC,GACI,OAAOP,KAAK8B,WAAW,IAAI5E,WAAW8C,KAAKvC,WAC9C,CACD,OAAA4F,GACIrD,KAAKlC,WAAY,EACjBkC,KAAKkD,MAAMnB,KAAK,EACnB,CACD,UAAA9B,CAAWqD,GACP,MAAM5F,SAAEA,EAAQgO,OAAEA,EAAMjO,UAAEA,EAASmO,OAAEA,EAAMD,UAAEA,GAAc3L,KAY3D,OAXAsD,IAAOA,EAAK,IAAImI,GAAO/N,EAAUgO,EAAQjO,EAAWkO,EAAWC,IAC/DtI,EAAGwI,QAAQjM,IAAIG,KAAK8L,SACpBxI,EAAGjC,IAAMrB,KAAKqB,IACdiC,EAAGuI,OAAS7L,KAAK6L,OACjBvI,EAAGvF,SAAWiC,KAAKjC,SACnBuF,EAAGsI,OAASA,EAEZtI,EAAGoI,OAASA,EACZpI,EAAG7F,UAAYA,EACf6F,EAAGqI,UAAYA,EACfrI,EAAGxF,UAAYkC,KAAKlC,UACbwF,CACV,EAEL,MAAM0J,GAAM,CAACtB,EAAQhO,EAAUD,IAAcyC,GAAgB,IAAM,IAAIuL,GAAO/N,EAAUgO,EAAQjO,KAMnFwP,kBAA2BD,GAAI,EAAM,IAAK,IAE1CE,kBAA2BF,GAAI,EAAM,GAAI,IAWzCG,kBAFI,EAACzB,EAAQhO,EAAUD,IN7C7B,SAAoC0C,GACvC,MAAMC,EAAQ,CAACC,EAAK+M,IAASjN,EAASiN,GAAM9M,OAAOjB,EAAQgB,IAAME,SAC3DC,EAAML,EAAS,CAAA,GAIrB,OAHAC,EAAM3C,UAAY+C,EAAI/C,UACtB2C,EAAM1C,SAAW8C,EAAI9C,SACrB0C,EAAM5C,OAAU4P,GAASjN,EAASiN,GAC3BhN,CACX,CMsCkDiN,EAA2B,CAACD,EAAO,CAAE,IAAK,IAAI3B,GAAO/N,EAAUgO,OAAuBrN,IAAf+O,EAAKE,MAAsB7P,EAAY2P,EAAKE,OAAO,KAEpIC,CAAS,GAAM,IAAK","x_google_ignoreList":[0,1,2,3,4,5,6,7,8]}

package/dist/lightweight/sha3.mjs

@@ -1,4 +1,4 @@
-/*! OpenPGP.js v6.0.0-alpha.0 - 2023-12-12 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+/*! OpenPGP.js v6.0.0-alpha.1.patch.0 - 2024-03-01 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
 const globalThis = typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
 
 import { B as BigInteger } from './interface.mjs';
@@ -9,8 +9,13 @@ function number(n) {
     if (!Number.isSafeInteger(n) || n < 0)
         throw new Error(`Wrong positive integer: ${n}`);
 }
+// copied from utils
+function isBytes$1(a) {
+    return (a instanceof Uint8Array ||
+        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));
+}
 function bytes(b, ...lengths) {
-    if (!(b instanceof Uint8Array))
+    if (!isBytes$1(b))
         throw new Error('Expected Uint8Array');
     if (lengths.length > 0 && !lengths.includes(b.length))
         throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);
@@ -44,15 +49,20 @@ const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? global
 // For node.js, package.json#exports field mapping rewrites import
 // from `crypto` to `cryptoNode`, which imports native module.
 // Makes the utils un-importable in browsers without a bundler.
-// Once node.js 18 is deprecated, we can just drop the import.
-const u8a = (a) => a instanceof Uint8Array;
+// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.
 const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
+function isBytes(a) {
+    return (a instanceof Uint8Array ||
+        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));
+}
 // Cast array to view
 const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
 // The rotate right (circular right shift) operation for uint32
 const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);
 // big-endian hardware is rare. Just in case someone still decides to run hashes:
 // early-throw an error because we don't support BE yet.
+// Other libraries would silently corrupt the data instead of throwing an error,
+// when they don't support it.
 const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;
 if (!isLE)
     throw new Error('Non little-endian hardware is not supported');
@@ -72,7 +82,7 @@ function utf8ToBytes(str) {
 function toBytes(data) {
     if (typeof data === 'string')
         data = utf8ToBytes(data);
-    if (!u8a(data))
+    if (!isBytes(data))
         throw new Error(`expected Uint8Array, got ${typeof data}`);
     return data;
 }
@@ -80,15 +90,20 @@ function toBytes(data) {
  * Copies several Uint8Arrays into one.
  */
 function concatBytes(...arrays) {
-    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));
-    let pad = 0; // walk through each item, ensure they have proper type
-    arrays.forEach((a) => {
-        if (!u8a(a))
+    let sum = 0;
+    for (let i = 0; i < arrays.length; i++) {
+        const a = arrays[i];
+        if (!isBytes(a))
             throw new Error('Uint8Array expected');
-        r.set(a, pad);
+        sum += a.length;
+    }
+    const res = new Uint8Array(sum);
+    for (let i = 0, pad = 0; i < arrays.length; i++) {
+        const a = arrays[i];
+        res.set(a, pad);
         pad += a.length;
-    });
-    return r;
+    }
+    return res;
 }
 // For runtime check if class implements interface
 class Hash {
@@ -424,11 +439,10 @@ const u64 = {
     rotlSH, rotlSL, rotlBH, rotlBL,
     add, add3L, add3H, add4L, add4H, add5H, add5L,
 };
-var u64$1 = u64;
 
 // Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):
 // prettier-ignore
-const [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64$1.split([
+const [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([
     '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',
     '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',
     '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',
@@ -511,16 +525,16 @@ class SHA512 extends SHA2 {
             // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)
             const W15h = SHA512_W_H[i - 15] | 0;
             const W15l = SHA512_W_L[i - 15] | 0;
-            const s0h = u64$1.rotrSH(W15h, W15l, 1) ^ u64$1.rotrSH(W15h, W15l, 8) ^ u64$1.shrSH(W15h, W15l, 7);
-            const s0l = u64$1.rotrSL(W15h, W15l, 1) ^ u64$1.rotrSL(W15h, W15l, 8) ^ u64$1.shrSL(W15h, W15l, 7);
+            const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);
+            const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);
             // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)
             const W2h = SHA512_W_H[i - 2] | 0;
             const W2l = SHA512_W_L[i - 2] | 0;
-            const s1h = u64$1.rotrSH(W2h, W2l, 19) ^ u64$1.rotrBH(W2h, W2l, 61) ^ u64$1.shrSH(W2h, W2l, 6);
-            const s1l = u64$1.rotrSL(W2h, W2l, 19) ^ u64$1.rotrBL(W2h, W2l, 61) ^ u64$1.shrSL(W2h, W2l, 6);
+            const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);
+            const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);
             // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];
-            const SUMl = u64$1.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
-            const SUMh = u64$1.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);
+            const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
+            const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);
             SHA512_W_H[i] = SUMh | 0;
             SHA512_W_L[i] = SUMl | 0;
         }
@@ -528,19 +542,19 @@ class SHA512 extends SHA2 {
         // Compression function main loop, 80 rounds
         for (let i = 0; i < 80; i++) {
             // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)
-            const sigma1h = u64$1.rotrSH(Eh, El, 14) ^ u64$1.rotrSH(Eh, El, 18) ^ u64$1.rotrBH(Eh, El, 41);
-            const sigma1l = u64$1.rotrSL(Eh, El, 14) ^ u64$1.rotrSL(Eh, El, 18) ^ u64$1.rotrBL(Eh, El, 41);
+            const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);
+            const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);
             //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
             const CHIh = (Eh & Fh) ^ (~Eh & Gh);
             const CHIl = (El & Fl) ^ (~El & Gl);
             // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]
             // prettier-ignore
-            const T1ll = u64$1.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);
-            const T1h = u64$1.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);
+            const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);
+            const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);
             const T1l = T1ll | 0;
             // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)
-            const sigma0h = u64$1.rotrSH(Ah, Al, 28) ^ u64$1.rotrBH(Ah, Al, 34) ^ u64$1.rotrBH(Ah, Al, 39);
-            const sigma0l = u64$1.rotrSL(Ah, Al, 28) ^ u64$1.rotrBL(Ah, Al, 34) ^ u64$1.rotrBL(Ah, Al, 39);
+            const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);
+            const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);
             const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);
             const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);
             Hh = Gh | 0;
@@ -549,26 +563,26 @@ class SHA512 extends SHA2 {
             Gl = Fl | 0;
             Fh = Eh | 0;
             Fl = El | 0;
-            ({ h: Eh, l: El } = u64$1.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
+            ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
             Dh = Ch | 0;
             Dl = Cl | 0;
             Ch = Bh | 0;
             Cl = Bl | 0;
             Bh = Ah | 0;
             Bl = Al | 0;
-            const All = u64$1.add3L(T1l, sigma0l, MAJl);
-            Ah = u64$1.add3H(All, T1h, sigma0h, MAJh);
+            const All = u64.add3L(T1l, sigma0l, MAJl);
+            Ah = u64.add3H(All, T1h, sigma0h, MAJh);
             Al = All | 0;
         }
         // Add the compressed chunk to the current hash value
-        ({ h: Ah, l: Al } = u64$1.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
-        ({ h: Bh, l: Bl } = u64$1.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
-        ({ h: Ch, l: Cl } = u64$1.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
-        ({ h: Dh, l: Dl } = u64$1.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
-        ({ h: Eh, l: El } = u64$1.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
-        ({ h: Fh, l: Fl } = u64$1.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
-        ({ h: Gh, l: Gl } = u64$1.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
-        ({ h: Hh, l: Hl } = u64$1.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
+        ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
+        ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
+        ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
+        ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
+        ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
+        ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
+        ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
+        ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
         this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);
     }
     roundClean() {