@acedatacloud/nexior 3.106.0 → 3.108.0

package/dist/assets/pixverse-C-kYKdXx.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"任务 ID",description:"任务的 ID"},"name.type":{message:"类型",description:"要生成的 Pixverse视频的内容类型，如'链接'、'文本'等"},"name.failure":{message:"失败",description:"任务的失败状态"},"name.failureReason":{message:"失败原因",description:"任务失败的原因"},"name.status":{message:"状态",description:"任务的状态"},"name.traceId":{message:"追踪 ID",description:"任务的追踪 ID"},"name.elapsed":{message:"耗时",description:"任务的耗时（秒）"},"name.createdAt":{message:"创建时间",description:"生成 Pixverse 视频的日期和时间"},"name.style":{message:"风格",description:"要生成的视频的风格"},"name.style1":{message:"赛博朋克",description:"要生成的视频的风格"},"name.style2":{message:"动漫",description:"要生成的视频的风格"},"name.style3":{message:"漫画",description:"要生成的视频的风格"},"name.style4":{message:"粘土",description:"要生成的视频的风格"},"name.style5":{message:"三维动画",description:"要生成的视频的风格"},"name.style6":{message:"写实",description:"要生成的视频的风格"},"name.motion":{message:"视频模式",description:"要生成的视频的模式"},"name.motion1":{message:"标准",description:"要生成的视频的模式"},"name.motion2":{message:"快速",description:"要生成的视频的模式"},"name.quality":{message:"视频质量",description:"要生成的视频的质量"},"name.startImage":{message:"首帧参考图片",description:"表单字段标签：首帧参考图（英文建议翻译为“First Frame”，保持简短避免遮挡按钮）"},"name.aspectRatio":{message:"宽高比",description:"要生成的视频的宽高比"},"name.videoUrl":{message:"自定义视频",description:"自定义视频"},"name.prompt":{message:"视频提示",description:"内容输入的提示"},"name.duration":{message:"视频时长",description:"视频的时长"},"name.model":{message:"模型版本",description:"要生成视频所采用的模型版本"},"name.seed":{message:"种子",description:"生成视频的随机种子"},"name.mode":{message:"视频模式",description:"要生成视频所采用的模式"},"name.effect":{message:"视频效果",description:"风格参数的名称，用于在不同版本或风格的模型之间切换"},"name.ingredientsModel":{message:"成分模型",description:"要生成视频所采用的模型版本"},"name.pixverseBot":{message:"Pixverse Bot",description:"Pixverse 视频生成器的名称"},"description.ingredients":{message:"如果您想上传多张图片来生成自己的视频，请打开此按钮。",description:"参数'ingredients'的描述"},"description.imageUrl":{message:"在多图创建视频的任务中，它必须上传多张图片。",description:"参数'imageUrl'的描述"},"description.prompt":{message:"生成Pixverse视频的提示词",description:"参数'prompt'的描述"},"description.negativePrompt":{message:"负向文本提示，可选，不能超过200个字符",description:"参数'prompt'的描述"},"description.uploadStartImage":{message:"上传首帧图像作为生成的参考，最后的视频会参考首帧生成",description:"上传参考参数的描述"},"description.uploadEndImage":{message:"上传尾帧图像作为生成的参考，最后的视频会参考尾帧生成",description:"上传参考参数的描述"},"description.seed":{message:"生成视频的种子值。如果不设置，则使用随机种子。",description:"上传参考参数的描述"},"status.pending":{message:"等待中",description:"任务的等待状态"},"status.processing":{message:"处理中",description:"任务的等待状态"},"placeholder.paddingNoise":{message:"请选择...",description:"填充噪音输入的占位符"},"placeholder.select":{message:"选择",description:"选择字段中的占位文本"},"placeholder.paddingLevel":{message:"请选择...",description:"填充级别的占位符"},"placeholder.prompt":{message:"输入要生成的视频风格的提示词，例如：quiver",description:"提示字段中的占位文本"},"placeholder.negativePrompt":{message:"输入要生成的视频风格的负向提示词，不超过200字符",description:"提示字段中的占位文本"},"placeholder.position":{message:"请选择...",description:"位置输入的占位符"},"placeholder.aspectRatio":{message:"请选择...",description:"宽高比输入的占位符"},"placeholder.preset":{message:"请选择...",description:"预设输入的占位符"},"placeholder.markerShape":{message:"请选择...",description:"标记形状输入的占位符"},"placeholder.rotate":{message:"请选择...",description:"旋转输入的占位符"},"placeholder.subMarker":{message:"请选择...",description:"子标记输入的占位符"},"button.generate":{message:"生成",description:"生成Pixverse视频的按钮文本"},"button.extend":{message:"扩展视频",description:"扩展视频按钮文本"},"button.download":{message:"下载视频",description:"下载视频按钮文本"},"button.uploadImageUrl":{message:"上传图片",description:"上传图片按钮文本（英文请简化为“Upload”，不要用“Upload Image”）"},"button.uploadVideoUrl":{message:"上传视频",description:"上传视频的按钮文本"},"button.uploadReferences":{message:"上传",description:"按钮文本，允许用户上传参考"},"message.uploadReferencesExceed":{message:"最多可上传 1 张图片",description:"上传的图片数量超过限制时的错误消息"},"message.uploadReferencesSuccess":{message:"成功上传图片",description:"成功上传图片时的成功消息"},"message.uploadReferencesError":{message:"上传图片失败，请稍后重试",description:"图片上传失败时的错误消息"},"message.startingTask":{message:"正在启动任务...",description:"绘图任务开始时的消息"},"message.startTaskSuccess":{message:"成功发起生成任务",description:"成功启动任务时的成功消息"},"message.startTaskFailed":{message:"发起任务失败，请联系管理员",description:"启动绘图任务失败时的错误消息"},"message.usedUp":{message:"您的积分已用完，请购买更多积分后继续使用",description:"已用完时的消息"},"message.generating":{message:"生成中...",description:"图像正在生成时的消息"},"message.downloadVideo":{message:"下载此视频",description:"图像正在生成时的消息"},"message.extendVideo":{message:"继续生成此视频",description:"图像正在生成时的消息"},"message.generateFailed":{message:"生成图像失败",description:"图像生成失败时的消息"},"message.uploadVideoExceed":{message:"上传首帧图片数量超过限制",description:"上传首帧图片数量超过限制时的错误信息"},"message.uploadVideoSizeExceed":{message:"上传文件大小不能超过 10MB!",description:"上传文件大小不能超过 10MB!时的错误信息"},"message.uploadVideoTypeFailed":{message:"上传文件必须是 MP4 格式!",description:"上传文件必须是 MP4 格式!的错误信息"},"message.uploadStartImageExceed":{message:"上传首帧图片数量超过限制",description:"上传首帧图片数量超过限制时的错误信息"},"message.uploadEndImageExceed":{message:"上传尾帧图片数量超过限制",description:"上传首帧图片数量超过限制时的错误信息"},"message.uploadStartImageError":{message:"上传首帧图片失败",description:"上传首帧图片失败时的错误信息"},"message.uploadVideoError":{message:"上传视频失败",description:"上传首帧图片失败时的错误信息"},"message.uploadEndImageError":{message:"上传尾帧图片失败",description:"上传尾帧图片失败时的错误信息"},"message.uploadDocumentsError":{message:"上传文档失败",description:"上传文档失败时的错误信息"},"message.noOperations":{message:"没有可用操作",description:"没有可用操作时的消息"},"message.noTasks":{message:"没有历史任务，请点击左方生成视频",description:"没有任务时的消息"}};export{e as default};

package/dist/assets/{play-store-BnIhGWxe.js → play-store-Dh4-9TDC.js}

@@ -1,4 +1,4 @@
-import{w as t}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const e=t` <svg
+import{w as t}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const e=t` <svg
   width="36"
   height="36"
   fill="none"

package/dist/assets/{plus-CH--V479.js → plus-DuKsmxfn.js}

@@ -1,4 +1,4 @@
-import{w as o}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const v=o`<svg
+import{w as o}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const v=o`<svg
   width="13"
   height="12"
   viewBox="0 0 13 12"

package/dist/assets/{price-BfW_ZaN-.js → price-WuGL9UMF.js}

@@ -1 +1 @@
-import{l as c,s as i,C as u}from"./index-Bk-O7L34.js";const l=n=>{const e=i.state.exchange;let{value:o,currency:t=i.state.currency||"usd"}=n;const r=u[t];if(!e)return{value:o,currency:t,label:r};const a=`usd-${t}`,s=e[a];return s&&(o=o*s),console.log("new price",{value:o,currency:t}),{value:o,currency:t,label:r}},d=n=>{let{value:e,defaultValue:o,fractionDigits:t=2}=n;if(e===void 0&&(e=o),e===void 0)return"";const r=l({value:e});return`${r.label}${r.value?.toFixed(t)}`},f=(n,e)=>{if(console.debug("getConsumption payload",n,e),!(!e||!Array.isArray(e))){console.debug("payload",n),console.debug("rules",e);for(const o of e){const t=o.conditions;if(c.apply(t,n))return c.apply(o.consumption,n)}return 0}};export{f as a,d as g};
+import{l as c,s as i,C as u}from"./index-CnxV03kA.js";const l=n=>{const e=i.state.exchange;let{value:o,currency:t=i.state.currency||"usd"}=n;const r=u[t];if(!e)return{value:o,currency:t,label:r};const a=`usd-${t}`,s=e[a];return s&&(o=o*s),console.log("new price",{value:o,currency:t}),{value:o,currency:t,label:r}},d=n=>{let{value:e,defaultValue:o,fractionDigits:t=2}=n;if(e===void 0&&(e=o),e===void 0)return"";const r=l({value:e});return`${r.label}${r.value?.toFixed(t)}`},f=(n,e)=>{if(console.debug("getConsumption payload",n,e),!(!e||!Array.isArray(e))){console.debug("payload",n),console.debug("rules",e);for(const o of e){const t=o.conditions;if(c.apply(t,n))return c.apply(o.consumption,n)}return 0}};export{f as a,d as g};

package/dist/assets/{producer-DzJnaKD8.js → producer-DbMvJ5IJ.js}

@@ -1 +1 @@
-import{a as e}from"./vendor-axios-B8_nURbH.js";import{B as o}from"./index-Bk-O7L34.js";class r{async task(a,t){return await e.post("/producer/tasks",{action:"retrieve",id:a},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:o})}async tasks(a,t){return await e.post("/producer/tasks",{action:"retrieve_batch",...a.ids?{ids:a.ids}:{},...a.userId?{user_id:a.userId}:{},...a.type?{type:a.type}:{},...a.applicationId?{application_id:a.applicationId}:{},...a.limit!==void 0?{limit:a.limit}:{},...a.offset!==void 0?{offset:a.offset}:{},...a.createdAtMax!==void 0?{created_at_max:a.createdAtMax}:{},...a.createdAtMin!==void 0?{created_at_min:a.createdAtMin}:{}},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:o})}async audio(a,t){return await e.post("/producer/audios",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async lyric(a,t){return await e.post("/producer/lyrics",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async upload(a,t){return await e.post("/producer/upload",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async video(a,t){return await e.post("/producer/videos",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async wav(a,t){return await e.post("/producer/wav",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}}const p=new r;export{p};
+import{a as e}from"./vendor-axios-B8_nURbH.js";import{B as o}from"./index-CnxV03kA.js";class r{async task(a,t){return await e.post("/producer/tasks",{action:"retrieve",id:a},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:o})}async tasks(a,t){return await e.post("/producer/tasks",{action:"retrieve_batch",...a.ids?{ids:a.ids}:{},...a.userId?{user_id:a.userId}:{},...a.type?{type:a.type}:{},...a.applicationId?{application_id:a.applicationId}:{},...a.limit!==void 0?{limit:a.limit}:{},...a.offset!==void 0?{offset:a.offset}:{},...a.createdAtMax!==void 0?{created_at_max:a.createdAtMax}:{},...a.createdAtMin!==void 0?{created_at_min:a.createdAtMin}:{}},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:o})}async audio(a,t){return await e.post("/producer/audios",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async lyric(a,t){return await e.post("/producer/lyrics",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async upload(a,t){return await e.post("/producer/upload",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async video(a,t){return await e.post("/producer/videos",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}async wav(a,t){return await e.post("/producer/wav",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json"},baseURL:o})}}const p=new r;export{p};

package/dist/assets/{qr-code-B2E5iWjp.js → qr-code-xikcy3vY.js}

@@ -1,4 +1,4 @@
-import{w as a}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const Z=a`<svg fill="none" viewBox="0 0 20 20">
+import{w as a}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const Z=a`<svg fill="none" viewBox="0 0 20 20">
   <path
     fill="currentColor"
     d="M3 6a3 3 0 0 1 3-3h1a1 1 0 1 0 0-2H6a5 5 0 0 0-5 5v1a1 1 0 0 0 2 0V6ZM13 1a1 1 0 1 0 0 2h1a3 3 0 0 1 3 3v1a1 1 0 1 0 2 0V6a5 5 0 0 0-5-5h-1ZM3 13a1 1 0 1 0-2 0v1a5 5 0 0 0 5 5h1a1 1 0 1 0 0-2H6a3 3 0 0 1-3-3v-1ZM19 13a1 1 0 1 0-2 0v1a3 3 0 0 1-3 3h-1a1 1 0 1 0 0 2h1.01a5 5 0 0 0 5-5v-1ZM5.3 6.36c-.04.2-.04.43-.04.89s0 .7.05.89c.14.52.54.92 1.06 1.06.19.05.42.05.89.05.46 0 .7 0 .88-.05A1.5 1.5 0 0 0 9.2 8.14c.06-.2.06-.43.06-.89s0-.7-.06-.89A1.5 1.5 0 0 0 8.14 5.3c-.19-.05-.42-.05-.88-.05-.47 0-.7 0-.9.05a1.5 1.5 0 0 0-1.05 1.06ZM10.8 6.36c-.04.2-.04.43-.04.89s0 .7.05.89c.14.52.54.92 1.06 1.06.19.05.42.05.89.05.46 0 .7 0 .88-.05a1.5 1.5 0 0 0 1.06-1.06c.06-.2.06-.43.06-.89s0-.7-.06-.89a1.5 1.5 0 0 0-1.06-1.06c-.19-.05-.42-.05-.88-.05-.47 0-.7 0-.9.05a1.5 1.5 0 0 0-1.05 1.06ZM5.26 12.75c0-.46 0-.7.05-.89a1.5 1.5 0 0 1 1.06-1.06c.19-.05.42-.05.89-.05.46 0 .7 0 .88.05.52.14.93.54 1.06 1.06.06.2.06.43.06.89s0 .7-.06.89a1.5 1.5 0 0 1-1.06 1.06c-.19.05-.42.05-.88.05-.47 0-.7 0-.9-.05a1.5 1.5 0 0 1-1.05-1.06c-.05-.2-.05-.43-.05-.89ZM10.8 11.86c-.04.2-.04.43-.04.89s0 .7.05.89c.14.52.54.92 1.06 1.06.19.05.42.05.89.05.46 0 .7 0 .88-.05a1.5 1.5 0 0 0 1.06-1.06c.06-.2.06-.43.06-.89s0-.7-.06-.89a1.5 1.5 0 0 0-1.06-1.06c-.19-.05-.42-.05-.88-.05-.47 0-.7 0-.9.05a1.5 1.5 0 0 0-1.05 1.06Z"

package/dist/assets/{qrart-BKfYE4ea.js → qrart-3p-uK2yX.js}

@@ -1 +1 @@
-import{a as s}from"./vendor-axios-B8_nURbH.js";import{B as e}from"./index-Bk-O7L34.js";const A="38ecf158-36f2-42f2-8e7f-6786cdfc2452",_=2,R=20,i="",T="text",p="1:1",E=!1,d=5,L="center",D="square",U="square",Q="square",u=0,F="H",I=0;class o{async task(a,t){return await s.post("/qrart/tasks",{action:"retrieve",id:a},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:e})}async tasks(a,t){return await s.post("/qrart/tasks",{action:"retrieve_batch",...a.ids?{ids:a.ids}:{},...a.applicationId?{application_id:a.applicationId}:{},...a.userId?{user_id:a.userId}:{},...a.limit!==void 0?{limit:a.limit}:{},...a.offset!==void 0?{offset:a.offset}:{},...a.createdAtMax!==void 0?{created_at_max:a.createdAtMax}:{},...a.createdAtMin!==void 0?{created_at_min:a.createdAtMin}:{}},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:e})}async generate(a,t){return await s.post("/qrart/generate",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json",accept:"application/x-ndjson"},baseURL:e})}}const m=new o;export{A as Q,T as a,p as b,_ as c,R as d,E as e,U as f,Q as g,u as h,F as i,L as j,d as k,I as l,D as m,i as n,m as q};
+import{a as s}from"./vendor-axios-B8_nURbH.js";import{B as e}from"./index-CnxV03kA.js";const A="38ecf158-36f2-42f2-8e7f-6786cdfc2452",_=2,R=20,i="",T="text",p="1:1",E=!1,d=5,L="center",D="square",U="square",Q="square",u=0,F="H",I=0;class o{async task(a,t){return await s.post("/qrart/tasks",{action:"retrieve",id:a},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:e})}async tasks(a,t){return await s.post("/qrart/tasks",{action:"retrieve_batch",...a.ids?{ids:a.ids}:{},...a.applicationId?{application_id:a.applicationId}:{},...a.userId?{user_id:a.userId}:{},...a.limit!==void 0?{limit:a.limit}:{},...a.offset!==void 0?{offset:a.offset}:{},...a.createdAtMax!==void 0?{created_at_max:a.createdAtMax}:{},...a.createdAtMin!==void 0?{created_at_min:a.createdAtMin}:{}},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${t.token}`,"x-record-exempt":"true"},baseURL:e})}async generate(a,t){return await s.post("/qrart/generate",a,{headers:{authorization:`Bearer ${t.token}`,"content-type":"application/json",accept:"application/x-ndjson"},baseURL:e})}}const m=new o;export{A as Q,T as a,p as b,_ as c,R as d,E as e,U as f,Q as g,u as h,F as i,L as j,d as k,I as l,D as m,i as n,m as q};

package/dist/assets/qrart-DiuNraHY.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"任务 ID",description:"任务的 ID"},"name.type":{message:"类型",description:"要生成的 QR 码的内容类型，如'链接'、'文本'等"},"name.failure":{message:"失败",description:"任务的失败状态"},"name.failureReason":{message:"失败原因",description:"任务失败的原因"},"name.status":{message:"状态",description:"任务的状态"},"name.traceId":{message:"追踪 ID",description:"任务的追踪 ID"},"name.elapsed":{message:"耗时",description:"任务的耗时（秒）"},"name.size":{message:"尺寸",description:"要生成的 QR 码的尺寸"},"name.createdAt":{message:"创建时间",description:"生成 QR 码的日期和时间"},"name.pixelStyle":{message:"像素风格",description:"要生成的 QR 码的像素风格"},"name.seed":{message:"种子值",description:"要生成的 QR 码的种子"},"name.paddingLevel":{message:"填充级别",description:"要生成的 QR 码的填充级别"},"name.paddingNoise":{message:"填充噪音",description:"要生成的 QR 码的填充噪音"},"name.content":{message:"内容",description:"要生成的 QR 码的内容"},"name.ecl":{message:"纠错级别",description:"要生成的 QR 码的纠错级别"},"name.position":{message:"位置",description:"要生成的 QR 码的位置"},"name.prompt":{message:"提示",description:"内容输入的提示"},"name.rotate":{message:"旋转角度",description:"要生成的 QR 码的旋转"},"name.advanced":{message:"高级",description:"要生成的 QR 码的高级设置"},"name.aspectRatio":{message:"宽高比",description:"要生成的 QR 码的宽高比"},"name.markerShape":{message:"标记形状",description:"要生成的 QR 码的标记形状"},"name.subMarker":{message:"子标记",description:"要生成的 QR 码的子标记"},"name.qrw":{message:"可见度",description:"QR 码生成器的名称"},"name.steps":{message:"生成步数",description:"生成 QR 码的步数"},"name.preset":{message:"预设风格",description:"要生成的 QR 码的预设"},"name.qrartBot":{message:"QrArt Bot",description:"QR 码生成器的名称"},"name.contentImageUrl":{message:"内容图片链接",description:"要生成的 QR 码的内容图片 URL"},"inputWay.input":{message:"输入",description:"输入方式"},"inputWay.upload":{message:"上传",description:"输入方式"},"description.qrw":{message:"QR 码可见性，尺寸越大，QR 码可见度越高",description:"参数'qrw'的描述"},"description.steps":{message:"生成 QR 码的步数，步数越多，QR 码可见度越高",description:"参数'steps'的描述"},"status.pending":{message:"等待中",description:"任务的等待状态"},"placeholder.paddingNoise":{message:"请选择...",description:"填充噪音输入的占位符"},"placeholder.paddingLevel":{message:"请选择...",description:"填充级别的占位符"},"placeholder.prompt":{message:"输入要生成的 QR 码风格的提示词，例如：flowers",description:"提示字段中的占位文本"},"placeholder.seed":{message:"种子范围为 1 到 9007199254740991",description:"种子输入的占位符"},"placeholder.position":{message:"请选择...",description:"位置输入的占位符"},"placeholder.content":{message:"输入要生成的 QR 码的内容，例如：https://www.google.com",description:"内容字段中的占位文本"},"placeholder.aspectRatio":{message:"请选择...",description:"宽高比输入的占位符"},"placeholder.preset":{message:"请选择...",description:"预设输入的占位符"},"placeholder.markerShape":{message:"请选择...",description:"标记形状输入的占位符"},"placeholder.rotate":{message:"请选择...",description:"旋转输入的占位符"},"placeholder.subMarker":{message:"请选择...",description:"子标记输入的占位符"},"button.generate":{message:"生成",description:"生成 QR 码的按钮文本"},"button.uploadQr":{message:"上传二维码",description:"上传二维码的按钮文本"},"preset.sunset":{message:"日落",description:"要生成的 QR 码的预设风格"},"preset.floral":{message:"花卉",description:"要生成的 QR 码的预设风格"},"preset.snowflakes":{message:"雪花",description:"要生成的 QR 码的预设风格"},"preset.feathers":{message:"羽毛",description:"要生成的 QR 码的预设风格"},"preset.raindrops":{message:"雨滴",description:"要生成的 QR 码的预设风格"},"preset.ultraRealism":{message:"超现实",description:"要生成的 QR 码的预设风格"},"preset.epicRealms":{message:"史诗王国",description:"要生成的 QR 码的预设风格"},"preset.intricateStudio":{message:"复杂工作室",description:"要生成的 QR 码的预设风格"},"preset.symmetricMasterpiece":{message:"对称杰作",description:"要生成的 QR 码的预设风格"},"preset.luminousHighway":{message:"发光之路",description:"要生成的 QR 码的预设风格"},"preset.celestialJourney":{message:"天体之旅",description:"要生成的 QR 码的预设风格"},"preset.neonMech":{message:"霓虹机械",description:"要生成的 QR 码的预设风格"},"preset.etherealLowPoly":{message:"空灵低多边形",description:"要生成的 QR 码的预设风格"},"preset.goldenVista":{message:"金色景观",description:"要生成的 QR 码的预设风格"},"preset.cinematicExpanse":{message:"电影般的广阔",description:"要生成的 QR 码的预设风格"},"preset.cinematicWarm":{message:"电影般的温暖",description:"要生成的 QR 码的预设风格"},"preset.desolateWilderness":{message:"荒凉荒野",description:"要生成的 QR 码的预设风格"},"preset.vibrantPalette":{message:"充满活力的调色板",description:"要生成的 QR 码的预设风格"},"preset.enigmaticJourney":{message:"神秘之旅",description:"要生成的 QR 码的预设风格"},"preset.timelessCinematic":{message:"永恒的电影",description:"要生成的 QR 码的预设风格"},"preset.regalGalaxy":{message:"华丽星系",description:"要生成的 QR 码的预设风格"},"preset.illustriousCanvas":{message:"杰出画布",description:"要生成的 QR 码的预设风格"},"preset.expressiveMural":{message:"富有表现力的壁画",description:"要生成的 QR 码的预设风格"},"preset.sereneHaze":{message:"宁静薄雾",description:"要生成的 QR 码的预设风格"},"message.uploadQr":{message:"上传二维码图片，可生成和二维码内容一致的艺术二维码",description:"上传二维码的说明"},"message.promptPlaceholder":{message:"请输入描述要生成的图像的句子，例如：一只可爱的猫。额外参数将覆盖默认预设参数",description:"提示字段中的占位文本"},"message.uploadReferencesExceed":{message:"最多可上传 5 张图片",description:"上传的图片数量超过限制时的错误消息"},"message.uploadReferencesSuccess":{message:"成功上传图片",description:"成功上传图片时的成功消息"},"message.uploadReferencesError":{message:"上传图片失败，请稍后重试",description:"图片上传失败时的错误消息"},"message.startingTask":{message:"正在启动任务...",description:"绘图任务开始时的消息"},"message.startTaskSuccess":{message:"成功发起生成任务",description:"成功启动任务时的成功消息"},"message.startTaskFailed":{message:"发起任务失败，请联系管理员",description:"启动绘图任务失败时的错误消息"},"message.usedUp":{message:"您的积分已用完，请购买更多积分后继续使用",description:"已用完时的消息"},"message.generating":{message:"生成中...",description:"图像正在生成时的消息"},"message.generateFailed":{message:"生成图像失败",description:"图像生成失败时的消息"},"message.noOperations":{message:"没有可用操作",description:"没有可用操作时的消息"},"message.noTasks":{message:"没有历史任务，请点击下方生成新二维码",description:"没有任务时的消息"},"markerShape.square":{message:"正方形",description:"用于生成QR码的标记形状"},"markerShape.circle":{message:"圆形",description:"用于生成QR码的标记形状"},"markerShape.plus":{message:"加号",description:"用于生成QR码的标记形状"},"markerShape.box":{message:"方框",description:"用于生成QR码的标记形状"},"markerShape.octagon":{message:"八边形",description:"用于生成QR码的标记形状"},"markerShape.tinyPlus":{message:"微加号",description:"用于生成QR码的标记形状"},"markerShape.random":{message:"随机",description:"用于生成QR码的标记形状"},"subMarker.square":{message:"正方形",description:"用于生成QR码的子标记形状"},"subMarker.circle":{message:"圆形",description:"用于生成QR码的子标记形状"},"subMarker.plus":{message:"加号",description:"用于生成QR码的子标记形状"},"subMarker.box":{message:"方框",description:"用于生成QR码的子标记形状"},"subMarker.random":{message:"随机",description:"用于生成QR码的子标记形状"},"position.center":{message:"中心",description:"用于生成QR码的位置"},"position.topLeft":{message:"左上",description:"用于生成QR码的位置"},"position.topRight":{message:"右上",description:"用于生成QR码的位置"},"position.bottomLeft":{message:"左下",description:"用于生成QR码的位置"},"position.bottomRight":{message:"右下",description:"用于生成QR码的位置"},"position.top":{message:"顶部",description:"用于生成QR码的位置"},"position.bottom":{message:"底部",description:"用于生成QR码的位置"},"position.left":{message:"左侧",description:"用于生成QR码的位置"},"position.right":{message:"右侧",description:"用于生成QR码的位置"},"pixelStyle.row":{message:"行",description:"用于生成QR码的像素风格"},"pixelStyle.column":{message:"列",description:"用于生成QR码的像素风格"},"pixelStyle.square":{message:"正方形",description:"用于生成QR码的像素风格"},"pixelStyle.rounded":{message:"圆角",description:"用于生成QR码的像素风格"},"pixelStyle.dot":{message:"点",description:"用于生成QR码的像素风格"},"pixelStyle.squircle":{message:"圆角矩形",description:"用于生成QR码的像素风格"},"type.text":{message:"文本",description:"用于生成QR码的内容类型"},"type.link":{message:"链接",description:"用于生成QR码的内容类型"},"type.email":{message:"邮件",description:"用于生成QR码的内容类型"},"type.phone":{message:"电话",description:"用于生成QR码的内容类型"},"type.sms":{message:"短信",description:"用于生成QR码的内容类型"},"name.rawurl":{message:"原始链接",description:"是否将原始链接直接作为二维码内容、不做任何处理的开关"},"placeholder.ecl":{message:"请选择...",description:"纠错级别选择框的占位符"},"placeholder.pixelStyle":{message:"请选择...",description:"像素风格选择框的占位符"},"placeholder.select":{message:"请选择...",description:"二维码类型选择框的通用占位符"},"message.uploadDocumentsExceed":{message:"最多可上传 1 张图片",description:"上传内容图片超出数量限制时的提示"},"message.uploadDocumentsError":{message:"图片上传失败，请稍后重试",description:"内容图片上传失败时的错误提示"}};export{e as default};

package/dist/assets/qrart-nw_f4DkT.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"Task ID",description:"The ID of the task"},"name.type":{message:"Type",description:"The content type of the QR code to be generated, such as 'link', 'text', etc."},"name.failure":{message:"Failure",description:"The failure status of the task"},"name.failureReason":{message:"Failure Reason",description:"The reason for the task failure"},"name.status":{message:"Status",description:"The status of the task"},"name.traceId":{message:"Trace ID",description:"The trace ID of the task"},"name.elapsed":{message:"Elapsed",description:"Elapsed time of the task in seconds"},"name.size":{message:"Size",description:"The size of the QR code to be generated"},"name.createdAt":{message:"Created At",description:"The date and time the QR code was generated"},"name.pixelStyle":{message:"Pixel Style",description:"The pixel style of the QR code to be generated"},"name.seed":{message:"Seed Value",description:"The seed for generating the QR code"},"name.paddingLevel":{message:"Padding Level",description:"The padding level of the QR code to be generated"},"name.paddingNoise":{message:"Padding Noise",description:"The padding noise of the QR code to be generated"},"name.content":{message:"Content",description:"The content of the QR code to be generated"},"name.ecl":{message:"Error Correction Level",description:"The error correction level of the QR code to be generated"},"name.position":{message:"Position",description:"The position of the QR code to be generated"},"name.prompt":{message:"Prompt",description:"The prompt for content input"},"name.rotate":{message:"Rotation Angle",description:"The rotation of the QR code to be generated"},"name.advanced":{message:"Advanced",description:"The advanced settings for the QR code to be generated"},"name.aspectRatio":{message:"Aspect Ratio",description:"The aspect ratio of the QR code to be generated"},"name.markerShape":{message:"Marker Shape",description:"The marker shape of the QR code to be generated"},"name.subMarker":{message:"Sub Marker",description:"The sub marker of the QR code to be generated"},"name.qrw":{message:"Visibility",description:"The name of the QR code generator"},"name.steps":{message:"Generation Steps",description:"The number of steps to generate the QR code"},"name.preset":{message:"Preset Style",description:"The preset for the QR code to be generated"},"name.qrartBot":{message:"QrArt Bot",description:"The name of the QR code generator"},"name.contentImageUrl":{message:"Content Image URL",description:"The content image URL for the QR code to be generated"},"inputWay.input":{message:"Input",description:"Input method"},"inputWay.upload":{message:"Upload",description:"Input method"},"description.qrw":{message:"QR code visibility; the larger the size, the higher the visibility of the QR code",description:"Description of the 'qrw' parameter"},"description.steps":{message:"The number of steps to generate the QR code; the more steps, the higher the visibility of the QR code",description:"Description of the 'steps' parameter"},"status.pending":{message:"Pending",description:"The pending status of the task"},"placeholder.paddingNoise":{message:"Please select...",description:"Placeholder for padding noise input"},"placeholder.paddingLevel":{message:"Please select...",description:"Placeholder for padding level"},"placeholder.prompt":{message:"Enter a prompt for the QR code style, e.g., flowers",description:"Placeholder text in the prompt field"},"placeholder.seed":{message:"Seed range is 1 to 9007199254740991",description:"Placeholder for seed input"},"placeholder.position":{message:"Please select...",description:"Placeholder for position input"},"placeholder.content":{message:"Enter the content for the QR code, e.g., https://www.google.com",description:"Placeholder text in the content field"},"placeholder.aspectRatio":{message:"Please select...",description:"Placeholder for aspect ratio input"},"placeholder.preset":{message:"Please select...",description:"Placeholder for preset input"},"placeholder.markerShape":{message:"Please select...",description:"Placeholder for marker shape input"},"placeholder.rotate":{message:"Please select...",description:"Placeholder for rotation input"},"placeholder.subMarker":{message:"Please select...",description:"Placeholder for sub marker input"},"button.generate":{message:"Generate",description:"Button text to generate the QR code"},"button.uploadQr":{message:"Upload QR Code",description:"Button text to upload the QR code"},"preset.sunset":{message:"Sunset",description:"The preset style for the QR code to be generated"},"preset.floral":{message:"Floral",description:"The preset style for the QR code to be generated"},"preset.snowflakes":{message:"Snowflakes",description:"The preset style for the QR code to be generated"},"preset.feathers":{message:"Feathers",description:"The preset style for the QR code to be generated"},"preset.raindrops":{message:"Raindrops",description:"The preset style for the QR code to be generated"},"preset.ultraRealism":{message:"Ultra Realism",description:"The preset style for the QR code to be generated"},"preset.epicRealms":{message:"Epic Realms",description:"The preset style for the QR code to be generated"},"preset.intricateStudio":{message:"Intricate Studio",description:"Preset style for generating the QR code"},"preset.symmetricMasterpiece":{message:"Symmetric Masterpiece",description:"Preset style for generating the QR code"},"preset.luminousHighway":{message:"Luminous Highway",description:"Preset style for generating the QR code"},"preset.celestialJourney":{message:"Celestial Journey",description:"Preset style for generating the QR code"},"preset.neonMech":{message:"Neon Mech",description:"Preset style for generating the QR code"},"preset.etherealLowPoly":{message:"Ethereal Low Poly",description:"Preset style for generating the QR code"},"preset.goldenVista":{message:"Golden Vista",description:"Preset style for generating the QR code"},"preset.cinematicExpanse":{message:"Cinematic Expanse",description:"Preset style for generating the QR code"},"preset.cinematicWarm":{message:"Cinematic Warmth",description:"Preset style for generating the QR code"},"preset.desolateWilderness":{message:"Desolate Wilderness",description:"Preset style for generating the QR code"},"preset.vibrantPalette":{message:"Vibrant Palette",description:"Preset style for generating the QR code"},"preset.enigmaticJourney":{message:"Enigmatic Journey",description:"Preset style for generating the QR code"},"preset.timelessCinematic":{message:"Timeless Cinematic",description:"Preset style for generating the QR code"},"preset.regalGalaxy":{message:"Regal Galaxy",description:"Preset style for generating the QR code"},"preset.illustriousCanvas":{message:"Illustrious Canvas",description:"Preset style for generating the QR code"},"preset.expressiveMural":{message:"Expressive Mural",description:"Preset style for generating the QR code"},"preset.sereneHaze":{message:"Serene Haze",description:"Preset style for generating the QR code"},"message.uploadQr":{message:"Upload QR code image to generate an artistic QR code matching the content",description:"Instructions for uploading the QR code"},"message.promptPlaceholder":{message:"Enter a sentence describing the image to generate, e.g., a cute cat. Additional parameters will override default preset parameters",description:"Placeholder text in the prompt field"},"message.uploadReferencesExceed":{message:"You can upload up to 5 images",description:"Error message when the number of uploaded images exceeds the limit"},"message.uploadReferencesSuccess":{message:"Image uploaded successfully",description:"Success message when an image is uploaded successfully"},"message.uploadReferencesError":{message:"Image upload failed, please try again later",description:"Error message when image upload fails"},"message.startingTask":{message:"Starting task...",description:"Message when the drawing task starts"},"message.startTaskSuccess":{message:"Task initiated successfully",description:"Success message when the task is successfully started"},"message.startTaskFailed":{message:"Task initiation failed, please contact the administrator",description:"Error message when starting the drawing task fails"},"message.usedUp":{message:"Your credits are exhausted, please purchase more credits to continue",description:"Message when credits are used up"},"message.generating":{message:"Generating...",description:"Message when the image is being generated"},"message.generateFailed":{message:"Image generation failed",description:"Message when image generation fails"},"message.noOperations":{message:"No available operations",description:"Message when there are no available operations"},"message.noTasks":{message:"No history tasks, please click below to generate a new QR code",description:"Message when there are no tasks"},"markerShape.square":{message:"Square",description:"Marker shape used for generating QR codes"},"markerShape.circle":{message:"Circle",description:"Marker shape used for generating QR codes"},"markerShape.plus":{message:"Plus",description:"Marker shape used for generating QR codes"},"markerShape.box":{message:"Box",description:"Marker shape used for generating QR codes"},"markerShape.octagon":{message:"Octagon",description:"Marker shape used for generating QR codes"},"markerShape.tinyPlus":{message:"Tiny Plus",description:"Marker shape used for generating QR codes"},"markerShape.random":{message:"Random",description:"Marker shape used for generating QR codes"},"subMarker.square":{message:"Square",description:"Sub-marker shape used for generating QR codes"},"subMarker.circle":{message:"Circle",description:"Sub-marker shape used for generating QR codes"},"subMarker.plus":{message:"Plus",description:"Sub-marker shape used for generating QR codes"},"subMarker.box":{message:"Box",description:"Sub-marker shape used for generating QR codes"},"subMarker.random":{message:"Random",description:"Sub-marker shape used for generating QR codes"},"position.center":{message:"Center",description:"Position used for generating QR codes"},"position.topLeft":{message:"Top Left",description:"Position used for generating QR codes"},"position.topRight":{message:"Top Right",description:"Position used for generating QR codes"},"position.bottomLeft":{message:"Bottom Left",description:"Position for generating the QR code"},"position.bottomRight":{message:"Bottom Right",description:"Position for generating the QR code"},"position.top":{message:"Top",description:"Position for generating the QR code"},"position.bottom":{message:"Bottom",description:"Position for generating the QR code"},"position.left":{message:"Left",description:"Position for generating the QR code"},"position.right":{message:"Right",description:"Position for generating the QR code"},"pixelStyle.row":{message:"Row",description:"Pixel style for generating the QR code"},"pixelStyle.column":{message:"Column",description:"Pixel style for generating the QR code"},"pixelStyle.square":{message:"Square",description:"Pixel style for generating the QR code"},"pixelStyle.rounded":{message:"Rounded",description:"Pixel style for generating the QR code"},"pixelStyle.dot":{message:"Dot",description:"Pixel style for generating the QR code"},"pixelStyle.squircle":{message:"Squircle",description:"Pixel style for generating the QR code"},"type.text":{message:"Text",description:"Content type for generating the QR code"},"type.link":{message:"Link",description:"Content type for generating the QR code"},"type.email":{message:"Email",description:"Content type for generating the QR code"},"type.phone":{message:"Phone",description:"Content type for generating the QR code"},"type.sms":{message:"SMS",description:"Content type for generating the QR code"},"name.rawurl":{message:"Raw Link",description:"Switch to use the raw link directly as QR code content without any processing"},"placeholder.ecl":{message:"Please select...",description:"Placeholder for the error correction level selection box"},"placeholder.pixelStyle":{message:"Please select...",description:"Placeholder for the pixel style selection box"},"placeholder.select":{message:"Please select...",description:"Generic placeholder for the QR code type selection box"},"message.uploadDocumentsExceed":{message:"You can upload up to 1 image",description:"Message when the uploaded content exceeds the number limit"},"message.uploadDocumentsError":{message:"Image upload failed, please try again later",description:"Error message when the content image upload fails"}};export{e as default};

package/dist/assets/{recycle-horizontal-D03Efwmz.js → recycle-horizontal-BTeDybYv.js}

@@ -1,4 +1,4 @@
-import{w as o}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const c=o`<svg
+import{w as o}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const c=o`<svg
   fill="none"
   viewBox="0 0 21 20"
 >

package/dist/assets/{refresh-D2AAfCBr.js → refresh-wEube-8p.js}

@@ -1,4 +1,4 @@
-import{w as o}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const d=o`<svg fill="none" viewBox="0 0 14 16">
+import{w as o}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const d=o`<svg fill="none" viewBox="0 0 14 16">
   <path
     fill="currentColor"
     fill-rule="evenodd"

package/dist/assets/{reown-logo-BPgm3Wzi.js → reown-logo-Duvq4cIZ.js}

@@ -1,4 +1,4 @@
-import{w as C}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const f=C`<svg width="60" height="16" viewBox="0 0 60 16" fill="none"">
+import{w as C}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const f=C`<svg width="60" height="16" viewBox="0 0 60 16" fill="none"">
   <path d="M9.3335 4.66667C9.3335 2.08934 11.4229 0 14.0002 0H20.6669C23.2442 0 25.3335 2.08934 25.3335 4.66667V11.3333C25.3335 13.9106 23.2442 16 20.6669 16H14.0002C11.4229 16 9.3335 13.9106 9.3335 11.3333V4.66667Z" fill="#363636"/>
   <path d="M15.6055 11.0003L17.9448 4.66699H18.6316L16.2923 11.0003H15.6055Z" fill="#F6F6F6"/>
   <path d="M0 4.33333C0 1.9401 1.9401 0 4.33333 0C6.72657 0 8.66669 1.9401 8.66669 4.33333V11.6667C8.66669 14.0599 6.72657 16 4.33333 16C1.9401 16 0 14.0599 0 11.6667V4.33333Z" fill="#363636"/>

package/dist/assets/{search-DRsKuVCX.js → search-4dSIOsol.js}

@@ -1,4 +1,4 @@
-import{w as o}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const d=o`<svg fill="none" viewBox="0 0 20 20">
+import{w as o}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";const d=o`<svg fill="none" viewBox="0 0 20 20">
   <path
     fill="currentColor"
     fill-rule="evenodd"

package/dist/assets/{secp256k1-D5SIpaDf.js → secp256k1-D3b5sS3Y.js}

@@ -1 +1 @@
-import{i as Xt,j as St,k as xt,l as Qt,m as de,n as he,o as P,p as ge,q as we,s as pe,u as be}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";function ye(n,e,t,r){if(typeof n.setBigUint64=="function")return n.setBigUint64(e,t,r);const o=BigInt(32),s=BigInt(4294967295),c=Number(t>>o&s),f=Number(t&s),i=r?4:0,u=r?0:4;n.setUint32(e+i,c,r),n.setUint32(e+u,f,r)}function me(n,e,t){return n&e^~n&t}function xe(n,e,t){return n&e^n&t^e&t}class Ee extends Xt{constructor(e,t,r,o){super(),this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=o,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(e),this.view=St(this.buffer)}update(e){xt(this);const{view:t,buffer:r,blockLen:o}=this;e=Qt(e);const s=e.length;for(let c=0;c<s;){const f=Math.min(o-this.pos,s-c);if(f===o){const i=St(e);for(;o<=s-c;c+=o)this.process(i,c);continue}r.set(e.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===o&&(this.process(t,0),this.pos=0)}return this.length+=e.length,this.roundClean(),this}digestInto(e){xt(this),de(e,this),this.finished=!0;const{buffer:t,view:r,blockLen:o,isLE:s}=this;let{pos:c}=this;t[c++]=128,this.buffer.subarray(c).fill(0),this.padOffset>o-c&&(this.process(r,0),c=0);for(let h=c;h<o;h++)t[h]=0;ye(r,o-8,BigInt(this.length*8),s),this.process(r,0);const f=St(e),i=this.outputLen;if(i%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const u=i/4,y=this.get();if(u>y.length)throw new Error("_sha2: outputLen bigger than state");for(let h=0;h<u;h++)f.setUint32(4*h,y[h],s)}digest(){const{buffer:e,outputLen:t}=this;this.digestInto(e);const r=e.slice(0,t);return this.destroy(),r}_cloneInto(e){e||(e=new this.constructor),e.set(...this.get());const{blockLen:t,buffer:r,length:o,finished:s,destroyed:c,pos:f}=this;return e.length=o,e.pos=f,e.finished=s,e.destroyed=c,o%t&&e.buffer.set(r),e}}const Be=new Uint32Array([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]),Q=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),J=new Uint32Array(64);class ve extends Ee{constructor(){super(64,32,8,!1),this.A=Q[0]|0,this.B=Q[1]|0,this.C=Q[2]|0,this.D=Q[3]|0,this.E=Q[4]|0,this.F=Q[5]|0,this.G=Q[6]|0,this.H=Q[7]|0}get(){const{A:e,B:t,C:r,D:o,E:s,F:c,G:f,H:i}=this;return[e,t,r,o,s,c,f,i]}set(e,t,r,o,s,c,f,i){this.A=e|0,this.B=t|0,this.C=r|0,this.D=o|0,this.E=s|0,this.F=c|0,this.G=f|0,this.H=i|0}process(e,t){for(let h=0;h<16;h++,t+=4)J[h]=e.getUint32(t,!1);for(let h=16;h<64;h++){const l=J[h-15],m=J[h-2],N=P(l,7)^P(l,18)^l>>>3,b=P(m,17)^P(m,19)^m>>>10;J[h]=b+J[h-7]+N+J[h-16]|0}let{A:r,B:o,C:s,D:c,E:f,F:i,G:u,H:y}=this;for(let h=0;h<64;h++){const l=P(f,6)^P(f,11)^P(f,25),m=y+l+me(f,i,u)+Be[h]+J[h]|0,b=(P(r,2)^P(r,13)^P(r,22))+xe(r,o,s)|0;y=u,u=i,i=f,f=c+m|0,c=s,s=o,o=r,r=m+b|0}r=r+this.A|0,o=o+this.B|0,s=s+this.C|0,c=c+this.D|0,f=f+this.E|0,i=i+this.F|0,u=u+this.G|0,y=y+this.H|0,this.set(r,o,s,c,f,i,u,y)}roundClean(){J.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Se=he(()=>new ve);const zt=BigInt(0),Jt=BigInt(1),Ae=BigInt(2);function it(n){return n instanceof Uint8Array||ArrayBuffer.isView(n)&&n.constructor.name==="Uint8Array"}function bt(n){if(!it(n))throw new Error("Uint8Array expected")}function at(n,e){if(typeof e!="boolean")throw new Error(n+" boolean expected, got "+e)}const Ie=Array.from({length:256},(n,e)=>e.toString(16).padStart(2,"0"));function ut(n){bt(n);let e="";for(let t=0;t<n.length;t++)e+=Ie[n[t]];return e}function gt(n){const e=n.toString(16);return e.length&1?"0"+e:e}function Ct(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);return n===""?zt:BigInt("0x"+n)}const D={_0:48,_9:57,A:65,F:70,a:97,f:102};function jt(n){if(n>=D._0&&n<=D._9)return n-D._0;if(n>=D.A&&n<=D.F)return n-(D.A-10);if(n>=D.a&&n<=D.f)return n-(D.a-10)}function wt(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);const e=n.length,t=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(t);for(let o=0,s=0;o<t;o++,s+=2){const c=jt(n.charCodeAt(s)),f=jt(n.charCodeAt(s+1));if(c===void 0||f===void 0){const i=n[s]+n[s+1];throw new Error('hex string expected, got non-hex character "'+i+'" at index '+s)}r[o]=c*16+f}return r}function rt(n){return Ct(ut(n))}function Zt(n){return bt(n),Ct(ut(Uint8Array.from(n).reverse()))}function lt(n,e){return wt(n.toString(16).padStart(e*2,"0"))}function Rt(n,e){return lt(n,e).reverse()}function K(n,e,t){let r;if(typeof e=="string")try{r=wt(e)}catch(s){throw new Error(n+" must be hex string or Uint8Array, cause: "+s)}else if(it(e))r=Uint8Array.from(e);else throw new Error(n+" must be hex string or Uint8Array");const o=r.length;if(typeof t=="number"&&o!==t)throw new Error(n+" of length "+t+" expected, got "+o);return r}function pt(...n){let e=0;for(let r=0;r<n.length;r++){const o=n[r];bt(o),e+=o.length}const t=new Uint8Array(e);for(let r=0,o=0;r<n.length;r++){const s=n[r];t.set(s,o),o+=s.length}return t}const At=n=>typeof n=="bigint"&&zt<=n;function Et(n,e,t){return At(n)&&At(e)&&At(t)&&e<=n&&n<t}function ot(n,e,t,r){if(!Et(e,t,r))throw new Error("expected valid "+n+": "+t+" <= n < "+r+", got "+e)}function te(n){let e;for(e=0;n>zt;n>>=Jt,e+=1);return e}const Mt=n=>(Ae<<BigInt(n-1))-Jt,It=n=>new Uint8Array(n),Yt=n=>Uint8Array.from(n);function ee(n,e,t){if(typeof n!="number"||n<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof t!="function")throw new Error("hmacFn must be a function");let r=It(n),o=It(n),s=0;const c=()=>{r.fill(1),o.fill(0),s=0},f=(...h)=>t(o,r,...h),i=(h=It())=>{o=f(Yt([0]),h),r=f(),h.length!==0&&(o=f(Yt([1]),h),r=f())},u=()=>{if(s++>=1e3)throw new Error("drbg: tried 1000 values");let h=0;const l=[];for(;h<e;){r=f();const m=r.slice();l.push(m),h+=r.length}return pt(...l)};return(h,l)=>{c(),i(h);let m;for(;!(m=l(u()));)i();return c(),m}}const Ne={bigint:n=>typeof n=="bigint",function:n=>typeof n=="function",boolean:n=>typeof n=="boolean",string:n=>typeof n=="string",stringOrUint8Array:n=>typeof n=="string"||it(n),isSafeInteger:n=>Number.isSafeInteger(n),array:n=>Array.isArray(n),field:(n,e)=>e.Fp.isValid(n),hash:n=>typeof n=="function"&&Number.isSafeInteger(n.outputLen)};function yt(n,e,t={}){const r=(o,s,c)=>{const f=Ne[s];if(typeof f!="function")throw new Error("invalid validator function");const i=n[o];if(!(c&&i===void 0)&&!f(i,n))throw new Error("param "+String(o)+" is invalid. Expected "+s+", got "+i)};for(const[o,s]of Object.entries(e))r(o,s,!1);for(const[o,s]of Object.entries(t))r(o,s,!0);return n}function Ht(n){const e=new WeakMap;return(t,...r)=>{const o=e.get(t);if(o!==void 0)return o;const s=n(t,...r);return e.set(t,s),s}}const qe=Object.freeze(Object.defineProperty({__proto__:null,aInRange:ot,abool:at,abytes:bt,bitLen:te,bitMask:Mt,bytesToHex:ut,bytesToNumberBE:rt,bytesToNumberLE:Zt,concatBytes:pt,createHmacDrbg:ee,ensureBytes:K,hexToBytes:wt,hexToNumber:Ct,inRange:Et,isBytes:it,memoized:Ht,numberToBytesBE:lt,numberToBytesLE:Rt,numberToHexUnpadded:gt,validateObject:yt},Symbol.toStringTag,{value:"Module"}));class ne extends Xt{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,ge(e);const r=Qt(t);if(this.iHash=e.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const o=this.blockLen,s=new Uint8Array(o);s.set(r.length>o?e.create().update(r).digest():r);for(let c=0;c<s.length;c++)s[c]^=54;this.iHash.update(s),this.oHash=e.create();for(let c=0;c<s.length;c++)s[c]^=106;this.oHash.update(s),s.fill(0)}update(e){return xt(this),this.iHash.update(e),this}digestInto(e){xt(this),we(e,this.outputLen),this.finished=!0,this.iHash.digestInto(e),this.oHash.update(e),this.oHash.digestInto(e),this.destroy()}digest(){const e=new Uint8Array(this.oHash.outputLen);return this.digestInto(e),e}_cloneInto(e){e||(e=Object.create(Object.getPrototypeOf(this),{}));const{oHash:t,iHash:r,finished:o,destroyed:s,blockLen:c,outputLen:f}=this;return e=e,e.finished=o,e.destroyed=s,e.blockLen=c,e.outputLen=f,e.oHash=t._cloneInto(e.oHash),e.iHash=r._cloneInto(e.iHash),e}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const re=(n,e,t)=>new ne(n,e).update(t).digest();re.create=(n,e)=>new ne(n,e);const z=BigInt(0),_=BigInt(1),nt=BigInt(2),Oe=BigInt(3),Ut=BigInt(4),Ft=BigInt(5),Kt=BigInt(8);function V(n,e){const t=n%e;return t>=z?t:e+t}function Le(n,e,t){if(e<z)throw new Error("invalid exponent, negatives unsupported");if(t<=z)throw new Error("invalid modulus");if(t===_)return z;let r=_;for(;e>z;)e&_&&(r=r*n%t),n=n*n%t,e>>=_;return r}function Y(n,e,t){let r=n;for(;e-- >z;)r*=r,r%=t;return r}function _t(n,e){if(n===z)throw new Error("invert: expected non-zero number");if(e<=z)throw new Error("invert: expected positive modulus, got "+e);let t=V(n,e),r=e,o=z,s=_;for(;t!==z;){const f=r/t,i=r%t,u=o-s*f;r=t,t=i,o=s,s=u}if(r!==_)throw new Error("invert: does not exist");return V(o,e)}function He(n){const e=(n-_)/nt;let t,r,o;for(t=n-_,r=0;t%nt===z;t/=nt,r++);for(o=nt;o<n&&Le(o,e,n)!==n-_;o++)if(o>1e3)throw new Error("Cannot find square root: likely non-prime P");if(r===1){const c=(n+_)/Ut;return function(i,u){const y=i.pow(u,c);if(!i.eql(i.sqr(y),u))throw new Error("Cannot find square root");return y}}const s=(t+_)/nt;return function(f,i){if(f.pow(i,e)===f.neg(f.ONE))throw new Error("Cannot find square root");let u=r,y=f.pow(f.mul(f.ONE,o),t),h=f.pow(i,s),l=f.pow(i,t);for(;!f.eql(l,f.ONE);){if(f.eql(l,f.ZERO))return f.ZERO;let m=1;for(let b=f.sqr(l);m<u&&!f.eql(b,f.ONE);m++)b=f.sqr(b);const N=f.pow(y,_<<BigInt(u-m-1));y=f.sqr(N),h=f.mul(h,N),l=f.mul(l,y),u=m}return h}}function Ue(n){if(n%Ut===Oe){const e=(n+_)/Ut;return function(r,o){const s=r.pow(o,e);if(!r.eql(r.sqr(s),o))throw new Error("Cannot find square root");return s}}if(n%Kt===Ft){const e=(n-Ft)/Kt;return function(r,o){const s=r.mul(o,nt),c=r.pow(s,e),f=r.mul(o,c),i=r.mul(r.mul(f,nt),c),u=r.mul(f,r.sub(i,r.ONE));if(!r.eql(r.sqr(u),o))throw new Error("Cannot find square root");return u}}return He(n)}const _e=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function ke(n){const e={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},t=_e.reduce((r,o)=>(r[o]="function",r),e);return yt(n,t)}function Te(n,e,t){if(t<z)throw new Error("invalid exponent, negatives unsupported");if(t===z)return n.ONE;if(t===_)return e;let r=n.ONE,o=e;for(;t>z;)t&_&&(r=n.mul(r,o)),o=n.sqr(o),t>>=_;return r}function ze(n,e){const t=new Array(e.length),r=e.reduce((s,c,f)=>n.is0(c)?s:(t[f]=s,n.mul(s,c)),n.ONE),o=n.inv(r);return e.reduceRight((s,c,f)=>n.is0(c)?s:(t[f]=n.mul(s,t[f]),n.mul(s,c)),o),t}function oe(n,e){const t=e!==void 0?e:n.toString(2).length,r=Math.ceil(t/8);return{nBitLength:t,nByteLength:r}}function ie(n,e,t=!1,r={}){if(n<=z)throw new Error("invalid field: expected ORDER > 0, got "+n);const{nBitLength:o,nByteLength:s}=oe(n,e);if(s>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:n,isLE:t,BITS:o,BYTES:s,MASK:Mt(o),ZERO:z,ONE:_,create:i=>V(i,n),isValid:i=>{if(typeof i!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof i);return z<=i&&i<n},is0:i=>i===z,isOdd:i=>(i&_)===_,neg:i=>V(-i,n),eql:(i,u)=>i===u,sqr:i=>V(i*i,n),add:(i,u)=>V(i+u,n),sub:(i,u)=>V(i-u,n),mul:(i,u)=>V(i*u,n),pow:(i,u)=>Te(f,i,u),div:(i,u)=>V(i*_t(u,n),n),sqrN:i=>i*i,addN:(i,u)=>i+u,subN:(i,u)=>i-u,mulN:(i,u)=>i*u,inv:i=>_t(i,n),sqrt:r.sqrt||(i=>(c||(c=Ue(n)),c(f,i))),invertBatch:i=>ze(f,i),cmov:(i,u,y)=>y?u:i,toBytes:i=>t?Rt(i,s):lt(i,s),fromBytes:i=>{if(i.length!==s)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+i.length);return t?Zt(i):rt(i)}});return Object.freeze(f)}function se(n){if(typeof n!="bigint")throw new Error("field order must be bigint");const e=n.toString(2).length;return Math.ceil(e/8)}function ce(n){const e=se(n);return e+Math.ceil(e/2)}function Ce(n,e,t=!1){const r=n.length,o=se(e),s=ce(e);if(r<16||r<s||r>1024)throw new Error("expected "+s+"-1024 bytes of input, got "+r);const c=t?Zt(n):rt(n),f=V(c,e-_)+_;return t?Rt(f,o):lt(f,o)}const Pt=BigInt(0),mt=BigInt(1);function Nt(n,e){const t=e.negate();return n?t:e}function fe(n,e){if(!Number.isSafeInteger(n)||n<=0||n>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+n)}function qt(n,e){fe(n,e);const t=Math.ceil(e/n)+1,r=2**(n-1);return{windows:t,windowSize:r}}function Ze(n,e){if(!Array.isArray(n))throw new Error("array expected");n.forEach((t,r)=>{if(!(t instanceof e))throw new Error("invalid point at index "+r)})}function Re(n,e){if(!Array.isArray(n))throw new Error("array of scalars expected");n.forEach((t,r)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+r)})}const Ot=new WeakMap,ae=new WeakMap;function Lt(n){return ae.get(n)||1}function Me(n,e){return{constTimeNegate:Nt,hasPrecomputes(t){return Lt(t)!==1},unsafeLadder(t,r,o=n.ZERO){let s=t;for(;r>Pt;)r&mt&&(o=o.add(s)),s=s.double(),r>>=mt;return o},precomputeWindow(t,r){const{windows:o,windowSize:s}=qt(r,e),c=[];let f=t,i=f;for(let u=0;u<o;u++){i=f,c.push(i);for(let y=1;y<s;y++)i=i.add(f),c.push(i);f=i.double()}return c},wNAF(t,r,o){const{windows:s,windowSize:c}=qt(t,e);let f=n.ZERO,i=n.BASE;const u=BigInt(2**t-1),y=2**t,h=BigInt(t);for(let l=0;l<s;l++){const m=l*c;let N=Number(o&u);o>>=h,N>c&&(N-=y,o+=mt);const b=m,a=m+Math.abs(N)-1,g=l%2!==0,x=N<0;N===0?i=i.add(Nt(g,r[b])):f=f.add(Nt(x,r[a]))}return{p:f,f:i}},wNAFUnsafe(t,r,o,s=n.ZERO){const{windows:c,windowSize:f}=qt(t,e),i=BigInt(2**t-1),u=2**t,y=BigInt(t);for(let h=0;h<c;h++){const l=h*f;if(o===Pt)break;let m=Number(o&i);if(o>>=y,m>f&&(m-=u,o+=mt),m===0)continue;let N=r[l+Math.abs(m)-1];m<0&&(N=N.negate()),s=s.add(N)}return s},getPrecomputes(t,r,o){let s=Ot.get(r);return s||(s=this.precomputeWindow(r,t),t!==1&&Ot.set(r,o(s))),s},wNAFCached(t,r,o){const s=Lt(t);return this.wNAF(s,this.getPrecomputes(s,t,o),r)},wNAFCachedUnsafe(t,r,o,s){const c=Lt(t);return c===1?this.unsafeLadder(t,r,s):this.wNAFUnsafe(c,this.getPrecomputes(c,t,o),r,s)},setWindowSize(t,r){fe(r,e),ae.set(t,r),Ot.delete(t)}}}function Ve(n,e,t,r){if(Ze(t,n),Re(r,e),t.length!==r.length)throw new Error("arrays of points and scalars must have equal length");const o=n.ZERO,s=te(BigInt(t.length)),c=s>12?s-3:s>4?s-2:s?2:1,f=(1<<c)-1,i=new Array(f+1).fill(o),u=Math.floor((e.BITS-1)/c)*c;let y=o;for(let h=u;h>=0;h-=c){i.fill(o);for(let m=0;m<r.length;m++){const N=r[m],b=Number(N>>BigInt(h)&BigInt(f));i[b]=i[b].add(t[m])}let l=o;for(let m=i.length-1,N=o;m>0;m--)N=N.add(i[m]),l=l.add(N);if(y=y.add(l),h!==0)for(let m=0;m<c;m++)y=y.double()}return y}function ue(n){return ke(n.Fp),yt(n,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...oe(n.n,n.nBitLength),...n,p:n.Fp.ORDER})}function Gt(n){n.lowS!==void 0&&at("lowS",n.lowS),n.prehash!==void 0&&at("prehash",n.prehash)}function je(n){const e=ue(n);yt(e,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:r,a:o}=e;if(t){if(!r.eql(o,r.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...e})}const{bytesToNumberBE:Ye,hexToBytes:Fe}=qe;class Ke extends Error{constructor(e=""){super(e)}}const $={Err:Ke,_tlv:{encode:(n,e)=>{const{Err:t}=$;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length&1)throw new t("tlv.encode: unpadded data");const r=e.length/2,o=gt(r);if(o.length/2&128)throw new t("tlv.encode: long form length too big");const s=r>127?gt(o.length/2|128):"";return gt(n)+s+o+e},decode(n,e){const{Err:t}=$;let r=0;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length<2||e[r++]!==n)throw new t("tlv.decode: wrong tlv");const o=e[r++],s=!!(o&128);let c=0;if(!s)c=o;else{const i=o&127;if(!i)throw new t("tlv.decode(long): indefinite length not supported");if(i>4)throw new t("tlv.decode(long): byte length is too big");const u=e.subarray(r,r+i);if(u.length!==i)throw new t("tlv.decode: length bytes not complete");if(u[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const y of u)c=c<<8|y;if(r+=i,c<128)throw new t("tlv.decode(long): not minimal encoding")}const f=e.subarray(r,r+c);if(f.length!==c)throw new t("tlv.decode: wrong value length");return{v:f,l:e.subarray(r+c)}}},_int:{encode(n){const{Err:e}=$;if(n<W)throw new e("integer: negative integers are not allowed");let t=gt(n);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new e("unexpected DER parsing assertion: unpadded hex");return t},decode(n){const{Err:e}=$;if(n[0]&128)throw new e("invalid signature integer: negative");if(n[0]===0&&!(n[1]&128))throw new e("invalid signature integer: unnecessary leading zero");return Ye(n)}},toSig(n){const{Err:e,_int:t,_tlv:r}=$,o=typeof n=="string"?Fe(n):n;bt(o);const{v:s,l:c}=r.decode(48,o);if(c.length)throw new e("invalid signature: left bytes after parsing");const{v:f,l:i}=r.decode(2,s),{v:u,l:y}=r.decode(2,i);if(y.length)throw new e("invalid signature: left bytes after parsing");return{r:t.decode(f),s:t.decode(u)}},hexFromSig(n){const{_tlv:e,_int:t}=$,r=e.encode(2,t.encode(n.r)),o=e.encode(2,t.encode(n.s)),s=r+o;return e.encode(48,s)}},W=BigInt(0),T=BigInt(1);BigInt(2);const Dt=BigInt(3);BigInt(4);function Pe(n){const e=je(n),{Fp:t}=e,r=ie(e.n,e.nBitLength),o=e.toBytes||((b,a,g)=>{const x=a.toAffine();return pt(Uint8Array.from([4]),t.toBytes(x.x),t.toBytes(x.y))}),s=e.fromBytes||(b=>{const a=b.subarray(1),g=t.fromBytes(a.subarray(0,t.BYTES)),x=t.fromBytes(a.subarray(t.BYTES,2*t.BYTES));return{x:g,y:x}});function c(b){const{a,b:g}=e,x=t.sqr(b),E=t.mul(x,b);return t.add(t.add(E,t.mul(b,a)),g)}if(!t.eql(t.sqr(e.Gy),c(e.Gx)))throw new Error("bad generator point: equation left != right");function f(b){return Et(b,T,e.n)}function i(b){const{allowedPrivateKeyLengths:a,nByteLength:g,wrapPrivateKey:x,n:E}=e;if(a&&typeof b!="bigint"){if(it(b)&&(b=ut(b)),typeof b!="string"||!a.includes(b.length))throw new Error("invalid private key");b=b.padStart(g*2,"0")}let q;try{q=typeof b=="bigint"?b:rt(K("private key",b,g))}catch{throw new Error("invalid private key, expected hex or "+g+" bytes, got "+typeof b)}return x&&(q=V(q,E)),ot("private key",q,T,E),q}function u(b){if(!(b instanceof l))throw new Error("ProjectivePoint expected")}const y=Ht((b,a)=>{const{px:g,py:x,pz:E}=b;if(t.eql(E,t.ONE))return{x:g,y:x};const q=b.is0();a==null&&(a=q?t.ONE:t.inv(E));const L=t.mul(g,a),I=t.mul(x,a),B=t.mul(E,a);if(q)return{x:t.ZERO,y:t.ZERO};if(!t.eql(B,t.ONE))throw new Error("invZ was invalid");return{x:L,y:I}}),h=Ht(b=>{if(b.is0()){if(e.allowInfinityPoint&&!t.is0(b.py))return;throw new Error("bad point: ZERO")}const{x:a,y:g}=b.toAffine();if(!t.isValid(a)||!t.isValid(g))throw new Error("bad point: x or y not FE");const x=t.sqr(g),E=c(a);if(!t.eql(x,E))throw new Error("bad point: equation left != right");if(!b.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class l{constructor(a,g,x){if(this.px=a,this.py=g,this.pz=x,a==null||!t.isValid(a))throw new Error("x required");if(g==null||!t.isValid(g))throw new Error("y required");if(x==null||!t.isValid(x))throw new Error("z required");Object.freeze(this)}static fromAffine(a){const{x:g,y:x}=a||{};if(!a||!t.isValid(g)||!t.isValid(x))throw new Error("invalid affine point");if(a instanceof l)throw new Error("projective point not allowed");const E=q=>t.eql(q,t.ZERO);return E(g)&&E(x)?l.ZERO:new l(g,x,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(a){const g=t.invertBatch(a.map(x=>x.pz));return a.map((x,E)=>x.toAffine(g[E])).map(l.fromAffine)}static fromHex(a){const g=l.fromAffine(s(K("pointHex",a)));return g.assertValidity(),g}static fromPrivateKey(a){return l.BASE.multiply(i(a))}static msm(a,g){return Ve(l,r,a,g)}_setWindowSize(a){N.setWindowSize(this,a)}assertValidity(){h(this)}hasEvenY(){const{y:a}=this.toAffine();if(t.isOdd)return!t.isOdd(a);throw new Error("Field doesn't support isOdd")}equals(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a,B=t.eql(t.mul(g,I),t.mul(q,E)),A=t.eql(t.mul(x,I),t.mul(L,E));return B&&A}negate(){return new l(this.px,t.neg(this.py),this.pz)}double(){const{a,b:g}=e,x=t.mul(g,Dt),{px:E,py:q,pz:L}=this;let I=t.ZERO,B=t.ZERO,A=t.ZERO,v=t.mul(E,E),C=t.mul(q,q),U=t.mul(L,L),H=t.mul(E,q);return H=t.add(H,H),A=t.mul(E,L),A=t.add(A,A),I=t.mul(a,A),B=t.mul(x,U),B=t.add(I,B),I=t.sub(C,B),B=t.add(C,B),B=t.mul(I,B),I=t.mul(H,I),A=t.mul(x,A),U=t.mul(a,U),H=t.sub(v,U),H=t.mul(a,H),H=t.add(H,A),A=t.add(v,v),v=t.add(A,v),v=t.add(v,U),v=t.mul(v,H),B=t.add(B,v),U=t.mul(q,L),U=t.add(U,U),v=t.mul(U,H),I=t.sub(I,v),A=t.mul(U,C),A=t.add(A,A),A=t.add(A,A),new l(I,B,A)}add(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a;let B=t.ZERO,A=t.ZERO,v=t.ZERO;const C=e.a,U=t.mul(e.b,Dt);let H=t.mul(g,q),j=t.mul(x,L),d=t.mul(E,I),w=t.add(g,x),p=t.add(q,L);w=t.mul(w,p),p=t.add(H,j),w=t.sub(w,p),p=t.add(g,E);let S=t.add(q,I);return p=t.mul(p,S),S=t.add(H,d),p=t.sub(p,S),S=t.add(x,E),B=t.add(L,I),S=t.mul(S,B),B=t.add(j,d),S=t.sub(S,B),v=t.mul(C,p),B=t.mul(U,d),v=t.add(B,v),B=t.sub(j,v),v=t.add(j,v),A=t.mul(B,v),j=t.add(H,H),j=t.add(j,H),d=t.mul(C,d),p=t.mul(U,p),j=t.add(j,d),d=t.sub(H,d),d=t.mul(C,d),p=t.add(p,d),H=t.mul(j,p),A=t.add(A,H),H=t.mul(S,p),B=t.mul(w,B),B=t.sub(B,H),H=t.mul(w,j),v=t.mul(S,v),v=t.add(v,H),new l(B,A,v)}subtract(a){return this.add(a.negate())}is0(){return this.equals(l.ZERO)}wNAF(a){return N.wNAFCached(this,a,l.normalizeZ)}multiplyUnsafe(a){const{endo:g,n:x}=e;ot("scalar",a,W,x);const E=l.ZERO;if(a===W)return E;if(this.is0()||a===T)return this;if(!g||N.hasPrecomputes(this))return N.wNAFCachedUnsafe(this,a,l.normalizeZ);let{k1neg:q,k1:L,k2neg:I,k2:B}=g.splitScalar(a),A=E,v=E,C=this;for(;L>W||B>W;)L&T&&(A=A.add(C)),B&T&&(v=v.add(C)),C=C.double(),L>>=T,B>>=T;return q&&(A=A.negate()),I&&(v=v.negate()),v=new l(t.mul(v.px,g.beta),v.py,v.pz),A.add(v)}multiply(a){const{endo:g,n:x}=e;ot("scalar",a,T,x);let E,q;if(g){const{k1neg:L,k1:I,k2neg:B,k2:A}=g.splitScalar(a);let{p:v,f:C}=this.wNAF(I),{p:U,f:H}=this.wNAF(A);v=N.constTimeNegate(L,v),U=N.constTimeNegate(B,U),U=new l(t.mul(U.px,g.beta),U.py,U.pz),E=v.add(U),q=C.add(H)}else{const{p:L,f:I}=this.wNAF(a);E=L,q=I}return l.normalizeZ([E,q])[0]}multiplyAndAddUnsafe(a,g,x){const E=l.BASE,q=(I,B)=>B===W||B===T||!I.equals(E)?I.multiplyUnsafe(B):I.multiply(B),L=q(this,g).add(q(a,x));return L.is0()?void 0:L}toAffine(a){return y(this,a)}isTorsionFree(){const{h:a,isTorsionFree:g}=e;if(a===T)return!0;if(g)return g(l,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:a,clearCofactor:g}=e;return a===T?this:g?g(l,this):this.multiplyUnsafe(e.h)}toRawBytes(a=!0){return at("isCompressed",a),this.assertValidity(),o(l,this,a)}toHex(a=!0){return at("isCompressed",a),ut(this.toRawBytes(a))}}l.BASE=new l(e.Gx,e.Gy,t.ONE),l.ZERO=new l(t.ZERO,t.ONE,t.ZERO);const m=e.nBitLength,N=Me(l,e.endo?Math.ceil(m/2):m);return{CURVE:e,ProjectivePoint:l,normPrivateKeyToScalar:i,weierstrassEquation:c,isWithinCurveOrder:f}}function Ge(n){const e=ue(n);return yt(e,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...e})}function De(n){const e=Ge(n),{Fp:t,n:r}=e,o=t.BYTES+1,s=2*t.BYTES+1;function c(d){return V(d,r)}function f(d){return _t(d,r)}const{ProjectivePoint:i,normPrivateKeyToScalar:u,weierstrassEquation:y,isWithinCurveOrder:h}=Pe({...e,toBytes(d,w,p){const S=w.toAffine(),O=t.toBytes(S.x),k=pt;return at("isCompressed",p),p?k(Uint8Array.from([w.hasEvenY()?2:3]),O):k(Uint8Array.from([4]),O,t.toBytes(S.y))},fromBytes(d){const w=d.length,p=d[0],S=d.subarray(1);if(w===o&&(p===2||p===3)){const O=rt(S);if(!Et(O,T,t.ORDER))throw new Error("Point is not on curve");const k=y(O);let R;try{R=t.sqrt(k)}catch(F){const M=F instanceof Error?": "+F.message:"";throw new Error("Point is not on curve"+M)}const Z=(R&T)===T;return(p&1)===1!==Z&&(R=t.neg(R)),{x:O,y:R}}else if(w===s&&p===4){const O=t.fromBytes(S.subarray(0,t.BYTES)),k=t.fromBytes(S.subarray(t.BYTES,2*t.BYTES));return{x:O,y:k}}else{const O=o,k=s;throw new Error("invalid Point, expected length of "+O+", or uncompressed "+k+", got "+w)}}}),l=d=>ut(lt(d,e.nByteLength));function m(d){const w=r>>T;return d>w}function N(d){return m(d)?c(-d):d}const b=(d,w,p)=>rt(d.slice(w,p));class a{constructor(w,p,S){this.r=w,this.s=p,this.recovery=S,this.assertValidity()}static fromCompact(w){const p=e.nByteLength;return w=K("compactSignature",w,p*2),new a(b(w,0,p),b(w,p,2*p))}static fromDER(w){const{r:p,s:S}=$.toSig(K("DER",w));return new a(p,S)}assertValidity(){ot("r",this.r,T,r),ot("s",this.s,T,r)}addRecoveryBit(w){return new a(this.r,this.s,w)}recoverPublicKey(w){const{r:p,s:S,recovery:O}=this,k=I(K("msgHash",w));if(O==null||![0,1,2,3].includes(O))throw new Error("recovery id invalid");const R=O===2||O===3?p+e.n:p;if(R>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=(O&1)===0?"02":"03",G=i.fromHex(Z+l(R)),F=f(R),M=c(-k*F),st=c(S*F),X=i.BASE.multiplyAndAddUnsafe(G,M,st);if(!X)throw new Error("point at infinify");return X.assertValidity(),X}hasHighS(){return m(this.s)}normalizeS(){return this.hasHighS()?new a(this.r,c(-this.s),this.recovery):this}toDERRawBytes(){return wt(this.toDERHex())}toDERHex(){return $.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return wt(this.toCompactHex())}toCompactHex(){return l(this.r)+l(this.s)}}const g={isValidPrivateKey(d){try{return u(d),!0}catch{return!1}},normPrivateKeyToScalar:u,randomPrivateKey:()=>{const d=ce(e.n);return Ce(e.randomBytes(d),e.n)},precompute(d=8,w=i.BASE){return w._setWindowSize(d),w.multiply(BigInt(3)),w}};function x(d,w=!0){return i.fromPrivateKey(d).toRawBytes(w)}function E(d){const w=it(d),p=typeof d=="string",S=(w||p)&&d.length;return w?S===o||S===s:p?S===2*o||S===2*s:d instanceof i}function q(d,w,p=!0){if(E(d))throw new Error("first arg must be private key");if(!E(w))throw new Error("second arg must be public key");return i.fromHex(w).multiply(u(d)).toRawBytes(p)}const L=e.bits2int||function(d){if(d.length>8192)throw new Error("input is too large");const w=rt(d),p=d.length*8-e.nBitLength;return p>0?w>>BigInt(p):w},I=e.bits2int_modN||function(d){return c(L(d))},B=Mt(e.nBitLength);function A(d){return ot("num < 2^"+e.nBitLength,d,W,B),lt(d,e.nByteLength)}function v(d,w,p=C){if(["recovered","canonical"].some(tt=>tt in p))throw new Error("sign() legacy options not supported");const{hash:S,randomBytes:O}=e;let{lowS:k,prehash:R,extraEntropy:Z}=p;k==null&&(k=!0),d=K("msgHash",d),Gt(p),R&&(d=K("prehashed msgHash",S(d)));const G=I(d),F=u(w),M=[A(F),A(G)];if(Z!=null&&Z!==!1){const tt=Z===!0?O(t.BYTES):Z;M.push(K("extraEntropy",tt))}const st=pt(...M),X=G;function Bt(tt){const ct=L(tt);if(!h(ct))return;const vt=f(ct),dt=i.BASE.multiply(ct).toAffine(),et=c(dt.x);if(et===W)return;const ht=c(vt*c(X+et*F));if(ht===W)return;let ft=(dt.x===et?0:2)|Number(dt.y&T),Vt=ht;return k&&m(ht)&&(Vt=N(ht),ft^=1),new a(et,Vt,ft)}return{seed:st,k2sig:Bt}}const C={lowS:e.lowS,prehash:!1},U={lowS:e.lowS,prehash:!1};function H(d,w,p=C){const{seed:S,k2sig:O}=v(d,w,p),k=e;return ee(k.hash.outputLen,k.nByteLength,k.hmac)(S,O)}i.BASE._setWindowSize(8);function j(d,w,p,S=U){const O=d;w=K("msgHash",w),p=K("publicKey",p);const{lowS:k,prehash:R,format:Z}=S;if(Gt(S),"strict"in S)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const G=typeof O=="string"||it(O),F=!G&&!Z&&typeof O=="object"&&O!==null&&typeof O.r=="bigint"&&typeof O.s=="bigint";if(!G&&!F)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let M,st;try{if(F&&(M=new a(O.r,O.s)),G){try{Z!=="compact"&&(M=a.fromDER(O))}catch(ft){if(!(ft instanceof $.Err))throw ft}!M&&Z!=="der"&&(M=a.fromCompact(O))}st=i.fromHex(p)}catch{return!1}if(!M||k&&M.hasHighS())return!1;R&&(w=e.hash(w));const{r:X,s:Bt}=M,tt=I(w),ct=f(Bt),vt=c(tt*ct),dt=c(X*ct),et=i.BASE.multiplyAndAddUnsafe(st,vt,dt)?.toAffine();return et?c(et.x)===X:!1}return{CURVE:e,getPublicKey:x,getSharedSecret:q,sign:H,verify:j,ProjectivePoint:i,Signature:a,utils:g}}function $e(n){return{hash:n,hmac:(e,...t)=>re(n,e,be(...t)),randomBytes:pe}}function We(n,e){const t=r=>De({...n,...$e(r)});return{...t(e),create:t}}const le=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),$t=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),Xe=BigInt(1),kt=BigInt(2),Wt=(n,e)=>(n+e/kt)/e;function Qe(n){const e=le,t=BigInt(3),r=BigInt(6),o=BigInt(11),s=BigInt(22),c=BigInt(23),f=BigInt(44),i=BigInt(88),u=n*n*n%e,y=u*u*n%e,h=Y(y,t,e)*y%e,l=Y(h,t,e)*y%e,m=Y(l,kt,e)*u%e,N=Y(m,o,e)*m%e,b=Y(N,s,e)*N%e,a=Y(b,f,e)*b%e,g=Y(a,i,e)*a%e,x=Y(g,f,e)*b%e,E=Y(x,t,e)*y%e,q=Y(E,c,e)*N%e,L=Y(q,r,e)*u%e,I=Y(L,kt,e);if(!Tt.eql(Tt.sqr(I),n))throw new Error("Cannot find square root");return I}const Tt=ie(le,void 0,void 0,{sqrt:Qe}),Je=We({a:BigInt(0),b:BigInt(7),Fp:Tt,n:$t,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:n=>{const e=$t,t=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-Xe*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),o=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),s=t,c=BigInt("0x100000000000000000000000000000000"),f=Wt(s*n,e),i=Wt(-r*n,e);let u=V(n-f*t-i*o,e),y=V(-f*r-i*s,e);const h=u>c,l=y>c;if(h&&(u=e-u),l&&(y=e-y),u>c||y>c)throw new Error("splitScalar: Endomorphism failed, k="+n);return{k1neg:h,k1:u,k2neg:l,k2:y}}}},Se);BigInt(0);Je.ProjectivePoint;export{Je as secp256k1};
+import{i as Xt,j as St,k as xt,l as Qt,m as de,n as he,o as P,p as ge,q as we,s as pe,u as be}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";function ye(n,e,t,r){if(typeof n.setBigUint64=="function")return n.setBigUint64(e,t,r);const o=BigInt(32),s=BigInt(4294967295),c=Number(t>>o&s),f=Number(t&s),i=r?4:0,u=r?0:4;n.setUint32(e+i,c,r),n.setUint32(e+u,f,r)}function me(n,e,t){return n&e^~n&t}function xe(n,e,t){return n&e^n&t^e&t}class Ee extends Xt{constructor(e,t,r,o){super(),this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=o,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(e),this.view=St(this.buffer)}update(e){xt(this);const{view:t,buffer:r,blockLen:o}=this;e=Qt(e);const s=e.length;for(let c=0;c<s;){const f=Math.min(o-this.pos,s-c);if(f===o){const i=St(e);for(;o<=s-c;c+=o)this.process(i,c);continue}r.set(e.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===o&&(this.process(t,0),this.pos=0)}return this.length+=e.length,this.roundClean(),this}digestInto(e){xt(this),de(e,this),this.finished=!0;const{buffer:t,view:r,blockLen:o,isLE:s}=this;let{pos:c}=this;t[c++]=128,this.buffer.subarray(c).fill(0),this.padOffset>o-c&&(this.process(r,0),c=0);for(let h=c;h<o;h++)t[h]=0;ye(r,o-8,BigInt(this.length*8),s),this.process(r,0);const f=St(e),i=this.outputLen;if(i%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const u=i/4,y=this.get();if(u>y.length)throw new Error("_sha2: outputLen bigger than state");for(let h=0;h<u;h++)f.setUint32(4*h,y[h],s)}digest(){const{buffer:e,outputLen:t}=this;this.digestInto(e);const r=e.slice(0,t);return this.destroy(),r}_cloneInto(e){e||(e=new this.constructor),e.set(...this.get());const{blockLen:t,buffer:r,length:o,finished:s,destroyed:c,pos:f}=this;return e.length=o,e.pos=f,e.finished=s,e.destroyed=c,o%t&&e.buffer.set(r),e}}const Be=new Uint32Array([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]),Q=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),J=new Uint32Array(64);class ve extends Ee{constructor(){super(64,32,8,!1),this.A=Q[0]|0,this.B=Q[1]|0,this.C=Q[2]|0,this.D=Q[3]|0,this.E=Q[4]|0,this.F=Q[5]|0,this.G=Q[6]|0,this.H=Q[7]|0}get(){const{A:e,B:t,C:r,D:o,E:s,F:c,G:f,H:i}=this;return[e,t,r,o,s,c,f,i]}set(e,t,r,o,s,c,f,i){this.A=e|0,this.B=t|0,this.C=r|0,this.D=o|0,this.E=s|0,this.F=c|0,this.G=f|0,this.H=i|0}process(e,t){for(let h=0;h<16;h++,t+=4)J[h]=e.getUint32(t,!1);for(let h=16;h<64;h++){const l=J[h-15],m=J[h-2],N=P(l,7)^P(l,18)^l>>>3,b=P(m,17)^P(m,19)^m>>>10;J[h]=b+J[h-7]+N+J[h-16]|0}let{A:r,B:o,C:s,D:c,E:f,F:i,G:u,H:y}=this;for(let h=0;h<64;h++){const l=P(f,6)^P(f,11)^P(f,25),m=y+l+me(f,i,u)+Be[h]+J[h]|0,b=(P(r,2)^P(r,13)^P(r,22))+xe(r,o,s)|0;y=u,u=i,i=f,f=c+m|0,c=s,s=o,o=r,r=m+b|0}r=r+this.A|0,o=o+this.B|0,s=s+this.C|0,c=c+this.D|0,f=f+this.E|0,i=i+this.F|0,u=u+this.G|0,y=y+this.H|0,this.set(r,o,s,c,f,i,u,y)}roundClean(){J.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Se=he(()=>new ve);const zt=BigInt(0),Jt=BigInt(1),Ae=BigInt(2);function it(n){return n instanceof Uint8Array||ArrayBuffer.isView(n)&&n.constructor.name==="Uint8Array"}function bt(n){if(!it(n))throw new Error("Uint8Array expected")}function at(n,e){if(typeof e!="boolean")throw new Error(n+" boolean expected, got "+e)}const Ie=Array.from({length:256},(n,e)=>e.toString(16).padStart(2,"0"));function ut(n){bt(n);let e="";for(let t=0;t<n.length;t++)e+=Ie[n[t]];return e}function gt(n){const e=n.toString(16);return e.length&1?"0"+e:e}function Ct(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);return n===""?zt:BigInt("0x"+n)}const D={_0:48,_9:57,A:65,F:70,a:97,f:102};function jt(n){if(n>=D._0&&n<=D._9)return n-D._0;if(n>=D.A&&n<=D.F)return n-(D.A-10);if(n>=D.a&&n<=D.f)return n-(D.a-10)}function wt(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);const e=n.length,t=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(t);for(let o=0,s=0;o<t;o++,s+=2){const c=jt(n.charCodeAt(s)),f=jt(n.charCodeAt(s+1));if(c===void 0||f===void 0){const i=n[s]+n[s+1];throw new Error('hex string expected, got non-hex character "'+i+'" at index '+s)}r[o]=c*16+f}return r}function rt(n){return Ct(ut(n))}function Zt(n){return bt(n),Ct(ut(Uint8Array.from(n).reverse()))}function lt(n,e){return wt(n.toString(16).padStart(e*2,"0"))}function Rt(n,e){return lt(n,e).reverse()}function K(n,e,t){let r;if(typeof e=="string")try{r=wt(e)}catch(s){throw new Error(n+" must be hex string or Uint8Array, cause: "+s)}else if(it(e))r=Uint8Array.from(e);else throw new Error(n+" must be hex string or Uint8Array");const o=r.length;if(typeof t=="number"&&o!==t)throw new Error(n+" of length "+t+" expected, got "+o);return r}function pt(...n){let e=0;for(let r=0;r<n.length;r++){const o=n[r];bt(o),e+=o.length}const t=new Uint8Array(e);for(let r=0,o=0;r<n.length;r++){const s=n[r];t.set(s,o),o+=s.length}return t}const At=n=>typeof n=="bigint"&&zt<=n;function Et(n,e,t){return At(n)&&At(e)&&At(t)&&e<=n&&n<t}function ot(n,e,t,r){if(!Et(e,t,r))throw new Error("expected valid "+n+": "+t+" <= n < "+r+", got "+e)}function te(n){let e;for(e=0;n>zt;n>>=Jt,e+=1);return e}const Mt=n=>(Ae<<BigInt(n-1))-Jt,It=n=>new Uint8Array(n),Yt=n=>Uint8Array.from(n);function ee(n,e,t){if(typeof n!="number"||n<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof t!="function")throw new Error("hmacFn must be a function");let r=It(n),o=It(n),s=0;const c=()=>{r.fill(1),o.fill(0),s=0},f=(...h)=>t(o,r,...h),i=(h=It())=>{o=f(Yt([0]),h),r=f(),h.length!==0&&(o=f(Yt([1]),h),r=f())},u=()=>{if(s++>=1e3)throw new Error("drbg: tried 1000 values");let h=0;const l=[];for(;h<e;){r=f();const m=r.slice();l.push(m),h+=r.length}return pt(...l)};return(h,l)=>{c(),i(h);let m;for(;!(m=l(u()));)i();return c(),m}}const Ne={bigint:n=>typeof n=="bigint",function:n=>typeof n=="function",boolean:n=>typeof n=="boolean",string:n=>typeof n=="string",stringOrUint8Array:n=>typeof n=="string"||it(n),isSafeInteger:n=>Number.isSafeInteger(n),array:n=>Array.isArray(n),field:(n,e)=>e.Fp.isValid(n),hash:n=>typeof n=="function"&&Number.isSafeInteger(n.outputLen)};function yt(n,e,t={}){const r=(o,s,c)=>{const f=Ne[s];if(typeof f!="function")throw new Error("invalid validator function");const i=n[o];if(!(c&&i===void 0)&&!f(i,n))throw new Error("param "+String(o)+" is invalid. Expected "+s+", got "+i)};for(const[o,s]of Object.entries(e))r(o,s,!1);for(const[o,s]of Object.entries(t))r(o,s,!0);return n}function Ht(n){const e=new WeakMap;return(t,...r)=>{const o=e.get(t);if(o!==void 0)return o;const s=n(t,...r);return e.set(t,s),s}}const qe=Object.freeze(Object.defineProperty({__proto__:null,aInRange:ot,abool:at,abytes:bt,bitLen:te,bitMask:Mt,bytesToHex:ut,bytesToNumberBE:rt,bytesToNumberLE:Zt,concatBytes:pt,createHmacDrbg:ee,ensureBytes:K,hexToBytes:wt,hexToNumber:Ct,inRange:Et,isBytes:it,memoized:Ht,numberToBytesBE:lt,numberToBytesLE:Rt,numberToHexUnpadded:gt,validateObject:yt},Symbol.toStringTag,{value:"Module"}));class ne extends Xt{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,ge(e);const r=Qt(t);if(this.iHash=e.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const o=this.blockLen,s=new Uint8Array(o);s.set(r.length>o?e.create().update(r).digest():r);for(let c=0;c<s.length;c++)s[c]^=54;this.iHash.update(s),this.oHash=e.create();for(let c=0;c<s.length;c++)s[c]^=106;this.oHash.update(s),s.fill(0)}update(e){return xt(this),this.iHash.update(e),this}digestInto(e){xt(this),we(e,this.outputLen),this.finished=!0,this.iHash.digestInto(e),this.oHash.update(e),this.oHash.digestInto(e),this.destroy()}digest(){const e=new Uint8Array(this.oHash.outputLen);return this.digestInto(e),e}_cloneInto(e){e||(e=Object.create(Object.getPrototypeOf(this),{}));const{oHash:t,iHash:r,finished:o,destroyed:s,blockLen:c,outputLen:f}=this;return e=e,e.finished=o,e.destroyed=s,e.blockLen=c,e.outputLen=f,e.oHash=t._cloneInto(e.oHash),e.iHash=r._cloneInto(e.iHash),e}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const re=(n,e,t)=>new ne(n,e).update(t).digest();re.create=(n,e)=>new ne(n,e);const z=BigInt(0),_=BigInt(1),nt=BigInt(2),Oe=BigInt(3),Ut=BigInt(4),Ft=BigInt(5),Kt=BigInt(8);function V(n,e){const t=n%e;return t>=z?t:e+t}function Le(n,e,t){if(e<z)throw new Error("invalid exponent, negatives unsupported");if(t<=z)throw new Error("invalid modulus");if(t===_)return z;let r=_;for(;e>z;)e&_&&(r=r*n%t),n=n*n%t,e>>=_;return r}function Y(n,e,t){let r=n;for(;e-- >z;)r*=r,r%=t;return r}function _t(n,e){if(n===z)throw new Error("invert: expected non-zero number");if(e<=z)throw new Error("invert: expected positive modulus, got "+e);let t=V(n,e),r=e,o=z,s=_;for(;t!==z;){const f=r/t,i=r%t,u=o-s*f;r=t,t=i,o=s,s=u}if(r!==_)throw new Error("invert: does not exist");return V(o,e)}function He(n){const e=(n-_)/nt;let t,r,o;for(t=n-_,r=0;t%nt===z;t/=nt,r++);for(o=nt;o<n&&Le(o,e,n)!==n-_;o++)if(o>1e3)throw new Error("Cannot find square root: likely non-prime P");if(r===1){const c=(n+_)/Ut;return function(i,u){const y=i.pow(u,c);if(!i.eql(i.sqr(y),u))throw new Error("Cannot find square root");return y}}const s=(t+_)/nt;return function(f,i){if(f.pow(i,e)===f.neg(f.ONE))throw new Error("Cannot find square root");let u=r,y=f.pow(f.mul(f.ONE,o),t),h=f.pow(i,s),l=f.pow(i,t);for(;!f.eql(l,f.ONE);){if(f.eql(l,f.ZERO))return f.ZERO;let m=1;for(let b=f.sqr(l);m<u&&!f.eql(b,f.ONE);m++)b=f.sqr(b);const N=f.pow(y,_<<BigInt(u-m-1));y=f.sqr(N),h=f.mul(h,N),l=f.mul(l,y),u=m}return h}}function Ue(n){if(n%Ut===Oe){const e=(n+_)/Ut;return function(r,o){const s=r.pow(o,e);if(!r.eql(r.sqr(s),o))throw new Error("Cannot find square root");return s}}if(n%Kt===Ft){const e=(n-Ft)/Kt;return function(r,o){const s=r.mul(o,nt),c=r.pow(s,e),f=r.mul(o,c),i=r.mul(r.mul(f,nt),c),u=r.mul(f,r.sub(i,r.ONE));if(!r.eql(r.sqr(u),o))throw new Error("Cannot find square root");return u}}return He(n)}const _e=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function ke(n){const e={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},t=_e.reduce((r,o)=>(r[o]="function",r),e);return yt(n,t)}function Te(n,e,t){if(t<z)throw new Error("invalid exponent, negatives unsupported");if(t===z)return n.ONE;if(t===_)return e;let r=n.ONE,o=e;for(;t>z;)t&_&&(r=n.mul(r,o)),o=n.sqr(o),t>>=_;return r}function ze(n,e){const t=new Array(e.length),r=e.reduce((s,c,f)=>n.is0(c)?s:(t[f]=s,n.mul(s,c)),n.ONE),o=n.inv(r);return e.reduceRight((s,c,f)=>n.is0(c)?s:(t[f]=n.mul(s,t[f]),n.mul(s,c)),o),t}function oe(n,e){const t=e!==void 0?e:n.toString(2).length,r=Math.ceil(t/8);return{nBitLength:t,nByteLength:r}}function ie(n,e,t=!1,r={}){if(n<=z)throw new Error("invalid field: expected ORDER > 0, got "+n);const{nBitLength:o,nByteLength:s}=oe(n,e);if(s>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:n,isLE:t,BITS:o,BYTES:s,MASK:Mt(o),ZERO:z,ONE:_,create:i=>V(i,n),isValid:i=>{if(typeof i!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof i);return z<=i&&i<n},is0:i=>i===z,isOdd:i=>(i&_)===_,neg:i=>V(-i,n),eql:(i,u)=>i===u,sqr:i=>V(i*i,n),add:(i,u)=>V(i+u,n),sub:(i,u)=>V(i-u,n),mul:(i,u)=>V(i*u,n),pow:(i,u)=>Te(f,i,u),div:(i,u)=>V(i*_t(u,n),n),sqrN:i=>i*i,addN:(i,u)=>i+u,subN:(i,u)=>i-u,mulN:(i,u)=>i*u,inv:i=>_t(i,n),sqrt:r.sqrt||(i=>(c||(c=Ue(n)),c(f,i))),invertBatch:i=>ze(f,i),cmov:(i,u,y)=>y?u:i,toBytes:i=>t?Rt(i,s):lt(i,s),fromBytes:i=>{if(i.length!==s)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+i.length);return t?Zt(i):rt(i)}});return Object.freeze(f)}function se(n){if(typeof n!="bigint")throw new Error("field order must be bigint");const e=n.toString(2).length;return Math.ceil(e/8)}function ce(n){const e=se(n);return e+Math.ceil(e/2)}function Ce(n,e,t=!1){const r=n.length,o=se(e),s=ce(e);if(r<16||r<s||r>1024)throw new Error("expected "+s+"-1024 bytes of input, got "+r);const c=t?Zt(n):rt(n),f=V(c,e-_)+_;return t?Rt(f,o):lt(f,o)}const Pt=BigInt(0),mt=BigInt(1);function Nt(n,e){const t=e.negate();return n?t:e}function fe(n,e){if(!Number.isSafeInteger(n)||n<=0||n>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+n)}function qt(n,e){fe(n,e);const t=Math.ceil(e/n)+1,r=2**(n-1);return{windows:t,windowSize:r}}function Ze(n,e){if(!Array.isArray(n))throw new Error("array expected");n.forEach((t,r)=>{if(!(t instanceof e))throw new Error("invalid point at index "+r)})}function Re(n,e){if(!Array.isArray(n))throw new Error("array of scalars expected");n.forEach((t,r)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+r)})}const Ot=new WeakMap,ae=new WeakMap;function Lt(n){return ae.get(n)||1}function Me(n,e){return{constTimeNegate:Nt,hasPrecomputes(t){return Lt(t)!==1},unsafeLadder(t,r,o=n.ZERO){let s=t;for(;r>Pt;)r&mt&&(o=o.add(s)),s=s.double(),r>>=mt;return o},precomputeWindow(t,r){const{windows:o,windowSize:s}=qt(r,e),c=[];let f=t,i=f;for(let u=0;u<o;u++){i=f,c.push(i);for(let y=1;y<s;y++)i=i.add(f),c.push(i);f=i.double()}return c},wNAF(t,r,o){const{windows:s,windowSize:c}=qt(t,e);let f=n.ZERO,i=n.BASE;const u=BigInt(2**t-1),y=2**t,h=BigInt(t);for(let l=0;l<s;l++){const m=l*c;let N=Number(o&u);o>>=h,N>c&&(N-=y,o+=mt);const b=m,a=m+Math.abs(N)-1,g=l%2!==0,x=N<0;N===0?i=i.add(Nt(g,r[b])):f=f.add(Nt(x,r[a]))}return{p:f,f:i}},wNAFUnsafe(t,r,o,s=n.ZERO){const{windows:c,windowSize:f}=qt(t,e),i=BigInt(2**t-1),u=2**t,y=BigInt(t);for(let h=0;h<c;h++){const l=h*f;if(o===Pt)break;let m=Number(o&i);if(o>>=y,m>f&&(m-=u,o+=mt),m===0)continue;let N=r[l+Math.abs(m)-1];m<0&&(N=N.negate()),s=s.add(N)}return s},getPrecomputes(t,r,o){let s=Ot.get(r);return s||(s=this.precomputeWindow(r,t),t!==1&&Ot.set(r,o(s))),s},wNAFCached(t,r,o){const s=Lt(t);return this.wNAF(s,this.getPrecomputes(s,t,o),r)},wNAFCachedUnsafe(t,r,o,s){const c=Lt(t);return c===1?this.unsafeLadder(t,r,s):this.wNAFUnsafe(c,this.getPrecomputes(c,t,o),r,s)},setWindowSize(t,r){fe(r,e),ae.set(t,r),Ot.delete(t)}}}function Ve(n,e,t,r){if(Ze(t,n),Re(r,e),t.length!==r.length)throw new Error("arrays of points and scalars must have equal length");const o=n.ZERO,s=te(BigInt(t.length)),c=s>12?s-3:s>4?s-2:s?2:1,f=(1<<c)-1,i=new Array(f+1).fill(o),u=Math.floor((e.BITS-1)/c)*c;let y=o;for(let h=u;h>=0;h-=c){i.fill(o);for(let m=0;m<r.length;m++){const N=r[m],b=Number(N>>BigInt(h)&BigInt(f));i[b]=i[b].add(t[m])}let l=o;for(let m=i.length-1,N=o;m>0;m--)N=N.add(i[m]),l=l.add(N);if(y=y.add(l),h!==0)for(let m=0;m<c;m++)y=y.double()}return y}function ue(n){return ke(n.Fp),yt(n,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...oe(n.n,n.nBitLength),...n,p:n.Fp.ORDER})}function Gt(n){n.lowS!==void 0&&at("lowS",n.lowS),n.prehash!==void 0&&at("prehash",n.prehash)}function je(n){const e=ue(n);yt(e,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:r,a:o}=e;if(t){if(!r.eql(o,r.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...e})}const{bytesToNumberBE:Ye,hexToBytes:Fe}=qe;class Ke extends Error{constructor(e=""){super(e)}}const $={Err:Ke,_tlv:{encode:(n,e)=>{const{Err:t}=$;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length&1)throw new t("tlv.encode: unpadded data");const r=e.length/2,o=gt(r);if(o.length/2&128)throw new t("tlv.encode: long form length too big");const s=r>127?gt(o.length/2|128):"";return gt(n)+s+o+e},decode(n,e){const{Err:t}=$;let r=0;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length<2||e[r++]!==n)throw new t("tlv.decode: wrong tlv");const o=e[r++],s=!!(o&128);let c=0;if(!s)c=o;else{const i=o&127;if(!i)throw new t("tlv.decode(long): indefinite length not supported");if(i>4)throw new t("tlv.decode(long): byte length is too big");const u=e.subarray(r,r+i);if(u.length!==i)throw new t("tlv.decode: length bytes not complete");if(u[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const y of u)c=c<<8|y;if(r+=i,c<128)throw new t("tlv.decode(long): not minimal encoding")}const f=e.subarray(r,r+c);if(f.length!==c)throw new t("tlv.decode: wrong value length");return{v:f,l:e.subarray(r+c)}}},_int:{encode(n){const{Err:e}=$;if(n<W)throw new e("integer: negative integers are not allowed");let t=gt(n);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new e("unexpected DER parsing assertion: unpadded hex");return t},decode(n){const{Err:e}=$;if(n[0]&128)throw new e("invalid signature integer: negative");if(n[0]===0&&!(n[1]&128))throw new e("invalid signature integer: unnecessary leading zero");return Ye(n)}},toSig(n){const{Err:e,_int:t,_tlv:r}=$,o=typeof n=="string"?Fe(n):n;bt(o);const{v:s,l:c}=r.decode(48,o);if(c.length)throw new e("invalid signature: left bytes after parsing");const{v:f,l:i}=r.decode(2,s),{v:u,l:y}=r.decode(2,i);if(y.length)throw new e("invalid signature: left bytes after parsing");return{r:t.decode(f),s:t.decode(u)}},hexFromSig(n){const{_tlv:e,_int:t}=$,r=e.encode(2,t.encode(n.r)),o=e.encode(2,t.encode(n.s)),s=r+o;return e.encode(48,s)}},W=BigInt(0),T=BigInt(1);BigInt(2);const Dt=BigInt(3);BigInt(4);function Pe(n){const e=je(n),{Fp:t}=e,r=ie(e.n,e.nBitLength),o=e.toBytes||((b,a,g)=>{const x=a.toAffine();return pt(Uint8Array.from([4]),t.toBytes(x.x),t.toBytes(x.y))}),s=e.fromBytes||(b=>{const a=b.subarray(1),g=t.fromBytes(a.subarray(0,t.BYTES)),x=t.fromBytes(a.subarray(t.BYTES,2*t.BYTES));return{x:g,y:x}});function c(b){const{a,b:g}=e,x=t.sqr(b),E=t.mul(x,b);return t.add(t.add(E,t.mul(b,a)),g)}if(!t.eql(t.sqr(e.Gy),c(e.Gx)))throw new Error("bad generator point: equation left != right");function f(b){return Et(b,T,e.n)}function i(b){const{allowedPrivateKeyLengths:a,nByteLength:g,wrapPrivateKey:x,n:E}=e;if(a&&typeof b!="bigint"){if(it(b)&&(b=ut(b)),typeof b!="string"||!a.includes(b.length))throw new Error("invalid private key");b=b.padStart(g*2,"0")}let q;try{q=typeof b=="bigint"?b:rt(K("private key",b,g))}catch{throw new Error("invalid private key, expected hex or "+g+" bytes, got "+typeof b)}return x&&(q=V(q,E)),ot("private key",q,T,E),q}function u(b){if(!(b instanceof l))throw new Error("ProjectivePoint expected")}const y=Ht((b,a)=>{const{px:g,py:x,pz:E}=b;if(t.eql(E,t.ONE))return{x:g,y:x};const q=b.is0();a==null&&(a=q?t.ONE:t.inv(E));const L=t.mul(g,a),I=t.mul(x,a),B=t.mul(E,a);if(q)return{x:t.ZERO,y:t.ZERO};if(!t.eql(B,t.ONE))throw new Error("invZ was invalid");return{x:L,y:I}}),h=Ht(b=>{if(b.is0()){if(e.allowInfinityPoint&&!t.is0(b.py))return;throw new Error("bad point: ZERO")}const{x:a,y:g}=b.toAffine();if(!t.isValid(a)||!t.isValid(g))throw new Error("bad point: x or y not FE");const x=t.sqr(g),E=c(a);if(!t.eql(x,E))throw new Error("bad point: equation left != right");if(!b.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class l{constructor(a,g,x){if(this.px=a,this.py=g,this.pz=x,a==null||!t.isValid(a))throw new Error("x required");if(g==null||!t.isValid(g))throw new Error("y required");if(x==null||!t.isValid(x))throw new Error("z required");Object.freeze(this)}static fromAffine(a){const{x:g,y:x}=a||{};if(!a||!t.isValid(g)||!t.isValid(x))throw new Error("invalid affine point");if(a instanceof l)throw new Error("projective point not allowed");const E=q=>t.eql(q,t.ZERO);return E(g)&&E(x)?l.ZERO:new l(g,x,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(a){const g=t.invertBatch(a.map(x=>x.pz));return a.map((x,E)=>x.toAffine(g[E])).map(l.fromAffine)}static fromHex(a){const g=l.fromAffine(s(K("pointHex",a)));return g.assertValidity(),g}static fromPrivateKey(a){return l.BASE.multiply(i(a))}static msm(a,g){return Ve(l,r,a,g)}_setWindowSize(a){N.setWindowSize(this,a)}assertValidity(){h(this)}hasEvenY(){const{y:a}=this.toAffine();if(t.isOdd)return!t.isOdd(a);throw new Error("Field doesn't support isOdd")}equals(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a,B=t.eql(t.mul(g,I),t.mul(q,E)),A=t.eql(t.mul(x,I),t.mul(L,E));return B&&A}negate(){return new l(this.px,t.neg(this.py),this.pz)}double(){const{a,b:g}=e,x=t.mul(g,Dt),{px:E,py:q,pz:L}=this;let I=t.ZERO,B=t.ZERO,A=t.ZERO,v=t.mul(E,E),C=t.mul(q,q),U=t.mul(L,L),H=t.mul(E,q);return H=t.add(H,H),A=t.mul(E,L),A=t.add(A,A),I=t.mul(a,A),B=t.mul(x,U),B=t.add(I,B),I=t.sub(C,B),B=t.add(C,B),B=t.mul(I,B),I=t.mul(H,I),A=t.mul(x,A),U=t.mul(a,U),H=t.sub(v,U),H=t.mul(a,H),H=t.add(H,A),A=t.add(v,v),v=t.add(A,v),v=t.add(v,U),v=t.mul(v,H),B=t.add(B,v),U=t.mul(q,L),U=t.add(U,U),v=t.mul(U,H),I=t.sub(I,v),A=t.mul(U,C),A=t.add(A,A),A=t.add(A,A),new l(I,B,A)}add(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a;let B=t.ZERO,A=t.ZERO,v=t.ZERO;const C=e.a,U=t.mul(e.b,Dt);let H=t.mul(g,q),j=t.mul(x,L),d=t.mul(E,I),w=t.add(g,x),p=t.add(q,L);w=t.mul(w,p),p=t.add(H,j),w=t.sub(w,p),p=t.add(g,E);let S=t.add(q,I);return p=t.mul(p,S),S=t.add(H,d),p=t.sub(p,S),S=t.add(x,E),B=t.add(L,I),S=t.mul(S,B),B=t.add(j,d),S=t.sub(S,B),v=t.mul(C,p),B=t.mul(U,d),v=t.add(B,v),B=t.sub(j,v),v=t.add(j,v),A=t.mul(B,v),j=t.add(H,H),j=t.add(j,H),d=t.mul(C,d),p=t.mul(U,p),j=t.add(j,d),d=t.sub(H,d),d=t.mul(C,d),p=t.add(p,d),H=t.mul(j,p),A=t.add(A,H),H=t.mul(S,p),B=t.mul(w,B),B=t.sub(B,H),H=t.mul(w,j),v=t.mul(S,v),v=t.add(v,H),new l(B,A,v)}subtract(a){return this.add(a.negate())}is0(){return this.equals(l.ZERO)}wNAF(a){return N.wNAFCached(this,a,l.normalizeZ)}multiplyUnsafe(a){const{endo:g,n:x}=e;ot("scalar",a,W,x);const E=l.ZERO;if(a===W)return E;if(this.is0()||a===T)return this;if(!g||N.hasPrecomputes(this))return N.wNAFCachedUnsafe(this,a,l.normalizeZ);let{k1neg:q,k1:L,k2neg:I,k2:B}=g.splitScalar(a),A=E,v=E,C=this;for(;L>W||B>W;)L&T&&(A=A.add(C)),B&T&&(v=v.add(C)),C=C.double(),L>>=T,B>>=T;return q&&(A=A.negate()),I&&(v=v.negate()),v=new l(t.mul(v.px,g.beta),v.py,v.pz),A.add(v)}multiply(a){const{endo:g,n:x}=e;ot("scalar",a,T,x);let E,q;if(g){const{k1neg:L,k1:I,k2neg:B,k2:A}=g.splitScalar(a);let{p:v,f:C}=this.wNAF(I),{p:U,f:H}=this.wNAF(A);v=N.constTimeNegate(L,v),U=N.constTimeNegate(B,U),U=new l(t.mul(U.px,g.beta),U.py,U.pz),E=v.add(U),q=C.add(H)}else{const{p:L,f:I}=this.wNAF(a);E=L,q=I}return l.normalizeZ([E,q])[0]}multiplyAndAddUnsafe(a,g,x){const E=l.BASE,q=(I,B)=>B===W||B===T||!I.equals(E)?I.multiplyUnsafe(B):I.multiply(B),L=q(this,g).add(q(a,x));return L.is0()?void 0:L}toAffine(a){return y(this,a)}isTorsionFree(){const{h:a,isTorsionFree:g}=e;if(a===T)return!0;if(g)return g(l,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:a,clearCofactor:g}=e;return a===T?this:g?g(l,this):this.multiplyUnsafe(e.h)}toRawBytes(a=!0){return at("isCompressed",a),this.assertValidity(),o(l,this,a)}toHex(a=!0){return at("isCompressed",a),ut(this.toRawBytes(a))}}l.BASE=new l(e.Gx,e.Gy,t.ONE),l.ZERO=new l(t.ZERO,t.ONE,t.ZERO);const m=e.nBitLength,N=Me(l,e.endo?Math.ceil(m/2):m);return{CURVE:e,ProjectivePoint:l,normPrivateKeyToScalar:i,weierstrassEquation:c,isWithinCurveOrder:f}}function Ge(n){const e=ue(n);return yt(e,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...e})}function De(n){const e=Ge(n),{Fp:t,n:r}=e,o=t.BYTES+1,s=2*t.BYTES+1;function c(d){return V(d,r)}function f(d){return _t(d,r)}const{ProjectivePoint:i,normPrivateKeyToScalar:u,weierstrassEquation:y,isWithinCurveOrder:h}=Pe({...e,toBytes(d,w,p){const S=w.toAffine(),O=t.toBytes(S.x),k=pt;return at("isCompressed",p),p?k(Uint8Array.from([w.hasEvenY()?2:3]),O):k(Uint8Array.from([4]),O,t.toBytes(S.y))},fromBytes(d){const w=d.length,p=d[0],S=d.subarray(1);if(w===o&&(p===2||p===3)){const O=rt(S);if(!Et(O,T,t.ORDER))throw new Error("Point is not on curve");const k=y(O);let R;try{R=t.sqrt(k)}catch(F){const M=F instanceof Error?": "+F.message:"";throw new Error("Point is not on curve"+M)}const Z=(R&T)===T;return(p&1)===1!==Z&&(R=t.neg(R)),{x:O,y:R}}else if(w===s&&p===4){const O=t.fromBytes(S.subarray(0,t.BYTES)),k=t.fromBytes(S.subarray(t.BYTES,2*t.BYTES));return{x:O,y:k}}else{const O=o,k=s;throw new Error("invalid Point, expected length of "+O+", or uncompressed "+k+", got "+w)}}}),l=d=>ut(lt(d,e.nByteLength));function m(d){const w=r>>T;return d>w}function N(d){return m(d)?c(-d):d}const b=(d,w,p)=>rt(d.slice(w,p));class a{constructor(w,p,S){this.r=w,this.s=p,this.recovery=S,this.assertValidity()}static fromCompact(w){const p=e.nByteLength;return w=K("compactSignature",w,p*2),new a(b(w,0,p),b(w,p,2*p))}static fromDER(w){const{r:p,s:S}=$.toSig(K("DER",w));return new a(p,S)}assertValidity(){ot("r",this.r,T,r),ot("s",this.s,T,r)}addRecoveryBit(w){return new a(this.r,this.s,w)}recoverPublicKey(w){const{r:p,s:S,recovery:O}=this,k=I(K("msgHash",w));if(O==null||![0,1,2,3].includes(O))throw new Error("recovery id invalid");const R=O===2||O===3?p+e.n:p;if(R>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=(O&1)===0?"02":"03",G=i.fromHex(Z+l(R)),F=f(R),M=c(-k*F),st=c(S*F),X=i.BASE.multiplyAndAddUnsafe(G,M,st);if(!X)throw new Error("point at infinify");return X.assertValidity(),X}hasHighS(){return m(this.s)}normalizeS(){return this.hasHighS()?new a(this.r,c(-this.s),this.recovery):this}toDERRawBytes(){return wt(this.toDERHex())}toDERHex(){return $.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return wt(this.toCompactHex())}toCompactHex(){return l(this.r)+l(this.s)}}const g={isValidPrivateKey(d){try{return u(d),!0}catch{return!1}},normPrivateKeyToScalar:u,randomPrivateKey:()=>{const d=ce(e.n);return Ce(e.randomBytes(d),e.n)},precompute(d=8,w=i.BASE){return w._setWindowSize(d),w.multiply(BigInt(3)),w}};function x(d,w=!0){return i.fromPrivateKey(d).toRawBytes(w)}function E(d){const w=it(d),p=typeof d=="string",S=(w||p)&&d.length;return w?S===o||S===s:p?S===2*o||S===2*s:d instanceof i}function q(d,w,p=!0){if(E(d))throw new Error("first arg must be private key");if(!E(w))throw new Error("second arg must be public key");return i.fromHex(w).multiply(u(d)).toRawBytes(p)}const L=e.bits2int||function(d){if(d.length>8192)throw new Error("input is too large");const w=rt(d),p=d.length*8-e.nBitLength;return p>0?w>>BigInt(p):w},I=e.bits2int_modN||function(d){return c(L(d))},B=Mt(e.nBitLength);function A(d){return ot("num < 2^"+e.nBitLength,d,W,B),lt(d,e.nByteLength)}function v(d,w,p=C){if(["recovered","canonical"].some(tt=>tt in p))throw new Error("sign() legacy options not supported");const{hash:S,randomBytes:O}=e;let{lowS:k,prehash:R,extraEntropy:Z}=p;k==null&&(k=!0),d=K("msgHash",d),Gt(p),R&&(d=K("prehashed msgHash",S(d)));const G=I(d),F=u(w),M=[A(F),A(G)];if(Z!=null&&Z!==!1){const tt=Z===!0?O(t.BYTES):Z;M.push(K("extraEntropy",tt))}const st=pt(...M),X=G;function Bt(tt){const ct=L(tt);if(!h(ct))return;const vt=f(ct),dt=i.BASE.multiply(ct).toAffine(),et=c(dt.x);if(et===W)return;const ht=c(vt*c(X+et*F));if(ht===W)return;let ft=(dt.x===et?0:2)|Number(dt.y&T),Vt=ht;return k&&m(ht)&&(Vt=N(ht),ft^=1),new a(et,Vt,ft)}return{seed:st,k2sig:Bt}}const C={lowS:e.lowS,prehash:!1},U={lowS:e.lowS,prehash:!1};function H(d,w,p=C){const{seed:S,k2sig:O}=v(d,w,p),k=e;return ee(k.hash.outputLen,k.nByteLength,k.hmac)(S,O)}i.BASE._setWindowSize(8);function j(d,w,p,S=U){const O=d;w=K("msgHash",w),p=K("publicKey",p);const{lowS:k,prehash:R,format:Z}=S;if(Gt(S),"strict"in S)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const G=typeof O=="string"||it(O),F=!G&&!Z&&typeof O=="object"&&O!==null&&typeof O.r=="bigint"&&typeof O.s=="bigint";if(!G&&!F)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let M,st;try{if(F&&(M=new a(O.r,O.s)),G){try{Z!=="compact"&&(M=a.fromDER(O))}catch(ft){if(!(ft instanceof $.Err))throw ft}!M&&Z!=="der"&&(M=a.fromCompact(O))}st=i.fromHex(p)}catch{return!1}if(!M||k&&M.hasHighS())return!1;R&&(w=e.hash(w));const{r:X,s:Bt}=M,tt=I(w),ct=f(Bt),vt=c(tt*ct),dt=c(X*ct),et=i.BASE.multiplyAndAddUnsafe(st,vt,dt)?.toAffine();return et?c(et.x)===X:!1}return{CURVE:e,getPublicKey:x,getSharedSecret:q,sign:H,verify:j,ProjectivePoint:i,Signature:a,utils:g}}function $e(n){return{hash:n,hmac:(e,...t)=>re(n,e,be(...t)),randomBytes:pe}}function We(n,e){const t=r=>De({...n,...$e(r)});return{...t(e),create:t}}const le=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),$t=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),Xe=BigInt(1),kt=BigInt(2),Wt=(n,e)=>(n+e/kt)/e;function Qe(n){const e=le,t=BigInt(3),r=BigInt(6),o=BigInt(11),s=BigInt(22),c=BigInt(23),f=BigInt(44),i=BigInt(88),u=n*n*n%e,y=u*u*n%e,h=Y(y,t,e)*y%e,l=Y(h,t,e)*y%e,m=Y(l,kt,e)*u%e,N=Y(m,o,e)*m%e,b=Y(N,s,e)*N%e,a=Y(b,f,e)*b%e,g=Y(a,i,e)*a%e,x=Y(g,f,e)*b%e,E=Y(x,t,e)*y%e,q=Y(E,c,e)*N%e,L=Y(q,r,e)*u%e,I=Y(L,kt,e);if(!Tt.eql(Tt.sqr(I),n))throw new Error("Cannot find square root");return I}const Tt=ie(le,void 0,void 0,{sqrt:Qe}),Je=We({a:BigInt(0),b:BigInt(7),Fp:Tt,n:$t,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:n=>{const e=$t,t=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-Xe*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),o=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),s=t,c=BigInt("0x100000000000000000000000000000000"),f=Wt(s*n,e),i=Wt(-r*n,e);let u=V(n-f*t-i*o,e),y=V(-f*r-i*s,e);const h=u>c,l=y>c;if(h&&(u=e-u),l&&(y=e-y),u>c||y>c)throw new Error("splitScalar: Endomorphism failed, k="+n);return{k1neg:h,k1:u,k2neg:l,k2:y}}}},Se);BigInt(0);Je.ProjectivePoint;export{Je as secp256k1};

package/dist/assets/{secp256k1-DWX6S8jP.js → secp256k1-DO_c0HE4.js}

@@ -1 +1 @@
-import{H as Xt,c as St,a as xt,t as Qt,b as de,d as he,r as P,e as ge,f as we,g as pe,h as be}from"./index-D-OGc8dc.js";import"./index.browser.esm-eaQFIm0M.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-Bk-O7L34.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";function ye(n,e,t,r){if(typeof n.setBigUint64=="function")return n.setBigUint64(e,t,r);const o=BigInt(32),s=BigInt(4294967295),c=Number(t>>o&s),f=Number(t&s),i=r?4:0,u=r?0:4;n.setUint32(e+i,c,r),n.setUint32(e+u,f,r)}function me(n,e,t){return n&e^~n&t}function xe(n,e,t){return n&e^n&t^e&t}class Ee extends Xt{constructor(e,t,r,o){super(),this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=o,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(e),this.view=St(this.buffer)}update(e){xt(this);const{view:t,buffer:r,blockLen:o}=this;e=Qt(e);const s=e.length;for(let c=0;c<s;){const f=Math.min(o-this.pos,s-c);if(f===o){const i=St(e);for(;o<=s-c;c+=o)this.process(i,c);continue}r.set(e.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===o&&(this.process(t,0),this.pos=0)}return this.length+=e.length,this.roundClean(),this}digestInto(e){xt(this),de(e,this),this.finished=!0;const{buffer:t,view:r,blockLen:o,isLE:s}=this;let{pos:c}=this;t[c++]=128,this.buffer.subarray(c).fill(0),this.padOffset>o-c&&(this.process(r,0),c=0);for(let h=c;h<o;h++)t[h]=0;ye(r,o-8,BigInt(this.length*8),s),this.process(r,0);const f=St(e),i=this.outputLen;if(i%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const u=i/4,y=this.get();if(u>y.length)throw new Error("_sha2: outputLen bigger than state");for(let h=0;h<u;h++)f.setUint32(4*h,y[h],s)}digest(){const{buffer:e,outputLen:t}=this;this.digestInto(e);const r=e.slice(0,t);return this.destroy(),r}_cloneInto(e){e||(e=new this.constructor),e.set(...this.get());const{blockLen:t,buffer:r,length:o,finished:s,destroyed:c,pos:f}=this;return e.length=o,e.pos=f,e.finished=s,e.destroyed=c,o%t&&e.buffer.set(r),e}}const Be=new Uint32Array([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]),Q=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),J=new Uint32Array(64);class ve extends Ee{constructor(){super(64,32,8,!1),this.A=Q[0]|0,this.B=Q[1]|0,this.C=Q[2]|0,this.D=Q[3]|0,this.E=Q[4]|0,this.F=Q[5]|0,this.G=Q[6]|0,this.H=Q[7]|0}get(){const{A:e,B:t,C:r,D:o,E:s,F:c,G:f,H:i}=this;return[e,t,r,o,s,c,f,i]}set(e,t,r,o,s,c,f,i){this.A=e|0,this.B=t|0,this.C=r|0,this.D=o|0,this.E=s|0,this.F=c|0,this.G=f|0,this.H=i|0}process(e,t){for(let h=0;h<16;h++,t+=4)J[h]=e.getUint32(t,!1);for(let h=16;h<64;h++){const l=J[h-15],m=J[h-2],N=P(l,7)^P(l,18)^l>>>3,b=P(m,17)^P(m,19)^m>>>10;J[h]=b+J[h-7]+N+J[h-16]|0}let{A:r,B:o,C:s,D:c,E:f,F:i,G:u,H:y}=this;for(let h=0;h<64;h++){const l=P(f,6)^P(f,11)^P(f,25),m=y+l+me(f,i,u)+Be[h]+J[h]|0,b=(P(r,2)^P(r,13)^P(r,22))+xe(r,o,s)|0;y=u,u=i,i=f,f=c+m|0,c=s,s=o,o=r,r=m+b|0}r=r+this.A|0,o=o+this.B|0,s=s+this.C|0,c=c+this.D|0,f=f+this.E|0,i=i+this.F|0,u=u+this.G|0,y=y+this.H|0,this.set(r,o,s,c,f,i,u,y)}roundClean(){J.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Se=he(()=>new ve);const zt=BigInt(0),Jt=BigInt(1),Ae=BigInt(2);function it(n){return n instanceof Uint8Array||ArrayBuffer.isView(n)&&n.constructor.name==="Uint8Array"}function bt(n){if(!it(n))throw new Error("Uint8Array expected")}function at(n,e){if(typeof e!="boolean")throw new Error(n+" boolean expected, got "+e)}const Ie=Array.from({length:256},(n,e)=>e.toString(16).padStart(2,"0"));function ut(n){bt(n);let e="";for(let t=0;t<n.length;t++)e+=Ie[n[t]];return e}function gt(n){const e=n.toString(16);return e.length&1?"0"+e:e}function Ct(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);return n===""?zt:BigInt("0x"+n)}const D={_0:48,_9:57,A:65,F:70,a:97,f:102};function jt(n){if(n>=D._0&&n<=D._9)return n-D._0;if(n>=D.A&&n<=D.F)return n-(D.A-10);if(n>=D.a&&n<=D.f)return n-(D.a-10)}function wt(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);const e=n.length,t=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(t);for(let o=0,s=0;o<t;o++,s+=2){const c=jt(n.charCodeAt(s)),f=jt(n.charCodeAt(s+1));if(c===void 0||f===void 0){const i=n[s]+n[s+1];throw new Error('hex string expected, got non-hex character "'+i+'" at index '+s)}r[o]=c*16+f}return r}function rt(n){return Ct(ut(n))}function Zt(n){return bt(n),Ct(ut(Uint8Array.from(n).reverse()))}function lt(n,e){return wt(n.toString(16).padStart(e*2,"0"))}function Rt(n,e){return lt(n,e).reverse()}function K(n,e,t){let r;if(typeof e=="string")try{r=wt(e)}catch(s){throw new Error(n+" must be hex string or Uint8Array, cause: "+s)}else if(it(e))r=Uint8Array.from(e);else throw new Error(n+" must be hex string or Uint8Array");const o=r.length;if(typeof t=="number"&&o!==t)throw new Error(n+" of length "+t+" expected, got "+o);return r}function pt(...n){let e=0;for(let r=0;r<n.length;r++){const o=n[r];bt(o),e+=o.length}const t=new Uint8Array(e);for(let r=0,o=0;r<n.length;r++){const s=n[r];t.set(s,o),o+=s.length}return t}const At=n=>typeof n=="bigint"&&zt<=n;function Et(n,e,t){return At(n)&&At(e)&&At(t)&&e<=n&&n<t}function ot(n,e,t,r){if(!Et(e,t,r))throw new Error("expected valid "+n+": "+t+" <= n < "+r+", got "+e)}function te(n){let e;for(e=0;n>zt;n>>=Jt,e+=1);return e}const Mt=n=>(Ae<<BigInt(n-1))-Jt,It=n=>new Uint8Array(n),Yt=n=>Uint8Array.from(n);function ee(n,e,t){if(typeof n!="number"||n<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof t!="function")throw new Error("hmacFn must be a function");let r=It(n),o=It(n),s=0;const c=()=>{r.fill(1),o.fill(0),s=0},f=(...h)=>t(o,r,...h),i=(h=It())=>{o=f(Yt([0]),h),r=f(),h.length!==0&&(o=f(Yt([1]),h),r=f())},u=()=>{if(s++>=1e3)throw new Error("drbg: tried 1000 values");let h=0;const l=[];for(;h<e;){r=f();const m=r.slice();l.push(m),h+=r.length}return pt(...l)};return(h,l)=>{c(),i(h);let m;for(;!(m=l(u()));)i();return c(),m}}const Ne={bigint:n=>typeof n=="bigint",function:n=>typeof n=="function",boolean:n=>typeof n=="boolean",string:n=>typeof n=="string",stringOrUint8Array:n=>typeof n=="string"||it(n),isSafeInteger:n=>Number.isSafeInteger(n),array:n=>Array.isArray(n),field:(n,e)=>e.Fp.isValid(n),hash:n=>typeof n=="function"&&Number.isSafeInteger(n.outputLen)};function yt(n,e,t={}){const r=(o,s,c)=>{const f=Ne[s];if(typeof f!="function")throw new Error("invalid validator function");const i=n[o];if(!(c&&i===void 0)&&!f(i,n))throw new Error("param "+String(o)+" is invalid. Expected "+s+", got "+i)};for(const[o,s]of Object.entries(e))r(o,s,!1);for(const[o,s]of Object.entries(t))r(o,s,!0);return n}function Ht(n){const e=new WeakMap;return(t,...r)=>{const o=e.get(t);if(o!==void 0)return o;const s=n(t,...r);return e.set(t,s),s}}const qe=Object.freeze(Object.defineProperty({__proto__:null,aInRange:ot,abool:at,abytes:bt,bitLen:te,bitMask:Mt,bytesToHex:ut,bytesToNumberBE:rt,bytesToNumberLE:Zt,concatBytes:pt,createHmacDrbg:ee,ensureBytes:K,hexToBytes:wt,hexToNumber:Ct,inRange:Et,isBytes:it,memoized:Ht,numberToBytesBE:lt,numberToBytesLE:Rt,numberToHexUnpadded:gt,validateObject:yt},Symbol.toStringTag,{value:"Module"}));class ne extends Xt{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,ge(e);const r=Qt(t);if(this.iHash=e.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const o=this.blockLen,s=new Uint8Array(o);s.set(r.length>o?e.create().update(r).digest():r);for(let c=0;c<s.length;c++)s[c]^=54;this.iHash.update(s),this.oHash=e.create();for(let c=0;c<s.length;c++)s[c]^=106;this.oHash.update(s),s.fill(0)}update(e){return xt(this),this.iHash.update(e),this}digestInto(e){xt(this),we(e,this.outputLen),this.finished=!0,this.iHash.digestInto(e),this.oHash.update(e),this.oHash.digestInto(e),this.destroy()}digest(){const e=new Uint8Array(this.oHash.outputLen);return this.digestInto(e),e}_cloneInto(e){e||(e=Object.create(Object.getPrototypeOf(this),{}));const{oHash:t,iHash:r,finished:o,destroyed:s,blockLen:c,outputLen:f}=this;return e=e,e.finished=o,e.destroyed=s,e.blockLen=c,e.outputLen=f,e.oHash=t._cloneInto(e.oHash),e.iHash=r._cloneInto(e.iHash),e}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const re=(n,e,t)=>new ne(n,e).update(t).digest();re.create=(n,e)=>new ne(n,e);const z=BigInt(0),_=BigInt(1),nt=BigInt(2),Oe=BigInt(3),Ut=BigInt(4),Ft=BigInt(5),Kt=BigInt(8);function V(n,e){const t=n%e;return t>=z?t:e+t}function Le(n,e,t){if(e<z)throw new Error("invalid exponent, negatives unsupported");if(t<=z)throw new Error("invalid modulus");if(t===_)return z;let r=_;for(;e>z;)e&_&&(r=r*n%t),n=n*n%t,e>>=_;return r}function Y(n,e,t){let r=n;for(;e-- >z;)r*=r,r%=t;return r}function _t(n,e){if(n===z)throw new Error("invert: expected non-zero number");if(e<=z)throw new Error("invert: expected positive modulus, got "+e);let t=V(n,e),r=e,o=z,s=_;for(;t!==z;){const f=r/t,i=r%t,u=o-s*f;r=t,t=i,o=s,s=u}if(r!==_)throw new Error("invert: does not exist");return V(o,e)}function He(n){const e=(n-_)/nt;let t,r,o;for(t=n-_,r=0;t%nt===z;t/=nt,r++);for(o=nt;o<n&&Le(o,e,n)!==n-_;o++)if(o>1e3)throw new Error("Cannot find square root: likely non-prime P");if(r===1){const c=(n+_)/Ut;return function(i,u){const y=i.pow(u,c);if(!i.eql(i.sqr(y),u))throw new Error("Cannot find square root");return y}}const s=(t+_)/nt;return function(f,i){if(f.pow(i,e)===f.neg(f.ONE))throw new Error("Cannot find square root");let u=r,y=f.pow(f.mul(f.ONE,o),t),h=f.pow(i,s),l=f.pow(i,t);for(;!f.eql(l,f.ONE);){if(f.eql(l,f.ZERO))return f.ZERO;let m=1;for(let b=f.sqr(l);m<u&&!f.eql(b,f.ONE);m++)b=f.sqr(b);const N=f.pow(y,_<<BigInt(u-m-1));y=f.sqr(N),h=f.mul(h,N),l=f.mul(l,y),u=m}return h}}function Ue(n){if(n%Ut===Oe){const e=(n+_)/Ut;return function(r,o){const s=r.pow(o,e);if(!r.eql(r.sqr(s),o))throw new Error("Cannot find square root");return s}}if(n%Kt===Ft){const e=(n-Ft)/Kt;return function(r,o){const s=r.mul(o,nt),c=r.pow(s,e),f=r.mul(o,c),i=r.mul(r.mul(f,nt),c),u=r.mul(f,r.sub(i,r.ONE));if(!r.eql(r.sqr(u),o))throw new Error("Cannot find square root");return u}}return He(n)}const _e=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Te(n){const e={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},t=_e.reduce((r,o)=>(r[o]="function",r),e);return yt(n,t)}function ke(n,e,t){if(t<z)throw new Error("invalid exponent, negatives unsupported");if(t===z)return n.ONE;if(t===_)return e;let r=n.ONE,o=e;for(;t>z;)t&_&&(r=n.mul(r,o)),o=n.sqr(o),t>>=_;return r}function ze(n,e){const t=new Array(e.length),r=e.reduce((s,c,f)=>n.is0(c)?s:(t[f]=s,n.mul(s,c)),n.ONE),o=n.inv(r);return e.reduceRight((s,c,f)=>n.is0(c)?s:(t[f]=n.mul(s,t[f]),n.mul(s,c)),o),t}function oe(n,e){const t=e!==void 0?e:n.toString(2).length,r=Math.ceil(t/8);return{nBitLength:t,nByteLength:r}}function ie(n,e,t=!1,r={}){if(n<=z)throw new Error("invalid field: expected ORDER > 0, got "+n);const{nBitLength:o,nByteLength:s}=oe(n,e);if(s>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:n,isLE:t,BITS:o,BYTES:s,MASK:Mt(o),ZERO:z,ONE:_,create:i=>V(i,n),isValid:i=>{if(typeof i!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof i);return z<=i&&i<n},is0:i=>i===z,isOdd:i=>(i&_)===_,neg:i=>V(-i,n),eql:(i,u)=>i===u,sqr:i=>V(i*i,n),add:(i,u)=>V(i+u,n),sub:(i,u)=>V(i-u,n),mul:(i,u)=>V(i*u,n),pow:(i,u)=>ke(f,i,u),div:(i,u)=>V(i*_t(u,n),n),sqrN:i=>i*i,addN:(i,u)=>i+u,subN:(i,u)=>i-u,mulN:(i,u)=>i*u,inv:i=>_t(i,n),sqrt:r.sqrt||(i=>(c||(c=Ue(n)),c(f,i))),invertBatch:i=>ze(f,i),cmov:(i,u,y)=>y?u:i,toBytes:i=>t?Rt(i,s):lt(i,s),fromBytes:i=>{if(i.length!==s)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+i.length);return t?Zt(i):rt(i)}});return Object.freeze(f)}function se(n){if(typeof n!="bigint")throw new Error("field order must be bigint");const e=n.toString(2).length;return Math.ceil(e/8)}function ce(n){const e=se(n);return e+Math.ceil(e/2)}function Ce(n,e,t=!1){const r=n.length,o=se(e),s=ce(e);if(r<16||r<s||r>1024)throw new Error("expected "+s+"-1024 bytes of input, got "+r);const c=t?Zt(n):rt(n),f=V(c,e-_)+_;return t?Rt(f,o):lt(f,o)}const Pt=BigInt(0),mt=BigInt(1);function Nt(n,e){const t=e.negate();return n?t:e}function fe(n,e){if(!Number.isSafeInteger(n)||n<=0||n>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+n)}function qt(n,e){fe(n,e);const t=Math.ceil(e/n)+1,r=2**(n-1);return{windows:t,windowSize:r}}function Ze(n,e){if(!Array.isArray(n))throw new Error("array expected");n.forEach((t,r)=>{if(!(t instanceof e))throw new Error("invalid point at index "+r)})}function Re(n,e){if(!Array.isArray(n))throw new Error("array of scalars expected");n.forEach((t,r)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+r)})}const Ot=new WeakMap,ae=new WeakMap;function Lt(n){return ae.get(n)||1}function Me(n,e){return{constTimeNegate:Nt,hasPrecomputes(t){return Lt(t)!==1},unsafeLadder(t,r,o=n.ZERO){let s=t;for(;r>Pt;)r&mt&&(o=o.add(s)),s=s.double(),r>>=mt;return o},precomputeWindow(t,r){const{windows:o,windowSize:s}=qt(r,e),c=[];let f=t,i=f;for(let u=0;u<o;u++){i=f,c.push(i);for(let y=1;y<s;y++)i=i.add(f),c.push(i);f=i.double()}return c},wNAF(t,r,o){const{windows:s,windowSize:c}=qt(t,e);let f=n.ZERO,i=n.BASE;const u=BigInt(2**t-1),y=2**t,h=BigInt(t);for(let l=0;l<s;l++){const m=l*c;let N=Number(o&u);o>>=h,N>c&&(N-=y,o+=mt);const b=m,a=m+Math.abs(N)-1,g=l%2!==0,x=N<0;N===0?i=i.add(Nt(g,r[b])):f=f.add(Nt(x,r[a]))}return{p:f,f:i}},wNAFUnsafe(t,r,o,s=n.ZERO){const{windows:c,windowSize:f}=qt(t,e),i=BigInt(2**t-1),u=2**t,y=BigInt(t);for(let h=0;h<c;h++){const l=h*f;if(o===Pt)break;let m=Number(o&i);if(o>>=y,m>f&&(m-=u,o+=mt),m===0)continue;let N=r[l+Math.abs(m)-1];m<0&&(N=N.negate()),s=s.add(N)}return s},getPrecomputes(t,r,o){let s=Ot.get(r);return s||(s=this.precomputeWindow(r,t),t!==1&&Ot.set(r,o(s))),s},wNAFCached(t,r,o){const s=Lt(t);return this.wNAF(s,this.getPrecomputes(s,t,o),r)},wNAFCachedUnsafe(t,r,o,s){const c=Lt(t);return c===1?this.unsafeLadder(t,r,s):this.wNAFUnsafe(c,this.getPrecomputes(c,t,o),r,s)},setWindowSize(t,r){fe(r,e),ae.set(t,r),Ot.delete(t)}}}function Ve(n,e,t,r){if(Ze(t,n),Re(r,e),t.length!==r.length)throw new Error("arrays of points and scalars must have equal length");const o=n.ZERO,s=te(BigInt(t.length)),c=s>12?s-3:s>4?s-2:s?2:1,f=(1<<c)-1,i=new Array(f+1).fill(o),u=Math.floor((e.BITS-1)/c)*c;let y=o;for(let h=u;h>=0;h-=c){i.fill(o);for(let m=0;m<r.length;m++){const N=r[m],b=Number(N>>BigInt(h)&BigInt(f));i[b]=i[b].add(t[m])}let l=o;for(let m=i.length-1,N=o;m>0;m--)N=N.add(i[m]),l=l.add(N);if(y=y.add(l),h!==0)for(let m=0;m<c;m++)y=y.double()}return y}function ue(n){return Te(n.Fp),yt(n,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...oe(n.n,n.nBitLength),...n,p:n.Fp.ORDER})}function Gt(n){n.lowS!==void 0&&at("lowS",n.lowS),n.prehash!==void 0&&at("prehash",n.prehash)}function je(n){const e=ue(n);yt(e,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:r,a:o}=e;if(t){if(!r.eql(o,r.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...e})}const{bytesToNumberBE:Ye,hexToBytes:Fe}=qe;class Ke extends Error{constructor(e=""){super(e)}}const $={Err:Ke,_tlv:{encode:(n,e)=>{const{Err:t}=$;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length&1)throw new t("tlv.encode: unpadded data");const r=e.length/2,o=gt(r);if(o.length/2&128)throw new t("tlv.encode: long form length too big");const s=r>127?gt(o.length/2|128):"";return gt(n)+s+o+e},decode(n,e){const{Err:t}=$;let r=0;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length<2||e[r++]!==n)throw new t("tlv.decode: wrong tlv");const o=e[r++],s=!!(o&128);let c=0;if(!s)c=o;else{const i=o&127;if(!i)throw new t("tlv.decode(long): indefinite length not supported");if(i>4)throw new t("tlv.decode(long): byte length is too big");const u=e.subarray(r,r+i);if(u.length!==i)throw new t("tlv.decode: length bytes not complete");if(u[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const y of u)c=c<<8|y;if(r+=i,c<128)throw new t("tlv.decode(long): not minimal encoding")}const f=e.subarray(r,r+c);if(f.length!==c)throw new t("tlv.decode: wrong value length");return{v:f,l:e.subarray(r+c)}}},_int:{encode(n){const{Err:e}=$;if(n<W)throw new e("integer: negative integers are not allowed");let t=gt(n);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new e("unexpected DER parsing assertion: unpadded hex");return t},decode(n){const{Err:e}=$;if(n[0]&128)throw new e("invalid signature integer: negative");if(n[0]===0&&!(n[1]&128))throw new e("invalid signature integer: unnecessary leading zero");return Ye(n)}},toSig(n){const{Err:e,_int:t,_tlv:r}=$,o=typeof n=="string"?Fe(n):n;bt(o);const{v:s,l:c}=r.decode(48,o);if(c.length)throw new e("invalid signature: left bytes after parsing");const{v:f,l:i}=r.decode(2,s),{v:u,l:y}=r.decode(2,i);if(y.length)throw new e("invalid signature: left bytes after parsing");return{r:t.decode(f),s:t.decode(u)}},hexFromSig(n){const{_tlv:e,_int:t}=$,r=e.encode(2,t.encode(n.r)),o=e.encode(2,t.encode(n.s)),s=r+o;return e.encode(48,s)}},W=BigInt(0),k=BigInt(1);BigInt(2);const Dt=BigInt(3);BigInt(4);function Pe(n){const e=je(n),{Fp:t}=e,r=ie(e.n,e.nBitLength),o=e.toBytes||((b,a,g)=>{const x=a.toAffine();return pt(Uint8Array.from([4]),t.toBytes(x.x),t.toBytes(x.y))}),s=e.fromBytes||(b=>{const a=b.subarray(1),g=t.fromBytes(a.subarray(0,t.BYTES)),x=t.fromBytes(a.subarray(t.BYTES,2*t.BYTES));return{x:g,y:x}});function c(b){const{a,b:g}=e,x=t.sqr(b),E=t.mul(x,b);return t.add(t.add(E,t.mul(b,a)),g)}if(!t.eql(t.sqr(e.Gy),c(e.Gx)))throw new Error("bad generator point: equation left != right");function f(b){return Et(b,k,e.n)}function i(b){const{allowedPrivateKeyLengths:a,nByteLength:g,wrapPrivateKey:x,n:E}=e;if(a&&typeof b!="bigint"){if(it(b)&&(b=ut(b)),typeof b!="string"||!a.includes(b.length))throw new Error("invalid private key");b=b.padStart(g*2,"0")}let q;try{q=typeof b=="bigint"?b:rt(K("private key",b,g))}catch{throw new Error("invalid private key, expected hex or "+g+" bytes, got "+typeof b)}return x&&(q=V(q,E)),ot("private key",q,k,E),q}function u(b){if(!(b instanceof l))throw new Error("ProjectivePoint expected")}const y=Ht((b,a)=>{const{px:g,py:x,pz:E}=b;if(t.eql(E,t.ONE))return{x:g,y:x};const q=b.is0();a==null&&(a=q?t.ONE:t.inv(E));const L=t.mul(g,a),I=t.mul(x,a),B=t.mul(E,a);if(q)return{x:t.ZERO,y:t.ZERO};if(!t.eql(B,t.ONE))throw new Error("invZ was invalid");return{x:L,y:I}}),h=Ht(b=>{if(b.is0()){if(e.allowInfinityPoint&&!t.is0(b.py))return;throw new Error("bad point: ZERO")}const{x:a,y:g}=b.toAffine();if(!t.isValid(a)||!t.isValid(g))throw new Error("bad point: x or y not FE");const x=t.sqr(g),E=c(a);if(!t.eql(x,E))throw new Error("bad point: equation left != right");if(!b.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class l{constructor(a,g,x){if(this.px=a,this.py=g,this.pz=x,a==null||!t.isValid(a))throw new Error("x required");if(g==null||!t.isValid(g))throw new Error("y required");if(x==null||!t.isValid(x))throw new Error("z required");Object.freeze(this)}static fromAffine(a){const{x:g,y:x}=a||{};if(!a||!t.isValid(g)||!t.isValid(x))throw new Error("invalid affine point");if(a instanceof l)throw new Error("projective point not allowed");const E=q=>t.eql(q,t.ZERO);return E(g)&&E(x)?l.ZERO:new l(g,x,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(a){const g=t.invertBatch(a.map(x=>x.pz));return a.map((x,E)=>x.toAffine(g[E])).map(l.fromAffine)}static fromHex(a){const g=l.fromAffine(s(K("pointHex",a)));return g.assertValidity(),g}static fromPrivateKey(a){return l.BASE.multiply(i(a))}static msm(a,g){return Ve(l,r,a,g)}_setWindowSize(a){N.setWindowSize(this,a)}assertValidity(){h(this)}hasEvenY(){const{y:a}=this.toAffine();if(t.isOdd)return!t.isOdd(a);throw new Error("Field doesn't support isOdd")}equals(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a,B=t.eql(t.mul(g,I),t.mul(q,E)),A=t.eql(t.mul(x,I),t.mul(L,E));return B&&A}negate(){return new l(this.px,t.neg(this.py),this.pz)}double(){const{a,b:g}=e,x=t.mul(g,Dt),{px:E,py:q,pz:L}=this;let I=t.ZERO,B=t.ZERO,A=t.ZERO,v=t.mul(E,E),C=t.mul(q,q),U=t.mul(L,L),H=t.mul(E,q);return H=t.add(H,H),A=t.mul(E,L),A=t.add(A,A),I=t.mul(a,A),B=t.mul(x,U),B=t.add(I,B),I=t.sub(C,B),B=t.add(C,B),B=t.mul(I,B),I=t.mul(H,I),A=t.mul(x,A),U=t.mul(a,U),H=t.sub(v,U),H=t.mul(a,H),H=t.add(H,A),A=t.add(v,v),v=t.add(A,v),v=t.add(v,U),v=t.mul(v,H),B=t.add(B,v),U=t.mul(q,L),U=t.add(U,U),v=t.mul(U,H),I=t.sub(I,v),A=t.mul(U,C),A=t.add(A,A),A=t.add(A,A),new l(I,B,A)}add(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a;let B=t.ZERO,A=t.ZERO,v=t.ZERO;const C=e.a,U=t.mul(e.b,Dt);let H=t.mul(g,q),j=t.mul(x,L),d=t.mul(E,I),w=t.add(g,x),p=t.add(q,L);w=t.mul(w,p),p=t.add(H,j),w=t.sub(w,p),p=t.add(g,E);let S=t.add(q,I);return p=t.mul(p,S),S=t.add(H,d),p=t.sub(p,S),S=t.add(x,E),B=t.add(L,I),S=t.mul(S,B),B=t.add(j,d),S=t.sub(S,B),v=t.mul(C,p),B=t.mul(U,d),v=t.add(B,v),B=t.sub(j,v),v=t.add(j,v),A=t.mul(B,v),j=t.add(H,H),j=t.add(j,H),d=t.mul(C,d),p=t.mul(U,p),j=t.add(j,d),d=t.sub(H,d),d=t.mul(C,d),p=t.add(p,d),H=t.mul(j,p),A=t.add(A,H),H=t.mul(S,p),B=t.mul(w,B),B=t.sub(B,H),H=t.mul(w,j),v=t.mul(S,v),v=t.add(v,H),new l(B,A,v)}subtract(a){return this.add(a.negate())}is0(){return this.equals(l.ZERO)}wNAF(a){return N.wNAFCached(this,a,l.normalizeZ)}multiplyUnsafe(a){const{endo:g,n:x}=e;ot("scalar",a,W,x);const E=l.ZERO;if(a===W)return E;if(this.is0()||a===k)return this;if(!g||N.hasPrecomputes(this))return N.wNAFCachedUnsafe(this,a,l.normalizeZ);let{k1neg:q,k1:L,k2neg:I,k2:B}=g.splitScalar(a),A=E,v=E,C=this;for(;L>W||B>W;)L&k&&(A=A.add(C)),B&k&&(v=v.add(C)),C=C.double(),L>>=k,B>>=k;return q&&(A=A.negate()),I&&(v=v.negate()),v=new l(t.mul(v.px,g.beta),v.py,v.pz),A.add(v)}multiply(a){const{endo:g,n:x}=e;ot("scalar",a,k,x);let E,q;if(g){const{k1neg:L,k1:I,k2neg:B,k2:A}=g.splitScalar(a);let{p:v,f:C}=this.wNAF(I),{p:U,f:H}=this.wNAF(A);v=N.constTimeNegate(L,v),U=N.constTimeNegate(B,U),U=new l(t.mul(U.px,g.beta),U.py,U.pz),E=v.add(U),q=C.add(H)}else{const{p:L,f:I}=this.wNAF(a);E=L,q=I}return l.normalizeZ([E,q])[0]}multiplyAndAddUnsafe(a,g,x){const E=l.BASE,q=(I,B)=>B===W||B===k||!I.equals(E)?I.multiplyUnsafe(B):I.multiply(B),L=q(this,g).add(q(a,x));return L.is0()?void 0:L}toAffine(a){return y(this,a)}isTorsionFree(){const{h:a,isTorsionFree:g}=e;if(a===k)return!0;if(g)return g(l,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:a,clearCofactor:g}=e;return a===k?this:g?g(l,this):this.multiplyUnsafe(e.h)}toRawBytes(a=!0){return at("isCompressed",a),this.assertValidity(),o(l,this,a)}toHex(a=!0){return at("isCompressed",a),ut(this.toRawBytes(a))}}l.BASE=new l(e.Gx,e.Gy,t.ONE),l.ZERO=new l(t.ZERO,t.ONE,t.ZERO);const m=e.nBitLength,N=Me(l,e.endo?Math.ceil(m/2):m);return{CURVE:e,ProjectivePoint:l,normPrivateKeyToScalar:i,weierstrassEquation:c,isWithinCurveOrder:f}}function Ge(n){const e=ue(n);return yt(e,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...e})}function De(n){const e=Ge(n),{Fp:t,n:r}=e,o=t.BYTES+1,s=2*t.BYTES+1;function c(d){return V(d,r)}function f(d){return _t(d,r)}const{ProjectivePoint:i,normPrivateKeyToScalar:u,weierstrassEquation:y,isWithinCurveOrder:h}=Pe({...e,toBytes(d,w,p){const S=w.toAffine(),O=t.toBytes(S.x),T=pt;return at("isCompressed",p),p?T(Uint8Array.from([w.hasEvenY()?2:3]),O):T(Uint8Array.from([4]),O,t.toBytes(S.y))},fromBytes(d){const w=d.length,p=d[0],S=d.subarray(1);if(w===o&&(p===2||p===3)){const O=rt(S);if(!Et(O,k,t.ORDER))throw new Error("Point is not on curve");const T=y(O);let R;try{R=t.sqrt(T)}catch(F){const M=F instanceof Error?": "+F.message:"";throw new Error("Point is not on curve"+M)}const Z=(R&k)===k;return(p&1)===1!==Z&&(R=t.neg(R)),{x:O,y:R}}else if(w===s&&p===4){const O=t.fromBytes(S.subarray(0,t.BYTES)),T=t.fromBytes(S.subarray(t.BYTES,2*t.BYTES));return{x:O,y:T}}else{const O=o,T=s;throw new Error("invalid Point, expected length of "+O+", or uncompressed "+T+", got "+w)}}}),l=d=>ut(lt(d,e.nByteLength));function m(d){const w=r>>k;return d>w}function N(d){return m(d)?c(-d):d}const b=(d,w,p)=>rt(d.slice(w,p));class a{constructor(w,p,S){this.r=w,this.s=p,this.recovery=S,this.assertValidity()}static fromCompact(w){const p=e.nByteLength;return w=K("compactSignature",w,p*2),new a(b(w,0,p),b(w,p,2*p))}static fromDER(w){const{r:p,s:S}=$.toSig(K("DER",w));return new a(p,S)}assertValidity(){ot("r",this.r,k,r),ot("s",this.s,k,r)}addRecoveryBit(w){return new a(this.r,this.s,w)}recoverPublicKey(w){const{r:p,s:S,recovery:O}=this,T=I(K("msgHash",w));if(O==null||![0,1,2,3].includes(O))throw new Error("recovery id invalid");const R=O===2||O===3?p+e.n:p;if(R>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=(O&1)===0?"02":"03",G=i.fromHex(Z+l(R)),F=f(R),M=c(-T*F),st=c(S*F),X=i.BASE.multiplyAndAddUnsafe(G,M,st);if(!X)throw new Error("point at infinify");return X.assertValidity(),X}hasHighS(){return m(this.s)}normalizeS(){return this.hasHighS()?new a(this.r,c(-this.s),this.recovery):this}toDERRawBytes(){return wt(this.toDERHex())}toDERHex(){return $.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return wt(this.toCompactHex())}toCompactHex(){return l(this.r)+l(this.s)}}const g={isValidPrivateKey(d){try{return u(d),!0}catch{return!1}},normPrivateKeyToScalar:u,randomPrivateKey:()=>{const d=ce(e.n);return Ce(e.randomBytes(d),e.n)},precompute(d=8,w=i.BASE){return w._setWindowSize(d),w.multiply(BigInt(3)),w}};function x(d,w=!0){return i.fromPrivateKey(d).toRawBytes(w)}function E(d){const w=it(d),p=typeof d=="string",S=(w||p)&&d.length;return w?S===o||S===s:p?S===2*o||S===2*s:d instanceof i}function q(d,w,p=!0){if(E(d))throw new Error("first arg must be private key");if(!E(w))throw new Error("second arg must be public key");return i.fromHex(w).multiply(u(d)).toRawBytes(p)}const L=e.bits2int||function(d){if(d.length>8192)throw new Error("input is too large");const w=rt(d),p=d.length*8-e.nBitLength;return p>0?w>>BigInt(p):w},I=e.bits2int_modN||function(d){return c(L(d))},B=Mt(e.nBitLength);function A(d){return ot("num < 2^"+e.nBitLength,d,W,B),lt(d,e.nByteLength)}function v(d,w,p=C){if(["recovered","canonical"].some(tt=>tt in p))throw new Error("sign() legacy options not supported");const{hash:S,randomBytes:O}=e;let{lowS:T,prehash:R,extraEntropy:Z}=p;T==null&&(T=!0),d=K("msgHash",d),Gt(p),R&&(d=K("prehashed msgHash",S(d)));const G=I(d),F=u(w),M=[A(F),A(G)];if(Z!=null&&Z!==!1){const tt=Z===!0?O(t.BYTES):Z;M.push(K("extraEntropy",tt))}const st=pt(...M),X=G;function Bt(tt){const ct=L(tt);if(!h(ct))return;const vt=f(ct),dt=i.BASE.multiply(ct).toAffine(),et=c(dt.x);if(et===W)return;const ht=c(vt*c(X+et*F));if(ht===W)return;let ft=(dt.x===et?0:2)|Number(dt.y&k),Vt=ht;return T&&m(ht)&&(Vt=N(ht),ft^=1),new a(et,Vt,ft)}return{seed:st,k2sig:Bt}}const C={lowS:e.lowS,prehash:!1},U={lowS:e.lowS,prehash:!1};function H(d,w,p=C){const{seed:S,k2sig:O}=v(d,w,p),T=e;return ee(T.hash.outputLen,T.nByteLength,T.hmac)(S,O)}i.BASE._setWindowSize(8);function j(d,w,p,S=U){const O=d;w=K("msgHash",w),p=K("publicKey",p);const{lowS:T,prehash:R,format:Z}=S;if(Gt(S),"strict"in S)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const G=typeof O=="string"||it(O),F=!G&&!Z&&typeof O=="object"&&O!==null&&typeof O.r=="bigint"&&typeof O.s=="bigint";if(!G&&!F)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let M,st;try{if(F&&(M=new a(O.r,O.s)),G){try{Z!=="compact"&&(M=a.fromDER(O))}catch(ft){if(!(ft instanceof $.Err))throw ft}!M&&Z!=="der"&&(M=a.fromCompact(O))}st=i.fromHex(p)}catch{return!1}if(!M||T&&M.hasHighS())return!1;R&&(w=e.hash(w));const{r:X,s:Bt}=M,tt=I(w),ct=f(Bt),vt=c(tt*ct),dt=c(X*ct),et=i.BASE.multiplyAndAddUnsafe(st,vt,dt)?.toAffine();return et?c(et.x)===X:!1}return{CURVE:e,getPublicKey:x,getSharedSecret:q,sign:H,verify:j,ProjectivePoint:i,Signature:a,utils:g}}function $e(n){return{hash:n,hmac:(e,...t)=>re(n,e,be(...t)),randomBytes:pe}}function We(n,e){const t=r=>De({...n,...$e(r)});return{...t(e),create:t}}const le=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),$t=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),Xe=BigInt(1),Tt=BigInt(2),Wt=(n,e)=>(n+e/Tt)/e;function Qe(n){const e=le,t=BigInt(3),r=BigInt(6),o=BigInt(11),s=BigInt(22),c=BigInt(23),f=BigInt(44),i=BigInt(88),u=n*n*n%e,y=u*u*n%e,h=Y(y,t,e)*y%e,l=Y(h,t,e)*y%e,m=Y(l,Tt,e)*u%e,N=Y(m,o,e)*m%e,b=Y(N,s,e)*N%e,a=Y(b,f,e)*b%e,g=Y(a,i,e)*a%e,x=Y(g,f,e)*b%e,E=Y(x,t,e)*y%e,q=Y(E,c,e)*N%e,L=Y(q,r,e)*u%e,I=Y(L,Tt,e);if(!kt.eql(kt.sqr(I),n))throw new Error("Cannot find square root");return I}const kt=ie(le,void 0,void 0,{sqrt:Qe}),Je=We({a:BigInt(0),b:BigInt(7),Fp:kt,n:$t,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:n=>{const e=$t,t=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-Xe*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),o=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),s=t,c=BigInt("0x100000000000000000000000000000000"),f=Wt(s*n,e),i=Wt(-r*n,e);let u=V(n-f*t-i*o,e),y=V(-f*r-i*s,e);const h=u>c,l=y>c;if(h&&(u=e-u),l&&(y=e-y),u>c||y>c)throw new Error("splitScalar: Endomorphism failed, k="+n);return{k1neg:h,k1:u,k2neg:l,k2:y}}}},Se);BigInt(0);Je.ProjectivePoint;export{Je as secp256k1};
+import{H as Xt,c as St,a as xt,t as Qt,b as de,d as he,r as P,e as ge,f as we,g as pe,h as be}from"./index-DzeWdEL6.js";import"./index.browser.esm-B9lcScWN.js";import"./vendor-dayjs-Cvgzdobq.js";import"./index-CnxV03kA.js";import"./vendor-vue-DU0w5ewx.js";import"./vendor-axios-B8_nURbH.js";import"./vendor-vue-router-9TBHB1ku.js";import"./index-CVHPJfCy.js";import"./signer-Bt6hppoz.js";import"./types-Cvj5H4DH.js";function ye(n,e,t,r){if(typeof n.setBigUint64=="function")return n.setBigUint64(e,t,r);const o=BigInt(32),s=BigInt(4294967295),c=Number(t>>o&s),f=Number(t&s),i=r?4:0,u=r?0:4;n.setUint32(e+i,c,r),n.setUint32(e+u,f,r)}function me(n,e,t){return n&e^~n&t}function xe(n,e,t){return n&e^n&t^e&t}class Ee extends Xt{constructor(e,t,r,o){super(),this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=o,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(e),this.view=St(this.buffer)}update(e){xt(this);const{view:t,buffer:r,blockLen:o}=this;e=Qt(e);const s=e.length;for(let c=0;c<s;){const f=Math.min(o-this.pos,s-c);if(f===o){const i=St(e);for(;o<=s-c;c+=o)this.process(i,c);continue}r.set(e.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===o&&(this.process(t,0),this.pos=0)}return this.length+=e.length,this.roundClean(),this}digestInto(e){xt(this),de(e,this),this.finished=!0;const{buffer:t,view:r,blockLen:o,isLE:s}=this;let{pos:c}=this;t[c++]=128,this.buffer.subarray(c).fill(0),this.padOffset>o-c&&(this.process(r,0),c=0);for(let h=c;h<o;h++)t[h]=0;ye(r,o-8,BigInt(this.length*8),s),this.process(r,0);const f=St(e),i=this.outputLen;if(i%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const u=i/4,y=this.get();if(u>y.length)throw new Error("_sha2: outputLen bigger than state");for(let h=0;h<u;h++)f.setUint32(4*h,y[h],s)}digest(){const{buffer:e,outputLen:t}=this;this.digestInto(e);const r=e.slice(0,t);return this.destroy(),r}_cloneInto(e){e||(e=new this.constructor),e.set(...this.get());const{blockLen:t,buffer:r,length:o,finished:s,destroyed:c,pos:f}=this;return e.length=o,e.pos=f,e.finished=s,e.destroyed=c,o%t&&e.buffer.set(r),e}}const Be=new Uint32Array([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]),Q=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),J=new Uint32Array(64);class ve extends Ee{constructor(){super(64,32,8,!1),this.A=Q[0]|0,this.B=Q[1]|0,this.C=Q[2]|0,this.D=Q[3]|0,this.E=Q[4]|0,this.F=Q[5]|0,this.G=Q[6]|0,this.H=Q[7]|0}get(){const{A:e,B:t,C:r,D:o,E:s,F:c,G:f,H:i}=this;return[e,t,r,o,s,c,f,i]}set(e,t,r,o,s,c,f,i){this.A=e|0,this.B=t|0,this.C=r|0,this.D=o|0,this.E=s|0,this.F=c|0,this.G=f|0,this.H=i|0}process(e,t){for(let h=0;h<16;h++,t+=4)J[h]=e.getUint32(t,!1);for(let h=16;h<64;h++){const l=J[h-15],m=J[h-2],N=P(l,7)^P(l,18)^l>>>3,b=P(m,17)^P(m,19)^m>>>10;J[h]=b+J[h-7]+N+J[h-16]|0}let{A:r,B:o,C:s,D:c,E:f,F:i,G:u,H:y}=this;for(let h=0;h<64;h++){const l=P(f,6)^P(f,11)^P(f,25),m=y+l+me(f,i,u)+Be[h]+J[h]|0,b=(P(r,2)^P(r,13)^P(r,22))+xe(r,o,s)|0;y=u,u=i,i=f,f=c+m|0,c=s,s=o,o=r,r=m+b|0}r=r+this.A|0,o=o+this.B|0,s=s+this.C|0,c=c+this.D|0,f=f+this.E|0,i=i+this.F|0,u=u+this.G|0,y=y+this.H|0,this.set(r,o,s,c,f,i,u,y)}roundClean(){J.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Se=he(()=>new ve);const zt=BigInt(0),Jt=BigInt(1),Ae=BigInt(2);function it(n){return n instanceof Uint8Array||ArrayBuffer.isView(n)&&n.constructor.name==="Uint8Array"}function bt(n){if(!it(n))throw new Error("Uint8Array expected")}function at(n,e){if(typeof e!="boolean")throw new Error(n+" boolean expected, got "+e)}const Ie=Array.from({length:256},(n,e)=>e.toString(16).padStart(2,"0"));function ut(n){bt(n);let e="";for(let t=0;t<n.length;t++)e+=Ie[n[t]];return e}function gt(n){const e=n.toString(16);return e.length&1?"0"+e:e}function Ct(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);return n===""?zt:BigInt("0x"+n)}const D={_0:48,_9:57,A:65,F:70,a:97,f:102};function jt(n){if(n>=D._0&&n<=D._9)return n-D._0;if(n>=D.A&&n<=D.F)return n-(D.A-10);if(n>=D.a&&n<=D.f)return n-(D.a-10)}function wt(n){if(typeof n!="string")throw new Error("hex string expected, got "+typeof n);const e=n.length,t=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(t);for(let o=0,s=0;o<t;o++,s+=2){const c=jt(n.charCodeAt(s)),f=jt(n.charCodeAt(s+1));if(c===void 0||f===void 0){const i=n[s]+n[s+1];throw new Error('hex string expected, got non-hex character "'+i+'" at index '+s)}r[o]=c*16+f}return r}function rt(n){return Ct(ut(n))}function Zt(n){return bt(n),Ct(ut(Uint8Array.from(n).reverse()))}function lt(n,e){return wt(n.toString(16).padStart(e*2,"0"))}function Rt(n,e){return lt(n,e).reverse()}function K(n,e,t){let r;if(typeof e=="string")try{r=wt(e)}catch(s){throw new Error(n+" must be hex string or Uint8Array, cause: "+s)}else if(it(e))r=Uint8Array.from(e);else throw new Error(n+" must be hex string or Uint8Array");const o=r.length;if(typeof t=="number"&&o!==t)throw new Error(n+" of length "+t+" expected, got "+o);return r}function pt(...n){let e=0;for(let r=0;r<n.length;r++){const o=n[r];bt(o),e+=o.length}const t=new Uint8Array(e);for(let r=0,o=0;r<n.length;r++){const s=n[r];t.set(s,o),o+=s.length}return t}const At=n=>typeof n=="bigint"&&zt<=n;function Et(n,e,t){return At(n)&&At(e)&&At(t)&&e<=n&&n<t}function ot(n,e,t,r){if(!Et(e,t,r))throw new Error("expected valid "+n+": "+t+" <= n < "+r+", got "+e)}function te(n){let e;for(e=0;n>zt;n>>=Jt,e+=1);return e}const Mt=n=>(Ae<<BigInt(n-1))-Jt,It=n=>new Uint8Array(n),Yt=n=>Uint8Array.from(n);function ee(n,e,t){if(typeof n!="number"||n<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof t!="function")throw new Error("hmacFn must be a function");let r=It(n),o=It(n),s=0;const c=()=>{r.fill(1),o.fill(0),s=0},f=(...h)=>t(o,r,...h),i=(h=It())=>{o=f(Yt([0]),h),r=f(),h.length!==0&&(o=f(Yt([1]),h),r=f())},u=()=>{if(s++>=1e3)throw new Error("drbg: tried 1000 values");let h=0;const l=[];for(;h<e;){r=f();const m=r.slice();l.push(m),h+=r.length}return pt(...l)};return(h,l)=>{c(),i(h);let m;for(;!(m=l(u()));)i();return c(),m}}const Ne={bigint:n=>typeof n=="bigint",function:n=>typeof n=="function",boolean:n=>typeof n=="boolean",string:n=>typeof n=="string",stringOrUint8Array:n=>typeof n=="string"||it(n),isSafeInteger:n=>Number.isSafeInteger(n),array:n=>Array.isArray(n),field:(n,e)=>e.Fp.isValid(n),hash:n=>typeof n=="function"&&Number.isSafeInteger(n.outputLen)};function yt(n,e,t={}){const r=(o,s,c)=>{const f=Ne[s];if(typeof f!="function")throw new Error("invalid validator function");const i=n[o];if(!(c&&i===void 0)&&!f(i,n))throw new Error("param "+String(o)+" is invalid. Expected "+s+", got "+i)};for(const[o,s]of Object.entries(e))r(o,s,!1);for(const[o,s]of Object.entries(t))r(o,s,!0);return n}function Ht(n){const e=new WeakMap;return(t,...r)=>{const o=e.get(t);if(o!==void 0)return o;const s=n(t,...r);return e.set(t,s),s}}const qe=Object.freeze(Object.defineProperty({__proto__:null,aInRange:ot,abool:at,abytes:bt,bitLen:te,bitMask:Mt,bytesToHex:ut,bytesToNumberBE:rt,bytesToNumberLE:Zt,concatBytes:pt,createHmacDrbg:ee,ensureBytes:K,hexToBytes:wt,hexToNumber:Ct,inRange:Et,isBytes:it,memoized:Ht,numberToBytesBE:lt,numberToBytesLE:Rt,numberToHexUnpadded:gt,validateObject:yt},Symbol.toStringTag,{value:"Module"}));class ne extends Xt{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,ge(e);const r=Qt(t);if(this.iHash=e.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const o=this.blockLen,s=new Uint8Array(o);s.set(r.length>o?e.create().update(r).digest():r);for(let c=0;c<s.length;c++)s[c]^=54;this.iHash.update(s),this.oHash=e.create();for(let c=0;c<s.length;c++)s[c]^=106;this.oHash.update(s),s.fill(0)}update(e){return xt(this),this.iHash.update(e),this}digestInto(e){xt(this),we(e,this.outputLen),this.finished=!0,this.iHash.digestInto(e),this.oHash.update(e),this.oHash.digestInto(e),this.destroy()}digest(){const e=new Uint8Array(this.oHash.outputLen);return this.digestInto(e),e}_cloneInto(e){e||(e=Object.create(Object.getPrototypeOf(this),{}));const{oHash:t,iHash:r,finished:o,destroyed:s,blockLen:c,outputLen:f}=this;return e=e,e.finished=o,e.destroyed=s,e.blockLen=c,e.outputLen=f,e.oHash=t._cloneInto(e.oHash),e.iHash=r._cloneInto(e.iHash),e}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const re=(n,e,t)=>new ne(n,e).update(t).digest();re.create=(n,e)=>new ne(n,e);const z=BigInt(0),_=BigInt(1),nt=BigInt(2),Oe=BigInt(3),Ut=BigInt(4),Ft=BigInt(5),Kt=BigInt(8);function V(n,e){const t=n%e;return t>=z?t:e+t}function Le(n,e,t){if(e<z)throw new Error("invalid exponent, negatives unsupported");if(t<=z)throw new Error("invalid modulus");if(t===_)return z;let r=_;for(;e>z;)e&_&&(r=r*n%t),n=n*n%t,e>>=_;return r}function Y(n,e,t){let r=n;for(;e-- >z;)r*=r,r%=t;return r}function _t(n,e){if(n===z)throw new Error("invert: expected non-zero number");if(e<=z)throw new Error("invert: expected positive modulus, got "+e);let t=V(n,e),r=e,o=z,s=_;for(;t!==z;){const f=r/t,i=r%t,u=o-s*f;r=t,t=i,o=s,s=u}if(r!==_)throw new Error("invert: does not exist");return V(o,e)}function He(n){const e=(n-_)/nt;let t,r,o;for(t=n-_,r=0;t%nt===z;t/=nt,r++);for(o=nt;o<n&&Le(o,e,n)!==n-_;o++)if(o>1e3)throw new Error("Cannot find square root: likely non-prime P");if(r===1){const c=(n+_)/Ut;return function(i,u){const y=i.pow(u,c);if(!i.eql(i.sqr(y),u))throw new Error("Cannot find square root");return y}}const s=(t+_)/nt;return function(f,i){if(f.pow(i,e)===f.neg(f.ONE))throw new Error("Cannot find square root");let u=r,y=f.pow(f.mul(f.ONE,o),t),h=f.pow(i,s),l=f.pow(i,t);for(;!f.eql(l,f.ONE);){if(f.eql(l,f.ZERO))return f.ZERO;let m=1;for(let b=f.sqr(l);m<u&&!f.eql(b,f.ONE);m++)b=f.sqr(b);const N=f.pow(y,_<<BigInt(u-m-1));y=f.sqr(N),h=f.mul(h,N),l=f.mul(l,y),u=m}return h}}function Ue(n){if(n%Ut===Oe){const e=(n+_)/Ut;return function(r,o){const s=r.pow(o,e);if(!r.eql(r.sqr(s),o))throw new Error("Cannot find square root");return s}}if(n%Kt===Ft){const e=(n-Ft)/Kt;return function(r,o){const s=r.mul(o,nt),c=r.pow(s,e),f=r.mul(o,c),i=r.mul(r.mul(f,nt),c),u=r.mul(f,r.sub(i,r.ONE));if(!r.eql(r.sqr(u),o))throw new Error("Cannot find square root");return u}}return He(n)}const _e=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Te(n){const e={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},t=_e.reduce((r,o)=>(r[o]="function",r),e);return yt(n,t)}function ke(n,e,t){if(t<z)throw new Error("invalid exponent, negatives unsupported");if(t===z)return n.ONE;if(t===_)return e;let r=n.ONE,o=e;for(;t>z;)t&_&&(r=n.mul(r,o)),o=n.sqr(o),t>>=_;return r}function ze(n,e){const t=new Array(e.length),r=e.reduce((s,c,f)=>n.is0(c)?s:(t[f]=s,n.mul(s,c)),n.ONE),o=n.inv(r);return e.reduceRight((s,c,f)=>n.is0(c)?s:(t[f]=n.mul(s,t[f]),n.mul(s,c)),o),t}function oe(n,e){const t=e!==void 0?e:n.toString(2).length,r=Math.ceil(t/8);return{nBitLength:t,nByteLength:r}}function ie(n,e,t=!1,r={}){if(n<=z)throw new Error("invalid field: expected ORDER > 0, got "+n);const{nBitLength:o,nByteLength:s}=oe(n,e);if(s>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:n,isLE:t,BITS:o,BYTES:s,MASK:Mt(o),ZERO:z,ONE:_,create:i=>V(i,n),isValid:i=>{if(typeof i!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof i);return z<=i&&i<n},is0:i=>i===z,isOdd:i=>(i&_)===_,neg:i=>V(-i,n),eql:(i,u)=>i===u,sqr:i=>V(i*i,n),add:(i,u)=>V(i+u,n),sub:(i,u)=>V(i-u,n),mul:(i,u)=>V(i*u,n),pow:(i,u)=>ke(f,i,u),div:(i,u)=>V(i*_t(u,n),n),sqrN:i=>i*i,addN:(i,u)=>i+u,subN:(i,u)=>i-u,mulN:(i,u)=>i*u,inv:i=>_t(i,n),sqrt:r.sqrt||(i=>(c||(c=Ue(n)),c(f,i))),invertBatch:i=>ze(f,i),cmov:(i,u,y)=>y?u:i,toBytes:i=>t?Rt(i,s):lt(i,s),fromBytes:i=>{if(i.length!==s)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+i.length);return t?Zt(i):rt(i)}});return Object.freeze(f)}function se(n){if(typeof n!="bigint")throw new Error("field order must be bigint");const e=n.toString(2).length;return Math.ceil(e/8)}function ce(n){const e=se(n);return e+Math.ceil(e/2)}function Ce(n,e,t=!1){const r=n.length,o=se(e),s=ce(e);if(r<16||r<s||r>1024)throw new Error("expected "+s+"-1024 bytes of input, got "+r);const c=t?Zt(n):rt(n),f=V(c,e-_)+_;return t?Rt(f,o):lt(f,o)}const Pt=BigInt(0),mt=BigInt(1);function Nt(n,e){const t=e.negate();return n?t:e}function fe(n,e){if(!Number.isSafeInteger(n)||n<=0||n>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+n)}function qt(n,e){fe(n,e);const t=Math.ceil(e/n)+1,r=2**(n-1);return{windows:t,windowSize:r}}function Ze(n,e){if(!Array.isArray(n))throw new Error("array expected");n.forEach((t,r)=>{if(!(t instanceof e))throw new Error("invalid point at index "+r)})}function Re(n,e){if(!Array.isArray(n))throw new Error("array of scalars expected");n.forEach((t,r)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+r)})}const Ot=new WeakMap,ae=new WeakMap;function Lt(n){return ae.get(n)||1}function Me(n,e){return{constTimeNegate:Nt,hasPrecomputes(t){return Lt(t)!==1},unsafeLadder(t,r,o=n.ZERO){let s=t;for(;r>Pt;)r&mt&&(o=o.add(s)),s=s.double(),r>>=mt;return o},precomputeWindow(t,r){const{windows:o,windowSize:s}=qt(r,e),c=[];let f=t,i=f;for(let u=0;u<o;u++){i=f,c.push(i);for(let y=1;y<s;y++)i=i.add(f),c.push(i);f=i.double()}return c},wNAF(t,r,o){const{windows:s,windowSize:c}=qt(t,e);let f=n.ZERO,i=n.BASE;const u=BigInt(2**t-1),y=2**t,h=BigInt(t);for(let l=0;l<s;l++){const m=l*c;let N=Number(o&u);o>>=h,N>c&&(N-=y,o+=mt);const b=m,a=m+Math.abs(N)-1,g=l%2!==0,x=N<0;N===0?i=i.add(Nt(g,r[b])):f=f.add(Nt(x,r[a]))}return{p:f,f:i}},wNAFUnsafe(t,r,o,s=n.ZERO){const{windows:c,windowSize:f}=qt(t,e),i=BigInt(2**t-1),u=2**t,y=BigInt(t);for(let h=0;h<c;h++){const l=h*f;if(o===Pt)break;let m=Number(o&i);if(o>>=y,m>f&&(m-=u,o+=mt),m===0)continue;let N=r[l+Math.abs(m)-1];m<0&&(N=N.negate()),s=s.add(N)}return s},getPrecomputes(t,r,o){let s=Ot.get(r);return s||(s=this.precomputeWindow(r,t),t!==1&&Ot.set(r,o(s))),s},wNAFCached(t,r,o){const s=Lt(t);return this.wNAF(s,this.getPrecomputes(s,t,o),r)},wNAFCachedUnsafe(t,r,o,s){const c=Lt(t);return c===1?this.unsafeLadder(t,r,s):this.wNAFUnsafe(c,this.getPrecomputes(c,t,o),r,s)},setWindowSize(t,r){fe(r,e),ae.set(t,r),Ot.delete(t)}}}function Ve(n,e,t,r){if(Ze(t,n),Re(r,e),t.length!==r.length)throw new Error("arrays of points and scalars must have equal length");const o=n.ZERO,s=te(BigInt(t.length)),c=s>12?s-3:s>4?s-2:s?2:1,f=(1<<c)-1,i=new Array(f+1).fill(o),u=Math.floor((e.BITS-1)/c)*c;let y=o;for(let h=u;h>=0;h-=c){i.fill(o);for(let m=0;m<r.length;m++){const N=r[m],b=Number(N>>BigInt(h)&BigInt(f));i[b]=i[b].add(t[m])}let l=o;for(let m=i.length-1,N=o;m>0;m--)N=N.add(i[m]),l=l.add(N);if(y=y.add(l),h!==0)for(let m=0;m<c;m++)y=y.double()}return y}function ue(n){return Te(n.Fp),yt(n,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...oe(n.n,n.nBitLength),...n,p:n.Fp.ORDER})}function Gt(n){n.lowS!==void 0&&at("lowS",n.lowS),n.prehash!==void 0&&at("prehash",n.prehash)}function je(n){const e=ue(n);yt(e,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:r,a:o}=e;if(t){if(!r.eql(o,r.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...e})}const{bytesToNumberBE:Ye,hexToBytes:Fe}=qe;class Ke extends Error{constructor(e=""){super(e)}}const $={Err:Ke,_tlv:{encode:(n,e)=>{const{Err:t}=$;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length&1)throw new t("tlv.encode: unpadded data");const r=e.length/2,o=gt(r);if(o.length/2&128)throw new t("tlv.encode: long form length too big");const s=r>127?gt(o.length/2|128):"";return gt(n)+s+o+e},decode(n,e){const{Err:t}=$;let r=0;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length<2||e[r++]!==n)throw new t("tlv.decode: wrong tlv");const o=e[r++],s=!!(o&128);let c=0;if(!s)c=o;else{const i=o&127;if(!i)throw new t("tlv.decode(long): indefinite length not supported");if(i>4)throw new t("tlv.decode(long): byte length is too big");const u=e.subarray(r,r+i);if(u.length!==i)throw new t("tlv.decode: length bytes not complete");if(u[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const y of u)c=c<<8|y;if(r+=i,c<128)throw new t("tlv.decode(long): not minimal encoding")}const f=e.subarray(r,r+c);if(f.length!==c)throw new t("tlv.decode: wrong value length");return{v:f,l:e.subarray(r+c)}}},_int:{encode(n){const{Err:e}=$;if(n<W)throw new e("integer: negative integers are not allowed");let t=gt(n);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new e("unexpected DER parsing assertion: unpadded hex");return t},decode(n){const{Err:e}=$;if(n[0]&128)throw new e("invalid signature integer: negative");if(n[0]===0&&!(n[1]&128))throw new e("invalid signature integer: unnecessary leading zero");return Ye(n)}},toSig(n){const{Err:e,_int:t,_tlv:r}=$,o=typeof n=="string"?Fe(n):n;bt(o);const{v:s,l:c}=r.decode(48,o);if(c.length)throw new e("invalid signature: left bytes after parsing");const{v:f,l:i}=r.decode(2,s),{v:u,l:y}=r.decode(2,i);if(y.length)throw new e("invalid signature: left bytes after parsing");return{r:t.decode(f),s:t.decode(u)}},hexFromSig(n){const{_tlv:e,_int:t}=$,r=e.encode(2,t.encode(n.r)),o=e.encode(2,t.encode(n.s)),s=r+o;return e.encode(48,s)}},W=BigInt(0),k=BigInt(1);BigInt(2);const Dt=BigInt(3);BigInt(4);function Pe(n){const e=je(n),{Fp:t}=e,r=ie(e.n,e.nBitLength),o=e.toBytes||((b,a,g)=>{const x=a.toAffine();return pt(Uint8Array.from([4]),t.toBytes(x.x),t.toBytes(x.y))}),s=e.fromBytes||(b=>{const a=b.subarray(1),g=t.fromBytes(a.subarray(0,t.BYTES)),x=t.fromBytes(a.subarray(t.BYTES,2*t.BYTES));return{x:g,y:x}});function c(b){const{a,b:g}=e,x=t.sqr(b),E=t.mul(x,b);return t.add(t.add(E,t.mul(b,a)),g)}if(!t.eql(t.sqr(e.Gy),c(e.Gx)))throw new Error("bad generator point: equation left != right");function f(b){return Et(b,k,e.n)}function i(b){const{allowedPrivateKeyLengths:a,nByteLength:g,wrapPrivateKey:x,n:E}=e;if(a&&typeof b!="bigint"){if(it(b)&&(b=ut(b)),typeof b!="string"||!a.includes(b.length))throw new Error("invalid private key");b=b.padStart(g*2,"0")}let q;try{q=typeof b=="bigint"?b:rt(K("private key",b,g))}catch{throw new Error("invalid private key, expected hex or "+g+" bytes, got "+typeof b)}return x&&(q=V(q,E)),ot("private key",q,k,E),q}function u(b){if(!(b instanceof l))throw new Error("ProjectivePoint expected")}const y=Ht((b,a)=>{const{px:g,py:x,pz:E}=b;if(t.eql(E,t.ONE))return{x:g,y:x};const q=b.is0();a==null&&(a=q?t.ONE:t.inv(E));const L=t.mul(g,a),I=t.mul(x,a),B=t.mul(E,a);if(q)return{x:t.ZERO,y:t.ZERO};if(!t.eql(B,t.ONE))throw new Error("invZ was invalid");return{x:L,y:I}}),h=Ht(b=>{if(b.is0()){if(e.allowInfinityPoint&&!t.is0(b.py))return;throw new Error("bad point: ZERO")}const{x:a,y:g}=b.toAffine();if(!t.isValid(a)||!t.isValid(g))throw new Error("bad point: x or y not FE");const x=t.sqr(g),E=c(a);if(!t.eql(x,E))throw new Error("bad point: equation left != right");if(!b.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class l{constructor(a,g,x){if(this.px=a,this.py=g,this.pz=x,a==null||!t.isValid(a))throw new Error("x required");if(g==null||!t.isValid(g))throw new Error("y required");if(x==null||!t.isValid(x))throw new Error("z required");Object.freeze(this)}static fromAffine(a){const{x:g,y:x}=a||{};if(!a||!t.isValid(g)||!t.isValid(x))throw new Error("invalid affine point");if(a instanceof l)throw new Error("projective point not allowed");const E=q=>t.eql(q,t.ZERO);return E(g)&&E(x)?l.ZERO:new l(g,x,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(a){const g=t.invertBatch(a.map(x=>x.pz));return a.map((x,E)=>x.toAffine(g[E])).map(l.fromAffine)}static fromHex(a){const g=l.fromAffine(s(K("pointHex",a)));return g.assertValidity(),g}static fromPrivateKey(a){return l.BASE.multiply(i(a))}static msm(a,g){return Ve(l,r,a,g)}_setWindowSize(a){N.setWindowSize(this,a)}assertValidity(){h(this)}hasEvenY(){const{y:a}=this.toAffine();if(t.isOdd)return!t.isOdd(a);throw new Error("Field doesn't support isOdd")}equals(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a,B=t.eql(t.mul(g,I),t.mul(q,E)),A=t.eql(t.mul(x,I),t.mul(L,E));return B&&A}negate(){return new l(this.px,t.neg(this.py),this.pz)}double(){const{a,b:g}=e,x=t.mul(g,Dt),{px:E,py:q,pz:L}=this;let I=t.ZERO,B=t.ZERO,A=t.ZERO,v=t.mul(E,E),C=t.mul(q,q),U=t.mul(L,L),H=t.mul(E,q);return H=t.add(H,H),A=t.mul(E,L),A=t.add(A,A),I=t.mul(a,A),B=t.mul(x,U),B=t.add(I,B),I=t.sub(C,B),B=t.add(C,B),B=t.mul(I,B),I=t.mul(H,I),A=t.mul(x,A),U=t.mul(a,U),H=t.sub(v,U),H=t.mul(a,H),H=t.add(H,A),A=t.add(v,v),v=t.add(A,v),v=t.add(v,U),v=t.mul(v,H),B=t.add(B,v),U=t.mul(q,L),U=t.add(U,U),v=t.mul(U,H),I=t.sub(I,v),A=t.mul(U,C),A=t.add(A,A),A=t.add(A,A),new l(I,B,A)}add(a){u(a);const{px:g,py:x,pz:E}=this,{px:q,py:L,pz:I}=a;let B=t.ZERO,A=t.ZERO,v=t.ZERO;const C=e.a,U=t.mul(e.b,Dt);let H=t.mul(g,q),j=t.mul(x,L),d=t.mul(E,I),w=t.add(g,x),p=t.add(q,L);w=t.mul(w,p),p=t.add(H,j),w=t.sub(w,p),p=t.add(g,E);let S=t.add(q,I);return p=t.mul(p,S),S=t.add(H,d),p=t.sub(p,S),S=t.add(x,E),B=t.add(L,I),S=t.mul(S,B),B=t.add(j,d),S=t.sub(S,B),v=t.mul(C,p),B=t.mul(U,d),v=t.add(B,v),B=t.sub(j,v),v=t.add(j,v),A=t.mul(B,v),j=t.add(H,H),j=t.add(j,H),d=t.mul(C,d),p=t.mul(U,p),j=t.add(j,d),d=t.sub(H,d),d=t.mul(C,d),p=t.add(p,d),H=t.mul(j,p),A=t.add(A,H),H=t.mul(S,p),B=t.mul(w,B),B=t.sub(B,H),H=t.mul(w,j),v=t.mul(S,v),v=t.add(v,H),new l(B,A,v)}subtract(a){return this.add(a.negate())}is0(){return this.equals(l.ZERO)}wNAF(a){return N.wNAFCached(this,a,l.normalizeZ)}multiplyUnsafe(a){const{endo:g,n:x}=e;ot("scalar",a,W,x);const E=l.ZERO;if(a===W)return E;if(this.is0()||a===k)return this;if(!g||N.hasPrecomputes(this))return N.wNAFCachedUnsafe(this,a,l.normalizeZ);let{k1neg:q,k1:L,k2neg:I,k2:B}=g.splitScalar(a),A=E,v=E,C=this;for(;L>W||B>W;)L&k&&(A=A.add(C)),B&k&&(v=v.add(C)),C=C.double(),L>>=k,B>>=k;return q&&(A=A.negate()),I&&(v=v.negate()),v=new l(t.mul(v.px,g.beta),v.py,v.pz),A.add(v)}multiply(a){const{endo:g,n:x}=e;ot("scalar",a,k,x);let E,q;if(g){const{k1neg:L,k1:I,k2neg:B,k2:A}=g.splitScalar(a);let{p:v,f:C}=this.wNAF(I),{p:U,f:H}=this.wNAF(A);v=N.constTimeNegate(L,v),U=N.constTimeNegate(B,U),U=new l(t.mul(U.px,g.beta),U.py,U.pz),E=v.add(U),q=C.add(H)}else{const{p:L,f:I}=this.wNAF(a);E=L,q=I}return l.normalizeZ([E,q])[0]}multiplyAndAddUnsafe(a,g,x){const E=l.BASE,q=(I,B)=>B===W||B===k||!I.equals(E)?I.multiplyUnsafe(B):I.multiply(B),L=q(this,g).add(q(a,x));return L.is0()?void 0:L}toAffine(a){return y(this,a)}isTorsionFree(){const{h:a,isTorsionFree:g}=e;if(a===k)return!0;if(g)return g(l,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:a,clearCofactor:g}=e;return a===k?this:g?g(l,this):this.multiplyUnsafe(e.h)}toRawBytes(a=!0){return at("isCompressed",a),this.assertValidity(),o(l,this,a)}toHex(a=!0){return at("isCompressed",a),ut(this.toRawBytes(a))}}l.BASE=new l(e.Gx,e.Gy,t.ONE),l.ZERO=new l(t.ZERO,t.ONE,t.ZERO);const m=e.nBitLength,N=Me(l,e.endo?Math.ceil(m/2):m);return{CURVE:e,ProjectivePoint:l,normPrivateKeyToScalar:i,weierstrassEquation:c,isWithinCurveOrder:f}}function Ge(n){const e=ue(n);return yt(e,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...e})}function De(n){const e=Ge(n),{Fp:t,n:r}=e,o=t.BYTES+1,s=2*t.BYTES+1;function c(d){return V(d,r)}function f(d){return _t(d,r)}const{ProjectivePoint:i,normPrivateKeyToScalar:u,weierstrassEquation:y,isWithinCurveOrder:h}=Pe({...e,toBytes(d,w,p){const S=w.toAffine(),O=t.toBytes(S.x),T=pt;return at("isCompressed",p),p?T(Uint8Array.from([w.hasEvenY()?2:3]),O):T(Uint8Array.from([4]),O,t.toBytes(S.y))},fromBytes(d){const w=d.length,p=d[0],S=d.subarray(1);if(w===o&&(p===2||p===3)){const O=rt(S);if(!Et(O,k,t.ORDER))throw new Error("Point is not on curve");const T=y(O);let R;try{R=t.sqrt(T)}catch(F){const M=F instanceof Error?": "+F.message:"";throw new Error("Point is not on curve"+M)}const Z=(R&k)===k;return(p&1)===1!==Z&&(R=t.neg(R)),{x:O,y:R}}else if(w===s&&p===4){const O=t.fromBytes(S.subarray(0,t.BYTES)),T=t.fromBytes(S.subarray(t.BYTES,2*t.BYTES));return{x:O,y:T}}else{const O=o,T=s;throw new Error("invalid Point, expected length of "+O+", or uncompressed "+T+", got "+w)}}}),l=d=>ut(lt(d,e.nByteLength));function m(d){const w=r>>k;return d>w}function N(d){return m(d)?c(-d):d}const b=(d,w,p)=>rt(d.slice(w,p));class a{constructor(w,p,S){this.r=w,this.s=p,this.recovery=S,this.assertValidity()}static fromCompact(w){const p=e.nByteLength;return w=K("compactSignature",w,p*2),new a(b(w,0,p),b(w,p,2*p))}static fromDER(w){const{r:p,s:S}=$.toSig(K("DER",w));return new a(p,S)}assertValidity(){ot("r",this.r,k,r),ot("s",this.s,k,r)}addRecoveryBit(w){return new a(this.r,this.s,w)}recoverPublicKey(w){const{r:p,s:S,recovery:O}=this,T=I(K("msgHash",w));if(O==null||![0,1,2,3].includes(O))throw new Error("recovery id invalid");const R=O===2||O===3?p+e.n:p;if(R>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=(O&1)===0?"02":"03",G=i.fromHex(Z+l(R)),F=f(R),M=c(-T*F),st=c(S*F),X=i.BASE.multiplyAndAddUnsafe(G,M,st);if(!X)throw new Error("point at infinify");return X.assertValidity(),X}hasHighS(){return m(this.s)}normalizeS(){return this.hasHighS()?new a(this.r,c(-this.s),this.recovery):this}toDERRawBytes(){return wt(this.toDERHex())}toDERHex(){return $.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return wt(this.toCompactHex())}toCompactHex(){return l(this.r)+l(this.s)}}const g={isValidPrivateKey(d){try{return u(d),!0}catch{return!1}},normPrivateKeyToScalar:u,randomPrivateKey:()=>{const d=ce(e.n);return Ce(e.randomBytes(d),e.n)},precompute(d=8,w=i.BASE){return w._setWindowSize(d),w.multiply(BigInt(3)),w}};function x(d,w=!0){return i.fromPrivateKey(d).toRawBytes(w)}function E(d){const w=it(d),p=typeof d=="string",S=(w||p)&&d.length;return w?S===o||S===s:p?S===2*o||S===2*s:d instanceof i}function q(d,w,p=!0){if(E(d))throw new Error("first arg must be private key");if(!E(w))throw new Error("second arg must be public key");return i.fromHex(w).multiply(u(d)).toRawBytes(p)}const L=e.bits2int||function(d){if(d.length>8192)throw new Error("input is too large");const w=rt(d),p=d.length*8-e.nBitLength;return p>0?w>>BigInt(p):w},I=e.bits2int_modN||function(d){return c(L(d))},B=Mt(e.nBitLength);function A(d){return ot("num < 2^"+e.nBitLength,d,W,B),lt(d,e.nByteLength)}function v(d,w,p=C){if(["recovered","canonical"].some(tt=>tt in p))throw new Error("sign() legacy options not supported");const{hash:S,randomBytes:O}=e;let{lowS:T,prehash:R,extraEntropy:Z}=p;T==null&&(T=!0),d=K("msgHash",d),Gt(p),R&&(d=K("prehashed msgHash",S(d)));const G=I(d),F=u(w),M=[A(F),A(G)];if(Z!=null&&Z!==!1){const tt=Z===!0?O(t.BYTES):Z;M.push(K("extraEntropy",tt))}const st=pt(...M),X=G;function Bt(tt){const ct=L(tt);if(!h(ct))return;const vt=f(ct),dt=i.BASE.multiply(ct).toAffine(),et=c(dt.x);if(et===W)return;const ht=c(vt*c(X+et*F));if(ht===W)return;let ft=(dt.x===et?0:2)|Number(dt.y&k),Vt=ht;return T&&m(ht)&&(Vt=N(ht),ft^=1),new a(et,Vt,ft)}return{seed:st,k2sig:Bt}}const C={lowS:e.lowS,prehash:!1},U={lowS:e.lowS,prehash:!1};function H(d,w,p=C){const{seed:S,k2sig:O}=v(d,w,p),T=e;return ee(T.hash.outputLen,T.nByteLength,T.hmac)(S,O)}i.BASE._setWindowSize(8);function j(d,w,p,S=U){const O=d;w=K("msgHash",w),p=K("publicKey",p);const{lowS:T,prehash:R,format:Z}=S;if(Gt(S),"strict"in S)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const G=typeof O=="string"||it(O),F=!G&&!Z&&typeof O=="object"&&O!==null&&typeof O.r=="bigint"&&typeof O.s=="bigint";if(!G&&!F)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let M,st;try{if(F&&(M=new a(O.r,O.s)),G){try{Z!=="compact"&&(M=a.fromDER(O))}catch(ft){if(!(ft instanceof $.Err))throw ft}!M&&Z!=="der"&&(M=a.fromCompact(O))}st=i.fromHex(p)}catch{return!1}if(!M||T&&M.hasHighS())return!1;R&&(w=e.hash(w));const{r:X,s:Bt}=M,tt=I(w),ct=f(Bt),vt=c(tt*ct),dt=c(X*ct),et=i.BASE.multiplyAndAddUnsafe(st,vt,dt)?.toAffine();return et?c(et.x)===X:!1}return{CURVE:e,getPublicKey:x,getSharedSecret:q,sign:H,verify:j,ProjectivePoint:i,Signature:a,utils:g}}function $e(n){return{hash:n,hmac:(e,...t)=>re(n,e,be(...t)),randomBytes:pe}}function We(n,e){const t=r=>De({...n,...$e(r)});return{...t(e),create:t}}const le=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),$t=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),Xe=BigInt(1),Tt=BigInt(2),Wt=(n,e)=>(n+e/Tt)/e;function Qe(n){const e=le,t=BigInt(3),r=BigInt(6),o=BigInt(11),s=BigInt(22),c=BigInt(23),f=BigInt(44),i=BigInt(88),u=n*n*n%e,y=u*u*n%e,h=Y(y,t,e)*y%e,l=Y(h,t,e)*y%e,m=Y(l,Tt,e)*u%e,N=Y(m,o,e)*m%e,b=Y(N,s,e)*N%e,a=Y(b,f,e)*b%e,g=Y(a,i,e)*a%e,x=Y(g,f,e)*b%e,E=Y(x,t,e)*y%e,q=Y(E,c,e)*N%e,L=Y(q,r,e)*u%e,I=Y(L,Tt,e);if(!kt.eql(kt.sqr(I),n))throw new Error("Cannot find square root");return I}const kt=ie(le,void 0,void 0,{sqrt:Qe}),Je=We({a:BigInt(0),b:BigInt(7),Fp:kt,n:$t,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:n=>{const e=$t,t=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-Xe*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),o=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),s=t,c=BigInt("0x100000000000000000000000000000000"),f=Wt(s*n,e),i=Wt(-r*n,e);let u=V(n-f*t-i*o,e),y=V(-f*r-i*s,e);const h=u>c,l=y>c;if(h&&(u=e-u),l&&(y=e-y),u>c||y>c)throw new Error("splitScalar: Endomorphism failed, k="+n);return{k1neg:h,k1:u,k2neg:l,k2:y}}}},Se);BigInt(0);Je.ProjectivePoint;export{Je as secp256k1};

package/dist/assets/{seedance-hCHDzDd5.js → seedance-BHv8zgWE.js}

@@ -1 +1 @@
-import{a as t}from"./vendor-axios-B8_nURbH.js";import{B as o}from"./index-Bk-O7L34.js";class n{async task(a,e){return await t.post("/seedance/tasks",{action:"retrieve",id:a},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${e.token}`,"x-record-exempt":"true"},baseURL:o})}async tasks(a,e){return await t.post("/seedance/tasks",{action:"retrieve_batch",...a.ids?{ids:a.ids}:{},...a.applicationId?{application_id:a.applicationId}:{},...a.userId?{user_id:a.userId}:{},...a.type?{type:a.type}:{},...a.limit!==void 0?{limit:a.limit}:{},...a.offset!==void 0?{offset:a.offset}:{},...a.createdAtMax!==void 0?{created_at_max:a.createdAtMax}:{},...a.createdAtMin!==void 0?{created_at_min:a.createdAtMin}:{}},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${e.token}`,"x-record-exempt":"true"},baseURL:o})}async generate(a,e){return await t.post("/seedance/videos",a,{headers:{authorization:`Bearer ${e.token}`,"content-type":"application/json",accept:"application/x-ndjson"},baseURL:o})}}const p=new n;export{p as s};
+import{a as t}from"./vendor-axios-B8_nURbH.js";import{B as o}from"./index-CnxV03kA.js";class n{async task(a,e){return await t.post("/seedance/tasks",{action:"retrieve",id:a},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${e.token}`,"x-record-exempt":"true"},baseURL:o})}async tasks(a,e){return await t.post("/seedance/tasks",{action:"retrieve_batch",...a.ids?{ids:a.ids}:{},...a.applicationId?{application_id:a.applicationId}:{},...a.userId?{user_id:a.userId}:{},...a.type?{type:a.type}:{},...a.limit!==void 0?{limit:a.limit}:{},...a.offset!==void 0?{offset:a.offset}:{},...a.createdAtMax!==void 0?{created_at_max:a.createdAtMax}:{},...a.createdAtMin!==void 0?{created_at_min:a.createdAtMin}:{}},{headers:{accept:"application/json","content-type":"application/json",authorization:`Bearer ${e.token}`,"x-record-exempt":"true"},baseURL:o})}async generate(a,e){return await t.post("/seedance/videos",a,{headers:{authorization:`Bearer ${e.token}`,"content-type":"application/json",accept:"application/x-ndjson"},baseURL:o})}}const p=new n;export{p as s};

package/dist/assets/{seedance-BOIOe4Kz.js → seedance-CT1bTq9V.js}

@@ -1 +1 @@
-const e={"name.seedanceBot":{message:"SeeDance 机器人",description:"SeeDance 视频生成器名称"},"name.prompt":{message:"提示词",description:"生成视频的提示词"},"description.prompt":{message:"描述你要生成的视频，可附加 SeeDance 参数（例如：--rs 720p --rt 16:9 --dur 5）。",description:"提示词输入说明"},"placeholder.prompt":{message:"描述你的视频…",description:"提示词占位符"},"name.model":{message:"模型",description:"模型选择标签"},"description.model":{message:"选择用于生成的 SeeDance 模型版本。",description:"模型选择说明"},"placeholder.select":{message:"选择",description:"下拉选择占位符"},"name.duration":{message:"时长",description:"视频时长选择标签"},"description.duration":{message:"视频时长（秒），范围 2-12 秒。",description:"视频时长说明"},"name.generateAudio":{message:"生成音频",description:"是否生成音频标签"},"description.generateAudio":{message:"开启后视频将附带音频。仅 seedance-1.5-pro 模型支持，费用约为 2 倍。",description:"生成音频说明"},"name.resolution":{message:"分辨率",description:"视频分辨率标签"},"model.seedance10pro":{message:"doubao-seedance-1.0-pro",description:"SeeDance 1.0 Pro 模型"},"model.seedance10proFast":{message:"doubao-seedance-1.0-pro-fast",description:"SeeDance 1.0 Pro Fast 模型"},"model.seedance15pro":{message:"doubao-seedance-1.5-pro",description:"SeeDance 1.5 Pro 模型"},"model.seedance10liteT2v":{message:"doubao-seedance-1.0-lite-t2v",description:"SeeDance 1.0 Lite T2V 模型"},"model.seedance10liteI2v":{message:"doubao-seedance-1.0-lite-i2v",description:"SeeDance 1.0 Lite I2V 模型"},"name.serviceTier":{message:"服务档位",description:"服务档位标签"},"description.serviceTier":{message:"处理档位：default 或 flex。",description:"服务档位说明"},"serviceTier.default":{message:"default",description:"默认档位"},"serviceTier.flex":{message:"flex",description:"弹性档位"},"name.returnLastFrame":{message:"返回尾帧",description:"返回尾帧开关标签"},"description.returnLastFrame":{message:"开启后会额外返回尾帧图片。",description:"返回尾帧说明"},"name.firstFrame":{message:"首帧图片",description:"首帧图片上传标签"},"description.firstFrame":{message:"可选。上传参考/首帧图片。",description:"首帧图片说明"},"name.lastFrame":{message:"尾帧图片",description:"尾帧图片上传标签"},"description.lastFrame":{message:"可选。上传尾帧图片（需要首帧）。",description:"尾帧图片说明"},"button.generate":{message:"生成",description:"生成按钮"},"button.upload":{message:"上传",description:"上传按钮"},"button.download":{message:"下载",description:"下载按钮"},"button.on":{message:"开",description:"开关开启文案"},"button.off":{message:"关",description:"开关关闭文案"},"message.startingTask":{message:"正在启动 SeeDance 任务…",description:"开始任务提示"},"message.startTaskSuccess":{message:"任务已启动",description:"开始任务成功提示"},"message.startTaskFailed":{message:"启动失败：",description:"开始任务失败提示"},"message.usedUp":{message:"额度已用完",description:"额度用尽提示"},"message.uploadExceed":{message:"最多只能上传 1 张图片",description:"上传超限提示"},"message.uploadError":{message:"上传失败",description:"上传失败提示"},"message.downloadVideo":{message:"下载视频",description:"下载视频提示"},"status.pending":{message:"排队中",description:"排队状态"},"status.processing":{message:"生成中",description:"生成中状态"},"name.taskId":{message:"任务 ID",description:"任务 ID 标签"},"name.traceId":{message:"Trace ID",description:"Trace ID 标签"},"name.failure":{message:"失败",description:"失败标签"},"name.failureReason":{message:"失败原因",description:"失败原因标签"},"name.status":{message:"状态",description:"状态标签"}};export{e as default};
+const e={"name.seedanceBot":{message:"SeeDance 机器人",description:"SeeDance 视频生成器名称"},"name.prompt":{message:"提示词",description:"生成视频的提示词"},"description.prompt":{message:"描述你要生成的视频，可附加 SeeDance 参数（例如：--rs 720p --rt 16:9 --dur 5）。",description:"提示词输入说明"},"placeholder.prompt":{message:"描述你的视频…",description:"提示词占位符"},"name.model":{message:"模型",description:"模型选择标签"},"description.model":{message:"选择用于生成的 SeeDance 模型版本。",description:"模型选择说明"},"placeholder.select":{message:"选择",description:"下拉选择占位符"},"name.duration":{message:"时长",description:"视频时长选择标签"},"description.duration":{message:"视频时长（秒），范围 2-12 秒。",description:"视频时长说明"},"name.generateAudio":{message:"生成音频",description:"是否生成音频标签"},"description.generateAudio":{message:"开启后视频将附带音频。仅 seedance-1.5-pro 模型支持，费用约为 2 倍。",description:"生成音频说明"},"name.resolution":{message:"分辨率",description:"视频分辨率标签"},"model.seedance10pro":{message:"doubao-seedance-1.0-pro",description:"SeeDance 1.0 Pro 模型"},"model.seedance10proFast":{message:"doubao-seedance-1.0-pro-fast",description:"SeeDance 1.0 Pro Fast 模型"},"model.seedance15pro":{message:"doubao-seedance-1.5-pro",description:"SeeDance 1.5 Pro 模型"},"model.seedance10liteT2v":{message:"doubao-seedance-1.0-lite-t2v",description:"SeeDance 1.0 Lite T2V 模型"},"model.seedance10liteI2v":{message:"doubao-seedance-1.0-lite-i2v",description:"SeeDance 1.0 Lite I2V 模型"},"name.serviceTier":{message:"服务档位",description:"服务档位标签"},"description.serviceTier":{message:"处理档位：default 或 flex。",description:"服务档位说明"},"serviceTier.default":{message:"default",description:"默认档位"},"serviceTier.flex":{message:"flex",description:"弹性档位"},"name.returnLastFrame":{message:"返回尾帧",description:"返回尾帧开关标签"},"description.returnLastFrame":{message:"开启后会额外返回尾帧图片。",description:"返回尾帧说明"},"name.firstFrame":{message:"首帧图片",description:"首帧图片上传标签"},"description.firstFrame":{message:"可选。上传参考/首帧图片。",description:"首帧图片说明"},"name.lastFrame":{message:"尾帧图片",description:"尾帧图片上传标签"},"description.lastFrame":{message:"可选。上传尾帧图片（需要首帧）。",description:"尾帧图片说明"},"button.generate":{message:"生成",description:"生成按钮"},"button.upload":{message:"上传",description:"上传按钮"},"button.download":{message:"下载",description:"下载按钮"},"button.on":{message:"开",description:"开关开启文案"},"button.off":{message:"关",description:"开关关闭文案"},"message.startingTask":{message:"正在启动 SeeDance 任务…",description:"开始任务提示"},"message.startTaskSuccess":{message:"任务已启动",description:"开始任务成功提示"},"message.startTaskFailed":{message:"启动失败：",description:"开始任务失败提示"},"message.usedUp":{message:"额度已用完",description:"额度用尽提示"},"message.uploadExceed":{message:"最多只能上传 1 张图片",description:"上传超限提示"},"message.uploadError":{message:"上传失败",description:"上传失败提示"},"message.downloadVideo":{message:"下载视频",description:"下载视频提示"},"status.pending":{message:"排队中",description:"排队状态"},"status.processing":{message:"生成中",description:"生成中状态"},"name.taskId":{message:"任务 ID",description:"任务 ID 标签"},"name.traceId":{message:"Trace ID",description:"Trace ID 标签"},"name.elapsed":{message:"耗时",description:"任务的耗时（秒）"},"name.failure":{message:"失败",description:"失败标签"},"name.failureReason":{message:"失败原因",description:"失败原因标签"},"name.status":{message:"状态",description:"状态标签"}};export{e as default};