1var Se=Object.defineProperty;var Ae=(n,t,r)=>t in n?Se(n,t,{enumerable:!0,configurable:!0,writable:!0,value:r}):n[t]=r;var m=(n,t,r)=>Ae(n,typeof t!="symbol"?t+"":t,r);function Pt(n){return n instanceof Uint8Array||ArrayBuffer.isView(n)&&n.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in n&&n.BYTES_PER_ELEMENT===1}function it(n,t=""){if(typeof n!="number"){const r=t&&`"${t}" `;throw new TypeError(`${r}expected number, got ${typeof n}`)}if(!Number.isSafeInteger(n)||n<0){const r=t&&`"${t}" `;throw new RangeError(`${r}expected integer >= 0, got ${n}`)}}function st(n,t,r=""){const e=Pt(n),o=n==null?void 0:n.length,i=t!==void 0;if(!e||i&&o!==t){const c=r&&`"${r}" `,s=i?` of length ${t}`:"",f=e?`length=${o}`:`type=${typeof n}`,a=c+"expected Uint8Array"+s+", got "+f;throw e?new RangeError(a):new TypeError(a)}return n}function Qt(n){if(typeof n!="function"||typeof n.create!="function")throw new TypeError("Hash must wrapped by utils.createHasher");if(it(n.outputLen),it(n.blockLen),n.outputLen<1)throw new Error('"outputLen" must be >= 1');if(n.blockLen<1)throw new Error('"blockLen" must be >= 1')}function pt(n,t=!0){if(n.destroyed)throw new Error("Hash instance has been destroyed");if(t&&n.finished)throw new Error("Hash#digest() has already been called")}function Jt(n,t){st(n,void 0,"digestInto() output");const r=t.outputLen;if(n.length<r)throw new RangeError('"digestInto() output" expected to be of length >='+r)}function yt(...n){for(let t=0;t<n.length;t++)n[t].fill(0)}function vt(n){return new DataView(n.buffer,n.byteOffset,n.byteLength)}function X(n,t){return n<<32-t|n>>>t}const te=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",Fe=Array.from({length:256},(n,t)=>t.toString(16).padStart(2,"0"));function Nt(n){if(st(n),te)return n.toHex();let t="";for(let r=0;r<n.length;r++)t+=Fe[n[r]];return t}const W={_0:48,_9:57,A:65,F:70,a:97,f:102};function Yt(n){if(n>=W._0&&n<=W._9)return n-W._0;if(n>=W.A&&n<=W.F)return n-(W.A-10);if(n>=W.a&&n<=W.f)return n-(W.a-10)}function ee(n){if(typeof n!="string")throw new TypeError("hex string expected, got "+typeof n);if(te)try{return Uint8Array.fromHex(n)}catch(o){throw o instanceof SyntaxError?new RangeError(o.message):o}const t=n.length,r=t/2;if(t%2)throw new RangeError("hex string expected, got unpadded hex of length "+t);const e=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const c=Yt(n.charCodeAt(i)),s=Yt(n.charCodeAt(i+1));if(c===void 0||s===void 0){const f=n[i]+n[i+1];throw new RangeError('hex string expected, got non-hex character "'+f+'" at index '+i)}e[o]=c*16+s}return e}function Le(...n){let t=0;for(let e=0;e<n.length;e++){const o=n[e];st(o),t+=o.length}const r=new Uint8Array(t);for(let e=0,o=0;e<n.length;e++){const i=n[e];r.set(i,o),o+=i.length}return r}function Ie(n,t={}){const r=(o,i)=>n(i).update(o).digest(),e=n(void 0);return r.outputLen=e.outputLen,r.blockLen=e.blockLen,r.canXOF=e.canXOF,r.create=o=>n(o),Object.assign(r,t),Object.freeze(r)}function _e(n=32){it(n,"bytesLength");const t=typeof globalThis=="object"?globalThis.crypto:null;if(typeof(t==null?void 0:t.getRandomValues)!="function")throw new Error("crypto.getRandomValues must be defined");if(n>65536)throw new RangeError(`"bytesLength" expected <= 65536, got ${n}`);return t.getRandomValues(new Uint8Array(n))}const Ne=n=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,n])});function He(n,t,r){return n&t^~n&r}function Te(n,t,r){return n&t^n&r^t&r}class qe{constructor(t,r,e,o){m(this,"blockLen");m(this,"outputLen");m(this,"canXOF",!1);m(this,"padOffset");m(this,"isLE");m(this,"buffer");m(this,"view");m(this,"finished",!1);m(this,"length",0);m(this,"pos",0);m(this,"destroyed",!1);this.blockLen=t,this.outputLen=r,this.padOffset=e,this.isLE=o,this.buffer=new Uint8Array(t),this.view=vt(this.buffer)}update(t){pt(this),st(t);const{view:r,buffer:e,blockLen:o}=this,i=t.length;for(let c=0;c<i;){const s=Math.min(o-this.pos,i-c);if(s===o){const f=vt(t);for(;o<=i-c;c+=o)this.process(f,c);continue}e.set(t.subarray(c,c+s),this.pos),this.pos+=s,c+=s,this.pos===o&&(this.process(r,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){pt(this),Jt(t,this),this.finished=!0;const{buffer:r,view:e,blockLen:o,isLE:i}=this;let{pos:c}=this;r[c++]=128,yt(this.buffer.subarray(c)),this.padOffset>o-c&&(this.process(e,0),c=0);for(let b=c;b<o;b++)r[b]=0;
1e.setBigUint64(o-8,BigInt(this.length*8),i),this.process(e,0);const s=vt(t),f=this.outputLen;if(f%4)throw new Error("_sha2: outputLen must be aligned to 32bit");const a=f/4,h=this.get();if(a>h.length)throw new Error("_sha2: outputLen bigger than state");for(let b=0;b<a;b++)s.setUint32(4*b,h[b],i)}digest(){const{buffer:t,outputLen:r}=this;this.digestInto(t);const e=t.slice(0,r);return this.destroy(),e}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:r,buffer:e,length:o,finished:i,destroyed:c,pos:s}=this;return t.destroyed=c,t.finished=i,t.length=o,t.pos=s,o%r&&t.buffer.set(e),t}clone(){return this._cloneInto()}}const Q=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),Ze=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),J=new Uint32Array(64);class Ue extends qe{constructor(t){super(64,t,8,!1)}get(){const{A:t,B:r,C:e,D:o,E:i,F:c,G:s,H:f}=this;return[t,r,e,o,i,c,s,f]}set(t,r,e,o,i,c,s,f){this.A=t|0,this.B=r|0,this.C=e|0,this.D=o|0,this.E=i|0,this.F=c|0,this.G=s|0,this.H=f|0}process(t,r){for(let b=0;b<16;b++,r+=4)J[b]=t.getUint32(r,!1);for(let b=16;b<64;b++){const O=J[b-15],x=J[b-2],S=X(O,7)^X(O,18)^O>>>3,L=X(x,17)^X(x,19)^x>>>10;J[b]=L+J[b-7]+S+J[b-16]|0}let{A:e,B:o,C:i,D:c,E:s,F:f,G:a,H:h}=this;for(let b=0;b<64;b++){const O=X(s,6)^X(s,11)^X(s,25),x=h+O+He(s,f,a)+Ze[b]+J[b]|0,L=(X(e,2)^X(e,13)^X(e,22))+Te(e,o,i)|0;h=a,a=f,f=s,s=c+x|0,c=i,i=o,o=e,e=x+L|0}e=e+this.A|0,o=o+this.B|0,i=i+this.C|0,c=c+this.D|0,s=s+this.E|0,f=f+this.F|0,a=a+this.G|0,h=h+this.H|0,this.set(e,o,i,c,s,f,a,h)}roundClean(){yt(J)}destroy(){this.destroyed=!0,this.set(0,0,0,0,0,0,0,0),yt(this.buffer)}}class De extends Ue{constructor(){super(32);m(this,"A",Q[0]|0);m(this,"B",Q[1]|0);m(this,"C",Q[2]|0);m(this,"D",Q[3]|0);m(this,"E",Q[4]|0);m(this,"F",Q[5]|0);m(this,"G",Q[6]|0);m(this,"H",Q[7]|0)}}const $e=Ie(()=>new De,Ne(1));/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const j=(n,t,r)=>st(n,t,r),ne=it,re=Nt,tt=(...n)=>Le(...n),Ft=n=>ee(n),oe=Pt,ie=n=>_e(n),Et=BigInt(0),Lt=BigInt(1);function lt(n,t=""){if(typeof n!="boolean"){const r=t&&`"${t}" `;throw new TypeError(r+"expected boolean, got type="+typeof n)}return n}function Ht(n){if(typeof n=="bigint"){if(!bt(n))throw new RangeError("positive bigint expected, got "+n)}else ne(n);return n}function It(n,t=""){if(typeof n!="number"){const r=t&&`"${t}" `;throw new TypeError(r+"expected number, got type="+typeof n)}if(!Number.isSafeInteger(n)){const r=t&&`"${t}" `;throw new RangeError(r+"expected safe integer, got "+n)}}function wt(n){const t=Ht(n).toString(16);return t.length&1?"0"+t:t}function se(n){if(typeof n!="string")throw new TypeError("hex string expected, got "+typeof n);return n===""?Et:BigInt("0x"+n)}function xt(n){return se(Nt(n))}function ce(n){return se(Nt(je(st(n)).reverse()))}function Tt(n,t){if(it(t),t===0)throw new RangeError("zero length");n=Ht(n);const r=n.toString(16);if(r.length>t*2)throw new RangeError("number too large");return ee(r.padStart(t*2,"0"))}function fe(n,t){return Tt(n,t).reverse()}function je(n){return Uint8Array.from(j(n))}const bt=n=>typeof n=="bigint"&&Et<=n;function Ye(n,t,r){return bt(n)&&bt(t)&&bt(r)&&t<=n&&n<r}function ue(n,t,r,e){if(!Ye(t,r,e))throw new RangeError("expected valid "+n+": "+r+" <= n < "+e+", got "+t)}function qt(n){if(n<Et)throw new Error("expected non-negative bigint, got "+n);let t;for(t=0;n>Et;n>>=Lt,t+=1);return t}const Zt=n=>(Lt<<BigInt(n))-Lt;
1function ke(n,t,r){if(it(n,"hashLen"),it(t,"qByteLen"),typeof r!="function")throw new TypeError("hmacFn must be a function");const e=A=>new Uint8Array(A),o=Uint8Array.of(),i=Uint8Array.of(0),c=Uint8Array.of(1),s=1e3;let f=e(n),a=e(n),h=0;const b=()=>{f.fill(1),a.fill(0),h=0},O=(...A)=>r(a,tt(f,...A)),x=(A=o)=>{a=O(i,A),f=O(),A.length!==0&&(a=O(c,A),f=O())},S=()=>{if(h++>=s)throw new Error("drbg: tried max amount of iterations");let A=0;const I=[];for(;A<t;){f=O();const U=f.slice();I.push(U),A+=f.length}return tt(...I)};return(A,I)=>{b(),x(A);let U;for(;(U=I(S()))===void 0;)x();return b(),U}}function Bt(n,t={},r={}){if(Object.prototype.toString.call(n)!=="[object Object]")throw new TypeError("expected valid options object");function e(i,c,s){if(!s&&c!=="function"&&!Object.hasOwn(n,i))throw new TypeError(`param "${i}" is invalid: expected own property`);const f=n[i];if(s&&f===void 0)return;const a=typeof f;if(a!==c||f===null)throw new TypeError(`param "${i}" is invalid: expected ${c}, got ${a}`)}const o=(i,c)=>Object.entries(i).forEach(([s,f])=>e(s,f,c));o(t,!1),o(r,!0)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const k=BigInt(0),Z=BigInt(1),rt=BigInt(2),ae=BigInt(3),de=BigInt(4),le=BigInt(5),Ve=BigInt(7),he=BigInt(8),ze=BigInt(9),we=BigInt(16);function C(n,t){if(t<=k)throw new Error("mod: expected positive modulus, got "+t);const r=n%t;return r>=k?r:t+r}function kt(n,t){if(n===k)throw new Error("invert: expected non-zero number");if(t<=k)throw new Error("invert: expected positive modulus, got "+t);let r=C(n,t),e=t,o=k,i=Z;for(;r!==k;){const s=e/r,f=e-r*s,a=o-i*s;e=r,r=f,o=i,i=a}if(e!==Z)throw new Error("invert: does not exist");return C(o,t)}function Ut(n,t,r){const e=n;if(!e.eql(e.sqr(t),r))throw new Error("Cannot find square root")}function ge(n,t){const r=n,e=(r.ORDER+Z)/de,o=r.pow(t,e);return Ut(r,o,t),o}function Ce(n,t){const r=n,e=(r.ORDER-le)/he,o=r.mul(t,rt),i=r.pow(o,e),c=r.mul(t,i),s=r.mul(r.mul(c,rt),i),f=r.mul(c,r.sub(s,r.ONE));return Ut(r,f,t),f}function Me(n){const t=Dt(n),r=be(n),e=r(t,t.neg(t.ONE)),o=r(t,e),i=r(t,t.neg(e)),c=(n+Ve)/we;return(s,f)=>{const a=s;let h=a.pow(f,c),b=a.mul(h,e);
1const O=a.mul(h,o),x=a.mul(h,i),S=a.eql(a.sqr(b),f),L=a.eql(a.sqr(O),f);h=a.cmov(h,b,S),b=a.cmov(x,O,L);const A=a.eql(a.sqr(b),f),I=a.cmov(h,b,A);return Ut(a,I,f),I}}function be(n){if(n<ae)throw new Error("sqrt is not defined for small field");let t=n-Z,r=0;for(;t%rt===k;)t/=rt,r++;let e=rt;const o=Dt(n);for(;Vt(o,e)===1;)if(e++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(r===1)return ge;let i=o.pow(e,t);const c=(t+Z)/rt;return function(f,a){const h=f;if(h.is0(a))return a;if(Vt(h,a)!==1)throw new Error("Cannot find square root");let b=r,O=h.mul(h.ONE,i),x=h.pow(a,t),S=h.pow(a,c);for(;!h.eql(x,h.ONE);){if(h.is0(x))return h.ZERO;let L=1,A=h.sqr(x);for(;!h.eql(A,h.ONE);)if(L++,A=h.sqr(A),L===b)throw new Error("Cannot find square root");const I=Z<<BigInt(b-L-1),U=h.pow(O,I);b=L,O=h.sqr(U),x=h.mul(x,O),S=h.mul(S,U)}return S}}function Xe(n){return n%de===ae?ge:n%he===le?Ce:n%we===ze?Me(n):be(n)}const Ke=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Ge(n){const t={ORDER:"bigint",BYTES:"number",BITS:"number"},r=Ke.reduce((e,o)=>(e[o]="function",e),t);if(Bt(n,r),It(n.BYTES,"BYTES"),It(n.BITS,"BITS"),n.BYTES<1||n.BITS<1)throw new Error("invalid field: expected BYTES/BITS > 0");if(n.ORDER<=Z)throw new Error("invalid field: expected ORDER > 1, got "+n.ORDER);return n}function We(n,t,r){const e=n;if(r<k)throw new Error("invalid exponent, negatives unsupported");if(r===k)return e.ONE;if(r===Z)return t;let o=e.ONE,i=t;for(;r>k;)r&Z&&(o=e.mul(o,i)),i=e.sqr(i),r>>=Z;return o}function pe(n,t,r=!1){const e=n,o=new Array(t.length).fill(r?e.ZERO:void 0),i=t.reduce((s,f,a)=>e.is0(f)?s:(o[a]=s,e.mul(s,f)),e.ONE),c=e.inv(i);return t.reduceRight((s,f,a)=>e.is0(f)?s:(o[a]=e.mul(s,o[a]),e.mul(s,f)),c),o}function Vt(n,t){const r=n,e=(r.ORDER-Z)/rt,o=r.pow(t,e),i=r.eql(o,r.ONE),c=r.eql(o,r.ZERO),s=r.eql(o,r.neg(r.ONE));if(!i&&!c&&!s)throw new Error("invalid Legendre symbol result");return i?1:c?0:-1}function Pe(n,t){if(t!==void 0&&ne(t),n<=k)throw new Error("invalid n length: expected positive n, got "+n);if(t!==void 0&&t<1)throw new Error("invalid n length: expected positive bit length, got "+t);const r=qt(n);if(t!==void 0&&t<r)throw new Error(`invalid n length: expected bit length (${r}) >= n.length (${t})`);const e=t!==void 0?t:r,o=Math.ceil(e/8);return{nBitLength:e,nByteLength:o}}const zt=new WeakMap;class ye{constructor(t,r={}){m(this,"ORDER");m(this,"BITS");m(this,"BYTES");m(this,"isLE");m(this,"ZERO",k);m(this,"ONE",Z);m(this,"_lengths");m(this,"_mod");if(t<=Z)throw new Error("invalid field: expected ORDER > 1, got "+t);let e;this.isLE=!1,r!=null&&typeof r=="object"&&(typeof r.BITS=="number"&&(e=r.BITS),typeof r.sqrt=="function"&&Object.defineProperty(this,"sqrt",{value:r.sqrt,enumerable:!0}),typeof r.isLE=="boolean"&&(this.isLE=r.isLE),r.allowedLengths&&(this._lengths=Object.freeze(r.allowedLengths.slice())),typeof r.modFromBytes=="boolean"&&(this._mod=r.modFromBytes));const{nBitLength:o,nByteLength:i}=Pe(t,e);if(i>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=t,this.BITS=o,this.BYTES=i,Object.freeze(this)}create(t){return C(t,this.ORDER)}isValid(t){if(typeof t!="bigint")throw new TypeError("invalid field element: expected bigint, got "+typeof t);return k<=t&&t<this.ORDER}is0(t){return t===k}isValidNot0(t){return!this.is0(t)&&this.isValid(t)}isOdd(t){return(t&Z)===Z}neg(t){return C(-t,this.ORDER)}eql(t,r){return t===r}sqr(t){return C(t*t,this.ORDER)}add(t,r){return C(t+r,this.ORDER)}sub(t,r){return C(t-r,this.ORDER)}mul(t,r){return C(t*r,this.ORDER)}pow(t,r){return We(this,t,r)}div(t,r){return C(t*kt(r,this.ORDER),this.ORDER)}sqrN(t){return t*t}addN(t,r){return t+r}subN(t,r){return t-r}mulN(t,r){return t*r}inv(t){return kt(t,this.ORDER)}sqrt(t){let r=zt.get(this);return r||zt.set(this,r=Xe(this.ORDER)),r(this,t)}toBytes(t){return this.isLE?fe(t,this.BYTES):Tt(t,this.BYTES)}fromBytes(t,r=!1){j(t);const{_lengths:e,BYTES:o,isLE:i,ORDER:c,_mod:s}=this;if(e){if(t.length<1||!e.includes(t.length)||t.length>o)throw new Error("Field.fromBytes: expected "+e+" bytes, got "+t.length);const a=new Uint8Array(o);a.set(t,i?0:a.length-t.length),t=a}if(t.length!==o)throw new Error("Field.fromBytes: expected "+o+" bytes, got "+t.length);let f=i?ce(t):xt(t);if(s&&(f=C(f,c)),!r&&!this.isValid(f))throw new Error("invalid field element: outside of range 0..ORDER");return f}invertBatch(t){return pe(this,t)}cmov(t,r,e){return lt(e,"condition"),e?r:t}}Object.freeze(ye.prototype);function Dt(n,t={}){return new ye(n,t)}function Ee(n){if(typeof n!="bigint")throw new Error("field order must be bigint");if(n<=Z)throw new Error("field order must be greater than 1");const t=qt(n-Z);return Math.ceil(t/8)}function me(n){const t=Ee(n);return t+Math.ceil(t/2)}function Qe(n,t,r=!1){j(n);const e=n.length,o=Ee(t),i=Math.max(me(t),16);if(e<i||e>1024)throw new Error("expected "+i+"-1024 bytes of input, got "+e);const c=r?ce(n):xt(n),s=C(c,t-Z)+Z;return r?fe(s,o):Tt(s,o)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const ut=BigInt(0),ot=BigInt(1);function mt(n,t){const r=t.negate();return n?r:t}function Ct(n,t){const r=pe(n.Fp,t.map(e=>e.Z));return t.map((e,o)=>n.fromAffine(e.toAffine(r[o])))}function xe(n,t){if(!Number.isSafeInteger(n)||n<=0||n>t)throw new Error("invalid window size, expected [1.."+t+"], got W="+n)}function Rt(n,t){xe(n,t);const r=Math.ceil(t/n)+1,e=2**(n-1),o=2**n,i=Zt(n),c=BigInt(n);return{windows:r,windowSize:e,mask:i,maxNumber:o,shiftBy:c}}function Mt(n,t,r){const{windowSize:e,mask:o,maxNumber:i,shiftBy:c}=r;let s=Number(n&o),f=n>>c;s>e&&(s-=i,f+=ot);const a=t*e,h=a+Math.abs(s)-1,b=s===0,O=s<0,x=t%2!==0;return{nextN:f,offset:h,isZero:b,isNeg:O,isNegF:x,offsetF:a}}const Ot=new WeakMap,Be=new WeakMap;function St(n){return Be.get(n)||1}function Xt(n){if(n!==ut)throw new Error("invalid wNAF")}class Je{constructor(t,r){m(this,"BASE");m(this,"ZERO");m(this,"Fn");m(this,"bits");this.BASE=t.BASE,this.ZERO=t.ZERO,this.Fn=t.Fn,this.bits=r}_unsafeLadder(t,r,e=this.ZERO){let o=t;for(;r>ut;)r&ot&&(e=e.add(o)),o=o.double(),r>>=ot;return e}precomputeWindow(t,r){const{windows:e,windowSize:o}=Rt(r,this.bits),i=[];let c=t,s=c;for(let f=0;f<e;f++){s=c,i.push(s);for(let a=1;a<o;a++)s=s.add(c),i.push(s);c=s.double()}return i}wNAF(t,r,e){if(!this.Fn.isValid(e))throw new Error("invalid scalar");let o=this.ZERO,i=this.BASE;const c=Rt(t,this.bits);for(let s=0;s<c.windows;
1s++){const{nextN:f,offset:a,isZero:h,isNeg:b,isNegF:O,offsetF:x}=Mt(e,s,c);e=f,h?i=i.add(mt(O,r[x])):o=o.add(mt(b,r[a]))}return Xt(e),{p:o,f:i}}wNAFUnsafe(t,r,e,o=this.ZERO){const i=Rt(t,this.bits);for(let c=0;c<i.windows&&e!==ut;c++){const{nextN:s,offset:f,isZero:a,isNeg:h}=Mt(e,c,i);if(e=s,!a){const b=r[f];o=o.add(h?b.negate():b)}}return Xt(e),o}getPrecomputes(t,r,e){let o=Ot.get(r);return o||(o=this.precomputeWindow(r,t),t!==1&&(typeof e=="function"&&(o=e(o)),Ot.set(r,o))),o}cached(t,r,e){const o=St(t);return this.wNAF(o,this.getPrecomputes(o,t,e),r)}unsafe(t,r,e,o){const i=St(t);return i===1?this._unsafeLadder(t,r,o):this.wNAFUnsafe(i,this.getPrecomputes(i,t,e),r,o)}createCache(t,r){xe(r,this.bits),Be.set(t,r),Ot.delete(t)}hasCache(t){return St(t)!==1}}function tn(n,t,r,e){let o=t,i=n.ZERO,c=n.ZERO;for(;r>ut||e>ut;)r&ot&&(i=i.add(o)),e&ot&&(c=c.add(o)),o=o.double(),r>>=ot,e>>=ot;return{p1:i,p2:c}}function Kt(n,t,r){if(t){if(t.ORDER!==n)throw new Error("Field.ORDER must match order: Fp == p, Fn == n");return Ge(t),t}else return Dt(n,{isLE:r})}function en(n,t,r={},e){if(e===void 0&&(e=n==="edwards"),!t||typeof t!="object")throw new Error(`expected valid ${n} CURVE object`);for(const f of["p","n","h"]){const a=t[f];if(!(typeof a=="bigint"&&a>ut))throw new Error(`CURVE.${f} must be positive bigint`)}const o=Kt(t.p,r.Fp,e),i=Kt(t.n,r.Fn,e),s=["Gx","Gy","a","b"];for(const f of s)if(!o.isValid(t[f]))throw new Error(`CURVE.${f} must be valid field element of CURVE.Fp`);return t=Object.freeze(Object.assign({},t)),{CURVE:t,Fp:o,Fn:i}}function nn(n,t){return function(e){const o=n(e);return{secretKey:o,publicKey:t(o)}}}class Gt{constructor(t,r){m(this,"oHash");m(this,"iHash");m(this,"blockLen");m(this,"outputLen");m(this,"canXOF",!1);m(this,"finished",!1);m(this,"destroyed",!1);if(Qt(t),st(r,void 0,"key"),this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const e=this.blockLen,o=new Uint8Array(e);o.set(r.length>e?t.create().update(r).digest():r);for(let i=0;i<o.length;i++)o[i]^=54;this.iHash.update(o),this.oHash=t.create();for(let i=0;i<o.length;i++)o[i]^=106;this.oHash.update(o),yt(o)}update(t){return pt(this),this.iHash.update(t),this}digestInto(t){pt(this),Jt(t,this),this.finished=!0;const r=t.subarray(0,this.outputLen);this.iHash.digestInto(r),this.oHash.update(r),this.oHash.digestInto(r),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:r,iHash:e,finished:o,destroyed:i,blockLen:c,outputLen:s}=this;return t=t,t.finished=o,t.destroyed=i,t.blockLen=c,t.outputLen=s,t.oHash=r._cloneInto(t.oHash),t.iHash=e._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const rn=(()=>{const n=(t,r,e)=>new Gt(t,r).update(e).digest();return n.create=(t,r)=>new Gt(t,r),n})();/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const Wt=(n,t)=>(n+(n>=0?t:-t)/ve)/t;function on(n,t,r){ue("scalar",n,K,r);const[[e,o],[i,c]]=t,s=Wt(c*n,r),f=Wt(-o*n,r);let a=n-s*e-f*i,h=-s*o-f*c;const b=a<K,O=h<K;b&&(a=-a),O&&(h=-h);const x=Zt(Math.ceil(qt(r)/2))+et;if(a<K||a>=x||h<K||h>=x)throw new Error("splitScalar (endomorphism): failed for k");return{k1neg:b,k1:a,k2neg:O,k2:h}}function _t(n){if(!["compact","recovered","der"].includes(n))throw new Error('Signature format must be "compact", "recovered", or "der"');return n}function At(n,t){Bt(n);const r={};for(let e of Object.keys(t))r[e]=n[e]===void 0?t[e]:n[e];return lt(r.lowS,"lowS"),lt(r.prehash,"prehash"),r.format!==void 0&&_t(r.format),r}
1class sn extends Error{constructor(t=""){super(t)}}const M={Err:sn,_tlv:{encode:(n,t)=>{const{Err:r}=M;if(It(n,"tag"),n<0||n>255)throw new r("tlv.encode: wrong tag");if(typeof t!="string")throw new TypeError('"data" expected string, got type='+typeof t);if(t.length&1)throw new r("tlv.encode: unpadded data");const e=t.length/2,o=wt(e);if(o.length/2&128)throw new r("tlv.encode: long form length too big");const i=e>127?wt(o.length/2|128):"";return wt(n)+i+o+t},decode(n,t){const{Err:r}=M;t=j(t,void 0,"DER data");let e=0;if(n<0||n>255)throw new r("tlv.encode: wrong tag");if(t.length<2||t[e++]!==n)throw new r("tlv.decode: wrong tlv");const o=t[e++],i=!!(o&128);let c=0;if(!i)c=o;else{const f=o&127;if(!f)throw new r("tlv.decode(long): indefinite length not supported");if(f>4)throw new r("tlv.decode(long): byte length is too big");const a=t.subarray(e,e+f);if(a.length!==f)throw new r("tlv.decode: length bytes not complete");if(a[0]===0)throw new r("tlv.decode(long): zero leftmost byte");for(const h of a)c=c<<8|h;if(e+=f,c<128)throw new r("tlv.decode(long): not minimal encoding")}const s=t.subarray(e,e+c);if(s.length!==c)throw new r("tlv.decode: wrong value length");return{v:s,l:t.subarray(e+c)}}},_int:{encode(n){const{Err:t}=M;if(Ht(n),n<K)throw new t("integer: negative integers are not allowed");let r=wt(n);if(Number.parseInt(r[0],16)&8&&(r="00"+r),r.length&1)throw new t("unexpected DER parsing assertion: unpadded hex");return r},decode(n){const{Err:t}=M;if(n.length<1)throw new t("invalid signature integer: empty");if(n[0]&128)throw new t("invalid signature integer: negative");if(n.length>1&&n[0]===0&&!(n[1]&128))throw new t("invalid signature integer: unnecessary leading zero");return xt(n)}},toSig(n){const{Err:t,_int:r,_tlv:e}=M,o=j(n,void 0,"signature"),{v:i,l:c}=e.decode(48,o);if(c.length)throw new t("invalid signature: left bytes after parsing");const{v:s,l:f}=e.decode(2,i),{v:a,l:h}=e.decode(2,f);if(h.length)throw new t("invalid signature: left bytes after parsing");return{r:r.decode(s),s:r.decode(a)}},hexFromSig(n){const{_tlv:t,_int:r}=M,e=t.encode(2,r.encode(n.r)),o=t.encode(2,r.encode(n.s)),i=e+o;return t.encode(48,i)}};Object.freeze(M._tlv);Object.freeze(M._int);Object.freeze(M);const K=BigInt(0),et=BigInt(1),ve=BigInt(2),gt=BigInt(3),cn=BigInt(4);function fn(n,t={}){const r=en("weierstrass",n,t),e=r.Fp,o=r.Fn;let i=r.CURVE;const{h:c,n:s}=i;Bt(t,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});const{endo:f,allowInfinityPoint:a}=t;if(f&&(!e.is0(i.a)||typeof f.beta!="bigint"||!Array.isArray(f.basises)))throw new Error('invalid endo: expected "beta": bigint and "basises": array');const h=Oe(e,o);function b(){if(!e.isOdd)throw new Error("compression is not supported: Field does not have .isOdd()")}function O(T,l,y){if(a&&l.is0())return Uint8Array.of(0);const{x:d,y:u}=l.toAffine(),g=e.toBytes(d);if(lt(y,"isCompressed"),y){b();const p=!e.isOdd(u);return tt(Re(p),g)}else return tt(Uint8Array.of(4),g,e.toBytes(u))}function x(T){j(T,void 0,"Point");const{publicKey:l,publicKeyUncompressed:y}=h,d=T.length,u=T[0],g=T.subarray(1);if(a&&d===1&&u===0)return{x:e.ZERO,y:e.ZERO};if(d===l&&(u===2||u===3)){const p=e.fromBytes(g);if(!e.isValid(p))throw new Error("bad point: is not on curve, wrong x");const E=A(p);let w;try{w=e.sqrt(E)}catch(N){const _=N instanceof Error?": "+N.message:"";throw new Error("bad point: is not on curve, sqrt error"+_)}b();const v=e.isOdd(w);return(u&1)===1!==v&&(w=e.neg(w)),{x:p,y:w}}else if(d===y&&u===4){const p=e.BYTES,E=e.fromBytes(g.subarray(0,p)),w=e.fromBytes(g.subarray(p,p*2));if(!I(E,w))throw new Error("bad point: is not on curve");return{x:E,y:w}}else throw new Error(`bad point: got length ${d}, expected compressed=${l} or uncompressed=${y}`)}const S=t.toBytes===void 0?O:t.toBytes,L=t.fromBytes===void 0?x:t.fromBytes;function A(T){const l=e.sqr(T),y=e.mul(l,T);return e.add(e.add(y,e.mul(T,i.a)),i.b)}function I(T,l){const y=e.sqr(l),d=A(T);return e.eql(y,d)}if(!I(i.Gx,i.Gy))throw new Error("bad curve params: generator point");const U=e.mul(e.pow(i.a,gt),cn),nt=e.mul(e.sqr(i.b),BigInt(27));if(e.is0(e.add(U,nt)))throw new Error("bad curve params: a or b");function P(T,l,y=!1){if(!e.isValid(l)||y&&e.is0(l))throw new Error(`bad point coordinate ${T}`);return l}function Y(T){if(!(T instanceof z))throw new Error("Weierstrass Point expected")}function at(T){if(!f||!f.basises)throw new Error("no endo");return on(T,f.basises,o.ORDER)}function ct(T,l,y,d,u){return y=new z(e.mul(y.X,T),y.Y,y.Z),l=mt(d,l),y=mt(u,y),l.add(y)}const F=class F{constructor(l,y,d){m(this,"X");m(this,"Y");m(this,"Z");this.X=P("x",l),this.Y=P("y",y,!0),this.Z=P("z",d),Object.freeze(this)}static CURVE(){return i}static fromAffine(l){const{x:y,y:d}=l||{};if(!l||!e.isValid(y)||!e.isValid(d))throw new Error("invalid affine point");if(l instanceof F)throw new Error("projective point not allowed");return e.is0(y)&&e.is0(d)?F.ZERO:new F(y,d,e.ONE)}static fromBytes(l){const y=F.fromAffine(L(j(l,void 0,"point")));return y.assertValidity(),y}static fromHex(l){return F.fromBytes(Ft(l))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(l=8,y=!0){return G.createCache(this,l),y||this.multiply(gt),this}assertValidity(){const l=this;
1if(l.is0()){if(t.allowInfinityPoint&&e.is0(l.X)&&e.eql(l.Y,e.ONE)&&e.is0(l.Z))return;throw new Error("bad point: ZERO")}const{x:y,y:d}=l.toAffine();if(!e.isValid(y)||!e.isValid(d))throw new Error("bad point: x or y not field elements");if(!I(y,d))throw new Error("bad point: equation left != right");if(!l.isTorsionFree())throw new Error("bad point: not in prime-order subgroup")}hasEvenY(){const{y:l}=this.toAffine();if(!e.isOdd)throw new Error("Field doesn't support isOdd");return!e.isOdd(l)}equals(l){Y(l);const{X:y,Y:d,Z:u}=this,{X:g,Y:p,Z:E}=l,w=e.eql(e.mul(y,E),e.mul(g,u)),v=e.eql(e.mul(d,E),e.mul(p,u));return w&&v}negate(){return new F(this.X,e.neg(this.Y),this.Z)}double(){const{a:l,b:y}=i,d=e.mul(y,gt),{X:u,Y:g,Z:p}=this;let E=e.ZERO,w=e.ZERO,v=e.ZERO,B=e.mul(u,u),N=e.mul(g,g),_=e.mul(p,p),R=e.mul(u,g);return R=e.add(R,R),v=e.mul(u,p),v=e.add(v,v),E=e.mul(l,v),w=e.mul(d,_),w=e.add(E,w),E=e.sub(N,w),w=e.add(N,w),w=e.mul(E,w),E=e.mul(R,E),v=e.mul(d,v),_=e.mul(l,_),R=e.sub(B,_),R=e.mul(l,R),R=e.add(R,v),v=e.add(B,B),B=e.add(v,B),B=e.add(B,_),B=e.mul(B,R),w=e.add(w,B),_=e.mul(g,p),_=e.add(_,_),B=e.mul(_,R),E=e.sub(E,B),v=e.mul(_,N),v=e.add(v,v),v=e.add(v,v),new F(E,w,v)}add(l){Y(l);const{X:y,Y:d,Z:u}=this,{X:g,Y:p,Z:E}=l;let w=e.ZERO,v=e.ZERO,B=e.ZERO;const N=i.a,_=e.mul(i.b,gt);let R=e.mul(y,g),D=e.mul(d,p),H=e.mul(u,E),V=e.add(y,d),q=e.add(g,p);V=e.mul(V,q),q=e.add(R,D),V=e.sub(V,q),q=e.add(y,u);let $=e.add(g,E);return q=e.mul(q,$),$=e.add(R,H),q=e.sub(q,$),$=e.add(d,u),w=e.add(p,E),$=e.mul($,w),w=e.add(D,H),$=e.sub($,w),B=e.mul(N,q),w=e.mul(_,H),B=e.add(w,B),w=e.sub(D,B),B=e.add(D,B),v=e.mul(w,B),D=e.add(R,R),D=e.add(D,R),H=e.mul(N,H),q=e.mul(_,q),D=e.add(D,H),H=e.sub(R,H),H=e.mul(N,H),q=e.add(q,H),R=e.mul(D,q),v=e.add(v,R),R=e.mul($,q),w=e.mul(V,w),w=e.sub(w,R),R=e.mul(V,D),B=e.mul($,B),B=e.add(B,R),new F(w,v,B)}subtract(l){return Y(l),this.add(l.negate())}is0(){return this.equals(F.ZERO)}multiply(l){const{endo:y}=t;if(!o.isValidNot0(l))throw new RangeError("invalid scalar: out of range");let d,u;const g=p=>G.cached(this,p,E=>Ct(F,E));if(y){const{k1neg:p,k1:E,k2neg:w,k2:v}=at(l),{p:B,f:N}=g(E),{p:_,f:R}=g(v);u=N.add(R),d=ct(y.beta,B,_,p,w)}else{const{p,f:E}=g(l);d=p,u=E}return Ct(F,[d,u])[0]}multiplyUnsafe(l){const{endo:y}=t,d=this,u=l;if(!o.isValid(u))throw new RangeError("invalid scalar: out of range");if(u===K||d.is0())return F.ZERO;if(u===et)return d;if(G.hasCache(this))return this.multiply(u);if(y){const{k1neg:g,k1:p,k2neg:E,k2:w}=at(u),{p1:v,p2:B}=tn(F,d,p,w);return ct(y.beta,v,B,g,E)}else return G.unsafe(d,u)}toAffine(l){const y=this;let d=l;const{X:u,Y:g,Z:p}=y;if(e.eql(p,e.ONE))return{x:u,y:g};const E=y.is0();d==null&&(d=E?e.ONE:e.inv(p));const w=e.mul(u,d),v=e.mul(g,d),B=e.mul(p,d);if(E)return{x:e.ZERO,y:e.ZERO};if(!e.eql(B,e.ONE))throw new Error("invZ was invalid");return{x:w,y:v}}isTorsionFree(){const{isTorsionFree:l}=t;return c===et?!0:l?l(F,this):G.unsafe(this,s).is0()}clearCofactor(){const{clearCofactor:l}=t;return c===et?this:l?l(F,this):this.multiplyUnsafe(c)}isSmallOrder(){return c===et?this.is0():this.clearCofactor().is0()}toBytes(l=!0){return lt(l,"isCompressed"),this.assertValidity(),S(F,this,l)}toHex(l=!0){return re(this.toBytes(l))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}};m(F,"BASE",new F(i.Gx,i.Gy,e.ONE)),m(F,"ZERO",new F(e.ZERO,e.ONE,e.ZERO)),m(F,"Fp",e),m(F,"Fn",o);let z=F;
1const ft=o.BITS,G=new Je(z,t.endo?Math.ceil(ft/2):ft);return ft>=8&&z.BASE.precompute(8),Object.freeze(z.prototype),Object.freeze(z),z}function Re(n){return Uint8Array.of(n?2:3)}function Oe(n,t){return{secretKey:t.BYTES,publicKey:1+n.BYTES,publicKeyUncompressed:1+2*n.BYTES,publicKeyHasPrefix:!0,signature:2*t.BYTES}}function un(n,t={}){const{Fn:r}=n,e=t.randomBytes===void 0?ie:t.randomBytes,o=Object.assign(Oe(n.Fp,r),{seed:Math.max(me(r.ORDER),16)});function i(x){try{const S=r.fromBytes(x);return r.isValidNot0(S)}catch{return!1}}function c(x,S){const{publicKey:L,publicKeyUncompressed:A}=o;try{const I=x.length;return S===!0&&I!==L||S===!1&&I!==A?!1:!!n.fromBytes(x)}catch{return!1}}function s(x){return x=x===void 0?e(o.seed):x,Qe(j(x,o.seed,"seed"),r.ORDER)}function f(x,S=!0){return n.BASE.multiply(r.fromBytes(x)).toBytes(S)}function a(x){const{secretKey:S,publicKey:L,publicKeyUncompressed:A}=o,I=r._lengths;if(!oe(x))return;const U=j(x,void 0,"key").length,nt=U===L||U===A,P=U===S||!!(I!=null&&I.includes(U));if(!(nt&&P))return nt}function h(x,S,L=!0){if(a(x)===!0)throw new Error("first arg must be private key");if(a(S)===!1)throw new Error("second arg must be public key");const A=r.fromBytes(x);return n.fromBytes(S).multiply(A).toBytes(L)}const b={isValidSecretKey:i,isValidPublicKey:c,randomSecretKey:s},O=nn(s,f);return Object.freeze(b),Object.freeze(o),Object.freeze({getPublicKey:f,getSharedSecret:h,keygen:O,Point:n,utils:b,lengths:o})}function an(n,t,r={}){const e=t;Qt(e),Bt(r,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),r=Object.assign({},r);const o=r.randomBytes===void 0?ie:r.randomBytes,i=r.hmac===void 0?(d,u)=>rn(e,d,u):r.hmac,{Fp:c,Fn:s}=n,{ORDER:f,BITS:a}=s,{keygen:h,getPublicKey:b,getSharedSecret:O,utils:x,lengths:S}=un(n,r),L={prehash:!0,lowS:typeof r.lowS=="boolean"?r.lowS:!0,format:"compact",extraEntropy:!1},A=f*ve+et<c.ORDER;function I(d){const u=f>>et;return d>u}function U(d,u){if(!s.isValidNot0(u))throw new Error(`invalid signature ${d}: out of range 1..Point.Fn.ORDER`);return u}function nt(){if(A)throw new Error('"recovered" sig type is not supported for cofactor >2 curves')}function P(d,u){_t(u);const g=S.signature,p=u==="compact"?g:u==="recovered"?g+1:void 0;return j(d,p)}class Y{constructor(u,g,p){m(this,"r");m(this,"s");m(this,"recovery");if(this.r=U("r",u),this.s=U("s",g),p!=null){if(nt(),![0,1,2,3].includes(p))throw new Error("invalid recovery id");this.recovery=p}Object.freeze(this)}static fromBytes(u,g=L.format){P(u,g);let p;if(g==="der"){const{r:B,s:N}=M.toSig(j(u));return new Y(B,N)}g==="recovered"&&(p=u[0],g="compact",u=u.subarray(1));const E=S.signature/2,w=u.subarray(0,E),v=u.subarray(E,E*2);return new Y(s.fromBytes(w),s.fromBytes(v),p)}static fromHex(u,g){return this.fromBytes(Ft(u),g)}assertRecovery(){const{recovery:u}=this;if(u==null)throw new Error("invalid recovery id: must be present");return u}addRecoveryBit(u){return new Y(this.r,this.s,u)}recoverPublicKey(u){const{r:g,s:p}=this,E=this.assertRecovery(),w=E===2||E===3?g+f:g;if(!c.isValid(w))throw new Error("invalid recovery id: sig.r+curve.n != R.x");const v=c.toBytes(w),B=n.fromBytes(tt(Re((E&1)===0),v)),N=s.inv(w),_=ct(j(u,void 0,"msgHash")),R=s.create(-_*N),D=s.create(p*N),H=n.BASE.multiplyUnsafe(R).add(B.multiplyUnsafe(D));if(H.is0())throw new Error("invalid recovery: point at infinify");return H.assertValidity(),H}hasHighS(){return I(this.s)}toBytes(u=L.format){if(_t(u),u==="der")return Ft(M.hexFromSig(this));const{r:g,s:p}=this,E=s.toBytes(g),w=s.toBytes(p);return u==="recovered"?(nt(),tt(Uint8Array.of(this.assertRecovery()),E,w)):tt(E,w)}toHex(u){return re(this.toBytes(u))}}Object.freeze(Y.prototype),Object.freeze(Y);const at=r.bits2int===void 0?function(u){if(u.length>8192)throw new Error("input is too large");const g=xt(u),p=u.length*8-a;return p>0?g>>BigInt(p):g}:r.bits2int,ct=r.bits2int_modN===void 0?function(u){return s.create(at(u))}:r.bits2int_modN,z=Zt(a);function ft(d){return ue("num < 2^"+a,d,K,z),s.toBytes(d)}function G(d,u){return j(d,void 0,"message"),u?j(e(d),void 0,"prehashed message"):d}function F(d,u,g){const{lowS:p,prehash:E,extraEntropy:w}=At(g,L);d=G(d,E);const v=ct(d),B=s.fromBytes(u);if(!s.isValidNot0(B))throw new Error("invalid private key");const N=[ft(B),ft(v)];if(w!=null&&w!==!1){const H=w===!0?o(S.secretKey):w;N.push(j(H,void 0,"extraEntropy"))}const _=tt(...N),R=v;function D(H){const V=at(H);if(!s.isValidNot0(V))return;const q=s.inv(V),$=n.BASE.multiply(V).toAffine(),dt=s.create($.x);if(dt===K)return;
1const ht=s.create(q*s.create(R+dt*B));if(ht===K)return;let $t=($.x===dt?0:2)|Number($.y&et),jt=ht;return p&&I(ht)&&(jt=s.neg(ht),$t^=1),new Y(dt,jt,A?void 0:$t)}return{seed:_,k2sig:D}}function T(d,u,g={}){const{seed:p,k2sig:E}=F(d,u,g);return ke(e.outputLen,s.BYTES,i)(p,E).toBytes(g.format)}function l(d,u,g,p={}){const{lowS:E,prehash:w,format:v}=At(p,L);if(g=j(g,void 0,"publicKey"),u=G(u,w),!oe(d)){const B=d instanceof Y?", use sig.toBytes()":"";throw new Error("verify expects Uint8Array signature"+B)}P(d,v);try{const B=Y.fromBytes(d,v),N=n.fromBytes(g);if(E&&B.hasHighS())return!1;const{r:_,s:R}=B,D=ct(u),H=s.inv(R),V=s.create(D*H),q=s.create(_*H),$=n.BASE.multiplyUnsafe(V).add(N.multiplyUnsafe(q));return $.is0()?!1:s.create($.x)===_}catch{return!1}}function y(d,u,g={}){const{prehash:p}=At(g,L);return u=G(u,p),Y.fromBytes(d,"recovered").recoverPublicKey(u).toBytes()}return Object.freeze({keygen:h,getPublicKey:b,getSharedSecret:O,utils:x,lengths:S,Point:n,sign:T,verify:l,recoverPublicKey:y,Signature:Y,hash:e})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const dn={p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")},ln=fn(dn),wn=an(ln,$e);export{wn as p256};
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.