1const K="6.13.5";function q(t,n,e){const r=n.split("|").map(s=>s.trim());for(let s=0;s<r.length;s++)switch(n){case"any":return;case"bigint":case"boolean":case"number":case"string":if(typeof t===n)return}const o=new Error(`invalid value for type ${n}`);throw o.code="INVALID_ARGUMENT",o.argument=`value.${e}`,o.value=t,o}function L(t,n,e){for(let r in n){let o=n[r];const s=e?e[r]:null;s&&q(o,s,r),Object.defineProperty(t,r,{enumerable:!0,value:o,writable:!1})}}function u(t){if(t==null)return"null";if(Array.isArray(t))return"[ "+t.map(u).join(", ")+" ]";if(t instanceof Uint8Array){const n="0123456789abcdef";let e="0x";for(let r=0;r<t.length;r++)e+=n[t[r]>>4],e+=n[t[r]&15];return e}if(typeof t=="object"&&typeof t.toJSON=="function")return u(t.toJSON());switch(typeof t){case"boolean":case"symbol":return t.toString();case"bigint":return BigInt(t).toString();case"number":return t.toString();case"string":return JSON.stringify(t);case"object":{const n=Object.keys(t);return n.sort(),"{ "+n.map(e=>`${u(e)}: ${u(t[e])}`).join(", ")+" }"}}return"[ COULD NOT SERIALIZE ]"}function Nt(t,n){return t&&t.code===n}function W(t,n,e){let r=t;{const s=[];if(e){if("message"in e||"code"in e||"name"in e)throw new Error(`value will overwrite populated values: ${u(e)}`);for(const i in e){if(i==="shortMessage")continue;const c=e[i];s.push(i+"="+u(c))}}s.push(`code=${n}`),s.push(`version=${K}`),s.length&&(t+=" ("+s.join(", ")+")")}let o;switch(n){case"INVALID_ARGUMENT":o=new TypeError(t);break;case"NUMERIC_FAULT":case"BUFFER_OVERRUN":o=new RangeError(t);break;default:o=new Error(t)}return L(o,{code:n}),e&&Object.assign(o,e),o.shortMessage==null&&L(o,{shortMessage:r}),o}function h(t,n,e,r){if(!t)throw W(n,e,r)}function Z(t,n,e,r){h(t,n,"INVALID_ARGUMENT",{argument:e,value:r})}function St(t,n,e){e==null&&(e=""),e&&(e=": "+e),h(t>=n,"missing argument"+e,"MISSING_ARGUMENT",{count:t,expectedCount:n}),h(t<=n,"too many arguments"+e,"UNEXPECTED_ARGUMENT",{count:t,expectedCount:n})}["NFD","NFC","NFKD","NFKC"].reduce((t,n)=>{try{if("test".normalize(n)!=="test")throw new Error("bad");if(n==="NFD"&&"é".normalize("NFD")!=="eÌ")throw new Error("broken");t.push(n)}catch{}return t},[]);function Tt(t,n,e){if(e==null&&(e=""),t!==n){let r=e,o="new";e&&(r+=".",o+=" "+e),h(!1,`private constructor; use ${r}from* methods`,"UNSUPPORTED_OPERATION",{operation:o})}}function B(t,n,e){if(t instanceof Uint8Array)return e?new Uint8Array(t):t;if(typeof t=="string"&&t.match(/^0x(?:[0-9a-f][0-9a-f])*$/i)){const r=new Uint8Array((t.length-2)/2);let o=2;for(let s=0;s<r.length;s++)r[s]=parseInt(t.substring(o,o+2),16),o+=2;return r}Z(!1,"invalid BytesLike value",n||"value",t)}function w(t,n){return B(t,n,!1)}function Ht(t,n){return B(t,n,!0)}function m(t,n){return!(typeof t!="string"||!t.match(/^0x[0-9A-Fa-f]*$/)||typeof n=="number"&&t.length!==2+2*n||n===!0&&t.length%2!==0)}function Rt(t){return m(t,!0)||t instanceof Uint8Array}const I="0123456789abcdef";function x(t){const n=w(t);let e="0x";for(let r=0;r<n.length;r++){const o=n[r];e+=I[(o&240)>>4]+I[o&15]}return e}function Ft(t){return"0x"+t.map(n=>x(n).substring(2)).join("")}function $t(t){return m(t,!0)?(t.length-2)/2:w(t).length}function Q(t,n,e){const r=w(t);h(n>=r.length,"padding exceeds data length","BUFFER_OVERRUN",{buffer:new Uint8Array(r),length:n,offset:n+1});const o=new Uint8Array(n);return o.fill(0),o.set(r,n-r.length),x(o)}function Mt(t,n){return Q(t,n)}function g(t){if(!Number.isSafeInteger(t)||t<0)throw new Error(`Wrong positive integer: ${t}`)}function N(t,...n){if(!(t instanceof Uint8Array))throw new Error("Expected Uint8Array");if(n.length>0&&!n.includes(t.length))throw new Error(`Expected Uint8Array of length ${n}, not of length=${t.length}`)}function jt(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");g(t.outputLen),g(t.blockLen)}function U(t,n=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(n&&t.finished)throw new Error("Hash#digest() has already been called")}function Y(t,n){N(t);const e=n.outputLen;if(t.length<e)throw new Error(`digestInto() expects output buffer of length at least ${e}`)}const A=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const S=t=>t instanceof Uint8Array,v=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),Ct=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),Pt=(t,n)=>t<<32-n|t>>>
1n,tt=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;if(!tt)throw new Error("Non little-endian hardware is not supported");function nt(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function T(t){if(typeof t=="string"&&(t=nt(t)),!S(t))throw new Error(`expected Uint8Array, got ${typeof t}`);return t}function Dt(...t){const n=new Uint8Array(t.reduce((r,o)=>r+o.length,0));let e=0;return t.forEach(r=>{if(!S(r))throw new Error("Uint8Array expected");n.set(r,e),e+=r.length}),n}class et{clone(){return this._cloneInto()}}function rt(t){const n=r=>t().update(T(r)).digest(),e=t();return n.outputLen=e.outputLen,n.blockLen=e.blockLen,n.create=()=>t(),n}function Vt(t=32){if(A&&typeof A.getRandomValues=="function")return A.getRandomValues(new Uint8Array(t));throw new Error("crypto.getRandomValues must be defined")}const y=BigInt(2**32-1),k=BigInt(32);function H(t,n=!1){return n?{h:Number(t&y),l:Number(t>>k&y)}:{h:Number(t>>k&y)|0,l:Number(t&y)|0}}
1function R(t,n=!1){let e=new Uint32Array(t.length),r=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:s,l:i}=H(t[o],n);[e[o],r[o]]=[s,i]}return[e,r]}const ot=(t,n)=>BigInt(t>>>0)<<k|BigInt(n>>>0),st=(t,n,e)=>t>>>e,it=(t,n,e)=>t<<32-e|n>>>e,ct=(t,n,e)=>t>>>e|n<<32-e,ft=(t,n,e)=>t<<32-e|n>>>e,ut=(t,n,e)=>t<<64-e|n>>>e-32,at=(t,n,e)=>t>>>e-32|n<<64-e,ht=(t,n)=>n,lt=(t,n)=>t,F=(t,n,e)=>t<<e|n>>>32-e,$=(t,n,e)=>n<<e|t>>>32-e,M=(t,n,e)=>n<<e-32|t>>>64-e,j=(t,n,e)=>t<<e-32|n>>>64-e;function dt(t,n,e,r){const o=(n>>>0)+(r>>>0);return{h:t+e+(o/2**32|0)|0,l:o|0}}const pt=(t,n,e)=>(t>>>0)+(n>>>0)+(e>>>0),yt=(t,n,e,r)=>n+e+r+(t/2**32|0)|0,gt=(t,n,e,r)=>(t>>>0)+(n>>>0)+(e>>>0)+(r>>>0),wt=(t,n,e,r,o)=>n+e+r+o+(t/2**32|0)|0,bt=(t,n,e,r,o)=>(t>>>0)+(n>>>0)+(e>>>0)+(r>>>0)+(o>>>0),At=(t,n,e,r,o,s)=>n+e+r+o+s+(t/2**32|0)|0,Xt={fromBig:H,split:R,toBig:ot,shrSH:st,shrSL:it,rotrSH:ct,rotrSL:ft,rotrBH:ut,rotrBL:at,rotr32H:ht,rotr32L:lt,rotlSH:F,rotlSL:$,rotlBH:M,rotlBL:j,add:dt,add3L:pt,add3H:yt,add4L:gt,add4H:wt,add5H:At,add5L:bt},[C,P,D]=[[],[],[]],kt=BigInt(0),a=BigInt(1),xt=BigInt(2),Et=BigInt(7),Lt=BigInt(256),It=BigInt(113);for(let t=0,n=a,e=1,r=0;t<24;t++){[e,r]=[r,(2*e+3*r)%5],C.push(2*(5*r+e)),P.push((t+1)*(t+2)/2%64);let o=kt;for(let s=0;s<7;s++)n=(n<<a^(n>>Et)*It)%Lt,n&xt&&(o^=a<<(a<<BigInt(s))-a);D.push(o)}const[Ut,Ot]=R(D,!0),O=(t,n,e)=>e>32?M(t,n,e):F(t,n,e),_=(t,n,e)=>e>32?j(t,n,e):$(t,n,e);function _t(t,n=24){const e=new Uint32Array(10);for(let r=24-n;r<24;r++){for(let i=0;i<10;i++)e[i]=t[i]^t[i+10]^t[i+20]^t[i+30]^t[i+40];for(let i=0;i<10;i+=2){const c=(i+8)%10,l=(i+2)%10,d=e[l],f=e[l+1],G=O(d,f,1)^e[c],J=_(d,f,1)^e[c+1];for(let p=0;p<50;p+=10)t[i+p]^=G,t[i+p+1]^=J}let o=t[2],s=t[3];for(let i=0;i<24;i++){const c=P[i],l=O(o,s,c),d=_(o,s,c),f=C[i];
1o=t[f],s=t[f+1],t[f]=l,t[f+1]=d}for(let i=0;i<50;i+=10){for(let c=0;c<10;c++)e[c]=t[i+c];for(let c=0;c<10;c++)t[i+c]^=~e[(c+2)%10]&e[(c+4)%10]}t[0]^=Ut[r],t[1]^=Ot[r]}e.fill(0)}class E extends et{constructor(n,e,r,o=!1,s=24){if(super(),this.blockLen=n,this.suffix=e,this.outputLen=r,this.enableXOF=o,this.rounds=s,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,g(r),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=v(this.state)}keccak(){_t(this.state32,this.rounds),this.posOut=0,this.pos=0}update(n){U(this);const{blockLen:e,state:r}=this;n=T(n);const o=n.length;for(let s=0;s<o;){const i=Math.min(e-this.pos,o-s);for(let c=0;c<i;c++)r[this.pos++]^=n[s++];this.pos===e&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:n,suffix:e,pos:r,blockLen:o}=this;n[r]^=e,(e&128)!==0&&r===o-1&&this.keccak(),n[o-1]^=128,this.keccak()}writeInto(n){U(this,!1),N(n),this.finish();const e=this.state,{blockLen:r}=this;for(let o=0,s=n.length;o<s;){this.posOut>=r&&this.keccak();const i=Math.min(r-this.posOut,s-o);n.set(e.subarray(this.posOut,this.posOut+i),o),this.posOut+=i,o+=i}return n}xofInto(n){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(n)}xof(n){return g(n),this.xofInto(new Uint8Array(n))}digestInto(n){if(Y(n,this),this.finished)throw new Error("digest() was already called");return this.writeInto(n),this.destroy(),n}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(n){const{blockLen:e,suffix:r,outputLen:o,rounds:s,enableXOF:i}=this;return n||(n=new E(e,r,o,i,s)),n.state32.set(this.state32),n.pos=this.pos,n.posOut=this.posOut,n.finished=this.finished,n.rounds=s,n.suffix=r,n.outputLen=o,n.enableXOF=i,n.destroyed=this.destroyed,n}}const Bt=(t,n,e)=>rt(()=>new E(n,t,e)),mt=Bt(1,136,256/8);let V=!1;const X=function(t){return mt(t)};let z=X;function b(t){const n=w(t,"data");return x(z(n))}b._=X;b.lock=function(){V=!0};b.register=function(t){if(V)throw new TypeError("keccak256 is locked");z=t};Object.freeze(b);export{Rt as A,et as H,h as a,Z as b,Ft as c,L as d,Tt as e,St as f,Ht as g,x as h,Nt as i,w as j,jt as k,U as l,W as m,N as n,Ct as o,Y as p,Vt as q,Pt as r,Dt as s,T as t,Xt as u,$t as v,rt as w,m as x,b as y,Mt as z};
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.