npm - @rizom/ops - Versions diffs - 0.2.0-alpha.262 → 0.2.0-alpha.263 - Mend

@rizom/ops 0.2.0-alpha.262 → 0.2.0-alpha.263

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 (3) hide show

package/dist/brains-ops.js CHANGED Viewed

@@ -257,7 +257,7 @@ Update marker: ${U.id}.
 `),await b0(l$($.artifactsDir,"report.md"),uh($))}function uh($){let U=$.report.metrics.runtime,J=$.report.metrics.health,G=U.map((O)=>O.cpuPercent).sort((O,q)=>O-q),I=U.map((O)=>O.memoryPercent),Q=J.filter((O)=>!O.ok),X=["# Directory-sync stress report","",`- Run: \`${$.runId}\``,`- Target: \`${$.target.handle}\` (${$.target.domain})`,`- Profile: \`${$.report.profile}\``,`- Version: \`${$.report.baseline.version}\``,`- Result: **${$.report.success?"PASS":"FAIL"}**`,`- Started: ${$.startedAt}`,`- Completed: ${$.completedAt}`,"","## Phases","","| Phase | Operation | Count | Result | Pull latency | Persistence latency |","| --- | --- | ---: | --- | ---: | ---: |",...$.report.phases.map((O)=>`| ${O.id} | ${O.operation} | ${O.count} | ${O.success?"pass":`fail: ${O.error??"unknown"}`} | ${bA(O.commitLatencyMs)} | ${bA(O.persistenceLatencyMs)} |`),"","## Runtime","",`- Samples: ${U.length}`,`- CPU p50/p95/p99/max: ${YQ(v7(G,0.5))} / ${YQ(v7(G,0.95))} / ${YQ(v7(G,0.99))} / ${YQ(G.at(-1))}`,`- Memory max: ${YQ(I.length?Math.max(...I):void 0)}`,`- PIDs max: ${U.length?Math.max(...U.map((O)=>O.pids)):"n/a"}`,`- Container status/restarts/OOM: ${$.report.metrics.container?`${$.report.metrics.container.status} / ${$.report.metrics.container.restartCount} / ${$.report.metrics.container.oomKilled}`:"unknown"}`,`- Health samples: ${J.length}`,`- Health failures: ${Q.length}`,"","## Cleanup","",`- Result: ${$.report.cleanup.success?"pass":"fail"}`,`- Remaining probes: ${$.report.cleanup.probesRemaining}`,`- Final entities: ${$.report.cleanup.finalEntities??"unknown"}`,`- Final notes: ${$.report.cleanup.finalNotes??"unknown"}`,`- Content tree restored: ${$.report.cleanup.contentTreeRestored??"unknown"}`,""];if($.report.failure)X.push("## Failure","",$.report.failure,"");return`${X.join(`
 `)}
 `}function v7($,U){if($.length===0)return;let J=Math.max(0,Math.ceil($.length*U)-1);return $[J]}function YQ($){return $===void 0?"n/a":`${$.toFixed(2)}%`}function bA($){return $===void 0?"n/a":`${($/1000).toFixed(1)}s`}var Bh,Lh,Sh,EA='!f() { test "$1" = get && echo username=x-access-token && echo "password=$GH_TOKEN"; }; f',M7=async($,U,J={})=>new Promise((G,I)=>{let Q=Hh($,[...U],{cwd:J.cwd,env:J.env?{...process.env,...J.env}:process.env,stdio:["pipe","pipe","pipe"]}),X="",O="";Q.stdout.setEncoding("utf8"),Q.stderr.setEncoding("utf8"),Q.stdout.on("data",(q)=>{X+=q}),Q.stderr.on("data",(q)=>{O+=q}),Q.on("error",I),Q.on("close",(q)=>{G({exitCode:q??1,stdout:X,stderr:O})}),Q.stdin.end(J.stdin)});var j7=G$(()=>{B0();CA();LJ();Bh=K.object({HCLOUD_TOKEN:K.string().min(1),KAMAL_SSH_PRIVATE_KEY:K.string().min(1),CONTENT_REPO_ADMIN_TOKEN:K.string().min(1)}),Lh=K.object({servers:K.array(K.object({id:K.number().int(),status:K.string(),public_net:K.object({ipv4:K.object({ip:K.string().min(1)})})}))}),Sh=K.object({status:K.literal("ready"),operationalStatus:K.literal("operational"),app:K.object({version:K.string(),entities:K.number().int().nonnegative(),entityCounts:K.array(K.object({entityType:K.string(),count:K.number().int().nonnegative()})).default([])})})});import{parseArgs as WP}from"util";function c$($){return $}class MQ extends Error{constructor($){super($);this.name="CliUsageError"}}function wP($,U){let J={...U};for(let G of $)for(let[I,Q]of Object.entries(G.flags??{})){let X=J[I];if(X===void 0){J[I]=Q;continue}if(X.type!==Q.type||X.short!==Q.short||X.default!==Q.default)throw Error(`Conflicting definitions for flag --${I}: commands must agree on type, short, and default`)}return J}function VP($){let U={};for(let[J,G]of Object.entries($))U[J]={type:G.type,...G.short!==void 0?{short:G.short}:{},...G.default!==void 0?{default:G.default}:{}};return U}function vP($){if(!($ instanceof Error)||!("code"in $))return!1;return $.code==="ERR_PARSE_ARGS_UNKNOWN_OPTION"||$.code==="ERR_PARSE_ARGS_INVALID_OPTION_VALUE"}function P7($,U){let J=wP(U.commands,U.globalFlags??{}),G,I;try{({values:G,positionals:I}=WP({args:$,options:VP(J),allowPositionals:!0,strict:U.strict??!0}))}catch(X){if(vP(X))throw new MQ(X.message.split(". ")[0]??X.message);throw X}if("help"in J&&G.help===!0)return{command:"help",args:[],flags:{help:!0}};if("version"in J&&G.version===!0)return{command:"version",args:[],flags:{version:!0}};let Q={};for(let[X,O]of Object.entries(J)){let q=G[X];if(typeof q==="string"&&O.type==="string")Q[X]=q;else if(typeof q==="boolean"&&O.type==="boolean")Q[X]=q}return{command:I[0]??"help",args:I.slice(1),flags:Q}}function B7($){let U=$.reduce((J,G)=>Math.max(J,G.label.length),0);return $.map((J)=>`  ${J.label.padEnd(U)}  ${J.description}`)}function NP($){return B7($.map((U)=>({label:U.usage?`${U.name} ${U.usage}`:U.name,description:U.description})))}function ZP($,U){let J=U.type==="string"?` ${U.placeholder??"<value>"}`:"",G=U.short!==void 0?`, -${U.short}`:"";return`--${$}${J}${G}`}function L7($){return B7(Object.entries($).map(([U,J])=>({label:ZP(U,J),description:J.description})))}function S7($,U){return`Usage: ${$} ${U.name}${U.usage?` ${U.usage}`:""}`}function gP($){return JSON.stringify(Object.entries($).map(([U,J])=>[U,J.type,J.short??"",J.description,J.placeholder??"",J.default??""]).sort((U,J)=>String(U[0]).localeCompare(String(J[0]))))}function MP($){let U=[],J=new Map;for(let I of $){let Q=I.flags??{};if(Object.keys(Q).length===0)continue;let X=gP(Q),O=J.get(X);if(O){O.names.push(I.name);continue}let q={names:[I.name],flags:Q};J.set(X,q),U.push(q)}let G=[];for(let I of U)G.push("",`${I.names.join(" / ")} options:`),G.push(...L7(I.flags));return G}function _7($){let U=[$.intro,"",`Usage: ${$.cliName} ${$.usage??"<command> [args]"}`,"","Commands:",...NP($.commands)];if($.globalFlags&&Object.keys($.globalFlags).length>0)U.push("","Options:",...L7($.globalFlags));return U.push(...MP($.commands)),U.join(`
-`)}function C7($){let U=new Map;for(let J of $){if(U.has(J.name))throw Error(`Duplicate command name: ${J.name}`);U.set(J.name,J)}return U}function nU($,U){let J=$[U];return typeof J==="string"?J:void 0}function RQ($,U){let J=$[U];return typeof J==="boolean"?J:void 0}var jQ={name:"@rizom/ops",version:"0.2.0-alpha.262",description:"Operator CLI for managing private brain fleet registry repos",keywords:["brains","ops","cli","deploy","fleet","operator"],license:"AGPL-3.0-only",author:"Yeehaa <yeehaa@rizom.ai> (https://rizom.ai)",bin:{"brains-ops":"./dist/brains-ops.js"},bugs:"https://github.com/rizom-ai/brains/issues",dependencies:{"age-encryption":"^0.3.0",yaml:"^2.9.0"},devDependencies:{"@brains/deploy-support":"workspace:*","@brains/eslint-config":"workspace:*","@brains/site-composition":"workspace:*","@brains/typescript-config":"workspace:*","@brains/utils":"workspace:*","@types/bun":"^1.3.14",typescript:"^7.0.2"},engines:{bun:">=1.3.3"},exports:{".":{types:"./dist/index.d.ts",import:"./dist/index.js"},"./deploy":{types:"./dist/deploy.d.ts",import:"./dist/deploy.js",bun:"./dist/deploy.js"}},files:["dist","templates"],homepage:"https://github.com/rizom-ai/brains/tree/main/packages/brains-ops#readme",main:"./dist/index.js",publishConfig:{access:"public"},repository:{type:"git",url:"https://github.com/rizom-ai/brains.git",directory:"packages/brains-ops"},scripts:{build:"bun scripts/build.ts",lint:"eslint . --max-warnings 0","lint:fix":"eslint . --max-warnings 0 --fix",prepublishOnly:"bun scripts/build.ts",test:"bun run build && bun test --timeout 20000","test:smoke":"bun run build && RUN_SMOKE_TESTS=1 bun test --timeout 60000",typecheck:"tsc --noEmit"},type:"module",types:"./dist/index.d.ts"};import{existsSync as IS,mkdirSync as JS,readFileSync as sD,writeFileSync as eD}from"fs";import{dirname as GS,join as kg}from"path";function zq($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function m$($,U=""){if(typeof $!=="number"){let J=U&&`"${U}" `;throw TypeError(`${J}expected number, got ${typeof $}`)}if(!Number.isSafeInteger($)||$<0){let J=U&&`"${U}" `;throw RangeError(`${J}expected integer >= 0, got ${$}`)}}function t$($,U,J=""){let G=zq($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",q=G?`length=${I}`:`type=${typeof $}`,D=X+"expected Uint8Array"+O+", got "+q;if(!G)throw TypeError(D);throw RangeError(D)}return $}function u0($){if(typeof $!=="function"||typeof $.create!=="function")throw TypeError("Hash must wrapped by utils.createHasher");if(m$($.outputLen),m$($.blockLen),$.outputLen<1)throw Error('"outputLen" must be >= 1');if($.blockLen<1)throw Error('"blockLen" must be >= 1')}function xJ($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function HQ($,U){t$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw RangeError('"digestInto() output" expected to be of length >='+J)}function TQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function gU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function mJ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function U0($,U){return $<<32-U|$>>>U}function P$($,U){return $<<U|$>>>32-U>>>0}var jP=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function HP($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function TP($){for(let U=0;U<$.length;U++)$[U]=HP($[U]);return $}var Yq=jP?($)=>$:TP,b7=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),KP=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function KQ($){if(t$($),b7)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=KP[$[J]];return U}var F0={_0:48,_9:57,A:65,F:70,a:97,f:102};function E7($){if($>=F0._0&&$<=F0._9)return $-F0._0;if($>=F0.A&&$<=F0.F)return $-(F0.A-10);if($>=F0.a&&$<=F0.f)return $-(F0.a-10);return}function G8($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);if(b7)try{return Uint8Array.fromHex($)}catch(I){if(I instanceof SyntaxError)throw RangeError(I.message);throw I}let U=$.length,J=U/2;if(U%2)throw RangeError("hex string expected, got unpadded hex of length "+U);let G=new Uint8Array(J);for(let I=0,Q=0;I<J;I++,Q+=2){let X=E7($.charCodeAt(Q)),O=E7($.charCodeAt(Q+1));if(X===void 0||O===void 0){let q=$[Q]+$[Q+1];throw RangeError('hex string expected, got non-hex character "'+q+'" at index '+Q)}G[I]=X*16+O}return G}function AP($){if(typeof $!=="string")throw TypeError("string expected");return new Uint8Array(new TextEncoder().encode($))}function Wq($,U=""){if(typeof $==="string")return AP($);return t$($,void 0,U)}function wq(...$){let U=0;for(let G=0;G<$.length;G++){let I=$[G];t$(I),U+=I.length}let J=new Uint8Array(U);for(let G=0,I=0;G<$.length;G++){let Q=$[G];J.set(Q,I),I+=Q.length}return J}function AQ($,U){if(U!==void 0&&{}.toString.call(U)!=="[object Object]")throw TypeError("options must be object or undefined");return Object.assign($,U)}function Vq($,U={}){let J=(I,Q)=>$(Q).update(I).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.canXOF=G.canXOF,J.create=(I)=>$(I),Object.assign(J,U),Object.freeze(J)}function x0($=32){m$($,"bytesLength");let U=typeof globalThis==="object"?globalThis.crypto:null;if(typeof U?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");if($>65536)throw RangeError(`"bytesLength" expected <= 65536, got ${$}`);return U.getRandomValues(new Uint8Array($))}var vq=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});class Nq{oHash;iHash;blockLen;outputLen;canXOF=!1;finished=!1;destroyed=!1;constructor($,U){if(u0($),t$(U,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(U.length>J?$.create().update(U).digest():U);for(let I=0;I<G.length;I++)G[I]^=54;this.iHash.update(G),this.oHash=$.create();for(let I=0;I<G.length;I++)G[I]^=106;this.oHash.update(G),gU(G)}update($){return xJ(this),this.iHash.update($),this}digestInto($){xJ(this),HQ($,this),this.finished=!0;let U=$.subarray(0,this.outputLen);this.iHash.digestInto(U),this.oHash.update(U),this.oHash.digestInto(U),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$||=Object.create(Object.getPrototypeOf(this),{});let{oHash:U,iHash:J,finished:G,destroyed:I,blockLen:Q,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=I,$.blockLen=Q,$.outputLen=X,$.oHash=U._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var w0=(()=>{let $=(U,J,G)=>new Nq(U,J).update(G).digest();return $.create=(U,J)=>new Nq(U,J),$})();function Q8($,U,J){if(u0($),J===void 0)J=new Uint8Array($.outputLen);return w0($,J,U)}var Zq=Uint8Array.of(0),f7=Uint8Array.of();function gq($,U,J,G=32){u0($),m$(G,"length"),t$(U,void 0,"prk");let I=$.outputLen;if(U.length<I)throw Error('"prk" must be at least HashLen octets');if(G>255*I)throw Error("Length must be <= 255*HashLen");let Q=Math.ceil(G/I);if(J===void 0)J=f7;else t$(J,void 0,"info");let X=new Uint8Array(Q*I),O=w0.create($,U),q=O._cloneInto(),D=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)Zq[0]=z+1,q.update(z===0?f7:D).update(J).update(Zq).digestInto(D),X.set(D,I*z),O._cloneInto(q);return O.destroy(),q.destroy(),gU(D,Zq),X.slice(0,G)}var XI=($,U,J,G,I)=>gq($,Q8($,U,J),G,I);function k7($,U,J){return $&U^~$&J}function F7($,U,J){return $&U^$&J^U&J}class PQ{blockLen;outputLen;canXOF=!1;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,U,J,G){this.blockLen=$,this.outputLen=U,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=mJ(this.buffer)}update($){xJ(this),t$($);let{view:U,buffer:J,blockLen:G}=this,I=$.length;for(let Q=0;Q<I;){let X=Math.min(G-this.pos,I-Q);if(X===G){let O=mJ($);for(;G<=I-Q;Q+=G)this.process(O,Q);continue}if(J.set($.subarray(Q,Q+X),this.pos),this.pos+=X,Q+=X,this.pos===G)this.process(U,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){xJ(this),HQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,gU(this.buffer.subarray(Q)),this.padOffset>G-Q)this.process(J,0),Q=0;for(let z=Q;z<G;z++)U[z]=0;J.setBigUint64(G-8,BigInt(this.length*8),I),this.process(J,0);let X=mJ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let q=O/4,D=this.get();if(q>D.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<q;z++)X.setUint32(4*z,D[z],I)}digest(){let{buffer:$,outputLen:U}=this;this.digestInto($);let J=$.slice(0,U);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:U,buffer:J,length:G,finished:I,destroyed:Q,pos:X}=this;if($.destroyed=Q,$.finished=I,$.length=G,$.pos=X,G%U)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var m0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),y0=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),s$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),e$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var BQ=BigInt(4294967295),u7=BigInt(32);function PP($,U=!1){if(U)return{h:Number($&BQ),l:Number($>>u7&BQ)};return{h:Number($>>u7&BQ)|0,l:Number($&BQ)|0}}function x7($,U=!1){let J=$.length,G=new Uint32Array(J),I=new Uint32Array(J);for(let Q=0;Q<J;Q++){let{h:X,l:O}=PP($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var Mq=($,U,J)=>$>>>J,Rq=($,U,J)=>$<<32-J|U>>>J,dI=($,U,J)=>$>>>J|U<<32-J,nI=($,U,J)=>$<<32-J|U>>>J,X8=($,U,J)=>$<<64-J|U>>>J-32,O8=($,U,J)=>$>>>J-32|U<<64-J;function V0($,U,J,G){let I=(U>>>0)+(G>>>0);return{h:$+J+(I/4294967296|0)|0,l:I|0}}var m7=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),y7=($,U,J,G)=>U+J+G+($/4294967296|0)|0,r7=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),h7=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,l7=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),d7=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var LP=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]),OI=new Uint32Array(64);class jq extends PQ{constructor($){super(64,$,8,!1)}get(){let{A:$,B:U,C:J,D:G,E:I,F:Q,G:X,H:O}=this;return[$,U,J,G,I,Q,X,O]}set($,U,J,G,I,Q,X,O){this.A=$|0,this.B=U|0,this.C=J|0,this.D=G|0,this.E=I|0,this.F=Q|0,this.G=X|0,this.H=O|0}process($,U){for(let z=0;z<16;z++,U+=4)OI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=OI[z-15],w=OI[z-2],V=U0(W,7)^U0(W,18)^W>>>3,Z=U0(w,17)^U0(w,19)^w>>>10;OI[z]=Z+OI[z-7]+V+OI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:q,H:D}=this;for(let z=0;z<64;z++){let W=U0(X,6)^U0(X,11)^U0(X,25),w=D+W+k7(X,O,q)+LP[z]+OI[z]|0,Z=(U0(J,2)^U0(J,13)^U0(J,22))+F7(J,G,I)|0;D=q,q=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+Z|0}J=J+this.A|0,G=G+this.B|0,I=I+this.C|0,Q=Q+this.D|0,X=X+this.E|0,O=O+this.F|0,q=q+this.G|0,D=D+this.H|0,this.set(J,G,I,Q,X,O,q,D)}roundClean(){gU(OI)}destroy(){this.destroyed=!0,this.set(0,0,0,0,0,0,0,0),gU(this.buffer)}}class n7 extends jq{A=m0[0]|0;B=m0[1]|0;C=m0[2]|0;D=m0[3]|0;E=m0[4]|0;F=m0[5]|0;G=m0[6]|0;H=m0[7]|0;constructor(){super(32)}}class SP extends jq{A=y0[0]|0;B=y0[1]|0;C=y0[2]|0;D=y0[3]|0;E=y0[4]|0;F=y0[5]|0;G=y0[6]|0;H=y0[7]|0;constructor(){super(28)}}var i7=(()=>x7(["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($))))(),_P=(()=>i7[0])(),CP=(()=>i7[1])(),qI=new Uint32Array(80),DI=new Uint32Array(80);class q8 extends PQ{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:q,El:D,Fh:z,Fl:W,Gh:w,Gl:V,Hh:Z,Hl:v}=this;return[$,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v]}set($,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v){this.Ah=$|0,this.Al=U|0,this.Bh=J|0,this.Bl=G|0,this.Ch=I|0,this.Cl=Q|0,this.Dh=X|0,this.Dl=O|0,this.Eh=q|0,this.El=D|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=V|0,this.Hh=Z|0,this.Hl=v|0}process($,U){for(let R=0;R<16;R++,U+=4)qI[R]=$.getUint32(U),DI[R]=$.getUint32(U+=4);for(let R=16;R<80;R++){let S=qI[R-15]|0,L=DI[R-15]|0,k=dI(S,L,1)^dI(S,L,8)^Mq(S,L,7),x=nI(S,L,1)^nI(S,L,8)^Rq(S,L,7),h=qI[R-2]|0,B=DI[R-2]|0,m=dI(h,B,19)^X8(h,B,61)^Mq(h,B,6),a=nI(h,B,19)^O8(h,B,61)^Rq(h,B,6),C=r7(x,a,DI[R-7],DI[R-16]),A=h7(C,k,m,qI[R-7],qI[R-16]);qI[R]=A|0,DI[R]=C|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:q,Dl:D,Eh:z,El:W,Fh:w,Fl:V,Gh:Z,Gl:v,Hh:N,Hl:j}=this;for(let R=0;R<80;R++){let S=dI(z,W,14)^dI(z,W,18)^X8(z,W,41),L=nI(z,W,14)^nI(z,W,18)^O8(z,W,41),k=z&w^~z&Z,x=W&V^~W&v,h=l7(j,L,x,CP[R],DI[R]),B=d7(h,N,S,k,_P[R],qI[R]),m=h|0,a=dI(J,G,28)^X8(J,G,34)^X8(J,G,39),C=nI(J,G,28)^O8(J,G,34)^O8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=Z|0,j=v|0,Z=w|0,v=V|0,w=z|0,V=W|0,{h:z,l:W}=V0(q|0,D|0,B|0,m|0),q=X|0,D=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let M=m7(m,C,E);J=y7(M,B,a,A),G=M|0}({h:J,l:G}=V0(this.Ah|0,this.Al|0,J|0,G|0)),{h:I,l:Q}=V0(this.Bh|0,this.Bl|0,I|0,Q|0),{h:X,l:O}=V0(this.Ch|0,this.Cl|0,X|0,O|0),{h:q,l:D}=V0(this.Dh|0,this.Dl|0,q|0,D|0),{h:z,l:W}=V0(this.Eh|0,this.El|0,z|0,W|0),{h:w,l:V}=V0(this.Fh|0,this.Fl|0,w|0,V|0),{h:Z,l:v}=V0(this.Gh|0,this.Gl|0,Z|0,v|0),{h:N,l:j}=V0(this.Hh|0,this.Hl|0,N|0,j|0),this.set(J,G,I,Q,X,O,q,D,z,W,w,V,Z,v,N,j)}roundClean(){gU(qI,DI)}destroy(){this.destroyed=!0,gU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class c7 extends q8{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(64)}}class EP extends q8{Ah=s$[0]|0;Al=s$[1]|0;Bh=s$[2]|0;Bl=s$[3]|0;Ch=s$[4]|0;Cl=s$[5]|0;Dh=s$[6]|0;Dl=s$[7]|0;Eh=s$[8]|0;El=s$[9]|0;Fh=s$[10]|0;Fl=s$[11]|0;Gh=s$[12]|0;Gl=s$[13]|0;Hh=s$[14]|0;Hl=s$[15]|0;constructor(){super(48)}}var DU=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),zU=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class bP extends q8{Ah=DU[0]|0;Al=DU[1]|0;Bh=DU[2]|0;Bl=DU[3]|0;Ch=DU[4]|0;Cl=DU[5]|0;Dh=DU[6]|0;Dl=DU[7]|0;Eh=DU[8]|0;El=DU[9]|0;Fh=DU[10]|0;Fl=DU[11]|0;Gh=DU[12]|0;Gl=DU[13]|0;Hh=DU[14]|0;Hl=DU[15]|0;constructor(){super(28)}}class fP extends q8{Ah=zU[0]|0;Al=zU[1]|0;Bh=zU[2]|0;Bl=zU[3]|0;Ch=zU[4]|0;Cl=zU[5]|0;Dh=zU[6]|0;Dl=zU[7]|0;Eh=zU[8]|0;El=zU[9]|0;Fh=zU[10]|0;Fl=zU[11]|0;Gh=zU[12]|0;Gl=zU[13]|0;Hh=zU[14]|0;Hl=zU[15]|0;constructor(){super(32)}}var y$=Vq(()=>new n7,vq(1));var LQ=Vq(()=>new c7,vq(3));/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function bQ($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function Kq($){if(!bQ($))throw TypeError("Uint8Array expected")}function s7($,U){if(!Array.isArray(U))return!1;if(U.length===0)return!0;if($)return U.every((J)=>typeof J==="string");else return U.every((J)=>Number.isSafeInteger(J))}function e7($){if(typeof $!=="function")throw TypeError("function expected");return!0}function zI($,U){if(typeof U!=="string")throw TypeError(`${$}: string expected`);return!0}function z8($){if(typeof $!=="number")throw TypeError(`number expected, got ${typeof $}`);if(!Number.isSafeInteger($))throw RangeError(`invalid integer: ${$}`)}function _Q($){if(!Array.isArray($))throw TypeError("array expected")}function CQ($,U){if(!s7(!0,U))throw TypeError(`${$}: array of strings expected`)}function Aq($,U){if(!s7(!1,U))throw TypeError(`${$}: array of numbers expected`)}function FU(...$){let U=(Q)=>Q,J=(Q,X)=>(O)=>Q(X(O)),G=$.map((Q)=>Q.encode).reduceRight(J,U),I=$.map((Q)=>Q.decode).reduce(J,U);return{encode:G,decode:I}}function uU($){let U=typeof $==="string"?$.split(""):$,J=U.length;CQ("alphabet",U);let G=new Map(U.map((I,Q)=>[I,Q]));return{encode:(I)=>{return _Q(I),I.map((Q)=>{if(!Number.isSafeInteger(Q)||Q<0||Q>=J)throw Error(`alphabet.encode: digit index outside alphabet "${Q}". Allowed: ${$}`);return U[Q]})},decode:(I)=>{return _Q(I),I.map((Q)=>{zI("alphabet.decode",Q);let X=G.get(Q);if(X===void 0)throw Error(`Unknown letter: "${Q}". Allowed: ${$}`);return X})}}}function xU($=""){return zI("join",$),{encode:(U)=>{return CQ("join.decode",U),U.join($)},decode:(U)=>{return zI("join.decode",U),U.split($)}}}function fQ($,U="="){return z8($),zI("padding",U),{encode(J){CQ("padding.encode",J);while(J.length*$%8)J.push(U);return J},decode(J){CQ("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]===U;G--)if((G-1)*$%8===0)throw Error("padding: invalid, string has too much padding");return J.slice(0,G)}}}function $Z($){return e7($),{encode:(U)=>U,decode:(U)=>$(U)}}function p7($,U,J){if(U<2)throw RangeError(`convertRadix: invalid from=${U}, base cannot be less than 2`);if(J<2)throw RangeError(`convertRadix: invalid to=${J}, base cannot be less than 2`);if(_Q($),!$.length)return[];let G=0,I=[],Q=Array.from($,(O)=>{if(z8(O),O<0||O>=U)throw Error(`invalid integer: ${O}`);return O}),X=Q.length;while(!0){let O=0,q=!0;for(let D=G;D<X;D++){let z=Q[D],W=U*O,w=W+z;if(!Number.isSafeInteger(w)||W/U!==O||w-z!==W)throw Error("convertRadix: carry overflow");let V=w/J;O=w%J;let Z=Math.floor(V);if(Q[D]=Z,!Number.isSafeInteger(Z)||Z*J+O!==w)throw Error("convertRadix: carry overflow");if(!q)continue;else if(!Z)G=D;else q=!1}if(I.push(O),q)break}for(let O=0;O<$.length-1&&$[O]===0;O++)I.push(0);return I.reverse()}var UZ=($,U)=>U===0?$:UZ(U,$%U),EQ=($,U)=>$+(U-UZ($,U)),SQ=(()=>{let $=[];for(let U=0;U<40;U++)$.push(2**U);return $})();function Hq($,U,J,G){if(_Q($),U<=0||U>32)throw RangeError(`convertRadix2: wrong from=${U}`);if(J<=0||J>32)throw RangeError(`convertRadix2: wrong to=${J}`);if(EQ(U,J)>32)throw Error(`convertRadix2: carry overflow from=${U} to=${J} carryBits=${EQ(U,J)}`);let I=0,Q=0,X=SQ[U],O=SQ[J]-1,q=[];for(let D of $){if(z8(D),D>=X)throw Error(`convertRadix2: invalid data word=${D} from=${U}`);if(I=I<<U|D,Q+U>32)throw Error(`convertRadix2: carry overflow pos=${Q} from=${U}`);Q+=U;for(;Q>=J;Q-=J)q.push((I>>Q-J&O)>>>0);let z=SQ[Q];if(z===void 0)throw Error("invalid carry");I&=z-1}if(I=I<<J-Q&O,!G&&Q>=U)throw Error("Excess padding");if(!G&&I>0)throw Error(`Non-zero padding: ${I}`);if(G&&Q>0)q.push(I>>>0);return q}function kP($){z8($);let U=256;return{encode:(J)=>{if(!bQ(J))throw TypeError("radix.encode input should be Uint8Array");return p7(Array.from(J),U,$)},decode:(J)=>{return Aq("radix.decode",J),Uint8Array.from(p7(J,$,U))}}}function iU($,U=!1){if(z8($),$<=0||$>32)throw RangeError("radix2: bits should be in (0..32]");if(EQ(8,$)>32||EQ($,8)>32)throw RangeError("radix2: carry overflow");return{encode:(J)=>{if(!bQ(J))throw TypeError("radix2.encode input should be Uint8Array");return Hq(Array.from(J),8,$,!U)},decode:(J)=>{return Aq("radix2.decode",J),Uint8Array.from(Hq(J,$,8,U))}}}function o7($){return e7($),function(...U){try{return $.apply(null,U)}catch(J){}}}var Il=Object.freeze(FU(iU(4),uU("0123456789ABCDEF"),xU(""))),Jl=Object.freeze(FU(iU(5),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),fQ(5),xU(""))),Gl=Object.freeze(FU(iU(5),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),xU(""))),Ql=Object.freeze(FU(iU(5),uU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),fQ(5),xU(""))),Xl=Object.freeze(FU(iU(5),uU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),xU(""))),Ol=Object.freeze(FU(iU(5),uU("0123456789ABCDEFGHJKMNPQRSTVWXYZ"),xU(""),$Z(($)=>$.toUpperCase().replace(/O/g,"0").replace(/[IL]/g,"1")))),IZ=(()=>typeof Uint8Array.from([]).toBase64==="function"&&typeof Uint8Array.fromBase64==="function")(),FP=/[\t\n\f\r ]/,JZ=($,U)=>{zI("base64",$);let J=U?"base64url":"base64";if($.length>0&&FP.test($))throw Error("invalid base64");return Uint8Array.fromBase64($,{alphabet:J,lastChunkHandling:"strict"})},Pq=Object.freeze(IZ?{encode($){return Kq($),$.toBase64()},decode($){return JZ($,!1)}}:FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),fQ(6),xU(""))),YU=Object.freeze(FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),xU(""))),ql=Object.freeze(IZ?{encode($){return Kq($),$.toBase64({alphabet:"base64url"})},decode($){return JZ($,!0)}}:FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),fQ(6),xU(""))),Dl=Object.freeze(FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),xU(""))),Bq=($)=>FU(kP(58),uU($),xU("")),zl=Object.freeze(Bq("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz")),Yl=Object.freeze(Bq("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ")),Wl=Object.freeze(Bq("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz"));var Tq=FU(uU("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),xU("")),a7=[996825010,642813549,513874426,1027748829,705979059];function D8($){let U=$>>25,J=($&33554431)<<5;for(let G=0;G<a7.length;G++)if((U>>G&1)===1)J^=a7[G];return J}function t7($,U,J=1){let G=$.length,I=1;for(let Q=0;Q<G;Q++){let X=$.charCodeAt(Q);if(X<33||X>126)throw Error(`Invalid prefix (${$})`);I=D8(I)^X>>5}I=D8(I);for(let Q=0;Q<G;Q++)I=D8(I)^$.charCodeAt(Q)&31;for(let Q of U)I=D8(I)^Q;for(let Q=0;Q<6;Q++)I=D8(I);return I^=J,Tq.encode(Hq([I%SQ[30]],30,5,!1))}function GZ($){let U=$==="bech32"?1:734539939,J=iU(5),G=J.decode,I=J.encode,Q=o7(G);function X(W,w,V=90){if(zI("bech32.encode prefix",W),bQ(w))w=Array.from(w);Aq("bech32.encode",w);let Z=W.length;if(Z===0)throw TypeError(`Invalid prefix length ${Z}`);let v=Z+7+w.length;if(V!==!1&&v>V)throw TypeError(`Length ${v} exceeds limit ${V}`);let N=W.toLowerCase(),j=t7(N,w,U);return`${N}1${Tq.encode(w)}${j}`}function O(W,w=90){zI("bech32.decode input",W);let V=W.length;if(V<8||w!==!1&&V>w)throw TypeError(`invalid string length: ${V} (${W}). Expected (8..${w})`);let Z=W.toLowerCase();if(W!==Z&&W!==W.toUpperCase())throw Error("String must be lowercase or uppercase");let v=Z.lastIndexOf("1");if(v===0||v===-1)throw Error('Letter "1" must be present between prefix and data only');let N=Z.slice(0,v),j=Z.slice(v+1);if(j.length<6)throw Error("Data must be at least 6 characters long");let R=Tq.decode(j).slice(0,-6),S=t7(N,R,U);if(!j.endsWith(S))throw Error(`Invalid checksum in ${W}: expected "${S}"`);return{prefix:N,words:R}}let q=o7(O);function D(W){let{prefix:w,words:V}=O(W,!1);return{prefix:w,words:V,bytes:G(V)}}function z(W,w){return X(W,I(w))}return{encode:X,decode:O,encodeFromBytes:z,decodeToBytes:D,decodeUnsafe:q,fromWords:G,fromWordsUnsafe:Q,toWords:I}}var mU=Object.freeze(GZ("bech32")),wl=Object.freeze(GZ("bech32m"));var uP=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),xP={encode($){return Kq($),$.toHex()},decode($){return zI("hex",$),Uint8Array.fromHex($)}},Vl=Object.freeze(uP?xP:FU(iU(4),uU("0123456789abcdef"),xU(""),$Z(($)=>{if(typeof $!=="string"||$.length%2!==0)throw TypeError(`hex.decode: expected string, got ${typeof $} with length ${$.length}`);return $.toLowerCase()})));function yP($,U,J,G){u0($);let I=AQ({dkLen:32,asyncTick:10},G),{c:Q,dkLen:X,asyncTick:O}=I;if(m$(Q,"c"),m$(X,"dkLen"),m$(O,"asyncTick"),Q<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 q=Wq(U,"password"),D=Wq(J,"salt"),z=new Uint8Array(X),W=w0.create($,q),w=W._cloneInto().update(D);return{c:Q,dkLen:X,asyncTick:O,DK:z,PRF:W,PRFSalt:w}}function rP($,U,J,G,I){if($.destroy(),U.destroy(),G)G.destroy();return gU(I),J}function Lq($,U,J,G){let{c:I,dkLen:Q,DK:X,PRF:O,PRFSalt:q}=yP($,U,J,G),D,z=new Uint8Array(4),W=mJ(z),w=new Uint8Array(O.outputLen);for(let V=1,Z=0;Z<Q;V++,Z+=O.outputLen){let v=X.subarray(Z,Z+O.outputLen);W.setInt32(0,V,!1),(D=q._cloneInto(D)).update(z).digestInto(w),v.set(w.subarray(0,v.length));for(let N=1;N<I;N++){O._cloneInto(D).update(w).digestInto(w);for(let j=0;j<v.length;j++)v[j]^=w[j]}}return rP(O,q,X,D,w)}function QZ($,U,J,G,I,Q){let X=$[U++]^J[G++],O=$[U++]^J[G++],q=$[U++]^J[G++],D=$[U++]^J[G++],z=$[U++]^J[G++],W=$[U++]^J[G++],w=$[U++]^J[G++],V=$[U++]^J[G++],Z=$[U++]^J[G++],v=$[U++]^J[G++],N=$[U++]^J[G++],j=$[U++]^J[G++],R=$[U++]^J[G++],S=$[U++]^J[G++],L=$[U++]^J[G++],k=$[U++]^J[G++],x=X,h=O,B=q,m=D,a=z,C=W,A=w,E=V,M=Z,T=v,H=N,b=j,P=R,F=S,y=L,n=k;for(let $$=0;$$<8;$$+=2)a^=P$(x+P|0,7),M^=P$(a+x|0,9),P^=P$(M+a|0,13),x^=P$(P+M|0,18),T^=P$(C+h|0,7),F^=P$(T+C|0,9),h^=P$(F+T|0,13),C^=P$(h+F|0,18),y^=P$(H+A|0,7),B^=P$(y+H|0,9),A^=P$(B+y|0,13),H^=P$(A+B|0,18),m^=P$(n+b|0,7),E^=P$(m+n|0,9),b^=P$(E+m|0,13),n^=P$(b+E|0,18),h^=P$(x+m|0,7),B^=P$(h+x|0,9),m^=P$(B+h|0,13),x^=P$(m+B|0,18),A^=P$(C+a|0,7),E^=P$(A+C|0,9),a^=P$(E+A|0,13),C^=P$(a+E|0,18),b^=P$(H+T|0,7),M^=P$(b+H|0,9),T^=P$(M+b|0,13),H^=P$(T+M|0,18),P^=P$(n+y|0,7),F^=P$(P+n|0,9),y^=P$(F+P|0,13),n^=P$(y+F|0,18);I[Q++]=X+x|0,I[Q++]=O+h|0,I[Q++]=q+B|0,I[Q++]=D+m|0,I[Q++]=z+a|0,I[Q++]=W+C|0,I[Q++]=w+A|0,I[Q++]=V+E|0,I[Q++]=Z+M|0,I[Q++]=v+T|0,I[Q++]=N+H|0,I[Q++]=j+b|0,I[Q++]=R+P|0,I[Q++]=S+F|0,I[Q++]=L+y|0,I[Q++]=k+n|0}function Sq($,U,J,G,I){let Q=G+0,X=G+16*I;for(let O=0;O<16;O++)J[X+O]=$[U+(2*I-1)*16+O];for(let O=0;O<I;O++,Q+=16,U+=16){if(QZ(J,X,$,U,J,Q),O>0)X+=16;QZ(J,Q,$,U+=16,J,X)}}function hP($,U,J){let G=AQ({dkLen:32,asyncTick:10,maxmem:1073742848},J),{N:I,r:Q,p:X,dkLen:O,asyncTick:q,maxmem:D,onProgress:z}=G;if(m$(I,"N"),m$(Q,"r"),m$(X,"p"),m$(O,"dkLen"),m$(q,"asyncTick"),m$(D,"maxmem"),z!==void 0&&typeof z!=="function")throw Error("progressCb must be a function");let W=128*Q,w=W/4,V=Math.pow(2,32);if(I<=1||(I&I-1)!==0||I>V)throw Error('"N" expected a power of 2, and 2^1 <= N <= 2^32');if(X<1||X>(V-1)*32/W)throw Error('"p" expected integer 1..((2^32 - 1) * 32) / (128 * r)');if(O<1||O>(V-1)*32)throw Error('"dkLen" expected integer 1..(2^32 - 1) * 32');let Z=W*(I+X+1);if(Z>D)throw Error('"maxmem" limit was hit: memUsed(128*r*(N+p+1))='+Z+", maxmem="+D);let v=Lq(y$,$,U,{c:1,dkLen:W*X}),N=TQ(v),j=TQ(new Uint8Array(W*I)),R=TQ(new Uint8Array(W)),S=()=>{};if(z){let L=2*I*X,k=Math.max(Math.floor(L/1e4),1),x=0;S=()=>{if(x++,z&&(!(x%k)||x===L))z(x/L)}}return{N:I,r:Q,p:X,dkLen:O,blockSize32:w,V:j,B32:N,B:v,tmp:R,blockMixCb:S,asyncTick:q}}function lP($,U,J,G,I){let Q=Lq(y$,$,J,{c:1,dkLen:U});return gU(J,G,I),Q}function _q($,U,J){let{N:G,r:I,p:Q,dkLen:X,blockSize32:O,V:q,B32:D,B:z,tmp:W,blockMixCb:w}=hP($,U,J);Yq(D);for(let V=0;V<Q;V++){let Z=O*V;for(let v=0;v<O;v++)q[v]=D[Z+v];for(let v=0,N=0;v<G-1;v++)Sq(q,N,q,N+=O,I),w();Sq(q,(G-1)*O,D,Z,I),w();for(let v=0;v<G;v++){let N=(D[Z+O-16]&G-1)>>>0;for(let j=0;j<O;j++)W[j]=D[Z+j]^q[N*O+j];Sq(W,0,D,Z,I),w()}}return Yq(D),lP($,X,z,q,W)}/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */function dP($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function kQ($){if(typeof $!=="boolean")throw TypeError(`boolean expected, not ${$}`)}function yJ($){if(typeof $!=="number")throw TypeError("number expected, got "+typeof $);if(!Number.isSafeInteger($)||$<0)throw RangeError("positive integer expected, got "+$)}function d$($,U,J=""){let G=dP($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",q=G?`length=${I}`:`type=${typeof $}`,D=X+"expected Uint8Array"+O+", got "+q;if(!G)throw TypeError(D);throw RangeError(D)}return $}function Cq($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function XZ($,U,J=!1){d$($,void 0,"output");let G=U.outputLen;if($.length<G)throw RangeError("digestInto() expects output buffer of length at least "+G);if(J&&!rJ($))throw Error("invalid output, must be aligned")}function v0($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function I0(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function nP($){return new DataView($.buffer,$.byteOffset,$.byteLength)}var iI=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)(),iP=($)=>$<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255;var cP=($)=>{for(let U=0;U<$.length;U++)$[U]=iP($[U]);return $},r0=iI?($)=>$:cP;function OZ($,U){if(U==null||typeof U!=="object")throw Error("options must be defined");return Object.assign($,U)}function qZ($,U){if($.length!==U.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^U[G];return J===0}function DZ($,U,J){let G=U,I=J||(()=>[]),Q=(O,q)=>G(q,...I(O)).update(O).digest(),X=G(new Uint8Array($),...I(new Uint8Array(0)));return Q.outputLen=X.outputLen,Q.blockLen=X.blockLen,Q.create=(O,...q)=>G(O,...q),Q}var zZ=($,U)=>{function J(G,...I){if(d$(G,void 0,"key"),$.nonceLength!==void 0){let z=I[0];d$(z,$.varSizeNonce?void 0:$.nonceLength,"nonce")}let Q=$.tagLength;if(Q&&I[1]!==void 0)d$(I[1],void 0,"AAD");let X=U(G,...I),O=(z,W)=>{if(W!==void 0){if(z!==2)throw Error("cipher output not supported");d$(W,void 0,"output")}},q=!1;return{encrypt(z,W){if(q)throw Error("cannot encrypt() twice with same key + nonce");return q=!0,d$(z),O(X.encrypt.length,W),X.encrypt(z,W)},decrypt(z,W){if(d$(z),Q&&z.length<Q)throw Error('"ciphertext" expected length bigger than tagLength='+Q);return O(X.decrypt.length,W),X.decrypt(z,W)}}}return Object.assign(J,$),J};function Y8($,U,J=!0){if(U===void 0)return new Uint8Array($);if(d$(U,void 0,"output"),U.length!==$)throw Error('"output" expected Uint8Array of length '+$+", got: "+U.length);if(J&&!rJ(U))throw Error("invalid output, must be aligned");return U}function YZ($,U,J){yJ($),yJ(U),kQ(J);let G=new Uint8Array(16),I=nP(G);return I.setBigUint64(0,BigInt(U),J),I.setBigUint64(8,BigInt($),J),G}function rJ($){return $.byteOffset%4===0}function hJ($){return Uint8Array.from(d$($))}var wZ=($)=>Uint8Array.from($.split(""),(U)=>U.charCodeAt(0)),pP=(()=>r0(v0(wZ("expand 16-byte k"))))(),oP=(()=>r0(v0(wZ("expand 32-byte k"))))();function B$($,U){return $<<U|$>>>32-U}var W8=64,aP=16,Eq=(()=>4294967295)(),WZ=Uint32Array.of();function tP($,U,J,G,I,Q,X,O){let q=I.length,D=new Uint8Array(W8),z=v0(D),W=iI&&rJ(I)&&rJ(Q),w=W?v0(I):WZ,V=W?v0(Q):WZ;if(!iI){for(let Z=0;Z<q;X++){if($(U,J,G,z,X,O),r0(z),X>=Eq)throw Error("arx: counter overflow");let v=Math.min(W8,q-Z);for(let N=0,j;N<v;N++)j=Z+N,Q[j]=I[j]^D[N];Z+=v}return}for(let Z=0;Z<q;X++){if($(U,J,G,z,X,O),X>=Eq)throw Error("arx: counter overflow");let v=Math.min(W8,q-Z);if(W&&v===W8){let N=Z/4;if(Z%4!==0)throw Error("arx: invalid block position");for(let j=0,R;j<aP;j++)R=N+j,V[R]=w[R]^z[j];Z+=W8;continue}for(let N=0,j;N<v;N++)j=Z+N,Q[j]=I[j]^D[N];Z+=v}}function VZ($,U){let{allowShortKeys:J,extendNonceFn:G,counterLength:I,counterRight:Q,rounds:X}=OZ({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},U);if(typeof $!=="function")throw Error("core must be a function");return yJ(I),yJ(X),kQ(Q),kQ(J),(O,q,D,z,W=0)=>{d$(O,void 0,"key"),d$(q,void 0,"nonce"),d$(D,void 0,"data");let w=D.length;if(z=Y8(w,z,!1),yJ(W),W<0||W>=Eq)throw Error("arx: counter overflow");let V=[],Z=O.length,v,N;if(Z===32)V.push(v=hJ(O)),N=oP;else if(Z===16&&J)v=new Uint8Array(32),v.set(O),v.set(O,16),N=pP,V.push(v);else throw d$(O,32,"arx key"),Error("invalid key size");if(!iI||!rJ(q))V.push(q=hJ(q));let j=v0(v);if(G){if(q.length!==24)throw Error("arx: extended nonce must be 24 bytes");let L=q.subarray(0,16);if(iI)G(N,j,v0(L),j);else{let k=r0(Uint32Array.from(N));G(k,j,v0(L),j),I0(k),r0(j)}q=q.subarray(16)}else if(!iI)r0(j);let R=16-I;if(R!==q.length)throw Error(`arx: nonce must be ${R} or 16 bytes`);if(R!==12){let L=new Uint8Array(12);L.set(q,Q?0:12-q.length),q=L,V.push(q)}let S=r0(v0(q));try{return tP($,N,j,S,D,z,W,X),z}finally{I0(...V)}}}function $U($,U){return $[U++]&255|($[U++]&255)<<8}class vZ{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($){$=hJ(d$($,32,"key"));let U=$U($,0),J=$U($,2),G=$U($,4),I=$U($,6),Q=$U($,8),X=$U($,10),O=$U($,12),q=$U($,14);this.r[0]=U&8191,this.r[1]=(U>>>13|J<<3)&8191,this.r[2]=(J>>>10|G<<6)&7939,this.r[3]=(G>>>7|I<<9)&8191,this.r[4]=(I>>>4|Q<<12)&255,this.r[5]=Q>>>1&8190,this.r[6]=(Q>>>14|X<<2)&8191,this.r[7]=(X>>>11|O<<5)&8065,this.r[8]=(O>>>8|q<<8)&8191,this.r[9]=q>>>5&127;for(let D=0;D<8;D++)this.pad[D]=$U($,16+2*D)}process($,U,J=!1){let G=J?0:2048,{h:I,r:Q}=this,X=Q[0],O=Q[1],q=Q[2],D=Q[3],z=Q[4],W=Q[5],w=Q[6],V=Q[7],Z=Q[8],v=Q[9],N=$U($,U+0),j=$U($,U+2),R=$U($,U+4),S=$U($,U+6),L=$U($,U+8),k=$U($,U+10),x=$U($,U+12),h=$U($,U+14),B=I[0]+(N&8191),m=I[1]+((N>>>13|j<<3)&8191),a=I[2]+((j>>>10|R<<6)&8191),C=I[3]+((R>>>7|S<<9)&8191),A=I[4]+((S>>>4|L<<12)&8191),E=I[5]+(L>>>1&8191),M=I[6]+((L>>>14|k<<2)&8191),T=I[7]+((k>>>11|x<<5)&8191),H=I[8]+((x>>>8|h<<8)&8191),b=I[9]+(h>>>5|G),P=0,F=P+B*X+m*(5*v)+a*(5*Z)+C*(5*V)+A*(5*w);P=F>>>13,F&=8191,F+=E*(5*W)+M*(5*z)+T*(5*D)+H*(5*q)+b*(5*O),P+=F>>>13,F&=8191;let y=P+B*O+m*X+a*(5*v)+C*(5*Z)+A*(5*V);P=y>>>13,y&=8191,y+=E*(5*w)+M*(5*W)+T*(5*z)+H*(5*D)+b*(5*q),P+=y>>>13,y&=8191;let n=P+B*q+m*O+a*X+C*(5*v)+A*(5*Z);P=n>>>13,n&=8191,n+=E*(5*V)+M*(5*w)+T*(5*W)+H*(5*z)+b*(5*D),P+=n>>>13,n&=8191;let $$=P+B*D+m*q+a*O+C*X+A*(5*v);P=$$>>>13,$$&=8191,$$+=E*(5*Z)+M*(5*V)+T*(5*w)+H*(5*W)+b*(5*z),P+=$$>>>13,$$&=8191;let X$=P+B*z+m*D+a*q+C*O+A*X;P=X$>>>13,X$&=8191,X$+=E*(5*v)+M*(5*Z)+T*(5*V)+H*(5*w)+b*(5*W),P+=X$>>>13,X$&=8191;let q$=P+B*W+m*z+a*D+C*q+A*O;P=q$>>>13,q$&=8191,q$+=E*X+M*(5*v)+T*(5*Z)+H*(5*V)+b*(5*w),P+=q$>>>13,q$&=8191;let W$=P+B*w+m*W+a*z+C*D+A*q;P=W$>>>13,W$&=8191,W$+=E*O+M*X+T*(5*v)+H*(5*Z)+b*(5*V),P+=W$>>>13,W$&=8191;let N$=P+B*V+m*w+a*W+C*z+A*D;P=N$>>>13,N$&=8191,N$+=E*q+M*O+T*X+H*(5*v)+b*(5*Z),P+=N$>>>13,N$&=8191;let V$=P+B*Z+m*V+a*w+C*W+A*z;P=V$>>>13,V$&=8191,V$+=E*D+M*q+T*O+H*X+b*(5*v),P+=V$>>>13,V$&=8191;let v$=P+B*v+m*Z+a*V+C*w+A*W;P=v$>>>13,v$&=8191,v$+=E*z+M*D+T*q+H*O+b*X,P+=v$>>>13,v$&=8191,P=(P<<2)+P|0,P=P+F|0,F=P&8191,P=P>>>13,y+=P,I[0]=F,I[1]=y,I[2]=n,I[3]=$$,I[4]=X$,I[5]=q$,I[6]=W$,I[7]=N$,I[8]=V$,I[9]=v$}finalize(){let{h:$,pad:U}=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 I=(G^1)-1;for(let X=0;X<10;X++)J[X]&=I;I=~I;for(let X=0;X<10;X++)$[X]=$[X]&I|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 Q=$[0]+U[0];$[0]=Q&65535;for(let X=1;X<8;X++)Q=($[X]+U[X]|0)+(Q>>>16)|0,$[X]=Q&65535;I0(J)}update($){Cq(this),d$($),$=hJ($);let{buffer:U,blockLen:J}=this,G=$.length;for(let I=0;I<G;){let Q=Math.min(J-this.pos,G-I);if(Q===J){for(;J<=G-I;I+=J)this.process($,I);continue}if(U.set($.subarray(I,I+Q),this.pos),this.pos+=Q,I+=Q,this.pos===J)this.process(U,0,!1),this.pos=0}return this}destroy(){this.destroyed=!0,I0(this.h,this.r,this.buffer,this.pad)}digestInto($){Cq(this),XZ($,this),this.finished=!0;let{buffer:U,h:J}=this,{pos:G}=this;if(G){U[G++]=1;for(;G<16;G++)U[G]=0;this.process(U,0,!0)}this.finalize();let I=0;for(let Q=0;Q<8;Q++)$[I++]=J[Q]>>>0,$[I++]=J[Q]>>>8}digest(){let{buffer:$,outputLen:U}=this;this.digestInto($);let J=$.slice(0,U);return this.destroy(),J}}var NZ=DZ(32,($)=>new vZ($));function sP($,U,J,G,I,Q=20){let X=$[0],O=$[1],q=$[2],D=$[3],z=U[0],W=U[1],w=U[2],V=U[3],Z=U[4],v=U[5],N=U[6],j=U[7],R=I,S=J[0],L=J[1],k=J[2],x=X,h=O,B=q,m=D,a=z,C=W,A=w,E=V,M=Z,T=v,H=N,b=j,P=R,F=S,y=L,n=k;for(let X$=0;X$<Q;X$+=2)x=x+a|0,P=B$(P^x,16),M=M+P|0,a=B$(a^M,12),x=x+a|0,P=B$(P^x,8),M=M+P|0,a=B$(a^M,7),h=h+C|0,F=B$(F^h,16),T=T+F|0,C=B$(C^T,12),h=h+C|0,F=B$(F^h,8),T=T+F|0,C=B$(C^T,7),B=B+A|0,y=B$(y^B,16),H=H+y|0,A=B$(A^H,12),B=B+A|0,y=B$(y^B,8),H=H+y|0,A=B$(A^H,7),m=m+E|0,n=B$(n^m,16),b=b+n|0,E=B$(E^b,12),m=m+E|0,n=B$(n^m,8),b=b+n|0,E=B$(E^b,7),x=x+C|0,n=B$(n^x,16),H=H+n|0,C=B$(C^H,12),x=x+C|0,n=B$(n^x,8),H=H+n|0,C=B$(C^H,7),h=h+A|0,P=B$(P^h,16),b=b+P|0,A=B$(A^b,12),h=h+A|0,P=B$(P^h,8),b=b+P|0,A=B$(A^b,7),B=B+E|0,F=B$(F^B,16),M=M+F|0,E=B$(E^M,12),B=B+E|0,F=B$(F^B,8),M=M+F|0,E=B$(E^M,7),m=m+a|0,y=B$(y^m,16),T=T+y|0,a=B$(a^T,12),m=m+a|0,y=B$(y^m,8),T=T+y|0,a=B$(a^T,7);let $$=0;G[$$++]=X+x|0,G[$$++]=O+h|0,G[$$++]=q+B|0,G[$$++]=D+m|0,G[$$++]=z+a|0,G[$$++]=W+C|0,G[$$++]=w+A|0,G[$$++]=V+E|0,G[$$++]=Z+M|0,G[$$++]=v+T|0,G[$$++]=N+H|0,G[$$++]=j+b|0,G[$$++]=R+P|0,G[$$++]=S+F|0,G[$$++]=L+y|0,G[$$++]=k+n|0}var eP=VZ(sP,{counterRight:!1,counterLength:4,allowShortKeys:!1});var $B=new Uint8Array(16),ZZ=($,U)=>{$.update(U);let J=U.length%16;if(J)$.update($B.subarray(J))},UB=new Uint8Array(32);function gZ($,U,J,G,I){if(I!==void 0)d$(I,void 0,"AAD");let Q=$(U,J,UB),X=YZ(G.length,I?I.length:0,!0),O=NZ.create(Q);if(I)ZZ(O,I);ZZ(O,G),O.update(X);let q=O.digest();return I0(Q,X),q}var IB=($)=>(U,J,G)=>{return{encrypt(Q,X){let O=Q.length;X=Y8(O+16,X,!1),X.set(Q);let q=X.subarray(0,-16);$(U,J,q,q,1);let D=gZ($,U,J,q,G);return X.set(D,O),I0(D),X},decrypt(Q,X){X=Y8(Q.length-16,X,!1);let O=Q.subarray(0,-16),q=Q.subarray(-16),D=gZ($,U,J,O,G);if(!qZ(q,D))throw I0(D),Error("invalid tag");return X.set(Q.subarray(0,-16)),$(U,J,X,X,1),I0(D),X}}},cU=zZ({blockSize:64,nonceLength:12,tagLength:16},IB(eP));/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function lJ($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function p$($,U=""){if(!Number.isSafeInteger($)||$<0){let J=U&&`"${U}" `;throw Error(`${J}expected integer >= 0, got ${$}`)}}function g$($,U,J=""){let G=lJ($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",q=G?`length=${I}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+O+", got "+q)}return $}function pU($){if(typeof $!=="function"||typeof $.create!=="function")throw Error("Hash must wrapped by utils.createHasher");p$($.outputLen),p$($.blockLen)}function l0($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function FQ($,U){g$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw Error('"digestInto() output" expected to be of length >='+J)}function uQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function SU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function xQ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function J0($,U){return $<<32-U|$>>>U}var JB=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function GB($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function QB($){for(let U=0;U<$.length;U++)$[U]=GB($[U]);return $}var bq=JB?($)=>$:QB,RZ=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),XB=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function cI($){if(g$($),RZ)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=XB[$[J]];return U}var h0={_0:48,_9:57,A:65,F:70,a:97,f:102};function MZ($){if($>=h0._0&&$<=h0._9)return $-h0._0;if($>=h0.A&&$<=h0.F)return $-(h0.A-10);if($>=h0.a&&$<=h0.f)return $-(h0.a-10);return}function pI($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(RZ)return Uint8Array.fromHex($);let U=$.length,J=U/2;if(U%2)throw Error("hex string expected, got unpadded hex of length "+U);let G=new Uint8Array(J);for(let I=0,Q=0;I<J;I++,Q+=2){let X=MZ($.charCodeAt(Q)),O=MZ($.charCodeAt(Q+1));if(X===void 0||O===void 0){let q=$[Q]+$[Q+1];throw Error('hex string expected, got non-hex character "'+q+'" at index '+Q)}G[I]=X*16+O}return G}function r$(...$){let U=0;for(let G=0;G<$.length;G++){let I=$[G];g$(I),U+=I.length}let J=new Uint8Array(U);for(let G=0,I=0;G<$.length;G++){let Q=$[G];J.set(Q,I),I+=Q.length}return J}function dJ($,U={}){let J=(I,Q)=>$(Q).update(I).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.create=(I)=>$(I),Object.assign(J,U),Object.freeze(J)}function YI($=32){let U=typeof globalThis==="object"?globalThis.crypto:null;if(typeof U?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");return U.getRandomValues(new Uint8Array($))}var WI=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var kq=BigInt(0),fq=BigInt(1);function w8($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw Error(J+"expected boolean, got type="+typeof $)}return $}function jZ($){if(typeof $==="bigint"){if(!mQ($))throw Error("positive bigint expected, got "+$)}else p$($);return $}function V8($){let U=jZ($).toString(16);return U.length&1?"0"+U:U}function HZ($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?kq:BigInt("0x"+$)}function wI($){return HZ(cI($))}function VI($){return HZ(cI(yQ(g$($)).reverse()))}function nJ($,U){p$(U),$=jZ($);let J=pI($.toString(16).padStart(U*2,"0"));if(J.length!==U)throw Error("number too large");return J}function v8($,U){return nJ($,U).reverse()}function yQ($){return Uint8Array.from($)}function vI($){return Uint8Array.from($,(U,J)=>{let G=U.charCodeAt(0);if(U.length!==1||G>127)throw Error(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var mQ=($)=>typeof $==="bigint"&&kq<=$;function OB($,U,J){return mQ($)&&mQ(U)&&mQ(J)&&U<=$&&$<J}function N8($,U,J,G){if(!OB(U,J,G))throw Error("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function Fq($){let U;for(U=0;$>kq;$>>=fq,U+=1);return U}var Z8=($)=>(fq<<BigInt($))-fq;function TZ($,U,J){if(p$($,"hashLen"),p$(U,"qByteLen"),typeof J!=="function")throw Error("hmacFn must be a function");let G=(N)=>new Uint8Array(N),I=Uint8Array.of(),Q=Uint8Array.of(0),X=Uint8Array.of(1),O=1000,q=G($),D=G($),z=0,W=()=>{q.fill(1),D.fill(0),z=0},w=(...N)=>J(D,r$(q,...N)),V=(N=I)=>{if(D=w(Q,N),q=w(),N.length===0)return;D=w(X,N),q=w()},Z=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){q=w();let R=q.slice();j.push(R),N+=q.length}return r$(...j)};return(N,j)=>{W(),V(N);let R=void 0;while(!(R=j(Z())))V();return W(),R}}function oI($,U={},J={}){if(!$||typeof $!=="object")throw Error("expected valid options object");function G(Q,X,O){let q=$[Q];if(O&&q===void 0)return;let D=typeof q;if(D!==X||q===null)throw Error(`param "${Q}" is invalid: expected ${X}, got ${D}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,q])=>G(O,q,X));I(U,!1),I(J,!0)}function uq($){let U=new WeakMap;return(J,...G)=>{let I=U.get(J);if(I!==void 0)return I;let Q=$(J,...G);return U.set(J,Q),Q}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var RU=BigInt(0),WU=BigInt(1),aI=BigInt(2),PZ=BigInt(3),BZ=BigInt(4),LZ=BigInt(5),qB=BigInt(7),SZ=BigInt(8),DB=BigInt(9),_Z=BigInt(16);function MU($,U){let J=$%U;return J>=RU?J:U+J}function oU($,U,J){let G=$;while(U-- >RU)G*=G,G%=J;return G}function KZ($,U){if($===RU)throw Error("invert: expected non-zero number");if(U<=RU)throw Error("invert: expected positive modulus, got "+U);let J=MU($,U),G=U,I=RU,Q=WU,X=WU,O=RU;while(J!==RU){let D=G/J,z=G%J,W=I-X*D,w=Q-O*D;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==WU)throw Error("invert: does not exist");return MU(I,U)}function xq($,U,J){if(!$.eql($.sqr(U),J))throw Error("Cannot find square root")}function CZ($,U){let J=($.ORDER+WU)/BZ,G=$.pow(U,J);return xq($,G,U),G}function zB($,U){let J=($.ORDER-LZ)/SZ,G=$.mul(U,aI),I=$.pow(G,J),Q=$.mul(U,I),X=$.mul($.mul(Q,aI),I),O=$.mul(Q,$.sub(X,$.ONE));return xq($,O,U),O}function YB($){let U=rQ($),J=EZ($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+qB)/_Z;return(O,q)=>{let D=O.pow(q,X),z=O.mul(D,G),W=O.mul(D,I),w=O.mul(D,Q),V=O.eql(O.sqr(z),q),Z=O.eql(O.sqr(W),q);D=O.cmov(D,z,V),z=O.cmov(w,W,Z);let v=O.eql(O.sqr(z),q),N=O.cmov(D,z,v);return xq(O,N,q),N}}function EZ($){if($<PZ)throw Error("sqrt is not defined for small field");let U=$-WU,J=0;while(U%aI===RU)U/=aI,J++;let G=aI,I=rQ($);while(AZ(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return CZ;let Q=I.pow(G,U),X=(U+WU)/aI;return function(q,D){if(q.is0(D))return D;if(AZ(q,D)!==1)throw Error("Cannot find square root");let z=J,W=q.mul(q.ONE,Q),w=q.pow(D,U),V=q.pow(D,X);while(!q.eql(w,q.ONE)){if(q.is0(w))return q.ZERO;let Z=1,v=q.sqr(w);while(!q.eql(v,q.ONE))if(Z++,v=q.sqr(v),Z===z)throw Error("Cannot find square root");let N=WU<<BigInt(z-Z-1),j=q.pow(W,N);z=Z,W=q.sqr(j),w=q.mul(w,W),V=q.mul(V,j)}return V}}function WB($){if($%BZ===PZ)return CZ;if($%SZ===LZ)return zB;if($%_Z===DB)return YB($);return EZ($)}var wB=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function mq($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=wB.reduce((G,I)=>{return G[I]="function",G},U);return oI($,J),$}function VB($,U,J){if(J<RU)throw Error("invalid exponent, negatives unsupported");if(J===RU)return $.ONE;if(J===WU)return U;let G=$.ONE,I=U;while(J>RU){if(J&WU)G=$.mul(G,I);I=$.sqr(I),J>>=WU}return G}function g8($,U,J=!1){let G=Array(U.length).fill(J?$.ZERO:void 0),I=U.reduce((X,O,q)=>{if($.is0(O))return X;return G[q]=X,$.mul(X,O)},$.ONE),Q=$.inv(I);return U.reduceRight((X,O,q)=>{if($.is0(O))return X;return G[q]=$.mul(X,G[q]),$.mul(X,O)},Q),G}function AZ($,U){let J=($.ORDER-WU)/aI,G=$.pow(U,J),I=$.eql(G,$.ONE),Q=$.eql(G,$.ZERO),X=$.eql(G,$.neg($.ONE));if(!I&&!Q&&!X)throw Error("invalid Legendre symbol result");return I?1:Q?0:-1}function vB($,U){if(U!==void 0)p$(U);let J=U!==void 0?U:$.toString(2).length,G=Math.ceil(J/8);return{nBitLength:J,nByteLength:G}}class bZ{ORDER;BITS;BYTES;isLE;ZERO=RU;ONE=WU;_lengths;_sqrt;_mod;constructor($,U={}){if($<=RU)throw Error("invalid field: expected ORDER > 0, got "+$);let J=void 0;if(this.isLE=!1,U!=null&&typeof U==="object"){if(typeof U.BITS==="number")J=U.BITS;if(typeof U.sqrt==="function")this.sqrt=U.sqrt;if(typeof U.isLE==="boolean")this.isLE=U.isLE;if(U.allowedLengths)this._lengths=U.allowedLengths?.slice();if(typeof U.modFromBytes==="boolean")this._mod=U.modFromBytes}let{nBitLength:G,nByteLength:I}=vB($,J);if(I>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=I,this._sqrt=void 0,Object.preventExtensions(this)}create($){return MU($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof $);return RU<=$&&$<this.ORDER}is0($){return $===RU}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&WU)===WU}neg($){return MU(-$,this.ORDER)}eql($,U){return $===U}sqr($){return MU($*$,this.ORDER)}add($,U){return MU($+U,this.ORDER)}sub($,U){return MU($-U,this.ORDER)}mul($,U){return MU($*U,this.ORDER)}pow($,U){return VB(this,$,U)}div($,U){return MU($*KZ(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return KZ($,this.ORDER)}sqrt($){if(!this._sqrt)this._sqrt=WB(this.ORDER);return this._sqrt(this,$)}toBytes($){return this.isLE?v8($,this.BYTES):nJ($,this.BYTES)}fromBytes($,U=!1){g$($);let{_lengths:J,BYTES:G,isLE:I,ORDER:Q,_mod:X}=this;if(J){if(!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let q=new Uint8Array(G);q.set($,I?0:q.length-$.length),$=q}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?VI($):wI($);if(X)O=MU(O,Q);if(!U){if(!this.isValid(O))throw Error("invalid field element: outside of range 0..ORDER")}return O}invertBatch($){return g8(this,$)}cmov($,U,J){return J?U:$}}function rQ($,U={}){return new bZ($,U)}function fZ($){if(typeof $!=="bigint")throw Error("field order must be bigint");let U=$.toString(2).length;return Math.ceil(U/8)}function yq($){let U=fZ($);return U+Math.ceil(U/2)}function kZ($,U,J=!1){g$($);let G=$.length,I=fZ(U),Q=yq(U);if(G<16||G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?VI($):wI($),O=MU(X,U-WU)+WU;return J?v8(O,I):nJ(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var iJ=BigInt(0),tI=BigInt(1);function M8($,U){let J=U.negate();return $?J:U}function dq($,U){let J=g8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function mZ($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function rq($,U){mZ($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=Z8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function FZ($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),q=$>>X;if(O>G)O-=Q,q+=tI;let D=U*G,z=D+Math.abs(O)-1,W=O===0,w=O<0,V=U%2!==0;return{nextN:q,offset:z,isZero:W,isNeg:w,isNegF:V,offsetF:D}}var hq=new WeakMap,yZ=new WeakMap;function lq($){return yZ.get($)||1}function uZ($){if($!==iJ)throw Error("invalid wNAF")}class nq{BASE;ZERO;Fn;bits;constructor($,U){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=U}_unsafeLadder($,U,J=this.ZERO){let G=$;while(U>iJ){if(U&tI)J=J.add(G);G=G.double(),U>>=tI}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=rq(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let q=1;q<G;q++)X=X.add(Q),I.push(X);Q=X.double()}return I}wNAF($,U,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,I=this.BASE,Q=rq($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:q,isZero:D,isNeg:z,isNegF:W,offsetF:w}=FZ(J,X,Q);if(J=O,D)I=I.add(M8(W,U[w]));else G=G.add(M8(z,U[q]))}return uZ(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=rq($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===iJ)break;let{nextN:X,offset:O,isZero:q,isNeg:D}=FZ(J,Q,I);if(J=X,q)continue;else{let z=U[O];G=G.add(D?z.negate():z)}}return uZ(J),G}getPrecomputes($,U,J){let G=hq.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);hq.set(U,G)}}return G}cached($,U,J){let G=lq($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=lq($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){mZ(U,this.bits),yZ.set($,U),hq.delete($)}hasCache($){return lq($)!==1}}function rZ($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>iJ||G>iJ){if(J&tI)Q=Q.add(I);if(G&tI)X=X.add(I);I=I.double(),J>>=tI,G>>=tI}return{p1:Q,p2:X}}function xZ($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return mq(U),U}else return rQ($,{isLE:J})}function hZ($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let q of["p","n","h"]){let D=U[q];if(!(typeof D==="bigint"&&D>iJ))throw Error(`CURVE.${q} must be positive bigint`)}let I=xZ(U.p,J.Fp,G),Q=xZ(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let q of O)if(!I.isValid(U[q]))throw Error(`CURVE.${q} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function hQ($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var R8=BigInt(0),cJ=BigInt(1),lQ=BigInt(2);function NB($){return oI($,{adjustScalarBytes:"function",powPminus2:"function"}),Object.freeze({...$})}function lZ($){let U=NB($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let q=X||YI,D=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),V=O?lQ**BigInt(254):lQ**BigInt(447),Z=O?BigInt(8)*lQ**BigInt(251)-cJ:BigInt(4)*lQ**BigInt(445)-cJ,v=V+Z+cJ,N=(M)=>MU(M,J),j=R(W);function R(M){return v8(N(M),z)}function S(M){let T=yQ(g$(M,z,"uCoordinate"));if(O)T[31]&=127;return N(VI(T))}function L(M){return VI(I(yQ(g$(M,z,"scalar"))))}function k(M,T){let H=a(S(T),L(M));if(H===R8)throw Error("invalid private or public key received");return R(H)}function x(M){return k(M,j)}let h=x,B=k;function m(M,T,H){let b=N(M*(T-H));return T=N(T-b),H=N(H+b),{x_2:T,x_3:H}}function a(M,T){N8("u",M,R8,J),N8("scalar",T,V,v);let H=T,b=M,P=cJ,F=R8,y=M,n=cJ,$$=R8;for(let q$=BigInt(D-1);q$>=R8;q$--){let W$=H>>q$&cJ;$$^=W$,{x_2:P,x_3:y}=m($$,P,y),{x_2:F,x_3:n}=m($$,F,n),$$=W$;let N$=P+F,V$=N(N$*N$),v$=P-F,R$=N(v$*v$),b$=V$-R$,k$=y+n,OU=y-n,qU=N(OU*N$),LU=N(k$*v$),Y0=qU+LU,W0=qU-LU;y=N(Y0*Y0),n=N(b*N(W0*W0)),P=N(V$*R$),F=N(b$*(V$+N(w*b$)))}({x_2:P,x_3:y}=m($$,P,y)),{x_2:F,x_3:n}=m($$,F,n);let X$=Q(F);return N(P*X$)}let C={secretKey:z,publicKey:z,seed:z},A=(M=q(z))=>{return g$(M,C.seed,"seed"),M},E={randomSecretKey:A};return Object.freeze({keygen:hQ(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:C})}class iq{oHash;iHash;blockLen;outputLen;finished=!1;destroyed=!1;constructor($,U){if(pU($),g$(U,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(U.length>J?$.create().update(U).digest():U);for(let I=0;I<G.length;I++)G[I]^=54;this.iHash.update(G),this.oHash=$.create();for(let I=0;I<G.length;I++)G[I]^=106;this.oHash.update(G),SU(G)}update($){return l0(this),this.iHash.update($),this}digestInto($){l0(this),g$($,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:U,iHash:J,finished:G,destroyed:I,blockLen:Q,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=I,$.blockLen=Q,$.outputLen=X,$.oHash=U._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var pJ=($,U,J)=>new iq($,U).update(J).digest();pJ.create=($,U)=>new iq($,U);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var dZ=($,U)=>($+($>=0?U:-U)/iZ)/U;function ZB($,U,J){let[[G,I],[Q,X]]=U,O=dZ(X*$,J),q=dZ(-I*$,J),D=$-O*G-q*Q,z=-O*I-q*X,W=D<d0,w=z<d0;if(W)D=-D;if(w)z=-z;let V=Z8(Math.ceil(Fq(J)/2))+oJ;if(D<d0||D>=V||z<d0||z>=V)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:W,k1:D,k2neg:w,k2:z}}function pq($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function cq($,U){let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(w8(J.lowS,"lowS"),w8(J.prehash,"prehash"),J.format!==void 0)pq(J.format);return J}class nZ extends Error{constructor($=""){super($)}}var NI={Err:nZ,_tlv:{encode:($,U)=>{let{Err:J}=NI;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(U.length&1)throw new J("tlv.encode: unpadded data");let G=U.length/2,I=V8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?V8(I.length/2|128):"";return V8($)+Q+I+U},decode($,U){let{Err:J}=NI,G=0;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(U.length<2||U[G++]!==$)throw new J("tlv.decode: wrong tlv");let I=U[G++],Q=!!(I&128),X=0;if(!Q)X=I;else{let q=I&127;if(!q)throw new J("tlv.decode(long): indefinite length not supported");if(q>4)throw new J("tlv.decode(long): byte length is too big");let D=U.subarray(G,G+q);if(D.length!==q)throw new J("tlv.decode: length bytes not complete");if(D[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of D)X=X<<8|z;if(G+=q,X<128)throw new J("tlv.decode(long): not minimal encoding")}let O=U.subarray(G,G+X);if(O.length!==X)throw new J("tlv.decode: wrong value length");return{v:O,l:U.subarray(G+X)}}},_int:{encode($){let{Err:U}=NI;if($<d0)throw new U("integer: negative integers are not allowed");let J=V8($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new U("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:U}=NI;if($[0]&128)throw new U("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new U("invalid signature integer: unnecessary leading zero");return wI($)}},toSig($){let{Err:U,_int:J,_tlv:G}=NI,I=g$($,void 0,"signature"),{v:Q,l:X}=G.decode(48,I);if(X.length)throw new U("invalid signature: left bytes after parsing");let{v:O,l:q}=G.decode(2,Q),{v:D,l:z}=G.decode(2,q);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(D)}},hexFromSig($){let{_tlv:U,_int:J}=NI,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}},d0=BigInt(0),oJ=BigInt(1),iZ=BigInt(2),dQ=BigInt(3),gB=BigInt(4);function oq($,U={}){let J=hZ("weierstrass",$,U),{Fp:G,Fn:I}=J,Q=J.CURVE,{h:X,n:O}=Q;oI(U,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:q}=U;if(q){if(!G.is0(Q.a)||typeof q.beta!=="bigint"||!Array.isArray(q.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let D=pZ(G,I);function z(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function W(A,E,M){let{x:T,y:H}=E.toAffine(),b=G.toBytes(T);if(w8(M,"isCompressed"),M){z();let P=!G.isOdd(H);return r$(cZ(P),b)}else return r$(Uint8Array.of(4),b,G.toBytes(H))}function w(A){g$(A,void 0,"Point");let{publicKey:E,publicKeyUncompressed:M}=D,T=A.length,H=A[0],b=A.subarray(1);if(T===E&&(H===2||H===3)){let P=G.fromBytes(b);if(!G.isValid(P))throw Error("bad point: is not on curve, wrong x");let F=v(P),y;try{y=G.sqrt(F)}catch(X$){let q$=X$ instanceof Error?": "+X$.message:"";throw Error("bad point: is not on curve, sqrt error"+q$)}z();let n=G.isOdd(y);if((H&1)===1!==n)y=G.neg(y);return{x:P,y}}else if(T===M&&H===4){let P=G.BYTES,F=G.fromBytes(b.subarray(0,P)),y=G.fromBytes(b.subarray(P,P*2));if(!N(F,y))throw Error("bad point: is not on curve");return{x:F,y}}else throw Error(`bad point: got length ${T}, expected compressed=${E} or uncompressed=${M}`)}let V=U.toBytes||W,Z=U.fromBytes||w;function v(A){let E=G.sqr(A),M=G.mul(E,A);return G.add(G.add(M,G.mul(A,Q.a)),Q.b)}function N(A,E){let M=G.sqr(E),T=v(A);return G.eql(M,T)}if(!N(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let j=G.mul(G.pow(Q.a,dQ),gB),R=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(j,R)))throw Error("bad curve params: a or b");function S(A,E,M=!1){if(!G.isValid(E)||M&&G.is0(E))throw Error(`bad point coordinate ${A}`);return E}function L(A){if(!(A instanceof m))throw Error("Weierstrass Point expected")}function k(A){if(!q||!q.basises)throw Error("no endo");return ZB(A,q.basises,I.ORDER)}let x=uq((A,E)=>{let{X:M,Y:T,Z:H}=A;if(G.eql(H,G.ONE))return{x:M,y:T};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(H);let P=G.mul(M,E),F=G.mul(T,E),y=G.mul(H,E);if(b)return{x:G.ZERO,y:G.ZERO};if(!G.eql(y,G.ONE))throw Error("invZ was invalid");return{x:P,y:F}}),h=uq((A)=>{if(A.is0()){if(U.allowInfinityPoint&&!G.is0(A.Y))return;throw Error("bad point: ZERO")}let{x:E,y:M}=A.toAffine();if(!G.isValid(E)||!G.isValid(M))throw Error("bad point: x or y not field elements");if(!N(E,M))throw Error("bad point: equation left != right");if(!A.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function B(A,E,M,T,H){return M=new m(G.mul(M.X,A),M.Y,M.Z),E=M8(T,E),M=M8(H,M),E.add(M)}class m{static BASE=new m(Q.Gx,Q.Gy,G.ONE);static ZERO=new m(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=I;X;Y;Z;constructor(A,E,M){this.X=S("x",A),this.Y=S("y",E,!0),this.Z=S("z",M),Object.freeze(this)}static CURVE(){return Q}static fromAffine(A){let{x:E,y:M}=A||{};if(!A||!G.isValid(E)||!G.isValid(M))throw Error("invalid affine point");if(A instanceof m)throw Error("projective point not allowed");if(G.is0(E)&&G.is0(M))return m.ZERO;return new m(E,M,G.ONE)}static fromBytes(A){let E=m.fromAffine(Z(g$(A,void 0,"point")));return E.assertValidity(),E}static fromHex(A){return m.fromBytes(pI(A))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(A=8,E=!0){if(C.createCache(this,A),!E)this.multiply(dQ);return this}assertValidity(){h(this)}hasEvenY(){let{y:A}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(A)}equals(A){L(A);let{X:E,Y:M,Z:T}=this,{X:H,Y:b,Z:P}=A,F=G.eql(G.mul(E,P),G.mul(H,T)),y=G.eql(G.mul(M,P),G.mul(b,T));return F&&y}negate(){return new m(this.X,G.neg(this.Y),this.Z)}double(){let{a:A,b:E}=Q,M=G.mul(E,dQ),{X:T,Y:H,Z:b}=this,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=G.mul(T,T),$$=G.mul(H,H),X$=G.mul(b,b),q$=G.mul(T,H);return q$=G.add(q$,q$),y=G.mul(T,b),y=G.add(y,y),P=G.mul(A,y),F=G.mul(M,X$),F=G.add(P,F),P=G.sub($$,F),F=G.add($$,F),F=G.mul(P,F),P=G.mul(q$,P),y=G.mul(M,y),X$=G.mul(A,X$),q$=G.sub(n,X$),q$=G.mul(A,q$),q$=G.add(q$,y),y=G.add(n,n),n=G.add(y,n),n=G.add(n,X$),n=G.mul(n,q$),F=G.add(F,n),X$=G.mul(H,b),X$=G.add(X$,X$),n=G.mul(X$,q$),P=G.sub(P,n),y=G.mul(X$,$$),y=G.add(y,y),y=G.add(y,y),new m(P,F,y)}add(A){L(A);let{X:E,Y:M,Z:T}=this,{X:H,Y:b,Z:P}=A,F=G.ZERO,y=G.ZERO,n=G.ZERO,$$=Q.a,X$=G.mul(Q.b,dQ),q$=G.mul(E,H),W$=G.mul(M,b),N$=G.mul(T,P),V$=G.add(E,M),v$=G.add(H,b);V$=G.mul(V$,v$),v$=G.add(q$,W$),V$=G.sub(V$,v$),v$=G.add(E,T);let R$=G.add(H,P);return v$=G.mul(v$,R$),R$=G.add(q$,N$),v$=G.sub(v$,R$),R$=G.add(M,T),F=G.add(b,P),R$=G.mul(R$,F),F=G.add(W$,N$),R$=G.sub(R$,F),n=G.mul($$,v$),F=G.mul(X$,N$),n=G.add(F,n),F=G.sub(W$,n),n=G.add(W$,n),y=G.mul(F,n),W$=G.add(q$,q$),W$=G.add(W$,q$),N$=G.mul($$,N$),v$=G.mul(X$,v$),W$=G.add(W$,N$),N$=G.sub(q$,N$),N$=G.mul($$,N$),v$=G.add(v$,N$),q$=G.mul(W$,v$),y=G.add(y,q$),q$=G.mul(R$,v$),F=G.mul(V$,F),F=G.sub(F,q$),q$=G.mul(V$,W$),n=G.mul(R$,n),n=G.add(n,q$),new m(F,y,n)}subtract(A){return this.add(A.negate())}is0(){return this.equals(m.ZERO)}multiply(A){let{endo:E}=U;if(!I.isValidNot0(A))throw Error("invalid scalar: out of range");let M,T,H=(b)=>C.cached(this,b,(P)=>dq(m,P));if(E){let{k1neg:b,k1:P,k2neg:F,k2:y}=k(A),{p:n,f:$$}=H(P),{p:X$,f:q$}=H(y);T=$$.add(q$),M=B(E.beta,n,X$,b,F)}else{let{p:b,f:P}=H(A);M=b,T=P}return dq(m,[M,T])[0]}multiplyUnsafe(A){let{endo:E}=U,M=this;if(!I.isValid(A))throw Error("invalid scalar: out of range");if(A===d0||M.is0())return m.ZERO;if(A===oJ)return M;if(C.hasCache(this))return this.multiply(A);if(E){let{k1neg:T,k1:H,k2neg:b,k2:P}=k(A),{p1:F,p2:y}=rZ(m,M,H,P);return B(E.beta,F,y,T,b)}else return C.unsafe(M,A)}toAffine(A){return x(this,A)}isTorsionFree(){let{isTorsionFree:A}=U;if(X===oJ)return!0;if(A)return A(m,this);return C.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:A}=U;if(X===oJ)return this;if(A)return A(m,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(A=!0){return w8(A,"isCompressed"),this.assertValidity(),V(m,this,A)}toHex(A=!0){return cI(this.toBytes(A))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let a=I.BITS,C=new nq(m,U.endo?Math.ceil(a/2):a);return m.BASE.precompute(8),m}function cZ($){return Uint8Array.of($?2:3)}function pZ($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function MB($,U={}){let{Fn:J}=$,G=U.randomBytes||YI,I=Object.assign(pZ($.Fp,J),{seed:yq(J.ORDER)});function Q(V){try{let Z=J.fromBytes(V);return J.isValidNot0(Z)}catch(Z){return!1}}function X(V,Z){let{publicKey:v,publicKeyUncompressed:N}=I;try{let j=V.length;if(Z===!0&&j!==v)return!1;if(Z===!1&&j!==N)return!1;return!!$.fromBytes(V)}catch(j){return!1}}function O(V=G(I.seed)){return kZ(g$(V,I.seed,"seed"),J.ORDER)}function q(V,Z=!0){return $.BASE.multiply(J.fromBytes(V)).toBytes(Z)}function D(V){let{secretKey:Z,publicKey:v,publicKeyUncompressed:N}=I;if(!lJ(V))return;if("_lengths"in J&&J._lengths||Z===v)return;let j=g$(V,void 0,"key").length;return j===v||j===N}function z(V,Z,v=!0){if(D(V)===!0)throw Error("first arg must be private key");if(D(Z)===!1)throw Error("second arg must be public key");let N=J.fromBytes(V);return $.fromBytes(Z).multiply(N).toBytes(v)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=hQ(O,q);return Object.freeze({getPublicKey:q,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function aq($,U,J={}){pU(U),oI(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let G=J.randomBytes||YI,I=J.hmac||((M,T)=>pJ(U,M,T)),{Fp:Q,Fn:X}=$,{ORDER:O,BITS:q}=X,{keygen:D,getPublicKey:z,getSharedSecret:W,utils:w,lengths:V}=MB($,J),Z={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},v=O*iZ<Q.ORDER;function N(M){let T=O>>oJ;return M>T}function j(M,T){if(!X.isValidNot0(T))throw Error(`invalid signature ${M}: out of range 1..Point.Fn.ORDER`);return T}function R(){if(v)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function S(M,T){pq(T);let H=V.signature,b=T==="compact"?H:T==="recovered"?H+1:void 0;return g$(M,b)}class L{r;s;recovery;constructor(M,T,H){if(this.r=j("r",M),this.s=j("s",T),H!=null){if(R(),![0,1,2,3].includes(H))throw Error("invalid recovery id");this.recovery=H}Object.freeze(this)}static fromBytes(M,T=Z.format){S(M,T);let H;if(T==="der"){let{r:y,s:n}=NI.toSig(g$(M));return new L(y,n)}if(T==="recovered")H=M[0],T="compact",M=M.subarray(1);let b=V.signature/2,P=M.subarray(0,b),F=M.subarray(b,b*2);return new L(X.fromBytes(P),X.fromBytes(F),H)}static fromHex(M,T){return this.fromBytes(pI(M),T)}assertRecovery(){let{recovery:M}=this;if(M==null)throw Error("invalid recovery id: must be present");return M}addRecoveryBit(M){return new L(this.r,this.s,M)}recoverPublicKey(M){let{r:T,s:H}=this,b=this.assertRecovery(),P=b===2||b===3?T+O:T;if(!Q.isValid(P))throw Error("invalid recovery id: sig.r+curve.n != R.x");let F=Q.toBytes(P),y=$.fromBytes(r$(cZ((b&1)===0),F)),n=X.inv(P),$$=x(g$(M,void 0,"msgHash")),X$=X.create(-$$*n),q$=X.create(H*n),W$=$.BASE.multiplyUnsafe(X$).add(y.multiplyUnsafe(q$));if(W$.is0())throw Error("invalid recovery: point at infinify");return W$.assertValidity(),W$}hasHighS(){return N(this.s)}toBytes(M=Z.format){if(pq(M),M==="der")return pI(NI.hexFromSig(this));let{r:T,s:H}=this,b=X.toBytes(T),P=X.toBytes(H);if(M==="recovered")return R(),r$(Uint8Array.of(this.assertRecovery()),b,P);return r$(b,P)}toHex(M){return cI(this.toBytes(M))}}let k=J.bits2int||function(T){if(T.length>8192)throw Error("input is too large");let H=wI(T),b=T.length*8-q;return b>0?H>>BigInt(b):H},x=J.bits2int_modN||function(T){return X.create(k(T))},h=Z8(q);function B(M){return N8("num < 2^"+q,M,d0,h),X.toBytes(M)}function m(M,T){return g$(M,void 0,"message"),T?g$(U(M),void 0,"prehashed message"):M}function a(M,T,H){let{lowS:b,prehash:P,extraEntropy:F}=cq(H,Z);M=m(M,P);let y=x(M),n=X.fromBytes(T);if(!X.isValidNot0(n))throw Error("invalid private key");let $$=[B(n),B(y)];if(F!=null&&F!==!1){let N$=F===!0?G(V.secretKey):F;$$.push(g$(N$,void 0,"extraEntropy"))}let X$=r$(...$$),q$=y;function W$(N$){let V$=k(N$);if(!X.isValidNot0(V$))return;let v$=X.inv(V$),R$=$.BASE.multiply(V$).toAffine(),b$=X.create(R$.x);if(b$===d0)return;let k$=X.create(v$*X.create(q$+b$*n));if(k$===d0)return;let OU=(R$.x===b$?0:2)|Number(R$.y&oJ),qU=k$;if(b&&N(k$))qU=X.neg(k$),OU^=1;return new L(b$,qU,v?void 0:OU)}return{seed:X$,k2sig:W$}}function C(M,T,H={}){let{seed:b,k2sig:P}=a(M,T,H);return TZ(U.outputLen,X.BYTES,I)(b,P).toBytes(H.format)}function A(M,T,H,b={}){let{lowS:P,prehash:F,format:y}=cq(b,Z);if(H=g$(H,void 0,"publicKey"),T=m(T,F),!lJ(M)){let n=M instanceof L?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+n)}S(M,y);try{let n=L.fromBytes(M,y),$$=$.fromBytes(H);if(P&&n.hasHighS())return!1;let{r:X$,s:q$}=n,W$=x(T),N$=X.inv(q$),V$=X.create(W$*N$),v$=X.create(X$*N$),R$=$.BASE.multiplyUnsafe(V$).add($$.multiplyUnsafe(v$));if(R$.is0())return!1;return X.create(R$.x)===X$}catch(n){return!1}}function E(M,T,H={}){let{prehash:b}=cq(H,Z);return T=m(T,b),L.fromBytes(M,"recovered").recoverPublicKey(T).toBytes()}return Object.freeze({keygen:D,getPublicKey:z,getSharedSecret:W,utils:w,lengths:V,Point:$,sign:C,verify:A,recoverPublicKey:E,Signature:L,hash:U})}function oZ($,U,J){return $&U^~$&J}function aZ($,U,J){return $&U^$&J^U&J}class nQ{blockLen;outputLen;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,U,J,G){this.blockLen=$,this.outputLen=U,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=xQ(this.buffer)}update($){l0(this),g$($);let{view:U,buffer:J,blockLen:G}=this,I=$.length;for(let Q=0;Q<I;){let X=Math.min(G-this.pos,I-Q);if(X===G){let O=xQ($);for(;G<=I-Q;Q+=G)this.process(O,Q);continue}if(J.set($.subarray(Q,Q+X),this.pos),this.pos+=X,Q+=X,this.pos===G)this.process(U,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){l0(this),FQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,SU(this.buffer.subarray(Q)),this.padOffset>G-Q)this.process(J,0),Q=0;for(let z=Q;z<G;z++)U[z]=0;J.setBigUint64(G-8,BigInt(this.length*8),I),this.process(J,0);let X=xQ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let q=O/4,D=this.get();if(q>D.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<q;z++)X.setUint32(4*z,D[z],I)}digest(){let{buffer:$,outputLen:U}=this;this.digestInto($);let J=$.slice(0,U);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:U,buffer:J,length:G,finished:I,destroyed:Q,pos:X}=this;if($.destroyed=Q,$.finished=I,$.length=G,$.pos=X,G%U)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var n0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),i0=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),UU=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),IU=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var iQ=BigInt(4294967295),tZ=BigInt(32);function RB($,U=!1){if(U)return{h:Number($&iQ),l:Number($>>tZ&iQ)};return{h:Number($>>tZ&iQ)|0,l:Number($&iQ)|0}}function cQ($,U=!1){let J=$.length,G=new Uint32Array(J),I=new Uint32Array(J);for(let Q=0;Q<J;Q++){let{h:X,l:O}=RB($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var tq=($,U,J)=>$>>>J,sq=($,U,J)=>$<<32-J|U>>>J,sI=($,U,J)=>$>>>J|U<<32-J,eI=($,U,J)=>$<<32-J|U>>>J,j8=($,U,J)=>$<<64-J|U>>>J-32,H8=($,U,J)=>$>>>J-32|U<<64-J;var sZ=($,U,J)=>$<<J|U>>>32-J,eZ=($,U,J)=>U<<J|$>>>32-J,$5=($,U,J)=>U<<J-32|$>>>64-J,U5=($,U,J)=>$<<J-32|U>>>64-J;function N0($,U,J,G){let I=(U>>>0)+(G>>>0);return{h:$+J+(I/4294967296|0)|0,l:I|0}}var I5=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),J5=($,U,J,G)=>U+J+G+($/4294967296|0)|0,G5=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),Q5=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,X5=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),O5=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var HB=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]),ZI=new Uint32Array(64);class eq extends nQ{constructor($){super(64,$,8,!1)}get(){let{A:$,B:U,C:J,D:G,E:I,F:Q,G:X,H:O}=this;return[$,U,J,G,I,Q,X,O]}set($,U,J,G,I,Q,X,O){this.A=$|0,this.B=U|0,this.C=J|0,this.D=G|0,this.E=I|0,this.F=Q|0,this.G=X|0,this.H=O|0}process($,U){for(let z=0;z<16;z++,U+=4)ZI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=ZI[z-15],w=ZI[z-2],V=J0(W,7)^J0(W,18)^W>>>3,Z=J0(w,17)^J0(w,19)^w>>>10;ZI[z]=Z+ZI[z-7]+V+ZI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:q,H:D}=this;for(let z=0;z<64;z++){let W=J0(X,6)^J0(X,11)^J0(X,25),w=D+W+oZ(X,O,q)+HB[z]+ZI[z]|0,Z=(J0(J,2)^J0(J,13)^J0(J,22))+aZ(J,G,I)|0;D=q,q=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+Z|0}J=J+this.A|0,G=G+this.B|0,I=I+this.C|0,Q=Q+this.D|0,X=X+this.E|0,O=O+this.F|0,q=q+this.G|0,D=D+this.H|0,this.set(J,G,I,Q,X,O,q,D)}roundClean(){SU(ZI)}destroy(){this.set(0,0,0,0,0,0,0,0),SU(this.buffer)}}class q5 extends eq{A=n0[0]|0;B=n0[1]|0;C=n0[2]|0;D=n0[3]|0;E=n0[4]|0;F=n0[5]|0;G=n0[6]|0;H=n0[7]|0;constructor(){super(32)}}class TB extends eq{A=i0[0]|0;B=i0[1]|0;C=i0[2]|0;D=i0[3]|0;E=i0[4]|0;F=i0[5]|0;G=i0[6]|0;H=i0[7]|0;constructor(){super(28)}}var D5=(()=>cQ(["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($))))(),KB=(()=>D5[0])(),AB=(()=>D5[1])(),gI=new Uint32Array(80),MI=new Uint32Array(80);class T8 extends nQ{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:q,El:D,Fh:z,Fl:W,Gh:w,Gl:V,Hh:Z,Hl:v}=this;return[$,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v]}set($,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v){this.Ah=$|0,this.Al=U|0,this.Bh=J|0,this.Bl=G|0,this.Ch=I|0,this.Cl=Q|0,this.Dh=X|0,this.Dl=O|0,this.Eh=q|0,this.El=D|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=V|0,this.Hh=Z|0,this.Hl=v|0}process($,U){for(let R=0;R<16;R++,U+=4)gI[R]=$.getUint32(U),MI[R]=$.getUint32(U+=4);for(let R=16;R<80;R++){let S=gI[R-15]|0,L=MI[R-15]|0,k=sI(S,L,1)^sI(S,L,8)^tq(S,L,7),x=eI(S,L,1)^eI(S,L,8)^sq(S,L,7),h=gI[R-2]|0,B=MI[R-2]|0,m=sI(h,B,19)^j8(h,B,61)^tq(h,B,6),a=eI(h,B,19)^H8(h,B,61)^sq(h,B,6),C=G5(x,a,MI[R-7],MI[R-16]),A=Q5(C,k,m,gI[R-7],gI[R-16]);gI[R]=A|0,MI[R]=C|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:q,Dl:D,Eh:z,El:W,Fh:w,Fl:V,Gh:Z,Gl:v,Hh:N,Hl:j}=this;for(let R=0;R<80;R++){let S=sI(z,W,14)^sI(z,W,18)^j8(z,W,41),L=eI(z,W,14)^eI(z,W,18)^H8(z,W,41),k=z&w^~z&Z,x=W&V^~W&v,h=X5(j,L,x,AB[R],MI[R]),B=O5(h,N,S,k,KB[R],gI[R]),m=h|0,a=sI(J,G,28)^j8(J,G,34)^j8(J,G,39),C=eI(J,G,28)^H8(J,G,34)^H8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=Z|0,j=v|0,Z=w|0,v=V|0,w=z|0,V=W|0,{h:z,l:W}=N0(q|0,D|0,B|0,m|0),q=X|0,D=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let M=I5(m,C,E);J=J5(M,B,a,A),G=M|0}({h:J,l:G}=N0(this.Ah|0,this.Al|0,J|0,G|0)),{h:I,l:Q}=N0(this.Bh|0,this.Bl|0,I|0,Q|0),{h:X,l:O}=N0(this.Ch|0,this.Cl|0,X|0,O|0),{h:q,l:D}=N0(this.Dh|0,this.Dl|0,q|0,D|0),{h:z,l:W}=N0(this.Eh|0,this.El|0,z|0,W|0),{h:w,l:V}=N0(this.Fh|0,this.Fl|0,w|0,V|0),{h:Z,l:v}=N0(this.Gh|0,this.Gl|0,Z|0,v|0),{h:N,l:j}=N0(this.Hh|0,this.Hl|0,N|0,j|0),this.set(J,G,I,Q,X,O,q,D,z,W,w,V,Z,v,N,j)}roundClean(){SU(gI,MI)}destroy(){SU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class PB extends T8{Ah=IU[0]|0;Al=IU[1]|0;Bh=IU[2]|0;Bl=IU[3]|0;Ch=IU[4]|0;Cl=IU[5]|0;Dh=IU[6]|0;Dl=IU[7]|0;Eh=IU[8]|0;El=IU[9]|0;Fh=IU[10]|0;Fl=IU[11]|0;Gh=IU[12]|0;Gl=IU[13]|0;Hh=IU[14]|0;Hl=IU[15]|0;constructor(){super(64)}}class z5 extends T8{Ah=UU[0]|0;Al=UU[1]|0;Bh=UU[2]|0;Bl=UU[3]|0;Ch=UU[4]|0;Cl=UU[5]|0;Dh=UU[6]|0;Dl=UU[7]|0;Eh=UU[8]|0;El=UU[9]|0;Fh=UU[10]|0;Fl=UU[11]|0;Gh=UU[12]|0;Gl=UU[13]|0;Hh=UU[14]|0;Hl=UU[15]|0;constructor(){super(48)}}var wU=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),VU=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class BB extends T8{Ah=wU[0]|0;Al=wU[1]|0;Bh=wU[2]|0;Bl=wU[3]|0;Ch=wU[4]|0;Cl=wU[5]|0;Dh=wU[6]|0;Dl=wU[7]|0;Eh=wU[8]|0;El=wU[9]|0;Fh=wU[10]|0;Fl=wU[11]|0;Gh=wU[12]|0;Gl=wU[13]|0;Hh=wU[14]|0;Hl=wU[15]|0;constructor(){super(28)}}class LB extends T8{Ah=VU[0]|0;Al=VU[1]|0;Bh=VU[2]|0;Bl=VU[3]|0;Ch=VU[4]|0;Cl=VU[5]|0;Dh=VU[6]|0;Dl=VU[7]|0;Eh=VU[8]|0;El=VU[9]|0;Fh=VU[10]|0;Fl=VU[11]|0;Gh=VU[12]|0;Gl=VU[13]|0;Hh=VU[14]|0;Hl=VU[15]|0;constructor(){super(32)}}var pQ=dJ(()=>new q5,WI(1));var Y5=dJ(()=>new z5,WI(2));/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var SB=BigInt(1),W5=BigInt(2),_B=BigInt(3),CB=BigInt(5),vd=BigInt(8),w5=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed");function EB($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=w5,O=$*$%Q*$%Q,q=oU(O,W5,Q)*O%Q,D=oU(q,SB,Q)*$%Q,z=oU(D,CB,Q)*D%Q,W=oU(z,U,Q)*z%Q,w=oU(W,J,Q)*W%Q,V=oU(w,G,Q)*w%Q,Z=oU(V,I,Q)*V%Q,v=oU(Z,I,Q)*V%Q,N=oU(v,U,Q)*z%Q;return{pow_p_5_8:oU(N,W5,Q)*$%Q,b2:O}}function bB($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var V5=(()=>{let $=w5;return lZ({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=EB(U);return MU(oU(J,_B,$)*G,$)},adjustScalarBytes:bB})})();/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var fB=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))(),kB=(()=>({p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff"),n:BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973"),h:BigInt(1),a:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc"),b:BigInt("0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef"),Gx:BigInt("0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7"),Gy:BigInt("0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f")}))();var FB=oq(fB),$D=aq(FB,pQ);var uB=oq(kB),v5=aq(uB,Y5);function Z5($,U,J){if(pU($),J===void 0)J=new Uint8Array($.outputLen);return pJ($,J,U)}var UD=Uint8Array.of(0),N5=Uint8Array.of();function g5($,U,J,G=32){pU($),p$(G,"length");let I=$.outputLen;if(G>255*I)throw Error("Length must be <= 255*HashLen");let Q=Math.ceil(G/I);if(J===void 0)J=N5;else g$(J,void 0,"info");let X=new Uint8Array(Q*I),O=pJ.create($,U),q=O._cloneInto(),D=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)UD[0]=z+1,q.update(z===0?N5:D).update(J).update(UD).digestInto(D),X.set(D,I*z),O._cloneInto(q);return O.destroy(),q.destroy(),SU(D,UD),X.slice(0,G)}var xB=BigInt(0),K8=BigInt(1),mB=BigInt(2),yB=BigInt(7),rB=BigInt(256),hB=BigInt(113),j5=[],H5=[],T5=[];for(let $=0,U=K8,J=1,G=0;$<24;$++){[J,G]=[G,(2*J+3*G)%5],j5.push(2*(5*G+J)),H5.push(($+1)*($+2)/2%64);let I=xB;for(let Q=0;Q<7;Q++)if(U=(U<<K8^(U>>yB)*hB)%rB,U&mB)I^=K8<<(K8<<BigInt(Q))-K8;T5.push(I)}var K5=cQ(T5,!0),lB=K5[0],dB=K5[1],M5=($,U,J)=>J>32?$5($,U,J):sZ($,U,J),R5=($,U,J)=>J>32?U5($,U,J):eZ($,U,J);function nB($,U=24){let J=new Uint32Array(10);for(let G=24-U;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 O=(X+8)%10,q=(X+2)%10,D=J[q],z=J[q+1],W=M5(D,z,1)^J[O],w=R5(D,z,1)^J[O+1];for(let V=0;V<50;V+=10)$[X+V]^=W,$[X+V+1]^=w}let I=$[2],Q=$[3];for(let X=0;X<24;X++){let O=H5[X],q=M5(I,Q,O),D=R5(I,Q,O),z=j5[X];I=$[z],Q=$[z+1],$[z]=q,$[z+1]=D}for(let X=0;X<50;X+=10){for(let O=0;O<10;O++)J[O]=$[X+O];for(let O=0;O<10;O++)$[X+O]^=~J[(O+2)%10]&J[(O+4)%10]}$[0]^=lB[G],$[1]^=dB[G]}SU(J)}class oQ{state;pos=0;posOut=0;finished=!1;state32;destroyed=!1;blockLen;suffix;outputLen;enableXOF=!1;rounds;constructor($,U,J,G=!1,I=24){if(this.blockLen=$,this.suffix=U,this.outputLen=J,this.enableXOF=G,this.rounds=I,p$(J,"outputLen"),!(0<$&&$<200))throw Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=uQ(this.state)}clone(){return this._cloneInto()}keccak(){bq(this.state32),nB(this.state32,this.rounds),bq(this.state32),this.posOut=0,this.pos=0}update($){l0(this),g$($);let{blockLen:U,state:J}=this,G=$.length;for(let I=0;I<G;){let Q=Math.min(U-this.pos,G-I);for(let X=0;X<Q;X++)J[this.pos++]^=$[I++];if(this.pos===U)this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;let{state:$,suffix:U,pos:J,blockLen:G}=this;if($[J]^=U,(U&128)!==0&&J===G-1)this.keccak();$[G-1]^=128,this.keccak()}writeInto($){l0(this,!1),g$($),this.finish();let U=this.state,{blockLen:J}=this;for(let G=0,I=$.length;G<I;){if(this.posOut>=J)this.keccak();let Q=Math.min(J-this.posOut,I-G);$.set(U.subarray(this.posOut,this.posOut+Q),G),this.posOut+=Q,G+=Q}return $}xofInto($){if(!this.enableXOF)throw Error("XOF is not possible for this instance");return this.writeInto($)}xof($){return p$($),this.xofInto(new Uint8Array($))}digestInto($){if(FQ($,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,SU(this.state)}_cloneInto($){let{blockLen:U,suffix:J,outputLen:G,rounds:I,enableXOF:Q}=this;return $||=new oQ(U,J,G,Q,I),$.state32.set(this.state32),$.pos=this.pos,$.posOut=this.posOut,$.finished=this.finished,$.rounds=I,$.suffix=J,$.outputLen=G,$.enableXOF=Q,$.destroyed=this.destroyed,$}}var A5=($,U,J,G={})=>dJ(()=>new oQ(U,$,J),G);var $J=A5(6,136,32,WI(8));var P5=A5(6,72,64,WI(10));var B5=($,U,J,G={})=>dJ((I={})=>new oQ(U,$,I.dkLen===void 0?J:I.dkLen,!0),G),L5=B5(31,168,16,WI(11)),Z0=B5(31,136,32,WI(12));function ID($){if(!Number.isSafeInteger($)||$<0||$>4294967295)throw Error("wrong u32 integer:"+$);return $}function _5($){return ID($),($&$-1)===0&&$!==0}function JD($,U){ID($);let J=0;for(let G=0;G<U;G++,$>>>=1)J=J<<1|$&1;return J}function C5($){return ID($),31-Math.clz32($)}function S5($){let U=$.length;if(U<2||!_5(U))throw Error("n must be a power of 2 and greater than 1. Got "+U);let J=C5(U);for(let G=0;G<U;G++){let I=JD(G,J);if(G<I){let Q=$[G];$[G]=$[I],$[I]=Q}}return $}var GD=($,U)=>{let{N:J,roots:G,dit:I,invertButterflies:Q=!1,skipStages:X=0,brp:O=!0}=U,q=C5(J);if(!_5(J))throw Error("FFT: Polynomial size should be power of two");let D=I!==Q;return(z)=>{if(z.length!==J)throw Error("FFT: wrong Polynomial length");if(I&&O)S5(z);for(let W=0,w=1;W<q-X;W++){let V=I?W+1+X:q-W,Z=1<<V,v=Z>>1,N=J>>V;for(let j=0;j<J;j+=Z)for(let R=0,S=w++;R<v;R++){let L=Q?I?J-S:S:R*N,k=j+R,x=j+R+v,h=G[L],B=z[x],m=z[k];if(D){let a=$.mul(B,h);z[k]=$.add(m,a),z[x]=$.sub(m,a)}else if(Q)z[k]=$.add(B,m),z[x]=$.mul($.sub(B,m),h);else z[k]=$.add(m,B),z[x]=$.mul($.sub(m,B),h)}}if(!I&&O)S5(z);return z}};/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var g0=YI;function aQ($,U){if($.length!==U.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^U[G];return J===0}function E5($){return Uint8Array.from($)}function UJ($,...U){let J=(I)=>typeof I==="number"?I:I.bytesLen,G=U.reduce((I,Q)=>I+J(Q),0);return{bytesLen:G,encode:(I)=>{let Q=new Uint8Array(G);for(let X=0,O=0;X<U.length;X++){let q=U[X],D=J(q),z=typeof q==="number"?I[X]:q.encode(I[X]);if(g$(z,D,$),Q.set(z,O),typeof q!=="number")z.fill(0);O+=D}return Q},decode:(I)=>{g$(I,G,$);let Q=[];for(let X of U){let O=J(X),q=I.subarray(0,O);Q.push(typeof X==="number"?q:X.decode(q)),I=I.subarray(O)}return Q}}}function tQ($,U){let J=U*$.bytesLen;return{bytesLen:J,encode:(G)=>{if(G.length!==U)throw Error(`vecCoder.encode: wrong length=${G.length}. Expected: ${U}`);let I=new Uint8Array(J);for(let Q=0,X=0;Q<G.length;Q++){let O=$.encode(G[Q]);I.set(O,X),O.fill(0),X+=O.length}return I},decode:(G)=>{g$(G,J);let I=[];for(let Q=0;Q<G.length;Q+=$.bytesLen)I.push($.decode(G.subarray(Q,Q+$.bytesLen)));return I}}}function n$(...$){for(let U of $)if(Array.isArray(U))for(let J of U)J.fill(0);else U.fill(0)}function QD($){return(1<<$)-1}var _d=Uint8Array.of();/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var b5=($)=>{let{newPoly:U,N:J,Q:G,F:I,ROOT_OF_UNITY:Q,brvBits:X,isKyber:O}=$,q=(R,S=G)=>{let L=R%S|0;return(L>=0?L|0:S+L|0)|0},D=(R,S=G)=>{let L=q(R,S)|0;return(L>S>>1?L-S|0:L)|0};function z(){let R=U(J);for(let S=0;S<J;S++){let L=JD(S,X),k=BigInt(Q)**BigInt(L)%BigInt(G);R[S]=Number(k)|0}return R}let W=z(),w={add:(R,S)=>q((R|0)+(S|0))|0,sub:(R,S)=>q((R|0)-(S|0))|0,mul:(R,S)=>q((R|0)*(S|0))|0,inv:(R)=>{throw Error("not implemented")}},V={N:J,roots:W,invertButterflies:!0,skipStages:O?1:0,brp:!1},Z=GD(w,{dit:!1,...V}),v=GD(w,{dit:!0,...V});return{mod:q,smod:D,nttZetas:W,NTT:{encode:(R)=>{return Z(R)},decode:(R)=>{v(R);for(let S=0;S<R.length;S++)R[S]=q(I*R[S]);return R}},bitsCoder:(R,S)=>{let L=QD(R),k=R*(J/8);return{bytesLen:k,encode:(x)=>{let h=new Uint8Array(k);for(let B=0,m=0,a=0,C=0;B<x.length;B++){m|=(S.encode(x[B])&L)<<a,a+=R;for(;a>=8;a-=8,m>>=8)h[C++]=m&QD(a)}return h},decode:(x)=>{let h=U(J);for(let B=0,m=0,a=0,C=0;B<x.length;B++){m|=x[B]<<a,a+=8;for(;a>=R;a-=R,m>>=R)h[C++]=S.decode(m&L)}return h}}}}},iB=($)=>(U,J)=>{if(!J)J=$.blockLen;let G=new Uint8Array(U.length+2);G.set(U);let I=U.length,Q=new Uint8Array(J),X=$.create({}),O=0,q=0;return{stats:()=>({calls:O,xofs:q}),get:(D,z)=>{return G[I+0]=D,G[I+1]=z,X.destroy(),X=$.create({}).update(G),O++,()=>{return q++,X.xofInto(Q)}},clean:()=>{X.destroy(),n$(Q,G)}}},f5=iB(L5);/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var vU=256,c0=3329,cB=3303,pB=17,{mod:B8,nttZetas:oB,NTT:IJ,bitsCoder:aB}=b5({N:vU,Q:c0,F:cB,ROOT_OF_UNITY:pB,newPoly:($)=>new Uint16Array($),brvBits:7,isKyber:!0}),XD={512:{N:vU,Q:c0,K:2,ETA1:3,ETA2:2,du:10,dv:4,RBGstrength:128},768:{N:vU,Q:c0,K:3,ETA1:2,ETA2:2,du:10,dv:4,RBGstrength:192},1024:{N:vU,Q:c0,K:4,ETA1:2,ETA2:2,du:11,dv:5,RBGstrength:256}},tB=($)=>{if($>=12)return{encode:(J)=>J,decode:(J)=>J};let U=2**($-1);return{encode:(J)=>((J<<$)+c0/2)/c0,decode:(J)=>J*c0+U>>>$}},A8=($)=>aB($,tB($));function JJ($,U){for(let J=0;J<vU;J++)$[J]=B8($[J]+U[J])}function sB($,U){for(let J=0;J<vU;J++)$[J]=B8($[J]-U[J])}function eB($,U,J,G,I){let Q=B8(U*G*I+$*J),X=B8($*G+U*J);return{c0:Q,c1:X}}function sQ($,U){for(let J=0;J<vU/2;J++){let G=oB[64+(J>>1)];if(J&1)G=-G;let{c0:I,c1:Q}=eB($[2*J+0],$[2*J+1],U[2*J+0],U[2*J+1],G);$[2*J+0]=I,$[2*J+1]=Q}return $}function k5($){let U=new Uint16Array(vU);for(let J=0;J<vU;){let G=$();if(G.length%3)throw Error("SampleNTT: unaligned block");for(let I=0;J<vU&&I+3<=G.length;I+=3){let Q=(G[I+0]>>0|G[I+1]<<8)&4095,X=(G[I+1]>>4|G[I+2]<<4)&4095;if(Q<c0)U[J++]=Q;if(J<vU&&X<c0)U[J++]=X}}return U}function P8($,U,J,G){let I=$(G*vU/4,U,J),Q=new Uint16Array(vU),X=uQ(I),O=0;for(let q=0,D=0,z=0,W=0;q<X.length;q++){let w=X[q];for(let V=0;V<32;V++)if(z+=w&1,w>>=1,O+=1,O===G)W=z,z=0;else if(O===2*G)Q[D++]=B8(W-z),z=0,O=0}if(O)throw Error(`sampleCBD: leftover bits: ${O}`);return Q}var $L=($)=>{let{K:U,PRF:J,XOF:G,HASH512:I,ETA1:Q,ETA2:X,du:O,dv:q}=$,D=A8(1),z=A8(q),W=A8(O),w=UJ("publicKey",tQ(A8(12),U),32),V=tQ(A8(12),U),Z=UJ("ciphertext",tQ(W,U),z),v=UJ("seed",32,32);return{secretCoder:V,lengths:{secretKey:V.bytesLen,publicKey:w.bytesLen,cipherText:Z.bytesLen},keygen:(N)=>{g$(N,32,"seed");let j=new Uint8Array(33);j.set(N),j[32]=U;let R=I(j),[S,L]=v.decode(R),k=[],x=[];for(let m=0;m<U;m++)k.push(IJ.encode(P8(J,L,m,Q)));let h=G(S);for(let m=0;m<U;m++){let a=IJ.encode(P8(J,L,U+m,Q));for(let C=0;C<U;C++){let A=k5(h.get(C,m));JJ(a,sQ(A,k[C]))}x.push(a)}h.clean();let B={publicKey:w.encode([x,S]),secretKey:V.encode(k)};return n$(S,L,k,x,j,R),B},encrypt:(N,j,R)=>{let[S,L]=w.decode(N),k=[];for(let C=0;C<U;C++)k.push(IJ.encode(P8(J,R,C,Q)));let x=G(L),h=new Uint16Array(vU),B=[];for(let C=0;C<U;C++){let A=P8(J,R,U+C,X),E=new Uint16Array(vU);for(let M=0;M<U;M++){let T=k5(x.get(C,M));JJ(E,sQ(T,k[M]))}JJ(A,IJ.decode(E)),B.push(A),JJ(h,sQ(S[C],k[C])),n$(E)}x.clean();let m=P8(J,R,2*U,X);JJ(m,IJ.decode(h));let a=D.decode(j);return JJ(a,m),n$(S,k,h,m),Z.encode([B,a])},decrypt:(N,j)=>{let[R,S]=Z.decode(N),L=V.decode(j),k=new Uint16Array(vU);for(let x=0;x<U;x++)JJ(k,sQ(L[x],IJ.encode(R[x])));return sB(S,IJ.decode(k)),n$(k,L,R),D.encode(S)}}};function OD($){let U=$L($),{HASH256:J,HASH512:G,KDF:I}=$,{secretCoder:Q,lengths:X}=U,O=UJ("secretKey",X.secretKey,X.publicKey,32,32),q=32,D=64;return{info:{type:"ml-kem"},lengths:{...X,seed:64,msg:32,msgRand:32,secretKey:O.bytesLen},keygen:(z=g0(64))=>{g$(z,64,"seed");let{publicKey:W,secretKey:w}=U.keygen(z.subarray(0,32)),V=J(W),Z=O.encode([w,W,V,z.subarray(32)]);return n$(w,V),{publicKey:W,secretKey:Z}},getPublicKey:(z)=>{let[W,w,V,Z]=O.decode(z);return Uint8Array.from(w)},encapsulate:(z,W=g0(32))=>{g$(z,X.publicKey,"publicKey"),g$(W,32,"message");let w=z.subarray(0,384*$.K),V=Q.encode(Q.decode(E5(w)));if(!aQ(V,w))throw n$(V),Error("ML-KEM.encapsulate: wrong publicKey modulus");n$(V);let Z=G.create().update(W).update(J(z)).digest(),v=U.encrypt(z,W,Z.subarray(32,64));return n$(Z.subarray(32)),{cipherText:v,sharedSecret:Z.subarray(0,32)}},decapsulate:(z,W)=>{g$(W,O.bytesLen,"secretKey"),g$(z,X.cipherText,"cipherText");let w=O.bytesLen-96,V=w+32,Z=J(W.subarray(w/2,V));if(!aQ(Z,W.subarray(V,V+32)))throw Error("invalid secretKey: hash check failed");let[v,N,j,R]=O.decode(W),S=U.decrypt(z,v),L=G.create().update(S).update(j).digest(),k=L.subarray(0,32),x=U.encrypt(N,S,L.subarray(32,64)),h=aQ(z,x),B=I.create({dkLen:32}).update(R).update(z).digest();return n$(S,x,!h?k:B),h?k:B}}}function UL($,U,J){return Z0.create({dkLen:$}).update(U).update(new Uint8Array([J])).digest()}var qD={HASH256:$J,HASH512:P5,KDF:Z0,XOF:f5,PRF:UL},rd=OD({...qD,...XD[512]}),L8=OD({...qD,...XD[768]}),F5=OD({...qD,...XD[1024]});/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */function IL($,U=!1){let{lengths:J,keygen:G}=$;if(U){let Q=$.Point.Fn;if(!Q)throw Error("No Point.Fn");G=(X=g0(J.seed))=>{g$(X,J.seed,"seed");let O=Q.isLE?VI(X):wI(X),q=Q.toBytes(Q.create(O));return{secretKey:q,publicKey:$.getPublicKey(q)}}}return{lengths:{secretKey:J.secretKey,publicKey:J.publicKey,seed:J.seed},keygen:G,getPublicKey:(I)=>$.getPublicKey(I)}}function DD($,U=!1){let J=IL($,U);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,I=g0($.lengths.seed)){let Q=this.keygen(I).secretKey,X=this.decapsulate(G,Q),O=$.getPublicKey(Q);return n$(Q),{sharedSecret:X,cipherText:O}},decapsulate(G,I){let Q=$.getSharedSecret(I,G);return $.lengths.publicKeyHasPrefix?Q.subarray(1):Q}}}function S8($,U){return UJ(U,...$.map((J)=>{if(typeof J.lengths[U]!=="number")throw Error("wrong length: "+U);return J.lengths[U]}))}function zD($){return(U,J)=>$(U,{dkLen:J})}function JL($,U,...J){let G=S8(J,"seed"),I=S8(J,"publicKey");if($===void 0)$=G.bytesLen;p$($);function Q(X){g$(X,$);let O=G.decode(U(X,G.bytesLen)),q=J.map((W,w)=>W.keygen(O[w])),D=q.map((W)=>W.secretKey),z=q.map((W)=>W.publicKey);return{secretKey:D,publicKey:z}}return{info:{lengths:{seed:$,publicKey:I.bytesLen,secretKey:$}},getPublicKey(X){return this.keygen(X).publicKey},keygen(X=g0($)){let{publicKey:O,secretKey:q}=Q(X),D=I.encode(O);return n$(O),n$(q),{secretKey:X,publicKey:D}},expandDecapsulationKey:Q,realSeedLen:$}}function eQ($,U,J,G,...I){let Q=JL($,J,...I),X=S8(I,"cipherText"),O=S8(I,"publicKey"),q=S8(I,"msg");if(U===void 0)U=q.bytesLen;return p$(U),{lengths:{...Q.info.lengths,msg:U,msgRand:q.bytesLen,cipherText:X.bytesLen},getPublicKey:Q.getPublicKey,keygen:Q.keygen,encapsulate(D,z=g0(q.bytesLen)){let W=O.decode(D),w=q.decode(z),V=I.map((j,R)=>j.encapsulate(W[R],w[R])),Z=V.map((j)=>j.sharedSecret),v=V.map((j)=>j.cipherText),N={sharedSecret:G(W,v,Z),cipherText:X.encode(v)};return n$(Z,v),N},decapsulate(D,z){let W=X.decode(D),{publicKey:w,secretKey:V}=Q.expandDecapsulationKey(z),Z=I.map((v,N)=>v.decapsulate(W[N],V[N]));return G(w,W,Z)}}}function u5($,U,J,G,I){return pU(G),pU(I),eQ(32,32,zD(G),(Q,X,O)=>I(r$(O[0],O[1],X[1],Q[1],vI($))),U,J)}var sd=u5("QSF-KEM(ML-KEM-768,P-256)-XOF(SHAKE256)-KDF(SHA3-256)",L8,DD($D,!0),Z0,$J),ed=u5("QSF-KEM(ML-KEM-1024,P-384)-XOF(SHAKE256)-KDF(SHA3-256)",F5,DD(v5,!0),Z0,$J);function GL($,U,J,G,I){return pU(G),pU(I),eQ(32,32,zD(G),(Q,X,O)=>{let q=r$(O[0],O[1],X[0],Q[0],X[1],Q[1],vI($)),D=32,z=r$(vI("hybrid_prk"),q),W=Z5(I,z),w=r$(nJ(32,2),vI("shared_secret"),vI("")),V=g5(I,W,w,32);return n$(W,w,z,q),V},U,J)}var x5=DD(V5),$n=GL("KitchenSink-KEM(ML-KEM-768,X25519)-XOF(SHAKE256)-KDF(HKDF-SHA-256)",L8,x5,Z0,pQ),QL=(()=>eQ(32,32,zD(Z0),($,U,J)=>$J(r$(J[0],J[1],U[1],$[1],vI("\\.//^\\"))),L8,x5))();function XL($,U,J,G){let I=$.Point.Fn;if(!I)throw Error("no Point.Fn");function Q(X){let O;for(let z=0,W=U;;z=W,W+=U){if(W>X.length)throw Error("rejection sampling failed");if(O=I.fromBytes(X.subarray(z,W),!0),I.isValidNot0(O))break}let q=I.toBytes(I.create(O)),D=$.getPublicKey(q,!1);return{secretKey:q,publicKey:D}}return{lengths:{secretKey:U,publicKey:J,seed:G,msg:G,cipherText:J},keygen(X=g0(G)){return g$(X,G,"seed"),Q(X)},getPublicKey(X){return $.getPublicKey(X,!1)},encapsulate(X,O=g0(G)){g$(O,G,"rand");let{secretKey:q}=Q(O),D=this.decapsulate(X,q),z=$.getPublicKey(q,!1);return n$(q),{sharedSecret:D,cipherText:z}},decapsulate(X,O){return $.getSharedSecret(O,X).subarray(1)}}}function OL($,U,J,G){let{secretKey:I,publicKeyUncompressed:Q}=J.lengths;if(!I||!Q)throw Error("wrong curve");let X=XL(J,I,Q,G),O=64,q=O+G;return eQ(32,32,(D)=>{g$(D,32);let z=Z0(D,{dkLen:q}),W=z.subarray(0,O),w=z.subarray(O,q);return r$(W,w)},(D,z,W)=>$J(r$(W[0],W[1],z[1],D[1],vI($))),U,X)}var qL=(()=>OL("MLKEM768-P256",L8,$D,128))();var $4=QL,m5=qL;/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var S$=($,U,J)=>t$($,U,J),WD=m$,aJ=KQ,JU=(...$)=>wq(...$),tJ=($)=>G8($),sJ=zq,eJ=($)=>x0($),I4=BigInt(0),YD=BigInt(1);function p0($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw TypeError(J+"expected boolean, got type="+typeof $)}return $}function J4($){if(typeof $==="bigint"){if(!U4($))throw RangeError("positive bigint expected, got "+$)}else WD($);return $}function M0($,U=""){if(typeof $!=="number"){let J=U&&`"${U}" `;throw TypeError(J+"expected number, got type="+typeof $)}if(!Number.isSafeInteger($)){let J=U&&`"${U}" `;throw RangeError(J+"expected safe integer, got "+$)}}function _8($){let U=J4($).toString(16);return U.length&1?"0"+U:U}function y5($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);return $===""?I4:BigInt("0x"+$)}function GJ($){return y5(KQ($))}function G0($){return y5(KQ(RI(t$($)).reverse()))}function G4($,U){if(m$(U),U===0)throw RangeError("zero length");$=J4($);let J=$.toString(16);if(J.length>U*2)throw RangeError("number too large");return G8(J.padStart(U*2,"0"))}function C8($,U){return G4($,U).reverse()}function r5($,U){if($=S$($),U=S$(U),$.length!==U.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^U[G];return J===0}function RI($){return Uint8Array.from(S$($))}function Q4($){if(typeof $!=="string")throw TypeError("ascii string expected, got "+typeof $);return Uint8Array.from($,(U,J)=>{let G=U.charCodeAt(0);if(U.length!==1||G>127)throw RangeError(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var U4=($)=>typeof $==="bigint"&&I4<=$;function DL($,U,J){return U4($)&&U4(U)&&U4(J)&&U<=$&&$<J}function o0($,U,J,G){if(!DL(U,J,G))throw RangeError("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function $G($){if($<I4)throw Error("expected non-negative bigint, got "+$);let U;for(U=0;$>I4;$>>=YD,U+=1);return U}var E8=($)=>(YD<<BigInt($))-YD;function h5($,U,J){if(m$($,"hashLen"),m$(U,"qByteLen"),typeof J!=="function")throw TypeError("hmacFn must be a function");let G=(N)=>new Uint8Array(N),I=Uint8Array.of(),Q=Uint8Array.of(0),X=Uint8Array.of(1),O=1000,q=G($),D=G($),z=0,W=()=>{q.fill(1),D.fill(0),z=0},w=(...N)=>J(D,JU(q,...N)),V=(N=I)=>{if(D=w(Q,N),q=w(),N.length===0)return;D=w(X,N),q=w()},Z=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){q=w();let R=q.slice();j.push(R),N+=q.length}return JU(...j)};return(N,j)=>{W(),V(N);let R=void 0;while((R=j(Z()))===void 0)V();return W(),R}}function aU($,U={},J={}){if(Object.prototype.toString.call($)!=="[object Object]")throw TypeError("expected valid options object");function G(Q,X,O){if(!O&&X!=="function"&&!Object.hasOwn($,Q))throw TypeError(`param "${Q}" is invalid: expected own property`);let q=$[Q];if(O&&q===void 0)return;let D=typeof q;if(D!==X||q===null)throw TypeError(`param "${Q}" is invalid: expected ${X}, got ${D}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,q])=>G(O,q,X));I(U,!1),I(J,!0)}var wD=()=>{throw Error("not implemented")};/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var GU=BigInt(0),u$=BigInt(1),QJ=BigInt(2),i5=BigInt(3),c5=BigInt(4),p5=BigInt(5),zL=BigInt(7),o5=BigInt(8),YL=BigInt(9),a5=BigInt(16);function F$($,U){if(U<=GU)throw Error("mod: expected positive modulus, got "+U);let J=$%U;return J>=GU?J:U+J}function tU($,U,J){if(U<GU)throw Error("pow2: expected non-negative exponent, got "+U);let G=$;while(U-- >GU)G*=G,G%=J;return G}function l5($,U){if($===GU)throw Error("invert: expected non-zero number");if(U<=GU)throw Error("invert: expected positive modulus, got "+U);let J=F$($,U),G=U,I=GU,Q=u$,X=u$,O=GU;while(J!==GU){let D=G/J,z=G-J*D,W=I-X*D,w=Q-O*D;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==u$)throw Error("invert: does not exist");return F$(I,U)}function VD($,U,J){let G=$;if(!G.eql(G.sqr(U),J))throw Error("Cannot find square root")}function t5($,U){let J=$,G=(J.ORDER+u$)/c5,I=J.pow(U,G);return VD(J,I,U),I}function WL($,U){let J=$,G=(J.ORDER-p5)/o5,I=J.mul(U,QJ),Q=J.pow(I,G),X=J.mul(U,Q),O=J.mul(J.mul(X,QJ),Q),q=J.mul(X,J.sub(O,J.ONE));return VD(J,q,U),q}function wL($){let U=X4($),J=s5($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+zL)/a5;return(O,q)=>{let D=O,z=D.pow(q,X),W=D.mul(z,G),w=D.mul(z,I),V=D.mul(z,Q),Z=D.eql(D.sqr(W),q),v=D.eql(D.sqr(w),q);z=D.cmov(z,W,Z),W=D.cmov(V,w,v);let N=D.eql(D.sqr(W),q),j=D.cmov(z,W,N);return VD(D,j,q),j}}function s5($){if($<i5)throw Error("sqrt is not defined for small field");let U=$-u$,J=0;while(U%QJ===GU)U/=QJ,J++;let G=QJ,I=X4($);while(d5(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return t5;let Q=I.pow(G,U),X=(U+u$)/QJ;return function(q,D){let z=q;if(z.is0(D))return D;if(d5(z,D)!==1)throw Error("Cannot find square root");let W=J,w=z.mul(z.ONE,Q),V=z.pow(D,U),Z=z.pow(D,X);while(!z.eql(V,z.ONE)){if(z.is0(V))return z.ZERO;let v=1,N=z.sqr(V);while(!z.eql(N,z.ONE))if(v++,N=z.sqr(N),v===W)throw Error("Cannot find square root");let j=u$<<BigInt(W-v-1),R=z.pow(w,j);W=v,w=z.sqr(R),V=z.mul(V,w),Z=z.mul(Z,R)}return Z}}function VL($){if($%c5===i5)return t5;if($%o5===p5)return WL;if($%a5===YL)return wL($);return s5($)}var a0=($,U)=>(F$($,U)&u$)===u$,vL=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function vD($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=vL.reduce((G,I)=>{return G[I]="function",G},U);if(aU($,J),M0($.BYTES,"BYTES"),M0($.BITS,"BITS"),$.BYTES<1||$.BITS<1)throw Error("invalid field: expected BYTES/BITS > 0");if($.ORDER<=u$)throw Error("invalid field: expected ORDER > 1, got "+$.ORDER);return $}function NL($,U,J){let G=$;if(J<GU)throw Error("invalid exponent, negatives unsupported");if(J===GU)return G.ONE;if(J===u$)return U;let I=G.ONE,Q=U;while(J>GU){if(J&u$)I=G.mul(I,Q);Q=G.sqr(Q),J>>=u$}return I}function b8($,U,J=!1){let G=$,I=Array(U.length).fill(J?G.ZERO:void 0),Q=U.reduce((O,q,D)=>{if(G.is0(q))return O;return I[D]=O,G.mul(O,q)},G.ONE),X=G.inv(Q);return U.reduceRight((O,q,D)=>{if(G.is0(q))return O;return I[D]=G.mul(O,I[D]),G.mul(O,q)},X),I}function d5($,U){let J=$,G=(J.ORDER-u$)/QJ,I=J.pow(U,G),Q=J.eql(I,J.ONE),X=J.eql(I,J.ZERO),O=J.eql(I,J.neg(J.ONE));if(!Q&&!X&&!O)throw Error("invalid Legendre symbol result");return Q?1:X?0:-1}function ZL($,U){if(U!==void 0)WD(U);if($<=GU)throw Error("invalid n length: expected positive n, got "+$);if(U!==void 0&&U<1)throw Error("invalid n length: expected positive bit length, got "+U);let J=$G($);if(U!==void 0&&U<J)throw Error(`invalid n length: expected bit length (${J}) >= n.length (${U})`);let G=U!==void 0?U:J,I=Math.ceil(G/8);return{nBitLength:G,nByteLength:I}}var n5=new WeakMap;class ND{ORDER;BITS;BYTES;isLE;ZERO=GU;ONE=u$;_lengths;_mod;constructor($,U={}){if($<=u$)throw Error("invalid field: expected ORDER > 1, got "+$);let J=void 0;if(this.isLE=!1,U!=null&&typeof U==="object"){if(typeof U.BITS==="number")J=U.BITS;if(typeof U.sqrt==="function")Object.defineProperty(this,"sqrt",{value:U.sqrt,enumerable:!0});if(typeof U.isLE==="boolean")this.isLE=U.isLE;if(U.allowedLengths)this._lengths=Object.freeze(U.allowedLengths.slice());if(typeof U.modFromBytes==="boolean")this._mod=U.modFromBytes}let{nBitLength:G,nByteLength:I}=ZL($,J);if(I>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=I,Object.freeze(this)}create($){return F$($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw TypeError("invalid field element: expected bigint, got "+typeof $);return GU<=$&&$<this.ORDER}is0($){return $===GU}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&u$)===u$}neg($){return F$(-$,this.ORDER)}eql($,U){return $===U}sqr($){return F$($*$,this.ORDER)}add($,U){return F$($+U,this.ORDER)}sub($,U){return F$($-U,this.ORDER)}mul($,U){return F$($*U,this.ORDER)}pow($,U){return NL(this,$,U)}div($,U){return F$($*l5(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return l5($,this.ORDER)}sqrt($){let U=n5.get(this);if(!U)n5.set(this,U=VL(this.ORDER));return U(this,$)}toBytes($){return this.isLE?C8($,this.BYTES):G4($,this.BYTES)}fromBytes($,U=!1){S$($);let{_lengths:J,BYTES:G,isLE:I,ORDER:Q,_mod:X}=this;if(J){if($.length<1||!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let q=new Uint8Array(G);q.set($,I?0:q.length-$.length),$=q}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?G0($):GJ($);if(X)O=F$(O,Q);if(!U){if(!this.isValid(O))throw Error("invalid field element: outside of range 0..ORDER")}return O}invertBatch($){return b8(this,$)}cmov($,U,J){return p0(J,"condition"),J?U:$}}Object.freeze(ND.prototype);function X4($,U={}){return new ND($,U)}function e5($){if(typeof $!=="bigint")throw Error("field order must be bigint");if($<=u$)throw Error("field order must be greater than 1");let U=$G($-u$);return Math.ceil(U/8)}function ZD($){let U=e5($);return U+Math.ceil(U/2)}function $g($,U,J=!1){S$($);let G=$.length,I=e5(U),Q=Math.max(ZD(U),16);if(G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?G0($):GJ($),O=F$(X,U-u$)+u$;return J?C8(O,I):G4(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var UG=BigInt(0),XJ=BigInt(1);function f8($,U){let J=U.negate();return $?J:U}function OJ($,U){let J=b8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function Gg($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function gD($,U){Gg($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=E8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function Ug($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),q=$>>X;if(O>G)O-=Q,q+=XJ;let D=U*G,z=D+Math.abs(O)-1,W=O===0,w=O<0,V=U%2!==0;return{nextN:q,offset:z,isZero:W,isNeg:w,isNegF:V,offsetF:D}}var MD=new WeakMap,Qg=new WeakMap;function RD($){return Qg.get($)||1}function Ig($){if($!==UG)throw Error("invalid wNAF")}class k8{BASE;ZERO;Fn;bits;constructor($,U){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=U}_unsafeLadder($,U,J=this.ZERO){let G=$;while(U>UG){if(U&XJ)J=J.add(G);G=G.double(),U>>=XJ}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=gD(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let q=1;q<G;q++)X=X.add(Q),I.push(X);Q=X.double()}return I}wNAF($,U,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,I=this.BASE,Q=gD($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:q,isZero:D,isNeg:z,isNegF:W,offsetF:w}=Ug(J,X,Q);if(J=O,D)I=I.add(f8(W,U[w]));else G=G.add(f8(z,U[q]))}return Ig(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=gD($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===UG)break;let{nextN:X,offset:O,isZero:q,isNeg:D}=Ug(J,Q,I);if(J=X,q)continue;else{let z=U[O];G=G.add(D?z.negate():z)}}return Ig(J),G}getPrecomputes($,U,J){let G=MD.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);MD.set(U,G)}}return G}cached($,U,J){let G=RD($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=RD($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){Gg(U,this.bits),Qg.set($,U),MD.delete($)}hasCache($){return RD($)!==1}}function Xg($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>UG||G>UG){if(J&XJ)Q=Q.add(I);if(G&XJ)X=X.add(I);I=I.double(),J>>=XJ,G>>=XJ}return{p1:Q,p2:X}}function Jg($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return vD(U),U}else return X4($,{isLE:J})}function O4($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let q of["p","n","h"]){let D=U[q];if(!(typeof D==="bigint"&&D>UG))throw Error(`CURVE.${q} must be positive bigint`)}let I=Jg(U.p,J.Fp,G),Q=Jg(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let q of O)if(!I.isValid(U[q]))throw Error(`CURVE.${q} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function F8($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}function u8($,U){if(M0($),M0(U),U<0||U>4)throw Error("invalid I2OSP length: "+U);if($<0||$>2**(8*U)-1)throw Error("invalid I2OSP input: "+$);let J=Array.from({length:U}).fill(0);for(let G=U-1;G>=0;G--)J[G]=$&255,$>>>=8;return new Uint8Array(J)}function gL($,U){let J=new Uint8Array($.length);for(let G=0;G<$.length;G++)J[G]=$[G]^U[G];return J}function ML($){if(!sJ($)&&typeof $!=="string")throw Error("DST must be Uint8Array or ascii string");let U=typeof $==="string"?Q4($):$;if(U.length===0)throw Error("DST must be non-empty");return U}function jD($,U,J,G){if(S$($),M0(J),U=ML(U),U.length>255)U=G(JU(Q4("H2C-OVERSIZE-DST-"),U));let{outputLen:I,blockLen:Q}=G,X=Math.ceil(J/I);if(J>65535||X>255)throw Error("expand_message_xmd: invalid lenInBytes");let O=JU(U,u8(U.length,1)),q=new Uint8Array(Q),D=u8(J,2),z=Array(X),W=G(JU(q,$,D,u8(0,1),O));z[0]=G(JU(W,u8(1,1),O));for(let V=1;V<X;V++){let Z=[gL(W,z[V-1]),u8(V+1,1),O];z[V]=G(JU(...Z))}return JU(...z).slice(0,J)}var Og="HashToScalar-";/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var qg=($,U)=>($+($>=0?U:-U)/zg)/U;function RL($,U,J){o0("scalar",$,R0,J);let[[G,I],[Q,X]]=U,O=qg(X*$,J),q=qg(-I*$,J),D=$-O*G-q*Q,z=-O*I-q*X,W=D<R0,w=z<R0;if(W)D=-D;if(w)z=-z;let V=E8(Math.ceil($G(J)/2))+jI;if(D<R0||D>=V||z<R0||z>=V)throw Error("splitScalar (endomorphism): failed for k");return{k1neg:W,k1:D,k2neg:w,k2:z}}function TD($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function HD($,U){aU($);let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(p0(J.lowS,"lowS"),p0(J.prehash,"prehash"),J.format!==void 0)TD(J.format);return J}class Dg extends Error{constructor($=""){super($)}}var Q0={Err:Dg,_tlv:{encode:($,U)=>{let{Err:J}=Q0;if(M0($,"tag"),$<0||$>255)throw new J("tlv.encode: wrong tag");if(typeof U!=="string")throw TypeError('"data" expected string, got type='+typeof U);if(U.length&1)throw new J("tlv.encode: unpadded data");let G=U.length/2,I=_8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?_8(I.length/2|128):"";return _8($)+Q+I+U},decode($,U){let{Err:J}=Q0;U=S$(U,void 0,"DER data");let G=0;if($<0||$>255)throw new J("tlv.encode: wrong tag");if(U.length<2||U[G++]!==$)throw new J("tlv.decode: wrong tlv");let I=U[G++],Q=!!(I&128),X=0;if(!Q)X=I;else{let q=I&127;if(!q)throw new J("tlv.decode(long): indefinite length not supported");if(q>4)throw new J("tlv.decode(long): byte length is too big");let D=U.subarray(G,G+q);if(D.length!==q)throw new J("tlv.decode: length bytes not complete");if(D[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of D)X=X<<8|z;if(G+=q,X<128)throw new J("tlv.decode(long): not minimal encoding")}let O=U.subarray(G,G+X);if(O.length!==X)throw new J("tlv.decode: wrong value length");return{v:O,l:U.subarray(G+X)}}},_int:{encode($){let{Err:U}=Q0;if(J4($),$<R0)throw new U("integer: negative integers are not allowed");let J=_8($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new U("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:U}=Q0;if($.length<1)throw new U("invalid signature integer: empty");if($[0]&128)throw new U("invalid signature integer: negative");if($.length>1&&$[0]===0&&!($[1]&128))throw new U("invalid signature integer: unnecessary leading zero");return GJ($)}},toSig($){let{Err:U,_int:J,_tlv:G}=Q0,I=S$($,void 0,"signature"),{v:Q,l:X}=G.decode(48,I);if(X.length)throw new U("invalid signature: left bytes after parsing");let{v:O,l:q}=G.decode(2,Q),{v:D,l:z}=G.decode(2,q);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(D)}},hexFromSig($){let{_tlv:U,_int:J}=Q0,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}};Object.freeze(Q0._tlv);Object.freeze(Q0._int);Object.freeze(Q0);var R0=BigInt(0),jI=BigInt(1),zg=BigInt(2),q4=BigInt(3),jL=BigInt(4);function Yg($,U={}){let J=O4("weierstrass",$,U),G=J.Fp,I=J.Fn,Q=J.CURVE,{h:X,n:O}=Q;aU(U,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:q,allowInfinityPoint:D}=U;if(q){if(!G.is0(Q.a)||typeof q.beta!=="bigint"||!Array.isArray(q.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let z=wg(G,I);function W(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function w(C,A,E){if(D&&A.is0())return Uint8Array.of(0);let{x:M,y:T}=A.toAffine(),H=G.toBytes(M);if(p0(E,"isCompressed"),E){W();let b=!G.isOdd(T);return JU(Wg(b),H)}else return JU(Uint8Array.of(4),H,G.toBytes(T))}function V(C){S$(C,void 0,"Point");let{publicKey:A,publicKeyUncompressed:E}=z,M=C.length,T=C[0],H=C.subarray(1);if(D&&M===1&&T===0)return{x:G.ZERO,y:G.ZERO};if(M===A&&(T===2||T===3)){let b=G.fromBytes(H);if(!G.isValid(b))throw Error("bad point: is not on curve, wrong x");let P=N(b),F;try{F=G.sqrt(P)}catch($$){let X$=$$ instanceof Error?": "+$$.message:"";throw Error("bad point: is not on curve, sqrt error"+X$)}W();let y=G.isOdd(F);if((T&1)===1!==y)F=G.neg(F);return{x:b,y:F}}else if(M===E&&T===4){let b=G.BYTES,P=G.fromBytes(H.subarray(0,b)),F=G.fromBytes(H.subarray(b,b*2));if(!j(P,F))throw Error("bad point: is not on curve");return{x:P,y:F}}else throw Error(`bad point: got length ${M}, expected compressed=${A} or uncompressed=${E}`)}let Z=U.toBytes===void 0?w:U.toBytes,v=U.fromBytes===void 0?V:U.fromBytes;function N(C){let A=G.sqr(C),E=G.mul(A,C);return G.add(G.add(E,G.mul(C,Q.a)),Q.b)}function j(C,A){let E=G.sqr(A),M=N(C);return G.eql(E,M)}if(!j(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let R=G.mul(G.pow(Q.a,q4),jL),S=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(R,S)))throw Error("bad curve params: a or b");function L(C,A,E=!1){if(!G.isValid(A)||E&&G.is0(A))throw Error(`bad point coordinate ${C}`);return A}function k(C){if(!(C instanceof B))throw Error("Weierstrass Point expected")}function x(C){if(!q||!q.basises)throw Error("no endo");return RL(C,q.basises,I.ORDER)}function h(C,A,E,M,T){return E=new B(G.mul(E.X,C),E.Y,E.Z),A=f8(M,A),E=f8(T,E),A.add(E)}class B{static BASE=new B(Q.Gx,Q.Gy,G.ONE);static ZERO=new B(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=I;X;Y;Z;constructor(C,A,E){this.X=L("x",C),this.Y=L("y",A,!0),this.Z=L("z",E),Object.freeze(this)}static CURVE(){return Q}static fromAffine(C){let{x:A,y:E}=C||{};if(!C||!G.isValid(A)||!G.isValid(E))throw Error("invalid affine point");if(C instanceof B)throw Error("projective point not allowed");if(G.is0(A)&&G.is0(E))return B.ZERO;return new B(A,E,G.ONE)}static fromBytes(C){let A=B.fromAffine(v(S$(C,void 0,"point")));return A.assertValidity(),A}static fromHex(C){return B.fromBytes(tJ(C))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(C=8,A=!0){if(a.createCache(this,C),!A)this.multiply(q4);return this}assertValidity(){let C=this;if(C.is0()){if(U.allowInfinityPoint&&G.is0(C.X)&&G.eql(C.Y,G.ONE)&&G.is0(C.Z))return;throw Error("bad point: ZERO")}let{x:A,y:E}=C.toAffine();if(!G.isValid(A)||!G.isValid(E))throw Error("bad point: x or y not field elements");if(!j(A,E))throw Error("bad point: equation left != right");if(!C.isTorsionFree())throw Error("bad point: not in prime-order subgroup")}hasEvenY(){let{y:C}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(C)}equals(C){k(C);let{X:A,Y:E,Z:M}=this,{X:T,Y:H,Z:b}=C,P=G.eql(G.mul(A,b),G.mul(T,M)),F=G.eql(G.mul(E,b),G.mul(H,M));return P&&F}negate(){return new B(this.X,G.neg(this.Y),this.Z)}double(){let{a:C,b:A}=Q,E=G.mul(A,q4),{X:M,Y:T,Z:H}=this,b=G.ZERO,P=G.ZERO,F=G.ZERO,y=G.mul(M,M),n=G.mul(T,T),$$=G.mul(H,H),X$=G.mul(M,T);return X$=G.add(X$,X$),F=G.mul(M,H),F=G.add(F,F),b=G.mul(C,F),P=G.mul(E,$$),P=G.add(b,P),b=G.sub(n,P),P=G.add(n,P),P=G.mul(b,P),b=G.mul(X$,b),F=G.mul(E,F),$$=G.mul(C,$$),X$=G.sub(y,$$),X$=G.mul(C,X$),X$=G.add(X$,F),F=G.add(y,y),y=G.add(F,y),y=G.add(y,$$),y=G.mul(y,X$),P=G.add(P,y),$$=G.mul(T,H),$$=G.add($$,$$),y=G.mul($$,X$),b=G.sub(b,y),F=G.mul($$,n),F=G.add(F,F),F=G.add(F,F),new B(b,P,F)}add(C){k(C);let{X:A,Y:E,Z:M}=this,{X:T,Y:H,Z:b}=C,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=Q.a,$$=G.mul(Q.b,q4),X$=G.mul(A,T),q$=G.mul(E,H),W$=G.mul(M,b),N$=G.add(A,E),V$=G.add(T,H);N$=G.mul(N$,V$),V$=G.add(X$,q$),N$=G.sub(N$,V$),V$=G.add(A,M);let v$=G.add(T,b);return V$=G.mul(V$,v$),v$=G.add(X$,W$),V$=G.sub(V$,v$),v$=G.add(E,M),P=G.add(H,b),v$=G.mul(v$,P),P=G.add(q$,W$),v$=G.sub(v$,P),y=G.mul(n,V$),P=G.mul($$,W$),y=G.add(P,y),P=G.sub(q$,y),y=G.add(q$,y),F=G.mul(P,y),q$=G.add(X$,X$),q$=G.add(q$,X$),W$=G.mul(n,W$),V$=G.mul($$,V$),q$=G.add(q$,W$),W$=G.sub(X$,W$),W$=G.mul(n,W$),V$=G.add(V$,W$),X$=G.mul(q$,V$),F=G.add(F,X$),X$=G.mul(v$,V$),P=G.mul(N$,P),P=G.sub(P,X$),X$=G.mul(N$,q$),y=G.mul(v$,y),y=G.add(y,X$),new B(P,F,y)}subtract(C){return k(C),this.add(C.negate())}is0(){return this.equals(B.ZERO)}multiply(C){let{endo:A}=U;if(!I.isValidNot0(C))throw RangeError("invalid scalar: out of range");let E,M,T=(H)=>a.cached(this,H,(b)=>OJ(B,b));if(A){let{k1neg:H,k1:b,k2neg:P,k2:F}=x(C),{p:y,f:n}=T(b),{p:$$,f:X$}=T(F);M=n.add(X$),E=h(A.beta,y,$$,H,P)}else{let{p:H,f:b}=T(C);E=H,M=b}return OJ(B,[E,M])[0]}multiplyUnsafe(C){let{endo:A}=U,E=this,M=C;if(!I.isValid(M))throw RangeError("invalid scalar: out of range");if(M===R0||E.is0())return B.ZERO;if(M===jI)return E;if(a.hasCache(this))return this.multiply(M);if(A){let{k1neg:T,k1:H,k2neg:b,k2:P}=x(M),{p1:F,p2:y}=Xg(B,E,H,P);return h(A.beta,F,y,T,b)}else return a.unsafe(E,M)}toAffine(C){let A=this,E=C,{X:M,Y:T,Z:H}=A;if(G.eql(H,G.ONE))return{x:M,y:T};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(H);let P=G.mul(M,E),F=G.mul(T,E),y=G.mul(H,E);if(b)return{x:G.ZERO,y:G.ZERO};if(!G.eql(y,G.ONE))throw Error("invZ was invalid");return{x:P,y:F}}isTorsionFree(){let{isTorsionFree:C}=U;if(X===jI)return!0;if(C)return C(B,this);return a.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:C}=U;if(X===jI)return this;if(C)return C(B,this);return this.multiplyUnsafe(X)}isSmallOrder(){if(X===jI)return this.is0();return this.clearCofactor().is0()}toBytes(C=!0){return p0(C,"isCompressed"),this.assertValidity(),Z(B,this,C)}toHex(C=!0){return aJ(this.toBytes(C))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let m=I.BITS,a=new k8(B,U.endo?Math.ceil(m/2):m);if(m>=8)B.BASE.precompute(8);return Object.freeze(B.prototype),Object.freeze(B),B}function Wg($){return Uint8Array.of($?2:3)}function wg($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function HL($,U={}){let{Fn:J}=$,G=U.randomBytes===void 0?eJ:U.randomBytes,I=Object.assign(wg($.Fp,J),{seed:Math.max(ZD(J.ORDER),16)});function Q(V){try{let Z=J.fromBytes(V);return J.isValidNot0(Z)}catch(Z){return!1}}function X(V,Z){let{publicKey:v,publicKeyUncompressed:N}=I;try{let j=V.length;if(Z===!0&&j!==v)return!1;if(Z===!1&&j!==N)return!1;return!!$.fromBytes(V)}catch(j){return!1}}function O(V){return V=V===void 0?G(I.seed):V,$g(S$(V,I.seed,"seed"),J.ORDER)}function q(V,Z=!0){return $.BASE.multiply(J.fromBytes(V)).toBytes(Z)}function D(V){let{secretKey:Z,publicKey:v,publicKeyUncompressed:N}=I,j=J._lengths;if(!sJ(V))return;let R=S$(V,void 0,"key").length,S=R===v||R===N,L=R===Z||!!j?.includes(R);if(S&&L)return;return S}function z(V,Z,v=!0){if(D(V)===!0)throw Error("first arg must be private key");if(D(Z)===!1)throw Error("second arg must be public key");let N=J.fromBytes(V);return $.fromBytes(Z).multiply(N).toBytes(v)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=F8(O,q);return Object.freeze(W),Object.freeze(I),Object.freeze({getPublicKey:q,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function Vg($,U,J={}){let G=U;u0(G),aU(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let I=J.randomBytes===void 0?eJ:J.randomBytes,Q=J.hmac===void 0?(T,H)=>w0(G,T,H):J.hmac,{Fp:X,Fn:O}=$,{ORDER:q,BITS:D}=O,{keygen:z,getPublicKey:W,getSharedSecret:w,utils:V,lengths:Z}=HL($,J),v={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},N=q*zg+jI<X.ORDER;function j(T){let H=q>>jI;return T>H}function R(T,H){if(!O.isValidNot0(H))throw Error(`invalid signature ${T}: out of range 1..Point.Fn.ORDER`);return H}function S(){if(N)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function L(T,H){TD(H);let b=Z.signature,P=H==="compact"?b:H==="recovered"?b+1:void 0;return S$(T,P)}class k{r;s;recovery;constructor(T,H,b){if(this.r=R("r",T),this.s=R("s",H),b!=null){if(S(),![0,1,2,3].includes(b))throw Error("invalid recovery id");this.recovery=b}Object.freeze(this)}static fromBytes(T,H=v.format){L(T,H);let b;if(H==="der"){let{r:n,s:$$}=Q0.toSig(S$(T));return new k(n,$$)}if(H==="recovered")b=T[0],H="compact",T=T.subarray(1);let P=Z.signature/2,F=T.subarray(0,P),y=T.subarray(P,P*2);return new k(O.fromBytes(F),O.fromBytes(y),b)}static fromHex(T,H){return this.fromBytes(tJ(T),H)}assertRecovery(){let{recovery:T}=this;if(T==null)throw Error("invalid recovery id: must be present");return T}addRecoveryBit(T){return new k(this.r,this.s,T)}recoverPublicKey(T){let{r:H,s:b}=this,P=this.assertRecovery(),F=P===2||P===3?H+q:H;if(!X.isValid(F))throw Error("invalid recovery id: sig.r+curve.n != R.x");let y=X.toBytes(F),n=$.fromBytes(JU(Wg((P&1)===0),y)),$$=O.inv(F),X$=h(S$(T,void 0,"msgHash")),q$=O.create(-X$*$$),W$=O.create(b*$$),N$=$.BASE.multiplyUnsafe(q$).add(n.multiplyUnsafe(W$));if(N$.is0())throw Error("invalid recovery: point at infinify");return N$.assertValidity(),N$}hasHighS(){return j(this.s)}toBytes(T=v.format){if(TD(T),T==="der")return tJ(Q0.hexFromSig(this));let{r:H,s:b}=this,P=O.toBytes(H),F=O.toBytes(b);if(T==="recovered")return S(),JU(Uint8Array.of(this.assertRecovery()),P,F);return JU(P,F)}toHex(T){return aJ(this.toBytes(T))}}Object.freeze(k.prototype),Object.freeze(k);let x=J.bits2int===void 0?function(H){if(H.length>8192)throw Error("input is too large");let b=GJ(H),P=H.length*8-D;return P>0?b>>BigInt(P):b}:J.bits2int,h=J.bits2int_modN===void 0?function(H){return O.create(x(H))}:J.bits2int_modN,B=E8(D);function m(T){return o0("num < 2^"+D,T,R0,B),O.toBytes(T)}function a(T,H){return S$(T,void 0,"message"),H?S$(G(T),void 0,"prehashed message"):T}function C(T,H,b){let{lowS:P,prehash:F,extraEntropy:y}=HD(b,v);T=a(T,F);let n=h(T),$$=O.fromBytes(H);if(!O.isValidNot0($$))throw Error("invalid private key");let X$=[m($$),m(n)];if(y!=null&&y!==!1){let V$=y===!0?I(Z.secretKey):y;X$.push(S$(V$,void 0,"extraEntropy"))}let q$=JU(...X$),W$=n;function N$(V$){let v$=x(V$);if(!O.isValidNot0(v$))return;let R$=O.inv(v$),b$=$.BASE.multiply(v$).toAffine(),k$=O.create(b$.x);if(k$===R0)return;let OU=O.create(R$*O.create(W$+k$*$$));if(OU===R0)return;let qU=(b$.x===k$?0:2)|Number(b$.y&jI),LU=OU;if(P&&j(OU))LU=O.neg(OU),qU^=1;return new k(k$,LU,N?void 0:qU)}return{seed:q$,k2sig:N$}}function A(T,H,b={}){let{seed:P,k2sig:F}=C(T,H,b);return h5(G.outputLen,O.BYTES,Q)(P,F).toBytes(b.format)}function E(T,H,b,P={}){let{lowS:F,prehash:y,format:n}=HD(P,v);if(b=S$(b,void 0,"publicKey"),H=a(H,y),!sJ(T)){let $$=T instanceof k?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+$$)}L(T,n);try{let $$=k.fromBytes(T,n),X$=$.fromBytes(b);if(F&&$$.hasHighS())return!1;let{r:q$,s:W$}=$$,N$=h(H),V$=O.inv(W$),v$=O.create(N$*V$),R$=O.create(q$*V$),b$=$.BASE.multiplyUnsafe(v$).add(X$.multiplyUnsafe(R$));if(b$.is0())return!1;return O.create(b$.x)===q$}catch($$){return!1}}function M(T,H,b={}){let{prehash:P}=HD(b,v);return H=a(H,P),k.fromBytes(T,"recovered").recoverPublicKey(H).toBytes()}return Object.freeze({keygen:z,getPublicKey:W,getSharedSecret:w,utils:V,lengths:Z,Point:$,sign:A,verify:E,recoverPublicKey:M,Signature:k,hash:G})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var TL=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))();var KL=Yg(TL),IG=Vg(KL,y$);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var HI=BigInt(0),_U=BigInt(1),KD=BigInt(2),AL=BigInt(8);function PL($,U,J,G){let I=$.sqr(J),Q=$.sqr(G),X=$.add($.mul(U.a,I),Q),O=$.add($.ONE,$.mul(U.d,$.mul(I,Q)));return $.eql(X,O)}function vg($,U={}){let J=U,G=O4("edwards",$,J,J.FpFnLE),{Fp:I,Fn:Q}=G,X=G.CURVE,{h:O}=X;aU(J,{},{uvRatio:"function"});let q=KD<<BigInt(Q.BYTES*8)-_U,D=(v)=>I.create(v),z=J.uvRatio===void 0?(v,N)=>{try{return{isValid:!0,value:I.sqrt(I.div(v,N))}}catch(j){return{isValid:!1,value:HI}}}:J.uvRatio;if(!PL(I,X,X.Gx,X.Gy))throw Error("bad curve params: generator point");function W(v,N,j=!1){let R=j?_U:HI;return o0("coordinate "+v,N,R,q),N}function w(v){if(!(v instanceof V))throw Error("EdwardsPoint expected")}class V{static BASE=new V(X.Gx,X.Gy,_U,D(X.Gx*X.Gy));static ZERO=new V(HI,_U,_U,HI);static Fp=I;static Fn=Q;X;Y;Z;T;constructor(v,N,j,R){this.X=W("x",v),this.Y=W("y",N),this.Z=W("z",j,!0),this.T=W("t",R),Object.freeze(this)}static CURVE(){return X}static fromAffine(v){if(v instanceof V)throw Error("extended point not allowed");let{x:N,y:j}=v||{};return W("x",N),W("y",j),new V(N,j,_U,D(N*j))}static fromBytes(v,N=!1){let j=I.BYTES,{a:R,d:S}=X;v=RI(S$(v,j,"point")),p0(N,"zip215");let L=RI(v),k=v[j-1];L[j-1]=k&-129;let x=G0(L),h=N?q:I.ORDER;o0("point.y",x,HI,h);let B=D(x*x),m=D(B-_U),a=D(S*B-R),{isValid:C,value:A}=z(m,a);if(!C)throw Error("bad point: invalid y coordinate");let E=(A&_U)===_U,M=(k&128)!==0;if(!N&&A===HI&&M)throw Error("bad point: x=0 and x_0=1");if(M!==E)A=D(-A);return V.fromAffine({x:A,y:x})}static fromHex(v,N=!1){return V.fromBytes(tJ(v),N)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(v=8,N=!0){if(Z.createCache(this,v),!N)this.multiply(KD);return this}assertValidity(){let v=this,{a:N,d:j}=X;if(v.is0())throw Error("bad point: ZERO");let{X:R,Y:S,Z:L,T:k}=v,x=D(R*R),h=D(S*S),B=D(L*L),m=D(B*B),a=D(x*N),C=D(B*D(a+h)),A=D(m+D(j*D(x*h)));if(C!==A)throw Error("bad point: equation left != right (1)");let E=D(R*S),M=D(L*k);if(E!==M)throw Error("bad point: equation left != right (2)")}equals(v){w(v);let{X:N,Y:j,Z:R}=this,{X:S,Y:L,Z:k}=v,x=D(N*k),h=D(S*R),B=D(j*k),m=D(L*R);return x===h&&B===m}is0(){return this.equals(V.ZERO)}negate(){return new V(D(-this.X),this.Y,this.Z,D(-this.T))}double(){let{a:v}=X,{X:N,Y:j,Z:R}=this,S=D(N*N),L=D(j*j),k=D(KD*D(R*R)),x=D(v*S),h=N+j,B=D(D(h*h)-S-L),m=x+L,a=m-k,C=x-L,A=D(B*a),E=D(m*C),M=D(B*C),T=D(a*m);return new V(A,E,T,M)}add(v){w(v);let{a:N,d:j}=X,{X:R,Y:S,Z:L,T:k}=this,{X:x,Y:h,Z:B,T:m}=v,a=D(R*x),C=D(S*h),A=D(k*j*m),E=D(L*B),M=D((R+S)*(x+h)-a-C),T=E-A,H=E+A,b=D(C-N*a),P=D(M*T),F=D(H*b),y=D(M*b),n=D(T*H);return new V(P,F,n,y)}subtract(v){return w(v),this.add(v.negate())}multiply(v){if(!Q.isValidNot0(v))throw RangeError("invalid scalar: expected 1 <= sc < curve.n");let{p:N,f:j}=Z.cached(this,v,(R)=>OJ(V,R));return OJ(V,[N,j])[0]}multiplyUnsafe(v){if(!Q.isValid(v))throw RangeError("invalid scalar: expected 0 <= sc < curve.n");if(v===HI)return V.ZERO;if(this.is0()||v===_U)return this;return Z.unsafe(this,v,(N)=>OJ(V,N))}isSmallOrder(){return this.clearCofactor().is0()}isTorsionFree(){return Z.unsafe(this,X.n).is0()}toAffine(v){let N=this,j=v,{X:R,Y:S,Z:L}=N,k=N.is0();if(j==null)j=k?AL:I.inv(L);let x=D(R*j),h=D(S*j),B=I.mul(L,j);if(k)return{x:HI,y:_U};if(B!==_U)throw Error("invZ was invalid");return{x,y:h}}clearCofactor(){if(O===_U)return this;return this.multiplyUnsafe(O)}toBytes(){let{x:v,y:N}=this.toAffine(),j=I.toBytes(N);return j[j.length-1]|=v&_U?128:0,j}toHex(){return aJ(this.toBytes())}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let Z=new k8(V,Q.BITS);if(Q.BITS>=8)V.BASE.precompute(8);return Object.freeze(V.prototype),Object.freeze(V),V}class AD{static BASE;static ZERO;static Fp;static Fn;ep;constructor($){this.ep=$}static fromBytes($){wD()}static fromHex($){wD()}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 aJ(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($,U){return this.ep.precompute($,U),this}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var x8=BigInt(0),JG=BigInt(1),D4=BigInt(2);function BL($){return aU($,{P:"bigint",type:"string",adjustScalarBytes:"function",powPminus2:"function"},{randomBytes:"function"}),Object.freeze({...$})}function Ng($){let U=BL($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let q=X===void 0?eJ:X,D=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),V=O?D4**BigInt(254):D4**BigInt(447),Z=O?BigInt(8)*D4**BigInt(251)-JG:BigInt(4)*D4**BigInt(445)-JG,v=V+Z+JG,N=(M)=>F$(M,J),j=R(W);function R(M){return C8(N(M),z)}function S(M){let T=RI(S$(M,z,"uCoordinate"));if(O)T[31]&=127;return N(G0(T))}function L(M){return G0(I(RI(S$(M,z,"scalar"))))}function k(M,T){let H=a(S(T),L(M));if(H===x8)throw Error("invalid private or public key received");return R(H)}function x(M){return k(M,j)}let h=x,B=k;function m(M,T,H){let b=N(M*(T-H));return T=N(T-b),H=N(H+b),{x_2:T,x_3:H}}function a(M,T){o0("u",M,x8,J),o0("scalar",T,V,v);let H=T,b=M,P=JG,F=x8,y=M,n=JG,$$=x8;for(let q$=BigInt(D-1);q$>=x8;q$--){let W$=H>>q$&JG;$$^=W$,{x_2:P,x_3:y}=m($$,P,y),{x_2:F,x_3:n}=m($$,F,n),$$=W$;let N$=P+F,V$=N(N$*N$),v$=P-F,R$=N(v$*v$),b$=V$-R$,k$=y+n,OU=y-n,qU=N(OU*N$),LU=N(k$*v$),Y0=qU+LU,W0=qU-LU;y=N(Y0*Y0),n=N(b*N(W0*W0)),P=N(V$*R$),F=N(b$*(V$+N(w*b$)))}({x_2:P,x_3:y}=m($$,P,y)),{x_2:F,x_3:n}=m($$,F,n);let X$=Q(F);return N(P*X$)}let C={secretKey:z,publicKey:z,seed:z},A=(M)=>{return M=M===void 0?q(z):M,S$(M,C.seed,"seed"),M},E={randomSecretKey:A};return Object.freeze(C),Object.freeze(E),Object.freeze({keygen:F8(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:C})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var LL=BigInt(0),t0=BigInt(1),Zg=BigInt(2),SL=BigInt(3),_L=BigInt(5),CL=BigInt(8),DJ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),SD=(()=>({p:DJ,n:BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),h:CL,a:BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),d:BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),Gx:BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),Gy:BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")}))();function Rg($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=DJ,O=$*$%Q*$%Q,q=tU(O,Zg,Q)*O%Q,D=tU(q,t0,Q)*$%Q,z=tU(D,_L,Q)*D%Q,W=tU(z,U,Q)*z%Q,w=tU(W,J,Q)*W%Q,V=tU(w,G,Q)*w%Q,Z=tU(V,I,Q)*V%Q,v=tU(Z,I,Q)*V%Q,N=tU(v,U,Q)*z%Q;return{pow_p_5_8:tU(N,Zg,Q)*$%Q,b2:O}}function EL($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var PD=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");function _D($,U){let J=DJ,G=F$(U*U*U,J),I=F$(G*G*U,J),Q=Rg($*I).pow_p_5_8,X=F$($*G*Q,J),O=F$(U*X*X,J),q=X,D=F$(X*PD,J),z=O===$,W=O===F$(-$,J),w=O===F$(-$*PD,J);if(z)X=q;if(W||w)X=D;if(a0(X,J))X=F$(-X,J);return{isValid:z||W,value:X}}var qJ=vg(SD,{uvRatio:_D}),TI=(()=>qJ.Fp)(),jg=(()=>qJ.Fn)();var z4=(()=>{let $=DJ;return Ng({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=Rg(U);return F$(tU(J,SL,$)*G,$)},adjustScalarBytes:EL})})();var BD=PD,bL=BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"),fL=BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"),kL=BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"),FL=BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"),gg=($)=>_D(t0,$),uL=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),LD=($)=>TI.create(G0($)&uL);function Mg($){let{d:U}=SD,J=DJ,G=(j)=>TI.create(j),I=G(BD*$*$),Q=G((I+t0)*kL),X=BigInt(-1),O=G((X-U*I)*G(I+U)),{isValid:q,value:D}=_D(Q,O),z=G(D*$);if(!a0(z,J))z=G(-z);if(!q)D=z;if(!q)X=I;let W=G(X*(I-t0)*FL-O),w=D*D,V=G((D+D)*O),Z=G(W*bL),v=G(t0-w),N=G(t0+w);return new qJ(G(V*N),G(v*Z),G(Z*N),G(V*v))}class jU extends AD{static BASE=(()=>new jU(qJ.BASE))();static ZERO=(()=>new jU(qJ.ZERO))();static Fp=(()=>TI)();static Fn=(()=>jg)();constructor($){super($)}static fromAffine($){return new jU(qJ.fromAffine($))}assertSame($){if(!($ instanceof jU))throw Error("RistrettoPoint expected")}init($){return new jU($)}static fromBytes($){t$($,32);let{a:U,d:J}=SD,G=DJ,I=(S)=>TI.create(S),Q=LD($);if(!r5(TI.toBytes(Q),$)||a0(Q,G))throw Error("invalid ristretto255 encoding 1");let X=I(Q*Q),O=I(t0+U*X),q=I(t0-U*X),D=I(O*O),z=I(q*q),W=I(U*J*D-z),{isValid:w,value:V}=gg(I(W*z)),Z=I(V*q),v=I(V*Z*W),N=I((Q+Q)*Z);if(a0(N,G))N=I(-N);let j=I(O*v),R=I(N*j);if(!w||a0(R,G)||j===LL)throw Error("invalid ristretto255 encoding 2");return new jU(new qJ(N,j,t0,R))}static fromHex($){return jU.fromBytes(G8($))}toBytes(){let{X:$,Y:U,Z:J,T:G}=this.ep,I=DJ,Q=(v)=>TI.create(v),X=Q(Q(J+U)*Q(J-U)),O=Q($*U),q=Q(O*O),{value:D}=gg(Q(X*q)),z=Q(D*X),W=Q(D*O),w=Q(z*W*G),V;if(a0(G*w,I)){let v=Q(U*BD),N=Q($*BD);$=v,U=N,V=Q(z*fL)}else V=W;if(a0($*w,I))U=Q(-U);let Z=Q((J-U)*V);if(a0(Z,I))Z=Q(-Z);return TI.toBytes(Z)}equals($){this.assertSame($);let{X:U,Y:J}=this.ep,{X:G,Y:I}=$.ep,Q=(q)=>TI.create(q),X=Q(U*I)===Q(J*G),O=Q(J*I)===Q(U*G);return X||O}is0(){return this.equals(jU.ZERO)}}Object.freeze(jU.BASE);Object.freeze(jU.ZERO);Object.freeze(jU.prototype);Object.freeze(jU);var xL=Object.freeze({Point:jU,hashToCurve($,U){let J=U?.DST===void 0?"ristretto255_XMD:SHA-512_R255MAP_RO_":U.DST,G=jD($,J,64,LQ);return xL.deriveToCurve(G)},hashToScalar($,U={DST:Og}){let J=jD($,U.DST,64,LQ);return jg.create(G0(J))},deriveToCurve($){t$($,64);let U=LD($.subarray(0,32)),J=Mg(U),G=LD($.subarray(32,64)),I=Mg(G);return new jU(J.add(I))}});var Hg=!1,mL=!1;async function Tg($,U){if(mL)return await U();try{return await $()}catch(J){if(J instanceof ReferenceError||J instanceof DOMException&&J.name==="NotSupportedError")return await U();else throw J}}async function Y4($,U){return await Tg(async()=>{let J=CD($)?$:await rL($),G=await crypto.subtle.importKey("raw",hL(U),{name:"X25519"},Hg,[]);return new Uint8Array(await crypto.subtle.deriveBits({name:"X25519",public:G},J,256))},()=>{if(CD($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return z4.scalarMult($,U)})}async function m8($){return await Tg(async()=>{return Y4($,z4.GuBytes)},()=>{if(CD($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return z4.scalarMultBase($)})}var yL=new Uint8Array([48,46,2,1,0,48,5,6,3,43,101,110,4,34,4,32]);async function rL($){if($.length!==32)throw Error("X25519 private key must be 32 bytes");let U=new Uint8Array([...yL,...$]);return crypto.subtle.importKey("pkcs8",U,{name:"X25519"},Hg,["deriveBits"])}function CD($){return typeof CryptoKey<"u"&&$ instanceof CryptoKey}function hL($){return $}class ED{s;transcript=[];buf=new Uint8Array(0);constructor($){this.s=$.getReader()}async readLine(){let $=[];while(!0){let U=this.buf.indexOf(10);if(U>=0)return $.push(this.buf.subarray(0,U)),this.transcript.push(this.buf.subarray(0,U+1)),this.buf=this.buf.subarray(U+1),dL(zJ($));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=zJ($),null;this.buf=J.value}}close(){return this.s.releaseLock(),{rest:this.buf,transcript:zJ(this.transcript)}}}function dL($){return $.forEach((U)=>{if(U<32||U>126)throw Error("invalid non-ASCII byte in header")}),new TextDecoder().decode($)}function zJ($){let U=$.reduce((I,Q)=>I+Q.length,0),J=new Uint8Array(U),G=0;for(let I of $)J.set(I,G),G+=I.length;return J}function GG($,...U){return $.pipeThrough(new TransformStream({start(J){for(let G of U)J.enqueue(G)}}))}function W4($){return new ReadableStream({start(U){U.enqueue($),U.close()}})}async function bD($){if(!($ instanceof ReadableStream))throw Error("readAll expects a ReadableStream<Uint8Array>");return new Uint8Array(await new Response($).arrayBuffer())}async function Kg($){if(!($ instanceof ReadableStream))throw Error("readAllString expects a ReadableStream<Uint8Array>");return await new Response($).text()}async function Ag($,U){let J=$.getReader(),G=[],I=0;while(I<U){let{done:q,value:D}=await J.read();if(q)throw Error("stream ended before reading "+U.toString()+" bytes");G.push(D),I+=D.length}J.releaseLock();let Q=zJ(G),X=Q.subarray(0,U),O=GG($,Q.subarray(U));return{data:X,rest:O}}class j0{args;body;constructor($,U){this.args=$,this.body=U}}async function nL($){let U=await $.readLine();if(U===null)throw Error("invalid stanza");let J=U.split(" ");if(J.length<2||J.shift()!=="->")return{next:U};for(let Q of J)if(Q.length===0)throw Error("invalid stanza");let G=[];for(;;){let Q=await $.readLine();if(Q===null)throw Error("invalid stanza");let X=YU.decode(Q);if(X.length>48)throw Error("invalid stanza");if(G.push(X),X.length<48)break}let I=zJ(G);return{s:new j0(J,I)}}async function Pg($){let U=new ED($),J=await U.readLine();if(J!=="age-encryption.org/v1")throw Error("invalid version "+(J??"line"));let G=[];for(;;){let{s:I,next:Q}=await nL(U);if(I!==void 0){G.push(I);continue}if(!Q.startsWith("--- "))throw Error("invalid header");let X=YU.decode(Q.slice(4)),{rest:O,transcript:q}=U.close(),D=q.slice(0,q.length-1-Q.length+3);return{stanzas:G,headerNoMAC:D,MAC:X,headerSize:q.length,rest:GG($,O)}}}function fD($){let U=[];U.push(`age-encryption.org/v1
+`)}function C7($){let U=new Map;for(let J of $){if(U.has(J.name))throw Error(`Duplicate command name: ${J.name}`);U.set(J.name,J)}return U}function nU($,U){let J=$[U];return typeof J==="string"?J:void 0}function RQ($,U){let J=$[U];return typeof J==="boolean"?J:void 0}var jQ={name:"@rizom/ops",version:"0.2.0-alpha.263",description:"Operator CLI for managing private brain fleet registry repos",keywords:["brains","ops","cli","deploy","fleet","operator"],license:"AGPL-3.0-only",author:"Yeehaa <yeehaa@rizom.ai> (https://rizom.ai)",bin:{"brains-ops":"./dist/brains-ops.js"},bugs:"https://github.com/rizom-ai/brains/issues",dependencies:{"age-encryption":"^0.3.0",yaml:"^2.9.0"},devDependencies:{"@brains/deploy-support":"workspace:*","@brains/eslint-config":"workspace:*","@brains/site-composition":"workspace:*","@brains/typescript-config":"workspace:*","@brains/utils":"workspace:*","@types/bun":"^1.3.14",typescript:"^7.0.2"},engines:{bun:">=1.3.3"},exports:{".":{types:"./dist/index.d.ts",import:"./dist/index.js"},"./deploy":{types:"./dist/deploy.d.ts",import:"./dist/deploy.js",bun:"./dist/deploy.js"}},files:["dist","templates"],homepage:"https://github.com/rizom-ai/brains/tree/main/packages/brains-ops#readme",main:"./dist/index.js",publishConfig:{access:"public"},repository:{type:"git",url:"https://github.com/rizom-ai/brains.git",directory:"packages/brains-ops"},scripts:{build:"bun scripts/build.ts",lint:"eslint . --max-warnings 0","lint:fix":"eslint . --max-warnings 0 --fix",prepublishOnly:"bun scripts/build.ts",test:"bun run build && bun test --timeout 20000","test:smoke":"bun run build && RUN_SMOKE_TESTS=1 bun test --timeout 60000",typecheck:"tsc --noEmit"},type:"module",types:"./dist/index.d.ts"};import{existsSync as IS,mkdirSync as JS,readFileSync as sD,writeFileSync as eD}from"fs";import{dirname as GS,join as kg}from"path";function zq($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function m$($,U=""){if(typeof $!=="number"){let J=U&&`"${U}" `;throw TypeError(`${J}expected number, got ${typeof $}`)}if(!Number.isSafeInteger($)||$<0){let J=U&&`"${U}" `;throw RangeError(`${J}expected integer >= 0, got ${$}`)}}function t$($,U,J=""){let G=zq($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",q=G?`length=${I}`:`type=${typeof $}`,D=X+"expected Uint8Array"+O+", got "+q;if(!G)throw TypeError(D);throw RangeError(D)}return $}function u0($){if(typeof $!=="function"||typeof $.create!=="function")throw TypeError("Hash must wrapped by utils.createHasher");if(m$($.outputLen),m$($.blockLen),$.outputLen<1)throw Error('"outputLen" must be >= 1');if($.blockLen<1)throw Error('"blockLen" must be >= 1')}function xJ($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function HQ($,U){t$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw RangeError('"digestInto() output" expected to be of length >='+J)}function TQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function gU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function mJ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function U0($,U){return $<<32-U|$>>>U}function P$($,U){return $<<U|$>>>32-U>>>0}var jP=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function HP($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function TP($){for(let U=0;U<$.length;U++)$[U]=HP($[U]);return $}var Yq=jP?($)=>$:TP,b7=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),KP=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function KQ($){if(t$($),b7)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=KP[$[J]];return U}var F0={_0:48,_9:57,A:65,F:70,a:97,f:102};function E7($){if($>=F0._0&&$<=F0._9)return $-F0._0;if($>=F0.A&&$<=F0.F)return $-(F0.A-10);if($>=F0.a&&$<=F0.f)return $-(F0.a-10);return}function G8($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);if(b7)try{return Uint8Array.fromHex($)}catch(I){if(I instanceof SyntaxError)throw RangeError(I.message);throw I}let U=$.length,J=U/2;if(U%2)throw RangeError("hex string expected, got unpadded hex of length "+U);let G=new Uint8Array(J);for(let I=0,Q=0;I<J;I++,Q+=2){let X=E7($.charCodeAt(Q)),O=E7($.charCodeAt(Q+1));if(X===void 0||O===void 0){let q=$[Q]+$[Q+1];throw RangeError('hex string expected, got non-hex character "'+q+'" at index '+Q)}G[I]=X*16+O}return G}function AP($){if(typeof $!=="string")throw TypeError("string expected");return new Uint8Array(new TextEncoder().encode($))}function Wq($,U=""){if(typeof $==="string")return AP($);return t$($,void 0,U)}function wq(...$){let U=0;for(let G=0;G<$.length;G++){let I=$[G];t$(I),U+=I.length}let J=new Uint8Array(U);for(let G=0,I=0;G<$.length;G++){let Q=$[G];J.set(Q,I),I+=Q.length}return J}function AQ($,U){if(U!==void 0&&{}.toString.call(U)!=="[object Object]")throw TypeError("options must be object or undefined");return Object.assign($,U)}function Vq($,U={}){let J=(I,Q)=>$(Q).update(I).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.canXOF=G.canXOF,J.create=(I)=>$(I),Object.assign(J,U),Object.freeze(J)}function x0($=32){m$($,"bytesLength");let U=typeof globalThis==="object"?globalThis.crypto:null;if(typeof U?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");if($>65536)throw RangeError(`"bytesLength" expected <= 65536, got ${$}`);return U.getRandomValues(new Uint8Array($))}var vq=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});class Nq{oHash;iHash;blockLen;outputLen;canXOF=!1;finished=!1;destroyed=!1;constructor($,U){if(u0($),t$(U,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(U.length>J?$.create().update(U).digest():U);for(let I=0;I<G.length;I++)G[I]^=54;this.iHash.update(G),this.oHash=$.create();for(let I=0;I<G.length;I++)G[I]^=106;this.oHash.update(G),gU(G)}update($){return xJ(this),this.iHash.update($),this}digestInto($){xJ(this),HQ($,this),this.finished=!0;let U=$.subarray(0,this.outputLen);this.iHash.digestInto(U),this.oHash.update(U),this.oHash.digestInto(U),this.destroy()}digest(){let $=new Uint8Array(this.oHash.outputLen);return this.digestInto($),$}_cloneInto($){$||=Object.create(Object.getPrototypeOf(this),{});let{oHash:U,iHash:J,finished:G,destroyed:I,blockLen:Q,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=I,$.blockLen=Q,$.outputLen=X,$.oHash=U._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var w0=(()=>{let $=(U,J,G)=>new Nq(U,J).update(G).digest();return $.create=(U,J)=>new Nq(U,J),$})();function Q8($,U,J){if(u0($),J===void 0)J=new Uint8Array($.outputLen);return w0($,J,U)}var Zq=Uint8Array.of(0),f7=Uint8Array.of();function gq($,U,J,G=32){u0($),m$(G,"length"),t$(U,void 0,"prk");let I=$.outputLen;if(U.length<I)throw Error('"prk" must be at least HashLen octets');if(G>255*I)throw Error("Length must be <= 255*HashLen");let Q=Math.ceil(G/I);if(J===void 0)J=f7;else t$(J,void 0,"info");let X=new Uint8Array(Q*I),O=w0.create($,U),q=O._cloneInto(),D=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)Zq[0]=z+1,q.update(z===0?f7:D).update(J).update(Zq).digestInto(D),X.set(D,I*z),O._cloneInto(q);return O.destroy(),q.destroy(),gU(D,Zq),X.slice(0,G)}var XI=($,U,J,G,I)=>gq($,Q8($,U,J),G,I);function k7($,U,J){return $&U^~$&J}function F7($,U,J){return $&U^$&J^U&J}class PQ{blockLen;outputLen;canXOF=!1;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,U,J,G){this.blockLen=$,this.outputLen=U,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=mJ(this.buffer)}update($){xJ(this),t$($);let{view:U,buffer:J,blockLen:G}=this,I=$.length;for(let Q=0;Q<I;){let X=Math.min(G-this.pos,I-Q);if(X===G){let O=mJ($);for(;G<=I-Q;Q+=G)this.process(O,Q);continue}if(J.set($.subarray(Q,Q+X),this.pos),this.pos+=X,Q+=X,this.pos===G)this.process(U,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){xJ(this),HQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,gU(this.buffer.subarray(Q)),this.padOffset>G-Q)this.process(J,0),Q=0;for(let z=Q;z<G;z++)U[z]=0;J.setBigUint64(G-8,BigInt(this.length*8),I),this.process(J,0);let X=mJ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let q=O/4,D=this.get();if(q>D.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<q;z++)X.setUint32(4*z,D[z],I)}digest(){let{buffer:$,outputLen:U}=this;this.digestInto($);let J=$.slice(0,U);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:U,buffer:J,length:G,finished:I,destroyed:Q,pos:X}=this;if($.destroyed=Q,$.finished=I,$.length=G,$.pos=X,G%U)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var m0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),y0=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),s$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),e$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var BQ=BigInt(4294967295),u7=BigInt(32);function PP($,U=!1){if(U)return{h:Number($&BQ),l:Number($>>u7&BQ)};return{h:Number($>>u7&BQ)|0,l:Number($&BQ)|0}}function x7($,U=!1){let J=$.length,G=new Uint32Array(J),I=new Uint32Array(J);for(let Q=0;Q<J;Q++){let{h:X,l:O}=PP($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var Mq=($,U,J)=>$>>>J,Rq=($,U,J)=>$<<32-J|U>>>J,dI=($,U,J)=>$>>>J|U<<32-J,nI=($,U,J)=>$<<32-J|U>>>J,X8=($,U,J)=>$<<64-J|U>>>J-32,O8=($,U,J)=>$>>>J-32|U<<64-J;function V0($,U,J,G){let I=(U>>>0)+(G>>>0);return{h:$+J+(I/4294967296|0)|0,l:I|0}}var m7=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),y7=($,U,J,G)=>U+J+G+($/4294967296|0)|0,r7=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),h7=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,l7=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),d7=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var LP=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]),OI=new Uint32Array(64);class jq extends PQ{constructor($){super(64,$,8,!1)}get(){let{A:$,B:U,C:J,D:G,E:I,F:Q,G:X,H:O}=this;return[$,U,J,G,I,Q,X,O]}set($,U,J,G,I,Q,X,O){this.A=$|0,this.B=U|0,this.C=J|0,this.D=G|0,this.E=I|0,this.F=Q|0,this.G=X|0,this.H=O|0}process($,U){for(let z=0;z<16;z++,U+=4)OI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=OI[z-15],w=OI[z-2],V=U0(W,7)^U0(W,18)^W>>>3,Z=U0(w,17)^U0(w,19)^w>>>10;OI[z]=Z+OI[z-7]+V+OI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:q,H:D}=this;for(let z=0;z<64;z++){let W=U0(X,6)^U0(X,11)^U0(X,25),w=D+W+k7(X,O,q)+LP[z]+OI[z]|0,Z=(U0(J,2)^U0(J,13)^U0(J,22))+F7(J,G,I)|0;D=q,q=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+Z|0}J=J+this.A|0,G=G+this.B|0,I=I+this.C|0,Q=Q+this.D|0,X=X+this.E|0,O=O+this.F|0,q=q+this.G|0,D=D+this.H|0,this.set(J,G,I,Q,X,O,q,D)}roundClean(){gU(OI)}destroy(){this.destroyed=!0,this.set(0,0,0,0,0,0,0,0),gU(this.buffer)}}class n7 extends jq{A=m0[0]|0;B=m0[1]|0;C=m0[2]|0;D=m0[3]|0;E=m0[4]|0;F=m0[5]|0;G=m0[6]|0;H=m0[7]|0;constructor(){super(32)}}class SP extends jq{A=y0[0]|0;B=y0[1]|0;C=y0[2]|0;D=y0[3]|0;E=y0[4]|0;F=y0[5]|0;G=y0[6]|0;H=y0[7]|0;constructor(){super(28)}}var i7=(()=>x7(["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($))))(),_P=(()=>i7[0])(),CP=(()=>i7[1])(),qI=new Uint32Array(80),DI=new Uint32Array(80);class q8 extends PQ{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:q,El:D,Fh:z,Fl:W,Gh:w,Gl:V,Hh:Z,Hl:v}=this;return[$,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v]}set($,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v){this.Ah=$|0,this.Al=U|0,this.Bh=J|0,this.Bl=G|0,this.Ch=I|0,this.Cl=Q|0,this.Dh=X|0,this.Dl=O|0,this.Eh=q|0,this.El=D|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=V|0,this.Hh=Z|0,this.Hl=v|0}process($,U){for(let R=0;R<16;R++,U+=4)qI[R]=$.getUint32(U),DI[R]=$.getUint32(U+=4);for(let R=16;R<80;R++){let S=qI[R-15]|0,L=DI[R-15]|0,k=dI(S,L,1)^dI(S,L,8)^Mq(S,L,7),x=nI(S,L,1)^nI(S,L,8)^Rq(S,L,7),h=qI[R-2]|0,B=DI[R-2]|0,m=dI(h,B,19)^X8(h,B,61)^Mq(h,B,6),a=nI(h,B,19)^O8(h,B,61)^Rq(h,B,6),C=r7(x,a,DI[R-7],DI[R-16]),A=h7(C,k,m,qI[R-7],qI[R-16]);qI[R]=A|0,DI[R]=C|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:q,Dl:D,Eh:z,El:W,Fh:w,Fl:V,Gh:Z,Gl:v,Hh:N,Hl:j}=this;for(let R=0;R<80;R++){let S=dI(z,W,14)^dI(z,W,18)^X8(z,W,41),L=nI(z,W,14)^nI(z,W,18)^O8(z,W,41),k=z&w^~z&Z,x=W&V^~W&v,h=l7(j,L,x,CP[R],DI[R]),B=d7(h,N,S,k,_P[R],qI[R]),m=h|0,a=dI(J,G,28)^X8(J,G,34)^X8(J,G,39),C=nI(J,G,28)^O8(J,G,34)^O8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=Z|0,j=v|0,Z=w|0,v=V|0,w=z|0,V=W|0,{h:z,l:W}=V0(q|0,D|0,B|0,m|0),q=X|0,D=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let M=m7(m,C,E);J=y7(M,B,a,A),G=M|0}({h:J,l:G}=V0(this.Ah|0,this.Al|0,J|0,G|0)),{h:I,l:Q}=V0(this.Bh|0,this.Bl|0,I|0,Q|0),{h:X,l:O}=V0(this.Ch|0,this.Cl|0,X|0,O|0),{h:q,l:D}=V0(this.Dh|0,this.Dl|0,q|0,D|0),{h:z,l:W}=V0(this.Eh|0,this.El|0,z|0,W|0),{h:w,l:V}=V0(this.Fh|0,this.Fl|0,w|0,V|0),{h:Z,l:v}=V0(this.Gh|0,this.Gl|0,Z|0,v|0),{h:N,l:j}=V0(this.Hh|0,this.Hl|0,N|0,j|0),this.set(J,G,I,Q,X,O,q,D,z,W,w,V,Z,v,N,j)}roundClean(){gU(qI,DI)}destroy(){this.destroyed=!0,gU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class c7 extends q8{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(64)}}class EP extends q8{Ah=s$[0]|0;Al=s$[1]|0;Bh=s$[2]|0;Bl=s$[3]|0;Ch=s$[4]|0;Cl=s$[5]|0;Dh=s$[6]|0;Dl=s$[7]|0;Eh=s$[8]|0;El=s$[9]|0;Fh=s$[10]|0;Fl=s$[11]|0;Gh=s$[12]|0;Gl=s$[13]|0;Hh=s$[14]|0;Hl=s$[15]|0;constructor(){super(48)}}var DU=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),zU=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class bP extends q8{Ah=DU[0]|0;Al=DU[1]|0;Bh=DU[2]|0;Bl=DU[3]|0;Ch=DU[4]|0;Cl=DU[5]|0;Dh=DU[6]|0;Dl=DU[7]|0;Eh=DU[8]|0;El=DU[9]|0;Fh=DU[10]|0;Fl=DU[11]|0;Gh=DU[12]|0;Gl=DU[13]|0;Hh=DU[14]|0;Hl=DU[15]|0;constructor(){super(28)}}class fP extends q8{Ah=zU[0]|0;Al=zU[1]|0;Bh=zU[2]|0;Bl=zU[3]|0;Ch=zU[4]|0;Cl=zU[5]|0;Dh=zU[6]|0;Dl=zU[7]|0;Eh=zU[8]|0;El=zU[9]|0;Fh=zU[10]|0;Fl=zU[11]|0;Gh=zU[12]|0;Gl=zU[13]|0;Hh=zU[14]|0;Hl=zU[15]|0;constructor(){super(32)}}var y$=Vq(()=>new n7,vq(1));var LQ=Vq(()=>new c7,vq(3));/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function bQ($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function Kq($){if(!bQ($))throw TypeError("Uint8Array expected")}function s7($,U){if(!Array.isArray(U))return!1;if(U.length===0)return!0;if($)return U.every((J)=>typeof J==="string");else return U.every((J)=>Number.isSafeInteger(J))}function e7($){if(typeof $!=="function")throw TypeError("function expected");return!0}function zI($,U){if(typeof U!=="string")throw TypeError(`${$}: string expected`);return!0}function z8($){if(typeof $!=="number")throw TypeError(`number expected, got ${typeof $}`);if(!Number.isSafeInteger($))throw RangeError(`invalid integer: ${$}`)}function _Q($){if(!Array.isArray($))throw TypeError("array expected")}function CQ($,U){if(!s7(!0,U))throw TypeError(`${$}: array of strings expected`)}function Aq($,U){if(!s7(!1,U))throw TypeError(`${$}: array of numbers expected`)}function FU(...$){let U=(Q)=>Q,J=(Q,X)=>(O)=>Q(X(O)),G=$.map((Q)=>Q.encode).reduceRight(J,U),I=$.map((Q)=>Q.decode).reduce(J,U);return{encode:G,decode:I}}function uU($){let U=typeof $==="string"?$.split(""):$,J=U.length;CQ("alphabet",U);let G=new Map(U.map((I,Q)=>[I,Q]));return{encode:(I)=>{return _Q(I),I.map((Q)=>{if(!Number.isSafeInteger(Q)||Q<0||Q>=J)throw Error(`alphabet.encode: digit index outside alphabet "${Q}". Allowed: ${$}`);return U[Q]})},decode:(I)=>{return _Q(I),I.map((Q)=>{zI("alphabet.decode",Q);let X=G.get(Q);if(X===void 0)throw Error(`Unknown letter: "${Q}". Allowed: ${$}`);return X})}}}function xU($=""){return zI("join",$),{encode:(U)=>{return CQ("join.decode",U),U.join($)},decode:(U)=>{return zI("join.decode",U),U.split($)}}}function fQ($,U="="){return z8($),zI("padding",U),{encode(J){CQ("padding.encode",J);while(J.length*$%8)J.push(U);return J},decode(J){CQ("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]===U;G--)if((G-1)*$%8===0)throw Error("padding: invalid, string has too much padding");return J.slice(0,G)}}}function $Z($){return e7($),{encode:(U)=>U,decode:(U)=>$(U)}}function p7($,U,J){if(U<2)throw RangeError(`convertRadix: invalid from=${U}, base cannot be less than 2`);if(J<2)throw RangeError(`convertRadix: invalid to=${J}, base cannot be less than 2`);if(_Q($),!$.length)return[];let G=0,I=[],Q=Array.from($,(O)=>{if(z8(O),O<0||O>=U)throw Error(`invalid integer: ${O}`);return O}),X=Q.length;while(!0){let O=0,q=!0;for(let D=G;D<X;D++){let z=Q[D],W=U*O,w=W+z;if(!Number.isSafeInteger(w)||W/U!==O||w-z!==W)throw Error("convertRadix: carry overflow");let V=w/J;O=w%J;let Z=Math.floor(V);if(Q[D]=Z,!Number.isSafeInteger(Z)||Z*J+O!==w)throw Error("convertRadix: carry overflow");if(!q)continue;else if(!Z)G=D;else q=!1}if(I.push(O),q)break}for(let O=0;O<$.length-1&&$[O]===0;O++)I.push(0);return I.reverse()}var UZ=($,U)=>U===0?$:UZ(U,$%U),EQ=($,U)=>$+(U-UZ($,U)),SQ=(()=>{let $=[];for(let U=0;U<40;U++)$.push(2**U);return $})();function Hq($,U,J,G){if(_Q($),U<=0||U>32)throw RangeError(`convertRadix2: wrong from=${U}`);if(J<=0||J>32)throw RangeError(`convertRadix2: wrong to=${J}`);if(EQ(U,J)>32)throw Error(`convertRadix2: carry overflow from=${U} to=${J} carryBits=${EQ(U,J)}`);let I=0,Q=0,X=SQ[U],O=SQ[J]-1,q=[];for(let D of $){if(z8(D),D>=X)throw Error(`convertRadix2: invalid data word=${D} from=${U}`);if(I=I<<U|D,Q+U>32)throw Error(`convertRadix2: carry overflow pos=${Q} from=${U}`);Q+=U;for(;Q>=J;Q-=J)q.push((I>>Q-J&O)>>>0);let z=SQ[Q];if(z===void 0)throw Error("invalid carry");I&=z-1}if(I=I<<J-Q&O,!G&&Q>=U)throw Error("Excess padding");if(!G&&I>0)throw Error(`Non-zero padding: ${I}`);if(G&&Q>0)q.push(I>>>0);return q}function kP($){z8($);let U=256;return{encode:(J)=>{if(!bQ(J))throw TypeError("radix.encode input should be Uint8Array");return p7(Array.from(J),U,$)},decode:(J)=>{return Aq("radix.decode",J),Uint8Array.from(p7(J,$,U))}}}function iU($,U=!1){if(z8($),$<=0||$>32)throw RangeError("radix2: bits should be in (0..32]");if(EQ(8,$)>32||EQ($,8)>32)throw RangeError("radix2: carry overflow");return{encode:(J)=>{if(!bQ(J))throw TypeError("radix2.encode input should be Uint8Array");return Hq(Array.from(J),8,$,!U)},decode:(J)=>{return Aq("radix2.decode",J),Uint8Array.from(Hq(J,$,8,U))}}}function o7($){return e7($),function(...U){try{return $.apply(null,U)}catch(J){}}}var Il=Object.freeze(FU(iU(4),uU("0123456789ABCDEF"),xU(""))),Jl=Object.freeze(FU(iU(5),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),fQ(5),xU(""))),Gl=Object.freeze(FU(iU(5),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),xU(""))),Ql=Object.freeze(FU(iU(5),uU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),fQ(5),xU(""))),Xl=Object.freeze(FU(iU(5),uU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),xU(""))),Ol=Object.freeze(FU(iU(5),uU("0123456789ABCDEFGHJKMNPQRSTVWXYZ"),xU(""),$Z(($)=>$.toUpperCase().replace(/O/g,"0").replace(/[IL]/g,"1")))),IZ=(()=>typeof Uint8Array.from([]).toBase64==="function"&&typeof Uint8Array.fromBase64==="function")(),FP=/[\t\n\f\r ]/,JZ=($,U)=>{zI("base64",$);let J=U?"base64url":"base64";if($.length>0&&FP.test($))throw Error("invalid base64");return Uint8Array.fromBase64($,{alphabet:J,lastChunkHandling:"strict"})},Pq=Object.freeze(IZ?{encode($){return Kq($),$.toBase64()},decode($){return JZ($,!1)}}:FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),fQ(6),xU(""))),YU=Object.freeze(FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),xU(""))),ql=Object.freeze(IZ?{encode($){return Kq($),$.toBase64({alphabet:"base64url"})},decode($){return JZ($,!0)}}:FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),fQ(6),xU(""))),Dl=Object.freeze(FU(iU(6),uU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),xU(""))),Bq=($)=>FU(kP(58),uU($),xU("")),zl=Object.freeze(Bq("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz")),Yl=Object.freeze(Bq("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ")),Wl=Object.freeze(Bq("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz"));var Tq=FU(uU("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),xU("")),a7=[996825010,642813549,513874426,1027748829,705979059];function D8($){let U=$>>25,J=($&33554431)<<5;for(let G=0;G<a7.length;G++)if((U>>G&1)===1)J^=a7[G];return J}function t7($,U,J=1){let G=$.length,I=1;for(let Q=0;Q<G;Q++){let X=$.charCodeAt(Q);if(X<33||X>126)throw Error(`Invalid prefix (${$})`);I=D8(I)^X>>5}I=D8(I);for(let Q=0;Q<G;Q++)I=D8(I)^$.charCodeAt(Q)&31;for(let Q of U)I=D8(I)^Q;for(let Q=0;Q<6;Q++)I=D8(I);return I^=J,Tq.encode(Hq([I%SQ[30]],30,5,!1))}function GZ($){let U=$==="bech32"?1:734539939,J=iU(5),G=J.decode,I=J.encode,Q=o7(G);function X(W,w,V=90){if(zI("bech32.encode prefix",W),bQ(w))w=Array.from(w);Aq("bech32.encode",w);let Z=W.length;if(Z===0)throw TypeError(`Invalid prefix length ${Z}`);let v=Z+7+w.length;if(V!==!1&&v>V)throw TypeError(`Length ${v} exceeds limit ${V}`);let N=W.toLowerCase(),j=t7(N,w,U);return`${N}1${Tq.encode(w)}${j}`}function O(W,w=90){zI("bech32.decode input",W);let V=W.length;if(V<8||w!==!1&&V>w)throw TypeError(`invalid string length: ${V} (${W}). Expected (8..${w})`);let Z=W.toLowerCase();if(W!==Z&&W!==W.toUpperCase())throw Error("String must be lowercase or uppercase");let v=Z.lastIndexOf("1");if(v===0||v===-1)throw Error('Letter "1" must be present between prefix and data only');let N=Z.slice(0,v),j=Z.slice(v+1);if(j.length<6)throw Error("Data must be at least 6 characters long");let R=Tq.decode(j).slice(0,-6),S=t7(N,R,U);if(!j.endsWith(S))throw Error(`Invalid checksum in ${W}: expected "${S}"`);return{prefix:N,words:R}}let q=o7(O);function D(W){let{prefix:w,words:V}=O(W,!1);return{prefix:w,words:V,bytes:G(V)}}function z(W,w){return X(W,I(w))}return{encode:X,decode:O,encodeFromBytes:z,decodeToBytes:D,decodeUnsafe:q,fromWords:G,fromWordsUnsafe:Q,toWords:I}}var mU=Object.freeze(GZ("bech32")),wl=Object.freeze(GZ("bech32m"));var uP=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),xP={encode($){return Kq($),$.toHex()},decode($){return zI("hex",$),Uint8Array.fromHex($)}},Vl=Object.freeze(uP?xP:FU(iU(4),uU("0123456789abcdef"),xU(""),$Z(($)=>{if(typeof $!=="string"||$.length%2!==0)throw TypeError(`hex.decode: expected string, got ${typeof $} with length ${$.length}`);return $.toLowerCase()})));function yP($,U,J,G){u0($);let I=AQ({dkLen:32,asyncTick:10},G),{c:Q,dkLen:X,asyncTick:O}=I;if(m$(Q,"c"),m$(X,"dkLen"),m$(O,"asyncTick"),Q<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 q=Wq(U,"password"),D=Wq(J,"salt"),z=new Uint8Array(X),W=w0.create($,q),w=W._cloneInto().update(D);return{c:Q,dkLen:X,asyncTick:O,DK:z,PRF:W,PRFSalt:w}}function rP($,U,J,G,I){if($.destroy(),U.destroy(),G)G.destroy();return gU(I),J}function Lq($,U,J,G){let{c:I,dkLen:Q,DK:X,PRF:O,PRFSalt:q}=yP($,U,J,G),D,z=new Uint8Array(4),W=mJ(z),w=new Uint8Array(O.outputLen);for(let V=1,Z=0;Z<Q;V++,Z+=O.outputLen){let v=X.subarray(Z,Z+O.outputLen);W.setInt32(0,V,!1),(D=q._cloneInto(D)).update(z).digestInto(w),v.set(w.subarray(0,v.length));for(let N=1;N<I;N++){O._cloneInto(D).update(w).digestInto(w);for(let j=0;j<v.length;j++)v[j]^=w[j]}}return rP(O,q,X,D,w)}function QZ($,U,J,G,I,Q){let X=$[U++]^J[G++],O=$[U++]^J[G++],q=$[U++]^J[G++],D=$[U++]^J[G++],z=$[U++]^J[G++],W=$[U++]^J[G++],w=$[U++]^J[G++],V=$[U++]^J[G++],Z=$[U++]^J[G++],v=$[U++]^J[G++],N=$[U++]^J[G++],j=$[U++]^J[G++],R=$[U++]^J[G++],S=$[U++]^J[G++],L=$[U++]^J[G++],k=$[U++]^J[G++],x=X,h=O,B=q,m=D,a=z,C=W,A=w,E=V,M=Z,T=v,H=N,b=j,P=R,F=S,y=L,n=k;for(let $$=0;$$<8;$$+=2)a^=P$(x+P|0,7),M^=P$(a+x|0,9),P^=P$(M+a|0,13),x^=P$(P+M|0,18),T^=P$(C+h|0,7),F^=P$(T+C|0,9),h^=P$(F+T|0,13),C^=P$(h+F|0,18),y^=P$(H+A|0,7),B^=P$(y+H|0,9),A^=P$(B+y|0,13),H^=P$(A+B|0,18),m^=P$(n+b|0,7),E^=P$(m+n|0,9),b^=P$(E+m|0,13),n^=P$(b+E|0,18),h^=P$(x+m|0,7),B^=P$(h+x|0,9),m^=P$(B+h|0,13),x^=P$(m+B|0,18),A^=P$(C+a|0,7),E^=P$(A+C|0,9),a^=P$(E+A|0,13),C^=P$(a+E|0,18),b^=P$(H+T|0,7),M^=P$(b+H|0,9),T^=P$(M+b|0,13),H^=P$(T+M|0,18),P^=P$(n+y|0,7),F^=P$(P+n|0,9),y^=P$(F+P|0,13),n^=P$(y+F|0,18);I[Q++]=X+x|0,I[Q++]=O+h|0,I[Q++]=q+B|0,I[Q++]=D+m|0,I[Q++]=z+a|0,I[Q++]=W+C|0,I[Q++]=w+A|0,I[Q++]=V+E|0,I[Q++]=Z+M|0,I[Q++]=v+T|0,I[Q++]=N+H|0,I[Q++]=j+b|0,I[Q++]=R+P|0,I[Q++]=S+F|0,I[Q++]=L+y|0,I[Q++]=k+n|0}function Sq($,U,J,G,I){let Q=G+0,X=G+16*I;for(let O=0;O<16;O++)J[X+O]=$[U+(2*I-1)*16+O];for(let O=0;O<I;O++,Q+=16,U+=16){if(QZ(J,X,$,U,J,Q),O>0)X+=16;QZ(J,Q,$,U+=16,J,X)}}function hP($,U,J){let G=AQ({dkLen:32,asyncTick:10,maxmem:1073742848},J),{N:I,r:Q,p:X,dkLen:O,asyncTick:q,maxmem:D,onProgress:z}=G;if(m$(I,"N"),m$(Q,"r"),m$(X,"p"),m$(O,"dkLen"),m$(q,"asyncTick"),m$(D,"maxmem"),z!==void 0&&typeof z!=="function")throw Error("progressCb must be a function");let W=128*Q,w=W/4,V=Math.pow(2,32);if(I<=1||(I&I-1)!==0||I>V)throw Error('"N" expected a power of 2, and 2^1 <= N <= 2^32');if(X<1||X>(V-1)*32/W)throw Error('"p" expected integer 1..((2^32 - 1) * 32) / (128 * r)');if(O<1||O>(V-1)*32)throw Error('"dkLen" expected integer 1..(2^32 - 1) * 32');let Z=W*(I+X+1);if(Z>D)throw Error('"maxmem" limit was hit: memUsed(128*r*(N+p+1))='+Z+", maxmem="+D);let v=Lq(y$,$,U,{c:1,dkLen:W*X}),N=TQ(v),j=TQ(new Uint8Array(W*I)),R=TQ(new Uint8Array(W)),S=()=>{};if(z){let L=2*I*X,k=Math.max(Math.floor(L/1e4),1),x=0;S=()=>{if(x++,z&&(!(x%k)||x===L))z(x/L)}}return{N:I,r:Q,p:X,dkLen:O,blockSize32:w,V:j,B32:N,B:v,tmp:R,blockMixCb:S,asyncTick:q}}function lP($,U,J,G,I){let Q=Lq(y$,$,J,{c:1,dkLen:U});return gU(J,G,I),Q}function _q($,U,J){let{N:G,r:I,p:Q,dkLen:X,blockSize32:O,V:q,B32:D,B:z,tmp:W,blockMixCb:w}=hP($,U,J);Yq(D);for(let V=0;V<Q;V++){let Z=O*V;for(let v=0;v<O;v++)q[v]=D[Z+v];for(let v=0,N=0;v<G-1;v++)Sq(q,N,q,N+=O,I),w();Sq(q,(G-1)*O,D,Z,I),w();for(let v=0;v<G;v++){let N=(D[Z+O-16]&G-1)>>>0;for(let j=0;j<O;j++)W[j]=D[Z+j]^q[N*O+j];Sq(W,0,D,Z,I),w()}}return Yq(D),lP($,X,z,q,W)}/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */function dP($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function kQ($){if(typeof $!=="boolean")throw TypeError(`boolean expected, not ${$}`)}function yJ($){if(typeof $!=="number")throw TypeError("number expected, got "+typeof $);if(!Number.isSafeInteger($)||$<0)throw RangeError("positive integer expected, got "+$)}function d$($,U,J=""){let G=dP($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",q=G?`length=${I}`:`type=${typeof $}`,D=X+"expected Uint8Array"+O+", got "+q;if(!G)throw TypeError(D);throw RangeError(D)}return $}function Cq($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function XZ($,U,J=!1){d$($,void 0,"output");let G=U.outputLen;if($.length<G)throw RangeError("digestInto() expects output buffer of length at least "+G);if(J&&!rJ($))throw Error("invalid output, must be aligned")}function v0($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function I0(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function nP($){return new DataView($.buffer,$.byteOffset,$.byteLength)}var iI=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)(),iP=($)=>$<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255;var cP=($)=>{for(let U=0;U<$.length;U++)$[U]=iP($[U]);return $},r0=iI?($)=>$:cP;function OZ($,U){if(U==null||typeof U!=="object")throw Error("options must be defined");return Object.assign($,U)}function qZ($,U){if($.length!==U.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^U[G];return J===0}function DZ($,U,J){let G=U,I=J||(()=>[]),Q=(O,q)=>G(q,...I(O)).update(O).digest(),X=G(new Uint8Array($),...I(new Uint8Array(0)));return Q.outputLen=X.outputLen,Q.blockLen=X.blockLen,Q.create=(O,...q)=>G(O,...q),Q}var zZ=($,U)=>{function J(G,...I){if(d$(G,void 0,"key"),$.nonceLength!==void 0){let z=I[0];d$(z,$.varSizeNonce?void 0:$.nonceLength,"nonce")}let Q=$.tagLength;if(Q&&I[1]!==void 0)d$(I[1],void 0,"AAD");let X=U(G,...I),O=(z,W)=>{if(W!==void 0){if(z!==2)throw Error("cipher output not supported");d$(W,void 0,"output")}},q=!1;return{encrypt(z,W){if(q)throw Error("cannot encrypt() twice with same key + nonce");return q=!0,d$(z),O(X.encrypt.length,W),X.encrypt(z,W)},decrypt(z,W){if(d$(z),Q&&z.length<Q)throw Error('"ciphertext" expected length bigger than tagLength='+Q);return O(X.decrypt.length,W),X.decrypt(z,W)}}}return Object.assign(J,$),J};function Y8($,U,J=!0){if(U===void 0)return new Uint8Array($);if(d$(U,void 0,"output"),U.length!==$)throw Error('"output" expected Uint8Array of length '+$+", got: "+U.length);if(J&&!rJ(U))throw Error("invalid output, must be aligned");return U}function YZ($,U,J){yJ($),yJ(U),kQ(J);let G=new Uint8Array(16),I=nP(G);return I.setBigUint64(0,BigInt(U),J),I.setBigUint64(8,BigInt($),J),G}function rJ($){return $.byteOffset%4===0}function hJ($){return Uint8Array.from(d$($))}var wZ=($)=>Uint8Array.from($.split(""),(U)=>U.charCodeAt(0)),pP=(()=>r0(v0(wZ("expand 16-byte k"))))(),oP=(()=>r0(v0(wZ("expand 32-byte k"))))();function B$($,U){return $<<U|$>>>32-U}var W8=64,aP=16,Eq=(()=>4294967295)(),WZ=Uint32Array.of();function tP($,U,J,G,I,Q,X,O){let q=I.length,D=new Uint8Array(W8),z=v0(D),W=iI&&rJ(I)&&rJ(Q),w=W?v0(I):WZ,V=W?v0(Q):WZ;if(!iI){for(let Z=0;Z<q;X++){if($(U,J,G,z,X,O),r0(z),X>=Eq)throw Error("arx: counter overflow");let v=Math.min(W8,q-Z);for(let N=0,j;N<v;N++)j=Z+N,Q[j]=I[j]^D[N];Z+=v}return}for(let Z=0;Z<q;X++){if($(U,J,G,z,X,O),X>=Eq)throw Error("arx: counter overflow");let v=Math.min(W8,q-Z);if(W&&v===W8){let N=Z/4;if(Z%4!==0)throw Error("arx: invalid block position");for(let j=0,R;j<aP;j++)R=N+j,V[R]=w[R]^z[j];Z+=W8;continue}for(let N=0,j;N<v;N++)j=Z+N,Q[j]=I[j]^D[N];Z+=v}}function VZ($,U){let{allowShortKeys:J,extendNonceFn:G,counterLength:I,counterRight:Q,rounds:X}=OZ({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},U);if(typeof $!=="function")throw Error("core must be a function");return yJ(I),yJ(X),kQ(Q),kQ(J),(O,q,D,z,W=0)=>{d$(O,void 0,"key"),d$(q,void 0,"nonce"),d$(D,void 0,"data");let w=D.length;if(z=Y8(w,z,!1),yJ(W),W<0||W>=Eq)throw Error("arx: counter overflow");let V=[],Z=O.length,v,N;if(Z===32)V.push(v=hJ(O)),N=oP;else if(Z===16&&J)v=new Uint8Array(32),v.set(O),v.set(O,16),N=pP,V.push(v);else throw d$(O,32,"arx key"),Error("invalid key size");if(!iI||!rJ(q))V.push(q=hJ(q));let j=v0(v);if(G){if(q.length!==24)throw Error("arx: extended nonce must be 24 bytes");let L=q.subarray(0,16);if(iI)G(N,j,v0(L),j);else{let k=r0(Uint32Array.from(N));G(k,j,v0(L),j),I0(k),r0(j)}q=q.subarray(16)}else if(!iI)r0(j);let R=16-I;if(R!==q.length)throw Error(`arx: nonce must be ${R} or 16 bytes`);if(R!==12){let L=new Uint8Array(12);L.set(q,Q?0:12-q.length),q=L,V.push(q)}let S=r0(v0(q));try{return tP($,N,j,S,D,z,W,X),z}finally{I0(...V)}}}function $U($,U){return $[U++]&255|($[U++]&255)<<8}class vZ{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($){$=hJ(d$($,32,"key"));let U=$U($,0),J=$U($,2),G=$U($,4),I=$U($,6),Q=$U($,8),X=$U($,10),O=$U($,12),q=$U($,14);this.r[0]=U&8191,this.r[1]=(U>>>13|J<<3)&8191,this.r[2]=(J>>>10|G<<6)&7939,this.r[3]=(G>>>7|I<<9)&8191,this.r[4]=(I>>>4|Q<<12)&255,this.r[5]=Q>>>1&8190,this.r[6]=(Q>>>14|X<<2)&8191,this.r[7]=(X>>>11|O<<5)&8065,this.r[8]=(O>>>8|q<<8)&8191,this.r[9]=q>>>5&127;for(let D=0;D<8;D++)this.pad[D]=$U($,16+2*D)}process($,U,J=!1){let G=J?0:2048,{h:I,r:Q}=this,X=Q[0],O=Q[1],q=Q[2],D=Q[3],z=Q[4],W=Q[5],w=Q[6],V=Q[7],Z=Q[8],v=Q[9],N=$U($,U+0),j=$U($,U+2),R=$U($,U+4),S=$U($,U+6),L=$U($,U+8),k=$U($,U+10),x=$U($,U+12),h=$U($,U+14),B=I[0]+(N&8191),m=I[1]+((N>>>13|j<<3)&8191),a=I[2]+((j>>>10|R<<6)&8191),C=I[3]+((R>>>7|S<<9)&8191),A=I[4]+((S>>>4|L<<12)&8191),E=I[5]+(L>>>1&8191),M=I[6]+((L>>>14|k<<2)&8191),T=I[7]+((k>>>11|x<<5)&8191),H=I[8]+((x>>>8|h<<8)&8191),b=I[9]+(h>>>5|G),P=0,F=P+B*X+m*(5*v)+a*(5*Z)+C*(5*V)+A*(5*w);P=F>>>13,F&=8191,F+=E*(5*W)+M*(5*z)+T*(5*D)+H*(5*q)+b*(5*O),P+=F>>>13,F&=8191;let y=P+B*O+m*X+a*(5*v)+C*(5*Z)+A*(5*V);P=y>>>13,y&=8191,y+=E*(5*w)+M*(5*W)+T*(5*z)+H*(5*D)+b*(5*q),P+=y>>>13,y&=8191;let n=P+B*q+m*O+a*X+C*(5*v)+A*(5*Z);P=n>>>13,n&=8191,n+=E*(5*V)+M*(5*w)+T*(5*W)+H*(5*z)+b*(5*D),P+=n>>>13,n&=8191;let $$=P+B*D+m*q+a*O+C*X+A*(5*v);P=$$>>>13,$$&=8191,$$+=E*(5*Z)+M*(5*V)+T*(5*w)+H*(5*W)+b*(5*z),P+=$$>>>13,$$&=8191;let X$=P+B*z+m*D+a*q+C*O+A*X;P=X$>>>13,X$&=8191,X$+=E*(5*v)+M*(5*Z)+T*(5*V)+H*(5*w)+b*(5*W),P+=X$>>>13,X$&=8191;let q$=P+B*W+m*z+a*D+C*q+A*O;P=q$>>>13,q$&=8191,q$+=E*X+M*(5*v)+T*(5*Z)+H*(5*V)+b*(5*w),P+=q$>>>13,q$&=8191;let W$=P+B*w+m*W+a*z+C*D+A*q;P=W$>>>13,W$&=8191,W$+=E*O+M*X+T*(5*v)+H*(5*Z)+b*(5*V),P+=W$>>>13,W$&=8191;let N$=P+B*V+m*w+a*W+C*z+A*D;P=N$>>>13,N$&=8191,N$+=E*q+M*O+T*X+H*(5*v)+b*(5*Z),P+=N$>>>13,N$&=8191;let V$=P+B*Z+m*V+a*w+C*W+A*z;P=V$>>>13,V$&=8191,V$+=E*D+M*q+T*O+H*X+b*(5*v),P+=V$>>>13,V$&=8191;let v$=P+B*v+m*Z+a*V+C*w+A*W;P=v$>>>13,v$&=8191,v$+=E*z+M*D+T*q+H*O+b*X,P+=v$>>>13,v$&=8191,P=(P<<2)+P|0,P=P+F|0,F=P&8191,P=P>>>13,y+=P,I[0]=F,I[1]=y,I[2]=n,I[3]=$$,I[4]=X$,I[5]=q$,I[6]=W$,I[7]=N$,I[8]=V$,I[9]=v$}finalize(){let{h:$,pad:U}=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 I=(G^1)-1;for(let X=0;X<10;X++)J[X]&=I;I=~I;for(let X=0;X<10;X++)$[X]=$[X]&I|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 Q=$[0]+U[0];$[0]=Q&65535;for(let X=1;X<8;X++)Q=($[X]+U[X]|0)+(Q>>>16)|0,$[X]=Q&65535;I0(J)}update($){Cq(this),d$($),$=hJ($);let{buffer:U,blockLen:J}=this,G=$.length;for(let I=0;I<G;){let Q=Math.min(J-this.pos,G-I);if(Q===J){for(;J<=G-I;I+=J)this.process($,I);continue}if(U.set($.subarray(I,I+Q),this.pos),this.pos+=Q,I+=Q,this.pos===J)this.process(U,0,!1),this.pos=0}return this}destroy(){this.destroyed=!0,I0(this.h,this.r,this.buffer,this.pad)}digestInto($){Cq(this),XZ($,this),this.finished=!0;let{buffer:U,h:J}=this,{pos:G}=this;if(G){U[G++]=1;for(;G<16;G++)U[G]=0;this.process(U,0,!0)}this.finalize();let I=0;for(let Q=0;Q<8;Q++)$[I++]=J[Q]>>>0,$[I++]=J[Q]>>>8}digest(){let{buffer:$,outputLen:U}=this;this.digestInto($);let J=$.slice(0,U);return this.destroy(),J}}var NZ=DZ(32,($)=>new vZ($));function sP($,U,J,G,I,Q=20){let X=$[0],O=$[1],q=$[2],D=$[3],z=U[0],W=U[1],w=U[2],V=U[3],Z=U[4],v=U[5],N=U[6],j=U[7],R=I,S=J[0],L=J[1],k=J[2],x=X,h=O,B=q,m=D,a=z,C=W,A=w,E=V,M=Z,T=v,H=N,b=j,P=R,F=S,y=L,n=k;for(let X$=0;X$<Q;X$+=2)x=x+a|0,P=B$(P^x,16),M=M+P|0,a=B$(a^M,12),x=x+a|0,P=B$(P^x,8),M=M+P|0,a=B$(a^M,7),h=h+C|0,F=B$(F^h,16),T=T+F|0,C=B$(C^T,12),h=h+C|0,F=B$(F^h,8),T=T+F|0,C=B$(C^T,7),B=B+A|0,y=B$(y^B,16),H=H+y|0,A=B$(A^H,12),B=B+A|0,y=B$(y^B,8),H=H+y|0,A=B$(A^H,7),m=m+E|0,n=B$(n^m,16),b=b+n|0,E=B$(E^b,12),m=m+E|0,n=B$(n^m,8),b=b+n|0,E=B$(E^b,7),x=x+C|0,n=B$(n^x,16),H=H+n|0,C=B$(C^H,12),x=x+C|0,n=B$(n^x,8),H=H+n|0,C=B$(C^H,7),h=h+A|0,P=B$(P^h,16),b=b+P|0,A=B$(A^b,12),h=h+A|0,P=B$(P^h,8),b=b+P|0,A=B$(A^b,7),B=B+E|0,F=B$(F^B,16),M=M+F|0,E=B$(E^M,12),B=B+E|0,F=B$(F^B,8),M=M+F|0,E=B$(E^M,7),m=m+a|0,y=B$(y^m,16),T=T+y|0,a=B$(a^T,12),m=m+a|0,y=B$(y^m,8),T=T+y|0,a=B$(a^T,7);let $$=0;G[$$++]=X+x|0,G[$$++]=O+h|0,G[$$++]=q+B|0,G[$$++]=D+m|0,G[$$++]=z+a|0,G[$$++]=W+C|0,G[$$++]=w+A|0,G[$$++]=V+E|0,G[$$++]=Z+M|0,G[$$++]=v+T|0,G[$$++]=N+H|0,G[$$++]=j+b|0,G[$$++]=R+P|0,G[$$++]=S+F|0,G[$$++]=L+y|0,G[$$++]=k+n|0}var eP=VZ(sP,{counterRight:!1,counterLength:4,allowShortKeys:!1});var $B=new Uint8Array(16),ZZ=($,U)=>{$.update(U);let J=U.length%16;if(J)$.update($B.subarray(J))},UB=new Uint8Array(32);function gZ($,U,J,G,I){if(I!==void 0)d$(I,void 0,"AAD");let Q=$(U,J,UB),X=YZ(G.length,I?I.length:0,!0),O=NZ.create(Q);if(I)ZZ(O,I);ZZ(O,G),O.update(X);let q=O.digest();return I0(Q,X),q}var IB=($)=>(U,J,G)=>{return{encrypt(Q,X){let O=Q.length;X=Y8(O+16,X,!1),X.set(Q);let q=X.subarray(0,-16);$(U,J,q,q,1);let D=gZ($,U,J,q,G);return X.set(D,O),I0(D),X},decrypt(Q,X){X=Y8(Q.length-16,X,!1);let O=Q.subarray(0,-16),q=Q.subarray(-16),D=gZ($,U,J,O,G);if(!qZ(q,D))throw I0(D),Error("invalid tag");return X.set(Q.subarray(0,-16)),$(U,J,X,X,1),I0(D),X}}},cU=zZ({blockSize:64,nonceLength:12,tagLength:16},IB(eP));/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function lJ($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"}function p$($,U=""){if(!Number.isSafeInteger($)||$<0){let J=U&&`"${U}" `;throw Error(`${J}expected integer >= 0, got ${$}`)}}function g$($,U,J=""){let G=lJ($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",q=G?`length=${I}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+O+", got "+q)}return $}function pU($){if(typeof $!=="function"||typeof $.create!=="function")throw Error("Hash must wrapped by utils.createHasher");p$($.outputLen),p$($.blockLen)}function l0($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function FQ($,U){g$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw Error('"digestInto() output" expected to be of length >='+J)}function uQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function SU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function xQ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function J0($,U){return $<<32-U|$>>>U}var JB=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function GB($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function QB($){for(let U=0;U<$.length;U++)$[U]=GB($[U]);return $}var bq=JB?($)=>$:QB,RZ=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),XB=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function cI($){if(g$($),RZ)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=XB[$[J]];return U}var h0={_0:48,_9:57,A:65,F:70,a:97,f:102};function MZ($){if($>=h0._0&&$<=h0._9)return $-h0._0;if($>=h0.A&&$<=h0.F)return $-(h0.A-10);if($>=h0.a&&$<=h0.f)return $-(h0.a-10);return}function pI($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(RZ)return Uint8Array.fromHex($);let U=$.length,J=U/2;if(U%2)throw Error("hex string expected, got unpadded hex of length "+U);let G=new Uint8Array(J);for(let I=0,Q=0;I<J;I++,Q+=2){let X=MZ($.charCodeAt(Q)),O=MZ($.charCodeAt(Q+1));if(X===void 0||O===void 0){let q=$[Q]+$[Q+1];throw Error('hex string expected, got non-hex character "'+q+'" at index '+Q)}G[I]=X*16+O}return G}function r$(...$){let U=0;for(let G=0;G<$.length;G++){let I=$[G];g$(I),U+=I.length}let J=new Uint8Array(U);for(let G=0,I=0;G<$.length;G++){let Q=$[G];J.set(Q,I),I+=Q.length}return J}function dJ($,U={}){let J=(I,Q)=>$(Q).update(I).digest(),G=$(void 0);return J.outputLen=G.outputLen,J.blockLen=G.blockLen,J.create=(I)=>$(I),Object.assign(J,U),Object.freeze(J)}function YI($=32){let U=typeof globalThis==="object"?globalThis.crypto:null;if(typeof U?.getRandomValues!=="function")throw Error("crypto.getRandomValues must be defined");return U.getRandomValues(new Uint8Array($))}var WI=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var kq=BigInt(0),fq=BigInt(1);function w8($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw Error(J+"expected boolean, got type="+typeof $)}return $}function jZ($){if(typeof $==="bigint"){if(!mQ($))throw Error("positive bigint expected, got "+$)}else p$($);return $}function V8($){let U=jZ($).toString(16);return U.length&1?"0"+U:U}function HZ($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?kq:BigInt("0x"+$)}function wI($){return HZ(cI($))}function VI($){return HZ(cI(yQ(g$($)).reverse()))}function nJ($,U){p$(U),$=jZ($);let J=pI($.toString(16).padStart(U*2,"0"));if(J.length!==U)throw Error("number too large");return J}function v8($,U){return nJ($,U).reverse()}function yQ($){return Uint8Array.from($)}function vI($){return Uint8Array.from($,(U,J)=>{let G=U.charCodeAt(0);if(U.length!==1||G>127)throw Error(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var mQ=($)=>typeof $==="bigint"&&kq<=$;function OB($,U,J){return mQ($)&&mQ(U)&&mQ(J)&&U<=$&&$<J}function N8($,U,J,G){if(!OB(U,J,G))throw Error("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function Fq($){let U;for(U=0;$>kq;$>>=fq,U+=1);return U}var Z8=($)=>(fq<<BigInt($))-fq;function TZ($,U,J){if(p$($,"hashLen"),p$(U,"qByteLen"),typeof J!=="function")throw Error("hmacFn must be a function");let G=(N)=>new Uint8Array(N),I=Uint8Array.of(),Q=Uint8Array.of(0),X=Uint8Array.of(1),O=1000,q=G($),D=G($),z=0,W=()=>{q.fill(1),D.fill(0),z=0},w=(...N)=>J(D,r$(q,...N)),V=(N=I)=>{if(D=w(Q,N),q=w(),N.length===0)return;D=w(X,N),q=w()},Z=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){q=w();let R=q.slice();j.push(R),N+=q.length}return r$(...j)};return(N,j)=>{W(),V(N);let R=void 0;while(!(R=j(Z())))V();return W(),R}}function oI($,U={},J={}){if(!$||typeof $!=="object")throw Error("expected valid options object");function G(Q,X,O){let q=$[Q];if(O&&q===void 0)return;let D=typeof q;if(D!==X||q===null)throw Error(`param "${Q}" is invalid: expected ${X}, got ${D}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,q])=>G(O,q,X));I(U,!1),I(J,!0)}function uq($){let U=new WeakMap;return(J,...G)=>{let I=U.get(J);if(I!==void 0)return I;let Q=$(J,...G);return U.set(J,Q),Q}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var RU=BigInt(0),WU=BigInt(1),aI=BigInt(2),PZ=BigInt(3),BZ=BigInt(4),LZ=BigInt(5),qB=BigInt(7),SZ=BigInt(8),DB=BigInt(9),_Z=BigInt(16);function MU($,U){let J=$%U;return J>=RU?J:U+J}function oU($,U,J){let G=$;while(U-- >RU)G*=G,G%=J;return G}function KZ($,U){if($===RU)throw Error("invert: expected non-zero number");if(U<=RU)throw Error("invert: expected positive modulus, got "+U);let J=MU($,U),G=U,I=RU,Q=WU,X=WU,O=RU;while(J!==RU){let D=G/J,z=G%J,W=I-X*D,w=Q-O*D;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==WU)throw Error("invert: does not exist");return MU(I,U)}function xq($,U,J){if(!$.eql($.sqr(U),J))throw Error("Cannot find square root")}function CZ($,U){let J=($.ORDER+WU)/BZ,G=$.pow(U,J);return xq($,G,U),G}function zB($,U){let J=($.ORDER-LZ)/SZ,G=$.mul(U,aI),I=$.pow(G,J),Q=$.mul(U,I),X=$.mul($.mul(Q,aI),I),O=$.mul(Q,$.sub(X,$.ONE));return xq($,O,U),O}function YB($){let U=rQ($),J=EZ($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+qB)/_Z;return(O,q)=>{let D=O.pow(q,X),z=O.mul(D,G),W=O.mul(D,I),w=O.mul(D,Q),V=O.eql(O.sqr(z),q),Z=O.eql(O.sqr(W),q);D=O.cmov(D,z,V),z=O.cmov(w,W,Z);let v=O.eql(O.sqr(z),q),N=O.cmov(D,z,v);return xq(O,N,q),N}}function EZ($){if($<PZ)throw Error("sqrt is not defined for small field");let U=$-WU,J=0;while(U%aI===RU)U/=aI,J++;let G=aI,I=rQ($);while(AZ(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return CZ;let Q=I.pow(G,U),X=(U+WU)/aI;return function(q,D){if(q.is0(D))return D;if(AZ(q,D)!==1)throw Error("Cannot find square root");let z=J,W=q.mul(q.ONE,Q),w=q.pow(D,U),V=q.pow(D,X);while(!q.eql(w,q.ONE)){if(q.is0(w))return q.ZERO;let Z=1,v=q.sqr(w);while(!q.eql(v,q.ONE))if(Z++,v=q.sqr(v),Z===z)throw Error("Cannot find square root");let N=WU<<BigInt(z-Z-1),j=q.pow(W,N);z=Z,W=q.sqr(j),w=q.mul(w,W),V=q.mul(V,j)}return V}}function WB($){if($%BZ===PZ)return CZ;if($%SZ===LZ)return zB;if($%_Z===DB)return YB($);return EZ($)}var wB=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function mq($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=wB.reduce((G,I)=>{return G[I]="function",G},U);return oI($,J),$}function VB($,U,J){if(J<RU)throw Error("invalid exponent, negatives unsupported");if(J===RU)return $.ONE;if(J===WU)return U;let G=$.ONE,I=U;while(J>RU){if(J&WU)G=$.mul(G,I);I=$.sqr(I),J>>=WU}return G}function g8($,U,J=!1){let G=Array(U.length).fill(J?$.ZERO:void 0),I=U.reduce((X,O,q)=>{if($.is0(O))return X;return G[q]=X,$.mul(X,O)},$.ONE),Q=$.inv(I);return U.reduceRight((X,O,q)=>{if($.is0(O))return X;return G[q]=$.mul(X,G[q]),$.mul(X,O)},Q),G}function AZ($,U){let J=($.ORDER-WU)/aI,G=$.pow(U,J),I=$.eql(G,$.ONE),Q=$.eql(G,$.ZERO),X=$.eql(G,$.neg($.ONE));if(!I&&!Q&&!X)throw Error("invalid Legendre symbol result");return I?1:Q?0:-1}function vB($,U){if(U!==void 0)p$(U);let J=U!==void 0?U:$.toString(2).length,G=Math.ceil(J/8);return{nBitLength:J,nByteLength:G}}class bZ{ORDER;BITS;BYTES;isLE;ZERO=RU;ONE=WU;_lengths;_sqrt;_mod;constructor($,U={}){if($<=RU)throw Error("invalid field: expected ORDER > 0, got "+$);let J=void 0;if(this.isLE=!1,U!=null&&typeof U==="object"){if(typeof U.BITS==="number")J=U.BITS;if(typeof U.sqrt==="function")this.sqrt=U.sqrt;if(typeof U.isLE==="boolean")this.isLE=U.isLE;if(U.allowedLengths)this._lengths=U.allowedLengths?.slice();if(typeof U.modFromBytes==="boolean")this._mod=U.modFromBytes}let{nBitLength:G,nByteLength:I}=vB($,J);if(I>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=I,this._sqrt=void 0,Object.preventExtensions(this)}create($){return MU($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof $);return RU<=$&&$<this.ORDER}is0($){return $===RU}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&WU)===WU}neg($){return MU(-$,this.ORDER)}eql($,U){return $===U}sqr($){return MU($*$,this.ORDER)}add($,U){return MU($+U,this.ORDER)}sub($,U){return MU($-U,this.ORDER)}mul($,U){return MU($*U,this.ORDER)}pow($,U){return VB(this,$,U)}div($,U){return MU($*KZ(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return KZ($,this.ORDER)}sqrt($){if(!this._sqrt)this._sqrt=WB(this.ORDER);return this._sqrt(this,$)}toBytes($){return this.isLE?v8($,this.BYTES):nJ($,this.BYTES)}fromBytes($,U=!1){g$($);let{_lengths:J,BYTES:G,isLE:I,ORDER:Q,_mod:X}=this;if(J){if(!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let q=new Uint8Array(G);q.set($,I?0:q.length-$.length),$=q}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?VI($):wI($);if(X)O=MU(O,Q);if(!U){if(!this.isValid(O))throw Error("invalid field element: outside of range 0..ORDER")}return O}invertBatch($){return g8(this,$)}cmov($,U,J){return J?U:$}}function rQ($,U={}){return new bZ($,U)}function fZ($){if(typeof $!=="bigint")throw Error("field order must be bigint");let U=$.toString(2).length;return Math.ceil(U/8)}function yq($){let U=fZ($);return U+Math.ceil(U/2)}function kZ($,U,J=!1){g$($);let G=$.length,I=fZ(U),Q=yq(U);if(G<16||G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?VI($):wI($),O=MU(X,U-WU)+WU;return J?v8(O,I):nJ(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var iJ=BigInt(0),tI=BigInt(1);function M8($,U){let J=U.negate();return $?J:U}function dq($,U){let J=g8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function mZ($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function rq($,U){mZ($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=Z8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function FZ($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),q=$>>X;if(O>G)O-=Q,q+=tI;let D=U*G,z=D+Math.abs(O)-1,W=O===0,w=O<0,V=U%2!==0;return{nextN:q,offset:z,isZero:W,isNeg:w,isNegF:V,offsetF:D}}var hq=new WeakMap,yZ=new WeakMap;function lq($){return yZ.get($)||1}function uZ($){if($!==iJ)throw Error("invalid wNAF")}class nq{BASE;ZERO;Fn;bits;constructor($,U){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=U}_unsafeLadder($,U,J=this.ZERO){let G=$;while(U>iJ){if(U&tI)J=J.add(G);G=G.double(),U>>=tI}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=rq(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let q=1;q<G;q++)X=X.add(Q),I.push(X);Q=X.double()}return I}wNAF($,U,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,I=this.BASE,Q=rq($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:q,isZero:D,isNeg:z,isNegF:W,offsetF:w}=FZ(J,X,Q);if(J=O,D)I=I.add(M8(W,U[w]));else G=G.add(M8(z,U[q]))}return uZ(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=rq($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===iJ)break;let{nextN:X,offset:O,isZero:q,isNeg:D}=FZ(J,Q,I);if(J=X,q)continue;else{let z=U[O];G=G.add(D?z.negate():z)}}return uZ(J),G}getPrecomputes($,U,J){let G=hq.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);hq.set(U,G)}}return G}cached($,U,J){let G=lq($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=lq($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){mZ(U,this.bits),yZ.set($,U),hq.delete($)}hasCache($){return lq($)!==1}}function rZ($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>iJ||G>iJ){if(J&tI)Q=Q.add(I);if(G&tI)X=X.add(I);I=I.double(),J>>=tI,G>>=tI}return{p1:Q,p2:X}}function xZ($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return mq(U),U}else return rQ($,{isLE:J})}function hZ($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let q of["p","n","h"]){let D=U[q];if(!(typeof D==="bigint"&&D>iJ))throw Error(`CURVE.${q} must be positive bigint`)}let I=xZ(U.p,J.Fp,G),Q=xZ(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let q of O)if(!I.isValid(U[q]))throw Error(`CURVE.${q} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function hQ($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var R8=BigInt(0),cJ=BigInt(1),lQ=BigInt(2);function NB($){return oI($,{adjustScalarBytes:"function",powPminus2:"function"}),Object.freeze({...$})}function lZ($){let U=NB($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let q=X||YI,D=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),V=O?lQ**BigInt(254):lQ**BigInt(447),Z=O?BigInt(8)*lQ**BigInt(251)-cJ:BigInt(4)*lQ**BigInt(445)-cJ,v=V+Z+cJ,N=(M)=>MU(M,J),j=R(W);function R(M){return v8(N(M),z)}function S(M){let T=yQ(g$(M,z,"uCoordinate"));if(O)T[31]&=127;return N(VI(T))}function L(M){return VI(I(yQ(g$(M,z,"scalar"))))}function k(M,T){let H=a(S(T),L(M));if(H===R8)throw Error("invalid private or public key received");return R(H)}function x(M){return k(M,j)}let h=x,B=k;function m(M,T,H){let b=N(M*(T-H));return T=N(T-b),H=N(H+b),{x_2:T,x_3:H}}function a(M,T){N8("u",M,R8,J),N8("scalar",T,V,v);let H=T,b=M,P=cJ,F=R8,y=M,n=cJ,$$=R8;for(let q$=BigInt(D-1);q$>=R8;q$--){let W$=H>>q$&cJ;$$^=W$,{x_2:P,x_3:y}=m($$,P,y),{x_2:F,x_3:n}=m($$,F,n),$$=W$;let N$=P+F,V$=N(N$*N$),v$=P-F,R$=N(v$*v$),b$=V$-R$,k$=y+n,OU=y-n,qU=N(OU*N$),LU=N(k$*v$),Y0=qU+LU,W0=qU-LU;y=N(Y0*Y0),n=N(b*N(W0*W0)),P=N(V$*R$),F=N(b$*(V$+N(w*b$)))}({x_2:P,x_3:y}=m($$,P,y)),{x_2:F,x_3:n}=m($$,F,n);let X$=Q(F);return N(P*X$)}let C={secretKey:z,publicKey:z,seed:z},A=(M=q(z))=>{return g$(M,C.seed,"seed"),M},E={randomSecretKey:A};return Object.freeze({keygen:hQ(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:C})}class iq{oHash;iHash;blockLen;outputLen;finished=!1;destroyed=!1;constructor($,U){if(pU($),g$(U,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(U.length>J?$.create().update(U).digest():U);for(let I=0;I<G.length;I++)G[I]^=54;this.iHash.update(G),this.oHash=$.create();for(let I=0;I<G.length;I++)G[I]^=106;this.oHash.update(G),SU(G)}update($){return l0(this),this.iHash.update($),this}digestInto($){l0(this),g$($,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:U,iHash:J,finished:G,destroyed:I,blockLen:Q,outputLen:X}=this;return $=$,$.finished=G,$.destroyed=I,$.blockLen=Q,$.outputLen=X,$.oHash=U._cloneInto($.oHash),$.iHash=J._cloneInto($.iHash),$}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var pJ=($,U,J)=>new iq($,U).update(J).digest();pJ.create=($,U)=>new iq($,U);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var dZ=($,U)=>($+($>=0?U:-U)/iZ)/U;function ZB($,U,J){let[[G,I],[Q,X]]=U,O=dZ(X*$,J),q=dZ(-I*$,J),D=$-O*G-q*Q,z=-O*I-q*X,W=D<d0,w=z<d0;if(W)D=-D;if(w)z=-z;let V=Z8(Math.ceil(Fq(J)/2))+oJ;if(D<d0||D>=V||z<d0||z>=V)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:W,k1:D,k2neg:w,k2:z}}function pq($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function cq($,U){let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(w8(J.lowS,"lowS"),w8(J.prehash,"prehash"),J.format!==void 0)pq(J.format);return J}class nZ extends Error{constructor($=""){super($)}}var NI={Err:nZ,_tlv:{encode:($,U)=>{let{Err:J}=NI;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(U.length&1)throw new J("tlv.encode: unpadded data");let G=U.length/2,I=V8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?V8(I.length/2|128):"";return V8($)+Q+I+U},decode($,U){let{Err:J}=NI,G=0;if($<0||$>256)throw new J("tlv.encode: wrong tag");if(U.length<2||U[G++]!==$)throw new J("tlv.decode: wrong tlv");let I=U[G++],Q=!!(I&128),X=0;if(!Q)X=I;else{let q=I&127;if(!q)throw new J("tlv.decode(long): indefinite length not supported");if(q>4)throw new J("tlv.decode(long): byte length is too big");let D=U.subarray(G,G+q);if(D.length!==q)throw new J("tlv.decode: length bytes not complete");if(D[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of D)X=X<<8|z;if(G+=q,X<128)throw new J("tlv.decode(long): not minimal encoding")}let O=U.subarray(G,G+X);if(O.length!==X)throw new J("tlv.decode: wrong value length");return{v:O,l:U.subarray(G+X)}}},_int:{encode($){let{Err:U}=NI;if($<d0)throw new U("integer: negative integers are not allowed");let J=V8($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new U("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:U}=NI;if($[0]&128)throw new U("invalid signature integer: negative");if($[0]===0&&!($[1]&128))throw new U("invalid signature integer: unnecessary leading zero");return wI($)}},toSig($){let{Err:U,_int:J,_tlv:G}=NI,I=g$($,void 0,"signature"),{v:Q,l:X}=G.decode(48,I);if(X.length)throw new U("invalid signature: left bytes after parsing");let{v:O,l:q}=G.decode(2,Q),{v:D,l:z}=G.decode(2,q);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(D)}},hexFromSig($){let{_tlv:U,_int:J}=NI,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}},d0=BigInt(0),oJ=BigInt(1),iZ=BigInt(2),dQ=BigInt(3),gB=BigInt(4);function oq($,U={}){let J=hZ("weierstrass",$,U),{Fp:G,Fn:I}=J,Q=J.CURVE,{h:X,n:O}=Q;oI(U,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:q}=U;if(q){if(!G.is0(Q.a)||typeof q.beta!=="bigint"||!Array.isArray(q.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let D=pZ(G,I);function z(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function W(A,E,M){let{x:T,y:H}=E.toAffine(),b=G.toBytes(T);if(w8(M,"isCompressed"),M){z();let P=!G.isOdd(H);return r$(cZ(P),b)}else return r$(Uint8Array.of(4),b,G.toBytes(H))}function w(A){g$(A,void 0,"Point");let{publicKey:E,publicKeyUncompressed:M}=D,T=A.length,H=A[0],b=A.subarray(1);if(T===E&&(H===2||H===3)){let P=G.fromBytes(b);if(!G.isValid(P))throw Error("bad point: is not on curve, wrong x");let F=v(P),y;try{y=G.sqrt(F)}catch(X$){let q$=X$ instanceof Error?": "+X$.message:"";throw Error("bad point: is not on curve, sqrt error"+q$)}z();let n=G.isOdd(y);if((H&1)===1!==n)y=G.neg(y);return{x:P,y}}else if(T===M&&H===4){let P=G.BYTES,F=G.fromBytes(b.subarray(0,P)),y=G.fromBytes(b.subarray(P,P*2));if(!N(F,y))throw Error("bad point: is not on curve");return{x:F,y}}else throw Error(`bad point: got length ${T}, expected compressed=${E} or uncompressed=${M}`)}let V=U.toBytes||W,Z=U.fromBytes||w;function v(A){let E=G.sqr(A),M=G.mul(E,A);return G.add(G.add(M,G.mul(A,Q.a)),Q.b)}function N(A,E){let M=G.sqr(E),T=v(A);return G.eql(M,T)}if(!N(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let j=G.mul(G.pow(Q.a,dQ),gB),R=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(j,R)))throw Error("bad curve params: a or b");function S(A,E,M=!1){if(!G.isValid(E)||M&&G.is0(E))throw Error(`bad point coordinate ${A}`);return E}function L(A){if(!(A instanceof m))throw Error("Weierstrass Point expected")}function k(A){if(!q||!q.basises)throw Error("no endo");return ZB(A,q.basises,I.ORDER)}let x=uq((A,E)=>{let{X:M,Y:T,Z:H}=A;if(G.eql(H,G.ONE))return{x:M,y:T};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(H);let P=G.mul(M,E),F=G.mul(T,E),y=G.mul(H,E);if(b)return{x:G.ZERO,y:G.ZERO};if(!G.eql(y,G.ONE))throw Error("invZ was invalid");return{x:P,y:F}}),h=uq((A)=>{if(A.is0()){if(U.allowInfinityPoint&&!G.is0(A.Y))return;throw Error("bad point: ZERO")}let{x:E,y:M}=A.toAffine();if(!G.isValid(E)||!G.isValid(M))throw Error("bad point: x or y not field elements");if(!N(E,M))throw Error("bad point: equation left != right");if(!A.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function B(A,E,M,T,H){return M=new m(G.mul(M.X,A),M.Y,M.Z),E=M8(T,E),M=M8(H,M),E.add(M)}class m{static BASE=new m(Q.Gx,Q.Gy,G.ONE);static ZERO=new m(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=I;X;Y;Z;constructor(A,E,M){this.X=S("x",A),this.Y=S("y",E,!0),this.Z=S("z",M),Object.freeze(this)}static CURVE(){return Q}static fromAffine(A){let{x:E,y:M}=A||{};if(!A||!G.isValid(E)||!G.isValid(M))throw Error("invalid affine point");if(A instanceof m)throw Error("projective point not allowed");if(G.is0(E)&&G.is0(M))return m.ZERO;return new m(E,M,G.ONE)}static fromBytes(A){let E=m.fromAffine(Z(g$(A,void 0,"point")));return E.assertValidity(),E}static fromHex(A){return m.fromBytes(pI(A))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(A=8,E=!0){if(C.createCache(this,A),!E)this.multiply(dQ);return this}assertValidity(){h(this)}hasEvenY(){let{y:A}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(A)}equals(A){L(A);let{X:E,Y:M,Z:T}=this,{X:H,Y:b,Z:P}=A,F=G.eql(G.mul(E,P),G.mul(H,T)),y=G.eql(G.mul(M,P),G.mul(b,T));return F&&y}negate(){return new m(this.X,G.neg(this.Y),this.Z)}double(){let{a:A,b:E}=Q,M=G.mul(E,dQ),{X:T,Y:H,Z:b}=this,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=G.mul(T,T),$$=G.mul(H,H),X$=G.mul(b,b),q$=G.mul(T,H);return q$=G.add(q$,q$),y=G.mul(T,b),y=G.add(y,y),P=G.mul(A,y),F=G.mul(M,X$),F=G.add(P,F),P=G.sub($$,F),F=G.add($$,F),F=G.mul(P,F),P=G.mul(q$,P),y=G.mul(M,y),X$=G.mul(A,X$),q$=G.sub(n,X$),q$=G.mul(A,q$),q$=G.add(q$,y),y=G.add(n,n),n=G.add(y,n),n=G.add(n,X$),n=G.mul(n,q$),F=G.add(F,n),X$=G.mul(H,b),X$=G.add(X$,X$),n=G.mul(X$,q$),P=G.sub(P,n),y=G.mul(X$,$$),y=G.add(y,y),y=G.add(y,y),new m(P,F,y)}add(A){L(A);let{X:E,Y:M,Z:T}=this,{X:H,Y:b,Z:P}=A,F=G.ZERO,y=G.ZERO,n=G.ZERO,$$=Q.a,X$=G.mul(Q.b,dQ),q$=G.mul(E,H),W$=G.mul(M,b),N$=G.mul(T,P),V$=G.add(E,M),v$=G.add(H,b);V$=G.mul(V$,v$),v$=G.add(q$,W$),V$=G.sub(V$,v$),v$=G.add(E,T);let R$=G.add(H,P);return v$=G.mul(v$,R$),R$=G.add(q$,N$),v$=G.sub(v$,R$),R$=G.add(M,T),F=G.add(b,P),R$=G.mul(R$,F),F=G.add(W$,N$),R$=G.sub(R$,F),n=G.mul($$,v$),F=G.mul(X$,N$),n=G.add(F,n),F=G.sub(W$,n),n=G.add(W$,n),y=G.mul(F,n),W$=G.add(q$,q$),W$=G.add(W$,q$),N$=G.mul($$,N$),v$=G.mul(X$,v$),W$=G.add(W$,N$),N$=G.sub(q$,N$),N$=G.mul($$,N$),v$=G.add(v$,N$),q$=G.mul(W$,v$),y=G.add(y,q$),q$=G.mul(R$,v$),F=G.mul(V$,F),F=G.sub(F,q$),q$=G.mul(V$,W$),n=G.mul(R$,n),n=G.add(n,q$),new m(F,y,n)}subtract(A){return this.add(A.negate())}is0(){return this.equals(m.ZERO)}multiply(A){let{endo:E}=U;if(!I.isValidNot0(A))throw Error("invalid scalar: out of range");let M,T,H=(b)=>C.cached(this,b,(P)=>dq(m,P));if(E){let{k1neg:b,k1:P,k2neg:F,k2:y}=k(A),{p:n,f:$$}=H(P),{p:X$,f:q$}=H(y);T=$$.add(q$),M=B(E.beta,n,X$,b,F)}else{let{p:b,f:P}=H(A);M=b,T=P}return dq(m,[M,T])[0]}multiplyUnsafe(A){let{endo:E}=U,M=this;if(!I.isValid(A))throw Error("invalid scalar: out of range");if(A===d0||M.is0())return m.ZERO;if(A===oJ)return M;if(C.hasCache(this))return this.multiply(A);if(E){let{k1neg:T,k1:H,k2neg:b,k2:P}=k(A),{p1:F,p2:y}=rZ(m,M,H,P);return B(E.beta,F,y,T,b)}else return C.unsafe(M,A)}toAffine(A){return x(this,A)}isTorsionFree(){let{isTorsionFree:A}=U;if(X===oJ)return!0;if(A)return A(m,this);return C.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:A}=U;if(X===oJ)return this;if(A)return A(m,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(A=!0){return w8(A,"isCompressed"),this.assertValidity(),V(m,this,A)}toHex(A=!0){return cI(this.toBytes(A))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let a=I.BITS,C=new nq(m,U.endo?Math.ceil(a/2):a);return m.BASE.precompute(8),m}function cZ($){return Uint8Array.of($?2:3)}function pZ($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function MB($,U={}){let{Fn:J}=$,G=U.randomBytes||YI,I=Object.assign(pZ($.Fp,J),{seed:yq(J.ORDER)});function Q(V){try{let Z=J.fromBytes(V);return J.isValidNot0(Z)}catch(Z){return!1}}function X(V,Z){let{publicKey:v,publicKeyUncompressed:N}=I;try{let j=V.length;if(Z===!0&&j!==v)return!1;if(Z===!1&&j!==N)return!1;return!!$.fromBytes(V)}catch(j){return!1}}function O(V=G(I.seed)){return kZ(g$(V,I.seed,"seed"),J.ORDER)}function q(V,Z=!0){return $.BASE.multiply(J.fromBytes(V)).toBytes(Z)}function D(V){let{secretKey:Z,publicKey:v,publicKeyUncompressed:N}=I;if(!lJ(V))return;if("_lengths"in J&&J._lengths||Z===v)return;let j=g$(V,void 0,"key").length;return j===v||j===N}function z(V,Z,v=!0){if(D(V)===!0)throw Error("first arg must be private key");if(D(Z)===!1)throw Error("second arg must be public key");let N=J.fromBytes(V);return $.fromBytes(Z).multiply(N).toBytes(v)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=hQ(O,q);return Object.freeze({getPublicKey:q,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function aq($,U,J={}){pU(U),oI(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let G=J.randomBytes||YI,I=J.hmac||((M,T)=>pJ(U,M,T)),{Fp:Q,Fn:X}=$,{ORDER:O,BITS:q}=X,{keygen:D,getPublicKey:z,getSharedSecret:W,utils:w,lengths:V}=MB($,J),Z={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},v=O*iZ<Q.ORDER;function N(M){let T=O>>oJ;return M>T}function j(M,T){if(!X.isValidNot0(T))throw Error(`invalid signature ${M}: out of range 1..Point.Fn.ORDER`);return T}function R(){if(v)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function S(M,T){pq(T);let H=V.signature,b=T==="compact"?H:T==="recovered"?H+1:void 0;return g$(M,b)}class L{r;s;recovery;constructor(M,T,H){if(this.r=j("r",M),this.s=j("s",T),H!=null){if(R(),![0,1,2,3].includes(H))throw Error("invalid recovery id");this.recovery=H}Object.freeze(this)}static fromBytes(M,T=Z.format){S(M,T);let H;if(T==="der"){let{r:y,s:n}=NI.toSig(g$(M));return new L(y,n)}if(T==="recovered")H=M[0],T="compact",M=M.subarray(1);let b=V.signature/2,P=M.subarray(0,b),F=M.subarray(b,b*2);return new L(X.fromBytes(P),X.fromBytes(F),H)}static fromHex(M,T){return this.fromBytes(pI(M),T)}assertRecovery(){let{recovery:M}=this;if(M==null)throw Error("invalid recovery id: must be present");return M}addRecoveryBit(M){return new L(this.r,this.s,M)}recoverPublicKey(M){let{r:T,s:H}=this,b=this.assertRecovery(),P=b===2||b===3?T+O:T;if(!Q.isValid(P))throw Error("invalid recovery id: sig.r+curve.n != R.x");let F=Q.toBytes(P),y=$.fromBytes(r$(cZ((b&1)===0),F)),n=X.inv(P),$$=x(g$(M,void 0,"msgHash")),X$=X.create(-$$*n),q$=X.create(H*n),W$=$.BASE.multiplyUnsafe(X$).add(y.multiplyUnsafe(q$));if(W$.is0())throw Error("invalid recovery: point at infinify");return W$.assertValidity(),W$}hasHighS(){return N(this.s)}toBytes(M=Z.format){if(pq(M),M==="der")return pI(NI.hexFromSig(this));let{r:T,s:H}=this,b=X.toBytes(T),P=X.toBytes(H);if(M==="recovered")return R(),r$(Uint8Array.of(this.assertRecovery()),b,P);return r$(b,P)}toHex(M){return cI(this.toBytes(M))}}let k=J.bits2int||function(T){if(T.length>8192)throw Error("input is too large");let H=wI(T),b=T.length*8-q;return b>0?H>>BigInt(b):H},x=J.bits2int_modN||function(T){return X.create(k(T))},h=Z8(q);function B(M){return N8("num < 2^"+q,M,d0,h),X.toBytes(M)}function m(M,T){return g$(M,void 0,"message"),T?g$(U(M),void 0,"prehashed message"):M}function a(M,T,H){let{lowS:b,prehash:P,extraEntropy:F}=cq(H,Z);M=m(M,P);let y=x(M),n=X.fromBytes(T);if(!X.isValidNot0(n))throw Error("invalid private key");let $$=[B(n),B(y)];if(F!=null&&F!==!1){let N$=F===!0?G(V.secretKey):F;$$.push(g$(N$,void 0,"extraEntropy"))}let X$=r$(...$$),q$=y;function W$(N$){let V$=k(N$);if(!X.isValidNot0(V$))return;let v$=X.inv(V$),R$=$.BASE.multiply(V$).toAffine(),b$=X.create(R$.x);if(b$===d0)return;let k$=X.create(v$*X.create(q$+b$*n));if(k$===d0)return;let OU=(R$.x===b$?0:2)|Number(R$.y&oJ),qU=k$;if(b&&N(k$))qU=X.neg(k$),OU^=1;return new L(b$,qU,v?void 0:OU)}return{seed:X$,k2sig:W$}}function C(M,T,H={}){let{seed:b,k2sig:P}=a(M,T,H);return TZ(U.outputLen,X.BYTES,I)(b,P).toBytes(H.format)}function A(M,T,H,b={}){let{lowS:P,prehash:F,format:y}=cq(b,Z);if(H=g$(H,void 0,"publicKey"),T=m(T,F),!lJ(M)){let n=M instanceof L?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+n)}S(M,y);try{let n=L.fromBytes(M,y),$$=$.fromBytes(H);if(P&&n.hasHighS())return!1;let{r:X$,s:q$}=n,W$=x(T),N$=X.inv(q$),V$=X.create(W$*N$),v$=X.create(X$*N$),R$=$.BASE.multiplyUnsafe(V$).add($$.multiplyUnsafe(v$));if(R$.is0())return!1;return X.create(R$.x)===X$}catch(n){return!1}}function E(M,T,H={}){let{prehash:b}=cq(H,Z);return T=m(T,b),L.fromBytes(M,"recovered").recoverPublicKey(T).toBytes()}return Object.freeze({keygen:D,getPublicKey:z,getSharedSecret:W,utils:w,lengths:V,Point:$,sign:C,verify:A,recoverPublicKey:E,Signature:L,hash:U})}function oZ($,U,J){return $&U^~$&J}function aZ($,U,J){return $&U^$&J^U&J}class nQ{blockLen;outputLen;padOffset;isLE;buffer;view;finished=!1;length=0;pos=0;destroyed=!1;constructor($,U,J,G){this.blockLen=$,this.outputLen=U,this.padOffset=J,this.isLE=G,this.buffer=new Uint8Array($),this.view=xQ(this.buffer)}update($){l0(this),g$($);let{view:U,buffer:J,blockLen:G}=this,I=$.length;for(let Q=0;Q<I;){let X=Math.min(G-this.pos,I-Q);if(X===G){let O=xQ($);for(;G<=I-Q;Q+=G)this.process(O,Q);continue}if(J.set($.subarray(Q,Q+X),this.pos),this.pos+=X,Q+=X,this.pos===G)this.process(U,0),this.pos=0}return this.length+=$.length,this.roundClean(),this}digestInto($){l0(this),FQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,SU(this.buffer.subarray(Q)),this.padOffset>G-Q)this.process(J,0),Q=0;for(let z=Q;z<G;z++)U[z]=0;J.setBigUint64(G-8,BigInt(this.length*8),I),this.process(J,0);let X=xQ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let q=O/4,D=this.get();if(q>D.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<q;z++)X.setUint32(4*z,D[z],I)}digest(){let{buffer:$,outputLen:U}=this;this.digestInto($);let J=$.slice(0,U);return this.destroy(),J}_cloneInto($){$||=new this.constructor,$.set(...this.get());let{blockLen:U,buffer:J,length:G,finished:I,destroyed:Q,pos:X}=this;if($.destroyed=Q,$.finished=I,$.length=G,$.pos=X,G%U)$.buffer.set(J);return $}clone(){return this._cloneInto()}}var n0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),i0=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),UU=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),IU=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var iQ=BigInt(4294967295),tZ=BigInt(32);function RB($,U=!1){if(U)return{h:Number($&iQ),l:Number($>>tZ&iQ)};return{h:Number($>>tZ&iQ)|0,l:Number($&iQ)|0}}function cQ($,U=!1){let J=$.length,G=new Uint32Array(J),I=new Uint32Array(J);for(let Q=0;Q<J;Q++){let{h:X,l:O}=RB($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var tq=($,U,J)=>$>>>J,sq=($,U,J)=>$<<32-J|U>>>J,sI=($,U,J)=>$>>>J|U<<32-J,eI=($,U,J)=>$<<32-J|U>>>J,j8=($,U,J)=>$<<64-J|U>>>J-32,H8=($,U,J)=>$>>>J-32|U<<64-J;var sZ=($,U,J)=>$<<J|U>>>32-J,eZ=($,U,J)=>U<<J|$>>>32-J,$5=($,U,J)=>U<<J-32|$>>>64-J,U5=($,U,J)=>$<<J-32|U>>>64-J;function N0($,U,J,G){let I=(U>>>0)+(G>>>0);return{h:$+J+(I/4294967296|0)|0,l:I|0}}var I5=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),J5=($,U,J,G)=>U+J+G+($/4294967296|0)|0,G5=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),Q5=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,X5=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),O5=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var HB=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]),ZI=new Uint32Array(64);class eq extends nQ{constructor($){super(64,$,8,!1)}get(){let{A:$,B:U,C:J,D:G,E:I,F:Q,G:X,H:O}=this;return[$,U,J,G,I,Q,X,O]}set($,U,J,G,I,Q,X,O){this.A=$|0,this.B=U|0,this.C=J|0,this.D=G|0,this.E=I|0,this.F=Q|0,this.G=X|0,this.H=O|0}process($,U){for(let z=0;z<16;z++,U+=4)ZI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=ZI[z-15],w=ZI[z-2],V=J0(W,7)^J0(W,18)^W>>>3,Z=J0(w,17)^J0(w,19)^w>>>10;ZI[z]=Z+ZI[z-7]+V+ZI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:q,H:D}=this;for(let z=0;z<64;z++){let W=J0(X,6)^J0(X,11)^J0(X,25),w=D+W+oZ(X,O,q)+HB[z]+ZI[z]|0,Z=(J0(J,2)^J0(J,13)^J0(J,22))+aZ(J,G,I)|0;D=q,q=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+Z|0}J=J+this.A|0,G=G+this.B|0,I=I+this.C|0,Q=Q+this.D|0,X=X+this.E|0,O=O+this.F|0,q=q+this.G|0,D=D+this.H|0,this.set(J,G,I,Q,X,O,q,D)}roundClean(){SU(ZI)}destroy(){this.set(0,0,0,0,0,0,0,0),SU(this.buffer)}}class q5 extends eq{A=n0[0]|0;B=n0[1]|0;C=n0[2]|0;D=n0[3]|0;E=n0[4]|0;F=n0[5]|0;G=n0[6]|0;H=n0[7]|0;constructor(){super(32)}}class TB extends eq{A=i0[0]|0;B=i0[1]|0;C=i0[2]|0;D=i0[3]|0;E=i0[4]|0;F=i0[5]|0;G=i0[6]|0;H=i0[7]|0;constructor(){super(28)}}var D5=(()=>cQ(["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($))))(),KB=(()=>D5[0])(),AB=(()=>D5[1])(),gI=new Uint32Array(80),MI=new Uint32Array(80);class T8 extends nQ{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:q,El:D,Fh:z,Fl:W,Gh:w,Gl:V,Hh:Z,Hl:v}=this;return[$,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v]}set($,U,J,G,I,Q,X,O,q,D,z,W,w,V,Z,v){this.Ah=$|0,this.Al=U|0,this.Bh=J|0,this.Bl=G|0,this.Ch=I|0,this.Cl=Q|0,this.Dh=X|0,this.Dl=O|0,this.Eh=q|0,this.El=D|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=V|0,this.Hh=Z|0,this.Hl=v|0}process($,U){for(let R=0;R<16;R++,U+=4)gI[R]=$.getUint32(U),MI[R]=$.getUint32(U+=4);for(let R=16;R<80;R++){let S=gI[R-15]|0,L=MI[R-15]|0,k=sI(S,L,1)^sI(S,L,8)^tq(S,L,7),x=eI(S,L,1)^eI(S,L,8)^sq(S,L,7),h=gI[R-2]|0,B=MI[R-2]|0,m=sI(h,B,19)^j8(h,B,61)^tq(h,B,6),a=eI(h,B,19)^H8(h,B,61)^sq(h,B,6),C=G5(x,a,MI[R-7],MI[R-16]),A=Q5(C,k,m,gI[R-7],gI[R-16]);gI[R]=A|0,MI[R]=C|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:q,Dl:D,Eh:z,El:W,Fh:w,Fl:V,Gh:Z,Gl:v,Hh:N,Hl:j}=this;for(let R=0;R<80;R++){let S=sI(z,W,14)^sI(z,W,18)^j8(z,W,41),L=eI(z,W,14)^eI(z,W,18)^H8(z,W,41),k=z&w^~z&Z,x=W&V^~W&v,h=X5(j,L,x,AB[R],MI[R]),B=O5(h,N,S,k,KB[R],gI[R]),m=h|0,a=sI(J,G,28)^j8(J,G,34)^j8(J,G,39),C=eI(J,G,28)^H8(J,G,34)^H8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=Z|0,j=v|0,Z=w|0,v=V|0,w=z|0,V=W|0,{h:z,l:W}=N0(q|0,D|0,B|0,m|0),q=X|0,D=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let M=I5(m,C,E);J=J5(M,B,a,A),G=M|0}({h:J,l:G}=N0(this.Ah|0,this.Al|0,J|0,G|0)),{h:I,l:Q}=N0(this.Bh|0,this.Bl|0,I|0,Q|0),{h:X,l:O}=N0(this.Ch|0,this.Cl|0,X|0,O|0),{h:q,l:D}=N0(this.Dh|0,this.Dl|0,q|0,D|0),{h:z,l:W}=N0(this.Eh|0,this.El|0,z|0,W|0),{h:w,l:V}=N0(this.Fh|0,this.Fl|0,w|0,V|0),{h:Z,l:v}=N0(this.Gh|0,this.Gl|0,Z|0,v|0),{h:N,l:j}=N0(this.Hh|0,this.Hl|0,N|0,j|0),this.set(J,G,I,Q,X,O,q,D,z,W,w,V,Z,v,N,j)}roundClean(){SU(gI,MI)}destroy(){SU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class PB extends T8{Ah=IU[0]|0;Al=IU[1]|0;Bh=IU[2]|0;Bl=IU[3]|0;Ch=IU[4]|0;Cl=IU[5]|0;Dh=IU[6]|0;Dl=IU[7]|0;Eh=IU[8]|0;El=IU[9]|0;Fh=IU[10]|0;Fl=IU[11]|0;Gh=IU[12]|0;Gl=IU[13]|0;Hh=IU[14]|0;Hl=IU[15]|0;constructor(){super(64)}}class z5 extends T8{Ah=UU[0]|0;Al=UU[1]|0;Bh=UU[2]|0;Bl=UU[3]|0;Ch=UU[4]|0;Cl=UU[5]|0;Dh=UU[6]|0;Dl=UU[7]|0;Eh=UU[8]|0;El=UU[9]|0;Fh=UU[10]|0;Fl=UU[11]|0;Gh=UU[12]|0;Gl=UU[13]|0;Hh=UU[14]|0;Hl=UU[15]|0;constructor(){super(48)}}var wU=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),VU=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class BB extends T8{Ah=wU[0]|0;Al=wU[1]|0;Bh=wU[2]|0;Bl=wU[3]|0;Ch=wU[4]|0;Cl=wU[5]|0;Dh=wU[6]|0;Dl=wU[7]|0;Eh=wU[8]|0;El=wU[9]|0;Fh=wU[10]|0;Fl=wU[11]|0;Gh=wU[12]|0;Gl=wU[13]|0;Hh=wU[14]|0;Hl=wU[15]|0;constructor(){super(28)}}class LB extends T8{Ah=VU[0]|0;Al=VU[1]|0;Bh=VU[2]|0;Bl=VU[3]|0;Ch=VU[4]|0;Cl=VU[5]|0;Dh=VU[6]|0;Dl=VU[7]|0;Eh=VU[8]|0;El=VU[9]|0;Fh=VU[10]|0;Fl=VU[11]|0;Gh=VU[12]|0;Gl=VU[13]|0;Hh=VU[14]|0;Hl=VU[15]|0;constructor(){super(32)}}var pQ=dJ(()=>new q5,WI(1));var Y5=dJ(()=>new z5,WI(2));/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var SB=BigInt(1),W5=BigInt(2),_B=BigInt(3),CB=BigInt(5),vd=BigInt(8),w5=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed");function EB($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=w5,O=$*$%Q*$%Q,q=oU(O,W5,Q)*O%Q,D=oU(q,SB,Q)*$%Q,z=oU(D,CB,Q)*D%Q,W=oU(z,U,Q)*z%Q,w=oU(W,J,Q)*W%Q,V=oU(w,G,Q)*w%Q,Z=oU(V,I,Q)*V%Q,v=oU(Z,I,Q)*V%Q,N=oU(v,U,Q)*z%Q;return{pow_p_5_8:oU(N,W5,Q)*$%Q,b2:O}}function bB($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var V5=(()=>{let $=w5;return lZ({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=EB(U);return MU(oU(J,_B,$)*G,$)},adjustScalarBytes:bB})})();/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var fB=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))(),kB=(()=>({p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff"),n:BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973"),h:BigInt(1),a:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc"),b:BigInt("0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef"),Gx:BigInt("0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7"),Gy:BigInt("0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f")}))();var FB=oq(fB),$D=aq(FB,pQ);var uB=oq(kB),v5=aq(uB,Y5);function Z5($,U,J){if(pU($),J===void 0)J=new Uint8Array($.outputLen);return pJ($,J,U)}var UD=Uint8Array.of(0),N5=Uint8Array.of();function g5($,U,J,G=32){pU($),p$(G,"length");let I=$.outputLen;if(G>255*I)throw Error("Length must be <= 255*HashLen");let Q=Math.ceil(G/I);if(J===void 0)J=N5;else g$(J,void 0,"info");let X=new Uint8Array(Q*I),O=pJ.create($,U),q=O._cloneInto(),D=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)UD[0]=z+1,q.update(z===0?N5:D).update(J).update(UD).digestInto(D),X.set(D,I*z),O._cloneInto(q);return O.destroy(),q.destroy(),SU(D,UD),X.slice(0,G)}var xB=BigInt(0),K8=BigInt(1),mB=BigInt(2),yB=BigInt(7),rB=BigInt(256),hB=BigInt(113),j5=[],H5=[],T5=[];for(let $=0,U=K8,J=1,G=0;$<24;$++){[J,G]=[G,(2*J+3*G)%5],j5.push(2*(5*G+J)),H5.push(($+1)*($+2)/2%64);let I=xB;for(let Q=0;Q<7;Q++)if(U=(U<<K8^(U>>yB)*hB)%rB,U&mB)I^=K8<<(K8<<BigInt(Q))-K8;T5.push(I)}var K5=cQ(T5,!0),lB=K5[0],dB=K5[1],M5=($,U,J)=>J>32?$5($,U,J):sZ($,U,J),R5=($,U,J)=>J>32?U5($,U,J):eZ($,U,J);function nB($,U=24){let J=new Uint32Array(10);for(let G=24-U;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 O=(X+8)%10,q=(X+2)%10,D=J[q],z=J[q+1],W=M5(D,z,1)^J[O],w=R5(D,z,1)^J[O+1];for(let V=0;V<50;V+=10)$[X+V]^=W,$[X+V+1]^=w}let I=$[2],Q=$[3];for(let X=0;X<24;X++){let O=H5[X],q=M5(I,Q,O),D=R5(I,Q,O),z=j5[X];I=$[z],Q=$[z+1],$[z]=q,$[z+1]=D}for(let X=0;X<50;X+=10){for(let O=0;O<10;O++)J[O]=$[X+O];for(let O=0;O<10;O++)$[X+O]^=~J[(O+2)%10]&J[(O+4)%10]}$[0]^=lB[G],$[1]^=dB[G]}SU(J)}class oQ{state;pos=0;posOut=0;finished=!1;state32;destroyed=!1;blockLen;suffix;outputLen;enableXOF=!1;rounds;constructor($,U,J,G=!1,I=24){if(this.blockLen=$,this.suffix=U,this.outputLen=J,this.enableXOF=G,this.rounds=I,p$(J,"outputLen"),!(0<$&&$<200))throw Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=uQ(this.state)}clone(){return this._cloneInto()}keccak(){bq(this.state32),nB(this.state32,this.rounds),bq(this.state32),this.posOut=0,this.pos=0}update($){l0(this),g$($);let{blockLen:U,state:J}=this,G=$.length;for(let I=0;I<G;){let Q=Math.min(U-this.pos,G-I);for(let X=0;X<Q;X++)J[this.pos++]^=$[I++];if(this.pos===U)this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;let{state:$,suffix:U,pos:J,blockLen:G}=this;if($[J]^=U,(U&128)!==0&&J===G-1)this.keccak();$[G-1]^=128,this.keccak()}writeInto($){l0(this,!1),g$($),this.finish();let U=this.state,{blockLen:J}=this;for(let G=0,I=$.length;G<I;){if(this.posOut>=J)this.keccak();let Q=Math.min(J-this.posOut,I-G);$.set(U.subarray(this.posOut,this.posOut+Q),G),this.posOut+=Q,G+=Q}return $}xofInto($){if(!this.enableXOF)throw Error("XOF is not possible for this instance");return this.writeInto($)}xof($){return p$($),this.xofInto(new Uint8Array($))}digestInto($){if(FQ($,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,SU(this.state)}_cloneInto($){let{blockLen:U,suffix:J,outputLen:G,rounds:I,enableXOF:Q}=this;return $||=new oQ(U,J,G,Q,I),$.state32.set(this.state32),$.pos=this.pos,$.posOut=this.posOut,$.finished=this.finished,$.rounds=I,$.suffix=J,$.outputLen=G,$.enableXOF=Q,$.destroyed=this.destroyed,$}}var A5=($,U,J,G={})=>dJ(()=>new oQ(U,$,J),G);var $J=A5(6,136,32,WI(8));var P5=A5(6,72,64,WI(10));var B5=($,U,J,G={})=>dJ((I={})=>new oQ(U,$,I.dkLen===void 0?J:I.dkLen,!0),G),L5=B5(31,168,16,WI(11)),Z0=B5(31,136,32,WI(12));function ID($){if(!Number.isSafeInteger($)||$<0||$>4294967295)throw Error("wrong u32 integer:"+$);return $}function _5($){return ID($),($&$-1)===0&&$!==0}function JD($,U){ID($);let J=0;for(let G=0;G<U;G++,$>>>=1)J=J<<1|$&1;return J}function C5($){return ID($),31-Math.clz32($)}function S5($){let U=$.length;if(U<2||!_5(U))throw Error("n must be a power of 2 and greater than 1. Got "+U);let J=C5(U);for(let G=0;G<U;G++){let I=JD(G,J);if(G<I){let Q=$[G];$[G]=$[I],$[I]=Q}}return $}var GD=($,U)=>{let{N:J,roots:G,dit:I,invertButterflies:Q=!1,skipStages:X=0,brp:O=!0}=U,q=C5(J);if(!_5(J))throw Error("FFT: Polynomial size should be power of two");let D=I!==Q;return(z)=>{if(z.length!==J)throw Error("FFT: wrong Polynomial length");if(I&&O)S5(z);for(let W=0,w=1;W<q-X;W++){let V=I?W+1+X:q-W,Z=1<<V,v=Z>>1,N=J>>V;for(let j=0;j<J;j+=Z)for(let R=0,S=w++;R<v;R++){let L=Q?I?J-S:S:R*N,k=j+R,x=j+R+v,h=G[L],B=z[x],m=z[k];if(D){let a=$.mul(B,h);z[k]=$.add(m,a),z[x]=$.sub(m,a)}else if(Q)z[k]=$.add(B,m),z[x]=$.mul($.sub(B,m),h);else z[k]=$.add(m,B),z[x]=$.mul($.sub(m,B),h)}}if(!I&&O)S5(z);return z}};/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var g0=YI;function aQ($,U){if($.length!==U.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^U[G];return J===0}function E5($){return Uint8Array.from($)}function UJ($,...U){let J=(I)=>typeof I==="number"?I:I.bytesLen,G=U.reduce((I,Q)=>I+J(Q),0);return{bytesLen:G,encode:(I)=>{let Q=new Uint8Array(G);for(let X=0,O=0;X<U.length;X++){let q=U[X],D=J(q),z=typeof q==="number"?I[X]:q.encode(I[X]);if(g$(z,D,$),Q.set(z,O),typeof q!=="number")z.fill(0);O+=D}return Q},decode:(I)=>{g$(I,G,$);let Q=[];for(let X of U){let O=J(X),q=I.subarray(0,O);Q.push(typeof X==="number"?q:X.decode(q)),I=I.subarray(O)}return Q}}}function tQ($,U){let J=U*$.bytesLen;return{bytesLen:J,encode:(G)=>{if(G.length!==U)throw Error(`vecCoder.encode: wrong length=${G.length}. Expected: ${U}`);let I=new Uint8Array(J);for(let Q=0,X=0;Q<G.length;Q++){let O=$.encode(G[Q]);I.set(O,X),O.fill(0),X+=O.length}return I},decode:(G)=>{g$(G,J);let I=[];for(let Q=0;Q<G.length;Q+=$.bytesLen)I.push($.decode(G.subarray(Q,Q+$.bytesLen)));return I}}}function n$(...$){for(let U of $)if(Array.isArray(U))for(let J of U)J.fill(0);else U.fill(0)}function QD($){return(1<<$)-1}var _d=Uint8Array.of();/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var b5=($)=>{let{newPoly:U,N:J,Q:G,F:I,ROOT_OF_UNITY:Q,brvBits:X,isKyber:O}=$,q=(R,S=G)=>{let L=R%S|0;return(L>=0?L|0:S+L|0)|0},D=(R,S=G)=>{let L=q(R,S)|0;return(L>S>>1?L-S|0:L)|0};function z(){let R=U(J);for(let S=0;S<J;S++){let L=JD(S,X),k=BigInt(Q)**BigInt(L)%BigInt(G);R[S]=Number(k)|0}return R}let W=z(),w={add:(R,S)=>q((R|0)+(S|0))|0,sub:(R,S)=>q((R|0)-(S|0))|0,mul:(R,S)=>q((R|0)*(S|0))|0,inv:(R)=>{throw Error("not implemented")}},V={N:J,roots:W,invertButterflies:!0,skipStages:O?1:0,brp:!1},Z=GD(w,{dit:!1,...V}),v=GD(w,{dit:!0,...V});return{mod:q,smod:D,nttZetas:W,NTT:{encode:(R)=>{return Z(R)},decode:(R)=>{v(R);for(let S=0;S<R.length;S++)R[S]=q(I*R[S]);return R}},bitsCoder:(R,S)=>{let L=QD(R),k=R*(J/8);return{bytesLen:k,encode:(x)=>{let h=new Uint8Array(k);for(let B=0,m=0,a=0,C=0;B<x.length;B++){m|=(S.encode(x[B])&L)<<a,a+=R;for(;a>=8;a-=8,m>>=8)h[C++]=m&QD(a)}return h},decode:(x)=>{let h=U(J);for(let B=0,m=0,a=0,C=0;B<x.length;B++){m|=x[B]<<a,a+=8;for(;a>=R;a-=R,m>>=R)h[C++]=S.decode(m&L)}return h}}}}},iB=($)=>(U,J)=>{if(!J)J=$.blockLen;let G=new Uint8Array(U.length+2);G.set(U);let I=U.length,Q=new Uint8Array(J),X=$.create({}),O=0,q=0;return{stats:()=>({calls:O,xofs:q}),get:(D,z)=>{return G[I+0]=D,G[I+1]=z,X.destroy(),X=$.create({}).update(G),O++,()=>{return q++,X.xofInto(Q)}},clean:()=>{X.destroy(),n$(Q,G)}}},f5=iB(L5);/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var vU=256,c0=3329,cB=3303,pB=17,{mod:B8,nttZetas:oB,NTT:IJ,bitsCoder:aB}=b5({N:vU,Q:c0,F:cB,ROOT_OF_UNITY:pB,newPoly:($)=>new Uint16Array($),brvBits:7,isKyber:!0}),XD={512:{N:vU,Q:c0,K:2,ETA1:3,ETA2:2,du:10,dv:4,RBGstrength:128},768:{N:vU,Q:c0,K:3,ETA1:2,ETA2:2,du:10,dv:4,RBGstrength:192},1024:{N:vU,Q:c0,K:4,ETA1:2,ETA2:2,du:11,dv:5,RBGstrength:256}},tB=($)=>{if($>=12)return{encode:(J)=>J,decode:(J)=>J};let U=2**($-1);return{encode:(J)=>((J<<$)+c0/2)/c0,decode:(J)=>J*c0+U>>>$}},A8=($)=>aB($,tB($));function JJ($,U){for(let J=0;J<vU;J++)$[J]=B8($[J]+U[J])}function sB($,U){for(let J=0;J<vU;J++)$[J]=B8($[J]-U[J])}function eB($,U,J,G,I){let Q=B8(U*G*I+$*J),X=B8($*G+U*J);return{c0:Q,c1:X}}function sQ($,U){for(let J=0;J<vU/2;J++){let G=oB[64+(J>>1)];if(J&1)G=-G;let{c0:I,c1:Q}=eB($[2*J+0],$[2*J+1],U[2*J+0],U[2*J+1],G);$[2*J+0]=I,$[2*J+1]=Q}return $}function k5($){let U=new Uint16Array(vU);for(let J=0;J<vU;){let G=$();if(G.length%3)throw Error("SampleNTT: unaligned block");for(let I=0;J<vU&&I+3<=G.length;I+=3){let Q=(G[I+0]>>0|G[I+1]<<8)&4095,X=(G[I+1]>>4|G[I+2]<<4)&4095;if(Q<c0)U[J++]=Q;if(J<vU&&X<c0)U[J++]=X}}return U}function P8($,U,J,G){let I=$(G*vU/4,U,J),Q=new Uint16Array(vU),X=uQ(I),O=0;for(let q=0,D=0,z=0,W=0;q<X.length;q++){let w=X[q];for(let V=0;V<32;V++)if(z+=w&1,w>>=1,O+=1,O===G)W=z,z=0;else if(O===2*G)Q[D++]=B8(W-z),z=0,O=0}if(O)throw Error(`sampleCBD: leftover bits: ${O}`);return Q}var $L=($)=>{let{K:U,PRF:J,XOF:G,HASH512:I,ETA1:Q,ETA2:X,du:O,dv:q}=$,D=A8(1),z=A8(q),W=A8(O),w=UJ("publicKey",tQ(A8(12),U),32),V=tQ(A8(12),U),Z=UJ("ciphertext",tQ(W,U),z),v=UJ("seed",32,32);return{secretCoder:V,lengths:{secretKey:V.bytesLen,publicKey:w.bytesLen,cipherText:Z.bytesLen},keygen:(N)=>{g$(N,32,"seed");let j=new Uint8Array(33);j.set(N),j[32]=U;let R=I(j),[S,L]=v.decode(R),k=[],x=[];for(let m=0;m<U;m++)k.push(IJ.encode(P8(J,L,m,Q)));let h=G(S);for(let m=0;m<U;m++){let a=IJ.encode(P8(J,L,U+m,Q));for(let C=0;C<U;C++){let A=k5(h.get(C,m));JJ(a,sQ(A,k[C]))}x.push(a)}h.clean();let B={publicKey:w.encode([x,S]),secretKey:V.encode(k)};return n$(S,L,k,x,j,R),B},encrypt:(N,j,R)=>{let[S,L]=w.decode(N),k=[];for(let C=0;C<U;C++)k.push(IJ.encode(P8(J,R,C,Q)));let x=G(L),h=new Uint16Array(vU),B=[];for(let C=0;C<U;C++){let A=P8(J,R,U+C,X),E=new Uint16Array(vU);for(let M=0;M<U;M++){let T=k5(x.get(C,M));JJ(E,sQ(T,k[M]))}JJ(A,IJ.decode(E)),B.push(A),JJ(h,sQ(S[C],k[C])),n$(E)}x.clean();let m=P8(J,R,2*U,X);JJ(m,IJ.decode(h));let a=D.decode(j);return JJ(a,m),n$(S,k,h,m),Z.encode([B,a])},decrypt:(N,j)=>{let[R,S]=Z.decode(N),L=V.decode(j),k=new Uint16Array(vU);for(let x=0;x<U;x++)JJ(k,sQ(L[x],IJ.encode(R[x])));return sB(S,IJ.decode(k)),n$(k,L,R),D.encode(S)}}};function OD($){let U=$L($),{HASH256:J,HASH512:G,KDF:I}=$,{secretCoder:Q,lengths:X}=U,O=UJ("secretKey",X.secretKey,X.publicKey,32,32),q=32,D=64;return{info:{type:"ml-kem"},lengths:{...X,seed:64,msg:32,msgRand:32,secretKey:O.bytesLen},keygen:(z=g0(64))=>{g$(z,64,"seed");let{publicKey:W,secretKey:w}=U.keygen(z.subarray(0,32)),V=J(W),Z=O.encode([w,W,V,z.subarray(32)]);return n$(w,V),{publicKey:W,secretKey:Z}},getPublicKey:(z)=>{let[W,w,V,Z]=O.decode(z);return Uint8Array.from(w)},encapsulate:(z,W=g0(32))=>{g$(z,X.publicKey,"publicKey"),g$(W,32,"message");let w=z.subarray(0,384*$.K),V=Q.encode(Q.decode(E5(w)));if(!aQ(V,w))throw n$(V),Error("ML-KEM.encapsulate: wrong publicKey modulus");n$(V);let Z=G.create().update(W).update(J(z)).digest(),v=U.encrypt(z,W,Z.subarray(32,64));return n$(Z.subarray(32)),{cipherText:v,sharedSecret:Z.subarray(0,32)}},decapsulate:(z,W)=>{g$(W,O.bytesLen,"secretKey"),g$(z,X.cipherText,"cipherText");let w=O.bytesLen-96,V=w+32,Z=J(W.subarray(w/2,V));if(!aQ(Z,W.subarray(V,V+32)))throw Error("invalid secretKey: hash check failed");let[v,N,j,R]=O.decode(W),S=U.decrypt(z,v),L=G.create().update(S).update(j).digest(),k=L.subarray(0,32),x=U.encrypt(N,S,L.subarray(32,64)),h=aQ(z,x),B=I.create({dkLen:32}).update(R).update(z).digest();return n$(S,x,!h?k:B),h?k:B}}}function UL($,U,J){return Z0.create({dkLen:$}).update(U).update(new Uint8Array([J])).digest()}var qD={HASH256:$J,HASH512:P5,KDF:Z0,XOF:f5,PRF:UL},rd=OD({...qD,...XD[512]}),L8=OD({...qD,...XD[768]}),F5=OD({...qD,...XD[1024]});/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */function IL($,U=!1){let{lengths:J,keygen:G}=$;if(U){let Q=$.Point.Fn;if(!Q)throw Error("No Point.Fn");G=(X=g0(J.seed))=>{g$(X,J.seed,"seed");let O=Q.isLE?VI(X):wI(X),q=Q.toBytes(Q.create(O));return{secretKey:q,publicKey:$.getPublicKey(q)}}}return{lengths:{secretKey:J.secretKey,publicKey:J.publicKey,seed:J.seed},keygen:G,getPublicKey:(I)=>$.getPublicKey(I)}}function DD($,U=!1){let J=IL($,U);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,I=g0($.lengths.seed)){let Q=this.keygen(I).secretKey,X=this.decapsulate(G,Q),O=$.getPublicKey(Q);return n$(Q),{sharedSecret:X,cipherText:O}},decapsulate(G,I){let Q=$.getSharedSecret(I,G);return $.lengths.publicKeyHasPrefix?Q.subarray(1):Q}}}function S8($,U){return UJ(U,...$.map((J)=>{if(typeof J.lengths[U]!=="number")throw Error("wrong length: "+U);return J.lengths[U]}))}function zD($){return(U,J)=>$(U,{dkLen:J})}function JL($,U,...J){let G=S8(J,"seed"),I=S8(J,"publicKey");if($===void 0)$=G.bytesLen;p$($);function Q(X){g$(X,$);let O=G.decode(U(X,G.bytesLen)),q=J.map((W,w)=>W.keygen(O[w])),D=q.map((W)=>W.secretKey),z=q.map((W)=>W.publicKey);return{secretKey:D,publicKey:z}}return{info:{lengths:{seed:$,publicKey:I.bytesLen,secretKey:$}},getPublicKey(X){return this.keygen(X).publicKey},keygen(X=g0($)){let{publicKey:O,secretKey:q}=Q(X),D=I.encode(O);return n$(O),n$(q),{secretKey:X,publicKey:D}},expandDecapsulationKey:Q,realSeedLen:$}}function eQ($,U,J,G,...I){let Q=JL($,J,...I),X=S8(I,"cipherText"),O=S8(I,"publicKey"),q=S8(I,"msg");if(U===void 0)U=q.bytesLen;return p$(U),{lengths:{...Q.info.lengths,msg:U,msgRand:q.bytesLen,cipherText:X.bytesLen},getPublicKey:Q.getPublicKey,keygen:Q.keygen,encapsulate(D,z=g0(q.bytesLen)){let W=O.decode(D),w=q.decode(z),V=I.map((j,R)=>j.encapsulate(W[R],w[R])),Z=V.map((j)=>j.sharedSecret),v=V.map((j)=>j.cipherText),N={sharedSecret:G(W,v,Z),cipherText:X.encode(v)};return n$(Z,v),N},decapsulate(D,z){let W=X.decode(D),{publicKey:w,secretKey:V}=Q.expandDecapsulationKey(z),Z=I.map((v,N)=>v.decapsulate(W[N],V[N]));return G(w,W,Z)}}}function u5($,U,J,G,I){return pU(G),pU(I),eQ(32,32,zD(G),(Q,X,O)=>I(r$(O[0],O[1],X[1],Q[1],vI($))),U,J)}var sd=u5("QSF-KEM(ML-KEM-768,P-256)-XOF(SHAKE256)-KDF(SHA3-256)",L8,DD($D,!0),Z0,$J),ed=u5("QSF-KEM(ML-KEM-1024,P-384)-XOF(SHAKE256)-KDF(SHA3-256)",F5,DD(v5,!0),Z0,$J);function GL($,U,J,G,I){return pU(G),pU(I),eQ(32,32,zD(G),(Q,X,O)=>{let q=r$(O[0],O[1],X[0],Q[0],X[1],Q[1],vI($)),D=32,z=r$(vI("hybrid_prk"),q),W=Z5(I,z),w=r$(nJ(32,2),vI("shared_secret"),vI("")),V=g5(I,W,w,32);return n$(W,w,z,q),V},U,J)}var x5=DD(V5),$n=GL("KitchenSink-KEM(ML-KEM-768,X25519)-XOF(SHAKE256)-KDF(HKDF-SHA-256)",L8,x5,Z0,pQ),QL=(()=>eQ(32,32,zD(Z0),($,U,J)=>$J(r$(J[0],J[1],U[1],$[1],vI("\\.//^\\"))),L8,x5))();function XL($,U,J,G){let I=$.Point.Fn;if(!I)throw Error("no Point.Fn");function Q(X){let O;for(let z=0,W=U;;z=W,W+=U){if(W>X.length)throw Error("rejection sampling failed");if(O=I.fromBytes(X.subarray(z,W),!0),I.isValidNot0(O))break}let q=I.toBytes(I.create(O)),D=$.getPublicKey(q,!1);return{secretKey:q,publicKey:D}}return{lengths:{secretKey:U,publicKey:J,seed:G,msg:G,cipherText:J},keygen(X=g0(G)){return g$(X,G,"seed"),Q(X)},getPublicKey(X){return $.getPublicKey(X,!1)},encapsulate(X,O=g0(G)){g$(O,G,"rand");let{secretKey:q}=Q(O),D=this.decapsulate(X,q),z=$.getPublicKey(q,!1);return n$(q),{sharedSecret:D,cipherText:z}},decapsulate(X,O){return $.getSharedSecret(O,X).subarray(1)}}}function OL($,U,J,G){let{secretKey:I,publicKeyUncompressed:Q}=J.lengths;if(!I||!Q)throw Error("wrong curve");let X=XL(J,I,Q,G),O=64,q=O+G;return eQ(32,32,(D)=>{g$(D,32);let z=Z0(D,{dkLen:q}),W=z.subarray(0,O),w=z.subarray(O,q);return r$(W,w)},(D,z,W)=>$J(r$(W[0],W[1],z[1],D[1],vI($))),U,X)}var qL=(()=>OL("MLKEM768-P256",L8,$D,128))();var $4=QL,m5=qL;/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var S$=($,U,J)=>t$($,U,J),WD=m$,aJ=KQ,JU=(...$)=>wq(...$),tJ=($)=>G8($),sJ=zq,eJ=($)=>x0($),I4=BigInt(0),YD=BigInt(1);function p0($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw TypeError(J+"expected boolean, got type="+typeof $)}return $}function J4($){if(typeof $==="bigint"){if(!U4($))throw RangeError("positive bigint expected, got "+$)}else WD($);return $}function M0($,U=""){if(typeof $!=="number"){let J=U&&`"${U}" `;throw TypeError(J+"expected number, got type="+typeof $)}if(!Number.isSafeInteger($)){let J=U&&`"${U}" `;throw RangeError(J+"expected safe integer, got "+$)}}function _8($){let U=J4($).toString(16);return U.length&1?"0"+U:U}function y5($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);return $===""?I4:BigInt("0x"+$)}function GJ($){return y5(KQ($))}function G0($){return y5(KQ(RI(t$($)).reverse()))}function G4($,U){if(m$(U),U===0)throw RangeError("zero length");$=J4($);let J=$.toString(16);if(J.length>U*2)throw RangeError("number too large");return G8(J.padStart(U*2,"0"))}function C8($,U){return G4($,U).reverse()}function r5($,U){if($=S$($),U=S$(U),$.length!==U.length)return!1;let J=0;for(let G=0;G<$.length;G++)J|=$[G]^U[G];return J===0}function RI($){return Uint8Array.from(S$($))}function Q4($){if(typeof $!=="string")throw TypeError("ascii string expected, got "+typeof $);return Uint8Array.from($,(U,J)=>{let G=U.charCodeAt(0);if(U.length!==1||G>127)throw RangeError(`string contains non-ASCII character "${$[J]}" with code ${G} at position ${J}`);return G})}var U4=($)=>typeof $==="bigint"&&I4<=$;function DL($,U,J){return U4($)&&U4(U)&&U4(J)&&U<=$&&$<J}function o0($,U,J,G){if(!DL(U,J,G))throw RangeError("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function $G($){if($<I4)throw Error("expected non-negative bigint, got "+$);let U;for(U=0;$>I4;$>>=YD,U+=1);return U}var E8=($)=>(YD<<BigInt($))-YD;function h5($,U,J){if(m$($,"hashLen"),m$(U,"qByteLen"),typeof J!=="function")throw TypeError("hmacFn must be a function");let G=(N)=>new Uint8Array(N),I=Uint8Array.of(),Q=Uint8Array.of(0),X=Uint8Array.of(1),O=1000,q=G($),D=G($),z=0,W=()=>{q.fill(1),D.fill(0),z=0},w=(...N)=>J(D,JU(q,...N)),V=(N=I)=>{if(D=w(Q,N),q=w(),N.length===0)return;D=w(X,N),q=w()},Z=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){q=w();let R=q.slice();j.push(R),N+=q.length}return JU(...j)};return(N,j)=>{W(),V(N);let R=void 0;while((R=j(Z()))===void 0)V();return W(),R}}function aU($,U={},J={}){if(Object.prototype.toString.call($)!=="[object Object]")throw TypeError("expected valid options object");function G(Q,X,O){if(!O&&X!=="function"&&!Object.hasOwn($,Q))throw TypeError(`param "${Q}" is invalid: expected own property`);let q=$[Q];if(O&&q===void 0)return;let D=typeof q;if(D!==X||q===null)throw TypeError(`param "${Q}" is invalid: expected ${X}, got ${D}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,q])=>G(O,q,X));I(U,!1),I(J,!0)}var wD=()=>{throw Error("not implemented")};/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var GU=BigInt(0),u$=BigInt(1),QJ=BigInt(2),i5=BigInt(3),c5=BigInt(4),p5=BigInt(5),zL=BigInt(7),o5=BigInt(8),YL=BigInt(9),a5=BigInt(16);function F$($,U){if(U<=GU)throw Error("mod: expected positive modulus, got "+U);let J=$%U;return J>=GU?J:U+J}function tU($,U,J){if(U<GU)throw Error("pow2: expected non-negative exponent, got "+U);let G=$;while(U-- >GU)G*=G,G%=J;return G}function l5($,U){if($===GU)throw Error("invert: expected non-zero number");if(U<=GU)throw Error("invert: expected positive modulus, got "+U);let J=F$($,U),G=U,I=GU,Q=u$,X=u$,O=GU;while(J!==GU){let D=G/J,z=G-J*D,W=I-X*D,w=Q-O*D;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==u$)throw Error("invert: does not exist");return F$(I,U)}function VD($,U,J){let G=$;if(!G.eql(G.sqr(U),J))throw Error("Cannot find square root")}function t5($,U){let J=$,G=(J.ORDER+u$)/c5,I=J.pow(U,G);return VD(J,I,U),I}function WL($,U){let J=$,G=(J.ORDER-p5)/o5,I=J.mul(U,QJ),Q=J.pow(I,G),X=J.mul(U,Q),O=J.mul(J.mul(X,QJ),Q),q=J.mul(X,J.sub(O,J.ONE));return VD(J,q,U),q}function wL($){let U=X4($),J=s5($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+zL)/a5;return(O,q)=>{let D=O,z=D.pow(q,X),W=D.mul(z,G),w=D.mul(z,I),V=D.mul(z,Q),Z=D.eql(D.sqr(W),q),v=D.eql(D.sqr(w),q);z=D.cmov(z,W,Z),W=D.cmov(V,w,v);let N=D.eql(D.sqr(W),q),j=D.cmov(z,W,N);return VD(D,j,q),j}}function s5($){if($<i5)throw Error("sqrt is not defined for small field");let U=$-u$,J=0;while(U%QJ===GU)U/=QJ,J++;let G=QJ,I=X4($);while(d5(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return t5;let Q=I.pow(G,U),X=(U+u$)/QJ;return function(q,D){let z=q;if(z.is0(D))return D;if(d5(z,D)!==1)throw Error("Cannot find square root");let W=J,w=z.mul(z.ONE,Q),V=z.pow(D,U),Z=z.pow(D,X);while(!z.eql(V,z.ONE)){if(z.is0(V))return z.ZERO;let v=1,N=z.sqr(V);while(!z.eql(N,z.ONE))if(v++,N=z.sqr(N),v===W)throw Error("Cannot find square root");let j=u$<<BigInt(W-v-1),R=z.pow(w,j);W=v,w=z.sqr(R),V=z.mul(V,w),Z=z.mul(Z,R)}return Z}}function VL($){if($%c5===i5)return t5;if($%o5===p5)return WL;if($%a5===YL)return wL($);return s5($)}var a0=($,U)=>(F$($,U)&u$)===u$,vL=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function vD($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=vL.reduce((G,I)=>{return G[I]="function",G},U);if(aU($,J),M0($.BYTES,"BYTES"),M0($.BITS,"BITS"),$.BYTES<1||$.BITS<1)throw Error("invalid field: expected BYTES/BITS > 0");if($.ORDER<=u$)throw Error("invalid field: expected ORDER > 1, got "+$.ORDER);return $}function NL($,U,J){let G=$;if(J<GU)throw Error("invalid exponent, negatives unsupported");if(J===GU)return G.ONE;if(J===u$)return U;let I=G.ONE,Q=U;while(J>GU){if(J&u$)I=G.mul(I,Q);Q=G.sqr(Q),J>>=u$}return I}function b8($,U,J=!1){let G=$,I=Array(U.length).fill(J?G.ZERO:void 0),Q=U.reduce((O,q,D)=>{if(G.is0(q))return O;return I[D]=O,G.mul(O,q)},G.ONE),X=G.inv(Q);return U.reduceRight((O,q,D)=>{if(G.is0(q))return O;return I[D]=G.mul(O,I[D]),G.mul(O,q)},X),I}function d5($,U){let J=$,G=(J.ORDER-u$)/QJ,I=J.pow(U,G),Q=J.eql(I,J.ONE),X=J.eql(I,J.ZERO),O=J.eql(I,J.neg(J.ONE));if(!Q&&!X&&!O)throw Error("invalid Legendre symbol result");return Q?1:X?0:-1}function ZL($,U){if(U!==void 0)WD(U);if($<=GU)throw Error("invalid n length: expected positive n, got "+$);if(U!==void 0&&U<1)throw Error("invalid n length: expected positive bit length, got "+U);let J=$G($);if(U!==void 0&&U<J)throw Error(`invalid n length: expected bit length (${J}) >= n.length (${U})`);let G=U!==void 0?U:J,I=Math.ceil(G/8);return{nBitLength:G,nByteLength:I}}var n5=new WeakMap;class ND{ORDER;BITS;BYTES;isLE;ZERO=GU;ONE=u$;_lengths;_mod;constructor($,U={}){if($<=u$)throw Error("invalid field: expected ORDER > 1, got "+$);let J=void 0;if(this.isLE=!1,U!=null&&typeof U==="object"){if(typeof U.BITS==="number")J=U.BITS;if(typeof U.sqrt==="function")Object.defineProperty(this,"sqrt",{value:U.sqrt,enumerable:!0});if(typeof U.isLE==="boolean")this.isLE=U.isLE;if(U.allowedLengths)this._lengths=Object.freeze(U.allowedLengths.slice());if(typeof U.modFromBytes==="boolean")this._mod=U.modFromBytes}let{nBitLength:G,nByteLength:I}=ZL($,J);if(I>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");this.ORDER=$,this.BITS=G,this.BYTES=I,Object.freeze(this)}create($){return F$($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw TypeError("invalid field element: expected bigint, got "+typeof $);return GU<=$&&$<this.ORDER}is0($){return $===GU}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&u$)===u$}neg($){return F$(-$,this.ORDER)}eql($,U){return $===U}sqr($){return F$($*$,this.ORDER)}add($,U){return F$($+U,this.ORDER)}sub($,U){return F$($-U,this.ORDER)}mul($,U){return F$($*U,this.ORDER)}pow($,U){return NL(this,$,U)}div($,U){return F$($*l5(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return l5($,this.ORDER)}sqrt($){let U=n5.get(this);if(!U)n5.set(this,U=VL(this.ORDER));return U(this,$)}toBytes($){return this.isLE?C8($,this.BYTES):G4($,this.BYTES)}fromBytes($,U=!1){S$($);let{_lengths:J,BYTES:G,isLE:I,ORDER:Q,_mod:X}=this;if(J){if($.length<1||!J.includes($.length)||$.length>G)throw Error("Field.fromBytes: expected "+J+" bytes, got "+$.length);let q=new Uint8Array(G);q.set($,I?0:q.length-$.length),$=q}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?G0($):GJ($);if(X)O=F$(O,Q);if(!U){if(!this.isValid(O))throw Error("invalid field element: outside of range 0..ORDER")}return O}invertBatch($){return b8(this,$)}cmov($,U,J){return p0(J,"condition"),J?U:$}}Object.freeze(ND.prototype);function X4($,U={}){return new ND($,U)}function e5($){if(typeof $!=="bigint")throw Error("field order must be bigint");if($<=u$)throw Error("field order must be greater than 1");let U=$G($-u$);return Math.ceil(U/8)}function ZD($){let U=e5($);return U+Math.ceil(U/2)}function $g($,U,J=!1){S$($);let G=$.length,I=e5(U),Q=Math.max(ZD(U),16);if(G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?G0($):GJ($),O=F$(X,U-u$)+u$;return J?C8(O,I):G4(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var UG=BigInt(0),XJ=BigInt(1);function f8($,U){let J=U.negate();return $?J:U}function OJ($,U){let J=b8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function Gg($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function gD($,U){Gg($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=E8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function Ug($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),q=$>>X;if(O>G)O-=Q,q+=XJ;let D=U*G,z=D+Math.abs(O)-1,W=O===0,w=O<0,V=U%2!==0;return{nextN:q,offset:z,isZero:W,isNeg:w,isNegF:V,offsetF:D}}var MD=new WeakMap,Qg=new WeakMap;function RD($){return Qg.get($)||1}function Ig($){if($!==UG)throw Error("invalid wNAF")}class k8{BASE;ZERO;Fn;bits;constructor($,U){this.BASE=$.BASE,this.ZERO=$.ZERO,this.Fn=$.Fn,this.bits=U}_unsafeLadder($,U,J=this.ZERO){let G=$;while(U>UG){if(U&XJ)J=J.add(G);G=G.double(),U>>=XJ}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=gD(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let q=1;q<G;q++)X=X.add(Q),I.push(X);Q=X.double()}return I}wNAF($,U,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let G=this.ZERO,I=this.BASE,Q=gD($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:q,isZero:D,isNeg:z,isNegF:W,offsetF:w}=Ug(J,X,Q);if(J=O,D)I=I.add(f8(W,U[w]));else G=G.add(f8(z,U[q]))}return Ig(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=gD($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===UG)break;let{nextN:X,offset:O,isZero:q,isNeg:D}=Ug(J,Q,I);if(J=X,q)continue;else{let z=U[O];G=G.add(D?z.negate():z)}}return Ig(J),G}getPrecomputes($,U,J){let G=MD.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);MD.set(U,G)}}return G}cached($,U,J){let G=RD($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=RD($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){Gg(U,this.bits),Qg.set($,U),MD.delete($)}hasCache($){return RD($)!==1}}function Xg($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>UG||G>UG){if(J&XJ)Q=Q.add(I);if(G&XJ)X=X.add(I);I=I.double(),J>>=XJ,G>>=XJ}return{p1:Q,p2:X}}function Jg($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return vD(U),U}else return X4($,{isLE:J})}function O4($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let q of["p","n","h"]){let D=U[q];if(!(typeof D==="bigint"&&D>UG))throw Error(`CURVE.${q} must be positive bigint`)}let I=Jg(U.p,J.Fp,G),Q=Jg(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let q of O)if(!I.isValid(U[q]))throw Error(`CURVE.${q} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function F8($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}function u8($,U){if(M0($),M0(U),U<0||U>4)throw Error("invalid I2OSP length: "+U);if($<0||$>2**(8*U)-1)throw Error("invalid I2OSP input: "+$);let J=Array.from({length:U}).fill(0);for(let G=U-1;G>=0;G--)J[G]=$&255,$>>>=8;return new Uint8Array(J)}function gL($,U){let J=new Uint8Array($.length);for(let G=0;G<$.length;G++)J[G]=$[G]^U[G];return J}function ML($){if(!sJ($)&&typeof $!=="string")throw Error("DST must be Uint8Array or ascii string");let U=typeof $==="string"?Q4($):$;if(U.length===0)throw Error("DST must be non-empty");return U}function jD($,U,J,G){if(S$($),M0(J),U=ML(U),U.length>255)U=G(JU(Q4("H2C-OVERSIZE-DST-"),U));let{outputLen:I,blockLen:Q}=G,X=Math.ceil(J/I);if(J>65535||X>255)throw Error("expand_message_xmd: invalid lenInBytes");let O=JU(U,u8(U.length,1)),q=new Uint8Array(Q),D=u8(J,2),z=Array(X),W=G(JU(q,$,D,u8(0,1),O));z[0]=G(JU(W,u8(1,1),O));for(let V=1;V<X;V++){let Z=[gL(W,z[V-1]),u8(V+1,1),O];z[V]=G(JU(...Z))}return JU(...z).slice(0,J)}var Og="HashToScalar-";/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var qg=($,U)=>($+($>=0?U:-U)/zg)/U;function RL($,U,J){o0("scalar",$,R0,J);let[[G,I],[Q,X]]=U,O=qg(X*$,J),q=qg(-I*$,J),D=$-O*G-q*Q,z=-O*I-q*X,W=D<R0,w=z<R0;if(W)D=-D;if(w)z=-z;let V=E8(Math.ceil($G(J)/2))+jI;if(D<R0||D>=V||z<R0||z>=V)throw Error("splitScalar (endomorphism): failed for k");return{k1neg:W,k1:D,k2neg:w,k2:z}}function TD($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function HD($,U){aU($);let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(p0(J.lowS,"lowS"),p0(J.prehash,"prehash"),J.format!==void 0)TD(J.format);return J}class Dg extends Error{constructor($=""){super($)}}var Q0={Err:Dg,_tlv:{encode:($,U)=>{let{Err:J}=Q0;if(M0($,"tag"),$<0||$>255)throw new J("tlv.encode: wrong tag");if(typeof U!=="string")throw TypeError('"data" expected string, got type='+typeof U);if(U.length&1)throw new J("tlv.encode: unpadded data");let G=U.length/2,I=_8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?_8(I.length/2|128):"";return _8($)+Q+I+U},decode($,U){let{Err:J}=Q0;U=S$(U,void 0,"DER data");let G=0;if($<0||$>255)throw new J("tlv.encode: wrong tag");if(U.length<2||U[G++]!==$)throw new J("tlv.decode: wrong tlv");let I=U[G++],Q=!!(I&128),X=0;if(!Q)X=I;else{let q=I&127;if(!q)throw new J("tlv.decode(long): indefinite length not supported");if(q>4)throw new J("tlv.decode(long): byte length is too big");let D=U.subarray(G,G+q);if(D.length!==q)throw new J("tlv.decode: length bytes not complete");if(D[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of D)X=X<<8|z;if(G+=q,X<128)throw new J("tlv.decode(long): not minimal encoding")}let O=U.subarray(G,G+X);if(O.length!==X)throw new J("tlv.decode: wrong value length");return{v:O,l:U.subarray(G+X)}}},_int:{encode($){let{Err:U}=Q0;if(J4($),$<R0)throw new U("integer: negative integers are not allowed");let J=_8($);if(Number.parseInt(J[0],16)&8)J="00"+J;if(J.length&1)throw new U("unexpected DER parsing assertion: unpadded hex");return J},decode($){let{Err:U}=Q0;if($.length<1)throw new U("invalid signature integer: empty");if($[0]&128)throw new U("invalid signature integer: negative");if($.length>1&&$[0]===0&&!($[1]&128))throw new U("invalid signature integer: unnecessary leading zero");return GJ($)}},toSig($){let{Err:U,_int:J,_tlv:G}=Q0,I=S$($,void 0,"signature"),{v:Q,l:X}=G.decode(48,I);if(X.length)throw new U("invalid signature: left bytes after parsing");let{v:O,l:q}=G.decode(2,Q),{v:D,l:z}=G.decode(2,q);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(D)}},hexFromSig($){let{_tlv:U,_int:J}=Q0,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}};Object.freeze(Q0._tlv);Object.freeze(Q0._int);Object.freeze(Q0);var R0=BigInt(0),jI=BigInt(1),zg=BigInt(2),q4=BigInt(3),jL=BigInt(4);function Yg($,U={}){let J=O4("weierstrass",$,U),G=J.Fp,I=J.Fn,Q=J.CURVE,{h:X,n:O}=Q;aU(U,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:q,allowInfinityPoint:D}=U;if(q){if(!G.is0(Q.a)||typeof q.beta!=="bigint"||!Array.isArray(q.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let z=wg(G,I);function W(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function w(C,A,E){if(D&&A.is0())return Uint8Array.of(0);let{x:M,y:T}=A.toAffine(),H=G.toBytes(M);if(p0(E,"isCompressed"),E){W();let b=!G.isOdd(T);return JU(Wg(b),H)}else return JU(Uint8Array.of(4),H,G.toBytes(T))}function V(C){S$(C,void 0,"Point");let{publicKey:A,publicKeyUncompressed:E}=z,M=C.length,T=C[0],H=C.subarray(1);if(D&&M===1&&T===0)return{x:G.ZERO,y:G.ZERO};if(M===A&&(T===2||T===3)){let b=G.fromBytes(H);if(!G.isValid(b))throw Error("bad point: is not on curve, wrong x");let P=N(b),F;try{F=G.sqrt(P)}catch($$){let X$=$$ instanceof Error?": "+$$.message:"";throw Error("bad point: is not on curve, sqrt error"+X$)}W();let y=G.isOdd(F);if((T&1)===1!==y)F=G.neg(F);return{x:b,y:F}}else if(M===E&&T===4){let b=G.BYTES,P=G.fromBytes(H.subarray(0,b)),F=G.fromBytes(H.subarray(b,b*2));if(!j(P,F))throw Error("bad point: is not on curve");return{x:P,y:F}}else throw Error(`bad point: got length ${M}, expected compressed=${A} or uncompressed=${E}`)}let Z=U.toBytes===void 0?w:U.toBytes,v=U.fromBytes===void 0?V:U.fromBytes;function N(C){let A=G.sqr(C),E=G.mul(A,C);return G.add(G.add(E,G.mul(C,Q.a)),Q.b)}function j(C,A){let E=G.sqr(A),M=N(C);return G.eql(E,M)}if(!j(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let R=G.mul(G.pow(Q.a,q4),jL),S=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(R,S)))throw Error("bad curve params: a or b");function L(C,A,E=!1){if(!G.isValid(A)||E&&G.is0(A))throw Error(`bad point coordinate ${C}`);return A}function k(C){if(!(C instanceof B))throw Error("Weierstrass Point expected")}function x(C){if(!q||!q.basises)throw Error("no endo");return RL(C,q.basises,I.ORDER)}function h(C,A,E,M,T){return E=new B(G.mul(E.X,C),E.Y,E.Z),A=f8(M,A),E=f8(T,E),A.add(E)}class B{static BASE=new B(Q.Gx,Q.Gy,G.ONE);static ZERO=new B(G.ZERO,G.ONE,G.ZERO);static Fp=G;static Fn=I;X;Y;Z;constructor(C,A,E){this.X=L("x",C),this.Y=L("y",A,!0),this.Z=L("z",E),Object.freeze(this)}static CURVE(){return Q}static fromAffine(C){let{x:A,y:E}=C||{};if(!C||!G.isValid(A)||!G.isValid(E))throw Error("invalid affine point");if(C instanceof B)throw Error("projective point not allowed");if(G.is0(A)&&G.is0(E))return B.ZERO;return new B(A,E,G.ONE)}static fromBytes(C){let A=B.fromAffine(v(S$(C,void 0,"point")));return A.assertValidity(),A}static fromHex(C){return B.fromBytes(tJ(C))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(C=8,A=!0){if(a.createCache(this,C),!A)this.multiply(q4);return this}assertValidity(){let C=this;if(C.is0()){if(U.allowInfinityPoint&&G.is0(C.X)&&G.eql(C.Y,G.ONE)&&G.is0(C.Z))return;throw Error("bad point: ZERO")}let{x:A,y:E}=C.toAffine();if(!G.isValid(A)||!G.isValid(E))throw Error("bad point: x or y not field elements");if(!j(A,E))throw Error("bad point: equation left != right");if(!C.isTorsionFree())throw Error("bad point: not in prime-order subgroup")}hasEvenY(){let{y:C}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(C)}equals(C){k(C);let{X:A,Y:E,Z:M}=this,{X:T,Y:H,Z:b}=C,P=G.eql(G.mul(A,b),G.mul(T,M)),F=G.eql(G.mul(E,b),G.mul(H,M));return P&&F}negate(){return new B(this.X,G.neg(this.Y),this.Z)}double(){let{a:C,b:A}=Q,E=G.mul(A,q4),{X:M,Y:T,Z:H}=this,b=G.ZERO,P=G.ZERO,F=G.ZERO,y=G.mul(M,M),n=G.mul(T,T),$$=G.mul(H,H),X$=G.mul(M,T);return X$=G.add(X$,X$),F=G.mul(M,H),F=G.add(F,F),b=G.mul(C,F),P=G.mul(E,$$),P=G.add(b,P),b=G.sub(n,P),P=G.add(n,P),P=G.mul(b,P),b=G.mul(X$,b),F=G.mul(E,F),$$=G.mul(C,$$),X$=G.sub(y,$$),X$=G.mul(C,X$),X$=G.add(X$,F),F=G.add(y,y),y=G.add(F,y),y=G.add(y,$$),y=G.mul(y,X$),P=G.add(P,y),$$=G.mul(T,H),$$=G.add($$,$$),y=G.mul($$,X$),b=G.sub(b,y),F=G.mul($$,n),F=G.add(F,F),F=G.add(F,F),new B(b,P,F)}add(C){k(C);let{X:A,Y:E,Z:M}=this,{X:T,Y:H,Z:b}=C,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=Q.a,$$=G.mul(Q.b,q4),X$=G.mul(A,T),q$=G.mul(E,H),W$=G.mul(M,b),N$=G.add(A,E),V$=G.add(T,H);N$=G.mul(N$,V$),V$=G.add(X$,q$),N$=G.sub(N$,V$),V$=G.add(A,M);let v$=G.add(T,b);return V$=G.mul(V$,v$),v$=G.add(X$,W$),V$=G.sub(V$,v$),v$=G.add(E,M),P=G.add(H,b),v$=G.mul(v$,P),P=G.add(q$,W$),v$=G.sub(v$,P),y=G.mul(n,V$),P=G.mul($$,W$),y=G.add(P,y),P=G.sub(q$,y),y=G.add(q$,y),F=G.mul(P,y),q$=G.add(X$,X$),q$=G.add(q$,X$),W$=G.mul(n,W$),V$=G.mul($$,V$),q$=G.add(q$,W$),W$=G.sub(X$,W$),W$=G.mul(n,W$),V$=G.add(V$,W$),X$=G.mul(q$,V$),F=G.add(F,X$),X$=G.mul(v$,V$),P=G.mul(N$,P),P=G.sub(P,X$),X$=G.mul(N$,q$),y=G.mul(v$,y),y=G.add(y,X$),new B(P,F,y)}subtract(C){return k(C),this.add(C.negate())}is0(){return this.equals(B.ZERO)}multiply(C){let{endo:A}=U;if(!I.isValidNot0(C))throw RangeError("invalid scalar: out of range");let E,M,T=(H)=>a.cached(this,H,(b)=>OJ(B,b));if(A){let{k1neg:H,k1:b,k2neg:P,k2:F}=x(C),{p:y,f:n}=T(b),{p:$$,f:X$}=T(F);M=n.add(X$),E=h(A.beta,y,$$,H,P)}else{let{p:H,f:b}=T(C);E=H,M=b}return OJ(B,[E,M])[0]}multiplyUnsafe(C){let{endo:A}=U,E=this,M=C;if(!I.isValid(M))throw RangeError("invalid scalar: out of range");if(M===R0||E.is0())return B.ZERO;if(M===jI)return E;if(a.hasCache(this))return this.multiply(M);if(A){let{k1neg:T,k1:H,k2neg:b,k2:P}=x(M),{p1:F,p2:y}=Xg(B,E,H,P);return h(A.beta,F,y,T,b)}else return a.unsafe(E,M)}toAffine(C){let A=this,E=C,{X:M,Y:T,Z:H}=A;if(G.eql(H,G.ONE))return{x:M,y:T};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(H);let P=G.mul(M,E),F=G.mul(T,E),y=G.mul(H,E);if(b)return{x:G.ZERO,y:G.ZERO};if(!G.eql(y,G.ONE))throw Error("invZ was invalid");return{x:P,y:F}}isTorsionFree(){let{isTorsionFree:C}=U;if(X===jI)return!0;if(C)return C(B,this);return a.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:C}=U;if(X===jI)return this;if(C)return C(B,this);return this.multiplyUnsafe(X)}isSmallOrder(){if(X===jI)return this.is0();return this.clearCofactor().is0()}toBytes(C=!0){return p0(C,"isCompressed"),this.assertValidity(),Z(B,this,C)}toHex(C=!0){return aJ(this.toBytes(C))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let m=I.BITS,a=new k8(B,U.endo?Math.ceil(m/2):m);if(m>=8)B.BASE.precompute(8);return Object.freeze(B.prototype),Object.freeze(B),B}function Wg($){return Uint8Array.of($?2:3)}function wg($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function HL($,U={}){let{Fn:J}=$,G=U.randomBytes===void 0?eJ:U.randomBytes,I=Object.assign(wg($.Fp,J),{seed:Math.max(ZD(J.ORDER),16)});function Q(V){try{let Z=J.fromBytes(V);return J.isValidNot0(Z)}catch(Z){return!1}}function X(V,Z){let{publicKey:v,publicKeyUncompressed:N}=I;try{let j=V.length;if(Z===!0&&j!==v)return!1;if(Z===!1&&j!==N)return!1;return!!$.fromBytes(V)}catch(j){return!1}}function O(V){return V=V===void 0?G(I.seed):V,$g(S$(V,I.seed,"seed"),J.ORDER)}function q(V,Z=!0){return $.BASE.multiply(J.fromBytes(V)).toBytes(Z)}function D(V){let{secretKey:Z,publicKey:v,publicKeyUncompressed:N}=I,j=J._lengths;if(!sJ(V))return;let R=S$(V,void 0,"key").length,S=R===v||R===N,L=R===Z||!!j?.includes(R);if(S&&L)return;return S}function z(V,Z,v=!0){if(D(V)===!0)throw Error("first arg must be private key");if(D(Z)===!1)throw Error("second arg must be public key");let N=J.fromBytes(V);return $.fromBytes(Z).multiply(N).toBytes(v)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=F8(O,q);return Object.freeze(W),Object.freeze(I),Object.freeze({getPublicKey:q,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function Vg($,U,J={}){let G=U;u0(G),aU(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let I=J.randomBytes===void 0?eJ:J.randomBytes,Q=J.hmac===void 0?(T,H)=>w0(G,T,H):J.hmac,{Fp:X,Fn:O}=$,{ORDER:q,BITS:D}=O,{keygen:z,getPublicKey:W,getSharedSecret:w,utils:V,lengths:Z}=HL($,J),v={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},N=q*zg+jI<X.ORDER;function j(T){let H=q>>jI;return T>H}function R(T,H){if(!O.isValidNot0(H))throw Error(`invalid signature ${T}: out of range 1..Point.Fn.ORDER`);return H}function S(){if(N)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function L(T,H){TD(H);let b=Z.signature,P=H==="compact"?b:H==="recovered"?b+1:void 0;return S$(T,P)}class k{r;s;recovery;constructor(T,H,b){if(this.r=R("r",T),this.s=R("s",H),b!=null){if(S(),![0,1,2,3].includes(b))throw Error("invalid recovery id");this.recovery=b}Object.freeze(this)}static fromBytes(T,H=v.format){L(T,H);let b;if(H==="der"){let{r:n,s:$$}=Q0.toSig(S$(T));return new k(n,$$)}if(H==="recovered")b=T[0],H="compact",T=T.subarray(1);let P=Z.signature/2,F=T.subarray(0,P),y=T.subarray(P,P*2);return new k(O.fromBytes(F),O.fromBytes(y),b)}static fromHex(T,H){return this.fromBytes(tJ(T),H)}assertRecovery(){let{recovery:T}=this;if(T==null)throw Error("invalid recovery id: must be present");return T}addRecoveryBit(T){return new k(this.r,this.s,T)}recoverPublicKey(T){let{r:H,s:b}=this,P=this.assertRecovery(),F=P===2||P===3?H+q:H;if(!X.isValid(F))throw Error("invalid recovery id: sig.r+curve.n != R.x");let y=X.toBytes(F),n=$.fromBytes(JU(Wg((P&1)===0),y)),$$=O.inv(F),X$=h(S$(T,void 0,"msgHash")),q$=O.create(-X$*$$),W$=O.create(b*$$),N$=$.BASE.multiplyUnsafe(q$).add(n.multiplyUnsafe(W$));if(N$.is0())throw Error("invalid recovery: point at infinify");return N$.assertValidity(),N$}hasHighS(){return j(this.s)}toBytes(T=v.format){if(TD(T),T==="der")return tJ(Q0.hexFromSig(this));let{r:H,s:b}=this,P=O.toBytes(H),F=O.toBytes(b);if(T==="recovered")return S(),JU(Uint8Array.of(this.assertRecovery()),P,F);return JU(P,F)}toHex(T){return aJ(this.toBytes(T))}}Object.freeze(k.prototype),Object.freeze(k);let x=J.bits2int===void 0?function(H){if(H.length>8192)throw Error("input is too large");let b=GJ(H),P=H.length*8-D;return P>0?b>>BigInt(P):b}:J.bits2int,h=J.bits2int_modN===void 0?function(H){return O.create(x(H))}:J.bits2int_modN,B=E8(D);function m(T){return o0("num < 2^"+D,T,R0,B),O.toBytes(T)}function a(T,H){return S$(T,void 0,"message"),H?S$(G(T),void 0,"prehashed message"):T}function C(T,H,b){let{lowS:P,prehash:F,extraEntropy:y}=HD(b,v);T=a(T,F);let n=h(T),$$=O.fromBytes(H);if(!O.isValidNot0($$))throw Error("invalid private key");let X$=[m($$),m(n)];if(y!=null&&y!==!1){let V$=y===!0?I(Z.secretKey):y;X$.push(S$(V$,void 0,"extraEntropy"))}let q$=JU(...X$),W$=n;function N$(V$){let v$=x(V$);if(!O.isValidNot0(v$))return;let R$=O.inv(v$),b$=$.BASE.multiply(v$).toAffine(),k$=O.create(b$.x);if(k$===R0)return;let OU=O.create(R$*O.create(W$+k$*$$));if(OU===R0)return;let qU=(b$.x===k$?0:2)|Number(b$.y&jI),LU=OU;if(P&&j(OU))LU=O.neg(OU),qU^=1;return new k(k$,LU,N?void 0:qU)}return{seed:q$,k2sig:N$}}function A(T,H,b={}){let{seed:P,k2sig:F}=C(T,H,b);return h5(G.outputLen,O.BYTES,Q)(P,F).toBytes(b.format)}function E(T,H,b,P={}){let{lowS:F,prehash:y,format:n}=HD(P,v);if(b=S$(b,void 0,"publicKey"),H=a(H,y),!sJ(T)){let $$=T instanceof k?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+$$)}L(T,n);try{let $$=k.fromBytes(T,n),X$=$.fromBytes(b);if(F&&$$.hasHighS())return!1;let{r:q$,s:W$}=$$,N$=h(H),V$=O.inv(W$),v$=O.create(N$*V$),R$=O.create(q$*V$),b$=$.BASE.multiplyUnsafe(v$).add(X$.multiplyUnsafe(R$));if(b$.is0())return!1;return O.create(b$.x)===q$}catch($$){return!1}}function M(T,H,b={}){let{prehash:P}=HD(b,v);return H=a(H,P),k.fromBytes(T,"recovered").recoverPublicKey(H).toBytes()}return Object.freeze({keygen:z,getPublicKey:W,getSharedSecret:w,utils:V,lengths:Z,Point:$,sign:A,verify:E,recoverPublicKey:M,Signature:k,hash:G})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var TL=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))();var KL=Yg(TL),IG=Vg(KL,y$);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var HI=BigInt(0),_U=BigInt(1),KD=BigInt(2),AL=BigInt(8);function PL($,U,J,G){let I=$.sqr(J),Q=$.sqr(G),X=$.add($.mul(U.a,I),Q),O=$.add($.ONE,$.mul(U.d,$.mul(I,Q)));return $.eql(X,O)}function vg($,U={}){let J=U,G=O4("edwards",$,J,J.FpFnLE),{Fp:I,Fn:Q}=G,X=G.CURVE,{h:O}=X;aU(J,{},{uvRatio:"function"});let q=KD<<BigInt(Q.BYTES*8)-_U,D=(v)=>I.create(v),z=J.uvRatio===void 0?(v,N)=>{try{return{isValid:!0,value:I.sqrt(I.div(v,N))}}catch(j){return{isValid:!1,value:HI}}}:J.uvRatio;if(!PL(I,X,X.Gx,X.Gy))throw Error("bad curve params: generator point");function W(v,N,j=!1){let R=j?_U:HI;return o0("coordinate "+v,N,R,q),N}function w(v){if(!(v instanceof V))throw Error("EdwardsPoint expected")}class V{static BASE=new V(X.Gx,X.Gy,_U,D(X.Gx*X.Gy));static ZERO=new V(HI,_U,_U,HI);static Fp=I;static Fn=Q;X;Y;Z;T;constructor(v,N,j,R){this.X=W("x",v),this.Y=W("y",N),this.Z=W("z",j,!0),this.T=W("t",R),Object.freeze(this)}static CURVE(){return X}static fromAffine(v){if(v instanceof V)throw Error("extended point not allowed");let{x:N,y:j}=v||{};return W("x",N),W("y",j),new V(N,j,_U,D(N*j))}static fromBytes(v,N=!1){let j=I.BYTES,{a:R,d:S}=X;v=RI(S$(v,j,"point")),p0(N,"zip215");let L=RI(v),k=v[j-1];L[j-1]=k&-129;let x=G0(L),h=N?q:I.ORDER;o0("point.y",x,HI,h);let B=D(x*x),m=D(B-_U),a=D(S*B-R),{isValid:C,value:A}=z(m,a);if(!C)throw Error("bad point: invalid y coordinate");let E=(A&_U)===_U,M=(k&128)!==0;if(!N&&A===HI&&M)throw Error("bad point: x=0 and x_0=1");if(M!==E)A=D(-A);return V.fromAffine({x:A,y:x})}static fromHex(v,N=!1){return V.fromBytes(tJ(v),N)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(v=8,N=!0){if(Z.createCache(this,v),!N)this.multiply(KD);return this}assertValidity(){let v=this,{a:N,d:j}=X;if(v.is0())throw Error("bad point: ZERO");let{X:R,Y:S,Z:L,T:k}=v,x=D(R*R),h=D(S*S),B=D(L*L),m=D(B*B),a=D(x*N),C=D(B*D(a+h)),A=D(m+D(j*D(x*h)));if(C!==A)throw Error("bad point: equation left != right (1)");let E=D(R*S),M=D(L*k);if(E!==M)throw Error("bad point: equation left != right (2)")}equals(v){w(v);let{X:N,Y:j,Z:R}=this,{X:S,Y:L,Z:k}=v,x=D(N*k),h=D(S*R),B=D(j*k),m=D(L*R);return x===h&&B===m}is0(){return this.equals(V.ZERO)}negate(){return new V(D(-this.X),this.Y,this.Z,D(-this.T))}double(){let{a:v}=X,{X:N,Y:j,Z:R}=this,S=D(N*N),L=D(j*j),k=D(KD*D(R*R)),x=D(v*S),h=N+j,B=D(D(h*h)-S-L),m=x+L,a=m-k,C=x-L,A=D(B*a),E=D(m*C),M=D(B*C),T=D(a*m);return new V(A,E,T,M)}add(v){w(v);let{a:N,d:j}=X,{X:R,Y:S,Z:L,T:k}=this,{X:x,Y:h,Z:B,T:m}=v,a=D(R*x),C=D(S*h),A=D(k*j*m),E=D(L*B),M=D((R+S)*(x+h)-a-C),T=E-A,H=E+A,b=D(C-N*a),P=D(M*T),F=D(H*b),y=D(M*b),n=D(T*H);return new V(P,F,n,y)}subtract(v){return w(v),this.add(v.negate())}multiply(v){if(!Q.isValidNot0(v))throw RangeError("invalid scalar: expected 1 <= sc < curve.n");let{p:N,f:j}=Z.cached(this,v,(R)=>OJ(V,R));return OJ(V,[N,j])[0]}multiplyUnsafe(v){if(!Q.isValid(v))throw RangeError("invalid scalar: expected 0 <= sc < curve.n");if(v===HI)return V.ZERO;if(this.is0()||v===_U)return this;return Z.unsafe(this,v,(N)=>OJ(V,N))}isSmallOrder(){return this.clearCofactor().is0()}isTorsionFree(){return Z.unsafe(this,X.n).is0()}toAffine(v){let N=this,j=v,{X:R,Y:S,Z:L}=N,k=N.is0();if(j==null)j=k?AL:I.inv(L);let x=D(R*j),h=D(S*j),B=I.mul(L,j);if(k)return{x:HI,y:_U};if(B!==_U)throw Error("invZ was invalid");return{x,y:h}}clearCofactor(){if(O===_U)return this;return this.multiplyUnsafe(O)}toBytes(){let{x:v,y:N}=this.toAffine(),j=I.toBytes(N);return j[j.length-1]|=v&_U?128:0,j}toHex(){return aJ(this.toBytes())}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let Z=new k8(V,Q.BITS);if(Q.BITS>=8)V.BASE.precompute(8);return Object.freeze(V.prototype),Object.freeze(V),V}class AD{static BASE;static ZERO;static Fp;static Fn;ep;constructor($){this.ep=$}static fromBytes($){wD()}static fromHex($){wD()}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 aJ(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($,U){return this.ep.precompute($,U),this}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var x8=BigInt(0),JG=BigInt(1),D4=BigInt(2);function BL($){return aU($,{P:"bigint",type:"string",adjustScalarBytes:"function",powPminus2:"function"},{randomBytes:"function"}),Object.freeze({...$})}function Ng($){let U=BL($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let q=X===void 0?eJ:X,D=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),V=O?D4**BigInt(254):D4**BigInt(447),Z=O?BigInt(8)*D4**BigInt(251)-JG:BigInt(4)*D4**BigInt(445)-JG,v=V+Z+JG,N=(M)=>F$(M,J),j=R(W);function R(M){return C8(N(M),z)}function S(M){let T=RI(S$(M,z,"uCoordinate"));if(O)T[31]&=127;return N(G0(T))}function L(M){return G0(I(RI(S$(M,z,"scalar"))))}function k(M,T){let H=a(S(T),L(M));if(H===x8)throw Error("invalid private or public key received");return R(H)}function x(M){return k(M,j)}let h=x,B=k;function m(M,T,H){let b=N(M*(T-H));return T=N(T-b),H=N(H+b),{x_2:T,x_3:H}}function a(M,T){o0("u",M,x8,J),o0("scalar",T,V,v);let H=T,b=M,P=JG,F=x8,y=M,n=JG,$$=x8;for(let q$=BigInt(D-1);q$>=x8;q$--){let W$=H>>q$&JG;$$^=W$,{x_2:P,x_3:y}=m($$,P,y),{x_2:F,x_3:n}=m($$,F,n),$$=W$;let N$=P+F,V$=N(N$*N$),v$=P-F,R$=N(v$*v$),b$=V$-R$,k$=y+n,OU=y-n,qU=N(OU*N$),LU=N(k$*v$),Y0=qU+LU,W0=qU-LU;y=N(Y0*Y0),n=N(b*N(W0*W0)),P=N(V$*R$),F=N(b$*(V$+N(w*b$)))}({x_2:P,x_3:y}=m($$,P,y)),{x_2:F,x_3:n}=m($$,F,n);let X$=Q(F);return N(P*X$)}let C={secretKey:z,publicKey:z,seed:z},A=(M)=>{return M=M===void 0?q(z):M,S$(M,C.seed,"seed"),M},E={randomSecretKey:A};return Object.freeze(C),Object.freeze(E),Object.freeze({keygen:F8(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:C})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var LL=BigInt(0),t0=BigInt(1),Zg=BigInt(2),SL=BigInt(3),_L=BigInt(5),CL=BigInt(8),DJ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),SD=(()=>({p:DJ,n:BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),h:CL,a:BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),d:BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),Gx:BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),Gy:BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")}))();function Rg($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=DJ,O=$*$%Q*$%Q,q=tU(O,Zg,Q)*O%Q,D=tU(q,t0,Q)*$%Q,z=tU(D,_L,Q)*D%Q,W=tU(z,U,Q)*z%Q,w=tU(W,J,Q)*W%Q,V=tU(w,G,Q)*w%Q,Z=tU(V,I,Q)*V%Q,v=tU(Z,I,Q)*V%Q,N=tU(v,U,Q)*z%Q;return{pow_p_5_8:tU(N,Zg,Q)*$%Q,b2:O}}function EL($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var PD=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");function _D($,U){let J=DJ,G=F$(U*U*U,J),I=F$(G*G*U,J),Q=Rg($*I).pow_p_5_8,X=F$($*G*Q,J),O=F$(U*X*X,J),q=X,D=F$(X*PD,J),z=O===$,W=O===F$(-$,J),w=O===F$(-$*PD,J);if(z)X=q;if(W||w)X=D;if(a0(X,J))X=F$(-X,J);return{isValid:z||W,value:X}}var qJ=vg(SD,{uvRatio:_D}),TI=(()=>qJ.Fp)(),jg=(()=>qJ.Fn)();var z4=(()=>{let $=DJ;return Ng({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=Rg(U);return F$(tU(J,SL,$)*G,$)},adjustScalarBytes:EL})})();var BD=PD,bL=BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"),fL=BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"),kL=BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"),FL=BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"),gg=($)=>_D(t0,$),uL=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),LD=($)=>TI.create(G0($)&uL);function Mg($){let{d:U}=SD,J=DJ,G=(j)=>TI.create(j),I=G(BD*$*$),Q=G((I+t0)*kL),X=BigInt(-1),O=G((X-U*I)*G(I+U)),{isValid:q,value:D}=_D(Q,O),z=G(D*$);if(!a0(z,J))z=G(-z);if(!q)D=z;if(!q)X=I;let W=G(X*(I-t0)*FL-O),w=D*D,V=G((D+D)*O),Z=G(W*bL),v=G(t0-w),N=G(t0+w);return new qJ(G(V*N),G(v*Z),G(Z*N),G(V*v))}class jU extends AD{static BASE=(()=>new jU(qJ.BASE))();static ZERO=(()=>new jU(qJ.ZERO))();static Fp=(()=>TI)();static Fn=(()=>jg)();constructor($){super($)}static fromAffine($){return new jU(qJ.fromAffine($))}assertSame($){if(!($ instanceof jU))throw Error("RistrettoPoint expected")}init($){return new jU($)}static fromBytes($){t$($,32);let{a:U,d:J}=SD,G=DJ,I=(S)=>TI.create(S),Q=LD($);if(!r5(TI.toBytes(Q),$)||a0(Q,G))throw Error("invalid ristretto255 encoding 1");let X=I(Q*Q),O=I(t0+U*X),q=I(t0-U*X),D=I(O*O),z=I(q*q),W=I(U*J*D-z),{isValid:w,value:V}=gg(I(W*z)),Z=I(V*q),v=I(V*Z*W),N=I((Q+Q)*Z);if(a0(N,G))N=I(-N);let j=I(O*v),R=I(N*j);if(!w||a0(R,G)||j===LL)throw Error("invalid ristretto255 encoding 2");return new jU(new qJ(N,j,t0,R))}static fromHex($){return jU.fromBytes(G8($))}toBytes(){let{X:$,Y:U,Z:J,T:G}=this.ep,I=DJ,Q=(v)=>TI.create(v),X=Q(Q(J+U)*Q(J-U)),O=Q($*U),q=Q(O*O),{value:D}=gg(Q(X*q)),z=Q(D*X),W=Q(D*O),w=Q(z*W*G),V;if(a0(G*w,I)){let v=Q(U*BD),N=Q($*BD);$=v,U=N,V=Q(z*fL)}else V=W;if(a0($*w,I))U=Q(-U);let Z=Q((J-U)*V);if(a0(Z,I))Z=Q(-Z);return TI.toBytes(Z)}equals($){this.assertSame($);let{X:U,Y:J}=this.ep,{X:G,Y:I}=$.ep,Q=(q)=>TI.create(q),X=Q(U*I)===Q(J*G),O=Q(J*I)===Q(U*G);return X||O}is0(){return this.equals(jU.ZERO)}}Object.freeze(jU.BASE);Object.freeze(jU.ZERO);Object.freeze(jU.prototype);Object.freeze(jU);var xL=Object.freeze({Point:jU,hashToCurve($,U){let J=U?.DST===void 0?"ristretto255_XMD:SHA-512_R255MAP_RO_":U.DST,G=jD($,J,64,LQ);return xL.deriveToCurve(G)},hashToScalar($,U={DST:Og}){let J=jD($,U.DST,64,LQ);return jg.create(G0(J))},deriveToCurve($){t$($,64);let U=LD($.subarray(0,32)),J=Mg(U),G=LD($.subarray(32,64)),I=Mg(G);return new jU(J.add(I))}});var Hg=!1,mL=!1;async function Tg($,U){if(mL)return await U();try{return await $()}catch(J){if(J instanceof ReferenceError||J instanceof DOMException&&J.name==="NotSupportedError")return await U();else throw J}}async function Y4($,U){return await Tg(async()=>{let J=CD($)?$:await rL($),G=await crypto.subtle.importKey("raw",hL(U),{name:"X25519"},Hg,[]);return new Uint8Array(await crypto.subtle.deriveBits({name:"X25519",public:G},J,256))},()=>{if(CD($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return z4.scalarMult($,U)})}async function m8($){return await Tg(async()=>{return Y4($,z4.GuBytes)},()=>{if(CD($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return z4.scalarMultBase($)})}var yL=new Uint8Array([48,46,2,1,0,48,5,6,3,43,101,110,4,34,4,32]);async function rL($){if($.length!==32)throw Error("X25519 private key must be 32 bytes");let U=new Uint8Array([...yL,...$]);return crypto.subtle.importKey("pkcs8",U,{name:"X25519"},Hg,["deriveBits"])}function CD($){return typeof CryptoKey<"u"&&$ instanceof CryptoKey}function hL($){return $}class ED{s;transcript=[];buf=new Uint8Array(0);constructor($){this.s=$.getReader()}async readLine(){let $=[];while(!0){let U=this.buf.indexOf(10);if(U>=0)return $.push(this.buf.subarray(0,U)),this.transcript.push(this.buf.subarray(0,U+1)),this.buf=this.buf.subarray(U+1),dL(zJ($));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=zJ($),null;this.buf=J.value}}close(){return this.s.releaseLock(),{rest:this.buf,transcript:zJ(this.transcript)}}}function dL($){return $.forEach((U)=>{if(U<32||U>126)throw Error("invalid non-ASCII byte in header")}),new TextDecoder().decode($)}function zJ($){let U=$.reduce((I,Q)=>I+Q.length,0),J=new Uint8Array(U),G=0;for(let I of $)J.set(I,G),G+=I.length;return J}function GG($,...U){return $.pipeThrough(new TransformStream({start(J){for(let G of U)J.enqueue(G)}}))}function W4($){return new ReadableStream({start(U){U.enqueue($),U.close()}})}async function bD($){if(!($ instanceof ReadableStream))throw Error("readAll expects a ReadableStream<Uint8Array>");return new Uint8Array(await new Response($).arrayBuffer())}async function Kg($){if(!($ instanceof ReadableStream))throw Error("readAllString expects a ReadableStream<Uint8Array>");return await new Response($).text()}async function Ag($,U){let J=$.getReader(),G=[],I=0;while(I<U){let{done:q,value:D}=await J.read();if(q)throw Error("stream ended before reading "+U.toString()+" bytes");G.push(D),I+=D.length}J.releaseLock();let Q=zJ(G),X=Q.subarray(0,U),O=GG($,Q.subarray(U));return{data:X,rest:O}}class j0{args;body;constructor($,U){this.args=$,this.body=U}}async function nL($){let U=await $.readLine();if(U===null)throw Error("invalid stanza");let J=U.split(" ");if(J.length<2||J.shift()!=="->")return{next:U};for(let Q of J)if(Q.length===0)throw Error("invalid stanza");let G=[];for(;;){let Q=await $.readLine();if(Q===null)throw Error("invalid stanza");let X=YU.decode(Q);if(X.length>48)throw Error("invalid stanza");if(G.push(X),X.length<48)break}let I=zJ(G);return{s:new j0(J,I)}}async function Pg($){let U=new ED($),J=await U.readLine();if(J!=="age-encryption.org/v1")throw Error("invalid version "+(J??"line"));let G=[];for(;;){let{s:I,next:Q}=await nL(U);if(I!==void 0){G.push(I);continue}if(!Q.startsWith("--- "))throw Error("invalid header");let X=YU.decode(Q.slice(4)),{rest:O,transcript:q}=U.close(),D=q.slice(0,q.length-1-Q.length+3);return{stanzas:G,headerNoMAC:D,MAC:X,headerSize:q.length,rest:GG($,O)}}}function fD($){let U=[];U.push(`age-encryption.org/v1
 `);for(let J of $){U.push("-> "+J.args.join(" ")+`
 `);for(let G=0;G<J.body.length;G+=48){let I=G+48;if(I>J.body.length)I=J.body.length;U.push(YU.encode(J.body.subarray(G,I))+`
 `)}if(J.body.length%48===0)U.push(`