1import{n as e}from"./chunk-Bj-mKKzh.js";import{C as t,D as n,I as r,K as i,N as a,O as o,R as s,S as c,T as l,W as u,d,f,j as p,l as m,p as h,q as g,u as _,w as v}from"./_u64-B9fNc5Vs.js";function y(e,t=24){let n=new Uint32Array(10);for(let r=24-t;r<24;r++){for(let t=0;t<10;t++)n[t]=e[t]^e[t+10]^e[t+20]^e[t+30]^e[t+40];for(let t=0;t<10;t+=2){let r=(t+8)%10,i=(t+2)%10,a=n[i],o=n[i+1],s=M(a,o,1)^n[r],c=N(a,o,1)^n[r+1];for(let n=0;n<50;n+=10)e[t+n]^=s,e[t+n+1]^=c}let t=e[2],i=e[3];for(let n=0;n<24;n++){let r=D[n],a=M(t,i,r),o=N(t,i,r),s=E[n];t=e[s],i=e[s+1],e[s]=a,e[s+1]=o}for(let t=0;t<50;t+=10){for(let r=0;r<10;r++)n[r]=e[t+r];for(let r=0;r<10;r++)e[t+r]^=~n[(r+2)%10]&n[(r+4)%10]}e[0]^=A[r],e[1]^=j[r]}p(n)}var b,x,S,C,w,T,E,D,O,k,A,j,M,N,P,F,I,L,R,z=e((()=>{m(),s(),b=BigInt(0),x=BigInt(1),S=BigInt(2),C=BigInt(7),w=BigInt(256),T=BigInt(113),E=[],D=[],O=[];for(let e=0,t=x,n=1,r=0;e<24;e++){[n,r]=[r,(2*n+3*r)%5],E.push(2*(5*r+n)),D.push((e+1)*(e+2)/2%64);let i=b;for(let e=0;e<7;e++)t=(t<<x^(t>>C)*T)%w,t&S&&(i^=x<<(x<<BigInt(e))-x);O.push(i)}k=c(O,!0),A=k[0],j=k[1],M=(e,t,n)=>n>32?_(e,t,n):f(e,t,n),N=(e,t,n)=>n>32?d(e,t,n):h(e,t,n),P=class e extends t{constructor(e,t,r,i=!1,a=24){if(super(),this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,this.enableXOF=!1,this.blockLen=e,this.suffix=t,this.outputLen=r,this.enableXOF=i,this.rounds=a,n(r),!(0<e&&e<200))throw Error(`only keccak-f1600 function is supported`);this.state=new Uint8Array(200),this.state32=g(this.state)}clone(){return this._cloneInto()}keccak(){u(this.state32),y(this.state32,this.rounds),u(this.state32),this.posOut=0,this.pos=0}update(e){l(this),e=i(e),v(e);let{blockLen:t,state:n}=this,r=e.length;for(let i=0;i<r;){let a=Math.min(t-this.pos,r-i);for(let t=0;t<a;t++)n[this.pos++]^=e[i++];this.pos===t&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;let{state:e,suffix:t,pos:n,blockLen:r}=this;e[n]^=t,t&128&&n===r-1&&this.keccak(),e[r-1]^=128,this.keccak()}writeInto(e){l(this,!1),v(e),this.finish();let t=this.state,{blockLen:n}=this;for(let r=0,i=e.length;r<i;){this.posOut>=n&&this.keccak();let a=Math.min(n-this.posOut,i-r);e.set(t.subarray(this.posOut,this.posOut+a),r),this.posOut+=a,r+=a}return e}xofInto(e){if(!this.enableXOF)throw Error(`XOF is not possible for this instance`);return this.writeInto(e)}xof(e){return n(e),this.xofInto(new Uint8Array(e))}digestInto(e){if(o(e,this),this.finished)throw Error(`digest() was already called`);return this.writeInto(e),this.destroy(),e}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,p(this.state)}_cloneInto(t){let{blockLen:n,suffix:r,outputLen:i,rounds:a,enableXOF:o}=this;return t||=new e(n,r,i,o,a),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=a,t.suffix=r,t.outputLen=i,t.enableXOF=o,t.destroyed=this.destroyed,t}},F=(e,t,n)=>a(()=>new P(t,e,n)),F(6,144,224/8),I=F(6,136,256/8),F(6,104,384/8),F(6,72,512/8),F(1,144,224/8),L=F(1,136,256/8),F(1,104,384/8),F(1,72,512/8),R=(e,t,n)=>r((r={})=>new P(t,e,r.dkLen===void 0?n:r.dkLen,!0)),R(31,168,128/8),R(31,136,256/8)}));export{L as n,I as r,z as t};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.