npm - @rizom/ops - Versions diffs - 0.2.0-alpha.297 → 0.2.0-alpha.298 - Mend

@rizom/ops 0.2.0-alpha.297 → 0.2.0-alpha.298

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

@@ -258,7 +258,7 @@ Update marker: ${U.id}.
 `),await Y0(u$($.artifactsDir,"report.md"),Gl($))}function Gl($){let U=$.report.metrics.runtime,J=$.report.metrics.health,G=U.map((O)=>O.cpuPercent).sort((O,D)=>O-D),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"}`} | ${pA(O.commitLatencyMs)} | ${pA(O.persistenceLatencyMs)} |`),"","## Runtime","",`- Samples: ${U.length}`,`- CPU p50/p95/p99/max: ${VQ(Kg(G,0.5))} / ${VQ(Kg(G,0.95))} / ${VQ(Kg(G,0.99))} / ${VQ(G.at(-1))}`,`- Memory max: ${VQ(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"}`,`- External AI calls: ${$.report.metrics.externalAiCalls??0}`,`- 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 Kg($,U){if($.length===0)return;let J=Math.max(0,Math.ceil($.length*U)-1);return $[J]}function VQ($){return $===void 0?"n/a":`${$.toFixed(2)}%`}function pA($){return $===void 0?"n/a":`${($/1000).toFixed(1)}s`}var oh,ah,th;var wD=J$(()=>{sU();Hg();BJ();YD();iA();cA();YD();oh=H.object({HCLOUD_TOKEN:H.string().min(1),KAMAL_SSH_PRIVATE_KEY:H.string().min(1),CONTENT_REPO_ADMIN_TOKEN:H.string().min(1)}),ah=H.object({servers:H.array(H.object({id:H.number().int(),status:H.string(),public_net:H.object({ipv4:H.object({ip:H.string().min(1)})})}))}),th=H.object({status:H.literal("ready"),operationalStatus:H.literal("operational"),resources:H.object({queue:H.object({totals:H.object({pending:H.number().int().nonnegative(),processing:H.number().int().nonnegative()}),byType:H.array(H.object({type:H.string(),status:H.string(),count:H.number().int().nonnegative()}))})})})});import{parseArgs as TP}from"util";function h$($){return $}class KQ extends Error{constructor($){super($);this.name="CliUsageError"}}function KP($,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 AP($){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 PP($){if(!($ instanceof Error)||!("code"in $))return!1;return $.code==="ERR_PARSE_ARGS_UNKNOWN_OPTION"||$.code==="ERR_PARSE_ARGS_INVALID_OPTION_VALUE"}function Fg($,U){let J=KP(U.commands,U.globalFlags??{}),G,I;try{({values:G,positionals:I}=TP({args:$,options:AP(J),allowPositionals:!0,strict:U.strict??!0}))}catch(X){if(PP(X))throw new KQ(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 D=G[X];if(typeof D==="string"&&O.type==="string")Q[X]=D;else if(typeof D==="boolean"&&O.type==="boolean")Q[X]=D}return{command:I[0]??"help",args:I.slice(1),flags:Q}}function ug($){let U=$.reduce((J,G)=>Math.max(J,G.label.length),0);return $.map((J)=>`  ${J.label.padEnd(U)}  ${J.description}`)}function BP($){return ug($.map((U)=>({label:U.usage?`${U.name} ${U.usage}`:U.name,description:U.description})))}function LP($,U){let J=U.type==="string"?` ${U.placeholder??"<value>"}`:"",G=U.short!==void 0?`, -${U.short}`:"";return`--${$}${J}${G}`}function xg($){return ug(Object.entries($).map(([U,J])=>({label:LP(U,J),description:J.description})))}function mg($,U){return`Usage: ${$} ${U.name}${U.usage?` ${U.usage}`:""}`}function SP($){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 CP($){let U=[],J=new Map;for(let I of $){let Q=I.flags??{};if(Object.keys(Q).length===0)continue;let X=SP(Q),O=J.get(X);if(O){O.names.push(I.name);continue}let D={names:[I.name],flags:Q};J.set(X,D),U.push(D)}let G=[];for(let I of U)G.push("",`${I.names.join(" / ")} options:`),G.push(...xg(I.flags));return G}function yg($){let U=[$.intro,"",`Usage: ${$.cliName} ${$.usage??"<command> [args]"}`,"","Commands:",...BP($.commands)];if($.globalFlags&&Object.keys($.globalFlags).length>0)U.push("","Options:",...xg($.globalFlags));return U.push(...CP($.commands)),U.join(`
-`)}function rg($){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 RU($,U){let J=$[U];return typeof J==="string"?J:void 0}function AQ($,U){let J=$[U];return typeof J==="boolean"?J:void 0}var PQ={name:"@rizom/ops",version:"0.2.0-alpha.297",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/profile":"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 wS,mkdirSync as vS,readFileSync as Oz,writeFileSync as Dz}from"fs";import{dirname as VS,join as n5}from"path";function RD($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function y$($,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=RD($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",D=G?`length=${I}`:`type=${typeof $}`,q=X+"expected Uint8Array"+O+", got "+D;if(!G)throw TypeError(q);throw RangeError(q)}return $}function F0($){if(typeof $!=="function"||typeof $.create!=="function")throw TypeError("Hash must wrapped by utils.createHasher");if(y$($.outputLen),y$($.blockLen),$.outputLen<1)throw Error('"outputLen" must be >= 1');if($.blockLen<1)throw Error('"blockLen" must be >= 1')}function uJ($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function BQ($,U){t$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw RangeError('"digestInto() output" expected to be of length >='+J)}function LQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function MU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function xJ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function I0($,U){return $<<32-U|$>>>U}function P$($,U){return $<<U|$>>>32-U>>>0}var EP=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function bP($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function fP($){for(let U=0;U<$.length;U++)$[U]=bP($[U]);return $}var MD=EP?($)=>$:fP,lg=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),kP=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function SQ($){if(t$($),lg)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=kP[$[J]];return U}var k0={_0:48,_9:57,A:65,F:70,a:97,f:102};function hg($){if($>=k0._0&&$<=k0._9)return $-k0._0;if($>=k0.A&&$<=k0.F)return $-(k0.A-10);if($>=k0.a&&$<=k0.f)return $-(k0.a-10);return}function O8($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);if(lg)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=hg($.charCodeAt(Q)),O=hg($.charCodeAt(Q+1));if(X===void 0||O===void 0){let D=$[Q]+$[Q+1];throw RangeError('hex string expected, got non-hex character "'+D+'" at index '+Q)}G[I]=X*16+O}return G}function FP($){if(typeof $!=="string")throw TypeError("string expected");return new Uint8Array(new TextEncoder().encode($))}function jD($,U=""){if(typeof $==="string")return FP($);return t$($,void 0,U)}function HD(...$){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 CQ($,U){if(U!==void 0&&{}.toString.call(U)!=="[object Object]")throw TypeError("options must be object or undefined");return Object.assign($,U)}function TD($,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 u0($=32){y$($,"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 KD=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});class AD{oHash;iHash;blockLen;outputLen;canXOF=!1;finished=!1;destroyed=!1;constructor($,U){if(F0($),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),MU(G)}update($){return uJ(this),this.iHash.update($),this}digestInto($){uJ(this),BQ($,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 v0=(()=>{let $=(U,J,G)=>new AD(U,J).update(G).digest();return $.create=(U,J)=>new AD(U,J),$})();function D8($,U,J){if(F0($),J===void 0)J=new Uint8Array($.outputLen);return v0($,J,U)}var PD=Uint8Array.of(0),dg=Uint8Array.of();function BD($,U,J,G=32){F0($),y$(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=dg;else t$(J,void 0,"info");let X=new Uint8Array(Q*I),O=v0.create($,U),D=O._cloneInto(),q=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)PD[0]=z+1,D.update(z===0?dg:q).update(J).update(PD).digestInto(q),X.set(q,I*z),O._cloneInto(D);return O.destroy(),D.destroy(),MU(q,PD),X.slice(0,G)}var GI=($,U,J,G,I)=>BD($,D8($,U,J),G,I);function ng($,U,J){return $&U^~$&J}function ig($,U,J){return $&U^$&J^U&J}class _Q{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=xJ(this.buffer)}update($){uJ(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=xJ($);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($){uJ(this),BQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,MU(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=xJ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let D=O/4,q=this.get();if(D>q.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<D;z++)X.setUint32(4*z,q[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 x0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),m0=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),e$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),s$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var EQ=BigInt(4294967295),cg=BigInt(32);function uP($,U=!1){if(U)return{h:Number($&EQ),l:Number($>>cg&EQ)};return{h:Number($>>cg&EQ)|0,l:Number($&EQ)|0}}function pg($,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}=uP($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var LD=($,U,J)=>$>>>J,SD=($,U,J)=>$<<32-J|U>>>J,lI=($,U,J)=>$>>>J|U<<32-J,dI=($,U,J)=>$<<32-J|U>>>J,q8=($,U,J)=>$<<64-J|U>>>J-32,z8=($,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 og=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),ag=($,U,J,G)=>U+J+G+($/4294967296|0)|0,tg=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),eg=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,sg=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),$7=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var mP=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]),QI=new Uint32Array(64);class CD extends _Q{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)QI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=QI[z-15],w=QI[z-2],v=I0(W,7)^I0(W,18)^W>>>3,g=I0(w,17)^I0(w,19)^w>>>10;QI[z]=g+QI[z-7]+v+QI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:D,H:q}=this;for(let z=0;z<64;z++){let W=I0(X,6)^I0(X,11)^I0(X,25),w=q+W+ng(X,O,D)+mP[z]+QI[z]|0,g=(I0(J,2)^I0(J,13)^I0(J,22))+ig(J,G,I)|0;q=D,D=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+g|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,D=D+this.G|0,q=q+this.H|0,this.set(J,G,I,Q,X,O,D,q)}roundClean(){MU(QI)}destroy(){this.destroyed=!0,this.set(0,0,0,0,0,0,0,0),MU(this.buffer)}}class U7 extends CD{A=x0[0]|0;B=x0[1]|0;C=x0[2]|0;D=x0[3]|0;E=x0[4]|0;F=x0[5]|0;G=x0[6]|0;H=x0[7]|0;constructor(){super(32)}}class yP extends CD{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(28)}}var I7=(()=>pg(["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($))))(),rP=(()=>I7[0])(),hP=(()=>I7[1])(),XI=new Uint32Array(80),OI=new Uint32Array(80);class Y8 extends _Q{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:D,El:q,Fh:z,Fl:W,Gh:w,Gl:v,Hh:g,Hl:V}=this;return[$,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,V]}set($,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,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=D|0,this.El=q|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=v|0,this.Hh=g|0,this.Hl=V|0}process($,U){for(let M=0;M<16;M++,U+=4)XI[M]=$.getUint32(U),OI[M]=$.getUint32(U+=4);for(let M=16;M<80;M++){let S=XI[M-15]|0,L=OI[M-15]|0,k=lI(S,L,1)^lI(S,L,8)^LD(S,L,7),x=dI(S,L,1)^dI(S,L,8)^SD(S,L,7),h=XI[M-2]|0,B=OI[M-2]|0,m=lI(h,B,19)^q8(h,B,61)^LD(h,B,6),a=dI(h,B,19)^z8(h,B,61)^SD(h,B,6),_=tg(x,a,OI[M-7],OI[M-16]),A=eg(_,k,m,XI[M-7],XI[M-16]);XI[M]=A|0,OI[M]=_|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:D,Dl:q,Eh:z,El:W,Fh:w,Fl:v,Gh:g,Gl:V,Hh:N,Hl:j}=this;for(let M=0;M<80;M++){let S=lI(z,W,14)^lI(z,W,18)^q8(z,W,41),L=dI(z,W,14)^dI(z,W,18)^z8(z,W,41),k=z&w^~z&g,x=W&v^~W&V,h=sg(j,L,x,hP[M],OI[M]),B=$7(h,N,S,k,rP[M],XI[M]),m=h|0,a=lI(J,G,28)^q8(J,G,34)^q8(J,G,39),_=dI(J,G,28)^z8(J,G,34)^z8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=g|0,j=V|0,g=w|0,V=v|0,w=z|0,v=W|0,{h:z,l:W}=V0(D|0,q|0,B|0,m|0),D=X|0,q=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let R=og(m,_,E);J=ag(R,B,a,A),G=R|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:D,l:q}=V0(this.Dh|0,this.Dl|0,D|0,q|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:g,l:V}=V0(this.Gh|0,this.Gl|0,g|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,D,q,z,W,w,v,g,V,N,j)}roundClean(){MU(XI,OI)}destroy(){this.destroyed=!0,MU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class J7 extends Y8{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(64)}}class lP extends Y8{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(48)}}var zU=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),YU=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class dP extends Y8{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(28)}}class nP extends Y8{Ah=YU[0]|0;Al=YU[1]|0;Bh=YU[2]|0;Bl=YU[3]|0;Ch=YU[4]|0;Cl=YU[5]|0;Dh=YU[6]|0;Dl=YU[7]|0;Eh=YU[8]|0;El=YU[9]|0;Fh=YU[10]|0;Fl=YU[11]|0;Gh=YU[12]|0;Gl=YU[13]|0;Hh=YU[14]|0;Hl=YU[15]|0;constructor(){super(32)}}var r$=TD(()=>new U7,KD(1));var bQ=TD(()=>new J7,KD(3));/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function xQ($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function bD($){if(!xQ($))throw TypeError("Uint8Array expected")}function D7($,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 q7($){if(typeof $!=="function")throw TypeError("function expected");return!0}function DI($,U){if(typeof U!=="string")throw TypeError(`${$}: string expected`);return!0}function w8($){if(typeof $!=="number")throw TypeError(`number expected, got ${typeof $}`);if(!Number.isSafeInteger($))throw RangeError(`invalid integer: ${$}`)}function kQ($){if(!Array.isArray($))throw TypeError("array expected")}function FQ($,U){if(!D7(!0,U))throw TypeError(`${$}: array of strings expected`)}function fD($,U){if(!D7(!1,U))throw TypeError(`${$}: array of numbers expected`)}function xU(...$){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 mU($){let U=typeof $==="string"?$.split(""):$,J=U.length;FQ("alphabet",U);let G=new Map(U.map((I,Q)=>[I,Q]));return{encode:(I)=>{return kQ(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 kQ(I),I.map((Q)=>{DI("alphabet.decode",Q);let X=G.get(Q);if(X===void 0)throw Error(`Unknown letter: "${Q}". Allowed: ${$}`);return X})}}}function yU($=""){return DI("join",$),{encode:(U)=>{return FQ("join.decode",U),U.join($)},decode:(U)=>{return DI("join.decode",U),U.split($)}}}function mQ($,U="="){return w8($),DI("padding",U),{encode(J){FQ("padding.encode",J);while(J.length*$%8)J.push(U);return J},decode(J){FQ("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 z7($){return q7($),{encode:(U)=>U,decode:(U)=>$(U)}}function G7($,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(kQ($),!$.length)return[];let G=0,I=[],Q=Array.from($,(O)=>{if(w8(O),O<0||O>=U)throw Error(`invalid integer: ${O}`);return O}),X=Q.length;while(!0){let O=0,D=!0;for(let q=G;q<X;q++){let z=Q[q],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 g=Math.floor(v);if(Q[q]=g,!Number.isSafeInteger(g)||g*J+O!==w)throw Error("convertRadix: carry overflow");if(!D)continue;else if(!g)G=q;else D=!1}if(I.push(O),D)break}for(let O=0;O<$.length-1&&$[O]===0;O++)I.push(0);return I.reverse()}var Y7=($,U)=>U===0?$:Y7(U,$%U),uQ=($,U)=>$+(U-Y7($,U)),fQ=(()=>{let $=[];for(let U=0;U<40;U++)$.push(2**U);return $})();function _D($,U,J,G){if(kQ($),U<=0||U>32)throw RangeError(`convertRadix2: wrong from=${U}`);if(J<=0||J>32)throw RangeError(`convertRadix2: wrong to=${J}`);if(uQ(U,J)>32)throw Error(`convertRadix2: carry overflow from=${U} to=${J} carryBits=${uQ(U,J)}`);let I=0,Q=0,X=fQ[U],O=fQ[J]-1,D=[];for(let q of $){if(w8(q),q>=X)throw Error(`convertRadix2: invalid data word=${q} from=${U}`);if(I=I<<U|q,Q+U>32)throw Error(`convertRadix2: carry overflow pos=${Q} from=${U}`);Q+=U;for(;Q>=J;Q-=J)D.push((I>>Q-J&O)>>>0);let z=fQ[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)D.push(I>>>0);return D}function iP($){w8($);let U=256;return{encode:(J)=>{if(!xQ(J))throw TypeError("radix.encode input should be Uint8Array");return G7(Array.from(J),U,$)},decode:(J)=>{return fD("radix.decode",J),Uint8Array.from(G7(J,$,U))}}}function iU($,U=!1){if(w8($),$<=0||$>32)throw RangeError("radix2: bits should be in (0..32]");if(uQ(8,$)>32||uQ($,8)>32)throw RangeError("radix2: carry overflow");return{encode:(J)=>{if(!xQ(J))throw TypeError("radix2.encode input should be Uint8Array");return _D(Array.from(J),8,$,!U)},decode:(J)=>{return fD("radix2.decode",J),Uint8Array.from(_D(J,$,8,U))}}}function Q7($){return q7($),function(...U){try{return $.apply(null,U)}catch(J){}}}var Tl=Object.freeze(xU(iU(4),mU("0123456789ABCDEF"),yU(""))),Kl=Object.freeze(xU(iU(5),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),mQ(5),yU(""))),Al=Object.freeze(xU(iU(5),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),yU(""))),Pl=Object.freeze(xU(iU(5),mU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),mQ(5),yU(""))),Bl=Object.freeze(xU(iU(5),mU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),yU(""))),Ll=Object.freeze(xU(iU(5),mU("0123456789ABCDEFGHJKMNPQRSTVWXYZ"),yU(""),z7(($)=>$.toUpperCase().replace(/O/g,"0").replace(/[IL]/g,"1")))),W7=(()=>typeof Uint8Array.from([]).toBase64==="function"&&typeof Uint8Array.fromBase64==="function")(),cP=/[\t\n\f\r ]/,w7=($,U)=>{DI("base64",$);let J=U?"base64url":"base64";if($.length>0&&cP.test($))throw Error("invalid base64");return Uint8Array.fromBase64($,{alphabet:J,lastChunkHandling:"strict"})},kD=Object.freeze(W7?{encode($){return bD($),$.toBase64()},decode($){return w7($,!1)}}:xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),mQ(6),yU(""))),WU=Object.freeze(xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),yU(""))),Sl=Object.freeze(W7?{encode($){return bD($),$.toBase64({alphabet:"base64url"})},decode($){return w7($,!0)}}:xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),mQ(6),yU(""))),Cl=Object.freeze(xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),yU(""))),FD=($)=>xU(iP(58),mU($),yU("")),_l=Object.freeze(FD("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz")),El=Object.freeze(FD("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ")),bl=Object.freeze(FD("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz"));var ED=xU(mU("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),yU("")),X7=[996825010,642813549,513874426,1027748829,705979059];function W8($){let U=$>>25,J=($&33554431)<<5;for(let G=0;G<X7.length;G++)if((U>>G&1)===1)J^=X7[G];return J}function O7($,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=W8(I)^X>>5}I=W8(I);for(let Q=0;Q<G;Q++)I=W8(I)^$.charCodeAt(Q)&31;for(let Q of U)I=W8(I)^Q;for(let Q=0;Q<6;Q++)I=W8(I);return I^=J,ED.encode(_D([I%fQ[30]],30,5,!1))}function v7($){let U=$==="bech32"?1:734539939,J=iU(5),G=J.decode,I=J.encode,Q=Q7(G);function X(W,w,v=90){if(DI("bech32.encode prefix",W),xQ(w))w=Array.from(w);fD("bech32.encode",w);let g=W.length;if(g===0)throw TypeError(`Invalid prefix length ${g}`);let V=g+7+w.length;if(v!==!1&&V>v)throw TypeError(`Length ${V} exceeds limit ${v}`);let N=W.toLowerCase(),j=O7(N,w,U);return`${N}1${ED.encode(w)}${j}`}function O(W,w=90){DI("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 g=W.toLowerCase();if(W!==g&&W!==W.toUpperCase())throw Error("String must be lowercase or uppercase");let V=g.lastIndexOf("1");if(V===0||V===-1)throw Error('Letter "1" must be present between prefix and data only');let N=g.slice(0,V),j=g.slice(V+1);if(j.length<6)throw Error("Data must be at least 6 characters long");let M=ED.decode(j).slice(0,-6),S=O7(N,M,U);if(!j.endsWith(S))throw Error(`Invalid checksum in ${W}: expected "${S}"`);return{prefix:N,words:M}}let D=Q7(O);function q(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:q,decodeUnsafe:D,fromWords:G,fromWordsUnsafe:Q,toWords:I}}var rU=Object.freeze(v7("bech32")),fl=Object.freeze(v7("bech32m"));var pP=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),oP={encode($){return bD($),$.toHex()},decode($){return DI("hex",$),Uint8Array.fromHex($)}},kl=Object.freeze(pP?oP:xU(iU(4),mU("0123456789abcdef"),yU(""),z7(($)=>{if(typeof $!=="string"||$.length%2!==0)throw TypeError(`hex.decode: expected string, got ${typeof $} with length ${$.length}`);return $.toLowerCase()})));function tP($,U,J,G){F0($);let I=CQ({dkLen:32,asyncTick:10},G),{c:Q,dkLen:X,asyncTick:O}=I;if(y$(Q,"c"),y$(X,"dkLen"),y$(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 D=jD(U,"password"),q=jD(J,"salt"),z=new Uint8Array(X),W=v0.create($,D),w=W._cloneInto().update(q);return{c:Q,dkLen:X,asyncTick:O,DK:z,PRF:W,PRFSalt:w}}function eP($,U,J,G,I){if($.destroy(),U.destroy(),G)G.destroy();return MU(I),J}function uD($,U,J,G){let{c:I,dkLen:Q,DK:X,PRF:O,PRFSalt:D}=tP($,U,J,G),q,z=new Uint8Array(4),W=xJ(z),w=new Uint8Array(O.outputLen);for(let v=1,g=0;g<Q;v++,g+=O.outputLen){let V=X.subarray(g,g+O.outputLen);W.setInt32(0,v,!1),(q=D._cloneInto(q)).update(z).digestInto(w),V.set(w.subarray(0,V.length));for(let N=1;N<I;N++){O._cloneInto(q).update(w).digestInto(w);for(let j=0;j<V.length;j++)V[j]^=w[j]}}return eP(O,D,X,q,w)}function V7($,U,J,G,I,Q){let X=$[U++]^J[G++],O=$[U++]^J[G++],D=$[U++]^J[G++],q=$[U++]^J[G++],z=$[U++]^J[G++],W=$[U++]^J[G++],w=$[U++]^J[G++],v=$[U++]^J[G++],g=$[U++]^J[G++],V=$[U++]^J[G++],N=$[U++]^J[G++],j=$[U++]^J[G++],M=$[U++]^J[G++],S=$[U++]^J[G++],L=$[U++]^J[G++],k=$[U++]^J[G++],x=X,h=O,B=D,m=q,a=z,_=W,A=w,E=v,R=g,K=V,T=N,b=j,P=M,F=S,y=L,n=k;for(let $$=0;$$<8;$$+=2)a^=P$(x+P|0,7),R^=P$(a+x|0,9),P^=P$(R+a|0,13),x^=P$(P+R|0,18),K^=P$(_+h|0,7),F^=P$(K+_|0,9),h^=P$(F+K|0,13),_^=P$(h+F|0,18),y^=P$(T+A|0,7),B^=P$(y+T|0,9),A^=P$(B+y|0,13),T^=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$(_+a|0,7),E^=P$(A+_|0,9),a^=P$(E+A|0,13),_^=P$(a+E|0,18),b^=P$(T+K|0,7),R^=P$(b+T|0,9),K^=P$(R+b|0,13),T^=P$(K+R|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++]=D+B|0,I[Q++]=q+m|0,I[Q++]=z+a|0,I[Q++]=W+_|0,I[Q++]=w+A|0,I[Q++]=v+E|0,I[Q++]=g+R|0,I[Q++]=V+K|0,I[Q++]=N+T|0,I[Q++]=j+b|0,I[Q++]=M+P|0,I[Q++]=S+F|0,I[Q++]=L+y|0,I[Q++]=k+n|0}function xD($,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(V7(J,X,$,U,J,Q),O>0)X+=16;V7(J,Q,$,U+=16,J,X)}}function sP($,U,J){let G=CQ({dkLen:32,asyncTick:10,maxmem:1073742848},J),{N:I,r:Q,p:X,dkLen:O,asyncTick:D,maxmem:q,onProgress:z}=G;if(y$(I,"N"),y$(Q,"r"),y$(X,"p"),y$(O,"dkLen"),y$(D,"asyncTick"),y$(q,"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 g=W*(I+X+1);if(g>q)throw Error('"maxmem" limit was hit: memUsed(128*r*(N+p+1))='+g+", maxmem="+q);let V=uD(r$,$,U,{c:1,dkLen:W*X}),N=LQ(V),j=LQ(new Uint8Array(W*I)),M=LQ(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:M,blockMixCb:S,asyncTick:D}}function $B($,U,J,G,I){let Q=uD(r$,$,J,{c:1,dkLen:U});return MU(J,G,I),Q}function mD($,U,J){let{N:G,r:I,p:Q,dkLen:X,blockSize32:O,V:D,B32:q,B:z,tmp:W,blockMixCb:w}=sP($,U,J);MD(q);for(let v=0;v<Q;v++){let g=O*v;for(let V=0;V<O;V++)D[V]=q[g+V];for(let V=0,N=0;V<G-1;V++)xD(D,N,D,N+=O,I),w();xD(D,(G-1)*O,q,g,I),w();for(let V=0;V<G;V++){let N=(q[g+O-16]&G-1)>>>0;for(let j=0;j<O;j++)W[j]=q[g+j]^D[N*O+j];xD(W,0,q,g,I),w()}}return MD(q),$B($,X,z,D,W)}/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */function UB($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function yQ($){if(typeof $!=="boolean")throw TypeError(`boolean expected, not ${$}`)}function mJ($){if(typeof $!=="number")throw TypeError("number expected, got "+typeof $);if(!Number.isSafeInteger($)||$<0)throw RangeError("positive integer expected, got "+$)}function n$($,U,J=""){let G=UB($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",D=G?`length=${I}`:`type=${typeof $}`,q=X+"expected Uint8Array"+O+", got "+D;if(!G)throw TypeError(q);throw RangeError(q)}return $}function yD($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function N7($,U,J=!1){n$($,void 0,"output");let G=U.outputLen;if($.length<G)throw RangeError("digestInto() expects output buffer of length at least "+G);if(J&&!yJ($))throw Error("invalid output, must be aligned")}function N0($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function J0(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function IB($){return new DataView($.buffer,$.byteOffset,$.byteLength)}var nI=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)(),JB=($)=>$<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255;var GB=($)=>{for(let U=0;U<$.length;U++)$[U]=JB($[U]);return $},y0=nI?($)=>$:GB;function g7($,U){if(U==null||typeof U!=="object")throw Error("options must be defined");return Object.assign($,U)}function Z7($,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 R7($,U,J){let G=U,I=J||(()=>[]),Q=(O,D)=>G(D,...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,...D)=>G(O,...D),Q}var M7=($,U)=>{function J(G,...I){if(n$(G,void 0,"key"),$.nonceLength!==void 0){let z=I[0];n$(z,$.varSizeNonce?void 0:$.nonceLength,"nonce")}let Q=$.tagLength;if(Q&&I[1]!==void 0)n$(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");n$(W,void 0,"output")}},D=!1;return{encrypt(z,W){if(D)throw Error("cannot encrypt() twice with same key + nonce");return D=!0,n$(z),O(X.encrypt.length,W),X.encrypt(z,W)},decrypt(z,W){if(n$(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 v8($,U,J=!0){if(U===void 0)return new Uint8Array($);if(n$(U,void 0,"output"),U.length!==$)throw Error('"output" expected Uint8Array of length '+$+", got: "+U.length);if(J&&!yJ(U))throw Error("invalid output, must be aligned");return U}function j7($,U,J){mJ($),mJ(U),yQ(J);let G=new Uint8Array(16),I=IB(G);return I.setBigUint64(0,BigInt(U),J),I.setBigUint64(8,BigInt($),J),G}function yJ($){return $.byteOffset%4===0}function rJ($){return Uint8Array.from(n$($))}var T7=($)=>Uint8Array.from($.split(""),(U)=>U.charCodeAt(0)),QB=(()=>y0(N0(T7("expand 16-byte k"))))(),XB=(()=>y0(N0(T7("expand 32-byte k"))))();function B$($,U){return $<<U|$>>>32-U}var V8=64,OB=16,rD=(()=>4294967295)(),H7=Uint32Array.of();function DB($,U,J,G,I,Q,X,O){let D=I.length,q=new Uint8Array(V8),z=N0(q),W=nI&&yJ(I)&&yJ(Q),w=W?N0(I):H7,v=W?N0(Q):H7;if(!nI){for(let g=0;g<D;X++){if($(U,J,G,z,X,O),y0(z),X>=rD)throw Error("arx: counter overflow");let V=Math.min(V8,D-g);for(let N=0,j;N<V;N++)j=g+N,Q[j]=I[j]^q[N];g+=V}return}for(let g=0;g<D;X++){if($(U,J,G,z,X,O),X>=rD)throw Error("arx: counter overflow");let V=Math.min(V8,D-g);if(W&&V===V8){let N=g/4;if(g%4!==0)throw Error("arx: invalid block position");for(let j=0,M;j<OB;j++)M=N+j,v[M]=w[M]^z[j];g+=V8;continue}for(let N=0,j;N<V;N++)j=g+N,Q[j]=I[j]^q[N];g+=V}}function K7($,U){let{allowShortKeys:J,extendNonceFn:G,counterLength:I,counterRight:Q,rounds:X}=g7({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},U);if(typeof $!=="function")throw Error("core must be a function");return mJ(I),mJ(X),yQ(Q),yQ(J),(O,D,q,z,W=0)=>{n$(O,void 0,"key"),n$(D,void 0,"nonce"),n$(q,void 0,"data");let w=q.length;if(z=v8(w,z,!1),mJ(W),W<0||W>=rD)throw Error("arx: counter overflow");let v=[],g=O.length,V,N;if(g===32)v.push(V=rJ(O)),N=XB;else if(g===16&&J)V=new Uint8Array(32),V.set(O),V.set(O,16),N=QB,v.push(V);else throw n$(O,32,"arx key"),Error("invalid key size");if(!nI||!yJ(D))v.push(D=rJ(D));let j=N0(V);if(G){if(D.length!==24)throw Error("arx: extended nonce must be 24 bytes");let L=D.subarray(0,16);if(nI)G(N,j,N0(L),j);else{let k=y0(Uint32Array.from(N));G(k,j,N0(L),j),J0(k),y0(j)}D=D.subarray(16)}else if(!nI)y0(j);let M=16-I;if(M!==D.length)throw Error(`arx: nonce must be ${M} or 16 bytes`);if(M!==12){let L=new Uint8Array(12);L.set(D,Q?0:12-D.length),D=L,v.push(D)}let S=y0(N0(D));try{return DB($,N,j,S,q,z,W,X),z}finally{J0(...v)}}}function $U($,U){return $[U++]&255|($[U++]&255)<<8}class A7{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($){$=rJ(n$($,32,"key"));let U=$U($,0),J=$U($,2),G=$U($,4),I=$U($,6),Q=$U($,8),X=$U($,10),O=$U($,12),D=$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|D<<8)&8191,this.r[9]=D>>>5&127;for(let q=0;q<8;q++)this.pad[q]=$U($,16+2*q)}process($,U,J=!1){let G=J?0:2048,{h:I,r:Q}=this,X=Q[0],O=Q[1],D=Q[2],q=Q[3],z=Q[4],W=Q[5],w=Q[6],v=Q[7],g=Q[8],V=Q[9],N=$U($,U+0),j=$U($,U+2),M=$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|M<<6)&8191),_=I[3]+((M>>>7|S<<9)&8191),A=I[4]+((S>>>4|L<<12)&8191),E=I[5]+(L>>>1&8191),R=I[6]+((L>>>14|k<<2)&8191),K=I[7]+((k>>>11|x<<5)&8191),T=I[8]+((x>>>8|h<<8)&8191),b=I[9]+(h>>>5|G),P=0,F=P+B*X+m*(5*V)+a*(5*g)+_*(5*v)+A*(5*w);P=F>>>13,F&=8191,F+=E*(5*W)+R*(5*z)+K*(5*q)+T*(5*D)+b*(5*O),P+=F>>>13,F&=8191;let y=P+B*O+m*X+a*(5*V)+_*(5*g)+A*(5*v);P=y>>>13,y&=8191,y+=E*(5*w)+R*(5*W)+K*(5*z)+T*(5*q)+b*(5*D),P+=y>>>13,y&=8191;let n=P+B*D+m*O+a*X+_*(5*V)+A*(5*g);P=n>>>13,n&=8191,n+=E*(5*v)+R*(5*w)+K*(5*W)+T*(5*z)+b*(5*q),P+=n>>>13,n&=8191;let $$=P+B*q+m*D+a*O+_*X+A*(5*V);P=$$>>>13,$$&=8191,$$+=E*(5*g)+R*(5*v)+K*(5*w)+T*(5*W)+b*(5*z),P+=$$>>>13,$$&=8191;let X$=P+B*z+m*q+a*D+_*O+A*X;P=X$>>>13,X$&=8191,X$+=E*(5*V)+R*(5*g)+K*(5*v)+T*(5*w)+b*(5*W),P+=X$>>>13,X$&=8191;let D$=P+B*W+m*z+a*q+_*D+A*O;P=D$>>>13,D$&=8191,D$+=E*X+R*(5*V)+K*(5*g)+T*(5*v)+b*(5*w),P+=D$>>>13,D$&=8191;let W$=P+B*w+m*W+a*z+_*q+A*D;P=W$>>>13,W$&=8191,W$+=E*O+R*X+K*(5*V)+T*(5*g)+b*(5*v),P+=W$>>>13,W$&=8191;let N$=P+B*v+m*w+a*W+_*z+A*q;P=N$>>>13,N$&=8191,N$+=E*D+R*O+K*X+T*(5*V)+b*(5*g),P+=N$>>>13,N$&=8191;let v$=P+B*g+m*v+a*w+_*W+A*z;P=v$>>>13,v$&=8191,v$+=E*q+R*D+K*O+T*X+b*(5*V),P+=v$>>>13,v$&=8191;let V$=P+B*V+m*g+a*v+_*w+A*W;P=V$>>>13,V$&=8191,V$+=E*z+R*q+K*D+T*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]=D$,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;J0(J)}update($){yD(this),n$($),$=rJ($);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,J0(this.h,this.r,this.buffer,this.pad)}digestInto($){yD(this),N7($,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 P7=R7(32,($)=>new A7($));function qB($,U,J,G,I,Q=20){let X=$[0],O=$[1],D=$[2],q=$[3],z=U[0],W=U[1],w=U[2],v=U[3],g=U[4],V=U[5],N=U[6],j=U[7],M=I,S=J[0],L=J[1],k=J[2],x=X,h=O,B=D,m=q,a=z,_=W,A=w,E=v,R=g,K=V,T=N,b=j,P=M,F=S,y=L,n=k;for(let X$=0;X$<Q;X$+=2)x=x+a|0,P=B$(P^x,16),R=R+P|0,a=B$(a^R,12),x=x+a|0,P=B$(P^x,8),R=R+P|0,a=B$(a^R,7),h=h+_|0,F=B$(F^h,16),K=K+F|0,_=B$(_^K,12),h=h+_|0,F=B$(F^h,8),K=K+F|0,_=B$(_^K,7),B=B+A|0,y=B$(y^B,16),T=T+y|0,A=B$(A^T,12),B=B+A|0,y=B$(y^B,8),T=T+y|0,A=B$(A^T,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+_|0,n=B$(n^x,16),T=T+n|0,_=B$(_^T,12),x=x+_|0,n=B$(n^x,8),T=T+n|0,_=B$(_^T,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),R=R+F|0,E=B$(E^R,12),B=B+E|0,F=B$(F^B,8),R=R+F|0,E=B$(E^R,7),m=m+a|0,y=B$(y^m,16),K=K+y|0,a=B$(a^K,12),m=m+a|0,y=B$(y^m,8),K=K+y|0,a=B$(a^K,7);let $$=0;G[$$++]=X+x|0,G[$$++]=O+h|0,G[$$++]=D+B|0,G[$$++]=q+m|0,G[$$++]=z+a|0,G[$$++]=W+_|0,G[$$++]=w+A|0,G[$$++]=v+E|0,G[$$++]=g+R|0,G[$$++]=V+K|0,G[$$++]=N+T|0,G[$$++]=j+b|0,G[$$++]=M+P|0,G[$$++]=S+F|0,G[$$++]=L+y|0,G[$$++]=k+n|0}var zB=K7(qB,{counterRight:!1,counterLength:4,allowShortKeys:!1});var YB=new Uint8Array(16),B7=($,U)=>{$.update(U);let J=U.length%16;if(J)$.update(YB.subarray(J))},WB=new Uint8Array(32);function L7($,U,J,G,I){if(I!==void 0)n$(I,void 0,"AAD");let Q=$(U,J,WB),X=j7(G.length,I?I.length:0,!0),O=P7.create(Q);if(I)B7(O,I);B7(O,G),O.update(X);let D=O.digest();return J0(Q,X),D}var wB=($)=>(U,J,G)=>{return{encrypt(Q,X){let O=Q.length;X=v8(O+16,X,!1),X.set(Q);let D=X.subarray(0,-16);$(U,J,D,D,1);let q=L7($,U,J,D,G);return X.set(q,O),J0(q),X},decrypt(Q,X){X=v8(Q.length-16,X,!1);let O=Q.subarray(0,-16),D=Q.subarray(-16),q=L7($,U,J,O,G);if(!Z7(D,q))throw J0(q),Error("invalid tag");return X.set(Q.subarray(0,-16)),$(U,J,X,X,1),J0(q),X}}},cU=M7({blockSize:64,nonceLength:12,tagLength:16},wB(zB));/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function hJ($){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 Z$($,U,J=""){let G=hJ($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",D=G?`length=${I}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+O+", got "+D)}return $}function pU($){if(typeof $!=="function"||typeof $.create!=="function")throw Error("Hash must wrapped by utils.createHasher");p$($.outputLen),p$($.blockLen)}function h0($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function rQ($,U){Z$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw Error('"digestInto() output" expected to be of length >='+J)}function hQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function CU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function lQ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function G0($,U){return $<<32-U|$>>>U}var vB=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function VB($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function NB($){for(let U=0;U<$.length;U++)$[U]=VB($[U]);return $}var hD=vB?($)=>$:NB,C7=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),gB=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function iI($){if(Z$($),C7)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=gB[$[J]];return U}var r0={_0:48,_9:57,A:65,F:70,a:97,f:102};function S7($){if($>=r0._0&&$<=r0._9)return $-r0._0;if($>=r0.A&&$<=r0.F)return $-(r0.A-10);if($>=r0.a&&$<=r0.f)return $-(r0.a-10);return}function cI($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(C7)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=S7($.charCodeAt(Q)),O=S7($.charCodeAt(Q+1));if(X===void 0||O===void 0){let D=$[Q]+$[Q+1];throw Error('hex string expected, got non-hex character "'+D+'" at index '+Q)}G[I]=X*16+O}return G}function l$(...$){let U=0;for(let G=0;G<$.length;G++){let I=$[G];Z$(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 lJ($,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 qI($=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 zI=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var dD=BigInt(0),lD=BigInt(1);function N8($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw Error(J+"expected boolean, got type="+typeof $)}return $}function _7($){if(typeof $==="bigint"){if(!dQ($))throw Error("positive bigint expected, got "+$)}else p$($);return $}function g8($){let U=_7($).toString(16);return U.length&1?"0"+U:U}function E7($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?dD:BigInt("0x"+$)}function YI($){return E7(iI($))}function WI($){return E7(iI(nQ(Z$($)).reverse()))}function dJ($,U){p$(U),$=_7($);let J=cI($.toString(16).padStart(U*2,"0"));if(J.length!==U)throw Error("number too large");return J}function Z8($,U){return dJ($,U).reverse()}function nQ($){return Uint8Array.from($)}function wI($){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 dQ=($)=>typeof $==="bigint"&&dD<=$;function ZB($,U,J){return dQ($)&&dQ(U)&&dQ(J)&&U<=$&&$<J}function R8($,U,J,G){if(!ZB(U,J,G))throw Error("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function nD($){let U;for(U=0;$>dD;$>>=lD,U+=1);return U}var M8=($)=>(lD<<BigInt($))-lD;function b7($,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,D=G($),q=G($),z=0,W=()=>{D.fill(1),q.fill(0),z=0},w=(...N)=>J(q,l$(D,...N)),v=(N=I)=>{if(q=w(Q,N),D=w(),N.length===0)return;q=w(X,N),D=w()},g=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){D=w();let M=D.slice();j.push(M),N+=D.length}return l$(...j)};return(N,j)=>{W(),v(N);let M=void 0;while(!(M=j(g())))v();return W(),M}}function pI($,U={},J={}){if(!$||typeof $!=="object")throw Error("expected valid options object");function G(Q,X,O){let D=$[Q];if(O&&D===void 0)return;let q=typeof D;if(q!==X||D===null)throw Error(`param "${Q}" is invalid: expected ${X}, got ${q}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,D])=>G(O,D,X));I(U,!1),I(J,!0)}function iD($){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 HU=BigInt(0),wU=BigInt(1),oI=BigInt(2),F7=BigInt(3),u7=BigInt(4),x7=BigInt(5),RB=BigInt(7),m7=BigInt(8),MB=BigInt(9),y7=BigInt(16);function jU($,U){let J=$%U;return J>=HU?J:U+J}function oU($,U,J){let G=$;while(U-- >HU)G*=G,G%=J;return G}function f7($,U){if($===HU)throw Error("invert: expected non-zero number");if(U<=HU)throw Error("invert: expected positive modulus, got "+U);let J=jU($,U),G=U,I=HU,Q=wU,X=wU,O=HU;while(J!==HU){let q=G/J,z=G%J,W=I-X*q,w=Q-O*q;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==wU)throw Error("invert: does not exist");return jU(I,U)}function cD($,U,J){if(!$.eql($.sqr(U),J))throw Error("Cannot find square root")}function r7($,U){let J=($.ORDER+wU)/u7,G=$.pow(U,J);return cD($,G,U),G}function jB($,U){let J=($.ORDER-x7)/m7,G=$.mul(U,oI),I=$.pow(G,J),Q=$.mul(U,I),X=$.mul($.mul(Q,oI),I),O=$.mul(Q,$.sub(X,$.ONE));return cD($,O,U),O}function HB($){let U=iQ($),J=h7($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+RB)/y7;return(O,D)=>{let q=O.pow(D,X),z=O.mul(q,G),W=O.mul(q,I),w=O.mul(q,Q),v=O.eql(O.sqr(z),D),g=O.eql(O.sqr(W),D);q=O.cmov(q,z,v),z=O.cmov(w,W,g);let V=O.eql(O.sqr(z),D),N=O.cmov(q,z,V);return cD(O,N,D),N}}function h7($){if($<F7)throw Error("sqrt is not defined for small field");let U=$-wU,J=0;while(U%oI===HU)U/=oI,J++;let G=oI,I=iQ($);while(k7(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return r7;let Q=I.pow(G,U),X=(U+wU)/oI;return function(D,q){if(D.is0(q))return q;if(k7(D,q)!==1)throw Error("Cannot find square root");let z=J,W=D.mul(D.ONE,Q),w=D.pow(q,U),v=D.pow(q,X);while(!D.eql(w,D.ONE)){if(D.is0(w))return D.ZERO;let g=1,V=D.sqr(w);while(!D.eql(V,D.ONE))if(g++,V=D.sqr(V),g===z)throw Error("Cannot find square root");let N=wU<<BigInt(z-g-1),j=D.pow(W,N);z=g,W=D.sqr(j),w=D.mul(w,W),v=D.mul(v,j)}return v}}function TB($){if($%u7===F7)return r7;if($%m7===x7)return jB;if($%y7===MB)return HB($);return h7($)}var KB=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function pD($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=KB.reduce((G,I)=>{return G[I]="function",G},U);return pI($,J),$}function AB($,U,J){if(J<HU)throw Error("invalid exponent, negatives unsupported");if(J===HU)return $.ONE;if(J===wU)return U;let G=$.ONE,I=U;while(J>HU){if(J&wU)G=$.mul(G,I);I=$.sqr(I),J>>=wU}return G}function j8($,U,J=!1){let G=Array(U.length).fill(J?$.ZERO:void 0),I=U.reduce((X,O,D)=>{if($.is0(O))return X;return G[D]=X,$.mul(X,O)},$.ONE),Q=$.inv(I);return U.reduceRight((X,O,D)=>{if($.is0(O))return X;return G[D]=$.mul(X,G[D]),$.mul(X,O)},Q),G}function k7($,U){let J=($.ORDER-wU)/oI,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 PB($,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 l7{ORDER;BITS;BYTES;isLE;ZERO=HU;ONE=wU;_lengths;_sqrt;_mod;constructor($,U={}){if($<=HU)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}=PB($,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 jU($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof $);return HU<=$&&$<this.ORDER}is0($){return $===HU}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&wU)===wU}neg($){return jU(-$,this.ORDER)}eql($,U){return $===U}sqr($){return jU($*$,this.ORDER)}add($,U){return jU($+U,this.ORDER)}sub($,U){return jU($-U,this.ORDER)}mul($,U){return jU($*U,this.ORDER)}pow($,U){return AB(this,$,U)}div($,U){return jU($*f7(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return f7($,this.ORDER)}sqrt($){if(!this._sqrt)this._sqrt=TB(this.ORDER);return this._sqrt(this,$)}toBytes($){return this.isLE?Z8($,this.BYTES):dJ($,this.BYTES)}fromBytes($,U=!1){Z$($);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 D=new Uint8Array(G);D.set($,I?0:D.length-$.length),$=D}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?WI($):YI($);if(X)O=jU(O,Q);if(!U){if(!this.isValid(O))throw Error("invalid field element: outside of range 0..ORDER")}return O}invertBatch($){return j8(this,$)}cmov($,U,J){return J?U:$}}function iQ($,U={}){return new l7($,U)}function d7($){if(typeof $!=="bigint")throw Error("field order must be bigint");let U=$.toString(2).length;return Math.ceil(U/8)}function oD($){let U=d7($);return U+Math.ceil(U/2)}function n7($,U,J=!1){Z$($);let G=$.length,I=d7(U),Q=oD(U);if(G<16||G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?WI($):YI($),O=jU(X,U-wU)+wU;return J?Z8(O,I):dJ(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var nJ=BigInt(0),aI=BigInt(1);function H8($,U){let J=U.negate();return $?J:U}function sD($,U){let J=j8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function o7($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function aD($,U){o7($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=M8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function i7($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),D=$>>X;if(O>G)O-=Q,D+=aI;let q=U*G,z=q+Math.abs(O)-1,W=O===0,w=O<0,v=U%2!==0;return{nextN:D,offset:z,isZero:W,isNeg:w,isNegF:v,offsetF:q}}var tD=new WeakMap,a7=new WeakMap;function eD($){return a7.get($)||1}function c7($){if($!==nJ)throw Error("invalid wNAF")}class $q{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>nJ){if(U&aI)J=J.add(G);G=G.double(),U>>=aI}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=aD(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let D=1;D<G;D++)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=aD($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:D,isZero:q,isNeg:z,isNegF:W,offsetF:w}=i7(J,X,Q);if(J=O,q)I=I.add(H8(W,U[w]));else G=G.add(H8(z,U[D]))}return c7(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=aD($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===nJ)break;let{nextN:X,offset:O,isZero:D,isNeg:q}=i7(J,Q,I);if(J=X,D)continue;else{let z=U[O];G=G.add(q?z.negate():z)}}return c7(J),G}getPrecomputes($,U,J){let G=tD.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);tD.set(U,G)}}return G}cached($,U,J){let G=eD($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=eD($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){o7(U,this.bits),a7.set($,U),tD.delete($)}hasCache($){return eD($)!==1}}function t7($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>nJ||G>nJ){if(J&aI)Q=Q.add(I);if(G&aI)X=X.add(I);I=I.double(),J>>=aI,G>>=aI}return{p1:Q,p2:X}}function p7($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return pD(U),U}else return iQ($,{isLE:J})}function e7($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let D of["p","n","h"]){let q=U[D];if(!(typeof q==="bigint"&&q>nJ))throw Error(`CURVE.${D} must be positive bigint`)}let I=p7(U.p,J.Fp,G),Q=p7(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let D of O)if(!I.isValid(U[D]))throw Error(`CURVE.${D} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function cQ($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var T8=BigInt(0),iJ=BigInt(1),pQ=BigInt(2);function BB($){return pI($,{adjustScalarBytes:"function",powPminus2:"function"}),Object.freeze({...$})}function s7($){let U=BB($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let D=X||qI,q=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),v=O?pQ**BigInt(254):pQ**BigInt(447),g=O?BigInt(8)*pQ**BigInt(251)-iJ:BigInt(4)*pQ**BigInt(445)-iJ,V=v+g+iJ,N=(R)=>jU(R,J),j=M(W);function M(R){return Z8(N(R),z)}function S(R){let K=nQ(Z$(R,z,"uCoordinate"));if(O)K[31]&=127;return N(WI(K))}function L(R){return WI(I(nQ(Z$(R,z,"scalar"))))}function k(R,K){let T=a(S(K),L(R));if(T===T8)throw Error("invalid private or public key received");return M(T)}function x(R){return k(R,j)}let h=x,B=k;function m(R,K,T){let b=N(R*(K-T));return K=N(K-b),T=N(T+b),{x_2:K,x_3:T}}function a(R,K){R8("u",R,T8,J),R8("scalar",K,v,V);let T=K,b=R,P=iJ,F=T8,y=R,n=iJ,$$=T8;for(let D$=BigInt(q-1);D$>=T8;D$--){let W$=T>>D$&iJ;$$^=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,M$=N(V$*V$),b$=v$-M$,k$=y+n,DU=y-n,qU=N(DU*N$),SU=N(k$*V$),W0=qU+SU,w0=qU-SU;y=N(W0*W0),n=N(b*N(w0*w0)),P=N(v$*M$),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 _={secretKey:z,publicKey:z,seed:z},A=(R=D(z))=>{return Z$(R,_.seed,"seed"),R},E={randomSecretKey:A};return Object.freeze({keygen:cQ(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:_})}class Uq{oHash;iHash;blockLen;outputLen;finished=!1;destroyed=!1;constructor($,U){if(pU($),Z$(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),CU(G)}update($){return h0(this),this.iHash.update($),this}digestInto($){h0(this),Z$($,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 cJ=($,U,J)=>new Uq($,U).update(J).digest();cJ.create=($,U)=>new Uq($,U);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var $Z=($,U)=>($+($>=0?U:-U)/IZ)/U;function LB($,U,J){let[[G,I],[Q,X]]=U,O=$Z(X*$,J),D=$Z(-I*$,J),q=$-O*G-D*Q,z=-O*I-D*X,W=q<l0,w=z<l0;if(W)q=-q;if(w)z=-z;let v=M8(Math.ceil(nD(J)/2))+pJ;if(q<l0||q>=v||z<l0||z>=v)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:W,k1:q,k2neg:w,k2:z}}function Jq($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function Iq($,U){let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(N8(J.lowS,"lowS"),N8(J.prehash,"prehash"),J.format!==void 0)Jq(J.format);return J}class UZ extends Error{constructor($=""){super($)}}var vI={Err:UZ,_tlv:{encode:($,U)=>{let{Err:J}=vI;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=g8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?g8(I.length/2|128):"";return g8($)+Q+I+U},decode($,U){let{Err:J}=vI,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 D=I&127;if(!D)throw new J("tlv.decode(long): indefinite length not supported");if(D>4)throw new J("tlv.decode(long): byte length is too big");let q=U.subarray(G,G+D);if(q.length!==D)throw new J("tlv.decode: length bytes not complete");if(q[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of q)X=X<<8|z;if(G+=D,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}=vI;if($<l0)throw new U("integer: negative integers are not allowed");let J=g8($);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}=vI;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 YI($)}},toSig($){let{Err:U,_int:J,_tlv:G}=vI,I=Z$($,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:D}=G.decode(2,Q),{v:q,l:z}=G.decode(2,D);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(q)}},hexFromSig($){let{_tlv:U,_int:J}=vI,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}},l0=BigInt(0),pJ=BigInt(1),IZ=BigInt(2),oQ=BigInt(3),SB=BigInt(4);function Gq($,U={}){let J=e7("weierstrass",$,U),{Fp:G,Fn:I}=J,Q=J.CURVE,{h:X,n:O}=Q;pI(U,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:D}=U;if(D){if(!G.is0(Q.a)||typeof D.beta!=="bigint"||!Array.isArray(D.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let q=GZ(G,I);function z(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function W(A,E,R){let{x:K,y:T}=E.toAffine(),b=G.toBytes(K);if(N8(R,"isCompressed"),R){z();let P=!G.isOdd(T);return l$(JZ(P),b)}else return l$(Uint8Array.of(4),b,G.toBytes(T))}function w(A){Z$(A,void 0,"Point");let{publicKey:E,publicKeyUncompressed:R}=q,K=A.length,T=A[0],b=A.subarray(1);if(K===E&&(T===2||T===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 D$=X$ instanceof Error?": "+X$.message:"";throw Error("bad point: is not on curve, sqrt error"+D$)}z();let n=G.isOdd(y);if((T&1)===1!==n)y=G.neg(y);return{x:P,y}}else if(K===R&&T===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 ${K}, expected compressed=${E} or uncompressed=${R}`)}let v=U.toBytes||W,g=U.fromBytes||w;function V(A){let E=G.sqr(A),R=G.mul(E,A);return G.add(G.add(R,G.mul(A,Q.a)),Q.b)}function N(A,E){let R=G.sqr(E),K=V(A);return G.eql(R,K)}if(!N(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let j=G.mul(G.pow(Q.a,oQ),SB),M=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(j,M)))throw Error("bad curve params: a or b");function S(A,E,R=!1){if(!G.isValid(E)||R&&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(!D||!D.basises)throw Error("no endo");return LB(A,D.basises,I.ORDER)}let x=iD((A,E)=>{let{X:R,Y:K,Z:T}=A;if(G.eql(T,G.ONE))return{x:R,y:K};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(T);let P=G.mul(R,E),F=G.mul(K,E),y=G.mul(T,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=iD((A)=>{if(A.is0()){if(U.allowInfinityPoint&&!G.is0(A.Y))return;throw Error("bad point: ZERO")}let{x:E,y:R}=A.toAffine();if(!G.isValid(E)||!G.isValid(R))throw Error("bad point: x or y not field elements");if(!N(E,R))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,R,K,T){return R=new m(G.mul(R.X,A),R.Y,R.Z),E=H8(K,E),R=H8(T,R),E.add(R)}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,R){this.X=S("x",A),this.Y=S("y",E,!0),this.Z=S("z",R),Object.freeze(this)}static CURVE(){return Q}static fromAffine(A){let{x:E,y:R}=A||{};if(!A||!G.isValid(E)||!G.isValid(R))throw Error("invalid affine point");if(A instanceof m)throw Error("projective point not allowed");if(G.is0(E)&&G.is0(R))return m.ZERO;return new m(E,R,G.ONE)}static fromBytes(A){let E=m.fromAffine(g(Z$(A,void 0,"point")));return E.assertValidity(),E}static fromHex(A){return m.fromBytes(cI(A))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(A=8,E=!0){if(_.createCache(this,A),!E)this.multiply(oQ);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:R,Z:K}=this,{X:T,Y:b,Z:P}=A,F=G.eql(G.mul(E,P),G.mul(T,K)),y=G.eql(G.mul(R,P),G.mul(b,K));return F&&y}negate(){return new m(this.X,G.neg(this.Y),this.Z)}double(){let{a:A,b:E}=Q,R=G.mul(E,oQ),{X:K,Y:T,Z:b}=this,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=G.mul(K,K),$$=G.mul(T,T),X$=G.mul(b,b),D$=G.mul(K,T);return D$=G.add(D$,D$),y=G.mul(K,b),y=G.add(y,y),P=G.mul(A,y),F=G.mul(R,X$),F=G.add(P,F),P=G.sub($$,F),F=G.add($$,F),F=G.mul(P,F),P=G.mul(D$,P),y=G.mul(R,y),X$=G.mul(A,X$),D$=G.sub(n,X$),D$=G.mul(A,D$),D$=G.add(D$,y),y=G.add(n,n),n=G.add(y,n),n=G.add(n,X$),n=G.mul(n,D$),F=G.add(F,n),X$=G.mul(T,b),X$=G.add(X$,X$),n=G.mul(X$,D$),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:R,Z:K}=this,{X:T,Y:b,Z:P}=A,F=G.ZERO,y=G.ZERO,n=G.ZERO,$$=Q.a,X$=G.mul(Q.b,oQ),D$=G.mul(E,T),W$=G.mul(R,b),N$=G.mul(K,P),v$=G.add(E,R),V$=G.add(T,b);v$=G.mul(v$,V$),V$=G.add(D$,W$),v$=G.sub(v$,V$),V$=G.add(E,K);let M$=G.add(T,P);return V$=G.mul(V$,M$),M$=G.add(D$,N$),V$=G.sub(V$,M$),M$=G.add(R,K),F=G.add(b,P),M$=G.mul(M$,F),F=G.add(W$,N$),M$=G.sub(M$,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(D$,D$),W$=G.add(W$,D$),N$=G.mul($$,N$),V$=G.mul(X$,V$),W$=G.add(W$,N$),N$=G.sub(D$,N$),N$=G.mul($$,N$),V$=G.add(V$,N$),D$=G.mul(W$,V$),y=G.add(y,D$),D$=G.mul(M$,V$),F=G.mul(v$,F),F=G.sub(F,D$),D$=G.mul(v$,W$),n=G.mul(M$,n),n=G.add(n,D$),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 R,K,T=(b)=>_.cached(this,b,(P)=>sD(m,P));if(E){let{k1neg:b,k1:P,k2neg:F,k2:y}=k(A),{p:n,f:$$}=T(P),{p:X$,f:D$}=T(y);K=$$.add(D$),R=B(E.beta,n,X$,b,F)}else{let{p:b,f:P}=T(A);R=b,K=P}return sD(m,[R,K])[0]}multiplyUnsafe(A){let{endo:E}=U,R=this;if(!I.isValid(A))throw Error("invalid scalar: out of range");if(A===l0||R.is0())return m.ZERO;if(A===pJ)return R;if(_.hasCache(this))return this.multiply(A);if(E){let{k1neg:K,k1:T,k2neg:b,k2:P}=k(A),{p1:F,p2:y}=t7(m,R,T,P);return B(E.beta,F,y,K,b)}else return _.unsafe(R,A)}toAffine(A){return x(this,A)}isTorsionFree(){let{isTorsionFree:A}=U;if(X===pJ)return!0;if(A)return A(m,this);return _.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:A}=U;if(X===pJ)return this;if(A)return A(m,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(A=!0){return N8(A,"isCompressed"),this.assertValidity(),v(m,this,A)}toHex(A=!0){return iI(this.toBytes(A))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let a=I.BITS,_=new $q(m,U.endo?Math.ceil(a/2):a);return m.BASE.precompute(8),m}function JZ($){return Uint8Array.of($?2:3)}function GZ($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function CB($,U={}){let{Fn:J}=$,G=U.randomBytes||qI,I=Object.assign(GZ($.Fp,J),{seed:oD(J.ORDER)});function Q(v){try{let g=J.fromBytes(v);return J.isValidNot0(g)}catch(g){return!1}}function X(v,g){let{publicKey:V,publicKeyUncompressed:N}=I;try{let j=v.length;if(g===!0&&j!==V)return!1;if(g===!1&&j!==N)return!1;return!!$.fromBytes(v)}catch(j){return!1}}function O(v=G(I.seed)){return n7(Z$(v,I.seed,"seed"),J.ORDER)}function D(v,g=!0){return $.BASE.multiply(J.fromBytes(v)).toBytes(g)}function q(v){let{secretKey:g,publicKey:V,publicKeyUncompressed:N}=I;if(!hJ(v))return;if("_lengths"in J&&J._lengths||g===V)return;let j=Z$(v,void 0,"key").length;return j===V||j===N}function z(v,g,V=!0){if(q(v)===!0)throw Error("first arg must be private key");if(q(g)===!1)throw Error("second arg must be public key");let N=J.fromBytes(v);return $.fromBytes(g).multiply(N).toBytes(V)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=cQ(O,D);return Object.freeze({getPublicKey:D,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function Qq($,U,J={}){pU(U),pI(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let G=J.randomBytes||qI,I=J.hmac||((R,K)=>cJ(U,R,K)),{Fp:Q,Fn:X}=$,{ORDER:O,BITS:D}=X,{keygen:q,getPublicKey:z,getSharedSecret:W,utils:w,lengths:v}=CB($,J),g={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},V=O*IZ<Q.ORDER;function N(R){let K=O>>pJ;return R>K}function j(R,K){if(!X.isValidNot0(K))throw Error(`invalid signature ${R}: out of range 1..Point.Fn.ORDER`);return K}function M(){if(V)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function S(R,K){Jq(K);let T=v.signature,b=K==="compact"?T:K==="recovered"?T+1:void 0;return Z$(R,b)}class L{r;s;recovery;constructor(R,K,T){if(this.r=j("r",R),this.s=j("s",K),T!=null){if(M(),![0,1,2,3].includes(T))throw Error("invalid recovery id");this.recovery=T}Object.freeze(this)}static fromBytes(R,K=g.format){S(R,K);let T;if(K==="der"){let{r:y,s:n}=vI.toSig(Z$(R));return new L(y,n)}if(K==="recovered")T=R[0],K="compact",R=R.subarray(1);let b=v.signature/2,P=R.subarray(0,b),F=R.subarray(b,b*2);return new L(X.fromBytes(P),X.fromBytes(F),T)}static fromHex(R,K){return this.fromBytes(cI(R),K)}assertRecovery(){let{recovery:R}=this;if(R==null)throw Error("invalid recovery id: must be present");return R}addRecoveryBit(R){return new L(this.r,this.s,R)}recoverPublicKey(R){let{r:K,s:T}=this,b=this.assertRecovery(),P=b===2||b===3?K+O:K;if(!Q.isValid(P))throw Error("invalid recovery id: sig.r+curve.n != R.x");let F=Q.toBytes(P),y=$.fromBytes(l$(JZ((b&1)===0),F)),n=X.inv(P),$$=x(Z$(R,void 0,"msgHash")),X$=X.create(-$$*n),D$=X.create(T*n),W$=$.BASE.multiplyUnsafe(X$).add(y.multiplyUnsafe(D$));if(W$.is0())throw Error("invalid recovery: point at infinify");return W$.assertValidity(),W$}hasHighS(){return N(this.s)}toBytes(R=g.format){if(Jq(R),R==="der")return cI(vI.hexFromSig(this));let{r:K,s:T}=this,b=X.toBytes(K),P=X.toBytes(T);if(R==="recovered")return M(),l$(Uint8Array.of(this.assertRecovery()),b,P);return l$(b,P)}toHex(R){return iI(this.toBytes(R))}}let k=J.bits2int||function(K){if(K.length>8192)throw Error("input is too large");let T=YI(K),b=K.length*8-D;return b>0?T>>BigInt(b):T},x=J.bits2int_modN||function(K){return X.create(k(K))},h=M8(D);function B(R){return R8("num < 2^"+D,R,l0,h),X.toBytes(R)}function m(R,K){return Z$(R,void 0,"message"),K?Z$(U(R),void 0,"prehashed message"):R}function a(R,K,T){let{lowS:b,prehash:P,extraEntropy:F}=Iq(T,g);R=m(R,P);let y=x(R),n=X.fromBytes(K);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(Z$(N$,void 0,"extraEntropy"))}let X$=l$(...$$),D$=y;function W$(N$){let v$=k(N$);if(!X.isValidNot0(v$))return;let V$=X.inv(v$),M$=$.BASE.multiply(v$).toAffine(),b$=X.create(M$.x);if(b$===l0)return;let k$=X.create(V$*X.create(D$+b$*n));if(k$===l0)return;let DU=(M$.x===b$?0:2)|Number(M$.y&pJ),qU=k$;if(b&&N(k$))qU=X.neg(k$),DU^=1;return new L(b$,qU,V?void 0:DU)}return{seed:X$,k2sig:W$}}function _(R,K,T={}){let{seed:b,k2sig:P}=a(R,K,T);return b7(U.outputLen,X.BYTES,I)(b,P).toBytes(T.format)}function A(R,K,T,b={}){let{lowS:P,prehash:F,format:y}=Iq(b,g);if(T=Z$(T,void 0,"publicKey"),K=m(K,F),!hJ(R)){let n=R instanceof L?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+n)}S(R,y);try{let n=L.fromBytes(R,y),$$=$.fromBytes(T);if(P&&n.hasHighS())return!1;let{r:X$,s:D$}=n,W$=x(K),N$=X.inv(D$),v$=X.create(W$*N$),V$=X.create(X$*N$),M$=$.BASE.multiplyUnsafe(v$).add($$.multiplyUnsafe(V$));if(M$.is0())return!1;return X.create(M$.x)===X$}catch(n){return!1}}function E(R,K,T={}){let{prehash:b}=Iq(T,g);return K=m(K,b),L.fromBytes(R,"recovered").recoverPublicKey(K).toBytes()}return Object.freeze({keygen:q,getPublicKey:z,getSharedSecret:W,utils:w,lengths:v,Point:$,sign:_,verify:A,recoverPublicKey:E,Signature:L,hash:U})}function QZ($,U,J){return $&U^~$&J}function XZ($,U,J){return $&U^$&J^U&J}class aQ{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=lQ(this.buffer)}update($){h0(this),Z$($);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=lQ($);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($){h0(this),rQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,CU(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=lQ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let D=O/4,q=this.get();if(D>q.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<D;z++)X.setUint32(4*z,q[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 d0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),n0=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 tQ=BigInt(4294967295),OZ=BigInt(32);function _B($,U=!1){if(U)return{h:Number($&tQ),l:Number($>>OZ&tQ)};return{h:Number($>>OZ&tQ)|0,l:Number($&tQ)|0}}function eQ($,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}=_B($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var Xq=($,U,J)=>$>>>J,Oq=($,U,J)=>$<<32-J|U>>>J,tI=($,U,J)=>$>>>J|U<<32-J,eI=($,U,J)=>$<<32-J|U>>>J,K8=($,U,J)=>$<<64-J|U>>>J-32,A8=($,U,J)=>$>>>J-32|U<<64-J;var DZ=($,U,J)=>$<<J|U>>>32-J,qZ=($,U,J)=>U<<J|$>>>32-J,zZ=($,U,J)=>U<<J-32|$>>>64-J,YZ=($,U,J)=>$<<J-32|U>>>64-J;function g0($,U,J,G){let I=(U>>>0)+(G>>>0);return{h:$+J+(I/4294967296|0)|0,l:I|0}}var WZ=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),wZ=($,U,J,G)=>U+J+G+($/4294967296|0)|0,vZ=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),VZ=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,NZ=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),gZ=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var bB=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]),VI=new Uint32Array(64);class Dq extends aQ{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)VI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=VI[z-15],w=VI[z-2],v=G0(W,7)^G0(W,18)^W>>>3,g=G0(w,17)^G0(w,19)^w>>>10;VI[z]=g+VI[z-7]+v+VI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:D,H:q}=this;for(let z=0;z<64;z++){let W=G0(X,6)^G0(X,11)^G0(X,25),w=q+W+QZ(X,O,D)+bB[z]+VI[z]|0,g=(G0(J,2)^G0(J,13)^G0(J,22))+XZ(J,G,I)|0;q=D,D=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+g|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,D=D+this.G|0,q=q+this.H|0,this.set(J,G,I,Q,X,O,D,q)}roundClean(){CU(VI)}destroy(){this.set(0,0,0,0,0,0,0,0),CU(this.buffer)}}class ZZ extends Dq{A=d0[0]|0;B=d0[1]|0;C=d0[2]|0;D=d0[3]|0;E=d0[4]|0;F=d0[5]|0;G=d0[6]|0;H=d0[7]|0;constructor(){super(32)}}class fB extends Dq{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(28)}}var RZ=(()=>eQ(["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=(()=>RZ[0])(),FB=(()=>RZ[1])(),NI=new Uint32Array(80),gI=new Uint32Array(80);class P8 extends aQ{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:D,El:q,Fh:z,Fl:W,Gh:w,Gl:v,Hh:g,Hl:V}=this;return[$,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,V]}set($,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,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=D|0,this.El=q|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=v|0,this.Hh=g|0,this.Hl=V|0}process($,U){for(let M=0;M<16;M++,U+=4)NI[M]=$.getUint32(U),gI[M]=$.getUint32(U+=4);for(let M=16;M<80;M++){let S=NI[M-15]|0,L=gI[M-15]|0,k=tI(S,L,1)^tI(S,L,8)^Xq(S,L,7),x=eI(S,L,1)^eI(S,L,8)^Oq(S,L,7),h=NI[M-2]|0,B=gI[M-2]|0,m=tI(h,B,19)^K8(h,B,61)^Xq(h,B,6),a=eI(h,B,19)^A8(h,B,61)^Oq(h,B,6),_=vZ(x,a,gI[M-7],gI[M-16]),A=VZ(_,k,m,NI[M-7],NI[M-16]);NI[M]=A|0,gI[M]=_|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:D,Dl:q,Eh:z,El:W,Fh:w,Fl:v,Gh:g,Gl:V,Hh:N,Hl:j}=this;for(let M=0;M<80;M++){let S=tI(z,W,14)^tI(z,W,18)^K8(z,W,41),L=eI(z,W,14)^eI(z,W,18)^A8(z,W,41),k=z&w^~z&g,x=W&v^~W&V,h=NZ(j,L,x,FB[M],gI[M]),B=gZ(h,N,S,k,kB[M],NI[M]),m=h|0,a=tI(J,G,28)^K8(J,G,34)^K8(J,G,39),_=eI(J,G,28)^A8(J,G,34)^A8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=g|0,j=V|0,g=w|0,V=v|0,w=z|0,v=W|0,{h:z,l:W}=g0(D|0,q|0,B|0,m|0),D=X|0,q=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let R=WZ(m,_,E);J=wZ(R,B,a,A),G=R|0}({h:J,l:G}=g0(this.Ah|0,this.Al|0,J|0,G|0)),{h:I,l:Q}=g0(this.Bh|0,this.Bl|0,I|0,Q|0),{h:X,l:O}=g0(this.Ch|0,this.Cl|0,X|0,O|0),{h:D,l:q}=g0(this.Dh|0,this.Dl|0,D|0,q|0),{h:z,l:W}=g0(this.Eh|0,this.El|0,z|0,W|0),{h:w,l:v}=g0(this.Fh|0,this.Fl|0,w|0,v|0),{h:g,l:V}=g0(this.Gh|0,this.Gl|0,g|0,V|0),{h:N,l:j}=g0(this.Hh|0,this.Hl|0,N|0,j|0),this.set(J,G,I,Q,X,O,D,q,z,W,w,v,g,V,N,j)}roundClean(){CU(NI,gI)}destroy(){CU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class uB extends P8{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 MZ extends P8{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 vU=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 xB extends P8{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(28)}}class mB extends P8{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 sQ=lJ(()=>new ZZ,zI(1));var jZ=lJ(()=>new MZ,zI(2));/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var yB=BigInt(1),HZ=BigInt(2),rB=BigInt(3),hB=BigInt(5),Fd=BigInt(8),TZ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed");function lB($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=TZ,O=$*$%Q*$%Q,D=oU(O,HZ,Q)*O%Q,q=oU(D,yB,Q)*$%Q,z=oU(q,hB,Q)*q%Q,W=oU(z,U,Q)*z%Q,w=oU(W,J,Q)*W%Q,v=oU(w,G,Q)*w%Q,g=oU(v,I,Q)*v%Q,V=oU(g,I,Q)*v%Q,N=oU(V,U,Q)*z%Q;return{pow_p_5_8:oU(N,HZ,Q)*$%Q,b2:O}}function dB($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var KZ=(()=>{let $=TZ;return s7({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=lB(U);return jU(oU(J,rB,$)*G,$)},adjustScalarBytes:dB})})();/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var nB=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))(),iB=(()=>({p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff"),n:BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973"),h:BigInt(1),a:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc"),b:BigInt("0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef"),Gx:BigInt("0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7"),Gy:BigInt("0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f")}))();var cB=Gq(nB),qq=Qq(cB,sQ);var pB=Gq(iB),AZ=Qq(pB,jZ);function BZ($,U,J){if(pU($),J===void 0)J=new Uint8Array($.outputLen);return cJ($,J,U)}var zq=Uint8Array.of(0),PZ=Uint8Array.of();function LZ($,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=PZ;else Z$(J,void 0,"info");let X=new Uint8Array(Q*I),O=cJ.create($,U),D=O._cloneInto(),q=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)zq[0]=z+1,D.update(z===0?PZ:q).update(J).update(zq).digestInto(q),X.set(q,I*z),O._cloneInto(D);return O.destroy(),D.destroy(),CU(q,zq),X.slice(0,G)}var oB=BigInt(0),B8=BigInt(1),aB=BigInt(2),tB=BigInt(7),eB=BigInt(256),sB=BigInt(113),_Z=[],EZ=[],bZ=[];for(let $=0,U=B8,J=1,G=0;$<24;$++){[J,G]=[G,(2*J+3*G)%5],_Z.push(2*(5*G+J)),EZ.push(($+1)*($+2)/2%64);let I=oB;for(let Q=0;Q<7;Q++)if(U=(U<<B8^(U>>tB)*sB)%eB,U&aB)I^=B8<<(B8<<BigInt(Q))-B8;bZ.push(I)}var fZ=eQ(bZ,!0),$L=fZ[0],UL=fZ[1],SZ=($,U,J)=>J>32?zZ($,U,J):DZ($,U,J),CZ=($,U,J)=>J>32?YZ($,U,J):qZ($,U,J);function IL($,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,D=(X+2)%10,q=J[D],z=J[D+1],W=SZ(q,z,1)^J[O],w=CZ(q,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=EZ[X],D=SZ(I,Q,O),q=CZ(I,Q,O),z=_Z[X];I=$[z],Q=$[z+1],$[z]=D,$[z+1]=q}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]^=$L[G],$[1]^=UL[G]}CU(J)}class $4{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=hQ(this.state)}clone(){return this._cloneInto()}keccak(){hD(this.state32),IL(this.state32,this.rounds),hD(this.state32),this.posOut=0,this.pos=0}update($){h0(this),Z$($);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($){h0(this,!1),Z$($),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(rQ($,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,CU(this.state)}_cloneInto($){let{blockLen:U,suffix:J,outputLen:G,rounds:I,enableXOF:Q}=this;return $||=new $4(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 kZ=($,U,J,G={})=>lJ(()=>new $4(U,$,J),G);var sI=kZ(6,136,32,zI(8));var FZ=kZ(6,72,64,zI(10));var uZ=($,U,J,G={})=>lJ((I={})=>new $4(U,$,I.dkLen===void 0?J:I.dkLen,!0),G),xZ=uZ(31,168,16,zI(11)),Z0=uZ(31,136,32,zI(12));function Yq($){if(!Number.isSafeInteger($)||$<0||$>4294967295)throw Error("wrong u32 integer:"+$);return $}function yZ($){return Yq($),($&$-1)===0&&$!==0}function Wq($,U){Yq($);let J=0;for(let G=0;G<U;G++,$>>>=1)J=J<<1|$&1;return J}function rZ($){return Yq($),31-Math.clz32($)}function mZ($){let U=$.length;if(U<2||!yZ(U))throw Error("n must be a power of 2 and greater than 1. Got "+U);let J=rZ(U);for(let G=0;G<U;G++){let I=Wq(G,J);if(G<I){let Q=$[G];$[G]=$[I],$[I]=Q}}return $}var wq=($,U)=>{let{N:J,roots:G,dit:I,invertButterflies:Q=!1,skipStages:X=0,brp:O=!0}=U,D=rZ(J);if(!yZ(J))throw Error("FFT: Polynomial size should be power of two");let q=I!==Q;return(z)=>{if(z.length!==J)throw Error("FFT: wrong Polynomial length");if(I&&O)mZ(z);for(let W=0,w=1;W<D-X;W++){let v=I?W+1+X:D-W,g=1<<v,V=g>>1,N=J>>v;for(let j=0;j<J;j+=g)for(let M=0,S=w++;M<V;M++){let L=Q?I?J-S:S:M*N,k=j+M,x=j+M+V,h=G[L],B=z[x],m=z[k];if(q){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)mZ(z);return z}};/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var R0=qI;function U4($,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 hZ($){return Uint8Array.from($)}function $J($,...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 D=U[X],q=J(D),z=typeof D==="number"?I[X]:D.encode(I[X]);if(Z$(z,q,$),Q.set(z,O),typeof D!=="number")z.fill(0);O+=q}return Q},decode:(I)=>{Z$(I,G,$);let Q=[];for(let X of U){let O=J(X),D=I.subarray(0,O);Q.push(typeof X==="number"?D:X.decode(D)),I=I.subarray(O)}return Q}}}function I4($,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)=>{Z$(G,J);let I=[];for(let Q=0;Q<G.length;Q+=$.bytesLen)I.push($.decode(G.subarray(Q,Q+$.bytesLen)));return I}}}function i$(...$){for(let U of $)if(Array.isArray(U))for(let J of U)J.fill(0);else U.fill(0)}function vq($){return(1<<$)-1}var td=Uint8Array.of();/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var lZ=($)=>{let{newPoly:U,N:J,Q:G,F:I,ROOT_OF_UNITY:Q,brvBits:X,isKyber:O}=$,D=(M,S=G)=>{let L=M%S|0;return(L>=0?L|0:S+L|0)|0},q=(M,S=G)=>{let L=D(M,S)|0;return(L>S>>1?L-S|0:L)|0};function z(){let M=U(J);for(let S=0;S<J;S++){let L=Wq(S,X),k=BigInt(Q)**BigInt(L)%BigInt(G);M[S]=Number(k)|0}return M}let W=z(),w={add:(M,S)=>D((M|0)+(S|0))|0,sub:(M,S)=>D((M|0)-(S|0))|0,mul:(M,S)=>D((M|0)*(S|0))|0,inv:(M)=>{throw Error("not implemented")}},v={N:J,roots:W,invertButterflies:!0,skipStages:O?1:0,brp:!1},g=wq(w,{dit:!1,...v}),V=wq(w,{dit:!0,...v});return{mod:D,smod:q,nttZetas:W,NTT:{encode:(M)=>{return g(M)},decode:(M)=>{V(M);for(let S=0;S<M.length;S++)M[S]=D(I*M[S]);return M}},bitsCoder:(M,S)=>{let L=vq(M),k=M*(J/8);return{bytesLen:k,encode:(x)=>{let h=new Uint8Array(k);for(let B=0,m=0,a=0,_=0;B<x.length;B++){m|=(S.encode(x[B])&L)<<a,a+=M;for(;a>=8;a-=8,m>>=8)h[_++]=m&vq(a)}return h},decode:(x)=>{let h=U(J);for(let B=0,m=0,a=0,_=0;B<x.length;B++){m|=x[B]<<a,a+=8;for(;a>=M;a-=M,m>>=M)h[_++]=S.decode(m&L)}return h}}}}},JL=($)=>(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,D=0;return{stats:()=>({calls:O,xofs:D}),get:(q,z)=>{return G[I+0]=q,G[I+1]=z,X.destroy(),X=$.create({}).update(G),O++,()=>{return D++,X.xofInto(Q)}},clean:()=>{X.destroy(),i$(Q,G)}}},dZ=JL(xZ);/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var NU=256,i0=3329,GL=3303,QL=17,{mod:C8,nttZetas:XL,NTT:UJ,bitsCoder:OL}=lZ({N:NU,Q:i0,F:GL,ROOT_OF_UNITY:QL,newPoly:($)=>new Uint16Array($),brvBits:7,isKyber:!0}),Vq={512:{N:NU,Q:i0,K:2,ETA1:3,ETA2:2,du:10,dv:4,RBGstrength:128},768:{N:NU,Q:i0,K:3,ETA1:2,ETA2:2,du:10,dv:4,RBGstrength:192},1024:{N:NU,Q:i0,K:4,ETA1:2,ETA2:2,du:11,dv:5,RBGstrength:256}},DL=($)=>{if($>=12)return{encode:(J)=>J,decode:(J)=>J};let U=2**($-1);return{encode:(J)=>((J<<$)+i0/2)/i0,decode:(J)=>J*i0+U>>>$}},L8=($)=>OL($,DL($));function IJ($,U){for(let J=0;J<NU;J++)$[J]=C8($[J]+U[J])}function qL($,U){for(let J=0;J<NU;J++)$[J]=C8($[J]-U[J])}function zL($,U,J,G,I){let Q=C8(U*G*I+$*J),X=C8($*G+U*J);return{c0:Q,c1:X}}function J4($,U){for(let J=0;J<NU/2;J++){let G=XL[64+(J>>1)];if(J&1)G=-G;let{c0:I,c1:Q}=zL($[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 nZ($){let U=new Uint16Array(NU);for(let J=0;J<NU;){let G=$();if(G.length%3)throw Error("SampleNTT: unaligned block");for(let I=0;J<NU&&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<i0)U[J++]=Q;if(J<NU&&X<i0)U[J++]=X}}return U}function S8($,U,J,G){let I=$(G*NU/4,U,J),Q=new Uint16Array(NU),X=hQ(I),O=0;for(let D=0,q=0,z=0,W=0;D<X.length;D++){let w=X[D];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[q++]=C8(W-z),z=0,O=0}if(O)throw Error(`sampleCBD: leftover bits: ${O}`);return Q}var YL=($)=>{let{K:U,PRF:J,XOF:G,HASH512:I,ETA1:Q,ETA2:X,du:O,dv:D}=$,q=L8(1),z=L8(D),W=L8(O),w=$J("publicKey",I4(L8(12),U),32),v=I4(L8(12),U),g=$J("ciphertext",I4(W,U),z),V=$J("seed",32,32);return{secretCoder:v,lengths:{secretKey:v.bytesLen,publicKey:w.bytesLen,cipherText:g.bytesLen},keygen:(N)=>{Z$(N,32,"seed");let j=new Uint8Array(33);j.set(N),j[32]=U;let M=I(j),[S,L]=V.decode(M),k=[],x=[];for(let m=0;m<U;m++)k.push(UJ.encode(S8(J,L,m,Q)));let h=G(S);for(let m=0;m<U;m++){let a=UJ.encode(S8(J,L,U+m,Q));for(let _=0;_<U;_++){let A=nZ(h.get(_,m));IJ(a,J4(A,k[_]))}x.push(a)}h.clean();let B={publicKey:w.encode([x,S]),secretKey:v.encode(k)};return i$(S,L,k,x,j,M),B},encrypt:(N,j,M)=>{let[S,L]=w.decode(N),k=[];for(let _=0;_<U;_++)k.push(UJ.encode(S8(J,M,_,Q)));let x=G(L),h=new Uint16Array(NU),B=[];for(let _=0;_<U;_++){let A=S8(J,M,U+_,X),E=new Uint16Array(NU);for(let R=0;R<U;R++){let K=nZ(x.get(_,R));IJ(E,J4(K,k[R]))}IJ(A,UJ.decode(E)),B.push(A),IJ(h,J4(S[_],k[_])),i$(E)}x.clean();let m=S8(J,M,2*U,X);IJ(m,UJ.decode(h));let a=q.decode(j);return IJ(a,m),i$(S,k,h,m),g.encode([B,a])},decrypt:(N,j)=>{let[M,S]=g.decode(N),L=v.decode(j),k=new Uint16Array(NU);for(let x=0;x<U;x++)IJ(k,J4(L[x],UJ.encode(M[x])));return qL(S,UJ.decode(k)),i$(k,L,M),q.encode(S)}}};function Nq($){let U=YL($),{HASH256:J,HASH512:G,KDF:I}=$,{secretCoder:Q,lengths:X}=U,O=$J("secretKey",X.secretKey,X.publicKey,32,32),D=32,q=64;return{info:{type:"ml-kem"},lengths:{...X,seed:64,msg:32,msgRand:32,secretKey:O.bytesLen},keygen:(z=R0(64))=>{Z$(z,64,"seed");let{publicKey:W,secretKey:w}=U.keygen(z.subarray(0,32)),v=J(W),g=O.encode([w,W,v,z.subarray(32)]);return i$(w,v),{publicKey:W,secretKey:g}},getPublicKey:(z)=>{let[W,w,v,g]=O.decode(z);return Uint8Array.from(w)},encapsulate:(z,W=R0(32))=>{Z$(z,X.publicKey,"publicKey"),Z$(W,32,"message");let w=z.subarray(0,384*$.K),v=Q.encode(Q.decode(hZ(w)));if(!U4(v,w))throw i$(v),Error("ML-KEM.encapsulate: wrong publicKey modulus");i$(v);let g=G.create().update(W).update(J(z)).digest(),V=U.encrypt(z,W,g.subarray(32,64));return i$(g.subarray(32)),{cipherText:V,sharedSecret:g.subarray(0,32)}},decapsulate:(z,W)=>{Z$(W,O.bytesLen,"secretKey"),Z$(z,X.cipherText,"cipherText");let w=O.bytesLen-96,v=w+32,g=J(W.subarray(w/2,v));if(!U4(g,W.subarray(v,v+32)))throw Error("invalid secretKey: hash check failed");let[V,N,j,M]=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=U4(z,x),B=I.create({dkLen:32}).update(M).update(z).digest();return i$(S,x,!h?k:B),h?k:B}}}function WL($,U,J){return Z0.create({dkLen:$}).update(U).update(new Uint8Array([J])).digest()}var gq={HASH256:sI,HASH512:FZ,KDF:Z0,XOF:dZ,PRF:WL},Dn=Nq({...gq,...Vq[512]}),_8=Nq({...gq,...Vq[768]}),iZ=Nq({...gq,...Vq[1024]});/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */function wL($,U=!1){let{lengths:J,keygen:G}=$;if(U){let Q=$.Point.Fn;if(!Q)throw Error("No Point.Fn");G=(X=R0(J.seed))=>{Z$(X,J.seed,"seed");let O=Q.isLE?WI(X):YI(X),D=Q.toBytes(Q.create(O));return{secretKey:D,publicKey:$.getPublicKey(D)}}}return{lengths:{secretKey:J.secretKey,publicKey:J.publicKey,seed:J.seed},keygen:G,getPublicKey:(I)=>$.getPublicKey(I)}}function Zq($,U=!1){let J=wL($,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=R0($.lengths.seed)){let Q=this.keygen(I).secretKey,X=this.decapsulate(G,Q),O=$.getPublicKey(Q);return i$(Q),{sharedSecret:X,cipherText:O}},decapsulate(G,I){let Q=$.getSharedSecret(I,G);return $.lengths.publicKeyHasPrefix?Q.subarray(1):Q}}}function E8($,U){return $J(U,...$.map((J)=>{if(typeof J.lengths[U]!=="number")throw Error("wrong length: "+U);return J.lengths[U]}))}function Rq($){return(U,J)=>$(U,{dkLen:J})}function vL($,U,...J){let G=E8(J,"seed"),I=E8(J,"publicKey");if($===void 0)$=G.bytesLen;p$($);function Q(X){Z$(X,$);let O=G.decode(U(X,G.bytesLen)),D=J.map((W,w)=>W.keygen(O[w])),q=D.map((W)=>W.secretKey),z=D.map((W)=>W.publicKey);return{secretKey:q,publicKey:z}}return{info:{lengths:{seed:$,publicKey:I.bytesLen,secretKey:$}},getPublicKey(X){return this.keygen(X).publicKey},keygen(X=R0($)){let{publicKey:O,secretKey:D}=Q(X),q=I.encode(O);return i$(O),i$(D),{secretKey:X,publicKey:q}},expandDecapsulationKey:Q,realSeedLen:$}}function G4($,U,J,G,...I){let Q=vL($,J,...I),X=E8(I,"cipherText"),O=E8(I,"publicKey"),D=E8(I,"msg");if(U===void 0)U=D.bytesLen;return p$(U),{lengths:{...Q.info.lengths,msg:U,msgRand:D.bytesLen,cipherText:X.bytesLen},getPublicKey:Q.getPublicKey,keygen:Q.keygen,encapsulate(q,z=R0(D.bytesLen)){let W=O.decode(q),w=D.decode(z),v=I.map((j,M)=>j.encapsulate(W[M],w[M])),g=v.map((j)=>j.sharedSecret),V=v.map((j)=>j.cipherText),N={sharedSecret:G(W,V,g),cipherText:X.encode(V)};return i$(g,V),N},decapsulate(q,z){let W=X.decode(q),{publicKey:w,secretKey:v}=Q.expandDecapsulationKey(z),g=I.map((V,N)=>V.decapsulate(W[N],v[N]));return G(w,W,g)}}}function cZ($,U,J,G,I){return pU(G),pU(I),G4(32,32,Rq(G),(Q,X,O)=>I(l$(O[0],O[1],X[1],Q[1],wI($))),U,J)}var Rn=cZ("QSF-KEM(ML-KEM-768,P-256)-XOF(SHAKE256)-KDF(SHA3-256)",_8,Zq(qq,!0),Z0,sI),Mn=cZ("QSF-KEM(ML-KEM-1024,P-384)-XOF(SHAKE256)-KDF(SHA3-256)",iZ,Zq(AZ,!0),Z0,sI);function VL($,U,J,G,I){return pU(G),pU(I),G4(32,32,Rq(G),(Q,X,O)=>{let D=l$(O[0],O[1],X[0],Q[0],X[1],Q[1],wI($)),q=32,z=l$(wI("hybrid_prk"),D),W=BZ(I,z),w=l$(dJ(32,2),wI("shared_secret"),wI("")),v=LZ(I,W,w,32);return i$(W,w,z,D),v},U,J)}var pZ=Zq(KZ),jn=VL("KitchenSink-KEM(ML-KEM-768,X25519)-XOF(SHAKE256)-KDF(HKDF-SHA-256)",_8,pZ,Z0,sQ),NL=(()=>G4(32,32,Rq(Z0),($,U,J)=>sI(l$(J[0],J[1],U[1],$[1],wI("\\.//^\\"))),_8,pZ))();function gL($,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 D=I.toBytes(I.create(O)),q=$.getPublicKey(D,!1);return{secretKey:D,publicKey:q}}return{lengths:{secretKey:U,publicKey:J,seed:G,msg:G,cipherText:J},keygen(X=R0(G)){return Z$(X,G,"seed"),Q(X)},getPublicKey(X){return $.getPublicKey(X,!1)},encapsulate(X,O=R0(G)){Z$(O,G,"rand");let{secretKey:D}=Q(O),q=this.decapsulate(X,D),z=$.getPublicKey(D,!1);return i$(D),{sharedSecret:q,cipherText:z}},decapsulate(X,O){return $.getSharedSecret(O,X).subarray(1)}}}function ZL($,U,J,G){let{secretKey:I,publicKeyUncompressed:Q}=J.lengths;if(!I||!Q)throw Error("wrong curve");let X=gL(J,I,Q,G),O=64,D=O+G;return G4(32,32,(q)=>{Z$(q,32);let z=Z0(q,{dkLen:D}),W=z.subarray(0,O),w=z.subarray(O,D);return l$(W,w)},(q,z,W)=>sI(l$(W[0],W[1],z[1],q[1],wI($))),U,X)}var RL=(()=>ZL("MLKEM768-P256",_8,qq,128))();var Q4=NL,oZ=RL;/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var S$=($,U,J)=>t$($,U,J),jq=y$,oJ=SQ,JU=(...$)=>HD(...$),aJ=($)=>O8($),tJ=RD,eJ=($)=>u0($),O4=BigInt(0),Mq=BigInt(1);function c0($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw TypeError(J+"expected boolean, got type="+typeof $)}return $}function D4($){if(typeof $==="bigint"){if(!X4($))throw RangeError("positive bigint expected, got "+$)}else jq($);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 b8($){let U=D4($).toString(16);return U.length&1?"0"+U:U}function aZ($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);return $===""?O4:BigInt("0x"+$)}function JJ($){return aZ(SQ($))}function Q0($){return aZ(SQ(ZI(t$($)).reverse()))}function q4($,U){if(y$(U),U===0)throw RangeError("zero length");$=D4($);let J=$.toString(16);if(J.length>U*2)throw RangeError("number too large");return O8(J.padStart(U*2,"0"))}function f8($,U){return q4($,U).reverse()}function tZ($,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 ZI($){return Uint8Array.from(S$($))}function z4($){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 X4=($)=>typeof $==="bigint"&&O4<=$;function ML($,U,J){return X4($)&&X4(U)&&X4(J)&&U<=$&&$<J}function p0($,U,J,G){if(!ML(U,J,G))throw RangeError("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function sJ($){if($<O4)throw Error("expected non-negative bigint, got "+$);let U;for(U=0;$>O4;$>>=Mq,U+=1);return U}var k8=($)=>(Mq<<BigInt($))-Mq;function eZ($,U,J){if(y$($,"hashLen"),y$(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,D=G($),q=G($),z=0,W=()=>{D.fill(1),q.fill(0),z=0},w=(...N)=>J(q,JU(D,...N)),v=(N=I)=>{if(q=w(Q,N),D=w(),N.length===0)return;q=w(X,N),D=w()},g=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){D=w();let M=D.slice();j.push(M),N+=D.length}return JU(...j)};return(N,j)=>{W(),v(N);let M=void 0;while((M=j(g()))===void 0)v();return W(),M}}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 D=$[Q];if(O&&D===void 0)return;let q=typeof D;if(q!==X||D===null)throw TypeError(`param "${Q}" is invalid: expected ${X}, got ${q}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,D])=>G(O,D,X));I(U,!1),I(J,!0)}var Hq=()=>{throw Error("not implemented")};/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var GU=BigInt(0),x$=BigInt(1),GJ=BigInt(2),I5=BigInt(3),J5=BigInt(4),G5=BigInt(5),jL=BigInt(7),Q5=BigInt(8),HL=BigInt(9),X5=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 sZ($,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=x$,X=x$,O=GU;while(J!==GU){let q=G/J,z=G-J*q,W=I-X*q,w=Q-O*q;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==x$)throw Error("invert: does not exist");return F$(I,U)}function Tq($,U,J){let G=$;if(!G.eql(G.sqr(U),J))throw Error("Cannot find square root")}function O5($,U){let J=$,G=(J.ORDER+x$)/J5,I=J.pow(U,G);return Tq(J,I,U),I}function TL($,U){let J=$,G=(J.ORDER-G5)/Q5,I=J.mul(U,GJ),Q=J.pow(I,G),X=J.mul(U,Q),O=J.mul(J.mul(X,GJ),Q),D=J.mul(X,J.sub(O,J.ONE));return Tq(J,D,U),D}function KL($){let U=Y4($),J=D5($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+jL)/X5;return(O,D)=>{let q=O,z=q.pow(D,X),W=q.mul(z,G),w=q.mul(z,I),v=q.mul(z,Q),g=q.eql(q.sqr(W),D),V=q.eql(q.sqr(w),D);z=q.cmov(z,W,g),W=q.cmov(v,w,V);let N=q.eql(q.sqr(W),D),j=q.cmov(z,W,N);return Tq(q,j,D),j}}function D5($){if($<I5)throw Error("sqrt is not defined for small field");let U=$-x$,J=0;while(U%GJ===GU)U/=GJ,J++;let G=GJ,I=Y4($);while($5(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return O5;let Q=I.pow(G,U),X=(U+x$)/GJ;return function(D,q){let z=D;if(z.is0(q))return q;if($5(z,q)!==1)throw Error("Cannot find square root");let W=J,w=z.mul(z.ONE,Q),v=z.pow(q,U),g=z.pow(q,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=x$<<BigInt(W-V-1),M=z.pow(w,j);W=V,w=z.sqr(M),v=z.mul(v,w),g=z.mul(g,M)}return g}}function AL($){if($%J5===I5)return O5;if($%Q5===G5)return TL;if($%X5===HL)return KL($);return D5($)}var o0=($,U)=>(F$($,U)&x$)===x$,PL=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Kq($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=PL.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<=x$)throw Error("invalid field: expected ORDER > 1, got "+$.ORDER);return $}function BL($,U,J){let G=$;if(J<GU)throw Error("invalid exponent, negatives unsupported");if(J===GU)return G.ONE;if(J===x$)return U;let I=G.ONE,Q=U;while(J>GU){if(J&x$)I=G.mul(I,Q);Q=G.sqr(Q),J>>=x$}return I}function F8($,U,J=!1){let G=$,I=Array(U.length).fill(J?G.ZERO:void 0),Q=U.reduce((O,D,q)=>{if(G.is0(D))return O;return I[q]=O,G.mul(O,D)},G.ONE),X=G.inv(Q);return U.reduceRight((O,D,q)=>{if(G.is0(D))return O;return I[q]=G.mul(O,I[q]),G.mul(O,D)},X),I}function $5($,U){let J=$,G=(J.ORDER-x$)/GJ,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 LL($,U){if(U!==void 0)jq(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=sJ($);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 U5=new WeakMap;class Aq{ORDER;BITS;BYTES;isLE;ZERO=GU;ONE=x$;_lengths;_mod;constructor($,U={}){if($<=x$)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}=LL($,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($&x$)===x$}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 BL(this,$,U)}div($,U){return F$($*sZ(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return sZ($,this.ORDER)}sqrt($){let U=U5.get(this);if(!U)U5.set(this,U=AL(this.ORDER));return U(this,$)}toBytes($){return this.isLE?f8($,this.BYTES):q4($,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 D=new Uint8Array(G);D.set($,I?0:D.length-$.length),$=D}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?Q0($):JJ($);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 F8(this,$)}cmov($,U,J){return c0(J,"condition"),J?U:$}}Object.freeze(Aq.prototype);function Y4($,U={}){return new Aq($,U)}function q5($){if(typeof $!=="bigint")throw Error("field order must be bigint");if($<=x$)throw Error("field order must be greater than 1");let U=sJ($-x$);return Math.ceil(U/8)}function Pq($){let U=q5($);return U+Math.ceil(U/2)}function z5($,U,J=!1){S$($);let G=$.length,I=q5(U),Q=Math.max(Pq(U),16);if(G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?Q0($):JJ($),O=F$(X,U-x$)+x$;return J?f8(O,I):q4(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var $G=BigInt(0),QJ=BigInt(1);function u8($,U){let J=U.negate();return $?J:U}function XJ($,U){let J=F8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function v5($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function Bq($,U){v5($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=k8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function Y5($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),D=$>>X;if(O>G)O-=Q,D+=QJ;let q=U*G,z=q+Math.abs(O)-1,W=O===0,w=O<0,v=U%2!==0;return{nextN:D,offset:z,isZero:W,isNeg:w,isNegF:v,offsetF:q}}var Lq=new WeakMap,V5=new WeakMap;function Sq($){return V5.get($)||1}function W5($){if($!==$G)throw Error("invalid wNAF")}class x8{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>$G){if(U&QJ)J=J.add(G);G=G.double(),U>>=QJ}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=Bq(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let D=1;D<G;D++)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=Bq($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:D,isZero:q,isNeg:z,isNegF:W,offsetF:w}=Y5(J,X,Q);if(J=O,q)I=I.add(u8(W,U[w]));else G=G.add(u8(z,U[D]))}return W5(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=Bq($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===$G)break;let{nextN:X,offset:O,isZero:D,isNeg:q}=Y5(J,Q,I);if(J=X,D)continue;else{let z=U[O];G=G.add(q?z.negate():z)}}return W5(J),G}getPrecomputes($,U,J){let G=Lq.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);Lq.set(U,G)}}return G}cached($,U,J){let G=Sq($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=Sq($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){v5(U,this.bits),V5.set($,U),Lq.delete($)}hasCache($){return Sq($)!==1}}function N5($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>$G||G>$G){if(J&QJ)Q=Q.add(I);if(G&QJ)X=X.add(I);I=I.double(),J>>=QJ,G>>=QJ}return{p1:Q,p2:X}}function w5($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return Kq(U),U}else return Y4($,{isLE:J})}function W4($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let D of["p","n","h"]){let q=U[D];if(!(typeof q==="bigint"&&q>$G))throw Error(`CURVE.${D} must be positive bigint`)}let I=w5(U.p,J.Fp,G),Q=w5(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let D of O)if(!I.isValid(U[D]))throw Error(`CURVE.${D} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function m8($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}function y8($,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 SL($,U){let J=new Uint8Array($.length);for(let G=0;G<$.length;G++)J[G]=$[G]^U[G];return J}function CL($){if(!tJ($)&&typeof $!=="string")throw Error("DST must be Uint8Array or ascii string");let U=typeof $==="string"?z4($):$;if(U.length===0)throw Error("DST must be non-empty");return U}function Cq($,U,J,G){if(S$($),M0(J),U=CL(U),U.length>255)U=G(JU(z4("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,y8(U.length,1)),D=new Uint8Array(Q),q=y8(J,2),z=Array(X),W=G(JU(D,$,q,y8(0,1),O));z[0]=G(JU(W,y8(1,1),O));for(let v=1;v<X;v++){let g=[SL(W,z[v-1]),y8(v+1,1),O];z[v]=G(JU(...g))}return JU(...z).slice(0,J)}var g5="HashToScalar-";/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var Z5=($,U)=>($+($>=0?U:-U)/M5)/U;function _L($,U,J){p0("scalar",$,j0,J);let[[G,I],[Q,X]]=U,O=Z5(X*$,J),D=Z5(-I*$,J),q=$-O*G-D*Q,z=-O*I-D*X,W=q<j0,w=z<j0;if(W)q=-q;if(w)z=-z;let v=k8(Math.ceil(sJ(J)/2))+RI;if(q<j0||q>=v||z<j0||z>=v)throw Error("splitScalar (endomorphism): failed for k");return{k1neg:W,k1:q,k2neg:w,k2:z}}function Eq($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function _q($,U){aU($);let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(c0(J.lowS,"lowS"),c0(J.prehash,"prehash"),J.format!==void 0)Eq(J.format);return J}class R5 extends Error{constructor($=""){super($)}}var X0={Err:R5,_tlv:{encode:($,U)=>{let{Err:J}=X0;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=b8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?b8(I.length/2|128):"";return b8($)+Q+I+U},decode($,U){let{Err:J}=X0;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 D=I&127;if(!D)throw new J("tlv.decode(long): indefinite length not supported");if(D>4)throw new J("tlv.decode(long): byte length is too big");let q=U.subarray(G,G+D);if(q.length!==D)throw new J("tlv.decode: length bytes not complete");if(q[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of q)X=X<<8|z;if(G+=D,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}=X0;if(D4($),$<j0)throw new U("integer: negative integers are not allowed");let J=b8($);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}=X0;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 JJ($)}},toSig($){let{Err:U,_int:J,_tlv:G}=X0,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:D}=G.decode(2,Q),{v:q,l:z}=G.decode(2,D);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(q)}},hexFromSig($){let{_tlv:U,_int:J}=X0,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}};Object.freeze(X0._tlv);Object.freeze(X0._int);Object.freeze(X0);var j0=BigInt(0),RI=BigInt(1),M5=BigInt(2),w4=BigInt(3),EL=BigInt(4);function j5($,U={}){let J=W4("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:D,allowInfinityPoint:q}=U;if(D){if(!G.is0(Q.a)||typeof D.beta!=="bigint"||!Array.isArray(D.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let z=T5(G,I);function W(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function w(_,A,E){if(q&&A.is0())return Uint8Array.of(0);let{x:R,y:K}=A.toAffine(),T=G.toBytes(R);if(c0(E,"isCompressed"),E){W();let b=!G.isOdd(K);return JU(H5(b),T)}else return JU(Uint8Array.of(4),T,G.toBytes(K))}function v(_){S$(_,void 0,"Point");let{publicKey:A,publicKeyUncompressed:E}=z,R=_.length,K=_[0],T=_.subarray(1);if(q&&R===1&&K===0)return{x:G.ZERO,y:G.ZERO};if(R===A&&(K===2||K===3)){let b=G.fromBytes(T);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((K&1)===1!==y)F=G.neg(F);return{x:b,y:F}}else if(R===E&&K===4){let b=G.BYTES,P=G.fromBytes(T.subarray(0,b)),F=G.fromBytes(T.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 ${R}, expected compressed=${A} or uncompressed=${E}`)}let g=U.toBytes===void 0?w:U.toBytes,V=U.fromBytes===void 0?v:U.fromBytes;function N(_){let A=G.sqr(_),E=G.mul(A,_);return G.add(G.add(E,G.mul(_,Q.a)),Q.b)}function j(_,A){let E=G.sqr(A),R=N(_);return G.eql(E,R)}if(!j(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let M=G.mul(G.pow(Q.a,w4),EL),S=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(M,S)))throw Error("bad curve params: a or b");function L(_,A,E=!1){if(!G.isValid(A)||E&&G.is0(A))throw Error(`bad point coordinate ${_}`);return A}function k(_){if(!(_ instanceof B))throw Error("Weierstrass Point expected")}function x(_){if(!D||!D.basises)throw Error("no endo");return _L(_,D.basises,I.ORDER)}function h(_,A,E,R,K){return E=new B(G.mul(E.X,_),E.Y,E.Z),A=u8(R,A),E=u8(K,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(_,A,E){this.X=L("x",_),this.Y=L("y",A,!0),this.Z=L("z",E),Object.freeze(this)}static CURVE(){return Q}static fromAffine(_){let{x:A,y:E}=_||{};if(!_||!G.isValid(A)||!G.isValid(E))throw Error("invalid affine point");if(_ 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(_){let A=B.fromAffine(V(S$(_,void 0,"point")));return A.assertValidity(),A}static fromHex(_){return B.fromBytes(aJ(_))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(_=8,A=!0){if(a.createCache(this,_),!A)this.multiply(w4);return this}assertValidity(){let _=this;if(_.is0()){if(U.allowInfinityPoint&&G.is0(_.X)&&G.eql(_.Y,G.ONE)&&G.is0(_.Z))return;throw Error("bad point: ZERO")}let{x:A,y:E}=_.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(!_.isTorsionFree())throw Error("bad point: not in prime-order subgroup")}hasEvenY(){let{y:_}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(_)}equals(_){k(_);let{X:A,Y:E,Z:R}=this,{X:K,Y:T,Z:b}=_,P=G.eql(G.mul(A,b),G.mul(K,R)),F=G.eql(G.mul(E,b),G.mul(T,R));return P&&F}negate(){return new B(this.X,G.neg(this.Y),this.Z)}double(){let{a:_,b:A}=Q,E=G.mul(A,w4),{X:R,Y:K,Z:T}=this,b=G.ZERO,P=G.ZERO,F=G.ZERO,y=G.mul(R,R),n=G.mul(K,K),$$=G.mul(T,T),X$=G.mul(R,K);return X$=G.add(X$,X$),F=G.mul(R,T),F=G.add(F,F),b=G.mul(_,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(_,$$),X$=G.sub(y,$$),X$=G.mul(_,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(K,T),$$=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(_){k(_);let{X:A,Y:E,Z:R}=this,{X:K,Y:T,Z:b}=_,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=Q.a,$$=G.mul(Q.b,w4),X$=G.mul(A,K),D$=G.mul(E,T),W$=G.mul(R,b),N$=G.add(A,E),v$=G.add(K,T);N$=G.mul(N$,v$),v$=G.add(X$,D$),N$=G.sub(N$,v$),v$=G.add(A,R);let V$=G.add(K,b);return v$=G.mul(v$,V$),V$=G.add(X$,W$),v$=G.sub(v$,V$),V$=G.add(E,R),P=G.add(T,b),V$=G.mul(V$,P),P=G.add(D$,W$),V$=G.sub(V$,P),y=G.mul(n,v$),P=G.mul($$,W$),y=G.add(P,y),P=G.sub(D$,y),y=G.add(D$,y),F=G.mul(P,y),D$=G.add(X$,X$),D$=G.add(D$,X$),W$=G.mul(n,W$),v$=G.mul($$,v$),D$=G.add(D$,W$),W$=G.sub(X$,W$),W$=G.mul(n,W$),v$=G.add(v$,W$),X$=G.mul(D$,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$,D$),y=G.mul(V$,y),y=G.add(y,X$),new B(P,F,y)}subtract(_){return k(_),this.add(_.negate())}is0(){return this.equals(B.ZERO)}multiply(_){let{endo:A}=U;if(!I.isValidNot0(_))throw RangeError("invalid scalar: out of range");let E,R,K=(T)=>a.cached(this,T,(b)=>XJ(B,b));if(A){let{k1neg:T,k1:b,k2neg:P,k2:F}=x(_),{p:y,f:n}=K(b),{p:$$,f:X$}=K(F);R=n.add(X$),E=h(A.beta,y,$$,T,P)}else{let{p:T,f:b}=K(_);E=T,R=b}return XJ(B,[E,R])[0]}multiplyUnsafe(_){let{endo:A}=U,E=this,R=_;if(!I.isValid(R))throw RangeError("invalid scalar: out of range");if(R===j0||E.is0())return B.ZERO;if(R===RI)return E;if(a.hasCache(this))return this.multiply(R);if(A){let{k1neg:K,k1:T,k2neg:b,k2:P}=x(R),{p1:F,p2:y}=N5(B,E,T,P);return h(A.beta,F,y,K,b)}else return a.unsafe(E,R)}toAffine(_){let A=this,E=_,{X:R,Y:K,Z:T}=A;if(G.eql(T,G.ONE))return{x:R,y:K};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(T);let P=G.mul(R,E),F=G.mul(K,E),y=G.mul(T,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:_}=U;if(X===RI)return!0;if(_)return _(B,this);return a.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:_}=U;if(X===RI)return this;if(_)return _(B,this);return this.multiplyUnsafe(X)}isSmallOrder(){if(X===RI)return this.is0();return this.clearCofactor().is0()}toBytes(_=!0){return c0(_,"isCompressed"),this.assertValidity(),g(B,this,_)}toHex(_=!0){return oJ(this.toBytes(_))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let m=I.BITS,a=new x8(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 H5($){return Uint8Array.of($?2:3)}function T5($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function bL($,U={}){let{Fn:J}=$,G=U.randomBytes===void 0?eJ:U.randomBytes,I=Object.assign(T5($.Fp,J),{seed:Math.max(Pq(J.ORDER),16)});function Q(v){try{let g=J.fromBytes(v);return J.isValidNot0(g)}catch(g){return!1}}function X(v,g){let{publicKey:V,publicKeyUncompressed:N}=I;try{let j=v.length;if(g===!0&&j!==V)return!1;if(g===!1&&j!==N)return!1;return!!$.fromBytes(v)}catch(j){return!1}}function O(v){return v=v===void 0?G(I.seed):v,z5(S$(v,I.seed,"seed"),J.ORDER)}function D(v,g=!0){return $.BASE.multiply(J.fromBytes(v)).toBytes(g)}function q(v){let{secretKey:g,publicKey:V,publicKeyUncompressed:N}=I,j=J._lengths;if(!tJ(v))return;let M=S$(v,void 0,"key").length,S=M===V||M===N,L=M===g||!!j?.includes(M);if(S&&L)return;return S}function z(v,g,V=!0){if(q(v)===!0)throw Error("first arg must be private key");if(q(g)===!1)throw Error("second arg must be public key");let N=J.fromBytes(v);return $.fromBytes(g).multiply(N).toBytes(V)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=m8(O,D);return Object.freeze(W),Object.freeze(I),Object.freeze({getPublicKey:D,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function K5($,U,J={}){let G=U;F0(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?(K,T)=>v0(G,K,T):J.hmac,{Fp:X,Fn:O}=$,{ORDER:D,BITS:q}=O,{keygen:z,getPublicKey:W,getSharedSecret:w,utils:v,lengths:g}=bL($,J),V={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},N=D*M5+RI<X.ORDER;function j(K){let T=D>>RI;return K>T}function M(K,T){if(!O.isValidNot0(T))throw Error(`invalid signature ${K}: out of range 1..Point.Fn.ORDER`);return T}function S(){if(N)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function L(K,T){Eq(T);let b=g.signature,P=T==="compact"?b:T==="recovered"?b+1:void 0;return S$(K,P)}class k{r;s;recovery;constructor(K,T,b){if(this.r=M("r",K),this.s=M("s",T),b!=null){if(S(),![0,1,2,3].includes(b))throw Error("invalid recovery id");this.recovery=b}Object.freeze(this)}static fromBytes(K,T=V.format){L(K,T);let b;if(T==="der"){let{r:n,s:$$}=X0.toSig(S$(K));return new k(n,$$)}if(T==="recovered")b=K[0],T="compact",K=K.subarray(1);let P=g.signature/2,F=K.subarray(0,P),y=K.subarray(P,P*2);return new k(O.fromBytes(F),O.fromBytes(y),b)}static fromHex(K,T){return this.fromBytes(aJ(K),T)}assertRecovery(){let{recovery:K}=this;if(K==null)throw Error("invalid recovery id: must be present");return K}addRecoveryBit(K){return new k(this.r,this.s,K)}recoverPublicKey(K){let{r:T,s:b}=this,P=this.assertRecovery(),F=P===2||P===3?T+D:T;if(!X.isValid(F))throw Error("invalid recovery id: sig.r+curve.n != R.x");let y=X.toBytes(F),n=$.fromBytes(JU(H5((P&1)===0),y)),$$=O.inv(F),X$=h(S$(K,void 0,"msgHash")),D$=O.create(-X$*$$),W$=O.create(b*$$),N$=$.BASE.multiplyUnsafe(D$).add(n.multiplyUnsafe(W$));if(N$.is0())throw Error("invalid recovery: point at infinify");return N$.assertValidity(),N$}hasHighS(){return j(this.s)}toBytes(K=V.format){if(Eq(K),K==="der")return aJ(X0.hexFromSig(this));let{r:T,s:b}=this,P=O.toBytes(T),F=O.toBytes(b);if(K==="recovered")return S(),JU(Uint8Array.of(this.assertRecovery()),P,F);return JU(P,F)}toHex(K){return oJ(this.toBytes(K))}}Object.freeze(k.prototype),Object.freeze(k);let x=J.bits2int===void 0?function(T){if(T.length>8192)throw Error("input is too large");let b=JJ(T),P=T.length*8-q;return P>0?b>>BigInt(P):b}:J.bits2int,h=J.bits2int_modN===void 0?function(T){return O.create(x(T))}:J.bits2int_modN,B=k8(q);function m(K){return p0("num < 2^"+q,K,j0,B),O.toBytes(K)}function a(K,T){return S$(K,void 0,"message"),T?S$(G(K),void 0,"prehashed message"):K}function _(K,T,b){let{lowS:P,prehash:F,extraEntropy:y}=_q(b,V);K=a(K,F);let n=h(K),$$=O.fromBytes(T);if(!O.isValidNot0($$))throw Error("invalid private key");let X$=[m($$),m(n)];if(y!=null&&y!==!1){let v$=y===!0?I(g.secretKey):y;X$.push(S$(v$,void 0,"extraEntropy"))}let D$=JU(...X$),W$=n;function N$(v$){let V$=x(v$);if(!O.isValidNot0(V$))return;let M$=O.inv(V$),b$=$.BASE.multiply(V$).toAffine(),k$=O.create(b$.x);if(k$===j0)return;let DU=O.create(M$*O.create(W$+k$*$$));if(DU===j0)return;let qU=(b$.x===k$?0:2)|Number(b$.y&RI),SU=DU;if(P&&j(DU))SU=O.neg(DU),qU^=1;return new k(k$,SU,N?void 0:qU)}return{seed:D$,k2sig:N$}}function A(K,T,b={}){let{seed:P,k2sig:F}=_(K,T,b);return eZ(G.outputLen,O.BYTES,Q)(P,F).toBytes(b.format)}function E(K,T,b,P={}){let{lowS:F,prehash:y,format:n}=_q(P,V);if(b=S$(b,void 0,"publicKey"),T=a(T,y),!tJ(K)){let $$=K instanceof k?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+$$)}L(K,n);try{let $$=k.fromBytes(K,n),X$=$.fromBytes(b);if(F&&$$.hasHighS())return!1;let{r:D$,s:W$}=$$,N$=h(T),v$=O.inv(W$),V$=O.create(N$*v$),M$=O.create(D$*v$),b$=$.BASE.multiplyUnsafe(V$).add(X$.multiplyUnsafe(M$));if(b$.is0())return!1;return O.create(b$.x)===D$}catch($$){return!1}}function R(K,T,b={}){let{prehash:P}=_q(b,V);return T=a(T,P),k.fromBytes(K,"recovered").recoverPublicKey(T).toBytes()}return Object.freeze({keygen:z,getPublicKey:W,getSharedSecret:w,utils:v,lengths:g,Point:$,sign:A,verify:E,recoverPublicKey:R,Signature:k,hash:G})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var fL=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))();var kL=j5(fL),UG=K5(kL,r$);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var MI=BigInt(0),_U=BigInt(1),bq=BigInt(2),FL=BigInt(8);function uL($,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 A5($,U={}){let J=U,G=W4("edwards",$,J,J.FpFnLE),{Fp:I,Fn:Q}=G,X=G.CURVE,{h:O}=X;aU(J,{},{uvRatio:"function"});let D=bq<<BigInt(Q.BYTES*8)-_U,q=(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:MI}}}:J.uvRatio;if(!uL(I,X,X.Gx,X.Gy))throw Error("bad curve params: generator point");function W(V,N,j=!1){let M=j?_U:MI;return p0("coordinate "+V,N,M,D),N}function w(V){if(!(V instanceof v))throw Error("EdwardsPoint expected")}class v{static BASE=new v(X.Gx,X.Gy,_U,q(X.Gx*X.Gy));static ZERO=new v(MI,_U,_U,MI);static Fp=I;static Fn=Q;X;Y;Z;T;constructor(V,N,j,M){this.X=W("x",V),this.Y=W("y",N),this.Z=W("z",j,!0),this.T=W("t",M),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,q(N*j))}static fromBytes(V,N=!1){let j=I.BYTES,{a:M,d:S}=X;V=ZI(S$(V,j,"point")),c0(N,"zip215");let L=ZI(V),k=V[j-1];L[j-1]=k&-129;let x=Q0(L),h=N?D:I.ORDER;p0("point.y",x,MI,h);let B=q(x*x),m=q(B-_U),a=q(S*B-M),{isValid:_,value:A}=z(m,a);if(!_)throw Error("bad point: invalid y coordinate");let E=(A&_U)===_U,R=(k&128)!==0;if(!N&&A===MI&&R)throw Error("bad point: x=0 and x_0=1");if(R!==E)A=q(-A);return v.fromAffine({x:A,y:x})}static fromHex(V,N=!1){return v.fromBytes(aJ(V),N)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(V=8,N=!0){if(g.createCache(this,V),!N)this.multiply(bq);return this}assertValidity(){let V=this,{a:N,d:j}=X;if(V.is0())throw Error("bad point: ZERO");let{X:M,Y:S,Z:L,T:k}=V,x=q(M*M),h=q(S*S),B=q(L*L),m=q(B*B),a=q(x*N),_=q(B*q(a+h)),A=q(m+q(j*q(x*h)));if(_!==A)throw Error("bad point: equation left != right (1)");let E=q(M*S),R=q(L*k);if(E!==R)throw Error("bad point: equation left != right (2)")}equals(V){w(V);let{X:N,Y:j,Z:M}=this,{X:S,Y:L,Z:k}=V,x=q(N*k),h=q(S*M),B=q(j*k),m=q(L*M);return x===h&&B===m}is0(){return this.equals(v.ZERO)}negate(){return new v(q(-this.X),this.Y,this.Z,q(-this.T))}double(){let{a:V}=X,{X:N,Y:j,Z:M}=this,S=q(N*N),L=q(j*j),k=q(bq*q(M*M)),x=q(V*S),h=N+j,B=q(q(h*h)-S-L),m=x+L,a=m-k,_=x-L,A=q(B*a),E=q(m*_),R=q(B*_),K=q(a*m);return new v(A,E,K,R)}add(V){w(V);let{a:N,d:j}=X,{X:M,Y:S,Z:L,T:k}=this,{X:x,Y:h,Z:B,T:m}=V,a=q(M*x),_=q(S*h),A=q(k*j*m),E=q(L*B),R=q((M+S)*(x+h)-a-_),K=E-A,T=E+A,b=q(_-N*a),P=q(R*K),F=q(T*b),y=q(R*b),n=q(K*T);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}=g.cached(this,V,(M)=>XJ(v,M));return XJ(v,[N,j])[0]}multiplyUnsafe(V){if(!Q.isValid(V))throw RangeError("invalid scalar: expected 0 <= sc < curve.n");if(V===MI)return v.ZERO;if(this.is0()||V===_U)return this;return g.unsafe(this,V,(N)=>XJ(v,N))}isSmallOrder(){return this.clearCofactor().is0()}isTorsionFree(){return g.unsafe(this,X.n).is0()}toAffine(V){let N=this,j=V,{X:M,Y:S,Z:L}=N,k=N.is0();if(j==null)j=k?FL:I.inv(L);let x=q(M*j),h=q(S*j),B=I.mul(L,j);if(k)return{x:MI,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 oJ(this.toBytes())}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let g=new x8(v,Q.BITS);if(Q.BITS>=8)v.BASE.precompute(8);return Object.freeze(v.prototype),Object.freeze(v),v}class fq{static BASE;static ZERO;static Fp;static Fn;ep;constructor($){this.ep=$}static fromBytes($){Hq()}static fromHex($){Hq()}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 oJ(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 r8=BigInt(0),IG=BigInt(1),v4=BigInt(2);function xL($){return aU($,{P:"bigint",type:"string",adjustScalarBytes:"function",powPminus2:"function"},{randomBytes:"function"}),Object.freeze({...$})}function P5($){let U=xL($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let D=X===void 0?eJ:X,q=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),v=O?v4**BigInt(254):v4**BigInt(447),g=O?BigInt(8)*v4**BigInt(251)-IG:BigInt(4)*v4**BigInt(445)-IG,V=v+g+IG,N=(R)=>F$(R,J),j=M(W);function M(R){return f8(N(R),z)}function S(R){let K=ZI(S$(R,z,"uCoordinate"));if(O)K[31]&=127;return N(Q0(K))}function L(R){return Q0(I(ZI(S$(R,z,"scalar"))))}function k(R,K){let T=a(S(K),L(R));if(T===r8)throw Error("invalid private or public key received");return M(T)}function x(R){return k(R,j)}let h=x,B=k;function m(R,K,T){let b=N(R*(K-T));return K=N(K-b),T=N(T+b),{x_2:K,x_3:T}}function a(R,K){p0("u",R,r8,J),p0("scalar",K,v,V);let T=K,b=R,P=IG,F=r8,y=R,n=IG,$$=r8;for(let D$=BigInt(q-1);D$>=r8;D$--){let W$=T>>D$&IG;$$^=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,M$=N(V$*V$),b$=v$-M$,k$=y+n,DU=y-n,qU=N(DU*N$),SU=N(k$*V$),W0=qU+SU,w0=qU-SU;y=N(W0*W0),n=N(b*N(w0*w0)),P=N(v$*M$),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 _={secretKey:z,publicKey:z,seed:z},A=(R)=>{return R=R===void 0?D(z):R,S$(R,_.seed,"seed"),R},E={randomSecretKey:A};return Object.freeze(_),Object.freeze(E),Object.freeze({keygen:m8(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:_})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var mL=BigInt(0),a0=BigInt(1),B5=BigInt(2),yL=BigInt(3),rL=BigInt(5),hL=BigInt(8),DJ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),xq=(()=>({p:DJ,n:BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),h:hL,a:BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),d:BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),Gx:BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),Gy:BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")}))();function C5($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=DJ,O=$*$%Q*$%Q,D=tU(O,B5,Q)*O%Q,q=tU(D,a0,Q)*$%Q,z=tU(q,rL,Q)*q%Q,W=tU(z,U,Q)*z%Q,w=tU(W,J,Q)*W%Q,v=tU(w,G,Q)*w%Q,g=tU(v,I,Q)*v%Q,V=tU(g,I,Q)*v%Q,N=tU(V,U,Q)*z%Q;return{pow_p_5_8:tU(N,B5,Q)*$%Q,b2:O}}function lL($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var kq=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");function mq($,U){let J=DJ,G=F$(U*U*U,J),I=F$(G*G*U,J),Q=C5($*I).pow_p_5_8,X=F$($*G*Q,J),O=F$(U*X*X,J),D=X,q=F$(X*kq,J),z=O===$,W=O===F$(-$,J),w=O===F$(-$*kq,J);if(z)X=D;if(W||w)X=q;if(o0(X,J))X=F$(-X,J);return{isValid:z||W,value:X}}var OJ=A5(xq,{uvRatio:mq}),jI=(()=>OJ.Fp)(),_5=(()=>OJ.Fn)();var V4=(()=>{let $=DJ;return P5({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=C5(U);return F$(tU(J,yL,$)*G,$)},adjustScalarBytes:lL})})();var Fq=kq,dL=BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"),nL=BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"),iL=BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"),cL=BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"),L5=($)=>mq(a0,$),pL=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),uq=($)=>jI.create(Q0($)&pL);function S5($){let{d:U}=xq,J=DJ,G=(j)=>jI.create(j),I=G(Fq*$*$),Q=G((I+a0)*iL),X=BigInt(-1),O=G((X-U*I)*G(I+U)),{isValid:D,value:q}=mq(Q,O),z=G(q*$);if(!o0(z,J))z=G(-z);if(!D)q=z;if(!D)X=I;let W=G(X*(I-a0)*cL-O),w=q*q,v=G((q+q)*O),g=G(W*dL),V=G(a0-w),N=G(a0+w);return new OJ(G(v*N),G(V*g),G(g*N),G(v*V))}class TU extends fq{static BASE=(()=>new TU(OJ.BASE))();static ZERO=(()=>new TU(OJ.ZERO))();static Fp=(()=>jI)();static Fn=(()=>_5)();constructor($){super($)}static fromAffine($){return new TU(OJ.fromAffine($))}assertSame($){if(!($ instanceof TU))throw Error("RistrettoPoint expected")}init($){return new TU($)}static fromBytes($){t$($,32);let{a:U,d:J}=xq,G=DJ,I=(S)=>jI.create(S),Q=uq($);if(!tZ(jI.toBytes(Q),$)||o0(Q,G))throw Error("invalid ristretto255 encoding 1");let X=I(Q*Q),O=I(a0+U*X),D=I(a0-U*X),q=I(O*O),z=I(D*D),W=I(U*J*q-z),{isValid:w,value:v}=L5(I(W*z)),g=I(v*D),V=I(v*g*W),N=I((Q+Q)*g);if(o0(N,G))N=I(-N);let j=I(O*V),M=I(N*j);if(!w||o0(M,G)||j===mL)throw Error("invalid ristretto255 encoding 2");return new TU(new OJ(N,j,a0,M))}static fromHex($){return TU.fromBytes(O8($))}toBytes(){let{X:$,Y:U,Z:J,T:G}=this.ep,I=DJ,Q=(V)=>jI.create(V),X=Q(Q(J+U)*Q(J-U)),O=Q($*U),D=Q(O*O),{value:q}=L5(Q(X*D)),z=Q(q*X),W=Q(q*O),w=Q(z*W*G),v;if(o0(G*w,I)){let V=Q(U*Fq),N=Q($*Fq);$=V,U=N,v=Q(z*nL)}else v=W;if(o0($*w,I))U=Q(-U);let g=Q((J-U)*v);if(o0(g,I))g=Q(-g);return jI.toBytes(g)}equals($){this.assertSame($);let{X:U,Y:J}=this.ep,{X:G,Y:I}=$.ep,Q=(D)=>jI.create(D),X=Q(U*I)===Q(J*G),O=Q(J*I)===Q(U*G);return X||O}is0(){return this.equals(TU.ZERO)}}Object.freeze(TU.BASE);Object.freeze(TU.ZERO);Object.freeze(TU.prototype);Object.freeze(TU);var oL=Object.freeze({Point:TU,hashToCurve($,U){let J=U?.DST===void 0?"ristretto255_XMD:SHA-512_R255MAP_RO_":U.DST,G=Cq($,J,64,bQ);return oL.deriveToCurve(G)},hashToScalar($,U={DST:g5}){let J=Cq($,U.DST,64,bQ);return _5.create(Q0(J))},deriveToCurve($){t$($,64);let U=uq($.subarray(0,32)),J=S5(U),G=uq($.subarray(32,64)),I=S5(G);return new TU(J.add(I))}});var E5=!1,aL=!1;async function b5($,U){if(aL)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 N4($,U){return await b5(async()=>{let J=yq($)?$:await eL($),G=await crypto.subtle.importKey("raw",sL(U),{name:"X25519"},E5,[]);return new Uint8Array(await crypto.subtle.deriveBits({name:"X25519",public:G},J,256))},()=>{if(yq($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return V4.scalarMult($,U)})}async function h8($){return await b5(async()=>{return N4($,V4.GuBytes)},()=>{if(yq($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return V4.scalarMultBase($)})}var tL=new Uint8Array([48,46,2,1,0,48,5,6,3,43,101,110,4,34,4,32]);async function eL($){if($.length!==32)throw Error("X25519 private key must be 32 bytes");let U=new Uint8Array([...tL,...$]);return crypto.subtle.importKey("pkcs8",U,{name:"X25519"},E5,["deriveBits"])}function yq($){return typeof CryptoKey<"u"&&$ instanceof CryptoKey}function sL($){return $}class rq{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),US(qJ($));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=qJ($),null;this.buf=J.value}}close(){return this.s.releaseLock(),{rest:this.buf,transcript:qJ(this.transcript)}}}function US($){return $.forEach((U)=>{if(U<32||U>126)throw Error("invalid non-ASCII byte in header")}),new TextDecoder().decode($)}function qJ($){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 JG($,...U){return $.pipeThrough(new TransformStream({start(J){for(let G of U)J.enqueue(G)}}))}function g4($){return new ReadableStream({start(U){U.enqueue($),U.close()}})}async function hq($){if(!($ instanceof ReadableStream))throw Error("readAll expects a ReadableStream<Uint8Array>");return new Uint8Array(await new Response($).arrayBuffer())}async function f5($){if(!($ instanceof ReadableStream))throw Error("readAllString expects a ReadableStream<Uint8Array>");return await new Response($).text()}async function k5($,U){let J=$.getReader(),G=[],I=0;while(I<U){let{done:D,value:q}=await J.read();if(D)throw Error("stream ended before reading "+U.toString()+" bytes");G.push(q),I+=q.length}J.releaseLock();let Q=qJ(G),X=Q.subarray(0,U),O=JG($,Q.subarray(U));return{data:X,rest:O}}class H0{args;body;constructor($,U){this.args=$,this.body=U}}async function IS($){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=WU.decode(Q);if(X.length>48)throw Error("invalid stanza");if(G.push(X),X.length<48)break}let I=qJ(G);return{s:new H0(J,I)}}async function F5($){let U=new rq($),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 IS(U);if(I!==void 0){G.push(I);continue}if(!Q.startsWith("--- "))throw Error("invalid header");let X=WU.decode(Q.slice(4)),{rest:O,transcript:D}=U.close(),q=D.slice(0,D.length-1-Q.length+3);return{stanzas:G,headerNoMAC:q,MAC:X,headerSize:D.length,rest:JG($,O)}}}function lq($){let U=[];U.push(`age-encryption.org/v1
+`)}function rg($){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 RU($,U){let J=$[U];return typeof J==="string"?J:void 0}function AQ($,U){let J=$[U];return typeof J==="boolean"?J:void 0}var PQ={name:"@rizom/ops",version:"0.2.0-alpha.298",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/profile":"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 wS,mkdirSync as vS,readFileSync as Oz,writeFileSync as Dz}from"fs";import{dirname as VS,join as n5}from"path";function RD($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function y$($,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=RD($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",D=G?`length=${I}`:`type=${typeof $}`,q=X+"expected Uint8Array"+O+", got "+D;if(!G)throw TypeError(q);throw RangeError(q)}return $}function F0($){if(typeof $!=="function"||typeof $.create!=="function")throw TypeError("Hash must wrapped by utils.createHasher");if(y$($.outputLen),y$($.blockLen),$.outputLen<1)throw Error('"outputLen" must be >= 1');if($.blockLen<1)throw Error('"blockLen" must be >= 1')}function uJ($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function BQ($,U){t$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw RangeError('"digestInto() output" expected to be of length >='+J)}function LQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function MU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function xJ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function I0($,U){return $<<32-U|$>>>U}function P$($,U){return $<<U|$>>>32-U>>>0}var EP=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function bP($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function fP($){for(let U=0;U<$.length;U++)$[U]=bP($[U]);return $}var MD=EP?($)=>$:fP,lg=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),kP=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function SQ($){if(t$($),lg)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=kP[$[J]];return U}var k0={_0:48,_9:57,A:65,F:70,a:97,f:102};function hg($){if($>=k0._0&&$<=k0._9)return $-k0._0;if($>=k0.A&&$<=k0.F)return $-(k0.A-10);if($>=k0.a&&$<=k0.f)return $-(k0.a-10);return}function O8($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);if(lg)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=hg($.charCodeAt(Q)),O=hg($.charCodeAt(Q+1));if(X===void 0||O===void 0){let D=$[Q]+$[Q+1];throw RangeError('hex string expected, got non-hex character "'+D+'" at index '+Q)}G[I]=X*16+O}return G}function FP($){if(typeof $!=="string")throw TypeError("string expected");return new Uint8Array(new TextEncoder().encode($))}function jD($,U=""){if(typeof $==="string")return FP($);return t$($,void 0,U)}function HD(...$){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 CQ($,U){if(U!==void 0&&{}.toString.call(U)!=="[object Object]")throw TypeError("options must be object or undefined");return Object.assign($,U)}function TD($,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 u0($=32){y$($,"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 KD=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});class AD{oHash;iHash;blockLen;outputLen;canXOF=!1;finished=!1;destroyed=!1;constructor($,U){if(F0($),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),MU(G)}update($){return uJ(this),this.iHash.update($),this}digestInto($){uJ(this),BQ($,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 v0=(()=>{let $=(U,J,G)=>new AD(U,J).update(G).digest();return $.create=(U,J)=>new AD(U,J),$})();function D8($,U,J){if(F0($),J===void 0)J=new Uint8Array($.outputLen);return v0($,J,U)}var PD=Uint8Array.of(0),dg=Uint8Array.of();function BD($,U,J,G=32){F0($),y$(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=dg;else t$(J,void 0,"info");let X=new Uint8Array(Q*I),O=v0.create($,U),D=O._cloneInto(),q=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)PD[0]=z+1,D.update(z===0?dg:q).update(J).update(PD).digestInto(q),X.set(q,I*z),O._cloneInto(D);return O.destroy(),D.destroy(),MU(q,PD),X.slice(0,G)}var GI=($,U,J,G,I)=>BD($,D8($,U,J),G,I);function ng($,U,J){return $&U^~$&J}function ig($,U,J){return $&U^$&J^U&J}class _Q{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=xJ(this.buffer)}update($){uJ(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=xJ($);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($){uJ(this),BQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,MU(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=xJ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let D=O/4,q=this.get();if(D>q.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<D;z++)X.setUint32(4*z,q[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 x0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),m0=Uint32Array.from([3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]),e$=Uint32Array.from([3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]),s$=Uint32Array.from([1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209]);var EQ=BigInt(4294967295),cg=BigInt(32);function uP($,U=!1){if(U)return{h:Number($&EQ),l:Number($>>cg&EQ)};return{h:Number($>>cg&EQ)|0,l:Number($&EQ)|0}}function pg($,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}=uP($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var LD=($,U,J)=>$>>>J,SD=($,U,J)=>$<<32-J|U>>>J,lI=($,U,J)=>$>>>J|U<<32-J,dI=($,U,J)=>$<<32-J|U>>>J,q8=($,U,J)=>$<<64-J|U>>>J-32,z8=($,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 og=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),ag=($,U,J,G)=>U+J+G+($/4294967296|0)|0,tg=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),eg=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,sg=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),$7=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var mP=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]),QI=new Uint32Array(64);class CD extends _Q{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)QI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=QI[z-15],w=QI[z-2],v=I0(W,7)^I0(W,18)^W>>>3,g=I0(w,17)^I0(w,19)^w>>>10;QI[z]=g+QI[z-7]+v+QI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:D,H:q}=this;for(let z=0;z<64;z++){let W=I0(X,6)^I0(X,11)^I0(X,25),w=q+W+ng(X,O,D)+mP[z]+QI[z]|0,g=(I0(J,2)^I0(J,13)^I0(J,22))+ig(J,G,I)|0;q=D,D=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+g|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,D=D+this.G|0,q=q+this.H|0,this.set(J,G,I,Q,X,O,D,q)}roundClean(){MU(QI)}destroy(){this.destroyed=!0,this.set(0,0,0,0,0,0,0,0),MU(this.buffer)}}class U7 extends CD{A=x0[0]|0;B=x0[1]|0;C=x0[2]|0;D=x0[3]|0;E=x0[4]|0;F=x0[5]|0;G=x0[6]|0;H=x0[7]|0;constructor(){super(32)}}class yP extends CD{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(28)}}var I7=(()=>pg(["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($))))(),rP=(()=>I7[0])(),hP=(()=>I7[1])(),XI=new Uint32Array(80),OI=new Uint32Array(80);class Y8 extends _Q{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:D,El:q,Fh:z,Fl:W,Gh:w,Gl:v,Hh:g,Hl:V}=this;return[$,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,V]}set($,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,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=D|0,this.El=q|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=v|0,this.Hh=g|0,this.Hl=V|0}process($,U){for(let M=0;M<16;M++,U+=4)XI[M]=$.getUint32(U),OI[M]=$.getUint32(U+=4);for(let M=16;M<80;M++){let S=XI[M-15]|0,L=OI[M-15]|0,k=lI(S,L,1)^lI(S,L,8)^LD(S,L,7),x=dI(S,L,1)^dI(S,L,8)^SD(S,L,7),h=XI[M-2]|0,B=OI[M-2]|0,m=lI(h,B,19)^q8(h,B,61)^LD(h,B,6),a=dI(h,B,19)^z8(h,B,61)^SD(h,B,6),_=tg(x,a,OI[M-7],OI[M-16]),A=eg(_,k,m,XI[M-7],XI[M-16]);XI[M]=A|0,OI[M]=_|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:D,Dl:q,Eh:z,El:W,Fh:w,Fl:v,Gh:g,Gl:V,Hh:N,Hl:j}=this;for(let M=0;M<80;M++){let S=lI(z,W,14)^lI(z,W,18)^q8(z,W,41),L=dI(z,W,14)^dI(z,W,18)^z8(z,W,41),k=z&w^~z&g,x=W&v^~W&V,h=sg(j,L,x,hP[M],OI[M]),B=$7(h,N,S,k,rP[M],XI[M]),m=h|0,a=lI(J,G,28)^q8(J,G,34)^q8(J,G,39),_=dI(J,G,28)^z8(J,G,34)^z8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=g|0,j=V|0,g=w|0,V=v|0,w=z|0,v=W|0,{h:z,l:W}=V0(D|0,q|0,B|0,m|0),D=X|0,q=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let R=og(m,_,E);J=ag(R,B,a,A),G=R|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:D,l:q}=V0(this.Dh|0,this.Dl|0,D|0,q|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:g,l:V}=V0(this.Gh|0,this.Gl|0,g|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,D,q,z,W,w,v,g,V,N,j)}roundClean(){MU(XI,OI)}destroy(){this.destroyed=!0,MU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class J7 extends Y8{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(64)}}class lP extends Y8{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(48)}}var zU=Uint32Array.from([2352822216,424955298,1944164710,2312950998,502970286,855612546,1738396948,1479516111,258812777,2077511080,2011393907,79989058,1067287976,1780299464,286451373,2446758561]),YU=Uint32Array.from([573645204,4230739756,2673172387,3360449730,596883563,1867755857,2520282905,1497426621,2519219938,2827943907,3193839141,1401305490,721525244,746961066,246885852,2177182882]);class dP extends Y8{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(28)}}class nP extends Y8{Ah=YU[0]|0;Al=YU[1]|0;Bh=YU[2]|0;Bl=YU[3]|0;Ch=YU[4]|0;Cl=YU[5]|0;Dh=YU[6]|0;Dl=YU[7]|0;Eh=YU[8]|0;El=YU[9]|0;Fh=YU[10]|0;Fl=YU[11]|0;Gh=YU[12]|0;Gl=YU[13]|0;Hh=YU[14]|0;Hl=YU[15]|0;constructor(){super(32)}}var r$=TD(()=>new U7,KD(1));var bQ=TD(()=>new J7,KD(3));/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function xQ($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function bD($){if(!xQ($))throw TypeError("Uint8Array expected")}function D7($,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 q7($){if(typeof $!=="function")throw TypeError("function expected");return!0}function DI($,U){if(typeof U!=="string")throw TypeError(`${$}: string expected`);return!0}function w8($){if(typeof $!=="number")throw TypeError(`number expected, got ${typeof $}`);if(!Number.isSafeInteger($))throw RangeError(`invalid integer: ${$}`)}function kQ($){if(!Array.isArray($))throw TypeError("array expected")}function FQ($,U){if(!D7(!0,U))throw TypeError(`${$}: array of strings expected`)}function fD($,U){if(!D7(!1,U))throw TypeError(`${$}: array of numbers expected`)}function xU(...$){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 mU($){let U=typeof $==="string"?$.split(""):$,J=U.length;FQ("alphabet",U);let G=new Map(U.map((I,Q)=>[I,Q]));return{encode:(I)=>{return kQ(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 kQ(I),I.map((Q)=>{DI("alphabet.decode",Q);let X=G.get(Q);if(X===void 0)throw Error(`Unknown letter: "${Q}". Allowed: ${$}`);return X})}}}function yU($=""){return DI("join",$),{encode:(U)=>{return FQ("join.decode",U),U.join($)},decode:(U)=>{return DI("join.decode",U),U.split($)}}}function mQ($,U="="){return w8($),DI("padding",U),{encode(J){FQ("padding.encode",J);while(J.length*$%8)J.push(U);return J},decode(J){FQ("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 z7($){return q7($),{encode:(U)=>U,decode:(U)=>$(U)}}function G7($,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(kQ($),!$.length)return[];let G=0,I=[],Q=Array.from($,(O)=>{if(w8(O),O<0||O>=U)throw Error(`invalid integer: ${O}`);return O}),X=Q.length;while(!0){let O=0,D=!0;for(let q=G;q<X;q++){let z=Q[q],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 g=Math.floor(v);if(Q[q]=g,!Number.isSafeInteger(g)||g*J+O!==w)throw Error("convertRadix: carry overflow");if(!D)continue;else if(!g)G=q;else D=!1}if(I.push(O),D)break}for(let O=0;O<$.length-1&&$[O]===0;O++)I.push(0);return I.reverse()}var Y7=($,U)=>U===0?$:Y7(U,$%U),uQ=($,U)=>$+(U-Y7($,U)),fQ=(()=>{let $=[];for(let U=0;U<40;U++)$.push(2**U);return $})();function _D($,U,J,G){if(kQ($),U<=0||U>32)throw RangeError(`convertRadix2: wrong from=${U}`);if(J<=0||J>32)throw RangeError(`convertRadix2: wrong to=${J}`);if(uQ(U,J)>32)throw Error(`convertRadix2: carry overflow from=${U} to=${J} carryBits=${uQ(U,J)}`);let I=0,Q=0,X=fQ[U],O=fQ[J]-1,D=[];for(let q of $){if(w8(q),q>=X)throw Error(`convertRadix2: invalid data word=${q} from=${U}`);if(I=I<<U|q,Q+U>32)throw Error(`convertRadix2: carry overflow pos=${Q} from=${U}`);Q+=U;for(;Q>=J;Q-=J)D.push((I>>Q-J&O)>>>0);let z=fQ[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)D.push(I>>>0);return D}function iP($){w8($);let U=256;return{encode:(J)=>{if(!xQ(J))throw TypeError("radix.encode input should be Uint8Array");return G7(Array.from(J),U,$)},decode:(J)=>{return fD("radix.decode",J),Uint8Array.from(G7(J,$,U))}}}function iU($,U=!1){if(w8($),$<=0||$>32)throw RangeError("radix2: bits should be in (0..32]");if(uQ(8,$)>32||uQ($,8)>32)throw RangeError("radix2: carry overflow");return{encode:(J)=>{if(!xQ(J))throw TypeError("radix2.encode input should be Uint8Array");return _D(Array.from(J),8,$,!U)},decode:(J)=>{return fD("radix2.decode",J),Uint8Array.from(_D(J,$,8,U))}}}function Q7($){return q7($),function(...U){try{return $.apply(null,U)}catch(J){}}}var Tl=Object.freeze(xU(iU(4),mU("0123456789ABCDEF"),yU(""))),Kl=Object.freeze(xU(iU(5),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),mQ(5),yU(""))),Al=Object.freeze(xU(iU(5),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),yU(""))),Pl=Object.freeze(xU(iU(5),mU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),mQ(5),yU(""))),Bl=Object.freeze(xU(iU(5),mU("0123456789ABCDEFGHIJKLMNOPQRSTUV"),yU(""))),Ll=Object.freeze(xU(iU(5),mU("0123456789ABCDEFGHJKMNPQRSTVWXYZ"),yU(""),z7(($)=>$.toUpperCase().replace(/O/g,"0").replace(/[IL]/g,"1")))),W7=(()=>typeof Uint8Array.from([]).toBase64==="function"&&typeof Uint8Array.fromBase64==="function")(),cP=/[\t\n\f\r ]/,w7=($,U)=>{DI("base64",$);let J=U?"base64url":"base64";if($.length>0&&cP.test($))throw Error("invalid base64");return Uint8Array.fromBase64($,{alphabet:J,lastChunkHandling:"strict"})},kD=Object.freeze(W7?{encode($){return bD($),$.toBase64()},decode($){return w7($,!1)}}:xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),mQ(6),yU(""))),WU=Object.freeze(xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),yU(""))),Sl=Object.freeze(W7?{encode($){return bD($),$.toBase64({alphabet:"base64url"})},decode($){return w7($,!0)}}:xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),mQ(6),yU(""))),Cl=Object.freeze(xU(iU(6),mU("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),yU(""))),FD=($)=>xU(iP(58),mU($),yU("")),_l=Object.freeze(FD("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz")),El=Object.freeze(FD("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ")),bl=Object.freeze(FD("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz"));var ED=xU(mU("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),yU("")),X7=[996825010,642813549,513874426,1027748829,705979059];function W8($){let U=$>>25,J=($&33554431)<<5;for(let G=0;G<X7.length;G++)if((U>>G&1)===1)J^=X7[G];return J}function O7($,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=W8(I)^X>>5}I=W8(I);for(let Q=0;Q<G;Q++)I=W8(I)^$.charCodeAt(Q)&31;for(let Q of U)I=W8(I)^Q;for(let Q=0;Q<6;Q++)I=W8(I);return I^=J,ED.encode(_D([I%fQ[30]],30,5,!1))}function v7($){let U=$==="bech32"?1:734539939,J=iU(5),G=J.decode,I=J.encode,Q=Q7(G);function X(W,w,v=90){if(DI("bech32.encode prefix",W),xQ(w))w=Array.from(w);fD("bech32.encode",w);let g=W.length;if(g===0)throw TypeError(`Invalid prefix length ${g}`);let V=g+7+w.length;if(v!==!1&&V>v)throw TypeError(`Length ${V} exceeds limit ${v}`);let N=W.toLowerCase(),j=O7(N,w,U);return`${N}1${ED.encode(w)}${j}`}function O(W,w=90){DI("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 g=W.toLowerCase();if(W!==g&&W!==W.toUpperCase())throw Error("String must be lowercase or uppercase");let V=g.lastIndexOf("1");if(V===0||V===-1)throw Error('Letter "1" must be present between prefix and data only');let N=g.slice(0,V),j=g.slice(V+1);if(j.length<6)throw Error("Data must be at least 6 characters long");let M=ED.decode(j).slice(0,-6),S=O7(N,M,U);if(!j.endsWith(S))throw Error(`Invalid checksum in ${W}: expected "${S}"`);return{prefix:N,words:M}}let D=Q7(O);function q(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:q,decodeUnsafe:D,fromWords:G,fromWordsUnsafe:Q,toWords:I}}var rU=Object.freeze(v7("bech32")),fl=Object.freeze(v7("bech32m"));var pP=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),oP={encode($){return bD($),$.toHex()},decode($){return DI("hex",$),Uint8Array.fromHex($)}},kl=Object.freeze(pP?oP:xU(iU(4),mU("0123456789abcdef"),yU(""),z7(($)=>{if(typeof $!=="string"||$.length%2!==0)throw TypeError(`hex.decode: expected string, got ${typeof $} with length ${$.length}`);return $.toLowerCase()})));function tP($,U,J,G){F0($);let I=CQ({dkLen:32,asyncTick:10},G),{c:Q,dkLen:X,asyncTick:O}=I;if(y$(Q,"c"),y$(X,"dkLen"),y$(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 D=jD(U,"password"),q=jD(J,"salt"),z=new Uint8Array(X),W=v0.create($,D),w=W._cloneInto().update(q);return{c:Q,dkLen:X,asyncTick:O,DK:z,PRF:W,PRFSalt:w}}function eP($,U,J,G,I){if($.destroy(),U.destroy(),G)G.destroy();return MU(I),J}function uD($,U,J,G){let{c:I,dkLen:Q,DK:X,PRF:O,PRFSalt:D}=tP($,U,J,G),q,z=new Uint8Array(4),W=xJ(z),w=new Uint8Array(O.outputLen);for(let v=1,g=0;g<Q;v++,g+=O.outputLen){let V=X.subarray(g,g+O.outputLen);W.setInt32(0,v,!1),(q=D._cloneInto(q)).update(z).digestInto(w),V.set(w.subarray(0,V.length));for(let N=1;N<I;N++){O._cloneInto(q).update(w).digestInto(w);for(let j=0;j<V.length;j++)V[j]^=w[j]}}return eP(O,D,X,q,w)}function V7($,U,J,G,I,Q){let X=$[U++]^J[G++],O=$[U++]^J[G++],D=$[U++]^J[G++],q=$[U++]^J[G++],z=$[U++]^J[G++],W=$[U++]^J[G++],w=$[U++]^J[G++],v=$[U++]^J[G++],g=$[U++]^J[G++],V=$[U++]^J[G++],N=$[U++]^J[G++],j=$[U++]^J[G++],M=$[U++]^J[G++],S=$[U++]^J[G++],L=$[U++]^J[G++],k=$[U++]^J[G++],x=X,h=O,B=D,m=q,a=z,_=W,A=w,E=v,R=g,K=V,T=N,b=j,P=M,F=S,y=L,n=k;for(let $$=0;$$<8;$$+=2)a^=P$(x+P|0,7),R^=P$(a+x|0,9),P^=P$(R+a|0,13),x^=P$(P+R|0,18),K^=P$(_+h|0,7),F^=P$(K+_|0,9),h^=P$(F+K|0,13),_^=P$(h+F|0,18),y^=P$(T+A|0,7),B^=P$(y+T|0,9),A^=P$(B+y|0,13),T^=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$(_+a|0,7),E^=P$(A+_|0,9),a^=P$(E+A|0,13),_^=P$(a+E|0,18),b^=P$(T+K|0,7),R^=P$(b+T|0,9),K^=P$(R+b|0,13),T^=P$(K+R|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++]=D+B|0,I[Q++]=q+m|0,I[Q++]=z+a|0,I[Q++]=W+_|0,I[Q++]=w+A|0,I[Q++]=v+E|0,I[Q++]=g+R|0,I[Q++]=V+K|0,I[Q++]=N+T|0,I[Q++]=j+b|0,I[Q++]=M+P|0,I[Q++]=S+F|0,I[Q++]=L+y|0,I[Q++]=k+n|0}function xD($,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(V7(J,X,$,U,J,Q),O>0)X+=16;V7(J,Q,$,U+=16,J,X)}}function sP($,U,J){let G=CQ({dkLen:32,asyncTick:10,maxmem:1073742848},J),{N:I,r:Q,p:X,dkLen:O,asyncTick:D,maxmem:q,onProgress:z}=G;if(y$(I,"N"),y$(Q,"r"),y$(X,"p"),y$(O,"dkLen"),y$(D,"asyncTick"),y$(q,"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 g=W*(I+X+1);if(g>q)throw Error('"maxmem" limit was hit: memUsed(128*r*(N+p+1))='+g+", maxmem="+q);let V=uD(r$,$,U,{c:1,dkLen:W*X}),N=LQ(V),j=LQ(new Uint8Array(W*I)),M=LQ(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:M,blockMixCb:S,asyncTick:D}}function $B($,U,J,G,I){let Q=uD(r$,$,J,{c:1,dkLen:U});return MU(J,G,I),Q}function mD($,U,J){let{N:G,r:I,p:Q,dkLen:X,blockSize32:O,V:D,B32:q,B:z,tmp:W,blockMixCb:w}=sP($,U,J);MD(q);for(let v=0;v<Q;v++){let g=O*v;for(let V=0;V<O;V++)D[V]=q[g+V];for(let V=0,N=0;V<G-1;V++)xD(D,N,D,N+=O,I),w();xD(D,(G-1)*O,q,g,I),w();for(let V=0;V<G;V++){let N=(q[g+O-16]&G-1)>>>0;for(let j=0;j<O;j++)W[j]=q[g+j]^D[N*O+j];xD(W,0,q,g,I),w()}}return MD(q),$B($,X,z,D,W)}/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */function UB($){return $ instanceof Uint8Array||ArrayBuffer.isView($)&&$.constructor.name==="Uint8Array"&&"BYTES_PER_ELEMENT"in $&&$.BYTES_PER_ELEMENT===1}function yQ($){if(typeof $!=="boolean")throw TypeError(`boolean expected, not ${$}`)}function mJ($){if(typeof $!=="number")throw TypeError("number expected, got "+typeof $);if(!Number.isSafeInteger($)||$<0)throw RangeError("positive integer expected, got "+$)}function n$($,U,J=""){let G=UB($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",D=G?`length=${I}`:`type=${typeof $}`,q=X+"expected Uint8Array"+O+", got "+D;if(!G)throw TypeError(q);throw RangeError(q)}return $}function yD($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function N7($,U,J=!1){n$($,void 0,"output");let G=U.outputLen;if($.length<G)throw RangeError("digestInto() expects output buffer of length at least "+G);if(J&&!yJ($))throw Error("invalid output, must be aligned")}function N0($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function J0(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function IB($){return new DataView($.buffer,$.byteOffset,$.byteLength)}var nI=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)(),JB=($)=>$<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255;var GB=($)=>{for(let U=0;U<$.length;U++)$[U]=JB($[U]);return $},y0=nI?($)=>$:GB;function g7($,U){if(U==null||typeof U!=="object")throw Error("options must be defined");return Object.assign($,U)}function Z7($,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 R7($,U,J){let G=U,I=J||(()=>[]),Q=(O,D)=>G(D,...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,...D)=>G(O,...D),Q}var M7=($,U)=>{function J(G,...I){if(n$(G,void 0,"key"),$.nonceLength!==void 0){let z=I[0];n$(z,$.varSizeNonce?void 0:$.nonceLength,"nonce")}let Q=$.tagLength;if(Q&&I[1]!==void 0)n$(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");n$(W,void 0,"output")}},D=!1;return{encrypt(z,W){if(D)throw Error("cannot encrypt() twice with same key + nonce");return D=!0,n$(z),O(X.encrypt.length,W),X.encrypt(z,W)},decrypt(z,W){if(n$(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 v8($,U,J=!0){if(U===void 0)return new Uint8Array($);if(n$(U,void 0,"output"),U.length!==$)throw Error('"output" expected Uint8Array of length '+$+", got: "+U.length);if(J&&!yJ(U))throw Error("invalid output, must be aligned");return U}function j7($,U,J){mJ($),mJ(U),yQ(J);let G=new Uint8Array(16),I=IB(G);return I.setBigUint64(0,BigInt(U),J),I.setBigUint64(8,BigInt($),J),G}function yJ($){return $.byteOffset%4===0}function rJ($){return Uint8Array.from(n$($))}var T7=($)=>Uint8Array.from($.split(""),(U)=>U.charCodeAt(0)),QB=(()=>y0(N0(T7("expand 16-byte k"))))(),XB=(()=>y0(N0(T7("expand 32-byte k"))))();function B$($,U){return $<<U|$>>>32-U}var V8=64,OB=16,rD=(()=>4294967295)(),H7=Uint32Array.of();function DB($,U,J,G,I,Q,X,O){let D=I.length,q=new Uint8Array(V8),z=N0(q),W=nI&&yJ(I)&&yJ(Q),w=W?N0(I):H7,v=W?N0(Q):H7;if(!nI){for(let g=0;g<D;X++){if($(U,J,G,z,X,O),y0(z),X>=rD)throw Error("arx: counter overflow");let V=Math.min(V8,D-g);for(let N=0,j;N<V;N++)j=g+N,Q[j]=I[j]^q[N];g+=V}return}for(let g=0;g<D;X++){if($(U,J,G,z,X,O),X>=rD)throw Error("arx: counter overflow");let V=Math.min(V8,D-g);if(W&&V===V8){let N=g/4;if(g%4!==0)throw Error("arx: invalid block position");for(let j=0,M;j<OB;j++)M=N+j,v[M]=w[M]^z[j];g+=V8;continue}for(let N=0,j;N<V;N++)j=g+N,Q[j]=I[j]^q[N];g+=V}}function K7($,U){let{allowShortKeys:J,extendNonceFn:G,counterLength:I,counterRight:Q,rounds:X}=g7({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},U);if(typeof $!=="function")throw Error("core must be a function");return mJ(I),mJ(X),yQ(Q),yQ(J),(O,D,q,z,W=0)=>{n$(O,void 0,"key"),n$(D,void 0,"nonce"),n$(q,void 0,"data");let w=q.length;if(z=v8(w,z,!1),mJ(W),W<0||W>=rD)throw Error("arx: counter overflow");let v=[],g=O.length,V,N;if(g===32)v.push(V=rJ(O)),N=XB;else if(g===16&&J)V=new Uint8Array(32),V.set(O),V.set(O,16),N=QB,v.push(V);else throw n$(O,32,"arx key"),Error("invalid key size");if(!nI||!yJ(D))v.push(D=rJ(D));let j=N0(V);if(G){if(D.length!==24)throw Error("arx: extended nonce must be 24 bytes");let L=D.subarray(0,16);if(nI)G(N,j,N0(L),j);else{let k=y0(Uint32Array.from(N));G(k,j,N0(L),j),J0(k),y0(j)}D=D.subarray(16)}else if(!nI)y0(j);let M=16-I;if(M!==D.length)throw Error(`arx: nonce must be ${M} or 16 bytes`);if(M!==12){let L=new Uint8Array(12);L.set(D,Q?0:12-D.length),D=L,v.push(D)}let S=y0(N0(D));try{return DB($,N,j,S,q,z,W,X),z}finally{J0(...v)}}}function $U($,U){return $[U++]&255|($[U++]&255)<<8}class A7{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($){$=rJ(n$($,32,"key"));let U=$U($,0),J=$U($,2),G=$U($,4),I=$U($,6),Q=$U($,8),X=$U($,10),O=$U($,12),D=$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|D<<8)&8191,this.r[9]=D>>>5&127;for(let q=0;q<8;q++)this.pad[q]=$U($,16+2*q)}process($,U,J=!1){let G=J?0:2048,{h:I,r:Q}=this,X=Q[0],O=Q[1],D=Q[2],q=Q[3],z=Q[4],W=Q[5],w=Q[6],v=Q[7],g=Q[8],V=Q[9],N=$U($,U+0),j=$U($,U+2),M=$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|M<<6)&8191),_=I[3]+((M>>>7|S<<9)&8191),A=I[4]+((S>>>4|L<<12)&8191),E=I[5]+(L>>>1&8191),R=I[6]+((L>>>14|k<<2)&8191),K=I[7]+((k>>>11|x<<5)&8191),T=I[8]+((x>>>8|h<<8)&8191),b=I[9]+(h>>>5|G),P=0,F=P+B*X+m*(5*V)+a*(5*g)+_*(5*v)+A*(5*w);P=F>>>13,F&=8191,F+=E*(5*W)+R*(5*z)+K*(5*q)+T*(5*D)+b*(5*O),P+=F>>>13,F&=8191;let y=P+B*O+m*X+a*(5*V)+_*(5*g)+A*(5*v);P=y>>>13,y&=8191,y+=E*(5*w)+R*(5*W)+K*(5*z)+T*(5*q)+b*(5*D),P+=y>>>13,y&=8191;let n=P+B*D+m*O+a*X+_*(5*V)+A*(5*g);P=n>>>13,n&=8191,n+=E*(5*v)+R*(5*w)+K*(5*W)+T*(5*z)+b*(5*q),P+=n>>>13,n&=8191;let $$=P+B*q+m*D+a*O+_*X+A*(5*V);P=$$>>>13,$$&=8191,$$+=E*(5*g)+R*(5*v)+K*(5*w)+T*(5*W)+b*(5*z),P+=$$>>>13,$$&=8191;let X$=P+B*z+m*q+a*D+_*O+A*X;P=X$>>>13,X$&=8191,X$+=E*(5*V)+R*(5*g)+K*(5*v)+T*(5*w)+b*(5*W),P+=X$>>>13,X$&=8191;let D$=P+B*W+m*z+a*q+_*D+A*O;P=D$>>>13,D$&=8191,D$+=E*X+R*(5*V)+K*(5*g)+T*(5*v)+b*(5*w),P+=D$>>>13,D$&=8191;let W$=P+B*w+m*W+a*z+_*q+A*D;P=W$>>>13,W$&=8191,W$+=E*O+R*X+K*(5*V)+T*(5*g)+b*(5*v),P+=W$>>>13,W$&=8191;let N$=P+B*v+m*w+a*W+_*z+A*q;P=N$>>>13,N$&=8191,N$+=E*D+R*O+K*X+T*(5*V)+b*(5*g),P+=N$>>>13,N$&=8191;let v$=P+B*g+m*v+a*w+_*W+A*z;P=v$>>>13,v$&=8191,v$+=E*q+R*D+K*O+T*X+b*(5*V),P+=v$>>>13,v$&=8191;let V$=P+B*V+m*g+a*v+_*w+A*W;P=V$>>>13,V$&=8191,V$+=E*z+R*q+K*D+T*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]=D$,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;J0(J)}update($){yD(this),n$($),$=rJ($);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,J0(this.h,this.r,this.buffer,this.pad)}digestInto($){yD(this),N7($,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 P7=R7(32,($)=>new A7($));function qB($,U,J,G,I,Q=20){let X=$[0],O=$[1],D=$[2],q=$[3],z=U[0],W=U[1],w=U[2],v=U[3],g=U[4],V=U[5],N=U[6],j=U[7],M=I,S=J[0],L=J[1],k=J[2],x=X,h=O,B=D,m=q,a=z,_=W,A=w,E=v,R=g,K=V,T=N,b=j,P=M,F=S,y=L,n=k;for(let X$=0;X$<Q;X$+=2)x=x+a|0,P=B$(P^x,16),R=R+P|0,a=B$(a^R,12),x=x+a|0,P=B$(P^x,8),R=R+P|0,a=B$(a^R,7),h=h+_|0,F=B$(F^h,16),K=K+F|0,_=B$(_^K,12),h=h+_|0,F=B$(F^h,8),K=K+F|0,_=B$(_^K,7),B=B+A|0,y=B$(y^B,16),T=T+y|0,A=B$(A^T,12),B=B+A|0,y=B$(y^B,8),T=T+y|0,A=B$(A^T,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+_|0,n=B$(n^x,16),T=T+n|0,_=B$(_^T,12),x=x+_|0,n=B$(n^x,8),T=T+n|0,_=B$(_^T,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),R=R+F|0,E=B$(E^R,12),B=B+E|0,F=B$(F^B,8),R=R+F|0,E=B$(E^R,7),m=m+a|0,y=B$(y^m,16),K=K+y|0,a=B$(a^K,12),m=m+a|0,y=B$(y^m,8),K=K+y|0,a=B$(a^K,7);let $$=0;G[$$++]=X+x|0,G[$$++]=O+h|0,G[$$++]=D+B|0,G[$$++]=q+m|0,G[$$++]=z+a|0,G[$$++]=W+_|0,G[$$++]=w+A|0,G[$$++]=v+E|0,G[$$++]=g+R|0,G[$$++]=V+K|0,G[$$++]=N+T|0,G[$$++]=j+b|0,G[$$++]=M+P|0,G[$$++]=S+F|0,G[$$++]=L+y|0,G[$$++]=k+n|0}var zB=K7(qB,{counterRight:!1,counterLength:4,allowShortKeys:!1});var YB=new Uint8Array(16),B7=($,U)=>{$.update(U);let J=U.length%16;if(J)$.update(YB.subarray(J))},WB=new Uint8Array(32);function L7($,U,J,G,I){if(I!==void 0)n$(I,void 0,"AAD");let Q=$(U,J,WB),X=j7(G.length,I?I.length:0,!0),O=P7.create(Q);if(I)B7(O,I);B7(O,G),O.update(X);let D=O.digest();return J0(Q,X),D}var wB=($)=>(U,J,G)=>{return{encrypt(Q,X){let O=Q.length;X=v8(O+16,X,!1),X.set(Q);let D=X.subarray(0,-16);$(U,J,D,D,1);let q=L7($,U,J,D,G);return X.set(q,O),J0(q),X},decrypt(Q,X){X=v8(Q.length-16,X,!1);let O=Q.subarray(0,-16),D=Q.subarray(-16),q=L7($,U,J,O,G);if(!Z7(D,q))throw J0(q),Error("invalid tag");return X.set(Q.subarray(0,-16)),$(U,J,X,X,1),J0(q),X}}},cU=M7({blockSize:64,nonceLength:12,tagLength:16},wB(zB));/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function hJ($){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 Z$($,U,J=""){let G=hJ($),I=$?.length,Q=U!==void 0;if(!G||Q&&I!==U){let X=J&&`"${J}" `,O=Q?` of length ${U}`:"",D=G?`length=${I}`:`type=${typeof $}`;throw Error(X+"expected Uint8Array"+O+", got "+D)}return $}function pU($){if(typeof $!=="function"||typeof $.create!=="function")throw Error("Hash must wrapped by utils.createHasher");p$($.outputLen),p$($.blockLen)}function h0($,U=!0){if($.destroyed)throw Error("Hash instance has been destroyed");if(U&&$.finished)throw Error("Hash#digest() has already been called")}function rQ($,U){Z$($,void 0,"digestInto() output");let J=U.outputLen;if($.length<J)throw Error('"digestInto() output" expected to be of length >='+J)}function hQ($){return new Uint32Array($.buffer,$.byteOffset,Math.floor($.byteLength/4))}function CU(...$){for(let U=0;U<$.length;U++)$[U].fill(0)}function lQ($){return new DataView($.buffer,$.byteOffset,$.byteLength)}function G0($,U){return $<<32-U|$>>>U}var vB=(()=>new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68)();function VB($){return $<<24&4278190080|$<<8&16711680|$>>>8&65280|$>>>24&255}function NB($){for(let U=0;U<$.length;U++)$[U]=VB($[U]);return $}var hD=vB?($)=>$:NB,C7=(()=>typeof Uint8Array.from([]).toHex==="function"&&typeof Uint8Array.fromHex==="function")(),gB=Array.from({length:256},($,U)=>U.toString(16).padStart(2,"0"));function iI($){if(Z$($),C7)return $.toHex();let U="";for(let J=0;J<$.length;J++)U+=gB[$[J]];return U}var r0={_0:48,_9:57,A:65,F:70,a:97,f:102};function S7($){if($>=r0._0&&$<=r0._9)return $-r0._0;if($>=r0.A&&$<=r0.F)return $-(r0.A-10);if($>=r0.a&&$<=r0.f)return $-(r0.a-10);return}function cI($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);if(C7)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=S7($.charCodeAt(Q)),O=S7($.charCodeAt(Q+1));if(X===void 0||O===void 0){let D=$[Q]+$[Q+1];throw Error('hex string expected, got non-hex character "'+D+'" at index '+Q)}G[I]=X*16+O}return G}function l$(...$){let U=0;for(let G=0;G<$.length;G++){let I=$[G];Z$(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 lJ($,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 qI($=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 zI=($)=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,$])});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var dD=BigInt(0),lD=BigInt(1);function N8($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw Error(J+"expected boolean, got type="+typeof $)}return $}function _7($){if(typeof $==="bigint"){if(!dQ($))throw Error("positive bigint expected, got "+$)}else p$($);return $}function g8($){let U=_7($).toString(16);return U.length&1?"0"+U:U}function E7($){if(typeof $!=="string")throw Error("hex string expected, got "+typeof $);return $===""?dD:BigInt("0x"+$)}function YI($){return E7(iI($))}function WI($){return E7(iI(nQ(Z$($)).reverse()))}function dJ($,U){p$(U),$=_7($);let J=cI($.toString(16).padStart(U*2,"0"));if(J.length!==U)throw Error("number too large");return J}function Z8($,U){return dJ($,U).reverse()}function nQ($){return Uint8Array.from($)}function wI($){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 dQ=($)=>typeof $==="bigint"&&dD<=$;function ZB($,U,J){return dQ($)&&dQ(U)&&dQ(J)&&U<=$&&$<J}function R8($,U,J,G){if(!ZB(U,J,G))throw Error("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function nD($){let U;for(U=0;$>dD;$>>=lD,U+=1);return U}var M8=($)=>(lD<<BigInt($))-lD;function b7($,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,D=G($),q=G($),z=0,W=()=>{D.fill(1),q.fill(0),z=0},w=(...N)=>J(q,l$(D,...N)),v=(N=I)=>{if(q=w(Q,N),D=w(),N.length===0)return;q=w(X,N),D=w()},g=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){D=w();let M=D.slice();j.push(M),N+=D.length}return l$(...j)};return(N,j)=>{W(),v(N);let M=void 0;while(!(M=j(g())))v();return W(),M}}function pI($,U={},J={}){if(!$||typeof $!=="object")throw Error("expected valid options object");function G(Q,X,O){let D=$[Q];if(O&&D===void 0)return;let q=typeof D;if(q!==X||D===null)throw Error(`param "${Q}" is invalid: expected ${X}, got ${q}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,D])=>G(O,D,X));I(U,!1),I(J,!0)}function iD($){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 HU=BigInt(0),wU=BigInt(1),oI=BigInt(2),F7=BigInt(3),u7=BigInt(4),x7=BigInt(5),RB=BigInt(7),m7=BigInt(8),MB=BigInt(9),y7=BigInt(16);function jU($,U){let J=$%U;return J>=HU?J:U+J}function oU($,U,J){let G=$;while(U-- >HU)G*=G,G%=J;return G}function f7($,U){if($===HU)throw Error("invert: expected non-zero number");if(U<=HU)throw Error("invert: expected positive modulus, got "+U);let J=jU($,U),G=U,I=HU,Q=wU,X=wU,O=HU;while(J!==HU){let q=G/J,z=G%J,W=I-X*q,w=Q-O*q;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==wU)throw Error("invert: does not exist");return jU(I,U)}function cD($,U,J){if(!$.eql($.sqr(U),J))throw Error("Cannot find square root")}function r7($,U){let J=($.ORDER+wU)/u7,G=$.pow(U,J);return cD($,G,U),G}function jB($,U){let J=($.ORDER-x7)/m7,G=$.mul(U,oI),I=$.pow(G,J),Q=$.mul(U,I),X=$.mul($.mul(Q,oI),I),O=$.mul(Q,$.sub(X,$.ONE));return cD($,O,U),O}function HB($){let U=iQ($),J=h7($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+RB)/y7;return(O,D)=>{let q=O.pow(D,X),z=O.mul(q,G),W=O.mul(q,I),w=O.mul(q,Q),v=O.eql(O.sqr(z),D),g=O.eql(O.sqr(W),D);q=O.cmov(q,z,v),z=O.cmov(w,W,g);let V=O.eql(O.sqr(z),D),N=O.cmov(q,z,V);return cD(O,N,D),N}}function h7($){if($<F7)throw Error("sqrt is not defined for small field");let U=$-wU,J=0;while(U%oI===HU)U/=oI,J++;let G=oI,I=iQ($);while(k7(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return r7;let Q=I.pow(G,U),X=(U+wU)/oI;return function(D,q){if(D.is0(q))return q;if(k7(D,q)!==1)throw Error("Cannot find square root");let z=J,W=D.mul(D.ONE,Q),w=D.pow(q,U),v=D.pow(q,X);while(!D.eql(w,D.ONE)){if(D.is0(w))return D.ZERO;let g=1,V=D.sqr(w);while(!D.eql(V,D.ONE))if(g++,V=D.sqr(V),g===z)throw Error("Cannot find square root");let N=wU<<BigInt(z-g-1),j=D.pow(W,N);z=g,W=D.sqr(j),w=D.mul(w,W),v=D.mul(v,j)}return v}}function TB($){if($%u7===F7)return r7;if($%m7===x7)return jB;if($%y7===MB)return HB($);return h7($)}var KB=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function pD($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=KB.reduce((G,I)=>{return G[I]="function",G},U);return pI($,J),$}function AB($,U,J){if(J<HU)throw Error("invalid exponent, negatives unsupported");if(J===HU)return $.ONE;if(J===wU)return U;let G=$.ONE,I=U;while(J>HU){if(J&wU)G=$.mul(G,I);I=$.sqr(I),J>>=wU}return G}function j8($,U,J=!1){let G=Array(U.length).fill(J?$.ZERO:void 0),I=U.reduce((X,O,D)=>{if($.is0(O))return X;return G[D]=X,$.mul(X,O)},$.ONE),Q=$.inv(I);return U.reduceRight((X,O,D)=>{if($.is0(O))return X;return G[D]=$.mul(X,G[D]),$.mul(X,O)},Q),G}function k7($,U){let J=($.ORDER-wU)/oI,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 PB($,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 l7{ORDER;BITS;BYTES;isLE;ZERO=HU;ONE=wU;_lengths;_sqrt;_mod;constructor($,U={}){if($<=HU)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}=PB($,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 jU($,this.ORDER)}isValid($){if(typeof $!=="bigint")throw Error("invalid field element: expected bigint, got "+typeof $);return HU<=$&&$<this.ORDER}is0($){return $===HU}isValidNot0($){return!this.is0($)&&this.isValid($)}isOdd($){return($&wU)===wU}neg($){return jU(-$,this.ORDER)}eql($,U){return $===U}sqr($){return jU($*$,this.ORDER)}add($,U){return jU($+U,this.ORDER)}sub($,U){return jU($-U,this.ORDER)}mul($,U){return jU($*U,this.ORDER)}pow($,U){return AB(this,$,U)}div($,U){return jU($*f7(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return f7($,this.ORDER)}sqrt($){if(!this._sqrt)this._sqrt=TB(this.ORDER);return this._sqrt(this,$)}toBytes($){return this.isLE?Z8($,this.BYTES):dJ($,this.BYTES)}fromBytes($,U=!1){Z$($);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 D=new Uint8Array(G);D.set($,I?0:D.length-$.length),$=D}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?WI($):YI($);if(X)O=jU(O,Q);if(!U){if(!this.isValid(O))throw Error("invalid field element: outside of range 0..ORDER")}return O}invertBatch($){return j8(this,$)}cmov($,U,J){return J?U:$}}function iQ($,U={}){return new l7($,U)}function d7($){if(typeof $!=="bigint")throw Error("field order must be bigint");let U=$.toString(2).length;return Math.ceil(U/8)}function oD($){let U=d7($);return U+Math.ceil(U/2)}function n7($,U,J=!1){Z$($);let G=$.length,I=d7(U),Q=oD(U);if(G<16||G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?WI($):YI($),O=jU(X,U-wU)+wU;return J?Z8(O,I):dJ(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var nJ=BigInt(0),aI=BigInt(1);function H8($,U){let J=U.negate();return $?J:U}function sD($,U){let J=j8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function o7($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function aD($,U){o7($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=M8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function i7($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),D=$>>X;if(O>G)O-=Q,D+=aI;let q=U*G,z=q+Math.abs(O)-1,W=O===0,w=O<0,v=U%2!==0;return{nextN:D,offset:z,isZero:W,isNeg:w,isNegF:v,offsetF:q}}var tD=new WeakMap,a7=new WeakMap;function eD($){return a7.get($)||1}function c7($){if($!==nJ)throw Error("invalid wNAF")}class $q{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>nJ){if(U&aI)J=J.add(G);G=G.double(),U>>=aI}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=aD(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let D=1;D<G;D++)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=aD($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:D,isZero:q,isNeg:z,isNegF:W,offsetF:w}=i7(J,X,Q);if(J=O,q)I=I.add(H8(W,U[w]));else G=G.add(H8(z,U[D]))}return c7(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=aD($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===nJ)break;let{nextN:X,offset:O,isZero:D,isNeg:q}=i7(J,Q,I);if(J=X,D)continue;else{let z=U[O];G=G.add(q?z.negate():z)}}return c7(J),G}getPrecomputes($,U,J){let G=tD.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);tD.set(U,G)}}return G}cached($,U,J){let G=eD($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=eD($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){o7(U,this.bits),a7.set($,U),tD.delete($)}hasCache($){return eD($)!==1}}function t7($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>nJ||G>nJ){if(J&aI)Q=Q.add(I);if(G&aI)X=X.add(I);I=I.double(),J>>=aI,G>>=aI}return{p1:Q,p2:X}}function p7($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return pD(U),U}else return iQ($,{isLE:J})}function e7($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let D of["p","n","h"]){let q=U[D];if(!(typeof q==="bigint"&&q>nJ))throw Error(`CURVE.${D} must be positive bigint`)}let I=p7(U.p,J.Fp,G),Q=p7(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let D of O)if(!I.isValid(U[D]))throw Error(`CURVE.${D} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function cQ($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var T8=BigInt(0),iJ=BigInt(1),pQ=BigInt(2);function BB($){return pI($,{adjustScalarBytes:"function",powPminus2:"function"}),Object.freeze({...$})}function s7($){let U=BB($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let D=X||qI,q=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),v=O?pQ**BigInt(254):pQ**BigInt(447),g=O?BigInt(8)*pQ**BigInt(251)-iJ:BigInt(4)*pQ**BigInt(445)-iJ,V=v+g+iJ,N=(R)=>jU(R,J),j=M(W);function M(R){return Z8(N(R),z)}function S(R){let K=nQ(Z$(R,z,"uCoordinate"));if(O)K[31]&=127;return N(WI(K))}function L(R){return WI(I(nQ(Z$(R,z,"scalar"))))}function k(R,K){let T=a(S(K),L(R));if(T===T8)throw Error("invalid private or public key received");return M(T)}function x(R){return k(R,j)}let h=x,B=k;function m(R,K,T){let b=N(R*(K-T));return K=N(K-b),T=N(T+b),{x_2:K,x_3:T}}function a(R,K){R8("u",R,T8,J),R8("scalar",K,v,V);let T=K,b=R,P=iJ,F=T8,y=R,n=iJ,$$=T8;for(let D$=BigInt(q-1);D$>=T8;D$--){let W$=T>>D$&iJ;$$^=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,M$=N(V$*V$),b$=v$-M$,k$=y+n,DU=y-n,qU=N(DU*N$),SU=N(k$*V$),W0=qU+SU,w0=qU-SU;y=N(W0*W0),n=N(b*N(w0*w0)),P=N(v$*M$),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 _={secretKey:z,publicKey:z,seed:z},A=(R=D(z))=>{return Z$(R,_.seed,"seed"),R},E={randomSecretKey:A};return Object.freeze({keygen:cQ(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:_})}class Uq{oHash;iHash;blockLen;outputLen;finished=!1;destroyed=!1;constructor($,U){if(pU($),Z$(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),CU(G)}update($){return h0(this),this.iHash.update($),this}digestInto($){h0(this),Z$($,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 cJ=($,U,J)=>new Uq($,U).update(J).digest();cJ.create=($,U)=>new Uq($,U);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var $Z=($,U)=>($+($>=0?U:-U)/IZ)/U;function LB($,U,J){let[[G,I],[Q,X]]=U,O=$Z(X*$,J),D=$Z(-I*$,J),q=$-O*G-D*Q,z=-O*I-D*X,W=q<l0,w=z<l0;if(W)q=-q;if(w)z=-z;let v=M8(Math.ceil(nD(J)/2))+pJ;if(q<l0||q>=v||z<l0||z>=v)throw Error("splitScalar (endomorphism): failed, k="+$);return{k1neg:W,k1:q,k2neg:w,k2:z}}function Jq($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function Iq($,U){let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(N8(J.lowS,"lowS"),N8(J.prehash,"prehash"),J.format!==void 0)Jq(J.format);return J}class UZ extends Error{constructor($=""){super($)}}var vI={Err:UZ,_tlv:{encode:($,U)=>{let{Err:J}=vI;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=g8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?g8(I.length/2|128):"";return g8($)+Q+I+U},decode($,U){let{Err:J}=vI,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 D=I&127;if(!D)throw new J("tlv.decode(long): indefinite length not supported");if(D>4)throw new J("tlv.decode(long): byte length is too big");let q=U.subarray(G,G+D);if(q.length!==D)throw new J("tlv.decode: length bytes not complete");if(q[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of q)X=X<<8|z;if(G+=D,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}=vI;if($<l0)throw new U("integer: negative integers are not allowed");let J=g8($);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}=vI;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 YI($)}},toSig($){let{Err:U,_int:J,_tlv:G}=vI,I=Z$($,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:D}=G.decode(2,Q),{v:q,l:z}=G.decode(2,D);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(q)}},hexFromSig($){let{_tlv:U,_int:J}=vI,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}},l0=BigInt(0),pJ=BigInt(1),IZ=BigInt(2),oQ=BigInt(3),SB=BigInt(4);function Gq($,U={}){let J=e7("weierstrass",$,U),{Fp:G,Fn:I}=J,Q=J.CURVE,{h:X,n:O}=Q;pI(U,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object"});let{endo:D}=U;if(D){if(!G.is0(Q.a)||typeof D.beta!=="bigint"||!Array.isArray(D.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let q=GZ(G,I);function z(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function W(A,E,R){let{x:K,y:T}=E.toAffine(),b=G.toBytes(K);if(N8(R,"isCompressed"),R){z();let P=!G.isOdd(T);return l$(JZ(P),b)}else return l$(Uint8Array.of(4),b,G.toBytes(T))}function w(A){Z$(A,void 0,"Point");let{publicKey:E,publicKeyUncompressed:R}=q,K=A.length,T=A[0],b=A.subarray(1);if(K===E&&(T===2||T===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 D$=X$ instanceof Error?": "+X$.message:"";throw Error("bad point: is not on curve, sqrt error"+D$)}z();let n=G.isOdd(y);if((T&1)===1!==n)y=G.neg(y);return{x:P,y}}else if(K===R&&T===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 ${K}, expected compressed=${E} or uncompressed=${R}`)}let v=U.toBytes||W,g=U.fromBytes||w;function V(A){let E=G.sqr(A),R=G.mul(E,A);return G.add(G.add(R,G.mul(A,Q.a)),Q.b)}function N(A,E){let R=G.sqr(E),K=V(A);return G.eql(R,K)}if(!N(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let j=G.mul(G.pow(Q.a,oQ),SB),M=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(j,M)))throw Error("bad curve params: a or b");function S(A,E,R=!1){if(!G.isValid(E)||R&&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(!D||!D.basises)throw Error("no endo");return LB(A,D.basises,I.ORDER)}let x=iD((A,E)=>{let{X:R,Y:K,Z:T}=A;if(G.eql(T,G.ONE))return{x:R,y:K};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(T);let P=G.mul(R,E),F=G.mul(K,E),y=G.mul(T,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=iD((A)=>{if(A.is0()){if(U.allowInfinityPoint&&!G.is0(A.Y))return;throw Error("bad point: ZERO")}let{x:E,y:R}=A.toAffine();if(!G.isValid(E)||!G.isValid(R))throw Error("bad point: x or y not field elements");if(!N(E,R))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,R,K,T){return R=new m(G.mul(R.X,A),R.Y,R.Z),E=H8(K,E),R=H8(T,R),E.add(R)}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,R){this.X=S("x",A),this.Y=S("y",E,!0),this.Z=S("z",R),Object.freeze(this)}static CURVE(){return Q}static fromAffine(A){let{x:E,y:R}=A||{};if(!A||!G.isValid(E)||!G.isValid(R))throw Error("invalid affine point");if(A instanceof m)throw Error("projective point not allowed");if(G.is0(E)&&G.is0(R))return m.ZERO;return new m(E,R,G.ONE)}static fromBytes(A){let E=m.fromAffine(g(Z$(A,void 0,"point")));return E.assertValidity(),E}static fromHex(A){return m.fromBytes(cI(A))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(A=8,E=!0){if(_.createCache(this,A),!E)this.multiply(oQ);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:R,Z:K}=this,{X:T,Y:b,Z:P}=A,F=G.eql(G.mul(E,P),G.mul(T,K)),y=G.eql(G.mul(R,P),G.mul(b,K));return F&&y}negate(){return new m(this.X,G.neg(this.Y),this.Z)}double(){let{a:A,b:E}=Q,R=G.mul(E,oQ),{X:K,Y:T,Z:b}=this,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=G.mul(K,K),$$=G.mul(T,T),X$=G.mul(b,b),D$=G.mul(K,T);return D$=G.add(D$,D$),y=G.mul(K,b),y=G.add(y,y),P=G.mul(A,y),F=G.mul(R,X$),F=G.add(P,F),P=G.sub($$,F),F=G.add($$,F),F=G.mul(P,F),P=G.mul(D$,P),y=G.mul(R,y),X$=G.mul(A,X$),D$=G.sub(n,X$),D$=G.mul(A,D$),D$=G.add(D$,y),y=G.add(n,n),n=G.add(y,n),n=G.add(n,X$),n=G.mul(n,D$),F=G.add(F,n),X$=G.mul(T,b),X$=G.add(X$,X$),n=G.mul(X$,D$),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:R,Z:K}=this,{X:T,Y:b,Z:P}=A,F=G.ZERO,y=G.ZERO,n=G.ZERO,$$=Q.a,X$=G.mul(Q.b,oQ),D$=G.mul(E,T),W$=G.mul(R,b),N$=G.mul(K,P),v$=G.add(E,R),V$=G.add(T,b);v$=G.mul(v$,V$),V$=G.add(D$,W$),v$=G.sub(v$,V$),V$=G.add(E,K);let M$=G.add(T,P);return V$=G.mul(V$,M$),M$=G.add(D$,N$),V$=G.sub(V$,M$),M$=G.add(R,K),F=G.add(b,P),M$=G.mul(M$,F),F=G.add(W$,N$),M$=G.sub(M$,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(D$,D$),W$=G.add(W$,D$),N$=G.mul($$,N$),V$=G.mul(X$,V$),W$=G.add(W$,N$),N$=G.sub(D$,N$),N$=G.mul($$,N$),V$=G.add(V$,N$),D$=G.mul(W$,V$),y=G.add(y,D$),D$=G.mul(M$,V$),F=G.mul(v$,F),F=G.sub(F,D$),D$=G.mul(v$,W$),n=G.mul(M$,n),n=G.add(n,D$),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 R,K,T=(b)=>_.cached(this,b,(P)=>sD(m,P));if(E){let{k1neg:b,k1:P,k2neg:F,k2:y}=k(A),{p:n,f:$$}=T(P),{p:X$,f:D$}=T(y);K=$$.add(D$),R=B(E.beta,n,X$,b,F)}else{let{p:b,f:P}=T(A);R=b,K=P}return sD(m,[R,K])[0]}multiplyUnsafe(A){let{endo:E}=U,R=this;if(!I.isValid(A))throw Error("invalid scalar: out of range");if(A===l0||R.is0())return m.ZERO;if(A===pJ)return R;if(_.hasCache(this))return this.multiply(A);if(E){let{k1neg:K,k1:T,k2neg:b,k2:P}=k(A),{p1:F,p2:y}=t7(m,R,T,P);return B(E.beta,F,y,K,b)}else return _.unsafe(R,A)}toAffine(A){return x(this,A)}isTorsionFree(){let{isTorsionFree:A}=U;if(X===pJ)return!0;if(A)return A(m,this);return _.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:A}=U;if(X===pJ)return this;if(A)return A(m,this);return this.multiplyUnsafe(X)}isSmallOrder(){return this.multiplyUnsafe(X).is0()}toBytes(A=!0){return N8(A,"isCompressed"),this.assertValidity(),v(m,this,A)}toHex(A=!0){return iI(this.toBytes(A))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let a=I.BITS,_=new $q(m,U.endo?Math.ceil(a/2):a);return m.BASE.precompute(8),m}function JZ($){return Uint8Array.of($?2:3)}function GZ($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function CB($,U={}){let{Fn:J}=$,G=U.randomBytes||qI,I=Object.assign(GZ($.Fp,J),{seed:oD(J.ORDER)});function Q(v){try{let g=J.fromBytes(v);return J.isValidNot0(g)}catch(g){return!1}}function X(v,g){let{publicKey:V,publicKeyUncompressed:N}=I;try{let j=v.length;if(g===!0&&j!==V)return!1;if(g===!1&&j!==N)return!1;return!!$.fromBytes(v)}catch(j){return!1}}function O(v=G(I.seed)){return n7(Z$(v,I.seed,"seed"),J.ORDER)}function D(v,g=!0){return $.BASE.multiply(J.fromBytes(v)).toBytes(g)}function q(v){let{secretKey:g,publicKey:V,publicKeyUncompressed:N}=I;if(!hJ(v))return;if("_lengths"in J&&J._lengths||g===V)return;let j=Z$(v,void 0,"key").length;return j===V||j===N}function z(v,g,V=!0){if(q(v)===!0)throw Error("first arg must be private key");if(q(g)===!1)throw Error("second arg must be public key");let N=J.fromBytes(v);return $.fromBytes(g).multiply(N).toBytes(V)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=cQ(O,D);return Object.freeze({getPublicKey:D,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function Qq($,U,J={}){pU(U),pI(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"}),J=Object.assign({},J);let G=J.randomBytes||qI,I=J.hmac||((R,K)=>cJ(U,R,K)),{Fp:Q,Fn:X}=$,{ORDER:O,BITS:D}=X,{keygen:q,getPublicKey:z,getSharedSecret:W,utils:w,lengths:v}=CB($,J),g={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},V=O*IZ<Q.ORDER;function N(R){let K=O>>pJ;return R>K}function j(R,K){if(!X.isValidNot0(K))throw Error(`invalid signature ${R}: out of range 1..Point.Fn.ORDER`);return K}function M(){if(V)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function S(R,K){Jq(K);let T=v.signature,b=K==="compact"?T:K==="recovered"?T+1:void 0;return Z$(R,b)}class L{r;s;recovery;constructor(R,K,T){if(this.r=j("r",R),this.s=j("s",K),T!=null){if(M(),![0,1,2,3].includes(T))throw Error("invalid recovery id");this.recovery=T}Object.freeze(this)}static fromBytes(R,K=g.format){S(R,K);let T;if(K==="der"){let{r:y,s:n}=vI.toSig(Z$(R));return new L(y,n)}if(K==="recovered")T=R[0],K="compact",R=R.subarray(1);let b=v.signature/2,P=R.subarray(0,b),F=R.subarray(b,b*2);return new L(X.fromBytes(P),X.fromBytes(F),T)}static fromHex(R,K){return this.fromBytes(cI(R),K)}assertRecovery(){let{recovery:R}=this;if(R==null)throw Error("invalid recovery id: must be present");return R}addRecoveryBit(R){return new L(this.r,this.s,R)}recoverPublicKey(R){let{r:K,s:T}=this,b=this.assertRecovery(),P=b===2||b===3?K+O:K;if(!Q.isValid(P))throw Error("invalid recovery id: sig.r+curve.n != R.x");let F=Q.toBytes(P),y=$.fromBytes(l$(JZ((b&1)===0),F)),n=X.inv(P),$$=x(Z$(R,void 0,"msgHash")),X$=X.create(-$$*n),D$=X.create(T*n),W$=$.BASE.multiplyUnsafe(X$).add(y.multiplyUnsafe(D$));if(W$.is0())throw Error("invalid recovery: point at infinify");return W$.assertValidity(),W$}hasHighS(){return N(this.s)}toBytes(R=g.format){if(Jq(R),R==="der")return cI(vI.hexFromSig(this));let{r:K,s:T}=this,b=X.toBytes(K),P=X.toBytes(T);if(R==="recovered")return M(),l$(Uint8Array.of(this.assertRecovery()),b,P);return l$(b,P)}toHex(R){return iI(this.toBytes(R))}}let k=J.bits2int||function(K){if(K.length>8192)throw Error("input is too large");let T=YI(K),b=K.length*8-D;return b>0?T>>BigInt(b):T},x=J.bits2int_modN||function(K){return X.create(k(K))},h=M8(D);function B(R){return R8("num < 2^"+D,R,l0,h),X.toBytes(R)}function m(R,K){return Z$(R,void 0,"message"),K?Z$(U(R),void 0,"prehashed message"):R}function a(R,K,T){let{lowS:b,prehash:P,extraEntropy:F}=Iq(T,g);R=m(R,P);let y=x(R),n=X.fromBytes(K);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(Z$(N$,void 0,"extraEntropy"))}let X$=l$(...$$),D$=y;function W$(N$){let v$=k(N$);if(!X.isValidNot0(v$))return;let V$=X.inv(v$),M$=$.BASE.multiply(v$).toAffine(),b$=X.create(M$.x);if(b$===l0)return;let k$=X.create(V$*X.create(D$+b$*n));if(k$===l0)return;let DU=(M$.x===b$?0:2)|Number(M$.y&pJ),qU=k$;if(b&&N(k$))qU=X.neg(k$),DU^=1;return new L(b$,qU,V?void 0:DU)}return{seed:X$,k2sig:W$}}function _(R,K,T={}){let{seed:b,k2sig:P}=a(R,K,T);return b7(U.outputLen,X.BYTES,I)(b,P).toBytes(T.format)}function A(R,K,T,b={}){let{lowS:P,prehash:F,format:y}=Iq(b,g);if(T=Z$(T,void 0,"publicKey"),K=m(K,F),!hJ(R)){let n=R instanceof L?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+n)}S(R,y);try{let n=L.fromBytes(R,y),$$=$.fromBytes(T);if(P&&n.hasHighS())return!1;let{r:X$,s:D$}=n,W$=x(K),N$=X.inv(D$),v$=X.create(W$*N$),V$=X.create(X$*N$),M$=$.BASE.multiplyUnsafe(v$).add($$.multiplyUnsafe(V$));if(M$.is0())return!1;return X.create(M$.x)===X$}catch(n){return!1}}function E(R,K,T={}){let{prehash:b}=Iq(T,g);return K=m(K,b),L.fromBytes(R,"recovered").recoverPublicKey(K).toBytes()}return Object.freeze({keygen:q,getPublicKey:z,getSharedSecret:W,utils:w,lengths:v,Point:$,sign:_,verify:A,recoverPublicKey:E,Signature:L,hash:U})}function QZ($,U,J){return $&U^~$&J}function XZ($,U,J){return $&U^$&J^U&J}class aQ{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=lQ(this.buffer)}update($){h0(this),Z$($);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=lQ($);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($){h0(this),rQ($,this),this.finished=!0;let{buffer:U,view:J,blockLen:G,isLE:I}=this,{pos:Q}=this;if(U[Q++]=128,CU(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=lQ($),O=this.outputLen;if(O%4)throw Error("_sha2: outputLen must be aligned to 32bit");let D=O/4,q=this.get();if(D>q.length)throw Error("_sha2: outputLen bigger than state");for(let z=0;z<D;z++)X.setUint32(4*z,q[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 d0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),n0=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 tQ=BigInt(4294967295),OZ=BigInt(32);function _B($,U=!1){if(U)return{h:Number($&tQ),l:Number($>>OZ&tQ)};return{h:Number($>>OZ&tQ)|0,l:Number($&tQ)|0}}function eQ($,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}=_B($[Q],U);[G[Q],I[Q]]=[X,O]}return[G,I]}var Xq=($,U,J)=>$>>>J,Oq=($,U,J)=>$<<32-J|U>>>J,tI=($,U,J)=>$>>>J|U<<32-J,eI=($,U,J)=>$<<32-J|U>>>J,K8=($,U,J)=>$<<64-J|U>>>J-32,A8=($,U,J)=>$>>>J-32|U<<64-J;var DZ=($,U,J)=>$<<J|U>>>32-J,qZ=($,U,J)=>U<<J|$>>>32-J,zZ=($,U,J)=>U<<J-32|$>>>64-J,YZ=($,U,J)=>$<<J-32|U>>>64-J;function g0($,U,J,G){let I=(U>>>0)+(G>>>0);return{h:$+J+(I/4294967296|0)|0,l:I|0}}var WZ=($,U,J)=>($>>>0)+(U>>>0)+(J>>>0),wZ=($,U,J,G)=>U+J+G+($/4294967296|0)|0,vZ=($,U,J,G)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0),VZ=($,U,J,G,I)=>U+J+G+I+($/4294967296|0)|0,NZ=($,U,J,G,I)=>($>>>0)+(U>>>0)+(J>>>0)+(G>>>0)+(I>>>0),gZ=($,U,J,G,I,Q)=>U+J+G+I+Q+($/4294967296|0)|0;var bB=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]),VI=new Uint32Array(64);class Dq extends aQ{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)VI[z]=$.getUint32(U,!1);for(let z=16;z<64;z++){let W=VI[z-15],w=VI[z-2],v=G0(W,7)^G0(W,18)^W>>>3,g=G0(w,17)^G0(w,19)^w>>>10;VI[z]=g+VI[z-7]+v+VI[z-16]|0}let{A:J,B:G,C:I,D:Q,E:X,F:O,G:D,H:q}=this;for(let z=0;z<64;z++){let W=G0(X,6)^G0(X,11)^G0(X,25),w=q+W+QZ(X,O,D)+bB[z]+VI[z]|0,g=(G0(J,2)^G0(J,13)^G0(J,22))+XZ(J,G,I)|0;q=D,D=O,O=X,X=Q+w|0,Q=I,I=G,G=J,J=w+g|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,D=D+this.G|0,q=q+this.H|0,this.set(J,G,I,Q,X,O,D,q)}roundClean(){CU(VI)}destroy(){this.set(0,0,0,0,0,0,0,0),CU(this.buffer)}}class ZZ extends Dq{A=d0[0]|0;B=d0[1]|0;C=d0[2]|0;D=d0[3]|0;E=d0[4]|0;F=d0[5]|0;G=d0[6]|0;H=d0[7]|0;constructor(){super(32)}}class fB extends Dq{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(28)}}var RZ=(()=>eQ(["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=(()=>RZ[0])(),FB=(()=>RZ[1])(),NI=new Uint32Array(80),gI=new Uint32Array(80);class P8 extends aQ{constructor($){super(128,$,16,!1)}get(){let{Ah:$,Al:U,Bh:J,Bl:G,Ch:I,Cl:Q,Dh:X,Dl:O,Eh:D,El:q,Fh:z,Fl:W,Gh:w,Gl:v,Hh:g,Hl:V}=this;return[$,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,V]}set($,U,J,G,I,Q,X,O,D,q,z,W,w,v,g,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=D|0,this.El=q|0,this.Fh=z|0,this.Fl=W|0,this.Gh=w|0,this.Gl=v|0,this.Hh=g|0,this.Hl=V|0}process($,U){for(let M=0;M<16;M++,U+=4)NI[M]=$.getUint32(U),gI[M]=$.getUint32(U+=4);for(let M=16;M<80;M++){let S=NI[M-15]|0,L=gI[M-15]|0,k=tI(S,L,1)^tI(S,L,8)^Xq(S,L,7),x=eI(S,L,1)^eI(S,L,8)^Oq(S,L,7),h=NI[M-2]|0,B=gI[M-2]|0,m=tI(h,B,19)^K8(h,B,61)^Xq(h,B,6),a=eI(h,B,19)^A8(h,B,61)^Oq(h,B,6),_=vZ(x,a,gI[M-7],gI[M-16]),A=VZ(_,k,m,NI[M-7],NI[M-16]);NI[M]=A|0,gI[M]=_|0}let{Ah:J,Al:G,Bh:I,Bl:Q,Ch:X,Cl:O,Dh:D,Dl:q,Eh:z,El:W,Fh:w,Fl:v,Gh:g,Gl:V,Hh:N,Hl:j}=this;for(let M=0;M<80;M++){let S=tI(z,W,14)^tI(z,W,18)^K8(z,W,41),L=eI(z,W,14)^eI(z,W,18)^A8(z,W,41),k=z&w^~z&g,x=W&v^~W&V,h=NZ(j,L,x,FB[M],gI[M]),B=gZ(h,N,S,k,kB[M],NI[M]),m=h|0,a=tI(J,G,28)^K8(J,G,34)^K8(J,G,39),_=eI(J,G,28)^A8(J,G,34)^A8(J,G,39),A=J&I^J&X^I&X,E=G&Q^G&O^Q&O;N=g|0,j=V|0,g=w|0,V=v|0,w=z|0,v=W|0,{h:z,l:W}=g0(D|0,q|0,B|0,m|0),D=X|0,q=O|0,X=I|0,O=Q|0,I=J|0,Q=G|0;let R=WZ(m,_,E);J=wZ(R,B,a,A),G=R|0}({h:J,l:G}=g0(this.Ah|0,this.Al|0,J|0,G|0)),{h:I,l:Q}=g0(this.Bh|0,this.Bl|0,I|0,Q|0),{h:X,l:O}=g0(this.Ch|0,this.Cl|0,X|0,O|0),{h:D,l:q}=g0(this.Dh|0,this.Dl|0,D|0,q|0),{h:z,l:W}=g0(this.Eh|0,this.El|0,z|0,W|0),{h:w,l:v}=g0(this.Fh|0,this.Fl|0,w|0,v|0),{h:g,l:V}=g0(this.Gh|0,this.Gl|0,g|0,V|0),{h:N,l:j}=g0(this.Hh|0,this.Hl|0,N|0,j|0),this.set(J,G,I,Q,X,O,D,q,z,W,w,v,g,V,N,j)}roundClean(){CU(NI,gI)}destroy(){CU(this.buffer),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}class uB extends P8{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 MZ extends P8{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 vU=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 xB extends P8{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(28)}}class mB extends P8{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 sQ=lJ(()=>new ZZ,zI(1));var jZ=lJ(()=>new MZ,zI(2));/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var yB=BigInt(1),HZ=BigInt(2),rB=BigInt(3),hB=BigInt(5),Fd=BigInt(8),TZ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed");function lB($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=TZ,O=$*$%Q*$%Q,D=oU(O,HZ,Q)*O%Q,q=oU(D,yB,Q)*$%Q,z=oU(q,hB,Q)*q%Q,W=oU(z,U,Q)*z%Q,w=oU(W,J,Q)*W%Q,v=oU(w,G,Q)*w%Q,g=oU(v,I,Q)*v%Q,V=oU(g,I,Q)*v%Q,N=oU(V,U,Q)*z%Q;return{pow_p_5_8:oU(N,HZ,Q)*$%Q,b2:O}}function dB($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var KZ=(()=>{let $=TZ;return s7({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=lB(U);return jU(oU(J,rB,$)*G,$)},adjustScalarBytes:dB})})();/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var nB=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))(),iB=(()=>({p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff"),n:BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973"),h:BigInt(1),a:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc"),b:BigInt("0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef"),Gx:BigInt("0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7"),Gy:BigInt("0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f")}))();var cB=Gq(nB),qq=Qq(cB,sQ);var pB=Gq(iB),AZ=Qq(pB,jZ);function BZ($,U,J){if(pU($),J===void 0)J=new Uint8Array($.outputLen);return cJ($,J,U)}var zq=Uint8Array.of(0),PZ=Uint8Array.of();function LZ($,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=PZ;else Z$(J,void 0,"info");let X=new Uint8Array(Q*I),O=cJ.create($,U),D=O._cloneInto(),q=new Uint8Array(O.outputLen);for(let z=0;z<Q;z++)zq[0]=z+1,D.update(z===0?PZ:q).update(J).update(zq).digestInto(q),X.set(q,I*z),O._cloneInto(D);return O.destroy(),D.destroy(),CU(q,zq),X.slice(0,G)}var oB=BigInt(0),B8=BigInt(1),aB=BigInt(2),tB=BigInt(7),eB=BigInt(256),sB=BigInt(113),_Z=[],EZ=[],bZ=[];for(let $=0,U=B8,J=1,G=0;$<24;$++){[J,G]=[G,(2*J+3*G)%5],_Z.push(2*(5*G+J)),EZ.push(($+1)*($+2)/2%64);let I=oB;for(let Q=0;Q<7;Q++)if(U=(U<<B8^(U>>tB)*sB)%eB,U&aB)I^=B8<<(B8<<BigInt(Q))-B8;bZ.push(I)}var fZ=eQ(bZ,!0),$L=fZ[0],UL=fZ[1],SZ=($,U,J)=>J>32?zZ($,U,J):DZ($,U,J),CZ=($,U,J)=>J>32?YZ($,U,J):qZ($,U,J);function IL($,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,D=(X+2)%10,q=J[D],z=J[D+1],W=SZ(q,z,1)^J[O],w=CZ(q,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=EZ[X],D=SZ(I,Q,O),q=CZ(I,Q,O),z=_Z[X];I=$[z],Q=$[z+1],$[z]=D,$[z+1]=q}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]^=$L[G],$[1]^=UL[G]}CU(J)}class $4{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=hQ(this.state)}clone(){return this._cloneInto()}keccak(){hD(this.state32),IL(this.state32,this.rounds),hD(this.state32),this.posOut=0,this.pos=0}update($){h0(this),Z$($);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($){h0(this,!1),Z$($),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(rQ($,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,CU(this.state)}_cloneInto($){let{blockLen:U,suffix:J,outputLen:G,rounds:I,enableXOF:Q}=this;return $||=new $4(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 kZ=($,U,J,G={})=>lJ(()=>new $4(U,$,J),G);var sI=kZ(6,136,32,zI(8));var FZ=kZ(6,72,64,zI(10));var uZ=($,U,J,G={})=>lJ((I={})=>new $4(U,$,I.dkLen===void 0?J:I.dkLen,!0),G),xZ=uZ(31,168,16,zI(11)),Z0=uZ(31,136,32,zI(12));function Yq($){if(!Number.isSafeInteger($)||$<0||$>4294967295)throw Error("wrong u32 integer:"+$);return $}function yZ($){return Yq($),($&$-1)===0&&$!==0}function Wq($,U){Yq($);let J=0;for(let G=0;G<U;G++,$>>>=1)J=J<<1|$&1;return J}function rZ($){return Yq($),31-Math.clz32($)}function mZ($){let U=$.length;if(U<2||!yZ(U))throw Error("n must be a power of 2 and greater than 1. Got "+U);let J=rZ(U);for(let G=0;G<U;G++){let I=Wq(G,J);if(G<I){let Q=$[G];$[G]=$[I],$[I]=Q}}return $}var wq=($,U)=>{let{N:J,roots:G,dit:I,invertButterflies:Q=!1,skipStages:X=0,brp:O=!0}=U,D=rZ(J);if(!yZ(J))throw Error("FFT: Polynomial size should be power of two");let q=I!==Q;return(z)=>{if(z.length!==J)throw Error("FFT: wrong Polynomial length");if(I&&O)mZ(z);for(let W=0,w=1;W<D-X;W++){let v=I?W+1+X:D-W,g=1<<v,V=g>>1,N=J>>v;for(let j=0;j<J;j+=g)for(let M=0,S=w++;M<V;M++){let L=Q?I?J-S:S:M*N,k=j+M,x=j+M+V,h=G[L],B=z[x],m=z[k];if(q){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)mZ(z);return z}};/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var R0=qI;function U4($,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 hZ($){return Uint8Array.from($)}function $J($,...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 D=U[X],q=J(D),z=typeof D==="number"?I[X]:D.encode(I[X]);if(Z$(z,q,$),Q.set(z,O),typeof D!=="number")z.fill(0);O+=q}return Q},decode:(I)=>{Z$(I,G,$);let Q=[];for(let X of U){let O=J(X),D=I.subarray(0,O);Q.push(typeof X==="number"?D:X.decode(D)),I=I.subarray(O)}return Q}}}function I4($,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)=>{Z$(G,J);let I=[];for(let Q=0;Q<G.length;Q+=$.bytesLen)I.push($.decode(G.subarray(Q,Q+$.bytesLen)));return I}}}function i$(...$){for(let U of $)if(Array.isArray(U))for(let J of U)J.fill(0);else U.fill(0)}function vq($){return(1<<$)-1}var td=Uint8Array.of();/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var lZ=($)=>{let{newPoly:U,N:J,Q:G,F:I,ROOT_OF_UNITY:Q,brvBits:X,isKyber:O}=$,D=(M,S=G)=>{let L=M%S|0;return(L>=0?L|0:S+L|0)|0},q=(M,S=G)=>{let L=D(M,S)|0;return(L>S>>1?L-S|0:L)|0};function z(){let M=U(J);for(let S=0;S<J;S++){let L=Wq(S,X),k=BigInt(Q)**BigInt(L)%BigInt(G);M[S]=Number(k)|0}return M}let W=z(),w={add:(M,S)=>D((M|0)+(S|0))|0,sub:(M,S)=>D((M|0)-(S|0))|0,mul:(M,S)=>D((M|0)*(S|0))|0,inv:(M)=>{throw Error("not implemented")}},v={N:J,roots:W,invertButterflies:!0,skipStages:O?1:0,brp:!1},g=wq(w,{dit:!1,...v}),V=wq(w,{dit:!0,...v});return{mod:D,smod:q,nttZetas:W,NTT:{encode:(M)=>{return g(M)},decode:(M)=>{V(M);for(let S=0;S<M.length;S++)M[S]=D(I*M[S]);return M}},bitsCoder:(M,S)=>{let L=vq(M),k=M*(J/8);return{bytesLen:k,encode:(x)=>{let h=new Uint8Array(k);for(let B=0,m=0,a=0,_=0;B<x.length;B++){m|=(S.encode(x[B])&L)<<a,a+=M;for(;a>=8;a-=8,m>>=8)h[_++]=m&vq(a)}return h},decode:(x)=>{let h=U(J);for(let B=0,m=0,a=0,_=0;B<x.length;B++){m|=x[B]<<a,a+=8;for(;a>=M;a-=M,m>>=M)h[_++]=S.decode(m&L)}return h}}}}},JL=($)=>(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,D=0;return{stats:()=>({calls:O,xofs:D}),get:(q,z)=>{return G[I+0]=q,G[I+1]=z,X.destroy(),X=$.create({}).update(G),O++,()=>{return D++,X.xofInto(Q)}},clean:()=>{X.destroy(),i$(Q,G)}}},dZ=JL(xZ);/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */var NU=256,i0=3329,GL=3303,QL=17,{mod:C8,nttZetas:XL,NTT:UJ,bitsCoder:OL}=lZ({N:NU,Q:i0,F:GL,ROOT_OF_UNITY:QL,newPoly:($)=>new Uint16Array($),brvBits:7,isKyber:!0}),Vq={512:{N:NU,Q:i0,K:2,ETA1:3,ETA2:2,du:10,dv:4,RBGstrength:128},768:{N:NU,Q:i0,K:3,ETA1:2,ETA2:2,du:10,dv:4,RBGstrength:192},1024:{N:NU,Q:i0,K:4,ETA1:2,ETA2:2,du:11,dv:5,RBGstrength:256}},DL=($)=>{if($>=12)return{encode:(J)=>J,decode:(J)=>J};let U=2**($-1);return{encode:(J)=>((J<<$)+i0/2)/i0,decode:(J)=>J*i0+U>>>$}},L8=($)=>OL($,DL($));function IJ($,U){for(let J=0;J<NU;J++)$[J]=C8($[J]+U[J])}function qL($,U){for(let J=0;J<NU;J++)$[J]=C8($[J]-U[J])}function zL($,U,J,G,I){let Q=C8(U*G*I+$*J),X=C8($*G+U*J);return{c0:Q,c1:X}}function J4($,U){for(let J=0;J<NU/2;J++){let G=XL[64+(J>>1)];if(J&1)G=-G;let{c0:I,c1:Q}=zL($[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 nZ($){let U=new Uint16Array(NU);for(let J=0;J<NU;){let G=$();if(G.length%3)throw Error("SampleNTT: unaligned block");for(let I=0;J<NU&&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<i0)U[J++]=Q;if(J<NU&&X<i0)U[J++]=X}}return U}function S8($,U,J,G){let I=$(G*NU/4,U,J),Q=new Uint16Array(NU),X=hQ(I),O=0;for(let D=0,q=0,z=0,W=0;D<X.length;D++){let w=X[D];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[q++]=C8(W-z),z=0,O=0}if(O)throw Error(`sampleCBD: leftover bits: ${O}`);return Q}var YL=($)=>{let{K:U,PRF:J,XOF:G,HASH512:I,ETA1:Q,ETA2:X,du:O,dv:D}=$,q=L8(1),z=L8(D),W=L8(O),w=$J("publicKey",I4(L8(12),U),32),v=I4(L8(12),U),g=$J("ciphertext",I4(W,U),z),V=$J("seed",32,32);return{secretCoder:v,lengths:{secretKey:v.bytesLen,publicKey:w.bytesLen,cipherText:g.bytesLen},keygen:(N)=>{Z$(N,32,"seed");let j=new Uint8Array(33);j.set(N),j[32]=U;let M=I(j),[S,L]=V.decode(M),k=[],x=[];for(let m=0;m<U;m++)k.push(UJ.encode(S8(J,L,m,Q)));let h=G(S);for(let m=0;m<U;m++){let a=UJ.encode(S8(J,L,U+m,Q));for(let _=0;_<U;_++){let A=nZ(h.get(_,m));IJ(a,J4(A,k[_]))}x.push(a)}h.clean();let B={publicKey:w.encode([x,S]),secretKey:v.encode(k)};return i$(S,L,k,x,j,M),B},encrypt:(N,j,M)=>{let[S,L]=w.decode(N),k=[];for(let _=0;_<U;_++)k.push(UJ.encode(S8(J,M,_,Q)));let x=G(L),h=new Uint16Array(NU),B=[];for(let _=0;_<U;_++){let A=S8(J,M,U+_,X),E=new Uint16Array(NU);for(let R=0;R<U;R++){let K=nZ(x.get(_,R));IJ(E,J4(K,k[R]))}IJ(A,UJ.decode(E)),B.push(A),IJ(h,J4(S[_],k[_])),i$(E)}x.clean();let m=S8(J,M,2*U,X);IJ(m,UJ.decode(h));let a=q.decode(j);return IJ(a,m),i$(S,k,h,m),g.encode([B,a])},decrypt:(N,j)=>{let[M,S]=g.decode(N),L=v.decode(j),k=new Uint16Array(NU);for(let x=0;x<U;x++)IJ(k,J4(L[x],UJ.encode(M[x])));return qL(S,UJ.decode(k)),i$(k,L,M),q.encode(S)}}};function Nq($){let U=YL($),{HASH256:J,HASH512:G,KDF:I}=$,{secretCoder:Q,lengths:X}=U,O=$J("secretKey",X.secretKey,X.publicKey,32,32),D=32,q=64;return{info:{type:"ml-kem"},lengths:{...X,seed:64,msg:32,msgRand:32,secretKey:O.bytesLen},keygen:(z=R0(64))=>{Z$(z,64,"seed");let{publicKey:W,secretKey:w}=U.keygen(z.subarray(0,32)),v=J(W),g=O.encode([w,W,v,z.subarray(32)]);return i$(w,v),{publicKey:W,secretKey:g}},getPublicKey:(z)=>{let[W,w,v,g]=O.decode(z);return Uint8Array.from(w)},encapsulate:(z,W=R0(32))=>{Z$(z,X.publicKey,"publicKey"),Z$(W,32,"message");let w=z.subarray(0,384*$.K),v=Q.encode(Q.decode(hZ(w)));if(!U4(v,w))throw i$(v),Error("ML-KEM.encapsulate: wrong publicKey modulus");i$(v);let g=G.create().update(W).update(J(z)).digest(),V=U.encrypt(z,W,g.subarray(32,64));return i$(g.subarray(32)),{cipherText:V,sharedSecret:g.subarray(0,32)}},decapsulate:(z,W)=>{Z$(W,O.bytesLen,"secretKey"),Z$(z,X.cipherText,"cipherText");let w=O.bytesLen-96,v=w+32,g=J(W.subarray(w/2,v));if(!U4(g,W.subarray(v,v+32)))throw Error("invalid secretKey: hash check failed");let[V,N,j,M]=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=U4(z,x),B=I.create({dkLen:32}).update(M).update(z).digest();return i$(S,x,!h?k:B),h?k:B}}}function WL($,U,J){return Z0.create({dkLen:$}).update(U).update(new Uint8Array([J])).digest()}var gq={HASH256:sI,HASH512:FZ,KDF:Z0,XOF:dZ,PRF:WL},Dn=Nq({...gq,...Vq[512]}),_8=Nq({...gq,...Vq[768]}),iZ=Nq({...gq,...Vq[1024]});/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */function wL($,U=!1){let{lengths:J,keygen:G}=$;if(U){let Q=$.Point.Fn;if(!Q)throw Error("No Point.Fn");G=(X=R0(J.seed))=>{Z$(X,J.seed,"seed");let O=Q.isLE?WI(X):YI(X),D=Q.toBytes(Q.create(O));return{secretKey:D,publicKey:$.getPublicKey(D)}}}return{lengths:{secretKey:J.secretKey,publicKey:J.publicKey,seed:J.seed},keygen:G,getPublicKey:(I)=>$.getPublicKey(I)}}function Zq($,U=!1){let J=wL($,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=R0($.lengths.seed)){let Q=this.keygen(I).secretKey,X=this.decapsulate(G,Q),O=$.getPublicKey(Q);return i$(Q),{sharedSecret:X,cipherText:O}},decapsulate(G,I){let Q=$.getSharedSecret(I,G);return $.lengths.publicKeyHasPrefix?Q.subarray(1):Q}}}function E8($,U){return $J(U,...$.map((J)=>{if(typeof J.lengths[U]!=="number")throw Error("wrong length: "+U);return J.lengths[U]}))}function Rq($){return(U,J)=>$(U,{dkLen:J})}function vL($,U,...J){let G=E8(J,"seed"),I=E8(J,"publicKey");if($===void 0)$=G.bytesLen;p$($);function Q(X){Z$(X,$);let O=G.decode(U(X,G.bytesLen)),D=J.map((W,w)=>W.keygen(O[w])),q=D.map((W)=>W.secretKey),z=D.map((W)=>W.publicKey);return{secretKey:q,publicKey:z}}return{info:{lengths:{seed:$,publicKey:I.bytesLen,secretKey:$}},getPublicKey(X){return this.keygen(X).publicKey},keygen(X=R0($)){let{publicKey:O,secretKey:D}=Q(X),q=I.encode(O);return i$(O),i$(D),{secretKey:X,publicKey:q}},expandDecapsulationKey:Q,realSeedLen:$}}function G4($,U,J,G,...I){let Q=vL($,J,...I),X=E8(I,"cipherText"),O=E8(I,"publicKey"),D=E8(I,"msg");if(U===void 0)U=D.bytesLen;return p$(U),{lengths:{...Q.info.lengths,msg:U,msgRand:D.bytesLen,cipherText:X.bytesLen},getPublicKey:Q.getPublicKey,keygen:Q.keygen,encapsulate(q,z=R0(D.bytesLen)){let W=O.decode(q),w=D.decode(z),v=I.map((j,M)=>j.encapsulate(W[M],w[M])),g=v.map((j)=>j.sharedSecret),V=v.map((j)=>j.cipherText),N={sharedSecret:G(W,V,g),cipherText:X.encode(V)};return i$(g,V),N},decapsulate(q,z){let W=X.decode(q),{publicKey:w,secretKey:v}=Q.expandDecapsulationKey(z),g=I.map((V,N)=>V.decapsulate(W[N],v[N]));return G(w,W,g)}}}function cZ($,U,J,G,I){return pU(G),pU(I),G4(32,32,Rq(G),(Q,X,O)=>I(l$(O[0],O[1],X[1],Q[1],wI($))),U,J)}var Rn=cZ("QSF-KEM(ML-KEM-768,P-256)-XOF(SHAKE256)-KDF(SHA3-256)",_8,Zq(qq,!0),Z0,sI),Mn=cZ("QSF-KEM(ML-KEM-1024,P-384)-XOF(SHAKE256)-KDF(SHA3-256)",iZ,Zq(AZ,!0),Z0,sI);function VL($,U,J,G,I){return pU(G),pU(I),G4(32,32,Rq(G),(Q,X,O)=>{let D=l$(O[0],O[1],X[0],Q[0],X[1],Q[1],wI($)),q=32,z=l$(wI("hybrid_prk"),D),W=BZ(I,z),w=l$(dJ(32,2),wI("shared_secret"),wI("")),v=LZ(I,W,w,32);return i$(W,w,z,D),v},U,J)}var pZ=Zq(KZ),jn=VL("KitchenSink-KEM(ML-KEM-768,X25519)-XOF(SHAKE256)-KDF(HKDF-SHA-256)",_8,pZ,Z0,sQ),NL=(()=>G4(32,32,Rq(Z0),($,U,J)=>sI(l$(J[0],J[1],U[1],$[1],wI("\\.//^\\"))),_8,pZ))();function gL($,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 D=I.toBytes(I.create(O)),q=$.getPublicKey(D,!1);return{secretKey:D,publicKey:q}}return{lengths:{secretKey:U,publicKey:J,seed:G,msg:G,cipherText:J},keygen(X=R0(G)){return Z$(X,G,"seed"),Q(X)},getPublicKey(X){return $.getPublicKey(X,!1)},encapsulate(X,O=R0(G)){Z$(O,G,"rand");let{secretKey:D}=Q(O),q=this.decapsulate(X,D),z=$.getPublicKey(D,!1);return i$(D),{sharedSecret:q,cipherText:z}},decapsulate(X,O){return $.getSharedSecret(O,X).subarray(1)}}}function ZL($,U,J,G){let{secretKey:I,publicKeyUncompressed:Q}=J.lengths;if(!I||!Q)throw Error("wrong curve");let X=gL(J,I,Q,G),O=64,D=O+G;return G4(32,32,(q)=>{Z$(q,32);let z=Z0(q,{dkLen:D}),W=z.subarray(0,O),w=z.subarray(O,D);return l$(W,w)},(q,z,W)=>sI(l$(W[0],W[1],z[1],q[1],wI($))),U,X)}var RL=(()=>ZL("MLKEM768-P256",_8,qq,128))();var Q4=NL,oZ=RL;/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var S$=($,U,J)=>t$($,U,J),jq=y$,oJ=SQ,JU=(...$)=>HD(...$),aJ=($)=>O8($),tJ=RD,eJ=($)=>u0($),O4=BigInt(0),Mq=BigInt(1);function c0($,U=""){if(typeof $!=="boolean"){let J=U&&`"${U}" `;throw TypeError(J+"expected boolean, got type="+typeof $)}return $}function D4($){if(typeof $==="bigint"){if(!X4($))throw RangeError("positive bigint expected, got "+$)}else jq($);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 b8($){let U=D4($).toString(16);return U.length&1?"0"+U:U}function aZ($){if(typeof $!=="string")throw TypeError("hex string expected, got "+typeof $);return $===""?O4:BigInt("0x"+$)}function JJ($){return aZ(SQ($))}function Q0($){return aZ(SQ(ZI(t$($)).reverse()))}function q4($,U){if(y$(U),U===0)throw RangeError("zero length");$=D4($);let J=$.toString(16);if(J.length>U*2)throw RangeError("number too large");return O8(J.padStart(U*2,"0"))}function f8($,U){return q4($,U).reverse()}function tZ($,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 ZI($){return Uint8Array.from(S$($))}function z4($){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 X4=($)=>typeof $==="bigint"&&O4<=$;function ML($,U,J){return X4($)&&X4(U)&&X4(J)&&U<=$&&$<J}function p0($,U,J,G){if(!ML(U,J,G))throw RangeError("expected valid "+$+": "+J+" <= n < "+G+", got "+U)}function sJ($){if($<O4)throw Error("expected non-negative bigint, got "+$);let U;for(U=0;$>O4;$>>=Mq,U+=1);return U}var k8=($)=>(Mq<<BigInt($))-Mq;function eZ($,U,J){if(y$($,"hashLen"),y$(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,D=G($),q=G($),z=0,W=()=>{D.fill(1),q.fill(0),z=0},w=(...N)=>J(q,JU(D,...N)),v=(N=I)=>{if(q=w(Q,N),D=w(),N.length===0)return;q=w(X,N),D=w()},g=()=>{if(z++>=O)throw Error("drbg: tried max amount of iterations");let N=0,j=[];while(N<U){D=w();let M=D.slice();j.push(M),N+=D.length}return JU(...j)};return(N,j)=>{W(),v(N);let M=void 0;while((M=j(g()))===void 0)v();return W(),M}}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 D=$[Q];if(O&&D===void 0)return;let q=typeof D;if(q!==X||D===null)throw TypeError(`param "${Q}" is invalid: expected ${X}, got ${q}`)}let I=(Q,X)=>Object.entries(Q).forEach(([O,D])=>G(O,D,X));I(U,!1),I(J,!0)}var Hq=()=>{throw Error("not implemented")};/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var GU=BigInt(0),x$=BigInt(1),GJ=BigInt(2),I5=BigInt(3),J5=BigInt(4),G5=BigInt(5),jL=BigInt(7),Q5=BigInt(8),HL=BigInt(9),X5=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 sZ($,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=x$,X=x$,O=GU;while(J!==GU){let q=G/J,z=G-J*q,W=I-X*q,w=Q-O*q;G=J,J=z,I=X,Q=O,X=W,O=w}if(G!==x$)throw Error("invert: does not exist");return F$(I,U)}function Tq($,U,J){let G=$;if(!G.eql(G.sqr(U),J))throw Error("Cannot find square root")}function O5($,U){let J=$,G=(J.ORDER+x$)/J5,I=J.pow(U,G);return Tq(J,I,U),I}function TL($,U){let J=$,G=(J.ORDER-G5)/Q5,I=J.mul(U,GJ),Q=J.pow(I,G),X=J.mul(U,Q),O=J.mul(J.mul(X,GJ),Q),D=J.mul(X,J.sub(O,J.ONE));return Tq(J,D,U),D}function KL($){let U=Y4($),J=D5($),G=J(U,U.neg(U.ONE)),I=J(U,G),Q=J(U,U.neg(G)),X=($+jL)/X5;return(O,D)=>{let q=O,z=q.pow(D,X),W=q.mul(z,G),w=q.mul(z,I),v=q.mul(z,Q),g=q.eql(q.sqr(W),D),V=q.eql(q.sqr(w),D);z=q.cmov(z,W,g),W=q.cmov(v,w,V);let N=q.eql(q.sqr(W),D),j=q.cmov(z,W,N);return Tq(q,j,D),j}}function D5($){if($<I5)throw Error("sqrt is not defined for small field");let U=$-x$,J=0;while(U%GJ===GU)U/=GJ,J++;let G=GJ,I=Y4($);while($5(I,G)===1)if(G++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return O5;let Q=I.pow(G,U),X=(U+x$)/GJ;return function(D,q){let z=D;if(z.is0(q))return q;if($5(z,q)!==1)throw Error("Cannot find square root");let W=J,w=z.mul(z.ONE,Q),v=z.pow(q,U),g=z.pow(q,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=x$<<BigInt(W-V-1),M=z.pow(w,j);W=V,w=z.sqr(M),v=z.mul(v,w),g=z.mul(g,M)}return g}}function AL($){if($%J5===I5)return O5;if($%Q5===G5)return TL;if($%X5===HL)return KL($);return D5($)}var o0=($,U)=>(F$($,U)&x$)===x$,PL=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Kq($){let U={ORDER:"bigint",BYTES:"number",BITS:"number"},J=PL.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<=x$)throw Error("invalid field: expected ORDER > 1, got "+$.ORDER);return $}function BL($,U,J){let G=$;if(J<GU)throw Error("invalid exponent, negatives unsupported");if(J===GU)return G.ONE;if(J===x$)return U;let I=G.ONE,Q=U;while(J>GU){if(J&x$)I=G.mul(I,Q);Q=G.sqr(Q),J>>=x$}return I}function F8($,U,J=!1){let G=$,I=Array(U.length).fill(J?G.ZERO:void 0),Q=U.reduce((O,D,q)=>{if(G.is0(D))return O;return I[q]=O,G.mul(O,D)},G.ONE),X=G.inv(Q);return U.reduceRight((O,D,q)=>{if(G.is0(D))return O;return I[q]=G.mul(O,I[q]),G.mul(O,D)},X),I}function $5($,U){let J=$,G=(J.ORDER-x$)/GJ,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 LL($,U){if(U!==void 0)jq(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=sJ($);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 U5=new WeakMap;class Aq{ORDER;BITS;BYTES;isLE;ZERO=GU;ONE=x$;_lengths;_mod;constructor($,U={}){if($<=x$)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}=LL($,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($&x$)===x$}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 BL(this,$,U)}div($,U){return F$($*sZ(U,this.ORDER),this.ORDER)}sqrN($){return $*$}addN($,U){return $+U}subN($,U){return $-U}mulN($,U){return $*U}inv($){return sZ($,this.ORDER)}sqrt($){let U=U5.get(this);if(!U)U5.set(this,U=AL(this.ORDER));return U(this,$)}toBytes($){return this.isLE?f8($,this.BYTES):q4($,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 D=new Uint8Array(G);D.set($,I?0:D.length-$.length),$=D}if($.length!==G)throw Error("Field.fromBytes: expected "+G+" bytes, got "+$.length);let O=I?Q0($):JJ($);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 F8(this,$)}cmov($,U,J){return c0(J,"condition"),J?U:$}}Object.freeze(Aq.prototype);function Y4($,U={}){return new Aq($,U)}function q5($){if(typeof $!=="bigint")throw Error("field order must be bigint");if($<=x$)throw Error("field order must be greater than 1");let U=sJ($-x$);return Math.ceil(U/8)}function Pq($){let U=q5($);return U+Math.ceil(U/2)}function z5($,U,J=!1){S$($);let G=$.length,I=q5(U),Q=Math.max(Pq(U),16);if(G<Q||G>1024)throw Error("expected "+Q+"-1024 bytes of input, got "+G);let X=J?Q0($):JJ($),O=F$(X,U-x$)+x$;return J?f8(O,I):q4(O,I)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var $G=BigInt(0),QJ=BigInt(1);function u8($,U){let J=U.negate();return $?J:U}function XJ($,U){let J=F8($.Fp,U.map((G)=>G.Z));return U.map((G,I)=>$.fromAffine(G.toAffine(J[I])))}function v5($,U){if(!Number.isSafeInteger($)||$<=0||$>U)throw Error("invalid window size, expected [1.."+U+"], got W="+$)}function Bq($,U){v5($,U);let J=Math.ceil(U/$)+1,G=2**($-1),I=2**$,Q=k8($),X=BigInt($);return{windows:J,windowSize:G,mask:Q,maxNumber:I,shiftBy:X}}function Y5($,U,J){let{windowSize:G,mask:I,maxNumber:Q,shiftBy:X}=J,O=Number($&I),D=$>>X;if(O>G)O-=Q,D+=QJ;let q=U*G,z=q+Math.abs(O)-1,W=O===0,w=O<0,v=U%2!==0;return{nextN:D,offset:z,isZero:W,isNeg:w,isNegF:v,offsetF:q}}var Lq=new WeakMap,V5=new WeakMap;function Sq($){return V5.get($)||1}function W5($){if($!==$G)throw Error("invalid wNAF")}class x8{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>$G){if(U&QJ)J=J.add(G);G=G.double(),U>>=QJ}return J}precomputeWindow($,U){let{windows:J,windowSize:G}=Bq(U,this.bits),I=[],Q=$,X=Q;for(let O=0;O<J;O++){X=Q,I.push(X);for(let D=1;D<G;D++)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=Bq($,this.bits);for(let X=0;X<Q.windows;X++){let{nextN:O,offset:D,isZero:q,isNeg:z,isNegF:W,offsetF:w}=Y5(J,X,Q);if(J=O,q)I=I.add(u8(W,U[w]));else G=G.add(u8(z,U[D]))}return W5(J),{p:G,f:I}}wNAFUnsafe($,U,J,G=this.ZERO){let I=Bq($,this.bits);for(let Q=0;Q<I.windows;Q++){if(J===$G)break;let{nextN:X,offset:O,isZero:D,isNeg:q}=Y5(J,Q,I);if(J=X,D)continue;else{let z=U[O];G=G.add(q?z.negate():z)}}return W5(J),G}getPrecomputes($,U,J){let G=Lq.get(U);if(!G){if(G=this.precomputeWindow(U,$),$!==1){if(typeof J==="function")G=J(G);Lq.set(U,G)}}return G}cached($,U,J){let G=Sq($);return this.wNAF(G,this.getPrecomputes(G,$,J),U)}unsafe($,U,J,G){let I=Sq($);if(I===1)return this._unsafeLadder($,U,G);return this.wNAFUnsafe(I,this.getPrecomputes(I,$,J),U,G)}createCache($,U){v5(U,this.bits),V5.set($,U),Lq.delete($)}hasCache($){return Sq($)!==1}}function N5($,U,J,G){let I=U,Q=$.ZERO,X=$.ZERO;while(J>$G||G>$G){if(J&QJ)Q=Q.add(I);if(G&QJ)X=X.add(I);I=I.double(),J>>=QJ,G>>=QJ}return{p1:Q,p2:X}}function w5($,U,J){if(U){if(U.ORDER!==$)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return Kq(U),U}else return Y4($,{isLE:J})}function W4($,U,J={},G){if(G===void 0)G=$==="edwards";if(!U||typeof U!=="object")throw Error(`expected valid ${$} CURVE object`);for(let D of["p","n","h"]){let q=U[D];if(!(typeof q==="bigint"&&q>$G))throw Error(`CURVE.${D} must be positive bigint`)}let I=w5(U.p,J.Fp,G),Q=w5(U.n,J.Fn,G),O=["Gx","Gy","a",$==="weierstrass"?"b":"d"];for(let D of O)if(!I.isValid(U[D]))throw Error(`CURVE.${D} must be valid field element of CURVE.Fp`);return U=Object.freeze(Object.assign({},U)),{CURVE:U,Fp:I,Fn:Q}}function m8($,U){return function(G){let I=$(G);return{secretKey:I,publicKey:U(I)}}}function y8($,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 SL($,U){let J=new Uint8Array($.length);for(let G=0;G<$.length;G++)J[G]=$[G]^U[G];return J}function CL($){if(!tJ($)&&typeof $!=="string")throw Error("DST must be Uint8Array or ascii string");let U=typeof $==="string"?z4($):$;if(U.length===0)throw Error("DST must be non-empty");return U}function Cq($,U,J,G){if(S$($),M0(J),U=CL(U),U.length>255)U=G(JU(z4("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,y8(U.length,1)),D=new Uint8Array(Q),q=y8(J,2),z=Array(X),W=G(JU(D,$,q,y8(0,1),O));z[0]=G(JU(W,y8(1,1),O));for(let v=1;v<X;v++){let g=[SL(W,z[v-1]),y8(v+1,1),O];z[v]=G(JU(...g))}return JU(...z).slice(0,J)}var g5="HashToScalar-";/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var Z5=($,U)=>($+($>=0?U:-U)/M5)/U;function _L($,U,J){p0("scalar",$,j0,J);let[[G,I],[Q,X]]=U,O=Z5(X*$,J),D=Z5(-I*$,J),q=$-O*G-D*Q,z=-O*I-D*X,W=q<j0,w=z<j0;if(W)q=-q;if(w)z=-z;let v=k8(Math.ceil(sJ(J)/2))+RI;if(q<j0||q>=v||z<j0||z>=v)throw Error("splitScalar (endomorphism): failed for k");return{k1neg:W,k1:q,k2neg:w,k2:z}}function Eq($){if(!["compact","recovered","der"].includes($))throw Error('Signature format must be "compact", "recovered", or "der"');return $}function _q($,U){aU($);let J={};for(let G of Object.keys(U))J[G]=$[G]===void 0?U[G]:$[G];if(c0(J.lowS,"lowS"),c0(J.prehash,"prehash"),J.format!==void 0)Eq(J.format);return J}class R5 extends Error{constructor($=""){super($)}}var X0={Err:R5,_tlv:{encode:($,U)=>{let{Err:J}=X0;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=b8(G);if(I.length/2&128)throw new J("tlv.encode: long form length too big");let Q=G>127?b8(I.length/2|128):"";return b8($)+Q+I+U},decode($,U){let{Err:J}=X0;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 D=I&127;if(!D)throw new J("tlv.decode(long): indefinite length not supported");if(D>4)throw new J("tlv.decode(long): byte length is too big");let q=U.subarray(G,G+D);if(q.length!==D)throw new J("tlv.decode: length bytes not complete");if(q[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let z of q)X=X<<8|z;if(G+=D,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}=X0;if(D4($),$<j0)throw new U("integer: negative integers are not allowed");let J=b8($);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}=X0;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 JJ($)}},toSig($){let{Err:U,_int:J,_tlv:G}=X0,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:D}=G.decode(2,Q),{v:q,l:z}=G.decode(2,D);if(z.length)throw new U("invalid signature: left bytes after parsing");return{r:J.decode(O),s:J.decode(q)}},hexFromSig($){let{_tlv:U,_int:J}=X0,G=U.encode(2,J.encode($.r)),I=U.encode(2,J.encode($.s)),Q=G+I;return U.encode(48,Q)}};Object.freeze(X0._tlv);Object.freeze(X0._int);Object.freeze(X0);var j0=BigInt(0),RI=BigInt(1),M5=BigInt(2),w4=BigInt(3),EL=BigInt(4);function j5($,U={}){let J=W4("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:D,allowInfinityPoint:q}=U;if(D){if(!G.is0(Q.a)||typeof D.beta!=="bigint"||!Array.isArray(D.basises))throw Error('invalid endo: expected "beta": bigint and "basises": array')}let z=T5(G,I);function W(){if(!G.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}function w(_,A,E){if(q&&A.is0())return Uint8Array.of(0);let{x:R,y:K}=A.toAffine(),T=G.toBytes(R);if(c0(E,"isCompressed"),E){W();let b=!G.isOdd(K);return JU(H5(b),T)}else return JU(Uint8Array.of(4),T,G.toBytes(K))}function v(_){S$(_,void 0,"Point");let{publicKey:A,publicKeyUncompressed:E}=z,R=_.length,K=_[0],T=_.subarray(1);if(q&&R===1&&K===0)return{x:G.ZERO,y:G.ZERO};if(R===A&&(K===2||K===3)){let b=G.fromBytes(T);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((K&1)===1!==y)F=G.neg(F);return{x:b,y:F}}else if(R===E&&K===4){let b=G.BYTES,P=G.fromBytes(T.subarray(0,b)),F=G.fromBytes(T.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 ${R}, expected compressed=${A} or uncompressed=${E}`)}let g=U.toBytes===void 0?w:U.toBytes,V=U.fromBytes===void 0?v:U.fromBytes;function N(_){let A=G.sqr(_),E=G.mul(A,_);return G.add(G.add(E,G.mul(_,Q.a)),Q.b)}function j(_,A){let E=G.sqr(A),R=N(_);return G.eql(E,R)}if(!j(Q.Gx,Q.Gy))throw Error("bad curve params: generator point");let M=G.mul(G.pow(Q.a,w4),EL),S=G.mul(G.sqr(Q.b),BigInt(27));if(G.is0(G.add(M,S)))throw Error("bad curve params: a or b");function L(_,A,E=!1){if(!G.isValid(A)||E&&G.is0(A))throw Error(`bad point coordinate ${_}`);return A}function k(_){if(!(_ instanceof B))throw Error("Weierstrass Point expected")}function x(_){if(!D||!D.basises)throw Error("no endo");return _L(_,D.basises,I.ORDER)}function h(_,A,E,R,K){return E=new B(G.mul(E.X,_),E.Y,E.Z),A=u8(R,A),E=u8(K,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(_,A,E){this.X=L("x",_),this.Y=L("y",A,!0),this.Z=L("z",E),Object.freeze(this)}static CURVE(){return Q}static fromAffine(_){let{x:A,y:E}=_||{};if(!_||!G.isValid(A)||!G.isValid(E))throw Error("invalid affine point");if(_ 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(_){let A=B.fromAffine(V(S$(_,void 0,"point")));return A.assertValidity(),A}static fromHex(_){return B.fromBytes(aJ(_))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(_=8,A=!0){if(a.createCache(this,_),!A)this.multiply(w4);return this}assertValidity(){let _=this;if(_.is0()){if(U.allowInfinityPoint&&G.is0(_.X)&&G.eql(_.Y,G.ONE)&&G.is0(_.Z))return;throw Error("bad point: ZERO")}let{x:A,y:E}=_.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(!_.isTorsionFree())throw Error("bad point: not in prime-order subgroup")}hasEvenY(){let{y:_}=this.toAffine();if(!G.isOdd)throw Error("Field doesn't support isOdd");return!G.isOdd(_)}equals(_){k(_);let{X:A,Y:E,Z:R}=this,{X:K,Y:T,Z:b}=_,P=G.eql(G.mul(A,b),G.mul(K,R)),F=G.eql(G.mul(E,b),G.mul(T,R));return P&&F}negate(){return new B(this.X,G.neg(this.Y),this.Z)}double(){let{a:_,b:A}=Q,E=G.mul(A,w4),{X:R,Y:K,Z:T}=this,b=G.ZERO,P=G.ZERO,F=G.ZERO,y=G.mul(R,R),n=G.mul(K,K),$$=G.mul(T,T),X$=G.mul(R,K);return X$=G.add(X$,X$),F=G.mul(R,T),F=G.add(F,F),b=G.mul(_,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(_,$$),X$=G.sub(y,$$),X$=G.mul(_,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(K,T),$$=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(_){k(_);let{X:A,Y:E,Z:R}=this,{X:K,Y:T,Z:b}=_,P=G.ZERO,F=G.ZERO,y=G.ZERO,n=Q.a,$$=G.mul(Q.b,w4),X$=G.mul(A,K),D$=G.mul(E,T),W$=G.mul(R,b),N$=G.add(A,E),v$=G.add(K,T);N$=G.mul(N$,v$),v$=G.add(X$,D$),N$=G.sub(N$,v$),v$=G.add(A,R);let V$=G.add(K,b);return v$=G.mul(v$,V$),V$=G.add(X$,W$),v$=G.sub(v$,V$),V$=G.add(E,R),P=G.add(T,b),V$=G.mul(V$,P),P=G.add(D$,W$),V$=G.sub(V$,P),y=G.mul(n,v$),P=G.mul($$,W$),y=G.add(P,y),P=G.sub(D$,y),y=G.add(D$,y),F=G.mul(P,y),D$=G.add(X$,X$),D$=G.add(D$,X$),W$=G.mul(n,W$),v$=G.mul($$,v$),D$=G.add(D$,W$),W$=G.sub(X$,W$),W$=G.mul(n,W$),v$=G.add(v$,W$),X$=G.mul(D$,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$,D$),y=G.mul(V$,y),y=G.add(y,X$),new B(P,F,y)}subtract(_){return k(_),this.add(_.negate())}is0(){return this.equals(B.ZERO)}multiply(_){let{endo:A}=U;if(!I.isValidNot0(_))throw RangeError("invalid scalar: out of range");let E,R,K=(T)=>a.cached(this,T,(b)=>XJ(B,b));if(A){let{k1neg:T,k1:b,k2neg:P,k2:F}=x(_),{p:y,f:n}=K(b),{p:$$,f:X$}=K(F);R=n.add(X$),E=h(A.beta,y,$$,T,P)}else{let{p:T,f:b}=K(_);E=T,R=b}return XJ(B,[E,R])[0]}multiplyUnsafe(_){let{endo:A}=U,E=this,R=_;if(!I.isValid(R))throw RangeError("invalid scalar: out of range");if(R===j0||E.is0())return B.ZERO;if(R===RI)return E;if(a.hasCache(this))return this.multiply(R);if(A){let{k1neg:K,k1:T,k2neg:b,k2:P}=x(R),{p1:F,p2:y}=N5(B,E,T,P);return h(A.beta,F,y,K,b)}else return a.unsafe(E,R)}toAffine(_){let A=this,E=_,{X:R,Y:K,Z:T}=A;if(G.eql(T,G.ONE))return{x:R,y:K};let b=A.is0();if(E==null)E=b?G.ONE:G.inv(T);let P=G.mul(R,E),F=G.mul(K,E),y=G.mul(T,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:_}=U;if(X===RI)return!0;if(_)return _(B,this);return a.unsafe(this,O).is0()}clearCofactor(){let{clearCofactor:_}=U;if(X===RI)return this;if(_)return _(B,this);return this.multiplyUnsafe(X)}isSmallOrder(){if(X===RI)return this.is0();return this.clearCofactor().is0()}toBytes(_=!0){return c0(_,"isCompressed"),this.assertValidity(),g(B,this,_)}toHex(_=!0){return oJ(this.toBytes(_))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let m=I.BITS,a=new x8(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 H5($){return Uint8Array.of($?2:3)}function T5($,U){return{secretKey:U.BYTES,publicKey:1+$.BYTES,publicKeyUncompressed:1+2*$.BYTES,publicKeyHasPrefix:!0,signature:2*U.BYTES}}function bL($,U={}){let{Fn:J}=$,G=U.randomBytes===void 0?eJ:U.randomBytes,I=Object.assign(T5($.Fp,J),{seed:Math.max(Pq(J.ORDER),16)});function Q(v){try{let g=J.fromBytes(v);return J.isValidNot0(g)}catch(g){return!1}}function X(v,g){let{publicKey:V,publicKeyUncompressed:N}=I;try{let j=v.length;if(g===!0&&j!==V)return!1;if(g===!1&&j!==N)return!1;return!!$.fromBytes(v)}catch(j){return!1}}function O(v){return v=v===void 0?G(I.seed):v,z5(S$(v,I.seed,"seed"),J.ORDER)}function D(v,g=!0){return $.BASE.multiply(J.fromBytes(v)).toBytes(g)}function q(v){let{secretKey:g,publicKey:V,publicKeyUncompressed:N}=I,j=J._lengths;if(!tJ(v))return;let M=S$(v,void 0,"key").length,S=M===V||M===N,L=M===g||!!j?.includes(M);if(S&&L)return;return S}function z(v,g,V=!0){if(q(v)===!0)throw Error("first arg must be private key");if(q(g)===!1)throw Error("second arg must be public key");let N=J.fromBytes(v);return $.fromBytes(g).multiply(N).toBytes(V)}let W={isValidSecretKey:Q,isValidPublicKey:X,randomSecretKey:O},w=m8(O,D);return Object.freeze(W),Object.freeze(I),Object.freeze({getPublicKey:D,getSharedSecret:z,keygen:w,Point:$,utils:W,lengths:I})}function K5($,U,J={}){let G=U;F0(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?(K,T)=>v0(G,K,T):J.hmac,{Fp:X,Fn:O}=$,{ORDER:D,BITS:q}=O,{keygen:z,getPublicKey:W,getSharedSecret:w,utils:v,lengths:g}=bL($,J),V={prehash:!0,lowS:typeof J.lowS==="boolean"?J.lowS:!0,format:"compact",extraEntropy:!1},N=D*M5+RI<X.ORDER;function j(K){let T=D>>RI;return K>T}function M(K,T){if(!O.isValidNot0(T))throw Error(`invalid signature ${K}: out of range 1..Point.Fn.ORDER`);return T}function S(){if(N)throw Error('"recovered" sig type is not supported for cofactor >2 curves')}function L(K,T){Eq(T);let b=g.signature,P=T==="compact"?b:T==="recovered"?b+1:void 0;return S$(K,P)}class k{r;s;recovery;constructor(K,T,b){if(this.r=M("r",K),this.s=M("s",T),b!=null){if(S(),![0,1,2,3].includes(b))throw Error("invalid recovery id");this.recovery=b}Object.freeze(this)}static fromBytes(K,T=V.format){L(K,T);let b;if(T==="der"){let{r:n,s:$$}=X0.toSig(S$(K));return new k(n,$$)}if(T==="recovered")b=K[0],T="compact",K=K.subarray(1);let P=g.signature/2,F=K.subarray(0,P),y=K.subarray(P,P*2);return new k(O.fromBytes(F),O.fromBytes(y),b)}static fromHex(K,T){return this.fromBytes(aJ(K),T)}assertRecovery(){let{recovery:K}=this;if(K==null)throw Error("invalid recovery id: must be present");return K}addRecoveryBit(K){return new k(this.r,this.s,K)}recoverPublicKey(K){let{r:T,s:b}=this,P=this.assertRecovery(),F=P===2||P===3?T+D:T;if(!X.isValid(F))throw Error("invalid recovery id: sig.r+curve.n != R.x");let y=X.toBytes(F),n=$.fromBytes(JU(H5((P&1)===0),y)),$$=O.inv(F),X$=h(S$(K,void 0,"msgHash")),D$=O.create(-X$*$$),W$=O.create(b*$$),N$=$.BASE.multiplyUnsafe(D$).add(n.multiplyUnsafe(W$));if(N$.is0())throw Error("invalid recovery: point at infinify");return N$.assertValidity(),N$}hasHighS(){return j(this.s)}toBytes(K=V.format){if(Eq(K),K==="der")return aJ(X0.hexFromSig(this));let{r:T,s:b}=this,P=O.toBytes(T),F=O.toBytes(b);if(K==="recovered")return S(),JU(Uint8Array.of(this.assertRecovery()),P,F);return JU(P,F)}toHex(K){return oJ(this.toBytes(K))}}Object.freeze(k.prototype),Object.freeze(k);let x=J.bits2int===void 0?function(T){if(T.length>8192)throw Error("input is too large");let b=JJ(T),P=T.length*8-q;return P>0?b>>BigInt(P):b}:J.bits2int,h=J.bits2int_modN===void 0?function(T){return O.create(x(T))}:J.bits2int_modN,B=k8(q);function m(K){return p0("num < 2^"+q,K,j0,B),O.toBytes(K)}function a(K,T){return S$(K,void 0,"message"),T?S$(G(K),void 0,"prehashed message"):K}function _(K,T,b){let{lowS:P,prehash:F,extraEntropy:y}=_q(b,V);K=a(K,F);let n=h(K),$$=O.fromBytes(T);if(!O.isValidNot0($$))throw Error("invalid private key");let X$=[m($$),m(n)];if(y!=null&&y!==!1){let v$=y===!0?I(g.secretKey):y;X$.push(S$(v$,void 0,"extraEntropy"))}let D$=JU(...X$),W$=n;function N$(v$){let V$=x(v$);if(!O.isValidNot0(V$))return;let M$=O.inv(V$),b$=$.BASE.multiply(V$).toAffine(),k$=O.create(b$.x);if(k$===j0)return;let DU=O.create(M$*O.create(W$+k$*$$));if(DU===j0)return;let qU=(b$.x===k$?0:2)|Number(b$.y&RI),SU=DU;if(P&&j(DU))SU=O.neg(DU),qU^=1;return new k(k$,SU,N?void 0:qU)}return{seed:D$,k2sig:N$}}function A(K,T,b={}){let{seed:P,k2sig:F}=_(K,T,b);return eZ(G.outputLen,O.BYTES,Q)(P,F).toBytes(b.format)}function E(K,T,b,P={}){let{lowS:F,prehash:y,format:n}=_q(P,V);if(b=S$(b,void 0,"publicKey"),T=a(T,y),!tJ(K)){let $$=K instanceof k?", use sig.toBytes()":"";throw Error("verify expects Uint8Array signature"+$$)}L(K,n);try{let $$=k.fromBytes(K,n),X$=$.fromBytes(b);if(F&&$$.hasHighS())return!1;let{r:D$,s:W$}=$$,N$=h(T),v$=O.inv(W$),V$=O.create(N$*v$),M$=O.create(D$*v$),b$=$.BASE.multiplyUnsafe(V$).add(X$.multiplyUnsafe(M$));if(b$.is0())return!1;return O.create(b$.x)===D$}catch($$){return!1}}function R(K,T,b={}){let{prehash:P}=_q(b,V);return T=a(T,P),k.fromBytes(K,"recovered").recoverPublicKey(T).toBytes()}return Object.freeze({keygen:z,getPublicKey:W,getSharedSecret:w,utils:v,lengths:g,Point:$,sign:A,verify:E,recoverPublicKey:R,Signature:k,hash:G})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var fL=(()=>({p:BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),n:BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),h:BigInt(1),a:BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),b:BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),Gx:BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),Gy:BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")}))();var kL=j5(fL),UG=K5(kL,r$);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var MI=BigInt(0),_U=BigInt(1),bq=BigInt(2),FL=BigInt(8);function uL($,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 A5($,U={}){let J=U,G=W4("edwards",$,J,J.FpFnLE),{Fp:I,Fn:Q}=G,X=G.CURVE,{h:O}=X;aU(J,{},{uvRatio:"function"});let D=bq<<BigInt(Q.BYTES*8)-_U,q=(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:MI}}}:J.uvRatio;if(!uL(I,X,X.Gx,X.Gy))throw Error("bad curve params: generator point");function W(V,N,j=!1){let M=j?_U:MI;return p0("coordinate "+V,N,M,D),N}function w(V){if(!(V instanceof v))throw Error("EdwardsPoint expected")}class v{static BASE=new v(X.Gx,X.Gy,_U,q(X.Gx*X.Gy));static ZERO=new v(MI,_U,_U,MI);static Fp=I;static Fn=Q;X;Y;Z;T;constructor(V,N,j,M){this.X=W("x",V),this.Y=W("y",N),this.Z=W("z",j,!0),this.T=W("t",M),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,q(N*j))}static fromBytes(V,N=!1){let j=I.BYTES,{a:M,d:S}=X;V=ZI(S$(V,j,"point")),c0(N,"zip215");let L=ZI(V),k=V[j-1];L[j-1]=k&-129;let x=Q0(L),h=N?D:I.ORDER;p0("point.y",x,MI,h);let B=q(x*x),m=q(B-_U),a=q(S*B-M),{isValid:_,value:A}=z(m,a);if(!_)throw Error("bad point: invalid y coordinate");let E=(A&_U)===_U,R=(k&128)!==0;if(!N&&A===MI&&R)throw Error("bad point: x=0 and x_0=1");if(R!==E)A=q(-A);return v.fromAffine({x:A,y:x})}static fromHex(V,N=!1){return v.fromBytes(aJ(V),N)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(V=8,N=!0){if(g.createCache(this,V),!N)this.multiply(bq);return this}assertValidity(){let V=this,{a:N,d:j}=X;if(V.is0())throw Error("bad point: ZERO");let{X:M,Y:S,Z:L,T:k}=V,x=q(M*M),h=q(S*S),B=q(L*L),m=q(B*B),a=q(x*N),_=q(B*q(a+h)),A=q(m+q(j*q(x*h)));if(_!==A)throw Error("bad point: equation left != right (1)");let E=q(M*S),R=q(L*k);if(E!==R)throw Error("bad point: equation left != right (2)")}equals(V){w(V);let{X:N,Y:j,Z:M}=this,{X:S,Y:L,Z:k}=V,x=q(N*k),h=q(S*M),B=q(j*k),m=q(L*M);return x===h&&B===m}is0(){return this.equals(v.ZERO)}negate(){return new v(q(-this.X),this.Y,this.Z,q(-this.T))}double(){let{a:V}=X,{X:N,Y:j,Z:M}=this,S=q(N*N),L=q(j*j),k=q(bq*q(M*M)),x=q(V*S),h=N+j,B=q(q(h*h)-S-L),m=x+L,a=m-k,_=x-L,A=q(B*a),E=q(m*_),R=q(B*_),K=q(a*m);return new v(A,E,K,R)}add(V){w(V);let{a:N,d:j}=X,{X:M,Y:S,Z:L,T:k}=this,{X:x,Y:h,Z:B,T:m}=V,a=q(M*x),_=q(S*h),A=q(k*j*m),E=q(L*B),R=q((M+S)*(x+h)-a-_),K=E-A,T=E+A,b=q(_-N*a),P=q(R*K),F=q(T*b),y=q(R*b),n=q(K*T);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}=g.cached(this,V,(M)=>XJ(v,M));return XJ(v,[N,j])[0]}multiplyUnsafe(V){if(!Q.isValid(V))throw RangeError("invalid scalar: expected 0 <= sc < curve.n");if(V===MI)return v.ZERO;if(this.is0()||V===_U)return this;return g.unsafe(this,V,(N)=>XJ(v,N))}isSmallOrder(){return this.clearCofactor().is0()}isTorsionFree(){return g.unsafe(this,X.n).is0()}toAffine(V){let N=this,j=V,{X:M,Y:S,Z:L}=N,k=N.is0();if(j==null)j=k?FL:I.inv(L);let x=q(M*j),h=q(S*j),B=I.mul(L,j);if(k)return{x:MI,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 oJ(this.toBytes())}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}let g=new x8(v,Q.BITS);if(Q.BITS>=8)v.BASE.precompute(8);return Object.freeze(v.prototype),Object.freeze(v),v}class fq{static BASE;static ZERO;static Fp;static Fn;ep;constructor($){this.ep=$}static fromBytes($){Hq()}static fromHex($){Hq()}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 oJ(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 r8=BigInt(0),IG=BigInt(1),v4=BigInt(2);function xL($){return aU($,{P:"bigint",type:"string",adjustScalarBytes:"function",powPminus2:"function"},{randomBytes:"function"}),Object.freeze({...$})}function P5($){let U=xL($),{P:J,type:G,adjustScalarBytes:I,powPminus2:Q,randomBytes:X}=U,O=G==="x25519";if(!O&&G!=="x448")throw Error("invalid type");let D=X===void 0?eJ:X,q=O?255:448,z=O?32:56,W=O?BigInt(9):BigInt(5),w=O?BigInt(121665):BigInt(39081),v=O?v4**BigInt(254):v4**BigInt(447),g=O?BigInt(8)*v4**BigInt(251)-IG:BigInt(4)*v4**BigInt(445)-IG,V=v+g+IG,N=(R)=>F$(R,J),j=M(W);function M(R){return f8(N(R),z)}function S(R){let K=ZI(S$(R,z,"uCoordinate"));if(O)K[31]&=127;return N(Q0(K))}function L(R){return Q0(I(ZI(S$(R,z,"scalar"))))}function k(R,K){let T=a(S(K),L(R));if(T===r8)throw Error("invalid private or public key received");return M(T)}function x(R){return k(R,j)}let h=x,B=k;function m(R,K,T){let b=N(R*(K-T));return K=N(K-b),T=N(T+b),{x_2:K,x_3:T}}function a(R,K){p0("u",R,r8,J),p0("scalar",K,v,V);let T=K,b=R,P=IG,F=r8,y=R,n=IG,$$=r8;for(let D$=BigInt(q-1);D$>=r8;D$--){let W$=T>>D$&IG;$$^=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,M$=N(V$*V$),b$=v$-M$,k$=y+n,DU=y-n,qU=N(DU*N$),SU=N(k$*V$),W0=qU+SU,w0=qU-SU;y=N(W0*W0),n=N(b*N(w0*w0)),P=N(v$*M$),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 _={secretKey:z,publicKey:z,seed:z},A=(R)=>{return R=R===void 0?D(z):R,S$(R,_.seed,"seed"),R},E={randomSecretKey:A};return Object.freeze(_),Object.freeze(E),Object.freeze({keygen:m8(A,h),getSharedSecret:B,getPublicKey:h,scalarMult:k,scalarMultBase:x,utils:E,GuBytes:j.slice(),lengths:_})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */var mL=BigInt(0),a0=BigInt(1),B5=BigInt(2),yL=BigInt(3),rL=BigInt(5),hL=BigInt(8),DJ=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),xq=(()=>({p:DJ,n:BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),h:hL,a:BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),d:BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),Gx:BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),Gy:BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")}))();function C5($){let U=BigInt(10),J=BigInt(20),G=BigInt(40),I=BigInt(80),Q=DJ,O=$*$%Q*$%Q,D=tU(O,B5,Q)*O%Q,q=tU(D,a0,Q)*$%Q,z=tU(q,rL,Q)*q%Q,W=tU(z,U,Q)*z%Q,w=tU(W,J,Q)*W%Q,v=tU(w,G,Q)*w%Q,g=tU(v,I,Q)*v%Q,V=tU(g,I,Q)*v%Q,N=tU(V,U,Q)*z%Q;return{pow_p_5_8:tU(N,B5,Q)*$%Q,b2:O}}function lL($){return $[0]&=248,$[31]&=127,$[31]|=64,$}var kq=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");function mq($,U){let J=DJ,G=F$(U*U*U,J),I=F$(G*G*U,J),Q=C5($*I).pow_p_5_8,X=F$($*G*Q,J),O=F$(U*X*X,J),D=X,q=F$(X*kq,J),z=O===$,W=O===F$(-$,J),w=O===F$(-$*kq,J);if(z)X=D;if(W||w)X=q;if(o0(X,J))X=F$(-X,J);return{isValid:z||W,value:X}}var OJ=A5(xq,{uvRatio:mq}),jI=(()=>OJ.Fp)(),_5=(()=>OJ.Fn)();var V4=(()=>{let $=DJ;return P5({P:$,type:"x25519",powPminus2:(U)=>{let{pow_p_5_8:J,b2:G}=C5(U);return F$(tU(J,yL,$)*G,$)},adjustScalarBytes:lL})})();var Fq=kq,dL=BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"),nL=BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"),iL=BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"),cL=BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"),L5=($)=>mq(a0,$),pL=BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),uq=($)=>jI.create(Q0($)&pL);function S5($){let{d:U}=xq,J=DJ,G=(j)=>jI.create(j),I=G(Fq*$*$),Q=G((I+a0)*iL),X=BigInt(-1),O=G((X-U*I)*G(I+U)),{isValid:D,value:q}=mq(Q,O),z=G(q*$);if(!o0(z,J))z=G(-z);if(!D)q=z;if(!D)X=I;let W=G(X*(I-a0)*cL-O),w=q*q,v=G((q+q)*O),g=G(W*dL),V=G(a0-w),N=G(a0+w);return new OJ(G(v*N),G(V*g),G(g*N),G(v*V))}class TU extends fq{static BASE=(()=>new TU(OJ.BASE))();static ZERO=(()=>new TU(OJ.ZERO))();static Fp=(()=>jI)();static Fn=(()=>_5)();constructor($){super($)}static fromAffine($){return new TU(OJ.fromAffine($))}assertSame($){if(!($ instanceof TU))throw Error("RistrettoPoint expected")}init($){return new TU($)}static fromBytes($){t$($,32);let{a:U,d:J}=xq,G=DJ,I=(S)=>jI.create(S),Q=uq($);if(!tZ(jI.toBytes(Q),$)||o0(Q,G))throw Error("invalid ristretto255 encoding 1");let X=I(Q*Q),O=I(a0+U*X),D=I(a0-U*X),q=I(O*O),z=I(D*D),W=I(U*J*q-z),{isValid:w,value:v}=L5(I(W*z)),g=I(v*D),V=I(v*g*W),N=I((Q+Q)*g);if(o0(N,G))N=I(-N);let j=I(O*V),M=I(N*j);if(!w||o0(M,G)||j===mL)throw Error("invalid ristretto255 encoding 2");return new TU(new OJ(N,j,a0,M))}static fromHex($){return TU.fromBytes(O8($))}toBytes(){let{X:$,Y:U,Z:J,T:G}=this.ep,I=DJ,Q=(V)=>jI.create(V),X=Q(Q(J+U)*Q(J-U)),O=Q($*U),D=Q(O*O),{value:q}=L5(Q(X*D)),z=Q(q*X),W=Q(q*O),w=Q(z*W*G),v;if(o0(G*w,I)){let V=Q(U*Fq),N=Q($*Fq);$=V,U=N,v=Q(z*nL)}else v=W;if(o0($*w,I))U=Q(-U);let g=Q((J-U)*v);if(o0(g,I))g=Q(-g);return jI.toBytes(g)}equals($){this.assertSame($);let{X:U,Y:J}=this.ep,{X:G,Y:I}=$.ep,Q=(D)=>jI.create(D),X=Q(U*I)===Q(J*G),O=Q(J*I)===Q(U*G);return X||O}is0(){return this.equals(TU.ZERO)}}Object.freeze(TU.BASE);Object.freeze(TU.ZERO);Object.freeze(TU.prototype);Object.freeze(TU);var oL=Object.freeze({Point:TU,hashToCurve($,U){let J=U?.DST===void 0?"ristretto255_XMD:SHA-512_R255MAP_RO_":U.DST,G=Cq($,J,64,bQ);return oL.deriveToCurve(G)},hashToScalar($,U={DST:g5}){let J=Cq($,U.DST,64,bQ);return _5.create(Q0(J))},deriveToCurve($){t$($,64);let U=uq($.subarray(0,32)),J=S5(U),G=uq($.subarray(32,64)),I=S5(G);return new TU(J.add(I))}});var E5=!1,aL=!1;async function b5($,U){if(aL)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 N4($,U){return await b5(async()=>{let J=yq($)?$:await eL($),G=await crypto.subtle.importKey("raw",sL(U),{name:"X25519"},E5,[]);return new Uint8Array(await crypto.subtle.deriveBits({name:"X25519",public:G},J,256))},()=>{if(yq($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return V4.scalarMult($,U)})}async function h8($){return await b5(async()=>{return N4($,V4.GuBytes)},()=>{if(yq($))throw Error("CryptoKey provided but X25519 WebCrypto is not supported");return V4.scalarMultBase($)})}var tL=new Uint8Array([48,46,2,1,0,48,5,6,3,43,101,110,4,34,4,32]);async function eL($){if($.length!==32)throw Error("X25519 private key must be 32 bytes");let U=new Uint8Array([...tL,...$]);return crypto.subtle.importKey("pkcs8",U,{name:"X25519"},E5,["deriveBits"])}function yq($){return typeof CryptoKey<"u"&&$ instanceof CryptoKey}function sL($){return $}class rq{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),US(qJ($));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=qJ($),null;this.buf=J.value}}close(){return this.s.releaseLock(),{rest:this.buf,transcript:qJ(this.transcript)}}}function US($){return $.forEach((U)=>{if(U<32||U>126)throw Error("invalid non-ASCII byte in header")}),new TextDecoder().decode($)}function qJ($){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 JG($,...U){return $.pipeThrough(new TransformStream({start(J){for(let G of U)J.enqueue(G)}}))}function g4($){return new ReadableStream({start(U){U.enqueue($),U.close()}})}async function hq($){if(!($ instanceof ReadableStream))throw Error("readAll expects a ReadableStream<Uint8Array>");return new Uint8Array(await new Response($).arrayBuffer())}async function f5($){if(!($ instanceof ReadableStream))throw Error("readAllString expects a ReadableStream<Uint8Array>");return await new Response($).text()}async function k5($,U){let J=$.getReader(),G=[],I=0;while(I<U){let{done:D,value:q}=await J.read();if(D)throw Error("stream ended before reading "+U.toString()+" bytes");G.push(q),I+=q.length}J.releaseLock();let Q=qJ(G),X=Q.subarray(0,U),O=JG($,Q.subarray(U));return{data:X,rest:O}}class H0{args;body;constructor($,U){this.args=$,this.body=U}}async function IS($){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=WU.decode(Q);if(X.length>48)throw Error("invalid stanza");if(G.push(X),X.length<48)break}let I=qJ(G);return{s:new H0(J,I)}}async function F5($){let U=new rq($),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 IS(U);if(I!==void 0){G.push(I);continue}if(!Q.startsWith("--- "))throw Error("invalid header");let X=WU.decode(Q.slice(4)),{rest:O,transcript:D}=U.close(),q=D.slice(0,D.length-1-Q.length+3);return{stanzas:G,headerNoMAC:q,MAC:X,headerSize:D.length,rest:JG($,O)}}}function lq($){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(WU.encode(J.body.subarray(G,I))+`
 `)}if(J.body.length%48===0)U.push(`

package/dist/index.js CHANGED Viewed

@@ -310,7 +310,7 @@ Update marker: ${U.id}.
 `}function mH($){return $.replace(/[-:.TZ]/g,"").slice(0,14)}async function LG$($){await iU(c$($.artifactsDir,"report.json"),`${JSON.stringify($,null,2)}
 `),await iU(c$($.artifactsDir,"report.md"),EG$($))}function EG$($){let U=$.report.metrics.runtime,J=$.report.metrics.health,G=U.map((D)=>D.cpuPercent).sort((D,X)=>D-X),q=U.map((D)=>D.memoryPercent),I=J.filter((D)=>!D.ok),Q=["# 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((D)=>`| ${D.id} | ${D.operation} | ${D.count} | ${D.success?"pass":`fail: ${D.error??"unknown"}`} | ${_v(D.commitLatencyMs)} | ${_v(D.persistenceLatencyMs)} |`),"","## Runtime","",`- Samples: ${U.length}`,`- CPU p50/p95/p99/max: ${VQ(FH(G,0.5))} / ${VQ(FH(G,0.95))} / ${VQ(FH(G,0.99))} / ${VQ(G.at(-1))}`,`- Memory max: ${VQ(q.length?Math.max(...q):void 0)}`,`- PIDs max: ${U.length?Math.max(...U.map((D)=>D.pids)):"n/a"}`,`- Container status/restarts/OOM: ${$.report.metrics.container?`${$.report.metrics.container.status} / ${$.report.metrics.container.restartCount} / ${$.report.metrics.container.oomKilled}`:"unknown"}`,`- External AI calls: ${$.report.metrics.externalAiCalls??0}`,`- Health samples: ${J.length}`,`- Health failures: ${I.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)Q.push("## Failure","",$.report.failure,"");return`${Q.join(`
 `)}
-`}function FH($,U){if($.length===0)return;let J=Math.max(0,Math.ceil($.length*U)-1);return $[J]}function VQ($){return $===void 0?"n/a":`${$.toFixed(2)}%`}function _v($){return $===void 0?"n/a":`${($/1000).toFixed(1)}s`}var gG$,jG$,PG$;var OQ=O$(()=>{b$();rY();RJ();lY();Ev();Cv();lY();gG$=N.object({HCLOUD_TOKEN:N.string().min(1),KAMAL_SSH_PRIVATE_KEY:N.string().min(1),CONTENT_REPO_ADMIN_TOKEN:N.string().min(1)}),jG$=N.object({servers:N.array(N.object({id:N.number().int(),status:N.string(),public_net:N.object({ipv4:N.object({ip:N.string().min(1)})})}))}),PG$=N.object({status:N.literal("ready"),operationalStatus:N.literal("operational"),resources:N.object({queue:N.object({totals:N.object({pending:N.number().int().nonnegative(),processing:N.number().int().nonnegative()}),byType:N.array(N.object({type:N.string(),status:N.string(),count:N.number().int().nonnegative()}))})})})});import{access as qg,chmod as u7,mkdir as UX,readFile as Ig,writeFile as Gg}from"fs/promises";import{dirname as ck,join as B8}from"path";import{fileURLToPath as ok}from"url";var ZQ={name:"@rizom/ops",version:"0.2.0-alpha.297",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/profile":"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"};var pH=`ARG BUN_VERSION=1.3.10
+`}function FH($,U){if($.length===0)return;let J=Math.max(0,Math.ceil($.length*U)-1);return $[J]}function VQ($){return $===void 0?"n/a":`${$.toFixed(2)}%`}function _v($){return $===void 0?"n/a":`${($/1000).toFixed(1)}s`}var gG$,jG$,PG$;var OQ=O$(()=>{b$();rY();RJ();lY();Ev();Cv();lY();gG$=N.object({HCLOUD_TOKEN:N.string().min(1),KAMAL_SSH_PRIVATE_KEY:N.string().min(1),CONTENT_REPO_ADMIN_TOKEN:N.string().min(1)}),jG$=N.object({servers:N.array(N.object({id:N.number().int(),status:N.string(),public_net:N.object({ipv4:N.object({ip:N.string().min(1)})})}))}),PG$=N.object({status:N.literal("ready"),operationalStatus:N.literal("operational"),resources:N.object({queue:N.object({totals:N.object({pending:N.number().int().nonnegative(),processing:N.number().int().nonnegative()}),byType:N.array(N.object({type:N.string(),status:N.string(),count:N.number().int().nonnegative()}))})})})});import{access as qg,chmod as u7,mkdir as UX,readFile as Ig,writeFile as Gg}from"fs/promises";import{dirname as ck,join as B8}from"path";import{fileURLToPath as ok}from"url";var ZQ={name:"@rizom/ops",version:"0.2.0-alpha.298",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/profile":"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"};var pH=`ARG BUN_VERSION=1.3.10
 FROM oven/bun:\${BUN_VERSION}-slim AS runtime
 LABEL ai.rizom.brain.watchdog="true"

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@rizom/ops",
-  "version": "0.2.0-alpha.297",
+  "version": "0.2.0-alpha.298",
   "description": "Operator CLI for managing private brain fleet registry repos",
   "keywords": [
     "brains",