npm - genosdb - Versions diffs - 0.17.0 → 0.18.0 - Mend

genosdb 0.17.0 → 0.18.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (5) hide show

package/dist/genosrtc-cells.min.js +1 -1
package/dist/genosrtc-cells.min.js.gz +0 -0
package/dist/genosrtc.min.js +1 -1
package/dist/genosrtc.min.js.gz +0 -0
package/package.json +1 -1

package/dist/genosrtc-cells.min.js CHANGED Viewed

	@@ -1 +1 @@
1	- var u0=typeof globalThis==="object"&&"crypto"in globalThis?globalThis.crypto:void 0;/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /function F0($){return $ instanceof Uint8Array\|\|ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function U$($){if(!Number.isSafeInteger($)\|\|$<0)throw Error("positive integer expected, got "+$)}function O0($,...J){if(!F0($))throw Error("Uint8Array expected");if(J.length>0&&!J.includes($.length))throw Error("Uint8Array expected of length "+J+", got length="+$.length)}function L$($){if(typeof $!=="function"\|\|typeof $.create!=="function")throw Error("Hash should be wrapped by utils.createHasher");U$($.outputLen),U$($.blockLen)}function t0($,J=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(J&&$.finished)throw Error("Hash#digest() has already been called")}function P8($,J){O0($);let q=J.outputLen;if($.length<q)throw Error("digestInto() expects output buffer of length at least "+q)}function m0(...$){for(let J=0;J<$.length;J++)$[J].fill(0)}function C$($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function B0($,J){return $<<32-J\|$>>>J}var I8=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),sQ=Array.from({length:256},($,J)=>J.toString(16).padStart(2,"0"));function L0($){if(O0($),I8)return $.toHex();let J="";for(let q=0;q<$.length;q++)J+=sQ[$[q]];return J}var k0={_0:48,_9:57,A:65,F:70,a:97,f:102};function S8($){if($>=k0._0&&$<=k0._9)return $-k0._0;if($>=k0.A&&$<=k0.F)return $-(k0.A-10);if($>=k0.a&&$<=k0.f)return $-(k0.a-10);return}function h0($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(I8)return Uint8Array.fromHex($);let J=$.length,q=J/2;if(J%2)throw Error("hex string expected, got unpadded hex of length "+J);let Q=new Uint8Array(q);for(let G=0,Y=0;G<q;G++,Y+=2){let X=S8($.charCodeAt(Y)),U=S8($.charCodeAt(Y+1));if(X===void 0\|\|U===void 0){let z=$[Y]+$[Y+1];throw Error('hex string expected, got non-hex character "'+z+'" at index '+Y)}Q[G]=X16+U}return Q}function S$($){if(typeof $!=="string")throw Error("string expected");return new Uint8Array(new TextEncoder().encode($))}function z$($){if(typeof $==="string")$=S$($);return O0($),$}function K0(...$){let J=0;for(let Q=0;Q<$.length;Q++){let G=$[Q];O0(G),J+=G.length}let q=new Uint8Array(J);for(let Q=0,G=0;Q<$.length;Q++){let Y=$[Q];q.set(Y,G),G+=Y.length}return q}class K${}function E8($){let J=(Q)=>$().update(z$(Q)).digest(),q=$();return J.outputLen=q.outputLen,J.blockLen=q.blockLen,J.create=()=>$(),J}function c0($=32){if(u0&&typeof u0.getRandomValues==="function")return u0.getRandomValues(new Uint8Array($));if(u0&&typeof u0.randomBytes==="function")return Uint8Array.from(u0.randomBytes($));throw Error("crypto.getRandomValues must be defined")}function tQ($,J,q,Q){if(typeof $.setBigUint64==="function")return $.setBigUint64(J,q,Q);let G=BigInt(32),Y=BigInt(4294967295),X=Number(q>>G&Y),U=Number(q&Y),z=Q?4:0,N=Q?0:4;$.setUint32(J+z,X,Q),$.setUint32(J+N,U,Q)}function v8($,J,q){return $&J^~$&q}function f8($,J,q){return $&J^$&q^J&q}class e$ extends K${constructor($,J,q,Q){super();this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=$,this.outputLen=J,this.padOffset=q,this.isLE=Q,this.buffer=new Uint8Array($),this.view=C$(this.buffer)}update($){t0(this),$=z$($),O0($);let{view:J,buffer:q,blockLen:Q}=this,G=$.length;for(let Y=0;Y<G;){let X=Math.min(Q-this.pos,G-Y);if(X===Q){let U=C$($);for(;Q<=G-Y;Y+=Q)this.process(U,Y);continue}if(q.set($.subarray(Y,Y+X),this.pos),this.pos+=X,Y+=X,this.pos===Q)this.process(J,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){t0(this),P8($,this),this.finished=!0;let{buffer:J,view:q,blockLen:Q,isLE:G}=this,{pos:Y}=this;if(J[Y++]=128,m0(this.buffer.subarray(Y)),this.padOffset>Q-Y)this.process(q,0),Y=0;for(let K=Y;K<Q;K++)J[K]=0;tQ(q,Q-8,BigInt(this.length8),G),this.process(q,0);let X=C$($),U=this.outputLen;if(U%4)throw Error("_sha2: outputLen should be aligned to 32bit");let z=U/4,N=this.get();if(z>N.length)throw Error("_sha2: outputLen bigger than state");for(let K=0;K<z;K++)X.setUint32(4K,N[K],G)}digest(){let{buffer:$,outputLen:J}=this;this.digestInto($);let q=$.slice(0,J);return this.destroy(),q}_cloneInto($){$\|\|($=new this.constructor),$.set(...this.get());let{blockLen:J,buffer:q,length:Q,finished:G,destroyed:Y,pos:X}=this;if($.destroyed=Y,$.finished=G,$.length=Q,$.pos=X,Q%J)$.buffer.set(q);return $}clone(){return this._cloneInto()}}var C0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);var eQ=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]),f0=new Uint32Array(64);class _8 extends e${constructor($=32){super(64,$,8,!1);this.A=C0[0]\|0,this.B=C0[1]\|0,this.C=C0[2]\|0,this.D=C0[3]\|0,this.E=C0[4]\|0,this.F=C0[5]\|0,this.G=C0[6]\|0,this.H=C0[7]\|0}get(){let{A:$,B:J,C:q,D:Q,E:G,F:Y,G:X,H:U}=this;return[$,J,q,Q,G,Y,X,U]}set($,J,q,Q,G,Y,X,U){this.A=$\|0,this.B=J\|0,this.C=q\|0,this.D=Q\|0,this.E=G\|0,this.F=Y\|0,this.G=X\|0,this.H=U\|0}process($,J){for(let K=0;K<16;K++,J+=4)f0[K]=$.getUint32(J,!1);for(let K=16;K<64;K++){let w=f0[K-15],Z=f0[K-2],j=B0(w,7)^B0(w,18)^w>>>3,T=B0(Z,17)^B0(Z,19)^Z>>>10;f0[K]=T+f0[K-7]+j+f0[K-16]\|0}let{A:q,B:Q,C:G,D:Y,E:X,F:U,G:z,H:N}=this;for(let K=0;K<64;K++){let w=B0(X,6)^B0(X,11)^B0(X,25),Z=N+w+v8(X,U,z)+eQ[K]+f0[K]\|0,T=(B0(q,2)^B0(q,13)^B0(q,22))+f8(q,Q,G)\|0;N=z,z=U,U=X,X=Y+Z\|0,Y=G,G=Q,Q=q,q=Z+T\|0}q=q+this.A\|0,Q=Q+this.B\|0,G=G+this.C\|0,Y=Y+this.D\|0,X=X+this.E\|0,U=U+this.F\|0,z=z+this.G\|0,N=N+this.H\|0,this.set(q,Q,G,Y,X,U,z,N)}roundClean(){m0(f0)}destroy(){this.set(0,0,0,0,0,0,0,0),m0(this.buffer)}}var P$=E8(()=>new _8);class $8 extends K${constructor($,J){super();this.finished=!1,this.destroyed=!1,L$($);let q=z$(J);if(this.iHash=$.create(),typeof this.iHash.update!=="function")throw Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;let Q=this.blockLen,G=new Uint8Array(Q);G.set(q.length>Q?$.create().update(q).digest():q);for(let Y=0;Y<G.length;Y++)G[Y]^=54;this.iHash.update(G),this.oHash=$.create();for(let Y=0;Y<G.length;Y++)G[Y]^=106;this.oHash.update(G),m0(G)}update($){return t0(this),this.iHash.update($),this}digestInto($){t0(this),O0($,this.outputLen),this.finished=!0,this.iHash.digestInto($),this.oHash.update($),this.oHash.digestInto($),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$\|\|($=Object.create(Object.getPrototypeOf(this),{}));let{oHash:J,iHash:q,finished:Q,destroyed:G,blockLen:Y,outputLen:X}=this;return $=$,$.finished=Q,$.destroyed=G,$.blockLen=Y,$.outputLen=X,$.oHash=J._cloneInto($.oHash),$.iHash=q._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var Q8=($,J,q)=>new $8($,J).update(q).digest();Q8.create=($,J)=>new $8($,J);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var G8=BigInt(0),q8=BigInt(1);function j$($,J=""){if(typeof $!=="boolean"){let q=J&&`"${J}"`;throw Error(q+"expected boolean, got type="+typeof $)}return $}function _0($,J,q=""){let Q=F0($),G=$?.length,Y=J!==void 0;if(!Q\|\|Y&&G!==J){let X=q&&`"${q}" `,U=Y?` of length ${J}`:"",z=Q?`length=${G}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+U+", got "+z)}return $}function D$($){let J=$.toString(16);return J.length&1?"0"+J:J}function b8($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?G8:BigInt("0x"+$)}function S0($){return b8(L0($))}function Y8($){return O0($),b8(L0(Uint8Array.from($).reverse()))}function e0($,J){return h0($.toString(16).padStart(J2,"0"))}function X8($,J){return e0($,J).reverse()}function p($,J,q){let Q;if(typeof J==="string")try{Q=h0(J)}catch(Y){throw Error($+" must be hex string or Uint8Array, cause: "+Y)}else if(F0(J))Q=Uint8Array.from(J);else throw Error($+" must be hex string or Uint8Array");let G=Q.length;if(typeof q==="number"&&G!==q)throw Error($+" of length "+q+" expected, got "+G);return Q}var J8=($)=>typeof $==="bigint"&&G8<=$;function W$($,J,q){return J8($)&&J8(J)&&J8(q)&&J<=$&&$<q}function y8($,J,q,Q){if(!W$(J,q,Q))throw Error("expected valid "+$+": "+q+" <= n < "+Q+", got "+J)}function I$($){let J;for(J=0;$>G8;$>>=q8,J+=1);return J}var b0=($)=>(q8<<BigInt($))-q8;function g8($,J,q){if(typeof $!=="number"\|\|$<2)throw Error("hashLen must be a number");if(typeof J!=="number"\|\|J<2)throw Error("qByteLen must be a number");if(typeof q!=="function")throw Error("hmacFn must be a function");let Q=(j)=>new Uint8Array(j),G=(j)=>Uint8Array.of(j),Y=Q($),X=Q($),U=0,z=()=>{Y.fill(1),X.fill(0),U=0},N=(...j)=>q(X,Y,...j),K=(j=Q(0))=>{if(X=N(G(0),j),Y=N(),j.length===0)return;X=N(G(1),j),Y=N()},w=()=>{if(U++>=1000)throw Error("drbg: tried 1000 values");let j=0,T=[];while(j<J){Y=N();let L=Y.slice();T.push(L),j+=Y.length}return K0(...T)};return(j,T)=>{z(),K(j);let L=void 0;while(!(L=T(w())))K();return z(),L}}function M$($,J,q={}){if(!$\|\|typeof $!=="object")throw Error("expected valid options object");function Q(G,Y,X){let U=$[G];if(X&&U===void 0)return;let z=typeof U;if(z!==Y\|\|U===null)throw Error(`param "${G}" is invalid: expected ${Y}, got ${z}`)}Object.entries(J).forEach(([G,Y])=>Q(G,Y,!1)),Object.entries(q).forEach(([G,Y])=>Q(G,Y,!0))}function Z8($){let J=new WeakMap;return(q,...Q)=>{let G=J.get(q);if(G!==void 0)return G;let Y=$(q,...Q);return J.set(q,Y),Y}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var Y0=BigInt(0),G0=BigInt(1),d0=BigInt(2),m8=BigInt(3),h8=BigInt(4),c8=BigInt(5),$J=BigInt(7),d8=BigInt(8),QJ=BigInt(9),l8=BigInt(16);function W0($,J){let q=$%J;return q>=Y0?q:J+q}function M0($,J,q){let Q=$;while(J-- >Y0)Q=Q,Q%=q;return Q}function u8($,J){if($===Y0)throw Error("invert: expected non-zero number");if(J<=Y0)throw Error("invert: expected positive modulus, got "+J);let q=W0($,J),Q=J,G=Y0,Y=G0,X=G0,U=Y0;while(q!==Y0){let N=Q/q,K=Q%q,w=G-XN,Z=Y-UN;Q=q,q=K,G=X,Y=U,X=w,U=Z}if(Q!==G0)throw Error("invert: does not exist");return W0(G,J)}function U8($,J,q){if(!$.eql($.sqr(J),q))throw Error("Cannot find square root")}function o8($,J){let q=($.ORDER+G0)/h8,Q=$.pow(J,q);return U8($,Q,J),Q}function JJ($,J){let q=($.ORDER-c8)/d8,Q=$.mul(J,d0),G=$.pow(Q,q),Y=$.mul(J,G),X=$.mul($.mul(Y,d0),G),U=$.mul(Y,$.sub(X,$.ONE));return U8($,U,J),U}function qJ($){let J=y0($),q=p8($),Q=q(J,J.neg(J.ONE)),G=q(J,Q),Y=q(J,J.neg(Q)),X=($+$J)/l8;return(U,z)=>{let N=U.pow(z,X),K=U.mul(N,Q),w=U.mul(N,G),Z=U.mul(N,Y),j=U.eql(U.sqr(K),z),T=U.eql(U.sqr(w),z);N=U.cmov(N,K,j),K=U.cmov(Z,w,T);let L=U.eql(U.sqr(K),z),g=U.cmov(N,K,L);return U8(U,g,z),g}}function p8($){if($<m8)throw Error("sqrt is not defined for small field");let J=$-G0,q=0;while(J%d0===Y0)J/=d0,q++;let Q=d0,G=y0($);while(F8(G,Q)===1)if(Q++>1000)throw Error("Cannot find square root: probably non-prime P");if(q===1)return o8;let Y=G.pow(Q,J),X=(J+G0)/d0;return function(z,N){if(z.is0(N))return N;if(F8(z,N)!==1)throw Error("Cannot find square root");let K=q,w=z.mul(z.ONE,Y),Z=z.pow(N,J),j=z.pow(N,X);while(!z.eql(Z,z.ONE)){if(z.is0(Z))return z.ZERO;let T=1,L=z.sqr(Z);while(!z.eql(L,z.ONE))if(T++,L=z.sqr(L),T===K)throw Error("Cannot find square root");let g=G0<<BigInt(K-T-1),b=z.pow(w,g);K=T,w=z.sqr(b),Z=z.mul(Z,w),j=z.mul(j,b)}return j}}function GJ($){if($%h8===m8)return o8;if($%d8===c8)return JJ;if($%l8===QJ)return qJ($);return p8($)}var YJ=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function z8($){let J={ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"},q=YJ.reduce((Q,G)=>{return Q[G]="function",Q},J);return M$($,q),$}function XJ($,J,q){if(q<Y0)throw Error("invalid exponent, negatives unsupported");if(q===Y0)return $.ONE;if(q===G0)return J;let Q=$.ONE,G=J;while(q>Y0){if(q&G0)Q=$.mul(Q,G);G=$.sqr(G),q>>=G0}return Q}function E$($,J,q=!1){let Q=Array(J.length).fill(q?$.ZERO:void 0),G=J.reduce((X,U,z)=>{if($.is0(U))return X;return Q[z]=X,$.mul(X,U)},$.ONE),Y=$.inv(G);return J.reduceRight((X,U,z)=>{if($.is0(U))return X;return Q[z]=$.mul(X,Q[z]),$.mul(X,U)},Y),Q}function F8($,J){let q=($.ORDER-G0)/d0,Q=$.pow(J,q),G=$.eql(Q,$.ONE),Y=$.eql(Q,$.ZERO),X=$.eql(Q,$.neg($.ONE));if(!G&&!Y&&!X)throw Error("invalid Legendre symbol result");return G?1:Y?0:-1}function v$($,J){if(J!==void 0)U$(J);let q=J!==void 0?J:$.toString(2).length,Q=Math.ceil(q/8);return{nBitLength:q,nByteLength:Q}}function y0($,J,q=!1,Q={}){if($<=Y0)throw Error("invalid field: expected ORDER > 0, got "+$);let G=void 0,Y=void 0,X=!1,U=void 0;if(typeof J==="object"&&J!=null){if(Q.sqrt\|\|q)throw Error("cannot specify opts in two arguments");let Z=J;if(Z.BITS)G=Z.BITS;if(Z.sqrt)Y=Z.sqrt;if(typeof Z.isLE==="boolean")q=Z.isLE;if(typeof Z.modFromBytes==="boolean")X=Z.modFromBytes;U=Z.allowedLengths}else{if(typeof J==="number")G=J;if(Q.sqrt)Y=Q.sqrt}let{nBitLength:z,nByteLength:N}=v$($,G);if(N>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");let K,w=Object.freeze({ORDER:$,isLE:q,BITS:z,BYTES:N,MASK:b0(z),ZERO:Y0,ONE:G0,allowedLengths:U,create:(Z)=>W0(Z,$),isValid:(Z)=>{if(typeof Z!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof Z);return Y0<=Z&&Z<$},is0:(Z)=>Z===Y0,isValidNot0:(Z)=>!w.is0(Z)&&w.isValid(Z),isOdd:(Z)=>(Z&G0)===G0,neg:(Z)=>W0(-Z,$),eql:(Z,j)=>Z===j,sqr:(Z)=>W0(ZZ,$),add:(Z,j)=>W0(Z+j,$),sub:(Z,j)=>W0(Z-j,$),mul:(Z,j)=>W0(Zj,$),pow:(Z,j)=>XJ(w,Z,j),div:(Z,j)=>W0(Zu8(j,$),$),sqrN:(Z)=>ZZ,addN:(Z,j)=>Z+j,subN:(Z,j)=>Z-j,mulN:(Z,j)=>Zj,inv:(Z)=>u8(Z,$),sqrt:Y\|\|((Z)=>{if(!K)K=GJ($);return K(w,Z)}),toBytes:(Z)=>q?X8(Z,N):e0(Z,N),fromBytes:(Z,j=!0)=>{if(U){if(!U.includes(Z.length)\|\|Z.length>N)throw Error("Field.fromBytes: expected "+U+" bytes, got "+Z.length);let L=new Uint8Array(N);L.set(Z,q?0:L.length-Z.length),Z=L}if(Z.length!==N)throw Error("Field.fromBytes: expected "+N+" bytes, got "+Z.length);let T=q?Y8(Z):S0(Z);if(X)T=W0(T,$);if(!j){if(!w.isValid(T))throw Error("invalid field element: outside of range 0..ORDER")}return T},invertBatch:(Z)=>E$(w,Z),cmov:(Z,j,T)=>T?j:Z});return Object.freeze(w)}function r8($){if(typeof $!=="bigint")throw Error("field order must be bigint");let J=$.toString(2).length;return Math.ceil(J/8)}function K8($){let J=r8($);return J+Math.ceil(J/2)}function f$($,J,q=!1){let Q=$.length,G=r8(J),Y=K8(J);if(Q<16\|\|Q<Y\|\|Q>1024)throw Error("expected "+Y+"-1024 bytes of input, got "+Q);let X=q?Y8($):S0($),U=W0(X,J-G0)+G0;return q?X8(U,G):e0(U,G)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var $$=BigInt(0),l0=BigInt(1);function V$($,J){let q=J.negate();return $?q:J}function _$($,J){let q=E$($.Fp,J.map((Q)=>Q.Z));return J.map((Q,G)=>$.fromAffine(Q.toAffine(q[G])))}function s8($,J){if(!Number.isSafeInteger($)\|\|$<=0\|\|$>J)throw Error("invalid window size, expected [1.."+J+"], got W="+$)}function j8($,J){s8($,J);let q=Math.ceil(J/$)+1,Q=2($-1),G=2$,Y=b0($),X=BigInt($);return{windows:q,windowSize:Q,mask:Y,maxNumber:G,shiftBy:X}}function i8($,J,q){let{windowSize:Q,mask:G,maxNumber:Y,shiftBy:X}=q,U=Number($&G),z=$>>X;if(U>Q)U-=Y,z+=l0;let N=JQ,K=N+Math.abs(U)-1,w=U===0,Z=U<0,j=J%2!==0;return{nextN:z,offset:K,isZero:w,isNeg:Z,isNegF:j,offsetF:N}}function ZJ($,J){if(!Array.isArray($))throw Error("array expected");$.forEach((q,Q)=>{if(!(q instanceof J))throw Error("invalid point at index "+Q)})}function UJ($,J){if(!Array.isArray($))throw Error("array of scalars expected");$.forEach((q,Q)=>{if(!J.isValid(q))throw Error("invalid scalar at index "+Q)})}var D8=new WeakMap,t8=new WeakMap;function W8($){return t8.get($)\|\|1}function a8($){if($!==$$)throw Error("invalid wNAF")}class M8{constructor($,J){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=J}_unsafeLadder($,J,q=this.ZERO){let Q=$;while(J>$$){if(J&l0)q=q.add(Q);Q=Q.double(),J>>=l0}return q}precomputeWindow($,J){let{windows:q,windowSize:Q}=j8(J,this.bits),G=[],Y=$,X=Y;for(let U=0;U<q;U++){X=Y,G.push(X);for(let z=1;z<Q;z++)X=X.add(Y),G.push(X);Y=X.double()}return G}wNAF($,J,q){if(!this.Fn.isValid(q))throw Error("invalid scalar");let Q=this.ZERO,G=this.BASE,Y=j8($,this.bits);for(let X=0;X<Y.windows;X++){let{nextN:U,offset:z,isZero:N,isNeg:K,isNegF:w,offsetF:Z}=i8(q,X,Y);if(q=U,N)G=G.add(V$(w,J[Z]));else Q=Q.add(V$(K,J[z]))}return a8(q),{p:Q,f:G}}wNAFUnsafe($,J,q,Q=this.ZERO){let G=j8($,this.bits);for(let Y=0;Y<G.windows;Y++){if(q===$$)break;let{nextN:X,offset:U,isZero:z,isNeg:N}=i8(q,Y,G);if(q=X,z)continue;else{let K=J[U];Q=Q.add(N?K.negate():K)}}return a8(q),Q}getPrecomputes($,J,q){let Q=D8.get(J);if(!Q){if(Q=this.precomputeWindow(J,$),$!==1){if(typeof q==="function")Q=q(Q);D8.set(J,Q)}}return Q}cached($,J,q){let Q=W8($);return this.wNAF(Q,this.getPrecomputes(Q,$,q),J)}unsafe($,J,q,Q){let G=W8($);if(G===1)return this._unsafeLadder($,J,Q);return this.wNAFUnsafe(G,this.getPrecomputes(G,$,q),J,Q)}createCache($,J){s8(J,this.bits),t8.set($,J),D8.delete($)}hasCache($){return W8($)!==1}}function e8($,J,q,Q){let G=J,Y=$.ZERO,X=$.ZERO;while(q>$$\|\|Q>$$){if(q&l0)Y=Y.add(G);if(Q&l0)X=X.add(G);G=G.double(),q>>=l0,Q>>=l0}return{p1:Y,p2:X}}function $Q($,J,q,Q){ZJ(q,$),UJ(Q,J);let G=q.length,Y=Q.length;if(G!==Y)throw Error("arrays of points and scalars must have equal length");let X=$.ZERO,U=I$(BigInt(G)),z=1;if(U>12)z=U-3;else if(U>4)z=U-2;else if(U>0)z=2;let N=b0(z),K=Array(Number(N)+1).fill(X),w=Math.floor((J.BITS-1)/z)z,Z=X;for(let j=w;j>=0;j-=z){K.fill(X);for(let L=0;L<Y;L++){let g=Q[L],b=Number(g>>BigInt(j)&N);K[b]=K[b].add(q[L])}let T=X;for(let L=K.length-1,g=X;L>0;L--)g=g.add(K[L]),T=T.add(g);if(Z=Z.add(T),j!==0)for(let L=0;L<z;L++)Z=Z.double()}return Z}function n8($,J,q){if(J){if(J.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return z8(J),J}else return y0($,{isLE:q})}function QQ($,J,q={},Q){if(Q===void 0)Q=$==="edwards";if(!J\|\|typeof J!=="object")throw Error(`expected valid ${$} CURVE object`);for(let z of["p","n","h"]){let N=J[z];if(!(typeof N==="bigint"&&N>$$))throw Error(`CURVE.${z} must be positive bigint`)}let G=n8(J.p,q.Fp,Q),Y=n8(J.n,q.Fn,Q),U=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let z of U)if(!G.isValid(J[z]))throw Error(`CURVE.${z} must be valid field element of CURVE.Fp`);return J=Object.freeze(Object.assign({},J)),{CURVE:J,Fp:G,Fn:Y}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var JQ=($,J)=>($+($>=0?J:-J)/GQ)/J;function zJ($,J,q){let[[Q,G],[Y,X]]=J,U=JQ(X$,q),z=JQ(-G$,q),N=$-UQ-zY,K=-UG-zX,w=N<I0,Z=K<I0;if(w)N=-N;if(Z)K=-K;let j=b0(Math.ceil(I$(q)/2))+Q$;if(N<I0\|\|N>=j\|\|K<I0\|\|K>=j)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:w,k1:N,k2neg:Z,k2:K}}function N8($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function V8($,J){let q={};for(let Q of Object.keys(J))q[Q]=$[Q]===void 0?J[Q]:$[Q];if(j$(q.lowS,"lowS"),j$(q.prehash,"prehash"),q.format!==void 0)N8(q.format);return q}class qQ extends Error{constructor($=""){super($)}}var P0={Err:qQ,_tlv:{encode:($,J)=>{let{Err:q}=P0;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length&1)throw new q("tlv.encode: unpadded data");let Q=J.length/2,G=D$(Q);if(G.length/2&128)throw new q("tlv.encode: long form length too big");let Y=Q>127?D$(G.length/2\|128):"";return D$($)+Y+G+J},decode($,J){let{Err:q}=P0,Q=0;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length<2\|\|J[Q++]!==$)throw new q("tlv.decode: wrong tlv");let G=J[Q++],Y=!!(G&128),X=0;if(!Y)X=G;else{let z=G&127;if(!z)throw new q("tlv.decode(long): indefinite length not supported");if(z>4)throw new q("tlv.decode(long): byte length is too big");let N=J.subarray(Q,Q+z);if(N.length!==z)throw new q("tlv.decode: length bytes not complete");if(N[0]===0)throw new q("tlv.decode(long): zero leftmost byte");for(let K of N)X=X<<8\|K;if(Q+=z,X<128)throw new q("tlv.decode(long): not minimal encoding")}let U=J.subarray(Q,Q+X);if(U.length!==X)throw new q("tlv.decode: wrong value length");return{v:U,l:J.subarray(Q+X)}}},_int:{encode($){let{Err:J}=P0;if($<I0)throw new J("integer: negative integers are not allowed");let q=D$($);if(Number.parseInt(q[0],16)&8)q="00"+q;if(q.length&1)throw new J("unexpected DER parsing assertion: unpadded hex");return q},decode($){let{Err:J}=P0;if($[0]&128)throw new J("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new J("invalid signature integer: unnecessary leading zero");return S0($)}},toSig($){let{Err:J,_int:q,_tlv:Q}=P0,G=p("signature",$),{v:Y,l:X}=Q.decode(48,G);if(X.length)throw new J("invalid signature: left bytes after parsing");let{v:U,l:z}=Q.decode(2,Y),{v:N,l:K}=Q.decode(2,z);if(K.length)throw new J("invalid signature: left bytes after parsing");return{r:q.decode(U),s:q.decode(N)}},hexFromSig($){let{_tlv:J,_int:q}=P0,Q=J.encode(2,q.encode($.r)),G=J.encode(2,q.encode($.s)),Y=Q+G;return J.encode(48,Y)}},I0=BigInt(0),Q$=BigInt(1),GQ=BigInt(2),b$=BigInt(3),KJ=BigInt(4);function g0($,J){let{BYTES:q}=$,Q;if(typeof J==="bigint")Q=J;else{let G=p("private key",J);try{Q=$.fromBytes(G)}catch(Y){throw Error(`invalid private key: expected ui8a of size ${q}, got ${typeof J}`)}}if(!$.isValidNot0(Q))throw Error("invalid private key: out of range [1..N-1]");return Q}function jJ($,J={}){let q=QQ("weierstrass",$,J),{Fp:Q,Fn:G}=q,Y=q.CURVE,{h:X,n:U}=Y;M$(J,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});let{endo:z}=J;if(z){if(!Q.is0(Y.a)\|\|typeof z.beta!=="bigint"\|\|!Array.isArray(z.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let N=XQ(Q,G);function K(){if(!Q.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function w(V,k,M){let{x:A,y:D}=k.toAffine(),W=Q.toBytes(A);if(j$(M,"isCompressed"),M){K();let B=!Q.isOdd(D);return K0(YQ(B),W)}else return K0(Uint8Array.of(4),W,Q.toBytes(D))}function Z(V){_0(V,void 0,"Point");let{publicKey:k,publicKeyUncompressed:M}=N,A=V.length,D=V[0],W=V.subarray(1);if(A===k&&(D===2\|\|D===3)){let B=Q.fromBytes(W);if(!Q.isValid(B))throw Error("bad point: is not on curve, wrong x");let H=L(B),R;try{R=Q.sqrt(H)}catch(E){let v=E instanceof Error?": "+E.message:"";throw Error("bad point: is not on curve, sqrt error"+v)}K();let C=Q.isOdd(R);if((D&1)===1!==C)R=Q.neg(R);return{x:B,y:R}}else if(A===M&&D===4){let B=Q.BYTES,H=Q.fromBytes(W.subarray(0,B)),R=Q.fromBytes(W.subarray(B,B2));if(!g(H,R))throw Error("bad point: is not on curve");return{x:H,y:R}}else throw Error(`bad point: got length ${A}, expected compressed=${k} or uncompressed=${M}`)}let j=J.toBytes\|\|w,T=J.fromBytes\|\|Z;function L(V){let k=Q.sqr(V),M=Q.mul(k,V);return Q.add(Q.add(M,Q.mul(V,Y.a)),Y.b)}function g(V,k){let M=Q.sqr(k),A=L(V);return Q.eql(M,A)}if(!g(Y.Gx,Y.Gy))throw Error("bad curve params: generator point");let b=Q.mul(Q.pow(Y.a,b$),KJ),J0=Q.mul(Q.sqr(Y.b),BigInt(27));if(Q.is0(Q.add(b,J0)))throw Error("bad curve params: a or b");function u(V,k,M=!1){if(!Q.isValid(k)\|\|M&&Q.is0(k))throw Error(`bad point coordinate ${V}`);return k}function X0(V){if(!(V instanceof I))throw Error("ProjectivePoint expected")}function n(V){if(!z\|\|!z.basises)throw Error("no endo");return zJ(V,z.basises,G.ORDER)}let q0=Z8((V,k)=>{let{X:M,Y:A,Z:D}=V;if(Q.eql(D,Q.ONE))return{x:M,y:A};let W=V.is0();if(k==null)k=W?Q.ONE:Q.inv(D);let B=Q.mul(M,k),H=Q.mul(A,k),R=Q.mul(D,k);if(W)return{x:Q.ZERO,y:Q.ZERO};if(!Q.eql(R,Q.ONE))throw Error("invZ was invalid");return{x:B,y:H}}),j0=Z8((V)=>{if(V.is0()){if(J.allowInfinityPoint&&!Q.is0(V.Y))return;throw Error("bad point: ZERO")}let{x:k,y:M}=V.toAffine();if(!Q.isValid(k)\|\|!Q.isValid(M))throw Error("bad point: x or y not field elements");if(!g(k,M))throw Error("bad point: equation left != right");if(!V.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function s(V,k,M,A,D){return M=new I(Q.mul(M.X,V),M.Y,M.Z),k=V$(A,k),M=V$(D,M),k.add(M)}class I{constructor(V,k,M){this.X=u("x",V),this.Y=u("y",k,!0),this.Z=u("z",M),Object.freeze(this)}static CURVE(){return Y}static fromAffine(V){let{x:k,y:M}=V\|\|{};if(!V\|\|!Q.isValid(k)\|\|!Q.isValid(M))throw Error("invalid affine point");if(V instanceof I)throw Error("projective point not allowed");if(Q.is0(k)&&Q.is0(M))return I.ZERO;return new I(k,M,Q.ONE)}static fromBytes(V){let k=I.fromAffine(T(_0(V,void 0,"point")));return k.assertValidity(),k}static fromHex(V){return I.fromBytes(p("pointHex",V))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(V=8,k=!0){if(_.createCache(this,V),!k)this.multiply(b$);return this}assertValidity(){j0(this)}hasEvenY(){let{y:V}=this.toAffine();if(!Q.isOdd)throw Error("Field doesn't support isOdd");return!Q.isOdd(V)}equals(V){X0(V);let{X:k,Y:M,Z:A}=this,{X:D,Y:W,Z:B}=V,H=Q.eql(Q.mul(k,B),Q.mul(D,A)),R=Q.eql(Q.mul(M,B),Q.mul(W,A));return H&&R}negate(){return new I(this.X,Q.neg(this.Y),this.Z)}double(){let{a:V,b:k}=Y,M=Q.mul(k,b$),{X:A,Y:D,Z:W}=this,B=Q.ZERO,H=Q.ZERO,R=Q.ZERO,C=Q.mul(A,A),c=Q.mul(D,D),E=Q.mul(W,W),v=Q.mul(A,D);return v=Q.add(v,v),R=Q.mul(A,W),R=Q.add(R,R),B=Q.mul(V,R),H=Q.mul(M,E),H=Q.add(B,H),B=Q.sub(c,H),H=Q.add(c,H),H=Q.mul(B,H),B=Q.mul(v,B),R=Q.mul(M,R),E=Q.mul(V,E),v=Q.sub(C,E),v=Q.mul(V,v),v=Q.add(v,R),R=Q.add(C,C),C=Q.add(R,C),C=Q.add(C,E),C=Q.mul(C,v),H=Q.add(H,C),E=Q.mul(D,W),E=Q.add(E,E),C=Q.mul(E,v),B=Q.sub(B,C),R=Q.mul(E,c),R=Q.add(R,R),R=Q.add(R,R),new I(B,H,R)}add(V){X0(V);let{X:k,Y:M,Z:A}=this,{X:D,Y:W,Z:B}=V,H=Q.ZERO,R=Q.ZERO,C=Q.ZERO,c=Y.a,E=Q.mul(Y.b,b$),v=Q.mul(k,D),y=Q.mul(M,W),f=Q.mul(A,B),h=Q.add(k,M),d=Q.add(D,W);h=Q.mul(h,d),d=Q.add(v,y),h=Q.sub(h,d),d=Q.add(k,A);let l=Q.add(D,B);return d=Q.mul(d,l),l=Q.add(v,f),d=Q.sub(d,l),l=Q.add(M,A),H=Q.add(W,B),l=Q.mul(l,H),H=Q.add(y,f),l=Q.sub(l,H),C=Q.mul(c,d),H=Q.mul(E,f),C=Q.add(H,C),H=Q.sub(y,C),C=Q.add(y,C),R=Q.mul(H,C),y=Q.add(v,v),y=Q.add(y,v),f=Q.mul(c,f),d=Q.mul(E,d),y=Q.add(y,f),f=Q.sub(v,f),f=Q.mul(c,f),d=Q.add(d,f),v=Q.mul(y,d),R=Q.add(R,v),v=Q.mul(l,d),H=Q.mul(h,H),H=Q.sub(H,v),v=Q.mul(h,y),C=Q.mul(l,C),C=Q.add(C,v),new I(H,R,C)}subtract(V){return this.add(V.negate())}is0(){return this.equals(I.ZERO)}multiply(V){let{endo:k}=J;if(!G.isValidNot0(V))throw Error("invalid scalar: out of range");let M,A,D=(W)=>_.cached(this,W,(B)=>_$(I,B));if(k){let{k1neg:W,k1:B,k2neg:H,k2:R}=n(V),{p:C,f:c}=D(B),{p:E,f:v}=D(R);A=c.add(v),M=s(k.beta,C,E,W,H)}else{let{p:W,f:B}=D(V);M=W,A=B}return _$(I,[M,A])[0]}multiplyUnsafe(V){let{endo:k}=J,M=this;if(!G.isValid(V))throw Error("invalid scalar: out of range");if(V===I0\|\|M.is0())return I.ZERO;if(V===Q$)return M;if(_.hasCache(this))return this.multiply(V);if(k){let{k1neg:A,k1:D,k2neg:W,k2:B}=n(V),{p1:H,p2:R}=e8(I,M,D,B);return s(k.beta,H,R,A,W)}else return _.unsafe(M,V)}multiplyAndAddUnsafe(V,k,M){let A=this.multiplyUnsafe(k).add(V.multiplyUnsafe(M));return A.is0()?void 0:A}toAffine(V){return q0(this,V)}isTorsionFree(){let{isTorsionFree:V}=J;if(X===Q$)return!0;if(V)return V(I,this);return _.unsafe(this,U).is0()}clearCofactor(){let{clearCofactor:V}=J;if(X===Q$)return this;if(V)return V(I,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(V=!0){return j$(V,"isCompressed"),this.assertValidity(),j(I,this,V)}toHex(V=!0){return L0(this.toBytes(V))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(V=!0){return this.toBytes(V)}_setWindowSize(V){this.precompute(V)}static normalizeZ(V){return _$(I,V)}static msm(V,k){return $Q(I,G,V,k)}static fromPrivateKey(V){return I.BASE.multiply(g0(G,V))}}I.BASE=new I(Y.Gx,Y.Gy,Q.ONE),I.ZERO=new I(Q.ZERO,Q.ONE,Q.ZERO),I.Fp=Q,I.Fn=G;let r=G.BITS,_=new M8(I,J.endo?Math.ceil(r/2):r);return I.BASE.precompute(8),I}function YQ($){return Uint8Array.of($?2:3)}function XQ($,J){return{secretKey:J.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2$.BYTES,publicKeyHasPrefix:!0,signature:2J.BYTES}}function DJ($,J={}){let{Fn:q}=$,Q=J.randomBytes\|\|c0,G=Object.assign(XQ($.Fp,q),{seed:K8(q.ORDER)});function Y(j){try{return!!g0(q,j)}catch(T){return!1}}function X(j,T){let{publicKey:L,publicKeyUncompressed:g}=G;try{let b=j.length;if(T===!0&&b!==L)return!1;if(T===!1&&b!==g)return!1;return!!$.fromBytes(j)}catch(b){return!1}}function U(j=Q(G.seed)){return f$(_0(j,G.seed,"seed"),q.ORDER)}function z(j,T=!0){return $.BASE.multiply(g0(q,j)).toBytes(T)}function N(j){let T=U(j);return{secretKey:T,publicKey:z(T)}}function K(j){if(typeof j==="bigint")return!1;if(j instanceof $)return!0;let{secretKey:T,publicKey:L,publicKeyUncompressed:g}=G;if(q.allowedLengths\|\|T===L)return;let b=p("key",j).length;return b===L\|\|b===g}function w(j,T,L=!0){if(K(j)===!0)throw Error("first arg must be private key");if(K(T)===!1)throw Error("second arg must be public key");let g=g0(q,j);return $.fromHex(T).multiply(g).toBytes(L)}return Object.freeze({getPublicKey:z,getSharedSecret:w,keygen:N,Point:$,utils:{isValidSecretKey:Y,isValidPublicKey:X,randomSecretKey:U,isValidPrivateKey:Y,randomPrivateKey:U,normPrivateKeyToScalar:(j)=>g0(q,j),precompute(j=8,T=$.BASE){return T.precompute(j,!1)}},lengths:G})}function WJ($,J,q={}){L$(J),M$(q,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});let Q=q.randomBytes\|\|c0,G=q.hmac\|\|((M,...A)=>Q8(J,M,K0(...A))),{Fp:Y,Fn:X}=$,{ORDER:U,BITS:z}=X,{keygen:N,getPublicKey:K,getSharedSecret:w,utils:Z,lengths:j}=DJ($,q),T={prehash:!1,lowS:typeof q.lowS==="boolean"?q.lowS:!1,format:void 0,extraEntropy:!1},L="compact";function g(M){let A=U>>Q$;return M>A}function b(M,A){if(!X.isValidNot0(A))throw Error(`invalid signature ${M}: out of range 1..Point.Fn.ORDER`);return A}function J0(M,A){N8(A);let D=j.signature,W=A==="compact"?D:A==="recovered"?D+1:void 0;return _0(M,W,`${A} signature`)}class u{constructor(M,A,D){if(this.r=b("r",M),this.s=b("s",A),D!=null)this.recovery=D;Object.freeze(this)}static fromBytes(M,A=L){J0(M,A);let D;if(A==="der"){let{r:R,s:C}=P0.toSig(_0(M));return new u(R,C)}if(A==="recovered")D=M[0],A="compact",M=M.subarray(1);let W=X.BYTES,B=M.subarray(0,W),H=M.subarray(W,W2);return new u(X.fromBytes(B),X.fromBytes(H),D)}static fromHex(M,A){return this.fromBytes(h0(M),A)}addRecoveryBit(M){return new u(this.r,this.s,M)}recoverPublicKey(M){let A=Y.ORDER,{r:D,s:W,recovery:B}=this;if(B==null\|\|![0,1,2,3].includes(B))throw Error("recovery id invalid");if(UGQ<A&&B>1)throw Error("recovery id is ambiguous for h>1 curve");let R=B===2\|\|B===3?D+U:D;if(!Y.isValid(R))throw Error("recovery id 2 or 3 invalid");let C=Y.toBytes(R),c=$.fromBytes(K0(YQ((B&1)===0),C)),E=X.inv(R),v=n(p("msgHash",M)),y=X.create(-vE),f=X.create(WE),h=$.BASE.multiplyUnsafe(y).add(c.multiplyUnsafe(f));if(h.is0())throw Error("point at infinify");return h.assertValidity(),h}hasHighS(){return g(this.s)}toBytes(M=L){if(N8(M),M==="der")return h0(P0.hexFromSig(this));let A=X.toBytes(this.r),D=X.toBytes(this.s);if(M==="recovered"){if(this.recovery==null)throw Error("recovery bit must be present");return K0(Uint8Array.of(this.recovery),A,D)}return K0(A,D)}toHex(M){return L0(this.toBytes(M))}assertValidity(){}static fromCompact(M){return u.fromBytes(p("sig",M),"compact")}static fromDER(M){return u.fromBytes(p("sig",M),"der")}normalizeS(){return this.hasHighS()?new u(this.r,X.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return L0(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return L0(this.toBytes("compact"))}}let X0=q.bits2int\|\|function(A){if(A.length>8192)throw Error("input is too large");let D=S0(A),W=A.length8-z;return W>0?D>>BigInt(W):D},n=q.bits2int_modN\|\|function(A){return X.create(X0(A))},q0=b0(z);function j0(M){return y8("num < 2^"+z,M,I0,q0),X.toBytes(M)}function s(M,A){return _0(M,void 0,"message"),A?_0(J(M),void 0,"prehashed message"):M}function I(M,A,D){if(["recovered","canonical"].some((f)=>(f in D)))throw Error("sign() legacy options not supported");let{lowS:W,prehash:B,extraEntropy:H}=V8(D,T);M=s(M,B);let R=n(M),C=g0(X,A),c=[j0(C),j0(R)];if(H!=null&&H!==!1){let f=H===!0?Q(j.secretKey):H;c.push(p("extraEntropy",f))}let E=K0(...c),v=R;function y(f){let h=X0(f);if(!X.isValidNot0(h))return;let d=X.inv(h),l=$.BASE.multiply(h).toAffine(),t=X.create(l.x);if(t===I0)return;let Z0=X.create(dX.create(v+tC));if(Z0===I0)return;let $0=(l.x===t?0:2)\|Number(l.y&Q$),Q0=Z0;if(W&&g(Z0))Q0=X.neg(Z0),$0^=1;return new u(t,Q0,$0)}return{seed:E,k2sig:y}}function r(M,A,D={}){M=p("message",M);let{seed:W,k2sig:B}=I(M,A,D);return g8(J.outputLen,X.BYTES,G)(W,B)}function _(M){let A=void 0,D=typeof M==="string"\|\|F0(M),W=!D&&M!==null&&typeof M==="object"&&typeof M.r==="bigint"&&typeof M.s==="bigint";if(!D&&!W)throw Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(W)A=new u(M.r,M.s);else if(D){try{A=u.fromBytes(p("sig",M),"der")}catch(B){if(!(B instanceof P0.Err))throw B}if(!A)try{A=u.fromBytes(p("sig",M),"compact")}catch(B){return!1}}if(!A)return!1;return A}function V(M,A,D,W={}){let{lowS:B,prehash:H,format:R}=V8(W,T);if(D=p("publicKey",D),A=s(p("message",A),H),"strict"in W)throw Error("options.strict was renamed to lowS");let C=R===void 0?_(M):u.fromBytes(p("sig",M),R);if(C===!1)return!1;try{let c=$.fromBytes(D);if(B&&C.hasHighS())return!1;let{r:E,s:v}=C,y=n(A),f=X.inv(v),h=X.create(yf),d=X.create(Ef),l=$.BASE.multiplyUnsafe(h).add(c.multiplyUnsafe(d));if(l.is0())return!1;return X.create(l.x)===E}catch(c){return!1}}function k(M,A,D={}){let{prehash:W}=V8(D,T);return A=s(A,W),u.fromBytes(M,"recovered").recoverPublicKey(A).toBytes()}return Object.freeze({keygen:N,getPublicKey:K,getSharedSecret:w,utils:Z,lengths:j,Point:$,sign:r,verify:V,recoverPublicKey:k,Signature:u,hash:J})}function MJ($){let J={a:$.a,b:$.b,p:$.Fp.ORDER,n:$.n,h:$.h,Gx:$.Gx,Gy:$.Gy},q=$.Fp,Q=$.allowedPrivateKeyLengths?Array.from(new Set($.allowedPrivateKeyLengths.map((X)=>Math.ceil(X/2)))):void 0,G=y0(J.n,{BITS:$.nBitLength,allowedLengths:Q,modFromBytes:$.wrapPrivateKey}),Y={Fp:q,Fn:G,allowInfinityPoint:$.allowInfinityPoint,endo:$.endo,isTorsionFree:$.isTorsionFree,clearCofactor:$.clearCofactor,fromBytes:$.fromBytes,toBytes:$.toBytes};return{CURVE:J,curveOpts:Y}}function VJ($){let{CURVE:J,curveOpts:q}=MJ($),Q={hmac:$.hmac,randomBytes:$.randomBytes,lowS:$.lowS,bits2int:$.bits2int,bits2int_modN:$.bits2int_modN};return{CURVE:J,curveOpts:q,hash:$.hash,ecdsaOpts:Q}}function NJ($,J){let q=J.Point;return Object.assign({},J,{ProjectivePoint:q,CURVE:Object.assign({},$,v$(q.Fn.ORDER,q.Fn.BITS))})}function ZQ($){let{CURVE:J,curveOpts:q,hash:Q,ecdsaOpts:G}=VJ($),Y=jJ(J,q),X=WJ(Y,Q,G);return NJ($,X)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function UQ($,J){let q=(Q)=>ZQ({...$,hash:Q});return{...q(J),create:q}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var J$={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},OJ={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},BJ=BigInt(0),zQ=BigInt(1),O8=BigInt(2);function RJ($){let J=J$.p,q=BigInt(3),Q=BigInt(6),G=BigInt(11),Y=BigInt(22),X=BigInt(23),U=BigInt(44),z=BigInt(88),N=$$$%J,K=NN$%J,w=M0(K,q,J)K%J,Z=M0(w,q,J)K%J,j=M0(Z,O8,J)N%J,T=M0(j,G,J)j%J,L=M0(T,Y,J)T%J,g=M0(L,U,J)L%J,b=M0(g,z,J)g%J,J0=M0(b,U,J)L%J,u=M0(J0,q,J)K%J,X0=M0(u,X,J)T%J,n=M0(X0,Q,J)N%J,q0=M0(n,O8,J);if(!y$.eql(y$.sqr(q0),$))throw Error("Cannot find square root");return q0}var y$=y0(J$.p,{sqrt:RJ}),DQ=UQ({...J$,Fp:y$,lowS:!0,endo:OJ},P$),KQ={};function g$($,...J){let q=KQ[$];if(q===void 0){let Q=P$(S$($));q=K0(Q,Q),KQ[$]=q}return P$(K0(q,...J))}var R8=($)=>$.toBytes(!0).slice(1),q$=(()=>DQ.Point)(),A8=($)=>$%O8===BJ;function B8($){let{Fn:J,BASE:q}=q$,Q=g0(J,$),G=q.multiply(Q);return{scalar:A8(G.y)?Q:J.neg(Q),bytes:R8(G)}}function WQ($){let J=y$;if(!J.isValidNot0($))throw Error("invalid x: Fail if x ≥ p");let q=J.create($$),Q=J.create(q$+BigInt(7)),G=J.sqrt(Q);if(!A8(G))G=J.neg(G);let Y=q$.fromAffine({x:$,y:G});return Y.assertValidity(),Y}var N$=S0;function MQ(...$){return q$.Fn.create(N$(g$("BIP0340/challenge",...$)))}function jQ($){return B8($).bytes}function AJ($,J,q=c0(32)){let{Fn:Q}=q$,G=p("message",$),{bytes:Y,scalar:X}=B8(J),U=p("auxRand",q,32),z=Q.toBytes(X^N$(g$("BIP0340/aux",U))),N=g$("BIP0340/nonce",z,Y,G),{bytes:K,scalar:w}=B8(N),Z=MQ(K,Y,G),j=new Uint8Array(64);if(j.set(K,0),j.set(Q.toBytes(Q.create(w+ZX)),32),!VQ(j,G,Y))throw Error("sign: Invalid signature produced");return j}function VQ($,J,q){let{Fn:Q,BASE:G}=q$,Y=p("signature",$,64),X=p("message",J),U=p("publicKey",q,32);try{let z=WQ(N$(U)),N=N$(Y.subarray(0,32));if(!W$(N,zQ,J$.p))return!1;let K=N$(Y.subarray(32,64));if(!W$(K,zQ,J$.n))return!1;let w=MQ(Q.toBytes(N),R8(z),X),Z=G.multiplyUnsafe(K).add(z.multiplyUnsafe(Q.neg(w))),{x:j,y:T}=Z.toAffine();if(Z.is0()\|\|!A8(T)\|\|j!==N)return!1;return!0}catch(z){return!1}}var u$=(()=>{let q=(G=c0(48))=>{return f$(G,J$.n)};DQ.utils.randomSecretKey;function Q(G){let Y=q(G);return{secretKey:Y,publicKey:jQ(Y)}}return{keygen:Q,getPublicKey:jQ,sign:AJ,verify:VQ,Point:q$,utils:{randomSecretKey:q,randomPrivateKey:q,taggedHash:g$,lift_x:WQ,pointToBytes:R8,numberToBytesBE:e0,bytesToNumberBE:S0,mod:W0},lengths:{secretKey:32,publicKey:32,publicKeyHasPrefix:!1,signature:64,seed:48}}})();var HJ=new TextEncoder,TJ=new TextDecoder,H0=($)=>HJ.encode($),o0=($)=>TJ.decode($),F$=($)=>Array.from($,(J)=>J.toString(16).padStart(2,"0")).join(""),V0=JSON.stringify,p0=JSON.parse,m$=($,J=Number.MAX_SAFE_INTEGER)=>$.split("").reduce((q,Q)=>q+Q.charCodeAt(0),0)%J;var H8="AES-GCM",xJ={},NQ="$",OQ=",",wJ=($)=>{let J=new Uint8Array($),q=32768,Q="";for(let G=0;G<J.length;G+=32768)Q+=String.fromCharCode(...J.subarray(G,G+32768));return btoa(Q)},kJ=($)=>Uint8Array.from(atob($),(J)=>J.charCodeAt(0)).buffer,O$=($)=>xJ[$]??=crypto.subtle.digest("SHA-1",H0($)).then((J)=>{let q=new Uint8Array(J),Q="";for(let G of q)Q+=G.toString(36);return Q}),BQ=async($,J,q)=>{let Q=await crypto.subtle.digest("SHA-256",H0(`${$}:${J}:${q}`));return crypto.subtle.importKey("raw",Q,{name:H8},!1,["encrypt","decrypt"])},RQ=async($,J)=>{let q=crypto.getRandomValues(new Uint8Array(12)),Q=await $,G=await crypto.subtle.encrypt({name:H8,iv:q},Q,H0(J));return`${q.join(OQ)}${NQ}${wJ(G)}`},AQ=async($,J)=>{let[q,Q]=J.split(NQ);if(!q\|\|!Q)throw Error("Invalid encrypted payload format");let G=Uint8Array.from(q.split(OQ),Number),Y=await $,X=await crypto.subtle.decrypt({name:H8,iv:G},Y,kJ(Q));return o0(X)};var B$="GenosRTC",G$=($,J)=>Array.from({length:$},J);var R$=($)=>Array.from(crypto.getRandomValues(new Uint8Array($)),(J)=>"0123456789AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz"[J%62]).join(""),m=R$(20),E0=Promise.all.bind(Promise),HQ=typeof window<"u",{entries:TQ,fromEntries:h$,keys:g9}=Object,xQ=()=>{},R0=($)=>Error(`GenosRTC: ${$}`),A$=(...$)=>$.join("@"),wQ=($,J)=>{let q=[...$],Q=q.length,G=()=>{let Y=Math.sin(J++)1e4;return Y-Math.floor(Y)};while(Q){let Y=Math.floor(G()Q--);[q[Q],q[Y]]=[q[Y],q[Q]]}return q};var LJ=5000,kQ="icegatheringstatechange",LQ="offer",CJ="answer",SJ=[...G$(3,($,J)=>`stun:stun${J\|\|""}.l.google.com:19302`),"stun:stun.cloudflare.com:3478"].map(($)=>({urls:$})),c$=($,{rtcConfig:J,rtcPolyfill:q,turnConfig:Q})=>{let G=new(q\|\|RTCPeerConnection)({iceServers:[...SJ,...Q\|\|[]],...J}),Y={},X=!1,U=!1,z,N=(Z)=>Object.assign(Z,{binaryType:"arraybuffer",bufferedAmountLowThreshold:65535,onmessage:(j)=>Y.data?.(j.data),onopen:()=>Y.connect?.(),onclose:()=>Y.close?.(),onerror:(j)=>!j?.error?.message?.includes("User-Initiated Abort")&&Y.error?.(j)}),K=()=>Promise.race([new Promise((Z)=>{let j=()=>{if(G.iceGatheringState==="complete")G.removeEventListener(kQ,j),Z()};G.addEventListener(kQ,j),j()}),new Promise((Z)=>setTimeout(Z,LJ))]).then(()=>({type:G.localDescription.type,sdp:G.localDescription.sdp.replace(/a=ice-options:trickle\s\n/g,"")}));if($?N(z=G.createDataChannel("data")):G.ondatachannel=({channel:Z})=>N(z=Z),G.onnegotiationneeded=async()=>{try{X=!0,await G.setLocalDescription(),Y.signal?.(await K())}catch(Z){Y.error?.(Z)}finally{X=!1}},G.onconnectionstatechange=()=>{if(["disconnected","failed","closed"].includes(G.connectionState))Y.close?.()},G.ontrack=(Z)=>{Y.track?.(Z.track,Z.streams[0]),Y.stream?.(Z.streams[0])},G.onremovestream=(Z)=>Y.stream?.(Z.stream),$&&!G.canTrickleIceCandidates)G.onnegotiationneeded();let w=()=>G.getSenders();return{created:Date.now(),connection:G,get channel(){return z},get isDead(){return G.connectionState==="closed"},async signal(Z){if(z?.readyState==="open"&&!Z.sdp?.includes("a=rtpmap"))return;try{if(Z.type===LQ){if(X\|\|G.signalingState!=="stable"&&!U){if($)return;await E0([G.setLocalDescription({type:"rollback"}),G.setRemoteDescription(Z)])}else await G.setRemoteDescription(Z);await G.setLocalDescription();let j=await K();return Y.signal?.(j),j}if(Z.type===CJ){U=!0;try{await G.setRemoteDescription(Z)}finally{U=!1}}}catch(j){Y.error?.(j)}},sendData:(Z)=>z.send(Z),destroy:()=>{z?.close(),G.close(),X=U=!1},setHandlers:(Z)=>Object.assign(Y,Z),offerPromise:$?new Promise((Z)=>Y.signal=(j)=>j.type===LQ&&Z(j)):Promise.resolve(),addStream:(Z)=>Z.getTracks().forEach((j)=>G.addTrack(j,Z)),removeStream:(Z)=>w().filter((j)=>Z.getTracks().includes(j.track)).forEach((j)=>G.removeTrack(j)),addTrack:(Z,j)=>G.addTrack(Z,j),removeTrack:(Z)=>{let j=w().find((T)=>T.track===Z);if(j)G.removeTrack(j)},replaceTrack:(Z,j)=>w().find((T)=>T.track===Z)?.replaceTrack(j)}};var PJ=Object.getPrototypeOf(Uint8Array),l$=12,CQ=0,o$=CQ+l$,p$=o$+1,T$=p$+1,x$=T$+1,H$=16384-x$,d$=255,T8="bufferedamountlow",Y$=($)=>`@_${$}`,x8=100,IJ=3,EJ=200,SQ=($,J,q)=>{let Q=new Map,G=new Map,Y=new Map,X={},U={},z={},N={},K=new Map,w=(D,W)=>{if(!K.has(D))K.set(D,new Set);K.get(D).add(W)},Z=(D,W)=>K.get(D)?.delete(W),j=(D,...W)=>K.get(D)?.forEach((B)=>B(...W)),T=(D,W)=>{let B=D?Array.isArray(D)?D:[D]:Q.keys();return Array.from(B,(H)=>{let R=Q.get(H);if(!R)return null;return W(H,R)}).filter(Boolean)},L=(D)=>{if(!Q.has(D))return;Q.delete(D),delete X[D],delete U[D],delete z[D],delete N[D],j("peer:leave",D),J(D)},g=(D)=>new Promise((W,B)=>{let H=setTimeout(()=>{D.removeEventListener(T8,R),B(Error(`${B$}: bufferLow timeout`))},5000);function R(){clearTimeout(H),D.removeEventListener(T8,R),W()}D.addEventListener(T8,R)}),b=(D)=>{if(Y.has(D))return Y.get(D);if(!D)throw R0("action type is required");let W=H0(D);if(W.byteLength>l$)throw R0(`❌ "${D}" exceeds ${l$} bytes. Use a shorter name.`);let B=new Uint8Array(l$).map((y,f)=>W[f]\|\|0),H=0,R=new Map([["message",new Set],["progress",new Set]]),C=(y,f)=>R.get(y)?.add(f),c=(y,f)=>R.get(y)?.delete(f),E=async(y,f,h,d)=>{if(h&&typeof h!=="object")throw R0("meta must be object");if(y===void 0)throw R0("data cannot be undefined");let l=y instanceof Blob,t=l\|\|y instanceof ArrayBuffer\|\|y instanceof PJ,Z0=typeof y!=="string";if(h&&!t)throw R0("meta only allowed with binary");let $0=t?new Uint8Array(l?await y.arrayBuffer():y):H0(Z0?V0(y):y),Q0=h?H0(V0(h)):null,e=Math.ceil($0.byteLength/H$)+(h?1:0)\|\|1;if(e>x8)throw R0(`Message too large, exceeds max chunks ${x8}`);let r0=G$(e,(i0,U0)=>{let T0=U0===e-1,A0=h&&U0===0,a0=A0?Q0:$0.subarray(h?(U0-1)H$:U0H$,h?U0H$:(U0+1)H$),x0=new Uint8Array(x$+a0.byteLength);return x0.set(B),x0.set([H],o$),x0.set([T0\|A0<<1\|t<<2\|Z0<<3],p$),x0.set([Math.round((U0+1)/ed$)],T$),x0.set(a0,x$),x0});return H=H+1&d$,E0(T(f,async(i0,U0)=>{let{channel:T0}=U0;for(let A0=0;A0<e;A0++){let a0=0;while(T0.bufferedAmount>T0.bufferedAmountLowThreshold){if(a0++>IJ)throw R0(`${B$}: send buffer full, max retries reached for peer ${i0}`);try{await g(T0)}catch(x0){await new Promise((t$)=>setTimeout(t$,EJ))}}if(!Q.has(i0))break;U0.sendData(r0[A0]),d?.(r0[A0][T$]/d$,i0,h)}}))};G.set(D,{listeners:R,send:E});let v={send:E,on:C,off:c};return Y.set(D,v),v},J0=(D,W)=>{try{let B=new Uint8Array(W),H=o0(B.subarray(CQ,o$)).replace(//g,"");if(!G.has(H))return;let[R]=B.subarray(o$,p$),[C]=B.subarray(p$,T$),[c]=B.subarray(T$,x$),E=B.subarray(x$),v=Boolean(C&1),y=Boolean(C&2),f=Boolean(C&4),h=Boolean(C&8),d=G.get(H),l=(X[D]\|\|={})[H]\|\|={};if(l[R]?.chunks?.length>x8)return;let t=l[R]\|\|={chunks:[]};if(y)try{t.meta=p0(o0(E))}catch{return}else t.chunks.push(E);if(d.listeners.get("progress").forEach((Q0)=>{try{Q0(c/d$,D,t.meta)}catch(e){}}),!v)return;let Z0=new Uint8Array(t.chunks.reduce((Q0,e)=>Q0+e.byteLength,0));t.chunks.reduce((Q0,e)=>(Z0.set(e,Q0),Q0+e.byteLength),0),delete l[R];let $0;if(f)$0=Z0;else if(h)try{$0=p0(o0(Z0))}catch{return}else $0=o0(Z0);d.listeners.get("message").forEach((Q0)=>{try{Q0($0,D,t.meta)}catch(e){}})}catch(B){}},u=async()=>{try{await M(""),await new Promise((D)=>setTimeout(D,99))}catch(D){}for(let[D,W]of Q){try{W.destroy()}catch{}Q.delete(D)}q()},{send:X0,on:n}=b(Y$("ping")),{send:q0,on:j0}=b(Y$("pong")),{send:s,on:I}=b(Y$("signal")),{send:r,on:_}=b(Y$("stream")),{send:V,on:k}=b(Y$("track")),{send:M,on:A}=b(Y$("leave"));if($((D,W)=>{if(Q.has(W))return;Q.set(W,D),D.setHandlers({data:(B)=>J0(W,B),stream:(B)=>{j("stream:add",B,W,z[W]),delete z[W]},track:(B,H)=>{j("track:add",B,H,W,N[W]),delete N[W]},signal:(B)=>s(B,W),close:()=>L(W),error:(B)=>{L(W)}}),j("peer:join",W)}),n("message",(D,W)=>q0("",W)),j0("message",(D,W)=>{U[W]?.(),delete U[W]}),I("message",(D,W)=>Q.get(W)?.signal(D)),_("message",(D,W)=>z[W]=D),k("message",(D,W)=>N[W]=D),A("message",(D,W)=>L(W)),HQ)addEventListener("beforeunload",u);return{on:w,off:Z,channel:b,leave:u,ping:async(D)=>{if(!D)throw R0("ping() requires target peer ID");let W=Date.now();return X0("",D),await new Promise((B)=>U[D]=B),Date.now()-W},getPeers:()=>h$(Array.from(Q,([D,W])=>[D,W.connection])),addStream:(D,W,B)=>T(W,async(H,R)=>{if(B)await r(B,H);R.addStream(D)}),removeStream:(D,W)=>T(W,(B,H)=>H.removeStream(D)),addTrack:(D,W,B,H)=>T(B,async(R,C)=>{if(H)await V(H,R);C.addTrack(D,W)}),removeTrack:(D,W)=>T(W,(B,H)=>H.removeTrack(D)),replaceTrack:(D,W,B,H)=>T(B,async(R,C)=>{if(H)await V(H,R);C.replaceTrack(D,W)})}};var vJ=20,fJ=2500,PQ=57333,IQ=({init:$,subscribe:J,announce:q})=>{let Q={},G=!1,Y,X;return(U,z,N)=>{let{appId:K}=U;if(Q[K]?.[z])return Q[K][z];if(!U\|\|!z\|\|!K&&!U.firebaseApp)throw R0(!U?"config required":!z?"roomId required":"appId missing");let w=xQ;if(!G){let _=$(U);X=G$(vJ,()=>c$(!0,U)),Y=Array.isArray(_)?_:[_];let V=setInterval(()=>{X=X.filter((k)=>{let M=Date.now()-k.created<PQ;if(!M)k.destroy();return M})},PQ);Q.offerCleanupTimer\|\|=V,G=!0}let Z={},j={},T=A$(B$,K,z),L=O$(T),g=O$(A$(T,m)),b=BQ(U.password\|\|"",K,z),J0=(_)=>async(V)=>({type:V.type,sdp:await _(b,V.sdp)}),u=J0(AQ),X0=J0(RQ),n=(_,V)=>{if(j[V]===_)return;j[V]?.destroy(),j[V]=_,w(_,V),Z[V]?.forEach((k)=>k!==_&&k.destroy()),delete Z[V]},q0=(_,V)=>{if(j[V]===_)delete j[V]},j0=(_)=>async(V,k,M)=>{let[A,D]=await E0([L,g]);if(V!==A&&V!==D)return;let{peerId:W,offer:B,answer:H}=typeof k==="string"?p0(k):k;if(W===m\|\|j[W])return;if(B){if(Z[W]?.[_]&&m>W)return;let R=c$(!1,U);R.setHandlers({connect:()=>n(R,W),close:()=>q0(R,W)});try{let C=await u(B);if(R.isDead)return;let[c,E]=await E0([O$(A$(T,W)),R.signal(C).then(X0)]);M(c,V0({peerId:m,answer:E}))}catch{N?.({error:"decryption failed (offer)",appId:K,peerId:W,roomId:z})}}else if(H){let R=Z[W]?.[_];if(!R\|\|R.isDead)return;R.setHandlers({connect:()=>n(R,W),close:()=>q0(R,W)});try{R.signal(await u(H))}catch{N?.({error:"decryption failed (answer)",appId:K,peerId:W,roomId:z})}}else{if(Z[W]?.[_])return;let R=X.pop()\|\|c$(!0,U),[C,{offer:c}]=await E0([O$(A$(T,W)),R.offerPromise.then(X0).then((E)=>({offer:E}))]);Z[W]\|\|=[],Z[W][_]=R,R.setHandlers({connect:()=>n(R,W),close:()=>q0(R,W)}),M(C,V0({peerId:m,offer:c,peer:R}))}},s=[],I=[];Y.forEach(async(_,V)=>{let k=await _;if(!k)return;let[M,A]=await E0([L,g]);I[V]=J(k,M,A,j0(V));let D=async()=>{let W=await q(k,M,A);s[V]=setTimeout(D,typeof W==="number"?W:fJ)};D()}),Q[K]\|\|={};let r=SQ((_)=>w=_,(_)=>delete j[_],()=>r.onCleanup?.());return r.onCleanup=()=>{if(delete Q[K][z],s.forEach(clearTimeout),I.forEach((_)=>_?.()),Object.keys(Q).length===0)clearInterval(Q.offerCleanupTimer),delete Q.offerCleanupTimer},Q[K][z]=r}};var EQ=3333,r$={},vQ={},fQ=($,J)=>{let q={},Q=null,G=()=>{if(Q)clearTimeout(Q),Q=null;let Y=new WebSocket($);Y.onclose=()=>{r$[$]??=EQ,Q=setTimeout(G,r$[$]),r$[$]=2},Y.onmessage=(X)=>J(X.data),q.socket=Y,q.url=Y.url,q.ready=new Promise((X)=>{Y.onopen=()=>{r$[$]=EQ,X(q)}}),q.send=(X)=>{if(Y.readyState===1)Y.send(X)}};return q.forceReconnect=G,G(),vQ[$]=q,q};if(typeof window<"u"){let $=()=>{Object.values(vQ).forEach((J)=>{if(J.socket&&J.socket.readyState!==WebSocket.OPEN&&J.socket.readyState!==WebSocket.CONNECTING)J.forceReconnect()})};window.addEventListener("online",()=>{$()}),window.addEventListener("offline",async()=>{}),document.addEventListener("visibilitychange",()=>{if(document.visibilityState==="visible")$()})}var _Q=($)=>()=>h$(TQ($).map(([J,q])=>[J,q.socket])),bQ=($,J,q,Q)=>($.relayUrls??(Q?wQ(J,m$($.appId)):J)).slice(0,$.relayUrls?.length??$.relayRedundancy??q);var X$={},_J=10,FQ="x",mQ="EVENT",bJ=/pow:\s(\d+)\sbits needed\.?/i,w8=new Set,hQ=u$.utils.randomSecretKey(),yJ=F$(u$.getPublicKey(hQ)),k8={},w$={},gJ={},cQ=()=>Math.floor(Date.now()/1000),dQ=($)=>gJ[$]??=m$($,1e4)+20000,i$=($)=>$.replace(/\/$/,""),uJ=["wss://relay.primal.net","wss://ftp.halifax.rwth-aachen.de/nostr","wss://nostr.oxtr.dev","wss://nostr.sathoarder.com","wss://nostr.mom","wss://nos.lol","wss://nostr.vulpem.com","wss://nostr.data.haus","wss://relay.mostro.network","wss://relay.nostrdice.com"],FJ=($,J)=>{let[q,Q,G,Y]=p0(J);if(q===mQ)return w$[Q]?.(k8[Q],G.content);if(q==="NOTICE"\|\|q==="OK"&&!G){if(+((q==="NOTICE"?Q:Y).match(bJ)?.[1]??0)>0){let U=i$($);w8.add(U),X$[U]?.close?.(),delete X$[U]}}},mJ=($)=>{let J=i$($);if(X$[J])return X$[J];let q=fQ(J,(Q)=>FJ(J,Q));return X$[J]=q},yQ=async($,J)=>{let q={kind:dQ($),content:J,pubkey:yJ,created_at:cQ(),tags:[[FQ,$]]},Q=H0(V0([0,q.pubkey,q.created_at,q.kind,q.tags,q.content])),G=new Uint8Array(await crypto.subtle.digest("SHA-256",Q)),Y=u$.sign(G,hQ);return V0([mQ,{...q,id:F$(G),sig:F$(Y)}])},gQ=($,J)=>{return k8[$]=J,V0(["REQ",$,{kinds:[dQ(J)],since:cQ(),["#"+FQ]:[J]}])},uQ=($)=>{return delete k8[$],V0(["CLOSE",$])},lQ=IQ({init:($)=>{let q=($?.relayUrls?.length?$.relayUrls:null)??uJ;return bQ($,q,_J,!1).map(mJ).map((G)=>G.ready.then(()=>G).catch(()=>null))},subscribe:($,J,q,Q)=>{let G=R$(64),Y=R$(64);return w$[G]=w$[Y]=(X,U)=>Q(X,U,async(z,N)=>{if(w8.has(i$($.url)))return;$.send(await yQ(z,N))}),$.send(gQ(G,J)),$.send(gQ(Y,q)),()=>{$.send(uQ(G)),$.send(uQ(Y)),delete w$[G],delete w$[Y]}},announce:async($,J)=>{if(w8.has(i$($.url)))return;$.send(await yQ(J,V0({peerId:m})))}}),hJ=_Q(X$);var cJ={cellSize:"auto",bridgesPerEdge:2,maxCellSize:50,targetCells:100,debug:!1},oQ=5000,dJ=3000,lJ=30000,oJ=2000,s$=($)=>{let J=String($\|\|"").match(/cell-(\d+)/);return J?Number(J[1]):null},Z$=($)=>{let J=s$($);if(J==null)return[];let q=[];if(J>0)q.push(`cell-${J-1}`);return q.push(`cell-${J+1}`),q},a$=($)=>`c${(s$($)\|\|0).toString(36)}`,pJ=($,J,q)=>{if($<=10)return Math.max(2,$);let G=10,Y=Math.ceil($/J);return Math.max(G,Math.min(q,Y))},pQ=($,J)=>{return Math.max(1,Math.ceil($/J))},rJ=($,J,q)=>{let Q=Math.max(1,Math.ceil(J.length/q)),G=Math.ceil(J.length/Q),Y=J.indexOf($);if(Y<0)return 0;return Math.floor(Y/G)};class n${constructor($){this.peerId=$,this.joinedAt=Date.now(),this.lastSeen=Date.now(),this.rttSamples=[],this.stability=1,this.reconnects=0,this.isResponsive=!0,this.connectedCells=new Set}get uptime(){return Date.now()-this.joinedAt}get avgRtt(){if(this.rttSamples.length===0)return 1/0;return Math.round(this.rttSamples.reduce(($,J)=>$+J,0)/this.rttSamples.length)}get healthScore(){let $=this.avgRtt===1/0?0.5:Math.max(0,100-this.avgRtt)/100,J=Math.min(1,this.uptime/60000),q=this.stability,Q=this.isResponsive?1:0.3;return $0.25+J0.25+q0.3+Q0.2}get isStale(){return Date.now()-this.lastSeen>lJ}addRttSample($){if(this.rttSamples.push($),this.rttSamples.length>10)this.rttSamples.shift();this.lastSeen=Date.now(),this.isResponsive=!0}markReconnect(){this.reconnects++,this.stability=Math.max(0,1-this.reconnects0.1)}markUnresponsive(){this.isResponsive=!1}markSeen(){this.lastSeen=Date.now()}addConnectedCell($){if($)this.connectedCells.add($)}}function iJ($,J={}){let q={...cJ,...J},Q=!!q.debug,G=(...O)=>Q&&void 0,Y=Math.max(0,q.bridgesPerEdge\|0),X=Math.max(5,q.maxCellSize\|0),U=Math.max(10,q.targetCells\|0),z=q.cellSize==="auto",N=z?2:Math.max(1,q.cellSize\|0),K={cellId:null,bridges:[],isBridge:!1},w=null,Z=null,j=null,T=new Map,L=new Map,g=new Set,b=new Map,J0=new Set,u=new Set,X0=0,n=[],q0=new Map,j0=new Set,s=new Map,I=new Map,r=()=>{let O=Math.ceil(f().length/N);return Math.min(150,O+3)},_=$.on?.bind($),V=$.off?.bind($);if(_)$.on=(O,x)=>String(O).startsWith("mesh:")?A(O,x):_(O,x);if(V)$.off=(O,x)=>String(O).startsWith("mesh:")?b.get(O)?.delete(x):V(O,x);let k=(O)=>(g.add(O),()=>g.delete(O)),M=(O,x,S)=>{if(u.has(S))return;if(u.add(S),u.size>oQ){let P=u.values().next().value;u.delete(P)}for(let P of g)try{P(O,x)}catch(F){G("Error in deliver handler:",F)}},A=(O,x)=>{if(!b.has(O))b.set(O,new Set);return b.get(O).add(x),()=>b.get(O)?.delete(x)},D=(O,...x)=>{let S=b.get(O);if(S)for(let P of S)try{P(...x)}catch{}},W=(O)=>{try{return typeof O==="string"?JSON.parse(O):O}catch{return null}},B=()=>`${m}:${Date.now().toString(36)}:${(X0++&65535).toString(36)}`,H=()=>{if(J0.size>oQ)J0.delete(J0.values().next().value)},R=(O,x,S=[])=>{if(!O\|\|!x)return;if(T.set(O,{cell:x,isBridge:S.length>0,bridges:[...S]}),!L.has(O))L.set(O,new n$(O));let P=L.get(O);if(P.markSeen(),P.addConnectedCell(x),I.set(x,{lastSeen:Date.now(),peerId:O}),S.length>0)for(let F of Z$(x))P.addConnectedCell(F)},C=(O)=>L.get(O),c=(O,x)=>{let S=L.get(O);if(S)S.addRttSample(x)},E=(O)=>{let x=$0(O);if(x.length===0)return null;let S=0,P=0;for(let i of x){let z0=L.get(i);if(z0&&!z0.isStale){if(S+=z0.healthScore,z0.isResponsive)P++}}let F=x.filter((i)=>{let z0=L.get(i);return z0&&!z0.isStale});return{cellId:O,memberCount:F.length,avgHealth:F.length>0?S/F.length:0,responsiveRatio:F.length>0?P/F.length:0}},v=()=>{let O=E(K.cellId);D("mesh:health",{...K,health:O})},y=()=>{let O=Object.keys($.getPeers?.()\|\|{}),x=[...O,m].sort();return{peers:O,all:x}},f=()=>{let{all:O}=y();return O.filter((x)=>{if(x===m)return!0;let S=L.get(x);return S&&!S.isStale})},h=()=>{if(!z)return;let O=f().length,x=pJ(O,U,X);if(x!==N)G("cellSize changed:",N,"->",x),N=x},d=(O,x)=>{let S=pQ(x.length,N),P=Math.ceil(x.length/S),F=OP,i=Math.min(F+P,x.length);return x.slice(F,i)},l=(O,x)=>{if(Y===0)return[];let S=s$(O),P=s$(x);if(S==null\|\|P==null)return[];let F=f(),i=d(S,F),z0=d(P,F),a=[...new Set([...i,...z0])];if(!a.length)return[];let n0=new Set($0(O)),k$=new Set($0(x)),N0=a.filter((D0)=>{if(D0===m)return!0;let w0=L.get(D0);if(!w0\|\|w0.isStale)return!1;let o=n0.has(D0)\|\|w0.connectedCells.has(O),v0=k$.has(D0)\|\|w0.connectedCells.has(x);return o\|\|v0});if(!N0.length)N0.push(...a);let s0=N0.map((D0)=>({id:D0,score:L.get(D0)?.healthScore\|\|0.5}));return s0.sort((D0,w0)=>{let o=w0.score-D0.score;return o!==0?o:D0.id.localeCompare(w0.id)}),s0.slice(0,Y).map((D0)=>D0.id)},t=(O,x)=>{if(Y===0)return[];let S=Z$(x),P=[];for(let F of S)if(l(x,F).includes(O))P.push(F);return P},Z0=()=>{h();let O=f(),x=rJ(m,O,N),S=pQ(O.length,N),P=`cell-${x}`,F=t(m,P),i=F.length>0;return G("computeState",{self:m,myCell:P,isBridge:i,bridgeEdges:F,cellSize:N,rosterSize:O.length,totalCells:S,dynamicTTL:r()}),{cellId:P,isBridge:i,bridges:F,cellSize:N,dynamicTTL:r(),totalCells:S}},$0=(O)=>{let x=[],S=new Set(Object.keys($.getPeers?.()\|\|{}));for(let[P,F]of T)if(F.cell===O){let i=L.get(P);if(S.has(P)&&(!i\|\|!i.isStale))x.push(P)}return x.sort(),x},Q0=()=>{if(!w)return;T0=A0();let O={t:"state",id:B(),ttl:r(),data:{id:m,cell:K.cellId,bridges:K.bridges,health:L.get(m)?.healthScore\|\|0.5,timestamp:Date.now()},origin:m,originCell:K.cellId},x=JSON.stringify(O);w.send(x),e(Z,x)},e=(O,x)=>{let S=W(x);if(!S?.id\|\|!S?.t)return;let P=J0.has(S.id);if(!P)J0.add(S.id),H();let{t:F,id:i,ttl:z0,data:a,origin:n0,originCell:k$}=S,N0=K.cellId;if(F==="state"&&a)R(a.id,a.cell,a.bridges),D("mesh:peer-state",a);if(F==="ping"&&a?.pingId&&n0!==m){let o={t:"pong",id:B(),ttl:r(),data:{pingId:a.pingId,receivedAt:Date.now()},origin:m,originCell:N0};w?.send(JSON.stringify(o))}if(F==="pong"&&a?.pingId){let o=s.get(a.pingId);if(o){clearTimeout(o.timeout);let v0=Date.now()-o.start;c(o.peerId,v0),o.resolve(v0),s.delete(a.pingId)}}if(F==="msg"&&n0!==m){if(k$===N0\|\|Y>0)M(a,n0,i)}if(P)return;if(!K.isBridge)return;if((z0??0)<=0)return;let s0=(o,v0,rQ=null)=>{if(!o)return;let iQ={t:F,id:i,ttl:rQ??(z0??r())-1,data:a,origin:n0\|\|m,originCell:k$\|\|N0},L8=JSON.stringify(iQ);if(v0?.length){let aQ=new Set(Object.keys($.getPeers?.()\|\|{})),C8=v0.filter((nQ)=>aQ.has(nQ));if(C8.length>0)o.send(L8,C8)}else o.send(L8)};if(O===Z){for(let o of Z$(N0))s0(r0(o),null);return}if(!Z$(N0).map(a$).includes(O))return;let w0=$0(N0);s0(w,w0);for(let o of Z$(N0))if(a$(o)!==O)s0(r0(o),null)},r0=(O)=>{let x=a$(O);if(q0.has(O))return q0.get(O);let S=$.channel(x);if(q0.set(O,S),!j0.has(x))j0.add(x),S.on("message",(P)=>e(x,P));return S},i0=()=>{if(!K.cellId)return;if(Z=a$(K.cellId),w=$.channel(Z),!j0.has(Z))j0.add(Z),w.on("message",(O)=>e(Z,O));if(K.isBridge)for(let O of Z$(K.cellId))r0(O);if(n.length){let O=$0(K.cellId);for(let x of n.splice(0)){let S={t:"msg",id:B(),ttl:r(),data:x,origin:m,originCell:K.cellId},P=JSON.stringify(S);O.length?w.send(P,O):w.send(P),e(Z,P)}}Q0()},U0=()=>{let O=Z0(),x=!K.cellId\|\|K.cellId!==O.cellId\|\|K.isBridge!==O.isBridge\|\|JSON.stringify(K.bridges)!==JSON.stringify(O.bridges);if(K=O,R(m,O.cellId,O.bridges),x)i0();else Q0();D("mesh:state",O),v()},T0="",A0=()=>{return`${K.cellId}:${K.isBridge}:${K.bridges.join(",")}`},a0=()=>{if(j)return;j=setInterval(()=>{let O=A0();if(O!==T0)Q0(),T0=O;for(let[x,S]of L)if(x!==m&&S.isStale)T.delete(x),L.delete(x),G("Removed stale peer:",x)},oJ)},x0=()=>{if(j)clearInterval(j),j=null},t$=(O)=>{return new Promise((x,S)=>{let P=`${Date.now()}-${Math.random().toString(36).slice(2,8)}`,F=Date.now(),i=setTimeout(()=>{s.delete(P);let a=L.get(O);if(a)a.markUnresponsive();S(Error("Ping timeout"))},dJ);s.set(P,{start:F,resolve:x,reject:S,timeout:i,peerId:O});let z0={t:"ping",id:B(),ttl:r(),data:{pingId:P,target:O},origin:m,originCell:K.cellId};w?.send(JSON.stringify(z0))})};if($.on?.("peer:join",(O)=>{if(!L.has(O))L.set(O,new n$(O));else L.get(O).markReconnect();U0()}),$.on?.("peer:leave",(O)=>{T.delete(O),U0()}),!L.has(m))L.set(m,new n$(m));return L.get(m).addConnectedCell(K.cellId\|\|"cell-0"),U0(),a0(),{send:(O)=>{if(!K.cellId\|\|!w)return n.push(O);let x=$0(K.cellId),S={t:"msg",id:B(),ttl:r(),data:O,origin:m,originCell:K.cellId},P=JSON.stringify(S);x.length?w.send(P,x):w.send(P),e(Z,P)},on:(O,x)=>O==="message"?k(x):void 0,ping:t$,getState:()=>({...K,cellSize:N,health:E(K.cellId),dynamicTTL:r(),totalCells:Math.ceil(f().length/N),knownCells:I.size}),getMetrics:C,getCellHealth:E,getPeerInfo:()=>new Map(T),getStableRoster:()=>f(),getKnownCells:()=>new Map(I),getCellSize:()=>N,destroy:()=>{x0(),s.forEach((O)=>clearTimeout(O.timeout)),s.clear(),u.clear(),I.clear()}}}function Xq($,J,q){let Q=lQ($,J,q),G=$.overlay\|\|{},Y=iJ(Q,G),X=new Map;return{on:(U,z)=>Q.on(U,z),off:(U,z)=>Q.off?.(U,z),channel:(U)=>{if(X.has(U))return X.get(U);let z=Q.channel(U),N={send:(K,w)=>{Y.send({_ch:U,_d:K,_t:w})},on:(K,w)=>{if(K==="message")Y.on("message",(Z,j)=>{if(Z?._ch===U)w(Z._d,j)}),z.on(K,w);else z.on(K,w)},off:(K,w)=>z.off?.(K,w),_original:z};return X.set(U,N),N},get id(){return Q.id},get peers(){return Q.peers},getPeers:()=>Q.getPeers?.()\|\|{},mesh:Y,_room:Q,getState:()=>Y.getState(),getMetrics:(U)=>Y.getMetrics(U),getCellHealth:(U)=>Y.getCellHealth(U),getPeerInfo:()=>Y.getPeerInfo(),ping:(U)=>Y.ping(U),destroy:()=>{Y.destroy(),X.clear()}}}export{m as selfId,Xq as join,hJ as getRelaySockets,cJ as OVERLAY_DEFAULTS};
1	+ var g$=typeof globalThis==="object"&&"crypto"in globalThis?globalThis.crypto:void 0;/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /function u$($){return $ instanceof Uint8Array\|\|ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function Z0($){if(!Number.isSafeInteger($)\|\|$<0)throw Error("positive integer expected, got "+$)}function H$($,...J){if(!u$($))throw Error("Uint8Array expected");if(J.length>0&&!J.includes($.length))throw Error("Uint8Array expected of length "+J+", got length="+$.length)}function w0($){if(typeof $!=="function"\|\|typeof $.create!=="function")throw Error("Hash should be wrapped by utils.createHasher");Z0($.outputLen),Z0($.blockLen)}function a$($,J=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(J&&$.finished)throw Error("Hash#digest() has already been called")}function f8($,J){H$($);let q=J.outputLen;if($.length<q)throw Error("digestInto() expects output buffer of length at least "+q)}function F$(...$){for(let J=0;J<$.length;J++)$[J].fill(0)}function k0($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function A$($,J){return $<<32-J\|$>>>J}var y8=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),YJ=Array.from({length:256},($,J)=>J.toString(16).padStart(2,"0"));function w$($){if(H$($),y8)return $.toHex();let J="";for(let q=0;q<$.length;q++)J+=YJ[$[q]];return J}var L$={_0:48,_9:57,A:65,F:70,a:97,f:102};function b8($){if($>=L$._0&&$<=L$._9)return $-L$._0;if($>=L$.A&&$<=L$.F)return $-(L$.A-10);if($>=L$.a&&$<=L$.f)return $-(L$.a-10);return}function m$($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(y8)return Uint8Array.fromHex($);let J=$.length,q=J/2;if(J%2)throw Error("hex string expected, got unpadded hex of length "+J);let Q=new Uint8Array(q);for(let G=0,Y=0;G<q;G++,Y+=2){let X=b8($.charCodeAt(Y)),j=b8($.charCodeAt(Y+1));if(X===void 0\|\|j===void 0){let U=$[Y]+$[Y+1];throw Error('hex string expected, got non-hex character "'+U+'" at index '+Y)}Q[G]=X16+j}return Q}function C0($){if(typeof $!=="string")throw Error("string expected");return new Uint8Array(new TextEncoder().encode($))}function U0($){if(typeof $==="string")$=C0($);return H$($),$}function K$(...$){let J=0;for(let Q=0;Q<$.length;Q++){let G=$[Q];H$(G),J+=G.length}let q=new Uint8Array(J);for(let Q=0,G=0;Q<$.length;Q++){let Y=$[Q];q.set(Y,G),G+=Y.length}return q}class K0{}function g8($){let J=(Q)=>$().update(U0(Q)).digest(),q=$();return J.outputLen=q.outputLen,J.blockLen=q.blockLen,J.create=()=>$(),J}function h$($=32){if(g$&&typeof g$.getRandomValues==="function")return g$.getRandomValues(new Uint8Array($));if(g$&&typeof g$.randomBytes==="function")return Uint8Array.from(g$.randomBytes($));throw Error("crypto.getRandomValues must be defined")}function XJ($,J,q,Q){if(typeof $.setBigUint64==="function")return $.setBigUint64(J,q,Q);let G=BigInt(32),Y=BigInt(4294967295),X=Number(q>>G&Y),j=Number(q&Y),U=Q?4:0,B=Q?0:4;$.setUint32(J+U,X,Q),$.setUint32(J+B,j,Q)}function u8($,J,q){return $&J^~$&q}function F8($,J,q){return $&J^$&q^J&q}class $8 extends K0{constructor($,J,q,Q){super();this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=$,this.outputLen=J,this.padOffset=q,this.isLE=Q,this.buffer=new Uint8Array($),this.view=k0(this.buffer)}update($){a$(this),$=U0($),H$($);let{view:J,buffer:q,blockLen:Q}=this,G=$.length;for(let Y=0;Y<G;){let X=Math.min(Q-this.pos,G-Y);if(X===Q){let j=k0($);for(;Q<=G-Y;Y+=Q)this.process(j,Y);continue}if(q.set($.subarray(Y,Y+X),this.pos),this.pos+=X,Y+=X,this.pos===Q)this.process(J,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){a$(this),f8($,this),this.finished=!0;let{buffer:J,view:q,blockLen:Q,isLE:G}=this,{pos:Y}=this;if(J[Y++]=128,F$(this.buffer.subarray(Y)),this.padOffset>Q-Y)this.process(q,0),Y=0;for(let V=Y;V<Q;V++)J[V]=0;XJ(q,Q-8,BigInt(this.length8),G),this.process(q,0);let X=k0($),j=this.outputLen;if(j%4)throw Error("_sha2: outputLen should be aligned to 32bit");let U=j/4,B=this.get();if(U>B.length)throw Error("_sha2: outputLen bigger than state");for(let V=0;V<U;V++)X.setUint32(4V,B[V],G)}digest(){let{buffer:$,outputLen:J}=this;this.digestInto($);let q=$.slice(0,J);return this.destroy(),q}_cloneInto($){$\|\|($=new this.constructor),$.set(...this.get());let{blockLen:J,buffer:q,length:Q,finished:G,destroyed:Y,pos:X}=this;if($.destroyed=Y,$.finished=G,$.length=Q,$.pos=X,Q%J)$.buffer.set(q);return $}clone(){return this._cloneInto()}}var k$=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);var zJ=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]),E$=new Uint32Array(64);class m8 extends $8{constructor($=32){super(64,$,8,!1);this.A=k$[0]\|0,this.B=k$[1]\|0,this.C=k$[2]\|0,this.D=k$[3]\|0,this.E=k$[4]\|0,this.F=k$[5]\|0,this.G=k$[6]\|0,this.H=k$[7]\|0}get(){let{A:$,B:J,C:q,D:Q,E:G,F:Y,G:X,H:j}=this;return[$,J,q,Q,G,Y,X,j]}set($,J,q,Q,G,Y,X,j){this.A=$\|0,this.B=J\|0,this.C=q\|0,this.D=Q\|0,this.E=G\|0,this.F=Y\|0,this.G=X\|0,this.H=j\|0}process($,J){for(let V=0;V<16;V++,J+=4)E$[V]=$.getUint32(J,!1);for(let V=16;V<64;V++){let A=E$[V-15],z=E$[V-2],K=A$(A,7)^A$(A,18)^A>>>3,L=A$(z,17)^A$(z,19)^z>>>10;E$[V]=L+E$[V-7]+K+E$[V-16]\|0}let{A:q,B:Q,C:G,D:Y,E:X,F:j,G:U,H:B}=this;for(let V=0;V<64;V++){let A=A$(X,6)^A$(X,11)^A$(X,25),z=B+A+u8(X,j,U)+zJ[V]+E$[V]\|0,L=(A$(q,2)^A$(q,13)^A$(q,22))+F8(q,Q,G)\|0;B=U,U=j,j=X,X=Y+z\|0,Y=G,G=Q,Q=q,q=z+L\|0}q=q+this.A\|0,Q=Q+this.B\|0,G=G+this.C\|0,Y=Y+this.D\|0,X=X+this.E\|0,j=j+this.F\|0,U=U+this.G\|0,B=B+this.H\|0,this.set(q,Q,G,Y,X,j,U,B)}roundClean(){F$(E$)}destroy(){this.set(0,0,0,0,0,0,0,0),F$(this.buffer)}}var S0=g8(()=>new m8);class Q8 extends K0{constructor($,J){super();this.finished=!1,this.destroyed=!1,w0($);let q=U0(J);if(this.iHash=$.create(),typeof this.iHash.update!=="function")throw Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;let Q=this.blockLen,G=new Uint8Array(Q);G.set(q.length>Q?$.create().update(q).digest():q);for(let Y=0;Y<G.length;Y++)G[Y]^=54;this.iHash.update(G),this.oHash=$.create();for(let Y=0;Y<G.length;Y++)G[Y]^=106;this.oHash.update(G),F$(G)}update($){return a$(this),this.iHash.update($),this}digestInto($){a$(this),H$($,this.outputLen),this.finished=!0,this.iHash.digestInto($),this.oHash.update($),this.oHash.digestInto($),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$\|\|($=Object.create(Object.getPrototypeOf(this),{}));let{oHash:J,iHash:q,finished:Q,destroyed:G,blockLen:Y,outputLen:X}=this;return $=$,$.finished=Q,$.destroyed=G,$.blockLen=Y,$.outputLen=X,$.oHash=J._cloneInto($.oHash),$.iHash=q._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var J8=($,J,q)=>new Q8($,J).update(q).digest();J8.create=($,J)=>new Q8($,J);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var Y8=BigInt(0),G8=BigInt(1);function j0($,J=""){if(typeof $!=="boolean"){let q=J&&`"${J}"`;throw Error(q+"expected boolean, got type="+typeof $)}return $}function v$($,J,q=""){let Q=u$($),G=$?.length,Y=J!==void 0;if(!Q\|\|Y&&G!==J){let X=q&&`"${q}" `,j=Y?` of length ${J}`:"",U=Q?`length=${G}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+j+", got "+U)}return $}function W0($){let J=$.toString(16);return J.length&1?"0"+J:J}function h8($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?Y8:BigInt("0x"+$)}function C$($){return h8(w$($))}function X8($){return H$($),h8(w$(Uint8Array.from($).reverse()))}function n$($,J){return m$($.toString(16).padStart(J2,"0"))}function z8($,J){return n$($,J).reverse()}function p($,J,q){let Q;if(typeof J==="string")try{Q=m$(J)}catch(Y){throw Error($+" must be hex string or Uint8Array, cause: "+Y)}else if(u$(J))Q=Uint8Array.from(J);else throw Error($+" must be hex string or Uint8Array");let G=Q.length;if(typeof q==="number"&&G!==q)throw Error($+" of length "+q+" expected, got "+G);return Q}var q8=($)=>typeof $==="bigint"&&Y8<=$;function D0($,J,q){return q8($)&&q8(J)&&q8(q)&&J<=$&&$<q}function c8($,J,q,Q){if(!D0(J,q,Q))throw Error("expected valid "+$+": "+q+" <= n < "+Q+", got "+J)}function P0($){let J;for(J=0;$>Y8;$>>=G8,J+=1);return J}var _$=($)=>(G8<<BigInt($))-G8;function d8($,J,q){if(typeof $!=="number"\|\|$<2)throw Error("hashLen must be a number");if(typeof J!=="number"\|\|J<2)throw Error("qByteLen must be a number");if(typeof q!=="function")throw Error("hmacFn must be a function");let Q=(K)=>new Uint8Array(K),G=(K)=>Uint8Array.of(K),Y=Q($),X=Q($),j=0,U=()=>{Y.fill(1),X.fill(0),j=0},B=(...K)=>q(X,Y,...K),V=(K=Q(0))=>{if(X=B(G(0),K),Y=B(),K.length===0)return;X=B(G(1),K),Y=B()},A=()=>{if(j++>=1000)throw Error("drbg: tried 1000 values");let K=0,L=[];while(K<J){Y=B();let S=Y.slice();L.push(S),K+=Y.length}return K$(...L)};return(K,L)=>{U(),V(K);let S=void 0;while(!(S=L(A())))V();return U(),S}}function M0($,J,q={}){if(!$\|\|typeof $!=="object")throw Error("expected valid options object");function Q(G,Y,X){let j=$[G];if(X&&j===void 0)return;let U=typeof j;if(U!==Y\|\|j===null)throw Error(`param "${G}" is invalid: expected ${Y}, got ${U}`)}Object.entries(J).forEach(([G,Y])=>Q(G,Y,!1)),Object.entries(q).forEach(([G,Y])=>Q(G,Y,!0))}function Z8($){let J=new WeakMap;return(q,...Q)=>{let G=J.get(q);if(G!==void 0)return G;let Y=$(q,...Q);return J.set(q,Y),Y}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var Z$=BigInt(0),q$=BigInt(1),c$=BigInt(2),o8=BigInt(3),i8=BigInt(4),r8=BigInt(5),ZJ=BigInt(7),a8=BigInt(8),UJ=BigInt(9),n8=BigInt(16);function W$($,J){let q=$%J;return q>=Z$?q:J+q}function D$($,J,q){let Q=$;while(J-- >Z$)Q=Q,Q%=q;return Q}function l8($,J){if($===Z$)throw Error("invert: expected non-zero number");if(J<=Z$)throw Error("invert: expected positive modulus, got "+J);let q=W$($,J),Q=J,G=Z$,Y=q$,X=q$,j=Z$;while(q!==Z$){let B=Q/q,V=Q%q,A=G-XB,z=Y-jB;Q=q,q=V,G=X,Y=j,X=A,j=z}if(Q!==q$)throw Error("invert: does not exist");return W$(G,J)}function U8($,J,q){if(!$.eql($.sqr(J),q))throw Error("Cannot find square root")}function s8($,J){let q=($.ORDER+q$)/i8,Q=$.pow(J,q);return U8($,Q,J),Q}function KJ($,J){let q=($.ORDER-r8)/a8,Q=$.mul(J,c$),G=$.pow(Q,q),Y=$.mul(J,G),X=$.mul($.mul(Y,c$),G),j=$.mul(Y,$.sub(X,$.ONE));return U8($,j,J),j}function jJ($){let J=b$($),q=t8($),Q=q(J,J.neg(J.ONE)),G=q(J,Q),Y=q(J,J.neg(Q)),X=($+ZJ)/n8;return(j,U)=>{let B=j.pow(U,X),V=j.mul(B,Q),A=j.mul(B,G),z=j.mul(B,Y),K=j.eql(j.sqr(V),U),L=j.eql(j.sqr(A),U);B=j.cmov(B,V,K),V=j.cmov(z,A,L);let S=j.eql(j.sqr(V),U),I=j.cmov(B,V,S);return U8(j,I,U),I}}function t8($){if($<o8)throw Error("sqrt is not defined for small field");let J=$-q$,q=0;while(J%c$===Z$)J/=c$,q++;let Q=c$,G=b$($);while(p8(G,Q)===1)if(Q++>1000)throw Error("Cannot find square root: probably non-prime P");if(q===1)return s8;let Y=G.pow(Q,J),X=(J+q$)/c$;return function(U,B){if(U.is0(B))return B;if(p8(U,B)!==1)throw Error("Cannot find square root");let V=q,A=U.mul(U.ONE,Y),z=U.pow(B,J),K=U.pow(B,X);while(!U.eql(z,U.ONE)){if(U.is0(z))return U.ZERO;let L=1,S=U.sqr(z);while(!U.eql(S,U.ONE))if(L++,S=U.sqr(S),L===V)throw Error("Cannot find square root");let I=q$<<BigInt(V-L-1),g=U.pow(A,I);V=L,A=U.sqr(g),z=U.mul(z,A),K=U.mul(K,g)}return K}}function WJ($){if($%i8===o8)return s8;if($%a8===r8)return KJ;if($%n8===UJ)return jJ($);return t8($)}var DJ=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function K8($){let J={ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"},q=DJ.reduce((Q,G)=>{return Q[G]="function",Q},J);return M0($,q),$}function MJ($,J,q){if(q<Z$)throw Error("invalid exponent, negatives unsupported");if(q===Z$)return $.ONE;if(q===q$)return J;let Q=$.ONE,G=J;while(q>Z$){if(q&q$)Q=$.mul(Q,G);G=$.sqr(G),q>>=q$}return Q}function I0($,J,q=!1){let Q=Array(J.length).fill(q?$.ZERO:void 0),G=J.reduce((X,j,U)=>{if($.is0(j))return X;return Q[U]=X,$.mul(X,j)},$.ONE),Y=$.inv(G);return J.reduceRight((X,j,U)=>{if($.is0(j))return X;return Q[U]=$.mul(X,Q[U]),$.mul(X,j)},Y),Q}function p8($,J){let q=($.ORDER-q$)/c$,Q=$.pow(J,q),G=$.eql(Q,$.ONE),Y=$.eql(Q,$.ZERO),X=$.eql(Q,$.neg($.ONE));if(!G&&!Y&&!X)throw Error("invalid Legendre symbol result");return G?1:Y?0:-1}function E0($,J){if(J!==void 0)Z0(J);let q=J!==void 0?J:$.toString(2).length,Q=Math.ceil(q/8);return{nBitLength:q,nByteLength:Q}}function b$($,J,q=!1,Q={}){if($<=Z$)throw Error("invalid field: expected ORDER > 0, got "+$);let G=void 0,Y=void 0,X=!1,j=void 0;if(typeof J==="object"&&J!=null){if(Q.sqrt\|\|q)throw Error("cannot specify opts in two arguments");let z=J;if(z.BITS)G=z.BITS;if(z.sqrt)Y=z.sqrt;if(typeof z.isLE==="boolean")q=z.isLE;if(typeof z.modFromBytes==="boolean")X=z.modFromBytes;j=z.allowedLengths}else{if(typeof J==="number")G=J;if(Q.sqrt)Y=Q.sqrt}let{nBitLength:U,nByteLength:B}=E0($,G);if(B>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");let V,A=Object.freeze({ORDER:$,isLE:q,BITS:U,BYTES:B,MASK:_$(U),ZERO:Z$,ONE:q$,allowedLengths:j,create:(z)=>W$(z,$),isValid:(z)=>{if(typeof z!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof z);return Z$<=z&&z<$},is0:(z)=>z===Z$,isValidNot0:(z)=>!A.is0(z)&&A.isValid(z),isOdd:(z)=>(z&q$)===q$,neg:(z)=>W$(-z,$),eql:(z,K)=>z===K,sqr:(z)=>W$(zz,$),add:(z,K)=>W$(z+K,$),sub:(z,K)=>W$(z-K,$),mul:(z,K)=>W$(zK,$),pow:(z,K)=>MJ(A,z,K),div:(z,K)=>W$(zl8(K,$),$),sqrN:(z)=>zz,addN:(z,K)=>z+K,subN:(z,K)=>z-K,mulN:(z,K)=>zK,inv:(z)=>l8(z,$),sqrt:Y\|\|((z)=>{if(!V)V=WJ($);return V(A,z)}),toBytes:(z)=>q?z8(z,B):n$(z,B),fromBytes:(z,K=!0)=>{if(j){if(!j.includes(z.length)\|\|z.length>B)throw Error("Field.fromBytes: expected "+j+" bytes, got "+z.length);let S=new Uint8Array(B);S.set(z,q?0:S.length-z.length),z=S}if(z.length!==B)throw Error("Field.fromBytes: expected "+B+" bytes, got "+z.length);let L=q?X8(z):C$(z);if(X)L=W$(L,$);if(!K){if(!A.isValid(L))throw Error("invalid field element: outside of range 0..ORDER")}return L},invertBatch:(z)=>I0(A,z),cmov:(z,K,L)=>L?K:z});return Object.freeze(A)}function e8($){if(typeof $!=="bigint")throw Error("field order must be bigint");let J=$.toString(2).length;return Math.ceil(J/8)}function j8($){let J=e8($);return J+Math.ceil(J/2)}function v0($,J,q=!1){let Q=$.length,G=e8(J),Y=j8(J);if(Q<16\|\|Q<Y\|\|Q>1024)throw Error("expected "+Y+"-1024 bytes of input, got "+Q);let X=q?X8($):C$($),j=W$(X,J-q$)+q$;return q?z8(j,G):n$(j,G)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var s$=BigInt(0),d$=BigInt(1);function V0($,J){let q=J.negate();return $?q:J}function _0($,J){let q=I0($.Fp,J.map((Q)=>Q.Z));return J.map((Q,G)=>$.fromAffine(Q.toAffine(q[G])))}function qQ($,J){if(!Number.isSafeInteger($)\|\|$<=0\|\|$>J)throw Error("invalid window size, expected [1.."+J+"], got W="+$)}function W8($,J){qQ($,J);let q=Math.ceil(J/$)+1,Q=2($-1),G=2$,Y=_$($),X=BigInt($);return{windows:q,windowSize:Q,mask:Y,maxNumber:G,shiftBy:X}}function $Q($,J,q){let{windowSize:Q,mask:G,maxNumber:Y,shiftBy:X}=q,j=Number($&G),U=$>>X;if(j>Q)j-=Y,U+=d$;let B=JQ,V=B+Math.abs(j)-1,A=j===0,z=j<0,K=J%2!==0;return{nextN:U,offset:V,isZero:A,isNeg:z,isNegF:K,offsetF:B}}function VJ($,J){if(!Array.isArray($))throw Error("array expected");$.forEach((q,Q)=>{if(!(q instanceof J))throw Error("invalid point at index "+Q)})}function NJ($,J){if(!Array.isArray($))throw Error("array of scalars expected");$.forEach((q,Q)=>{if(!J.isValid(q))throw Error("invalid scalar at index "+Q)})}var D8=new WeakMap,GQ=new WeakMap;function M8($){return GQ.get($)\|\|1}function QQ($){if($!==s$)throw Error("invalid wNAF")}class V8{constructor($,J){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=J}_unsafeLadder($,J,q=this.ZERO){let Q=$;while(J>s$){if(J&d$)q=q.add(Q);Q=Q.double(),J>>=d$}return q}precomputeWindow($,J){let{windows:q,windowSize:Q}=W8(J,this.bits),G=[],Y=$,X=Y;for(let j=0;j<q;j++){X=Y,G.push(X);for(let U=1;U<Q;U++)X=X.add(Y),G.push(X);Y=X.double()}return G}wNAF($,J,q){if(!this.Fn.isValid(q))throw Error("invalid scalar");let Q=this.ZERO,G=this.BASE,Y=W8($,this.bits);for(let X=0;X<Y.windows;X++){let{nextN:j,offset:U,isZero:B,isNeg:V,isNegF:A,offsetF:z}=$Q(q,X,Y);if(q=j,B)G=G.add(V0(A,J[z]));else Q=Q.add(V0(V,J[U]))}return QQ(q),{p:Q,f:G}}wNAFUnsafe($,J,q,Q=this.ZERO){let G=W8($,this.bits);for(let Y=0;Y<G.windows;Y++){if(q===s$)break;let{nextN:X,offset:j,isZero:U,isNeg:B}=$Q(q,Y,G);if(q=X,U)continue;else{let V=J[j];Q=Q.add(B?V.negate():V)}}return QQ(q),Q}getPrecomputes($,J,q){let Q=D8.get(J);if(!Q){if(Q=this.precomputeWindow(J,$),$!==1){if(typeof q==="function")Q=q(Q);D8.set(J,Q)}}return Q}cached($,J,q){let Q=M8($);return this.wNAF(Q,this.getPrecomputes(Q,$,q),J)}unsafe($,J,q,Q){let G=M8($);if(G===1)return this._unsafeLadder($,J,Q);return this.wNAFUnsafe(G,this.getPrecomputes(G,$,q),J,Q)}createCache($,J){qQ(J,this.bits),GQ.set($,J),D8.delete($)}hasCache($){return M8($)!==1}}function YQ($,J,q,Q){let G=J,Y=$.ZERO,X=$.ZERO;while(q>s$\|\|Q>s$){if(q&d$)Y=Y.add(G);if(Q&d$)X=X.add(G);G=G.double(),q>>=d$,Q>>=d$}return{p1:Y,p2:X}}function XQ($,J,q,Q){VJ(q,$),NJ(Q,J);let G=q.length,Y=Q.length;if(G!==Y)throw Error("arrays of points and scalars must have equal length");let X=$.ZERO,j=P0(BigInt(G)),U=1;if(j>12)U=j-3;else if(j>4)U=j-2;else if(j>0)U=2;let B=_$(U),V=Array(Number(B)+1).fill(X),A=Math.floor((J.BITS-1)/U)U,z=X;for(let K=A;K>=0;K-=U){V.fill(X);for(let S=0;S<Y;S++){let I=Q[S],g=Number(I>>BigInt(K)&B);V[g]=V[g].add(q[S])}let L=X;for(let S=V.length-1,I=X;S>0;S--)I=I.add(V[S]),L=L.add(I);if(z=z.add(L),K!==0)for(let S=0;S<U;S++)z=z.double()}return z}function JQ($,J,q){if(J){if(J.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return K8(J),J}else return b$($,{isLE:q})}function zQ($,J,q={},Q){if(Q===void 0)Q=$==="edwards";if(!J\|\|typeof J!=="object")throw Error(`expected valid ${$} CURVE object`);for(let U of["p","n","h"]){let B=J[U];if(!(typeof B==="bigint"&&B>s$))throw Error(`CURVE.${U} must be positive bigint`)}let G=JQ(J.p,q.Fp,Q),Y=JQ(J.n,q.Fn,Q),j=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let U of j)if(!G.isValid(J[U]))throw Error(`CURVE.${U} must be valid field element of CURVE.Fp`);return J=Object.freeze(Object.assign({},J)),{CURVE:J,Fp:G,Fn:Y}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var ZQ=($,J)=>($+($>=0?J:-J)/KQ)/J;function BJ($,J,q){let[[Q,G],[Y,X]]=J,j=ZQ(X$,q),U=ZQ(-G$,q),B=$-jQ-UY,V=-jG-UX,A=B<P$,z=V<P$;if(A)B=-B;if(z)V=-V;let K=_$(Math.ceil(P0(q)/2))+t$;if(B<P$\|\|B>=K\|\|V<P$\|\|V>=K)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:A,k1:B,k2neg:z,k2:V}}function B8($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function N8($,J){let q={};for(let Q of Object.keys(J))q[Q]=$[Q]===void 0?J[Q]:$[Q];if(j0(q.lowS,"lowS"),j0(q.prehash,"prehash"),q.format!==void 0)B8(q.format);return q}class UQ extends Error{constructor($=""){super($)}}var S$={Err:UQ,_tlv:{encode:($,J)=>{let{Err:q}=S$;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length&1)throw new q("tlv.encode: unpadded data");let Q=J.length/2,G=W0(Q);if(G.length/2&128)throw new q("tlv.encode: long form length too big");let Y=Q>127?W0(G.length/2\|128):"";return W0($)+Y+G+J},decode($,J){let{Err:q}=S$,Q=0;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length<2\|\|J[Q++]!==$)throw new q("tlv.decode: wrong tlv");let G=J[Q++],Y=!!(G&128),X=0;if(!Y)X=G;else{let U=G&127;if(!U)throw new q("tlv.decode(long): indefinite length not supported");if(U>4)throw new q("tlv.decode(long): byte length is too big");let B=J.subarray(Q,Q+U);if(B.length!==U)throw new q("tlv.decode: length bytes not complete");if(B[0]===0)throw new q("tlv.decode(long): zero leftmost byte");for(let V of B)X=X<<8\|V;if(Q+=U,X<128)throw new q("tlv.decode(long): not minimal encoding")}let j=J.subarray(Q,Q+X);if(j.length!==X)throw new q("tlv.decode: wrong value length");return{v:j,l:J.subarray(Q+X)}}},_int:{encode($){let{Err:J}=S$;if($<P$)throw new J("integer: negative integers are not allowed");let q=W0($);if(Number.parseInt(q[0],16)&8)q="00"+q;if(q.length&1)throw new J("unexpected DER parsing assertion: unpadded hex");return q},decode($){let{Err:J}=S$;if($[0]&128)throw new J("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new J("invalid signature integer: unnecessary leading zero");return C$($)}},toSig($){let{Err:J,_int:q,_tlv:Q}=S$,G=p("signature",$),{v:Y,l:X}=Q.decode(48,G);if(X.length)throw new J("invalid signature: left bytes after parsing");let{v:j,l:U}=Q.decode(2,Y),{v:B,l:V}=Q.decode(2,U);if(V.length)throw new J("invalid signature: left bytes after parsing");return{r:q.decode(j),s:q.decode(B)}},hexFromSig($){let{_tlv:J,_int:q}=S$,Q=J.encode(2,q.encode($.r)),G=J.encode(2,q.encode($.s)),Y=Q+G;return J.encode(48,Y)}},P$=BigInt(0),t$=BigInt(1),KQ=BigInt(2),b0=BigInt(3),OJ=BigInt(4);function f$($,J){let{BYTES:q}=$,Q;if(typeof J==="bigint")Q=J;else{let G=p("private key",J);try{Q=$.fromBytes(G)}catch(Y){throw Error(`invalid private key: expected ui8a of size ${q}, got ${typeof J}`)}}if(!$.isValidNot0(Q))throw Error("invalid private key: out of range [1..N-1]");return Q}function HJ($,J={}){let q=zQ("weierstrass",$,J),{Fp:Q,Fn:G}=q,Y=q.CURVE,{h:X,n:j}=Y;M0(J,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});let{endo:U}=J;if(U){if(!Q.is0(Y.a)\|\|typeof U.beta!=="bigint"\|\|!Array.isArray(U.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let B=WQ(Q,G);function V(){if(!Q.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function A(H,k,M){let{x:D,y:Z}=k.toAffine(),W=Q.toBytes(D);if(j0(M,"isCompressed"),M){V();let O=!Q.isOdd(Z);return K$(jQ(O),W)}else return K$(Uint8Array.of(4),W,Q.toBytes(Z))}function z(H){v$(H,void 0,"Point");let{publicKey:k,publicKeyUncompressed:M}=B,D=H.length,Z=H[0],W=H.subarray(1);if(D===k&&(Z===2\|\|Z===3)){let O=Q.fromBytes(W);if(!Q.isValid(O))throw Error("bad point: is not on curve, wrong x");let R=S(O),x;try{x=Q.sqrt(R)}catch(b){let C=b instanceof Error?": "+b.message:"";throw Error("bad point: is not on curve, sqrt error"+C)}V();let T=Q.isOdd(x);if((Z&1)===1!==T)x=Q.neg(x);return{x:O,y:x}}else if(D===M&&Z===4){let O=Q.BYTES,R=Q.fromBytes(W.subarray(0,O)),x=Q.fromBytes(W.subarray(O,O2));if(!I(R,x))throw Error("bad point: is not on curve");return{x:R,y:x}}else throw Error(`bad point: got length ${D}, expected compressed=${k} or uncompressed=${M}`)}let K=J.toBytes\|\|A,L=J.fromBytes\|\|z;function S(H){let k=Q.sqr(H),M=Q.mul(k,H);return Q.add(Q.add(M,Q.mul(H,Y.a)),Y.b)}function I(H,k){let M=Q.sqr(k),D=S(H);return Q.eql(M,D)}if(!I(Y.Gx,Y.Gy))throw Error("bad curve params: generator point");let g=Q.mul(Q.pow(Y.a,b0),OJ),t=Q.mul(Q.sqr(Y.b),BigInt(27));if(Q.is0(Q.add(g,t)))throw Error("bad curve params: a or b");function u(H,k,M=!1){if(!Q.isValid(k)\|\|M&&Q.is0(k))throw Error(`bad point coordinate ${H}`);return k}function a(H){if(!(H instanceof E))throw Error("ProjectivePoint expected")}function G$(H){if(!U\|\|!U.basises)throw Error("no endo");return BJ(H,U.basises,G.ORDER)}let Y$=Z8((H,k)=>{let{X:M,Y:D,Z}=H;if(Q.eql(Z,Q.ONE))return{x:M,y:D};let W=H.is0();if(k==null)k=W?Q.ONE:Q.inv(Z);let O=Q.mul(M,k),R=Q.mul(D,k),x=Q.mul(Z,k);if(W)return{x:Q.ZERO,y:Q.ZERO};if(!Q.eql(x,Q.ONE))throw Error("invZ was invalid");return{x:O,y:R}}),j$=Z8((H)=>{if(H.is0()){if(J.allowInfinityPoint&&!Q.is0(H.Y))return;throw Error("bad point: ZERO")}let{x:k,y:M}=H.toAffine();if(!Q.isValid(k)\|\|!Q.isValid(M))throw Error("bad point: x or y not field elements");if(!I(k,M))throw Error("bad point: equation left != right");if(!H.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function Q$(H,k,M,D,Z){return M=new E(Q.mul(M.X,H),M.Y,M.Z),k=V0(D,k),M=V0(Z,M),k.add(M)}class E{constructor(H,k,M){this.X=u("x",H),this.Y=u("y",k,!0),this.Z=u("z",M),Object.freeze(this)}static CURVE(){return Y}static fromAffine(H){let{x:k,y:M}=H\|\|{};if(!H\|\|!Q.isValid(k)\|\|!Q.isValid(M))throw Error("invalid affine point");if(H instanceof E)throw Error("projective point not allowed");if(Q.is0(k)&&Q.is0(M))return E.ZERO;return new E(k,M,Q.ONE)}static fromBytes(H){let k=E.fromAffine(L(v$(H,void 0,"point")));return k.assertValidity(),k}static fromHex(H){return E.fromBytes(p("pointHex",H))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(H=8,k=!0){if(e.createCache(this,H),!k)this.multiply(b0);return this}assertValidity(){j$(this)}hasEvenY(){let{y:H}=this.toAffine();if(!Q.isOdd)throw Error("Field doesn't support isOdd");return!Q.isOdd(H)}equals(H){a(H);let{X:k,Y:M,Z:D}=this,{X:Z,Y:W,Z:O}=H,R=Q.eql(Q.mul(k,O),Q.mul(Z,D)),x=Q.eql(Q.mul(M,O),Q.mul(W,D));return R&&x}negate(){return new E(this.X,Q.neg(this.Y),this.Z)}double(){let{a:H,b:k}=Y,M=Q.mul(k,b0),{X:D,Y:Z,Z:W}=this,O=Q.ZERO,R=Q.ZERO,x=Q.ZERO,T=Q.mul(D,D),l=Q.mul(Z,Z),b=Q.mul(W,W),C=Q.mul(D,Z);return C=Q.add(C,C),x=Q.mul(D,W),x=Q.add(x,x),O=Q.mul(H,x),R=Q.mul(M,b),R=Q.add(O,R),O=Q.sub(l,R),R=Q.add(l,R),R=Q.mul(O,R),O=Q.mul(C,O),x=Q.mul(M,x),b=Q.mul(H,b),C=Q.sub(T,b),C=Q.mul(H,C),C=Q.add(C,x),x=Q.add(T,T),T=Q.add(x,T),T=Q.add(T,b),T=Q.mul(T,C),R=Q.add(R,T),b=Q.mul(Z,W),b=Q.add(b,b),T=Q.mul(b,C),O=Q.sub(O,T),x=Q.mul(b,l),x=Q.add(x,x),x=Q.add(x,x),new E(O,R,x)}add(H){a(H);let{X:k,Y:M,Z:D}=this,{X:Z,Y:W,Z:O}=H,R=Q.ZERO,x=Q.ZERO,T=Q.ZERO,l=Y.a,b=Q.mul(Y.b,b0),C=Q.mul(k,Z),v=Q.mul(M,W),f=Q.mul(D,O),_=Q.add(k,M),c=Q.add(Z,W);_=Q.mul(_,c),c=Q.add(C,v),_=Q.sub(_,c),c=Q.add(k,D);let d=Q.add(Z,O);return c=Q.mul(c,d),d=Q.add(C,f),c=Q.sub(c,d),d=Q.add(M,D),R=Q.add(W,O),d=Q.mul(d,R),R=Q.add(v,f),d=Q.sub(d,R),T=Q.mul(l,c),R=Q.mul(b,f),T=Q.add(R,T),R=Q.sub(v,T),T=Q.add(v,T),x=Q.mul(R,T),v=Q.add(C,C),v=Q.add(v,C),f=Q.mul(l,f),c=Q.mul(b,c),v=Q.add(v,f),f=Q.sub(C,f),f=Q.mul(l,f),c=Q.add(c,f),C=Q.mul(v,c),x=Q.add(x,C),C=Q.mul(d,c),R=Q.mul(_,R),R=Q.sub(R,C),C=Q.mul(_,v),T=Q.mul(d,T),T=Q.add(T,C),new E(R,x,T)}subtract(H){return this.add(H.negate())}is0(){return this.equals(E.ZERO)}multiply(H){let{endo:k}=J;if(!G.isValidNot0(H))throw Error("invalid scalar: out of range");let M,D,Z=(W)=>e.cached(this,W,(O)=>_0(E,O));if(k){let{k1neg:W,k1:O,k2neg:R,k2:x}=G$(H),{p:T,f:l}=Z(O),{p:b,f:C}=Z(x);D=l.add(C),M=Q$(k.beta,T,b,W,R)}else{let{p:W,f:O}=Z(H);M=W,D=O}return _0(E,[M,D])[0]}multiplyUnsafe(H){let{endo:k}=J,M=this;if(!G.isValid(H))throw Error("invalid scalar: out of range");if(H===P$\|\|M.is0())return E.ZERO;if(H===t$)return M;if(e.hasCache(this))return this.multiply(H);if(k){let{k1neg:D,k1:Z,k2neg:W,k2:O}=G$(H),{p1:R,p2:x}=YQ(E,M,Z,O);return Q$(k.beta,R,x,D,W)}else return e.unsafe(M,H)}multiplyAndAddUnsafe(H,k,M){let D=this.multiplyUnsafe(k).add(H.multiplyUnsafe(M));return D.is0()?void 0:D}toAffine(H){return Y$(this,H)}isTorsionFree(){let{isTorsionFree:H}=J;if(X===t$)return!0;if(H)return H(E,this);return e.unsafe(this,j).is0()}clearCofactor(){let{clearCofactor:H}=J;if(X===t$)return this;if(H)return H(E,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(H=!0){return j0(H,"isCompressed"),this.assertValidity(),K(E,this,H)}toHex(H=!0){return w$(this.toBytes(H))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(H=!0){return this.toBytes(H)}_setWindowSize(H){this.precompute(H)}static normalizeZ(H){return _0(E,H)}static msm(H,k){return XQ(E,G,H,k)}static fromPrivateKey(H){return E.BASE.multiply(f$(G,H))}}E.BASE=new E(Y.Gx,Y.Gy,Q.ONE),E.ZERO=new E(Q.ZERO,Q.ONE,Q.ZERO),E.Fp=Q,E.Fn=G;let X$=G.BITS,e=new V8(E,J.endo?Math.ceil(X$/2):X$);return E.BASE.precompute(8),E}function jQ($){return Uint8Array.of($?2:3)}function WQ($,J){return{secretKey:J.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2$.BYTES,publicKeyHasPrefix:!0,signature:2J.BYTES}}function AJ($,J={}){let{Fn:q}=$,Q=J.randomBytes\|\|h$,G=Object.assign(WQ($.Fp,q),{seed:j8(q.ORDER)});function Y(K){try{return!!f$(q,K)}catch(L){return!1}}function X(K,L){let{publicKey:S,publicKeyUncompressed:I}=G;try{let g=K.length;if(L===!0&&g!==S)return!1;if(L===!1&&g!==I)return!1;return!!$.fromBytes(K)}catch(g){return!1}}function j(K=Q(G.seed)){return v0(v$(K,G.seed,"seed"),q.ORDER)}function U(K,L=!0){return $.BASE.multiply(f$(q,K)).toBytes(L)}function B(K){let L=j(K);return{secretKey:L,publicKey:U(L)}}function V(K){if(typeof K==="bigint")return!1;if(K instanceof $)return!0;let{secretKey:L,publicKey:S,publicKeyUncompressed:I}=G;if(q.allowedLengths\|\|L===S)return;let g=p("key",K).length;return g===S\|\|g===I}function A(K,L,S=!0){if(V(K)===!0)throw Error("first arg must be private key");if(V(L)===!1)throw Error("second arg must be public key");let I=f$(q,K);return $.fromHex(L).multiply(I).toBytes(S)}return Object.freeze({getPublicKey:U,getSharedSecret:A,keygen:B,Point:$,utils:{isValidSecretKey:Y,isValidPublicKey:X,randomSecretKey:j,isValidPrivateKey:Y,randomPrivateKey:j,normPrivateKeyToScalar:(K)=>f$(q,K),precompute(K=8,L=$.BASE){return L.precompute(K,!1)}},lengths:G})}function RJ($,J,q={}){w0(J),M0(q,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});let Q=q.randomBytes\|\|h$,G=q.hmac\|\|((M,...D)=>J8(J,M,K$(...D))),{Fp:Y,Fn:X}=$,{ORDER:j,BITS:U}=X,{keygen:B,getPublicKey:V,getSharedSecret:A,utils:z,lengths:K}=AJ($,q),L={prehash:!1,lowS:typeof q.lowS==="boolean"?q.lowS:!1,format:void 0,extraEntropy:!1},S="compact";function I(M){let D=j>>t$;return M>D}function g(M,D){if(!X.isValidNot0(D))throw Error(`invalid signature ${M}: out of range 1..Point.Fn.ORDER`);return D}function t(M,D){B8(D);let Z=K.signature,W=D==="compact"?Z:D==="recovered"?Z+1:void 0;return v$(M,W,`${D} signature`)}class u{constructor(M,D,Z){if(this.r=g("r",M),this.s=g("s",D),Z!=null)this.recovery=Z;Object.freeze(this)}static fromBytes(M,D=S){t(M,D);let Z;if(D==="der"){let{r:x,s:T}=S$.toSig(v$(M));return new u(x,T)}if(D==="recovered")Z=M[0],D="compact",M=M.subarray(1);let W=X.BYTES,O=M.subarray(0,W),R=M.subarray(W,W2);return new u(X.fromBytes(O),X.fromBytes(R),Z)}static fromHex(M,D){return this.fromBytes(m$(M),D)}addRecoveryBit(M){return new u(this.r,this.s,M)}recoverPublicKey(M){let D=Y.ORDER,{r:Z,s:W,recovery:O}=this;if(O==null\|\|![0,1,2,3].includes(O))throw Error("recovery id invalid");if(jKQ<D&&O>1)throw Error("recovery id is ambiguous for h>1 curve");let x=O===2\|\|O===3?Z+j:Z;if(!Y.isValid(x))throw Error("recovery id 2 or 3 invalid");let T=Y.toBytes(x),l=$.fromBytes(K$(jQ((O&1)===0),T)),b=X.inv(x),C=G$(p("msgHash",M)),v=X.create(-Cb),f=X.create(Wb),_=$.BASE.multiplyUnsafe(v).add(l.multiplyUnsafe(f));if(_.is0())throw Error("point at infinify");return _.assertValidity(),_}hasHighS(){return I(this.s)}toBytes(M=S){if(B8(M),M==="der")return m$(S$.hexFromSig(this));let D=X.toBytes(this.r),Z=X.toBytes(this.s);if(M==="recovered"){if(this.recovery==null)throw Error("recovery bit must be present");return K$(Uint8Array.of(this.recovery),D,Z)}return K$(D,Z)}toHex(M){return w$(this.toBytes(M))}assertValidity(){}static fromCompact(M){return u.fromBytes(p("sig",M),"compact")}static fromDER(M){return u.fromBytes(p("sig",M),"der")}normalizeS(){return this.hasHighS()?new u(this.r,X.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return w$(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return w$(this.toBytes("compact"))}}let a=q.bits2int\|\|function(D){if(D.length>8192)throw Error("input is too large");let Z=C$(D),W=D.length8-U;return W>0?Z>>BigInt(W):Z},G$=q.bits2int_modN\|\|function(D){return X.create(a(D))},Y$=_$(U);function j$(M){return c8("num < 2^"+U,M,P$,Y$),X.toBytes(M)}function Q$(M,D){return v$(M,void 0,"message"),D?v$(J(M),void 0,"prehashed message"):M}function E(M,D,Z){if(["recovered","canonical"].some((f)=>(f in Z)))throw Error("sign() legacy options not supported");let{lowS:W,prehash:O,extraEntropy:R}=N8(Z,L);M=Q$(M,O);let x=G$(M),T=f$(X,D),l=[j$(T),j$(x)];if(R!=null&&R!==!1){let f=R===!0?Q(K.secretKey):R;l.push(p("extraEntropy",f))}let b=K$(...l),C=x;function v(f){let _=a(f);if(!X.isValidNot0(_))return;let c=X.inv(_),d=$.BASE.multiply(_).toAffine(),F=X.create(d.x);if(F===P$)return;let n=X.create(cX.create(C+FT));if(n===P$)return;let i=(d.x===F?0:2)\|Number(d.y&t$),J$=n;if(W&&I(n))J$=X.neg(n),i^=1;return new u(F,J$,i)}return{seed:b,k2sig:v}}function X$(M,D,Z={}){M=p("message",M);let{seed:W,k2sig:O}=E(M,D,Z);return d8(J.outputLen,X.BYTES,G)(W,O)}function e(M){let D=void 0,Z=typeof M==="string"\|\|u$(M),W=!Z&&M!==null&&typeof M==="object"&&typeof M.r==="bigint"&&typeof M.s==="bigint";if(!Z&&!W)throw Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(W)D=new u(M.r,M.s);else if(Z){try{D=u.fromBytes(p("sig",M),"der")}catch(O){if(!(O instanceof S$.Err))throw O}if(!D)try{D=u.fromBytes(p("sig",M),"compact")}catch(O){return!1}}if(!D)return!1;return D}function H(M,D,Z,W={}){let{lowS:O,prehash:R,format:x}=N8(W,L);if(Z=p("publicKey",Z),D=Q$(p("message",D),R),"strict"in W)throw Error("options.strict was renamed to lowS");let T=x===void 0?e(M):u.fromBytes(p("sig",M),x);if(T===!1)return!1;try{let l=$.fromBytes(Z);if(O&&T.hasHighS())return!1;let{r:b,s:C}=T,v=G$(D),f=X.inv(C),_=X.create(vf),c=X.create(bf),d=$.BASE.multiplyUnsafe(_).add(l.multiplyUnsafe(c));if(d.is0())return!1;return X.create(d.x)===b}catch(l){return!1}}function k(M,D,Z={}){let{prehash:W}=N8(Z,L);return D=Q$(D,W),u.fromBytes(M,"recovered").recoverPublicKey(D).toBytes()}return Object.freeze({keygen:B,getPublicKey:V,getSharedSecret:A,utils:z,lengths:K,Point:$,sign:X$,verify:H,recoverPublicKey:k,Signature:u,hash:J})}function xJ($){let J={a:$.a,b:$.b,p:$.Fp.ORDER,n:$.n,h:$.h,Gx:$.Gx,Gy:$.Gy},q=$.Fp,Q=$.allowedPrivateKeyLengths?Array.from(new Set($.allowedPrivateKeyLengths.map((X)=>Math.ceil(X/2)))):void 0,G=b$(J.n,{BITS:$.nBitLength,allowedLengths:Q,modFromBytes:$.wrapPrivateKey}),Y={Fp:q,Fn:G,allowInfinityPoint:$.allowInfinityPoint,endo:$.endo,isTorsionFree:$.isTorsionFree,clearCofactor:$.clearCofactor,fromBytes:$.fromBytes,toBytes:$.toBytes};return{CURVE:J,curveOpts:Y}}function TJ($){let{CURVE:J,curveOpts:q}=xJ($),Q={hmac:$.hmac,randomBytes:$.randomBytes,lowS:$.lowS,bits2int:$.bits2int,bits2int_modN:$.bits2int_modN};return{CURVE:J,curveOpts:q,hash:$.hash,ecdsaOpts:Q}}function LJ($,J){let q=J.Point;return Object.assign({},J,{ProjectivePoint:q,CURVE:Object.assign({},$,E0(q.Fn.ORDER,q.Fn.BITS))})}function DQ($){let{CURVE:J,curveOpts:q,hash:Q,ecdsaOpts:G}=TJ($),Y=HJ(J,q),X=RJ(Y,Q,G);return LJ($,X)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function MQ($,J){let q=(Q)=>DQ({...$,hash:Q});return{...q(J),create:q}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var e$={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},wJ={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},kJ=BigInt(0),VQ=BigInt(1),O8=BigInt(2);function CJ($){let J=e$.p,q=BigInt(3),Q=BigInt(6),G=BigInt(11),Y=BigInt(22),X=BigInt(23),j=BigInt(44),U=BigInt(88),B=$$$%J,V=BB$%J,A=D$(V,q,J)V%J,z=D$(A,q,J)V%J,K=D$(z,O8,J)B%J,L=D$(K,G,J)K%J,S=D$(L,Y,J)L%J,I=D$(S,j,J)S%J,g=D$(I,U,J)I%J,t=D$(g,j,J)S%J,u=D$(t,q,J)V%J,a=D$(u,X,J)L%J,G$=D$(a,Q,J)B%J,Y$=D$(G$,O8,J);if(!f0.eql(f0.sqr(Y$),$))throw Error("Cannot find square root");return Y$}var f0=b$(e$.p,{sqrt:CJ}),OQ=MQ({...e$,Fp:f0,lowS:!0,endo:wJ},S0),NQ={};function y0($,...J){let q=NQ[$];if(q===void 0){let Q=S0(C0($));q=K$(Q,Q),NQ[$]=q}return S0(K$(q,...J))}var A8=($)=>$.toBytes(!0).slice(1),$0=(()=>OQ.Point)(),R8=($)=>$%O8===kJ;function H8($){let{Fn:J,BASE:q}=$0,Q=f$(J,$),G=q.multiply(Q);return{scalar:R8(G.y)?Q:J.neg(Q),bytes:A8(G)}}function HQ($){let J=f0;if(!J.isValidNot0($))throw Error("invalid x: Fail if x ≥ p");let q=J.create($$),Q=J.create(q$+BigInt(7)),G=J.sqrt(Q);if(!R8(G))G=J.neg(G);let Y=$0.fromAffine({x:$,y:G});return Y.assertValidity(),Y}var N0=C$;function AQ(...$){return $0.Fn.create(N0(y0("BIP0340/challenge",...$)))}function BQ($){return H8($).bytes}function SJ($,J,q=h$(32)){let{Fn:Q}=$0,G=p("message",$),{bytes:Y,scalar:X}=H8(J),j=p("auxRand",q,32),U=Q.toBytes(X^N0(y0("BIP0340/aux",j))),B=y0("BIP0340/nonce",U,Y,G),{bytes:V,scalar:A}=H8(B),z=AQ(V,Y,G),K=new Uint8Array(64);if(K.set(V,0),K.set(Q.toBytes(Q.create(A+zX)),32),!RQ(K,G,Y))throw Error("sign: Invalid signature produced");return K}function RQ($,J,q){let{Fn:Q,BASE:G}=$0,Y=p("signature",$,64),X=p("message",J),j=p("publicKey",q,32);try{let U=HQ(N0(j)),B=N0(Y.subarray(0,32));if(!D0(B,VQ,e$.p))return!1;let V=N0(Y.subarray(32,64));if(!D0(V,VQ,e$.n))return!1;let A=AQ(Q.toBytes(B),A8(U),X),z=G.multiplyUnsafe(V).add(U.multiplyUnsafe(Q.neg(A))),{x:K,y:L}=z.toAffine();if(z.is0()\|\|!R8(L)\|\|K!==B)return!1;return!0}catch(U){return!1}}var g0=(()=>{let q=(G=h$(48))=>{return v0(G,e$.n)};OQ.utils.randomSecretKey;function Q(G){let Y=q(G);return{secretKey:Y,publicKey:BQ(Y)}}return{keygen:Q,getPublicKey:BQ,sign:SJ,verify:RQ,Point:$0,utils:{randomSecretKey:q,randomPrivateKey:q,taggedHash:y0,lift_x:HQ,pointToBytes:A8,numberToBytesBE:n$,bytesToNumberBE:C$,mod:W$},lengths:{secretKey:32,publicKey:32,publicKeyHasPrefix:!1,signature:64,seed:48}}})();var PJ=new TextEncoder,IJ=new TextDecoder,T$=($)=>PJ.encode($),l$=($)=>IJ.decode($),u0=($)=>Array.from($,(J)=>J.toString(16).padStart(2,"0")).join(""),V$=JSON.stringify,p$=JSON.parse,F0=($,J=Number.MAX_SAFE_INTEGER)=>$.split("").reduce((q,Q)=>q+Q.charCodeAt(0),0)%J;var x8="AES-GCM",EJ={},xQ="$",TQ=",",vJ=($)=>{let J=new Uint8Array($),q=32768,Q="";for(let G=0;G<J.length;G+=32768)Q+=String.fromCharCode(...J.subarray(G,G+32768));return btoa(Q)},_J=($)=>Uint8Array.from(atob($),(J)=>J.charCodeAt(0)).buffer,B0=($)=>EJ[$]??=crypto.subtle.digest("SHA-1",T$($)).then((J)=>{let q=new Uint8Array(J),Q="";for(let G of q)Q+=G.toString(36);return Q}),LQ=async($,J,q)=>{let Q=await crypto.subtle.digest("SHA-256",T$(`${$}:${J}:${q}`));return crypto.subtle.importKey("raw",Q,{name:x8},!1,["encrypt","decrypt"])},wQ=async($,J)=>{let q=crypto.getRandomValues(new Uint8Array(12)),Q=await $,G=await crypto.subtle.encrypt({name:x8,iv:q},Q,T$(J));return`${q.join(TQ)}${xQ}${vJ(G)}`},kQ=async($,J)=>{let[q,Q]=J.split(xQ);if(!q\|\|!Q)throw Error("Invalid encrypted payload format");let G=Uint8Array.from(q.split(TQ),Number),Y=await $,X=await crypto.subtle.decrypt({name:x8,iv:G},Y,_J(Q));return l$(X)};var O0="GenosRTC",J0=($,J)=>Array.from({length:$},J);var Q0=($)=>Array.from(crypto.getRandomValues(new Uint8Array($)),(J)=>"0123456789AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz"[J%62]).join(""),m=typeof sessionStorage<"u"?sessionStorage.__genosrtcId??=Q0(20):Q0(20),I$=Promise.all.bind(Promise),CQ=typeof window<"u",{entries:SQ,fromEntries:m0,keys:i9}=Object,PQ=()=>{},R$=($)=>Error(`GenosRTC: ${$}`),H0=(...$)=>$.join("@"),IQ=($,J)=>{let q=[...$],Q=q.length,G=()=>{let Y=Math.sin(J++)1e4;return Y-Math.floor(Y)};while(Q){let Y=Math.floor(G()Q--);[q[Q],q[Y]]=[q[Y],q[Q]]}return q};var bJ=5000,EQ="icegatheringstatechange",vQ="offer",fJ="answer",yJ=[...J0(3,($,J)=>`stun:stun${J\|\|""}.l.google.com:19302`),"stun:stun.cloudflare.com:3478"].map(($)=>({urls:$})),T8=($,{rtcConfig:J,rtcPolyfill:q,turnConfig:Q})=>{let G=new(q\|\|RTCPeerConnection)({iceServers:[...yJ,...Q\|\|[]],...J}),Y={},X=!1,j=!1,U,B=(z)=>Object.assign(z,{binaryType:"arraybuffer",bufferedAmountLowThreshold:65535,onmessage:(K)=>Y.data?.(K.data),onopen:()=>Y.connect?.(),onclose:()=>Y.close?.(),onerror:(K)=>!K?.error?.message?.includes("User-Initiated Abort")&&Y.error?.(K)}),V=()=>Promise.race([new Promise((z)=>{let K=()=>{if(G.iceGatheringState==="complete")G.removeEventListener(EQ,K),z()};G.addEventListener(EQ,K),K()}),new Promise((z)=>setTimeout(z,bJ))]).then(()=>({type:G.localDescription.type,sdp:G.localDescription.sdp.replace(/a=ice-options:trickle\s\n/g,"")}));if($?B(U=G.createDataChannel("data")):G.ondatachannel=({channel:z})=>B(U=z),G.onnegotiationneeded=async()=>{try{X=!0,await G.setLocalDescription(),Y.signal?.(await V())}catch(z){Y.error?.(z)}finally{X=!1}},G.onconnectionstatechange=()=>{if(["disconnected","failed","closed"].includes(G.connectionState))Y.close?.()},G.ontrack=(z)=>{Y.track?.(z.track,z.streams[0]),Y.stream?.(z.streams[0])},G.onremovestream=(z)=>Y.stream?.(z.stream),$&&!G.canTrickleIceCandidates)G.onnegotiationneeded();let A=()=>G.getSenders();return{created:Date.now(),connection:G,get channel(){return U},get isDead(){return G.connectionState==="closed"},async signal(z){if(U?.readyState==="open"&&!z.sdp?.includes("a=rtpmap"))return;try{if(z.type===vQ){if(X\|\|G.signalingState!=="stable"&&!j){if($)return;await I$([G.setLocalDescription({type:"rollback"}),G.setRemoteDescription(z)])}else await G.setRemoteDescription(z);await G.setLocalDescription();let K=await V();return Y.signal?.(K),K}if(z.type===fJ){j=!0;try{await G.setRemoteDescription(z)}finally{j=!1}}}catch(K){Y.error?.(K)}},sendData:(z)=>{if(U?.readyState==="open")U.send(z)},destroy:()=>{U?.close(),G.close(),X=j=!1},setHandlers:(z)=>Object.assign(Y,z),offerPromise:$?new Promise((z)=>Y.signal=(K)=>K.type===vQ&&z(K)):Promise.resolve(),addStream:(z)=>z.getTracks().forEach((K)=>G.addTrack(K,z)),removeStream:(z)=>A().filter((K)=>z.getTracks().includes(K.track)).forEach((K)=>G.removeTrack(K)),addTrack:(z,K)=>G.addTrack(z,K),removeTrack:(z)=>{let K=A().find((L)=>L.track===z);if(K)G.removeTrack(K)},replaceTrack:(z,K)=>A().find((L)=>L.track===z)?.replaceTrack(K)}};var gJ=Object.getPrototypeOf(Uint8Array),c0=12,_Q=0,d0=_Q+c0,l0=d0+1,R0=l0+1,x0=R0+1,A0=16384-x0,h0=255,L8="bufferedamountlow",q0=($)=>`@_${$}`,w8=100,uJ=3,FJ=200,bQ=($,J,q)=>{let Q=new Map,G=new Map,Y=new Map,X={},j={},U={},B={},V=new Map,A=(Z,W)=>{if(!V.has(Z))V.set(Z,new Set);V.get(Z).add(W)},z=(Z,W)=>V.get(Z)?.delete(W),K=(Z,...W)=>V.get(Z)?.forEach((O)=>O(...W)),L=(Z,W)=>{let O=Z?Array.isArray(Z)?Z:[Z]:Q.keys();return Array.from(O,(R)=>{let x=Q.get(R);if(!x)return null;return W(R,x)}).filter(Boolean)},S=(Z)=>{if(!Q.has(Z))return;Q.delete(Z),delete X[Z],delete j[Z],delete U[Z],delete B[Z],K("peer:leave",Z),J(Z)},I=(Z)=>new Promise((W,O)=>{let R=setTimeout(()=>{Z.removeEventListener(L8,x),O(Error(`${O0}: bufferLow timeout`))},5000);function x(){clearTimeout(R),Z.removeEventListener(L8,x),W()}Z.addEventListener(L8,x)}),g=(Z)=>{if(Y.has(Z))return Y.get(Z);if(!Z)throw R$("action type is required");let W=T$(Z);if(W.byteLength>c0)throw R$(`❌ "${Z}" exceeds ${c0} bytes. Use a shorter name.`);let O=new Uint8Array(c0).map((v,f)=>W[f]\|\|0),R=0,x=new Map([["message",new Set],["progress",new Set]]),T=(v,f)=>x.get(v)?.add(f),l=(v,f)=>x.get(v)?.delete(f),b=async(v,f,_,c)=>{if(_&&typeof _!=="object")throw R$("meta must be object");if(v===void 0)throw R$("data cannot be undefined");let d=v instanceof Blob,F=d\|\|v instanceof ArrayBuffer\|\|v instanceof gJ,n=typeof v!=="string";if(_&&!F)throw R$("meta only allowed with binary");let i=F?new Uint8Array(d?await v.arrayBuffer():v):T$(n?V$(v):v),J$=_?T$(V$(_)):null,z$=Math.ceil(i.byteLength/A0)+(_?1:0)\|\|1;if(z$>w8)throw R$(`Message too large, exceeds max chunks ${w8}`);let Y0=J0(z$,(o$,M$)=>{let y$=M$===z$-1,N$=_&&M$===0,x$=N$?J$:i.subarray(_?(M$-1)A0:M$A0,_?M$A0:(M$+1)A0),B$=new Uint8Array(x0+x$.byteLength);return B$.set(O),B$.set([R],d0),B$.set([y$\|N$<<1\|F<<2\|n<<3],l0),B$.set([Math.round((M$+1)/z$h0)],R0),B$.set(x$,x0),B$});return R=R+1&h0,I$(L(f,async(o$,M$)=>{let{channel:y$}=M$;for(let N$=0;N$<z$;N$++){let x$=0;while(y$.bufferedAmount>y$.bufferedAmountLowThreshold){if(x$++>uJ)throw R$(`${O0}: send buffer full, max retries reached for peer ${o$}`);try{await I(y$)}catch(B$){await new Promise((s0)=>setTimeout(s0,FJ))}}if(!Q.has(o$))break;M$.sendData(Y0[N$]),c?.(Y0[N$][R0]/h0,o$,_)}}))};G.set(Z,{listeners:x,send:b});let C={send:b,on:T,off:l};return Y.set(Z,C),C},t=(Z,W)=>{try{let O=new Uint8Array(W),R=l$(O.subarray(_Q,d0)).replace(//g,"");if(!G.has(R))return;let[x]=O.subarray(d0,l0),[T]=O.subarray(l0,R0),[l]=O.subarray(R0,x0),b=O.subarray(x0),C=Boolean(T&1),v=Boolean(T&2),f=Boolean(T&4),_=Boolean(T&8),c=G.get(R),d=(X[Z]\|\|={})[R]\|\|={};if(d[x]?.chunks?.length>w8)return;let F=d[x]\|\|={chunks:[]};if(v)try{F.meta=p$(l$(b))}catch{return}else F.chunks.push(b);if(c.listeners.get("progress").forEach((J$)=>{try{J$(l/h0,Z,F.meta)}catch(z$){}}),!C)return;let n=new Uint8Array(F.chunks.reduce((J$,z$)=>J$+z$.byteLength,0));F.chunks.reduce((J$,z$)=>(n.set(z$,J$),J$+z$.byteLength),0),delete d[x];let i;if(f)i=n;else if(_)try{i=p$(l$(n))}catch{return}else i=l$(n);c.listeners.get("message").forEach((J$)=>{try{J$(i,Z,F.meta)}catch(z$){}})}catch(O){}},u=async()=>{try{await M(""),await new Promise((Z)=>setTimeout(Z,99))}catch(Z){}for(let[Z,W]of Q){try{W.destroy()}catch{}Q.delete(Z)}q()},{send:a,on:G$}=g(q0("ping")),{send:Y$,on:j$}=g(q0("pong")),{send:Q$,on:E}=g(q0("signal")),{send:X$,on:e}=g(q0("stream")),{send:H,on:k}=g(q0("track")),{send:M,on:D}=g(q0("leave"));if($((Z,W)=>{if(Q.has(W))return;Q.set(W,Z),Z.setHandlers({data:(O)=>t(W,O),stream:(O)=>{K("stream:add",O,W,U[W]),delete U[W]},track:(O,R)=>{K("track:add",O,R,W,B[W]),delete B[W]},signal:(O)=>Q$(O,W),close:()=>S(W),error:(O)=>{S(W)}}),K("peer:join",W)}),G$("message",(Z,W)=>Y$("",W)),j$("message",(Z,W)=>{j[W]?.(),delete j[W]}),E("message",(Z,W)=>Q.get(W)?.signal(Z)),e("message",(Z,W)=>U[W]=Z),k("message",(Z,W)=>B[W]=Z),D("message",(Z,W)=>S(W)),CQ)addEventListener("beforeunload",u);return{on:A,off:z,channel:g,leave:u,ping:async(Z)=>{if(!Z)throw R$("ping() requires target peer ID");let W=Date.now();return a("",Z),await new Promise((O)=>j[Z]=O),Date.now()-W},getPeers:()=>m0(Array.from(Q,([Z,W])=>[Z,W.connection])),addStream:(Z,W,O)=>L(W,async(R,x)=>{if(O)await X$(O,R);x.addStream(Z)}),removeStream:(Z,W)=>L(W,(O,R)=>R.removeStream(Z)),addTrack:(Z,W,O,R)=>L(O,async(x,T)=>{if(R)await H(R,x);T.addTrack(Z,W)}),removeTrack:(Z,W)=>L(W,(O,R)=>R.removeTrack(Z)),replaceTrack:(Z,W,O,R)=>L(O,async(x,T)=>{if(R)await H(R,x);T.replaceTrack(Z,W)})}};var mJ=5,hJ=10,cJ=2500,p0=57333,fQ=({init:$,subscribe:J,announce:q})=>{let Q={},G=!1,Y,X;return(j,U,B)=>{let{appId:V}=j;if(Q[V]?.[U])return Q[V][U];if(!j\|\|!U\|\|!V&&!j.firebaseApp)throw R$(!j?"config required":!U?"roomId required":"appId missing");let A=PQ;if(!G){let D=$(j);X=J0(mJ,()=>{try{return T8(!0,j)}catch{return null}}).filter(Boolean),Y=Array.isArray(D)?D:[D];let Z=setInterval(()=>{X=X.filter((W)=>{let O=Date.now()-W.created<p0;if(!O)W.destroy();return O})},p0);Q.offerCleanupTimer\|\|=Z,G=!0}let z={},K={},L=new Map,S=new Map,I=H0(O0,V,U),g=B0(I),t=B0(H0(I,m)),u=LQ(j.password\|\|"",V,U),a=(D)=>async(Z)=>({type:Z.type,sdp:await D(u,Z.sdp)}),G$=a(kQ),Y$=a(wQ),j$=(D)=>{return setTimeout(()=>{if(!D.isDead&&!Object.values(K).includes(D))D.destroy()},p0),D},Q$=(D)=>{try{return j$(T8(D,j))}catch{return null}},E=(D,Z)=>{if(K[Z]===D)return;K[Z]?.destroy(),K[Z]=D,A(D,Z),z[Z]?.forEach((W)=>W!==D&&W.destroy()),delete z[Z]},X$=(D,Z)=>{if(K[Z]===D)delete K[Z]},e=(D)=>async(Z,W,O)=>{let[R,x]=await I$([g,t]);if(Z!==R&&Z!==x)return;let{peerId:T,offer:l,answer:b}=typeof W==="string"?p$(W):W;if(T&&T!==m)S.set(T,Date.now());if(T===m\|\|K[T])return;if(j.admit&&!j.admit(T))return;if(l){if(z[T]?.[D]&&m>T)return;let C=Q$(!1);if(!C)return;C.setHandlers({connect:()=>E(C,T),close:()=>X$(C,T)});try{let v=await G$(l);if(C.isDead)return;let[f,_]=await I$([B0(H0(I,T)),C.signal(v).then(Y$)]);O(f,V$({peerId:m,answer:_}))}catch{B?.({error:"decryption failed (offer)",appId:V,peerId:T,roomId:U})}}else if(b){let C=z[T]?.[D];if(!C\|\|C.isDead)return;C.setHandlers({connect:()=>E(C,T),close:()=>X$(C,T)});try{C.signal(await G$(b))}catch{B?.({error:"decryption failed (answer)",appId:V,peerId:T,roomId:U})}}else{let C=z[T]\|\|=[];if(C.forEach((F,n)=>{if(F&&(F.isDead\|\|Date.now()-(F.dialedAt??F.created)>p0)){if(F.isDead)L.set(T,Date.now()+30000);F.destroy(),delete C[n]}}),C[D]\|\|C.filter(Boolean).length>=2\|\|L.get(T)>Date.now())return;if(Object.values(z).reduce((F,n)=>F+n.filter((i)=>i&&!i.isDead).length,0)>=hJ)return;let f=X.pop(),_=f?j$(f):Q$(!0);if(!_){L.set(T,Date.now()+30000);return}_.dialedAt=Date.now();let[c,{offer:d}]=await I$([B0(H0(I,T)),_.offerPromise.then(Y$).then((F)=>({offer:F}))]);C[D]=_,_.setHandlers({connect:()=>E(_,T),close:()=>X$(_,T)}),O(c,V$({peerId:m,offer:d,peer:_}))}},H=[],k=[];Y.forEach(async(D,Z)=>{let W=await D;if(!W)return;let[O,R]=await I$([g,t]);k[Z]=J(W,O,R,e(Z));let x=async()=>{let T=await q(W,O,R);H[Z]=setTimeout(x,typeof T==="number"?T:cJ)};x()}),Q[V]\|\|={};let M=bQ((D)=>A=D,(D)=>delete K[D],()=>M.onCleanup?.());return M.onCleanup=()=>{if(delete Q[V][U],H.forEach(clearTimeout),k.forEach((D)=>D?.()),Object.keys(Q).length===0)clearInterval(Q.offerCleanupTimer),delete Q.offerCleanupTimer},M._census=()=>{for(let Z of Object.keys(K))S.set(Z,Date.now());let D=Date.now()-120000;for(let[Z,W]of S)if(W<D)S.delete(Z);return[...S.keys()]},Q[V][U]=M}};var yQ=3333,o0={},gQ={},uQ=($,J)=>{let q={},Q=null,G=()=>{if(Q)clearTimeout(Q),Q=null;let Y=new WebSocket($);Y.onclose=()=>{o0[$]??=yQ,Q=setTimeout(G,o0[$]),o0[$]=2},Y.onmessage=(X)=>J(X.data),q.socket=Y,q.url=Y.url,q.ready=new Promise((X)=>{Y.onopen=()=>{o0[$]=yQ,X(q)}}),q.send=(X)=>{if(Y.readyState===1)Y.send(X)}};return q.forceReconnect=G,G(),gQ[$]=q,q};if(typeof window<"u"){let $=()=>{Object.values(gQ).forEach((J)=>{if(J.socket&&J.socket.readyState!==WebSocket.OPEN&&J.socket.readyState!==WebSocket.CONNECTING)J.forceReconnect()})};window.addEventListener("online",()=>{$()}),window.addEventListener("offline",async()=>{}),document.addEventListener("visibilitychange",()=>{if(document.visibilityState==="visible")$()})}var FQ=($)=>()=>m0(SQ($).map(([J,q])=>[J,q.socket])),mQ=($,J,q,Q)=>($.relayUrls??(Q?IQ(J,F0($.appId)):J)).slice(0,$.relayUrls?.length??$.relayRedundancy??q);var G0={},dJ=10,lQ="x",pQ="EVENT",lJ=/pow:\s(\d+)\sbits needed\.?/i,k8=new Set,oQ=g0.utils.randomSecretKey(),pJ=u0(g0.getPublicKey(oQ)),C8={},T0={},oJ={},iQ=()=>Math.floor(Date.now()/1000),rQ=($)=>oJ[$]??=F0($,1e4)+20000,i0=($)=>$.replace(/\/$/,""),iJ=["wss://relay.primal.net","wss://ftp.halifax.rwth-aachen.de/nostr","wss://nostr.oxtr.dev","wss://nostr.sathoarder.com","wss://nostr.mom","wss://nos.lol","wss://nostr.vulpem.com","wss://nostr.data.haus","wss://relay.mostro.network","wss://relay.nostrdice.com"],rJ=($,J)=>{let[q,Q,G,Y]=p$(J);if(q===pQ)return T0[Q]?.(C8[Q],G.content);if(q==="NOTICE"\|\|q==="OK"&&!G){if(+((q==="NOTICE"?Q:Y).match(lJ)?.[1]??0)>0){let j=i0($);k8.add(j),G0[j]?.close?.(),delete G0[j]}}},aJ=($)=>{let J=i0($);if(G0[J])return G0[J];let q=uQ(J,(Q)=>rJ(J,Q));return G0[J]=q},hQ=async($,J)=>{let q={kind:rQ($),content:J,pubkey:pJ,created_at:iQ(),tags:[[lQ,$]]},Q=T$(V$([0,q.pubkey,q.created_at,q.kind,q.tags,q.content])),G=new Uint8Array(await crypto.subtle.digest("SHA-256",Q)),Y=g0.sign(G,oQ);return V$([pQ,{...q,id:u0(G),sig:u0(Y)}])},cQ=($,J)=>{return C8[$]=J,V$(["REQ",$,{kinds:[rQ(J)],since:iQ(),["#"+lQ]:[J]}])},dQ=($)=>{return delete C8[$],V$(["CLOSE",$])},aQ=fQ({init:($)=>{let q=($?.relayUrls?.length?$.relayUrls:null)??iJ;return mQ($,q,dJ,!1).map(aJ).map((G)=>G.ready.then(()=>G).catch(()=>null))},subscribe:($,J,q,Q)=>{let G=Q0(64),Y=Q0(64);return T0[G]=T0[Y]=(X,j)=>Q(X,j,async(U,B)=>{if(k8.has(i0($.url)))return;$.send(await hQ(U,B))}),$.send(cQ(G,J)),$.send(cQ(Y,q)),()=>{$.send(dQ(G)),$.send(dQ(Y)),delete T0[G],delete T0[Y]}},announce:async($,J)=>{if(k8.has(i0($.url)))return;$.send(await hQ(J,V$({peerId:m})))}}),nJ=FQ(G0);var sJ={cellSize:"auto",bridgesPerEdge:2,maxCellSize:50,targetCells:100,debug:!1},nQ=5000,tJ=3000,eJ=30000,$9=2000,n0=($)=>{let J=String($\|\|"").match(/cell-(\d+)/);return J?Number(J[1]):null},Q9=($,J)=>{let q=n0($);if(q==null)return[];let Q=[];for(let G=1;G<J;G=2){if(q-G>=0)Q.push(`cell-${q-G}`);if(q+G<J)Q.push(`cell-${q+G}`)}return Q},r0=($)=>`c${(n0($)\|\|0).toString(36)}`,J9=($,J,q)=>{if($<=10)return Math.max(2,$);let G=10,Y=Math.ceil($/J);return Math.max(G,Math.min(q,Y))},q9=($,J)=>{return Math.max(1,Math.ceil($/J))},sQ=($)=>{let J=0;for(let q=0;q<$.length;q++)J=Math.imul(J^$.charCodeAt(q),2654435761);return J>>>0},S8=($,J)=>{let q=0,Q=-1;for(let G=0;G<J;G++){let Y=sQ(`${$}:${G}`);if(Y>Q)Q=Y,q=G}return q};class a0{constructor($){this.peerId=$,this.joinedAt=Date.now(),this.lastSeen=Date.now(),this.rttSamples=[],this.stability=1,this.reconnects=0,this.isResponsive=!0,this.connectedCells=new Set}get uptime(){return Date.now()-this.joinedAt}get avgRtt(){if(this.rttSamples.length===0)return 1/0;return Math.round(this.rttSamples.reduce(($,J)=>$+J,0)/this.rttSamples.length)}get healthScore(){let $=this.avgRtt===1/0?0.5:Math.max(0,100-this.avgRtt)/100,J=Math.min(1,this.uptime/60000),q=this.stability,Q=this.isResponsive?1:0.3;return $0.25+J0.25+q0.3+Q0.2}get isStale(){return Date.now()-this.lastSeen>eJ}addRttSample($){if(this.rttSamples.push($),this.rttSamples.length>10)this.rttSamples.shift();this.lastSeen=Date.now(),this.isResponsive=!0}markReconnect(){this.reconnects++,this.stability=Math.max(0,1-this.reconnects0.1)}markUnresponsive(){this.isResponsive=!1}markSeen(){this.lastSeen=Date.now()}addConnectedCell($){if($)this.connectedCells.add($)}}function G9($,J={},q={}){let Q={...sJ,...J},G=!!Q.debug,Y=(...N)=>G&&void 0,X=Math.max(0,Q.bridgesPerEdge\|0),j=Math.max(5,Q.maxCellSize\|0),U=Math.max(10,Q.targetCells\|0),B=Q.cellSize==="auto",V=B?2:Math.max(1,Q.cellSize\|0),A={cellId:null,bridges:[],isBridge:!1},z=null,K=null,L=null,S=new Map,I=new Map,g=new Set,t=new Map,u=new Set,a=new Set,G$=0,Y$=[],j$=new Map,Q$=new Set,E=new Map,X$=new Map,e=1,H=0,k=1,M=0,D=()=>{J$();let N=q9(i().length,V);if(N!==k)k=N,M=Date.now();let w=Date.now()-M;if(N>e&&w>4000)e=N;else if(N<e&&w>30000)e=N;return e},Z=()=>Math.min(150,Math.ceil(Math.log2(D()+1))*2+3),W=(N)=>Q9(N,D()),O=$.on?.bind($),R=$.off?.bind($);if(O)$.on=(N,w)=>String(N).startsWith("mesh:")?l(N,w):O(N,w);if(R)$.off=(N,w)=>String(N).startsWith("mesh:")?t.get(N)?.delete(w):R(N,w);let x=(N)=>(g.add(N),()=>g.delete(N)),T=(N,w,P)=>{if(a.has(P))return;if(a.add(P),a.size>nQ){let y=a.values().next().value;a.delete(y)}for(let y of g)try{y(N,w)}catch(h){Y("Error in deliver handler:",h)}},l=(N,w)=>{if(!t.has(N))t.set(N,new Set);return t.get(N).add(w),()=>t.get(N)?.delete(w)},b=(N,...w)=>{let P=t.get(N);if(P)for(let y of P)try{y(...w)}catch{}},C=(N)=>{try{return typeof N==="string"?JSON.parse(N):N}catch{return null}},v=()=>`${m}:${Date.now().toString(36)}:${(G$++&65535).toString(36)}`,f=()=>{if(u.size>nQ)u.delete(u.values().next().value)},_=(N,w,P=[])=>{if(!N\|\|!w)return;if(S.set(N,{cell:w,isBridge:P.length>0,bridges:[...P]}),!I.has(N))I.set(N,new a0(N));let y=I.get(N);if(y.markSeen(),y.addConnectedCell(w),X$.set(w,{lastSeen:Date.now(),peerId:N}),P.length>0)for(let h of W(w))y.addConnectedCell(h)},c=(N)=>I.get(N),d=(N,w)=>{let P=I.get(N);if(P)P.addRttSample(w)},F=(N)=>{let w=y$(N);if(w.length===0)return null;let P=0,y=0;for(let s of w){let U$=I.get(s);if(U$&&!U$.isStale){if(P+=U$.healthScore,U$.isResponsive)y++}}let h=w.filter((s)=>{let U$=I.get(s);return U$&&!U$.isStale});return{cellId:N,memberCount:h.length,avgHealth:h.length>0?P/h.length:0,responsiveRatio:h.length>0?y/h.length:0}},n=()=>{let N=F(A.cellId);b("mesh:health",{...A,health:N})},i=()=>[...new Set([...$._census(),m])].sort(),J$=()=>{if(!B)return;let N=i().length,w=J9(N,U,j);if(w!==V)Y("cellSize changed:",V,"->",w),V=w},z$=(N,w)=>w.filter((P)=>S8(P,D())===N),Y0=(N,w)=>{if(X===0)return[];let P=n0(N),y=n0(w);if(P==null\|\|y==null)return[];let h=i(),s=z$(P,h),U$=z$(y,h),$$=Math.min(P,y),i$=Math.max(P,y),X0=(r)=>sQ(`${r}@${$$}~${i$}`),O$=[...new Set([...s,...U$])].sort((r,e0)=>X0(e0)-X0(r));if(!O$.length)return[];let r$=new Set(s),z0=[],o=(r)=>r&&!z0.includes(r)&&z0.push(r);o(O$.find((r)=>r$.has(r))),o(O$.find((r)=>!r$.has(r)));for(let r of O$){if(z0.length>=Math.max(X,2))break;o(r)}return z0},o$=(N,w)=>{if(X===0)return[];let P=W(w),y=[];for(let h of P)if(Y0(w,h).includes(N))y.push(h);return y},M$=()=>{J$();let N=i(),w=S8(m,D()),P=D(),y=`cell-${w}`,h=o$(m,y),s=h.length>0;return Y("computeState",{self:m,myCell:y,isBridge:s,bridgeEdges:h,cellSize:V,rosterSize:N.length,totalCells:P,dynamicTTL:Z()}),{cellId:y,isBridge:s,bridges:h,cellSize:V,dynamicTTL:Z(),totalCells:P}},y$=(N)=>{let w=[],P=new Set(Object.keys($.getPeers?.()\|\|{}));for(let[y,h]of S)if(h.cell===N){let s=I.get(y);if(P.has(y)&&(!s\|\|!s.isStale))w.push(y)}return w.sort(),w},N$=()=>{if(!z)return;t0=E8(),I8=Date.now();let N={t:"state",id:v(),ttl:Z(),data:{id:m,cell:A.cellId,bridges:A.bridges,health:I.get(m)?.healthScore\|\|0.5,timestamp:Date.now()},origin:m,originCell:A.cellId},w=JSON.stringify(N);z.send(w),x$(K,w)},x$=(N,w)=>{let P=C(w);if(!P?.id\|\|!P?.t)return;let y=u.has(P.id);if(!y)u.add(P.id),f();let{t:h,id:s,ttl:U$,data:$$,origin:i$,originCell:X0}=P,O$=A.cellId;if(h==="state"&&$$)_($$.id,$$.cell,$$.bridges),b("mesh:peer-state",$$);if(h==="ping"&&$$?.pingId&&i$!==m){let o={t:"pong",id:v(),ttl:Z(),data:{pingId:$$.pingId,receivedAt:Date.now()},origin:m,originCell:O$};z?.send(JSON.stringify(o))}if(h==="pong"&&$$?.pingId){let o=E.get($$.pingId);if(o){clearTimeout(o.timeout);let r=Date.now()-o.start;d(o.peerId,r),o.resolve(r),E.delete($$.pingId)}}if(h==="msg"&&i$!==m){if(X0===O$\|\|X>0)T($$,i$,s)}if(y)return;if(!A.isBridge)return;if((U$??0)<=0)return;let r$=(o,r,e0=null)=>{if(!o)return;let JJ={t:h,id:s,ttl:e0??(U$??Z())-1,data:$$,origin:i$\|\|m,originCell:X0\|\|O$},v8=JSON.stringify(JJ);if(r?.length){let qJ=new Set(Object.keys($.getPeers?.()\|\|{})),_8=r.filter((GJ)=>qJ.has(GJ));if(_8.length>0)o.send(v8,_8)}else o.send(v8)};if(N===K){for(let o of W(O$))r$(B$(o),null);return}if(!W(O$).map(r0).includes(N))return;r$(z,null);for(let o of W(O$))if(r0(o)!==N)r$(B$(o),null)},B$=(N)=>{let w=r0(N);if(j$.has(N))return j$.get(N);let P=$.channel(w);if(j$.set(N,P),!Q$.has(w))Q$.add(w),P.on("message",(y)=>x$(w,y));return P},s0=()=>{if(!A.cellId)return;if(K=r0(A.cellId),z=$.channel(K),!Q$.has(K))Q$.add(K),z.on("message",(N)=>x$(K,N));if(A.isBridge)for(let N of W(A.cellId))B$(N);if(Y$.length)for(let N of Y$.splice(0)){let w={t:"msg",id:v(),ttl:Z(),data:N,origin:m,originCell:A.cellId},P=JSON.stringify(w);z.send(P),x$(K,P)}N$()},P8=(N)=>{if(!A.cellId)return!0;if(!i().includes(N))return!0;let P=`cell-${S8(N,D())}`;if(P===A.cellId)return!0;if(A.bridges.includes(P))return!0;return W(A.cellId).includes(P)&&Y0(P,A.cellId).includes(N)},tQ=()=>{let N=$.getPeers?.()\|\|{};for(let w of Object.keys(N))if(!P8(w))N[w].close?.()};q.admit=P8;let L0=()=>{let N=M$(),w=!A.cellId\|\|A.cellId!==N.cellId\|\|A.isBridge!==N.isBridge\|\|JSON.stringify(A.bridges)!==JSON.stringify(N.bridges);if(A=N,_(m,N.cellId,N.bridges),w)s0();else N$();tQ(),b("mesh:state",N),n()},t0="",I8=0,E8=()=>{return`${A.cellId}:${A.isBridge}:${A.bridges.join(",")}`},eQ=()=>{if(L)return;L=setInterval(()=>{let N=D();if(N!==H){H=N,L0();return}let w=E8();if(w!==t0\|\|Date.now()-I8>1e4)N$(),t0=w;for(let[P,y]of I)if(P!==m&&y.isStale)S.delete(P),I.delete(P),Y("Removed stale peer:",P)},$9)},$J=()=>{if(L)clearInterval(L),L=null},QJ=(N)=>{return new Promise((w,P)=>{let y=`${Date.now()}-${Math.random().toString(36).slice(2,8)}`,h=Date.now(),s=setTimeout(()=>{E.delete(y);let $$=I.get(N);if($$)$$.markUnresponsive();P(Error("Ping timeout"))},tJ);E.set(y,{start:h,resolve:w,reject:P,timeout:s,peerId:N});let U$={t:"ping",id:v(),ttl:Z(),data:{pingId:y,target:N},origin:m,originCell:A.cellId};z?.send(JSON.stringify(U$))})};if($.on?.("peer:join",(N)=>{if(!I.has(N))I.set(N,new a0(N));else I.get(N).markReconnect();L0()}),$.on?.("peer:leave",(N)=>{S.delete(N),L0()}),!I.has(m))I.set(m,new a0(m));return I.get(m).addConnectedCell(A.cellId\|\|"cell-0"),L0(),eQ(),{send:(N)=>{if(!A.cellId\|\|!z)return Y$.push(N);let w={t:"msg",id:v(),ttl:Z(),data:N,origin:m,originCell:A.cellId},P=JSON.stringify(w);z.send(P),x$(K,P)},on:(N,w)=>N==="message"?x(w):void 0,ping:QJ,getState:()=>({...A,cellSize:V,health:F(A.cellId),dynamicTTL:Z(),totalCells:D(),knownCells:X$.size}),getMetrics:c,getCellHealth:F,getPeerInfo:()=>new Map(S),getStableRoster:()=>i(),getKnownCells:()=>new Map(X$),getCellSize:()=>V,destroy:()=>{$J(),E.forEach((N)=>clearTimeout(N.timeout)),E.clear(),a.clear(),X$.clear()}}}function Nq($,J,q){let Q={},G=aQ({...$,admit:(U)=>Q.admit?.(U)??!0},J,q),Y=$.overlay\|\|{},X=G9(G,Y,Q),j=new Map;return{on:(U,B)=>G.on(U,B),off:(U,B)=>G.off?.(U,B),channel:(U)=>{if(j.has(U))return j.get(U);let B=G.channel(U),V={send:(A,z)=>{X.send({_ch:U,_d:A,_t:z})},on:(A,z)=>{if(A==="message")X.on("message",(K,L)=>{if(K?._ch===U)z(K._d,L)}),B.on(A,z);else B.on(A,z)},off:(A,z)=>B.off?.(A,z),_original:B};return j.set(U,V),V},get id(){return G.id},get peers(){return G.peers},getPeers:()=>G.getPeers?.()\|\|{},mesh:X,_room:G,getState:()=>X.getState(),getMetrics:(U)=>X.getMetrics(U),getCellHealth:(U)=>X.getCellHealth(U),getPeerInfo:()=>X.getPeerInfo(),ping:(U)=>X.ping(U),destroy:()=>{X.destroy(),j.clear()}}}export{m as selfId,Nq as join,nJ as getRelaySockets,sJ as OVERLAY_DEFAULTS};

package/dist/genosrtc-cells.min.js.gz CHANGED Viewed

Binary file

package/dist/genosrtc.min.js CHANGED Viewed

	@@ -1 +1 @@
1	- var x0=typeof globalThis==="object"&&"crypto"in globalThis?globalThis.crypto:void 0;/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /function w0($){return $ instanceof Uint8Array\|\|ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function l0($){if(!Number.isSafeInteger($)\|\|$<0)throw Error("positive integer expected, got "+$)}function $0($,...J){if(!w0($))throw Error("Uint8Array expected");if(J.length>0&&!J.includes($.length))throw Error("Uint8Array expected of length "+J+", got length="+$.length)}function Z$($){if(typeof $!=="function"\|\|typeof $.create!=="function")throw Error("Hash should be wrapped by utils.createHasher");l0($.outputLen),l0($.blockLen)}function v0($,J=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(J&&$.finished)throw Error("Hash#digest() has already been called")}function Y8($,J){$0($);let q=J.outputLen;if($.length<q)throw Error("digestInto() expects output buffer of length at least "+q)}function L0(...$){for(let J=0;J<$.length;J++)$[J].fill(0)}function U$($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function Q0($,J){return $<<32-J\|$>>>J}var X8=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),BQ=Array.from({length:256},($,J)=>J.toString(16).padStart(2,"0"));function U0($){if($0($),X8)return $.toHex();let J="";for(let q=0;q<$.length;q++)J+=BQ[$[q]];return J}var Z0={_0:48,_9:57,A:65,F:70,a:97,f:102};function z8($){if($>=Z0._0&&$<=Z0._9)return $-Z0._0;if($>=Z0.A&&$<=Z0.F)return $-(Z0.A-10);if($>=Z0.a&&$<=Z0.f)return $-(Z0.a-10);return}function k0($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(X8)return Uint8Array.fromHex($);let J=$.length,q=J/2;if(J%2)throw Error("hex string expected, got unpadded hex of length "+J);let Q=new Uint8Array(q);for(let G=0,z=0;G<q;G++,z+=2){let Y=z8($.charCodeAt(z)),Z=z8($.charCodeAt(z+1));if(Y===void 0\|\|Z===void 0){let j=$[z]+$[z+1];throw Error('hex string expected, got non-hex character "'+j+'" at index '+z)}Q[G]=Y16+Z}return Q}function j$($){if(typeof $!=="string")throw Error("string expected");return new Uint8Array(new TextEncoder().encode($))}function d0($){if(typeof $==="string")$=j$($);return $0($),$}function d(...$){let J=0;for(let Q=0;Q<$.length;Q++){let G=$[Q];$0(G),J+=G.length}let q=new Uint8Array(J);for(let Q=0,G=0;Q<$.length;Q++){let z=$[Q];q.set(z,G),G+=z.length}return q}class r0{}function Z8($){let J=(Q)=>$().update(d0(Q)).digest(),q=$();return J.outputLen=q.outputLen,J.blockLen=q.blockLen,J.create=()=>$(),J}function I0($=32){if(x0&&typeof x0.getRandomValues==="function")return x0.getRandomValues(new Uint8Array($));if(x0&&typeof x0.randomBytes==="function")return Uint8Array.from(x0.randomBytes($));throw Error("crypto.getRandomValues must be defined")}function RQ($,J,q,Q){if(typeof $.setBigUint64==="function")return $.setBigUint64(J,q,Q);let G=BigInt(32),z=BigInt(4294967295),Y=Number(q>>G&z),Z=Number(q&z),j=Q?4:0,V=Q?0:4;$.setUint32(J+j,Y,Q),$.setUint32(J+V,Z,Q)}function U8($,J,q){return $&J^~$&q}function j8($,J,q){return $&J^$&q^J&q}class E$ extends r0{constructor($,J,q,Q){super();this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=$,this.outputLen=J,this.padOffset=q,this.isLE=Q,this.buffer=new Uint8Array($),this.view=U$(this.buffer)}update($){v0(this),$=d0($),$0($);let{view:J,buffer:q,blockLen:Q}=this,G=$.length;for(let z=0;z<G;){let Y=Math.min(Q-this.pos,G-z);if(Y===Q){let Z=U$($);for(;Q<=G-z;z+=Q)this.process(Z,z);continue}if(q.set($.subarray(z,z+Y),this.pos),this.pos+=Y,z+=Y,this.pos===Q)this.process(J,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){v0(this),Y8($,this),this.finished=!0;let{buffer:J,view:q,blockLen:Q,isLE:G}=this,{pos:z}=this;if(J[z++]=128,L0(this.buffer.subarray(z)),this.padOffset>Q-z)this.process(q,0),z=0;for(let N=z;N<Q;N++)J[N]=0;RQ(q,Q-8,BigInt(this.length8),G),this.process(q,0);let Y=U$($),Z=this.outputLen;if(Z%4)throw Error("_sha2: outputLen should be aligned to 32bit");let j=Z/4,V=this.get();if(j>V.length)throw Error("_sha2: outputLen bigger than state");for(let N=0;N<j;N++)Y.setUint32(4N,V[N],G)}digest(){let{buffer:$,outputLen:J}=this;this.digestInto($);let q=$.slice(0,J);return this.destroy(),q}_cloneInto($){$\|\|($=new this.constructor),$.set(...this.get());let{blockLen:J,buffer:q,length:Q,finished:G,destroyed:z,pos:Y}=this;if($.destroyed=z,$.finished=G,$.length=Q,$.pos=Y,Q%J)$.buffer.set(q);return $}clone(){return this._cloneInto()}}var j0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);var xQ=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]),C0=new Uint32Array(64);class K8 extends E${constructor($=32){super(64,$,8,!1);this.A=j0[0]\|0,this.B=j0[1]\|0,this.C=j0[2]\|0,this.D=j0[3]\|0,this.E=j0[4]\|0,this.F=j0[5]\|0,this.G=j0[6]\|0,this.H=j0[7]\|0}get(){let{A:$,B:J,C:q,D:Q,E:G,F:z,G:Y,H:Z}=this;return[$,J,q,Q,G,z,Y,Z]}set($,J,q,Q,G,z,Y,Z){this.A=$\|0,this.B=J\|0,this.C=q\|0,this.D=Q\|0,this.E=G\|0,this.F=z\|0,this.G=Y\|0,this.H=Z\|0}process($,J){for(let N=0;N<16;N++,J+=4)C0[N]=$.getUint32(J,!1);for(let N=16;N<64;N++){let x=C0[N-15],X=C0[N-2],K=Q0(x,7)^Q0(x,18)^x>>>3,B=Q0(X,17)^Q0(X,19)^X>>>10;C0[N]=B+C0[N-7]+K+C0[N-16]\|0}let{A:q,B:Q,C:G,D:z,E:Y,F:Z,G:j,H:V}=this;for(let N=0;N<64;N++){let x=Q0(Y,6)^Q0(Y,11)^Q0(Y,25),X=V+x+U8(Y,Z,j)+xQ[N]+C0[N]\|0,B=(Q0(q,2)^Q0(q,13)^Q0(q,22))+j8(q,Q,G)\|0;V=j,j=Z,Z=Y,Y=z+X\|0,z=G,G=Q,Q=q,q=X+B\|0}q=q+this.A\|0,Q=Q+this.B\|0,G=G+this.C\|0,z=z+this.D\|0,Y=Y+this.E\|0,Z=Z+this.F\|0,j=j+this.G\|0,V=V+this.H\|0,this.set(q,Q,G,z,Y,Z,j,V)}roundClean(){L0(C0)}destroy(){this.set(0,0,0,0,0,0,0,0),L0(this.buffer)}}var K$=Z8(()=>new K8);class f$ extends r0{constructor($,J){super();this.finished=!1,this.destroyed=!1,Z$($);let q=d0(J);if(this.iHash=$.create(),typeof this.iHash.update!=="function")throw Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;let Q=this.blockLen,G=new Uint8Array(Q);G.set(q.length>Q?$.create().update(q).digest():q);for(let z=0;z<G.length;z++)G[z]^=54;this.iHash.update(G),this.oHash=$.create();for(let z=0;z<G.length;z++)G[z]^=106;this.oHash.update(G),L0(G)}update($){return v0(this),this.iHash.update($),this}digestInto($){v0(this),$0($,this.outputLen),this.finished=!0,this.iHash.digestInto($),this.oHash.update($),this.oHash.digestInto($),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$\|\|($=Object.create(Object.getPrototypeOf(this),{}));let{oHash:J,iHash:q,finished:Q,destroyed:G,blockLen:z,outputLen:Y}=this;return $=$,$.finished=Q,$.destroyed=G,$.blockLen=z,$.outputLen=Y,$.oHash=J._cloneInto($.oHash),$.iHash=q._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var v$=($,J,q)=>new f$($,J).update(q).digest();v$.create=($,J)=>new f$($,J);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var g$=BigInt(0),_$=BigInt(1);function o0($,J=""){if(typeof $!=="boolean"){let q=J&&`"${J}"`;throw Error(q+"expected boolean, got type="+typeof $)}return $}function T0($,J,q=""){let Q=w0($),G=$?.length,z=J!==void 0;if(!Q\|\|z&&G!==J){let Y=q&&`"${q}" `,Z=z?` of length ${J}`:"",j=Q?`length=${G}`:`type=${typeof $}`;throw Error(Y+"expected Uint8Array"+Z+", got "+j)}return $}function p0($){let J=$.toString(16);return J.length&1?"0"+J:J}function D8($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?g$:BigInt("0x"+$)}function K0($){return D8(U0($))}function y$($){return $0($),D8(U0(Uint8Array.from($).reverse()))}function b0($,J){return k0($.toString(16).padStart(J2,"0"))}function u$($,J){return b0($,J).reverse()}function m($,J,q){let Q;if(typeof J==="string")try{Q=k0(J)}catch(z){throw Error($+" must be hex string or Uint8Array, cause: "+z)}else if(w0(J))Q=Uint8Array.from(J);else throw Error($+" must be hex string or Uint8Array");let G=Q.length;if(typeof q==="number"&&G!==q)throw Error($+" of length "+q+" expected, got "+G);return Q}var b$=($)=>typeof $==="bigint"&&g$<=$;function i0($,J,q){return b$($)&&b$(J)&&b$(q)&&J<=$&&$<q}function M8($,J,q,Q){if(!i0(J,q,Q))throw Error("expected valid "+$+": "+q+" <= n < "+Q+", got "+J)}function D$($){let J;for(J=0;$>g$;$>>=_$,J+=1);return J}var H0=($)=>(_$<<BigInt($))-_$;function W8($,J,q){if(typeof $!=="number"\|\|$<2)throw Error("hashLen must be a number");if(typeof J!=="number"\|\|J<2)throw Error("qByteLen must be a number");if(typeof q!=="function")throw Error("hmacFn must be a function");let Q=(K)=>new Uint8Array(K),G=(K)=>Uint8Array.of(K),z=Q($),Y=Q($),Z=0,j=()=>{z.fill(1),Y.fill(0),Z=0},V=(...K)=>q(Y,z,...K),N=(K=Q(0))=>{if(Y=V(G(0),K),z=V(),K.length===0)return;Y=V(G(1),K),z=V()},x=()=>{if(Z++>=1000)throw Error("drbg: tried 1000 values");let K=0,B=[];while(K<J){z=V();let w=z.slice();B.push(w),K+=z.length}return d(...B)};return(K,B)=>{j(),N(K);let w=void 0;while(!(w=B(x())))N();return j(),w}}function a0($,J,q={}){if(!$\|\|typeof $!=="object")throw Error("expected valid options object");function Q(G,z,Y){let Z=$[G];if(Y&&Z===void 0)return;let j=typeof Z;if(j!==z\|\|Z===null)throw Error(`param "${G}" is invalid: expected ${z}, got ${j}`)}Object.entries(J).forEach(([G,z])=>Q(G,z,!1)),Object.entries(q).forEach(([G,z])=>Q(G,z,!0))}function m$($){let J=new WeakMap;return(q,...Q)=>{let G=J.get(q);if(G!==void 0)return G;let z=$(q,...Q);return J.set(q,z),z}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var c=BigInt(0),h=BigInt(1),S0=BigInt(2),C8=BigInt(3),T8=BigInt(4),H8=BigInt(5),wQ=BigInt(7),O8=BigInt(8),LQ=BigInt(9),A8=BigInt(16);function o($,J){let q=$%J;return q>=c?q:J+q}function p($,J,q){let Q=$;while(J-- >c)Q=Q,Q%=q;return Q}function N8($,J){if($===c)throw Error("invert: expected non-zero number");if(J<=c)throw Error("invert: expected positive modulus, got "+J);let q=o($,J),Q=J,G=c,z=h,Y=h,Z=c;while(q!==c){let V=Q/q,N=Q%q,x=G-YV,X=z-ZV;Q=q,q=N,G=Y,z=Z,Y=x,Z=X}if(Q!==h)throw Error("invert: does not exist");return o(G,J)}function F$($,J,q){if(!$.eql($.sqr(J),q))throw Error("Cannot find square root")}function B8($,J){let q=($.ORDER+h)/T8,Q=$.pow(J,q);return F$($,Q,J),Q}function kQ($,J){let q=($.ORDER-H8)/O8,Q=$.mul(J,S0),G=$.pow(Q,q),z=$.mul(J,G),Y=$.mul($.mul(z,S0),G),Z=$.mul(z,$.sub(Y,$.ONE));return F$($,Z,J),Z}function IQ($){let J=O0($),q=R8($),Q=q(J,J.neg(J.ONE)),G=q(J,Q),z=q(J,J.neg(Q)),Y=($+wQ)/A8;return(Z,j)=>{let V=Z.pow(j,Y),N=Z.mul(V,Q),x=Z.mul(V,G),X=Z.mul(V,z),K=Z.eql(Z.sqr(N),j),B=Z.eql(Z.sqr(x),j);V=Z.cmov(V,N,K),N=Z.cmov(X,x,B);let w=Z.eql(Z.sqr(N),j),f=Z.cmov(V,N,w);return F$(Z,f,j),f}}function R8($){if($<C8)throw Error("sqrt is not defined for small field");let J=$-h,q=0;while(J%S0===c)J/=S0,q++;let Q=S0,G=O0($);while(V8(G,Q)===1)if(Q++>1000)throw Error("Cannot find square root: probably non-prime P");if(q===1)return B8;let z=G.pow(Q,J),Y=(J+h)/S0;return function(j,V){if(j.is0(V))return V;if(V8(j,V)!==1)throw Error("Cannot find square root");let N=q,x=j.mul(j.ONE,z),X=j.pow(V,J),K=j.pow(V,Y);while(!j.eql(X,j.ONE)){if(j.is0(X))return j.ZERO;let B=1,w=j.sqr(X);while(!j.eql(w,j.ONE))if(B++,w=j.sqr(w),B===N)throw Error("Cannot find square root");let f=h<<BigInt(N-B-1),v=j.pow(x,f);N=B,x=j.sqr(v),X=j.mul(X,x),K=j.mul(K,v)}return K}}function SQ($){if($%T8===C8)return B8;if($%O8===H8)return kQ;if($%A8===LQ)return IQ($);return R8($)}var PQ=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function h$($){let J={ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"},q=PQ.reduce((Q,G)=>{return Q[G]="function",Q},J);return a0($,q),$}function EQ($,J,q){if(q<c)throw Error("invalid exponent, negatives unsupported");if(q===c)return $.ONE;if(q===h)return J;let Q=$.ONE,G=J;while(q>c){if(q&h)Q=$.mul(Q,G);G=$.sqr(G),q>>=h}return Q}function M$($,J,q=!1){let Q=Array(J.length).fill(q?$.ZERO:void 0),G=J.reduce((Y,Z,j)=>{if($.is0(Z))return Y;return Q[j]=Y,$.mul(Y,Z)},$.ONE),z=$.inv(G);return J.reduceRight((Y,Z,j)=>{if($.is0(Z))return Y;return Q[j]=$.mul(Y,Q[j]),$.mul(Y,Z)},z),Q}function V8($,J){let q=($.ORDER-h)/S0,Q=$.pow(J,q),G=$.eql(Q,$.ONE),z=$.eql(Q,$.ZERO),Y=$.eql(Q,$.neg($.ONE));if(!G&&!z&&!Y)throw Error("invalid Legendre symbol result");return G?1:z?0:-1}function W$($,J){if(J!==void 0)l0(J);let q=J!==void 0?J:$.toString(2).length,Q=Math.ceil(q/8);return{nBitLength:q,nByteLength:Q}}function O0($,J,q=!1,Q={}){if($<=c)throw Error("invalid field: expected ORDER > 0, got "+$);let G=void 0,z=void 0,Y=!1,Z=void 0;if(typeof J==="object"&&J!=null){if(Q.sqrt\|\|q)throw Error("cannot specify opts in two arguments");let X=J;if(X.BITS)G=X.BITS;if(X.sqrt)z=X.sqrt;if(typeof X.isLE==="boolean")q=X.isLE;if(typeof X.modFromBytes==="boolean")Y=X.modFromBytes;Z=X.allowedLengths}else{if(typeof J==="number")G=J;if(Q.sqrt)z=Q.sqrt}let{nBitLength:j,nByteLength:V}=W$($,G);if(V>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");let N,x=Object.freeze({ORDER:$,isLE:q,BITS:j,BYTES:V,MASK:H0(j),ZERO:c,ONE:h,allowedLengths:Z,create:(X)=>o(X,$),isValid:(X)=>{if(typeof X!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof X);return c<=X&&X<$},is0:(X)=>X===c,isValidNot0:(X)=>!x.is0(X)&&x.isValid(X),isOdd:(X)=>(X&h)===h,neg:(X)=>o(-X,$),eql:(X,K)=>X===K,sqr:(X)=>o(XX,$),add:(X,K)=>o(X+K,$),sub:(X,K)=>o(X-K,$),mul:(X,K)=>o(XK,$),pow:(X,K)=>EQ(x,X,K),div:(X,K)=>o(XN8(K,$),$),sqrN:(X)=>XX,addN:(X,K)=>X+K,subN:(X,K)=>X-K,mulN:(X,K)=>XK,inv:(X)=>N8(X,$),sqrt:z\|\|((X)=>{if(!N)N=SQ($);return N(x,X)}),toBytes:(X)=>q?u$(X,V):b0(X,V),fromBytes:(X,K=!0)=>{if(Z){if(!Z.includes(X.length)\|\|X.length>V)throw Error("Field.fromBytes: expected "+Z+" bytes, got "+X.length);let w=new Uint8Array(V);w.set(X,q?0:w.length-X.length),X=w}if(X.length!==V)throw Error("Field.fromBytes: expected "+V+" bytes, got "+X.length);let B=q?y$(X):K0(X);if(Y)B=o(B,$);if(!K){if(!x.isValid(B))throw Error("invalid field element: outside of range 0..ORDER")}return B},invertBatch:(X)=>M$(x,X),cmov:(X,K,B)=>B?K:X});return Object.freeze(x)}function x8($){if(typeof $!=="bigint")throw Error("field order must be bigint");let J=$.toString(2).length;return Math.ceil(J/8)}function c$($){let J=x8($);return J+Math.ceil(J/2)}function N$($,J,q=!1){let Q=$.length,G=x8(J),z=c$(J);if(Q<16\|\|Q<z\|\|Q>1024)throw Error("expected "+z+"-1024 bytes of input, got "+Q);let Y=q?y$($):K0($),Z=o(Y,J-h)+h;return q?u$(Z,G):b0(Z,G)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var _0=BigInt(0),P0=BigInt(1);function n0($,J){let q=J.negate();return $?q:J}function V$($,J){let q=M$($.Fp,J.map((Q)=>Q.Z));return J.map((Q,G)=>$.fromAffine(Q.toAffine(q[G])))}function I8($,J){if(!Number.isSafeInteger($)\|\|$<=0\|\|$>J)throw Error("invalid window size, expected [1.."+J+"], got W="+$)}function l$($,J){I8($,J);let q=Math.ceil(J/$)+1,Q=2($-1),G=2$,z=H0($),Y=BigInt($);return{windows:q,windowSize:Q,mask:z,maxNumber:G,shiftBy:Y}}function w8($,J,q){let{windowSize:Q,mask:G,maxNumber:z,shiftBy:Y}=q,Z=Number($&G),j=$>>Y;if(Z>Q)Z-=z,j+=P0;let V=JQ,N=V+Math.abs(Z)-1,x=Z===0,X=Z<0,K=J%2!==0;return{nextN:j,offset:N,isZero:x,isNeg:X,isNegF:K,offsetF:V}}function fQ($,J){if(!Array.isArray($))throw Error("array expected");$.forEach((q,Q)=>{if(!(q instanceof J))throw Error("invalid point at index "+Q)})}function vQ($,J){if(!Array.isArray($))throw Error("array of scalars expected");$.forEach((q,Q)=>{if(!J.isValid(q))throw Error("invalid scalar at index "+Q)})}var d$=new WeakMap,S8=new WeakMap;function r$($){return S8.get($)\|\|1}function L8($){if($!==_0)throw Error("invalid wNAF")}class o${constructor($,J){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=J}_unsafeLadder($,J,q=this.ZERO){let Q=$;while(J>_0){if(J&P0)q=q.add(Q);Q=Q.double(),J>>=P0}return q}precomputeWindow($,J){let{windows:q,windowSize:Q}=l$(J,this.bits),G=[],z=$,Y=z;for(let Z=0;Z<q;Z++){Y=z,G.push(Y);for(let j=1;j<Q;j++)Y=Y.add(z),G.push(Y);z=Y.double()}return G}wNAF($,J,q){if(!this.Fn.isValid(q))throw Error("invalid scalar");let Q=this.ZERO,G=this.BASE,z=l$($,this.bits);for(let Y=0;Y<z.windows;Y++){let{nextN:Z,offset:j,isZero:V,isNeg:N,isNegF:x,offsetF:X}=w8(q,Y,z);if(q=Z,V)G=G.add(n0(x,J[X]));else Q=Q.add(n0(N,J[j]))}return L8(q),{p:Q,f:G}}wNAFUnsafe($,J,q,Q=this.ZERO){let G=l$($,this.bits);for(let z=0;z<G.windows;z++){if(q===_0)break;let{nextN:Y,offset:Z,isZero:j,isNeg:V}=w8(q,z,G);if(q=Y,j)continue;else{let N=J[Z];Q=Q.add(V?N.negate():N)}}return L8(q),Q}getPrecomputes($,J,q){let Q=d$.get(J);if(!Q){if(Q=this.precomputeWindow(J,$),$!==1){if(typeof q==="function")Q=q(Q);d$.set(J,Q)}}return Q}cached($,J,q){let Q=r$($);return this.wNAF(Q,this.getPrecomputes(Q,$,q),J)}unsafe($,J,q,Q){let G=r$($);if(G===1)return this._unsafeLadder($,J,Q);return this.wNAFUnsafe(G,this.getPrecomputes(G,$,q),J,Q)}createCache($,J){I8(J,this.bits),S8.set($,J),d$.delete($)}hasCache($){return r$($)!==1}}function P8($,J,q,Q){let G=J,z=$.ZERO,Y=$.ZERO;while(q>_0\|\|Q>_0){if(q&P0)z=z.add(G);if(Q&P0)Y=Y.add(G);G=G.double(),q>>=P0,Q>>=P0}return{p1:z,p2:Y}}function E8($,J,q,Q){fQ(q,$),vQ(Q,J);let G=q.length,z=Q.length;if(G!==z)throw Error("arrays of points and scalars must have equal length");let Y=$.ZERO,Z=D$(BigInt(G)),j=1;if(Z>12)j=Z-3;else if(Z>4)j=Z-2;else if(Z>0)j=2;let V=H0(j),N=Array(Number(V)+1).fill(Y),x=Math.floor((J.BITS-1)/j)j,X=Y;for(let K=x;K>=0;K-=j){N.fill(Y);for(let w=0;w<z;w++){let f=Q[w],v=Number(f>>BigInt(K)&V);N[v]=N[v].add(q[w])}let B=Y;for(let w=N.length-1,f=Y;w>0;w--)f=f.add(N[w]),B=B.add(f);if(X=X.add(B),K!==0)for(let w=0;w<j;w++)X=X.double()}return X}function k8($,J,q){if(J){if(J.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return h$(J),J}else return O0($,{isLE:q})}function f8($,J,q={},Q){if(Q===void 0)Q=$==="edwards";if(!J\|\|typeof J!=="object")throw Error(`expected valid ${$} CURVE object`);for(let j of["p","n","h"]){let V=J[j];if(!(typeof V==="bigint"&&V>_0))throw Error(`CURVE.${j} must be positive bigint`)}let G=k8(J.p,q.Fp,Q),z=k8(J.n,q.Fn,Q),Z=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let j of Z)if(!G.isValid(J[j]))throw Error(`CURVE.${j} must be valid field element of CURVE.Fp`);return J=Object.freeze(Object.assign({},J)),{CURVE:J,Fp:G,Fn:z}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var v8=($,J)=>($+($>=0?J:-J)/_8)/J;function bQ($,J,q){let[[Q,G],[z,Y]]=J,Z=v8(Y$,q),j=v8(-G$,q),V=$-ZQ-jz,N=-ZG-jY,x=V<M0,X=N<M0;if(x)V=-V;if(X)N=-N;let K=H0(Math.ceil(D$(q)/2))+g0;if(V<M0\|\|V>=K\|\|N<M0\|\|N>=K)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:x,k1:V,k2neg:X,k2:N}}function i$($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function p$($,J){let q={};for(let Q of Object.keys(J))q[Q]=$[Q]===void 0?J[Q]:$[Q];if(o0(q.lowS,"lowS"),o0(q.prehash,"prehash"),q.format!==void 0)i$(q.format);return q}class b8 extends Error{constructor($=""){super($)}}var D0={Err:b8,_tlv:{encode:($,J)=>{let{Err:q}=D0;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length&1)throw new q("tlv.encode: unpadded data");let Q=J.length/2,G=p0(Q);if(G.length/2&128)throw new q("tlv.encode: long form length too big");let z=Q>127?p0(G.length/2\|128):"";return p0($)+z+G+J},decode($,J){let{Err:q}=D0,Q=0;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length<2\|\|J[Q++]!==$)throw new q("tlv.decode: wrong tlv");let G=J[Q++],z=!!(G&128),Y=0;if(!z)Y=G;else{let j=G&127;if(!j)throw new q("tlv.decode(long): indefinite length not supported");if(j>4)throw new q("tlv.decode(long): byte length is too big");let V=J.subarray(Q,Q+j);if(V.length!==j)throw new q("tlv.decode: length bytes not complete");if(V[0]===0)throw new q("tlv.decode(long): zero leftmost byte");for(let N of V)Y=Y<<8\|N;if(Q+=j,Y<128)throw new q("tlv.decode(long): not minimal encoding")}let Z=J.subarray(Q,Q+Y);if(Z.length!==Y)throw new q("tlv.decode: wrong value length");return{v:Z,l:J.subarray(Q+Y)}}},_int:{encode($){let{Err:J}=D0;if($<M0)throw new J("integer: negative integers are not allowed");let q=p0($);if(Number.parseInt(q[0],16)&8)q="00"+q;if(q.length&1)throw new J("unexpected DER parsing assertion: unpadded hex");return q},decode($){let{Err:J}=D0;if($[0]&128)throw new J("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new J("invalid signature integer: unnecessary leading zero");return K0($)}},toSig($){let{Err:J,_int:q,_tlv:Q}=D0,G=m("signature",$),{v:z,l:Y}=Q.decode(48,G);if(Y.length)throw new J("invalid signature: left bytes after parsing");let{v:Z,l:j}=Q.decode(2,z),{v:V,l:N}=Q.decode(2,j);if(N.length)throw new J("invalid signature: left bytes after parsing");return{r:q.decode(Z),s:q.decode(V)}},hexFromSig($){let{_tlv:J,_int:q}=D0,Q=J.encode(2,q.encode($.r)),G=J.encode(2,q.encode($.s)),z=Q+G;return J.encode(48,z)}},M0=BigInt(0),g0=BigInt(1),_8=BigInt(2),C$=BigInt(3),_Q=BigInt(4);function A0($,J){let{BYTES:q}=$,Q;if(typeof J==="bigint")Q=J;else{let G=m("private key",J);try{Q=$.fromBytes(G)}catch(z){throw Error(`invalid private key: expected ui8a of size ${q}, got ${typeof J}`)}}if(!$.isValidNot0(Q))throw Error("invalid private key: out of range [1..N-1]");return Q}function gQ($,J={}){let q=f8("weierstrass",$,J),{Fp:Q,Fn:G}=q,z=q.CURVE,{h:Y,n:Z}=z;a0(J,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});let{endo:j}=J;if(j){if(!Q.is0(z.a)\|\|typeof j.beta!=="bigint"\|\|!Array.isArray(j.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let V=y8(Q,G);function N(){if(!Q.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function x(W,A,M){let{x:T,y:U}=A.toAffine(),D=Q.toBytes(T);if(o0(M,"isCompressed"),M){N();let H=!Q.isOdd(U);return d(g8(H),D)}else return d(Uint8Array.of(4),D,Q.toBytes(U))}function X(W){T0(W,void 0,"Point");let{publicKey:A,publicKeyUncompressed:M}=V,T=W.length,U=W[0],D=W.subarray(1);if(T===A&&(U===2\|\|U===3)){let H=Q.fromBytes(D);if(!Q.isValid(H))throw Error("bad point: is not on curve, wrong x");let O=w(H),C;try{C=Q.sqrt(O)}catch(I){let L=I instanceof Error?": "+I.message:"";throw Error("bad point: is not on curve, sqrt error"+L)}N();let R=Q.isOdd(C);if((U&1)===1!==R)C=Q.neg(C);return{x:H,y:C}}else if(T===M&&U===4){let H=Q.BYTES,O=Q.fromBytes(D.subarray(0,H)),C=Q.fromBytes(D.subarray(H,H2));if(!f(O,C))throw Error("bad point: is not on curve");return{x:O,y:C}}else throw Error(`bad point: got length ${T}, expected compressed=${A} or uncompressed=${M}`)}let K=J.toBytes\|\|x,B=J.fromBytes\|\|X;function w(W){let A=Q.sqr(W),M=Q.mul(A,W);return Q.add(Q.add(M,Q.mul(W,z.a)),z.b)}function f(W,A){let M=Q.sqr(A),T=w(W);return Q.eql(M,T)}if(!f(z.Gx,z.Gy))throw Error("bad curve params: generator point");let v=Q.mul(Q.pow(z.a,C$),_Q),q0=Q.mul(Q.sqr(z.b),BigInt(27));if(Q.is0(Q.add(v,q0)))throw Error("bad curve params: a or b");function _(W,A,M=!1){if(!Q.isValid(A)\|\|M&&Q.is0(A))throw Error(`bad point coordinate ${W}`);return A}function i(W){if(!(W instanceof k))throw Error("ProjectivePoint expected")}function l(W){if(!j\|\|!j.basises)throw Error("no endo");return bQ(W,j.basises,G.ORDER)}let a=m$((W,A)=>{let{X:M,Y:T,Z:U}=W;if(Q.eql(U,Q.ONE))return{x:M,y:T};let D=W.is0();if(A==null)A=D?Q.ONE:Q.inv(U);let H=Q.mul(M,A),O=Q.mul(T,A),C=Q.mul(U,A);if(D)return{x:Q.ZERO,y:Q.ZERO};if(!Q.eql(C,Q.ONE))throw Error("invZ was invalid");return{x:H,y:O}}),V0=m$((W)=>{if(W.is0()){if(J.allowInfinityPoint&&!Q.is0(W.Y))return;throw Error("bad point: ZERO")}let{x:A,y:M}=W.toAffine();if(!Q.isValid(A)\|\|!Q.isValid(M))throw Error("bad point: x or y not field elements");if(!f(A,M))throw Error("bad point: equation left != right");if(!W.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function e(W,A,M,T,U){return M=new k(Q.mul(M.X,W),M.Y,M.Z),A=n0(T,A),M=n0(U,M),A.add(M)}class k{constructor(W,A,M){this.X=_("x",W),this.Y=_("y",A,!0),this.Z=_("z",M),Object.freeze(this)}static CURVE(){return z}static fromAffine(W){let{x:A,y:M}=W\|\|{};if(!W\|\|!Q.isValid(A)\|\|!Q.isValid(M))throw Error("invalid affine point");if(W instanceof k)throw Error("projective point not allowed");if(Q.is0(A)&&Q.is0(M))return k.ZERO;return new k(A,M,Q.ONE)}static fromBytes(W){let A=k.fromAffine(B(T0(W,void 0,"point")));return A.assertValidity(),A}static fromHex(W){return k.fromBytes(m("pointHex",W))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(W=8,A=!0){if(S.createCache(this,W),!A)this.multiply(C$);return this}assertValidity(){V0(this)}hasEvenY(){let{y:W}=this.toAffine();if(!Q.isOdd)throw Error("Field doesn't support isOdd");return!Q.isOdd(W)}equals(W){i(W);let{X:A,Y:M,Z:T}=this,{X:U,Y:D,Z:H}=W,O=Q.eql(Q.mul(A,H),Q.mul(U,T)),C=Q.eql(Q.mul(M,H),Q.mul(D,T));return O&&C}negate(){return new k(this.X,Q.neg(this.Y),this.Z)}double(){let{a:W,b:A}=z,M=Q.mul(A,C$),{X:T,Y:U,Z:D}=this,H=Q.ZERO,O=Q.ZERO,C=Q.ZERO,R=Q.mul(T,T),g=Q.mul(U,U),I=Q.mul(D,D),L=Q.mul(T,U);return L=Q.add(L,L),C=Q.mul(T,D),C=Q.add(C,C),H=Q.mul(W,C),O=Q.mul(M,I),O=Q.add(H,O),H=Q.sub(g,O),O=Q.add(g,O),O=Q.mul(H,O),H=Q.mul(L,H),C=Q.mul(M,C),I=Q.mul(W,I),L=Q.sub(R,I),L=Q.mul(W,L),L=Q.add(L,C),C=Q.add(R,R),R=Q.add(C,R),R=Q.add(R,I),R=Q.mul(R,L),O=Q.add(O,R),I=Q.mul(U,D),I=Q.add(I,I),R=Q.mul(I,L),H=Q.sub(H,R),C=Q.mul(I,g),C=Q.add(C,C),C=Q.add(C,C),new k(H,O,C)}add(W){i(W);let{X:A,Y:M,Z:T}=this,{X:U,Y:D,Z:H}=W,O=Q.ZERO,C=Q.ZERO,R=Q.ZERO,g=z.a,I=Q.mul(z.b,C$),L=Q.mul(A,U),P=Q.mul(M,D),E=Q.mul(T,H),b=Q.add(A,M),y=Q.add(U,D);b=Q.mul(b,y),y=Q.add(L,P),b=Q.sub(b,y),y=Q.add(A,T);let u=Q.add(U,H);return y=Q.mul(y,u),u=Q.add(L,E),y=Q.sub(y,u),u=Q.add(M,T),O=Q.add(D,H),u=Q.mul(u,O),O=Q.add(P,E),u=Q.sub(u,O),R=Q.mul(g,y),O=Q.mul(I,E),R=Q.add(O,R),O=Q.sub(P,R),R=Q.add(P,R),C=Q.mul(O,R),P=Q.add(L,L),P=Q.add(P,L),E=Q.mul(g,E),y=Q.mul(I,y),P=Q.add(P,E),E=Q.sub(L,E),E=Q.mul(g,E),y=Q.add(y,E),L=Q.mul(P,y),C=Q.add(C,L),L=Q.mul(u,y),O=Q.mul(b,O),O=Q.sub(O,L),L=Q.mul(b,P),R=Q.mul(u,R),R=Q.add(R,L),new k(O,C,R)}subtract(W){return this.add(W.negate())}is0(){return this.equals(k.ZERO)}multiply(W){let{endo:A}=J;if(!G.isValidNot0(W))throw Error("invalid scalar: out of range");let M,T,U=(D)=>S.cached(this,D,(H)=>V$(k,H));if(A){let{k1neg:D,k1:H,k2neg:O,k2:C}=l(W),{p:R,f:g}=U(H),{p:I,f:L}=U(C);T=g.add(L),M=e(A.beta,R,I,D,O)}else{let{p:D,f:H}=U(W);M=D,T=H}return V$(k,[M,T])[0]}multiplyUnsafe(W){let{endo:A}=J,M=this;if(!G.isValid(W))throw Error("invalid scalar: out of range");if(W===M0\|\|M.is0())return k.ZERO;if(W===g0)return M;if(S.hasCache(this))return this.multiply(W);if(A){let{k1neg:T,k1:U,k2neg:D,k2:H}=l(W),{p1:O,p2:C}=P8(k,M,U,H);return e(A.beta,O,C,T,D)}else return S.unsafe(M,W)}multiplyAndAddUnsafe(W,A,M){let T=this.multiplyUnsafe(A).add(W.multiplyUnsafe(M));return T.is0()?void 0:T}toAffine(W){return a(this,W)}isTorsionFree(){let{isTorsionFree:W}=J;if(Y===g0)return!0;if(W)return W(k,this);return S.unsafe(this,Z).is0()}clearCofactor(){let{clearCofactor:W}=J;if(Y===g0)return this;if(W)return W(k,this);return this.multiplyUnsafe(Y)}isSmallOrder(){return this.multiplyUnsafe(Y).is0()}toBytes(W=!0){return o0(W,"isCompressed"),this.assertValidity(),K(k,this,W)}toHex(W=!0){return U0(this.toBytes(W))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(W=!0){return this.toBytes(W)}_setWindowSize(W){this.precompute(W)}static normalizeZ(W){return V$(k,W)}static msm(W,A){return E8(k,G,W,A)}static fromPrivateKey(W){return k.BASE.multiply(A0(G,W))}}k.BASE=new k(z.Gx,z.Gy,Q.ONE),k.ZERO=new k(Q.ZERO,Q.ONE,Q.ZERO),k.Fp=Q,k.Fn=G;let G0=G.BITS,S=new o$(k,J.endo?Math.ceil(G0/2):G0);return k.BASE.precompute(8),k}function g8($){return Uint8Array.of($?2:3)}function y8($,J){return{secretKey:J.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2$.BYTES,publicKeyHasPrefix:!0,signature:2J.BYTES}}function yQ($,J={}){let{Fn:q}=$,Q=J.randomBytes\|\|I0,G=Object.assign(y8($.Fp,q),{seed:c$(q.ORDER)});function z(K){try{return!!A0(q,K)}catch(B){return!1}}function Y(K,B){let{publicKey:w,publicKeyUncompressed:f}=G;try{let v=K.length;if(B===!0&&v!==w)return!1;if(B===!1&&v!==f)return!1;return!!$.fromBytes(K)}catch(v){return!1}}function Z(K=Q(G.seed)){return N$(T0(K,G.seed,"seed"),q.ORDER)}function j(K,B=!0){return $.BASE.multiply(A0(q,K)).toBytes(B)}function V(K){let B=Z(K);return{secretKey:B,publicKey:j(B)}}function N(K){if(typeof K==="bigint")return!1;if(K instanceof $)return!0;let{secretKey:B,publicKey:w,publicKeyUncompressed:f}=G;if(q.allowedLengths\|\|B===w)return;let v=m("key",K).length;return v===w\|\|v===f}function x(K,B,w=!0){if(N(K)===!0)throw Error("first arg must be private key");if(N(B)===!1)throw Error("second arg must be public key");let f=A0(q,K);return $.fromHex(B).multiply(f).toBytes(w)}return Object.freeze({getPublicKey:j,getSharedSecret:x,keygen:V,Point:$,utils:{isValidSecretKey:z,isValidPublicKey:Y,randomSecretKey:Z,isValidPrivateKey:z,randomPrivateKey:Z,normPrivateKeyToScalar:(K)=>A0(q,K),precompute(K=8,B=$.BASE){return B.precompute(K,!1)}},lengths:G})}function uQ($,J,q={}){Z$(J),a0(q,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});let Q=q.randomBytes\|\|I0,G=q.hmac\|\|((M,...T)=>v$(J,M,d(...T))),{Fp:z,Fn:Y}=$,{ORDER:Z,BITS:j}=Y,{keygen:V,getPublicKey:N,getSharedSecret:x,utils:X,lengths:K}=yQ($,q),B={prehash:!1,lowS:typeof q.lowS==="boolean"?q.lowS:!1,format:void 0,extraEntropy:!1},w="compact";function f(M){let T=Z>>g0;return M>T}function v(M,T){if(!Y.isValidNot0(T))throw Error(`invalid signature ${M}: out of range 1..Point.Fn.ORDER`);return T}function q0(M,T){i$(T);let U=K.signature,D=T==="compact"?U:T==="recovered"?U+1:void 0;return T0(M,D,`${T} signature`)}class _{constructor(M,T,U){if(this.r=v("r",M),this.s=v("s",T),U!=null)this.recovery=U;Object.freeze(this)}static fromBytes(M,T=w){q0(M,T);let U;if(T==="der"){let{r:C,s:R}=D0.toSig(T0(M));return new _(C,R)}if(T==="recovered")U=M[0],T="compact",M=M.subarray(1);let D=Y.BYTES,H=M.subarray(0,D),O=M.subarray(D,D2);return new _(Y.fromBytes(H),Y.fromBytes(O),U)}static fromHex(M,T){return this.fromBytes(k0(M),T)}addRecoveryBit(M){return new _(this.r,this.s,M)}recoverPublicKey(M){let T=z.ORDER,{r:U,s:D,recovery:H}=this;if(H==null\|\|![0,1,2,3].includes(H))throw Error("recovery id invalid");if(Z_8<T&&H>1)throw Error("recovery id is ambiguous for h>1 curve");let C=H===2\|\|H===3?U+Z:U;if(!z.isValid(C))throw Error("recovery id 2 or 3 invalid");let R=z.toBytes(C),g=$.fromBytes(d(g8((H&1)===0),R)),I=Y.inv(C),L=l(m("msgHash",M)),P=Y.create(-LI),E=Y.create(DI),b=$.BASE.multiplyUnsafe(P).add(g.multiplyUnsafe(E));if(b.is0())throw Error("point at infinify");return b.assertValidity(),b}hasHighS(){return f(this.s)}toBytes(M=w){if(i$(M),M==="der")return k0(D0.hexFromSig(this));let T=Y.toBytes(this.r),U=Y.toBytes(this.s);if(M==="recovered"){if(this.recovery==null)throw Error("recovery bit must be present");return d(Uint8Array.of(this.recovery),T,U)}return d(T,U)}toHex(M){return U0(this.toBytes(M))}assertValidity(){}static fromCompact(M){return _.fromBytes(m("sig",M),"compact")}static fromDER(M){return _.fromBytes(m("sig",M),"der")}normalizeS(){return this.hasHighS()?new _(this.r,Y.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return U0(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return U0(this.toBytes("compact"))}}let i=q.bits2int\|\|function(T){if(T.length>8192)throw Error("input is too large");let U=K0(T),D=T.length8-j;return D>0?U>>BigInt(D):U},l=q.bits2int_modN\|\|function(T){return Y.create(i(T))},a=H0(j);function V0(M){return M8("num < 2^"+j,M,M0,a),Y.toBytes(M)}function e(M,T){return T0(M,void 0,"message"),T?T0(J(M),void 0,"prehashed message"):M}function k(M,T,U){if(["recovered","canonical"].some((E)=>(E in U)))throw Error("sign() legacy options not supported");let{lowS:D,prehash:H,extraEntropy:O}=p$(U,B);M=e(M,H);let C=l(M),R=A0(Y,T),g=[V0(R),V0(C)];if(O!=null&&O!==!1){let E=O===!0?Q(K.secretKey):O;g.push(m("extraEntropy",E))}let I=d(...g),L=C;function P(E){let b=i(E);if(!Y.isValidNot0(b))return;let y=Y.inv(b),u=$.BASE.multiply(b).toAffine(),F=Y.create(u.x);if(F===M0)return;let n=Y.create(yY.create(L+FR));if(n===M0)return;let z0=(u.x===F?0:2)\|Number(u.y&g0),r=n;if(D&&f(n))r=Y.neg(n),z0^=1;return new _(F,r,z0)}return{seed:I,k2sig:P}}function G0(M,T,U={}){M=m("message",M);let{seed:D,k2sig:H}=k(M,T,U);return W8(J.outputLen,Y.BYTES,G)(D,H)}function S(M){let T=void 0,U=typeof M==="string"\|\|w0(M),D=!U&&M!==null&&typeof M==="object"&&typeof M.r==="bigint"&&typeof M.s==="bigint";if(!U&&!D)throw Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(D)T=new _(M.r,M.s);else if(U){try{T=_.fromBytes(m("sig",M),"der")}catch(H){if(!(H instanceof D0.Err))throw H}if(!T)try{T=_.fromBytes(m("sig",M),"compact")}catch(H){return!1}}if(!T)return!1;return T}function W(M,T,U,D={}){let{lowS:H,prehash:O,format:C}=p$(D,B);if(U=m("publicKey",U),T=e(m("message",T),O),"strict"in D)throw Error("options.strict was renamed to lowS");let R=C===void 0?S(M):_.fromBytes(m("sig",M),C);if(R===!1)return!1;try{let g=$.fromBytes(U);if(H&&R.hasHighS())return!1;let{r:I,s:L}=R,P=l(T),E=Y.inv(L),b=Y.create(PE),y=Y.create(IE),u=$.BASE.multiplyUnsafe(b).add(g.multiplyUnsafe(y));if(u.is0())return!1;return Y.create(u.x)===I}catch(g){return!1}}function A(M,T,U={}){let{prehash:D}=p$(U,B);return T=e(T,D),_.fromBytes(M,"recovered").recoverPublicKey(T).toBytes()}return Object.freeze({keygen:V,getPublicKey:N,getSharedSecret:x,utils:X,lengths:K,Point:$,sign:G0,verify:W,recoverPublicKey:A,Signature:_,hash:J})}function mQ($){let J={a:$.a,b:$.b,p:$.Fp.ORDER,n:$.n,h:$.h,Gx:$.Gx,Gy:$.Gy},q=$.Fp,Q=$.allowedPrivateKeyLengths?Array.from(new Set($.allowedPrivateKeyLengths.map((Y)=>Math.ceil(Y/2)))):void 0,G=O0(J.n,{BITS:$.nBitLength,allowedLengths:Q,modFromBytes:$.wrapPrivateKey}),z={Fp:q,Fn:G,allowInfinityPoint:$.allowInfinityPoint,endo:$.endo,isTorsionFree:$.isTorsionFree,clearCofactor:$.clearCofactor,fromBytes:$.fromBytes,toBytes:$.toBytes};return{CURVE:J,curveOpts:z}}function FQ($){let{CURVE:J,curveOpts:q}=mQ($),Q={hmac:$.hmac,randomBytes:$.randomBytes,lowS:$.lowS,bits2int:$.bits2int,bits2int_modN:$.bits2int_modN};return{CURVE:J,curveOpts:q,hash:$.hash,ecdsaOpts:Q}}function hQ($,J){let q=J.Point;return Object.assign({},J,{ProjectivePoint:q,CURVE:Object.assign({},$,W$(q.Fn.ORDER,q.Fn.BITS))})}function u8($){let{CURVE:J,curveOpts:q,hash:Q,ecdsaOpts:G}=FQ($),z=gQ(J,q),Y=uQ(z,Q,G);return hQ($,Y)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function m8($,J){let q=(Q)=>u8({...$,hash:Q});return{...q(J),create:q}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var y0={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},cQ={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},lQ=BigInt(0),F8=BigInt(1),a$=BigInt(2);function dQ($){let J=y0.p,q=BigInt(3),Q=BigInt(6),G=BigInt(11),z=BigInt(22),Y=BigInt(23),Z=BigInt(44),j=BigInt(88),V=$$$%J,N=VV$%J,x=p(N,q,J)N%J,X=p(x,q,J)N%J,K=p(X,a$,J)V%J,B=p(K,G,J)K%J,w=p(B,z,J)B%J,f=p(w,Z,J)w%J,v=p(f,j,J)f%J,q0=p(v,Z,J)w%J,_=p(q0,q,J)N%J,i=p(_,Y,J)B%J,l=p(i,Q,J)V%J,a=p(l,a$,J);if(!T$.eql(T$.sqr(a),$))throw Error("Cannot find square root");return a}var T$=O0(y0.p,{sqrt:dQ}),l8=m8({...y0,Fp:T$,lowS:!0,endo:cQ},K$),h8={};function H$($,...J){let q=h8[$];if(q===void 0){let Q=K$(j$($));q=d(Q,Q),h8[$]=q}return K$(d(q,...J))}var s$=($)=>$.toBytes(!0).slice(1),u0=(()=>l8.Point)(),t$=($)=>$%a$===lQ;function n$($){let{Fn:J,BASE:q}=u0,Q=A0(J,$),G=q.multiply(Q);return{scalar:t$(G.y)?Q:J.neg(Q),bytes:s$(G)}}function d8($){let J=T$;if(!J.isValidNot0($))throw Error("invalid x: Fail if x ≥ p");let q=J.create($$),Q=J.create(q$+BigInt(7)),G=J.sqrt(Q);if(!t$(G))G=J.neg(G);let z=u0.fromAffine({x:$,y:G});return z.assertValidity(),z}var s0=K0;function r8(...$){return u0.Fn.create(s0(H$("BIP0340/challenge",...$)))}function c8($){return n$($).bytes}function rQ($,J,q=I0(32)){let{Fn:Q}=u0,G=m("message",$),{bytes:z,scalar:Y}=n$(J),Z=m("auxRand",q,32),j=Q.toBytes(Y^s0(H$("BIP0340/aux",Z))),V=H$("BIP0340/nonce",j,z,G),{bytes:N,scalar:x}=n$(V),X=r8(N,z,G),K=new Uint8Array(64);if(K.set(N,0),K.set(Q.toBytes(Q.create(x+XY)),32),!o8(K,G,z))throw Error("sign: Invalid signature produced");return K}function o8($,J,q){let{Fn:Q,BASE:G}=u0,z=m("signature",$,64),Y=m("message",J),Z=m("publicKey",q,32);try{let j=d8(s0(Z)),V=s0(z.subarray(0,32));if(!i0(V,F8,y0.p))return!1;let N=s0(z.subarray(32,64));if(!i0(N,F8,y0.n))return!1;let x=r8(Q.toBytes(V),s$(j),Y),X=G.multiplyUnsafe(N).add(j.multiplyUnsafe(Q.neg(x))),{x:K,y:B}=X.toAffine();if(X.is0()\|\|!t$(B)\|\|K!==V)return!1;return!0}catch(j){return!1}}var O$=(()=>{let q=(G=I0(48))=>{return N$(G,y0.n)};l8.utils.randomSecretKey;function Q(G){let z=q(G);return{secretKey:z,publicKey:c8(z)}}return{keygen:Q,getPublicKey:c8,sign:rQ,verify:o8,Point:u0,utils:{randomSecretKey:q,randomPrivateKey:q,taggedHash:H$,lift_x:d8,pointToBytes:s$,numberToBytesBE:b0,bytesToNumberBE:K0,mod:o},lengths:{secretKey:32,publicKey:32,publicKeyHasPrefix:!1,signature:64,seed:48}}})();var oQ=new TextEncoder,pQ=new TextDecoder,X0=($)=>oQ.encode($),E0=($)=>pQ.decode($),A$=($)=>Array.from($,(J)=>J.toString(16).padStart(2,"0")).join(""),t=JSON.stringify,f0=JSON.parse,B$=($,J=Number.MAX_SAFE_INTEGER)=>$.split("").reduce((q,Q)=>q+Q.charCodeAt(0),0)%J;var e$="AES-GCM",iQ={},p8="$",i8=",",aQ=($)=>{let J=new Uint8Array($),q=32768,Q="";for(let G=0;G<J.length;G+=32768)Q+=String.fromCharCode(...J.subarray(G,G+32768));return btoa(Q)},nQ=($)=>Uint8Array.from(atob($),(J)=>J.charCodeAt(0)).buffer,t0=($)=>iQ[$]??=crypto.subtle.digest("SHA-1",X0($)).then((J)=>{let q=new Uint8Array(J),Q="";for(let G of q)Q+=G.toString(36);return Q}),a8=async($,J,q)=>{let Q=await crypto.subtle.digest("SHA-256",X0(`${$}:${J}:${q}`));return crypto.subtle.importKey("raw",Q,{name:e$},!1,["encrypt","decrypt"])},n8=async($,J)=>{let q=crypto.getRandomValues(new Uint8Array(12)),Q=await $,G=await crypto.subtle.encrypt({name:e$,iv:q},Q,X0(J));return`${q.join(i8)}${p8}${aQ(G)}`},s8=async($,J)=>{let[q,Q]=J.split(p8);if(!q\|\|!Q)throw Error("Invalid encrypted payload format");let G=Uint8Array.from(q.split(i8),Number),z=await $,Y=await crypto.subtle.decrypt({name:e$,iv:G},z,nQ(Q));return E0(Y)};var e0="GenosRTC",m0=($,J)=>Array.from({length:$},J);var $$=($)=>Array.from(crypto.getRandomValues(new Uint8Array($)),(J)=>"0123456789AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz"[J%62]).join(""),W0=$$(20),N0=Promise.all.bind(Promise),t8=typeof window<"u",{entries:e8,fromEntries:R$,keys:J9}=Object,$Q=()=>{},J0=($)=>Error(`GenosRTC: ${$}`),Q$=(...$)=>$.join("@"),QQ=($,J)=>{let q=[...$],Q=q.length,G=()=>{let z=Math.sin(J++)1e4;return z-Math.floor(z)};while(Q){let z=Math.floor(G()Q--);[q[Q],q[z]]=[q[z],q[Q]]}return q};var sQ=5000,JQ="icegatheringstatechange",qQ="offer",tQ="answer",eQ=[...m0(3,($,J)=>`stun:stun${J\|\|""}.l.google.com:19302`),"stun:stun.cloudflare.com:3478"].map(($)=>({urls:$})),x$=($,{rtcConfig:J,rtcPolyfill:q,turnConfig:Q})=>{let G=new(q\|\|RTCPeerConnection)({iceServers:[...eQ,...Q\|\|[]],...J}),z={},Y=!1,Z=!1,j,V=(X)=>Object.assign(X,{binaryType:"arraybuffer",bufferedAmountLowThreshold:65535,onmessage:(K)=>z.data?.(K.data),onopen:()=>z.connect?.(),onclose:()=>z.close?.(),onerror:(K)=>!K?.error?.message?.includes("User-Initiated Abort")&&z.error?.(K)}),N=()=>Promise.race([new Promise((X)=>{let K=()=>{if(G.iceGatheringState==="complete")G.removeEventListener(JQ,K),X()};G.addEventListener(JQ,K),K()}),new Promise((X)=>setTimeout(X,sQ))]).then(()=>({type:G.localDescription.type,sdp:G.localDescription.sdp.replace(/a=ice-options:trickle\s\n/g,"")}));if($?V(j=G.createDataChannel("data")):G.ondatachannel=({channel:X})=>V(j=X),G.onnegotiationneeded=async()=>{try{Y=!0,await G.setLocalDescription(),z.signal?.(await N())}catch(X){z.error?.(X)}finally{Y=!1}},G.onconnectionstatechange=()=>{if(["disconnected","failed","closed"].includes(G.connectionState))z.close?.()},G.ontrack=(X)=>{z.track?.(X.track,X.streams[0]),z.stream?.(X.streams[0])},G.onremovestream=(X)=>z.stream?.(X.stream),$&&!G.canTrickleIceCandidates)G.onnegotiationneeded();let x=()=>G.getSenders();return{created:Date.now(),connection:G,get channel(){return j},get isDead(){return G.connectionState==="closed"},async signal(X){if(j?.readyState==="open"&&!X.sdp?.includes("a=rtpmap"))return;try{if(X.type===qQ){if(Y\|\|G.signalingState!=="stable"&&!Z){if($)return;await N0([G.setLocalDescription({type:"rollback"}),G.setRemoteDescription(X)])}else await G.setRemoteDescription(X);await G.setLocalDescription();let K=await N();return z.signal?.(K),K}if(X.type===tQ){Z=!0;try{await G.setRemoteDescription(X)}finally{Z=!1}}}catch(K){z.error?.(K)}},sendData:(X)=>j.send(X),destroy:()=>{j?.close(),G.close(),Y=Z=!1},setHandlers:(X)=>Object.assign(z,X),offerPromise:$?new Promise((X)=>z.signal=(K)=>K.type===qQ&&X(K)):Promise.resolve(),addStream:(X)=>X.getTracks().forEach((K)=>G.addTrack(K,X)),removeStream:(X)=>x().filter((K)=>X.getTracks().includes(K.track)).forEach((K)=>G.removeTrack(K)),addTrack:(X,K)=>G.addTrack(X,K),removeTrack:(X)=>{let K=x().find((B)=>B.track===X);if(K)G.removeTrack(K)},replaceTrack:(X,K)=>x().find((B)=>B.track===X)?.replaceTrack(K)}};var $J=Object.getPrototypeOf(Uint8Array),L$=12,GQ=0,k$=GQ+L$,I$=k$+1,q$=I$+1,G$=q$+1,J$=16384-G$,w$=255,$8="bufferedamountlow",F0=($)=>`@_${$}`,Q8=100,QJ=3,JJ=200,zQ=($,J,q)=>{let Q=new Map,G=new Map,z=new Map,Y={},Z={},j={},V={},N=new Map,x=(U,D)=>{if(!N.has(U))N.set(U,new Set);N.get(U).add(D)},X=(U,D)=>N.get(U)?.delete(D),K=(U,...D)=>N.get(U)?.forEach((H)=>H(...D)),B=(U,D)=>{let H=U?Array.isArray(U)?U:[U]:Q.keys();return Array.from(H,(O)=>{let C=Q.get(O);if(!C)return null;return D(O,C)}).filter(Boolean)},w=(U)=>{if(!Q.has(U))return;Q.delete(U),delete Y[U],delete Z[U],delete j[U],delete V[U],K("peer:leave",U),J(U)},f=(U)=>new Promise((D,H)=>{let O=setTimeout(()=>{U.removeEventListener($8,C),H(Error(`${e0}: bufferLow timeout`))},5000);function C(){clearTimeout(O),U.removeEventListener($8,C),D()}U.addEventListener($8,C)}),v=(U)=>{if(z.has(U))return z.get(U);if(!U)throw J0("action type is required");let D=X0(U);if(D.byteLength>L$)throw J0(`❌ "${U}" exceeds ${L$} bytes. Use a shorter name.`);let H=new Uint8Array(L$).map((P,E)=>D[E]\|\|0),O=0,C=new Map([["message",new Set],["progress",new Set]]),R=(P,E)=>C.get(P)?.add(E),g=(P,E)=>C.get(P)?.delete(E),I=async(P,E,b,y)=>{if(b&&typeof b!=="object")throw J0("meta must be object");if(P===void 0)throw J0("data cannot be undefined");let u=P instanceof Blob,F=u\|\|P instanceof ArrayBuffer\|\|P instanceof $J,n=typeof P!=="string";if(b&&!F)throw J0("meta only allowed with binary");let z0=F?new Uint8Array(u?await P.arrayBuffer():P):X0(n?t(P):P),r=b?X0(t(b)):null,s=Math.ceil(z0.byteLength/J$)+(b?1:0)\|\|1;if(s>Q8)throw J0(`Message too large, exceeds max chunks ${Q8}`);let G8=m0(s,(Y$,Y0)=>{let c0=Y0===s-1,B0=b&&Y0===0,X$=B0?r:z0.subarray(b?(Y0-1)J$:Y0J$,b?Y0J$:(Y0+1)J$),R0=new Uint8Array(G$+X$.byteLength);return R0.set(H),R0.set([O],k$),R0.set([c0\|B0<<1\|F<<2\|n<<3],I$),R0.set([Math.round((Y0+1)/sw$)],q$),R0.set(X$,G$),R0});return O=O+1&w$,N0(B(E,async(Y$,Y0)=>{let{channel:c0}=Y0;for(let B0=0;B0<s;B0++){let X$=0;while(c0.bufferedAmount>c0.bufferedAmountLowThreshold){if(X$++>QJ)throw J0(`${e0}: send buffer full, max retries reached for peer ${Y$}`);try{await f(c0)}catch(R0){await new Promise((AQ)=>setTimeout(AQ,JJ))}}if(!Q.has(Y$))break;Y0.sendData(G8[B0]),y?.(G8[B0][q$]/w$,Y$,b)}}))};G.set(U,{listeners:C,send:I});let L={send:I,on:R,off:g};return z.set(U,L),L},q0=(U,D)=>{try{let H=new Uint8Array(D),O=E0(H.subarray(GQ,k$)).replace(//g,"");if(!G.has(O))return;let[C]=H.subarray(k$,I$),[R]=H.subarray(I$,q$),[g]=H.subarray(q$,G$),I=H.subarray(G$),L=Boolean(R&1),P=Boolean(R&2),E=Boolean(R&4),b=Boolean(R&8),y=G.get(O),u=(Y[U]\|\|={})[O]\|\|={};if(u[C]?.chunks?.length>Q8)return;let F=u[C]\|\|={chunks:[]};if(P)try{F.meta=f0(E0(I))}catch{return}else F.chunks.push(I);if(y.listeners.get("progress").forEach((r)=>{try{r(g/w$,U,F.meta)}catch(s){}}),!L)return;let n=new Uint8Array(F.chunks.reduce((r,s)=>r+s.byteLength,0));F.chunks.reduce((r,s)=>(n.set(s,r),r+s.byteLength),0),delete u[C];let z0;if(E)z0=n;else if(b)try{z0=f0(E0(n))}catch{return}else z0=E0(n);y.listeners.get("message").forEach((r)=>{try{r(z0,U,F.meta)}catch(s){}})}catch(H){}},_=async()=>{try{await M(""),await new Promise((U)=>setTimeout(U,99))}catch(U){}for(let[U,D]of Q){try{D.destroy()}catch{}Q.delete(U)}q()},{send:i,on:l}=v(F0("ping")),{send:a,on:V0}=v(F0("pong")),{send:e,on:k}=v(F0("signal")),{send:G0,on:S}=v(F0("stream")),{send:W,on:A}=v(F0("track")),{send:M,on:T}=v(F0("leave"));if($((U,D)=>{if(Q.has(D))return;Q.set(D,U),U.setHandlers({data:(H)=>q0(D,H),stream:(H)=>{K("stream:add",H,D,j[D]),delete j[D]},track:(H,O)=>{K("track:add",H,O,D,V[D]),delete V[D]},signal:(H)=>e(H,D),close:()=>w(D),error:(H)=>{w(D)}}),K("peer:join",D)}),l("message",(U,D)=>a("",D)),V0("message",(U,D)=>{Z[D]?.(),delete Z[D]}),k("message",(U,D)=>Q.get(D)?.signal(U)),S("message",(U,D)=>j[D]=U),A("message",(U,D)=>V[D]=U),T("message",(U,D)=>w(D)),t8)addEventListener("beforeunload",_);return{on:x,off:X,channel:v,leave:_,ping:async(U)=>{if(!U)throw J0("ping() requires target peer ID");let D=Date.now();return i("",U),await new Promise((H)=>Z[U]=H),Date.now()-D},getPeers:()=>R$(Array.from(Q,([U,D])=>[U,D.connection])),addStream:(U,D,H)=>B(D,async(O,C)=>{if(H)await G0(H,O);C.addStream(U)}),removeStream:(U,D)=>B(D,(H,O)=>O.removeStream(U)),addTrack:(U,D,H,O)=>B(H,async(C,R)=>{if(O)await W(O,C);R.addTrack(U,D)}),removeTrack:(U,D)=>B(D,(H,O)=>O.removeTrack(U)),replaceTrack:(U,D,H,O)=>B(H,async(C,R)=>{if(O)await W(O,C);R.replaceTrack(U,D)})}};var qJ=20,GJ=2500,YQ=57333,XQ=({init:$,subscribe:J,announce:q})=>{let Q={},G=!1,z,Y;return(Z,j,V)=>{let{appId:N}=Z;if(Q[N]?.[j])return Q[N][j];if(!Z\|\|!j\|\|!N&&!Z.firebaseApp)throw J0(!Z?"config required":!j?"roomId required":"appId missing");let x=$Q;if(!G){let S=$(Z);Y=m0(qJ,()=>x$(!0,Z)),z=Array.isArray(S)?S:[S];let W=setInterval(()=>{Y=Y.filter((A)=>{let M=Date.now()-A.created<YQ;if(!M)A.destroy();return M})},YQ);Q.offerCleanupTimer\|\|=W,G=!0}let X={},K={},B=Q$(e0,N,j),w=t0(B),f=t0(Q$(B,W0)),v=a8(Z.password\|\|"",N,j),q0=(S)=>async(W)=>({type:W.type,sdp:await S(v,W.sdp)}),_=q0(s8),i=q0(n8),l=(S,W)=>{if(K[W]===S)return;K[W]?.destroy(),K[W]=S,x(S,W),X[W]?.forEach((A)=>A!==S&&A.destroy()),delete X[W]},a=(S,W)=>{if(K[W]===S)delete K[W]},V0=(S)=>async(W,A,M)=>{let[T,U]=await N0([w,f]);if(W!==T&&W!==U)return;let{peerId:D,offer:H,answer:O}=typeof A==="string"?f0(A):A;if(D===W0\|\|K[D])return;if(H){if(X[D]?.[S]&&W0>D)return;let C=x$(!1,Z);C.setHandlers({connect:()=>l(C,D),close:()=>a(C,D)});try{let R=await _(H);if(C.isDead)return;let[g,I]=await N0([t0(Q$(B,D)),C.signal(R).then(i)]);M(g,t({peerId:W0,answer:I}))}catch{V?.({error:"decryption failed (offer)",appId:N,peerId:D,roomId:j})}}else if(O){let C=X[D]?.[S];if(!C\|\|C.isDead)return;C.setHandlers({connect:()=>l(C,D),close:()=>a(C,D)});try{C.signal(await _(O))}catch{V?.({error:"decryption failed (answer)",appId:N,peerId:D,roomId:j})}}else{if(X[D]?.[S])return;let C=Y.pop()\|\|x$(!0,Z),[R,{offer:g}]=await N0([t0(Q$(B,D)),C.offerPromise.then(i).then((I)=>({offer:I}))]);X[D]\|\|=[],X[D][S]=C,C.setHandlers({connect:()=>l(C,D),close:()=>a(C,D)}),M(R,t({peerId:W0,offer:g,peer:C}))}},e=[],k=[];z.forEach(async(S,W)=>{let A=await S;if(!A)return;let[M,T]=await N0([w,f]);k[W]=J(A,M,T,V0(W));let U=async()=>{let D=await q(A,M,T);e[W]=setTimeout(U,typeof D==="number"?D:GJ)};U()}),Q[N]\|\|={};let G0=zQ((S)=>x=S,(S)=>delete K[S],()=>G0.onCleanup?.());return G0.onCleanup=()=>{if(delete Q[N][j],e.forEach(clearTimeout),k.forEach((S)=>S?.()),Object.keys(Q).length===0)clearInterval(Q.offerCleanupTimer),delete Q.offerCleanupTimer},Q[N][j]=G0}};var ZQ=3333,S$={},UQ={},jQ=($,J)=>{let q={},Q=null,G=()=>{if(Q)clearTimeout(Q),Q=null;let z=new WebSocket($);z.onclose=()=>{S$[$]??=ZQ,Q=setTimeout(G,S$[$]),S$[$]=2},z.onmessage=(Y)=>J(Y.data),q.socket=z,q.url=z.url,q.ready=new Promise((Y)=>{z.onopen=()=>{S$[$]=ZQ,Y(q)}}),q.send=(Y)=>{if(z.readyState===1)z.send(Y)}};return q.forceReconnect=G,G(),UQ[$]=q,q};if(typeof window<"u"){let $=()=>{Object.values(UQ).forEach((J)=>{if(J.socket&&J.socket.readyState!==WebSocket.OPEN&&J.socket.readyState!==WebSocket.CONNECTING)J.forceReconnect()})};window.addEventListener("online",()=>{$()}),window.addEventListener("offline",async()=>{}),document.addEventListener("visibilitychange",()=>{if(document.visibilityState==="visible")$()})}var KQ=($)=>()=>R$(e8($).map(([J,q])=>[J,q.socket])),DQ=($,J,q,Q)=>($.relayUrls??(Q?QQ(J,B$($.appId)):J)).slice(0,$.relayUrls?.length??$.relayRedundancy??q);var h0={},zJ=10,VQ="x",CQ="EVENT",YJ=/pow:\s(\d+)\sbits needed\.?/i,J8=new Set,TQ=O$.utils.randomSecretKey(),XJ=A$(O$.getPublicKey(TQ)),q8={},z$={},ZJ={},HQ=()=>Math.floor(Date.now()/1000),OQ=($)=>ZJ[$]??=B$($,1e4)+20000,P$=($)=>$.replace(/\/$/,""),UJ=["wss://relay.primal.net","wss://ftp.halifax.rwth-aachen.de/nostr","wss://nostr.oxtr.dev","wss://nostr.sathoarder.com","wss://nostr.mom","wss://nos.lol","wss://nostr.vulpem.com","wss://nostr.data.haus","wss://relay.mostro.network","wss://relay.nostrdice.com"],jJ=($,J)=>{let[q,Q,G,z]=f0(J);if(q===CQ)return z$[Q]?.(q8[Q],G.content);if(q==="NOTICE"\|\|q==="OK"&&!G){if(+((q==="NOTICE"?Q:z).match(YJ)?.[1]??0)>0){let Z=P$($);J8.add(Z),h0[Z]?.close?.(),delete h0[Z]}}},KJ=($)=>{let J=P$($);if(h0[J])return h0[J];let q=jQ(J,(Q)=>jJ(J,Q));return h0[J]=q},MQ=async($,J)=>{let q={kind:OQ($),content:J,pubkey:XJ,created_at:HQ(),tags:[[VQ,$]]},Q=X0(t([0,q.pubkey,q.created_at,q.kind,q.tags,q.content])),G=new Uint8Array(await crypto.subtle.digest("SHA-256",Q)),z=O$.sign(G,TQ);return t([CQ,{...q,id:A$(G),sig:A$(z)}])},WQ=($,J)=>{return q8[$]=J,t(["REQ",$,{kinds:[OQ(J)],since:HQ(),["#"+VQ]:[J]}])},NQ=($)=>{return delete q8[$],t(["CLOSE",$])},DJ=XQ({init:($)=>{let q=($?.relayUrls?.length?$.relayUrls:null)??UJ;return DQ($,q,zJ,!1).map(KJ).map((G)=>G.ready.then(()=>G).catch(()=>null))},subscribe:($,J,q,Q)=>{let G=$$(64),z=$$(64);return z$[G]=z$[z]=(Y,Z)=>Q(Y,Z,async(j,V)=>{if(J8.has(P$($.url)))return;$.send(await MQ(j,V))}),$.send(WQ(G,J)),$.send(WQ(z,q)),()=>{$.send(NQ(G)),$.send(NQ(z)),delete z$[G],delete z$[z]}},announce:async($,J)=>{if(J8.has(P$($.url)))return;$.send(await MQ(J,t({peerId:W0})))}}),MJ=KQ(h0);export{W0 as selfId,DJ as join,MJ as getRelaySockets};
1	+ var R$=typeof globalThis==="object"&&"crypto"in globalThis?globalThis.crypto:void 0;/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /function L$($){return $ instanceof Uint8Array\|\|ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function d$($){if(!Number.isSafeInteger($)\|\|$<0)throw Error("positive integer expected, got "+$)}function Q$($,...J){if(!L$($))throw Error("Uint8Array expected");if(J.length>0&&!J.includes($.length))throw Error("Uint8Array expected of length "+J+", got length="+$.length)}function Z0($){if(typeof $!=="function"\|\|typeof $.create!=="function")throw Error("Hash should be wrapped by utils.createHasher");d$($.outputLen),d$($.blockLen)}function b$($,J=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(J&&$.finished)throw Error("Hash#digest() has already been called")}function X8($,J){Q$($);let q=J.outputLen;if($.length<q)throw Error("digestInto() expects output buffer of length at least "+q)}function w$(...$){for(let J=0;J<$.length;J++)$[J].fill(0)}function U0($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function J$($,J){return $<<32-J\|$>>>J}var Z8=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),TQ=Array.from({length:256},($,J)=>J.toString(16).padStart(2,"0"));function j$($){if(Q$($),Z8)return $.toHex();let J="";for(let q=0;q<$.length;q++)J+=TQ[$[q]];return J}var K$={_0:48,_9:57,A:65,F:70,a:97,f:102};function Y8($){if($>=K$._0&&$<=K$._9)return $-K$._0;if($>=K$.A&&$<=K$.F)return $-(K$.A-10);if($>=K$.a&&$<=K$.f)return $-(K$.a-10);return}function I$($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(Z8)return Uint8Array.fromHex($);let J=$.length,q=J/2;if(J%2)throw Error("hex string expected, got unpadded hex of length "+J);let Q=new Uint8Array(q);for(let G=0,z=0;G<q;G++,z+=2){let Y=Y8($.charCodeAt(z)),U=Y8($.charCodeAt(z+1));if(Y===void 0\|\|U===void 0){let K=$[z]+$[z+1];throw Error('hex string expected, got non-hex character "'+K+'" at index '+z)}Q[G]=Y16+U}return Q}function K0($){if(typeof $!=="string")throw Error("string expected");return new Uint8Array(new TextEncoder().encode($))}function o$($){if(typeof $==="string")$=K0($);return Q$($),$}function c(...$){let J=0;for(let Q=0;Q<$.length;Q++){let G=$[Q];Q$(G),J+=G.length}let q=new Uint8Array(J);for(let Q=0,G=0;Q<$.length;Q++){let z=$[Q];q.set(z,G),G+=z.length}return q}class r${}function U8($){let J=(Q)=>$().update(o$(Q)).digest(),q=$();return J.outputLen=q.outputLen,J.blockLen=q.blockLen,J.create=()=>$(),J}function k$($=32){if(R$&&typeof R$.getRandomValues==="function")return R$.getRandomValues(new Uint8Array($));if(R$&&typeof R$.randomBytes==="function")return Uint8Array.from(R$.randomBytes($));throw Error("crypto.getRandomValues must be defined")}function xQ($,J,q,Q){if(typeof $.setBigUint64==="function")return $.setBigUint64(J,q,Q);let G=BigInt(32),z=BigInt(4294967295),Y=Number(q>>G&z),U=Number(q&z),K=Q?4:0,C=Q?0:4;$.setUint32(J+K,Y,Q),$.setUint32(J+C,U,Q)}function K8($,J,q){return $&J^~$&q}function j8($,J,q){return $&J^$&q^J&q}class E0 extends r${constructor($,J,q,Q){super();this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=$,this.outputLen=J,this.padOffset=q,this.isLE=Q,this.buffer=new Uint8Array($),this.view=U0(this.buffer)}update($){b$(this),$=o$($),Q$($);let{view:J,buffer:q,blockLen:Q}=this,G=$.length;for(let z=0;z<G;){let Y=Math.min(Q-this.pos,G-z);if(Y===Q){let U=U0($);for(;Q<=G-z;z+=Q)this.process(U,z);continue}if(q.set($.subarray(z,z+Y),this.pos),this.pos+=Y,z+=Y,this.pos===Q)this.process(J,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){b$(this),X8($,this),this.finished=!0;let{buffer:J,view:q,blockLen:Q,isLE:G}=this,{pos:z}=this;if(J[z++]=128,w$(this.buffer.subarray(z)),this.padOffset>Q-z)this.process(q,0),z=0;for(let N=z;N<Q;N++)J[N]=0;xQ(q,Q-8,BigInt(this.length8),G),this.process(q,0);let Y=U0($),U=this.outputLen;if(U%4)throw Error("_sha2: outputLen should be aligned to 32bit");let K=U/4,C=this.get();if(K>C.length)throw Error("_sha2: outputLen bigger than state");for(let N=0;N<K;N++)Y.setUint32(4N,C[N],G)}digest(){let{buffer:$,outputLen:J}=this;this.digestInto($);let q=$.slice(0,J);return this.destroy(),q}_cloneInto($){$\|\|($=new this.constructor),$.set(...this.get());let{blockLen:J,buffer:q,length:Q,finished:G,destroyed:z,pos:Y}=this;if($.destroyed=z,$.finished=G,$.length=Q,$.pos=Y,Q%J)$.buffer.set(q);return $}clone(){return this._cloneInto()}}var M$=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);var RQ=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]),C$=new Uint32Array(64);class M8 extends E0{constructor($=32){super(64,$,8,!1);this.A=M$[0]\|0,this.B=M$[1]\|0,this.C=M$[2]\|0,this.D=M$[3]\|0,this.E=M$[4]\|0,this.F=M$[5]\|0,this.G=M$[6]\|0,this.H=M$[7]\|0}get(){let{A:$,B:J,C:q,D:Q,E:G,F:z,G:Y,H:U}=this;return[$,J,q,Q,G,z,Y,U]}set($,J,q,Q,G,z,Y,U){this.A=$\|0,this.B=J\|0,this.C=q\|0,this.D=Q\|0,this.E=G\|0,this.F=z\|0,this.G=Y\|0,this.H=U\|0}process($,J){for(let N=0;N<16;N++,J+=4)C$[N]=$.getUint32(J,!1);for(let N=16;N<64;N++){let L=C$[N-15],X=C$[N-2],j=J$(L,7)^J$(L,18)^L>>>3,T=J$(X,17)^J$(X,19)^X>>>10;C$[N]=T+C$[N-7]+j+C$[N-16]\|0}let{A:q,B:Q,C:G,D:z,E:Y,F:U,G:K,H:C}=this;for(let N=0;N<64;N++){let L=J$(Y,6)^J$(Y,11)^J$(Y,25),X=C+L+K8(Y,U,K)+RQ[N]+C$[N]\|0,T=(J$(q,2)^J$(q,13)^J$(q,22))+j8(q,Q,G)\|0;C=K,K=U,U=Y,Y=z+X\|0,z=G,G=Q,Q=q,q=X+T\|0}q=q+this.A\|0,Q=Q+this.B\|0,G=G+this.C\|0,z=z+this.D\|0,Y=Y+this.E\|0,U=U+this.F\|0,K=K+this.G\|0,C=C+this.H\|0,this.set(q,Q,G,z,Y,U,K,C)}roundClean(){w$(C$)}destroy(){this.set(0,0,0,0,0,0,0,0),w$(this.buffer)}}var j0=U8(()=>new M8);class v0 extends r${constructor($,J){super();this.finished=!1,this.destroyed=!1,Z0($);let q=o$(J);if(this.iHash=$.create(),typeof this.iHash.update!=="function")throw Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;let Q=this.blockLen,G=new Uint8Array(Q);G.set(q.length>Q?$.create().update(q).digest():q);for(let z=0;z<G.length;z++)G[z]^=54;this.iHash.update(G),this.oHash=$.create();for(let z=0;z<G.length;z++)G[z]^=106;this.oHash.update(G),w$(G)}update($){return b$(this),this.iHash.update($),this}digestInto($){b$(this),Q$($,this.outputLen),this.finished=!0,this.iHash.digestInto($),this.oHash.update($),this.oHash.digestInto($),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$\|\|($=Object.create(Object.getPrototypeOf(this),{}));let{oHash:J,iHash:q,finished:Q,destroyed:G,blockLen:z,outputLen:Y}=this;return $=$,$.finished=Q,$.destroyed=G,$.blockLen=z,$.outputLen=Y,$.oHash=J._cloneInto($.oHash),$.iHash=q._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var b0=($,J,q)=>new v0($,J).update(q).digest();b0.create=($,J)=>new v0($,J);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var y0=BigInt(0),_0=BigInt(1);function p$($,J=""){if(typeof $!=="boolean"){let q=J&&`"${J}"`;throw Error(q+"expected boolean, got type="+typeof $)}return $}function H$($,J,q=""){let Q=L$($),G=$?.length,z=J!==void 0;if(!Q\|\|z&&G!==J){let Y=q&&`"${q}" `,U=z?` of length ${J}`:"",K=Q?`length=${G}`:`type=${typeof $}`;throw Error(Y+"expected Uint8Array"+U+", got "+K)}return $}function i$($){let J=$.toString(16);return J.length&1?"0"+J:J}function D8($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?y0:BigInt("0x"+$)}function D$($){return D8(j$($))}function g0($){return Q$($),D8(j$(Uint8Array.from($).reverse()))}function f$($,J){return I$($.toString(16).padStart(J2,"0"))}function u0($,J){return f$($,J).reverse()}function m($,J,q){let Q;if(typeof J==="string")try{Q=I$(J)}catch(z){throw Error($+" must be hex string or Uint8Array, cause: "+z)}else if(L$(J))Q=Uint8Array.from(J);else throw Error($+" must be hex string or Uint8Array");let G=Q.length;if(typeof q==="number"&&G!==q)throw Error($+" of length "+q+" expected, got "+G);return Q}var f0=($)=>typeof $==="bigint"&&y0<=$;function a$($,J,q){return f0($)&&f0(J)&&f0(q)&&J<=$&&$<q}function W8($,J,q,Q){if(!a$(J,q,Q))throw Error("expected valid "+$+": "+q+" <= n < "+Q+", got "+J)}function M0($){let J;for(J=0;$>y0;$>>=_0,J+=1);return J}var O$=($)=>(_0<<BigInt($))-_0;function N8($,J,q){if(typeof $!=="number"\|\|$<2)throw Error("hashLen must be a number");if(typeof J!=="number"\|\|J<2)throw Error("qByteLen must be a number");if(typeof q!=="function")throw Error("hmacFn must be a function");let Q=(j)=>new Uint8Array(j),G=(j)=>Uint8Array.of(j),z=Q($),Y=Q($),U=0,K=()=>{z.fill(1),Y.fill(0),U=0},C=(...j)=>q(Y,z,...j),N=(j=Q(0))=>{if(Y=C(G(0),j),z=C(),j.length===0)return;Y=C(G(1),j),z=C()},L=()=>{if(U++>=1000)throw Error("drbg: tried 1000 values");let j=0,T=[];while(j<J){z=C();let w=z.slice();T.push(w),j+=z.length}return c(...T)};return(j,T)=>{K(),N(j);let w=void 0;while(!(w=T(L())))N();return K(),w}}function n$($,J,q={}){if(!$\|\|typeof $!=="object")throw Error("expected valid options object");function Q(G,z,Y){let U=$[G];if(Y&&U===void 0)return;let K=typeof U;if(K!==z\|\|U===null)throw Error(`param "${G}" is invalid: expected ${z}, got ${K}`)}Object.entries(J).forEach(([G,z])=>Q(G,z,!1)),Object.entries(q).forEach(([G,z])=>Q(G,z,!0))}function m0($){let J=new WeakMap;return(q,...Q)=>{let G=J.get(q);if(G!==void 0)return G;let z=$(q,...Q);return J.set(q,z),z}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var l=BigInt(0),h=BigInt(1),S$=BigInt(2),H8=BigInt(3),O8=BigInt(4),B8=BigInt(5),LQ=BigInt(7),A8=BigInt(8),wQ=BigInt(9),T8=BigInt(16);function p($,J){let q=$%J;return q>=l?q:J+q}function i($,J,q){let Q=$;while(J-- >l)Q=Q,Q%=q;return Q}function V8($,J){if($===l)throw Error("invert: expected non-zero number");if(J<=l)throw Error("invert: expected positive modulus, got "+J);let q=p($,J),Q=J,G=l,z=h,Y=h,U=l;while(q!==l){let C=Q/q,N=Q%q,L=G-YC,X=z-UC;Q=q,q=N,G=Y,z=U,Y=L,U=X}if(Q!==h)throw Error("invert: does not exist");return p(G,J)}function F0($,J,q){if(!$.eql($.sqr(J),q))throw Error("Cannot find square root")}function x8($,J){let q=($.ORDER+h)/O8,Q=$.pow(J,q);return F0($,Q,J),Q}function IQ($,J){let q=($.ORDER-B8)/A8,Q=$.mul(J,S$),G=$.pow(Q,q),z=$.mul(J,G),Y=$.mul($.mul(z,S$),G),U=$.mul(z,$.sub(Y,$.ONE));return F0($,U,J),U}function kQ($){let J=B$($),q=R8($),Q=q(J,J.neg(J.ONE)),G=q(J,Q),z=q(J,J.neg(Q)),Y=($+LQ)/T8;return(U,K)=>{let C=U.pow(K,Y),N=U.mul(C,Q),L=U.mul(C,G),X=U.mul(C,z),j=U.eql(U.sqr(N),K),T=U.eql(U.sqr(L),K);C=U.cmov(C,N,j),N=U.cmov(X,L,T);let w=U.eql(U.sqr(N),K),v=U.cmov(C,N,w);return F0(U,v,K),v}}function R8($){if($<H8)throw Error("sqrt is not defined for small field");let J=$-h,q=0;while(J%S$===l)J/=S$,q++;let Q=S$,G=B$($);while(C8(G,Q)===1)if(Q++>1000)throw Error("Cannot find square root: probably non-prime P");if(q===1)return x8;let z=G.pow(Q,J),Y=(J+h)/S$;return function(K,C){if(K.is0(C))return C;if(C8(K,C)!==1)throw Error("Cannot find square root");let N=q,L=K.mul(K.ONE,z),X=K.pow(C,J),j=K.pow(C,Y);while(!K.eql(X,K.ONE)){if(K.is0(X))return K.ZERO;let T=1,w=K.sqr(X);while(!K.eql(w,K.ONE))if(T++,w=K.sqr(w),T===N)throw Error("Cannot find square root");let v=h<<BigInt(N-T-1),b=K.pow(L,v);N=T,L=K.sqr(b),X=K.mul(X,L),j=K.mul(j,b)}return j}}function SQ($){if($%O8===H8)return x8;if($%A8===B8)return IQ;if($%T8===wQ)return kQ($);return R8($)}var PQ=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function h0($){let J={ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"},q=PQ.reduce((Q,G)=>{return Q[G]="function",Q},J);return n$($,q),$}function EQ($,J,q){if(q<l)throw Error("invalid exponent, negatives unsupported");if(q===l)return $.ONE;if(q===h)return J;let Q=$.ONE,G=J;while(q>l){if(q&h)Q=$.mul(Q,G);G=$.sqr(G),q>>=h}return Q}function D0($,J,q=!1){let Q=Array(J.length).fill(q?$.ZERO:void 0),G=J.reduce((Y,U,K)=>{if($.is0(U))return Y;return Q[K]=Y,$.mul(Y,U)},$.ONE),z=$.inv(G);return J.reduceRight((Y,U,K)=>{if($.is0(U))return Y;return Q[K]=$.mul(Y,Q[K]),$.mul(Y,U)},z),Q}function C8($,J){let q=($.ORDER-h)/S$,Q=$.pow(J,q),G=$.eql(Q,$.ONE),z=$.eql(Q,$.ZERO),Y=$.eql(Q,$.neg($.ONE));if(!G&&!z&&!Y)throw Error("invalid Legendre symbol result");return G?1:z?0:-1}function W0($,J){if(J!==void 0)d$(J);let q=J!==void 0?J:$.toString(2).length,Q=Math.ceil(q/8);return{nBitLength:q,nByteLength:Q}}function B$($,J,q=!1,Q={}){if($<=l)throw Error("invalid field: expected ORDER > 0, got "+$);let G=void 0,z=void 0,Y=!1,U=void 0;if(typeof J==="object"&&J!=null){if(Q.sqrt\|\|q)throw Error("cannot specify opts in two arguments");let X=J;if(X.BITS)G=X.BITS;if(X.sqrt)z=X.sqrt;if(typeof X.isLE==="boolean")q=X.isLE;if(typeof X.modFromBytes==="boolean")Y=X.modFromBytes;U=X.allowedLengths}else{if(typeof J==="number")G=J;if(Q.sqrt)z=Q.sqrt}let{nBitLength:K,nByteLength:C}=W0($,G);if(C>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");let N,L=Object.freeze({ORDER:$,isLE:q,BITS:K,BYTES:C,MASK:O$(K),ZERO:l,ONE:h,allowedLengths:U,create:(X)=>p(X,$),isValid:(X)=>{if(typeof X!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof X);return l<=X&&X<$},is0:(X)=>X===l,isValidNot0:(X)=>!L.is0(X)&&L.isValid(X),isOdd:(X)=>(X&h)===h,neg:(X)=>p(-X,$),eql:(X,j)=>X===j,sqr:(X)=>p(XX,$),add:(X,j)=>p(X+j,$),sub:(X,j)=>p(X-j,$),mul:(X,j)=>p(Xj,$),pow:(X,j)=>EQ(L,X,j),div:(X,j)=>p(XV8(j,$),$),sqrN:(X)=>XX,addN:(X,j)=>X+j,subN:(X,j)=>X-j,mulN:(X,j)=>Xj,inv:(X)=>V8(X,$),sqrt:z\|\|((X)=>{if(!N)N=SQ($);return N(L,X)}),toBytes:(X)=>q?u0(X,C):f$(X,C),fromBytes:(X,j=!0)=>{if(U){if(!U.includes(X.length)\|\|X.length>C)throw Error("Field.fromBytes: expected "+U+" bytes, got "+X.length);let w=new Uint8Array(C);w.set(X,q?0:w.length-X.length),X=w}if(X.length!==C)throw Error("Field.fromBytes: expected "+C+" bytes, got "+X.length);let T=q?g0(X):D$(X);if(Y)T=p(T,$);if(!j){if(!L.isValid(T))throw Error("invalid field element: outside of range 0..ORDER")}return T},invertBatch:(X)=>D0(L,X),cmov:(X,j,T)=>T?j:X});return Object.freeze(L)}function L8($){if(typeof $!=="bigint")throw Error("field order must be bigint");let J=$.toString(2).length;return Math.ceil(J/8)}function l0($){let J=L8($);return J+Math.ceil(J/2)}function N0($,J,q=!1){let Q=$.length,G=L8(J),z=l0(J);if(Q<16\|\|Q<z\|\|Q>1024)throw Error("expected "+z+"-1024 bytes of input, got "+Q);let Y=q?g0($):D$($),U=p(Y,J-h)+h;return q?u0(U,G):f$(U,G)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var _$=BigInt(0),P$=BigInt(1);function s$($,J){let q=J.negate();return $?q:J}function V0($,J){let q=D0($.Fp,J.map((Q)=>Q.Z));return J.map((Q,G)=>$.fromAffine(Q.toAffine(q[G])))}function S8($,J){if(!Number.isSafeInteger($)\|\|$<=0\|\|$>J)throw Error("invalid window size, expected [1.."+J+"], got W="+$)}function c0($,J){S8($,J);let q=Math.ceil(J/$)+1,Q=2($-1),G=2$,z=O$($),Y=BigInt($);return{windows:q,windowSize:Q,mask:z,maxNumber:G,shiftBy:Y}}function w8($,J,q){let{windowSize:Q,mask:G,maxNumber:z,shiftBy:Y}=q,U=Number($&G),K=$>>Y;if(U>Q)U-=z,K+=P$;let C=JQ,N=C+Math.abs(U)-1,L=U===0,X=U<0,j=J%2!==0;return{nextN:K,offset:N,isZero:L,isNeg:X,isNegF:j,offsetF:C}}function vQ($,J){if(!Array.isArray($))throw Error("array expected");$.forEach((q,Q)=>{if(!(q instanceof J))throw Error("invalid point at index "+Q)})}function bQ($,J){if(!Array.isArray($))throw Error("array of scalars expected");$.forEach((q,Q)=>{if(!J.isValid(q))throw Error("invalid scalar at index "+Q)})}var d0=new WeakMap,P8=new WeakMap;function o0($){return P8.get($)\|\|1}function I8($){if($!==_$)throw Error("invalid wNAF")}class r0{constructor($,J){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=J}_unsafeLadder($,J,q=this.ZERO){let Q=$;while(J>_$){if(J&P$)q=q.add(Q);Q=Q.double(),J>>=P$}return q}precomputeWindow($,J){let{windows:q,windowSize:Q}=c0(J,this.bits),G=[],z=$,Y=z;for(let U=0;U<q;U++){Y=z,G.push(Y);for(let K=1;K<Q;K++)Y=Y.add(z),G.push(Y);z=Y.double()}return G}wNAF($,J,q){if(!this.Fn.isValid(q))throw Error("invalid scalar");let Q=this.ZERO,G=this.BASE,z=c0($,this.bits);for(let Y=0;Y<z.windows;Y++){let{nextN:U,offset:K,isZero:C,isNeg:N,isNegF:L,offsetF:X}=w8(q,Y,z);if(q=U,C)G=G.add(s$(L,J[X]));else Q=Q.add(s$(N,J[K]))}return I8(q),{p:Q,f:G}}wNAFUnsafe($,J,q,Q=this.ZERO){let G=c0($,this.bits);for(let z=0;z<G.windows;z++){if(q===_$)break;let{nextN:Y,offset:U,isZero:K,isNeg:C}=w8(q,z,G);if(q=Y,K)continue;else{let N=J[U];Q=Q.add(C?N.negate():N)}}return I8(q),Q}getPrecomputes($,J,q){let Q=d0.get(J);if(!Q){if(Q=this.precomputeWindow(J,$),$!==1){if(typeof q==="function")Q=q(Q);d0.set(J,Q)}}return Q}cached($,J,q){let Q=o0($);return this.wNAF(Q,this.getPrecomputes(Q,$,q),J)}unsafe($,J,q,Q){let G=o0($);if(G===1)return this._unsafeLadder($,J,Q);return this.wNAFUnsafe(G,this.getPrecomputes(G,$,q),J,Q)}createCache($,J){S8(J,this.bits),P8.set($,J),d0.delete($)}hasCache($){return o0($)!==1}}function E8($,J,q,Q){let G=J,z=$.ZERO,Y=$.ZERO;while(q>_$\|\|Q>_$){if(q&P$)z=z.add(G);if(Q&P$)Y=Y.add(G);G=G.double(),q>>=P$,Q>>=P$}return{p1:z,p2:Y}}function v8($,J,q,Q){vQ(q,$),bQ(Q,J);let G=q.length,z=Q.length;if(G!==z)throw Error("arrays of points and scalars must have equal length");let Y=$.ZERO,U=M0(BigInt(G)),K=1;if(U>12)K=U-3;else if(U>4)K=U-2;else if(U>0)K=2;let C=O$(K),N=Array(Number(C)+1).fill(Y),L=Math.floor((J.BITS-1)/K)K,X=Y;for(let j=L;j>=0;j-=K){N.fill(Y);for(let w=0;w<z;w++){let v=Q[w],b=Number(v>>BigInt(j)&C);N[b]=N[b].add(q[w])}let T=Y;for(let w=N.length-1,v=Y;w>0;w--)v=v.add(N[w]),T=T.add(v);if(X=X.add(T),j!==0)for(let w=0;w<K;w++)X=X.double()}return X}function k8($,J,q){if(J){if(J.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return h0(J),J}else return B$($,{isLE:q})}function b8($,J,q={},Q){if(Q===void 0)Q=$==="edwards";if(!J\|\|typeof J!=="object")throw Error(`expected valid ${$} CURVE object`);for(let K of["p","n","h"]){let C=J[K];if(!(typeof C==="bigint"&&C>_$))throw Error(`CURVE.${K} must be positive bigint`)}let G=k8(J.p,q.Fp,Q),z=k8(J.n,q.Fn,Q),U=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let K of U)if(!G.isValid(J[K]))throw Error(`CURVE.${K} must be valid field element of CURVE.Fp`);return J=Object.freeze(Object.assign({},J)),{CURVE:J,Fp:G,Fn:z}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var f8=($,J)=>($+($>=0?J:-J)/y8)/J;function fQ($,J,q){let[[Q,G],[z,Y]]=J,U=f8(Y$,q),K=f8(-G$,q),C=$-UQ-Kz,N=-UG-KY,L=C<N$,X=N<N$;if(L)C=-C;if(X)N=-N;let j=O$(Math.ceil(M0(q)/2))+y$;if(C<N$\|\|C>=j\|\|N<N$\|\|N>=j)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:L,k1:C,k2neg:X,k2:N}}function i0($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function p0($,J){let q={};for(let Q of Object.keys(J))q[Q]=$[Q]===void 0?J[Q]:$[Q];if(p$(q.lowS,"lowS"),p$(q.prehash,"prehash"),q.format!==void 0)i0(q.format);return q}class _8 extends Error{constructor($=""){super($)}}var W$={Err:_8,_tlv:{encode:($,J)=>{let{Err:q}=W$;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length&1)throw new q("tlv.encode: unpadded data");let Q=J.length/2,G=i$(Q);if(G.length/2&128)throw new q("tlv.encode: long form length too big");let z=Q>127?i$(G.length/2\|128):"";return i$($)+z+G+J},decode($,J){let{Err:q}=W$,Q=0;if($<0\|\|$>256)throw new q("tlv.encode: wrong tag");if(J.length<2\|\|J[Q++]!==$)throw new q("tlv.decode: wrong tlv");let G=J[Q++],z=!!(G&128),Y=0;if(!z)Y=G;else{let K=G&127;if(!K)throw new q("tlv.decode(long): indefinite length not supported");if(K>4)throw new q("tlv.decode(long): byte length is too big");let C=J.subarray(Q,Q+K);if(C.length!==K)throw new q("tlv.decode: length bytes not complete");if(C[0]===0)throw new q("tlv.decode(long): zero leftmost byte");for(let N of C)Y=Y<<8\|N;if(Q+=K,Y<128)throw new q("tlv.decode(long): not minimal encoding")}let U=J.subarray(Q,Q+Y);if(U.length!==Y)throw new q("tlv.decode: wrong value length");return{v:U,l:J.subarray(Q+Y)}}},_int:{encode($){let{Err:J}=W$;if($<N$)throw new J("integer: negative integers are not allowed");let q=i$($);if(Number.parseInt(q[0],16)&8)q="00"+q;if(q.length&1)throw new J("unexpected DER parsing assertion: unpadded hex");return q},decode($){let{Err:J}=W$;if($[0]&128)throw new J("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new J("invalid signature integer: unnecessary leading zero");return D$($)}},toSig($){let{Err:J,_int:q,_tlv:Q}=W$,G=m("signature",$),{v:z,l:Y}=Q.decode(48,G);if(Y.length)throw new J("invalid signature: left bytes after parsing");let{v:U,l:K}=Q.decode(2,z),{v:C,l:N}=Q.decode(2,K);if(N.length)throw new J("invalid signature: left bytes after parsing");return{r:q.decode(U),s:q.decode(C)}},hexFromSig($){let{_tlv:J,_int:q}=W$,Q=J.encode(2,q.encode($.r)),G=J.encode(2,q.encode($.s)),z=Q+G;return J.encode(48,z)}},N$=BigInt(0),y$=BigInt(1),y8=BigInt(2),C0=BigInt(3),_Q=BigInt(4);function A$($,J){let{BYTES:q}=$,Q;if(typeof J==="bigint")Q=J;else{let G=m("private key",J);try{Q=$.fromBytes(G)}catch(z){throw Error(`invalid private key: expected ui8a of size ${q}, got ${typeof J}`)}}if(!$.isValidNot0(Q))throw Error("invalid private key: out of range [1..N-1]");return Q}function yQ($,J={}){let q=b8("weierstrass",$,J),{Fp:Q,Fn:G}=q,z=q.CURVE,{h:Y,n:U}=z;n$(J,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});let{endo:K}=J;if(K){if(!Q.is0(z.a)\|\|typeof K.beta!=="bigint"\|\|!Array.isArray(K.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let C=u8(Q,G);function N(){if(!Q.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function L(H,x,M){let{x:W,y:Z}=x.toAffine(),D=Q.toBytes(W);if(p$(M,"isCompressed"),M){N();let V=!Q.isOdd(Z);return c(g8(V),D)}else return c(Uint8Array.of(4),D,Q.toBytes(Z))}function X(H){H$(H,void 0,"Point");let{publicKey:x,publicKeyUncompressed:M}=C,W=H.length,Z=H[0],D=H.subarray(1);if(W===x&&(Z===2\|\|Z===3)){let V=Q.fromBytes(D);if(!Q.isValid(V))throw Error("bad point: is not on curve, wrong x");let O=w(V),B;try{B=Q.sqrt(O)}catch(E){let R=E instanceof Error?": "+E.message:"";throw Error("bad point: is not on curve, sqrt error"+R)}N();let A=Q.isOdd(B);if((Z&1)===1!==A)B=Q.neg(B);return{x:V,y:B}}else if(W===M&&Z===4){let V=Q.BYTES,O=Q.fromBytes(D.subarray(0,V)),B=Q.fromBytes(D.subarray(V,V2));if(!v(O,B))throw Error("bad point: is not on curve");return{x:O,y:B}}else throw Error(`bad point: got length ${W}, expected compressed=${x} or uncompressed=${M}`)}let j=J.toBytes\|\|L,T=J.fromBytes\|\|X;function w(H){let x=Q.sqr(H),M=Q.mul(x,H);return Q.add(Q.add(M,Q.mul(H,z.a)),z.b)}function v(H,x){let M=Q.sqr(x),W=w(H);return Q.eql(M,W)}if(!v(z.Gx,z.Gy))throw Error("bad curve params: generator point");let b=Q.mul(Q.pow(z.a,C0),_Q),G$=Q.mul(Q.sqr(z.b),BigInt(27));if(Q.is0(Q.add(b,G$)))throw Error("bad curve params: a or b");function g(H,x,M=!1){if(!Q.isValid(x)\|\|M&&Q.is0(x))throw Error(`bad point coordinate ${H}`);return x}function a(H){if(!(H instanceof k))throw Error("ProjectivePoint expected")}function d(H){if(!K\|\|!K.basises)throw Error("no endo");return fQ(H,K.basises,G.ORDER)}let t=m0((H,x)=>{let{X:M,Y:W,Z}=H;if(Q.eql(Z,Q.ONE))return{x:M,y:W};let D=H.is0();if(x==null)x=D?Q.ONE:Q.inv(Z);let V=Q.mul(M,x),O=Q.mul(W,x),B=Q.mul(Z,x);if(D)return{x:Q.ZERO,y:Q.ZERO};if(!Q.eql(B,Q.ONE))throw Error("invZ was invalid");return{x:V,y:O}}),U$=m0((H)=>{if(H.is0()){if(J.allowInfinityPoint&&!Q.is0(H.Y))return;throw Error("bad point: ZERO")}let{x,y:M}=H.toAffine();if(!Q.isValid(x)\|\|!Q.isValid(M))throw Error("bad point: x or y not field elements");if(!v(x,M))throw Error("bad point: equation left != right");if(!H.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function e(H,x,M,W,Z){return M=new k(Q.mul(M.X,H),M.Y,M.Z),x=s$(W,x),M=s$(Z,M),x.add(M)}class k{constructor(H,x,M){this.X=g("x",H),this.Y=g("y",x,!0),this.Z=g("z",M),Object.freeze(this)}static CURVE(){return z}static fromAffine(H){let{x,y:M}=H\|\|{};if(!H\|\|!Q.isValid(x)\|\|!Q.isValid(M))throw Error("invalid affine point");if(H instanceof k)throw Error("projective point not allowed");if(Q.is0(x)&&Q.is0(M))return k.ZERO;return new k(x,M,Q.ONE)}static fromBytes(H){let x=k.fromAffine(T(H$(H,void 0,"point")));return x.assertValidity(),x}static fromHex(H){return k.fromBytes(m("pointHex",H))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(H=8,x=!0){if($$.createCache(this,H),!x)this.multiply(C0);return this}assertValidity(){U$(this)}hasEvenY(){let{y:H}=this.toAffine();if(!Q.isOdd)throw Error("Field doesn't support isOdd");return!Q.isOdd(H)}equals(H){a(H);let{X:x,Y:M,Z:W}=this,{X:Z,Y:D,Z:V}=H,O=Q.eql(Q.mul(x,V),Q.mul(Z,W)),B=Q.eql(Q.mul(M,V),Q.mul(D,W));return O&&B}negate(){return new k(this.X,Q.neg(this.Y),this.Z)}double(){let{a:H,b:x}=z,M=Q.mul(x,C0),{X:W,Y:Z,Z:D}=this,V=Q.ZERO,O=Q.ZERO,B=Q.ZERO,A=Q.mul(W,W),u=Q.mul(Z,Z),E=Q.mul(D,D),R=Q.mul(W,Z);return R=Q.add(R,R),B=Q.mul(W,D),B=Q.add(B,B),V=Q.mul(H,B),O=Q.mul(M,E),O=Q.add(V,O),V=Q.sub(u,O),O=Q.add(u,O),O=Q.mul(V,O),V=Q.mul(R,V),B=Q.mul(M,B),E=Q.mul(H,E),R=Q.sub(A,E),R=Q.mul(H,R),R=Q.add(R,B),B=Q.add(A,A),A=Q.add(B,A),A=Q.add(A,E),A=Q.mul(A,R),O=Q.add(O,A),E=Q.mul(Z,D),E=Q.add(E,E),A=Q.mul(E,R),V=Q.sub(V,A),B=Q.mul(E,u),B=Q.add(B,B),B=Q.add(B,B),new k(V,O,B)}add(H){a(H);let{X:x,Y:M,Z:W}=this,{X:Z,Y:D,Z:V}=H,O=Q.ZERO,B=Q.ZERO,A=Q.ZERO,u=z.a,E=Q.mul(z.b,C0),R=Q.mul(x,Z),S=Q.mul(M,D),P=Q.mul(W,V),I=Q.add(x,M),_=Q.add(Z,D);I=Q.mul(I,_),_=Q.add(R,S),I=Q.sub(I,_),_=Q.add(x,W);let y=Q.add(Z,V);return _=Q.mul(_,y),y=Q.add(R,P),_=Q.sub(_,y),y=Q.add(M,W),O=Q.add(D,V),y=Q.mul(y,O),O=Q.add(S,P),y=Q.sub(y,O),A=Q.mul(u,_),O=Q.mul(E,P),A=Q.add(O,A),O=Q.sub(S,A),A=Q.add(S,A),B=Q.mul(O,A),S=Q.add(R,R),S=Q.add(S,R),P=Q.mul(u,P),_=Q.mul(E,_),S=Q.add(S,P),P=Q.sub(R,P),P=Q.mul(u,P),_=Q.add(_,P),R=Q.mul(S,_),B=Q.add(B,R),R=Q.mul(y,_),O=Q.mul(I,O),O=Q.sub(O,R),R=Q.mul(I,S),A=Q.mul(y,A),A=Q.add(A,R),new k(O,B,A)}subtract(H){return this.add(H.negate())}is0(){return this.equals(k.ZERO)}multiply(H){let{endo:x}=J;if(!G.isValidNot0(H))throw Error("invalid scalar: out of range");let M,W,Z=(D)=>$$.cached(this,D,(V)=>V0(k,V));if(x){let{k1neg:D,k1:V,k2neg:O,k2:B}=d(H),{p:A,f:u}=Z(V),{p:E,f:R}=Z(B);W=u.add(R),M=e(x.beta,A,E,D,O)}else{let{p:D,f:V}=Z(H);M=D,W=V}return V0(k,[M,W])[0]}multiplyUnsafe(H){let{endo:x}=J,M=this;if(!G.isValid(H))throw Error("invalid scalar: out of range");if(H===N$\|\|M.is0())return k.ZERO;if(H===y$)return M;if($$.hasCache(this))return this.multiply(H);if(x){let{k1neg:W,k1:Z,k2neg:D,k2:V}=d(H),{p1:O,p2:B}=E8(k,M,Z,V);return e(x.beta,O,B,W,D)}else return $$.unsafe(M,H)}multiplyAndAddUnsafe(H,x,M){let W=this.multiplyUnsafe(x).add(H.multiplyUnsafe(M));return W.is0()?void 0:W}toAffine(H){return t(this,H)}isTorsionFree(){let{isTorsionFree:H}=J;if(Y===y$)return!0;if(H)return H(k,this);return $$.unsafe(this,U).is0()}clearCofactor(){let{clearCofactor:H}=J;if(Y===y$)return this;if(H)return H(k,this);return this.multiplyUnsafe(Y)}isSmallOrder(){return this.multiplyUnsafe(Y).is0()}toBytes(H=!0){return p$(H,"isCompressed"),this.assertValidity(),j(k,this,H)}toHex(H=!0){return j$(this.toBytes(H))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(H=!0){return this.toBytes(H)}_setWindowSize(H){this.precompute(H)}static normalizeZ(H){return V0(k,H)}static msm(H,x){return v8(k,G,H,x)}static fromPrivateKey(H){return k.BASE.multiply(A$(G,H))}}k.BASE=new k(z.Gx,z.Gy,Q.ONE),k.ZERO=new k(Q.ZERO,Q.ONE,Q.ZERO),k.Fp=Q,k.Fn=G;let z$=G.BITS,$$=new r0(k,J.endo?Math.ceil(z$/2):z$);return k.BASE.precompute(8),k}function g8($){return Uint8Array.of($?2:3)}function u8($,J){return{secretKey:J.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2$.BYTES,publicKeyHasPrefix:!0,signature:2J.BYTES}}function gQ($,J={}){let{Fn:q}=$,Q=J.randomBytes\|\|k$,G=Object.assign(u8($.Fp,q),{seed:l0(q.ORDER)});function z(j){try{return!!A$(q,j)}catch(T){return!1}}function Y(j,T){let{publicKey:w,publicKeyUncompressed:v}=G;try{let b=j.length;if(T===!0&&b!==w)return!1;if(T===!1&&b!==v)return!1;return!!$.fromBytes(j)}catch(b){return!1}}function U(j=Q(G.seed)){return N0(H$(j,G.seed,"seed"),q.ORDER)}function K(j,T=!0){return $.BASE.multiply(A$(q,j)).toBytes(T)}function C(j){let T=U(j);return{secretKey:T,publicKey:K(T)}}function N(j){if(typeof j==="bigint")return!1;if(j instanceof $)return!0;let{secretKey:T,publicKey:w,publicKeyUncompressed:v}=G;if(q.allowedLengths\|\|T===w)return;let b=m("key",j).length;return b===w\|\|b===v}function L(j,T,w=!0){if(N(j)===!0)throw Error("first arg must be private key");if(N(T)===!1)throw Error("second arg must be public key");let v=A$(q,j);return $.fromHex(T).multiply(v).toBytes(w)}return Object.freeze({getPublicKey:K,getSharedSecret:L,keygen:C,Point:$,utils:{isValidSecretKey:z,isValidPublicKey:Y,randomSecretKey:U,isValidPrivateKey:z,randomPrivateKey:U,normPrivateKeyToScalar:(j)=>A$(q,j),precompute(j=8,T=$.BASE){return T.precompute(j,!1)}},lengths:G})}function uQ($,J,q={}){Z0(J),n$(q,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});let Q=q.randomBytes\|\|k$,G=q.hmac\|\|((M,...W)=>b0(J,M,c(...W))),{Fp:z,Fn:Y}=$,{ORDER:U,BITS:K}=Y,{keygen:C,getPublicKey:N,getSharedSecret:L,utils:X,lengths:j}=gQ($,q),T={prehash:!1,lowS:typeof q.lowS==="boolean"?q.lowS:!1,format:void 0,extraEntropy:!1},w="compact";function v(M){let W=U>>y$;return M>W}function b(M,W){if(!Y.isValidNot0(W))throw Error(`invalid signature ${M}: out of range 1..Point.Fn.ORDER`);return W}function G$(M,W){i0(W);let Z=j.signature,D=W==="compact"?Z:W==="recovered"?Z+1:void 0;return H$(M,D,`${W} signature`)}class g{constructor(M,W,Z){if(this.r=b("r",M),this.s=b("s",W),Z!=null)this.recovery=Z;Object.freeze(this)}static fromBytes(M,W=w){G$(M,W);let Z;if(W==="der"){let{r:B,s:A}=W$.toSig(H$(M));return new g(B,A)}if(W==="recovered")Z=M[0],W="compact",M=M.subarray(1);let D=Y.BYTES,V=M.subarray(0,D),O=M.subarray(D,D2);return new g(Y.fromBytes(V),Y.fromBytes(O),Z)}static fromHex(M,W){return this.fromBytes(I$(M),W)}addRecoveryBit(M){return new g(this.r,this.s,M)}recoverPublicKey(M){let W=z.ORDER,{r:Z,s:D,recovery:V}=this;if(V==null\|\|![0,1,2,3].includes(V))throw Error("recovery id invalid");if(Uy8<W&&V>1)throw Error("recovery id is ambiguous for h>1 curve");let B=V===2\|\|V===3?Z+U:Z;if(!z.isValid(B))throw Error("recovery id 2 or 3 invalid");let A=z.toBytes(B),u=$.fromBytes(c(g8((V&1)===0),A)),E=Y.inv(B),R=d(m("msgHash",M)),S=Y.create(-RE),P=Y.create(DE),I=$.BASE.multiplyUnsafe(S).add(u.multiplyUnsafe(P));if(I.is0())throw Error("point at infinify");return I.assertValidity(),I}hasHighS(){return v(this.s)}toBytes(M=w){if(i0(M),M==="der")return I$(W$.hexFromSig(this));let W=Y.toBytes(this.r),Z=Y.toBytes(this.s);if(M==="recovered"){if(this.recovery==null)throw Error("recovery bit must be present");return c(Uint8Array.of(this.recovery),W,Z)}return c(W,Z)}toHex(M){return j$(this.toBytes(M))}assertValidity(){}static fromCompact(M){return g.fromBytes(m("sig",M),"compact")}static fromDER(M){return g.fromBytes(m("sig",M),"der")}normalizeS(){return this.hasHighS()?new g(this.r,Y.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return j$(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return j$(this.toBytes("compact"))}}let a=q.bits2int\|\|function(W){if(W.length>8192)throw Error("input is too large");let Z=D$(W),D=W.length8-K;return D>0?Z>>BigInt(D):Z},d=q.bits2int_modN\|\|function(W){return Y.create(a(W))},t=O$(K);function U$(M){return W8("num < 2^"+K,M,N$,t),Y.toBytes(M)}function e(M,W){return H$(M,void 0,"message"),W?H$(J(M),void 0,"prehashed message"):M}function k(M,W,Z){if(["recovered","canonical"].some((P)=>(P in Z)))throw Error("sign() legacy options not supported");let{lowS:D,prehash:V,extraEntropy:O}=p0(Z,T);M=e(M,V);let B=d(M),A=A$(Y,W),u=[U$(A),U$(B)];if(O!=null&&O!==!1){let P=O===!0?Q(j.secretKey):O;u.push(m("extraEntropy",P))}let E=c(...u),R=B;function S(P){let I=a(P);if(!Y.isValidNot0(I))return;let _=Y.inv(I),y=$.BASE.multiply(I).toAffine(),f=Y.create(y.x);if(f===N$)return;let F=Y.create(_Y.create(R+fA));if(F===N$)return;let o=(y.x===f?0:2)\|Number(y.y&y$),r=F;if(D&&v(F))r=Y.neg(F),o^=1;return new g(f,r,o)}return{seed:E,k2sig:S}}function z$(M,W,Z={}){M=m("message",M);let{seed:D,k2sig:V}=k(M,W,Z);return N8(J.outputLen,Y.BYTES,G)(D,V)}function $$(M){let W=void 0,Z=typeof M==="string"\|\|L$(M),D=!Z&&M!==null&&typeof M==="object"&&typeof M.r==="bigint"&&typeof M.s==="bigint";if(!Z&&!D)throw Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(D)W=new g(M.r,M.s);else if(Z){try{W=g.fromBytes(m("sig",M),"der")}catch(V){if(!(V instanceof W$.Err))throw V}if(!W)try{W=g.fromBytes(m("sig",M),"compact")}catch(V){return!1}}if(!W)return!1;return W}function H(M,W,Z,D={}){let{lowS:V,prehash:O,format:B}=p0(D,T);if(Z=m("publicKey",Z),W=e(m("message",W),O),"strict"in D)throw Error("options.strict was renamed to lowS");let A=B===void 0?$$(M):g.fromBytes(m("sig",M),B);if(A===!1)return!1;try{let u=$.fromBytes(Z);if(V&&A.hasHighS())return!1;let{r:E,s:R}=A,S=d(W),P=Y.inv(R),I=Y.create(SP),_=Y.create(EP),y=$.BASE.multiplyUnsafe(I).add(u.multiplyUnsafe(_));if(y.is0())return!1;return Y.create(y.x)===E}catch(u){return!1}}function x(M,W,Z={}){let{prehash:D}=p0(Z,T);return W=e(W,D),g.fromBytes(M,"recovered").recoverPublicKey(W).toBytes()}return Object.freeze({keygen:C,getPublicKey:N,getSharedSecret:L,utils:X,lengths:j,Point:$,sign:z$,verify:H,recoverPublicKey:x,Signature:g,hash:J})}function mQ($){let J={a:$.a,b:$.b,p:$.Fp.ORDER,n:$.n,h:$.h,Gx:$.Gx,Gy:$.Gy},q=$.Fp,Q=$.allowedPrivateKeyLengths?Array.from(new Set($.allowedPrivateKeyLengths.map((Y)=>Math.ceil(Y/2)))):void 0,G=B$(J.n,{BITS:$.nBitLength,allowedLengths:Q,modFromBytes:$.wrapPrivateKey}),z={Fp:q,Fn:G,allowInfinityPoint:$.allowInfinityPoint,endo:$.endo,isTorsionFree:$.isTorsionFree,clearCofactor:$.clearCofactor,fromBytes:$.fromBytes,toBytes:$.toBytes};return{CURVE:J,curveOpts:z}}function FQ($){let{CURVE:J,curveOpts:q}=mQ($),Q={hmac:$.hmac,randomBytes:$.randomBytes,lowS:$.lowS,bits2int:$.bits2int,bits2int_modN:$.bits2int_modN};return{CURVE:J,curveOpts:q,hash:$.hash,ecdsaOpts:Q}}function hQ($,J){let q=J.Point;return Object.assign({},J,{ProjectivePoint:q,CURVE:Object.assign({},$,W0(q.Fn.ORDER,q.Fn.BITS))})}function m8($){let{CURVE:J,curveOpts:q,hash:Q,ecdsaOpts:G}=FQ($),z=yQ(J,q),Y=uQ(z,Q,G);return hQ($,Y)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function F8($,J){let q=(Q)=>m8({...$,hash:Q});return{...q(J),create:q}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /var g$={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},lQ={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},cQ=BigInt(0),h8=BigInt(1),a0=BigInt(2);function dQ($){let J=g$.p,q=BigInt(3),Q=BigInt(6),G=BigInt(11),z=BigInt(22),Y=BigInt(23),U=BigInt(44),K=BigInt(88),C=$$$%J,N=CC$%J,L=i(N,q,J)N%J,X=i(L,q,J)N%J,j=i(X,a0,J)C%J,T=i(j,G,J)j%J,w=i(T,z,J)T%J,v=i(w,U,J)w%J,b=i(v,K,J)v%J,G$=i(b,U,J)w%J,g=i(G$,q,J)N%J,a=i(g,Y,J)T%J,d=i(a,Q,J)C%J,t=i(d,a0,J);if(!H0.eql(H0.sqr(t),$))throw Error("Cannot find square root");return t}var H0=B$(g$.p,{sqrt:dQ}),d8=F8({...g$,Fp:H0,lowS:!0,endo:lQ},j0),l8={};function O0($,...J){let q=l8[$];if(q===void 0){let Q=j0(K0($));q=c(Q,Q),l8[$]=q}return j0(c(q,...J))}var s0=($)=>$.toBytes(!0).slice(1),u$=(()=>d8.Point)(),t0=($)=>$%a0===cQ;function n0($){let{Fn:J,BASE:q}=u$,Q=A$(J,$),G=q.multiply(Q);return{scalar:t0(G.y)?Q:J.neg(Q),bytes:s0(G)}}function o8($){let J=H0;if(!J.isValidNot0($))throw Error("invalid x: Fail if x ≥ p");let q=J.create($$),Q=J.create(q$+BigInt(7)),G=J.sqrt(Q);if(!t0(G))G=J.neg(G);let z=u$.fromAffine({x:$,y:G});return z.assertValidity(),z}var t$=D$;function r8(...$){return u$.Fn.create(t$(O0("BIP0340/challenge",...$)))}function c8($){return n0($).bytes}function oQ($,J,q=k$(32)){let{Fn:Q}=u$,G=m("message",$),{bytes:z,scalar:Y}=n0(J),U=m("auxRand",q,32),K=Q.toBytes(Y^t$(O0("BIP0340/aux",U))),C=O0("BIP0340/nonce",K,z,G),{bytes:N,scalar:L}=n0(C),X=r8(N,z,G),j=new Uint8Array(64);if(j.set(N,0),j.set(Q.toBytes(Q.create(L+XY)),32),!p8(j,G,z))throw Error("sign: Invalid signature produced");return j}function p8($,J,q){let{Fn:Q,BASE:G}=u$,z=m("signature",$,64),Y=m("message",J),U=m("publicKey",q,32);try{let K=o8(t$(U)),C=t$(z.subarray(0,32));if(!a$(C,h8,g$.p))return!1;let N=t$(z.subarray(32,64));if(!a$(N,h8,g$.n))return!1;let L=r8(Q.toBytes(C),s0(K),Y),X=G.multiplyUnsafe(N).add(K.multiplyUnsafe(Q.neg(L))),{x:j,y:T}=X.toAffine();if(X.is0()\|\|!t0(T)\|\|j!==C)return!1;return!0}catch(K){return!1}}var B0=(()=>{let q=(G=k$(48))=>{return N0(G,g$.n)};d8.utils.randomSecretKey;function Q(G){let z=q(G);return{secretKey:z,publicKey:c8(z)}}return{keygen:Q,getPublicKey:c8,sign:oQ,verify:p8,Point:u$,utils:{randomSecretKey:q,randomPrivateKey:q,taggedHash:O0,lift_x:o8,pointToBytes:s0,numberToBytesBE:f$,bytesToNumberBE:D$,mod:p},lengths:{secretKey:32,publicKey:32,publicKeyHasPrefix:!1,signature:64,seed:48}}})();var rQ=new TextEncoder,pQ=new TextDecoder,X$=($)=>rQ.encode($),E$=($)=>pQ.decode($),A0=($)=>Array.from($,(J)=>J.toString(16).padStart(2,"0")).join(""),s=JSON.stringify,v$=JSON.parse,T0=($,J=Number.MAX_SAFE_INTEGER)=>$.split("").reduce((q,Q)=>q+Q.charCodeAt(0),0)%J;var e0="AES-GCM",iQ={},i8="$",a8=",",aQ=($)=>{let J=new Uint8Array($),q=32768,Q="";for(let G=0;G<J.length;G+=32768)Q+=String.fromCharCode(...J.subarray(G,G+32768));return btoa(Q)},nQ=($)=>Uint8Array.from(atob($),(J)=>J.charCodeAt(0)).buffer,e$=($)=>iQ[$]??=crypto.subtle.digest("SHA-1",X$($)).then((J)=>{let q=new Uint8Array(J),Q="";for(let G of q)Q+=G.toString(36);return Q}),n8=async($,J,q)=>{let Q=await crypto.subtle.digest("SHA-256",X$(`${$}:${J}:${q}`));return crypto.subtle.importKey("raw",Q,{name:e0},!1,["encrypt","decrypt"])},s8=async($,J)=>{let q=crypto.getRandomValues(new Uint8Array(12)),Q=await $,G=await crypto.subtle.encrypt({name:e0,iv:q},Q,X$(J));return`${q.join(a8)}${i8}${aQ(G)}`},t8=async($,J)=>{let[q,Q]=J.split(i8);if(!q\|\|!Q)throw Error("Invalid encrypted payload format");let G=Uint8Array.from(q.split(a8),Number),z=await $,Y=await crypto.subtle.decrypt({name:e0,iv:G},z,nQ(Q));return E$(Y)};var $0="GenosRTC",F$=($,J)=>Array.from({length:$},J);var m$=($)=>Array.from(crypto.getRandomValues(new Uint8Array($)),(J)=>"0123456789AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz"[J%62]).join(""),Z$=typeof sessionStorage<"u"?sessionStorage.__genosrtcId??=m$(20):m$(20),V$=Promise.all.bind(Promise),e8=typeof window<"u",{entries:$Q,fromEntries:x0,keys:q9}=Object,QQ=()=>{},q$=($)=>Error(`GenosRTC: ${$}`),Q0=(...$)=>$.join("@"),JQ=($,J)=>{let q=[...$],Q=q.length,G=()=>{let z=Math.sin(J++)1e4;return z-Math.floor(z)};while(Q){let z=Math.floor(G()Q--);[q[Q],q[z]]=[q[z],q[Q]]}return q};var sQ=5000,qQ="icegatheringstatechange",GQ="offer",tQ="answer",eQ=[...F$(3,($,J)=>`stun:stun${J\|\|""}.l.google.com:19302`),"stun:stun.cloudflare.com:3478"].map(($)=>({urls:$})),$8=($,{rtcConfig:J,rtcPolyfill:q,turnConfig:Q})=>{let G=new(q\|\|RTCPeerConnection)({iceServers:[...eQ,...Q\|\|[]],...J}),z={},Y=!1,U=!1,K,C=(X)=>Object.assign(X,{binaryType:"arraybuffer",bufferedAmountLowThreshold:65535,onmessage:(j)=>z.data?.(j.data),onopen:()=>z.connect?.(),onclose:()=>z.close?.(),onerror:(j)=>!j?.error?.message?.includes("User-Initiated Abort")&&z.error?.(j)}),N=()=>Promise.race([new Promise((X)=>{let j=()=>{if(G.iceGatheringState==="complete")G.removeEventListener(qQ,j),X()};G.addEventListener(qQ,j),j()}),new Promise((X)=>setTimeout(X,sQ))]).then(()=>({type:G.localDescription.type,sdp:G.localDescription.sdp.replace(/a=ice-options:trickle\s\n/g,"")}));if($?C(K=G.createDataChannel("data")):G.ondatachannel=({channel:X})=>C(K=X),G.onnegotiationneeded=async()=>{try{Y=!0,await G.setLocalDescription(),z.signal?.(await N())}catch(X){z.error?.(X)}finally{Y=!1}},G.onconnectionstatechange=()=>{if(["disconnected","failed","closed"].includes(G.connectionState))z.close?.()},G.ontrack=(X)=>{z.track?.(X.track,X.streams[0]),z.stream?.(X.streams[0])},G.onremovestream=(X)=>z.stream?.(X.stream),$&&!G.canTrickleIceCandidates)G.onnegotiationneeded();let L=()=>G.getSenders();return{created:Date.now(),connection:G,get channel(){return K},get isDead(){return G.connectionState==="closed"},async signal(X){if(K?.readyState==="open"&&!X.sdp?.includes("a=rtpmap"))return;try{if(X.type===GQ){if(Y\|\|G.signalingState!=="stable"&&!U){if($)return;await V$([G.setLocalDescription({type:"rollback"}),G.setRemoteDescription(X)])}else await G.setRemoteDescription(X);await G.setLocalDescription();let j=await N();return z.signal?.(j),j}if(X.type===tQ){U=!0;try{await G.setRemoteDescription(X)}finally{U=!1}}}catch(j){z.error?.(j)}},sendData:(X)=>{if(K?.readyState==="open")K.send(X)},destroy:()=>{K?.close(),G.close(),Y=U=!1},setHandlers:(X)=>Object.assign(z,X),offerPromise:$?new Promise((X)=>z.signal=(j)=>j.type===GQ&&X(j)):Promise.resolve(),addStream:(X)=>X.getTracks().forEach((j)=>G.addTrack(j,X)),removeStream:(X)=>L().filter((j)=>X.getTracks().includes(j.track)).forEach((j)=>G.removeTrack(j)),addTrack:(X,j)=>G.addTrack(X,j),removeTrack:(X)=>{let j=L().find((T)=>T.track===X);if(j)G.removeTrack(j)},replaceTrack:(X,j)=>L().find((T)=>T.track===X)?.replaceTrack(j)}};var $J=Object.getPrototypeOf(Uint8Array),L0=12,zQ=0,w0=zQ+L0,I0=w0+1,q0=I0+1,G0=q0+1,J0=16384-G0,R0=255,Q8="bufferedamountlow",h$=($)=>`@_${$}`,J8=100,QJ=3,JJ=200,YQ=($,J,q)=>{let Q=new Map,G=new Map,z=new Map,Y={},U={},K={},C={},N=new Map,L=(Z,D)=>{if(!N.has(Z))N.set(Z,new Set);N.get(Z).add(D)},X=(Z,D)=>N.get(Z)?.delete(D),j=(Z,...D)=>N.get(Z)?.forEach((V)=>V(...D)),T=(Z,D)=>{let V=Z?Array.isArray(Z)?Z:[Z]:Q.keys();return Array.from(V,(O)=>{let B=Q.get(O);if(!B)return null;return D(O,B)}).filter(Boolean)},w=(Z)=>{if(!Q.has(Z))return;Q.delete(Z),delete Y[Z],delete U[Z],delete K[Z],delete C[Z],j("peer:leave",Z),J(Z)},v=(Z)=>new Promise((D,V)=>{let O=setTimeout(()=>{Z.removeEventListener(Q8,B),V(Error(`${$0}: bufferLow timeout`))},5000);function B(){clearTimeout(O),Z.removeEventListener(Q8,B),D()}Z.addEventListener(Q8,B)}),b=(Z)=>{if(z.has(Z))return z.get(Z);if(!Z)throw q$("action type is required");let D=X$(Z);if(D.byteLength>L0)throw q$(`❌ "${Z}" exceeds ${L0} bytes. Use a shorter name.`);let V=new Uint8Array(L0).map((S,P)=>D[P]\|\|0),O=0,B=new Map([["message",new Set],["progress",new Set]]),A=(S,P)=>B.get(S)?.add(P),u=(S,P)=>B.get(S)?.delete(P),E=async(S,P,I,_)=>{if(I&&typeof I!=="object")throw q$("meta must be object");if(S===void 0)throw q$("data cannot be undefined");let y=S instanceof Blob,f=y\|\|S instanceof ArrayBuffer\|\|S instanceof $J,F=typeof S!=="string";if(I&&!f)throw q$("meta only allowed with binary");let o=f?new Uint8Array(y?await S.arrayBuffer():S):X$(F?s(S):S),r=I?X$(s(I)):null,n=Math.ceil(o.byteLength/J0)+(I?1:0)\|\|1;if(n>J8)throw q$(`Message too large, exceeds max chunks ${J8}`);let z8=F$(n,(Y0,Y$)=>{let c$=Y$===n-1,T$=I&&Y$===0,X0=T$?r:o.subarray(I?(Y$-1)J0:Y$J0,I?Y$J0:(Y$+1)J0),x$=new Uint8Array(G0+X0.byteLength);return x$.set(V),x$.set([O],w0),x$.set([c$\|T$<<1\|f<<2\|F<<3],I0),x$.set([Math.round((Y$+1)/nR0)],q0),x$.set(X0,G0),x$});return O=O+1&R0,V$(T(P,async(Y0,Y$)=>{let{channel:c$}=Y$;for(let T$=0;T$<n;T$++){let X0=0;while(c$.bufferedAmount>c$.bufferedAmountLowThreshold){if(X0++>QJ)throw q$(`${$0}: send buffer full, max retries reached for peer ${Y0}`);try{await v(c$)}catch(x$){await new Promise((AQ)=>setTimeout(AQ,JJ))}}if(!Q.has(Y0))break;Y$.sendData(z8[T$]),_?.(z8[T$][q0]/R0,Y0,I)}}))};G.set(Z,{listeners:B,send:E});let R={send:E,on:A,off:u};return z.set(Z,R),R},G$=(Z,D)=>{try{let V=new Uint8Array(D),O=E$(V.subarray(zQ,w0)).replace(//g,"");if(!G.has(O))return;let[B]=V.subarray(w0,I0),[A]=V.subarray(I0,q0),[u]=V.subarray(q0,G0),E=V.subarray(G0),R=Boolean(A&1),S=Boolean(A&2),P=Boolean(A&4),I=Boolean(A&8),_=G.get(O),y=(Y[Z]\|\|={})[O]\|\|={};if(y[B]?.chunks?.length>J8)return;let f=y[B]\|\|={chunks:[]};if(S)try{f.meta=v$(E$(E))}catch{return}else f.chunks.push(E);if(_.listeners.get("progress").forEach((r)=>{try{r(u/R0,Z,f.meta)}catch(n){}}),!R)return;let F=new Uint8Array(f.chunks.reduce((r,n)=>r+n.byteLength,0));f.chunks.reduce((r,n)=>(F.set(n,r),r+n.byteLength),0),delete y[B];let o;if(P)o=F;else if(I)try{o=v$(E$(F))}catch{return}else o=E$(F);_.listeners.get("message").forEach((r)=>{try{r(o,Z,f.meta)}catch(n){}})}catch(V){}},g=async()=>{try{await M(""),await new Promise((Z)=>setTimeout(Z,99))}catch(Z){}for(let[Z,D]of Q){try{D.destroy()}catch{}Q.delete(Z)}q()},{send:a,on:d}=b(h$("ping")),{send:t,on:U$}=b(h$("pong")),{send:e,on:k}=b(h$("signal")),{send:z$,on:$$}=b(h$("stream")),{send:H,on:x}=b(h$("track")),{send:M,on:W}=b(h$("leave"));if($((Z,D)=>{if(Q.has(D))return;Q.set(D,Z),Z.setHandlers({data:(V)=>G$(D,V),stream:(V)=>{j("stream:add",V,D,K[D]),delete K[D]},track:(V,O)=>{j("track:add",V,O,D,C[D]),delete C[D]},signal:(V)=>e(V,D),close:()=>w(D),error:(V)=>{w(D)}}),j("peer:join",D)}),d("message",(Z,D)=>t("",D)),U$("message",(Z,D)=>{U[D]?.(),delete U[D]}),k("message",(Z,D)=>Q.get(D)?.signal(Z)),$$("message",(Z,D)=>K[D]=Z),x("message",(Z,D)=>C[D]=Z),W("message",(Z,D)=>w(D)),e8)addEventListener("beforeunload",g);return{on:L,off:X,channel:b,leave:g,ping:async(Z)=>{if(!Z)throw q$("ping() requires target peer ID");let D=Date.now();return a("",Z),await new Promise((V)=>U[Z]=V),Date.now()-D},getPeers:()=>x0(Array.from(Q,([Z,D])=>[Z,D.connection])),addStream:(Z,D,V)=>T(D,async(O,B)=>{if(V)await z$(V,O);B.addStream(Z)}),removeStream:(Z,D)=>T(D,(V,O)=>O.removeStream(Z)),addTrack:(Z,D,V,O)=>T(V,async(B,A)=>{if(O)await H(O,B);A.addTrack(Z,D)}),removeTrack:(Z,D)=>T(D,(V,O)=>O.removeTrack(Z)),replaceTrack:(Z,D,V,O)=>T(V,async(B,A)=>{if(O)await H(O,B);A.replaceTrack(Z,D)})}};var qJ=5,GJ=10,zJ=2500,k0=57333,XQ=({init:$,subscribe:J,announce:q})=>{let Q={},G=!1,z,Y;return(U,K,C)=>{let{appId:N}=U;if(Q[N]?.[K])return Q[N][K];if(!U\|\|!K\|\|!N&&!U.firebaseApp)throw q$(!U?"config required":!K?"roomId required":"appId missing");let L=QQ;if(!G){let W=$(U);Y=F$(qJ,()=>{try{return $8(!0,U)}catch{return null}}).filter(Boolean),z=Array.isArray(W)?W:[W];let Z=setInterval(()=>{Y=Y.filter((D)=>{let V=Date.now()-D.created<k0;if(!V)D.destroy();return V})},k0);Q.offerCleanupTimer\|\|=Z,G=!0}let X={},j={},T=new Map,w=new Map,v=Q0($0,N,K),b=e$(v),G$=e$(Q0(v,Z$)),g=n8(U.password\|\|"",N,K),a=(W)=>async(Z)=>({type:Z.type,sdp:await W(g,Z.sdp)}),d=a(t8),t=a(s8),U$=(W)=>{return setTimeout(()=>{if(!W.isDead&&!Object.values(j).includes(W))W.destroy()},k0),W},e=(W)=>{try{return U$($8(W,U))}catch{return null}},k=(W,Z)=>{if(j[Z]===W)return;j[Z]?.destroy(),j[Z]=W,L(W,Z),X[Z]?.forEach((D)=>D!==W&&D.destroy()),delete X[Z]},z$=(W,Z)=>{if(j[Z]===W)delete j[Z]},$$=(W)=>async(Z,D,V)=>{let[O,B]=await V$([b,G$]);if(Z!==O&&Z!==B)return;let{peerId:A,offer:u,answer:E}=typeof D==="string"?v$(D):D;if(A&&A!==Z$)w.set(A,Date.now());if(A===Z$\|\|j[A])return;if(U.admit&&!U.admit(A))return;if(u){if(X[A]?.[W]&&Z$>A)return;let R=e(!1);if(!R)return;R.setHandlers({connect:()=>k(R,A),close:()=>z$(R,A)});try{let S=await d(u);if(R.isDead)return;let[P,I]=await V$([e$(Q0(v,A)),R.signal(S).then(t)]);V(P,s({peerId:Z$,answer:I}))}catch{C?.({error:"decryption failed (offer)",appId:N,peerId:A,roomId:K})}}else if(E){let R=X[A]?.[W];if(!R\|\|R.isDead)return;R.setHandlers({connect:()=>k(R,A),close:()=>z$(R,A)});try{R.signal(await d(E))}catch{C?.({error:"decryption failed (answer)",appId:N,peerId:A,roomId:K})}}else{let R=X[A]\|\|=[];if(R.forEach((f,F)=>{if(f&&(f.isDead\|\|Date.now()-(f.dialedAt??f.created)>k0)){if(f.isDead)T.set(A,Date.now()+30000);f.destroy(),delete R[F]}}),R[W]\|\|R.filter(Boolean).length>=2\|\|T.get(A)>Date.now())return;if(Object.values(X).reduce((f,F)=>f+F.filter((o)=>o&&!o.isDead).length,0)>=GJ)return;let P=Y.pop(),I=P?U$(P):e(!0);if(!I){T.set(A,Date.now()+30000);return}I.dialedAt=Date.now();let[_,{offer:y}]=await V$([e$(Q0(v,A)),I.offerPromise.then(t).then((f)=>({offer:f}))]);R[W]=I,I.setHandlers({connect:()=>k(I,A),close:()=>z$(I,A)}),V(_,s({peerId:Z$,offer:y,peer:I}))}},H=[],x=[];z.forEach(async(W,Z)=>{let D=await W;if(!D)return;let[V,O]=await V$([b,G$]);x[Z]=J(D,V,O,$$(Z));let B=async()=>{let A=await q(D,V,O);H[Z]=setTimeout(B,typeof A==="number"?A:zJ)};B()}),Q[N]\|\|={};let M=YQ((W)=>L=W,(W)=>delete j[W],()=>M.onCleanup?.());return M.onCleanup=()=>{if(delete Q[N][K],H.forEach(clearTimeout),x.forEach((W)=>W?.()),Object.keys(Q).length===0)clearInterval(Q.offerCleanupTimer),delete Q.offerCleanupTimer},M._census=()=>{for(let Z of Object.keys(j))w.set(Z,Date.now());let W=Date.now()-120000;for(let[Z,D]of w)if(D<W)w.delete(Z);return[...w.keys()]},Q[N][K]=M}};var ZQ=3333,S0={},UQ={},KQ=($,J)=>{let q={},Q=null,G=()=>{if(Q)clearTimeout(Q),Q=null;let z=new WebSocket($);z.onclose=()=>{S0[$]??=ZQ,Q=setTimeout(G,S0[$]),S0[$]=2},z.onmessage=(Y)=>J(Y.data),q.socket=z,q.url=z.url,q.ready=new Promise((Y)=>{z.onopen=()=>{S0[$]=ZQ,Y(q)}}),q.send=(Y)=>{if(z.readyState===1)z.send(Y)}};return q.forceReconnect=G,G(),UQ[$]=q,q};if(typeof window<"u"){let $=()=>{Object.values(UQ).forEach((J)=>{if(J.socket&&J.socket.readyState!==WebSocket.OPEN&&J.socket.readyState!==WebSocket.CONNECTING)J.forceReconnect()})};window.addEventListener("online",()=>{$()}),window.addEventListener("offline",async()=>{}),document.addEventListener("visibilitychange",()=>{if(document.visibilityState==="visible")$()})}var jQ=($)=>()=>x0($Q($).map(([J,q])=>[J,q.socket])),MQ=($,J,q,Q)=>($.relayUrls??(Q?JQ(J,T0($.appId)):J)).slice(0,$.relayUrls?.length??$.relayRedundancy??q);var l$={},YJ=10,VQ="x",CQ="EVENT",XJ=/pow:\s(\d+)\sbits needed\.?/i,q8=new Set,HQ=B0.utils.randomSecretKey(),ZJ=A0(B0.getPublicKey(HQ)),G8={},z0={},UJ={},OQ=()=>Math.floor(Date.now()/1000),BQ=($)=>UJ[$]??=T0($,1e4)+20000,P0=($)=>$.replace(/\/$/,""),KJ=["wss://relay.primal.net","wss://ftp.halifax.rwth-aachen.de/nostr","wss://nostr.oxtr.dev","wss://nostr.sathoarder.com","wss://nostr.mom","wss://nos.lol","wss://nostr.vulpem.com","wss://nostr.data.haus","wss://relay.mostro.network","wss://relay.nostrdice.com"],jJ=($,J)=>{let[q,Q,G,z]=v$(J);if(q===CQ)return z0[Q]?.(G8[Q],G.content);if(q==="NOTICE"\|\|q==="OK"&&!G){if(+((q==="NOTICE"?Q:z).match(XJ)?.[1]??0)>0){let U=P0($);q8.add(U),l$[U]?.close?.(),delete l$[U]}}},MJ=($)=>{let J=P0($);if(l$[J])return l$[J];let q=KQ(J,(Q)=>jJ(J,Q));return l$[J]=q},DQ=async($,J)=>{let q={kind:BQ($),content:J,pubkey:ZJ,created_at:OQ(),tags:[[VQ,$]]},Q=X$(s([0,q.pubkey,q.created_at,q.kind,q.tags,q.content])),G=new Uint8Array(await crypto.subtle.digest("SHA-256",Q)),z=B0.sign(G,HQ);return s([CQ,{...q,id:A0(G),sig:A0(z)}])},WQ=($,J)=>{return G8[$]=J,s(["REQ",$,{kinds:[BQ(J)],since:OQ(),["#"+VQ]:[J]}])},NQ=($)=>{return delete G8[$],s(["CLOSE",$])},DJ=XQ({init:($)=>{let q=($?.relayUrls?.length?$.relayUrls:null)??KJ;return MQ($,q,YJ,!1).map(MJ).map((G)=>G.ready.then(()=>G).catch(()=>null))},subscribe:($,J,q,Q)=>{let G=m$(64),z=m$(64);return z0[G]=z0[z]=(Y,U)=>Q(Y,U,async(K,C)=>{if(q8.has(P0($.url)))return;$.send(await DQ(K,C))}),$.send(WQ(G,J)),$.send(WQ(z,q)),()=>{$.send(NQ(G)),$.send(NQ(z)),delete z0[G],delete z0[z]}},announce:async($,J)=>{if(q8.has(P0($.url)))return;$.send(await DQ(J,s({peerId:Z$})))}}),WJ=jQ(l$);export{Z$ as selfId,DJ as join,WJ as getRelaySockets};

package/dist/genosrtc.min.js.gz CHANGED Viewed

Binary file

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "genosdb",
-  "version": "0.17.0",
+  "version": "0.18.0",
   "description": "GenosDB (GDB): distributed graph database in real-time, peer-to-peer, scalable storage - efficient querying of complex relationships.",
   "main": "dist/index.js",
   "type": "module",