genosdb 0.12.7 → 0.12.8

package/dist/genosrtc-cells.min.js

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

package/dist/genosrtc.min.js

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