npm - @rizom/ops - Versions diffs - 0.2.0-alpha.132 → 0.2.0-alpha.134 - Mend

@rizom/ops 0.2.0-alpha.132 → 0.2.0-alpha.134

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

Files changed (4) hide show

package/dist/brains-ops.js +1 -1
package/dist/index.js +1 -1
package/package.json +1 -1
package/templates/rover-pilot/docs/user-onboarding.md +81 -179

package/dist/brains-ops.js CHANGED Viewed

@@ -54,7 +54,7 @@ return `+str.trim()+`;
 `).join(`
 `+Y),$.push(Q+"m+"+j9.exports.humanize(this.diff)+"\x1B[0m")}else $[0]=BT()+q+" "+$[0]}function BT(){if(rD.inspectOpts.hideDate)return"";return new Date().toISOString()+" "}function TT(...$){return process.stderr.write(w9.formatWithOptions(rD.inspectOpts,...$)+`
 `)}function ST($){if($)process.env.DEBUG=$;else delete process.env.DEBUG}function IT(){return process.env.DEBUG}function CT($){$.inspectOpts={};let q=Object.keys(rD.inspectOpts);for(let J=0;J<q.length;J++)$.inspectOpts[q[J]]=rD.inspectOpts[q[J]]}j9.exports=CW()(rD);var{formatters:lD}=j9.exports;lD.o=function($){return this.inspectOpts.colors=this.useColors,w9.inspect($,this.inspectOpts).split(`
-`).map((q)=>q.trim()).join(" ")};lD.O=function($){return this.inspectOpts.colors=this.useColors,w9.inspect($,this.inspectOpts)}});var cD=X$((ty,PW)=>{if(typeof process>"u"||process.type==="renderer"||!1||process.__nwjs)PW.exports=yD();else PW.exports=dD()});var iK=X$((Cu,rK)=>{var P9=Object.prototype.hasOwnProperty,lK=Object.prototype.toString,yK=Object.defineProperty,fK=Object.getOwnPropertyDescriptor,xK=function(q){if(typeof Array.isArray==="function")return Array.isArray(q);return lK.call(q)==="[object Array]"},hK=function(q){if(!q||lK.call(q)!=="[object Object]")return!1;var J=P9.call(q,"constructor"),G=q.constructor&&q.constructor.prototype&&P9.call(q.constructor.prototype,"isPrototypeOf");if(q.constructor&&!J&&!G)return!1;var Q;for(Q in q);return typeof Q>"u"||P9.call(q,Q)},uK=function(q,J){if(yK&&J.name==="__proto__")yK(q,J.name,{enumerable:!0,configurable:!0,value:J.newValue,writable:!0});else q[J.name]=J.newValue},pK=function(q,J){if(J==="__proto__"){if(!P9.call(q,J))return;else if(fK)return fK(q,J).value}return q[J]};rK.exports=function $(){var q,J,G,Q,Y,X,U=arguments[0],W=1,V=arguments.length,M=!1;if(typeof U==="boolean")M=U,U=arguments[1]||{},W=2;if(U==null||typeof U!=="object"&&typeof U!=="function")U={};for(;W<V;++W)if(q=arguments[W],q!=null){for(J in q)if(G=pK(U,J),Q=pK(q,J),U!==Q){if(M&&Q&&(hK(Q)||(Y=xK(Q)))){if(Y)Y=!1,X=G&&xK(G)?G:[];else X=G&&hK(G)?G:{};uK(U,{name:J,newValue:$(M,X,Q)})}else if(typeof Q<"u")uK(U,{name:J,newValue:Q})}}return U}});import{parseArgs as IO}from"util";var CO={help:{type:"boolean",short:"h"},version:{type:"boolean",short:"v"},"dry-run":{type:"boolean"},"push-to":{type:"string"},cohort:{type:"string"},"anchor-id":{type:"string"}};function s9($,q){let J=$[q];return typeof J==="boolean"?J:void 0}function t9($,q){let J=$[q];return typeof J==="string"?J:void 0}function b7($){let{values:q,positionals:J}=IO({args:$,options:CO,allowPositionals:!0});if(q.help)return{command:"help",args:[],flags:{help:!0}};if(q.version)return{command:"version",args:[],flags:{version:!0}};return{command:J[0]??"help",args:J.slice(1),flags:{help:s9(q,"help"),version:s9(q,"version"),dryRun:s9(q,"dry-run"),pushTo:t9(q,"push-to"),cohort:t9(q,"cohort"),anchorId:t9(q,"anchor-id")}}}var sQ={name:"@rizom/ops",description:"Operator CLI for managing private brain fleet registry repos",publishConfig:{access:"public"},version:"0.2.0-alpha.132",type:"module",exports:{".":{types:"./dist/index.d.ts",import:"./dist/index.js"},"./deploy":{bun:"./dist/deploy.js",types:"./dist/deploy.d.ts",import:"./dist/deploy.js"}},main:"./dist/index.js",types:"./dist/index.d.ts",bin:{"brains-ops":"./dist/brains-ops.js"},files:["dist","templates"],scripts:{build:"bun scripts/build.ts",prepublishOnly:"bun scripts/build.ts",typecheck:"tsc --noEmit",lint:"eslint . --ext .ts","lint:fix":"eslint . --ext .ts --fix",test:"bun run build && bun test --timeout 20000","test:smoke":"bun run build && RUN_SMOKE_TESTS=1 bun test --timeout 60000"},dependencies:{"age-encryption":"^0.3.0"},devDependencies:{"@brains/deploy-support":"workspace:*","@brains/eslint-config":"workspace:*","@brains/typescript-config":"workspace:*","@brains/utils":"workspace:*","@types/bun":"latest",typescript:"^5.3.3"},repository:{type:"git",url:"https://github.com/rizom-ai/brains.git",directory:"packages/brains-ops"},license:"Apache-2.0",author:"Yeehaa <yeehaa@rizom.ai> (https://rizom.ai)",homepage:"https://github.com/rizom-ai/brains/tree/main/packages/brains-ops#readme",bugs:"https://github.com/rizom-ai/brains/issues",engines:{bun:">=1.3.3"},keywords:["brains","ops","cli","deploy","fleet","operator"]};import{existsSync as Ww,mkdirSync as Vw,readFileSync as hU,writeFileSync as uU}from"fs";import{dirname as Mw,join as fM}from"path";function e9($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function E$($,q=""){if(typeof $!=="number"){let J=q&&`"${q}" `;throw TypeError(`${J}expected number, got ${typeof $}`)}if(!Number.isSafeInteger($)||$<0){let J=q&&`"${q}" `;throw RangeError(`${J}expected integer >= 0, got ${$}`)}}function u$($,q,J=""){let G=e9($),Q=$?.length,Y=q!==void 0;if(!G||Y&&Q!==q){let X=J&&`"${J}" `,U=Y?` of length ${q}`:"",W=G?`length=${Q}`:`type=${typeof $}`,V=X+"expected Uint8Array"+U+", got "+W;if(!G)throw TypeError(V);throw RangeError(V)}return $}function Aq($){if(typeof $!=="function"||typeof $.create!=="function")throw TypeError("Hash must wrapped by utils.createHasher");if(E$($.outputLen),E$($.blockLen),$.outputLen<1)throw Error('"outputLen" must be >= 1');if($.blockLen<1)throw Error('"blockLen" must be >= 1')}function A8($,q=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(q&&$.finished)throw Error("Hash#digest() has already been called")}function tQ($,q){u$($,void 0,"digestInto() output");let J=q.outputLen;if($.length<J)throw RangeError('"digestInto() output" expected to be of length >='+J)}function eQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function R0(...$){for(let q=0;q<$.length;q++)$[q].fill(0)}function Z8($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function u0($,q){return $<<32-q|$>>>q}function N$($,q){return $<<q|$>>>32-q>>>0}var LO=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function PO($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function FO($){for(let q=0;q<$.length;q++)$[q]=PO($[q]);return $}var $X=LO?($)=>$:FO,m7=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),gO=Array.from({length:256},($,q)=>q.toString(16).padStart(2,"0"));function $Y($){if(u$($),m7)return $.toHex();let q="";for(let J=0;J<$.length;J++)q+=gO[$[J]];return q}var jq={_0:48,_9:57,A:65,F:70,a:97,f:102};function k7($){if($>=jq._0&&$<=jq._9)return $-jq._0;if($>=jq.A&&$<=jq.F)return $-(jq.A-10);if($>=jq.a&&$<=jq.f)return $-(jq.a-10);return}function gG($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);if(m7)try{return Uint8Array.fromHex($)}catch(Q){if(Q instanceof SyntaxError)throw RangeError(Q.message);throw Q}let q=$.length,J=q/2;if(q%2)throw RangeError("hex string expected, got unpadded hex of length "+q);let G=new Uint8Array(J);for(let Q=0,Y=0;Q<J;Q++,Y+=2){let X=k7($.charCodeAt(Y)),U=k7($.charCodeAt(Y+1));if(X===void 0||U===void 0){let W=$[Y]+$[Y+1];throw RangeError('hex string expected, got non-hex character "'+W+'" at index '+Y)}G[Q]=X*16+U}return G}function _O($){if(typeof $!=="string")throw TypeError("string expected");return new Uint8Array(new TextEncoder().encode($))}function qX($,q=""){if(typeof $==="string")return _O($);return u$($,void 0,q)}function JX(...$){let q=0;for(let G=0;G<$.length;G++){let Q=$[G];u$(Q),q+=Q.length}let J=new Uint8Array(q);for(let G=0,Q=0;G<$.length;G++){let Y=$[G];J.set(Y,Q),Q+=Y.length}return J}function qY($,q){if(q!==void 0&&{}.toString.call(q)!=="[object Object]")throw TypeError("options must be object or undefined");return Object.assign($,q)}function GX($,q={}){let J=(Q,Y)=>$(Y).update(Q).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.canXOF=G.canXOF,J.create=(Q)=>$(Q),Object.assign(J,q),Object.freeze(J)}function Zq($=32){E$($,"bytesLength");let q=typeof globalThis==="object"?globalThis.crypto:null;if(typeof q?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");if($>65536)throw RangeError(`"bytesLength" expected <= 65536, got ${$}`);return q.getRandomValues(new Uint8Array($))}var QX=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});class YX{oHash;iHash;blockLen;outputLen;canXOF=!1;finished=!1;destroyed=!1;constructor($,q){if(Aq($),u$(q,void 0,"key"),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 J=this.blockLen,G=new Uint8Array(J);G.set(q.length>J?$.create().update(q).digest():q);for(let Q=0;Q<G.length;Q++)G[Q]^=54;this.iHash.update(G),this.oHash=$.create();for(let Q=0;Q<G.length;Q++)G[Q]^=106;this.oHash.update(G),R0(G)}update($){return A8(this),this.iHash.update($),this}digestInto($){A8(this),tQ($,this),this.finished=!0;let q=$.subarray(0,this.outputLen);this.iHash.digestInto(q),this.oHash.update(q),this.oHash.digestInto(q),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$||=Object.create(Object.getPrototypeOf(this),{});let{oHash:q,iHash:J,finished:G,destroyed:Q,blockLen:Y,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=Q,$.blockLen=Y,$.outputLen=X,$.oHash=q._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var qq=(()=>{let $=(q,J,G)=>new YX(q,J).update(G).digest();return $.create=(q,J)=>new YX(q,J),$})();function _G($,q,J){if(Aq($),J===void 0)J=new Uint8Array($.outputLen);return qq($,J,q)}var XX=Uint8Array.of(0),y7=Uint8Array.of();function UX($,q,J,G=32){Aq($),E$(G,"length"),u$(q,void 0,"prk");let Q=$.outputLen;if(q.length<Q)throw Error('"prk" must be at least HashLen octets');if(G>255*Q)throw Error("Length must be <= 255*HashLen");let Y=Math.ceil(G/Q);if(J===void 0)J=y7;else u$(J,void 0,"info");let X=new Uint8Array(Y*Q),U=qq.create($,q),W=U._cloneInto(),V=new Uint8Array(U.outputLen);for(let M=0;M<Y;M++)XX[0]=M+1,W.update(M===0?y7:V).update(J).update(XX).digestInto(V),X.set(V,Q*M),U._cloneInto(W);return U.destroy(),W.destroy(),R0(V,XX),X.slice(0,G)}var lq=($,q,J,G,Q)=>UX($,_G($,q,J),G,Q);function f7($,q,J){return $&q^~$&J}function x7($,q,J){return $&q^$&J^q&J}class JY{blockLen;outputLen;canXOF=!1;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,q,J,G){this.blockLen=$,this.outputLen=q,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=Z8(this.buffer)}update($){A8(this),u$($);let{view:q,buffer:J,blockLen:G}=this,Q=$.length;for(let Y=0;Y<Q;){let X=Math.min(G-this.pos,Q-Y);if(X===G){let U=Z8($);for(;G<=Q-Y;Y+=G)this.process(U,Y);continue}if(J.set($.subarray(Y,Y+X),this.pos),this.pos+=X,Y+=X,this.pos===G)this.process(q,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){A8(this),tQ($,this),this.finished=!0;let{buffer:q,view:J,blockLen:G,isLE:Q}=this,{pos:Y}=this;if(q[Y++]=128,R0(this.buffer.subarray(Y)),this.padOffset>G-Y)this.process(J,0),Y=0;for(let M=Y;M<G;M++)q[M]=0;J.setBigUint64(G-8,BigInt(this.length*8),Q),this.process(J,0);let X=Z8($),U=this.outputLen;if(U%4)throw Error("_sha2: outputLen must be aligned to 32bit");let W=U/4,V=this.get();if(W>V.length)throw Error("_sha2: outputLen bigger than state");for(let M=0;M<W;M++)X.setUint32(4*M,V[M],Q)}digest(){let{buffer:$,outputLen:q}=this;this.digestInto($);let J=$.slice(0,q);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:q,buffer:J,length:G,finished:Q,destroyed:Y,pos:X}=this;if($.destroyed=Y,$.finished=Q,$.length=G,$.pos=X,G%q)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var Bq=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),Tq=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),p$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),l$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var GY=BigInt(4294967295),h7=BigInt(32);function vO($,q=!1){if(q)return{h:Number($&GY),l:Number($>>h7&GY)};return{h:Number($>>h7&GY)|0,l:Number($&GY)|0}}function u7($,q=!1){let J=$.length,G=new Uint32Array(J),Q=new Uint32Array(J);for(let Y=0;Y<J;Y++){let{h:X,l:U}=vO($[Y],q);[G[Y],Q[Y]]=[X,U]}return[G,Q]}var WX=($,q,J)=>$>>>J,VX=($,q,J)=>$<<32-J|q>>>J,CJ=($,q,J)=>$>>>J|q<<32-J,EJ=($,q,J)=>$<<32-J|q>>>J,vG=($,q,J)=>$<<64-J|q>>>J-32,bG=($,q,J)=>$>>>J-32|q<<64-J;function Jq($,q,J,G){let Q=(q>>>0)+(G>>>0);return{h:$+J+(Q/4294967296|0)|0,l:Q|0}}var p7=($,q,J)=>($>>>0)+(q>>>0)+(J>>>0),l7=($,q,J,G)=>q+J+G+($/4294967296|0)|0,r7=($,q,J,G)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0),i7=($,q,J,G,Q)=>q+J+G+Q+($/4294967296|0)|0,d7=($,q,J,G,Q)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0)+(Q>>>0),c7=($,q,J,G,Q,Y)=>q+J+G+Q+Y+($/4294967296|0)|0;var kO=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]),rq=new Uint32Array(64);class MX extends JY{constructor($){super(64,$,8,!1)}get(){let{A:$,B:q,C:J,D:G,E:Q,F:Y,G:X,H:U}=this;return[$,q,J,G,Q,Y,X,U]}set($,q,J,G,Q,Y,X,U){this.A=$|0,this.B=q|0,this.C=J|0,this.D=G|0,this.E=Q|0,this.F=Y|0,this.G=X|0,this.H=U|0}process($,q){for(let M=0;M<16;M++,q+=4)rq[M]=$.getUint32(q,!1);for(let M=16;M<64;M++){let z=rq[M-15],D=rq[M-2],R=u0(z,7)^u0(z,18)^z>>>3,N=u0(D,17)^u0(D,19)^D>>>10;rq[M]=N+rq[M-7]+R+rq[M-16]|0}let{A:J,B:G,C:Q,D:Y,E:X,F:U,G:W,H:V}=this;for(let M=0;M<64;M++){let z=u0(X,6)^u0(X,11)^u0(X,25),D=V+z+f7(X,U,W)+kO[M]+rq[M]|0,N=(u0(J,2)^u0(J,13)^u0(J,22))+x7(J,G,Q)|0;V=W,W=U,U=X,X=Y+D|0,Y=Q,Q=G,G=J,J=D+N|0}J=J+this.A|0,G=G+this.B|0,Q=Q+this.C|0,Y=Y+this.D|0,X=X+this.E|0,U=U+this.F|0,W=W+this.G|0,V=V+this.H|0,this.set(J,G,Q,Y,X,U,W,V)}roundClean(){R0(rq)}destroy(){this.destroyed=!0,this.set(0,0,0,0,0,0,0,0),R0(this.buffer)}}class n7 extends MX{A=Bq[0]|0;B=Bq[1]|0;C=Bq[2]|0;D=Bq[3]|0;E=Bq[4]|0;F=Bq[5]|0;G=Bq[6]|0;H=Bq[7]|0;constructor(){super(32)}}class mO extends MX{A=Tq[0]|0;B=Tq[1]|0;C=Tq[2]|0;D=Tq[3]|0;E=Tq[4]|0;F=Tq[5]|0;G=Tq[6]|0;H=Tq[7]|0;constructor(){super(28)}}var o7=(()=>u7(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map(($)=>BigInt($))))(),yO=(()=>o7[0])(),fO=(()=>o7[1])(),iq=new Uint32Array(80),dq=new Uint32Array(80);class kG extends JY{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:q,Bh:J,Bl:G,Ch:Q,Cl:Y,Dh:X,Dl:U,Eh:W,El:V,Fh:M,Fl:z,Gh:D,Gl:R,Hh:N,Hl:w}=this;return[$,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w]}set($,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w){this.Ah=$|0,this.Al=q|0,this.Bh=J|0,this.Bl=G|0,this.Ch=Q|0,this.Cl=Y|0,this.Dh=X|0,this.Dl=U|0,this.Eh=W|0,this.El=V|0,this.Fh=M|0,this.Fl=z|0,this.Gh=D|0,this.Gl=R|0,this.Hh=N|0,this.Hl=w|0}process($,q){for(let S=0;S<16;S++,q+=4)iq[S]=$.getUint32(q),dq[S]=$.getUint32(q+=4);for(let S=16;S<80;S++){let _=iq[S-15]|0,y=dq[S-15]|0,p=CJ(_,y,1)^CJ(_,y,8)^WX(_,y,7),F=EJ(_,y,1)^EJ(_,y,8)^VX(_,y,7),f=iq[S-2]|0,m=dq[S-2]|0,k=CJ(f,m,19)^vG(f,m,61)^WX(f,m,6),l=EJ(f,m,19)^bG(f,m,61)^VX(f,m,6),v=r7(F,l,dq[S-7],dq[S-16]),C=i7(v,p,k,iq[S-7],iq[S-16]);iq[S]=C|0,dq[S]=v|0}let{Ah:J,Al:G,Bh:Q,Bl:Y,Ch:X,Cl:U,Dh:W,Dl:V,Eh:M,El:z,Fh:D,Fl:R,Gh:N,Gl:w,Hh:j,Hl:B}=this;for(let S=0;S<80;S++){let _=CJ(M,z,14)^CJ(M,z,18)^vG(M,z,41),y=EJ(M,z,14)^EJ(M,z,18)^bG(M,z,41),p=M&D^~M&N,F=z&R^~z&w,f=d7(B,y,F,fO[S],dq[S]),m=c7(f,j,_,p,yO[S],iq[S]),k=f|0,l=CJ(J,G,28)^vG(J,G,34)^vG(J,G,39),v=EJ(J,G,28)^bG(J,G,34)^bG(J,G,39),C=J&Q^J&X^Q&X,I=G&Y^G&U^Y&U;j=N|0,B=w|0,N=D|0,w=R|0,D=M|0,R=z|0,{h:M,l:z}=Jq(W|0,V|0,m|0,k|0),W=X|0,V=U|0,X=Q|0,U=Y|0,Q=J|0,Y=G|0;let A=p7(k,v,I);J=l7(A,m,l,C),G=A|0}({h:J,l:G}=Jq(this.Ah|0,this.Al|0,J|0,G|0)),{h:Q,l:Y}=Jq(this.Bh|0,this.Bl|0,Q|0,Y|0),{h:X,l:U}=Jq(this.Ch|0,this.Cl|0,X|0,U|0),{h:W,l:V}=Jq(this.Dh|0,this.Dl|0,W|0,V|0),{h:M,l:z}=Jq(this.Eh|0,this.El|0,M|0,z|0),{h:D,l:R}=Jq(this.Fh|0,this.Fl|0,D|0,R|0),{h:N,l:w}=Jq(this.Gh|0,this.Gl|0,N|0,w|0),{h:j,l:B}=Jq(this.Hh|0,this.Hl|0,j|0,B|0),this.set(J,G,Q,Y,X,U,W,V,M,z,D,R,N,w,j,B)}roundClean(){R0(iq,dq)}destroy(){this.destroyed=!0,R0(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class a7 extends kG{Ah=l$[0]|0;Al=l$[1]|0;Bh=l$[2]|0;Bl=l$[3]|0;Ch=l$[4]|0;Cl=l$[5]|0;Dh=l$[6]|0;Dl=l$[7]|0;Eh=l$[8]|0;El=l$[9]|0;Fh=l$[10]|0;Fl=l$[11]|0;Gh=l$[12]|0;Gl=l$[13]|0;Hh=l$[14]|0;Hl=l$[15]|0;constructor(){super(64)}}class xO extends kG{Ah=p$[0]|0;Al=p$[1]|0;Bh=p$[2]|0;Bl=p$[3]|0;Ch=p$[4]|0;Cl=p$[5]|0;Dh=p$[6]|0;Dl=p$[7]|0;Eh=p$[8]|0;El=p$[9]|0;Fh=p$[10]|0;Fl=p$[11]|0;Gh=p$[12]|0;Gl=p$[13]|0;Hh=p$[14]|0;Hl=p$[15]|0;constructor(){super(48)}}var t$=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),e$=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class hO extends kG{Ah=t$[0]|0;Al=t$[1]|0;Bh=t$[2]|0;Bl=t$[3]|0;Ch=t$[4]|0;Cl=t$[5]|0;Dh=t$[6]|0;Dl=t$[7]|0;Eh=t$[8]|0;El=t$[9]|0;Fh=t$[10]|0;Fl=t$[11]|0;Gh=t$[12]|0;Gl=t$[13]|0;Hh=t$[14]|0;Hl=t$[15]|0;constructor(){super(28)}}class uO extends kG{Ah=e$[0]|0;Al=e$[1]|0;Bh=e$[2]|0;Bl=e$[3]|0;Ch=e$[4]|0;Cl=e$[5]|0;Dh=e$[6]|0;Dl=e$[7]|0;Eh=e$[8]|0;El=e$[9]|0;Fh=e$[10]|0;Fl=e$[11]|0;Gh=e$[12]|0;Gl=e$[13]|0;Hh=e$[14]|0;Hl=e$[15]|0;constructor(){super(32)}}var L$=GX(()=>new n7,QX(1));var QY=GX(()=>new a7,QX(3));/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function VY($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function DX($){if(!VY($))throw Error("Uint8Array expected")}function q5($,q){if(!Array.isArray(q))return!1;if(q.length===0)return!0;if($)return q.every((J)=>typeof J==="string");else return q.every((J)=>Number.isSafeInteger(J))}function J5($){if(typeof $!=="function")throw Error("function expected");return!0}function cq($,q){if(typeof q!=="string")throw Error(`${$}: string expected`);return!0}function yG($){if(!Number.isSafeInteger($))throw Error(`invalid integer: ${$}`)}function XY($){if(!Array.isArray($))throw Error("array expected")}function UY($,q){if(!q5(!0,q))throw Error(`${$}: array of strings expected`)}function KX($,q){if(!q5(!1,q))throw Error(`${$}: array of numbers expected`)}function C0(...$){let q=(Y)=>Y,J=(Y,X)=>(U)=>Y(X(U)),G=$.map((Y)=>Y.encode).reduceRight(J,q),Q=$.map((Y)=>Y.decode).reduce(J,q);return{encode:G,decode:Q}}function E0($){let q=typeof $==="string"?$.split(""):$,J=q.length;UY("alphabet",q);let G=new Map(q.map((Q,Y)=>[Q,Y]));return{encode:(Q)=>{return XY(Q),Q.map((Y)=>{if(!Number.isSafeInteger(Y)||Y<0||Y>=J)throw Error(`alphabet.encode: digit index outside alphabet "${Y}". Allowed: ${$}`);return q[Y]})},decode:(Q)=>{return XY(Q),Q.map((Y)=>{cq("alphabet.decode",Y);let X=G.get(Y);if(X===void 0)throw Error(`Unknown letter: "${Y}". Allowed: ${$}`);return X})}}}function L0($=""){return cq("join",$),{encode:(q)=>{return UY("join.decode",q),q.join($)},decode:(q)=>{return cq("join.decode",q),q.split($)}}}function MY($,q="="){return yG($),cq("padding",q),{encode(J){UY("padding.encode",J);while(J.length*$%8)J.push(q);return J},decode(J){UY("padding.decode",J);let G=J.length;if(G*$%8)throw Error("padding: invalid, string should have whole number of bytes");for(;G>0&&J[G-1]===q;G--)if((G-1)*$%8===0)throw Error("padding: invalid, string has too much padding");return J.slice(0,G)}}}function G5($){return J5($),{encode:(q)=>q,decode:(q)=>$(q)}}function s7($,q,J){if(q<2)throw Error(`convertRadix: invalid from=${q}, base cannot be less than 2`);if(J<2)throw Error(`convertRadix: invalid to=${J}, base cannot be less than 2`);if(XY($),!$.length)return[];let G=0,Q=[],Y=Array.from($,(U)=>{if(yG(U),U<0||U>=q)throw Error(`invalid integer: ${U}`);return U}),X=Y.length;while(!0){let U=0,W=!0;for(let V=G;V<X;V++){let M=Y[V],z=q*U,D=z+M;if(!Number.isSafeInteger(D)||z/q!==U||D-M!==z)throw Error("convertRadix: carry overflow");let R=D/J;U=D%J;let N=Math.floor(R);if(Y[V]=N,!Number.isSafeInteger(N)||N*J+U!==D)throw Error("convertRadix: carry overflow");if(!W)continue;else if(!N)G=V;else W=!1}if(Q.push(U),W)break}for(let U=0;U<$.length-1&&$[U]===0;U++)Q.push(0);return Q.reverse()}var Q5=($,q)=>q===0?$:Q5(q,$%q),WY=($,q)=>$+(q-Q5($,q)),YY=(()=>{let $=[];for(let q=0;q<40;q++)$.push(2**q);return $})();function zX($,q,J,G){if(XY($),q<=0||q>32)throw Error(`convertRadix2: wrong from=${q}`);if(J<=0||J>32)throw Error(`convertRadix2: wrong to=${J}`);if(WY(q,J)>32)throw Error(`convertRadix2: carry overflow from=${q} to=${J} carryBits=${WY(q,J)}`);let Q=0,Y=0,X=YY[q],U=YY[J]-1,W=[];for(let V of $){if(yG(V),V>=X)throw Error(`convertRadix2: invalid data word=${V} from=${q}`);if(Q=Q<<q|V,Y+q>32)throw Error(`convertRadix2: carry overflow pos=${Y} from=${q}`);Y+=q;for(;Y>=J;Y-=J)W.push((Q>>Y-J&U)>>>0);let M=YY[Y];if(M===void 0)throw Error("invalid carry");Q&=M-1}if(Q=Q<<J-Y&U,!G&&Y>=q)throw Error("Excess padding");if(!G&&Q>0)throw Error(`Non-zero padding: ${Q}`);if(G&&Y>0)W.push(Q>>>0);return W}function pO($){yG($);let q=256;return{encode:(J)=>{if(!VY(J))throw Error("radix.encode input should be Uint8Array");return s7(Array.from(J),q,$)},decode:(J)=>{return KX("radix.decode",J),Uint8Array.from(s7(J,$,q))}}}function v0($,q=!1){if(yG($),$<=0||$>32)throw Error("radix2: bits should be in (0..32]");if(WY(8,$)>32||WY($,8)>32)throw Error("radix2: carry overflow");return{encode:(J)=>{if(!VY(J))throw Error("radix2.encode input should be Uint8Array");return zX(Array.from(J),8,$,!q)},decode:(J)=>{return KX("radix2.decode",J),Uint8Array.from(zX(J,$,8,q))}}}function t7($){return J5($),function(...q){try{return $.apply(null,q)}catch(J){}}}var kP=C0(v0(4),E0("0123456789ABCDEF"),L0("")),mP=C0(v0(5),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),MY(5),L0("")),yP=C0(v0(5),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),L0("")),fP=C0(v0(5),E0("0123456789ABCDEFGHIJKLMNOPQRSTUV"),MY(5),L0("")),xP=C0(v0(5),E0("0123456789ABCDEFGHIJKLMNOPQRSTUV"),L0("")),hP=C0(v0(5),E0("0123456789ABCDEFGHJKMNPQRSTVWXYZ"),L0(""),G5(($)=>$.toUpperCase().replace(/O/g,"0").replace(/[IL]/g,"1"))),Y5=(()=>typeof Uint8Array.from([]).toBase64==="function"&&typeof Uint8Array.fromBase64==="function")(),X5=($,q)=>{cq("base64",$);let J=q?/^[A-Za-z0-9=_-]+$/:/^[A-Za-z0-9=+/]+$/,G=q?"base64url":"base64";if($.length>0&&!J.test($))throw Error("invalid base64");return Uint8Array.fromBase64($,{alphabet:G,lastChunkHandling:"strict"})},HX=Y5?{encode($){return DX($),$.toBase64()},decode($){return X5($,!1)}}:C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),MY(6),L0("")),$0=C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),L0("")),uP=Y5?{encode($){return DX($),$.toBase64({alphabet:"base64url"})},decode($){return X5($,!0)}}:C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),MY(6),L0("")),pP=C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),L0("")),OX=($)=>C0(pO(58),E0($),L0("")),lP=OX("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"),rP=OX("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"),iP=OX("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");var RX=C0(E0("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),L0("")),e7=[996825010,642813549,513874426,1027748829,705979059];function mG($){let q=$>>25,J=($&33554431)<<5;for(let G=0;G<e7.length;G++)if((q>>G&1)===1)J^=e7[G];return J}function $5($,q,J=1){let G=$.length,Q=1;for(let Y=0;Y<G;Y++){let X=$.charCodeAt(Y);if(X<33||X>126)throw Error(`Invalid prefix (${$})`);Q=mG(Q)^X>>5}Q=mG(Q);for(let Y=0;Y<G;Y++)Q=mG(Q)^$.charCodeAt(Y)&31;for(let Y of q)Q=mG(Q)^Y;for(let Y=0;Y<6;Y++)Q=mG(Q);return Q^=J,RX.encode(zX([Q%YY[30]],30,5,!1))}function U5($){let q=$==="bech32"?1:734539939,J=v0(5),G=J.decode,Q=J.encode,Y=t7(G);function X(z,D,R=90){if(cq("bech32.encode prefix",z),VY(D))D=Array.from(D);KX("bech32.encode",D);let N=z.length;if(N===0)throw TypeError(`Invalid prefix length ${N}`);let w=N+7+D.length;if(R!==!1&&w>R)throw TypeError(`Length ${w} exceeds limit ${R}`);let j=z.toLowerCase(),B=$5(j,D,q);return`${j}1${RX.encode(D)}${B}`}function U(z,D=90){cq("bech32.decode input",z);let R=z.length;if(R<8||D!==!1&&R>D)throw TypeError(`invalid string length: ${R} (${z}). Expected (8..${D})`);let N=z.toLowerCase();if(z!==N&&z!==z.toUpperCase())throw Error("String must be lowercase or uppercase");let w=N.lastIndexOf("1");if(w===0||w===-1)throw Error('Letter "1" must be present between prefix and data only');let j=N.slice(0,w),B=N.slice(w+1);if(B.length<6)throw Error("Data must be at least 6 characters long");let S=RX.decode(B).slice(0,-6),_=$5(j,S,q);if(!B.endsWith(_))throw Error(`Invalid checksum in ${z}: expected "${_}"`);return{prefix:j,words:S}}let W=t7(U);function V(z){let{prefix:D,words:R}=U(z,!1);return{prefix:D,words:R,bytes:G(R)}}function M(z,D){return X(z,Q(D))}return{encode:X,decode:U,encodeFromBytes:M,decodeToBytes:V,decodeUnsafe:W,fromWords:G,fromWordsUnsafe:Y,toWords:Q}}var P0=U5("bech32"),dP=U5("bech32m");var lO=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),rO={encode($){return DX($),$.toHex()},decode($){return cq("hex",$),Uint8Array.fromHex($)}},cP=lO?rO:C0(v0(4),E0("0123456789abcdef"),L0(""),G5(($)=>{if(typeof $!=="string"||$.length%2!==0)throw TypeError(`hex.decode: expected string, got ${typeof $} with length ${$.length}`);return $.toLowerCase()}));function dO($,q,J,G){Aq($);let Q=qY({dkLen:32,asyncTick:10},G),{c:Y,dkLen:X,asyncTick:U}=Q;if(E$(Y,"c"),E$(X,"dkLen"),E$(U,"asyncTick"),Y<1)throw Error("iterations (c) must be >= 1");if(X<1)throw Error('"dkLen" must be >= 1');if(X>4294967295*$.outputLen)throw Error("derived key too long");let W=qX(q,"password"),V=qX(J,"salt"),M=new Uint8Array(X),z=qq.create($,W),D=z._cloneInto().update(V);return{c:Y,dkLen:X,asyncTick:U,DK:M,PRF:z,PRFSalt:D}}function cO($,q,J,G,Q){if($.destroy(),q.destroy(),G)G.destroy();return R0(Q),J}function NX($,q,J,G){let{c:Q,dkLen:Y,DK:X,PRF:U,PRFSalt:W}=dO($,q,J,G),V,M=new Uint8Array(4),z=Z8(M),D=new Uint8Array(U.outputLen);for(let R=1,N=0;N<Y;R++,N+=U.outputLen){let w=X.subarray(N,N+U.outputLen);z.setInt32(0,R,!1),(V=W._cloneInto(V)).update(M).digestInto(D),w.set(D.subarray(0,w.length));for(let j=1;j<Q;j++){U._cloneInto(V).update(D).digestInto(D);for(let B=0;B<w.length;B++)w[B]^=D[B]}}return cO(U,W,X,V,D)}function W5($,q,J,G,Q,Y){let X=$[q++]^J[G++],U=$[q++]^J[G++],W=$[q++]^J[G++],V=$[q++]^J[G++],M=$[q++]^J[G++],z=$[q++]^J[G++],D=$[q++]^J[G++],R=$[q++]^J[G++],N=$[q++]^J[G++],w=$[q++]^J[G++],j=$[q++]^J[G++],B=$[q++]^J[G++],S=$[q++]^J[G++],_=$[q++]^J[G++],y=$[q++]^J[G++],p=$[q++]^J[G++],F=X,f=U,m=W,k=V,l=M,v=z,C=D,I=R,A=N,T=w,L=j,g=B,P=S,b=_,O=y,x=p;for(let r=0;r<8;r+=2)l^=N$(F+P|0,7),A^=N$(l+F|0,9),P^=N$(A+l|0,13),F^=N$(P+A|0,18),T^=N$(v+f|0,7),b^=N$(T+v|0,9),f^=N$(b+T|0,13),v^=N$(f+b|0,18),O^=N$(L+C|0,7),m^=N$(O+L|0,9),C^=N$(m+O|0,13),L^=N$(C+m|0,18),k^=N$(x+g|0,7),I^=N$(k+x|0,9),g^=N$(I+k|0,13),x^=N$(g+I|0,18),f^=N$(F+k|0,7),m^=N$(f+F|0,9),k^=N$(m+f|0,13),F^=N$(k+m|0,18),C^=N$(v+l|0,7),I^=N$(C+v|0,9),l^=N$(I+C|0,13),v^=N$(l+I|0,18),g^=N$(L+T|0,7),A^=N$(g+L|0,9),T^=N$(A+g|0,13),L^=N$(T+A|0,18),P^=N$(x+O|0,7),b^=N$(P+x|0,9),O^=N$(b+P|0,13),x^=N$(O+b|0,18);Q[Y++]=X+F|0,Q[Y++]=U+f|0,Q[Y++]=W+m|0,Q[Y++]=V+k|0,Q[Y++]=M+l|0,Q[Y++]=z+v|0,Q[Y++]=D+C|0,Q[Y++]=R+I|0,Q[Y++]=N+A|0,Q[Y++]=w+T|0,Q[Y++]=j+L|0,Q[Y++]=B+g|0,Q[Y++]=S+P|0,Q[Y++]=_+b|0,Q[Y++]=y+O|0,Q[Y++]=p+x|0}function wX($,q,J,G,Q){let Y=G+0,X=G+16*Q;for(let U=0;U<16;U++)J[X+U]=$[q+(2*Q-1)*16+U];for(let U=0;U<Q;U++,Y+=16,q+=16){if(W5(J,X,$,q,J,Y),U>0)X+=16;W5(J,Y,$,q+=16,J,X)}}function nO($,q,J){let G=qY({dkLen:32,asyncTick:10,maxmem:1073742848},J),{N:Q,r:Y,p:X,dkLen:U,asyncTick:W,maxmem:V,onProgress:M}=G;if(E$(Q,"N"),E$(Y,"r"),E$(X,"p"),E$(U,"dkLen"),E$(W,"asyncTick"),E$(V,"maxmem"),M!==void 0&&typeof M!=="function")throw Error("progressCb must be a function");let z=128*Y,D=z/4,R=Math.pow(2,32);if(Q<=1||(Q&Q-1)!==0||Q>R)throw Error('"N" expected a power of 2, and 2^1 <= N <= 2^32');if(X<1||X>(R-1)*32/z)throw Error('"p" expected integer 1..((2^32 - 1) * 32) / (128 * r)');if(U<1||U>(R-1)*32)throw Error('"dkLen" expected integer 1..(2^32 - 1) * 32');let N=z*(Q+X+1);if(N>V)throw Error('"maxmem" limit was hit: memUsed(128*r*(N+p+1))='+N+", maxmem="+V);let w=NX(L$,$,q,{c:1,dkLen:z*X}),j=eQ(w),B=eQ(new Uint8Array(z*Q)),S=eQ(new Uint8Array(z)),_=()=>{};if(M){let y=2*Q*X,p=Math.max(Math.floor(y/1e4),1),F=0;_=()=>{if(F++,M&&(!(F%p)||F===y))M(F/y)}}return{N:Q,r:Y,p:X,dkLen:U,blockSize32:D,V:B,B32:j,B:w,tmp:S,blockMixCb:_,asyncTick:W}}function oO($,q,J,G,Q){let Y=NX(L$,$,J,{c:1,dkLen:q});return R0(J,G,Q),Y}function jX($,q,J){let{N:G,r:Q,p:Y,dkLen:X,blockSize32:U,V:W,B32:V,B:M,tmp:z,blockMixCb:D}=nO($,q,J);$X(V);for(let R=0;R<Y;R++){let N=U*R;for(let w=0;w<U;w++)W[w]=V[N+w];for(let w=0,j=0;w<G-1;w++)wX(W,j,W,j+=U,Q),D();wX(W,(G-1)*U,V,N,Q),D();for(let w=0;w<G;w++){let j=(V[N+U-16]&G-1)>>>0;for(let B=0;B<U;B++)z[B]=V[N+B]^W[j*U+B];wX(z,0,V,N,Q),D()}}return $X(V),oO($,X,M,W,z)}/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */function aO($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function zY($){if(typeof $!=="boolean")throw TypeError(`boolean expected, not ${$}`)}function B8($){if(typeof $!=="number")throw TypeError("number expected, got "+typeof $);if(!Number.isSafeInteger($)||$<0)throw RangeError("positive integer expected, got "+$)}function v$($,q,J=""){let G=aO($),Q=$?.length,Y=q!==void 0;if(!G||Y&&Q!==q){let X=J&&`"${J}" `,U=Y?` of length ${q}`:"",W=G?`length=${Q}`:`type=${typeof $}`,V=X+"expected Uint8Array"+U+", got "+W;if(!G)throw TypeError(V);throw RangeError(V)}return $}function AX($,q=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(q&&$.finished)throw Error("Hash#digest() has already been called")}function V5($,q,J=!1){v$($,void 0,"output");let G=q.outputLen;if($.length<G)throw RangeError("digestInto() expects output buffer of length at least "+G);if(J&&!T8($))throw Error("invalid output, must be aligned")}function Gq($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function p0(...$){for(let q=0;q<$.length;q++)$[q].fill(0)}function sO($){return new DataView($.buffer,$.byteOffset,$.byteLength)}var LJ=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)(),tO=($)=>$<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255;var eO=($)=>{for(let q=0;q<$.length;q++)$[q]=tO($[q]);return $},Sq=LJ?($)=>$:eO;function M5($,q){if(q==null||typeof q!=="object")throw Error("options must be defined");return Object.assign($,q)}function z5($,q){if($.length!==q.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^q[G];return J===0}function R5($,q,J){let G=q,Q=J||(()=>[]),Y=(U,W)=>G(W,...Q(U)).update(U).digest(),X=G(new Uint8Array($),...Q(new Uint8Array(0)));return Y.outputLen=X.outputLen,Y.blockLen=X.blockLen,Y.create=(U,...W)=>G(U,...W),Y}var D5=($,q)=>{function J(G,...Q){if(v$(G,void 0,"key"),$.nonceLength!==void 0){let M=Q[0];v$(M,$.varSizeNonce?void 0:$.nonceLength,"nonce")}let Y=$.tagLength;if(Y&&Q[1]!==void 0)v$(Q[1],void 0,"AAD");let X=q(G,...Q),U=(M,z)=>{if(z!==void 0){if(M!==2)throw Error("cipher output not supported");v$(z,void 0,"output")}},W=!1;return{encrypt(M,z){if(W)throw Error("cannot encrypt() twice with same key + nonce");return W=!0,v$(M),U(X.encrypt.length,z),X.encrypt(M,z)},decrypt(M,z){if(v$(M),Y&&M.length<Y)throw Error('"ciphertext" expected length bigger than tagLength='+Y);return U(X.decrypt.length,z),X.decrypt(M,z)}}}return Object.assign(J,$),J};function fG($,q,J=!0){if(q===void 0)return new Uint8Array($);if(v$(q,void 0,"output"),q.length!==$)throw Error('"output" expected Uint8Array of length '+$+", got: "+q.length);if(J&&!T8(q))throw Error("invalid output, must be aligned");return q}function K5($,q,J){B8($),B8(q),zY(J);let G=new Uint8Array(16),Q=sO(G);return Q.setBigUint64(0,BigInt(q),J),Q.setBigUint64(8,BigInt($),J),G}function T8($){return $.byteOffset%4===0}function S8($){return Uint8Array.from(v$($))}var O5=($)=>Uint8Array.from($.split(""),(q)=>q.charCodeAt(0)),$6=(()=>Sq(Gq(O5("expand 16-byte k"))))(),q6=(()=>Sq(Gq(O5("expand 32-byte k"))))();function w$($,q){return $<<q|$>>>32-q}var xG=64,J6=16,ZX=(()=>4294967295)(),H5=Uint32Array.of();function G6($,q,J,G,Q,Y,X,U){let W=Q.length,V=new Uint8Array(xG),M=Gq(V),z=LJ&&T8(Q)&&T8(Y),D=z?Gq(Q):H5,R=z?Gq(Y):H5;if(!LJ){for(let N=0;N<W;X++){if($(q,J,G,M,X,U),Sq(M),X>=ZX)throw Error("arx: counter overflow");let w=Math.min(xG,W-N);for(let j=0,B;j<w;j++)B=N+j,Y[B]=Q[B]^V[j];N+=w}return}for(let N=0;N<W;X++){if($(q,J,G,M,X,U),X>=ZX)throw Error("arx: counter overflow");let w=Math.min(xG,W-N);if(z&&w===xG){let j=N/4;if(N%4!==0)throw Error("arx: invalid block position");for(let B=0,S;B<J6;B++)S=j+B,R[S]=D[S]^M[B];N+=xG;continue}for(let j=0,B;j<w;j++)B=N+j,Y[B]=Q[B]^V[j];N+=w}}function N5($,q){let{allowShortKeys:J,extendNonceFn:G,counterLength:Q,counterRight:Y,rounds:X}=M5({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},q);if(typeof $!=="function")throw Error("core must be a function");return B8(Q),B8(X),zY(Y),zY(J),(U,W,V,M,z=0)=>{v$(U,void 0,"key"),v$(W,void 0,"nonce"),v$(V,void 0,"data");let D=V.length;if(M=fG(D,M,!1),B8(z),z<0||z>=ZX)throw Error("arx: counter overflow");let R=[],N=U.length,w,j;if(N===32)R.push(w=S8(U)),j=q6;else if(N===16&&J)w=new Uint8Array(32),w.set(U),w.set(U,16),j=$6,R.push(w);else throw v$(U,32,"arx key"),Error("invalid key size");if(!LJ||!T8(W))R.push(W=S8(W));let B=Gq(w);if(G){if(W.length!==24)throw Error("arx: extended nonce must be 24 bytes");let y=W.subarray(0,16);if(LJ)G(j,B,Gq(y),B);else{let p=Sq(Uint32Array.from(j));G(p,B,Gq(y),B),p0(p),Sq(B)}W=W.subarray(16)}else if(!LJ)Sq(B);let S=16-Q;if(S!==W.length)throw Error(`arx: nonce must be ${S} or 16 bytes`);if(S!==12){let y=new Uint8Array(12);y.set(W,Y?0:12-W.length),W=y,R.push(W)}let _=Sq(Gq(W));try{return G6($,j,B,_,V,M,z,X),M}finally{p0(...R)}}}function r$($,q){return $[q++]&255|($[q++]&255)<<8}class w5{blockLen=16;outputLen=16;buffer=new Uint8Array(16);r=new Uint16Array(10);h=new Uint16Array(10);pad=new Uint16Array(8);pos=0;finished=!1;destroyed=!1;constructor($){$=S8(v$($,32,"key"));let q=r$($,0),J=r$($,2),G=r$($,4),Q=r$($,6),Y=r$($,8),X=r$($,10),U=r$($,12),W=r$($,14);this.r[0]=q&8191,this.r[1]=(q>>>13|J<<3)&8191,this.r[2]=(J>>>10|G<<6)&7939,this.r[3]=(G>>>7|Q<<9)&8191,this.r[4]=(Q>>>4|Y<<12)&255,this.r[5]=Y>>>1&8190,this.r[6]=(Y>>>14|X<<2)&8191,this.r[7]=(X>>>11|U<<5)&8065,this.r[8]=(U>>>8|W<<8)&8191,this.r[9]=W>>>5&127;for(let V=0;V<8;V++)this.pad[V]=r$($,16+2*V)}process($,q,J=!1){let G=J?0:2048,{h:Q,r:Y}=this,X=Y[0],U=Y[1],W=Y[2],V=Y[3],M=Y[4],z=Y[5],D=Y[6],R=Y[7],N=Y[8],w=Y[9],j=r$($,q+0),B=r$($,q+2),S=r$($,q+4),_=r$($,q+6),y=r$($,q+8),p=r$($,q+10),F=r$($,q+12),f=r$($,q+14),m=Q[0]+(j&8191),k=Q[1]+((j>>>13|B<<3)&8191),l=Q[2]+((B>>>10|S<<6)&8191),v=Q[3]+((S>>>7|_<<9)&8191),C=Q[4]+((_>>>4|y<<12)&8191),I=Q[5]+(y>>>1&8191),A=Q[6]+((y>>>14|p<<2)&8191),T=Q[7]+((p>>>11|F<<5)&8191),L=Q[8]+((F>>>8|f<<8)&8191),g=Q[9]+(f>>>5|G),P=0,b=P+m*X+k*(5*w)+l*(5*N)+v*(5*R)+C*(5*D);P=b>>>13,b&=8191,b+=I*(5*z)+A*(5*M)+T*(5*V)+L*(5*W)+g*(5*U),P+=b>>>13,b&=8191;let O=P+m*U+k*X+l*(5*w)+v*(5*N)+C*(5*R);P=O>>>13,O&=8191,O+=I*(5*D)+A*(5*z)+T*(5*M)+L*(5*V)+g*(5*W),P+=O>>>13,O&=8191;let x=P+m*W+k*U+l*X+v*(5*w)+C*(5*N);P=x>>>13,x&=8191,x+=I*(5*R)+A*(5*D)+T*(5*z)+L*(5*M)+g*(5*V),P+=x>>>13,x&=8191;let r=P+m*V+k*W+l*U+v*X+C*(5*w);P=r>>>13,r&=8191,r+=I*(5*N)+A*(5*R)+T*(5*D)+L*(5*z)+g*(5*M),P+=r>>>13,r&=8191;let Z=P+m*M+k*V+l*W+v*U+C*X;P=Z>>>13,Z&=8191,Z+=I*(5*w)+A*(5*N)+T*(5*R)+L*(5*D)+g*(5*z),P+=Z>>>13,Z&=8191;let o=P+m*z+k*M+l*V+v*W+C*U;P=o>>>13,o&=8191,o+=I*X+A*(5*w)+T*(5*N)+L*(5*R)+g*(5*D),P+=o>>>13,o&=8191;let q$=P+m*D+k*z+l*M+v*V+C*W;P=q$>>>13,q$&=8191,q$+=I*U+A*X+T*(5*w)+L*(5*N)+g*(5*R),P+=q$>>>13,q$&=8191;let Y$=P+m*R+k*D+l*z+v*M+C*V;P=Y$>>>13,Y$&=8191,Y$+=I*W+A*U+T*X+L*(5*w)+g*(5*N),P+=Y$>>>13,Y$&=8191;let G$=P+m*N+k*R+l*D+v*z+C*M;P=G$>>>13,G$&=8191,G$+=I*V+A*W+T*U+L*X+g*(5*w),P+=G$>>>13,G$&=8191;let t=P+m*w+k*N+l*R+v*D+C*z;P=t>>>13,t&=8191,t+=I*M+A*V+T*W+L*U+g*X,P+=t>>>13,t&=8191,P=(P<<2)+P|0,P=P+b|0,b=P&8191,P=P>>>13,O+=P,Q[0]=b,Q[1]=O,Q[2]=x,Q[3]=r,Q[4]=Z,Q[5]=o,Q[6]=q$,Q[7]=Y$,Q[8]=G$,Q[9]=t}finalize(){let{h:$,pad:q}=this,J=new Uint16Array(10),G=$[1]>>>13;$[1]&=8191;for(let X=2;X<10;X++)$[X]+=G,G=$[X]>>>13,$[X]&=8191;$[0]+=G*5,G=$[0]>>>13,$[0]&=8191,$[1]+=G,G=$[1]>>>13,$[1]&=8191,$[2]+=G,J[0]=$[0]+5,G=J[0]>>>13,J[0]&=8191;for(let X=1;X<10;X++)J[X]=$[X]+G,G=J[X]>>>13,J[X]&=8191;J[9]-=8192;let Q=(G^1)-1;for(let X=0;X<10;X++)J[X]&=Q;Q=~Q;for(let X=0;X<10;X++)$[X]=$[X]&Q|J[X];$[0]=($[0]|$[1]<<13)&65535,$[1]=($[1]>>>3|$[2]<<10)&65535,$[2]=($[2]>>>6|$[3]<<7)&65535,$[3]=($[3]>>>9|$[4]<<4)&65535,$[4]=($[4]>>>12|$[5]<<1|$[6]<<14)&65535,$[5]=($[6]>>>2|$[7]<<11)&65535,$[6]=($[7]>>>5|$[8]<<8)&65535,$[7]=($[8]>>>8|$[9]<<5)&65535;let Y=$[0]+q[0];$[0]=Y&65535;for(let X=1;X<8;X++)Y=($[X]+q[X]|0)+(Y>>>16)|0,$[X]=Y&65535;p0(J)}update($){AX(this),v$($),$=S8($);let{buffer:q,blockLen:J}=this,G=$.length;for(let Q=0;Q<G;){let Y=Math.min(J-this.pos,G-Q);if(Y===J){for(;J<=G-Q;Q+=J)this.process($,Q);continue}if(q.set($.subarray(Q,Q+Y),this.pos),this.pos+=Y,Q+=Y,this.pos===J)this.process(q,0,!1),this.pos=0}return this}destroy(){this.destroyed=!0,p0(this.h,this.r,this.buffer,this.pad)}digestInto($){AX(this),V5($,this),this.finished=!0;let{buffer:q,h:J}=this,{pos:G}=this;if(G){q[G++]=1;for(;G<16;G++)q[G]=0;this.process(q,0,!0)}this.finalize();let Q=0;for(let Y=0;Y<8;Y++)$[Q++]=J[Y]>>>0,$[Q++]=J[Y]>>>8}digest(){let{buffer:$,outputLen:q}=this;this.digestInto($);let J=$.slice(0,q);return this.destroy(),J}}var j5=R5(32,($)=>new w5($));function Q6($,q,J,G,Q,Y=20){let X=$[0],U=$[1],W=$[2],V=$[3],M=q[0],z=q[1],D=q[2],R=q[3],N=q[4],w=q[5],j=q[6],B=q[7],S=Q,_=J[0],y=J[1],p=J[2],F=X,f=U,m=W,k=V,l=M,v=z,C=D,I=R,A=N,T=w,L=j,g=B,P=S,b=_,O=y,x=p;for(let Z=0;Z<Y;Z+=2)F=F+l|0,P=w$(P^F,16),A=A+P|0,l=w$(l^A,12),F=F+l|0,P=w$(P^F,8),A=A+P|0,l=w$(l^A,7),f=f+v|0,b=w$(b^f,16),T=T+b|0,v=w$(v^T,12),f=f+v|0,b=w$(b^f,8),T=T+b|0,v=w$(v^T,7),m=m+C|0,O=w$(O^m,16),L=L+O|0,C=w$(C^L,12),m=m+C|0,O=w$(O^m,8),L=L+O|0,C=w$(C^L,7),k=k+I|0,x=w$(x^k,16),g=g+x|0,I=w$(I^g,12),k=k+I|0,x=w$(x^k,8),g=g+x|0,I=w$(I^g,7),F=F+v|0,x=w$(x^F,16),L=L+x|0,v=w$(v^L,12),F=F+v|0,x=w$(x^F,8),L=L+x|0,v=w$(v^L,7),f=f+C|0,P=w$(P^f,16),g=g+P|0,C=w$(C^g,12),f=f+C|0,P=w$(P^f,8),g=g+P|0,C=w$(C^g,7),m=m+I|0,b=w$(b^m,16),A=A+b|0,I=w$(I^A,12),m=m+I|0,b=w$(b^m,8),A=A+b|0,I=w$(I^A,7),k=k+l|0,O=w$(O^k,16),T=T+O|0,l=w$(l^T,12),k=k+l|0,O=w$(O^k,8),T=T+O|0,l=w$(l^T,7);let r=0;G[r++]=X+F|0,G[r++]=U+f|0,G[r++]=W+m|0,G[r++]=V+k|0,G[r++]=M+l|0,G[r++]=z+v|0,G[r++]=D+C|0,G[r++]=R+I|0,G[r++]=N+A|0,G[r++]=w+T|0,G[r++]=j+L|0,G[r++]=B+g|0,G[r++]=S+P|0,G[r++]=_+b|0,G[r++]=y+O|0,G[r++]=p+x|0}var Y6=N5(Q6,{counterRight:!1,counterLength:4,allowShortKeys:!1});var X6=new Uint8Array(16),A5=($,q)=>{$.update(q);let J=q.length%16;if(J)$.update(X6.subarray(J))},U6=new Uint8Array(32);function Z5($,q,J,G,Q){if(Q!==void 0)v$(Q,void 0,"AAD");let Y=$(q,J,U6),X=K5(G.length,Q?Q.length:0,!0),U=j5.create(Y);if(Q)A5(U,Q);A5(U,G),U.update(X);let W=U.digest();return p0(Y,X),W}var W6=($)=>(q,J,G)=>{return{encrypt(Y,X){let U=Y.length;X=fG(U+16,X,!1),X.set(Y);let W=X.subarray(0,-16);$(q,J,W,W,1);let V=Z5($,q,J,W,G);return X.set(V,U),p0(V),X},decrypt(Y,X){X=fG(Y.length-16,X,!1);let U=Y.subarray(0,-16),W=Y.subarray(-16),V=Z5($,q,J,U,G);if(!z5(W,V))throw p0(V),Error("invalid tag");return X.set(Y.subarray(0,-16)),$(q,J,X,X,1),p0(V),X}}},b0=D5({blockSize:64,nonceLength:12,tagLength:16},W6(Y6));/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function I8($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function f$($,q=""){if(!Number.isSafeInteger($)||$<0){let J=q&&`"${q}" `;throw Error(`${J}expected integer >= 0, got ${$}`)}}function Q$($,q,J=""){let G=I8($),Q=$?.length,Y=q!==void 0;if(!G||Y&&Q!==q){let X=J&&`"${J}" `,U=Y?` of length ${q}`:"",W=G?`length=${Q}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+U+", got "+W)}return $}function k0($){if(typeof $!=="function"||typeof $.create!=="function")throw Error("Hash must wrapped by utils.createHasher");f$($.outputLen),f$($.blockLen)}function Cq($,q=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(q&&$.finished)throw Error("Hash#digest() has already been called")}function RY($,q){Q$($,void 0,"digestInto() output");let J=q.outputLen;if($.length<J)throw Error('"digestInto() output" expected to be of length >='+J)}function DY($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function A0(...$){for(let q=0;q<$.length;q++)$[q].fill(0)}function KY($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function l0($,q){return $<<32-q|$>>>q}var V6=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function M6($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function z6($){for(let q=0;q<$.length;q++)$[q]=M6($[q]);return $}var BX=V6?($)=>$:z6,T5=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),R6=Array.from({length:256},($,q)=>q.toString(16).padStart(2,"0"));function PJ($){if(Q$($),T5)return $.toHex();let q="";for(let J=0;J<$.length;J++)q+=R6[$[J]];return q}var Iq={_0:48,_9:57,A:65,F:70,a:97,f:102};function B5($){if($>=Iq._0&&$<=Iq._9)return $-Iq._0;if($>=Iq.A&&$<=Iq.F)return $-(Iq.A-10);if($>=Iq.a&&$<=Iq.f)return $-(Iq.a-10);return}function FJ($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(T5)return Uint8Array.fromHex($);let q=$.length,J=q/2;if(q%2)throw Error("hex string expected, got unpadded hex of length "+q);let G=new Uint8Array(J);for(let Q=0,Y=0;Q<J;Q++,Y+=2){let X=B5($.charCodeAt(Y)),U=B5($.charCodeAt(Y+1));if(X===void 0||U===void 0){let W=$[Y]+$[Y+1];throw Error('hex string expected, got non-hex character "'+W+'" at index '+Y)}G[Q]=X*16+U}return G}function F$(...$){let q=0;for(let G=0;G<$.length;G++){let Q=$[G];Q$(Q),q+=Q.length}let J=new Uint8Array(q);for(let G=0,Q=0;G<$.length;G++){let Y=$[G];J.set(Y,Q),Q+=Y.length}return J}function C8($,q={}){let J=(Q,Y)=>$(Y).update(Q).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.create=(Q)=>$(Q),Object.assign(J,q),Object.freeze(J)}function nq($=32){let q=typeof globalThis==="object"?globalThis.crypto:null;if(typeof q?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");return q.getRandomValues(new Uint8Array($))}var oq=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var SX=BigInt(0),TX=BigInt(1);function hG($,q=""){if(typeof $!=="boolean"){let J=q&&`"${q}" `;throw Error(J+"expected boolean, got type="+typeof $)}return $}function S5($){if(typeof $==="bigint"){if(!HY($))throw Error("positive bigint expected, got "+$)}else f$($);return $}function uG($){let q=S5($).toString(16);return q.length&1?"0"+q:q}function I5($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?SX:BigInt("0x"+$)}function aq($){return I5(PJ($))}function sq($){return I5(PJ(OY(Q$($)).reverse()))}function E8($,q){f$(q),$=S5($);let J=FJ($.toString(16).padStart(q*2,"0"));if(J.length!==q)throw Error("number too large");return J}function pG($,q){return E8($,q).reverse()}function OY($){return Uint8Array.from($)}function tq($){return Uint8Array.from($,(q,J)=>{let G=q.charCodeAt(0);if(q.length!==1||G>127)throw Error(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var HY=($)=>typeof $==="bigint"&&SX<=$;function D6($,q,J){return HY($)&&HY(q)&&HY(J)&&q<=$&&$<J}function lG($,q,J,G){if(!D6(q,J,G))throw Error("expected valid "+$+": "+J+" <= n < "+G+", got "+q)}function IX($){let q;for(q=0;$>SX;$>>=TX,q+=1);return q}var rG=($)=>(TX<<BigInt($))-TX;function C5($,q,J){if(f$($,"hashLen"),f$(q,"qByteLen"),typeof J!=="function")throw Error("hmacFn must be a function");let G=(j)=>new Uint8Array(j),Q=Uint8Array.of(),Y=Uint8Array.of(0),X=Uint8Array.of(1),U=1000,W=G($),V=G($),M=0,z=()=>{W.fill(1),V.fill(0),M=0},D=(...j)=>J(V,F$(W,...j)),R=(j=Q)=>{if(V=D(Y,j),W=D(),j.length===0)return;V=D(X,j),W=D()},N=()=>{if(M++>=U)throw Error("drbg: tried max amount of iterations");let j=0,B=[];while(j<q){W=D();let S=W.slice();B.push(S),j+=W.length}return F$(...B)};return(j,B)=>{z(),R(j);let S=void 0;while(!(S=B(N())))R();return z(),S}}function gJ($,q={},J={}){if(!$||typeof $!=="object")throw Error("expected valid options object");function G(Y,X,U){let W=$[Y];if(U&&W===void 0)return;let V=typeof W;if(V!==X||W===null)throw Error(`param "${Y}" is invalid: expected ${X}, got ${V}`)}let Q=(Y,X)=>Object.entries(Y).forEach(([U,W])=>G(U,W,X));Q(q,!1),Q(J,!0)}function CX($){let q=new WeakMap;return(J,...G)=>{let Q=q.get(J);if(Q!==void 0)return Q;let Y=$(J,...G);return q.set(J,Y),Y}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var K0=BigInt(0),q0=BigInt(1),_J=BigInt(2),P5=BigInt(3),F5=BigInt(4),g5=BigInt(5),K6=BigInt(7),_5=BigInt(8),H6=BigInt(9),v5=BigInt(16);function D0($,q){let J=$%q;return J>=K0?J:q+J}function m0($,q,J){let G=$;while(q-- >K0)G*=G,G%=J;return G}function E5($,q){if($===K0)throw Error("invert: expected non-zero number");if(q<=K0)throw Error("invert: expected positive modulus, got "+q);let J=D0($,q),G=q,Q=K0,Y=q0,X=q0,U=K0;while(J!==K0){let V=G/J,M=G%J,z=Q-X*V,D=Y-U*V;G=J,J=M,Q=X,Y=U,X=z,U=D}if(G!==q0)throw Error("invert: does not exist");return D0(Q,q)}function EX($,q,J){if(!$.eql($.sqr(q),J))throw Error("Cannot find square root")}function b5($,q){let J=($.ORDER+q0)/F5,G=$.pow(q,J);return EX($,G,q),G}function O6($,q){let J=($.ORDER-g5)/_5,G=$.mul(q,_J),Q=$.pow(G,J),Y=$.mul(q,Q),X=$.mul($.mul(Y,_J),Q),U=$.mul(Y,$.sub(X,$.ONE));return EX($,U,q),U}function N6($){let q=NY($),J=k5($),G=J(q,q.neg(q.ONE)),Q=J(q,G),Y=J(q,q.neg(G)),X=($+K6)/v5;return(U,W)=>{let V=U.pow(W,X),M=U.mul(V,G),z=U.mul(V,Q),D=U.mul(V,Y),R=U.eql(U.sqr(M),W),N=U.eql(U.sqr(z),W);V=U.cmov(V,M,R),M=U.cmov(D,z,N);let w=U.eql(U.sqr(M),W),j=U.cmov(V,M,w);return EX(U,j,W),j}}function k5($){if($<P5)throw Error("sqrt is not defined for small field");let q=$-q0,J=0;while(q%_J===K0)q/=_J,J++;let G=_J,Q=NY($);while(L5(Q,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return b5;let Y=Q.pow(G,q),X=(q+q0)/_J;return function(W,V){if(W.is0(V))return V;if(L5(W,V)!==1)throw Error("Cannot find square root");let M=J,z=W.mul(W.ONE,Y),D=W.pow(V,q),R=W.pow(V,X);while(!W.eql(D,W.ONE)){if(W.is0(D))return W.ZERO;let N=1,w=W.sqr(D);while(!W.eql(w,W.ONE))if(N++,w=W.sqr(w),N===M)throw Error("Cannot find square root");let j=q0<<BigInt(M-N-1),B=W.pow(z,j);M=N,z=W.sqr(B),D=W.mul(D,z),R=W.mul(R,B)}return R}}function w6($){if($%F5===P5)return b5;if($%_5===g5)return O6;if($%v5===H6)return N6($);return k5($)}var j6=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function LX($){let q={ORDER:"bigint",BYTES:"number",BITS:"number"},J=j6.reduce((G,Q)=>{return G[Q]="function",G},q);return gJ($,J),$}function A6($,q,J){if(J<K0)throw Error("invalid exponent, negatives unsupported");if(J===K0)return $.ONE;if(J===q0)return q;let G=$.ONE,Q=q;while(J>K0){if(J&q0)G=$.mul(G,Q);Q=$.sqr(Q),J>>=q0}return G}function iG($,q,J=!1){let G=Array(q.length).fill(J?$.ZERO:void 0),Q=q.reduce((X,U,W)=>{if($.is0(U))return X;return G[W]=X,$.mul(X,U)},$.ONE),Y=$.inv(Q);return q.reduceRight((X,U,W)=>{if($.is0(U))return X;return G[W]=$.mul(X,G[W]),$.mul(X,U)},Y),G}function L5($,q){let J=($.ORDER-q0)/_J,G=$.pow(q,J),Q=$.eql(G,$.ONE),Y=$.eql(G,$.ZERO),X=$.eql(G,$.neg($.ONE));if(!Q&&!Y&&!X)throw Error("invalid Legendre symbol result");return Q?1:Y?0:-1}function Z6($,q){if(q!==void 0)f$(q);let J=q!==void 0?q:$.toString(2).length,G=Math.ceil(J/8);return{nBitLength:J,nByteLength:G}}class m5{ORDER;BITS;BYTES;isLE;ZERO=K0;ONE=q0;_lengths;_sqrt;_mod;constructor($,q={}){if($<=K0)throw Error("invalid field: expected ORDER > 0, got "+$);let J=void 0;if(this.isLE=!1,q!=null&&typeof q==="object"){if(typeof q.BITS==="number")J=q.BITS;if(typeof q.sqrt==="function")this.sqrt=q.sqrt;if(typeof q.isLE==="boolean")this.isLE=q.isLE;if(q.allowedLengths)this._lengths=q.allowedLengths?.slice();if(typeof q.modFromBytes==="boolean")this._mod=q.modFromBytes}let{nBitLength:G,nByteLength:Q}=Z6($,J);if(Q>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=Q,this._sqrt=void 0,Object.preventExtensions(this)}create($){return D0($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof $);return K0<=$&&$<this.ORDER}is0($){return $===K0}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&q0)===q0}neg($){return D0(-$,this.ORDER)}eql($,q){return $===q}sqr($){return D0($*$,this.ORDER)}add($,q){return D0($+q,this.ORDER)}sub($,q){return D0($-q,this.ORDER)}mul($,q){return D0($*q,this.ORDER)}pow($,q){return A6(this,$,q)}div($,q){return D0($*E5(q,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,q){return $+q}subN($,q){return $-q}mulN($,q){return $*q}inv($){return E5($,this.ORDER)}sqrt($){if(!this._sqrt)this._sqrt=w6(this.ORDER);return this._sqrt(this,$)}toBytes($){return this.isLE?pG($,this.BYTES):E8($,this.BYTES)}fromBytes($,q=!1){Q$($);let{_lengths:J,BYTES:G,isLE:Q,ORDER:Y,_mod:X}=this;if(J){if(!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let W=new Uint8Array(G);W.set($,Q?0:W.length-$.length),$=W}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let U=Q?sq($):aq($);if(X)U=D0(U,Y);if(!q){if(!this.isValid(U))throw Error("invalid field element: outside of range 0..ORDER")}return U}invertBatch($){return iG(this,$)}cmov($,q,J){return J?q:$}}function NY($,q={}){return new m5($,q)}function y5($){if(typeof $!=="bigint")throw Error("field order must be bigint");let q=$.toString(2).length;return Math.ceil(q/8)}function PX($){let q=y5($);return q+Math.ceil(q/2)}function f5($,q,J=!1){Q$($);let G=$.length,Q=y5(q),Y=PX(q);if(G<16||G<Y||G>1024)throw Error("expected "+Y+"-1024 bytes of input, got "+G);let X=J?sq($):aq($),U=D0(X,q-q0)+q0;return J?pG(U,Q):E8(U,Q)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var L8=BigInt(0),vJ=BigInt(1);function dG($,q){let J=q.negate();return $?J:q}function vX($,q){let J=iG($.Fp,q.map((G)=>G.Z));return q.map((G,Q)=>$.fromAffine(G.toAffine(J[Q])))}function p5($,q){if(!Number.isSafeInteger($)||$<=0||$>q)throw Error("invalid window size, expected [1.."+q+"], got W="+$)}function FX($,q){p5($,q);let J=Math.ceil(q/$)+1,G=2**($-1),Q=2**$,Y=rG($),X=BigInt($);return{windows:J,windowSize:G,mask:Y,maxNumber:Q,shiftBy:X}}function x5($,q,J){let{windowSize:G,mask:Q,maxNumber:Y,shiftBy:X}=J,U=Number($&Q),W=$>>X;if(U>G)U-=Y,W+=vJ;let V=q*G,M=V+Math.abs(U)-1,z=U===0,D=U<0,R=q%2!==0;return{nextN:W,offset:M,isZero:z,isNeg:D,isNegF:R,offsetF:V}}var gX=new WeakMap,l5=new WeakMap;function _X($){return l5.get($)||1}function h5($){if($!==L8)throw Error("invalid wNAF")}class bX{BASE;ZERO;Fn;bits;constructor($,q){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=q}_unsafeLadder($,q,J=this.ZERO){let G=$;while(q>L8){if(q&vJ)J=J.add(G);G=G.double(),q>>=vJ}return J}precomputeWindow($,q){let{windows:J,windowSize:G}=FX(q,this.bits),Q=[],Y=$,X=Y;for(let U=0;U<J;U++){X=Y,Q.push(X);for(let W=1;W<G;W++)X=X.add(Y),Q.push(X);Y=X.double()}return Q}wNAF($,q,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,Q=this.BASE,Y=FX($,this.bits);for(let X=0;X<Y.windows;X++){let{nextN:U,offset:W,isZero:V,isNeg:M,isNegF:z,offsetF:D}=x5(J,X,Y);if(J=U,V)Q=Q.add(dG(z,q[D]));else G=G.add(dG(M,q[W]))}return h5(J),{p:G,f:Q}}wNAFUnsafe($,q,J,G=this.ZERO){let Q=FX($,this.bits);for(let Y=0;Y<Q.windows;Y++){if(J===L8)break;let{nextN:X,offset:U,isZero:W,isNeg:V}=x5(J,Y,Q);if(J=X,W)continue;else{let M=q[U];G=G.add(V?M.negate():M)}}return h5(J),G}getPrecomputes($,q,J){let G=gX.get(q);if(!G){if(G=this.precomputeWindow(q,$),$!==1){if(typeof J==="function")G=J(G);gX.set(q,G)}}return G}cached($,q,J){let G=_X($);return this.wNAF(G,this.getPrecomputes(G,$,J),q)}unsafe($,q,J,G){let Q=_X($);if(Q===1)return this._unsafeLadder($,q,G);return this.wNAFUnsafe(Q,this.getPrecomputes(Q,$,J),q,G)}createCache($,q){p5(q,this.bits),l5.set($,q),gX.delete($)}hasCache($){return _X($)!==1}}function r5($,q,J,G){let Q=q,Y=$.ZERO,X=$.ZERO;while(J>L8||G>L8){if(J&vJ)Y=Y.add(Q);if(G&vJ)X=X.add(Q);Q=Q.double(),J>>=vJ,G>>=vJ}return{p1:Y,p2:X}}function u5($,q,J){if(q){if(q.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return LX(q),q}else return NY($,{isLE:J})}function i5($,q,J={},G){if(G===void 0)G=$==="edwards";if(!q||typeof q!=="object")throw Error(`expected valid ${$} CURVE object`);for(let W of["p","n","h"]){let V=q[W];if(!(typeof V==="bigint"&&V>L8))throw Error(`CURVE.${W} must be positive bigint`)}let Q=u5(q.p,J.Fp,G),Y=u5(q.n,J.Fn,G),U=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let W of U)if(!Q.isValid(q[W]))throw Error(`CURVE.${W} must be valid field element of CURVE.Fp`);return q=Object.freeze(Object.assign({},q)),{CURVE:q,Fp:Q,Fn:Y}}function wY($,q){return function(G){let Q=$(G);return{secretKey:Q,publicKey:q(Q)}}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var cG=BigInt(0),P8=BigInt(1),jY=BigInt(2);function B6($){return gJ($,{adjustScalarBytes:"function",powPminus2:"function"}),Object.freeze({...$})}function d5($){let q=B6($),{P:J,type:G,adjustScalarBytes:Q,powPminus2:Y,randomBytes:X}=q,U=G==="x25519";if(!U&&G!=="x448")throw Error("invalid type");let W=X||nq,V=U?255:448,M=U?32:56,z=U?BigInt(9):BigInt(5),D=U?BigInt(121665):BigInt(39081),R=U?jY**BigInt(254):jY**BigInt(447),N=U?BigInt(8)*jY**BigInt(251)-P8:BigInt(4)*jY**BigInt(445)-P8,w=R+N+P8,j=(A)=>D0(A,J),B=S(z);function S(A){return pG(j(A),M)}function _(A){let T=OY(Q$(A,M,"uCoordinate"));if(U)T[31]&=127;return j(sq(T))}function y(A){return sq(Q(OY(Q$(A,M,"scalar"))))}function p(A,T){let L=l(_(T),y(A));if(L===cG)throw Error("invalid private or public key received");return S(L)}function F(A){return p(A,B)}let f=F,m=p;function k(A,T,L){let g=j(A*(T-L));return T=j(T-g),L=j(L+g),{x_2:T,x_3:L}}function l(A,T){lG("u",A,cG,J),lG("scalar",T,R,w);let L=T,g=A,P=P8,b=cG,O=A,x=P8,r=cG;for(let o=BigInt(V-1);o>=cG;o--){let q$=L>>o&P8;r^=q$,{x_2:P,x_3:O}=k(r,P,O),{x_2:b,x_3:x}=k(r,b,x),r=q$;let Y$=P+b,G$=j(Y$*Y$),t=P-b,O$=j(t*t),A$=G$-O$,S$=O+x,y$=O-x,z0=j(y$*Y$),$q=j(S$*t),uq=z0+$q,pq=z0-$q;O=j(uq*uq),x=j(g*j(pq*pq)),P=j(G$*O$),b=j(A$*(G$+j(D*A$)))}({x_2:P,x_3:O}=k(r,P,O)),{x_2:b,x_3:x}=k(r,b,x);let Z=Y(b);return j(P*Z)}let v={secretKey:M,publicKey:M,seed:M},C=(A=W(M))=>{return Q$(A,v.seed,"seed"),A},I={randomSecretKey:C};return Object.freeze({keygen:wY(C,f),getSharedSecret:m,getPublicKey:f,scalarMult:p,scalarMultBase:F,utils:I,GuBytes:B.slice(),lengths:v})}class kX{oHash;iHash;blockLen;outputLen;finished=!1;destroyed=!1;constructor($,q){if(k0($),Q$(q,void 0,"key"),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 J=this.blockLen,G=new Uint8Array(J);G.set(q.length>J?$.create().update(q).digest():q);for(let Q=0;Q<G.length;Q++)G[Q]^=54;this.iHash.update(G),this.oHash=$.create();for(let Q=0;Q<G.length;Q++)G[Q]^=106;this.oHash.update(G),A0(G)}update($){return Cq(this),this.iHash.update($),this}digestInto($){Cq(this),Q$($,this.outputLen,"output"),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:q,iHash:J,finished:G,destroyed:Q,blockLen:Y,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=Q,$.blockLen=Y,$.outputLen=X,$.oHash=q._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var F8=($,q,J)=>new kX($,q).update(J).digest();F8.create=($,q)=>new kX($,q);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var c5=($,q)=>($+($>=0?q:-q)/o5)/q;function T6($,q,J){let[[G,Q],[Y,X]]=q,U=c5(X*$,J),W=c5(-Q*$,J),V=$-U*G-W*Y,M=-U*Q-W*X,z=V<Eq,D=M<Eq;if(z)V=-V;if(D)M=-M;let R=rG(Math.ceil(IX(J)/2))+g8;if(V<Eq||V>=R||M<Eq||M>=R)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:z,k1:V,k2neg:D,k2:M}}function yX($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function mX($,q){let J={};for(let G of Object.keys(q))J[G]=$[G]===void 0?q[G]:$[G];if(hG(J.lowS,"lowS"),hG(J.prehash,"prehash"),J.format!==void 0)yX(J.format);return J}class n5 extends Error{constructor($=""){super($)}}var eq={Err:n5,_tlv:{encode:($,q)=>{let{Err:J}=eq;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(q.length&1)throw new J("tlv.encode: unpadded data");let G=q.length/2,Q=uG(G);if(Q.length/2&128)throw new J("tlv.encode: long form length too big");let Y=G>127?uG(Q.length/2|128):"";return uG($)+Y+Q+q},decode($,q){let{Err:J}=eq,G=0;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(q.length<2||q[G++]!==$)throw new J("tlv.decode: wrong tlv");let Q=q[G++],Y=!!(Q&128),X=0;if(!Y)X=Q;else{let W=Q&127;if(!W)throw new J("tlv.decode(long): indefinite length not supported");if(W>4)throw new J("tlv.decode(long): byte length is too big");let V=q.subarray(G,G+W);if(V.length!==W)throw new J("tlv.decode: length bytes not complete");if(V[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let M of V)X=X<<8|M;if(G+=W,X<128)throw new J("tlv.decode(long): not minimal encoding")}let U=q.subarray(G,G+X);if(U.length!==X)throw new J("tlv.decode: wrong value length");return{v:U,l:q.subarray(G+X)}}},_int:{encode($){let{Err:q}=eq;if($<Eq)throw new q("integer: negative integers are not allowed");let J=uG($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new q("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:q}=eq;if($[0]&128)throw new q("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new q("invalid signature integer: unnecessary leading zero");return aq($)}},toSig($){let{Err:q,_int:J,_tlv:G}=eq,Q=Q$($,void 0,"signature"),{v:Y,l:X}=G.decode(48,Q);if(X.length)throw new q("invalid signature: left bytes after parsing");let{v:U,l:W}=G.decode(2,Y),{v:V,l:M}=G.decode(2,W);if(M.length)throw new q("invalid signature: left bytes after parsing");return{r:J.decode(U),s:J.decode(V)}},hexFromSig($){let{_tlv:q,_int:J}=eq,G=q.encode(2,J.encode($.r)),Q=q.encode(2,J.encode($.s)),Y=G+Q;return q.encode(48,Y)}},Eq=BigInt(0),g8=BigInt(1),o5=BigInt(2),AY=BigInt(3),S6=BigInt(4);function fX($,q={}){let J=i5("weierstrass",$,q),{Fp:G,Fn:Q}=J,Y=J.CURVE,{h:X,n:U}=Y;gJ(q,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:W}=q;if(W){if(!G.is0(Y.a)||typeof W.beta!=="bigint"||!Array.isArray(W.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let V=s5(G,Q);function M(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function z(C,I,A){let{x:T,y:L}=I.toAffine(),g=G.toBytes(T);if(hG(A,"isCompressed"),A){M();let P=!G.isOdd(L);return F$(a5(P),g)}else return F$(Uint8Array.of(4),g,G.toBytes(L))}function D(C){Q$(C,void 0,"Point");let{publicKey:I,publicKeyUncompressed:A}=V,T=C.length,L=C[0],g=C.subarray(1);if(T===I&&(L===2||L===3)){let P=G.fromBytes(g);if(!G.isValid(P))throw Error("bad point: is not on curve, wrong x");let b=w(P),O;try{O=G.sqrt(b)}catch(Z){let o=Z instanceof Error?": "+Z.message:"";throw Error("bad point: is not on curve, sqrt error"+o)}M();let x=G.isOdd(O);if((L&1)===1!==x)O=G.neg(O);return{x:P,y:O}}else if(T===A&&L===4){let P=G.BYTES,b=G.fromBytes(g.subarray(0,P)),O=G.fromBytes(g.subarray(P,P*2));if(!j(b,O))throw Error("bad point: is not on curve");return{x:b,y:O}}else throw Error(`bad point: got length ${T}, expected compressed=${I} or uncompressed=${A}`)}let R=q.toBytes||z,N=q.fromBytes||D;function w(C){let I=G.sqr(C),A=G.mul(I,C);return G.add(G.add(A,G.mul(C,Y.a)),Y.b)}function j(C,I){let A=G.sqr(I),T=w(C);return G.eql(A,T)}if(!j(Y.Gx,Y.Gy))throw Error("bad curve params: generator point");let B=G.mul(G.pow(Y.a,AY),S6),S=G.mul(G.sqr(Y.b),BigInt(27));if(G.is0(G.add(B,S)))throw Error("bad curve params: a or b");function _(C,I,A=!1){if(!G.isValid(I)||A&&G.is0(I))throw Error(`bad point coordinate ${C}`);return I}function y(C){if(!(C instanceof k))throw Error("Weierstrass Point expected")}function p(C){if(!W||!W.basises)throw Error("no endo");return T6(C,W.basises,Q.ORDER)}let F=CX((C,I)=>{let{X:A,Y:T,Z:L}=C;if(G.eql(L,G.ONE))return{x:A,y:T};let g=C.is0();if(I==null)I=g?G.ONE:G.inv(L);let P=G.mul(A,I),b=G.mul(T,I),O=G.mul(L,I);if(g)return{x:G.ZERO,y:G.ZERO};if(!G.eql(O,G.ONE))throw Error("invZ was invalid");return{x:P,y:b}}),f=CX((C)=>{if(C.is0()){if(q.allowInfinityPoint&&!G.is0(C.Y))return;throw Error("bad point: ZERO")}let{x:I,y:A}=C.toAffine();if(!G.isValid(I)||!G.isValid(A))throw Error("bad point: x or y not field elements");if(!j(I,A))throw Error("bad point: equation left != right");if(!C.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function m(C,I,A,T,L){return A=new k(G.mul(A.X,C),A.Y,A.Z),I=dG(T,I),A=dG(L,A),I.add(A)}class k{static BASE=new k(Y.Gx,Y.Gy,G.ONE);static ZERO=new k(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=Q;X;Y;Z;constructor(C,I,A){this.X=_("x",C),this.Y=_("y",I,!0),this.Z=_("z",A),Object.freeze(this)}static CURVE(){return Y}static fromAffine(C){let{x:I,y:A}=C||{};if(!C||!G.isValid(I)||!G.isValid(A))throw Error("invalid affine point");if(C instanceof k)throw Error("projective point not allowed");if(G.is0(I)&&G.is0(A))return k.ZERO;return new k(I,A,G.ONE)}static fromBytes(C){let I=k.fromAffine(N(Q$(C,void 0,"point")));return I.assertValidity(),I}static fromHex(C){return k.fromBytes(FJ(C))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(C=8,I=!0){if(v.createCache(this,C),!I)this.multiply(AY);return this}assertValidity(){f(this)}hasEvenY(){let{y:C}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(C)}equals(C){y(C);let{X:I,Y:A,Z:T}=this,{X:L,Y:g,Z:P}=C,b=G.eql(G.mul(I,P),G.mul(L,T)),O=G.eql(G.mul(A,P),G.mul(g,T));return b&&O}negate(){return new k(this.X,G.neg(this.Y),this.Z)}double(){let{a:C,b:I}=Y,A=G.mul(I,AY),{X:T,Y:L,Z:g}=this,P=G.ZERO,b=G.ZERO,O=G.ZERO,x=G.mul(T,T),r=G.mul(L,L),Z=G.mul(g,g),o=G.mul(T,L);return o=G.add(o,o),O=G.mul(T,g),O=G.add(O,O),P=G.mul(C,O),b=G.mul(A,Z),b=G.add(P,b),P=G.sub(r,b),b=G.add(r,b),b=G.mul(P,b),P=G.mul(o,P),O=G.mul(A,O),Z=G.mul(C,Z),o=G.sub(x,Z),o=G.mul(C,o),o=G.add(o,O),O=G.add(x,x),x=G.add(O,x),x=G.add(x,Z),x=G.mul(x,o),b=G.add(b,x),Z=G.mul(L,g),Z=G.add(Z,Z),x=G.mul(Z,o),P=G.sub(P,x),O=G.mul(Z,r),O=G.add(O,O),O=G.add(O,O),new k(P,b,O)}add(C){y(C);let{X:I,Y:A,Z:T}=this,{X:L,Y:g,Z:P}=C,b=G.ZERO,O=G.ZERO,x=G.ZERO,r=Y.a,Z=G.mul(Y.b,AY),o=G.mul(I,L),q$=G.mul(A,g),Y$=G.mul(T,P),G$=G.add(I,A),t=G.add(L,g);G$=G.mul(G$,t),t=G.add(o,q$),G$=G.sub(G$,t),t=G.add(I,T);let O$=G.add(L,P);return t=G.mul(t,O$),O$=G.add(o,Y$),t=G.sub(t,O$),O$=G.add(A,T),b=G.add(g,P),O$=G.mul(O$,b),b=G.add(q$,Y$),O$=G.sub(O$,b),x=G.mul(r,t),b=G.mul(Z,Y$),x=G.add(b,x),b=G.sub(q$,x),x=G.add(q$,x),O=G.mul(b,x),q$=G.add(o,o),q$=G.add(q$,o),Y$=G.mul(r,Y$),t=G.mul(Z,t),q$=G.add(q$,Y$),Y$=G.sub(o,Y$),Y$=G.mul(r,Y$),t=G.add(t,Y$),o=G.mul(q$,t),O=G.add(O,o),o=G.mul(O$,t),b=G.mul(G$,b),b=G.sub(b,o),o=G.mul(G$,q$),x=G.mul(O$,x),x=G.add(x,o),new k(b,O,x)}subtract(C){return this.add(C.negate())}is0(){return this.equals(k.ZERO)}multiply(C){let{endo:I}=q;if(!Q.isValidNot0(C))throw Error("invalid scalar: out of range");let A,T,L=(g)=>v.cached(this,g,(P)=>vX(k,P));if(I){let{k1neg:g,k1:P,k2neg:b,k2:O}=p(C),{p:x,f:r}=L(P),{p:Z,f:o}=L(O);T=r.add(o),A=m(I.beta,x,Z,g,b)}else{let{p:g,f:P}=L(C);A=g,T=P}return vX(k,[A,T])[0]}multiplyUnsafe(C){let{endo:I}=q,A=this;if(!Q.isValid(C))throw Error("invalid scalar: out of range");if(C===Eq||A.is0())return k.ZERO;if(C===g8)return A;if(v.hasCache(this))return this.multiply(C);if(I){let{k1neg:T,k1:L,k2neg:g,k2:P}=p(C),{p1:b,p2:O}=r5(k,A,L,P);return m(I.beta,b,O,T,g)}else return v.unsafe(A,C)}toAffine(C){return F(this,C)}isTorsionFree(){let{isTorsionFree:C}=q;if(X===g8)return!0;if(C)return C(k,this);return v.unsafe(this,U).is0()}clearCofactor(){let{clearCofactor:C}=q;if(X===g8)return this;if(C)return C(k,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(C=!0){return hG(C,"isCompressed"),this.assertValidity(),R(k,this,C)}toHex(C=!0){return PJ(this.toBytes(C))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let l=Q.BITS,v=new bX(k,q.endo?Math.ceil(l/2):l);return k.BASE.precompute(8),k}function a5($){return Uint8Array.of($?2:3)}function s5($,q){return{secretKey:q.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*q.BYTES}}function I6($,q={}){let{Fn:J}=$,G=q.randomBytes||nq,Q=Object.assign(s5($.Fp,J),{seed:PX(J.ORDER)});function Y(R){try{let N=J.fromBytes(R);return J.isValidNot0(N)}catch(N){return!1}}function X(R,N){let{publicKey:w,publicKeyUncompressed:j}=Q;try{let B=R.length;if(N===!0&&B!==w)return!1;if(N===!1&&B!==j)return!1;return!!$.fromBytes(R)}catch(B){return!1}}function U(R=G(Q.seed)){return f5(Q$(R,Q.seed,"seed"),J.ORDER)}function W(R,N=!0){return $.BASE.multiply(J.fromBytes(R)).toBytes(N)}function V(R){let{secretKey:N,publicKey:w,publicKeyUncompressed:j}=Q;if(!I8(R))return;if("_lengths"in J&&J._lengths||N===w)return;let B=Q$(R,void 0,"key").length;return B===w||B===j}function M(R,N,w=!0){if(V(R)===!0)throw Error("first arg must be private key");if(V(N)===!1)throw Error("second arg must be public key");let j=J.fromBytes(R);return $.fromBytes(N).multiply(j).toBytes(w)}let z={isValidSecretKey:Y,isValidPublicKey:X,randomSecretKey:U},D=wY(U,W);return Object.freeze({getPublicKey:W,getSharedSecret:M,keygen:D,Point:$,utils:z,lengths:Q})}function xX($,q,J={}){k0(q),gJ(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let G=J.randomBytes||nq,Q=J.hmac||((A,T)=>F8(q,A,T)),{Fp:Y,Fn:X}=$,{ORDER:U,BITS:W}=X,{keygen:V,getPublicKey:M,getSharedSecret:z,utils:D,lengths:R}=I6($,J),N={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},w=U*o5<Y.ORDER;function j(A){let T=U>>g8;return A>T}function B(A,T){if(!X.isValidNot0(T))throw Error(`invalid signature ${A}: out of range 1..Point.Fn.ORDER`);return T}function S(){if(w)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function _(A,T){yX(T);let L=R.signature,g=T==="compact"?L:T==="recovered"?L+1:void 0;return Q$(A,g)}class y{r;s;recovery;constructor(A,T,L){if(this.r=B("r",A),this.s=B("s",T),L!=null){if(S(),![0,1,2,3].includes(L))throw Error("invalid recovery id");this.recovery=L}Object.freeze(this)}static fromBytes(A,T=N.format){_(A,T);let L;if(T==="der"){let{r:O,s:x}=eq.toSig(Q$(A));return new y(O,x)}if(T==="recovered")L=A[0],T="compact",A=A.subarray(1);let g=R.signature/2,P=A.subarray(0,g),b=A.subarray(g,g*2);return new y(X.fromBytes(P),X.fromBytes(b),L)}static fromHex(A,T){return this.fromBytes(FJ(A),T)}assertRecovery(){let{recovery:A}=this;if(A==null)throw Error("invalid recovery id: must be present");return A}addRecoveryBit(A){return new y(this.r,this.s,A)}recoverPublicKey(A){let{r:T,s:L}=this,g=this.assertRecovery(),P=g===2||g===3?T+U:T;if(!Y.isValid(P))throw Error("invalid recovery id: sig.r+curve.n != R.x");let b=Y.toBytes(P),O=$.fromBytes(F$(a5((g&1)===0),b)),x=X.inv(P),r=F(Q$(A,void 0,"msgHash")),Z=X.create(-r*x),o=X.create(L*x),q$=$.BASE.multiplyUnsafe(Z).add(O.multiplyUnsafe(o));if(q$.is0())throw Error("invalid recovery: point at infinify");return q$.assertValidity(),q$}hasHighS(){return j(this.s)}toBytes(A=N.format){if(yX(A),A==="der")return FJ(eq.hexFromSig(this));let{r:T,s:L}=this,g=X.toBytes(T),P=X.toBytes(L);if(A==="recovered")return S(),F$(Uint8Array.of(this.assertRecovery()),g,P);return F$(g,P)}toHex(A){return PJ(this.toBytes(A))}}let p=J.bits2int||function(T){if(T.length>8192)throw Error("input is too large");let L=aq(T),g=T.length*8-W;return g>0?L>>BigInt(g):L},F=J.bits2int_modN||function(T){return X.create(p(T))},f=rG(W);function m(A){return lG("num < 2^"+W,A,Eq,f),X.toBytes(A)}function k(A,T){return Q$(A,void 0,"message"),T?Q$(q(A),void 0,"prehashed message"):A}function l(A,T,L){let{lowS:g,prehash:P,extraEntropy:b}=mX(L,N);A=k(A,P);let O=F(A),x=X.fromBytes(T);if(!X.isValidNot0(x))throw Error("invalid private key");let r=[m(x),m(O)];if(b!=null&&b!==!1){let Y$=b===!0?G(R.secretKey):b;r.push(Q$(Y$,void 0,"extraEntropy"))}let Z=F$(...r),o=O;function q$(Y$){let G$=p(Y$);if(!X.isValidNot0(G$))return;let t=X.inv(G$),O$=$.BASE.multiply(G$).toAffine(),A$=X.create(O$.x);if(A$===Eq)return;let S$=X.create(t*X.create(o+A$*x));if(S$===Eq)return;let y$=(O$.x===A$?0:2)|Number(O$.y&g8),z0=S$;if(g&&j(S$))z0=X.neg(S$),y$^=1;return new y(A$,z0,w?void 0:y$)}return{seed:Z,k2sig:q$}}function v(A,T,L={}){let{seed:g,k2sig:P}=l(A,T,L);return C5(q.outputLen,X.BYTES,Q)(g,P).toBytes(L.format)}function C(A,T,L,g={}){let{lowS:P,prehash:b,format:O}=mX(g,N);if(L=Q$(L,void 0,"publicKey"),T=k(T,b),!I8(A)){let x=A instanceof y?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+x)}_(A,O);try{let x=y.fromBytes(A,O),r=$.fromBytes(L);if(P&&x.hasHighS())return!1;let{r:Z,s:o}=x,q$=F(T),Y$=X.inv(o),G$=X.create(q$*Y$),t=X.create(Z*Y$),O$=$.BASE.multiplyUnsafe(G$).add(r.multiplyUnsafe(t));if(O$.is0())return!1;return X.create(O$.x)===Z}catch(x){return!1}}function I(A,T,L={}){let{prehash:g}=mX(L,N);return T=k(T,g),y.fromBytes(A,"recovered").recoverPublicKey(T).toBytes()}return Object.freeze({keygen:V,getPublicKey:M,getSharedSecret:z,utils:D,lengths:R,Point:$,sign:v,verify:C,recoverPublicKey:I,Signature:y,hash:q})}function t5($,q,J){return $&q^~$&J}function e5($,q,J){return $&q^$&J^q&J}class ZY{blockLen;outputLen;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,q,J,G){this.blockLen=$,this.outputLen=q,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=KY(this.buffer)}update($){Cq(this),Q$($);let{view:q,buffer:J,blockLen:G}=this,Q=$.length;for(let Y=0;Y<Q;){let X=Math.min(G-this.pos,Q-Y);if(X===G){let U=KY($);for(;G<=Q-Y;Y+=G)this.process(U,Y);continue}if(J.set($.subarray(Y,Y+X),this.pos),this.pos+=X,Y+=X,this.pos===G)this.process(q,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){Cq(this),RY($,this),this.finished=!0;let{buffer:q,view:J,blockLen:G,isLE:Q}=this,{pos:Y}=this;if(q[Y++]=128,A0(this.buffer.subarray(Y)),this.padOffset>G-Y)this.process(J,0),Y=0;for(let M=Y;M<G;M++)q[M]=0;J.setBigUint64(G-8,BigInt(this.length*8),Q),this.process(J,0);let X=KY($),U=this.outputLen;if(U%4)throw Error("_sha2: outputLen must be aligned to 32bit");let W=U/4,V=this.get();if(W>V.length)throw Error("_sha2: outputLen bigger than state");for(let M=0;M<W;M++)X.setUint32(4*M,V[M],Q)}digest(){let{buffer:$,outputLen:q}=this;this.digestInto($);let J=$.slice(0,q);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:q,buffer:J,length:G,finished:Q,destroyed:Y,pos:X}=this;if($.destroyed=Y,$.finished=Q,$.length=G,$.pos=X,G%q)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var Lq=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),Pq=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),i$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),d$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var BY=BigInt(4294967295),$V=BigInt(32);function C6($,q=!1){if(q)return{h:Number($&BY),l:Number($>>$V&BY)};return{h:Number($>>$V&BY)|0,l:Number($&BY)|0}}function TY($,q=!1){let J=$.length,G=new Uint32Array(J),Q=new Uint32Array(J);for(let Y=0;Y<J;Y++){let{h:X,l:U}=C6($[Y],q);[G[Y],Q[Y]]=[X,U]}return[G,Q]}var hX=($,q,J)=>$>>>J,uX=($,q,J)=>$<<32-J|q>>>J,bJ=($,q,J)=>$>>>J|q<<32-J,kJ=($,q,J)=>$<<32-J|q>>>J,nG=($,q,J)=>$<<64-J|q>>>J-32,oG=($,q,J)=>$>>>J-32|q<<64-J;var qV=($,q,J)=>$<<J|q>>>32-J,JV=($,q,J)=>q<<J|$>>>32-J,GV=($,q,J)=>q<<J-32|$>>>64-J,QV=($,q,J)=>$<<J-32|q>>>64-J;function Qq($,q,J,G){let Q=(q>>>0)+(G>>>0);return{h:$+J+(Q/4294967296|0)|0,l:Q|0}}var YV=($,q,J)=>($>>>0)+(q>>>0)+(J>>>0),XV=($,q,J,G)=>q+J+G+($/4294967296|0)|0,UV=($,q,J,G)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0),WV=($,q,J,G,Q)=>q+J+G+Q+($/4294967296|0)|0,VV=($,q,J,G,Q)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0)+(Q>>>0),MV=($,q,J,G,Q,Y)=>q+J+G+Q+Y+($/4294967296|0)|0;var L6=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),$J=new Uint32Array(64);class pX extends ZY{constructor($){super(64,$,8,!1)}get(){let{A:$,B:q,C:J,D:G,E:Q,F:Y,G:X,H:U}=this;return[$,q,J,G,Q,Y,X,U]}set($,q,J,G,Q,Y,X,U){this.A=$|0,this.B=q|0,this.C=J|0,this.D=G|0,this.E=Q|0,this.F=Y|0,this.G=X|0,this.H=U|0}process($,q){for(let M=0;M<16;M++,q+=4)$J[M]=$.getUint32(q,!1);for(let M=16;M<64;M++){let z=$J[M-15],D=$J[M-2],R=l0(z,7)^l0(z,18)^z>>>3,N=l0(D,17)^l0(D,19)^D>>>10;$J[M]=N+$J[M-7]+R+$J[M-16]|0}let{A:J,B:G,C:Q,D:Y,E:X,F:U,G:W,H:V}=this;for(let M=0;M<64;M++){let z=l0(X,6)^l0(X,11)^l0(X,25),D=V+z+t5(X,U,W)+L6[M]+$J[M]|0,N=(l0(J,2)^l0(J,13)^l0(J,22))+e5(J,G,Q)|0;V=W,W=U,U=X,X=Y+D|0,Y=Q,Q=G,G=J,J=D+N|0}J=J+this.A|0,G=G+this.B|0,Q=Q+this.C|0,Y=Y+this.D|0,X=X+this.E|0,U=U+this.F|0,W=W+this.G|0,V=V+this.H|0,this.set(J,G,Q,Y,X,U,W,V)}roundClean(){A0($J)}destroy(){this.set(0,0,0,0,0,0,0,0),A0(this.buffer)}}class zV extends pX{A=Lq[0]|0;B=Lq[1]|0;C=Lq[2]|0;D=Lq[3]|0;E=Lq[4]|0;F=Lq[5]|0;G=Lq[6]|0;H=Lq[7]|0;constructor(){super(32)}}class P6 extends pX{A=Pq[0]|0;B=Pq[1]|0;C=Pq[2]|0;D=Pq[3]|0;E=Pq[4]|0;F=Pq[5]|0;G=Pq[6]|0;H=Pq[7]|0;constructor(){super(28)}}var RV=(()=>TY(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map(($)=>BigInt($))))(),F6=(()=>RV[0])(),g6=(()=>RV[1])(),qJ=new Uint32Array(80),JJ=new Uint32Array(80);class aG extends ZY{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:q,Bh:J,Bl:G,Ch:Q,Cl:Y,Dh:X,Dl:U,Eh:W,El:V,Fh:M,Fl:z,Gh:D,Gl:R,Hh:N,Hl:w}=this;return[$,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w]}set($,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w){this.Ah=$|0,this.Al=q|0,this.Bh=J|0,this.Bl=G|0,this.Ch=Q|0,this.Cl=Y|0,this.Dh=X|0,this.Dl=U|0,this.Eh=W|0,this.El=V|0,this.Fh=M|0,this.Fl=z|0,this.Gh=D|0,this.Gl=R|0,this.Hh=N|0,this.Hl=w|0}process($,q){for(let S=0;S<16;S++,q+=4)qJ[S]=$.getUint32(q),JJ[S]=$.getUint32(q+=4);for(let S=16;S<80;S++){let _=qJ[S-15]|0,y=JJ[S-15]|0,p=bJ(_,y,1)^bJ(_,y,8)^hX(_,y,7),F=kJ(_,y,1)^kJ(_,y,8)^uX(_,y,7),f=qJ[S-2]|0,m=JJ[S-2]|0,k=bJ(f,m,19)^nG(f,m,61)^hX(f,m,6),l=kJ(f,m,19)^oG(f,m,61)^uX(f,m,6),v=UV(F,l,JJ[S-7],JJ[S-16]),C=WV(v,p,k,qJ[S-7],qJ[S-16]);qJ[S]=C|0,JJ[S]=v|0}let{Ah:J,Al:G,Bh:Q,Bl:Y,Ch:X,Cl:U,Dh:W,Dl:V,Eh:M,El:z,Fh:D,Fl:R,Gh:N,Gl:w,Hh:j,Hl:B}=this;for(let S=0;S<80;S++){let _=bJ(M,z,14)^bJ(M,z,18)^nG(M,z,41),y=kJ(M,z,14)^kJ(M,z,18)^oG(M,z,41),p=M&D^~M&N,F=z&R^~z&w,f=VV(B,y,F,g6[S],JJ[S]),m=MV(f,j,_,p,F6[S],qJ[S]),k=f|0,l=bJ(J,G,28)^nG(J,G,34)^nG(J,G,39),v=kJ(J,G,28)^oG(J,G,34)^oG(J,G,39),C=J&Q^J&X^Q&X,I=G&Y^G&U^Y&U;j=N|0,B=w|0,N=D|0,w=R|0,D=M|0,R=z|0,{h:M,l:z}=Qq(W|0,V|0,m|0,k|0),W=X|0,V=U|0,X=Q|0,U=Y|0,Q=J|0,Y=G|0;let A=YV(k,v,I);J=XV(A,m,l,C),G=A|0}({h:J,l:G}=Qq(this.Ah|0,this.Al|0,J|0,G|0)),{h:Q,l:Y}=Qq(this.Bh|0,this.Bl|0,Q|0,Y|0),{h:X,l:U}=Qq(this.Ch|0,this.Cl|0,X|0,U|0),{h:W,l:V}=Qq(this.Dh|0,this.Dl|0,W|0,V|0),{h:M,l:z}=Qq(this.Eh|0,this.El|0,M|0,z|0),{h:D,l:R}=Qq(this.Fh|0,this.Fl|0,D|0,R|0),{h:N,l:w}=Qq(this.Gh|0,this.Gl|0,N|0,w|0),{h:j,l:B}=Qq(this.Hh|0,this.Hl|0,j|0,B|0),this.set(J,G,Q,Y,X,U,W,V,M,z,D,R,N,w,j,B)}roundClean(){A0(qJ,JJ)}destroy(){A0(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class _6 extends aG{Ah=d$[0]|0;Al=d$[1]|0;Bh=d$[2]|0;Bl=d$[3]|0;Ch=d$[4]|0;Cl=d$[5]|0;Dh=d$[6]|0;Dl=d$[7]|0;Eh=d$[8]|0;El=d$[9]|0;Fh=d$[10]|0;Fl=d$[11]|0;Gh=d$[12]|0;Gl=d$[13]|0;Hh=d$[14]|0;Hl=d$[15]|0;constructor(){super(64)}}class DV extends aG{Ah=i$[0]|0;Al=i$[1]|0;Bh=i$[2]|0;Bl=i$[3]|0;Ch=i$[4]|0;Cl=i$[5]|0;Dh=i$[6]|0;Dl=i$[7]|0;Eh=i$[8]|0;El=i$[9]|0;Fh=i$[10]|0;Fl=i$[11]|0;Gh=i$[12]|0;Gl=i$[13]|0;Hh=i$[14]|0;Hl=i$[15]|0;constructor(){super(48)}}var J0=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),G0=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class v6 extends aG{Ah=J0[0]|0;Al=J0[1]|0;Bh=J0[2]|0;Bl=J0[3]|0;Ch=J0[4]|0;Cl=J0[5]|0;Dh=J0[6]|0;Dl=J0[7]|0;Eh=J0[8]|0;El=J0[9]|0;Fh=J0[10]|0;Fl=J0[11]|0;Gh=J0[12]|0;Gl=J0[13]|0;Hh=J0[14]|0;Hl=J0[15]|0;constructor(){super(28)}}class b6 extends aG{Ah=G0[0]|0;Al=G0[1]|0;Bh=G0[2]|0;Bl=G0[3]|0;Ch=G0[4]|0;Cl=G0[5]|0;Dh=G0[6]|0;Dl=G0[7]|0;Eh=G0[8]|0;El=G0[9]|0;Fh=G0[10]|0;Fl=G0[11]|0;Gh=G0[12]|0;Gl=G0[13]|0;Hh=G0[14]|0;Hl=G0[15]|0;constructor(){super(32)}}var SY=C8(()=>new zV,oq(1));var KV=C8(()=>new DV,oq(2));/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var k6=BigInt(1),HV=BigInt(2),m6=BigInt(3),y6=BigInt(5),n3=BigInt(8),OV=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed");function f6($){let q=BigInt(10),J=BigInt(20),G=BigInt(40),Q=BigInt(80),Y=OV,U=$*$%Y*$%Y,W=m0(U,HV,Y)*U%Y,V=m0(W,k6,Y)*$%Y,M=m0(V,y6,Y)*V%Y,z=m0(M,q,Y)*M%Y,D=m0(z,J,Y)*z%Y,R=m0(D,G,Y)*D%Y,N=m0(R,Q,Y)*R%Y,w=m0(N,Q,Y)*R%Y,j=m0(w,q,Y)*M%Y;return{pow_p_5_8:m0(j,HV,Y)*$%Y,b2:U}}function x6($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var NV=(()=>{let $=OV;return d5({P:$,type:"x25519",powPminus2:(q)=>{let{pow_p_5_8:J,b2:G}=f6(q);return D0(m0(J,m6,$)*G,$)},adjustScalarBytes:x6})})();/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var h6=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))(),u6=(()=>({p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff"),n:BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973"),h:BigInt(1),a:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc"),b:BigInt("0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef"),Gx:BigInt("0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7"),Gy:BigInt("0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f")}))();var p6=fX(h6),lX=xX(p6,SY);var l6=fX(u6),wV=xX(l6,KV);function AV($,q,J){if(k0($),J===void 0)J=new Uint8Array($.outputLen);return F8($,J,q)}var rX=Uint8Array.of(0),jV=Uint8Array.of();function ZV($,q,J,G=32){k0($),f$(G,"length");let Q=$.outputLen;if(G>255*Q)throw Error("Length must be <= 255*HashLen");let Y=Math.ceil(G/Q);if(J===void 0)J=jV;else Q$(J,void 0,"info");let X=new Uint8Array(Y*Q),U=F8.create($,q),W=U._cloneInto(),V=new Uint8Array(U.outputLen);for(let M=0;M<Y;M++)rX[0]=M+1,W.update(M===0?jV:V).update(J).update(rX).digestInto(V),X.set(V,Q*M),U._cloneInto(W);return U.destroy(),W.destroy(),A0(V,rX),X.slice(0,G)}var r6=BigInt(0),sG=BigInt(1),i6=BigInt(2),d6=BigInt(7),c6=BigInt(256),n6=BigInt(113),SV=[],IV=[],CV=[];for(let $=0,q=sG,J=1,G=0;$<24;$++){[J,G]=[G,(2*J+3*G)%5],SV.push(2*(5*G+J)),IV.push(($+1)*($+2)/2%64);let Q=r6;for(let Y=0;Y<7;Y++)if(q=(q<<sG^(q>>d6)*n6)%c6,q&i6)Q^=sG<<(sG<<BigInt(Y))-sG;CV.push(Q)}var EV=TY(CV,!0),o6=EV[0],a6=EV[1],BV=($,q,J)=>J>32?GV($,q,J):qV($,q,J),TV=($,q,J)=>J>32?QV($,q,J):JV($,q,J);function s6($,q=24){let J=new Uint32Array(10);for(let G=24-q;G<24;G++){for(let X=0;X<10;X++)J[X]=$[X]^$[X+10]^$[X+20]^$[X+30]^$[X+40];for(let X=0;X<10;X+=2){let U=(X+8)%10,W=(X+2)%10,V=J[W],M=J[W+1],z=BV(V,M,1)^J[U],D=TV(V,M,1)^J[U+1];for(let R=0;R<50;R+=10)$[X+R]^=z,$[X+R+1]^=D}let Q=$[2],Y=$[3];for(let X=0;X<24;X++){let U=IV[X],W=BV(Q,Y,U),V=TV(Q,Y,U),M=SV[X];Q=$[M],Y=$[M+1],$[M]=W,$[M+1]=V}for(let X=0;X<50;X+=10){for(let U=0;U<10;U++)J[U]=$[X+U];for(let U=0;U<10;U++)$[X+U]^=~J[(U+2)%10]&J[(U+4)%10]}$[0]^=o6[G],$[1]^=a6[G]}A0(J)}class IY{state;pos=0;posOut=0;finished=!1;state32;destroyed=!1;blockLen;suffix;outputLen;enableXOF=!1;rounds;constructor($,q,J,G=!1,Q=24){if(this.blockLen=$,this.suffix=q,this.outputLen=J,this.enableXOF=G,this.rounds=Q,f$(J,"outputLen"),!(0<$&&$<200))throw Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=DY(this.state)}clone(){return this._cloneInto()}keccak(){BX(this.state32),s6(this.state32,this.rounds),BX(this.state32),this.posOut=0,this.pos=0}update($){Cq(this),Q$($);let{blockLen:q,state:J}=this,G=$.length;for(let Q=0;Q<G;){let Y=Math.min(q-this.pos,G-Q);for(let X=0;X<Y;X++)J[this.pos++]^=$[Q++];if(this.pos===q)this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;let{state:$,suffix:q,pos:J,blockLen:G}=this;if($[J]^=q,(q&128)!==0&&J===G-1)this.keccak();$[G-1]^=128,this.keccak()}writeInto($){Cq(this,!1),Q$($),this.finish();let q=this.state,{blockLen:J}=this;for(let G=0,Q=$.length;G<Q;){if(this.posOut>=J)this.keccak();let Y=Math.min(J-this.posOut,Q-G);$.set(q.subarray(this.posOut,this.posOut+Y),G),this.posOut+=Y,G+=Y}return $}xofInto($){if(!this.enableXOF)throw Error("XOF is not possible for this instance");return this.writeInto($)}xof($){return f$($),this.xofInto(new Uint8Array($))}digestInto($){if(RY($,this),this.finished)throw Error("digest() was already called");return this.writeInto($),this.destroy(),$}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,A0(this.state)}_cloneInto($){let{blockLen:q,suffix:J,outputLen:G,rounds:Q,enableXOF:Y}=this;return $||=new IY(q,J,G,Y,Q),$.state32.set(this.state32),$.pos=this.pos,$.posOut=this.posOut,$.finished=this.finished,$.rounds=Q,$.suffix=J,$.outputLen=G,$.enableXOF=Y,$.destroyed=this.destroyed,$}}var LV=($,q,J,G={})=>C8(()=>new IY(q,$,J),G);var mJ=LV(6,136,32,oq(8));var PV=LV(6,72,64,oq(10));var FV=($,q,J,G={})=>C8((Q={})=>new IY(q,$,Q.dkLen===void 0?J:Q.dkLen,!0),G),gV=FV(31,168,16,oq(11)),Yq=FV(31,136,32,oq(12));function iX($){if(!Number.isSafeInteger($)||$<0||$>4294967295)throw Error("wrong u32 integer:"+$);return $}function vV($){return iX($),($&$-1)===0&&$!==0}function dX($,q){iX($);let J=0;for(let G=0;G<q;G++,$>>>=1)J=J<<1|$&1;return J}function bV($){return iX($),31-Math.clz32($)}function _V($){let q=$.length;if(q<2||!vV(q))throw Error("n must be a power of 2 and greater than 1. Got "+q);let J=bV(q);for(let G=0;G<q;G++){let Q=dX(G,J);if(G<Q){let Y=$[G];$[G]=$[Q],$[Q]=Y}}return $}var cX=($,q)=>{let{N:J,roots:G,dit:Q,invertButterflies:Y=!1,skipStages:X=0,brp:U=!0}=q,W=bV(J);if(!vV(J))throw Error("FFT: Polynomial size should be power of two");let V=Q!==Y;return(M)=>{if(M.length!==J)throw Error("FFT: wrong Polynomial length");if(Q&&U)_V(M);for(let z=0,D=1;z<W-X;z++){let R=Q?z+1+X:W-z,N=1<<R,w=N>>1,j=J>>R;for(let B=0;B<J;B+=N)for(let S=0,_=D++;S<w;S++){let y=Y?Q?J-_:_:S*j,p=B+S,F=B+S+w,f=G[y],m=M[F],k=M[p];if(V){let l=$.mul(m,f);M[p]=$.add(k,l),M[F]=$.sub(k,l)}else if(Y)M[p]=$.add(m,k),M[F]=$.mul($.sub(m,k),f);else M[p]=$.add(k,m),M[F]=$.mul($.sub(k,m),f)}}if(!Q&&U)_V(M);return M}};/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var Xq=nq;function CY($,q){if($.length!==q.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^q[G];return J===0}function kV($){return Uint8Array.from($)}function yJ($,...q){let J=(Q)=>typeof Q==="number"?Q:Q.bytesLen,G=q.reduce((Q,Y)=>Q+J(Y),0);return{bytesLen:G,encode:(Q)=>{let Y=new Uint8Array(G);for(let X=0,U=0;X<q.length;X++){let W=q[X],V=J(W),M=typeof W==="number"?Q[X]:W.encode(Q[X]);if(Q$(M,V,$),Y.set(M,U),typeof W!=="number")M.fill(0);U+=V}return Y},decode:(Q)=>{Q$(Q,G,$);let Y=[];for(let X of q){let U=J(X),W=Q.subarray(0,U);Y.push(typeof X==="number"?W:X.decode(W)),Q=Q.subarray(U)}return Y}}}function EY($,q){let J=q*$.bytesLen;return{bytesLen:J,encode:(G)=>{if(G.length!==q)throw Error(`vecCoder.encode: wrong length=${G.length}. Expected: ${q}`);let Q=new Uint8Array(J);for(let Y=0,X=0;Y<G.length;Y++){let U=$.encode(G[Y]);Q.set(U,X),U.fill(0),X+=U.length}return Q},decode:(G)=>{Q$(G,J);let Q=[];for(let Y=0;Y<G.length;Y+=$.bytesLen)Q.push($.decode(G.subarray(Y,Y+$.bytesLen)));return Q}}}function b$(...$){for(let q of $)if(Array.isArray(q))for(let J of q)J.fill(0);else q.fill(0)}function nX($){return(1<<$)-1}var VF=Uint8Array.of();/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var mV=($)=>{let{newPoly:q,N:J,Q:G,F:Q,ROOT_OF_UNITY:Y,brvBits:X,isKyber:U}=$,W=(S,_=G)=>{let y=S%_|0;return(y>=0?y|0:_+y|0)|0},V=(S,_=G)=>{let y=W(S,_)|0;return(y>_>>1?y-_|0:y)|0};function M(){let S=q(J);for(let _=0;_<J;_++){let y=dX(_,X),p=BigInt(Y)**BigInt(y)%BigInt(G);S[_]=Number(p)|0}return S}let z=M(),D={add:(S,_)=>W((S|0)+(_|0))|0,sub:(S,_)=>W((S|0)-(_|0))|0,mul:(S,_)=>W((S|0)*(_|0))|0,inv:(S)=>{throw Error("not implemented")}},R={N:J,roots:z,invertButterflies:!0,skipStages:U?1:0,brp:!1},N=cX(D,{dit:!1,...R}),w=cX(D,{dit:!0,...R});return{mod:W,smod:V,nttZetas:z,NTT:{encode:(S)=>{return N(S)},decode:(S)=>{w(S);for(let _=0;_<S.length;_++)S[_]=W(Q*S[_]);return S}},bitsCoder:(S,_)=>{let y=nX(S),p=S*(J/8);return{bytesLen:p,encode:(F)=>{let f=new Uint8Array(p);for(let m=0,k=0,l=0,v=0;m<F.length;m++){k|=(_.encode(F[m])&y)<<l,l+=S;for(;l>=8;l-=8,k>>=8)f[v++]=k&nX(l)}return f},decode:(F)=>{let f=q(J);for(let m=0,k=0,l=0,v=0;m<F.length;m++){k|=F[m]<<l,l+=8;for(;l>=S;l-=S,k>>=S)f[v++]=_.decode(k&y)}return f}}}}},t6=($)=>(q,J)=>{if(!J)J=$.blockLen;let G=new Uint8Array(q.length+2);G.set(q);let Q=q.length,Y=new Uint8Array(J),X=$.create({}),U=0,W=0;return{stats:()=>({calls:U,xofs:W}),get:(V,M)=>{return G[Q+0]=V,G[Q+1]=M,X.destroy(),X=$.create({}).update(G),U++,()=>{return W++,X.xofInto(Y)}},clean:()=>{X.destroy(),b$(Y,G)}}},yV=t6(gV);/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var Q0=256,Fq=3329,e6=3303,$N=17,{mod:$Q,nttZetas:qN,NTT:fJ,bitsCoder:JN}=mV({N:Q0,Q:Fq,F:e6,ROOT_OF_UNITY:$N,newPoly:($)=>new Uint16Array($),brvBits:7,isKyber:!0}),oX={512:{N:Q0,Q:Fq,K:2,ETA1:3,ETA2:2,du:10,dv:4,RBGstrength:128},768:{N:Q0,Q:Fq,K:3,ETA1:2,ETA2:2,du:10,dv:4,RBGstrength:192},1024:{N:Q0,Q:Fq,K:4,ETA1:2,ETA2:2,du:11,dv:5,RBGstrength:256}},GN=($)=>{if($>=12)return{encode:(J)=>J,decode:(J)=>J};let q=2**($-1);return{encode:(J)=>((J<<$)+Fq/2)/Fq,decode:(J)=>J*Fq+q>>>$}},tG=($)=>JN($,GN($));function xJ($,q){for(let J=0;J<Q0;J++)$[J]=$Q($[J]+q[J])}function QN($,q){for(let J=0;J<Q0;J++)$[J]=$Q($[J]-q[J])}function YN($,q,J,G,Q){let Y=$Q(q*G*Q+$*J),X=$Q($*G+q*J);return{c0:Y,c1:X}}function LY($,q){for(let J=0;J<Q0/2;J++){let G=qN[64+(J>>1)];if(J&1)G=-G;let{c0:Q,c1:Y}=YN($[2*J+0],$[2*J+1],q[2*J+0],q[2*J+1],G);$[2*J+0]=Q,$[2*J+1]=Y}return $}function fV($){let q=new Uint16Array(Q0);for(let J=0;J<Q0;){let G=$();if(G.length%3)throw Error("SampleNTT: unaligned block");for(let Q=0;J<Q0&&Q+3<=G.length;Q+=3){let Y=(G[Q+0]>>0|G[Q+1]<<8)&4095,X=(G[Q+1]>>4|G[Q+2]<<4)&4095;if(Y<Fq)q[J++]=Y;if(J<Q0&&X<Fq)q[J++]=X}}return q}function eG($,q,J,G){let Q=$(G*Q0/4,q,J),Y=new Uint16Array(Q0),X=DY(Q),U=0;for(let W=0,V=0,M=0,z=0;W<X.length;W++){let D=X[W];for(let R=0;R<32;R++)if(M+=D&1,D>>=1,U+=1,U===G)z=M,M=0;else if(U===2*G)Y[V++]=$Q(z-M),M=0,U=0}if(U)throw Error(`sampleCBD: leftover bits: ${U}`);return Y}var XN=($)=>{let{K:q,PRF:J,XOF:G,HASH512:Q,ETA1:Y,ETA2:X,du:U,dv:W}=$,V=tG(1),M=tG(W),z=tG(U),D=yJ("publicKey",EY(tG(12),q),32),R=EY(tG(12),q),N=yJ("ciphertext",EY(z,q),M),w=yJ("seed",32,32);return{secretCoder:R,lengths:{secretKey:R.bytesLen,publicKey:D.bytesLen,cipherText:N.bytesLen},keygen:(j)=>{Q$(j,32,"seed");let B=new Uint8Array(33);B.set(j),B[32]=q;let S=Q(B),[_,y]=w.decode(S),p=[],F=[];for(let k=0;k<q;k++)p.push(fJ.encode(eG(J,y,k,Y)));let f=G(_);for(let k=0;k<q;k++){let l=fJ.encode(eG(J,y,q+k,Y));for(let v=0;v<q;v++){let C=fV(f.get(v,k));xJ(l,LY(C,p[v]))}F.push(l)}f.clean();let m={publicKey:D.encode([F,_]),secretKey:R.encode(p)};return b$(_,y,p,F,B,S),m},encrypt:(j,B,S)=>{let[_,y]=D.decode(j),p=[];for(let v=0;v<q;v++)p.push(fJ.encode(eG(J,S,v,Y)));let F=G(y),f=new Uint16Array(Q0),m=[];for(let v=0;v<q;v++){let C=eG(J,S,q+v,X),I=new Uint16Array(Q0);for(let A=0;A<q;A++){let T=fV(F.get(v,A));xJ(I,LY(T,p[A]))}xJ(C,fJ.decode(I)),m.push(C),xJ(f,LY(_[v],p[v])),b$(I)}F.clean();let k=eG(J,S,2*q,X);xJ(k,fJ.decode(f));let l=V.decode(B);return xJ(l,k),b$(_,p,f,k),N.encode([m,l])},decrypt:(j,B)=>{let[S,_]=N.decode(j),y=R.decode(B),p=new Uint16Array(Q0);for(let F=0;F<q;F++)xJ(p,LY(y[F],fJ.encode(S[F])));return QN(_,fJ.decode(p)),b$(p,y,S),V.encode(_)}}};function aX($){let q=XN($),{HASH256:J,HASH512:G,KDF:Q}=$,{secretCoder:Y,lengths:X}=q,U=yJ("secretKey",X.secretKey,X.publicKey,32,32),W=32,V=64;return{info:{type:"ml-kem"},lengths:{...X,seed:64,msg:32,msgRand:32,secretKey:U.bytesLen},keygen:(M=Xq(64))=>{Q$(M,64,"seed");let{publicKey:z,secretKey:D}=q.keygen(M.subarray(0,32)),R=J(z),N=U.encode([D,z,R,M.subarray(32)]);return b$(D,R),{publicKey:z,secretKey:N}},getPublicKey:(M)=>{let[z,D,R,N]=U.decode(M);return Uint8Array.from(D)},encapsulate:(M,z=Xq(32))=>{Q$(M,X.publicKey,"publicKey"),Q$(z,32,"message");let D=M.subarray(0,384*$.K),R=Y.encode(Y.decode(kV(D)));if(!CY(R,D))throw b$(R),Error("ML-KEM.encapsulate: wrong publicKey modulus");b$(R);let N=G.create().update(z).update(J(M)).digest(),w=q.encrypt(M,z,N.subarray(32,64));return b$(N.subarray(32)),{cipherText:w,sharedSecret:N.subarray(0,32)}},decapsulate:(M,z)=>{Q$(z,U.bytesLen,"secretKey"),Q$(M,X.cipherText,"cipherText");let D=U.bytesLen-96,R=D+32,N=J(z.subarray(D/2,R));if(!CY(N,z.subarray(R,R+32)))throw Error("invalid secretKey: hash check failed");let[w,j,B,S]=U.decode(z),_=q.decrypt(M,w),y=G.create().update(_).update(B).digest(),p=y.subarray(0,32),F=q.encrypt(j,_,y.subarray(32,64)),f=CY(M,F),m=Q.create({dkLen:32}).update(S).update(M).digest();return b$(_,F,!f?p:m),f?p:m}}}function UN($,q,J){return Yq.create({dkLen:$}).update(q).update(new Uint8Array([J])).digest()}var sX={HASH256:mJ,HASH512:PV,KDF:Yq,XOF:yV,PRF:UN},AF=aX({...sX,...oX[512]}),qQ=aX({...sX,...oX[768]}),xV=aX({...sX,...oX[1024]});/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */function WN($,q=!1){let{lengths:J,keygen:G}=$;if(q){let Y=$.Point.Fn;if(!Y)throw Error("No Point.Fn");G=(X=Xq(J.seed))=>{Q$(X,J.seed,"seed");let U=Y.isLE?sq(X):aq(X),W=Y.toBytes(Y.create(U));return{secretKey:W,publicKey:$.getPublicKey(W)}}}return{lengths:{secretKey:J.secretKey,publicKey:J.publicKey,seed:J.seed},keygen:G,getPublicKey:(Q)=>$.getPublicKey(Q)}}function tX($,q=!1){let J=WN($,q);if(!$.getSharedSecret)throw Error("wrong curve");return{lengths:{...J.lengths,msg:J.lengths.seed,cipherText:J.lengths.publicKey},keygen:J.keygen,getPublicKey:J.getPublicKey,encapsulate(G,Q=Xq($.lengths.seed)){let Y=this.keygen(Q).secretKey,X=this.decapsulate(G,Y),U=$.getPublicKey(Y);return b$(Y),{sharedSecret:X,cipherText:U}},decapsulate(G,Q){let Y=$.getSharedSecret(Q,G);return $.lengths.publicKeyHasPrefix?Y.subarray(1):Y}}}function JQ($,q){return yJ(q,...$.map((J)=>{if(typeof J.lengths[q]!=="number")throw Error("wrong length: "+q);return J.lengths[q]}))}function eX($){return(q,J)=>$(q,{dkLen:J})}function VN($,q,...J){let G=JQ(J,"seed"),Q=JQ(J,"publicKey");if($===void 0)$=G.bytesLen;f$($);function Y(X){Q$(X,$);let U=G.decode(q(X,G.bytesLen)),W=J.map((z,D)=>z.keygen(U[D])),V=W.map((z)=>z.secretKey),M=W.map((z)=>z.publicKey);return{secretKey:V,publicKey:M}}return{info:{lengths:{seed:$,publicKey:Q.bytesLen,secretKey:$}},getPublicKey(X){return this.keygen(X).publicKey},keygen(X=Xq($)){let{publicKey:U,secretKey:W}=Y(X),V=Q.encode(U);return b$(U),b$(W),{secretKey:X,publicKey:V}},expandDecapsulationKey:Y,realSeedLen:$}}function PY($,q,J,G,...Q){let Y=VN($,J,...Q),X=JQ(Q,"cipherText"),U=JQ(Q,"publicKey"),W=JQ(Q,"msg");if(q===void 0)q=W.bytesLen;return f$(q),{lengths:{...Y.info.lengths,msg:q,msgRand:W.bytesLen,cipherText:X.bytesLen},getPublicKey:Y.getPublicKey,keygen:Y.keygen,encapsulate(V,M=Xq(W.bytesLen)){let z=U.decode(V),D=W.decode(M),R=Q.map((B,S)=>B.encapsulate(z[S],D[S])),N=R.map((B)=>B.sharedSecret),w=R.map((B)=>B.cipherText),j={sharedSecret:G(z,w,N),cipherText:X.encode(w)};return b$(N,w),j},decapsulate(V,M){let z=X.decode(V),{publicKey:D,secretKey:R}=Y.expandDecapsulationKey(M),N=Q.map((w,j)=>w.decapsulate(z[j],R[j]));return G(D,z,N)}}}function hV($,q,J,G,Q){return k0(G),k0(Q),PY(32,32,eX(G),(Y,X,U)=>Q(F$(U[0],U[1],X[1],Y[1],tq($))),q,J)}var gF=hV("QSF-KEM(ML-KEM-768,P-256)-XOF(SHAKE256)-KDF(SHA3-256)",qQ,tX(lX,!0),Yq,mJ),_F=hV("QSF-KEM(ML-KEM-1024,P-384)-XOF(SHAKE256)-KDF(SHA3-256)",xV,tX(wV,!0),Yq,mJ);function MN($,q,J,G,Q){return k0(G),k0(Q),PY(32,32,eX(G),(Y,X,U)=>{let W=F$(U[0],U[1],X[0],Y[0],X[1],Y[1],tq($)),V=32,M=F$(tq("hybrid_prk"),W),z=AV(Q,M),D=F$(E8(32,2),tq("shared_secret"),tq("")),R=ZV(Q,z,D,32);return b$(z,D,M,W),R},q,J)}var uV=tX(NV),vF=MN("KitchenSink-KEM(ML-KEM-768,X25519)-XOF(SHAKE256)-KDF(HKDF-SHA-256)",qQ,uV,Yq,SY),zN=(()=>PY(32,32,eX(Yq),($,q,J)=>mJ(F$(J[0],J[1],q[1],$[1],tq("\\.//^\\"))),qQ,uV))();function RN($,q,J,G){let Q=$.Point.Fn;if(!Q)throw Error("no Point.Fn");function Y(X){let U;for(let M=0,z=q;;M=z,z+=q){if(z>X.length)throw Error("rejection sampling failed");if(U=Q.fromBytes(X.subarray(M,z),!0),Q.isValidNot0(U))break}let W=Q.toBytes(Q.create(U)),V=$.getPublicKey(W,!1);return{secretKey:W,publicKey:V}}return{lengths:{secretKey:q,publicKey:J,seed:G,msg:G,cipherText:J},keygen(X=Xq(G)){return Q$(X,G,"seed"),Y(X)},getPublicKey(X){return $.getPublicKey(X,!1)},encapsulate(X,U=Xq(G)){Q$(U,G,"rand");let{secretKey:W}=Y(U),V=this.decapsulate(X,W),M=$.getPublicKey(W,!1);return b$(W),{sharedSecret:V,cipherText:M}},decapsulate(X,U){return $.getSharedSecret(U,X).subarray(1)}}}function DN($,q,J,G){let{secretKey:Q,publicKeyUncompressed:Y}=J.lengths;if(!Q||!Y)throw Error("wrong curve");let X=RN(J,Q,Y,G),U=64,W=U+G;return PY(32,32,(V)=>{Q$(V,32);let M=Yq(V,{dkLen:W}),z=M.subarray(0,U),D=M.subarray(U,W);return F$(z,D)},(V,M,z)=>mJ(F$(z[0],z[1],M[1],V[1],tq($))),q,X)}var KN=(()=>DN("MLKEM768-P256",qQ,lX,128))();var FY=zN,pV=KN;/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var Z$=($,q,J)=>u$($,q,J),qU=E$,_8=$Y,c$=(...$)=>JX(...$),v8=($)=>gG($),b8=e9,k8=($)=>Zq($),_Y=BigInt(0),$U=BigInt(1);function gq($,q=""){if(typeof $!=="boolean"){let J=q&&`"${q}" `;throw TypeError(J+"expected boolean, got type="+typeof $)}return $}function vY($){if(typeof $==="bigint"){if(!gY($))throw RangeError("positive bigint expected, got "+$)}else qU($);return $}function Uq($,q=""){if(typeof $!=="number"){let J=q&&`"${q}" `;throw TypeError(J+"expected number, got type="+typeof $)}if(!Number.isSafeInteger($)){let J=q&&`"${q}" `;throw RangeError(J+"expected safe integer, got "+$)}}function GQ($){let q=vY($).toString(16);return q.length&1?"0"+q:q}function lV($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);return $===""?_Y:BigInt("0x"+$)}function hJ($){return lV($Y($))}function r0($){return lV($Y(GJ(u$($)).reverse()))}function bY($,q){if(E$(q),q===0)throw RangeError("zero length");$=vY($);let J=$.toString(16);if(J.length>q*2)throw RangeError("number too large");return gG(J.padStart(q*2,"0"))}function QQ($,q){return bY($,q).reverse()}function rV($,q){if($=Z$($),q=Z$(q),$.length!==q.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^q[G];return J===0}function GJ($){return Uint8Array.from(Z$($))}function kY($){if(typeof $!=="string")throw TypeError("ascii string expected, got "+typeof $);return Uint8Array.from($,(q,J)=>{let G=q.charCodeAt(0);if(q.length!==1||G>127)throw RangeError(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var gY=($)=>typeof $==="bigint"&&_Y<=$;function HN($,q,J){return gY($)&&gY(q)&&gY(J)&&q<=$&&$<J}function _q($,q,J,G){if(!HN(q,J,G))throw RangeError("expected valid "+$+": "+J+" <= n < "+G+", got "+q)}function m8($){if($<_Y)throw Error("expected non-negative bigint, got "+$);let q;for(q=0;$>_Y;$>>=$U,q+=1);return q}var YQ=($)=>($U<<BigInt($))-$U;function iV($,q,J){if(E$($,"hashLen"),E$(q,"qByteLen"),typeof J!=="function")throw TypeError("hmacFn must be a function");let G=(j)=>new Uint8Array(j),Q=Uint8Array.of(),Y=Uint8Array.of(0),X=Uint8Array.of(1),U=1000,W=G($),V=G($),M=0,z=()=>{W.fill(1),V.fill(0),M=0},D=(...j)=>J(V,c$(W,...j)),R=(j=Q)=>{if(V=D(Y,j),W=D(),j.length===0)return;V=D(X,j),W=D()},N=()=>{if(M++>=U)throw Error("drbg: tried max amount of iterations");let j=0,B=[];while(j<q){W=D();let S=W.slice();B.push(S),j+=W.length}return c$(...B)};return(j,B)=>{z(),R(j);let S=void 0;while((S=B(N()))===void 0)R();return z(),S}}function y0($,q={},J={}){if(Object.prototype.toString.call($)!=="[object Object]")throw TypeError("expected valid options object");function G(Y,X,U){if(!U&&X!=="function"&&!Object.hasOwn($,Y))throw TypeError(`param "${Y}" is invalid: expected own property`);let W=$[Y];if(U&&W===void 0)return;let V=typeof W;if(V!==X||W===null)throw TypeError(`param "${Y}" is invalid: expected ${X}, got ${V}`)}let Q=(Y,X)=>Object.entries(Y).forEach(([U,W])=>G(U,W,X));Q(q,!1),Q(J,!0)}var JU=()=>{throw Error("not implemented")};/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var n$=BigInt(0),I$=BigInt(1),uJ=BigInt(2),oV=BigInt(3),aV=BigInt(4),sV=BigInt(5),ON=BigInt(7),tV=BigInt(8),NN=BigInt(9),eV=BigInt(16);function B$($,q){if(q<=n$)throw Error("mod: expected positive modulus, got "+q);let J=$%q;return J>=n$?J:q+J}function f0($,q,J){if(q<n$)throw Error("pow2: expected non-negative exponent, got "+q);let G=$;while(q-- >n$)G*=G,G%=J;return G}function dV($,q){if($===n$)throw Error("invert: expected non-zero number");if(q<=n$)throw Error("invert: expected positive modulus, got "+q);let J=B$($,q),G=q,Q=n$,Y=I$,X=I$,U=n$;while(J!==n$){let V=G/J,M=G-J*V,z=Q-X*V,D=Y-U*V;G=J,J=M,Q=X,Y=U,X=z,U=D}if(G!==I$)throw Error("invert: does not exist");return B$(Q,q)}function GU($,q,J){let G=$;if(!G.eql(G.sqr(q),J))throw Error("Cannot find square root")}function $M($,q){let J=$,G=(J.ORDER+I$)/aV,Q=J.pow(q,G);return GU(J,Q,q),Q}function wN($,q){let J=$,G=(J.ORDER-sV)/tV,Q=J.mul(q,uJ),Y=J.pow(Q,G),X=J.mul(q,Y),U=J.mul(J.mul(X,uJ),Y),W=J.mul(X,J.sub(U,J.ONE));return GU(J,W,q),W}function jN($){let q=mY($),J=qM($),G=J(q,q.neg(q.ONE)),Q=J(q,G),Y=J(q,q.neg(G)),X=($+ON)/eV;return(U,W)=>{let V=U,M=V.pow(W,X),z=V.mul(M,G),D=V.mul(M,Q),R=V.mul(M,Y),N=V.eql(V.sqr(z),W),w=V.eql(V.sqr(D),W);M=V.cmov(M,z,N),z=V.cmov(R,D,w);let j=V.eql(V.sqr(z),W),B=V.cmov(M,z,j);return GU(V,B,W),B}}function qM($){if($<oV)throw Error("sqrt is not defined for small field");let q=$-I$,J=0;while(q%uJ===n$)q/=uJ,J++;let G=uJ,Q=mY($);while(cV(Q,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return $M;let Y=Q.pow(G,q),X=(q+I$)/uJ;return function(W,V){let M=W;if(M.is0(V))return V;if(cV(M,V)!==1)throw Error("Cannot find square root");let z=J,D=M.mul(M.ONE,Y),R=M.pow(V,q),N=M.pow(V,X);while(!M.eql(R,M.ONE)){if(M.is0(R))return M.ZERO;let w=1,j=M.sqr(R);while(!M.eql(j,M.ONE))if(w++,j=M.sqr(j),w===z)throw Error("Cannot find square root");let B=I$<<BigInt(z-w-1),S=M.pow(D,B);z=w,D=M.sqr(S),R=M.mul(R,D),N=M.mul(N,S)}return N}}function AN($){if($%aV===oV)return $M;if($%tV===sV)return wN;if($%eV===NN)return jN($);return qM($)}var vq=($,q)=>(B$($,q)&I$)===I$,ZN=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function QU($){let q={ORDER:"bigint",BYTES:"number",BITS:"number"},J=ZN.reduce((G,Q)=>{return G[Q]="function",G},q);if(y0($,J),Uq($.BYTES,"BYTES"),Uq($.BITS,"BITS"),$.BYTES<1||$.BITS<1)throw Error("invalid field: expected BYTES/BITS > 0");if($.ORDER<=I$)throw Error("invalid field: expected ORDER > 1, got "+$.ORDER);return $}function BN($,q,J){let G=$;if(J<n$)throw Error("invalid exponent, negatives unsupported");if(J===n$)return G.ONE;if(J===I$)return q;let Q=G.ONE,Y=q;while(J>n$){if(J&I$)Q=G.mul(Q,Y);Y=G.sqr(Y),J>>=I$}return Q}function XQ($,q,J=!1){let G=$,Q=Array(q.length).fill(J?G.ZERO:void 0),Y=q.reduce((U,W,V)=>{if(G.is0(W))return U;return Q[V]=U,G.mul(U,W)},G.ONE),X=G.inv(Y);return q.reduceRight((U,W,V)=>{if(G.is0(W))return U;return Q[V]=G.mul(U,Q[V]),G.mul(U,W)},X),Q}function cV($,q){let J=$,G=(J.ORDER-I$)/uJ,Q=J.pow(q,G),Y=J.eql(Q,J.ONE),X=J.eql(Q,J.ZERO),U=J.eql(Q,J.neg(J.ONE));if(!Y&&!X&&!U)throw Error("invalid Legendre symbol result");return Y?1:X?0:-1}function TN($,q){if(q!==void 0)qU(q);if($<=n$)throw Error("invalid n length: expected positive n, got "+$);if(q!==void 0&&q<1)throw Error("invalid n length: expected positive bit length, got "+q);let J=m8($);if(q!==void 0&&q<J)throw Error(`invalid n length: expected bit length (${J}) >= n.length (${q})`);let G=q!==void 0?q:J,Q=Math.ceil(G/8);return{nBitLength:G,nByteLength:Q}}var nV=new WeakMap;class YU{ORDER;BITS;BYTES;isLE;ZERO=n$;ONE=I$;_lengths;_mod;constructor($,q={}){if($<=I$)throw Error("invalid field: expected ORDER > 1, got "+$);let J=void 0;if(this.isLE=!1,q!=null&&typeof q==="object"){if(typeof q.BITS==="number")J=q.BITS;if(typeof q.sqrt==="function")Object.defineProperty(this,"sqrt",{value:q.sqrt,enumerable:!0});if(typeof q.isLE==="boolean")this.isLE=q.isLE;if(q.allowedLengths)this._lengths=Object.freeze(q.allowedLengths.slice());if(typeof q.modFromBytes==="boolean")this._mod=q.modFromBytes}let{nBitLength:G,nByteLength:Q}=TN($,J);if(Q>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=Q,Object.freeze(this)}create($){return B$($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw TypeError("invalid field element: expected bigint, got "+typeof $);return n$<=$&&$<this.ORDER}is0($){return $===n$}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&I$)===I$}neg($){return B$(-$,this.ORDER)}eql($,q){return $===q}sqr($){return B$($*$,this.ORDER)}add($,q){return B$($+q,this.ORDER)}sub($,q){return B$($-q,this.ORDER)}mul($,q){return B$($*q,this.ORDER)}pow($,q){return BN(this,$,q)}div($,q){return B$($*dV(q,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,q){return $+q}subN($,q){return $-q}mulN($,q){return $*q}inv($){return dV($,this.ORDER)}sqrt($){let q=nV.get(this);if(!q)nV.set(this,q=AN(this.ORDER));return q(this,$)}toBytes($){return this.isLE?QQ($,this.BYTES):bY($,this.BYTES)}fromBytes($,q=!1){Z$($);let{_lengths:J,BYTES:G,isLE:Q,ORDER:Y,_mod:X}=this;if(J){if($.length<1||!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let W=new Uint8Array(G);W.set($,Q?0:W.length-$.length),$=W}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let U=Q?r0($):hJ($);if(X)U=B$(U,Y);if(!q){if(!this.isValid(U))throw Error("invalid field element: outside of range 0..ORDER")}return U}invertBatch($){return XQ(this,$)}cmov($,q,J){return gq(J,"condition"),J?q:$}}Object.freeze(YU.prototype);function mY($,q={}){return new YU($,q)}function JM($){if(typeof $!=="bigint")throw Error("field order must be bigint");if($<=I$)throw Error("field order must be greater than 1");let q=m8($-I$);return Math.ceil(q/8)}function XU($){let q=JM($);return q+Math.ceil(q/2)}function GM($,q,J=!1){Z$($);let G=$.length,Q=JM(q),Y=Math.max(XU(q),16);if(G<Y||G>1024)throw Error("expected "+Y+"-1024 bytes of input, got "+G);let X=J?r0($):hJ($),U=B$(X,q-I$)+I$;return J?QQ(U,Q):bY(U,Q)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var y8=BigInt(0),pJ=BigInt(1);function UQ($,q){let J=q.negate();return $?J:q}function lJ($,q){let J=XQ($.Fp,q.map((G)=>G.Z));return q.map((G,Q)=>$.fromAffine(G.toAffine(J[Q])))}function UM($,q){if(!Number.isSafeInteger($)||$<=0||$>q)throw Error("invalid window size, expected [1.."+q+"], got W="+$)}function UU($,q){UM($,q);let J=Math.ceil(q/$)+1,G=2**($-1),Q=2**$,Y=YQ($),X=BigInt($);return{windows:J,windowSize:G,mask:Y,maxNumber:Q,shiftBy:X}}function QM($,q,J){let{windowSize:G,mask:Q,maxNumber:Y,shiftBy:X}=J,U=Number($&Q),W=$>>X;if(U>G)U-=Y,W+=pJ;let V=q*G,M=V+Math.abs(U)-1,z=U===0,D=U<0,R=q%2!==0;return{nextN:W,offset:M,isZero:z,isNeg:D,isNegF:R,offsetF:V}}var WU=new WeakMap,WM=new WeakMap;function VU($){return WM.get($)||1}function YM($){if($!==y8)throw Error("invalid wNAF")}class WQ{BASE;ZERO;Fn;bits;constructor($,q){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=q}_unsafeLadder($,q,J=this.ZERO){let G=$;while(q>y8){if(q&pJ)J=J.add(G);G=G.double(),q>>=pJ}return J}precomputeWindow($,q){let{windows:J,windowSize:G}=UU(q,this.bits),Q=[],Y=$,X=Y;for(let U=0;U<J;U++){X=Y,Q.push(X);for(let W=1;W<G;W++)X=X.add(Y),Q.push(X);Y=X.double()}return Q}wNAF($,q,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,Q=this.BASE,Y=UU($,this.bits);for(let X=0;X<Y.windows;X++){let{nextN:U,offset:W,isZero:V,isNeg:M,isNegF:z,offsetF:D}=QM(J,X,Y);if(J=U,V)Q=Q.add(UQ(z,q[D]));else G=G.add(UQ(M,q[W]))}return YM(J),{p:G,f:Q}}wNAFUnsafe($,q,J,G=this.ZERO){let Q=UU($,this.bits);for(let Y=0;Y<Q.windows;Y++){if(J===y8)break;let{nextN:X,offset:U,isZero:W,isNeg:V}=QM(J,Y,Q);if(J=X,W)continue;else{let M=q[U];G=G.add(V?M.negate():M)}}return YM(J),G}getPrecomputes($,q,J){let G=WU.get(q);if(!G){if(G=this.precomputeWindow(q,$),$!==1){if(typeof J==="function")G=J(G);WU.set(q,G)}}return G}cached($,q,J){let G=VU($);return this.wNAF(G,this.getPrecomputes(G,$,J),q)}unsafe($,q,J,G){let Q=VU($);if(Q===1)return this._unsafeLadder($,q,G);return this.wNAFUnsafe(Q,this.getPrecomputes(Q,$,J),q,G)}createCache($,q){UM(q,this.bits),WM.set($,q),WU.delete($)}hasCache($){return VU($)!==1}}function VM($,q,J,G){let Q=q,Y=$.ZERO,X=$.ZERO;while(J>y8||G>y8){if(J&pJ)Y=Y.add(Q);if(G&pJ)X=X.add(Q);Q=Q.double(),J>>=pJ,G>>=pJ}return{p1:Y,p2:X}}function XM($,q,J){if(q){if(q.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return QU(q),q}else return mY($,{isLE:J})}function yY($,q,J={},G){if(G===void 0)G=$==="edwards";if(!q||typeof q!=="object")throw Error(`expected valid ${$} CURVE object`);for(let W of["p","n","h"]){let V=q[W];if(!(typeof V==="bigint"&&V>y8))throw Error(`CURVE.${W} must be positive bigint`)}let Q=XM(q.p,J.Fp,G),Y=XM(q.n,J.Fn,G),U=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let W of U)if(!Q.isValid(q[W]))throw Error(`CURVE.${W} must be valid field element of CURVE.Fp`);return q=Object.freeze(Object.assign({},q)),{CURVE:q,Fp:Q,Fn:Y}}function VQ($,q){return function(G){let Q=$(G);return{secretKey:Q,publicKey:q(Q)}}}function MQ($,q){if(Uq($),Uq(q),q<0||q>4)throw Error("invalid I2OSP length: "+q);if($<0||$>2**(8*q)-1)throw Error("invalid I2OSP input: "+$);let J=Array.from({length:q}).fill(0);for(let G=q-1;G>=0;G--)J[G]=$&255,$>>>=8;return new Uint8Array(J)}function SN($,q){let J=new Uint8Array($.length);for(let G=0;G<$.length;G++)J[G]=$[G]^q[G];return J}function IN($){if(!b8($)&&typeof $!=="string")throw Error("DST must be Uint8Array or ascii string");let q=typeof $==="string"?kY($):$;if(q.length===0)throw Error("DST must be non-empty");return q}function MU($,q,J,G){if(Z$($),Uq(J),q=IN(q),q.length>255)q=G(c$(kY("H2C-OVERSIZE-DST-"),q));let{outputLen:Q,blockLen:Y}=G,X=Math.ceil(J/Q);if(J>65535||X>255)throw Error("expand_message_xmd: invalid lenInBytes");let U=c$(q,MQ(q.length,1)),W=new Uint8Array(Y),V=MQ(J,2),M=Array(X),z=G(c$(W,$,V,MQ(0,1),U));M[0]=G(c$(z,MQ(1,1),U));for(let R=1;R<X;R++){let N=[SN(z,M[R-1]),MQ(R+1,1),U];M[R]=G(c$(...N))}return c$(...M).slice(0,J)}var MM="HashToScalar-";/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var zM=($,q)=>($+($>=0?q:-q)/DM)/q;function CN($,q,J){_q("scalar",$,Wq,J);let[[G,Q],[Y,X]]=q,U=zM(X*$,J),W=zM(-Q*$,J),V=$-U*G-W*Y,M=-U*Q-W*X,z=V<Wq,D=M<Wq;if(z)V=-V;if(D)M=-M;let R=YQ(Math.ceil(m8(J)/2))+QJ;if(V<Wq||V>=R||M<Wq||M>=R)throw Error("splitScalar (endomorphism): failed for k");return{k1neg:z,k1:V,k2neg:D,k2:M}}function RU($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function zU($,q){y0($);let J={};for(let G of Object.keys(q))J[G]=$[G]===void 0?q[G]:$[G];if(gq(J.lowS,"lowS"),gq(J.prehash,"prehash"),J.format!==void 0)RU(J.format);return J}class RM extends Error{constructor($=""){super($)}}var i0={Err:RM,_tlv:{encode:($,q)=>{let{Err:J}=i0;if(Uq($,"tag"),$<0||$>255)throw new J("tlv.encode: wrong tag");if(typeof q!=="string")throw TypeError('"data" expected string, got type='+typeof q);if(q.length&1)throw new J("tlv.encode: unpadded data");let G=q.length/2,Q=GQ(G);if(Q.length/2&128)throw new J("tlv.encode: long form length too big");let Y=G>127?GQ(Q.length/2|128):"";return GQ($)+Y+Q+q},decode($,q){let{Err:J}=i0;q=Z$(q,void 0,"DER data");let G=0;if($<0||$>255)throw new J("tlv.encode: wrong tag");if(q.length<2||q[G++]!==$)throw new J("tlv.decode: wrong tlv");let Q=q[G++],Y=!!(Q&128),X=0;if(!Y)X=Q;else{let W=Q&127;if(!W)throw new J("tlv.decode(long): indefinite length not supported");if(W>4)throw new J("tlv.decode(long): byte length is too big");let V=q.subarray(G,G+W);if(V.length!==W)throw new J("tlv.decode: length bytes not complete");if(V[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let M of V)X=X<<8|M;if(G+=W,X<128)throw new J("tlv.decode(long): not minimal encoding")}let U=q.subarray(G,G+X);if(U.length!==X)throw new J("tlv.decode: wrong value length");return{v:U,l:q.subarray(G+X)}}},_int:{encode($){let{Err:q}=i0;if(vY($),$<Wq)throw new q("integer: negative integers are not allowed");let J=GQ($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new q("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:q}=i0;if($.length<1)throw new q("invalid signature integer: empty");if($[0]&128)throw new q("invalid signature integer: negative");if($.length>1&&$[0]===0&&!($[1]&128))throw new q("invalid signature integer: unnecessary leading zero");return hJ($)}},toSig($){let{Err:q,_int:J,_tlv:G}=i0,Q=Z$($,void 0,"signature"),{v:Y,l:X}=G.decode(48,Q);if(X.length)throw new q("invalid signature: left bytes after parsing");let{v:U,l:W}=G.decode(2,Y),{v:V,l:M}=G.decode(2,W);if(M.length)throw new q("invalid signature: left bytes after parsing");return{r:J.decode(U),s:J.decode(V)}},hexFromSig($){let{_tlv:q,_int:J}=i0,G=q.encode(2,J.encode($.r)),Q=q.encode(2,J.encode($.s)),Y=G+Q;return q.encode(48,Y)}};Object.freeze(i0._tlv);Object.freeze(i0._int);Object.freeze(i0);var Wq=BigInt(0),QJ=BigInt(1),DM=BigInt(2),fY=BigInt(3),EN=BigInt(4);function KM($,q={}){let J=yY("weierstrass",$,q),G=J.Fp,Q=J.Fn,Y=J.CURVE,{h:X,n:U}=Y;y0(q,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:W,allowInfinityPoint:V}=q;if(W){if(!G.is0(Y.a)||typeof W.beta!=="bigint"||!Array.isArray(W.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let M=OM(G,Q);function z(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function D(v,C,I){if(V&&C.is0())return Uint8Array.of(0);let{x:A,y:T}=C.toAffine(),L=G.toBytes(A);if(gq(I,"isCompressed"),I){z();let g=!G.isOdd(T);return c$(HM(g),L)}else return c$(Uint8Array.of(4),L,G.toBytes(T))}function R(v){Z$(v,void 0,"Point");let{publicKey:C,publicKeyUncompressed:I}=M,A=v.length,T=v[0],L=v.subarray(1);if(V&&A===1&&T===0)return{x:G.ZERO,y:G.ZERO};if(A===C&&(T===2||T===3)){let g=G.fromBytes(L);if(!G.isValid(g))throw Error("bad point: is not on curve, wrong x");let P=j(g),b;try{b=G.sqrt(P)}catch(r){let Z=r instanceof Error?": "+r.message:"";throw Error("bad point: is not on curve, sqrt error"+Z)}z();let O=G.isOdd(b);if((T&1)===1!==O)b=G.neg(b);return{x:g,y:b}}else if(A===I&&T===4){let g=G.BYTES,P=G.fromBytes(L.subarray(0,g)),b=G.fromBytes(L.subarray(g,g*2));if(!B(P,b))throw Error("bad point: is not on curve");return{x:P,y:b}}else throw Error(`bad point: got length ${A}, expected compressed=${C} or uncompressed=${I}`)}let N=q.toBytes===void 0?D:q.toBytes,w=q.fromBytes===void 0?R:q.fromBytes;function j(v){let C=G.sqr(v),I=G.mul(C,v);return G.add(G.add(I,G.mul(v,Y.a)),Y.b)}function B(v,C){let I=G.sqr(C),A=j(v);return G.eql(I,A)}if(!B(Y.Gx,Y.Gy))throw Error("bad curve params: generator point");let S=G.mul(G.pow(Y.a,fY),EN),_=G.mul(G.sqr(Y.b),BigInt(27));if(G.is0(G.add(S,_)))throw Error("bad curve params: a or b");function y(v,C,I=!1){if(!G.isValid(C)||I&&G.is0(C))throw Error(`bad point coordinate ${v}`);return C}function p(v){if(!(v instanceof m))throw Error("Weierstrass Point expected")}function F(v){if(!W||!W.basises)throw Error("no endo");return CN(v,W.basises,Q.ORDER)}function f(v,C,I,A,T){return I=new m(G.mul(I.X,v),I.Y,I.Z),C=UQ(A,C),I=UQ(T,I),C.add(I)}class m{static BASE=new m(Y.Gx,Y.Gy,G.ONE);static ZERO=new m(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=Q;X;Y;Z;constructor(v,C,I){this.X=y("x",v),this.Y=y("y",C,!0),this.Z=y("z",I),Object.freeze(this)}static CURVE(){return Y}static fromAffine(v){let{x:C,y:I}=v||{};if(!v||!G.isValid(C)||!G.isValid(I))throw Error("invalid affine point");if(v instanceof m)throw Error("projective point not allowed");if(G.is0(C)&&G.is0(I))return m.ZERO;return new m(C,I,G.ONE)}static fromBytes(v){let C=m.fromAffine(w(Z$(v,void 0,"point")));return C.assertValidity(),C}static fromHex(v){return m.fromBytes(v8(v))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(v=8,C=!0){if(l.createCache(this,v),!C)this.multiply(fY);return this}assertValidity(){let v=this;if(v.is0()){if(q.allowInfinityPoint&&G.is0(v.X)&&G.eql(v.Y,G.ONE)&&G.is0(v.Z))return;throw Error("bad point: ZERO")}let{x:C,y:I}=v.toAffine();if(!G.isValid(C)||!G.isValid(I))throw Error("bad point: x or y not field elements");if(!B(C,I))throw Error("bad point: equation left != right");if(!v.isTorsionFree())throw Error("bad point: not in prime-order subgroup")}hasEvenY(){let{y:v}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(v)}equals(v){p(v);let{X:C,Y:I,Z:A}=this,{X:T,Y:L,Z:g}=v,P=G.eql(G.mul(C,g),G.mul(T,A)),b=G.eql(G.mul(I,g),G.mul(L,A));return P&&b}negate(){return new m(this.X,G.neg(this.Y),this.Z)}double(){let{a:v,b:C}=Y,I=G.mul(C,fY),{X:A,Y:T,Z:L}=this,g=G.ZERO,P=G.ZERO,b=G.ZERO,O=G.mul(A,A),x=G.mul(T,T),r=G.mul(L,L),Z=G.mul(A,T);return Z=G.add(Z,Z),b=G.mul(A,L),b=G.add(b,b),g=G.mul(v,b),P=G.mul(I,r),P=G.add(g,P),g=G.sub(x,P),P=G.add(x,P),P=G.mul(g,P),g=G.mul(Z,g),b=G.mul(I,b),r=G.mul(v,r),Z=G.sub(O,r),Z=G.mul(v,Z),Z=G.add(Z,b),b=G.add(O,O),O=G.add(b,O),O=G.add(O,r),O=G.mul(O,Z),P=G.add(P,O),r=G.mul(T,L),r=G.add(r,r),O=G.mul(r,Z),g=G.sub(g,O),b=G.mul(r,x),b=G.add(b,b),b=G.add(b,b),new m(g,P,b)}add(v){p(v);let{X:C,Y:I,Z:A}=this,{X:T,Y:L,Z:g}=v,P=G.ZERO,b=G.ZERO,O=G.ZERO,x=Y.a,r=G.mul(Y.b,fY),Z=G.mul(C,T),o=G.mul(I,L),q$=G.mul(A,g),Y$=G.add(C,I),G$=G.add(T,L);Y$=G.mul(Y$,G$),G$=G.add(Z,o),Y$=G.sub(Y$,G$),G$=G.add(C,A);let t=G.add(T,g);return G$=G.mul(G$,t),t=G.add(Z,q$),G$=G.sub(G$,t),t=G.add(I,A),P=G.add(L,g),t=G.mul(t,P),P=G.add(o,q$),t=G.sub(t,P),O=G.mul(x,G$),P=G.mul(r,q$),O=G.add(P,O),P=G.sub(o,O),O=G.add(o,O),b=G.mul(P,O),o=G.add(Z,Z),o=G.add(o,Z),q$=G.mul(x,q$),G$=G.mul(r,G$),o=G.add(o,q$),q$=G.sub(Z,q$),q$=G.mul(x,q$),G$=G.add(G$,q$),Z=G.mul(o,G$),b=G.add(b,Z),Z=G.mul(t,G$),P=G.mul(Y$,P),P=G.sub(P,Z),Z=G.mul(Y$,o),O=G.mul(t,O),O=G.add(O,Z),new m(P,b,O)}subtract(v){return p(v),this.add(v.negate())}is0(){return this.equals(m.ZERO)}multiply(v){let{endo:C}=q;if(!Q.isValidNot0(v))throw RangeError("invalid scalar: out of range");let I,A,T=(L)=>l.cached(this,L,(g)=>lJ(m,g));if(C){let{k1neg:L,k1:g,k2neg:P,k2:b}=F(v),{p:O,f:x}=T(g),{p:r,f:Z}=T(b);A=x.add(Z),I=f(C.beta,O,r,L,P)}else{let{p:L,f:g}=T(v);I=L,A=g}return lJ(m,[I,A])[0]}multiplyUnsafe(v){let{endo:C}=q,I=this,A=v;if(!Q.isValid(A))throw RangeError("invalid scalar: out of range");if(A===Wq||I.is0())return m.ZERO;if(A===QJ)return I;if(l.hasCache(this))return this.multiply(A);if(C){let{k1neg:T,k1:L,k2neg:g,k2:P}=F(A),{p1:b,p2:O}=VM(m,I,L,P);return f(C.beta,b,O,T,g)}else return l.unsafe(I,A)}toAffine(v){let C=this,I=v,{X:A,Y:T,Z:L}=C;if(G.eql(L,G.ONE))return{x:A,y:T};let g=C.is0();if(I==null)I=g?G.ONE:G.inv(L);let P=G.mul(A,I),b=G.mul(T,I),O=G.mul(L,I);if(g)return{x:G.ZERO,y:G.ZERO};if(!G.eql(O,G.ONE))throw Error("invZ was invalid");return{x:P,y:b}}isTorsionFree(){let{isTorsionFree:v}=q;if(X===QJ)return!0;if(v)return v(m,this);return l.unsafe(this,U).is0()}clearCofactor(){let{clearCofactor:v}=q;if(X===QJ)return this;if(v)return v(m,this);return this.multiplyUnsafe(X)}isSmallOrder(){if(X===QJ)return this.is0();return this.clearCofactor().is0()}toBytes(v=!0){return gq(v,"isCompressed"),this.assertValidity(),N(m,this,v)}toHex(v=!0){return _8(this.toBytes(v))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let k=Q.BITS,l=new WQ(m,q.endo?Math.ceil(k/2):k);if(k>=8)m.BASE.precompute(8);return Object.freeze(m.prototype),Object.freeze(m),m}function HM($){return Uint8Array.of($?2:3)}function OM($,q){return{secretKey:q.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*q.BYTES}}function LN($,q={}){let{Fn:J}=$,G=q.randomBytes===void 0?k8:q.randomBytes,Q=Object.assign(OM($.Fp,J),{seed:Math.max(XU(J.ORDER),16)});function Y(R){try{let N=J.fromBytes(R);return J.isValidNot0(N)}catch(N){return!1}}function X(R,N){let{publicKey:w,publicKeyUncompressed:j}=Q;try{let B=R.length;if(N===!0&&B!==w)return!1;if(N===!1&&B!==j)return!1;return!!$.fromBytes(R)}catch(B){return!1}}function U(R){return R=R===void 0?G(Q.seed):R,GM(Z$(R,Q.seed,"seed"),J.ORDER)}function W(R,N=!0){return $.BASE.multiply(J.fromBytes(R)).toBytes(N)}function V(R){let{secretKey:N,publicKey:w,publicKeyUncompressed:j}=Q,B=J._lengths;if(!b8(R))return;let S=Z$(R,void 0,"key").length,_=S===w||S===j,y=S===N||!!B?.includes(S);if(_&&y)return;return _}function M(R,N,w=!0){if(V(R)===!0)throw Error("first arg must be private key");if(V(N)===!1)throw Error("second arg must be public key");let j=J.fromBytes(R);return $.fromBytes(N).multiply(j).toBytes(w)}let z={isValidSecretKey:Y,isValidPublicKey:X,randomSecretKey:U},D=VQ(U,W);return Object.freeze(z),Object.freeze(Q),Object.freeze({getPublicKey:W,getSharedSecret:M,keygen:D,Point:$,utils:z,lengths:Q})}function NM($,q,J={}){let G=q;Aq(G),y0(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let Q=J.randomBytes===void 0?k8:J.randomBytes,Y=J.hmac===void 0?(T,L)=>qq(G,T,L):J.hmac,{Fp:X,Fn:U}=$,{ORDER:W,BITS:V}=U,{keygen:M,getPublicKey:z,getSharedSecret:D,utils:R,lengths:N}=LN($,J),w={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},j=W*DM+QJ<X.ORDER;function B(T){let L=W>>QJ;return T>L}function S(T,L){if(!U.isValidNot0(L))throw Error(`invalid signature ${T}: out of range 1..Point.Fn.ORDER`);return L}function _(){if(j)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function y(T,L){RU(L);let g=N.signature,P=L==="compact"?g:L==="recovered"?g+1:void 0;return Z$(T,P)}class p{r;s;recovery;constructor(T,L,g){if(this.r=S("r",T),this.s=S("s",L),g!=null){if(_(),![0,1,2,3].includes(g))throw Error("invalid recovery id");this.recovery=g}Object.freeze(this)}static fromBytes(T,L=w.format){y(T,L);let g;if(L==="der"){let{r:x,s:r}=i0.toSig(Z$(T));return new p(x,r)}if(L==="recovered")g=T[0],L="compact",T=T.subarray(1);let P=N.signature/2,b=T.subarray(0,P),O=T.subarray(P,P*2);return new p(U.fromBytes(b),U.fromBytes(O),g)}static fromHex(T,L){return this.fromBytes(v8(T),L)}assertRecovery(){let{recovery:T}=this;if(T==null)throw Error("invalid recovery id: must be present");return T}addRecoveryBit(T){return new p(this.r,this.s,T)}recoverPublicKey(T){let{r:L,s:g}=this,P=this.assertRecovery(),b=P===2||P===3?L+W:L;if(!X.isValid(b))throw Error("invalid recovery id: sig.r+curve.n != R.x");let O=X.toBytes(b),x=$.fromBytes(c$(HM((P&1)===0),O)),r=U.inv(b),Z=f(Z$(T,void 0,"msgHash")),o=U.create(-Z*r),q$=U.create(g*r),Y$=$.BASE.multiplyUnsafe(o).add(x.multiplyUnsafe(q$));if(Y$.is0())throw Error("invalid recovery: point at infinify");return Y$.assertValidity(),Y$}hasHighS(){return B(this.s)}toBytes(T=w.format){if(RU(T),T==="der")return v8(i0.hexFromSig(this));let{r:L,s:g}=this,P=U.toBytes(L),b=U.toBytes(g);if(T==="recovered")return _(),c$(Uint8Array.of(this.assertRecovery()),P,b);return c$(P,b)}toHex(T){return _8(this.toBytes(T))}}Object.freeze(p.prototype),Object.freeze(p);let F=J.bits2int===void 0?function(L){if(L.length>8192)throw Error("input is too large");let g=hJ(L),P=L.length*8-V;return P>0?g>>BigInt(P):g}:J.bits2int,f=J.bits2int_modN===void 0?function(L){return U.create(F(L))}:J.bits2int_modN,m=YQ(V);function k(T){return _q("num < 2^"+V,T,Wq,m),U.toBytes(T)}function l(T,L){return Z$(T,void 0,"message"),L?Z$(G(T),void 0,"prehashed message"):T}function v(T,L,g){let{lowS:P,prehash:b,extraEntropy:O}=zU(g,w);T=l(T,b);let x=f(T),r=U.fromBytes(L);if(!U.isValidNot0(r))throw Error("invalid private key");let Z=[k(r),k(x)];if(O!=null&&O!==!1){let G$=O===!0?Q(N.secretKey):O;Z.push(Z$(G$,void 0,"extraEntropy"))}let o=c$(...Z),q$=x;function Y$(G$){let t=F(G$);if(!U.isValidNot0(t))return;let O$=U.inv(t),A$=$.BASE.multiply(t).toAffine(),S$=U.create(A$.x);if(S$===Wq)return;let y$=U.create(O$*U.create(q$+S$*r));if(y$===Wq)return;let z0=(A$.x===S$?0:2)|Number(A$.y&QJ),$q=y$;if(P&&B(y$))$q=U.neg(y$),z0^=1;return new p(S$,$q,j?void 0:z0)}return{seed:o,k2sig:Y$}}function C(T,L,g={}){let{seed:P,k2sig:b}=v(T,L,g);return iV(G.outputLen,U.BYTES,Y)(P,b).toBytes(g.format)}function I(T,L,g,P={}){let{lowS:b,prehash:O,format:x}=zU(P,w);if(g=Z$(g,void 0,"publicKey"),L=l(L,O),!b8(T)){let r=T instanceof p?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+r)}y(T,x);try{let r=p.fromBytes(T,x),Z=$.fromBytes(g);if(b&&r.hasHighS())return!1;let{r:o,s:q$}=r,Y$=f(L),G$=U.inv(q$),t=U.create(Y$*G$),O$=U.create(o*G$),A$=$.BASE.multiplyUnsafe(t).add(Z.multiplyUnsafe(O$));if(A$.is0())return!1;return U.create(A$.x)===o}catch(r){return!1}}function A(T,L,g={}){let{prehash:P}=zU(g,w);return L=l(L,P),p.fromBytes(T,"recovered").recoverPublicKey(L).toBytes()}return Object.freeze({keygen:M,getPublicKey:z,getSharedSecret:D,utils:R,lengths:N,Point:$,sign:C,verify:I,recoverPublicKey:A,Signature:p,hash:G})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var PN=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))();var FN=KM(PN),f8=NM(FN,L$);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var YJ=BigInt(0),Z0=BigInt(1),DU=BigInt(2),gN=BigInt(8);function _N($,q,J,G){let Q=$.sqr(J),Y=$.sqr(G),X=$.add($.mul(q.a,Q),Y),U=$.add($.ONE,$.mul(q.d,$.mul(Q,Y)));return $.eql(X,U)}function wM($,q={}){let J=q,G=yY("edwards",$,J,J.FpFnLE),{Fp:Q,Fn:Y}=G,X=G.CURVE,{h:U}=X;y0(J,{},{uvRatio:"function"});let W=DU<<BigInt(Y.BYTES*8)-Z0,V=(w)=>Q.create(w),M=J.uvRatio===void 0?(w,j)=>{try{return{isValid:!0,value:Q.sqrt(Q.div(w,j))}}catch(B){return{isValid:!1,value:YJ}}}:J.uvRatio;if(!_N(Q,X,X.Gx,X.Gy))throw Error("bad curve params: generator point");function z(w,j,B=!1){let S=B?Z0:YJ;return _q("coordinate "+w,j,S,W),j}function D(w){if(!(w instanceof R))throw Error("EdwardsPoint expected")}class R{static BASE=new R(X.Gx,X.Gy,Z0,V(X.Gx*X.Gy));static ZERO=new R(YJ,Z0,Z0,YJ);static Fp=Q;static Fn=Y;X;Y;Z;T;constructor(w,j,B,S){this.X=z("x",w),this.Y=z("y",j),this.Z=z("z",B,!0),this.T=z("t",S),Object.freeze(this)}static CURVE(){return X}static fromAffine(w){if(w instanceof R)throw Error("extended point not allowed");let{x:j,y:B}=w||{};return z("x",j),z("y",B),new R(j,B,Z0,V(j*B))}static fromBytes(w,j=!1){let B=Q.BYTES,{a:S,d:_}=X;w=GJ(Z$(w,B,"point")),gq(j,"zip215");let y=GJ(w),p=w[B-1];y[B-1]=p&-129;let F=r0(y),f=j?W:Q.ORDER;_q("point.y",F,YJ,f);let m=V(F*F),k=V(m-Z0),l=V(_*m-S),{isValid:v,value:C}=M(k,l);if(!v)throw Error("bad point: invalid y coordinate");let I=(C&Z0)===Z0,A=(p&128)!==0;if(!j&&C===YJ&&A)throw Error("bad point: x=0 and x_0=1");if(A!==I)C=V(-C);return R.fromAffine({x:C,y:F})}static fromHex(w,j=!1){return R.fromBytes(v8(w),j)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(w=8,j=!0){if(N.createCache(this,w),!j)this.multiply(DU);return this}assertValidity(){let w=this,{a:j,d:B}=X;if(w.is0())throw Error("bad point: ZERO");let{X:S,Y:_,Z:y,T:p}=w,F=V(S*S),f=V(_*_),m=V(y*y),k=V(m*m),l=V(F*j),v=V(m*V(l+f)),C=V(k+V(B*V(F*f)));if(v!==C)throw Error("bad point: equation left != right (1)");let I=V(S*_),A=V(y*p);if(I!==A)throw Error("bad point: equation left != right (2)")}equals(w){D(w);let{X:j,Y:B,Z:S}=this,{X:_,Y:y,Z:p}=w,F=V(j*p),f=V(_*S),m=V(B*p),k=V(y*S);return F===f&&m===k}is0(){return this.equals(R.ZERO)}negate(){return new R(V(-this.X),this.Y,this.Z,V(-this.T))}double(){let{a:w}=X,{X:j,Y:B,Z:S}=this,_=V(j*j),y=V(B*B),p=V(DU*V(S*S)),F=V(w*_),f=j+B,m=V(V(f*f)-_-y),k=F+y,l=k-p,v=F-y,C=V(m*l),I=V(k*v),A=V(m*v),T=V(l*k);return new R(C,I,T,A)}add(w){D(w);let{a:j,d:B}=X,{X:S,Y:_,Z:y,T:p}=this,{X:F,Y:f,Z:m,T:k}=w,l=V(S*F),v=V(_*f),C=V(p*B*k),I=V(y*m),A=V((S+_)*(F+f)-l-v),T=I-C,L=I+C,g=V(v-j*l),P=V(A*T),b=V(L*g),O=V(A*g),x=V(T*L);return new R(P,b,x,O)}subtract(w){return D(w),this.add(w.negate())}multiply(w){if(!Y.isValidNot0(w))throw RangeError("invalid scalar: expected 1 <= sc < curve.n");let{p:j,f:B}=N.cached(this,w,(S)=>lJ(R,S));return lJ(R,[j,B])[0]}multiplyUnsafe(w){if(!Y.isValid(w))throw RangeError("invalid scalar: expected 0 <= sc < curve.n");if(w===YJ)return R.ZERO;if(this.is0()||w===Z0)return this;return N.unsafe(this,w,(j)=>lJ(R,j))}isSmallOrder(){return this.clearCofactor().is0()}isTorsionFree(){return N.unsafe(this,X.n).is0()}toAffine(w){let j=this,B=w,{X:S,Y:_,Z:y}=j,p=j.is0();if(B==null)B=p?gN:Q.inv(y);let F=V(S*B),f=V(_*B),m=Q.mul(y,B);if(p)return{x:YJ,y:Z0};if(m!==Z0)throw Error("invZ was invalid");return{x:F,y:f}}clearCofactor(){if(U===Z0)return this;return this.multiplyUnsafe(U)}toBytes(){let{x:w,y:j}=this.toAffine(),B=Q.toBytes(j);return B[B.length-1]|=w&Z0?128:0,B}toHex(){return _8(this.toBytes())}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let N=new WQ(R,Y.BITS);if(Y.BITS>=8)R.BASE.precompute(8);return Object.freeze(R.prototype),Object.freeze(R),R}class KU{static BASE;static ZERO;static Fp;static Fn;ep;constructor($){this.ep=$}static fromBytes($){JU()}static fromHex($){JU()}get x(){return this.toAffine().x}get y(){return this.toAffine().y}clearCofactor(){return this}assertValidity(){this.ep.assertValidity()}toAffine($){return this.ep.toAffine($)}toHex(){return _8(this.toBytes())}toString(){return this.toHex()}isTorsionFree(){return!0}isSmallOrder(){return!1}add($){return this.assertSame($),this.init(this.ep.add($.ep))}subtract($){return this.assertSame($),this.init(this.ep.subtract($.ep))}multiply($){return this.init(this.ep.multiply($))}multiplyUnsafe($){return this.init(this.ep.multiplyUnsafe($))}double(){return this.init(this.ep.double())}negate(){return this.init(this.ep.negate())}precompute($,q){return this.ep.precompute($,q),this}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var zQ=BigInt(0),x8=BigInt(1),xY=BigInt(2);function vN($){return y0($,{P:"bigint",type:"string",adjustScalarBytes:"function",powPminus2:"function"},{randomBytes:"function"}),Object.freeze({...$})}function jM($){let q=vN($),{P:J,type:G,adjustScalarBytes:Q,powPminus2:Y,randomBytes:X}=q,U=G==="x25519";if(!U&&G!=="x448")throw Error("invalid type");let W=X===void 0?k8:X,V=U?255:448,M=U?32:56,z=U?BigInt(9):BigInt(5),D=U?BigInt(121665):BigInt(39081),R=U?xY**BigInt(254):xY**BigInt(447),N=U?BigInt(8)*xY**BigInt(251)-x8:BigInt(4)*xY**BigInt(445)-x8,w=R+N+x8,j=(A)=>B$(A,J),B=S(z);function S(A){return QQ(j(A),M)}function _(A){let T=GJ(Z$(A,M,"uCoordinate"));if(U)T[31]&=127;return j(r0(T))}function y(A){return r0(Q(GJ(Z$(A,M,"scalar"))))}function p(A,T){let L=l(_(T),y(A));if(L===zQ)throw Error("invalid private or public key received");return S(L)}function F(A){return p(A,B)}let f=F,m=p;function k(A,T,L){let g=j(A*(T-L));return T=j(T-g),L=j(L+g),{x_2:T,x_3:L}}function l(A,T){_q("u",A,zQ,J),_q("scalar",T,R,w);let L=T,g=A,P=x8,b=zQ,O=A,x=x8,r=zQ;for(let o=BigInt(V-1);o>=zQ;o--){let q$=L>>o&x8;r^=q$,{x_2:P,x_3:O}=k(r,P,O),{x_2:b,x_3:x}=k(r,b,x),r=q$;let Y$=P+b,G$=j(Y$*Y$),t=P-b,O$=j(t*t),A$=G$-O$,S$=O+x,y$=O-x,z0=j(y$*Y$),$q=j(S$*t),uq=z0+$q,pq=z0-$q;O=j(uq*uq),x=j(g*j(pq*pq)),P=j(G$*O$),b=j(A$*(G$+j(D*A$)))}({x_2:P,x_3:O}=k(r,P,O)),{x_2:b,x_3:x}=k(r,b,x);let Z=Y(b);return j(P*Z)}let v={secretKey:M,publicKey:M,seed:M},C=(A)=>{return A=A===void 0?W(M):A,Z$(A,v.seed,"seed"),A},I={randomSecretKey:C};return Object.freeze(v),Object.freeze(I),Object.freeze({keygen:VQ(C,f),getSharedSecret:m,getPublicKey:f,scalarMult:p,scalarMultBase:F,utils:I,GuBytes:B.slice(),lengths:v})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var bN=BigInt(0),bq=BigInt(1),AM=BigInt(2),kN=BigInt(3),mN=BigInt(5),yN=BigInt(8),iJ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),wU=(()=>({p:iJ,n:BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),h:yN,a:BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),d:BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),Gx:BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),Gy:BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")}))();function TM($){let q=BigInt(10),J=BigInt(20),G=BigInt(40),Q=BigInt(80),Y=iJ,U=$*$%Y*$%Y,W=f0(U,AM,Y)*U%Y,V=f0(W,bq,Y)*$%Y,M=f0(V,mN,Y)*V%Y,z=f0(M,q,Y)*M%Y,D=f0(z,J,Y)*z%Y,R=f0(D,G,Y)*D%Y,N=f0(R,Q,Y)*R%Y,w=f0(N,Q,Y)*R%Y,j=f0(w,q,Y)*M%Y;return{pow_p_5_8:f0(j,AM,Y)*$%Y,b2:U}}function fN($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var HU=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");function jU($,q){let J=iJ,G=B$(q*q*q,J),Q=B$(G*G*q,J),Y=TM($*Q).pow_p_5_8,X=B$($*G*Y,J),U=B$(q*X*X,J),W=X,V=B$(X*HU,J),M=U===$,z=U===B$(-$,J),D=U===B$(-$*HU,J);if(M)X=W;if(z||D)X=V;if(vq(X,J))X=B$(-X,J);return{isValid:M||z,value:X}}var rJ=wM(wU,{uvRatio:jU}),XJ=(()=>rJ.Fp)(),SM=(()=>rJ.Fn)();var hY=(()=>{let $=iJ;return jM({P:$,type:"x25519",powPminus2:(q)=>{let{pow_p_5_8:J,b2:G}=TM(q);return B$(f0(J,kN,$)*G,$)},adjustScalarBytes:fN})})();var OU=HU,xN=BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"),hN=BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"),uN=BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"),pN=BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"),ZM=($)=>jU(bq,$),lN=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),NU=($)=>XJ.create(r0($)&lN);function BM($){let{d:q}=wU,J=iJ,G=(B)=>XJ.create(B),Q=G(OU*$*$),Y=G((Q+bq)*uN),X=BigInt(-1),U=G((X-q*Q)*G(Q+q)),{isValid:W,value:V}=jU(Y,U),M=G(V*$);if(!vq(M,J))M=G(-M);if(!W)V=M;if(!W)X=Q;let z=G(X*(Q-bq)*pN-U),D=V*V,R=G((V+V)*U),N=G(z*xN),w=G(bq-D),j=G(bq+D);return new rJ(G(R*j),G(w*N),G(N*j),G(R*w))}class H0 extends KU{static BASE=(()=>new H0(rJ.BASE))();static ZERO=(()=>new H0(rJ.ZERO))();static Fp=(()=>XJ)();static Fn=(()=>SM)();constructor($){super($)}static fromAffine($){return new H0(rJ.fromAffine($))}assertSame($){if(!($ instanceof H0))throw Error("RistrettoPoint expected")}init($){return new H0($)}static fromBytes($){u$($,32);let{a:q,d:J}=wU,G=iJ,Q=(_)=>XJ.create(_),Y=NU($);if(!rV(XJ.toBytes(Y),$)||vq(Y,G))throw Error("invalid ristretto255 encoding 1");let X=Q(Y*Y),U=Q(bq+q*X),W=Q(bq-q*X),V=Q(U*U),M=Q(W*W),z=Q(q*J*V-M),{isValid:D,value:R}=ZM(Q(z*M)),N=Q(R*W),w=Q(R*N*z),j=Q((Y+Y)*N);if(vq(j,G))j=Q(-j);let B=Q(U*w),S=Q(j*B);if(!D||vq(S,G)||B===bN)throw Error("invalid ristretto255 encoding 2");return new H0(new rJ(j,B,bq,S))}static fromHex($){return H0.fromBytes(gG($))}toBytes(){let{X:$,Y:q,Z:J,T:G}=this.ep,Q=iJ,Y=(w)=>XJ.create(w),X=Y(Y(J+q)*Y(J-q)),U=Y($*q),W=Y(U*U),{value:V}=ZM(Y(X*W)),M=Y(V*X),z=Y(V*U),D=Y(M*z*G),R;if(vq(G*D,Q)){let w=Y(q*OU),j=Y($*OU);$=w,q=j,R=Y(M*hN)}else R=z;if(vq($*D,Q))q=Y(-q);let N=Y((J-q)*R);if(vq(N,Q))N=Y(-N);return XJ.toBytes(N)}equals($){this.assertSame($);let{X:q,Y:J}=this.ep,{X:G,Y:Q}=$.ep,Y=(W)=>XJ.create(W),X=Y(q*Q)===Y(J*G),U=Y(J*Q)===Y(q*G);return X||U}is0(){return this.equals(H0.ZERO)}}Object.freeze(H0.BASE);Object.freeze(H0.ZERO);Object.freeze(H0.prototype);Object.freeze(H0);var rN=Object.freeze({Point:H0,hashToCurve($,q){let J=q?.DST===void 0?"ristretto255_XMD:SHA-512_R255MAP_RO_":q.DST,G=MU($,J,64,QY);return rN.deriveToCurve(G)},hashToScalar($,q={DST:MM}){let J=MU($,q.DST,64,QY);return SM.create(r0(J))},deriveToCurve($){u$($,64);let q=NU($.subarray(0,32)),J=BM(q),G=NU($.subarray(32,64)),Q=BM(G);return new H0(J.add(Q))}});var IM=!1,iN=!1;async function CM($,q){if(iN)return await q();try{return await $()}catch(J){if(J instanceof ReferenceError||J instanceof DOMException&&J.name==="NotSupportedError")return await q();else throw J}}async function uY($,q){return await CM(async()=>{let J=AU($)?$:await cN($),G=await crypto.subtle.importKey("raw",nN(q),{name:"X25519"},IM,[]);return new Uint8Array(await crypto.subtle.deriveBits({name:"X25519",public:G},J,256))},()=>{if(AU($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return hY.scalarMult($,q)})}async function RQ($){return await CM(async()=>{return uY($,hY.GuBytes)},()=>{if(AU($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return hY.scalarMultBase($)})}var dN=new Uint8Array([48,46,2,1,0,48,5,6,3,43,101,110,4,34,4,32]);async function cN($){if($.length!==32)throw Error("X25519 private key must be 32 bytes");let q=new Uint8Array([...dN,...$]);return crypto.subtle.importKey("pkcs8",q,{name:"X25519"},IM,["deriveBits"])}function AU($){return typeof CryptoKey<"u"&&$ instanceof CryptoKey}function nN($){return $}class ZU{s;transcript=[];buf=new Uint8Array(0);constructor($){this.s=$.getReader()}async readLine(){let $=[];while(!0){let q=this.buf.indexOf(10);if(q>=0)return $.push(this.buf.subarray(0,q)),this.transcript.push(this.buf.subarray(0,q+1)),this.buf=this.buf.subarray(q+1),aN(dJ($));if(this.buf.length>0)$.push(this.buf),this.transcript.push(this.buf);let J=await this.s.read();if(J.done)return this.buf=dJ($),null;this.buf=J.value}}close(){return this.s.releaseLock(),{rest:this.buf,transcript:dJ(this.transcript)}}}function aN($){return $.forEach((q)=>{if(q<32||q>126)throw Error("invalid non-ASCII byte in header")}),new TextDecoder().decode($)}function dJ($){let q=$.reduce((Q,Y)=>Q+Y.length,0),J=new Uint8Array(q),G=0;for(let Q of $)J.set(Q,G),G+=Q.length;return J}function h8($,...q){return $.pipeThrough(new TransformStream({start(J){for(let G of q)J.enqueue(G)}}))}function pY($){return new ReadableStream({start(q){q.enqueue($),q.close()}})}async function BU($){if(!($ instanceof ReadableStream))throw Error("readAll expects a ReadableStream<Uint8Array>");return new Uint8Array(await new Response($).arrayBuffer())}async function EM($){if(!($ instanceof ReadableStream))throw Error("readAllString expects a ReadableStream<Uint8Array>");return await new Response($).text()}async function LM($,q){let J=$.getReader(),G=[],Q=0;while(Q<q){let{done:W,value:V}=await J.read();if(W)throw Error("stream ended before reading "+q.toString()+" bytes");G.push(V),Q+=V.length}J.releaseLock();let Y=dJ(G),X=Y.subarray(0,q),U=h8($,Y.subarray(q));return{data:X,rest:U}}class Vq{args;body;constructor($,q){this.args=$,this.body=q}}async function sN($){let q=await $.readLine();if(q===null)throw Error("invalid stanza");let J=q.split(" ");if(J.length<2||J.shift()!=="->")return{next:q};for(let Y of J)if(Y.length===0)throw Error("invalid stanza");let G=[];for(;;){let Y=await $.readLine();if(Y===null)throw Error("invalid stanza");let X=$0.decode(Y);if(X.length>48)throw Error("invalid stanza");if(G.push(X),X.length<48)break}let Q=dJ(G);return{s:new Vq(J,Q)}}async function PM($){let q=new ZU($),J=await q.readLine();if(J!=="age-encryption.org/v1")throw Error("invalid version "+(J??"line"));let G=[];for(;;){let{s:Q,next:Y}=await sN(q);if(Q!==void 0){G.push(Q);continue}if(!Y.startsWith("--- "))throw Error("invalid header");let X=$0.decode(Y.slice(4)),{rest:U,transcript:W}=q.close(),V=W.slice(0,W.length-1-Y.length+3);return{stanzas:G,headerNoMAC:V,MAC:X,headerSize:W.length,rest:h8($,U)}}}function TU($){let q=[];q.push(`age-encryption.org/v1
+`).map((q)=>q.trim()).join(" ")};lD.O=function($){return this.inspectOpts.colors=this.useColors,w9.inspect($,this.inspectOpts)}});var cD=X$((ty,PW)=>{if(typeof process>"u"||process.type==="renderer"||!1||process.__nwjs)PW.exports=yD();else PW.exports=dD()});var iK=X$((Cu,rK)=>{var P9=Object.prototype.hasOwnProperty,lK=Object.prototype.toString,yK=Object.defineProperty,fK=Object.getOwnPropertyDescriptor,xK=function(q){if(typeof Array.isArray==="function")return Array.isArray(q);return lK.call(q)==="[object Array]"},hK=function(q){if(!q||lK.call(q)!=="[object Object]")return!1;var J=P9.call(q,"constructor"),G=q.constructor&&q.constructor.prototype&&P9.call(q.constructor.prototype,"isPrototypeOf");if(q.constructor&&!J&&!G)return!1;var Q;for(Q in q);return typeof Q>"u"||P9.call(q,Q)},uK=function(q,J){if(yK&&J.name==="__proto__")yK(q,J.name,{enumerable:!0,configurable:!0,value:J.newValue,writable:!0});else q[J.name]=J.newValue},pK=function(q,J){if(J==="__proto__"){if(!P9.call(q,J))return;else if(fK)return fK(q,J).value}return q[J]};rK.exports=function $(){var q,J,G,Q,Y,X,U=arguments[0],W=1,V=arguments.length,M=!1;if(typeof U==="boolean")M=U,U=arguments[1]||{},W=2;if(U==null||typeof U!=="object"&&typeof U!=="function")U={};for(;W<V;++W)if(q=arguments[W],q!=null){for(J in q)if(G=pK(U,J),Q=pK(q,J),U!==Q){if(M&&Q&&(hK(Q)||(Y=xK(Q)))){if(Y)Y=!1,X=G&&xK(G)?G:[];else X=G&&hK(G)?G:{};uK(U,{name:J,newValue:$(M,X,Q)})}else if(typeof Q<"u")uK(U,{name:J,newValue:Q})}}return U}});import{parseArgs as IO}from"util";var CO={help:{type:"boolean",short:"h"},version:{type:"boolean",short:"v"},"dry-run":{type:"boolean"},"push-to":{type:"string"},cohort:{type:"string"},"anchor-id":{type:"string"}};function s9($,q){let J=$[q];return typeof J==="boolean"?J:void 0}function t9($,q){let J=$[q];return typeof J==="string"?J:void 0}function b7($){let{values:q,positionals:J}=IO({args:$,options:CO,allowPositionals:!0});if(q.help)return{command:"help",args:[],flags:{help:!0}};if(q.version)return{command:"version",args:[],flags:{version:!0}};return{command:J[0]??"help",args:J.slice(1),flags:{help:s9(q,"help"),version:s9(q,"version"),dryRun:s9(q,"dry-run"),pushTo:t9(q,"push-to"),cohort:t9(q,"cohort"),anchorId:t9(q,"anchor-id")}}}var sQ={name:"@rizom/ops",description:"Operator CLI for managing private brain fleet registry repos",publishConfig:{access:"public"},version:"0.2.0-alpha.134",type:"module",exports:{".":{types:"./dist/index.d.ts",import:"./dist/index.js"},"./deploy":{bun:"./dist/deploy.js",types:"./dist/deploy.d.ts",import:"./dist/deploy.js"}},main:"./dist/index.js",types:"./dist/index.d.ts",bin:{"brains-ops":"./dist/brains-ops.js"},files:["dist","templates"],scripts:{build:"bun scripts/build.ts",prepublishOnly:"bun scripts/build.ts",typecheck:"tsc --noEmit",lint:"eslint . --ext .ts","lint:fix":"eslint . --ext .ts --fix",test:"bun run build && bun test --timeout 20000","test:smoke":"bun run build && RUN_SMOKE_TESTS=1 bun test --timeout 60000"},dependencies:{"age-encryption":"^0.3.0"},devDependencies:{"@brains/deploy-support":"workspace:*","@brains/eslint-config":"workspace:*","@brains/typescript-config":"workspace:*","@brains/utils":"workspace:*","@types/bun":"latest",typescript:"^5.3.3"},repository:{type:"git",url:"https://github.com/rizom-ai/brains.git",directory:"packages/brains-ops"},license:"Apache-2.0",author:"Yeehaa <yeehaa@rizom.ai> (https://rizom.ai)",homepage:"https://github.com/rizom-ai/brains/tree/main/packages/brains-ops#readme",bugs:"https://github.com/rizom-ai/brains/issues",engines:{bun:">=1.3.3"},keywords:["brains","ops","cli","deploy","fleet","operator"]};import{existsSync as Ww,mkdirSync as Vw,readFileSync as hU,writeFileSync as uU}from"fs";import{dirname as Mw,join as fM}from"path";function e9($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function E$($,q=""){if(typeof $!=="number"){let J=q&&`"${q}" `;throw TypeError(`${J}expected number, got ${typeof $}`)}if(!Number.isSafeInteger($)||$<0){let J=q&&`"${q}" `;throw RangeError(`${J}expected integer >= 0, got ${$}`)}}function u$($,q,J=""){let G=e9($),Q=$?.length,Y=q!==void 0;if(!G||Y&&Q!==q){let X=J&&`"${J}" `,U=Y?` of length ${q}`:"",W=G?`length=${Q}`:`type=${typeof $}`,V=X+"expected Uint8Array"+U+", got "+W;if(!G)throw TypeError(V);throw RangeError(V)}return $}function Aq($){if(typeof $!=="function"||typeof $.create!=="function")throw TypeError("Hash must wrapped by utils.createHasher");if(E$($.outputLen),E$($.blockLen),$.outputLen<1)throw Error('"outputLen" must be >= 1');if($.blockLen<1)throw Error('"blockLen" must be >= 1')}function A8($,q=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(q&&$.finished)throw Error("Hash#digest() has already been called")}function tQ($,q){u$($,void 0,"digestInto() output");let J=q.outputLen;if($.length<J)throw RangeError('"digestInto() output" expected to be of length >='+J)}function eQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function R0(...$){for(let q=0;q<$.length;q++)$[q].fill(0)}function Z8($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function u0($,q){return $<<32-q|$>>>q}function N$($,q){return $<<q|$>>>32-q>>>0}var LO=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function PO($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function FO($){for(let q=0;q<$.length;q++)$[q]=PO($[q]);return $}var $X=LO?($)=>$:FO,m7=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),gO=Array.from({length:256},($,q)=>q.toString(16).padStart(2,"0"));function $Y($){if(u$($),m7)return $.toHex();let q="";for(let J=0;J<$.length;J++)q+=gO[$[J]];return q}var jq={_0:48,_9:57,A:65,F:70,a:97,f:102};function k7($){if($>=jq._0&&$<=jq._9)return $-jq._0;if($>=jq.A&&$<=jq.F)return $-(jq.A-10);if($>=jq.a&&$<=jq.f)return $-(jq.a-10);return}function gG($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);if(m7)try{return Uint8Array.fromHex($)}catch(Q){if(Q instanceof SyntaxError)throw RangeError(Q.message);throw Q}let q=$.length,J=q/2;if(q%2)throw RangeError("hex string expected, got unpadded hex of length "+q);let G=new Uint8Array(J);for(let Q=0,Y=0;Q<J;Q++,Y+=2){let X=k7($.charCodeAt(Y)),U=k7($.charCodeAt(Y+1));if(X===void 0||U===void 0){let W=$[Y]+$[Y+1];throw RangeError('hex string expected, got non-hex character "'+W+'" at index '+Y)}G[Q]=X*16+U}return G}function _O($){if(typeof $!=="string")throw TypeError("string expected");return new Uint8Array(new TextEncoder().encode($))}function qX($,q=""){if(typeof $==="string")return _O($);return u$($,void 0,q)}function JX(...$){let q=0;for(let G=0;G<$.length;G++){let Q=$[G];u$(Q),q+=Q.length}let J=new Uint8Array(q);for(let G=0,Q=0;G<$.length;G++){let Y=$[G];J.set(Y,Q),Q+=Y.length}return J}function qY($,q){if(q!==void 0&&{}.toString.call(q)!=="[object Object]")throw TypeError("options must be object or undefined");return Object.assign($,q)}function GX($,q={}){let J=(Q,Y)=>$(Y).update(Q).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.canXOF=G.canXOF,J.create=(Q)=>$(Q),Object.assign(J,q),Object.freeze(J)}function Zq($=32){E$($,"bytesLength");let q=typeof globalThis==="object"?globalThis.crypto:null;if(typeof q?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");if($>65536)throw RangeError(`"bytesLength" expected <= 65536, got ${$}`);return q.getRandomValues(new Uint8Array($))}var QX=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});class YX{oHash;iHash;blockLen;outputLen;canXOF=!1;finished=!1;destroyed=!1;constructor($,q){if(Aq($),u$(q,void 0,"key"),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 J=this.blockLen,G=new Uint8Array(J);G.set(q.length>J?$.create().update(q).digest():q);for(let Q=0;Q<G.length;Q++)G[Q]^=54;this.iHash.update(G),this.oHash=$.create();for(let Q=0;Q<G.length;Q++)G[Q]^=106;this.oHash.update(G),R0(G)}update($){return A8(this),this.iHash.update($),this}digestInto($){A8(this),tQ($,this),this.finished=!0;let q=$.subarray(0,this.outputLen);this.iHash.digestInto(q),this.oHash.update(q),this.oHash.digestInto(q),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$||=Object.create(Object.getPrototypeOf(this),{});let{oHash:q,iHash:J,finished:G,destroyed:Q,blockLen:Y,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=Q,$.blockLen=Y,$.outputLen=X,$.oHash=q._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var qq=(()=>{let $=(q,J,G)=>new YX(q,J).update(G).digest();return $.create=(q,J)=>new YX(q,J),$})();function _G($,q,J){if(Aq($),J===void 0)J=new Uint8Array($.outputLen);return qq($,J,q)}var XX=Uint8Array.of(0),y7=Uint8Array.of();function UX($,q,J,G=32){Aq($),E$(G,"length"),u$(q,void 0,"prk");let Q=$.outputLen;if(q.length<Q)throw Error('"prk" must be at least HashLen octets');if(G>255*Q)throw Error("Length must be <= 255*HashLen");let Y=Math.ceil(G/Q);if(J===void 0)J=y7;else u$(J,void 0,"info");let X=new Uint8Array(Y*Q),U=qq.create($,q),W=U._cloneInto(),V=new Uint8Array(U.outputLen);for(let M=0;M<Y;M++)XX[0]=M+1,W.update(M===0?y7:V).update(J).update(XX).digestInto(V),X.set(V,Q*M),U._cloneInto(W);return U.destroy(),W.destroy(),R0(V,XX),X.slice(0,G)}var lq=($,q,J,G,Q)=>UX($,_G($,q,J),G,Q);function f7($,q,J){return $&q^~$&J}function x7($,q,J){return $&q^$&J^q&J}class JY{blockLen;outputLen;canXOF=!1;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,q,J,G){this.blockLen=$,this.outputLen=q,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=Z8(this.buffer)}update($){A8(this),u$($);let{view:q,buffer:J,blockLen:G}=this,Q=$.length;for(let Y=0;Y<Q;){let X=Math.min(G-this.pos,Q-Y);if(X===G){let U=Z8($);for(;G<=Q-Y;Y+=G)this.process(U,Y);continue}if(J.set($.subarray(Y,Y+X),this.pos),this.pos+=X,Y+=X,this.pos===G)this.process(q,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){A8(this),tQ($,this),this.finished=!0;let{buffer:q,view:J,blockLen:G,isLE:Q}=this,{pos:Y}=this;if(q[Y++]=128,R0(this.buffer.subarray(Y)),this.padOffset>G-Y)this.process(J,0),Y=0;for(let M=Y;M<G;M++)q[M]=0;J.setBigUint64(G-8,BigInt(this.length*8),Q),this.process(J,0);let X=Z8($),U=this.outputLen;if(U%4)throw Error("_sha2: outputLen must be aligned to 32bit");let W=U/4,V=this.get();if(W>V.length)throw Error("_sha2: outputLen bigger than state");for(let M=0;M<W;M++)X.setUint32(4*M,V[M],Q)}digest(){let{buffer:$,outputLen:q}=this;this.digestInto($);let J=$.slice(0,q);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:q,buffer:J,length:G,finished:Q,destroyed:Y,pos:X}=this;if($.destroyed=Y,$.finished=Q,$.length=G,$.pos=X,G%q)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var Bq=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),Tq=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),p$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),l$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var GY=BigInt(4294967295),h7=BigInt(32);function vO($,q=!1){if(q)return{h:Number($&GY),l:Number($>>h7&GY)};return{h:Number($>>h7&GY)|0,l:Number($&GY)|0}}function u7($,q=!1){let J=$.length,G=new Uint32Array(J),Q=new Uint32Array(J);for(let Y=0;Y<J;Y++){let{h:X,l:U}=vO($[Y],q);[G[Y],Q[Y]]=[X,U]}return[G,Q]}var WX=($,q,J)=>$>>>J,VX=($,q,J)=>$<<32-J|q>>>J,CJ=($,q,J)=>$>>>J|q<<32-J,EJ=($,q,J)=>$<<32-J|q>>>J,vG=($,q,J)=>$<<64-J|q>>>J-32,bG=($,q,J)=>$>>>J-32|q<<64-J;function Jq($,q,J,G){let Q=(q>>>0)+(G>>>0);return{h:$+J+(Q/4294967296|0)|0,l:Q|0}}var p7=($,q,J)=>($>>>0)+(q>>>0)+(J>>>0),l7=($,q,J,G)=>q+J+G+($/4294967296|0)|0,r7=($,q,J,G)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0),i7=($,q,J,G,Q)=>q+J+G+Q+($/4294967296|0)|0,d7=($,q,J,G,Q)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0)+(Q>>>0),c7=($,q,J,G,Q,Y)=>q+J+G+Q+Y+($/4294967296|0)|0;var kO=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]),rq=new Uint32Array(64);class MX extends JY{constructor($){super(64,$,8,!1)}get(){let{A:$,B:q,C:J,D:G,E:Q,F:Y,G:X,H:U}=this;return[$,q,J,G,Q,Y,X,U]}set($,q,J,G,Q,Y,X,U){this.A=$|0,this.B=q|0,this.C=J|0,this.D=G|0,this.E=Q|0,this.F=Y|0,this.G=X|0,this.H=U|0}process($,q){for(let M=0;M<16;M++,q+=4)rq[M]=$.getUint32(q,!1);for(let M=16;M<64;M++){let z=rq[M-15],D=rq[M-2],R=u0(z,7)^u0(z,18)^z>>>3,N=u0(D,17)^u0(D,19)^D>>>10;rq[M]=N+rq[M-7]+R+rq[M-16]|0}let{A:J,B:G,C:Q,D:Y,E:X,F:U,G:W,H:V}=this;for(let M=0;M<64;M++){let z=u0(X,6)^u0(X,11)^u0(X,25),D=V+z+f7(X,U,W)+kO[M]+rq[M]|0,N=(u0(J,2)^u0(J,13)^u0(J,22))+x7(J,G,Q)|0;V=W,W=U,U=X,X=Y+D|0,Y=Q,Q=G,G=J,J=D+N|0}J=J+this.A|0,G=G+this.B|0,Q=Q+this.C|0,Y=Y+this.D|0,X=X+this.E|0,U=U+this.F|0,W=W+this.G|0,V=V+this.H|0,this.set(J,G,Q,Y,X,U,W,V)}roundClean(){R0(rq)}destroy(){this.destroyed=!0,this.set(0,0,0,0,0,0,0,0),R0(this.buffer)}}class n7 extends MX{A=Bq[0]|0;B=Bq[1]|0;C=Bq[2]|0;D=Bq[3]|0;E=Bq[4]|0;F=Bq[5]|0;G=Bq[6]|0;H=Bq[7]|0;constructor(){super(32)}}class mO extends MX{A=Tq[0]|0;B=Tq[1]|0;C=Tq[2]|0;D=Tq[3]|0;E=Tq[4]|0;F=Tq[5]|0;G=Tq[6]|0;H=Tq[7]|0;constructor(){super(28)}}var o7=(()=>u7(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map(($)=>BigInt($))))(),yO=(()=>o7[0])(),fO=(()=>o7[1])(),iq=new Uint32Array(80),dq=new Uint32Array(80);class kG extends JY{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:q,Bh:J,Bl:G,Ch:Q,Cl:Y,Dh:X,Dl:U,Eh:W,El:V,Fh:M,Fl:z,Gh:D,Gl:R,Hh:N,Hl:w}=this;return[$,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w]}set($,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w){this.Ah=$|0,this.Al=q|0,this.Bh=J|0,this.Bl=G|0,this.Ch=Q|0,this.Cl=Y|0,this.Dh=X|0,this.Dl=U|0,this.Eh=W|0,this.El=V|0,this.Fh=M|0,this.Fl=z|0,this.Gh=D|0,this.Gl=R|0,this.Hh=N|0,this.Hl=w|0}process($,q){for(let S=0;S<16;S++,q+=4)iq[S]=$.getUint32(q),dq[S]=$.getUint32(q+=4);for(let S=16;S<80;S++){let _=iq[S-15]|0,y=dq[S-15]|0,p=CJ(_,y,1)^CJ(_,y,8)^WX(_,y,7),F=EJ(_,y,1)^EJ(_,y,8)^VX(_,y,7),f=iq[S-2]|0,m=dq[S-2]|0,k=CJ(f,m,19)^vG(f,m,61)^WX(f,m,6),l=EJ(f,m,19)^bG(f,m,61)^VX(f,m,6),v=r7(F,l,dq[S-7],dq[S-16]),C=i7(v,p,k,iq[S-7],iq[S-16]);iq[S]=C|0,dq[S]=v|0}let{Ah:J,Al:G,Bh:Q,Bl:Y,Ch:X,Cl:U,Dh:W,Dl:V,Eh:M,El:z,Fh:D,Fl:R,Gh:N,Gl:w,Hh:j,Hl:B}=this;for(let S=0;S<80;S++){let _=CJ(M,z,14)^CJ(M,z,18)^vG(M,z,41),y=EJ(M,z,14)^EJ(M,z,18)^bG(M,z,41),p=M&D^~M&N,F=z&R^~z&w,f=d7(B,y,F,fO[S],dq[S]),m=c7(f,j,_,p,yO[S],iq[S]),k=f|0,l=CJ(J,G,28)^vG(J,G,34)^vG(J,G,39),v=EJ(J,G,28)^bG(J,G,34)^bG(J,G,39),C=J&Q^J&X^Q&X,I=G&Y^G&U^Y&U;j=N|0,B=w|0,N=D|0,w=R|0,D=M|0,R=z|0,{h:M,l:z}=Jq(W|0,V|0,m|0,k|0),W=X|0,V=U|0,X=Q|0,U=Y|0,Q=J|0,Y=G|0;let A=p7(k,v,I);J=l7(A,m,l,C),G=A|0}({h:J,l:G}=Jq(this.Ah|0,this.Al|0,J|0,G|0)),{h:Q,l:Y}=Jq(this.Bh|0,this.Bl|0,Q|0,Y|0),{h:X,l:U}=Jq(this.Ch|0,this.Cl|0,X|0,U|0),{h:W,l:V}=Jq(this.Dh|0,this.Dl|0,W|0,V|0),{h:M,l:z}=Jq(this.Eh|0,this.El|0,M|0,z|0),{h:D,l:R}=Jq(this.Fh|0,this.Fl|0,D|0,R|0),{h:N,l:w}=Jq(this.Gh|0,this.Gl|0,N|0,w|0),{h:j,l:B}=Jq(this.Hh|0,this.Hl|0,j|0,B|0),this.set(J,G,Q,Y,X,U,W,V,M,z,D,R,N,w,j,B)}roundClean(){R0(iq,dq)}destroy(){this.destroyed=!0,R0(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class a7 extends kG{Ah=l$[0]|0;Al=l$[1]|0;Bh=l$[2]|0;Bl=l$[3]|0;Ch=l$[4]|0;Cl=l$[5]|0;Dh=l$[6]|0;Dl=l$[7]|0;Eh=l$[8]|0;El=l$[9]|0;Fh=l$[10]|0;Fl=l$[11]|0;Gh=l$[12]|0;Gl=l$[13]|0;Hh=l$[14]|0;Hl=l$[15]|0;constructor(){super(64)}}class xO extends kG{Ah=p$[0]|0;Al=p$[1]|0;Bh=p$[2]|0;Bl=p$[3]|0;Ch=p$[4]|0;Cl=p$[5]|0;Dh=p$[6]|0;Dl=p$[7]|0;Eh=p$[8]|0;El=p$[9]|0;Fh=p$[10]|0;Fl=p$[11]|0;Gh=p$[12]|0;Gl=p$[13]|0;Hh=p$[14]|0;Hl=p$[15]|0;constructor(){super(48)}}var t$=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),e$=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class hO extends kG{Ah=t$[0]|0;Al=t$[1]|0;Bh=t$[2]|0;Bl=t$[3]|0;Ch=t$[4]|0;Cl=t$[5]|0;Dh=t$[6]|0;Dl=t$[7]|0;Eh=t$[8]|0;El=t$[9]|0;Fh=t$[10]|0;Fl=t$[11]|0;Gh=t$[12]|0;Gl=t$[13]|0;Hh=t$[14]|0;Hl=t$[15]|0;constructor(){super(28)}}class uO extends kG{Ah=e$[0]|0;Al=e$[1]|0;Bh=e$[2]|0;Bl=e$[3]|0;Ch=e$[4]|0;Cl=e$[5]|0;Dh=e$[6]|0;Dl=e$[7]|0;Eh=e$[8]|0;El=e$[9]|0;Fh=e$[10]|0;Fl=e$[11]|0;Gh=e$[12]|0;Gl=e$[13]|0;Hh=e$[14]|0;Hl=e$[15]|0;constructor(){super(32)}}var L$=GX(()=>new n7,QX(1));var QY=GX(()=>new a7,QX(3));/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function VY($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function DX($){if(!VY($))throw Error("Uint8Array expected")}function q5($,q){if(!Array.isArray(q))return!1;if(q.length===0)return!0;if($)return q.every((J)=>typeof J==="string");else return q.every((J)=>Number.isSafeInteger(J))}function J5($){if(typeof $!=="function")throw Error("function expected");return!0}function cq($,q){if(typeof q!=="string")throw Error(`${$}: string expected`);return!0}function yG($){if(!Number.isSafeInteger($))throw Error(`invalid integer: ${$}`)}function XY($){if(!Array.isArray($))throw Error("array expected")}function UY($,q){if(!q5(!0,q))throw Error(`${$}: array of strings expected`)}function KX($,q){if(!q5(!1,q))throw Error(`${$}: array of numbers expected`)}function C0(...$){let q=(Y)=>Y,J=(Y,X)=>(U)=>Y(X(U)),G=$.map((Y)=>Y.encode).reduceRight(J,q),Q=$.map((Y)=>Y.decode).reduce(J,q);return{encode:G,decode:Q}}function E0($){let q=typeof $==="string"?$.split(""):$,J=q.length;UY("alphabet",q);let G=new Map(q.map((Q,Y)=>[Q,Y]));return{encode:(Q)=>{return XY(Q),Q.map((Y)=>{if(!Number.isSafeInteger(Y)||Y<0||Y>=J)throw Error(`alphabet.encode: digit index outside alphabet "${Y}". Allowed: ${$}`);return q[Y]})},decode:(Q)=>{return XY(Q),Q.map((Y)=>{cq("alphabet.decode",Y);let X=G.get(Y);if(X===void 0)throw Error(`Unknown letter: "${Y}". Allowed: ${$}`);return X})}}}function L0($=""){return cq("join",$),{encode:(q)=>{return UY("join.decode",q),q.join($)},decode:(q)=>{return cq("join.decode",q),q.split($)}}}function MY($,q="="){return yG($),cq("padding",q),{encode(J){UY("padding.encode",J);while(J.length*$%8)J.push(q);return J},decode(J){UY("padding.decode",J);let G=J.length;if(G*$%8)throw Error("padding: invalid, string should have whole number of bytes");for(;G>0&&J[G-1]===q;G--)if((G-1)*$%8===0)throw Error("padding: invalid, string has too much padding");return J.slice(0,G)}}}function G5($){return J5($),{encode:(q)=>q,decode:(q)=>$(q)}}function s7($,q,J){if(q<2)throw Error(`convertRadix: invalid from=${q}, base cannot be less than 2`);if(J<2)throw Error(`convertRadix: invalid to=${J}, base cannot be less than 2`);if(XY($),!$.length)return[];let G=0,Q=[],Y=Array.from($,(U)=>{if(yG(U),U<0||U>=q)throw Error(`invalid integer: ${U}`);return U}),X=Y.length;while(!0){let U=0,W=!0;for(let V=G;V<X;V++){let M=Y[V],z=q*U,D=z+M;if(!Number.isSafeInteger(D)||z/q!==U||D-M!==z)throw Error("convertRadix: carry overflow");let R=D/J;U=D%J;let N=Math.floor(R);if(Y[V]=N,!Number.isSafeInteger(N)||N*J+U!==D)throw Error("convertRadix: carry overflow");if(!W)continue;else if(!N)G=V;else W=!1}if(Q.push(U),W)break}for(let U=0;U<$.length-1&&$[U]===0;U++)Q.push(0);return Q.reverse()}var Q5=($,q)=>q===0?$:Q5(q,$%q),WY=($,q)=>$+(q-Q5($,q)),YY=(()=>{let $=[];for(let q=0;q<40;q++)$.push(2**q);return $})();function zX($,q,J,G){if(XY($),q<=0||q>32)throw Error(`convertRadix2: wrong from=${q}`);if(J<=0||J>32)throw Error(`convertRadix2: wrong to=${J}`);if(WY(q,J)>32)throw Error(`convertRadix2: carry overflow from=${q} to=${J} carryBits=${WY(q,J)}`);let Q=0,Y=0,X=YY[q],U=YY[J]-1,W=[];for(let V of $){if(yG(V),V>=X)throw Error(`convertRadix2: invalid data word=${V} from=${q}`);if(Q=Q<<q|V,Y+q>32)throw Error(`convertRadix2: carry overflow pos=${Y} from=${q}`);Y+=q;for(;Y>=J;Y-=J)W.push((Q>>Y-J&U)>>>0);let M=YY[Y];if(M===void 0)throw Error("invalid carry");Q&=M-1}if(Q=Q<<J-Y&U,!G&&Y>=q)throw Error("Excess padding");if(!G&&Q>0)throw Error(`Non-zero padding: ${Q}`);if(G&&Y>0)W.push(Q>>>0);return W}function pO($){yG($);let q=256;return{encode:(J)=>{if(!VY(J))throw Error("radix.encode input should be Uint8Array");return s7(Array.from(J),q,$)},decode:(J)=>{return KX("radix.decode",J),Uint8Array.from(s7(J,$,q))}}}function v0($,q=!1){if(yG($),$<=0||$>32)throw Error("radix2: bits should be in (0..32]");if(WY(8,$)>32||WY($,8)>32)throw Error("radix2: carry overflow");return{encode:(J)=>{if(!VY(J))throw Error("radix2.encode input should be Uint8Array");return zX(Array.from(J),8,$,!q)},decode:(J)=>{return KX("radix2.decode",J),Uint8Array.from(zX(J,$,8,q))}}}function t7($){return J5($),function(...q){try{return $.apply(null,q)}catch(J){}}}var kP=C0(v0(4),E0("0123456789ABCDEF"),L0("")),mP=C0(v0(5),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),MY(5),L0("")),yP=C0(v0(5),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),L0("")),fP=C0(v0(5),E0("0123456789ABCDEFGHIJKLMNOPQRSTUV"),MY(5),L0("")),xP=C0(v0(5),E0("0123456789ABCDEFGHIJKLMNOPQRSTUV"),L0("")),hP=C0(v0(5),E0("0123456789ABCDEFGHJKMNPQRSTVWXYZ"),L0(""),G5(($)=>$.toUpperCase().replace(/O/g,"0").replace(/[IL]/g,"1"))),Y5=(()=>typeof Uint8Array.from([]).toBase64==="function"&&typeof Uint8Array.fromBase64==="function")(),X5=($,q)=>{cq("base64",$);let J=q?/^[A-Za-z0-9=_-]+$/:/^[A-Za-z0-9=+/]+$/,G=q?"base64url":"base64";if($.length>0&&!J.test($))throw Error("invalid base64");return Uint8Array.fromBase64($,{alphabet:G,lastChunkHandling:"strict"})},HX=Y5?{encode($){return DX($),$.toBase64()},decode($){return X5($,!1)}}:C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),MY(6),L0("")),$0=C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),L0("")),uP=Y5?{encode($){return DX($),$.toBase64({alphabet:"base64url"})},decode($){return X5($,!0)}}:C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),MY(6),L0("")),pP=C0(v0(6),E0("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),L0("")),OX=($)=>C0(pO(58),E0($),L0("")),lP=OX("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"),rP=OX("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"),iP=OX("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");var RX=C0(E0("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),L0("")),e7=[996825010,642813549,513874426,1027748829,705979059];function mG($){let q=$>>25,J=($&33554431)<<5;for(let G=0;G<e7.length;G++)if((q>>G&1)===1)J^=e7[G];return J}function $5($,q,J=1){let G=$.length,Q=1;for(let Y=0;Y<G;Y++){let X=$.charCodeAt(Y);if(X<33||X>126)throw Error(`Invalid prefix (${$})`);Q=mG(Q)^X>>5}Q=mG(Q);for(let Y=0;Y<G;Y++)Q=mG(Q)^$.charCodeAt(Y)&31;for(let Y of q)Q=mG(Q)^Y;for(let Y=0;Y<6;Y++)Q=mG(Q);return Q^=J,RX.encode(zX([Q%YY[30]],30,5,!1))}function U5($){let q=$==="bech32"?1:734539939,J=v0(5),G=J.decode,Q=J.encode,Y=t7(G);function X(z,D,R=90){if(cq("bech32.encode prefix",z),VY(D))D=Array.from(D);KX("bech32.encode",D);let N=z.length;if(N===0)throw TypeError(`Invalid prefix length ${N}`);let w=N+7+D.length;if(R!==!1&&w>R)throw TypeError(`Length ${w} exceeds limit ${R}`);let j=z.toLowerCase(),B=$5(j,D,q);return`${j}1${RX.encode(D)}${B}`}function U(z,D=90){cq("bech32.decode input",z);let R=z.length;if(R<8||D!==!1&&R>D)throw TypeError(`invalid string length: ${R} (${z}). Expected (8..${D})`);let N=z.toLowerCase();if(z!==N&&z!==z.toUpperCase())throw Error("String must be lowercase or uppercase");let w=N.lastIndexOf("1");if(w===0||w===-1)throw Error('Letter "1" must be present between prefix and data only');let j=N.slice(0,w),B=N.slice(w+1);if(B.length<6)throw Error("Data must be at least 6 characters long");let S=RX.decode(B).slice(0,-6),_=$5(j,S,q);if(!B.endsWith(_))throw Error(`Invalid checksum in ${z}: expected "${_}"`);return{prefix:j,words:S}}let W=t7(U);function V(z){let{prefix:D,words:R}=U(z,!1);return{prefix:D,words:R,bytes:G(R)}}function M(z,D){return X(z,Q(D))}return{encode:X,decode:U,encodeFromBytes:M,decodeToBytes:V,decodeUnsafe:W,fromWords:G,fromWordsUnsafe:Y,toWords:Q}}var P0=U5("bech32"),dP=U5("bech32m");var lO=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),rO={encode($){return DX($),$.toHex()},decode($){return cq("hex",$),Uint8Array.fromHex($)}},cP=lO?rO:C0(v0(4),E0("0123456789abcdef"),L0(""),G5(($)=>{if(typeof $!=="string"||$.length%2!==0)throw TypeError(`hex.decode: expected string, got ${typeof $} with length ${$.length}`);return $.toLowerCase()}));function dO($,q,J,G){Aq($);let Q=qY({dkLen:32,asyncTick:10},G),{c:Y,dkLen:X,asyncTick:U}=Q;if(E$(Y,"c"),E$(X,"dkLen"),E$(U,"asyncTick"),Y<1)throw Error("iterations (c) must be >= 1");if(X<1)throw Error('"dkLen" must be >= 1');if(X>4294967295*$.outputLen)throw Error("derived key too long");let W=qX(q,"password"),V=qX(J,"salt"),M=new Uint8Array(X),z=qq.create($,W),D=z._cloneInto().update(V);return{c:Y,dkLen:X,asyncTick:U,DK:M,PRF:z,PRFSalt:D}}function cO($,q,J,G,Q){if($.destroy(),q.destroy(),G)G.destroy();return R0(Q),J}function NX($,q,J,G){let{c:Q,dkLen:Y,DK:X,PRF:U,PRFSalt:W}=dO($,q,J,G),V,M=new Uint8Array(4),z=Z8(M),D=new Uint8Array(U.outputLen);for(let R=1,N=0;N<Y;R++,N+=U.outputLen){let w=X.subarray(N,N+U.outputLen);z.setInt32(0,R,!1),(V=W._cloneInto(V)).update(M).digestInto(D),w.set(D.subarray(0,w.length));for(let j=1;j<Q;j++){U._cloneInto(V).update(D).digestInto(D);for(let B=0;B<w.length;B++)w[B]^=D[B]}}return cO(U,W,X,V,D)}function W5($,q,J,G,Q,Y){let X=$[q++]^J[G++],U=$[q++]^J[G++],W=$[q++]^J[G++],V=$[q++]^J[G++],M=$[q++]^J[G++],z=$[q++]^J[G++],D=$[q++]^J[G++],R=$[q++]^J[G++],N=$[q++]^J[G++],w=$[q++]^J[G++],j=$[q++]^J[G++],B=$[q++]^J[G++],S=$[q++]^J[G++],_=$[q++]^J[G++],y=$[q++]^J[G++],p=$[q++]^J[G++],F=X,f=U,m=W,k=V,l=M,v=z,C=D,I=R,A=N,T=w,L=j,g=B,P=S,b=_,O=y,x=p;for(let r=0;r<8;r+=2)l^=N$(F+P|0,7),A^=N$(l+F|0,9),P^=N$(A+l|0,13),F^=N$(P+A|0,18),T^=N$(v+f|0,7),b^=N$(T+v|0,9),f^=N$(b+T|0,13),v^=N$(f+b|0,18),O^=N$(L+C|0,7),m^=N$(O+L|0,9),C^=N$(m+O|0,13),L^=N$(C+m|0,18),k^=N$(x+g|0,7),I^=N$(k+x|0,9),g^=N$(I+k|0,13),x^=N$(g+I|0,18),f^=N$(F+k|0,7),m^=N$(f+F|0,9),k^=N$(m+f|0,13),F^=N$(k+m|0,18),C^=N$(v+l|0,7),I^=N$(C+v|0,9),l^=N$(I+C|0,13),v^=N$(l+I|0,18),g^=N$(L+T|0,7),A^=N$(g+L|0,9),T^=N$(A+g|0,13),L^=N$(T+A|0,18),P^=N$(x+O|0,7),b^=N$(P+x|0,9),O^=N$(b+P|0,13),x^=N$(O+b|0,18);Q[Y++]=X+F|0,Q[Y++]=U+f|0,Q[Y++]=W+m|0,Q[Y++]=V+k|0,Q[Y++]=M+l|0,Q[Y++]=z+v|0,Q[Y++]=D+C|0,Q[Y++]=R+I|0,Q[Y++]=N+A|0,Q[Y++]=w+T|0,Q[Y++]=j+L|0,Q[Y++]=B+g|0,Q[Y++]=S+P|0,Q[Y++]=_+b|0,Q[Y++]=y+O|0,Q[Y++]=p+x|0}function wX($,q,J,G,Q){let Y=G+0,X=G+16*Q;for(let U=0;U<16;U++)J[X+U]=$[q+(2*Q-1)*16+U];for(let U=0;U<Q;U++,Y+=16,q+=16){if(W5(J,X,$,q,J,Y),U>0)X+=16;W5(J,Y,$,q+=16,J,X)}}function nO($,q,J){let G=qY({dkLen:32,asyncTick:10,maxmem:1073742848},J),{N:Q,r:Y,p:X,dkLen:U,asyncTick:W,maxmem:V,onProgress:M}=G;if(E$(Q,"N"),E$(Y,"r"),E$(X,"p"),E$(U,"dkLen"),E$(W,"asyncTick"),E$(V,"maxmem"),M!==void 0&&typeof M!=="function")throw Error("progressCb must be a function");let z=128*Y,D=z/4,R=Math.pow(2,32);if(Q<=1||(Q&Q-1)!==0||Q>R)throw Error('"N" expected a power of 2, and 2^1 <= N <= 2^32');if(X<1||X>(R-1)*32/z)throw Error('"p" expected integer 1..((2^32 - 1) * 32) / (128 * r)');if(U<1||U>(R-1)*32)throw Error('"dkLen" expected integer 1..(2^32 - 1) * 32');let N=z*(Q+X+1);if(N>V)throw Error('"maxmem" limit was hit: memUsed(128*r*(N+p+1))='+N+", maxmem="+V);let w=NX(L$,$,q,{c:1,dkLen:z*X}),j=eQ(w),B=eQ(new Uint8Array(z*Q)),S=eQ(new Uint8Array(z)),_=()=>{};if(M){let y=2*Q*X,p=Math.max(Math.floor(y/1e4),1),F=0;_=()=>{if(F++,M&&(!(F%p)||F===y))M(F/y)}}return{N:Q,r:Y,p:X,dkLen:U,blockSize32:D,V:B,B32:j,B:w,tmp:S,blockMixCb:_,asyncTick:W}}function oO($,q,J,G,Q){let Y=NX(L$,$,J,{c:1,dkLen:q});return R0(J,G,Q),Y}function jX($,q,J){let{N:G,r:Q,p:Y,dkLen:X,blockSize32:U,V:W,B32:V,B:M,tmp:z,blockMixCb:D}=nO($,q,J);$X(V);for(let R=0;R<Y;R++){let N=U*R;for(let w=0;w<U;w++)W[w]=V[N+w];for(let w=0,j=0;w<G-1;w++)wX(W,j,W,j+=U,Q),D();wX(W,(G-1)*U,V,N,Q),D();for(let w=0;w<G;w++){let j=(V[N+U-16]&G-1)>>>0;for(let B=0;B<U;B++)z[B]=V[N+B]^W[j*U+B];wX(z,0,V,N,Q),D()}}return $X(V),oO($,X,M,W,z)}/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */function aO($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function zY($){if(typeof $!=="boolean")throw TypeError(`boolean expected, not ${$}`)}function B8($){if(typeof $!=="number")throw TypeError("number expected, got "+typeof $);if(!Number.isSafeInteger($)||$<0)throw RangeError("positive integer expected, got "+$)}function v$($,q,J=""){let G=aO($),Q=$?.length,Y=q!==void 0;if(!G||Y&&Q!==q){let X=J&&`"${J}" `,U=Y?` of length ${q}`:"",W=G?`length=${Q}`:`type=${typeof $}`,V=X+"expected Uint8Array"+U+", got "+W;if(!G)throw TypeError(V);throw RangeError(V)}return $}function AX($,q=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(q&&$.finished)throw Error("Hash#digest() has already been called")}function V5($,q,J=!1){v$($,void 0,"output");let G=q.outputLen;if($.length<G)throw RangeError("digestInto() expects output buffer of length at least "+G);if(J&&!T8($))throw Error("invalid output, must be aligned")}function Gq($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function p0(...$){for(let q=0;q<$.length;q++)$[q].fill(0)}function sO($){return new DataView($.buffer,$.byteOffset,$.byteLength)}var LJ=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)(),tO=($)=>$<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255;var eO=($)=>{for(let q=0;q<$.length;q++)$[q]=tO($[q]);return $},Sq=LJ?($)=>$:eO;function M5($,q){if(q==null||typeof q!=="object")throw Error("options must be defined");return Object.assign($,q)}function z5($,q){if($.length!==q.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^q[G];return J===0}function R5($,q,J){let G=q,Q=J||(()=>[]),Y=(U,W)=>G(W,...Q(U)).update(U).digest(),X=G(new Uint8Array($),...Q(new Uint8Array(0)));return Y.outputLen=X.outputLen,Y.blockLen=X.blockLen,Y.create=(U,...W)=>G(U,...W),Y}var D5=($,q)=>{function J(G,...Q){if(v$(G,void 0,"key"),$.nonceLength!==void 0){let M=Q[0];v$(M,$.varSizeNonce?void 0:$.nonceLength,"nonce")}let Y=$.tagLength;if(Y&&Q[1]!==void 0)v$(Q[1],void 0,"AAD");let X=q(G,...Q),U=(M,z)=>{if(z!==void 0){if(M!==2)throw Error("cipher output not supported");v$(z,void 0,"output")}},W=!1;return{encrypt(M,z){if(W)throw Error("cannot encrypt() twice with same key + nonce");return W=!0,v$(M),U(X.encrypt.length,z),X.encrypt(M,z)},decrypt(M,z){if(v$(M),Y&&M.length<Y)throw Error('"ciphertext" expected length bigger than tagLength='+Y);return U(X.decrypt.length,z),X.decrypt(M,z)}}}return Object.assign(J,$),J};function fG($,q,J=!0){if(q===void 0)return new Uint8Array($);if(v$(q,void 0,"output"),q.length!==$)throw Error('"output" expected Uint8Array of length '+$+", got: "+q.length);if(J&&!T8(q))throw Error("invalid output, must be aligned");return q}function K5($,q,J){B8($),B8(q),zY(J);let G=new Uint8Array(16),Q=sO(G);return Q.setBigUint64(0,BigInt(q),J),Q.setBigUint64(8,BigInt($),J),G}function T8($){return $.byteOffset%4===0}function S8($){return Uint8Array.from(v$($))}var O5=($)=>Uint8Array.from($.split(""),(q)=>q.charCodeAt(0)),$6=(()=>Sq(Gq(O5("expand 16-byte k"))))(),q6=(()=>Sq(Gq(O5("expand 32-byte k"))))();function w$($,q){return $<<q|$>>>32-q}var xG=64,J6=16,ZX=(()=>4294967295)(),H5=Uint32Array.of();function G6($,q,J,G,Q,Y,X,U){let W=Q.length,V=new Uint8Array(xG),M=Gq(V),z=LJ&&T8(Q)&&T8(Y),D=z?Gq(Q):H5,R=z?Gq(Y):H5;if(!LJ){for(let N=0;N<W;X++){if($(q,J,G,M,X,U),Sq(M),X>=ZX)throw Error("arx: counter overflow");let w=Math.min(xG,W-N);for(let j=0,B;j<w;j++)B=N+j,Y[B]=Q[B]^V[j];N+=w}return}for(let N=0;N<W;X++){if($(q,J,G,M,X,U),X>=ZX)throw Error("arx: counter overflow");let w=Math.min(xG,W-N);if(z&&w===xG){let j=N/4;if(N%4!==0)throw Error("arx: invalid block position");for(let B=0,S;B<J6;B++)S=j+B,R[S]=D[S]^M[B];N+=xG;continue}for(let j=0,B;j<w;j++)B=N+j,Y[B]=Q[B]^V[j];N+=w}}function N5($,q){let{allowShortKeys:J,extendNonceFn:G,counterLength:Q,counterRight:Y,rounds:X}=M5({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},q);if(typeof $!=="function")throw Error("core must be a function");return B8(Q),B8(X),zY(Y),zY(J),(U,W,V,M,z=0)=>{v$(U,void 0,"key"),v$(W,void 0,"nonce"),v$(V,void 0,"data");let D=V.length;if(M=fG(D,M,!1),B8(z),z<0||z>=ZX)throw Error("arx: counter overflow");let R=[],N=U.length,w,j;if(N===32)R.push(w=S8(U)),j=q6;else if(N===16&&J)w=new Uint8Array(32),w.set(U),w.set(U,16),j=$6,R.push(w);else throw v$(U,32,"arx key"),Error("invalid key size");if(!LJ||!T8(W))R.push(W=S8(W));let B=Gq(w);if(G){if(W.length!==24)throw Error("arx: extended nonce must be 24 bytes");let y=W.subarray(0,16);if(LJ)G(j,B,Gq(y),B);else{let p=Sq(Uint32Array.from(j));G(p,B,Gq(y),B),p0(p),Sq(B)}W=W.subarray(16)}else if(!LJ)Sq(B);let S=16-Q;if(S!==W.length)throw Error(`arx: nonce must be ${S} or 16 bytes`);if(S!==12){let y=new Uint8Array(12);y.set(W,Y?0:12-W.length),W=y,R.push(W)}let _=Sq(Gq(W));try{return G6($,j,B,_,V,M,z,X),M}finally{p0(...R)}}}function r$($,q){return $[q++]&255|($[q++]&255)<<8}class w5{blockLen=16;outputLen=16;buffer=new Uint8Array(16);r=new Uint16Array(10);h=new Uint16Array(10);pad=new Uint16Array(8);pos=0;finished=!1;destroyed=!1;constructor($){$=S8(v$($,32,"key"));let q=r$($,0),J=r$($,2),G=r$($,4),Q=r$($,6),Y=r$($,8),X=r$($,10),U=r$($,12),W=r$($,14);this.r[0]=q&8191,this.r[1]=(q>>>13|J<<3)&8191,this.r[2]=(J>>>10|G<<6)&7939,this.r[3]=(G>>>7|Q<<9)&8191,this.r[4]=(Q>>>4|Y<<12)&255,this.r[5]=Y>>>1&8190,this.r[6]=(Y>>>14|X<<2)&8191,this.r[7]=(X>>>11|U<<5)&8065,this.r[8]=(U>>>8|W<<8)&8191,this.r[9]=W>>>5&127;for(let V=0;V<8;V++)this.pad[V]=r$($,16+2*V)}process($,q,J=!1){let G=J?0:2048,{h:Q,r:Y}=this,X=Y[0],U=Y[1],W=Y[2],V=Y[3],M=Y[4],z=Y[5],D=Y[6],R=Y[7],N=Y[8],w=Y[9],j=r$($,q+0),B=r$($,q+2),S=r$($,q+4),_=r$($,q+6),y=r$($,q+8),p=r$($,q+10),F=r$($,q+12),f=r$($,q+14),m=Q[0]+(j&8191),k=Q[1]+((j>>>13|B<<3)&8191),l=Q[2]+((B>>>10|S<<6)&8191),v=Q[3]+((S>>>7|_<<9)&8191),C=Q[4]+((_>>>4|y<<12)&8191),I=Q[5]+(y>>>1&8191),A=Q[6]+((y>>>14|p<<2)&8191),T=Q[7]+((p>>>11|F<<5)&8191),L=Q[8]+((F>>>8|f<<8)&8191),g=Q[9]+(f>>>5|G),P=0,b=P+m*X+k*(5*w)+l*(5*N)+v*(5*R)+C*(5*D);P=b>>>13,b&=8191,b+=I*(5*z)+A*(5*M)+T*(5*V)+L*(5*W)+g*(5*U),P+=b>>>13,b&=8191;let O=P+m*U+k*X+l*(5*w)+v*(5*N)+C*(5*R);P=O>>>13,O&=8191,O+=I*(5*D)+A*(5*z)+T*(5*M)+L*(5*V)+g*(5*W),P+=O>>>13,O&=8191;let x=P+m*W+k*U+l*X+v*(5*w)+C*(5*N);P=x>>>13,x&=8191,x+=I*(5*R)+A*(5*D)+T*(5*z)+L*(5*M)+g*(5*V),P+=x>>>13,x&=8191;let r=P+m*V+k*W+l*U+v*X+C*(5*w);P=r>>>13,r&=8191,r+=I*(5*N)+A*(5*R)+T*(5*D)+L*(5*z)+g*(5*M),P+=r>>>13,r&=8191;let Z=P+m*M+k*V+l*W+v*U+C*X;P=Z>>>13,Z&=8191,Z+=I*(5*w)+A*(5*N)+T*(5*R)+L*(5*D)+g*(5*z),P+=Z>>>13,Z&=8191;let o=P+m*z+k*M+l*V+v*W+C*U;P=o>>>13,o&=8191,o+=I*X+A*(5*w)+T*(5*N)+L*(5*R)+g*(5*D),P+=o>>>13,o&=8191;let q$=P+m*D+k*z+l*M+v*V+C*W;P=q$>>>13,q$&=8191,q$+=I*U+A*X+T*(5*w)+L*(5*N)+g*(5*R),P+=q$>>>13,q$&=8191;let Y$=P+m*R+k*D+l*z+v*M+C*V;P=Y$>>>13,Y$&=8191,Y$+=I*W+A*U+T*X+L*(5*w)+g*(5*N),P+=Y$>>>13,Y$&=8191;let G$=P+m*N+k*R+l*D+v*z+C*M;P=G$>>>13,G$&=8191,G$+=I*V+A*W+T*U+L*X+g*(5*w),P+=G$>>>13,G$&=8191;let t=P+m*w+k*N+l*R+v*D+C*z;P=t>>>13,t&=8191,t+=I*M+A*V+T*W+L*U+g*X,P+=t>>>13,t&=8191,P=(P<<2)+P|0,P=P+b|0,b=P&8191,P=P>>>13,O+=P,Q[0]=b,Q[1]=O,Q[2]=x,Q[3]=r,Q[4]=Z,Q[5]=o,Q[6]=q$,Q[7]=Y$,Q[8]=G$,Q[9]=t}finalize(){let{h:$,pad:q}=this,J=new Uint16Array(10),G=$[1]>>>13;$[1]&=8191;for(let X=2;X<10;X++)$[X]+=G,G=$[X]>>>13,$[X]&=8191;$[0]+=G*5,G=$[0]>>>13,$[0]&=8191,$[1]+=G,G=$[1]>>>13,$[1]&=8191,$[2]+=G,J[0]=$[0]+5,G=J[0]>>>13,J[0]&=8191;for(let X=1;X<10;X++)J[X]=$[X]+G,G=J[X]>>>13,J[X]&=8191;J[9]-=8192;let Q=(G^1)-1;for(let X=0;X<10;X++)J[X]&=Q;Q=~Q;for(let X=0;X<10;X++)$[X]=$[X]&Q|J[X];$[0]=($[0]|$[1]<<13)&65535,$[1]=($[1]>>>3|$[2]<<10)&65535,$[2]=($[2]>>>6|$[3]<<7)&65535,$[3]=($[3]>>>9|$[4]<<4)&65535,$[4]=($[4]>>>12|$[5]<<1|$[6]<<14)&65535,$[5]=($[6]>>>2|$[7]<<11)&65535,$[6]=($[7]>>>5|$[8]<<8)&65535,$[7]=($[8]>>>8|$[9]<<5)&65535;let Y=$[0]+q[0];$[0]=Y&65535;for(let X=1;X<8;X++)Y=($[X]+q[X]|0)+(Y>>>16)|0,$[X]=Y&65535;p0(J)}update($){AX(this),v$($),$=S8($);let{buffer:q,blockLen:J}=this,G=$.length;for(let Q=0;Q<G;){let Y=Math.min(J-this.pos,G-Q);if(Y===J){for(;J<=G-Q;Q+=J)this.process($,Q);continue}if(q.set($.subarray(Q,Q+Y),this.pos),this.pos+=Y,Q+=Y,this.pos===J)this.process(q,0,!1),this.pos=0}return this}destroy(){this.destroyed=!0,p0(this.h,this.r,this.buffer,this.pad)}digestInto($){AX(this),V5($,this),this.finished=!0;let{buffer:q,h:J}=this,{pos:G}=this;if(G){q[G++]=1;for(;G<16;G++)q[G]=0;this.process(q,0,!0)}this.finalize();let Q=0;for(let Y=0;Y<8;Y++)$[Q++]=J[Y]>>>0,$[Q++]=J[Y]>>>8}digest(){let{buffer:$,outputLen:q}=this;this.digestInto($);let J=$.slice(0,q);return this.destroy(),J}}var j5=R5(32,($)=>new w5($));function Q6($,q,J,G,Q,Y=20){let X=$[0],U=$[1],W=$[2],V=$[3],M=q[0],z=q[1],D=q[2],R=q[3],N=q[4],w=q[5],j=q[6],B=q[7],S=Q,_=J[0],y=J[1],p=J[2],F=X,f=U,m=W,k=V,l=M,v=z,C=D,I=R,A=N,T=w,L=j,g=B,P=S,b=_,O=y,x=p;for(let Z=0;Z<Y;Z+=2)F=F+l|0,P=w$(P^F,16),A=A+P|0,l=w$(l^A,12),F=F+l|0,P=w$(P^F,8),A=A+P|0,l=w$(l^A,7),f=f+v|0,b=w$(b^f,16),T=T+b|0,v=w$(v^T,12),f=f+v|0,b=w$(b^f,8),T=T+b|0,v=w$(v^T,7),m=m+C|0,O=w$(O^m,16),L=L+O|0,C=w$(C^L,12),m=m+C|0,O=w$(O^m,8),L=L+O|0,C=w$(C^L,7),k=k+I|0,x=w$(x^k,16),g=g+x|0,I=w$(I^g,12),k=k+I|0,x=w$(x^k,8),g=g+x|0,I=w$(I^g,7),F=F+v|0,x=w$(x^F,16),L=L+x|0,v=w$(v^L,12),F=F+v|0,x=w$(x^F,8),L=L+x|0,v=w$(v^L,7),f=f+C|0,P=w$(P^f,16),g=g+P|0,C=w$(C^g,12),f=f+C|0,P=w$(P^f,8),g=g+P|0,C=w$(C^g,7),m=m+I|0,b=w$(b^m,16),A=A+b|0,I=w$(I^A,12),m=m+I|0,b=w$(b^m,8),A=A+b|0,I=w$(I^A,7),k=k+l|0,O=w$(O^k,16),T=T+O|0,l=w$(l^T,12),k=k+l|0,O=w$(O^k,8),T=T+O|0,l=w$(l^T,7);let r=0;G[r++]=X+F|0,G[r++]=U+f|0,G[r++]=W+m|0,G[r++]=V+k|0,G[r++]=M+l|0,G[r++]=z+v|0,G[r++]=D+C|0,G[r++]=R+I|0,G[r++]=N+A|0,G[r++]=w+T|0,G[r++]=j+L|0,G[r++]=B+g|0,G[r++]=S+P|0,G[r++]=_+b|0,G[r++]=y+O|0,G[r++]=p+x|0}var Y6=N5(Q6,{counterRight:!1,counterLength:4,allowShortKeys:!1});var X6=new Uint8Array(16),A5=($,q)=>{$.update(q);let J=q.length%16;if(J)$.update(X6.subarray(J))},U6=new Uint8Array(32);function Z5($,q,J,G,Q){if(Q!==void 0)v$(Q,void 0,"AAD");let Y=$(q,J,U6),X=K5(G.length,Q?Q.length:0,!0),U=j5.create(Y);if(Q)A5(U,Q);A5(U,G),U.update(X);let W=U.digest();return p0(Y,X),W}var W6=($)=>(q,J,G)=>{return{encrypt(Y,X){let U=Y.length;X=fG(U+16,X,!1),X.set(Y);let W=X.subarray(0,-16);$(q,J,W,W,1);let V=Z5($,q,J,W,G);return X.set(V,U),p0(V),X},decrypt(Y,X){X=fG(Y.length-16,X,!1);let U=Y.subarray(0,-16),W=Y.subarray(-16),V=Z5($,q,J,U,G);if(!z5(W,V))throw p0(V),Error("invalid tag");return X.set(Y.subarray(0,-16)),$(q,J,X,X,1),p0(V),X}}},b0=D5({blockSize:64,nonceLength:12,tagLength:16},W6(Y6));/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function I8($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function f$($,q=""){if(!Number.isSafeInteger($)||$<0){let J=q&&`"${q}" `;throw Error(`${J}expected integer >= 0, got ${$}`)}}function Q$($,q,J=""){let G=I8($),Q=$?.length,Y=q!==void 0;if(!G||Y&&Q!==q){let X=J&&`"${J}" `,U=Y?` of length ${q}`:"",W=G?`length=${Q}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+U+", got "+W)}return $}function k0($){if(typeof $!=="function"||typeof $.create!=="function")throw Error("Hash must wrapped by utils.createHasher");f$($.outputLen),f$($.blockLen)}function Cq($,q=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(q&&$.finished)throw Error("Hash#digest() has already been called")}function RY($,q){Q$($,void 0,"digestInto() output");let J=q.outputLen;if($.length<J)throw Error('"digestInto() output" expected to be of length >='+J)}function DY($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function A0(...$){for(let q=0;q<$.length;q++)$[q].fill(0)}function KY($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function l0($,q){return $<<32-q|$>>>q}var V6=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function M6($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function z6($){for(let q=0;q<$.length;q++)$[q]=M6($[q]);return $}var BX=V6?($)=>$:z6,T5=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),R6=Array.from({length:256},($,q)=>q.toString(16).padStart(2,"0"));function PJ($){if(Q$($),T5)return $.toHex();let q="";for(let J=0;J<$.length;J++)q+=R6[$[J]];return q}var Iq={_0:48,_9:57,A:65,F:70,a:97,f:102};function B5($){if($>=Iq._0&&$<=Iq._9)return $-Iq._0;if($>=Iq.A&&$<=Iq.F)return $-(Iq.A-10);if($>=Iq.a&&$<=Iq.f)return $-(Iq.a-10);return}function FJ($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(T5)return Uint8Array.fromHex($);let q=$.length,J=q/2;if(q%2)throw Error("hex string expected, got unpadded hex of length "+q);let G=new Uint8Array(J);for(let Q=0,Y=0;Q<J;Q++,Y+=2){let X=B5($.charCodeAt(Y)),U=B5($.charCodeAt(Y+1));if(X===void 0||U===void 0){let W=$[Y]+$[Y+1];throw Error('hex string expected, got non-hex character "'+W+'" at index '+Y)}G[Q]=X*16+U}return G}function F$(...$){let q=0;for(let G=0;G<$.length;G++){let Q=$[G];Q$(Q),q+=Q.length}let J=new Uint8Array(q);for(let G=0,Q=0;G<$.length;G++){let Y=$[G];J.set(Y,Q),Q+=Y.length}return J}function C8($,q={}){let J=(Q,Y)=>$(Y).update(Q).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.create=(Q)=>$(Q),Object.assign(J,q),Object.freeze(J)}function nq($=32){let q=typeof globalThis==="object"?globalThis.crypto:null;if(typeof q?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");return q.getRandomValues(new Uint8Array($))}var oq=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var SX=BigInt(0),TX=BigInt(1);function hG($,q=""){if(typeof $!=="boolean"){let J=q&&`"${q}" `;throw Error(J+"expected boolean, got type="+typeof $)}return $}function S5($){if(typeof $==="bigint"){if(!HY($))throw Error("positive bigint expected, got "+$)}else f$($);return $}function uG($){let q=S5($).toString(16);return q.length&1?"0"+q:q}function I5($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?SX:BigInt("0x"+$)}function aq($){return I5(PJ($))}function sq($){return I5(PJ(OY(Q$($)).reverse()))}function E8($,q){f$(q),$=S5($);let J=FJ($.toString(16).padStart(q*2,"0"));if(J.length!==q)throw Error("number too large");return J}function pG($,q){return E8($,q).reverse()}function OY($){return Uint8Array.from($)}function tq($){return Uint8Array.from($,(q,J)=>{let G=q.charCodeAt(0);if(q.length!==1||G>127)throw Error(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var HY=($)=>typeof $==="bigint"&&SX<=$;function D6($,q,J){return HY($)&&HY(q)&&HY(J)&&q<=$&&$<J}function lG($,q,J,G){if(!D6(q,J,G))throw Error("expected valid "+$+": "+J+" <= n < "+G+", got "+q)}function IX($){let q;for(q=0;$>SX;$>>=TX,q+=1);return q}var rG=($)=>(TX<<BigInt($))-TX;function C5($,q,J){if(f$($,"hashLen"),f$(q,"qByteLen"),typeof J!=="function")throw Error("hmacFn must be a function");let G=(j)=>new Uint8Array(j),Q=Uint8Array.of(),Y=Uint8Array.of(0),X=Uint8Array.of(1),U=1000,W=G($),V=G($),M=0,z=()=>{W.fill(1),V.fill(0),M=0},D=(...j)=>J(V,F$(W,...j)),R=(j=Q)=>{if(V=D(Y,j),W=D(),j.length===0)return;V=D(X,j),W=D()},N=()=>{if(M++>=U)throw Error("drbg: tried max amount of iterations");let j=0,B=[];while(j<q){W=D();let S=W.slice();B.push(S),j+=W.length}return F$(...B)};return(j,B)=>{z(),R(j);let S=void 0;while(!(S=B(N())))R();return z(),S}}function gJ($,q={},J={}){if(!$||typeof $!=="object")throw Error("expected valid options object");function G(Y,X,U){let W=$[Y];if(U&&W===void 0)return;let V=typeof W;if(V!==X||W===null)throw Error(`param "${Y}" is invalid: expected ${X}, got ${V}`)}let Q=(Y,X)=>Object.entries(Y).forEach(([U,W])=>G(U,W,X));Q(q,!1),Q(J,!0)}function CX($){let q=new WeakMap;return(J,...G)=>{let Q=q.get(J);if(Q!==void 0)return Q;let Y=$(J,...G);return q.set(J,Y),Y}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var K0=BigInt(0),q0=BigInt(1),_J=BigInt(2),P5=BigInt(3),F5=BigInt(4),g5=BigInt(5),K6=BigInt(7),_5=BigInt(8),H6=BigInt(9),v5=BigInt(16);function D0($,q){let J=$%q;return J>=K0?J:q+J}function m0($,q,J){let G=$;while(q-- >K0)G*=G,G%=J;return G}function E5($,q){if($===K0)throw Error("invert: expected non-zero number");if(q<=K0)throw Error("invert: expected positive modulus, got "+q);let J=D0($,q),G=q,Q=K0,Y=q0,X=q0,U=K0;while(J!==K0){let V=G/J,M=G%J,z=Q-X*V,D=Y-U*V;G=J,J=M,Q=X,Y=U,X=z,U=D}if(G!==q0)throw Error("invert: does not exist");return D0(Q,q)}function EX($,q,J){if(!$.eql($.sqr(q),J))throw Error("Cannot find square root")}function b5($,q){let J=($.ORDER+q0)/F5,G=$.pow(q,J);return EX($,G,q),G}function O6($,q){let J=($.ORDER-g5)/_5,G=$.mul(q,_J),Q=$.pow(G,J),Y=$.mul(q,Q),X=$.mul($.mul(Y,_J),Q),U=$.mul(Y,$.sub(X,$.ONE));return EX($,U,q),U}function N6($){let q=NY($),J=k5($),G=J(q,q.neg(q.ONE)),Q=J(q,G),Y=J(q,q.neg(G)),X=($+K6)/v5;return(U,W)=>{let V=U.pow(W,X),M=U.mul(V,G),z=U.mul(V,Q),D=U.mul(V,Y),R=U.eql(U.sqr(M),W),N=U.eql(U.sqr(z),W);V=U.cmov(V,M,R),M=U.cmov(D,z,N);let w=U.eql(U.sqr(M),W),j=U.cmov(V,M,w);return EX(U,j,W),j}}function k5($){if($<P5)throw Error("sqrt is not defined for small field");let q=$-q0,J=0;while(q%_J===K0)q/=_J,J++;let G=_J,Q=NY($);while(L5(Q,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return b5;let Y=Q.pow(G,q),X=(q+q0)/_J;return function(W,V){if(W.is0(V))return V;if(L5(W,V)!==1)throw Error("Cannot find square root");let M=J,z=W.mul(W.ONE,Y),D=W.pow(V,q),R=W.pow(V,X);while(!W.eql(D,W.ONE)){if(W.is0(D))return W.ZERO;let N=1,w=W.sqr(D);while(!W.eql(w,W.ONE))if(N++,w=W.sqr(w),N===M)throw Error("Cannot find square root");let j=q0<<BigInt(M-N-1),B=W.pow(z,j);M=N,z=W.sqr(B),D=W.mul(D,z),R=W.mul(R,B)}return R}}function w6($){if($%F5===P5)return b5;if($%_5===g5)return O6;if($%v5===H6)return N6($);return k5($)}var j6=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function LX($){let q={ORDER:"bigint",BYTES:"number",BITS:"number"},J=j6.reduce((G,Q)=>{return G[Q]="function",G},q);return gJ($,J),$}function A6($,q,J){if(J<K0)throw Error("invalid exponent, negatives unsupported");if(J===K0)return $.ONE;if(J===q0)return q;let G=$.ONE,Q=q;while(J>K0){if(J&q0)G=$.mul(G,Q);Q=$.sqr(Q),J>>=q0}return G}function iG($,q,J=!1){let G=Array(q.length).fill(J?$.ZERO:void 0),Q=q.reduce((X,U,W)=>{if($.is0(U))return X;return G[W]=X,$.mul(X,U)},$.ONE),Y=$.inv(Q);return q.reduceRight((X,U,W)=>{if($.is0(U))return X;return G[W]=$.mul(X,G[W]),$.mul(X,U)},Y),G}function L5($,q){let J=($.ORDER-q0)/_J,G=$.pow(q,J),Q=$.eql(G,$.ONE),Y=$.eql(G,$.ZERO),X=$.eql(G,$.neg($.ONE));if(!Q&&!Y&&!X)throw Error("invalid Legendre symbol result");return Q?1:Y?0:-1}function Z6($,q){if(q!==void 0)f$(q);let J=q!==void 0?q:$.toString(2).length,G=Math.ceil(J/8);return{nBitLength:J,nByteLength:G}}class m5{ORDER;BITS;BYTES;isLE;ZERO=K0;ONE=q0;_lengths;_sqrt;_mod;constructor($,q={}){if($<=K0)throw Error("invalid field: expected ORDER > 0, got "+$);let J=void 0;if(this.isLE=!1,q!=null&&typeof q==="object"){if(typeof q.BITS==="number")J=q.BITS;if(typeof q.sqrt==="function")this.sqrt=q.sqrt;if(typeof q.isLE==="boolean")this.isLE=q.isLE;if(q.allowedLengths)this._lengths=q.allowedLengths?.slice();if(typeof q.modFromBytes==="boolean")this._mod=q.modFromBytes}let{nBitLength:G,nByteLength:Q}=Z6($,J);if(Q>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=Q,this._sqrt=void 0,Object.preventExtensions(this)}create($){return D0($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof $);return K0<=$&&$<this.ORDER}is0($){return $===K0}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&q0)===q0}neg($){return D0(-$,this.ORDER)}eql($,q){return $===q}sqr($){return D0($*$,this.ORDER)}add($,q){return D0($+q,this.ORDER)}sub($,q){return D0($-q,this.ORDER)}mul($,q){return D0($*q,this.ORDER)}pow($,q){return A6(this,$,q)}div($,q){return D0($*E5(q,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,q){return $+q}subN($,q){return $-q}mulN($,q){return $*q}inv($){return E5($,this.ORDER)}sqrt($){if(!this._sqrt)this._sqrt=w6(this.ORDER);return this._sqrt(this,$)}toBytes($){return this.isLE?pG($,this.BYTES):E8($,this.BYTES)}fromBytes($,q=!1){Q$($);let{_lengths:J,BYTES:G,isLE:Q,ORDER:Y,_mod:X}=this;if(J){if(!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let W=new Uint8Array(G);W.set($,Q?0:W.length-$.length),$=W}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let U=Q?sq($):aq($);if(X)U=D0(U,Y);if(!q){if(!this.isValid(U))throw Error("invalid field element: outside of range 0..ORDER")}return U}invertBatch($){return iG(this,$)}cmov($,q,J){return J?q:$}}function NY($,q={}){return new m5($,q)}function y5($){if(typeof $!=="bigint")throw Error("field order must be bigint");let q=$.toString(2).length;return Math.ceil(q/8)}function PX($){let q=y5($);return q+Math.ceil(q/2)}function f5($,q,J=!1){Q$($);let G=$.length,Q=y5(q),Y=PX(q);if(G<16||G<Y||G>1024)throw Error("expected "+Y+"-1024 bytes of input, got "+G);let X=J?sq($):aq($),U=D0(X,q-q0)+q0;return J?pG(U,Q):E8(U,Q)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var L8=BigInt(0),vJ=BigInt(1);function dG($,q){let J=q.negate();return $?J:q}function vX($,q){let J=iG($.Fp,q.map((G)=>G.Z));return q.map((G,Q)=>$.fromAffine(G.toAffine(J[Q])))}function p5($,q){if(!Number.isSafeInteger($)||$<=0||$>q)throw Error("invalid window size, expected [1.."+q+"], got W="+$)}function FX($,q){p5($,q);let J=Math.ceil(q/$)+1,G=2**($-1),Q=2**$,Y=rG($),X=BigInt($);return{windows:J,windowSize:G,mask:Y,maxNumber:Q,shiftBy:X}}function x5($,q,J){let{windowSize:G,mask:Q,maxNumber:Y,shiftBy:X}=J,U=Number($&Q),W=$>>X;if(U>G)U-=Y,W+=vJ;let V=q*G,M=V+Math.abs(U)-1,z=U===0,D=U<0,R=q%2!==0;return{nextN:W,offset:M,isZero:z,isNeg:D,isNegF:R,offsetF:V}}var gX=new WeakMap,l5=new WeakMap;function _X($){return l5.get($)||1}function h5($){if($!==L8)throw Error("invalid wNAF")}class bX{BASE;ZERO;Fn;bits;constructor($,q){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=q}_unsafeLadder($,q,J=this.ZERO){let G=$;while(q>L8){if(q&vJ)J=J.add(G);G=G.double(),q>>=vJ}return J}precomputeWindow($,q){let{windows:J,windowSize:G}=FX(q,this.bits),Q=[],Y=$,X=Y;for(let U=0;U<J;U++){X=Y,Q.push(X);for(let W=1;W<G;W++)X=X.add(Y),Q.push(X);Y=X.double()}return Q}wNAF($,q,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,Q=this.BASE,Y=FX($,this.bits);for(let X=0;X<Y.windows;X++){let{nextN:U,offset:W,isZero:V,isNeg:M,isNegF:z,offsetF:D}=x5(J,X,Y);if(J=U,V)Q=Q.add(dG(z,q[D]));else G=G.add(dG(M,q[W]))}return h5(J),{p:G,f:Q}}wNAFUnsafe($,q,J,G=this.ZERO){let Q=FX($,this.bits);for(let Y=0;Y<Q.windows;Y++){if(J===L8)break;let{nextN:X,offset:U,isZero:W,isNeg:V}=x5(J,Y,Q);if(J=X,W)continue;else{let M=q[U];G=G.add(V?M.negate():M)}}return h5(J),G}getPrecomputes($,q,J){let G=gX.get(q);if(!G){if(G=this.precomputeWindow(q,$),$!==1){if(typeof J==="function")G=J(G);gX.set(q,G)}}return G}cached($,q,J){let G=_X($);return this.wNAF(G,this.getPrecomputes(G,$,J),q)}unsafe($,q,J,G){let Q=_X($);if(Q===1)return this._unsafeLadder($,q,G);return this.wNAFUnsafe(Q,this.getPrecomputes(Q,$,J),q,G)}createCache($,q){p5(q,this.bits),l5.set($,q),gX.delete($)}hasCache($){return _X($)!==1}}function r5($,q,J,G){let Q=q,Y=$.ZERO,X=$.ZERO;while(J>L8||G>L8){if(J&vJ)Y=Y.add(Q);if(G&vJ)X=X.add(Q);Q=Q.double(),J>>=vJ,G>>=vJ}return{p1:Y,p2:X}}function u5($,q,J){if(q){if(q.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return LX(q),q}else return NY($,{isLE:J})}function i5($,q,J={},G){if(G===void 0)G=$==="edwards";if(!q||typeof q!=="object")throw Error(`expected valid ${$} CURVE object`);for(let W of["p","n","h"]){let V=q[W];if(!(typeof V==="bigint"&&V>L8))throw Error(`CURVE.${W} must be positive bigint`)}let Q=u5(q.p,J.Fp,G),Y=u5(q.n,J.Fn,G),U=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let W of U)if(!Q.isValid(q[W]))throw Error(`CURVE.${W} must be valid field element of CURVE.Fp`);return q=Object.freeze(Object.assign({},q)),{CURVE:q,Fp:Q,Fn:Y}}function wY($,q){return function(G){let Q=$(G);return{secretKey:Q,publicKey:q(Q)}}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var cG=BigInt(0),P8=BigInt(1),jY=BigInt(2);function B6($){return gJ($,{adjustScalarBytes:"function",powPminus2:"function"}),Object.freeze({...$})}function d5($){let q=B6($),{P:J,type:G,adjustScalarBytes:Q,powPminus2:Y,randomBytes:X}=q,U=G==="x25519";if(!U&&G!=="x448")throw Error("invalid type");let W=X||nq,V=U?255:448,M=U?32:56,z=U?BigInt(9):BigInt(5),D=U?BigInt(121665):BigInt(39081),R=U?jY**BigInt(254):jY**BigInt(447),N=U?BigInt(8)*jY**BigInt(251)-P8:BigInt(4)*jY**BigInt(445)-P8,w=R+N+P8,j=(A)=>D0(A,J),B=S(z);function S(A){return pG(j(A),M)}function _(A){let T=OY(Q$(A,M,"uCoordinate"));if(U)T[31]&=127;return j(sq(T))}function y(A){return sq(Q(OY(Q$(A,M,"scalar"))))}function p(A,T){let L=l(_(T),y(A));if(L===cG)throw Error("invalid private or public key received");return S(L)}function F(A){return p(A,B)}let f=F,m=p;function k(A,T,L){let g=j(A*(T-L));return T=j(T-g),L=j(L+g),{x_2:T,x_3:L}}function l(A,T){lG("u",A,cG,J),lG("scalar",T,R,w);let L=T,g=A,P=P8,b=cG,O=A,x=P8,r=cG;for(let o=BigInt(V-1);o>=cG;o--){let q$=L>>o&P8;r^=q$,{x_2:P,x_3:O}=k(r,P,O),{x_2:b,x_3:x}=k(r,b,x),r=q$;let Y$=P+b,G$=j(Y$*Y$),t=P-b,O$=j(t*t),A$=G$-O$,S$=O+x,y$=O-x,z0=j(y$*Y$),$q=j(S$*t),uq=z0+$q,pq=z0-$q;O=j(uq*uq),x=j(g*j(pq*pq)),P=j(G$*O$),b=j(A$*(G$+j(D*A$)))}({x_2:P,x_3:O}=k(r,P,O)),{x_2:b,x_3:x}=k(r,b,x);let Z=Y(b);return j(P*Z)}let v={secretKey:M,publicKey:M,seed:M},C=(A=W(M))=>{return Q$(A,v.seed,"seed"),A},I={randomSecretKey:C};return Object.freeze({keygen:wY(C,f),getSharedSecret:m,getPublicKey:f,scalarMult:p,scalarMultBase:F,utils:I,GuBytes:B.slice(),lengths:v})}class kX{oHash;iHash;blockLen;outputLen;finished=!1;destroyed=!1;constructor($,q){if(k0($),Q$(q,void 0,"key"),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 J=this.blockLen,G=new Uint8Array(J);G.set(q.length>J?$.create().update(q).digest():q);for(let Q=0;Q<G.length;Q++)G[Q]^=54;this.iHash.update(G),this.oHash=$.create();for(let Q=0;Q<G.length;Q++)G[Q]^=106;this.oHash.update(G),A0(G)}update($){return Cq(this),this.iHash.update($),this}digestInto($){Cq(this),Q$($,this.outputLen,"output"),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:q,iHash:J,finished:G,destroyed:Q,blockLen:Y,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=Q,$.blockLen=Y,$.outputLen=X,$.oHash=q._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var F8=($,q,J)=>new kX($,q).update(J).digest();F8.create=($,q)=>new kX($,q);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var c5=($,q)=>($+($>=0?q:-q)/o5)/q;function T6($,q,J){let[[G,Q],[Y,X]]=q,U=c5(X*$,J),W=c5(-Q*$,J),V=$-U*G-W*Y,M=-U*Q-W*X,z=V<Eq,D=M<Eq;if(z)V=-V;if(D)M=-M;let R=rG(Math.ceil(IX(J)/2))+g8;if(V<Eq||V>=R||M<Eq||M>=R)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:z,k1:V,k2neg:D,k2:M}}function yX($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function mX($,q){let J={};for(let G of Object.keys(q))J[G]=$[G]===void 0?q[G]:$[G];if(hG(J.lowS,"lowS"),hG(J.prehash,"prehash"),J.format!==void 0)yX(J.format);return J}class n5 extends Error{constructor($=""){super($)}}var eq={Err:n5,_tlv:{encode:($,q)=>{let{Err:J}=eq;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(q.length&1)throw new J("tlv.encode: unpadded data");let G=q.length/2,Q=uG(G);if(Q.length/2&128)throw new J("tlv.encode: long form length too big");let Y=G>127?uG(Q.length/2|128):"";return uG($)+Y+Q+q},decode($,q){let{Err:J}=eq,G=0;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(q.length<2||q[G++]!==$)throw new J("tlv.decode: wrong tlv");let Q=q[G++],Y=!!(Q&128),X=0;if(!Y)X=Q;else{let W=Q&127;if(!W)throw new J("tlv.decode(long): indefinite length not supported");if(W>4)throw new J("tlv.decode(long): byte length is too big");let V=q.subarray(G,G+W);if(V.length!==W)throw new J("tlv.decode: length bytes not complete");if(V[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let M of V)X=X<<8|M;if(G+=W,X<128)throw new J("tlv.decode(long): not minimal encoding")}let U=q.subarray(G,G+X);if(U.length!==X)throw new J("tlv.decode: wrong value length");return{v:U,l:q.subarray(G+X)}}},_int:{encode($){let{Err:q}=eq;if($<Eq)throw new q("integer: negative integers are not allowed");let J=uG($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new q("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:q}=eq;if($[0]&128)throw new q("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new q("invalid signature integer: unnecessary leading zero");return aq($)}},toSig($){let{Err:q,_int:J,_tlv:G}=eq,Q=Q$($,void 0,"signature"),{v:Y,l:X}=G.decode(48,Q);if(X.length)throw new q("invalid signature: left bytes after parsing");let{v:U,l:W}=G.decode(2,Y),{v:V,l:M}=G.decode(2,W);if(M.length)throw new q("invalid signature: left bytes after parsing");return{r:J.decode(U),s:J.decode(V)}},hexFromSig($){let{_tlv:q,_int:J}=eq,G=q.encode(2,J.encode($.r)),Q=q.encode(2,J.encode($.s)),Y=G+Q;return q.encode(48,Y)}},Eq=BigInt(0),g8=BigInt(1),o5=BigInt(2),AY=BigInt(3),S6=BigInt(4);function fX($,q={}){let J=i5("weierstrass",$,q),{Fp:G,Fn:Q}=J,Y=J.CURVE,{h:X,n:U}=Y;gJ(q,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:W}=q;if(W){if(!G.is0(Y.a)||typeof W.beta!=="bigint"||!Array.isArray(W.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let V=s5(G,Q);function M(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function z(C,I,A){let{x:T,y:L}=I.toAffine(),g=G.toBytes(T);if(hG(A,"isCompressed"),A){M();let P=!G.isOdd(L);return F$(a5(P),g)}else return F$(Uint8Array.of(4),g,G.toBytes(L))}function D(C){Q$(C,void 0,"Point");let{publicKey:I,publicKeyUncompressed:A}=V,T=C.length,L=C[0],g=C.subarray(1);if(T===I&&(L===2||L===3)){let P=G.fromBytes(g);if(!G.isValid(P))throw Error("bad point: is not on curve, wrong x");let b=w(P),O;try{O=G.sqrt(b)}catch(Z){let o=Z instanceof Error?": "+Z.message:"";throw Error("bad point: is not on curve, sqrt error"+o)}M();let x=G.isOdd(O);if((L&1)===1!==x)O=G.neg(O);return{x:P,y:O}}else if(T===A&&L===4){let P=G.BYTES,b=G.fromBytes(g.subarray(0,P)),O=G.fromBytes(g.subarray(P,P*2));if(!j(b,O))throw Error("bad point: is not on curve");return{x:b,y:O}}else throw Error(`bad point: got length ${T}, expected compressed=${I} or uncompressed=${A}`)}let R=q.toBytes||z,N=q.fromBytes||D;function w(C){let I=G.sqr(C),A=G.mul(I,C);return G.add(G.add(A,G.mul(C,Y.a)),Y.b)}function j(C,I){let A=G.sqr(I),T=w(C);return G.eql(A,T)}if(!j(Y.Gx,Y.Gy))throw Error("bad curve params: generator point");let B=G.mul(G.pow(Y.a,AY),S6),S=G.mul(G.sqr(Y.b),BigInt(27));if(G.is0(G.add(B,S)))throw Error("bad curve params: a or b");function _(C,I,A=!1){if(!G.isValid(I)||A&&G.is0(I))throw Error(`bad point coordinate ${C}`);return I}function y(C){if(!(C instanceof k))throw Error("Weierstrass Point expected")}function p(C){if(!W||!W.basises)throw Error("no endo");return T6(C,W.basises,Q.ORDER)}let F=CX((C,I)=>{let{X:A,Y:T,Z:L}=C;if(G.eql(L,G.ONE))return{x:A,y:T};let g=C.is0();if(I==null)I=g?G.ONE:G.inv(L);let P=G.mul(A,I),b=G.mul(T,I),O=G.mul(L,I);if(g)return{x:G.ZERO,y:G.ZERO};if(!G.eql(O,G.ONE))throw Error("invZ was invalid");return{x:P,y:b}}),f=CX((C)=>{if(C.is0()){if(q.allowInfinityPoint&&!G.is0(C.Y))return;throw Error("bad point: ZERO")}let{x:I,y:A}=C.toAffine();if(!G.isValid(I)||!G.isValid(A))throw Error("bad point: x or y not field elements");if(!j(I,A))throw Error("bad point: equation left != right");if(!C.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function m(C,I,A,T,L){return A=new k(G.mul(A.X,C),A.Y,A.Z),I=dG(T,I),A=dG(L,A),I.add(A)}class k{static BASE=new k(Y.Gx,Y.Gy,G.ONE);static ZERO=new k(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=Q;X;Y;Z;constructor(C,I,A){this.X=_("x",C),this.Y=_("y",I,!0),this.Z=_("z",A),Object.freeze(this)}static CURVE(){return Y}static fromAffine(C){let{x:I,y:A}=C||{};if(!C||!G.isValid(I)||!G.isValid(A))throw Error("invalid affine point");if(C instanceof k)throw Error("projective point not allowed");if(G.is0(I)&&G.is0(A))return k.ZERO;return new k(I,A,G.ONE)}static fromBytes(C){let I=k.fromAffine(N(Q$(C,void 0,"point")));return I.assertValidity(),I}static fromHex(C){return k.fromBytes(FJ(C))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(C=8,I=!0){if(v.createCache(this,C),!I)this.multiply(AY);return this}assertValidity(){f(this)}hasEvenY(){let{y:C}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(C)}equals(C){y(C);let{X:I,Y:A,Z:T}=this,{X:L,Y:g,Z:P}=C,b=G.eql(G.mul(I,P),G.mul(L,T)),O=G.eql(G.mul(A,P),G.mul(g,T));return b&&O}negate(){return new k(this.X,G.neg(this.Y),this.Z)}double(){let{a:C,b:I}=Y,A=G.mul(I,AY),{X:T,Y:L,Z:g}=this,P=G.ZERO,b=G.ZERO,O=G.ZERO,x=G.mul(T,T),r=G.mul(L,L),Z=G.mul(g,g),o=G.mul(T,L);return o=G.add(o,o),O=G.mul(T,g),O=G.add(O,O),P=G.mul(C,O),b=G.mul(A,Z),b=G.add(P,b),P=G.sub(r,b),b=G.add(r,b),b=G.mul(P,b),P=G.mul(o,P),O=G.mul(A,O),Z=G.mul(C,Z),o=G.sub(x,Z),o=G.mul(C,o),o=G.add(o,O),O=G.add(x,x),x=G.add(O,x),x=G.add(x,Z),x=G.mul(x,o),b=G.add(b,x),Z=G.mul(L,g),Z=G.add(Z,Z),x=G.mul(Z,o),P=G.sub(P,x),O=G.mul(Z,r),O=G.add(O,O),O=G.add(O,O),new k(P,b,O)}add(C){y(C);let{X:I,Y:A,Z:T}=this,{X:L,Y:g,Z:P}=C,b=G.ZERO,O=G.ZERO,x=G.ZERO,r=Y.a,Z=G.mul(Y.b,AY),o=G.mul(I,L),q$=G.mul(A,g),Y$=G.mul(T,P),G$=G.add(I,A),t=G.add(L,g);G$=G.mul(G$,t),t=G.add(o,q$),G$=G.sub(G$,t),t=G.add(I,T);let O$=G.add(L,P);return t=G.mul(t,O$),O$=G.add(o,Y$),t=G.sub(t,O$),O$=G.add(A,T),b=G.add(g,P),O$=G.mul(O$,b),b=G.add(q$,Y$),O$=G.sub(O$,b),x=G.mul(r,t),b=G.mul(Z,Y$),x=G.add(b,x),b=G.sub(q$,x),x=G.add(q$,x),O=G.mul(b,x),q$=G.add(o,o),q$=G.add(q$,o),Y$=G.mul(r,Y$),t=G.mul(Z,t),q$=G.add(q$,Y$),Y$=G.sub(o,Y$),Y$=G.mul(r,Y$),t=G.add(t,Y$),o=G.mul(q$,t),O=G.add(O,o),o=G.mul(O$,t),b=G.mul(G$,b),b=G.sub(b,o),o=G.mul(G$,q$),x=G.mul(O$,x),x=G.add(x,o),new k(b,O,x)}subtract(C){return this.add(C.negate())}is0(){return this.equals(k.ZERO)}multiply(C){let{endo:I}=q;if(!Q.isValidNot0(C))throw Error("invalid scalar: out of range");let A,T,L=(g)=>v.cached(this,g,(P)=>vX(k,P));if(I){let{k1neg:g,k1:P,k2neg:b,k2:O}=p(C),{p:x,f:r}=L(P),{p:Z,f:o}=L(O);T=r.add(o),A=m(I.beta,x,Z,g,b)}else{let{p:g,f:P}=L(C);A=g,T=P}return vX(k,[A,T])[0]}multiplyUnsafe(C){let{endo:I}=q,A=this;if(!Q.isValid(C))throw Error("invalid scalar: out of range");if(C===Eq||A.is0())return k.ZERO;if(C===g8)return A;if(v.hasCache(this))return this.multiply(C);if(I){let{k1neg:T,k1:L,k2neg:g,k2:P}=p(C),{p1:b,p2:O}=r5(k,A,L,P);return m(I.beta,b,O,T,g)}else return v.unsafe(A,C)}toAffine(C){return F(this,C)}isTorsionFree(){let{isTorsionFree:C}=q;if(X===g8)return!0;if(C)return C(k,this);return v.unsafe(this,U).is0()}clearCofactor(){let{clearCofactor:C}=q;if(X===g8)return this;if(C)return C(k,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(C=!0){return hG(C,"isCompressed"),this.assertValidity(),R(k,this,C)}toHex(C=!0){return PJ(this.toBytes(C))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let l=Q.BITS,v=new bX(k,q.endo?Math.ceil(l/2):l);return k.BASE.precompute(8),k}function a5($){return Uint8Array.of($?2:3)}function s5($,q){return{secretKey:q.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*q.BYTES}}function I6($,q={}){let{Fn:J}=$,G=q.randomBytes||nq,Q=Object.assign(s5($.Fp,J),{seed:PX(J.ORDER)});function Y(R){try{let N=J.fromBytes(R);return J.isValidNot0(N)}catch(N){return!1}}function X(R,N){let{publicKey:w,publicKeyUncompressed:j}=Q;try{let B=R.length;if(N===!0&&B!==w)return!1;if(N===!1&&B!==j)return!1;return!!$.fromBytes(R)}catch(B){return!1}}function U(R=G(Q.seed)){return f5(Q$(R,Q.seed,"seed"),J.ORDER)}function W(R,N=!0){return $.BASE.multiply(J.fromBytes(R)).toBytes(N)}function V(R){let{secretKey:N,publicKey:w,publicKeyUncompressed:j}=Q;if(!I8(R))return;if("_lengths"in J&&J._lengths||N===w)return;let B=Q$(R,void 0,"key").length;return B===w||B===j}function M(R,N,w=!0){if(V(R)===!0)throw Error("first arg must be private key");if(V(N)===!1)throw Error("second arg must be public key");let j=J.fromBytes(R);return $.fromBytes(N).multiply(j).toBytes(w)}let z={isValidSecretKey:Y,isValidPublicKey:X,randomSecretKey:U},D=wY(U,W);return Object.freeze({getPublicKey:W,getSharedSecret:M,keygen:D,Point:$,utils:z,lengths:Q})}function xX($,q,J={}){k0(q),gJ(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let G=J.randomBytes||nq,Q=J.hmac||((A,T)=>F8(q,A,T)),{Fp:Y,Fn:X}=$,{ORDER:U,BITS:W}=X,{keygen:V,getPublicKey:M,getSharedSecret:z,utils:D,lengths:R}=I6($,J),N={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},w=U*o5<Y.ORDER;function j(A){let T=U>>g8;return A>T}function B(A,T){if(!X.isValidNot0(T))throw Error(`invalid signature ${A}: out of range 1..Point.Fn.ORDER`);return T}function S(){if(w)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function _(A,T){yX(T);let L=R.signature,g=T==="compact"?L:T==="recovered"?L+1:void 0;return Q$(A,g)}class y{r;s;recovery;constructor(A,T,L){if(this.r=B("r",A),this.s=B("s",T),L!=null){if(S(),![0,1,2,3].includes(L))throw Error("invalid recovery id");this.recovery=L}Object.freeze(this)}static fromBytes(A,T=N.format){_(A,T);let L;if(T==="der"){let{r:O,s:x}=eq.toSig(Q$(A));return new y(O,x)}if(T==="recovered")L=A[0],T="compact",A=A.subarray(1);let g=R.signature/2,P=A.subarray(0,g),b=A.subarray(g,g*2);return new y(X.fromBytes(P),X.fromBytes(b),L)}static fromHex(A,T){return this.fromBytes(FJ(A),T)}assertRecovery(){let{recovery:A}=this;if(A==null)throw Error("invalid recovery id: must be present");return A}addRecoveryBit(A){return new y(this.r,this.s,A)}recoverPublicKey(A){let{r:T,s:L}=this,g=this.assertRecovery(),P=g===2||g===3?T+U:T;if(!Y.isValid(P))throw Error("invalid recovery id: sig.r+curve.n != R.x");let b=Y.toBytes(P),O=$.fromBytes(F$(a5((g&1)===0),b)),x=X.inv(P),r=F(Q$(A,void 0,"msgHash")),Z=X.create(-r*x),o=X.create(L*x),q$=$.BASE.multiplyUnsafe(Z).add(O.multiplyUnsafe(o));if(q$.is0())throw Error("invalid recovery: point at infinify");return q$.assertValidity(),q$}hasHighS(){return j(this.s)}toBytes(A=N.format){if(yX(A),A==="der")return FJ(eq.hexFromSig(this));let{r:T,s:L}=this,g=X.toBytes(T),P=X.toBytes(L);if(A==="recovered")return S(),F$(Uint8Array.of(this.assertRecovery()),g,P);return F$(g,P)}toHex(A){return PJ(this.toBytes(A))}}let p=J.bits2int||function(T){if(T.length>8192)throw Error("input is too large");let L=aq(T),g=T.length*8-W;return g>0?L>>BigInt(g):L},F=J.bits2int_modN||function(T){return X.create(p(T))},f=rG(W);function m(A){return lG("num < 2^"+W,A,Eq,f),X.toBytes(A)}function k(A,T){return Q$(A,void 0,"message"),T?Q$(q(A),void 0,"prehashed message"):A}function l(A,T,L){let{lowS:g,prehash:P,extraEntropy:b}=mX(L,N);A=k(A,P);let O=F(A),x=X.fromBytes(T);if(!X.isValidNot0(x))throw Error("invalid private key");let r=[m(x),m(O)];if(b!=null&&b!==!1){let Y$=b===!0?G(R.secretKey):b;r.push(Q$(Y$,void 0,"extraEntropy"))}let Z=F$(...r),o=O;function q$(Y$){let G$=p(Y$);if(!X.isValidNot0(G$))return;let t=X.inv(G$),O$=$.BASE.multiply(G$).toAffine(),A$=X.create(O$.x);if(A$===Eq)return;let S$=X.create(t*X.create(o+A$*x));if(S$===Eq)return;let y$=(O$.x===A$?0:2)|Number(O$.y&g8),z0=S$;if(g&&j(S$))z0=X.neg(S$),y$^=1;return new y(A$,z0,w?void 0:y$)}return{seed:Z,k2sig:q$}}function v(A,T,L={}){let{seed:g,k2sig:P}=l(A,T,L);return C5(q.outputLen,X.BYTES,Q)(g,P).toBytes(L.format)}function C(A,T,L,g={}){let{lowS:P,prehash:b,format:O}=mX(g,N);if(L=Q$(L,void 0,"publicKey"),T=k(T,b),!I8(A)){let x=A instanceof y?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+x)}_(A,O);try{let x=y.fromBytes(A,O),r=$.fromBytes(L);if(P&&x.hasHighS())return!1;let{r:Z,s:o}=x,q$=F(T),Y$=X.inv(o),G$=X.create(q$*Y$),t=X.create(Z*Y$),O$=$.BASE.multiplyUnsafe(G$).add(r.multiplyUnsafe(t));if(O$.is0())return!1;return X.create(O$.x)===Z}catch(x){return!1}}function I(A,T,L={}){let{prehash:g}=mX(L,N);return T=k(T,g),y.fromBytes(A,"recovered").recoverPublicKey(T).toBytes()}return Object.freeze({keygen:V,getPublicKey:M,getSharedSecret:z,utils:D,lengths:R,Point:$,sign:v,verify:C,recoverPublicKey:I,Signature:y,hash:q})}function t5($,q,J){return $&q^~$&J}function e5($,q,J){return $&q^$&J^q&J}class ZY{blockLen;outputLen;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,q,J,G){this.blockLen=$,this.outputLen=q,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=KY(this.buffer)}update($){Cq(this),Q$($);let{view:q,buffer:J,blockLen:G}=this,Q=$.length;for(let Y=0;Y<Q;){let X=Math.min(G-this.pos,Q-Y);if(X===G){let U=KY($);for(;G<=Q-Y;Y+=G)this.process(U,Y);continue}if(J.set($.subarray(Y,Y+X),this.pos),this.pos+=X,Y+=X,this.pos===G)this.process(q,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){Cq(this),RY($,this),this.finished=!0;let{buffer:q,view:J,blockLen:G,isLE:Q}=this,{pos:Y}=this;if(q[Y++]=128,A0(this.buffer.subarray(Y)),this.padOffset>G-Y)this.process(J,0),Y=0;for(let M=Y;M<G;M++)q[M]=0;J.setBigUint64(G-8,BigInt(this.length*8),Q),this.process(J,0);let X=KY($),U=this.outputLen;if(U%4)throw Error("_sha2: outputLen must be aligned to 32bit");let W=U/4,V=this.get();if(W>V.length)throw Error("_sha2: outputLen bigger than state");for(let M=0;M<W;M++)X.setUint32(4*M,V[M],Q)}digest(){let{buffer:$,outputLen:q}=this;this.digestInto($);let J=$.slice(0,q);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:q,buffer:J,length:G,finished:Q,destroyed:Y,pos:X}=this;if($.destroyed=Y,$.finished=Q,$.length=G,$.pos=X,G%q)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var Lq=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),Pq=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),i$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),d$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var BY=BigInt(4294967295),$V=BigInt(32);function C6($,q=!1){if(q)return{h:Number($&BY),l:Number($>>$V&BY)};return{h:Number($>>$V&BY)|0,l:Number($&BY)|0}}function TY($,q=!1){let J=$.length,G=new Uint32Array(J),Q=new Uint32Array(J);for(let Y=0;Y<J;Y++){let{h:X,l:U}=C6($[Y],q);[G[Y],Q[Y]]=[X,U]}return[G,Q]}var hX=($,q,J)=>$>>>J,uX=($,q,J)=>$<<32-J|q>>>J,bJ=($,q,J)=>$>>>J|q<<32-J,kJ=($,q,J)=>$<<32-J|q>>>J,nG=($,q,J)=>$<<64-J|q>>>J-32,oG=($,q,J)=>$>>>J-32|q<<64-J;var qV=($,q,J)=>$<<J|q>>>32-J,JV=($,q,J)=>q<<J|$>>>32-J,GV=($,q,J)=>q<<J-32|$>>>64-J,QV=($,q,J)=>$<<J-32|q>>>64-J;function Qq($,q,J,G){let Q=(q>>>0)+(G>>>0);return{h:$+J+(Q/4294967296|0)|0,l:Q|0}}var YV=($,q,J)=>($>>>0)+(q>>>0)+(J>>>0),XV=($,q,J,G)=>q+J+G+($/4294967296|0)|0,UV=($,q,J,G)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0),WV=($,q,J,G,Q)=>q+J+G+Q+($/4294967296|0)|0,VV=($,q,J,G,Q)=>($>>>0)+(q>>>0)+(J>>>0)+(G>>>0)+(Q>>>0),MV=($,q,J,G,Q,Y)=>q+J+G+Q+Y+($/4294967296|0)|0;var L6=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),$J=new Uint32Array(64);class pX extends ZY{constructor($){super(64,$,8,!1)}get(){let{A:$,B:q,C:J,D:G,E:Q,F:Y,G:X,H:U}=this;return[$,q,J,G,Q,Y,X,U]}set($,q,J,G,Q,Y,X,U){this.A=$|0,this.B=q|0,this.C=J|0,this.D=G|0,this.E=Q|0,this.F=Y|0,this.G=X|0,this.H=U|0}process($,q){for(let M=0;M<16;M++,q+=4)$J[M]=$.getUint32(q,!1);for(let M=16;M<64;M++){let z=$J[M-15],D=$J[M-2],R=l0(z,7)^l0(z,18)^z>>>3,N=l0(D,17)^l0(D,19)^D>>>10;$J[M]=N+$J[M-7]+R+$J[M-16]|0}let{A:J,B:G,C:Q,D:Y,E:X,F:U,G:W,H:V}=this;for(let M=0;M<64;M++){let z=l0(X,6)^l0(X,11)^l0(X,25),D=V+z+t5(X,U,W)+L6[M]+$J[M]|0,N=(l0(J,2)^l0(J,13)^l0(J,22))+e5(J,G,Q)|0;V=W,W=U,U=X,X=Y+D|0,Y=Q,Q=G,G=J,J=D+N|0}J=J+this.A|0,G=G+this.B|0,Q=Q+this.C|0,Y=Y+this.D|0,X=X+this.E|0,U=U+this.F|0,W=W+this.G|0,V=V+this.H|0,this.set(J,G,Q,Y,X,U,W,V)}roundClean(){A0($J)}destroy(){this.set(0,0,0,0,0,0,0,0),A0(this.buffer)}}class zV extends pX{A=Lq[0]|0;B=Lq[1]|0;C=Lq[2]|0;D=Lq[3]|0;E=Lq[4]|0;F=Lq[5]|0;G=Lq[6]|0;H=Lq[7]|0;constructor(){super(32)}}class P6 extends pX{A=Pq[0]|0;B=Pq[1]|0;C=Pq[2]|0;D=Pq[3]|0;E=Pq[4]|0;F=Pq[5]|0;G=Pq[6]|0;H=Pq[7]|0;constructor(){super(28)}}var RV=(()=>TY(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map(($)=>BigInt($))))(),F6=(()=>RV[0])(),g6=(()=>RV[1])(),qJ=new Uint32Array(80),JJ=new Uint32Array(80);class aG extends ZY{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:q,Bh:J,Bl:G,Ch:Q,Cl:Y,Dh:X,Dl:U,Eh:W,El:V,Fh:M,Fl:z,Gh:D,Gl:R,Hh:N,Hl:w}=this;return[$,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w]}set($,q,J,G,Q,Y,X,U,W,V,M,z,D,R,N,w){this.Ah=$|0,this.Al=q|0,this.Bh=J|0,this.Bl=G|0,this.Ch=Q|0,this.Cl=Y|0,this.Dh=X|0,this.Dl=U|0,this.Eh=W|0,this.El=V|0,this.Fh=M|0,this.Fl=z|0,this.Gh=D|0,this.Gl=R|0,this.Hh=N|0,this.Hl=w|0}process($,q){for(let S=0;S<16;S++,q+=4)qJ[S]=$.getUint32(q),JJ[S]=$.getUint32(q+=4);for(let S=16;S<80;S++){let _=qJ[S-15]|0,y=JJ[S-15]|0,p=bJ(_,y,1)^bJ(_,y,8)^hX(_,y,7),F=kJ(_,y,1)^kJ(_,y,8)^uX(_,y,7),f=qJ[S-2]|0,m=JJ[S-2]|0,k=bJ(f,m,19)^nG(f,m,61)^hX(f,m,6),l=kJ(f,m,19)^oG(f,m,61)^uX(f,m,6),v=UV(F,l,JJ[S-7],JJ[S-16]),C=WV(v,p,k,qJ[S-7],qJ[S-16]);qJ[S]=C|0,JJ[S]=v|0}let{Ah:J,Al:G,Bh:Q,Bl:Y,Ch:X,Cl:U,Dh:W,Dl:V,Eh:M,El:z,Fh:D,Fl:R,Gh:N,Gl:w,Hh:j,Hl:B}=this;for(let S=0;S<80;S++){let _=bJ(M,z,14)^bJ(M,z,18)^nG(M,z,41),y=kJ(M,z,14)^kJ(M,z,18)^oG(M,z,41),p=M&D^~M&N,F=z&R^~z&w,f=VV(B,y,F,g6[S],JJ[S]),m=MV(f,j,_,p,F6[S],qJ[S]),k=f|0,l=bJ(J,G,28)^nG(J,G,34)^nG(J,G,39),v=kJ(J,G,28)^oG(J,G,34)^oG(J,G,39),C=J&Q^J&X^Q&X,I=G&Y^G&U^Y&U;j=N|0,B=w|0,N=D|0,w=R|0,D=M|0,R=z|0,{h:M,l:z}=Qq(W|0,V|0,m|0,k|0),W=X|0,V=U|0,X=Q|0,U=Y|0,Q=J|0,Y=G|0;let A=YV(k,v,I);J=XV(A,m,l,C),G=A|0}({h:J,l:G}=Qq(this.Ah|0,this.Al|0,J|0,G|0)),{h:Q,l:Y}=Qq(this.Bh|0,this.Bl|0,Q|0,Y|0),{h:X,l:U}=Qq(this.Ch|0,this.Cl|0,X|0,U|0),{h:W,l:V}=Qq(this.Dh|0,this.Dl|0,W|0,V|0),{h:M,l:z}=Qq(this.Eh|0,this.El|0,M|0,z|0),{h:D,l:R}=Qq(this.Fh|0,this.Fl|0,D|0,R|0),{h:N,l:w}=Qq(this.Gh|0,this.Gl|0,N|0,w|0),{h:j,l:B}=Qq(this.Hh|0,this.Hl|0,j|0,B|0),this.set(J,G,Q,Y,X,U,W,V,M,z,D,R,N,w,j,B)}roundClean(){A0(qJ,JJ)}destroy(){A0(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class _6 extends aG{Ah=d$[0]|0;Al=d$[1]|0;Bh=d$[2]|0;Bl=d$[3]|0;Ch=d$[4]|0;Cl=d$[5]|0;Dh=d$[6]|0;Dl=d$[7]|0;Eh=d$[8]|0;El=d$[9]|0;Fh=d$[10]|0;Fl=d$[11]|0;Gh=d$[12]|0;Gl=d$[13]|0;Hh=d$[14]|0;Hl=d$[15]|0;constructor(){super(64)}}class DV extends aG{Ah=i$[0]|0;Al=i$[1]|0;Bh=i$[2]|0;Bl=i$[3]|0;Ch=i$[4]|0;Cl=i$[5]|0;Dh=i$[6]|0;Dl=i$[7]|0;Eh=i$[8]|0;El=i$[9]|0;Fh=i$[10]|0;Fl=i$[11]|0;Gh=i$[12]|0;Gl=i$[13]|0;Hh=i$[14]|0;Hl=i$[15]|0;constructor(){super(48)}}var J0=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),G0=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class v6 extends aG{Ah=J0[0]|0;Al=J0[1]|0;Bh=J0[2]|0;Bl=J0[3]|0;Ch=J0[4]|0;Cl=J0[5]|0;Dh=J0[6]|0;Dl=J0[7]|0;Eh=J0[8]|0;El=J0[9]|0;Fh=J0[10]|0;Fl=J0[11]|0;Gh=J0[12]|0;Gl=J0[13]|0;Hh=J0[14]|0;Hl=J0[15]|0;constructor(){super(28)}}class b6 extends aG{Ah=G0[0]|0;Al=G0[1]|0;Bh=G0[2]|0;Bl=G0[3]|0;Ch=G0[4]|0;Cl=G0[5]|0;Dh=G0[6]|0;Dl=G0[7]|0;Eh=G0[8]|0;El=G0[9]|0;Fh=G0[10]|0;Fl=G0[11]|0;Gh=G0[12]|0;Gl=G0[13]|0;Hh=G0[14]|0;Hl=G0[15]|0;constructor(){super(32)}}var SY=C8(()=>new zV,oq(1));var KV=C8(()=>new DV,oq(2));/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var k6=BigInt(1),HV=BigInt(2),m6=BigInt(3),y6=BigInt(5),n3=BigInt(8),OV=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed");function f6($){let q=BigInt(10),J=BigInt(20),G=BigInt(40),Q=BigInt(80),Y=OV,U=$*$%Y*$%Y,W=m0(U,HV,Y)*U%Y,V=m0(W,k6,Y)*$%Y,M=m0(V,y6,Y)*V%Y,z=m0(M,q,Y)*M%Y,D=m0(z,J,Y)*z%Y,R=m0(D,G,Y)*D%Y,N=m0(R,Q,Y)*R%Y,w=m0(N,Q,Y)*R%Y,j=m0(w,q,Y)*M%Y;return{pow_p_5_8:m0(j,HV,Y)*$%Y,b2:U}}function x6($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var NV=(()=>{let $=OV;return d5({P:$,type:"x25519",powPminus2:(q)=>{let{pow_p_5_8:J,b2:G}=f6(q);return D0(m0(J,m6,$)*G,$)},adjustScalarBytes:x6})})();/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var h6=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))(),u6=(()=>({p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff"),n:BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973"),h:BigInt(1),a:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc"),b:BigInt("0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef"),Gx:BigInt("0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7"),Gy:BigInt("0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f")}))();var p6=fX(h6),lX=xX(p6,SY);var l6=fX(u6),wV=xX(l6,KV);function AV($,q,J){if(k0($),J===void 0)J=new Uint8Array($.outputLen);return F8($,J,q)}var rX=Uint8Array.of(0),jV=Uint8Array.of();function ZV($,q,J,G=32){k0($),f$(G,"length");let Q=$.outputLen;if(G>255*Q)throw Error("Length must be <= 255*HashLen");let Y=Math.ceil(G/Q);if(J===void 0)J=jV;else Q$(J,void 0,"info");let X=new Uint8Array(Y*Q),U=F8.create($,q),W=U._cloneInto(),V=new Uint8Array(U.outputLen);for(let M=0;M<Y;M++)rX[0]=M+1,W.update(M===0?jV:V).update(J).update(rX).digestInto(V),X.set(V,Q*M),U._cloneInto(W);return U.destroy(),W.destroy(),A0(V,rX),X.slice(0,G)}var r6=BigInt(0),sG=BigInt(1),i6=BigInt(2),d6=BigInt(7),c6=BigInt(256),n6=BigInt(113),SV=[],IV=[],CV=[];for(let $=0,q=sG,J=1,G=0;$<24;$++){[J,G]=[G,(2*J+3*G)%5],SV.push(2*(5*G+J)),IV.push(($+1)*($+2)/2%64);let Q=r6;for(let Y=0;Y<7;Y++)if(q=(q<<sG^(q>>d6)*n6)%c6,q&i6)Q^=sG<<(sG<<BigInt(Y))-sG;CV.push(Q)}var EV=TY(CV,!0),o6=EV[0],a6=EV[1],BV=($,q,J)=>J>32?GV($,q,J):qV($,q,J),TV=($,q,J)=>J>32?QV($,q,J):JV($,q,J);function s6($,q=24){let J=new Uint32Array(10);for(let G=24-q;G<24;G++){for(let X=0;X<10;X++)J[X]=$[X]^$[X+10]^$[X+20]^$[X+30]^$[X+40];for(let X=0;X<10;X+=2){let U=(X+8)%10,W=(X+2)%10,V=J[W],M=J[W+1],z=BV(V,M,1)^J[U],D=TV(V,M,1)^J[U+1];for(let R=0;R<50;R+=10)$[X+R]^=z,$[X+R+1]^=D}let Q=$[2],Y=$[3];for(let X=0;X<24;X++){let U=IV[X],W=BV(Q,Y,U),V=TV(Q,Y,U),M=SV[X];Q=$[M],Y=$[M+1],$[M]=W,$[M+1]=V}for(let X=0;X<50;X+=10){for(let U=0;U<10;U++)J[U]=$[X+U];for(let U=0;U<10;U++)$[X+U]^=~J[(U+2)%10]&J[(U+4)%10]}$[0]^=o6[G],$[1]^=a6[G]}A0(J)}class IY{state;pos=0;posOut=0;finished=!1;state32;destroyed=!1;blockLen;suffix;outputLen;enableXOF=!1;rounds;constructor($,q,J,G=!1,Q=24){if(this.blockLen=$,this.suffix=q,this.outputLen=J,this.enableXOF=G,this.rounds=Q,f$(J,"outputLen"),!(0<$&&$<200))throw Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=DY(this.state)}clone(){return this._cloneInto()}keccak(){BX(this.state32),s6(this.state32,this.rounds),BX(this.state32),this.posOut=0,this.pos=0}update($){Cq(this),Q$($);let{blockLen:q,state:J}=this,G=$.length;for(let Q=0;Q<G;){let Y=Math.min(q-this.pos,G-Q);for(let X=0;X<Y;X++)J[this.pos++]^=$[Q++];if(this.pos===q)this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;let{state:$,suffix:q,pos:J,blockLen:G}=this;if($[J]^=q,(q&128)!==0&&J===G-1)this.keccak();$[G-1]^=128,this.keccak()}writeInto($){Cq(this,!1),Q$($),this.finish();let q=this.state,{blockLen:J}=this;for(let G=0,Q=$.length;G<Q;){if(this.posOut>=J)this.keccak();let Y=Math.min(J-this.posOut,Q-G);$.set(q.subarray(this.posOut,this.posOut+Y),G),this.posOut+=Y,G+=Y}return $}xofInto($){if(!this.enableXOF)throw Error("XOF is not possible for this instance");return this.writeInto($)}xof($){return f$($),this.xofInto(new Uint8Array($))}digestInto($){if(RY($,this),this.finished)throw Error("digest() was already called");return this.writeInto($),this.destroy(),$}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,A0(this.state)}_cloneInto($){let{blockLen:q,suffix:J,outputLen:G,rounds:Q,enableXOF:Y}=this;return $||=new IY(q,J,G,Y,Q),$.state32.set(this.state32),$.pos=this.pos,$.posOut=this.posOut,$.finished=this.finished,$.rounds=Q,$.suffix=J,$.outputLen=G,$.enableXOF=Y,$.destroyed=this.destroyed,$}}var LV=($,q,J,G={})=>C8(()=>new IY(q,$,J),G);var mJ=LV(6,136,32,oq(8));var PV=LV(6,72,64,oq(10));var FV=($,q,J,G={})=>C8((Q={})=>new IY(q,$,Q.dkLen===void 0?J:Q.dkLen,!0),G),gV=FV(31,168,16,oq(11)),Yq=FV(31,136,32,oq(12));function iX($){if(!Number.isSafeInteger($)||$<0||$>4294967295)throw Error("wrong u32 integer:"+$);return $}function vV($){return iX($),($&$-1)===0&&$!==0}function dX($,q){iX($);let J=0;for(let G=0;G<q;G++,$>>>=1)J=J<<1|$&1;return J}function bV($){return iX($),31-Math.clz32($)}function _V($){let q=$.length;if(q<2||!vV(q))throw Error("n must be a power of 2 and greater than 1. Got "+q);let J=bV(q);for(let G=0;G<q;G++){let Q=dX(G,J);if(G<Q){let Y=$[G];$[G]=$[Q],$[Q]=Y}}return $}var cX=($,q)=>{let{N:J,roots:G,dit:Q,invertButterflies:Y=!1,skipStages:X=0,brp:U=!0}=q,W=bV(J);if(!vV(J))throw Error("FFT: Polynomial size should be power of two");let V=Q!==Y;return(M)=>{if(M.length!==J)throw Error("FFT: wrong Polynomial length");if(Q&&U)_V(M);for(let z=0,D=1;z<W-X;z++){let R=Q?z+1+X:W-z,N=1<<R,w=N>>1,j=J>>R;for(let B=0;B<J;B+=N)for(let S=0,_=D++;S<w;S++){let y=Y?Q?J-_:_:S*j,p=B+S,F=B+S+w,f=G[y],m=M[F],k=M[p];if(V){let l=$.mul(m,f);M[p]=$.add(k,l),M[F]=$.sub(k,l)}else if(Y)M[p]=$.add(m,k),M[F]=$.mul($.sub(m,k),f);else M[p]=$.add(k,m),M[F]=$.mul($.sub(k,m),f)}}if(!Q&&U)_V(M);return M}};/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var Xq=nq;function CY($,q){if($.length!==q.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^q[G];return J===0}function kV($){return Uint8Array.from($)}function yJ($,...q){let J=(Q)=>typeof Q==="number"?Q:Q.bytesLen,G=q.reduce((Q,Y)=>Q+J(Y),0);return{bytesLen:G,encode:(Q)=>{let Y=new Uint8Array(G);for(let X=0,U=0;X<q.length;X++){let W=q[X],V=J(W),M=typeof W==="number"?Q[X]:W.encode(Q[X]);if(Q$(M,V,$),Y.set(M,U),typeof W!=="number")M.fill(0);U+=V}return Y},decode:(Q)=>{Q$(Q,G,$);let Y=[];for(let X of q){let U=J(X),W=Q.subarray(0,U);Y.push(typeof X==="number"?W:X.decode(W)),Q=Q.subarray(U)}return Y}}}function EY($,q){let J=q*$.bytesLen;return{bytesLen:J,encode:(G)=>{if(G.length!==q)throw Error(`vecCoder.encode: wrong length=${G.length}. Expected: ${q}`);let Q=new Uint8Array(J);for(let Y=0,X=0;Y<G.length;Y++){let U=$.encode(G[Y]);Q.set(U,X),U.fill(0),X+=U.length}return Q},decode:(G)=>{Q$(G,J);let Q=[];for(let Y=0;Y<G.length;Y+=$.bytesLen)Q.push($.decode(G.subarray(Y,Y+$.bytesLen)));return Q}}}function b$(...$){for(let q of $)if(Array.isArray(q))for(let J of q)J.fill(0);else q.fill(0)}function nX($){return(1<<$)-1}var VF=Uint8Array.of();/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var mV=($)=>{let{newPoly:q,N:J,Q:G,F:Q,ROOT_OF_UNITY:Y,brvBits:X,isKyber:U}=$,W=(S,_=G)=>{let y=S%_|0;return(y>=0?y|0:_+y|0)|0},V=(S,_=G)=>{let y=W(S,_)|0;return(y>_>>1?y-_|0:y)|0};function M(){let S=q(J);for(let _=0;_<J;_++){let y=dX(_,X),p=BigInt(Y)**BigInt(y)%BigInt(G);S[_]=Number(p)|0}return S}let z=M(),D={add:(S,_)=>W((S|0)+(_|0))|0,sub:(S,_)=>W((S|0)-(_|0))|0,mul:(S,_)=>W((S|0)*(_|0))|0,inv:(S)=>{throw Error("not implemented")}},R={N:J,roots:z,invertButterflies:!0,skipStages:U?1:0,brp:!1},N=cX(D,{dit:!1,...R}),w=cX(D,{dit:!0,...R});return{mod:W,smod:V,nttZetas:z,NTT:{encode:(S)=>{return N(S)},decode:(S)=>{w(S);for(let _=0;_<S.length;_++)S[_]=W(Q*S[_]);return S}},bitsCoder:(S,_)=>{let y=nX(S),p=S*(J/8);return{bytesLen:p,encode:(F)=>{let f=new Uint8Array(p);for(let m=0,k=0,l=0,v=0;m<F.length;m++){k|=(_.encode(F[m])&y)<<l,l+=S;for(;l>=8;l-=8,k>>=8)f[v++]=k&nX(l)}return f},decode:(F)=>{let f=q(J);for(let m=0,k=0,l=0,v=0;m<F.length;m++){k|=F[m]<<l,l+=8;for(;l>=S;l-=S,k>>=S)f[v++]=_.decode(k&y)}return f}}}}},t6=($)=>(q,J)=>{if(!J)J=$.blockLen;let G=new Uint8Array(q.length+2);G.set(q);let Q=q.length,Y=new Uint8Array(J),X=$.create({}),U=0,W=0;return{stats:()=>({calls:U,xofs:W}),get:(V,M)=>{return G[Q+0]=V,G[Q+1]=M,X.destroy(),X=$.create({}).update(G),U++,()=>{return W++,X.xofInto(Y)}},clean:()=>{X.destroy(),b$(Y,G)}}},yV=t6(gV);/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var Q0=256,Fq=3329,e6=3303,$N=17,{mod:$Q,nttZetas:qN,NTT:fJ,bitsCoder:JN}=mV({N:Q0,Q:Fq,F:e6,ROOT_OF_UNITY:$N,newPoly:($)=>new Uint16Array($),brvBits:7,isKyber:!0}),oX={512:{N:Q0,Q:Fq,K:2,ETA1:3,ETA2:2,du:10,dv:4,RBGstrength:128},768:{N:Q0,Q:Fq,K:3,ETA1:2,ETA2:2,du:10,dv:4,RBGstrength:192},1024:{N:Q0,Q:Fq,K:4,ETA1:2,ETA2:2,du:11,dv:5,RBGstrength:256}},GN=($)=>{if($>=12)return{encode:(J)=>J,decode:(J)=>J};let q=2**($-1);return{encode:(J)=>((J<<$)+Fq/2)/Fq,decode:(J)=>J*Fq+q>>>$}},tG=($)=>JN($,GN($));function xJ($,q){for(let J=0;J<Q0;J++)$[J]=$Q($[J]+q[J])}function QN($,q){for(let J=0;J<Q0;J++)$[J]=$Q($[J]-q[J])}function YN($,q,J,G,Q){let Y=$Q(q*G*Q+$*J),X=$Q($*G+q*J);return{c0:Y,c1:X}}function LY($,q){for(let J=0;J<Q0/2;J++){let G=qN[64+(J>>1)];if(J&1)G=-G;let{c0:Q,c1:Y}=YN($[2*J+0],$[2*J+1],q[2*J+0],q[2*J+1],G);$[2*J+0]=Q,$[2*J+1]=Y}return $}function fV($){let q=new Uint16Array(Q0);for(let J=0;J<Q0;){let G=$();if(G.length%3)throw Error("SampleNTT: unaligned block");for(let Q=0;J<Q0&&Q+3<=G.length;Q+=3){let Y=(G[Q+0]>>0|G[Q+1]<<8)&4095,X=(G[Q+1]>>4|G[Q+2]<<4)&4095;if(Y<Fq)q[J++]=Y;if(J<Q0&&X<Fq)q[J++]=X}}return q}function eG($,q,J,G){let Q=$(G*Q0/4,q,J),Y=new Uint16Array(Q0),X=DY(Q),U=0;for(let W=0,V=0,M=0,z=0;W<X.length;W++){let D=X[W];for(let R=0;R<32;R++)if(M+=D&1,D>>=1,U+=1,U===G)z=M,M=0;else if(U===2*G)Y[V++]=$Q(z-M),M=0,U=0}if(U)throw Error(`sampleCBD: leftover bits: ${U}`);return Y}var XN=($)=>{let{K:q,PRF:J,XOF:G,HASH512:Q,ETA1:Y,ETA2:X,du:U,dv:W}=$,V=tG(1),M=tG(W),z=tG(U),D=yJ("publicKey",EY(tG(12),q),32),R=EY(tG(12),q),N=yJ("ciphertext",EY(z,q),M),w=yJ("seed",32,32);return{secretCoder:R,lengths:{secretKey:R.bytesLen,publicKey:D.bytesLen,cipherText:N.bytesLen},keygen:(j)=>{Q$(j,32,"seed");let B=new Uint8Array(33);B.set(j),B[32]=q;let S=Q(B),[_,y]=w.decode(S),p=[],F=[];for(let k=0;k<q;k++)p.push(fJ.encode(eG(J,y,k,Y)));let f=G(_);for(let k=0;k<q;k++){let l=fJ.encode(eG(J,y,q+k,Y));for(let v=0;v<q;v++){let C=fV(f.get(v,k));xJ(l,LY(C,p[v]))}F.push(l)}f.clean();let m={publicKey:D.encode([F,_]),secretKey:R.encode(p)};return b$(_,y,p,F,B,S),m},encrypt:(j,B,S)=>{let[_,y]=D.decode(j),p=[];for(let v=0;v<q;v++)p.push(fJ.encode(eG(J,S,v,Y)));let F=G(y),f=new Uint16Array(Q0),m=[];for(let v=0;v<q;v++){let C=eG(J,S,q+v,X),I=new Uint16Array(Q0);for(let A=0;A<q;A++){let T=fV(F.get(v,A));xJ(I,LY(T,p[A]))}xJ(C,fJ.decode(I)),m.push(C),xJ(f,LY(_[v],p[v])),b$(I)}F.clean();let k=eG(J,S,2*q,X);xJ(k,fJ.decode(f));let l=V.decode(B);return xJ(l,k),b$(_,p,f,k),N.encode([m,l])},decrypt:(j,B)=>{let[S,_]=N.decode(j),y=R.decode(B),p=new Uint16Array(Q0);for(let F=0;F<q;F++)xJ(p,LY(y[F],fJ.encode(S[F])));return QN(_,fJ.decode(p)),b$(p,y,S),V.encode(_)}}};function aX($){let q=XN($),{HASH256:J,HASH512:G,KDF:Q}=$,{secretCoder:Y,lengths:X}=q,U=yJ("secretKey",X.secretKey,X.publicKey,32,32),W=32,V=64;return{info:{type:"ml-kem"},lengths:{...X,seed:64,msg:32,msgRand:32,secretKey:U.bytesLen},keygen:(M=Xq(64))=>{Q$(M,64,"seed");let{publicKey:z,secretKey:D}=q.keygen(M.subarray(0,32)),R=J(z),N=U.encode([D,z,R,M.subarray(32)]);return b$(D,R),{publicKey:z,secretKey:N}},getPublicKey:(M)=>{let[z,D,R,N]=U.decode(M);return Uint8Array.from(D)},encapsulate:(M,z=Xq(32))=>{Q$(M,X.publicKey,"publicKey"),Q$(z,32,"message");let D=M.subarray(0,384*$.K),R=Y.encode(Y.decode(kV(D)));if(!CY(R,D))throw b$(R),Error("ML-KEM.encapsulate: wrong publicKey modulus");b$(R);let N=G.create().update(z).update(J(M)).digest(),w=q.encrypt(M,z,N.subarray(32,64));return b$(N.subarray(32)),{cipherText:w,sharedSecret:N.subarray(0,32)}},decapsulate:(M,z)=>{Q$(z,U.bytesLen,"secretKey"),Q$(M,X.cipherText,"cipherText");let D=U.bytesLen-96,R=D+32,N=J(z.subarray(D/2,R));if(!CY(N,z.subarray(R,R+32)))throw Error("invalid secretKey: hash check failed");let[w,j,B,S]=U.decode(z),_=q.decrypt(M,w),y=G.create().update(_).update(B).digest(),p=y.subarray(0,32),F=q.encrypt(j,_,y.subarray(32,64)),f=CY(M,F),m=Q.create({dkLen:32}).update(S).update(M).digest();return b$(_,F,!f?p:m),f?p:m}}}function UN($,q,J){return Yq.create({dkLen:$}).update(q).update(new Uint8Array([J])).digest()}var sX={HASH256:mJ,HASH512:PV,KDF:Yq,XOF:yV,PRF:UN},AF=aX({...sX,...oX[512]}),qQ=aX({...sX,...oX[768]}),xV=aX({...sX,...oX[1024]});/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */function WN($,q=!1){let{lengths:J,keygen:G}=$;if(q){let Y=$.Point.Fn;if(!Y)throw Error("No Point.Fn");G=(X=Xq(J.seed))=>{Q$(X,J.seed,"seed");let U=Y.isLE?sq(X):aq(X),W=Y.toBytes(Y.create(U));return{secretKey:W,publicKey:$.getPublicKey(W)}}}return{lengths:{secretKey:J.secretKey,publicKey:J.publicKey,seed:J.seed},keygen:G,getPublicKey:(Q)=>$.getPublicKey(Q)}}function tX($,q=!1){let J=WN($,q);if(!$.getSharedSecret)throw Error("wrong curve");return{lengths:{...J.lengths,msg:J.lengths.seed,cipherText:J.lengths.publicKey},keygen:J.keygen,getPublicKey:J.getPublicKey,encapsulate(G,Q=Xq($.lengths.seed)){let Y=this.keygen(Q).secretKey,X=this.decapsulate(G,Y),U=$.getPublicKey(Y);return b$(Y),{sharedSecret:X,cipherText:U}},decapsulate(G,Q){let Y=$.getSharedSecret(Q,G);return $.lengths.publicKeyHasPrefix?Y.subarray(1):Y}}}function JQ($,q){return yJ(q,...$.map((J)=>{if(typeof J.lengths[q]!=="number")throw Error("wrong length: "+q);return J.lengths[q]}))}function eX($){return(q,J)=>$(q,{dkLen:J})}function VN($,q,...J){let G=JQ(J,"seed"),Q=JQ(J,"publicKey");if($===void 0)$=G.bytesLen;f$($);function Y(X){Q$(X,$);let U=G.decode(q(X,G.bytesLen)),W=J.map((z,D)=>z.keygen(U[D])),V=W.map((z)=>z.secretKey),M=W.map((z)=>z.publicKey);return{secretKey:V,publicKey:M}}return{info:{lengths:{seed:$,publicKey:Q.bytesLen,secretKey:$}},getPublicKey(X){return this.keygen(X).publicKey},keygen(X=Xq($)){let{publicKey:U,secretKey:W}=Y(X),V=Q.encode(U);return b$(U),b$(W),{secretKey:X,publicKey:V}},expandDecapsulationKey:Y,realSeedLen:$}}function PY($,q,J,G,...Q){let Y=VN($,J,...Q),X=JQ(Q,"cipherText"),U=JQ(Q,"publicKey"),W=JQ(Q,"msg");if(q===void 0)q=W.bytesLen;return f$(q),{lengths:{...Y.info.lengths,msg:q,msgRand:W.bytesLen,cipherText:X.bytesLen},getPublicKey:Y.getPublicKey,keygen:Y.keygen,encapsulate(V,M=Xq(W.bytesLen)){let z=U.decode(V),D=W.decode(M),R=Q.map((B,S)=>B.encapsulate(z[S],D[S])),N=R.map((B)=>B.sharedSecret),w=R.map((B)=>B.cipherText),j={sharedSecret:G(z,w,N),cipherText:X.encode(w)};return b$(N,w),j},decapsulate(V,M){let z=X.decode(V),{publicKey:D,secretKey:R}=Y.expandDecapsulationKey(M),N=Q.map((w,j)=>w.decapsulate(z[j],R[j]));return G(D,z,N)}}}function hV($,q,J,G,Q){return k0(G),k0(Q),PY(32,32,eX(G),(Y,X,U)=>Q(F$(U[0],U[1],X[1],Y[1],tq($))),q,J)}var gF=hV("QSF-KEM(ML-KEM-768,P-256)-XOF(SHAKE256)-KDF(SHA3-256)",qQ,tX(lX,!0),Yq,mJ),_F=hV("QSF-KEM(ML-KEM-1024,P-384)-XOF(SHAKE256)-KDF(SHA3-256)",xV,tX(wV,!0),Yq,mJ);function MN($,q,J,G,Q){return k0(G),k0(Q),PY(32,32,eX(G),(Y,X,U)=>{let W=F$(U[0],U[1],X[0],Y[0],X[1],Y[1],tq($)),V=32,M=F$(tq("hybrid_prk"),W),z=AV(Q,M),D=F$(E8(32,2),tq("shared_secret"),tq("")),R=ZV(Q,z,D,32);return b$(z,D,M,W),R},q,J)}var uV=tX(NV),vF=MN("KitchenSink-KEM(ML-KEM-768,X25519)-XOF(SHAKE256)-KDF(HKDF-SHA-256)",qQ,uV,Yq,SY),zN=(()=>PY(32,32,eX(Yq),($,q,J)=>mJ(F$(J[0],J[1],q[1],$[1],tq("\\.//^\\"))),qQ,uV))();function RN($,q,J,G){let Q=$.Point.Fn;if(!Q)throw Error("no Point.Fn");function Y(X){let U;for(let M=0,z=q;;M=z,z+=q){if(z>X.length)throw Error("rejection sampling failed");if(U=Q.fromBytes(X.subarray(M,z),!0),Q.isValidNot0(U))break}let W=Q.toBytes(Q.create(U)),V=$.getPublicKey(W,!1);return{secretKey:W,publicKey:V}}return{lengths:{secretKey:q,publicKey:J,seed:G,msg:G,cipherText:J},keygen(X=Xq(G)){return Q$(X,G,"seed"),Y(X)},getPublicKey(X){return $.getPublicKey(X,!1)},encapsulate(X,U=Xq(G)){Q$(U,G,"rand");let{secretKey:W}=Y(U),V=this.decapsulate(X,W),M=$.getPublicKey(W,!1);return b$(W),{sharedSecret:V,cipherText:M}},decapsulate(X,U){return $.getSharedSecret(U,X).subarray(1)}}}function DN($,q,J,G){let{secretKey:Q,publicKeyUncompressed:Y}=J.lengths;if(!Q||!Y)throw Error("wrong curve");let X=RN(J,Q,Y,G),U=64,W=U+G;return PY(32,32,(V)=>{Q$(V,32);let M=Yq(V,{dkLen:W}),z=M.subarray(0,U),D=M.subarray(U,W);return F$(z,D)},(V,M,z)=>mJ(F$(z[0],z[1],M[1],V[1],tq($))),q,X)}var KN=(()=>DN("MLKEM768-P256",qQ,lX,128))();var FY=zN,pV=KN;/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var Z$=($,q,J)=>u$($,q,J),qU=E$,_8=$Y,c$=(...$)=>JX(...$),v8=($)=>gG($),b8=e9,k8=($)=>Zq($),_Y=BigInt(0),$U=BigInt(1);function gq($,q=""){if(typeof $!=="boolean"){let J=q&&`"${q}" `;throw TypeError(J+"expected boolean, got type="+typeof $)}return $}function vY($){if(typeof $==="bigint"){if(!gY($))throw RangeError("positive bigint expected, got "+$)}else qU($);return $}function Uq($,q=""){if(typeof $!=="number"){let J=q&&`"${q}" `;throw TypeError(J+"expected number, got type="+typeof $)}if(!Number.isSafeInteger($)){let J=q&&`"${q}" `;throw RangeError(J+"expected safe integer, got "+$)}}function GQ($){let q=vY($).toString(16);return q.length&1?"0"+q:q}function lV($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);return $===""?_Y:BigInt("0x"+$)}function hJ($){return lV($Y($))}function r0($){return lV($Y(GJ(u$($)).reverse()))}function bY($,q){if(E$(q),q===0)throw RangeError("zero length");$=vY($);let J=$.toString(16);if(J.length>q*2)throw RangeError("number too large");return gG(J.padStart(q*2,"0"))}function QQ($,q){return bY($,q).reverse()}function rV($,q){if($=Z$($),q=Z$(q),$.length!==q.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^q[G];return J===0}function GJ($){return Uint8Array.from(Z$($))}function kY($){if(typeof $!=="string")throw TypeError("ascii string expected, got "+typeof $);return Uint8Array.from($,(q,J)=>{let G=q.charCodeAt(0);if(q.length!==1||G>127)throw RangeError(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var gY=($)=>typeof $==="bigint"&&_Y<=$;function HN($,q,J){return gY($)&&gY(q)&&gY(J)&&q<=$&&$<J}function _q($,q,J,G){if(!HN(q,J,G))throw RangeError("expected valid "+$+": "+J+" <= n < "+G+", got "+q)}function m8($){if($<_Y)throw Error("expected non-negative bigint, got "+$);let q;for(q=0;$>_Y;$>>=$U,q+=1);return q}var YQ=($)=>($U<<BigInt($))-$U;function iV($,q,J){if(E$($,"hashLen"),E$(q,"qByteLen"),typeof J!=="function")throw TypeError("hmacFn must be a function");let G=(j)=>new Uint8Array(j),Q=Uint8Array.of(),Y=Uint8Array.of(0),X=Uint8Array.of(1),U=1000,W=G($),V=G($),M=0,z=()=>{W.fill(1),V.fill(0),M=0},D=(...j)=>J(V,c$(W,...j)),R=(j=Q)=>{if(V=D(Y,j),W=D(),j.length===0)return;V=D(X,j),W=D()},N=()=>{if(M++>=U)throw Error("drbg: tried max amount of iterations");let j=0,B=[];while(j<q){W=D();let S=W.slice();B.push(S),j+=W.length}return c$(...B)};return(j,B)=>{z(),R(j);let S=void 0;while((S=B(N()))===void 0)R();return z(),S}}function y0($,q={},J={}){if(Object.prototype.toString.call($)!=="[object Object]")throw TypeError("expected valid options object");function G(Y,X,U){if(!U&&X!=="function"&&!Object.hasOwn($,Y))throw TypeError(`param "${Y}" is invalid: expected own property`);let W=$[Y];if(U&&W===void 0)return;let V=typeof W;if(V!==X||W===null)throw TypeError(`param "${Y}" is invalid: expected ${X}, got ${V}`)}let Q=(Y,X)=>Object.entries(Y).forEach(([U,W])=>G(U,W,X));Q(q,!1),Q(J,!0)}var JU=()=>{throw Error("not implemented")};/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var n$=BigInt(0),I$=BigInt(1),uJ=BigInt(2),oV=BigInt(3),aV=BigInt(4),sV=BigInt(5),ON=BigInt(7),tV=BigInt(8),NN=BigInt(9),eV=BigInt(16);function B$($,q){if(q<=n$)throw Error("mod: expected positive modulus, got "+q);let J=$%q;return J>=n$?J:q+J}function f0($,q,J){if(q<n$)throw Error("pow2: expected non-negative exponent, got "+q);let G=$;while(q-- >n$)G*=G,G%=J;return G}function dV($,q){if($===n$)throw Error("invert: expected non-zero number");if(q<=n$)throw Error("invert: expected positive modulus, got "+q);let J=B$($,q),G=q,Q=n$,Y=I$,X=I$,U=n$;while(J!==n$){let V=G/J,M=G-J*V,z=Q-X*V,D=Y-U*V;G=J,J=M,Q=X,Y=U,X=z,U=D}if(G!==I$)throw Error("invert: does not exist");return B$(Q,q)}function GU($,q,J){let G=$;if(!G.eql(G.sqr(q),J))throw Error("Cannot find square root")}function $M($,q){let J=$,G=(J.ORDER+I$)/aV,Q=J.pow(q,G);return GU(J,Q,q),Q}function wN($,q){let J=$,G=(J.ORDER-sV)/tV,Q=J.mul(q,uJ),Y=J.pow(Q,G),X=J.mul(q,Y),U=J.mul(J.mul(X,uJ),Y),W=J.mul(X,J.sub(U,J.ONE));return GU(J,W,q),W}function jN($){let q=mY($),J=qM($),G=J(q,q.neg(q.ONE)),Q=J(q,G),Y=J(q,q.neg(G)),X=($+ON)/eV;return(U,W)=>{let V=U,M=V.pow(W,X),z=V.mul(M,G),D=V.mul(M,Q),R=V.mul(M,Y),N=V.eql(V.sqr(z),W),w=V.eql(V.sqr(D),W);M=V.cmov(M,z,N),z=V.cmov(R,D,w);let j=V.eql(V.sqr(z),W),B=V.cmov(M,z,j);return GU(V,B,W),B}}function qM($){if($<oV)throw Error("sqrt is not defined for small field");let q=$-I$,J=0;while(q%uJ===n$)q/=uJ,J++;let G=uJ,Q=mY($);while(cV(Q,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return $M;let Y=Q.pow(G,q),X=(q+I$)/uJ;return function(W,V){let M=W;if(M.is0(V))return V;if(cV(M,V)!==1)throw Error("Cannot find square root");let z=J,D=M.mul(M.ONE,Y),R=M.pow(V,q),N=M.pow(V,X);while(!M.eql(R,M.ONE)){if(M.is0(R))return M.ZERO;let w=1,j=M.sqr(R);while(!M.eql(j,M.ONE))if(w++,j=M.sqr(j),w===z)throw Error("Cannot find square root");let B=I$<<BigInt(z-w-1),S=M.pow(D,B);z=w,D=M.sqr(S),R=M.mul(R,D),N=M.mul(N,S)}return N}}function AN($){if($%aV===oV)return $M;if($%tV===sV)return wN;if($%eV===NN)return jN($);return qM($)}var vq=($,q)=>(B$($,q)&I$)===I$,ZN=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function QU($){let q={ORDER:"bigint",BYTES:"number",BITS:"number"},J=ZN.reduce((G,Q)=>{return G[Q]="function",G},q);if(y0($,J),Uq($.BYTES,"BYTES"),Uq($.BITS,"BITS"),$.BYTES<1||$.BITS<1)throw Error("invalid field: expected BYTES/BITS > 0");if($.ORDER<=I$)throw Error("invalid field: expected ORDER > 1, got "+$.ORDER);return $}function BN($,q,J){let G=$;if(J<n$)throw Error("invalid exponent, negatives unsupported");if(J===n$)return G.ONE;if(J===I$)return q;let Q=G.ONE,Y=q;while(J>n$){if(J&I$)Q=G.mul(Q,Y);Y=G.sqr(Y),J>>=I$}return Q}function XQ($,q,J=!1){let G=$,Q=Array(q.length).fill(J?G.ZERO:void 0),Y=q.reduce((U,W,V)=>{if(G.is0(W))return U;return Q[V]=U,G.mul(U,W)},G.ONE),X=G.inv(Y);return q.reduceRight((U,W,V)=>{if(G.is0(W))return U;return Q[V]=G.mul(U,Q[V]),G.mul(U,W)},X),Q}function cV($,q){let J=$,G=(J.ORDER-I$)/uJ,Q=J.pow(q,G),Y=J.eql(Q,J.ONE),X=J.eql(Q,J.ZERO),U=J.eql(Q,J.neg(J.ONE));if(!Y&&!X&&!U)throw Error("invalid Legendre symbol result");return Y?1:X?0:-1}function TN($,q){if(q!==void 0)qU(q);if($<=n$)throw Error("invalid n length: expected positive n, got "+$);if(q!==void 0&&q<1)throw Error("invalid n length: expected positive bit length, got "+q);let J=m8($);if(q!==void 0&&q<J)throw Error(`invalid n length: expected bit length (${J}) >= n.length (${q})`);let G=q!==void 0?q:J,Q=Math.ceil(G/8);return{nBitLength:G,nByteLength:Q}}var nV=new WeakMap;class YU{ORDER;BITS;BYTES;isLE;ZERO=n$;ONE=I$;_lengths;_mod;constructor($,q={}){if($<=I$)throw Error("invalid field: expected ORDER > 1, got "+$);let J=void 0;if(this.isLE=!1,q!=null&&typeof q==="object"){if(typeof q.BITS==="number")J=q.BITS;if(typeof q.sqrt==="function")Object.defineProperty(this,"sqrt",{value:q.sqrt,enumerable:!0});if(typeof q.isLE==="boolean")this.isLE=q.isLE;if(q.allowedLengths)this._lengths=Object.freeze(q.allowedLengths.slice());if(typeof q.modFromBytes==="boolean")this._mod=q.modFromBytes}let{nBitLength:G,nByteLength:Q}=TN($,J);if(Q>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=Q,Object.freeze(this)}create($){return B$($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw TypeError("invalid field element: expected bigint, got "+typeof $);return n$<=$&&$<this.ORDER}is0($){return $===n$}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&I$)===I$}neg($){return B$(-$,this.ORDER)}eql($,q){return $===q}sqr($){return B$($*$,this.ORDER)}add($,q){return B$($+q,this.ORDER)}sub($,q){return B$($-q,this.ORDER)}mul($,q){return B$($*q,this.ORDER)}pow($,q){return BN(this,$,q)}div($,q){return B$($*dV(q,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,q){return $+q}subN($,q){return $-q}mulN($,q){return $*q}inv($){return dV($,this.ORDER)}sqrt($){let q=nV.get(this);if(!q)nV.set(this,q=AN(this.ORDER));return q(this,$)}toBytes($){return this.isLE?QQ($,this.BYTES):bY($,this.BYTES)}fromBytes($,q=!1){Z$($);let{_lengths:J,BYTES:G,isLE:Q,ORDER:Y,_mod:X}=this;if(J){if($.length<1||!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let W=new Uint8Array(G);W.set($,Q?0:W.length-$.length),$=W}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let U=Q?r0($):hJ($);if(X)U=B$(U,Y);if(!q){if(!this.isValid(U))throw Error("invalid field element: outside of range 0..ORDER")}return U}invertBatch($){return XQ(this,$)}cmov($,q,J){return gq(J,"condition"),J?q:$}}Object.freeze(YU.prototype);function mY($,q={}){return new YU($,q)}function JM($){if(typeof $!=="bigint")throw Error("field order must be bigint");if($<=I$)throw Error("field order must be greater than 1");let q=m8($-I$);return Math.ceil(q/8)}function XU($){let q=JM($);return q+Math.ceil(q/2)}function GM($,q,J=!1){Z$($);let G=$.length,Q=JM(q),Y=Math.max(XU(q),16);if(G<Y||G>1024)throw Error("expected "+Y+"-1024 bytes of input, got "+G);let X=J?r0($):hJ($),U=B$(X,q-I$)+I$;return J?QQ(U,Q):bY(U,Q)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var y8=BigInt(0),pJ=BigInt(1);function UQ($,q){let J=q.negate();return $?J:q}function lJ($,q){let J=XQ($.Fp,q.map((G)=>G.Z));return q.map((G,Q)=>$.fromAffine(G.toAffine(J[Q])))}function UM($,q){if(!Number.isSafeInteger($)||$<=0||$>q)throw Error("invalid window size, expected [1.."+q+"], got W="+$)}function UU($,q){UM($,q);let J=Math.ceil(q/$)+1,G=2**($-1),Q=2**$,Y=YQ($),X=BigInt($);return{windows:J,windowSize:G,mask:Y,maxNumber:Q,shiftBy:X}}function QM($,q,J){let{windowSize:G,mask:Q,maxNumber:Y,shiftBy:X}=J,U=Number($&Q),W=$>>X;if(U>G)U-=Y,W+=pJ;let V=q*G,M=V+Math.abs(U)-1,z=U===0,D=U<0,R=q%2!==0;return{nextN:W,offset:M,isZero:z,isNeg:D,isNegF:R,offsetF:V}}var WU=new WeakMap,WM=new WeakMap;function VU($){return WM.get($)||1}function YM($){if($!==y8)throw Error("invalid wNAF")}class WQ{BASE;ZERO;Fn;bits;constructor($,q){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=q}_unsafeLadder($,q,J=this.ZERO){let G=$;while(q>y8){if(q&pJ)J=J.add(G);G=G.double(),q>>=pJ}return J}precomputeWindow($,q){let{windows:J,windowSize:G}=UU(q,this.bits),Q=[],Y=$,X=Y;for(let U=0;U<J;U++){X=Y,Q.push(X);for(let W=1;W<G;W++)X=X.add(Y),Q.push(X);Y=X.double()}return Q}wNAF($,q,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,Q=this.BASE,Y=UU($,this.bits);for(let X=0;X<Y.windows;X++){let{nextN:U,offset:W,isZero:V,isNeg:M,isNegF:z,offsetF:D}=QM(J,X,Y);if(J=U,V)Q=Q.add(UQ(z,q[D]));else G=G.add(UQ(M,q[W]))}return YM(J),{p:G,f:Q}}wNAFUnsafe($,q,J,G=this.ZERO){let Q=UU($,this.bits);for(let Y=0;Y<Q.windows;Y++){if(J===y8)break;let{nextN:X,offset:U,isZero:W,isNeg:V}=QM(J,Y,Q);if(J=X,W)continue;else{let M=q[U];G=G.add(V?M.negate():M)}}return YM(J),G}getPrecomputes($,q,J){let G=WU.get(q);if(!G){if(G=this.precomputeWindow(q,$),$!==1){if(typeof J==="function")G=J(G);WU.set(q,G)}}return G}cached($,q,J){let G=VU($);return this.wNAF(G,this.getPrecomputes(G,$,J),q)}unsafe($,q,J,G){let Q=VU($);if(Q===1)return this._unsafeLadder($,q,G);return this.wNAFUnsafe(Q,this.getPrecomputes(Q,$,J),q,G)}createCache($,q){UM(q,this.bits),WM.set($,q),WU.delete($)}hasCache($){return VU($)!==1}}function VM($,q,J,G){let Q=q,Y=$.ZERO,X=$.ZERO;while(J>y8||G>y8){if(J&pJ)Y=Y.add(Q);if(G&pJ)X=X.add(Q);Q=Q.double(),J>>=pJ,G>>=pJ}return{p1:Y,p2:X}}function XM($,q,J){if(q){if(q.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return QU(q),q}else return mY($,{isLE:J})}function yY($,q,J={},G){if(G===void 0)G=$==="edwards";if(!q||typeof q!=="object")throw Error(`expected valid ${$} CURVE object`);for(let W of["p","n","h"]){let V=q[W];if(!(typeof V==="bigint"&&V>y8))throw Error(`CURVE.${W} must be positive bigint`)}let Q=XM(q.p,J.Fp,G),Y=XM(q.n,J.Fn,G),U=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let W of U)if(!Q.isValid(q[W]))throw Error(`CURVE.${W} must be valid field element of CURVE.Fp`);return q=Object.freeze(Object.assign({},q)),{CURVE:q,Fp:Q,Fn:Y}}function VQ($,q){return function(G){let Q=$(G);return{secretKey:Q,publicKey:q(Q)}}}function MQ($,q){if(Uq($),Uq(q),q<0||q>4)throw Error("invalid I2OSP length: "+q);if($<0||$>2**(8*q)-1)throw Error("invalid I2OSP input: "+$);let J=Array.from({length:q}).fill(0);for(let G=q-1;G>=0;G--)J[G]=$&255,$>>>=8;return new Uint8Array(J)}function SN($,q){let J=new Uint8Array($.length);for(let G=0;G<$.length;G++)J[G]=$[G]^q[G];return J}function IN($){if(!b8($)&&typeof $!=="string")throw Error("DST must be Uint8Array or ascii string");let q=typeof $==="string"?kY($):$;if(q.length===0)throw Error("DST must be non-empty");return q}function MU($,q,J,G){if(Z$($),Uq(J),q=IN(q),q.length>255)q=G(c$(kY("H2C-OVERSIZE-DST-"),q));let{outputLen:Q,blockLen:Y}=G,X=Math.ceil(J/Q);if(J>65535||X>255)throw Error("expand_message_xmd: invalid lenInBytes");let U=c$(q,MQ(q.length,1)),W=new Uint8Array(Y),V=MQ(J,2),M=Array(X),z=G(c$(W,$,V,MQ(0,1),U));M[0]=G(c$(z,MQ(1,1),U));for(let R=1;R<X;R++){let N=[SN(z,M[R-1]),MQ(R+1,1),U];M[R]=G(c$(...N))}return c$(...M).slice(0,J)}var MM="HashToScalar-";/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var zM=($,q)=>($+($>=0?q:-q)/DM)/q;function CN($,q,J){_q("scalar",$,Wq,J);let[[G,Q],[Y,X]]=q,U=zM(X*$,J),W=zM(-Q*$,J),V=$-U*G-W*Y,M=-U*Q-W*X,z=V<Wq,D=M<Wq;if(z)V=-V;if(D)M=-M;let R=YQ(Math.ceil(m8(J)/2))+QJ;if(V<Wq||V>=R||M<Wq||M>=R)throw Error("splitScalar (endomorphism): failed for k");return{k1neg:z,k1:V,k2neg:D,k2:M}}function RU($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function zU($,q){y0($);let J={};for(let G of Object.keys(q))J[G]=$[G]===void 0?q[G]:$[G];if(gq(J.lowS,"lowS"),gq(J.prehash,"prehash"),J.format!==void 0)RU(J.format);return J}class RM extends Error{constructor($=""){super($)}}var i0={Err:RM,_tlv:{encode:($,q)=>{let{Err:J}=i0;if(Uq($,"tag"),$<0||$>255)throw new J("tlv.encode: wrong tag");if(typeof q!=="string")throw TypeError('"data" expected string, got type='+typeof q);if(q.length&1)throw new J("tlv.encode: unpadded data");let G=q.length/2,Q=GQ(G);if(Q.length/2&128)throw new J("tlv.encode: long form length too big");let Y=G>127?GQ(Q.length/2|128):"";return GQ($)+Y+Q+q},decode($,q){let{Err:J}=i0;q=Z$(q,void 0,"DER data");let G=0;if($<0||$>255)throw new J("tlv.encode: wrong tag");if(q.length<2||q[G++]!==$)throw new J("tlv.decode: wrong tlv");let Q=q[G++],Y=!!(Q&128),X=0;if(!Y)X=Q;else{let W=Q&127;if(!W)throw new J("tlv.decode(long): indefinite length not supported");if(W>4)throw new J("tlv.decode(long): byte length is too big");let V=q.subarray(G,G+W);if(V.length!==W)throw new J("tlv.decode: length bytes not complete");if(V[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let M of V)X=X<<8|M;if(G+=W,X<128)throw new J("tlv.decode(long): not minimal encoding")}let U=q.subarray(G,G+X);if(U.length!==X)throw new J("tlv.decode: wrong value length");return{v:U,l:q.subarray(G+X)}}},_int:{encode($){let{Err:q}=i0;if(vY($),$<Wq)throw new q("integer: negative integers are not allowed");let J=GQ($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new q("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:q}=i0;if($.length<1)throw new q("invalid signature integer: empty");if($[0]&128)throw new q("invalid signature integer: negative");if($.length>1&&$[0]===0&&!($[1]&128))throw new q("invalid signature integer: unnecessary leading zero");return hJ($)}},toSig($){let{Err:q,_int:J,_tlv:G}=i0,Q=Z$($,void 0,"signature"),{v:Y,l:X}=G.decode(48,Q);if(X.length)throw new q("invalid signature: left bytes after parsing");let{v:U,l:W}=G.decode(2,Y),{v:V,l:M}=G.decode(2,W);if(M.length)throw new q("invalid signature: left bytes after parsing");return{r:J.decode(U),s:J.decode(V)}},hexFromSig($){let{_tlv:q,_int:J}=i0,G=q.encode(2,J.encode($.r)),Q=q.encode(2,J.encode($.s)),Y=G+Q;return q.encode(48,Y)}};Object.freeze(i0._tlv);Object.freeze(i0._int);Object.freeze(i0);var Wq=BigInt(0),QJ=BigInt(1),DM=BigInt(2),fY=BigInt(3),EN=BigInt(4);function KM($,q={}){let J=yY("weierstrass",$,q),G=J.Fp,Q=J.Fn,Y=J.CURVE,{h:X,n:U}=Y;y0(q,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:W,allowInfinityPoint:V}=q;if(W){if(!G.is0(Y.a)||typeof W.beta!=="bigint"||!Array.isArray(W.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let M=OM(G,Q);function z(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function D(v,C,I){if(V&&C.is0())return Uint8Array.of(0);let{x:A,y:T}=C.toAffine(),L=G.toBytes(A);if(gq(I,"isCompressed"),I){z();let g=!G.isOdd(T);return c$(HM(g),L)}else return c$(Uint8Array.of(4),L,G.toBytes(T))}function R(v){Z$(v,void 0,"Point");let{publicKey:C,publicKeyUncompressed:I}=M,A=v.length,T=v[0],L=v.subarray(1);if(V&&A===1&&T===0)return{x:G.ZERO,y:G.ZERO};if(A===C&&(T===2||T===3)){let g=G.fromBytes(L);if(!G.isValid(g))throw Error("bad point: is not on curve, wrong x");let P=j(g),b;try{b=G.sqrt(P)}catch(r){let Z=r instanceof Error?": "+r.message:"";throw Error("bad point: is not on curve, sqrt error"+Z)}z();let O=G.isOdd(b);if((T&1)===1!==O)b=G.neg(b);return{x:g,y:b}}else if(A===I&&T===4){let g=G.BYTES,P=G.fromBytes(L.subarray(0,g)),b=G.fromBytes(L.subarray(g,g*2));if(!B(P,b))throw Error("bad point: is not on curve");return{x:P,y:b}}else throw Error(`bad point: got length ${A}, expected compressed=${C} or uncompressed=${I}`)}let N=q.toBytes===void 0?D:q.toBytes,w=q.fromBytes===void 0?R:q.fromBytes;function j(v){let C=G.sqr(v),I=G.mul(C,v);return G.add(G.add(I,G.mul(v,Y.a)),Y.b)}function B(v,C){let I=G.sqr(C),A=j(v);return G.eql(I,A)}if(!B(Y.Gx,Y.Gy))throw Error("bad curve params: generator point");let S=G.mul(G.pow(Y.a,fY),EN),_=G.mul(G.sqr(Y.b),BigInt(27));if(G.is0(G.add(S,_)))throw Error("bad curve params: a or b");function y(v,C,I=!1){if(!G.isValid(C)||I&&G.is0(C))throw Error(`bad point coordinate ${v}`);return C}function p(v){if(!(v instanceof m))throw Error("Weierstrass Point expected")}function F(v){if(!W||!W.basises)throw Error("no endo");return CN(v,W.basises,Q.ORDER)}function f(v,C,I,A,T){return I=new m(G.mul(I.X,v),I.Y,I.Z),C=UQ(A,C),I=UQ(T,I),C.add(I)}class m{static BASE=new m(Y.Gx,Y.Gy,G.ONE);static ZERO=new m(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=Q;X;Y;Z;constructor(v,C,I){this.X=y("x",v),this.Y=y("y",C,!0),this.Z=y("z",I),Object.freeze(this)}static CURVE(){return Y}static fromAffine(v){let{x:C,y:I}=v||{};if(!v||!G.isValid(C)||!G.isValid(I))throw Error("invalid affine point");if(v instanceof m)throw Error("projective point not allowed");if(G.is0(C)&&G.is0(I))return m.ZERO;return new m(C,I,G.ONE)}static fromBytes(v){let C=m.fromAffine(w(Z$(v,void 0,"point")));return C.assertValidity(),C}static fromHex(v){return m.fromBytes(v8(v))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(v=8,C=!0){if(l.createCache(this,v),!C)this.multiply(fY);return this}assertValidity(){let v=this;if(v.is0()){if(q.allowInfinityPoint&&G.is0(v.X)&&G.eql(v.Y,G.ONE)&&G.is0(v.Z))return;throw Error("bad point: ZERO")}let{x:C,y:I}=v.toAffine();if(!G.isValid(C)||!G.isValid(I))throw Error("bad point: x or y not field elements");if(!B(C,I))throw Error("bad point: equation left != right");if(!v.isTorsionFree())throw Error("bad point: not in prime-order subgroup")}hasEvenY(){let{y:v}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(v)}equals(v){p(v);let{X:C,Y:I,Z:A}=this,{X:T,Y:L,Z:g}=v,P=G.eql(G.mul(C,g),G.mul(T,A)),b=G.eql(G.mul(I,g),G.mul(L,A));return P&&b}negate(){return new m(this.X,G.neg(this.Y),this.Z)}double(){let{a:v,b:C}=Y,I=G.mul(C,fY),{X:A,Y:T,Z:L}=this,g=G.ZERO,P=G.ZERO,b=G.ZERO,O=G.mul(A,A),x=G.mul(T,T),r=G.mul(L,L),Z=G.mul(A,T);return Z=G.add(Z,Z),b=G.mul(A,L),b=G.add(b,b),g=G.mul(v,b),P=G.mul(I,r),P=G.add(g,P),g=G.sub(x,P),P=G.add(x,P),P=G.mul(g,P),g=G.mul(Z,g),b=G.mul(I,b),r=G.mul(v,r),Z=G.sub(O,r),Z=G.mul(v,Z),Z=G.add(Z,b),b=G.add(O,O),O=G.add(b,O),O=G.add(O,r),O=G.mul(O,Z),P=G.add(P,O),r=G.mul(T,L),r=G.add(r,r),O=G.mul(r,Z),g=G.sub(g,O),b=G.mul(r,x),b=G.add(b,b),b=G.add(b,b),new m(g,P,b)}add(v){p(v);let{X:C,Y:I,Z:A}=this,{X:T,Y:L,Z:g}=v,P=G.ZERO,b=G.ZERO,O=G.ZERO,x=Y.a,r=G.mul(Y.b,fY),Z=G.mul(C,T),o=G.mul(I,L),q$=G.mul(A,g),Y$=G.add(C,I),G$=G.add(T,L);Y$=G.mul(Y$,G$),G$=G.add(Z,o),Y$=G.sub(Y$,G$),G$=G.add(C,A);let t=G.add(T,g);return G$=G.mul(G$,t),t=G.add(Z,q$),G$=G.sub(G$,t),t=G.add(I,A),P=G.add(L,g),t=G.mul(t,P),P=G.add(o,q$),t=G.sub(t,P),O=G.mul(x,G$),P=G.mul(r,q$),O=G.add(P,O),P=G.sub(o,O),O=G.add(o,O),b=G.mul(P,O),o=G.add(Z,Z),o=G.add(o,Z),q$=G.mul(x,q$),G$=G.mul(r,G$),o=G.add(o,q$),q$=G.sub(Z,q$),q$=G.mul(x,q$),G$=G.add(G$,q$),Z=G.mul(o,G$),b=G.add(b,Z),Z=G.mul(t,G$),P=G.mul(Y$,P),P=G.sub(P,Z),Z=G.mul(Y$,o),O=G.mul(t,O),O=G.add(O,Z),new m(P,b,O)}subtract(v){return p(v),this.add(v.negate())}is0(){return this.equals(m.ZERO)}multiply(v){let{endo:C}=q;if(!Q.isValidNot0(v))throw RangeError("invalid scalar: out of range");let I,A,T=(L)=>l.cached(this,L,(g)=>lJ(m,g));if(C){let{k1neg:L,k1:g,k2neg:P,k2:b}=F(v),{p:O,f:x}=T(g),{p:r,f:Z}=T(b);A=x.add(Z),I=f(C.beta,O,r,L,P)}else{let{p:L,f:g}=T(v);I=L,A=g}return lJ(m,[I,A])[0]}multiplyUnsafe(v){let{endo:C}=q,I=this,A=v;if(!Q.isValid(A))throw RangeError("invalid scalar: out of range");if(A===Wq||I.is0())return m.ZERO;if(A===QJ)return I;if(l.hasCache(this))return this.multiply(A);if(C){let{k1neg:T,k1:L,k2neg:g,k2:P}=F(A),{p1:b,p2:O}=VM(m,I,L,P);return f(C.beta,b,O,T,g)}else return l.unsafe(I,A)}toAffine(v){let C=this,I=v,{X:A,Y:T,Z:L}=C;if(G.eql(L,G.ONE))return{x:A,y:T};let g=C.is0();if(I==null)I=g?G.ONE:G.inv(L);let P=G.mul(A,I),b=G.mul(T,I),O=G.mul(L,I);if(g)return{x:G.ZERO,y:G.ZERO};if(!G.eql(O,G.ONE))throw Error("invZ was invalid");return{x:P,y:b}}isTorsionFree(){let{isTorsionFree:v}=q;if(X===QJ)return!0;if(v)return v(m,this);return l.unsafe(this,U).is0()}clearCofactor(){let{clearCofactor:v}=q;if(X===QJ)return this;if(v)return v(m,this);return this.multiplyUnsafe(X)}isSmallOrder(){if(X===QJ)return this.is0();return this.clearCofactor().is0()}toBytes(v=!0){return gq(v,"isCompressed"),this.assertValidity(),N(m,this,v)}toHex(v=!0){return _8(this.toBytes(v))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let k=Q.BITS,l=new WQ(m,q.endo?Math.ceil(k/2):k);if(k>=8)m.BASE.precompute(8);return Object.freeze(m.prototype),Object.freeze(m),m}function HM($){return Uint8Array.of($?2:3)}function OM($,q){return{secretKey:q.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*q.BYTES}}function LN($,q={}){let{Fn:J}=$,G=q.randomBytes===void 0?k8:q.randomBytes,Q=Object.assign(OM($.Fp,J),{seed:Math.max(XU(J.ORDER),16)});function Y(R){try{let N=J.fromBytes(R);return J.isValidNot0(N)}catch(N){return!1}}function X(R,N){let{publicKey:w,publicKeyUncompressed:j}=Q;try{let B=R.length;if(N===!0&&B!==w)return!1;if(N===!1&&B!==j)return!1;return!!$.fromBytes(R)}catch(B){return!1}}function U(R){return R=R===void 0?G(Q.seed):R,GM(Z$(R,Q.seed,"seed"),J.ORDER)}function W(R,N=!0){return $.BASE.multiply(J.fromBytes(R)).toBytes(N)}function V(R){let{secretKey:N,publicKey:w,publicKeyUncompressed:j}=Q,B=J._lengths;if(!b8(R))return;let S=Z$(R,void 0,"key").length,_=S===w||S===j,y=S===N||!!B?.includes(S);if(_&&y)return;return _}function M(R,N,w=!0){if(V(R)===!0)throw Error("first arg must be private key");if(V(N)===!1)throw Error("second arg must be public key");let j=J.fromBytes(R);return $.fromBytes(N).multiply(j).toBytes(w)}let z={isValidSecretKey:Y,isValidPublicKey:X,randomSecretKey:U},D=VQ(U,W);return Object.freeze(z),Object.freeze(Q),Object.freeze({getPublicKey:W,getSharedSecret:M,keygen:D,Point:$,utils:z,lengths:Q})}function NM($,q,J={}){let G=q;Aq(G),y0(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let Q=J.randomBytes===void 0?k8:J.randomBytes,Y=J.hmac===void 0?(T,L)=>qq(G,T,L):J.hmac,{Fp:X,Fn:U}=$,{ORDER:W,BITS:V}=U,{keygen:M,getPublicKey:z,getSharedSecret:D,utils:R,lengths:N}=LN($,J),w={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},j=W*DM+QJ<X.ORDER;function B(T){let L=W>>QJ;return T>L}function S(T,L){if(!U.isValidNot0(L))throw Error(`invalid signature ${T}: out of range 1..Point.Fn.ORDER`);return L}function _(){if(j)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function y(T,L){RU(L);let g=N.signature,P=L==="compact"?g:L==="recovered"?g+1:void 0;return Z$(T,P)}class p{r;s;recovery;constructor(T,L,g){if(this.r=S("r",T),this.s=S("s",L),g!=null){if(_(),![0,1,2,3].includes(g))throw Error("invalid recovery id");this.recovery=g}Object.freeze(this)}static fromBytes(T,L=w.format){y(T,L);let g;if(L==="der"){let{r:x,s:r}=i0.toSig(Z$(T));return new p(x,r)}if(L==="recovered")g=T[0],L="compact",T=T.subarray(1);let P=N.signature/2,b=T.subarray(0,P),O=T.subarray(P,P*2);return new p(U.fromBytes(b),U.fromBytes(O),g)}static fromHex(T,L){return this.fromBytes(v8(T),L)}assertRecovery(){let{recovery:T}=this;if(T==null)throw Error("invalid recovery id: must be present");return T}addRecoveryBit(T){return new p(this.r,this.s,T)}recoverPublicKey(T){let{r:L,s:g}=this,P=this.assertRecovery(),b=P===2||P===3?L+W:L;if(!X.isValid(b))throw Error("invalid recovery id: sig.r+curve.n != R.x");let O=X.toBytes(b),x=$.fromBytes(c$(HM((P&1)===0),O)),r=U.inv(b),Z=f(Z$(T,void 0,"msgHash")),o=U.create(-Z*r),q$=U.create(g*r),Y$=$.BASE.multiplyUnsafe(o).add(x.multiplyUnsafe(q$));if(Y$.is0())throw Error("invalid recovery: point at infinify");return Y$.assertValidity(),Y$}hasHighS(){return B(this.s)}toBytes(T=w.format){if(RU(T),T==="der")return v8(i0.hexFromSig(this));let{r:L,s:g}=this,P=U.toBytes(L),b=U.toBytes(g);if(T==="recovered")return _(),c$(Uint8Array.of(this.assertRecovery()),P,b);return c$(P,b)}toHex(T){return _8(this.toBytes(T))}}Object.freeze(p.prototype),Object.freeze(p);let F=J.bits2int===void 0?function(L){if(L.length>8192)throw Error("input is too large");let g=hJ(L),P=L.length*8-V;return P>0?g>>BigInt(P):g}:J.bits2int,f=J.bits2int_modN===void 0?function(L){return U.create(F(L))}:J.bits2int_modN,m=YQ(V);function k(T){return _q("num < 2^"+V,T,Wq,m),U.toBytes(T)}function l(T,L){return Z$(T,void 0,"message"),L?Z$(G(T),void 0,"prehashed message"):T}function v(T,L,g){let{lowS:P,prehash:b,extraEntropy:O}=zU(g,w);T=l(T,b);let x=f(T),r=U.fromBytes(L);if(!U.isValidNot0(r))throw Error("invalid private key");let Z=[k(r),k(x)];if(O!=null&&O!==!1){let G$=O===!0?Q(N.secretKey):O;Z.push(Z$(G$,void 0,"extraEntropy"))}let o=c$(...Z),q$=x;function Y$(G$){let t=F(G$);if(!U.isValidNot0(t))return;let O$=U.inv(t),A$=$.BASE.multiply(t).toAffine(),S$=U.create(A$.x);if(S$===Wq)return;let y$=U.create(O$*U.create(q$+S$*r));if(y$===Wq)return;let z0=(A$.x===S$?0:2)|Number(A$.y&QJ),$q=y$;if(P&&B(y$))$q=U.neg(y$),z0^=1;return new p(S$,$q,j?void 0:z0)}return{seed:o,k2sig:Y$}}function C(T,L,g={}){let{seed:P,k2sig:b}=v(T,L,g);return iV(G.outputLen,U.BYTES,Y)(P,b).toBytes(g.format)}function I(T,L,g,P={}){let{lowS:b,prehash:O,format:x}=zU(P,w);if(g=Z$(g,void 0,"publicKey"),L=l(L,O),!b8(T)){let r=T instanceof p?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+r)}y(T,x);try{let r=p.fromBytes(T,x),Z=$.fromBytes(g);if(b&&r.hasHighS())return!1;let{r:o,s:q$}=r,Y$=f(L),G$=U.inv(q$),t=U.create(Y$*G$),O$=U.create(o*G$),A$=$.BASE.multiplyUnsafe(t).add(Z.multiplyUnsafe(O$));if(A$.is0())return!1;return U.create(A$.x)===o}catch(r){return!1}}function A(T,L,g={}){let{prehash:P}=zU(g,w);return L=l(L,P),p.fromBytes(T,"recovered").recoverPublicKey(L).toBytes()}return Object.freeze({keygen:M,getPublicKey:z,getSharedSecret:D,utils:R,lengths:N,Point:$,sign:C,verify:I,recoverPublicKey:A,Signature:p,hash:G})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var PN=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))();var FN=KM(PN),f8=NM(FN,L$);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var YJ=BigInt(0),Z0=BigInt(1),DU=BigInt(2),gN=BigInt(8);function _N($,q,J,G){let Q=$.sqr(J),Y=$.sqr(G),X=$.add($.mul(q.a,Q),Y),U=$.add($.ONE,$.mul(q.d,$.mul(Q,Y)));return $.eql(X,U)}function wM($,q={}){let J=q,G=yY("edwards",$,J,J.FpFnLE),{Fp:Q,Fn:Y}=G,X=G.CURVE,{h:U}=X;y0(J,{},{uvRatio:"function"});let W=DU<<BigInt(Y.BYTES*8)-Z0,V=(w)=>Q.create(w),M=J.uvRatio===void 0?(w,j)=>{try{return{isValid:!0,value:Q.sqrt(Q.div(w,j))}}catch(B){return{isValid:!1,value:YJ}}}:J.uvRatio;if(!_N(Q,X,X.Gx,X.Gy))throw Error("bad curve params: generator point");function z(w,j,B=!1){let S=B?Z0:YJ;return _q("coordinate "+w,j,S,W),j}function D(w){if(!(w instanceof R))throw Error("EdwardsPoint expected")}class R{static BASE=new R(X.Gx,X.Gy,Z0,V(X.Gx*X.Gy));static ZERO=new R(YJ,Z0,Z0,YJ);static Fp=Q;static Fn=Y;X;Y;Z;T;constructor(w,j,B,S){this.X=z("x",w),this.Y=z("y",j),this.Z=z("z",B,!0),this.T=z("t",S),Object.freeze(this)}static CURVE(){return X}static fromAffine(w){if(w instanceof R)throw Error("extended point not allowed");let{x:j,y:B}=w||{};return z("x",j),z("y",B),new R(j,B,Z0,V(j*B))}static fromBytes(w,j=!1){let B=Q.BYTES,{a:S,d:_}=X;w=GJ(Z$(w,B,"point")),gq(j,"zip215");let y=GJ(w),p=w[B-1];y[B-1]=p&-129;let F=r0(y),f=j?W:Q.ORDER;_q("point.y",F,YJ,f);let m=V(F*F),k=V(m-Z0),l=V(_*m-S),{isValid:v,value:C}=M(k,l);if(!v)throw Error("bad point: invalid y coordinate");let I=(C&Z0)===Z0,A=(p&128)!==0;if(!j&&C===YJ&&A)throw Error("bad point: x=0 and x_0=1");if(A!==I)C=V(-C);return R.fromAffine({x:C,y:F})}static fromHex(w,j=!1){return R.fromBytes(v8(w),j)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(w=8,j=!0){if(N.createCache(this,w),!j)this.multiply(DU);return this}assertValidity(){let w=this,{a:j,d:B}=X;if(w.is0())throw Error("bad point: ZERO");let{X:S,Y:_,Z:y,T:p}=w,F=V(S*S),f=V(_*_),m=V(y*y),k=V(m*m),l=V(F*j),v=V(m*V(l+f)),C=V(k+V(B*V(F*f)));if(v!==C)throw Error("bad point: equation left != right (1)");let I=V(S*_),A=V(y*p);if(I!==A)throw Error("bad point: equation left != right (2)")}equals(w){D(w);let{X:j,Y:B,Z:S}=this,{X:_,Y:y,Z:p}=w,F=V(j*p),f=V(_*S),m=V(B*p),k=V(y*S);return F===f&&m===k}is0(){return this.equals(R.ZERO)}negate(){return new R(V(-this.X),this.Y,this.Z,V(-this.T))}double(){let{a:w}=X,{X:j,Y:B,Z:S}=this,_=V(j*j),y=V(B*B),p=V(DU*V(S*S)),F=V(w*_),f=j+B,m=V(V(f*f)-_-y),k=F+y,l=k-p,v=F-y,C=V(m*l),I=V(k*v),A=V(m*v),T=V(l*k);return new R(C,I,T,A)}add(w){D(w);let{a:j,d:B}=X,{X:S,Y:_,Z:y,T:p}=this,{X:F,Y:f,Z:m,T:k}=w,l=V(S*F),v=V(_*f),C=V(p*B*k),I=V(y*m),A=V((S+_)*(F+f)-l-v),T=I-C,L=I+C,g=V(v-j*l),P=V(A*T),b=V(L*g),O=V(A*g),x=V(T*L);return new R(P,b,x,O)}subtract(w){return D(w),this.add(w.negate())}multiply(w){if(!Y.isValidNot0(w))throw RangeError("invalid scalar: expected 1 <= sc < curve.n");let{p:j,f:B}=N.cached(this,w,(S)=>lJ(R,S));return lJ(R,[j,B])[0]}multiplyUnsafe(w){if(!Y.isValid(w))throw RangeError("invalid scalar: expected 0 <= sc < curve.n");if(w===YJ)return R.ZERO;if(this.is0()||w===Z0)return this;return N.unsafe(this,w,(j)=>lJ(R,j))}isSmallOrder(){return this.clearCofactor().is0()}isTorsionFree(){return N.unsafe(this,X.n).is0()}toAffine(w){let j=this,B=w,{X:S,Y:_,Z:y}=j,p=j.is0();if(B==null)B=p?gN:Q.inv(y);let F=V(S*B),f=V(_*B),m=Q.mul(y,B);if(p)return{x:YJ,y:Z0};if(m!==Z0)throw Error("invZ was invalid");return{x:F,y:f}}clearCofactor(){if(U===Z0)return this;return this.multiplyUnsafe(U)}toBytes(){let{x:w,y:j}=this.toAffine(),B=Q.toBytes(j);return B[B.length-1]|=w&Z0?128:0,B}toHex(){return _8(this.toBytes())}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let N=new WQ(R,Y.BITS);if(Y.BITS>=8)R.BASE.precompute(8);return Object.freeze(R.prototype),Object.freeze(R),R}class KU{static BASE;static ZERO;static Fp;static Fn;ep;constructor($){this.ep=$}static fromBytes($){JU()}static fromHex($){JU()}get x(){return this.toAffine().x}get y(){return this.toAffine().y}clearCofactor(){return this}assertValidity(){this.ep.assertValidity()}toAffine($){return this.ep.toAffine($)}toHex(){return _8(this.toBytes())}toString(){return this.toHex()}isTorsionFree(){return!0}isSmallOrder(){return!1}add($){return this.assertSame($),this.init(this.ep.add($.ep))}subtract($){return this.assertSame($),this.init(this.ep.subtract($.ep))}multiply($){return this.init(this.ep.multiply($))}multiplyUnsafe($){return this.init(this.ep.multiplyUnsafe($))}double(){return this.init(this.ep.double())}negate(){return this.init(this.ep.negate())}precompute($,q){return this.ep.precompute($,q),this}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var zQ=BigInt(0),x8=BigInt(1),xY=BigInt(2);function vN($){return y0($,{P:"bigint",type:"string",adjustScalarBytes:"function",powPminus2:"function"},{randomBytes:"function"}),Object.freeze({...$})}function jM($){let q=vN($),{P:J,type:G,adjustScalarBytes:Q,powPminus2:Y,randomBytes:X}=q,U=G==="x25519";if(!U&&G!=="x448")throw Error("invalid type");let W=X===void 0?k8:X,V=U?255:448,M=U?32:56,z=U?BigInt(9):BigInt(5),D=U?BigInt(121665):BigInt(39081),R=U?xY**BigInt(254):xY**BigInt(447),N=U?BigInt(8)*xY**BigInt(251)-x8:BigInt(4)*xY**BigInt(445)-x8,w=R+N+x8,j=(A)=>B$(A,J),B=S(z);function S(A){return QQ(j(A),M)}function _(A){let T=GJ(Z$(A,M,"uCoordinate"));if(U)T[31]&=127;return j(r0(T))}function y(A){return r0(Q(GJ(Z$(A,M,"scalar"))))}function p(A,T){let L=l(_(T),y(A));if(L===zQ)throw Error("invalid private or public key received");return S(L)}function F(A){return p(A,B)}let f=F,m=p;function k(A,T,L){let g=j(A*(T-L));return T=j(T-g),L=j(L+g),{x_2:T,x_3:L}}function l(A,T){_q("u",A,zQ,J),_q("scalar",T,R,w);let L=T,g=A,P=x8,b=zQ,O=A,x=x8,r=zQ;for(let o=BigInt(V-1);o>=zQ;o--){let q$=L>>o&x8;r^=q$,{x_2:P,x_3:O}=k(r,P,O),{x_2:b,x_3:x}=k(r,b,x),r=q$;let Y$=P+b,G$=j(Y$*Y$),t=P-b,O$=j(t*t),A$=G$-O$,S$=O+x,y$=O-x,z0=j(y$*Y$),$q=j(S$*t),uq=z0+$q,pq=z0-$q;O=j(uq*uq),x=j(g*j(pq*pq)),P=j(G$*O$),b=j(A$*(G$+j(D*A$)))}({x_2:P,x_3:O}=k(r,P,O)),{x_2:b,x_3:x}=k(r,b,x);let Z=Y(b);return j(P*Z)}let v={secretKey:M,publicKey:M,seed:M},C=(A)=>{return A=A===void 0?W(M):A,Z$(A,v.seed,"seed"),A},I={randomSecretKey:C};return Object.freeze(v),Object.freeze(I),Object.freeze({keygen:VQ(C,f),getSharedSecret:m,getPublicKey:f,scalarMult:p,scalarMultBase:F,utils:I,GuBytes:B.slice(),lengths:v})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var bN=BigInt(0),bq=BigInt(1),AM=BigInt(2),kN=BigInt(3),mN=BigInt(5),yN=BigInt(8),iJ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),wU=(()=>({p:iJ,n:BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),h:yN,a:BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),d:BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),Gx:BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),Gy:BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")}))();function TM($){let q=BigInt(10),J=BigInt(20),G=BigInt(40),Q=BigInt(80),Y=iJ,U=$*$%Y*$%Y,W=f0(U,AM,Y)*U%Y,V=f0(W,bq,Y)*$%Y,M=f0(V,mN,Y)*V%Y,z=f0(M,q,Y)*M%Y,D=f0(z,J,Y)*z%Y,R=f0(D,G,Y)*D%Y,N=f0(R,Q,Y)*R%Y,w=f0(N,Q,Y)*R%Y,j=f0(w,q,Y)*M%Y;return{pow_p_5_8:f0(j,AM,Y)*$%Y,b2:U}}function fN($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var HU=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");function jU($,q){let J=iJ,G=B$(q*q*q,J),Q=B$(G*G*q,J),Y=TM($*Q).pow_p_5_8,X=B$($*G*Y,J),U=B$(q*X*X,J),W=X,V=B$(X*HU,J),M=U===$,z=U===B$(-$,J),D=U===B$(-$*HU,J);if(M)X=W;if(z||D)X=V;if(vq(X,J))X=B$(-X,J);return{isValid:M||z,value:X}}var rJ=wM(wU,{uvRatio:jU}),XJ=(()=>rJ.Fp)(),SM=(()=>rJ.Fn)();var hY=(()=>{let $=iJ;return jM({P:$,type:"x25519",powPminus2:(q)=>{let{pow_p_5_8:J,b2:G}=TM(q);return B$(f0(J,kN,$)*G,$)},adjustScalarBytes:fN})})();var OU=HU,xN=BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"),hN=BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"),uN=BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"),pN=BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"),ZM=($)=>jU(bq,$),lN=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),NU=($)=>XJ.create(r0($)&lN);function BM($){let{d:q}=wU,J=iJ,G=(B)=>XJ.create(B),Q=G(OU*$*$),Y=G((Q+bq)*uN),X=BigInt(-1),U=G((X-q*Q)*G(Q+q)),{isValid:W,value:V}=jU(Y,U),M=G(V*$);if(!vq(M,J))M=G(-M);if(!W)V=M;if(!W)X=Q;let z=G(X*(Q-bq)*pN-U),D=V*V,R=G((V+V)*U),N=G(z*xN),w=G(bq-D),j=G(bq+D);return new rJ(G(R*j),G(w*N),G(N*j),G(R*w))}class H0 extends KU{static BASE=(()=>new H0(rJ.BASE))();static ZERO=(()=>new H0(rJ.ZERO))();static Fp=(()=>XJ)();static Fn=(()=>SM)();constructor($){super($)}static fromAffine($){return new H0(rJ.fromAffine($))}assertSame($){if(!($ instanceof H0))throw Error("RistrettoPoint expected")}init($){return new H0($)}static fromBytes($){u$($,32);let{a:q,d:J}=wU,G=iJ,Q=(_)=>XJ.create(_),Y=NU($);if(!rV(XJ.toBytes(Y),$)||vq(Y,G))throw Error("invalid ristretto255 encoding 1");let X=Q(Y*Y),U=Q(bq+q*X),W=Q(bq-q*X),V=Q(U*U),M=Q(W*W),z=Q(q*J*V-M),{isValid:D,value:R}=ZM(Q(z*M)),N=Q(R*W),w=Q(R*N*z),j=Q((Y+Y)*N);if(vq(j,G))j=Q(-j);let B=Q(U*w),S=Q(j*B);if(!D||vq(S,G)||B===bN)throw Error("invalid ristretto255 encoding 2");return new H0(new rJ(j,B,bq,S))}static fromHex($){return H0.fromBytes(gG($))}toBytes(){let{X:$,Y:q,Z:J,T:G}=this.ep,Q=iJ,Y=(w)=>XJ.create(w),X=Y(Y(J+q)*Y(J-q)),U=Y($*q),W=Y(U*U),{value:V}=ZM(Y(X*W)),M=Y(V*X),z=Y(V*U),D=Y(M*z*G),R;if(vq(G*D,Q)){let w=Y(q*OU),j=Y($*OU);$=w,q=j,R=Y(M*hN)}else R=z;if(vq($*D,Q))q=Y(-q);let N=Y((J-q)*R);if(vq(N,Q))N=Y(-N);return XJ.toBytes(N)}equals($){this.assertSame($);let{X:q,Y:J}=this.ep,{X:G,Y:Q}=$.ep,Y=(W)=>XJ.create(W),X=Y(q*Q)===Y(J*G),U=Y(J*Q)===Y(q*G);return X||U}is0(){return this.equals(H0.ZERO)}}Object.freeze(H0.BASE);Object.freeze(H0.ZERO);Object.freeze(H0.prototype);Object.freeze(H0);var rN=Object.freeze({Point:H0,hashToCurve($,q){let J=q?.DST===void 0?"ristretto255_XMD:SHA-512_R255MAP_RO_":q.DST,G=MU($,J,64,QY);return rN.deriveToCurve(G)},hashToScalar($,q={DST:MM}){let J=MU($,q.DST,64,QY);return SM.create(r0(J))},deriveToCurve($){u$($,64);let q=NU($.subarray(0,32)),J=BM(q),G=NU($.subarray(32,64)),Q=BM(G);return new H0(J.add(Q))}});var IM=!1,iN=!1;async function CM($,q){if(iN)return await q();try{return await $()}catch(J){if(J instanceof ReferenceError||J instanceof DOMException&&J.name==="NotSupportedError")return await q();else throw J}}async function uY($,q){return await CM(async()=>{let J=AU($)?$:await cN($),G=await crypto.subtle.importKey("raw",nN(q),{name:"X25519"},IM,[]);return new Uint8Array(await crypto.subtle.deriveBits({name:"X25519",public:G},J,256))},()=>{if(AU($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return hY.scalarMult($,q)})}async function RQ($){return await CM(async()=>{return uY($,hY.GuBytes)},()=>{if(AU($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return hY.scalarMultBase($)})}var dN=new Uint8Array([48,46,2,1,0,48,5,6,3,43,101,110,4,34,4,32]);async function cN($){if($.length!==32)throw Error("X25519 private key must be 32 bytes");let q=new Uint8Array([...dN,...$]);return crypto.subtle.importKey("pkcs8",q,{name:"X25519"},IM,["deriveBits"])}function AU($){return typeof CryptoKey<"u"&&$ instanceof CryptoKey}function nN($){return $}class ZU{s;transcript=[];buf=new Uint8Array(0);constructor($){this.s=$.getReader()}async readLine(){let $=[];while(!0){let q=this.buf.indexOf(10);if(q>=0)return $.push(this.buf.subarray(0,q)),this.transcript.push(this.buf.subarray(0,q+1)),this.buf=this.buf.subarray(q+1),aN(dJ($));if(this.buf.length>0)$.push(this.buf),this.transcript.push(this.buf);let J=await this.s.read();if(J.done)return this.buf=dJ($),null;this.buf=J.value}}close(){return this.s.releaseLock(),{rest:this.buf,transcript:dJ(this.transcript)}}}function aN($){return $.forEach((q)=>{if(q<32||q>126)throw Error("invalid non-ASCII byte in header")}),new TextDecoder().decode($)}function dJ($){let q=$.reduce((Q,Y)=>Q+Y.length,0),J=new Uint8Array(q),G=0;for(let Q of $)J.set(Q,G),G+=Q.length;return J}function h8($,...q){return $.pipeThrough(new TransformStream({start(J){for(let G of q)J.enqueue(G)}}))}function pY($){return new ReadableStream({start(q){q.enqueue($),q.close()}})}async function BU($){if(!($ instanceof ReadableStream))throw Error("readAll expects a ReadableStream<Uint8Array>");return new Uint8Array(await new Response($).arrayBuffer())}async function EM($){if(!($ instanceof ReadableStream))throw Error("readAllString expects a ReadableStream<Uint8Array>");return await new Response($).text()}async function LM($,q){let J=$.getReader(),G=[],Q=0;while(Q<q){let{done:W,value:V}=await J.read();if(W)throw Error("stream ended before reading "+q.toString()+" bytes");G.push(V),Q+=V.length}J.releaseLock();let Y=dJ(G),X=Y.subarray(0,q),U=h8($,Y.subarray(q));return{data:X,rest:U}}class Vq{args;body;constructor($,q){this.args=$,this.body=q}}async function sN($){let q=await $.readLine();if(q===null)throw Error("invalid stanza");let J=q.split(" ");if(J.length<2||J.shift()!=="->")return{next:q};for(let Y of J)if(Y.length===0)throw Error("invalid stanza");let G=[];for(;;){let Y=await $.readLine();if(Y===null)throw Error("invalid stanza");let X=$0.decode(Y);if(X.length>48)throw Error("invalid stanza");if(G.push(X),X.length<48)break}let Q=dJ(G);return{s:new Vq(J,Q)}}async function PM($){let q=new ZU($),J=await q.readLine();if(J!=="age-encryption.org/v1")throw Error("invalid version "+(J??"line"));let G=[];for(;;){let{s:Q,next:Y}=await sN(q);if(Q!==void 0){G.push(Q);continue}if(!Y.startsWith("--- "))throw Error("invalid header");let X=$0.decode(Y.slice(4)),{rest:U,transcript:W}=q.close(),V=W.slice(0,W.length-1-Y.length+3);return{stanzas:G,headerNoMAC:V,MAC:X,headerSize:W.length,rest:h8($,U)}}}function TU($){let q=[];q.push(`age-encryption.org/v1
 `);for(let J of $){q.push("-> "+J.args.join(" ")+`
 `);for(let G=0;G<J.body.length;G+=48){let Q=G+48;if(Q>J.body.length)Q=J.body.length;q.push($0.encode(J.body.subarray(G,Q))+`
 `)}if(J.body.length%48===0)q.push(`

package/dist/index.js CHANGED Viewed

@@ -53,7 +53,7 @@ return `+str.trim()+`;
 `).join(`
 `+Y),$.push(Q+"m+"+SY.exports.humanize(this.diff)+"\x1B[0m")}else $[0]=bA()+q+" "+$[0]}function bA(){if(nM.inspectOpts.hideDate)return"";return new Date().toISOString()+" "}function kA(...$){return process.stderr.write(TY.formatWithOptions(nM.inspectOpts,...$)+`
 `)}function mA($){if($)process.env.DEBUG=$;else delete process.env.DEBUG}function yA(){return process.env.DEBUG}function fA($){$.inspectOpts={};let q=Object.keys(nM.inspectOpts);for(let J=0;J<q.length;J++)$.inspectOpts[q[J]]=nM.inspectOpts[q[J]]}SY.exports=bX()(nM);var{formatters:cM}=SY.exports;cM.o=function($){return this.inspectOpts.colors=this.useColors,TY.inspect($,this.inspectOpts).split(`
-`).map((q)=>q.trim()).join(" ")};cM.O=function($){return this.inspectOpts.colors=this.useColors,TY.inspect($,this.inspectOpts)}});var sM=X$((nv,yX)=>{if(typeof process>"u"||process.type==="renderer"||!1||process.__nwjs)yX.exports=uM();else yX.exports=aM()});var oz=X$((Zy,nz)=>{var bY=Object.prototype.hasOwnProperty,cz=Object.prototype.toString,uz=Object.defineProperty,pz=Object.getOwnPropertyDescriptor,lz=function(q){if(typeof Array.isArray==="function")return Array.isArray(q);return cz.call(q)==="[object Array]"},rz=function(q){if(!q||cz.call(q)!=="[object Object]")return!1;var J=bY.call(q,"constructor"),G=q.constructor&&q.constructor.prototype&&bY.call(q.constructor.prototype,"isPrototypeOf");if(q.constructor&&!J&&!G)return!1;var Q;for(Q in q);return typeof Q>"u"||bY.call(q,Q)},iz=function(q,J){if(uz&&J.name==="__proto__")uz(q,J.name,{enumerable:!0,configurable:!0,value:J.newValue,writable:!0});else q[J.name]=J.newValue},dz=function(q,J){if(J==="__proto__"){if(!bY.call(q,J))return;else if(pz)return pz(q,J).value}return q[J]};nz.exports=function $(){var q,J,G,Q,Y,X,U=arguments[0],W=1,V=arguments.length,M=!1;if(typeof U==="boolean")M=U,U=arguments[1]||{},W=2;if(U==null||typeof U!=="object"&&typeof U!=="function")U={};for(;W<V;++W)if(q=arguments[W],q!=null){for(J in q)if(G=dz(U,J),Q=dz(q,J),U!==Q){if(M&&Q&&(rz(Q)||(Y=lz(Q)))){if(Y)Y=!1,X=G&&lz(G)?G:[];else X=G&&rz(G)?G:{};iz(U,{name:J,newValue:$(M,X,Q)})}else if(typeof Q<"u")iz(U,{name:J,newValue:Q})}}return U}});import{access as bI,chmod as _U,mkdir as DD,readFile as HD,writeFile as KD}from"fs/promises";import{dirname as kI,join as bU}from"path";import{fileURLToPath as mI}from"url";var sQ={name:"@rizom/ops",description:"Operator CLI for managing private brain fleet registry repos",publishConfig:{access:"public"},version:"0.2.0-alpha.132",type:"module",exports:{".":{types:"./dist/index.d.ts",import:"./dist/index.js"},"./deploy":{bun:"./dist/deploy.js",types:"./dist/deploy.d.ts",import:"./dist/deploy.js"}},main:"./dist/index.js",types:"./dist/index.d.ts",bin:{"brains-ops":"./dist/brains-ops.js"},files:["dist","templates"],scripts:{build:"bun scripts/build.ts",prepublishOnly:"bun scripts/build.ts",typecheck:"tsc --noEmit",lint:"eslint . --ext .ts","lint:fix":"eslint . --ext .ts --fix",test:"bun run build && bun test --timeout 20000","test:smoke":"bun run build && RUN_SMOKE_TESTS=1 bun test --timeout 60000"},dependencies:{"age-encryption":"^0.3.0"},devDependencies:{"@brains/deploy-support":"workspace:*","@brains/eslint-config":"workspace:*","@brains/typescript-config":"workspace:*","@brains/utils":"workspace:*","@types/bun":"latest",typescript:"^5.3.3"},repository:{type:"git",url:"https://github.com/rizom-ai/brains.git",directory:"packages/brains-ops"},license:"Apache-2.0",author:"Yeehaa <yeehaa@rizom.ai> (https://rizom.ai)",homepage:"https://github.com/rizom-ai/brains/tree/main/packages/brains-ops#readme",bugs:"https://github.com/rizom-ai/brains/issues",engines:{bun:">=1.3.3"},keywords:["brains","ops","cli","deploy","fleet","operator"]};var r7=`ARG BUN_VERSION=1.3.10
+`).map((q)=>q.trim()).join(" ")};cM.O=function($){return this.inspectOpts.colors=this.useColors,TY.inspect($,this.inspectOpts)}});var sM=X$((nv,yX)=>{if(typeof process>"u"||process.type==="renderer"||!1||process.__nwjs)yX.exports=uM();else yX.exports=aM()});var oz=X$((Zy,nz)=>{var bY=Object.prototype.hasOwnProperty,cz=Object.prototype.toString,uz=Object.defineProperty,pz=Object.getOwnPropertyDescriptor,lz=function(q){if(typeof Array.isArray==="function")return Array.isArray(q);return cz.call(q)==="[object Array]"},rz=function(q){if(!q||cz.call(q)!=="[object Object]")return!1;var J=bY.call(q,"constructor"),G=q.constructor&&q.constructor.prototype&&bY.call(q.constructor.prototype,"isPrototypeOf");if(q.constructor&&!J&&!G)return!1;var Q;for(Q in q);return typeof Q>"u"||bY.call(q,Q)},iz=function(q,J){if(uz&&J.name==="__proto__")uz(q,J.name,{enumerable:!0,configurable:!0,value:J.newValue,writable:!0});else q[J.name]=J.newValue},dz=function(q,J){if(J==="__proto__"){if(!bY.call(q,J))return;else if(pz)return pz(q,J).value}return q[J]};nz.exports=function $(){var q,J,G,Q,Y,X,U=arguments[0],W=1,V=arguments.length,M=!1;if(typeof U==="boolean")M=U,U=arguments[1]||{},W=2;if(U==null||typeof U!=="object"&&typeof U!=="function")U={};for(;W<V;++W)if(q=arguments[W],q!=null){for(J in q)if(G=dz(U,J),Q=dz(q,J),U!==Q){if(M&&Q&&(rz(Q)||(Y=lz(Q)))){if(Y)Y=!1,X=G&&lz(G)?G:[];else X=G&&rz(G)?G:{};iz(U,{name:J,newValue:$(M,X,Q)})}else if(typeof Q<"u")iz(U,{name:J,newValue:Q})}}return U}});import{access as bI,chmod as _U,mkdir as DD,readFile as HD,writeFile as KD}from"fs/promises";import{dirname as kI,join as bU}from"path";import{fileURLToPath as mI}from"url";var sQ={name:"@rizom/ops",description:"Operator CLI for managing private brain fleet registry repos",publishConfig:{access:"public"},version:"0.2.0-alpha.134",type:"module",exports:{".":{types:"./dist/index.d.ts",import:"./dist/index.js"},"./deploy":{bun:"./dist/deploy.js",types:"./dist/deploy.d.ts",import:"./dist/deploy.js"}},main:"./dist/index.js",types:"./dist/index.d.ts",bin:{"brains-ops":"./dist/brains-ops.js"},files:["dist","templates"],scripts:{build:"bun scripts/build.ts",prepublishOnly:"bun scripts/build.ts",typecheck:"tsc --noEmit",lint:"eslint . --ext .ts","lint:fix":"eslint . --ext .ts --fix",test:"bun run build && bun test --timeout 20000","test:smoke":"bun run build && RUN_SMOKE_TESTS=1 bun test --timeout 60000"},dependencies:{"age-encryption":"^0.3.0"},devDependencies:{"@brains/deploy-support":"workspace:*","@brains/eslint-config":"workspace:*","@brains/typescript-config":"workspace:*","@brains/utils":"workspace:*","@types/bun":"latest",typescript:"^5.3.3"},repository:{type:"git",url:"https://github.com/rizom-ai/brains.git",directory:"packages/brains-ops"},license:"Apache-2.0",author:"Yeehaa <yeehaa@rizom.ai> (https://rizom.ai)",homepage:"https://github.com/rizom-ai/brains/tree/main/packages/brains-ops#readme",bugs:"https://github.com/rizom-ai/brains/issues",engines:{bun:">=1.3.3"},keywords:["brains","ops","cli","deploy","fleet","operator"]};var r7=`ARG BUN_VERSION=1.3.10
 FROM oven/bun:\${BUN_VERSION}-slim AS runtime
 WORKDIR /app

package/package.json CHANGED Viewed

@@ -4,7 +4,7 @@
   "publishConfig": {
     "access": "public"
   },
-  "version": "0.2.0-alpha.132",
+  "version": "0.2.0-alpha.134",
   "type": "module",
   "exports": {
     ".": {

package/templates/rover-pilot/docs/user-onboarding.md CHANGED Viewed

@@ -1,217 +1,119 @@
 # Welcome to Rover
-Rover is your own AI. Not a chatbot you share with the rest of the
-world — a private assistant deployed just for you, that holds your
-notes, links, and ideas, and gets more useful the more you put into
-it.
+---
-This guide walks you through your first days. You don't need
-experience with any particular tools — if you can use a browser, you
-can use Rover.
+Most of us have more thinking happening than we can hold onto. Ideas show up in the wrong moment, notes land in five different places, and half of what you've figured out is effectively invisible by the time you need it again.
-## Get in and say hello
+Rover is built for that problem. It's a private space where your thinking accumulates — notes, links, fragments, half-formed ideas — and an AI that can work with all of it. Find things you saved months ago. Connect dots across topics. Turn a rough note into a draft. The more you put in, the more useful it gets. And if another Rover user is in your network, your Rovers can talk to each other — share knowledge, work on something together — just by asking.
-1. **Open the setup email** we sent you and click the setup link.
-2. **Register a passkey** — your browser will offer fingerprint,
-   face, or PIN. This becomes how you sign in; there is no password.
-3. **Open your chat**: `https://<handle>.rizom.ai/chat` — sign in
-   with the passkey you just made.
-4. **Say hello.** Ask Rover:
+---
-   > What can you help me do?
+## What Rover is
-That's the whole setup. The chat in your browser is where you and
-Rover will spend most of your time.
+Rover is your private knowledge companion. It holds your notes, links, and ideas — and helps you think with them, not just store them.
-One caution: the setup link works once and then expires. Don't
-forward it, and if it has already expired when you click it, just
-tell us — we'll send a fresh one.
+Ask it a question and it searches what you've saved. Give it a fragment of thinking and it can help you turn it into something.
-## What your Rover holds
+---
-Everything in Rover is one of a few simple kinds of things:
+## Getting in
-- **Notes** — thoughts, ideas, observations in your own words.
-- **Links** — things from the web, saved with why they matter to you.
-- **Documents** — files you drop into chat: Markdown, PDFs, images.
-- **Topics** — the themes running through your material. You don't
-  create these; Rover notices them.
-- **Wishes** — things you asked for that Rover can't do yet.
-- **Agents** — other people's brains, saved to your directory so you
-  can ask them things.
+We'll send you a personal URL — something like `https://<handle>.rizom.ai/`.
-You'll meet each of these as you go. The first three you put in; the
-last three grow out of how you use it.
+When you open it for the first time, you'll be asked to set a passkey. Do that once and you're in. No passwords to remember.
-## The way of working
+From there, your three main interfaces are:
-Rover is built around a simple loop:
+- **Chat** (`/chat`) — where you talk to Rover
+- **Dashboard** (`/`) — an overview of your Rover
+- **CMS** (`/cms`) — a browser editor for your content
-**Capture → ask back → shape.**
+Start with Chat. Everything else follows from there.
-What makes it work: every note, link, and document you hand Rover
-lands in one connected memory. Rover reads what you save, links it
-to what's already there, and notices the topics running through it.
-Nothing sits in a folder waiting to be found — every capture makes
-the next answer better. Ten notes in, Rover is a notebook; a hundred
-notes in, it starts knowing how you think.
+---
-The important part is what you _don't_ do: you don't organize. No
-folders, no tags, no filing things in the right place. You throw
-material in as it comes, and Rover makes sense of it when you need
-it.
+## Your first five minutes
-### Capture
+1. Open your Chat URL. A good first message:
+   > Help me save my first note.
+2. Save something — a thought, a link, an idea. Doesn't need to be polished.
+3. Ask Rover about it. See what comes back.
-Notes for what's in your head:
+That loop — save, ask, get something useful back — is the core of how Rover works.
-> Save a note: I keep explaining the same idea to clients — maybe
-> it should be a workshop.
+---
-Links for what's on your screen:
+## The Chat and the CMS: when to use which
-> Save this link with my workshop idea — it's how someone else
-> structures theirs: https://example.com
+**Chat** is for thinking out loud, asking questions, saving things quickly, and using Rover as a day-to-day thinking partner.
-Documents for what you already have: drop a Markdown file, a PDF, or
-an image into the chat and ask Rover to save or import it. If you
-have notes living somewhere else, this is the fastest way to give
-Rover a head start.
+**CMS** is for when you want to deliberately create or edit content — browsing your notes, making clean edits, working more like an editor than a conversationalist.
-### Ask back
+Most people spend most of their time in Chat. The CMS becomes useful once you have something worth editing.
-Ask in whatever words occur to you — Rover searches by meaning, not
-exact phrases, so you don't have to remember what you called
-something:
+---
-> What have I added about the workshop idea?
+## Other ways to chat with Rover
+`/chat` is the primary interface, but Rover can also be reached through messaging platforms. Discord is tested and working. Slack, WhatsApp Business, and similar should work out of the box — we'll send setup steps if that's part of your configuration.
-> What did I save this week?
+**Talking to another Rover**
+If you know another Rover user, you can add them to your contacts and call their Rover directly from your chat.
+- To add: *Add jane.rizom.ai to my contacts.*
+- To call: *Call jane.rizom.ai and ask [your question].*
+You'll need their address — in the format `name.rizom.ai` — which they can share with you directly.
+---
+## Connecting Rover to other tools
+Rover can connect to external tools via MCP — a standard protocol that works in two directions: agentic AI clients (like Claude Desktop) can use it to talk to Rover, and Rover can use it to talk to productivity tools like Notion or Linear.
+Plugins exist for a number of tools already, and new ones can be built quickly in response to what you actually need. If there's a tool you'd want Rover to connect to, tell us.
+If MCP is part of your setup, we'll send specific instructions alongside your URL.
+---
+## A few common questions
+**How do I access my data?**
+Your primary interface is the CMS (`/cms`), where you can browse and edit everything you've saved. If you're set up with GitHub access, your content also lives in a private repository you can access directly.
+**Does Rover connect to the internet?**
+No — and that's intentional. Rover works with what you've put into it, not with whatever the internet currently says. That means its answers are grounded in your actual knowledge base, not in generic search results.
+**What does this cost?**
+Nothing during the pilot. We cover hosting costs while you're part of the programme.
+---
-And as material accumulates, the topics surface — the themes you
-keep returning to without noticing:
+## This is a pilot
-> What themes do you see in what I've collected?
+Rover works. But it's not finished.
-### Shape
+You'll hit rough edges. Some things you try won't work. Some things you expect to be there won't be yet. That's normal — and it's actually why you're here.
-When you want to make something from what you've gathered:
+There's a ceiling on how much Rover can improve without real people using it on real problems. We've reached that ceiling on our own. Your usage is what lets the product become what it's capable of becoming. A single Rover in isolation can only do so much — the network only becomes real when there are enough active, populated Rovers in it.
-> Turn my workshop notes into a one-page outline.
+Rover has a built-in wishlist. If you ask it to do something it can't do yet, it should tell you clearly and log the request — that goes back to us as a signal for where the product needs to go next.
-> Make a reading list from the links I saved.
+When something breaks or falls short, tell us: what you were trying to do, what you expected, and what happened instead.
-Capture is cheap, asking back is instant, and shaping turns a pile
-of fragments into something you can use. That loop is Rover — and it
-only proves itself on real material, so start with things you
-actually want to keep.
+---
-## When Rover can't do something: make a wish
+## Your access details
-Sooner or later you'll ask for something Rover can't do yet. That's
-where wishes come from: Rover says so honestly and offers to save
-the request as a wish:
+When we onboard you, we'll send something like:
-> I wish you could remind me about this next Monday.
+```
+Chat URL: https://<handle>.rizom.ai/chat
+Dashboard URL: https://<handle>.rizom.ai/
+CMS URL: https://<handle>.rizom.ai/cms
+Discord: yes/no — setup steps below if yes
+MCP: enabled/not enabled — details below if enabled
+```
-Wishes flow back to us and shape what gets built next. Asking for
-things Rover can't do is not a failure — it's one of the most useful
-things a pilot user can do.
-## Your Rover in the network
-The loop has a second payoff. Rover isn't only a private assistant —
-it's your agent in a network of brains, and the connection runs both
-ways.
-**Other people's brains become sources.** When someone you know runs
-a brain, you don't have to send them a message and wait — you ask
-their brain directly, from your own chat. Save it to your agents
-once:
-> Add yeehaa.io to my agents.
-Then ask questions that put their knowledge next to yours:
-> Ask yeehaa.io what they've published about designing workshops,
-> and compare it with my own workshop notes.
-One ask, both directions: Rover pulls their public knowledge over
-the network, sets it against the material you've been capturing, and
-answers in terms of your situation. What comes back you can think
-with, push back on, or capture:
-> Save that comparison as a note with my workshop idea.
-That's the loop again, with someone else's knowledge feeding your
-capture. Rover never contacts an agent you haven't saved without
-telling you first, and your private material is never shared — only
-the question you send.
-**Your brain becomes a source for others.** The same way you ask
-other agents, they can ask yours. Your Rover answers on your behalf,
-drawing only on what you've chosen to make public — and it builds
-its picture of what you know from everything you capture.
-So the network is the quiet consequence of the loop: the more you
-put in, the more useful your Rover is to you — and the better it
-speaks for you when you're not in the room.
-## The other doors
-Chat is the primary interface, but your Rover has a few more
-entrances. All optional — ignore them until you're curious:
-- **Dashboard** — `https://<handle>.rizom.ai/` is your Rover's home
-  page in the browser: a quick overview that everything is running.
-- **CMS** — `https://<handle>.rizom.ai/cms` is a browser editor for
-  your content, useful when you want to write or restructure
-  something longer than a chat message. If it asks for GitHub
-  access, use the instructions we sent; if we didn't send any, skip
-  the CMS for now.
-- **Your own AI client (MCP)** — Rover can plug into AI apps you
-  already use (Claude, Cursor, and others), signed in with the same
-  passkey. If you want this, ask us and we'll send the short setup.
-- **Discord** — available for some pilot cohorts as a secondary
-  chat. If it's enabled for you, we'll send the invite separately.
-Under the hood, everything you save is plain Markdown in a private
-repository that belongs to you. You never have to touch it — but
-your material is never locked in, either.
-## What to expect from the pilot
-This is a real, working system, and an early one. Expect occasional
-rough edges and visible improvement while you use it. Your Rover is
-deployed specifically for you, your content lives in your own
-private store, and sign-in is by passkey. One ask: avoid putting
-highly sensitive material in during the pilot unless we've agreed
-it's in scope — when unsure, ask.
-For questions, feedback, or anything that feels off, join our
-Discord server: `<discord-invite>`. That's the fastest way to reach
-us, and you'll meet the other pilot users there too.
-## If something doesn't work
-- **No setup email** — check spam first, then tell us which address
-  to use.
-- **Setup link expired** — tell us; we'll reissue it.
-- **Browser asks for a passkey** — expected; use the one you
-  registered during setup.
-- **Anything else** — post in the Discord server with the exact
-  error text or a screenshot and we'll sort it out. Never paste your
-  setup link anywhere except your own browser.
-## Tell us what you notice
-The feedback that helps most is small and honest — drop it in the
-Discord server as it occurs to you:
-- where setup confused you
-- what felt useful right away, and what felt pointless
-- what you expected Rover to do that it couldn't
-- whether the capture → ask back → shape loop fits how you work
-- whether you'd keep using Rover after the pilot
-A few plain sentences are perfect.
+If anything is unclear, reply with what you're seeing and we'll help.