1var x=(f,a,r)=>new Promise((n,e)=>{var i=t=>{try{u(r.next(t))}catch(o){e(o)}},d=t=>{try{u(r.throw(t))}catch(o){e(o)}},u=t=>t.done?n(t.value):Promise.resolve(t.value).then(i,d);u((r=r.apply(f,a)).next())});import{c as A}from"./base-components-Bh4UEd0g.js";function B(f,a){for(var r=0;r<a.length;r++){const n=a[r];if(typeof n!="string"&&!Array.isArray(n)){for(const e in n)if(e!=="default"&&!(e in f)){const i=Object.getOwnPropertyDescriptor(n,e);i&&Object.defineProperty(f,e,i.get?i:{enumerable:!0,get:()=>n[e]})}}}return Object.freeze(Object.defineProperty(f,Symbol.toStringTag,{value:"Module"}))}var y={exports:{}},b;function I(){return b||(b=1,(function(f,a){(function(r,n){f.exports=n()})(self,(function(){return(()=>{var r={};return((n,e)=>{Object.defineProperty(e,"__esModule",{value:!0}),e.generate_work=e.score=e.digest=void 0;const i=BigInt("340282366920938463463374607431768211455"),d=new TextEncoder,u=new TextDecoder("utf-8");e.digest=t=>x(null,null,function*(){const o=d.encode(t),s=yield crypto.subtle.digest("SHA-256",o);return Array.from(new Uint8Array(s))}),e.score=t=>{let o=BigInt(0);for(let s=15;s>=0;s--)o+=BigInt(t[s])<<BigInt(8*(15-s));return o},e.generate_work=(t,o,s)=>x(null,null,function*(){const v=t+u.decode((g=>{const _=[(255&(c=g.length))>>0,(65280&c)>>8,(16711680&c)>>16,(4278190080&c)>>24,(0xff00000000&c)>>32,(0xff000000000&c)>>48,(0xff00000000000&c)>>56,Number((BigInt(0xff0000000000000)&BigInt(c))>>BigInt(64))];var c;return new Uint8Array(_.concat(Array.from(d.encode(g))))})(o));let l=0,p=BigInt(0);const w=i-i/BigInt(s);for(;p<w;){l+=1;const g=yield(0,e.digest)(v+l.toString());p=(0,e.score)(g)}return{result:p.toString(),nonce:l}})})(0,r),r})()}))})(y)),y.exports}var m=I();const j=A(m),S=B({__proto__:null,default:j},[m]);export{S as i};
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.