npm - @dcl/governance-site - Versions diffs - 2.4.8-32879774365.commit-be046c1 → 2.5.0 - Mend

@dcl/governance-site 2.4.8-32879774365.commit-be046c1 → 2.5.0

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

Files changed (159) hide show

package/assets/{rpc-88212f5f.js → rpc-4fa5fbde.js} RENAMED Viewed

@@ -1,3 +1,3 @@
-import{B as c}from"./prepare-contract-call-71c94bc4.js";import{s as i}from"./to-serializable-transaction-0d73c48d.js";const L=s=>s,d=s=>s;class J extends c{constructor({body:e,cause:r,details:a,headers:n,status:u,url:l}){super("HTTP request failed.",{cause:r,details:a,metaMessages:[u&&`Status: ${u}`,`URL: ${d(l)}`,e&&`Request body: ${i(e)}`].filter(Boolean),name:"HttpRequestError"}),Object.defineProperty(this,"body",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"headers",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"status",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"url",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.body=e,this.headers=n,this.status=u,this.url=l}}class H extends c{constructor({body:e,cause:r,details:a,url:n}){super("WebSocket request failed.",{cause:r,details:a,metaMessages:[`URL: ${d(n)}`,e&&`Request body: ${i(e)}`].filter(Boolean),name:"WebSocketRequestError"})}}class W extends c{constructor({body:e,error:r,url:a}){super("RPC Request failed.",{cause:r,details:r.message,metaMessages:[`URL: ${d(a)}`,`Request body: ${i(e)}`],name:"RpcRequestError"}),Object.defineProperty(this,"code",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"data",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.code=r.code,this.data=r.data}}class F extends c{constructor({url:e}={}){super("The socket has been closed.",{metaMessages:[e&&`URL: ${d(e)}`].filter(Boolean),name:"SocketClosedError"})}}class z extends c{constructor({body:e,url:r}){super("The request took too long to respond.",{details:"The request timed out.",metaMessages:[`URL: ${d(r)}`,`Request body: ${i(e)}`],name:"TimeoutError"})}}const A=-1;class t extends c{constructor(e,{code:r,docsPath:a,metaMessages:n,name:u,shortMessage:l}){super(l,{cause:e,docsPath:a,metaMessages:n||(e==null?void 0:e.metaMessages),name:u||"RpcError"}),Object.defineProperty(this,"code",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.name=u||e.name,this.code=e instanceof W?e.code:r??A}}class o extends t{constructor(e,r){super(e,r),Object.defineProperty(this,"data",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.data=r.data}}class b extends t{constructor(e){super(e,{code:b.code,name:"ParseRpcError",shortMessage:"Invalid JSON was received by the server. An error occurred on the server while parsing the JSON text."})}}Object.defineProperty(b,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32700});class p extends t{constructor(e){super(e,{code:p.code,name:"InvalidRequestRpcError",shortMessage:"JSON is not a valid request object."})}}Object.defineProperty(p,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32600});class h extends t{constructor(e,{method:r}={}){super(e,{code:h.code,name:"MethodNotFoundRpcError",shortMessage:`The method${r?` "${r}"`:""} does not exist / is not available.`})}}Object.defineProperty(h,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32601});class m extends t{constructor(e){super(e,{code:m.code,name:"InvalidParamsRpcError",shortMessage:["Invalid parameters were provided to the RPC method.","Double check you have provided the correct parameters."].join(`
+import{B as c}from"./prepare-contract-call-ac31a985.js";import{s as i}from"./to-serializable-transaction-2ea802ff.js";const L=s=>s,d=s=>s;class J extends c{constructor({body:e,cause:r,details:a,headers:n,status:u,url:l}){super("HTTP request failed.",{cause:r,details:a,metaMessages:[u&&`Status: ${u}`,`URL: ${d(l)}`,e&&`Request body: ${i(e)}`].filter(Boolean),name:"HttpRequestError"}),Object.defineProperty(this,"body",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"headers",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"status",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"url",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.body=e,this.headers=n,this.status=u,this.url=l}}class H extends c{constructor({body:e,cause:r,details:a,url:n}){super("WebSocket request failed.",{cause:r,details:a,metaMessages:[`URL: ${d(n)}`,e&&`Request body: ${i(e)}`].filter(Boolean),name:"WebSocketRequestError"})}}class W extends c{constructor({body:e,error:r,url:a}){super("RPC Request failed.",{cause:r,details:r.message,metaMessages:[`URL: ${d(a)}`,`Request body: ${i(e)}`],name:"RpcRequestError"}),Object.defineProperty(this,"code",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"data",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.code=r.code,this.data=r.data}}class F extends c{constructor({url:e}={}){super("The socket has been closed.",{metaMessages:[e&&`URL: ${d(e)}`].filter(Boolean),name:"SocketClosedError"})}}class z extends c{constructor({body:e,url:r}){super("The request took too long to respond.",{details:"The request timed out.",metaMessages:[`URL: ${d(r)}`,`Request body: ${i(e)}`],name:"TimeoutError"})}}const A=-1;class t extends c{constructor(e,{code:r,docsPath:a,metaMessages:n,name:u,shortMessage:l}){super(l,{cause:e,docsPath:a,metaMessages:n||(e==null?void 0:e.metaMessages),name:u||"RpcError"}),Object.defineProperty(this,"code",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.name=u||e.name,this.code=e instanceof W?e.code:r??A}}class o extends t{constructor(e,r){super(e,r),Object.defineProperty(this,"data",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.data=r.data}}class b extends t{constructor(e){super(e,{code:b.code,name:"ParseRpcError",shortMessage:"Invalid JSON was received by the server. An error occurred on the server while parsing the JSON text."})}}Object.defineProperty(b,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32700});class p extends t{constructor(e){super(e,{code:p.code,name:"InvalidRequestRpcError",shortMessage:"JSON is not a valid request object."})}}Object.defineProperty(p,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32600});class h extends t{constructor(e,{method:r}={}){super(e,{code:h.code,name:"MethodNotFoundRpcError",shortMessage:`The method${r?` "${r}"`:""} does not exist / is not available.`})}}Object.defineProperty(h,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32601});class m extends t{constructor(e){super(e,{code:m.code,name:"InvalidParamsRpcError",shortMessage:["Invalid parameters were provided to the RPC method.","Double check you have provided the correct parameters."].join(`
 `)})}}Object.defineProperty(m,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32602});class f extends t{constructor(e){super(e,{code:f.code,name:"InternalRpcError",shortMessage:"An internal error was received."})}}Object.defineProperty(f,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32603});class g extends t{constructor(e){super(e,{code:g.code,name:"InvalidInputRpcError",shortMessage:["Missing or invalid parameters.","Double check you have provided the correct parameters."].join(`
 `)})}}Object.defineProperty(g,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32e3});class v extends t{constructor(e){super(e,{code:v.code,name:"ResourceNotFoundRpcError",shortMessage:"Requested resource not found."}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"ResourceNotFoundRpcError"})}}Object.defineProperty(v,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32001});class R extends t{constructor(e){super(e,{code:R.code,name:"ResourceUnavailableRpcError",shortMessage:"Requested resource not available."})}}Object.defineProperty(R,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32002});class w extends t{constructor(e){super(e,{code:w.code,name:"TransactionRejectedRpcError",shortMessage:"Transaction creation failed."})}}Object.defineProperty(w,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32003});class P extends t{constructor(e,{method:r}={}){super(e,{code:P.code,name:"MethodNotSupportedRpcError",shortMessage:`Method${r?` "${r}"`:""} is not supported.`})}}Object.defineProperty(P,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32004});class y extends t{constructor(e){super(e,{code:y.code,name:"LimitExceededRpcError",shortMessage:"Request exceeds defined limit."})}}Object.defineProperty(y,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32005});class E extends t{constructor(e){super(e,{code:E.code,name:"JsonRpcVersionUnsupportedError",shortMessage:"Version of JSON-RPC protocol is not supported."})}}Object.defineProperty(E,"code",{enumerable:!0,configurable:!0,writable:!0,value:-32006});class j extends o{constructor(e){super(e,{code:j.code,name:"UserRejectedRequestError",shortMessage:"User rejected the request."})}}Object.defineProperty(j,"code",{enumerable:!0,configurable:!0,writable:!0,value:4001});class x extends o{constructor(e){super(e,{code:x.code,name:"UnauthorizedProviderError",shortMessage:"The requested method and/or account has not been authorized by the user."})}}Object.defineProperty(x,"code",{enumerable:!0,configurable:!0,writable:!0,value:4100});class M extends o{constructor(e,{method:r}={}){super(e,{code:M.code,name:"UnsupportedProviderMethodError",shortMessage:`The Provider does not support the requested method${r?` " ${r}"`:""}.`})}}Object.defineProperty(M,"code",{enumerable:!0,configurable:!0,writable:!0,value:4200});class O extends o{constructor(e){super(e,{code:O.code,name:"ProviderDisconnectedError",shortMessage:"The Provider is disconnected from all chains."})}}Object.defineProperty(O,"code",{enumerable:!0,configurable:!0,writable:!0,value:4900});class q extends o{constructor(e){super(e,{code:q.code,name:"ChainDisconnectedError",shortMessage:"The Provider is not connected to the requested chain."})}}Object.defineProperty(q,"code",{enumerable:!0,configurable:!0,writable:!0,value:4901});class T extends o{constructor(e){super(e,{code:T.code,name:"SwitchChainError",shortMessage:"An error occurred when attempting to switch chain."})}}Object.defineProperty(T,"code",{enumerable:!0,configurable:!0,writable:!0,value:4902});class U extends o{constructor(e){super(e,{code:U.code,name:"UnsupportedNonOptionalCapabilityError",shortMessage:"This Wallet does not support a capability that was not marked as optional."})}}Object.defineProperty(U,"code",{enumerable:!0,configurable:!0,writable:!0,value:5700});class k extends o{constructor(e){super(e,{code:k.code,name:"UnsupportedChainIdError",shortMessage:"This Wallet does not support the requested chain ID."})}}Object.defineProperty(k,"code",{enumerable:!0,configurable:!0,writable:!0,value:5710});class $ extends o{constructor(e){super(e,{code:$.code,name:"DuplicateIdError",shortMessage:"There is already a bundle submitted with this ID."})}}Object.defineProperty($,"code",{enumerable:!0,configurable:!0,writable:!0,value:5720});class S extends o{constructor(e){super(e,{code:S.code,name:"UnknownBundleIdError",shortMessage:"This bundle id is unknown / has not been submitted"})}}Object.defineProperty(S,"code",{enumerable:!0,configurable:!0,writable:!0,value:5730});class C extends o{constructor(e){super(e,{code:C.code,name:"BundleTooLargeError",shortMessage:"The call bundle is too large for the Wallet to process."})}}Object.defineProperty(C,"code",{enumerable:!0,configurable:!0,writable:!0,value:5740});class I extends o{constructor(e){super(e,{code:I.code,name:"AtomicReadyWalletRejectedUpgradeError",shortMessage:"The Wallet can support atomicity after an upgrade, but the user rejected the upgrade."})}}Object.defineProperty(I,"code",{enumerable:!0,configurable:!0,writable:!0,value:5750});class N extends o{constructor(e){super(e,{code:N.code,name:"AtomicityNotSupportedError",shortMessage:"The wallet does not support atomic execution but the request requires it."})}}Object.defineProperty(N,"code",{enumerable:!0,configurable:!0,writable:!0,value:5760});class V extends t{constructor(e){super(e,{name:"UnknownRpcError",shortMessage:"An unknown RPC error occurred."})}}export{N as A,C as B,q as C,$ as D,J as H,f as I,E as J,y as L,h as M,b as P,W as R,T as S,z as T,j as U,H as W,F as a,w as b,I as c,g as d,m as e,p as f,d as g,P as h,O as i,o as j,v as k,R as l,t as m,x as n,S as o,V as p,k as q,U as r,M as s,L as t};

package/assets/{secp256k1-587cb837.js → secp256k1-2e39eaab.js} RENAMED Viewed

	@@ -1 +1 @@
1	- import{H as be,c as Pt,a as Nt,t as ye,b as Ze,w as Ve,r as W,d as ze,e as Me,f as Pe,g as pe}from"./index.es-963f2572.js";import"./index-5ade27e7.js";import"./index-847578c2.js";import"./index-accd8060.js";import"./index-2544b402.js";import"./index-6ab757a5.js";import"./index.es-66b1ce02.js";function je(t,n,e,r){if(typeof t.setBigUint64=="function")return t.setBigUint64(n,e,r);const o=BigInt(32),i=BigInt(4294967295),c=Number(e>>o&i),f=Number(e&i),s=r?4:0,u=r?0:4;t.setUint32(n+s,c,r),t.setUint32(n+u,f,r)}function Ke(t,n,e){return t&n^~t&e}function De(t,n,e){return t&n^t&e^n&e}class Ye extends be{constructor(n,e,r,o){super(),this.blockLen=n,this.outputLen=e,this.padOffset=r,this.isLE=o,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(n),this.view=Pt(this.buffer)}update(n){Nt(this);const{view:e,buffer:r,blockLen:o}=this;n=ye(n);const i=n.length;for(let c=0;c<i;){const f=Math.min(o-this.pos,i-c);if(f===o){const s=Pt(n);for(;o<=i-c;c+=o)this.process(s,c);continue}r.set(n.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===o&&(this.process(e,0),this.pos=0)}return this.length+=n.length,this.roundClean(),this}digestInto(n){Nt(this),Ze(n,this),this.finished=!0;const{buffer:e,view:r,blockLen:o,isLE:i}=this;let{pos:c}=this;e[c++]=128,this.buffer.subarray(c).fill(0),this.padOffset>o-c&&(this.process(r,0),c=0);for(let l=c;l<o;l++)e[l]=0;je(r,o-8,BigInt(this.length8),i),this.process(r,0);const f=Pt(n),s=this.outputLen;if(s%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const u=s/4,g=this.get();if(u>g.length)throw new Error("_sha2: outputLen bigger than state");for(let l=0;l<u;l++)f.setUint32(4l,g[l],i)}digest(){const{buffer:n,outputLen:e}=this;this.digestInto(n);const r=n.slice(0,e);return this.destroy(),r}_cloneInto(n){n\|\|(n=new this.constructor),n.set(...this.get());const{blockLen:e,buffer:r,length:o,finished:i,destroyed:c,pos:f}=this;return n.length=o,n.pos=f,n.finished=i,n.destroyed=c,o%e&&n.buffer.set(r),n}}const Ge=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]),et=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),nt=new Uint32Array(64);class We extends Ye{constructor(){super(64,32,8,!1),this.A=et[0]\|0,this.B=et[1]\|0,this.C=et[2]\|0,this.D=et[3]\|0,this.E=et[4]\|0,this.F=et[5]\|0,this.G=et[6]\|0,this.H=et[7]\|0}get(){const{A:n,B:e,C:r,D:o,E:i,F:c,G:f,H:s}=this;return[n,e,r,o,i,c,f,s]}set(n,e,r,o,i,c,f,s){this.A=n\|0,this.B=e\|0,this.C=r\|0,this.D=o\|0,this.E=i\|0,this.F=c\|0,this.G=f\|0,this.H=s\|0}process(n,e){for(let l=0;l<16;l++,e+=4)nt[l]=n.getUint32(e,!1);for(let l=16;l<64;l++){const d=nt[l-15],w=nt[l-2],B=W(d,7)^W(d,18)^d>>>3,y=W(w,17)^W(w,19)^w>>>10;nt[l]=y+nt[l-7]+B+nt[l-16]\|0}let{A:r,B:o,C:i,D:c,E:f,F:s,G:u,H:g}=this;for(let l=0;l<64;l++){const d=W(f,6)^W(f,11)^W(f,25),w=g+d+Ke(f,s,u)+Ge[l]+nt[l]\|0,y=(W(r,2)^W(r,13)^W(r,22))+De(r,o,i)\|0;g=u,u=s,s=f,f=c+w\|0,c=i,i=o,o=r,r=w+y\|0}r=r+this.A\|0,o=o+this.B\|0,i=i+this.C\|0,c=c+this.D\|0,f=f+this.E\|0,s=s+this.F\|0,u=u+this.G\|0,g=g+this.H\|0,this.set(r,o,i,c,f,s,u,g)}roundClean(){nt.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Ut=Ve(()=>new We);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const Ct=BigInt(0),kt=BigInt(1),$e=BigInt(2);function lt(t){return t instanceof Uint8Array\|\|ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function X(t){if(!lt(t))throw new Error("Uint8Array expected")}function bt(t,n){if(typeof n!="boolean")throw new Error(t+" boolean expected, got "+n)}const Xe=Array.from({length:256},(t,n)=>n.toString(16).padStart(2,"0"));function yt(t){X(t);let n="";for(let e=0;e<t.length;e++)n+=Xe[t[e]];return n}function wt(t){const n=t.toString(16);return n.length&1?"0"+n:n}function ee(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?Ct:BigInt("0x"+t)}const J={_0:48,_9:57,A:65,F:70,a:97,f:102};function ce(t){if(t>=J._0&&t<=J._9)return t-J._0;if(t>=J.A&&t<=J.F)return t-(J.A-10);if(t>=J.a&&t<=J.f)return t-(J.a-10)}function pt(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);const n=t.length,e=n/2;if(n%2)throw new Error("hex string expected, got unpadded hex of length "+n);const r=new Uint8Array(e);for(let o=0,i=0;o<e;o++,i+=2){const c=ce(t.charCodeAt(i)),f=ce(t.charCodeAt(i+1));if(c===void 0\|\|f===void 0){const s=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+s+'" at index '+i)}r[o]=c16+f}return r}function $(t){return ee(yt(t))}function ne(t){return X(t),ee(yt(Uint8Array.from(t).reverse()))}function st(t,n){return pt(t.toString(16).padStart(n2,"0"))}function re(t,n){return st(t,n).reverse()}function Qe(t){return pt(wt(t))}function V(t,n,e){let r;if(typeof n=="string")try{r=pt(n)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(lt(n))r=Uint8Array.from(n);else throw new Error(t+" must be hex string or Uint8Array");const o=r.length;if(typeof e=="number"&&o!==e)throw new Error(t+" of length "+e+" expected, got "+o);return r}function K(...t){let n=0;for(let r=0;r<t.length;r++){const o=t[r];X(o),n+=o.length}const e=new Uint8Array(n);for(let r=0,o=0;r<t.length;r++){const i=t[r];e.set(i,o),o+=i.length}return e}function Je(t,n){if(t.length!==n.length)return!1;let e=0;for(let r=0;r<t.length;r++)e\|=t[r]^n[r];return e===0}function Zt(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}const jt=t=>typeof t=="bigint"&&Ct<=t;function xt(t,n,e){return jt(t)&&jt(n)&&jt(e)&&n<=t&&t<e}function it(t,n,e,r){if(!xt(n,e,r))throw new Error("expected valid "+t+": "+e+" <= n < "+r+", got "+n)}function xe(t){let n;for(n=0;t>Ct;t>>=kt,n+=1);return n}function Fe(t,n){return t>>BigInt(n)&kt}function tn(t,n,e){return t\|(e?kt:Ct)<<BigInt(n)}const oe=t=>($e<<BigInt(t-1))-kt,Kt=t=>new Uint8Array(t),fe=t=>Uint8Array.from(t);function Ee(t,n,e){if(typeof t!="number"\|\|t<2)throw new Error("hashLen must be a number");if(typeof n!="number"\|\|n<2)throw new Error("qByteLen must be a number");if(typeof e!="function")throw new Error("hmacFn must be a function");let r=Kt(t),o=Kt(t),i=0;const c=()=>{r.fill(1),o.fill(0),i=0},f=(...l)=>e(o,r,...l),s=(l=Kt())=>{o=f(fe([0]),l),r=f(),l.length!==0&&(o=f(fe([1]),l),r=f())},u=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let l=0;const d=[];for(;l<n;){r=f();const w=r.slice();d.push(w),l+=r.length}return K(...d)};return(l,d)=>{c(),s(l);let w;for(;!(w=d(u()));)s();return c(),w}}const en={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"\|\|lt(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,n)=>n.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function Et(t,n,e={}){const r=(o,i,c)=>{const f=en[i];if(typeof f!="function")throw new Error("invalid validator function");const s=t[o];if(!(c&&s===void 0)&&!f(s,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+s)};for(const[o,i]of Object.entries(n))r(o,i,!1);for(const[o,i]of Object.entries(e))r(o,i,!0);return t}const nn=()=>{throw new Error("not implemented")};function Xt(t){const n=new WeakMap;return(e,...r)=>{const o=n.get(e);if(o!==void 0)return o;const i=t(e,...r);return n.set(e,i),i}}const rn=Object.freeze(Object.defineProperty({__proto__:null,aInRange:it,abool:bt,abytes:X,bitGet:Fe,bitLen:xe,bitMask:oe,bitSet:tn,bytesToHex:yt,bytesToNumberBE:$,bytesToNumberLE:ne,concatBytes:K,createHmacDrbg:Ee,ensureBytes:V,equalBytes:Je,hexToBytes:pt,hexToNumber:ee,inRange:xt,isBytes:lt,memoized:Xt,notImplemented:nn,numberToBytesBE:st,numberToBytesLE:re,numberToHexUnpadded:wt,numberToVarBytesBE:Qe,utf8ToBytes:Zt,validateObject:Et},Symbol.toStringTag,{value:"Module"}));class Be extends be{constructor(n,e){super(),this.finished=!1,this.destroyed=!1,ze(n);const r=ye(e);if(this.iHash=n.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,i=new Uint8Array(o);i.set(r.length>o?n.create().update(r).digest():r);for(let c=0;c<i.length;c++)i[c]^=54;this.iHash.update(i),this.oHash=n.create();for(let c=0;c<i.length;c++)i[c]^=106;this.oHash.update(i),i.fill(0)}update(n){return Nt(this),this.iHash.update(n),this}digestInto(n){Nt(this),Me(n,this.outputLen),this.finished=!0,this.iHash.digestInto(n),this.oHash.update(n),this.oHash.digestInto(n),this.destroy()}digest(){const n=new Uint8Array(this.oHash.outputLen);return this.digestInto(n),n}_cloneInto(n){n\|\|(n=Object.create(Object.getPrototypeOf(this),{}));const{oHash:e,iHash:r,finished:o,destroyed:i,blockLen:c,outputLen:f}=this;return n=n,n.finished=o,n.destroyed=i,n.blockLen=c,n.outputLen=f,n.oHash=e._cloneInto(n.oHash),n.iHash=r._cloneInto(n.iHash),n}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const ve=(t,n,e)=>new Be(t,n).update(e).digest();ve.create=(t,n)=>new Be(t,n);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const k=BigInt(0),H=BigInt(1),ut=BigInt(2),on=BigInt(3),Qt=BigInt(4),ae=BigInt(5),ue=BigInt(8);function C(t,n){const e=t%n;return e>=k?e:n+e}function sn(t,n,e){if(n<k)throw new Error("invalid exponent, negatives unsupported");if(e<=k)throw new Error("invalid modulus");if(e===H)return k;let r=H;for(;n>k;)n&H&&(r=rt%e),t=tt%e,n>>=H;return r}function D(t,n,e){let r=t;for(;n-- >k;)r=r,r%=e;return r}function Jt(t,n){if(t===k)throw new Error("invert: expected non-zero number");if(n<=k)throw new Error("invert: expected positive modulus, got "+n);let e=C(t,n),r=n,o=k,i=H;for(;e!==k;){const f=r/e,s=r%e,u=o-if;r=e,e=s,o=i,i=u}if(r!==H)throw new Error("invert: does not exist");return C(o,n)}function cn(t){const n=(t-H)/ut;let e,r,o;for(e=t-H,r=0;e%ut===k;e/=ut,r++);for(o=ut;o<t&&sn(o,n,t)!==t-H;o++)if(o>1e3)throw new Error("Cannot find square root: likely non-prime P");if(r===1){const c=(t+H)/Qt;return function(s,u){const g=s.pow(u,c);if(!s.eql(s.sqr(g),u))throw new Error("Cannot find square root");return g}}const i=(e+H)/ut;return function(f,s){if(f.pow(s,n)===f.neg(f.ONE))throw new Error("Cannot find square root");let u=r,g=f.pow(f.mul(f.ONE,o),e),l=f.pow(s,i),d=f.pow(s,e);for(;!f.eql(d,f.ONE);){if(f.eql(d,f.ZERO))return f.ZERO;let w=1;for(let y=f.sqr(d);w<u&&!f.eql(y,f.ONE);w++)y=f.sqr(y);const B=f.pow(g,H<<BigInt(u-w-1));g=f.sqr(B),l=f.mul(l,B),d=f.mul(d,g),u=w}return l}}function fn(t){if(t%Qt===on){const n=(t+H)/Qt;return function(r,o){const i=r.pow(o,n);if(!r.eql(r.sqr(i),o))throw new Error("Cannot find square root");return i}}if(t%ue===ae){const n=(t-ae)/ue;return function(r,o){const i=r.mul(o,ut),c=r.pow(i,n),f=r.mul(o,c),s=r.mul(r.mul(f,ut),c),u=r.mul(f,r.sub(s,r.ONE));if(!r.eql(r.sqr(u),o))throw new Error("Cannot find square root");return u}}return cn(t)}const an=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Se(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},e=an.reduce((r,o)=>(r[o]="function",r),n);return Et(t,e)}function un(t,n,e){if(e<k)throw new Error("invalid exponent, negatives unsupported");if(e===k)return t.ONE;if(e===H)return n;let r=t.ONE,o=n;for(;e>k;)e&H&&(r=t.mul(r,o)),o=t.sqr(o),e>>=H;return r}function ln(t,n){const e=new Array(n.length),r=n.reduce((i,c,f)=>t.is0(c)?i:(e[f]=i,t.mul(i,c)),t.ONE),o=t.inv(r);return n.reduceRight((i,c,f)=>t.is0(c)?i:(e[f]=t.mul(i,e[f]),t.mul(i,c)),o),e}function Ae(t,n){const e=n!==void 0?n:t.toString(2).length,r=Math.ceil(e/8);return{nBitLength:e,nByteLength:r}}function Ie(t,n,e=!1,r={}){if(t<=k)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:o,nByteLength:i}=Ae(t,n);if(i>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:t,isLE:e,BITS:o,BYTES:i,MASK:oe(o),ZERO:k,ONE:H,create:s=>C(s,t),isValid:s=>{if(typeof s!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof s);return k<=s&&s<t},is0:s=>s===k,isOdd:s=>(s&H)===H,neg:s=>C(-s,t),eql:(s,u)=>s===u,sqr:s=>C(ss,t),add:(s,u)=>C(s+u,t),sub:(s,u)=>C(s-u,t),mul:(s,u)=>C(su,t),pow:(s,u)=>un(f,s,u),div:(s,u)=>C(sJt(u,t),t),sqrN:s=>ss,addN:(s,u)=>s+u,subN:(s,u)=>s-u,mulN:(s,u)=>su,inv:s=>Jt(s,t),sqrt:r.sqrt\|\|(s=>(c\|\|(c=fn(t)),c(f,s))),invertBatch:s=>ln(f,s),cmov:(s,u,g)=>g?u:s,toBytes:s=>e?re(s,i):st(s,i),fromBytes:s=>{if(s.length!==i)throw new Error("Field.fromBytes: expected "+i+" bytes, got "+s.length);return e?ne(s):$(s)}});return Object.freeze(f)}function _e(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function qe(t){const n=_e(t);return n+Math.ceil(n/2)}function dn(t,n,e=!1){const r=t.length,o=_e(n),i=qe(n);if(r<16\|\|r<i\|\|r>1024)throw new Error("expected "+i+"-1024 bytes of input, got "+r);const c=e?ne(t):$(t),f=C(c,n-H)+H;return e?re(f,o):st(f,o)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const le=BigInt(0),Ot=BigInt(1);function Dt(t,n){const e=n.negate();return t?e:n}function Oe(t,n){if(!Number.isSafeInteger(t)\|\|t<=0\|\|t>n)throw new Error("invalid window size, expected [1.."+n+"], got W="+t)}function Yt(t,n){Oe(t,n);const e=Math.ceil(n/t)+1,r=2(t-1);return{windows:e,windowSize:r}}function hn(t,n){if(!Array.isArray(t))throw new Error("array expected");t.forEach((e,r)=>{if(!(e instanceof n))throw new Error("invalid point at index "+r)})}function gn(t,n){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((e,r)=>{if(!n.isValid(e))throw new Error("invalid scalar at index "+r)})}const Gt=new WeakMap,Ne=new WeakMap;function Wt(t){return Ne.get(t)\|\|1}function wn(t,n){return{constTimeNegate:Dt,hasPrecomputes(e){return Wt(e)!==1},unsafeLadder(e,r,o=t.ZERO){let i=e;for(;r>le;)r&Ot&&(o=o.add(i)),i=i.double(),r>>=Ot;return o},precomputeWindow(e,r){const{windows:o,windowSize:i}=Yt(r,n),c=[];let f=e,s=f;for(let u=0;u<o;u++){s=f,c.push(s);for(let g=1;g<i;g++)s=s.add(f),c.push(s);f=s.double()}return c},wNAF(e,r,o){const{windows:i,windowSize:c}=Yt(e,n);let f=t.ZERO,s=t.BASE;const u=BigInt(2e-1),g=2e,l=BigInt(e);for(let d=0;d<i;d++){const w=dc;let B=Number(o&u);o>>=l,B>c&&(B-=g,o+=Ot);const y=w,a=w+Math.abs(B)-1,h=d%2!==0,m=B<0;B===0?s=s.add(Dt(h,r[y])):f=f.add(Dt(m,r[a]))}return{p:f,f:s}},wNAFUnsafe(e,r,o,i=t.ZERO){const{windows:c,windowSize:f}=Yt(e,n),s=BigInt(2e-1),u=2e,g=BigInt(e);for(let l=0;l<c;l++){const d=lf;if(o===le)break;let w=Number(o&s);if(o>>=g,w>f&&(w-=u,o+=Ot),w===0)continue;let B=r[d+Math.abs(w)-1];w<0&&(B=B.negate()),i=i.add(B)}return i},getPrecomputes(e,r,o){let i=Gt.get(r);return i\|\|(i=this.precomputeWindow(r,e),e!==1&&Gt.set(r,o(i))),i},wNAFCached(e,r,o){const i=Wt(e);return this.wNAF(i,this.getPrecomputes(i,e,o),r)},wNAFCachedUnsafe(e,r,o,i){const c=Wt(e);return c===1?this.unsafeLadder(e,r,i):this.wNAFUnsafe(c,this.getPrecomputes(c,e,o),r,i)},setWindowSize(e,r){Oe(r,n),Ne.set(e,r),Gt.delete(e)}}}function mn(t,n,e,r){if(hn(e,t),gn(r,n),e.length!==r.length)throw new Error("arrays of points and scalars must have equal length");const o=t.ZERO,i=xe(BigInt(e.length)),c=i>12?i-3:i>4?i-2:i?2:1,f=(1<<c)-1,s=new Array(f+1).fill(o),u=Math.floor((n.BITS-1)/c)c;let g=o;for(let l=u;l>=0;l-=c){s.fill(o);for(let w=0;w<r.length;w++){const B=r[w],y=Number(B>>BigInt(l)&BigInt(f));s[y]=s[y].add(e[w])}let d=o;for(let w=s.length-1,B=o;w>0;w--)B=B.add(s[w]),d=d.add(B);if(g=g.add(d),l!==0)for(let w=0;w<c;w++)g=g.double()}return g}function Ue(t){return Se(t.Fp),Et(t,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Ae(t.n,t.nBitLength),...t,p:t.Fp.ORDER})}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function de(t){t.lowS!==void 0&&bt("lowS",t.lowS),t.prehash!==void 0&&bt("prehash",t.prehash)}function bn(t){const n=Ue(t);Et(n,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:e,Fp:r,a:o}=n;if(e){if(!r.eql(o,r.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof e!="object"\|\|typeof e.beta!="bigint"\|\|typeof e.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...n})}const{bytesToNumberBE:yn,hexToBytes:pn}=rn;class xn extends Error{constructor(n=""){super(n)}}const F={Err:xn,_tlv:{encode:(t,n)=>{const{Err:e}=F;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length&1)throw new e("tlv.encode: unpadded data");const r=n.length/2,o=wt(r);if(o.length/2&128)throw new e("tlv.encode: long form length too big");const i=r>127?wt(o.length/2\|128):"";return wt(t)+i+o+n},decode(t,n){const{Err:e}=F;let r=0;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length<2\|\|n[r++]!==t)throw new e("tlv.decode: wrong tlv");const o=n[r++],i=!!(o&128);let c=0;if(!i)c=o;else{const s=o&127;if(!s)throw new e("tlv.decode(long): indefinite length not supported");if(s>4)throw new e("tlv.decode(long): byte length is too big");const u=n.subarray(r,r+s);if(u.length!==s)throw new e("tlv.decode: length bytes not complete");if(u[0]===0)throw new e("tlv.decode(long): zero leftmost byte");for(const g of u)c=c<<8\|g;if(r+=s,c<128)throw new e("tlv.decode(long): not minimal encoding")}const f=n.subarray(r,r+c);if(f.length!==c)throw new e("tlv.decode: wrong value length");return{v:f,l:n.subarray(r+c)}}},_int:{encode(t){const{Err:n}=F;if(t<G)throw new n("integer: negative integers are not allowed");let e=wt(t);if(Number.parseInt(e[0],16)&8&&(e="00"+e),e.length&1)throw new n("unexpected DER parsing assertion: unpadded hex");return e},decode(t){const{Err:n}=F;if(t[0]&128)throw new n("invalid signature integer: negative");if(t[0]===0&&!(t[1]&128))throw new n("invalid signature integer: unnecessary leading zero");return yn(t)}},toSig(t){const{Err:n,_int:e,_tlv:r}=F,o=typeof t=="string"?pn(t):t;X(o);const{v:i,l:c}=r.decode(48,o);if(c.length)throw new n("invalid signature: left bytes after parsing");const{v:f,l:s}=r.decode(2,i),{v:u,l:g}=r.decode(2,s);if(g.length)throw new n("invalid signature: left bytes after parsing");return{r:e.decode(f),s:e.decode(u)}},hexFromSig(t){const{_tlv:n,_int:e}=F,r=n.encode(2,e.encode(t.r)),o=n.encode(2,e.encode(t.s)),i=r+o;return n.encode(48,i)}},G=BigInt(0),L=BigInt(1),rt=BigInt(2),Lt=BigInt(3),he=BigInt(4);function En(t){const n=bn(t),{Fp:e}=n,r=Ie(n.n,n.nBitLength),o=n.toBytes\|\|((y,a,h)=>{const m=a.toAffine();return K(Uint8Array.from([4]),e.toBytes(m.x),e.toBytes(m.y))}),i=n.fromBytes\|\|(y=>{const a=y.subarray(1),h=e.fromBytes(a.subarray(0,e.BYTES)),m=e.fromBytes(a.subarray(e.BYTES,2e.BYTES));return{x:h,y:m}});function c(y){const{a,b:h}=n,m=e.sqr(y),p=e.mul(m,y);return e.add(e.add(p,e.mul(y,a)),h)}if(!e.eql(e.sqr(n.Gy),c(n.Gx)))throw new Error("bad generator point: equation left != right");function f(y){return xt(y,L,n.n)}function s(y){const{allowedPrivateKeyLengths:a,nByteLength:h,wrapPrivateKey:m,n:p}=n;if(a&&typeof y!="bigint"){if(lt(y)&&(y=yt(y)),typeof y!="string"\|\|!a.includes(y.length))throw new Error("invalid private key");y=y.padStart(h2,"0")}let v;try{v=typeof y=="bigint"?y:$(V("private key",y,h))}catch{throw new Error("invalid private key, expected hex or "+h+" bytes, got "+typeof y)}return m&&(v=C(v,p)),it("private key",v,L,p),v}function u(y){if(!(y instanceof d))throw new Error("ProjectivePoint expected")}const g=Xt((y,a)=>{const{px:h,py:m,pz:p}=y;if(e.eql(p,e.ONE))return{x:h,y:m};const v=y.is0();a==null&&(a=v?e.ONE:e.inv(p));const O=e.mul(h,a),_=e.mul(m,a),S=e.mul(p,a);if(v)return{x:e.ZERO,y:e.ZERO};if(!e.eql(S,e.ONE))throw new Error("invZ was invalid");return{x:O,y:_}}),l=Xt(y=>{if(y.is0()){if(n.allowInfinityPoint&&!e.is0(y.py))return;throw new Error("bad point: ZERO")}const{x:a,y:h}=y.toAffine();if(!e.isValid(a)\|\|!e.isValid(h))throw new Error("bad point: x or y not FE");const m=e.sqr(h),p=c(a);if(!e.eql(m,p))throw new Error("bad point: equation left != right");if(!y.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class d{constructor(a,h,m){if(this.px=a,this.py=h,this.pz=m,a==null\|\|!e.isValid(a))throw new Error("x required");if(h==null\|\|!e.isValid(h))throw new Error("y required");if(m==null\|\|!e.isValid(m))throw new Error("z required");Object.freeze(this)}static fromAffine(a){const{x:h,y:m}=a\|\|{};if(!a\|\|!e.isValid(h)\|\|!e.isValid(m))throw new Error("invalid affine point");if(a instanceof d)throw new Error("projective point not allowed");const p=v=>e.eql(v,e.ZERO);return p(h)&&p(m)?d.ZERO:new d(h,m,e.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(a){const h=e.invertBatch(a.map(m=>m.pz));return a.map((m,p)=>m.toAffine(h[p])).map(d.fromAffine)}static fromHex(a){const h=d.fromAffine(i(V("pointHex",a)));return h.assertValidity(),h}static fromPrivateKey(a){return d.BASE.multiply(s(a))}static msm(a,h){return mn(d,r,a,h)}_setWindowSize(a){B.setWindowSize(this,a)}assertValidity(){l(this)}hasEvenY(){const{y:a}=this.toAffine();if(e.isOdd)return!e.isOdd(a);throw new Error("Field doesn't support isOdd")}equals(a){u(a);const{px:h,py:m,pz:p}=this,{px:v,py:O,pz:_}=a,S=e.eql(e.mul(h,_),e.mul(v,p)),I=e.eql(e.mul(m,_),e.mul(O,p));return S&&I}negate(){return new d(this.px,e.neg(this.py),this.pz)}double(){const{a,b:h}=n,m=e.mul(h,Lt),{px:p,py:v,pz:O}=this;let _=e.ZERO,S=e.ZERO,I=e.ZERO,A=e.mul(p,p),Z=e.mul(v,v),T=e.mul(O,O),U=e.mul(p,v);return U=e.add(U,U),I=e.mul(p,O),I=e.add(I,I),_=e.mul(a,I),S=e.mul(m,T),S=e.add(_,S),_=e.sub(Z,S),S=e.add(Z,S),S=e.mul(_,S),_=e.mul(U,_),I=e.mul(m,I),T=e.mul(a,T),U=e.sub(A,T),U=e.mul(a,U),U=e.add(U,I),I=e.add(A,A),A=e.add(I,A),A=e.add(A,T),A=e.mul(A,U),S=e.add(S,A),T=e.mul(v,O),T=e.add(T,T),A=e.mul(T,U),_=e.sub(_,A),I=e.mul(T,Z),I=e.add(I,I),I=e.add(I,I),new d(_,S,I)}add(a){u(a);const{px:h,py:m,pz:p}=this,{px:v,py:O,pz:_}=a;let S=e.ZERO,I=e.ZERO,A=e.ZERO;const Z=n.a,T=e.mul(n.b,Lt);let U=e.mul(h,v),j=e.mul(m,O),b=e.mul(p,_),x=e.add(h,m),E=e.add(v,O);x=e.mul(x,E),E=e.add(U,j),x=e.sub(x,E),E=e.add(h,p);let q=e.add(v,_);return E=e.mul(E,q),q=e.add(U,b),E=e.sub(E,q),q=e.add(m,p),S=e.add(O,_),q=e.mul(q,S),S=e.add(j,b),q=e.sub(q,S),A=e.mul(Z,E),S=e.mul(T,b),A=e.add(S,A),S=e.sub(j,A),A=e.add(j,A),I=e.mul(S,A),j=e.add(U,U),j=e.add(j,U),b=e.mul(Z,b),E=e.mul(T,E),j=e.add(j,b),b=e.sub(U,b),b=e.mul(Z,b),E=e.add(E,b),U=e.mul(j,E),I=e.add(I,U),U=e.mul(q,E),S=e.mul(x,S),S=e.sub(S,U),U=e.mul(x,j),A=e.mul(q,A),A=e.add(A,U),new d(S,I,A)}subtract(a){return this.add(a.negate())}is0(){return this.equals(d.ZERO)}wNAF(a){return B.wNAFCached(this,a,d.normalizeZ)}multiplyUnsafe(a){const{endo:h,n:m}=n;it("scalar",a,G,m);const p=d.ZERO;if(a===G)return p;if(this.is0()\|\|a===L)return this;if(!h\|\|B.hasPrecomputes(this))return B.wNAFCachedUnsafe(this,a,d.normalizeZ);let{k1neg:v,k1:O,k2neg:_,k2:S}=h.splitScalar(a),I=p,A=p,Z=this;for(;O>G\|\|S>G;)O&L&&(I=I.add(Z)),S&L&&(A=A.add(Z)),Z=Z.double(),O>>=L,S>>=L;return v&&(I=I.negate()),_&&(A=A.negate()),A=new d(e.mul(A.px,h.beta),A.py,A.pz),I.add(A)}multiply(a){const{endo:h,n:m}=n;it("scalar",a,L,m);let p,v;if(h){const{k1neg:O,k1:_,k2neg:S,k2:I}=h.splitScalar(a);let{p:A,f:Z}=this.wNAF(_),{p:T,f:U}=this.wNAF(I);A=B.constTimeNegate(O,A),T=B.constTimeNegate(S,T),T=new d(e.mul(T.px,h.beta),T.py,T.pz),p=A.add(T),v=Z.add(U)}else{const{p:O,f:_}=this.wNAF(a);p=O,v=_}return d.normalizeZ([p,v])[0]}multiplyAndAddUnsafe(a,h,m){const p=d.BASE,v=(_,S)=>S===G\|\|S===L\|\|!_.equals(p)?_.multiplyUnsafe(S):_.multiply(S),O=v(this,h).add(v(a,m));return O.is0()?void 0:O}toAffine(a){return g(this,a)}isTorsionFree(){const{h:a,isTorsionFree:h}=n;if(a===L)return!0;if(h)return h(d,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:a,clearCofactor:h}=n;return a===L?this:h?h(d,this):this.multiplyUnsafe(n.h)}toRawBytes(a=!0){return bt("isCompressed",a),this.assertValidity(),o(d,this,a)}toHex(a=!0){return bt("isCompressed",a),yt(this.toRawBytes(a))}}d.BASE=new d(n.Gx,n.Gy,e.ONE),d.ZERO=new d(e.ZERO,e.ONE,e.ZERO);const w=n.nBitLength,B=wn(d,n.endo?Math.ceil(w/2):w);return{CURVE:n,ProjectivePoint:d,normPrivateKeyToScalar:s,weierstrassEquation:c,isWithinCurveOrder:f}}function Bn(t){const n=Ue(t);return Et(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function vn(t){const n=Bn(t),{Fp:e,n:r}=n,o=e.BYTES+1,i=2e.BYTES+1;function c(b){return C(b,r)}function f(b){return Jt(b,r)}const{ProjectivePoint:s,normPrivateKeyToScalar:u,weierstrassEquation:g,isWithinCurveOrder:l}=En({...n,toBytes(b,x,E){const q=x.toAffine(),N=e.toBytes(q.x),R=K;return bt("isCompressed",E),E?R(Uint8Array.from([x.hasEvenY()?2:3]),N):R(Uint8Array.from([4]),N,e.toBytes(q.y))},fromBytes(b){const x=b.length,E=b[0],q=b.subarray(1);if(x===o&&(E===2\|\|E===3)){const N=$(q);if(!xt(N,L,e.ORDER))throw new Error("Point is not on curve");const R=g(N);let M;try{M=e.sqrt(R)}catch(Y){const P=Y instanceof Error?": "+Y.message:"";throw new Error("Point is not on curve"+P)}const z=(M&L)===L;return(E&1)===1!==z&&(M=e.neg(M)),{x:N,y:M}}else if(x===i&&E===4){const N=e.fromBytes(q.subarray(0,e.BYTES)),R=e.fromBytes(q.subarray(e.BYTES,2e.BYTES));return{x:N,y:R}}else{const N=o,R=i;throw new Error("invalid Point, expected length of "+N+", or uncompressed "+R+", got "+x)}}}),d=b=>yt(st(b,n.nByteLength));function w(b){const x=r>>L;return b>x}function B(b){return w(b)?c(-b):b}const y=(b,x,E)=>$(b.slice(x,E));class a{constructor(x,E,q){this.r=x,this.s=E,this.recovery=q,this.assertValidity()}static fromCompact(x){const E=n.nByteLength;return x=V("compactSignature",x,E2),new a(y(x,0,E),y(x,E,2E))}static fromDER(x){const{r:E,s:q}=F.toSig(V("DER",x));return new a(E,q)}assertValidity(){it("r",this.r,L,r),it("s",this.s,L,r)}addRecoveryBit(x){return new a(this.r,this.s,x)}recoverPublicKey(x){const{r:E,s:q,recovery:N}=this,R=_(V("msgHash",x));if(N==null\|\|![0,1,2,3].includes(N))throw new Error("recovery id invalid");const M=N===2\|\|N===3?E+n.n:E;if(M>=e.ORDER)throw new Error("recovery id 2 or 3 invalid");const z=N&1?"03":"02",Q=s.fromHex(z+d(M)),Y=f(M),P=c(-RY),dt=c(qY),tt=s.BASE.multiplyAndAddUnsafe(Q,P,dt);if(!tt)throw new Error("point at infinify");return tt.assertValidity(),tt}hasHighS(){return w(this.s)}normalizeS(){return this.hasHighS()?new a(this.r,c(-this.s),this.recovery):this}toDERRawBytes(){return pt(this.toDERHex())}toDERHex(){return F.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return pt(this.toCompactHex())}toCompactHex(){return d(this.r)+d(this.s)}}const h={isValidPrivateKey(b){try{return u(b),!0}catch{return!1}},normPrivateKeyToScalar:u,randomPrivateKey:()=>{const b=qe(n.n);return dn(n.randomBytes(b),n.n)},precompute(b=8,x=s.BASE){return x._setWindowSize(b),x.multiply(BigInt(3)),x}};function m(b,x=!0){return s.fromPrivateKey(b).toRawBytes(x)}function p(b){const x=lt(b),E=typeof b=="string",q=(x\|\|E)&&b.length;return x?q===o\|\|q===i:E?q===2o\|\|q===2i:b instanceof s}function v(b,x,E=!0){if(p(b))throw new Error("first arg must be private key");if(!p(x))throw new Error("second arg must be public key");return s.fromHex(x).multiply(u(b)).toRawBytes(E)}const O=n.bits2int\|\|function(b){if(b.length>8192)throw new Error("input is too large");const x=$(b),E=b.length8-n.nBitLength;return E>0?x>>BigInt(E):x},_=n.bits2int_modN\|\|function(b){return c(O(b))},S=oe(n.nBitLength);function I(b){return it("num < 2^"+n.nBitLength,b,G,S),st(b,n.nByteLength)}function A(b,x,E=Z){if(["recovered","canonical"].some(ft=>ft in E))throw new Error("sign() legacy options not supported");const{hash:q,randomBytes:N}=n;let{lowS:R,prehash:M,extraEntropy:z}=E;R==null&&(R=!0),b=V("msgHash",b),de(E),M&&(b=V("prehashed msgHash",q(b)));const Q=_(b),Y=u(x),P=[I(Y),I(Q)];if(z!=null&&z!==!1){const ft=z===!0?N(e.BYTES):z;P.push(V("extraEntropy",ft))}const dt=K(...P),tt=Q;function zt(ft){const ht=O(ft);if(!l(ht))return;const Mt=f(ht),Bt=s.BASE.multiply(ht).toAffine(),at=c(Bt.x);if(at===G)return;const vt=c(Mtc(tt+atY));if(vt===G)return;let St=(Bt.x===at?0:2)\|Number(Bt.y&L),gt=vt;return R&&w(vt)&&(gt=B(vt),St^=1),new a(at,gt,St)}return{seed:dt,k2sig:zt}}const Z={lowS:n.lowS,prehash:!1},T={lowS:n.lowS,prehash:!1};function U(b,x,E=Z){const{seed:q,k2sig:N}=A(b,x,E),R=n;return Ee(R.hash.outputLen,R.nByteLength,R.hmac)(q,N)}s.BASE._setWindowSize(8);function j(b,x,E,q=T){var St;const N=b;x=V("msgHash",x),E=V("publicKey",E);const{lowS:R,prehash:M,format:z}=q;if(de(q),"strict"in q)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 Q=typeof N=="string"\|\|lt(N),Y=!Q&&!z&&typeof N=="object"&&N!==null&&typeof N.r=="bigint"&&typeof N.s=="bigint";if(!Q&&!Y)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let P,dt;try{if(Y&&(P=new a(N.r,N.s)),Q){try{z!=="compact"&&(P=a.fromDER(N))}catch(gt){if(!(gt instanceof F.Err))throw gt}!P&&z!=="der"&&(P=a.fromCompact(N))}dt=s.fromHex(E)}catch{return!1}if(!P\|\|R&&P.hasHighS())return!1;M&&(x=n.hash(x));const{r:tt,s:zt}=P,ft=_(x),ht=f(zt),Mt=c(ftht),Bt=c(ttht),at=(St=s.BASE.multiplyAndAddUnsafe(dt,Mt,Bt))==null?void 0:St.toAffine();return at?c(at.x)===tt:!1}return{CURVE:n,getPublicKey:m,getSharedSecret:v,sign:U,verify:j,ProjectivePoint:s,Signature:a,utils:h}}function Sn(t,n){const e=t.ORDER;let r=G;for(let B=e-L;B%rt===G;B/=rt)r+=L;const o=r,i=rt<<o-L-L,c=irt,f=(e-L)/c,s=(f-L)/rt,u=c-L,g=i,l=t.pow(n,f),d=t.pow(n,(f+L)/rt);let w=(B,y)=>{let a=l,h=t.pow(y,u),m=t.sqr(h);m=t.mul(m,y);let p=t.mul(B,m);p=t.pow(p,s),p=t.mul(p,h),h=t.mul(p,y),m=t.mul(p,B);let v=t.mul(m,h);p=t.pow(v,g);let O=t.eql(p,t.ONE);h=t.mul(m,d),p=t.mul(v,a),m=t.cmov(h,m,O),v=t.cmov(p,v,O);for(let _=o;_>L;_--){let S=_-rt;S=rt<<S-L;let I=t.pow(v,S);const A=t.eql(I,t.ONE);h=t.mul(m,a),a=t.mul(a,a),I=t.mul(v,a),m=t.cmov(h,m,A),v=t.cmov(I,v,A)}return{isValid:O,value:m}};if(t.ORDER%he===Lt){const B=(t.ORDER-Lt)/he,y=t.sqrt(t.neg(n));w=(a,h)=>{let m=t.sqr(h);const p=t.mul(a,h);m=t.mul(m,p);let v=t.pow(m,B);v=t.mul(v,p);const O=t.mul(v,y),_=t.mul(t.sqr(v),h),S=t.eql(_,a);let I=t.cmov(O,v,S);return{isValid:S,value:I}}}return w}function An(t,n){if(Se(t),!t.isValid(n.A)\|\|!t.isValid(n.B)\|\|!t.isValid(n.Z))throw new Error("mapToCurveSimpleSWU: invalid opts");const e=Sn(t,n.Z);if(!t.isOdd)throw new Error("Fp.isOdd is not implemented!");return r=>{let o,i,c,f,s,u,g,l;o=t.sqr(r),o=t.mul(o,n.Z),i=t.sqr(o),i=t.add(i,o),c=t.add(i,t.ONE),c=t.mul(c,n.B),f=t.cmov(n.Z,t.neg(i),!t.eql(i,t.ZERO)),f=t.mul(f,n.A),i=t.sqr(c),u=t.sqr(f),s=t.mul(u,n.A),i=t.add(i,s),i=t.mul(i,c),u=t.mul(u,f),s=t.mul(u,n.B),i=t.add(i,s),g=t.mul(o,c);const{isValid:d,value:w}=e(i,u);l=t.mul(o,r),l=t.mul(l,w),g=t.cmov(g,c,d),l=t.cmov(l,w,d);const B=t.isOdd(r)===t.isOdd(l);return l=t.cmov(t.neg(l),l,B),g=t.div(g,f),{x:g,y:l}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function In(t){return{hash:t,hmac:(n,...e)=>ve(t,n,Pe(...e)),randomBytes:pe}}function _n(t,n){const e=r=>vn({...t,...In(r)});return{...e(n),create:e}}const qn=$;function ot(t,n){if(At(t),At(n),t<0\|\|t>=1<<8n)throw new Error("invalid I2OSP input: "+t);const e=Array.from({length:n}).fill(0);for(let r=n-1;r>=0;r--)e[r]=t&255,t>>>=8;return new Uint8Array(e)}function On(t,n){const e=new Uint8Array(t.length);for(let r=0;r<t.length;r++)e[r]=t[r]^n[r];return e}function At(t){if(!Number.isSafeInteger(t))throw new Error("number expected")}function Nn(t,n,e,r){X(t),X(n),At(e),n.length>255&&(n=r(K(Zt("H2C-OVERSIZE-DST-"),n)));const{outputLen:o,blockLen:i}=r,c=Math.ceil(e/o);if(e>65535\|\|c>255)throw new Error("expand_message_xmd: invalid lenInBytes");const f=K(n,ot(n.length,1)),s=ot(0,i),u=ot(e,2),g=new Array(c),l=r(K(s,t,u,ot(0,1),f));g[0]=r(K(l,ot(1,1),f));for(let w=1;w<=c;w++){const B=[On(l,g[w-1]),ot(w+1,1),f];g[w]=r(K(...B))}return K(...g).slice(0,e)}function Un(t,n,e,r,o){if(X(t),X(n),At(e),n.length>255){const i=Math.ceil(2r/8);n=o.create({dkLen:i}).update(Zt("H2C-OVERSIZE-DST-")).update(n).digest()}if(e>65535\|\|n.length>255)throw new Error("expand_message_xof: invalid lenInBytes");return o.create({dkLen:e}).update(t).update(ot(e,2)).update(n).update(ot(n.length,1)).digest()}function ge(t,n,e){Et(e,{DST:"stringOrUint8Array",p:"bigint",m:"isSafeInteger",k:"isSafeInteger",hash:"hash"});const{p:r,k:o,m:i,hash:c,expand:f,DST:s}=e;X(t),At(n);const u=typeof s=="string"?Zt(s):s,g=r.toString(2).length,l=Math.ceil((g+o)/8),d=nil;let w;if(f==="xmd")w=Nn(t,u,d,c);else if(f==="xof")w=Un(t,u,d,o,c);else if(f==="_internal_pass")w=t;else throw new Error('expand must be "xmd" or "xof"');const B=new Array(n);for(let y=0;y<n;y++){const a=new Array(i);for(let h=0;h<i;h++){const m=l(h+yi),p=w.subarray(m,m+l);a[h]=C(qn(p),r)}B[y]=a}return B}function Ln(t,n){const e=n.map(r=>Array.from(r).reverse());return(r,o)=>{const[i,c,f,s]=e.map(u=>u.reduce((g,l)=>t.add(t.mul(g,r),l)));return r=t.div(i,c),o=t.mul(o,t.div(f,s)),{x:r,y:o}}}function Tn(t,n,e){if(typeof n!="function")throw new Error("mapToCurve() must be defined");return{hashToCurve(r,o){const i=ge(r,2,{...e,DST:e.DST,...o}),c=t.fromAffine(n(i[0])),f=t.fromAffine(n(i[1])),s=c.add(f).clearCofactor();return s.assertValidity(),s},encodeToCurve(r,o){const i=ge(r,1,{...e,DST:e.encodeDST,...o}),c=t.fromAffine(n(i[0])).clearCofactor();return c.assertValidity(),c},mapToCurve(r){if(!Array.isArray(r))throw new Error("mapToCurve: expected array of bigints");for(const i of r)if(typeof i!="bigint")throw new Error("mapToCurve: expected array of bigints");const o=t.fromAffine(n(r)).clearCofactor();return o.assertValidity(),o}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const qt=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),Tt=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),It=BigInt(1),Ht=BigInt(2),we=(t,n)=>(t+n/Ht)/n;function Le(t){const n=qt,e=BigInt(3),r=BigInt(6),o=BigInt(11),i=BigInt(22),c=BigInt(23),f=BigInt(44),s=BigInt(88),u=ttt%n,g=uut%n,l=D(g,e,n)g%n,d=D(l,e,n)g%n,w=D(d,Ht,n)u%n,B=D(w,o,n)w%n,y=D(B,i,n)B%n,a=D(y,f,n)y%n,h=D(a,s,n)a%n,m=D(h,f,n)y%n,p=D(m,e,n)g%n,v=D(p,c,n)B%n,O=D(v,r,n)u%n,_=D(O,Ht,n);if(!ct.eql(ct.sqr(_),t))throw new Error("Cannot find square root");return _}const ct=Ie(qt,void 0,void 0,{sqrt:Le}),Vt=_n({a:BigInt(0),b:BigInt(7),Fp:ct,n:Tt,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const n=Tt,e=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-ItBigInt("0xe4437ed6010e88286f547fa90abfe4c3"),o=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),i=e,c=BigInt("0x100000000000000000000000000000000"),f=we(it,n),s=we(-rt,n);let u=C(t-fe-so,n),g=C(-fr-si,n);const l=u>c,d=g>c;if(l&&(u=n-u),d&&(g=n-g),u>c\|\|g>c)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:l,k1:u,k2neg:d,k2:g}}}},Ut),Te=BigInt(0),me={};function Rt(t,...n){let e=me[t];if(e===void 0){const r=Ut(Uint8Array.from(t,o=>o.charCodeAt(0)));e=K(r,r),me[t]=e}return Ut(K(e,...n))}const ie=t=>t.toRawBytes(!0).slice(1),Ft=t=>st(t,32),$t=t=>C(t,qt),_t=t=>C(t,Tt),se=Vt.ProjectivePoint,Hn=(t,n,e)=>se.BASE.multiplyAndAddUnsafe(t,n,e);function te(t){let n=Vt.utils.normPrivateKeyToScalar(t),e=se.fromPrivateKey(n);return{scalar:e.hasEvenY()?n:_t(-n),bytes:ie(e)}}function He(t){it("x",t,It,qt);const n=$t(tt),e=$t(nt+BigInt(7));let r=Le(e);r%Ht!==Te&&(r=$t(-r));const o=new se(t,r,It);return o.assertValidity(),o}const mt=$;function Re(...t){return _t(mt(Rt("BIP0340/challenge",...t)))}function Rn(t){return te(t).bytes}function Cn(t,n,e=pe(32)){const r=V("message",t),{bytes:o,scalar:i}=te(n),c=V("auxRand",e,32),f=Ft(i^mt(Rt("BIP0340/aux",c))),s=Rt("BIP0340/nonce",f,o,r),u=_t(mt(s));if(u===Te)throw new Error("sign failed: k is zero");const{bytes:g,scalar:l}=te(u),d=Re(g,o,r),w=new Uint8Array(64);if(w.set(g,0),w.set(Ft(_t(l+d*i)),32),!Ce(w,r,o))throw new Error("sign: Invalid signature produced");return w}function Ce(t,n,e){const r=V("signature",t,64),o=V("message",n),i=V("publicKey",e,32);try{const c=He(mt(i)),f=mt(r.subarray(0,32));if(!xt(f,It,qt))return!1;const s=mt(r.subarray(32,64));if(!xt(s,It,Tt))return!1;const u=Re(Ft(f),ie(c),o),g=Hn(c,s,_t(-u));return!(!g\|\|!g.hasEvenY()\|\|g.toAffine().x!==f)}catch{return!1}}const Yn=(()=>({getPublicKey:Rn,sign:Cn,verify:Ce,utils:{randomPrivateKey:Vt.utils.randomPrivateKey,lift_x:He,pointToBytes:ie,numberToBytesBE:st,bytesToNumberBE:$,taggedHash:Rt,mod:C}}))(),kn=(()=>Ln(ct,[["0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7","0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581","0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262","0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c"],["0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b","0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14","0x0000000000000000000000000000000000000000000000000000000000000001"],["0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c","0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3","0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931","0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84"],["0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b","0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573","0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f","0x0000000000000000000000000000000000000000000000000000000000000001"]].map(t=>t.map(n=>BigInt(n)))))(),Zn=(()=>An(ct,{A:BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),B:BigInt("1771"),Z:ct.create(BigInt("-11"))}))(),ke=(()=>Tn(Vt.ProjectivePoint,t=>{const{x:n,y:e}=Zn(ct.create(t[0]));return kn(n,e)},{DST:"secp256k1_XMD:SHA-256_SSWU_RO_",encodeDST:"secp256k1_XMD:SHA-256_SSWU_NU_",p:ct.ORDER,m:1,k:128,expand:"xmd",hash:Ut}))(),Gn=(()=>ke.hashToCurve)(),Wn=(()=>ke.encodeToCurve)();export{Wn as encodeToCurve,Gn as hashToCurve,Yn as schnorr,Vt as secp256k1};
1	+ import{H as be,c as Pt,a as Nt,t as ye,b as Ze,w as Ve,r as W,d as ze,e as Me,f as Pe,g as pe}from"./index.es-ce0aa5fd.js";import"./index-355751ab.js";import"./index-276c1c99.js";import"./index-accd8060.js";import"./index-2124b7cd.js";import"./index-6ab757a5.js";import"./index.es-ac60fff2.js";function je(t,n,e,r){if(typeof t.setBigUint64=="function")return t.setBigUint64(n,e,r);const o=BigInt(32),i=BigInt(4294967295),c=Number(e>>o&i),f=Number(e&i),s=r?4:0,u=r?0:4;t.setUint32(n+s,c,r),t.setUint32(n+u,f,r)}function Ke(t,n,e){return t&n^~t&e}function De(t,n,e){return t&n^t&e^n&e}class Ye extends be{constructor(n,e,r,o){super(),this.blockLen=n,this.outputLen=e,this.padOffset=r,this.isLE=o,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(n),this.view=Pt(this.buffer)}update(n){Nt(this);const{view:e,buffer:r,blockLen:o}=this;n=ye(n);const i=n.length;for(let c=0;c<i;){const f=Math.min(o-this.pos,i-c);if(f===o){const s=Pt(n);for(;o<=i-c;c+=o)this.process(s,c);continue}r.set(n.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===o&&(this.process(e,0),this.pos=0)}return this.length+=n.length,this.roundClean(),this}digestInto(n){Nt(this),Ze(n,this),this.finished=!0;const{buffer:e,view:r,blockLen:o,isLE:i}=this;let{pos:c}=this;e[c++]=128,this.buffer.subarray(c).fill(0),this.padOffset>o-c&&(this.process(r,0),c=0);for(let l=c;l<o;l++)e[l]=0;je(r,o-8,BigInt(this.length8),i),this.process(r,0);const f=Pt(n),s=this.outputLen;if(s%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const u=s/4,g=this.get();if(u>g.length)throw new Error("_sha2: outputLen bigger than state");for(let l=0;l<u;l++)f.setUint32(4l,g[l],i)}digest(){const{buffer:n,outputLen:e}=this;this.digestInto(n);const r=n.slice(0,e);return this.destroy(),r}_cloneInto(n){n\|\|(n=new this.constructor),n.set(...this.get());const{blockLen:e,buffer:r,length:o,finished:i,destroyed:c,pos:f}=this;return n.length=o,n.pos=f,n.finished=i,n.destroyed=c,o%e&&n.buffer.set(r),n}}const Ge=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]),et=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),nt=new Uint32Array(64);class We extends Ye{constructor(){super(64,32,8,!1),this.A=et[0]\|0,this.B=et[1]\|0,this.C=et[2]\|0,this.D=et[3]\|0,this.E=et[4]\|0,this.F=et[5]\|0,this.G=et[6]\|0,this.H=et[7]\|0}get(){const{A:n,B:e,C:r,D:o,E:i,F:c,G:f,H:s}=this;return[n,e,r,o,i,c,f,s]}set(n,e,r,o,i,c,f,s){this.A=n\|0,this.B=e\|0,this.C=r\|0,this.D=o\|0,this.E=i\|0,this.F=c\|0,this.G=f\|0,this.H=s\|0}process(n,e){for(let l=0;l<16;l++,e+=4)nt[l]=n.getUint32(e,!1);for(let l=16;l<64;l++){const d=nt[l-15],w=nt[l-2],B=W(d,7)^W(d,18)^d>>>3,y=W(w,17)^W(w,19)^w>>>10;nt[l]=y+nt[l-7]+B+nt[l-16]\|0}let{A:r,B:o,C:i,D:c,E:f,F:s,G:u,H:g}=this;for(let l=0;l<64;l++){const d=W(f,6)^W(f,11)^W(f,25),w=g+d+Ke(f,s,u)+Ge[l]+nt[l]\|0,y=(W(r,2)^W(r,13)^W(r,22))+De(r,o,i)\|0;g=u,u=s,s=f,f=c+w\|0,c=i,i=o,o=r,r=w+y\|0}r=r+this.A\|0,o=o+this.B\|0,i=i+this.C\|0,c=c+this.D\|0,f=f+this.E\|0,s=s+this.F\|0,u=u+this.G\|0,g=g+this.H\|0,this.set(r,o,i,c,f,s,u,g)}roundClean(){nt.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Ut=Ve(()=>new We);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const Ct=BigInt(0),kt=BigInt(1),$e=BigInt(2);function lt(t){return t instanceof Uint8Array\|\|ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function X(t){if(!lt(t))throw new Error("Uint8Array expected")}function bt(t,n){if(typeof n!="boolean")throw new Error(t+" boolean expected, got "+n)}const Xe=Array.from({length:256},(t,n)=>n.toString(16).padStart(2,"0"));function yt(t){X(t);let n="";for(let e=0;e<t.length;e++)n+=Xe[t[e]];return n}function wt(t){const n=t.toString(16);return n.length&1?"0"+n:n}function ee(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?Ct:BigInt("0x"+t)}const J={_0:48,_9:57,A:65,F:70,a:97,f:102};function ce(t){if(t>=J._0&&t<=J._9)return t-J._0;if(t>=J.A&&t<=J.F)return t-(J.A-10);if(t>=J.a&&t<=J.f)return t-(J.a-10)}function pt(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);const n=t.length,e=n/2;if(n%2)throw new Error("hex string expected, got unpadded hex of length "+n);const r=new Uint8Array(e);for(let o=0,i=0;o<e;o++,i+=2){const c=ce(t.charCodeAt(i)),f=ce(t.charCodeAt(i+1));if(c===void 0\|\|f===void 0){const s=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+s+'" at index '+i)}r[o]=c16+f}return r}function $(t){return ee(yt(t))}function ne(t){return X(t),ee(yt(Uint8Array.from(t).reverse()))}function st(t,n){return pt(t.toString(16).padStart(n2,"0"))}function re(t,n){return st(t,n).reverse()}function Qe(t){return pt(wt(t))}function V(t,n,e){let r;if(typeof n=="string")try{r=pt(n)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(lt(n))r=Uint8Array.from(n);else throw new Error(t+" must be hex string or Uint8Array");const o=r.length;if(typeof e=="number"&&o!==e)throw new Error(t+" of length "+e+" expected, got "+o);return r}function K(...t){let n=0;for(let r=0;r<t.length;r++){const o=t[r];X(o),n+=o.length}const e=new Uint8Array(n);for(let r=0,o=0;r<t.length;r++){const i=t[r];e.set(i,o),o+=i.length}return e}function Je(t,n){if(t.length!==n.length)return!1;let e=0;for(let r=0;r<t.length;r++)e\|=t[r]^n[r];return e===0}function Zt(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}const jt=t=>typeof t=="bigint"&&Ct<=t;function xt(t,n,e){return jt(t)&&jt(n)&&jt(e)&&n<=t&&t<e}function it(t,n,e,r){if(!xt(n,e,r))throw new Error("expected valid "+t+": "+e+" <= n < "+r+", got "+n)}function xe(t){let n;for(n=0;t>Ct;t>>=kt,n+=1);return n}function Fe(t,n){return t>>BigInt(n)&kt}function tn(t,n,e){return t\|(e?kt:Ct)<<BigInt(n)}const oe=t=>($e<<BigInt(t-1))-kt,Kt=t=>new Uint8Array(t),fe=t=>Uint8Array.from(t);function Ee(t,n,e){if(typeof t!="number"\|\|t<2)throw new Error("hashLen must be a number");if(typeof n!="number"\|\|n<2)throw new Error("qByteLen must be a number");if(typeof e!="function")throw new Error("hmacFn must be a function");let r=Kt(t),o=Kt(t),i=0;const c=()=>{r.fill(1),o.fill(0),i=0},f=(...l)=>e(o,r,...l),s=(l=Kt())=>{o=f(fe([0]),l),r=f(),l.length!==0&&(o=f(fe([1]),l),r=f())},u=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let l=0;const d=[];for(;l<n;){r=f();const w=r.slice();d.push(w),l+=r.length}return K(...d)};return(l,d)=>{c(),s(l);let w;for(;!(w=d(u()));)s();return c(),w}}const en={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"\|\|lt(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,n)=>n.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function Et(t,n,e={}){const r=(o,i,c)=>{const f=en[i];if(typeof f!="function")throw new Error("invalid validator function");const s=t[o];if(!(c&&s===void 0)&&!f(s,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+s)};for(const[o,i]of Object.entries(n))r(o,i,!1);for(const[o,i]of Object.entries(e))r(o,i,!0);return t}const nn=()=>{throw new Error("not implemented")};function Xt(t){const n=new WeakMap;return(e,...r)=>{const o=n.get(e);if(o!==void 0)return o;const i=t(e,...r);return n.set(e,i),i}}const rn=Object.freeze(Object.defineProperty({__proto__:null,aInRange:it,abool:bt,abytes:X,bitGet:Fe,bitLen:xe,bitMask:oe,bitSet:tn,bytesToHex:yt,bytesToNumberBE:$,bytesToNumberLE:ne,concatBytes:K,createHmacDrbg:Ee,ensureBytes:V,equalBytes:Je,hexToBytes:pt,hexToNumber:ee,inRange:xt,isBytes:lt,memoized:Xt,notImplemented:nn,numberToBytesBE:st,numberToBytesLE:re,numberToHexUnpadded:wt,numberToVarBytesBE:Qe,utf8ToBytes:Zt,validateObject:Et},Symbol.toStringTag,{value:"Module"}));class Be extends be{constructor(n,e){super(),this.finished=!1,this.destroyed=!1,ze(n);const r=ye(e);if(this.iHash=n.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,i=new Uint8Array(o);i.set(r.length>o?n.create().update(r).digest():r);for(let c=0;c<i.length;c++)i[c]^=54;this.iHash.update(i),this.oHash=n.create();for(let c=0;c<i.length;c++)i[c]^=106;this.oHash.update(i),i.fill(0)}update(n){return Nt(this),this.iHash.update(n),this}digestInto(n){Nt(this),Me(n,this.outputLen),this.finished=!0,this.iHash.digestInto(n),this.oHash.update(n),this.oHash.digestInto(n),this.destroy()}digest(){const n=new Uint8Array(this.oHash.outputLen);return this.digestInto(n),n}_cloneInto(n){n\|\|(n=Object.create(Object.getPrototypeOf(this),{}));const{oHash:e,iHash:r,finished:o,destroyed:i,blockLen:c,outputLen:f}=this;return n=n,n.finished=o,n.destroyed=i,n.blockLen=c,n.outputLen=f,n.oHash=e._cloneInto(n.oHash),n.iHash=r._cloneInto(n.iHash),n}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const ve=(t,n,e)=>new Be(t,n).update(e).digest();ve.create=(t,n)=>new Be(t,n);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const k=BigInt(0),H=BigInt(1),ut=BigInt(2),on=BigInt(3),Qt=BigInt(4),ae=BigInt(5),ue=BigInt(8);function C(t,n){const e=t%n;return e>=k?e:n+e}function sn(t,n,e){if(n<k)throw new Error("invalid exponent, negatives unsupported");if(e<=k)throw new Error("invalid modulus");if(e===H)return k;let r=H;for(;n>k;)n&H&&(r=rt%e),t=tt%e,n>>=H;return r}function D(t,n,e){let r=t;for(;n-- >k;)r=r,r%=e;return r}function Jt(t,n){if(t===k)throw new Error("invert: expected non-zero number");if(n<=k)throw new Error("invert: expected positive modulus, got "+n);let e=C(t,n),r=n,o=k,i=H;for(;e!==k;){const f=r/e,s=r%e,u=o-if;r=e,e=s,o=i,i=u}if(r!==H)throw new Error("invert: does not exist");return C(o,n)}function cn(t){const n=(t-H)/ut;let e,r,o;for(e=t-H,r=0;e%ut===k;e/=ut,r++);for(o=ut;o<t&&sn(o,n,t)!==t-H;o++)if(o>1e3)throw new Error("Cannot find square root: likely non-prime P");if(r===1){const c=(t+H)/Qt;return function(s,u){const g=s.pow(u,c);if(!s.eql(s.sqr(g),u))throw new Error("Cannot find square root");return g}}const i=(e+H)/ut;return function(f,s){if(f.pow(s,n)===f.neg(f.ONE))throw new Error("Cannot find square root");let u=r,g=f.pow(f.mul(f.ONE,o),e),l=f.pow(s,i),d=f.pow(s,e);for(;!f.eql(d,f.ONE);){if(f.eql(d,f.ZERO))return f.ZERO;let w=1;for(let y=f.sqr(d);w<u&&!f.eql(y,f.ONE);w++)y=f.sqr(y);const B=f.pow(g,H<<BigInt(u-w-1));g=f.sqr(B),l=f.mul(l,B),d=f.mul(d,g),u=w}return l}}function fn(t){if(t%Qt===on){const n=(t+H)/Qt;return function(r,o){const i=r.pow(o,n);if(!r.eql(r.sqr(i),o))throw new Error("Cannot find square root");return i}}if(t%ue===ae){const n=(t-ae)/ue;return function(r,o){const i=r.mul(o,ut),c=r.pow(i,n),f=r.mul(o,c),s=r.mul(r.mul(f,ut),c),u=r.mul(f,r.sub(s,r.ONE));if(!r.eql(r.sqr(u),o))throw new Error("Cannot find square root");return u}}return cn(t)}const an=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Se(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},e=an.reduce((r,o)=>(r[o]="function",r),n);return Et(t,e)}function un(t,n,e){if(e<k)throw new Error("invalid exponent, negatives unsupported");if(e===k)return t.ONE;if(e===H)return n;let r=t.ONE,o=n;for(;e>k;)e&H&&(r=t.mul(r,o)),o=t.sqr(o),e>>=H;return r}function ln(t,n){const e=new Array(n.length),r=n.reduce((i,c,f)=>t.is0(c)?i:(e[f]=i,t.mul(i,c)),t.ONE),o=t.inv(r);return n.reduceRight((i,c,f)=>t.is0(c)?i:(e[f]=t.mul(i,e[f]),t.mul(i,c)),o),e}function Ae(t,n){const e=n!==void 0?n:t.toString(2).length,r=Math.ceil(e/8);return{nBitLength:e,nByteLength:r}}function Ie(t,n,e=!1,r={}){if(t<=k)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:o,nByteLength:i}=Ae(t,n);if(i>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:t,isLE:e,BITS:o,BYTES:i,MASK:oe(o),ZERO:k,ONE:H,create:s=>C(s,t),isValid:s=>{if(typeof s!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof s);return k<=s&&s<t},is0:s=>s===k,isOdd:s=>(s&H)===H,neg:s=>C(-s,t),eql:(s,u)=>s===u,sqr:s=>C(ss,t),add:(s,u)=>C(s+u,t),sub:(s,u)=>C(s-u,t),mul:(s,u)=>C(su,t),pow:(s,u)=>un(f,s,u),div:(s,u)=>C(sJt(u,t),t),sqrN:s=>ss,addN:(s,u)=>s+u,subN:(s,u)=>s-u,mulN:(s,u)=>su,inv:s=>Jt(s,t),sqrt:r.sqrt\|\|(s=>(c\|\|(c=fn(t)),c(f,s))),invertBatch:s=>ln(f,s),cmov:(s,u,g)=>g?u:s,toBytes:s=>e?re(s,i):st(s,i),fromBytes:s=>{if(s.length!==i)throw new Error("Field.fromBytes: expected "+i+" bytes, got "+s.length);return e?ne(s):$(s)}});return Object.freeze(f)}function _e(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function qe(t){const n=_e(t);return n+Math.ceil(n/2)}function dn(t,n,e=!1){const r=t.length,o=_e(n),i=qe(n);if(r<16\|\|r<i\|\|r>1024)throw new Error("expected "+i+"-1024 bytes of input, got "+r);const c=e?ne(t):$(t),f=C(c,n-H)+H;return e?re(f,o):st(f,o)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const le=BigInt(0),Ot=BigInt(1);function Dt(t,n){const e=n.negate();return t?e:n}function Oe(t,n){if(!Number.isSafeInteger(t)\|\|t<=0\|\|t>n)throw new Error("invalid window size, expected [1.."+n+"], got W="+t)}function Yt(t,n){Oe(t,n);const e=Math.ceil(n/t)+1,r=2(t-1);return{windows:e,windowSize:r}}function hn(t,n){if(!Array.isArray(t))throw new Error("array expected");t.forEach((e,r)=>{if(!(e instanceof n))throw new Error("invalid point at index "+r)})}function gn(t,n){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((e,r)=>{if(!n.isValid(e))throw new Error("invalid scalar at index "+r)})}const Gt=new WeakMap,Ne=new WeakMap;function Wt(t){return Ne.get(t)\|\|1}function wn(t,n){return{constTimeNegate:Dt,hasPrecomputes(e){return Wt(e)!==1},unsafeLadder(e,r,o=t.ZERO){let i=e;for(;r>le;)r&Ot&&(o=o.add(i)),i=i.double(),r>>=Ot;return o},precomputeWindow(e,r){const{windows:o,windowSize:i}=Yt(r,n),c=[];let f=e,s=f;for(let u=0;u<o;u++){s=f,c.push(s);for(let g=1;g<i;g++)s=s.add(f),c.push(s);f=s.double()}return c},wNAF(e,r,o){const{windows:i,windowSize:c}=Yt(e,n);let f=t.ZERO,s=t.BASE;const u=BigInt(2e-1),g=2e,l=BigInt(e);for(let d=0;d<i;d++){const w=dc;let B=Number(o&u);o>>=l,B>c&&(B-=g,o+=Ot);const y=w,a=w+Math.abs(B)-1,h=d%2!==0,m=B<0;B===0?s=s.add(Dt(h,r[y])):f=f.add(Dt(m,r[a]))}return{p:f,f:s}},wNAFUnsafe(e,r,o,i=t.ZERO){const{windows:c,windowSize:f}=Yt(e,n),s=BigInt(2e-1),u=2e,g=BigInt(e);for(let l=0;l<c;l++){const d=lf;if(o===le)break;let w=Number(o&s);if(o>>=g,w>f&&(w-=u,o+=Ot),w===0)continue;let B=r[d+Math.abs(w)-1];w<0&&(B=B.negate()),i=i.add(B)}return i},getPrecomputes(e,r,o){let i=Gt.get(r);return i\|\|(i=this.precomputeWindow(r,e),e!==1&&Gt.set(r,o(i))),i},wNAFCached(e,r,o){const i=Wt(e);return this.wNAF(i,this.getPrecomputes(i,e,o),r)},wNAFCachedUnsafe(e,r,o,i){const c=Wt(e);return c===1?this.unsafeLadder(e,r,i):this.wNAFUnsafe(c,this.getPrecomputes(c,e,o),r,i)},setWindowSize(e,r){Oe(r,n),Ne.set(e,r),Gt.delete(e)}}}function mn(t,n,e,r){if(hn(e,t),gn(r,n),e.length!==r.length)throw new Error("arrays of points and scalars must have equal length");const o=t.ZERO,i=xe(BigInt(e.length)),c=i>12?i-3:i>4?i-2:i?2:1,f=(1<<c)-1,s=new Array(f+1).fill(o),u=Math.floor((n.BITS-1)/c)c;let g=o;for(let l=u;l>=0;l-=c){s.fill(o);for(let w=0;w<r.length;w++){const B=r[w],y=Number(B>>BigInt(l)&BigInt(f));s[y]=s[y].add(e[w])}let d=o;for(let w=s.length-1,B=o;w>0;w--)B=B.add(s[w]),d=d.add(B);if(g=g.add(d),l!==0)for(let w=0;w<c;w++)g=g.double()}return g}function Ue(t){return Se(t.Fp),Et(t,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Ae(t.n,t.nBitLength),...t,p:t.Fp.ORDER})}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function de(t){t.lowS!==void 0&&bt("lowS",t.lowS),t.prehash!==void 0&&bt("prehash",t.prehash)}function bn(t){const n=Ue(t);Et(n,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:e,Fp:r,a:o}=n;if(e){if(!r.eql(o,r.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof e!="object"\|\|typeof e.beta!="bigint"\|\|typeof e.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...n})}const{bytesToNumberBE:yn,hexToBytes:pn}=rn;class xn extends Error{constructor(n=""){super(n)}}const F={Err:xn,_tlv:{encode:(t,n)=>{const{Err:e}=F;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length&1)throw new e("tlv.encode: unpadded data");const r=n.length/2,o=wt(r);if(o.length/2&128)throw new e("tlv.encode: long form length too big");const i=r>127?wt(o.length/2\|128):"";return wt(t)+i+o+n},decode(t,n){const{Err:e}=F;let r=0;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length<2\|\|n[r++]!==t)throw new e("tlv.decode: wrong tlv");const o=n[r++],i=!!(o&128);let c=0;if(!i)c=o;else{const s=o&127;if(!s)throw new e("tlv.decode(long): indefinite length not supported");if(s>4)throw new e("tlv.decode(long): byte length is too big");const u=n.subarray(r,r+s);if(u.length!==s)throw new e("tlv.decode: length bytes not complete");if(u[0]===0)throw new e("tlv.decode(long): zero leftmost byte");for(const g of u)c=c<<8\|g;if(r+=s,c<128)throw new e("tlv.decode(long): not minimal encoding")}const f=n.subarray(r,r+c);if(f.length!==c)throw new e("tlv.decode: wrong value length");return{v:f,l:n.subarray(r+c)}}},_int:{encode(t){const{Err:n}=F;if(t<G)throw new n("integer: negative integers are not allowed");let e=wt(t);if(Number.parseInt(e[0],16)&8&&(e="00"+e),e.length&1)throw new n("unexpected DER parsing assertion: unpadded hex");return e},decode(t){const{Err:n}=F;if(t[0]&128)throw new n("invalid signature integer: negative");if(t[0]===0&&!(t[1]&128))throw new n("invalid signature integer: unnecessary leading zero");return yn(t)}},toSig(t){const{Err:n,_int:e,_tlv:r}=F,o=typeof t=="string"?pn(t):t;X(o);const{v:i,l:c}=r.decode(48,o);if(c.length)throw new n("invalid signature: left bytes after parsing");const{v:f,l:s}=r.decode(2,i),{v:u,l:g}=r.decode(2,s);if(g.length)throw new n("invalid signature: left bytes after parsing");return{r:e.decode(f),s:e.decode(u)}},hexFromSig(t){const{_tlv:n,_int:e}=F,r=n.encode(2,e.encode(t.r)),o=n.encode(2,e.encode(t.s)),i=r+o;return n.encode(48,i)}},G=BigInt(0),L=BigInt(1),rt=BigInt(2),Lt=BigInt(3),he=BigInt(4);function En(t){const n=bn(t),{Fp:e}=n,r=Ie(n.n,n.nBitLength),o=n.toBytes\|\|((y,a,h)=>{const m=a.toAffine();return K(Uint8Array.from([4]),e.toBytes(m.x),e.toBytes(m.y))}),i=n.fromBytes\|\|(y=>{const a=y.subarray(1),h=e.fromBytes(a.subarray(0,e.BYTES)),m=e.fromBytes(a.subarray(e.BYTES,2e.BYTES));return{x:h,y:m}});function c(y){const{a,b:h}=n,m=e.sqr(y),p=e.mul(m,y);return e.add(e.add(p,e.mul(y,a)),h)}if(!e.eql(e.sqr(n.Gy),c(n.Gx)))throw new Error("bad generator point: equation left != right");function f(y){return xt(y,L,n.n)}function s(y){const{allowedPrivateKeyLengths:a,nByteLength:h,wrapPrivateKey:m,n:p}=n;if(a&&typeof y!="bigint"){if(lt(y)&&(y=yt(y)),typeof y!="string"\|\|!a.includes(y.length))throw new Error("invalid private key");y=y.padStart(h2,"0")}let v;try{v=typeof y=="bigint"?y:$(V("private key",y,h))}catch{throw new Error("invalid private key, expected hex or "+h+" bytes, got "+typeof y)}return m&&(v=C(v,p)),it("private key",v,L,p),v}function u(y){if(!(y instanceof d))throw new Error("ProjectivePoint expected")}const g=Xt((y,a)=>{const{px:h,py:m,pz:p}=y;if(e.eql(p,e.ONE))return{x:h,y:m};const v=y.is0();a==null&&(a=v?e.ONE:e.inv(p));const O=e.mul(h,a),_=e.mul(m,a),S=e.mul(p,a);if(v)return{x:e.ZERO,y:e.ZERO};if(!e.eql(S,e.ONE))throw new Error("invZ was invalid");return{x:O,y:_}}),l=Xt(y=>{if(y.is0()){if(n.allowInfinityPoint&&!e.is0(y.py))return;throw new Error("bad point: ZERO")}const{x:a,y:h}=y.toAffine();if(!e.isValid(a)\|\|!e.isValid(h))throw new Error("bad point: x or y not FE");const m=e.sqr(h),p=c(a);if(!e.eql(m,p))throw new Error("bad point: equation left != right");if(!y.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class d{constructor(a,h,m){if(this.px=a,this.py=h,this.pz=m,a==null\|\|!e.isValid(a))throw new Error("x required");if(h==null\|\|!e.isValid(h))throw new Error("y required");if(m==null\|\|!e.isValid(m))throw new Error("z required");Object.freeze(this)}static fromAffine(a){const{x:h,y:m}=a\|\|{};if(!a\|\|!e.isValid(h)\|\|!e.isValid(m))throw new Error("invalid affine point");if(a instanceof d)throw new Error("projective point not allowed");const p=v=>e.eql(v,e.ZERO);return p(h)&&p(m)?d.ZERO:new d(h,m,e.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(a){const h=e.invertBatch(a.map(m=>m.pz));return a.map((m,p)=>m.toAffine(h[p])).map(d.fromAffine)}static fromHex(a){const h=d.fromAffine(i(V("pointHex",a)));return h.assertValidity(),h}static fromPrivateKey(a){return d.BASE.multiply(s(a))}static msm(a,h){return mn(d,r,a,h)}_setWindowSize(a){B.setWindowSize(this,a)}assertValidity(){l(this)}hasEvenY(){const{y:a}=this.toAffine();if(e.isOdd)return!e.isOdd(a);throw new Error("Field doesn't support isOdd")}equals(a){u(a);const{px:h,py:m,pz:p}=this,{px:v,py:O,pz:_}=a,S=e.eql(e.mul(h,_),e.mul(v,p)),I=e.eql(e.mul(m,_),e.mul(O,p));return S&&I}negate(){return new d(this.px,e.neg(this.py),this.pz)}double(){const{a,b:h}=n,m=e.mul(h,Lt),{px:p,py:v,pz:O}=this;let _=e.ZERO,S=e.ZERO,I=e.ZERO,A=e.mul(p,p),Z=e.mul(v,v),T=e.mul(O,O),U=e.mul(p,v);return U=e.add(U,U),I=e.mul(p,O),I=e.add(I,I),_=e.mul(a,I),S=e.mul(m,T),S=e.add(_,S),_=e.sub(Z,S),S=e.add(Z,S),S=e.mul(_,S),_=e.mul(U,_),I=e.mul(m,I),T=e.mul(a,T),U=e.sub(A,T),U=e.mul(a,U),U=e.add(U,I),I=e.add(A,A),A=e.add(I,A),A=e.add(A,T),A=e.mul(A,U),S=e.add(S,A),T=e.mul(v,O),T=e.add(T,T),A=e.mul(T,U),_=e.sub(_,A),I=e.mul(T,Z),I=e.add(I,I),I=e.add(I,I),new d(_,S,I)}add(a){u(a);const{px:h,py:m,pz:p}=this,{px:v,py:O,pz:_}=a;let S=e.ZERO,I=e.ZERO,A=e.ZERO;const Z=n.a,T=e.mul(n.b,Lt);let U=e.mul(h,v),j=e.mul(m,O),b=e.mul(p,_),x=e.add(h,m),E=e.add(v,O);x=e.mul(x,E),E=e.add(U,j),x=e.sub(x,E),E=e.add(h,p);let q=e.add(v,_);return E=e.mul(E,q),q=e.add(U,b),E=e.sub(E,q),q=e.add(m,p),S=e.add(O,_),q=e.mul(q,S),S=e.add(j,b),q=e.sub(q,S),A=e.mul(Z,E),S=e.mul(T,b),A=e.add(S,A),S=e.sub(j,A),A=e.add(j,A),I=e.mul(S,A),j=e.add(U,U),j=e.add(j,U),b=e.mul(Z,b),E=e.mul(T,E),j=e.add(j,b),b=e.sub(U,b),b=e.mul(Z,b),E=e.add(E,b),U=e.mul(j,E),I=e.add(I,U),U=e.mul(q,E),S=e.mul(x,S),S=e.sub(S,U),U=e.mul(x,j),A=e.mul(q,A),A=e.add(A,U),new d(S,I,A)}subtract(a){return this.add(a.negate())}is0(){return this.equals(d.ZERO)}wNAF(a){return B.wNAFCached(this,a,d.normalizeZ)}multiplyUnsafe(a){const{endo:h,n:m}=n;it("scalar",a,G,m);const p=d.ZERO;if(a===G)return p;if(this.is0()\|\|a===L)return this;if(!h\|\|B.hasPrecomputes(this))return B.wNAFCachedUnsafe(this,a,d.normalizeZ);let{k1neg:v,k1:O,k2neg:_,k2:S}=h.splitScalar(a),I=p,A=p,Z=this;for(;O>G\|\|S>G;)O&L&&(I=I.add(Z)),S&L&&(A=A.add(Z)),Z=Z.double(),O>>=L,S>>=L;return v&&(I=I.negate()),_&&(A=A.negate()),A=new d(e.mul(A.px,h.beta),A.py,A.pz),I.add(A)}multiply(a){const{endo:h,n:m}=n;it("scalar",a,L,m);let p,v;if(h){const{k1neg:O,k1:_,k2neg:S,k2:I}=h.splitScalar(a);let{p:A,f:Z}=this.wNAF(_),{p:T,f:U}=this.wNAF(I);A=B.constTimeNegate(O,A),T=B.constTimeNegate(S,T),T=new d(e.mul(T.px,h.beta),T.py,T.pz),p=A.add(T),v=Z.add(U)}else{const{p:O,f:_}=this.wNAF(a);p=O,v=_}return d.normalizeZ([p,v])[0]}multiplyAndAddUnsafe(a,h,m){const p=d.BASE,v=(_,S)=>S===G\|\|S===L\|\|!_.equals(p)?_.multiplyUnsafe(S):_.multiply(S),O=v(this,h).add(v(a,m));return O.is0()?void 0:O}toAffine(a){return g(this,a)}isTorsionFree(){const{h:a,isTorsionFree:h}=n;if(a===L)return!0;if(h)return h(d,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:a,clearCofactor:h}=n;return a===L?this:h?h(d,this):this.multiplyUnsafe(n.h)}toRawBytes(a=!0){return bt("isCompressed",a),this.assertValidity(),o(d,this,a)}toHex(a=!0){return bt("isCompressed",a),yt(this.toRawBytes(a))}}d.BASE=new d(n.Gx,n.Gy,e.ONE),d.ZERO=new d(e.ZERO,e.ONE,e.ZERO);const w=n.nBitLength,B=wn(d,n.endo?Math.ceil(w/2):w);return{CURVE:n,ProjectivePoint:d,normPrivateKeyToScalar:s,weierstrassEquation:c,isWithinCurveOrder:f}}function Bn(t){const n=Ue(t);return Et(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function vn(t){const n=Bn(t),{Fp:e,n:r}=n,o=e.BYTES+1,i=2e.BYTES+1;function c(b){return C(b,r)}function f(b){return Jt(b,r)}const{ProjectivePoint:s,normPrivateKeyToScalar:u,weierstrassEquation:g,isWithinCurveOrder:l}=En({...n,toBytes(b,x,E){const q=x.toAffine(),N=e.toBytes(q.x),R=K;return bt("isCompressed",E),E?R(Uint8Array.from([x.hasEvenY()?2:3]),N):R(Uint8Array.from([4]),N,e.toBytes(q.y))},fromBytes(b){const x=b.length,E=b[0],q=b.subarray(1);if(x===o&&(E===2\|\|E===3)){const N=$(q);if(!xt(N,L,e.ORDER))throw new Error("Point is not on curve");const R=g(N);let M;try{M=e.sqrt(R)}catch(Y){const P=Y instanceof Error?": "+Y.message:"";throw new Error("Point is not on curve"+P)}const z=(M&L)===L;return(E&1)===1!==z&&(M=e.neg(M)),{x:N,y:M}}else if(x===i&&E===4){const N=e.fromBytes(q.subarray(0,e.BYTES)),R=e.fromBytes(q.subarray(e.BYTES,2e.BYTES));return{x:N,y:R}}else{const N=o,R=i;throw new Error("invalid Point, expected length of "+N+", or uncompressed "+R+", got "+x)}}}),d=b=>yt(st(b,n.nByteLength));function w(b){const x=r>>L;return b>x}function B(b){return w(b)?c(-b):b}const y=(b,x,E)=>$(b.slice(x,E));class a{constructor(x,E,q){this.r=x,this.s=E,this.recovery=q,this.assertValidity()}static fromCompact(x){const E=n.nByteLength;return x=V("compactSignature",x,E2),new a(y(x,0,E),y(x,E,2E))}static fromDER(x){const{r:E,s:q}=F.toSig(V("DER",x));return new a(E,q)}assertValidity(){it("r",this.r,L,r),it("s",this.s,L,r)}addRecoveryBit(x){return new a(this.r,this.s,x)}recoverPublicKey(x){const{r:E,s:q,recovery:N}=this,R=_(V("msgHash",x));if(N==null\|\|![0,1,2,3].includes(N))throw new Error("recovery id invalid");const M=N===2\|\|N===3?E+n.n:E;if(M>=e.ORDER)throw new Error("recovery id 2 or 3 invalid");const z=N&1?"03":"02",Q=s.fromHex(z+d(M)),Y=f(M),P=c(-RY),dt=c(qY),tt=s.BASE.multiplyAndAddUnsafe(Q,P,dt);if(!tt)throw new Error("point at infinify");return tt.assertValidity(),tt}hasHighS(){return w(this.s)}normalizeS(){return this.hasHighS()?new a(this.r,c(-this.s),this.recovery):this}toDERRawBytes(){return pt(this.toDERHex())}toDERHex(){return F.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return pt(this.toCompactHex())}toCompactHex(){return d(this.r)+d(this.s)}}const h={isValidPrivateKey(b){try{return u(b),!0}catch{return!1}},normPrivateKeyToScalar:u,randomPrivateKey:()=>{const b=qe(n.n);return dn(n.randomBytes(b),n.n)},precompute(b=8,x=s.BASE){return x._setWindowSize(b),x.multiply(BigInt(3)),x}};function m(b,x=!0){return s.fromPrivateKey(b).toRawBytes(x)}function p(b){const x=lt(b),E=typeof b=="string",q=(x\|\|E)&&b.length;return x?q===o\|\|q===i:E?q===2o\|\|q===2i:b instanceof s}function v(b,x,E=!0){if(p(b))throw new Error("first arg must be private key");if(!p(x))throw new Error("second arg must be public key");return s.fromHex(x).multiply(u(b)).toRawBytes(E)}const O=n.bits2int\|\|function(b){if(b.length>8192)throw new Error("input is too large");const x=$(b),E=b.length8-n.nBitLength;return E>0?x>>BigInt(E):x},_=n.bits2int_modN\|\|function(b){return c(O(b))},S=oe(n.nBitLength);function I(b){return it("num < 2^"+n.nBitLength,b,G,S),st(b,n.nByteLength)}function A(b,x,E=Z){if(["recovered","canonical"].some(ft=>ft in E))throw new Error("sign() legacy options not supported");const{hash:q,randomBytes:N}=n;let{lowS:R,prehash:M,extraEntropy:z}=E;R==null&&(R=!0),b=V("msgHash",b),de(E),M&&(b=V("prehashed msgHash",q(b)));const Q=_(b),Y=u(x),P=[I(Y),I(Q)];if(z!=null&&z!==!1){const ft=z===!0?N(e.BYTES):z;P.push(V("extraEntropy",ft))}const dt=K(...P),tt=Q;function zt(ft){const ht=O(ft);if(!l(ht))return;const Mt=f(ht),Bt=s.BASE.multiply(ht).toAffine(),at=c(Bt.x);if(at===G)return;const vt=c(Mtc(tt+atY));if(vt===G)return;let St=(Bt.x===at?0:2)\|Number(Bt.y&L),gt=vt;return R&&w(vt)&&(gt=B(vt),St^=1),new a(at,gt,St)}return{seed:dt,k2sig:zt}}const Z={lowS:n.lowS,prehash:!1},T={lowS:n.lowS,prehash:!1};function U(b,x,E=Z){const{seed:q,k2sig:N}=A(b,x,E),R=n;return Ee(R.hash.outputLen,R.nByteLength,R.hmac)(q,N)}s.BASE._setWindowSize(8);function j(b,x,E,q=T){var St;const N=b;x=V("msgHash",x),E=V("publicKey",E);const{lowS:R,prehash:M,format:z}=q;if(de(q),"strict"in q)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 Q=typeof N=="string"\|\|lt(N),Y=!Q&&!z&&typeof N=="object"&&N!==null&&typeof N.r=="bigint"&&typeof N.s=="bigint";if(!Q&&!Y)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let P,dt;try{if(Y&&(P=new a(N.r,N.s)),Q){try{z!=="compact"&&(P=a.fromDER(N))}catch(gt){if(!(gt instanceof F.Err))throw gt}!P&&z!=="der"&&(P=a.fromCompact(N))}dt=s.fromHex(E)}catch{return!1}if(!P\|\|R&&P.hasHighS())return!1;M&&(x=n.hash(x));const{r:tt,s:zt}=P,ft=_(x),ht=f(zt),Mt=c(ftht),Bt=c(ttht),at=(St=s.BASE.multiplyAndAddUnsafe(dt,Mt,Bt))==null?void 0:St.toAffine();return at?c(at.x)===tt:!1}return{CURVE:n,getPublicKey:m,getSharedSecret:v,sign:U,verify:j,ProjectivePoint:s,Signature:a,utils:h}}function Sn(t,n){const e=t.ORDER;let r=G;for(let B=e-L;B%rt===G;B/=rt)r+=L;const o=r,i=rt<<o-L-L,c=irt,f=(e-L)/c,s=(f-L)/rt,u=c-L,g=i,l=t.pow(n,f),d=t.pow(n,(f+L)/rt);let w=(B,y)=>{let a=l,h=t.pow(y,u),m=t.sqr(h);m=t.mul(m,y);let p=t.mul(B,m);p=t.pow(p,s),p=t.mul(p,h),h=t.mul(p,y),m=t.mul(p,B);let v=t.mul(m,h);p=t.pow(v,g);let O=t.eql(p,t.ONE);h=t.mul(m,d),p=t.mul(v,a),m=t.cmov(h,m,O),v=t.cmov(p,v,O);for(let _=o;_>L;_--){let S=_-rt;S=rt<<S-L;let I=t.pow(v,S);const A=t.eql(I,t.ONE);h=t.mul(m,a),a=t.mul(a,a),I=t.mul(v,a),m=t.cmov(h,m,A),v=t.cmov(I,v,A)}return{isValid:O,value:m}};if(t.ORDER%he===Lt){const B=(t.ORDER-Lt)/he,y=t.sqrt(t.neg(n));w=(a,h)=>{let m=t.sqr(h);const p=t.mul(a,h);m=t.mul(m,p);let v=t.pow(m,B);v=t.mul(v,p);const O=t.mul(v,y),_=t.mul(t.sqr(v),h),S=t.eql(_,a);let I=t.cmov(O,v,S);return{isValid:S,value:I}}}return w}function An(t,n){if(Se(t),!t.isValid(n.A)\|\|!t.isValid(n.B)\|\|!t.isValid(n.Z))throw new Error("mapToCurveSimpleSWU: invalid opts");const e=Sn(t,n.Z);if(!t.isOdd)throw new Error("Fp.isOdd is not implemented!");return r=>{let o,i,c,f,s,u,g,l;o=t.sqr(r),o=t.mul(o,n.Z),i=t.sqr(o),i=t.add(i,o),c=t.add(i,t.ONE),c=t.mul(c,n.B),f=t.cmov(n.Z,t.neg(i),!t.eql(i,t.ZERO)),f=t.mul(f,n.A),i=t.sqr(c),u=t.sqr(f),s=t.mul(u,n.A),i=t.add(i,s),i=t.mul(i,c),u=t.mul(u,f),s=t.mul(u,n.B),i=t.add(i,s),g=t.mul(o,c);const{isValid:d,value:w}=e(i,u);l=t.mul(o,r),l=t.mul(l,w),g=t.cmov(g,c,d),l=t.cmov(l,w,d);const B=t.isOdd(r)===t.isOdd(l);return l=t.cmov(t.neg(l),l,B),g=t.div(g,f),{x:g,y:l}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function In(t){return{hash:t,hmac:(n,...e)=>ve(t,n,Pe(...e)),randomBytes:pe}}function _n(t,n){const e=r=>vn({...t,...In(r)});return{...e(n),create:e}}const qn=$;function ot(t,n){if(At(t),At(n),t<0\|\|t>=1<<8n)throw new Error("invalid I2OSP input: "+t);const e=Array.from({length:n}).fill(0);for(let r=n-1;r>=0;r--)e[r]=t&255,t>>>=8;return new Uint8Array(e)}function On(t,n){const e=new Uint8Array(t.length);for(let r=0;r<t.length;r++)e[r]=t[r]^n[r];return e}function At(t){if(!Number.isSafeInteger(t))throw new Error("number expected")}function Nn(t,n,e,r){X(t),X(n),At(e),n.length>255&&(n=r(K(Zt("H2C-OVERSIZE-DST-"),n)));const{outputLen:o,blockLen:i}=r,c=Math.ceil(e/o);if(e>65535\|\|c>255)throw new Error("expand_message_xmd: invalid lenInBytes");const f=K(n,ot(n.length,1)),s=ot(0,i),u=ot(e,2),g=new Array(c),l=r(K(s,t,u,ot(0,1),f));g[0]=r(K(l,ot(1,1),f));for(let w=1;w<=c;w++){const B=[On(l,g[w-1]),ot(w+1,1),f];g[w]=r(K(...B))}return K(...g).slice(0,e)}function Un(t,n,e,r,o){if(X(t),X(n),At(e),n.length>255){const i=Math.ceil(2r/8);n=o.create({dkLen:i}).update(Zt("H2C-OVERSIZE-DST-")).update(n).digest()}if(e>65535\|\|n.length>255)throw new Error("expand_message_xof: invalid lenInBytes");return o.create({dkLen:e}).update(t).update(ot(e,2)).update(n).update(ot(n.length,1)).digest()}function ge(t,n,e){Et(e,{DST:"stringOrUint8Array",p:"bigint",m:"isSafeInteger",k:"isSafeInteger",hash:"hash"});const{p:r,k:o,m:i,hash:c,expand:f,DST:s}=e;X(t),At(n);const u=typeof s=="string"?Zt(s):s,g=r.toString(2).length,l=Math.ceil((g+o)/8),d=nil;let w;if(f==="xmd")w=Nn(t,u,d,c);else if(f==="xof")w=Un(t,u,d,o,c);else if(f==="_internal_pass")w=t;else throw new Error('expand must be "xmd" or "xof"');const B=new Array(n);for(let y=0;y<n;y++){const a=new Array(i);for(let h=0;h<i;h++){const m=l(h+yi),p=w.subarray(m,m+l);a[h]=C(qn(p),r)}B[y]=a}return B}function Ln(t,n){const e=n.map(r=>Array.from(r).reverse());return(r,o)=>{const[i,c,f,s]=e.map(u=>u.reduce((g,l)=>t.add(t.mul(g,r),l)));return r=t.div(i,c),o=t.mul(o,t.div(f,s)),{x:r,y:o}}}function Tn(t,n,e){if(typeof n!="function")throw new Error("mapToCurve() must be defined");return{hashToCurve(r,o){const i=ge(r,2,{...e,DST:e.DST,...o}),c=t.fromAffine(n(i[0])),f=t.fromAffine(n(i[1])),s=c.add(f).clearCofactor();return s.assertValidity(),s},encodeToCurve(r,o){const i=ge(r,1,{...e,DST:e.encodeDST,...o}),c=t.fromAffine(n(i[0])).clearCofactor();return c.assertValidity(),c},mapToCurve(r){if(!Array.isArray(r))throw new Error("mapToCurve: expected array of bigints");for(const i of r)if(typeof i!="bigint")throw new Error("mapToCurve: expected array of bigints");const o=t.fromAffine(n(r)).clearCofactor();return o.assertValidity(),o}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const qt=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),Tt=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),It=BigInt(1),Ht=BigInt(2),we=(t,n)=>(t+n/Ht)/n;function Le(t){const n=qt,e=BigInt(3),r=BigInt(6),o=BigInt(11),i=BigInt(22),c=BigInt(23),f=BigInt(44),s=BigInt(88),u=ttt%n,g=uut%n,l=D(g,e,n)g%n,d=D(l,e,n)g%n,w=D(d,Ht,n)u%n,B=D(w,o,n)w%n,y=D(B,i,n)B%n,a=D(y,f,n)y%n,h=D(a,s,n)a%n,m=D(h,f,n)y%n,p=D(m,e,n)g%n,v=D(p,c,n)B%n,O=D(v,r,n)u%n,_=D(O,Ht,n);if(!ct.eql(ct.sqr(_),t))throw new Error("Cannot find square root");return _}const ct=Ie(qt,void 0,void 0,{sqrt:Le}),Vt=_n({a:BigInt(0),b:BigInt(7),Fp:ct,n:Tt,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const n=Tt,e=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-ItBigInt("0xe4437ed6010e88286f547fa90abfe4c3"),o=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),i=e,c=BigInt("0x100000000000000000000000000000000"),f=we(it,n),s=we(-rt,n);let u=C(t-fe-so,n),g=C(-fr-si,n);const l=u>c,d=g>c;if(l&&(u=n-u),d&&(g=n-g),u>c\|\|g>c)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:l,k1:u,k2neg:d,k2:g}}}},Ut),Te=BigInt(0),me={};function Rt(t,...n){let e=me[t];if(e===void 0){const r=Ut(Uint8Array.from(t,o=>o.charCodeAt(0)));e=K(r,r),me[t]=e}return Ut(K(e,...n))}const ie=t=>t.toRawBytes(!0).slice(1),Ft=t=>st(t,32),$t=t=>C(t,qt),_t=t=>C(t,Tt),se=Vt.ProjectivePoint,Hn=(t,n,e)=>se.BASE.multiplyAndAddUnsafe(t,n,e);function te(t){let n=Vt.utils.normPrivateKeyToScalar(t),e=se.fromPrivateKey(n);return{scalar:e.hasEvenY()?n:_t(-n),bytes:ie(e)}}function He(t){it("x",t,It,qt);const n=$t(tt),e=$t(nt+BigInt(7));let r=Le(e);r%Ht!==Te&&(r=$t(-r));const o=new se(t,r,It);return o.assertValidity(),o}const mt=$;function Re(...t){return _t(mt(Rt("BIP0340/challenge",...t)))}function Rn(t){return te(t).bytes}function Cn(t,n,e=pe(32)){const r=V("message",t),{bytes:o,scalar:i}=te(n),c=V("auxRand",e,32),f=Ft(i^mt(Rt("BIP0340/aux",c))),s=Rt("BIP0340/nonce",f,o,r),u=_t(mt(s));if(u===Te)throw new Error("sign failed: k is zero");const{bytes:g,scalar:l}=te(u),d=Re(g,o,r),w=new Uint8Array(64);if(w.set(g,0),w.set(Ft(_t(l+d*i)),32),!Ce(w,r,o))throw new Error("sign: Invalid signature produced");return w}function Ce(t,n,e){const r=V("signature",t,64),o=V("message",n),i=V("publicKey",e,32);try{const c=He(mt(i)),f=mt(r.subarray(0,32));if(!xt(f,It,qt))return!1;const s=mt(r.subarray(32,64));if(!xt(s,It,Tt))return!1;const u=Re(Ft(f),ie(c),o),g=Hn(c,s,_t(-u));return!(!g\|\|!g.hasEvenY()\|\|g.toAffine().x!==f)}catch{return!1}}const Yn=(()=>({getPublicKey:Rn,sign:Cn,verify:Ce,utils:{randomPrivateKey:Vt.utils.randomPrivateKey,lift_x:He,pointToBytes:ie,numberToBytesBE:st,bytesToNumberBE:$,taggedHash:Rt,mod:C}}))(),kn=(()=>Ln(ct,[["0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7","0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581","0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262","0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c"],["0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b","0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14","0x0000000000000000000000000000000000000000000000000000000000000001"],["0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c","0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3","0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931","0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84"],["0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b","0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573","0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f","0x0000000000000000000000000000000000000000000000000000000000000001"]].map(t=>t.map(n=>BigInt(n)))))(),Zn=(()=>An(ct,{A:BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),B:BigInt("1771"),Z:ct.create(BigInt("-11"))}))(),ke=(()=>Tn(Vt.ProjectivePoint,t=>{const{x:n,y:e}=Zn(ct.create(t[0]));return kn(n,e)},{DST:"secp256k1_XMD:SHA-256_SSWU_RO_",encodeDST:"secp256k1_XMD:SHA-256_SSWU_NU_",p:ct.ORDER,m:1,k:128,expand:"xmd",hash:Ut}))(),Gn=(()=>ke.hashToCurve)(),Wn=(()=>ke.encodeToCurve)();export{Wn as encodeToCurve,Gn as hashToCurve,Yn as schnorr,Vt as secp256k1};

package/assets/{secp256k1-6c4a60d7.js → secp256k1-587b447b.js} RENAMED Viewed

	@@ -1 +1 @@
1	- import{H as pe,v as Mt,w as Nt,x as xe,y as Ee,z as Ye,A as Rt,C as De,E as $,G as Ge,I as We,J as $e,L as ve}from"./wallets-df8ce6ec.js";import"./signing-d21be5c8.js";import"./prepare-contract-call-71c94bc4.js";import"./utils-18c039c7.js";import"./index-5ade27e7.js";import"./to-serializable-transaction-0d73c48d.js";import"./transaction-fc75ea4d.js";import"./get-bytecode-69571ce4.js";import"./execute-c3e6c079.js";import"./redirect-state-7c59beb0.js";import"./index-638472b4.js";import"./ethereum-d5c661fb.js";import"./types-ba990c1e.js";import"./store-af6293b2.js";import"./hashTypedData-eb5c0208.js";import"./send-transaction-8ac86ad4.js";import"./eth_sendRawTransaction-5ae15b91.js";import"./index-847578c2.js";import"./index-accd8060.js";import"./index-2544b402.js";import"./index-6ab757a5.js";import"./index-ab5f5cc3.js";function Xe(t,n,e,r){if(typeof t.setBigUint64=="function")return t.setBigUint64(n,e,r);const s=BigInt(32),o=BigInt(4294967295),c=Number(e>>s&o),f=Number(e&o),i=r?4:0,a=r?0:4;t.setUint32(n+i,c,r),t.setUint32(n+a,f,r)}function Qe(t,n,e){return t&n^~t&e}function Je(t,n,e){return t&n^t&e^n&e}class Fe extends pe{constructor(n,e,r,s){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=n,this.outputLen=e,this.padOffset=r,this.isLE=s,this.buffer=new Uint8Array(n),this.view=Mt(this.buffer)}update(n){Nt(this),n=xe(n),Ee(n);const{view:e,buffer:r,blockLen:s}=this,o=n.length;for(let c=0;c<o;){const f=Math.min(s-this.pos,o-c);if(f===s){const i=Mt(n);for(;s<=o-c;c+=s)this.process(i,c);continue}r.set(n.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===s&&(this.process(e,0),this.pos=0)}return this.length+=n.length,this.roundClean(),this}digestInto(n){Nt(this),Ye(n,this),this.finished=!0;const{buffer:e,view:r,blockLen:s,isLE:o}=this;let{pos:c}=this;e[c++]=128,Rt(this.buffer.subarray(c)),this.padOffset>s-c&&(this.process(r,0),c=0);for(let l=c;l<s;l++)e[l]=0;Xe(r,s-8,BigInt(this.length8),o),this.process(r,0);const f=Mt(n),i=this.outputLen;if(i%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const a=i/4,d=this.get();if(a>d.length)throw new Error("_sha2: outputLen bigger than state");for(let l=0;l<a;l++)f.setUint32(4l,d[l],o)}digest(){const{buffer:n,outputLen:e}=this;this.digestInto(n);const r=n.slice(0,e);return this.destroy(),r}_cloneInto(n){n\|\|(n=new this.constructor),n.set(...this.get());const{blockLen:e,buffer:r,length:s,finished:o,destroyed:c,pos:f}=this;return n.destroyed=c,n.finished=o,n.length=s,n.pos=f,s%e&&n.buffer.set(r),n}clone(){return this._cloneInto()}}const et=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),tn=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),nt=new Uint32Array(64);class en extends Fe{constructor(n=32){super(64,n,8,!1),this.A=et[0]\|0,this.B=et[1]\|0,this.C=et[2]\|0,this.D=et[3]\|0,this.E=et[4]\|0,this.F=et[5]\|0,this.G=et[6]\|0,this.H=et[7]\|0}get(){const{A:n,B:e,C:r,D:s,E:o,F:c,G:f,H:i}=this;return[n,e,r,s,o,c,f,i]}set(n,e,r,s,o,c,f,i){this.A=n\|0,this.B=e\|0,this.C=r\|0,this.D=s\|0,this.E=o\|0,this.F=c\|0,this.G=f\|0,this.H=i\|0}process(n,e){for(let l=0;l<16;l++,e+=4)nt[l]=n.getUint32(e,!1);for(let l=16;l<64;l++){const p=nt[l-15],b=nt[l-2],_=$(p,7)^$(p,18)^p>>>3,g=$(b,17)^$(b,19)^b>>>10;nt[l]=g+nt[l-7]+_+nt[l-16]\|0}let{A:r,B:s,C:o,D:c,E:f,F:i,G:a,H:d}=this;for(let l=0;l<64;l++){const p=$(f,6)^$(f,11)^$(f,25),b=d+p+Qe(f,i,a)+tn[l]+nt[l]\|0,g=($(r,2)^$(r,13)^$(r,22))+Je(r,s,o)\|0;d=a,a=i,i=f,f=c+b\|0,c=o,o=s,s=r,r=b+g\|0}r=r+this.A\|0,s=s+this.B\|0,o=o+this.C\|0,c=c+this.D\|0,f=f+this.E\|0,i=i+this.F\|0,a=a+this.G\|0,d=d+this.H\|0,this.set(r,s,o,c,f,i,a,d)}roundClean(){Rt(nt)}destroy(){this.set(0,0,0,0,0,0,0,0),Rt(this.buffer)}}const Ht=De(()=>new en);class Be extends pe{constructor(n,e){super(),this.finished=!1,this.destroyed=!1,Ge(n);const r=xe(e);if(this.iHash=n.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 s=this.blockLen,o=new Uint8Array(s);o.set(r.length>s?n.create().update(r).digest():r);for(let c=0;c<o.length;c++)o[c]^=54;this.iHash.update(o),this.oHash=n.create();for(let c=0;c<o.length;c++)o[c]^=106;this.oHash.update(o),Rt(o)}update(n){return Nt(this),this.iHash.update(n),this}digestInto(n){Nt(this),Ee(n,this.outputLen),this.finished=!0,this.iHash.digestInto(n),this.oHash.update(n),this.oHash.digestInto(n),this.destroy()}digest(){const n=new Uint8Array(this.oHash.outputLen);return this.digestInto(n),n}_cloneInto(n){n\|\|(n=Object.create(Object.getPrototypeOf(this),{}));const{oHash:e,iHash:r,finished:s,destroyed:o,blockLen:c,outputLen:f}=this;return n=n,n.finished=s,n.destroyed=o,n.blockLen=c,n.outputLen=f,n.oHash=e._cloneInto(n.oHash),n.iHash=r._cloneInto(n.iHash),n}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const Se=(t,n,e)=>new Be(t,n).update(e).digest();Se.create=(t,n)=>new Be(t,n);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const re=BigInt(0),Qt=BigInt(1);function _t(t){return t instanceof Uint8Array\|\|ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function it(t){if(!_t(t))throw new Error("Uint8Array expected")}function xt(t,n){if(typeof n!="boolean")throw new Error(t+" boolean expected, got "+n)}function qt(t){const n=t.toString(16);return n.length&1?"0"+n:n}function Ae(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?re:BigInt("0x"+t)}const _e=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",nn=Array.from({length:256},(t,n)=>n.toString(16).padStart(2,"0"));function Et(t){if(it(t),_e)return t.toHex();let n="";for(let e=0;e<t.length;e++)n+=nn[t[e]];return n}const J={_0:48,_9:57,A:65,F:70,a:97,f:102};function ae(t){if(t>=J._0&&t<=J._9)return t-J._0;if(t>=J.A&&t<=J.F)return t-(J.A-10);if(t>=J.a&&t<=J.f)return t-(J.a-10)}function Ut(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(_e)return Uint8Array.fromHex(t);const n=t.length,e=n/2;if(n%2)throw new Error("hex string expected, got unpadded hex of length "+n);const r=new Uint8Array(e);for(let s=0,o=0;s<e;s++,o+=2){const c=ae(t.charCodeAt(o)),f=ae(t.charCodeAt(o+1));if(c===void 0\|\|f===void 0){const i=t[o]+t[o+1];throw new Error('hex string expected, got non-hex character "'+i+'" at index '+o)}r[s]=c16+f}return r}function X(t){return Ae(Et(t))}function Ie(t){return it(t),Ae(Et(Uint8Array.from(t).reverse()))}function lt(t,n){return Ut(t.toString(16).padStart(n2,"0"))}function Oe(t,n){return lt(t,n).reverse()}function z(t,n,e){let r;if(typeof n=="string")try{r=Ut(n)}catch(o){throw new Error(t+" must be hex string or Uint8Array, cause: "+o)}else if(_t(n))r=Uint8Array.from(n);else throw new Error(t+" must be hex string or Uint8Array");const s=r.length;if(typeof e=="number"&&s!==e)throw new Error(t+" of length "+e+" expected, got "+s);return r}function D(...t){let n=0;for(let r=0;r<t.length;r++){const s=t[r];it(s),n+=s.length}const e=new Uint8Array(n);for(let r=0,s=0;r<t.length;r++){const o=t[r];e.set(o,s),s+=o.length}return e}function oe(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}const jt=t=>typeof t=="bigint"&&re<=t;function vt(t,n,e){return jt(t)&&jt(n)&&jt(e)&&n<=t&&t<e}function ut(t,n,e,r){if(!vt(n,e,r))throw new Error("expected valid "+t+": "+e+" <= n < "+r+", got "+n)}function rn(t){let n;for(n=0;t>re;t>>=Qt,n+=1);return n}const Ct=t=>(Qt<<BigInt(t))-Qt,Kt=t=>new Uint8Array(t),ue=t=>Uint8Array.from(t);function on(t,n,e){if(typeof t!="number"\|\|t<2)throw new Error("hashLen must be a number");if(typeof n!="number"\|\|n<2)throw new Error("qByteLen must be a number");if(typeof e!="function")throw new Error("hmacFn must be a function");let r=Kt(t),s=Kt(t),o=0;const c=()=>{r.fill(1),s.fill(0),o=0},f=(...l)=>e(s,r,...l),i=(l=Kt(0))=>{s=f(ue([0]),l),r=f(),l.length!==0&&(s=f(ue([1]),l),r=f())},a=()=>{if(o++>=1e3)throw new Error("drbg: tried 1000 values");let l=0;const p=[];for(;l<n;){r=f();const b=r.slice();p.push(b),l+=r.length}return D(...p)};return(l,p)=>{c(),i(l);let b;for(;!(b=p(a()));)i();return c(),b}}const sn={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"\|\|_t(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,n)=>n.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function It(t,n,e={}){const r=(s,o,c)=>{const f=sn[o];if(typeof f!="function")throw new Error("invalid validator function");const i=t[s];if(!(c&&i===void 0)&&!f(i,t))throw new Error("param "+String(s)+" is invalid. Expected "+o+", got "+i)};for(const[s,o]of Object.entries(n))r(s,o,!1);for(const[s,o]of Object.entries(e))r(s,o,!0);return t}function le(t){const n=new WeakMap;return(e,...r)=>{const s=n.get(e);if(s!==void 0)return s;const o=t(e,...r);return n.set(e,o),o}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const K=BigInt(0),M=BigInt(1),at=BigInt(2),cn=BigInt(3),qe=BigInt(4),Ne=BigInt(5),Re=BigInt(8);function Z(t,n){const e=t%n;return e>=K?e:n+e}function Y(t,n,e){let r=t;for(;n-- >K;)r=r,r%=e;return r}function Jt(t,n){if(t===K)throw new Error("invert: expected non-zero number");if(n<=K)throw new Error("invert: expected positive modulus, got "+n);let e=Z(t,n),r=n,s=K,o=M;for(;e!==K;){const f=r/e,i=r%e,a=s-of;r=e,e=i,s=o,o=a}if(r!==M)throw new Error("invert: does not exist");return Z(s,n)}function He(t,n){const e=(t.ORDER+M)/qe,r=t.pow(n,e);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function fn(t,n){const e=(t.ORDER-Ne)/Re,r=t.mul(n,at),s=t.pow(r,e),o=t.mul(n,s),c=t.mul(t.mul(o,at),s),f=t.mul(o,t.sub(c,t.ONE));if(!t.eql(t.sqr(f),n))throw new Error("Cannot find square root");return f}function an(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-M,e=0;for(;n%at===K;)n/=at,e++;let r=at;const s=ie(t);for(;de(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(e===1)return He;let o=s.pow(r,n);const c=(n+M)/at;return function(i,a){if(i.is0(a))return a;if(de(i,a)!==1)throw new Error("Cannot find square root");let d=e,l=i.mul(i.ONE,o),p=i.pow(a,n),b=i.pow(a,c);for(;!i.eql(p,i.ONE);){if(i.is0(p))return i.ZERO;let _=1,g=i.sqr(p);for(;!i.eql(g,i.ONE);)if(_++,g=i.sqr(g),_===d)throw new Error("Cannot find square root");const T=M<<BigInt(d-_-1),I=i.pow(l,T);d=_,l=i.sqr(I),p=i.mul(p,l),b=i.mul(b,I)}return b}}function un(t){return t%qe===cn?He:t%Re===Ne?fn:an(t)}const ln=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Ue(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},e=ln.reduce((r,s)=>(r[s]="function",r),n);return It(t,e)}function dn(t,n,e){if(e<K)throw new Error("invalid exponent, negatives unsupported");if(e===K)return t.ONE;if(e===M)return n;let r=t.ONE,s=n;for(;e>K;)e&M&&(r=t.mul(r,s)),s=t.sqr(s),e>>=M;return r}function Zt(t,n,e=!1){const r=new Array(n.length).fill(e?t.ZERO:void 0),s=n.reduce((c,f,i)=>t.is0(f)?c:(r[i]=c,t.mul(c,f)),t.ONE),o=t.inv(s);return n.reduceRight((c,f,i)=>t.is0(f)?c:(r[i]=t.mul(c,r[i]),t.mul(c,f)),o),r}function de(t,n){const e=(t.ORDER-M)/at,r=t.pow(n,e),s=t.eql(r,t.ONE),o=t.eql(r,t.ZERO),c=t.eql(r,t.neg(t.ONE));if(!s&&!o&&!c)throw new Error("invalid Legendre symbol result");return s?1:o?0:-1}function Le(t,n){n!==void 0&&We(n);const e=n!==void 0?n:t.toString(2).length,r=Math.ceil(e/8);return{nBitLength:e,nByteLength:r}}function ie(t,n,e=!1,r={}){if(t<=K)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:o}=Le(t,n);if(o>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:t,isLE:e,BITS:s,BYTES:o,MASK:Ct(s),ZERO:K,ONE:M,create:i=>Z(i,t),isValid:i=>{if(typeof i!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof i);return K<=i&&i<t},is0:i=>i===K,isOdd:i=>(i&M)===M,neg:i=>Z(-i,t),eql:(i,a)=>i===a,sqr:i=>Z(ii,t),add:(i,a)=>Z(i+a,t),sub:(i,a)=>Z(i-a,t),mul:(i,a)=>Z(ia,t),pow:(i,a)=>dn(f,i,a),div:(i,a)=>Z(iJt(a,t),t),sqrN:i=>ii,addN:(i,a)=>i+a,subN:(i,a)=>i-a,mulN:(i,a)=>ia,inv:i=>Jt(i,t),sqrt:r.sqrt\|\|(i=>(c\|\|(c=un(t)),c(f,i))),toBytes:i=>e?Oe(i,o):lt(i,o),fromBytes:i=>{if(i.length!==o)throw new Error("Field.fromBytes: expected "+o+" bytes, got "+i.length);return e?Ie(i):X(i)},invertBatch:i=>Zt(f,i),cmov:(i,a,d)=>d?a:i});return Object.freeze(f)}function Te(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function ke(t){const n=Te(t);return n+Math.ceil(n/2)}function hn(t,n,e=!1){const r=t.length,s=Te(n),o=ke(n);if(r<16\|\|r<o\|\|r>1024)throw new Error("expected "+o+"-1024 bytes of input, got "+r);const c=e?Ie(t):X(t),f=Z(c,n-M)+M;return e?Oe(f,s):lt(f,s)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const he=BigInt(0),Ft=BigInt(1);function Yt(t,n){const e=n.negate();return t?e:n}function Ce(t,n){if(!Number.isSafeInteger(t)\|\|t<=0\|\|t>n)throw new Error("invalid window size, expected [1.."+n+"], got W="+t)}function Dt(t,n){Ce(t,n);const e=Math.ceil(n/t)+1,r=2(t-1),s=2t,o=Ct(t),c=BigInt(t);return{windows:e,windowSize:r,mask:o,maxNumber:s,shiftBy:c}}function we(t,n,e){const{windowSize:r,mask:s,maxNumber:o,shiftBy:c}=e;let f=Number(t&s),i=t>>c;f>r&&(f-=o,i+=Ft);const a=nr,d=a+Math.abs(f)-1,l=f===0,p=f<0,b=n%2!==0;return{nextN:i,offset:d,isZero:l,isNeg:p,isNegF:b,offsetF:a}}function wn(t,n){if(!Array.isArray(t))throw new Error("array expected");t.forEach((e,r)=>{if(!(e instanceof n))throw new Error("invalid point at index "+r)})}function gn(t,n){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((e,r)=>{if(!n.isValid(e))throw new Error("invalid scalar at index "+r)})}const Gt=new WeakMap,Ze=new WeakMap;function Wt(t){return Ze.get(t)\|\|1}function mn(t,n){return{constTimeNegate:Yt,hasPrecomputes(e){return Wt(e)!==1},unsafeLadder(e,r,s=t.ZERO){let o=e;for(;r>he;)r&Ft&&(s=s.add(o)),o=o.double(),r>>=Ft;return s},precomputeWindow(e,r){const{windows:s,windowSize:o}=Dt(r,n),c=[];let f=e,i=f;for(let a=0;a<s;a++){i=f,c.push(i);for(let d=1;d<o;d++)i=i.add(f),c.push(i);f=i.double()}return c},wNAF(e,r,s){let o=t.ZERO,c=t.BASE;const f=Dt(e,n);for(let i=0;i<f.windows;i++){const{nextN:a,offset:d,isZero:l,isNeg:p,isNegF:b,offsetF:_}=we(s,i,f);s=a,l?c=c.add(Yt(b,r[_])):o=o.add(Yt(p,r[d]))}return{p:o,f:c}},wNAFUnsafe(e,r,s,o=t.ZERO){const c=Dt(e,n);for(let f=0;f<c.windows&&s!==he;f++){const{nextN:i,offset:a,isZero:d,isNeg:l}=we(s,f,c);if(s=i,!d){const p=r[a];o=o.add(l?p.negate():p)}}return o},getPrecomputes(e,r,s){let o=Gt.get(r);return o\|\|(o=this.precomputeWindow(r,e),e!==1&&Gt.set(r,s(o))),o},wNAFCached(e,r,s){const o=Wt(e);return this.wNAF(o,this.getPrecomputes(o,e,s),r)},wNAFCachedUnsafe(e,r,s,o){const c=Wt(e);return c===1?this.unsafeLadder(e,r,o):this.wNAFUnsafe(c,this.getPrecomputes(c,e,s),r,o)},setWindowSize(e,r){Ce(r,n),Ze.set(e,r),Gt.delete(e)}}}function bn(t,n,e,r){wn(e,t),gn(r,n);const s=e.length,o=r.length;if(s!==o)throw new Error("arrays of points and scalars must have equal length");const c=t.ZERO,f=rn(BigInt(s));let i=1;f>12?i=f-3:f>4?i=f-2:f>0&&(i=2);const a=Ct(i),d=new Array(Number(a)+1).fill(c),l=Math.floor((n.BITS-1)/i)i;let p=c;for(let b=l;b>=0;b-=i){d.fill(c);for(let g=0;g<o;g++){const T=r[g],I=Number(T>>BigInt(b)&a);d[I]=d[I].add(e[g])}let _=c;for(let g=d.length-1,T=c;g>0;g--)T=T.add(d[g]),_=_.add(T);if(p=p.add(_),b!==0)for(let g=0;g<i;g++)p=p.double()}return p}function ze(t){return Ue(t.Fp),It(t,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Le(t.n,t.nBitLength),...t,p:t.Fp.ORDER})}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function ge(t){t.lowS!==void 0&&xt("lowS",t.lowS),t.prehash!==void 0&&xt("prehash",t.prehash)}function yn(t){const n=ze(t);It(n,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:e,Fp:r,a:s}=n;if(e){if(!r.eql(s,r.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof e!="object"\|\|typeof e.beta!="bigint"\|\|typeof e.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...n})}class pn extends Error{constructor(n=""){super(n)}}const F={Err:pn,_tlv:{encode:(t,n)=>{const{Err:e}=F;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length&1)throw new e("tlv.encode: unpadded data");const r=n.length/2,s=qt(r);if(s.length/2&128)throw new e("tlv.encode: long form length too big");const o=r>127?qt(s.length/2\|128):"";return qt(t)+o+s+n},decode(t,n){const{Err:e}=F;let r=0;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length<2\|\|n[r++]!==t)throw new e("tlv.decode: wrong tlv");const s=n[r++],o=!!(s&128);let c=0;if(!o)c=s;else{const i=s&127;if(!i)throw new e("tlv.decode(long): indefinite length not supported");if(i>4)throw new e("tlv.decode(long): byte length is too big");const a=n.subarray(r,r+i);if(a.length!==i)throw new e("tlv.decode: length bytes not complete");if(a[0]===0)throw new e("tlv.decode(long): zero leftmost byte");for(const d of a)c=c<<8\|d;if(r+=i,c<128)throw new e("tlv.decode(long): not minimal encoding")}const f=n.subarray(r,r+c);if(f.length!==c)throw new e("tlv.decode: wrong value length");return{v:f,l:n.subarray(r+c)}}},_int:{encode(t){const{Err:n}=F;if(t<W)throw new n("integer: negative integers are not allowed");let e=qt(t);if(Number.parseInt(e[0],16)&8&&(e="00"+e),e.length&1)throw new n("unexpected DER parsing assertion: unpadded hex");return e},decode(t){const{Err:n}=F;if(t[0]&128)throw new n("invalid signature integer: negative");if(t[0]===0&&!(t[1]&128))throw new n("invalid signature integer: unnecessary leading zero");return X(t)}},toSig(t){const{Err:n,_int:e,_tlv:r}=F,s=z("signature",t),{v:o,l:c}=r.decode(48,s);if(c.length)throw new n("invalid signature: left bytes after parsing");const{v:f,l:i}=r.decode(2,o),{v:a,l:d}=r.decode(2,i);if(d.length)throw new n("invalid signature: left bytes after parsing");return{r:e.decode(f),s:e.decode(a)}},hexFromSig(t){const{_tlv:n,_int:e}=F,r=n.encode(2,e.encode(t.r)),s=n.encode(2,e.encode(t.s)),o=r+s;return n.encode(48,o)}};function $t(t,n){return Et(lt(t,n))}const W=BigInt(0),k=BigInt(1),rt=BigInt(2),pt=BigInt(3),te=BigInt(4);function xn(t){const n=yn(t),{Fp:e}=n,r=ie(n.n,n.nBitLength),s=n.toBytes\|\|((y,u,m)=>{const x=u.toAffine();return D(Uint8Array.from([4]),e.toBytes(x.x),e.toBytes(x.y))}),o=n.fromBytes\|\|(y=>{const u=y.subarray(1),m=e.fromBytes(u.subarray(0,e.BYTES)),x=e.fromBytes(u.subarray(e.BYTES,2e.BYTES));return{x:m,y:x}});function c(y){const{a:u,b:m}=n,x=e.sqr(y),v=e.mul(x,y);return e.add(e.add(v,e.mul(y,u)),m)}function f(y,u){const m=e.sqr(u),x=c(y);return e.eql(m,x)}if(!f(n.Gx,n.Gy))throw new Error("bad curve params: generator point");const i=e.mul(e.pow(n.a,pt),te),a=e.mul(e.sqr(n.b),BigInt(27));if(e.is0(e.add(i,a)))throw new Error("bad curve params: a or b");function d(y){return vt(y,k,n.n)}function l(y){const{allowedPrivateKeyLengths:u,nByteLength:m,wrapPrivateKey:x,n:v}=n;if(u&&typeof y!="bigint"){if(_t(y)&&(y=Et(y)),typeof y!="string"\|\|!u.includes(y.length))throw new Error("invalid private key");y=y.padStart(m2,"0")}let O;try{O=typeof y=="bigint"?y:X(z("private key",y,m))}catch{throw new Error("invalid private key, expected hex or "+m+" bytes, got "+typeof y)}return x&&(O=Z(O,v)),ut("private key",O,k,v),O}function p(y){if(!(y instanceof g))throw new Error("ProjectivePoint expected")}const b=le((y,u)=>{const{px:m,py:x,pz:v}=y;if(e.eql(v,e.ONE))return{x:m,y:x};const O=y.is0();u==null&&(u=O?e.ONE:e.inv(v));const U=e.mul(m,u),L=e.mul(x,u),B=e.mul(v,u);if(O)return{x:e.ZERO,y:e.ZERO};if(!e.eql(B,e.ONE))throw new Error("invZ was invalid");return{x:U,y:L}}),_=le(y=>{if(y.is0()){if(n.allowInfinityPoint&&!e.is0(y.py))return;throw new Error("bad point: ZERO")}const{x:u,y:m}=y.toAffine();if(!e.isValid(u)\|\|!e.isValid(m))throw new Error("bad point: x or y not FE");if(!f(u,m))throw new Error("bad point: equation left != right");if(!y.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class g{constructor(u,m,x){if(u==null\|\|!e.isValid(u))throw new Error("x required");if(m==null\|\|!e.isValid(m)\|\|e.is0(m))throw new Error("y required");if(x==null\|\|!e.isValid(x))throw new Error("z required");this.px=u,this.py=m,this.pz=x,Object.freeze(this)}static fromAffine(u){const{x:m,y:x}=u\|\|{};if(!u\|\|!e.isValid(m)\|\|!e.isValid(x))throw new Error("invalid affine point");if(u instanceof g)throw new Error("projective point not allowed");const v=O=>e.eql(O,e.ZERO);return v(m)&&v(x)?g.ZERO:new g(m,x,e.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(u){const m=Zt(e,u.map(x=>x.pz));return u.map((x,v)=>x.toAffine(m[v])).map(g.fromAffine)}static fromHex(u){const m=g.fromAffine(o(z("pointHex",u)));return m.assertValidity(),m}static fromPrivateKey(u){return g.BASE.multiply(l(u))}static msm(u,m){return bn(g,r,u,m)}_setWindowSize(u){H.setWindowSize(this,u)}assertValidity(){_(this)}hasEvenY(){const{y:u}=this.toAffine();if(e.isOdd)return!e.isOdd(u);throw new Error("Field doesn't support isOdd")}equals(u){p(u);const{px:m,py:x,pz:v}=this,{px:O,py:U,pz:L}=u,B=e.eql(e.mul(m,L),e.mul(O,v)),R=e.eql(e.mul(x,L),e.mul(U,v));return B&&R}negate(){return new g(this.px,e.neg(this.py),this.pz)}double(){const{a:u,b:m}=n,x=e.mul(m,pt),{px:v,py:O,pz:U}=this;let L=e.ZERO,B=e.ZERO,R=e.ZERO,S=e.mul(v,v),V=e.mul(O,O),w=e.mul(U,U),h=e.mul(v,O);return h=e.add(h,h),R=e.mul(v,U),R=e.add(R,R),L=e.mul(u,R),B=e.mul(x,w),B=e.add(L,B),L=e.sub(V,B),B=e.add(V,B),B=e.mul(L,B),L=e.mul(h,L),R=e.mul(x,R),w=e.mul(u,w),h=e.sub(S,w),h=e.mul(u,h),h=e.add(h,R),R=e.add(S,S),S=e.add(R,S),S=e.add(S,w),S=e.mul(S,h),B=e.add(B,S),w=e.mul(O,U),w=e.add(w,w),S=e.mul(w,h),L=e.sub(L,S),R=e.mul(w,V),R=e.add(R,R),R=e.add(R,R),new g(L,B,R)}add(u){p(u);const{px:m,py:x,pz:v}=this,{px:O,py:U,pz:L}=u;let B=e.ZERO,R=e.ZERO,S=e.ZERO;const V=n.a,w=e.mul(n.b,pt);let h=e.mul(m,O),E=e.mul(x,U),N=e.mul(v,L),A=e.add(m,x),q=e.add(O,U);A=e.mul(A,q),q=e.add(h,E),A=e.sub(A,q),q=e.add(m,v);let C=e.add(O,L);return q=e.mul(q,C),C=e.add(h,N),q=e.sub(q,C),C=e.add(x,v),B=e.add(U,L),C=e.mul(C,B),B=e.add(E,N),C=e.sub(C,B),S=e.mul(V,q),B=e.mul(w,N),S=e.add(B,S),B=e.sub(E,S),S=e.add(E,S),R=e.mul(B,S),E=e.add(h,h),E=e.add(E,h),N=e.mul(V,N),q=e.mul(w,q),E=e.add(E,N),N=e.sub(h,N),N=e.mul(V,N),q=e.add(q,N),h=e.mul(E,q),R=e.add(R,h),h=e.mul(C,q),B=e.mul(A,B),B=e.sub(B,h),h=e.mul(A,E),S=e.mul(C,S),S=e.add(S,h),new g(B,R,S)}subtract(u){return this.add(u.negate())}is0(){return this.equals(g.ZERO)}wNAF(u){return H.wNAFCached(this,u,g.normalizeZ)}multiplyUnsafe(u){const{endo:m,n:x}=n;ut("scalar",u,W,x);const v=g.ZERO;if(u===W)return v;if(this.is0()\|\|u===k)return this;if(!m\|\|H.hasPrecomputes(this))return H.wNAFCachedUnsafe(this,u,g.normalizeZ);let{k1neg:O,k1:U,k2neg:L,k2:B}=m.splitScalar(u),R=v,S=v,V=this;for(;U>W\|\|B>W;)U&k&&(R=R.add(V)),B&k&&(S=S.add(V)),V=V.double(),U>>=k,B>>=k;return O&&(R=R.negate()),L&&(S=S.negate()),S=new g(e.mul(S.px,m.beta),S.py,S.pz),R.add(S)}multiply(u){const{endo:m,n:x}=n;ut("scalar",u,k,x);let v,O;if(m){const{k1neg:U,k1:L,k2neg:B,k2:R}=m.splitScalar(u);let{p:S,f:V}=this.wNAF(L),{p:w,f:h}=this.wNAF(R);S=H.constTimeNegate(U,S),w=H.constTimeNegate(B,w),w=new g(e.mul(w.px,m.beta),w.py,w.pz),v=S.add(w),O=V.add(h)}else{const{p:U,f:L}=this.wNAF(u);v=U,O=L}return g.normalizeZ([v,O])[0]}multiplyAndAddUnsafe(u,m,x){const v=g.BASE,O=(L,B)=>B===W\|\|B===k\|\|!L.equals(v)?L.multiplyUnsafe(B):L.multiply(B),U=O(this,m).add(O(u,x));return U.is0()?void 0:U}toAffine(u){return b(this,u)}isTorsionFree(){const{h:u,isTorsionFree:m}=n;if(u===k)return!0;if(m)return m(g,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:u,clearCofactor:m}=n;return u===k?this:m?m(g,this):this.multiplyUnsafe(n.h)}toRawBytes(u=!0){return xt("isCompressed",u),this.assertValidity(),s(g,this,u)}toHex(u=!0){return xt("isCompressed",u),Et(this.toRawBytes(u))}}g.BASE=new g(n.Gx,n.Gy,e.ONE),g.ZERO=new g(e.ZERO,e.ONE,e.ZERO);const{endo:T,nBitLength:I}=n,H=mn(g,T?Math.ceil(I/2):I);return{CURVE:n,ProjectivePoint:g,normPrivateKeyToScalar:l,weierstrassEquation:c,isWithinCurveOrder:d}}function En(t){const n=ze(t);return It(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function vn(t){const n=En(t),{Fp:e,n:r,nByteLength:s,nBitLength:o}=n,c=e.BYTES+1,f=2e.BYTES+1;function i(w){return Z(w,r)}function a(w){return Jt(w,r)}const{ProjectivePoint:d,normPrivateKeyToScalar:l,weierstrassEquation:p,isWithinCurveOrder:b}=xn({...n,toBytes(w,h,E){const N=h.toAffine(),A=e.toBytes(N.x),q=D;return xt("isCompressed",E),E?q(Uint8Array.from([h.hasEvenY()?2:3]),A):q(Uint8Array.from([4]),A,e.toBytes(N.y))},fromBytes(w){const h=w.length,E=w[0],N=w.subarray(1);if(h===c&&(E===2\|\|E===3)){const A=X(N);if(!vt(A,k,e.ORDER))throw new Error("Point is not on curve");const q=p(A);let C;try{C=e.sqrt(q)}catch(G){const j=G instanceof Error?": "+G.message:"";throw new Error("Point is not on curve"+j)}const P=(C&k)===k;return(E&1)===1!==P&&(C=e.neg(C)),{x:A,y:C}}else if(h===f&&E===4){const A=e.fromBytes(N.subarray(0,e.BYTES)),q=e.fromBytes(N.subarray(e.BYTES,2e.BYTES));return{x:A,y:q}}else{const A=c,q=f;throw new Error("invalid Point, expected length of "+A+", or uncompressed "+q+", got "+h)}}});function _(w){const h=r>>k;return w>h}function g(w){return _(w)?i(-w):w}const T=(w,h,E)=>X(w.slice(h,E));class I{constructor(h,E,N){ut("r",h,k,r),ut("s",E,k,r),this.r=h,this.s=E,N!=null&&(this.recovery=N),Object.freeze(this)}static fromCompact(h){const E=s;return h=z("compactSignature",h,E2),new I(T(h,0,E),T(h,E,2E))}static fromDER(h){const{r:E,s:N}=F.toSig(z("DER",h));return new I(E,N)}assertValidity(){}addRecoveryBit(h){return new I(this.r,this.s,h)}recoverPublicKey(h){const{r:E,s:N,recovery:A}=this,q=v(z("msgHash",h));if(A==null\|\|![0,1,2,3].includes(A))throw new Error("recovery id invalid");const C=A===2\|\|A===3?E+n.n:E;if(C>=e.ORDER)throw new Error("recovery id 2 or 3 invalid");const P=A&1?"03":"02",Q=d.fromHex(P+$t(C,e.BYTES)),G=a(C),j=i(-qG),dt=i(NG),tt=d.BASE.multiplyAndAddUnsafe(Q,j,dt);if(!tt)throw new Error("point at infinify");return tt.assertValidity(),tt}hasHighS(){return _(this.s)}normalizeS(){return this.hasHighS()?new I(this.r,i(-this.s),this.recovery):this}toDERRawBytes(){return Ut(this.toDERHex())}toDERHex(){return F.hexFromSig(this)}toCompactRawBytes(){return Ut(this.toCompactHex())}toCompactHex(){const h=s;return $t(this.r,h)+$t(this.s,h)}}const H={isValidPrivateKey(w){try{return l(w),!0}catch{return!1}},normPrivateKeyToScalar:l,randomPrivateKey:()=>{const w=ke(n.n);return hn(n.randomBytes(w),n.n)},precompute(w=8,h=d.BASE){return h._setWindowSize(w),h.multiply(BigInt(3)),h}};function y(w,h=!0){return d.fromPrivateKey(w).toRawBytes(h)}function u(w){if(typeof w=="bigint")return!1;if(w instanceof d)return!0;const E=z("key",w).length,N=e.BYTES,A=N+1,q=2N+1;if(!(n.allowedPrivateKeyLengths\|\|s===A))return E===A\|\|E===q}function m(w,h,E=!0){if(u(w)===!0)throw new Error("first arg must be private key");if(u(h)===!1)throw new Error("second arg must be public key");return d.fromHex(h).multiply(l(w)).toRawBytes(E)}const x=n.bits2int\|\|function(w){if(w.length>8192)throw new Error("input is too large");const h=X(w),E=w.length8-o;return E>0?h>>BigInt(E):h},v=n.bits2int_modN\|\|function(w){return i(x(w))},O=Ct(o);function U(w){return ut("num < 2^"+o,w,W,O),lt(w,s)}function L(w,h,E=B){if(["recovered","canonical"].some(ct=>ct in E))throw new Error("sign() legacy options not supported");const{hash:N,randomBytes:A}=n;let{lowS:q,prehash:C,extraEntropy:P}=E;q==null&&(q=!0),w=z("msgHash",w),ge(E),C&&(w=z("prehashed msgHash",N(w)));const Q=v(w),G=l(h),j=[U(G),U(Q)];if(P!=null&&P!==!1){const ct=P===!0?A(e.BYTES):P;j.push(z("extraEntropy",ct))}const dt=D(...j),tt=Q;function Vt(ct){const ht=x(ct);if(!b(ht))return;const Pt=a(ht),mt=d.BASE.multiply(ht).toAffine(),ft=i(mt.x);if(ft===W)return;const bt=i(Pti(tt+ftG));if(bt===W)return;let yt=(mt.x===ft?0:2)\|Number(mt.y&k),wt=bt;return q&&_(bt)&&(wt=g(bt),yt^=1),new I(ft,wt,yt)}return{seed:dt,k2sig:Vt}}const B={lowS:n.lowS,prehash:!1},R={lowS:n.lowS,prehash:!1};function S(w,h,E=B){const{seed:N,k2sig:A}=L(w,h,E),q=n;return on(q.hash.outputLen,q.nByteLength,q.hmac)(N,A)}d.BASE._setWindowSize(8);function V(w,h,E,N=R){var yt;const A=w;h=z("msgHash",h),E=z("publicKey",E);const{lowS:q,prehash:C,format:P}=N;if(ge(N),"strict"in N)throw new Error("options.strict was renamed to lowS");if(P!==void 0&&P!=="compact"&&P!=="der")throw new Error("format must be compact or der");const Q=typeof A=="string"\|\|_t(A),G=!Q&&!P&&typeof A=="object"&&A!==null&&typeof A.r=="bigint"&&typeof A.s=="bigint";if(!Q&&!G)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let j,dt;try{if(G&&(j=new I(A.r,A.s)),Q){try{P!=="compact"&&(j=I.fromDER(A))}catch(wt){if(!(wt instanceof F.Err))throw wt}!j&&P!=="der"&&(j=I.fromCompact(A))}dt=d.fromHex(E)}catch{return!1}if(!j\|\|q&&j.hasHighS())return!1;C&&(h=n.hash(h));const{r:tt,s:Vt}=j,ct=v(h),ht=a(Vt),Pt=i(ctht),mt=i(ttht),ft=(yt=d.BASE.multiplyAndAddUnsafe(dt,Pt,mt))==null?void 0:yt.toAffine();return ft?i(ft.x)===tt:!1}return{CURVE:n,getPublicKey:y,getSharedSecret:m,sign:S,verify:V,ProjectivePoint:d,Signature:I,utils:H}}function Bn(t,n){const e=t.ORDER;let r=W;for(let _=e-k;_%rt===W;_/=rt)r+=k;const s=r,o=rt<<s-k-k,c=ort,f=(e-k)/c,i=(f-k)/rt,a=c-k,d=o,l=t.pow(n,f),p=t.pow(n,(f+k)/rt);let b=(_,g)=>{let T=l,I=t.pow(g,a),H=t.sqr(I);H=t.mul(H,g);let y=t.mul(_,H);y=t.pow(y,i),y=t.mul(y,I),I=t.mul(y,g),H=t.mul(y,_);let u=t.mul(H,I);y=t.pow(u,d);let m=t.eql(y,t.ONE);I=t.mul(H,p),y=t.mul(u,T),H=t.cmov(I,H,m),u=t.cmov(y,u,m);for(let x=s;x>k;x--){let v=x-rt;v=rt<<v-k;let O=t.pow(u,v);const U=t.eql(O,t.ONE);I=t.mul(H,T),T=t.mul(T,T),O=t.mul(u,T),H=t.cmov(I,H,U),u=t.cmov(O,u,U)}return{isValid:m,value:H}};if(t.ORDER%te===pt){const _=(t.ORDER-pt)/te,g=t.sqrt(t.neg(n));b=(T,I)=>{let H=t.sqr(I);const y=t.mul(T,I);H=t.mul(H,y);let u=t.pow(H,_);u=t.mul(u,y);const m=t.mul(u,g),x=t.mul(t.sqr(u),I),v=t.eql(x,T);let O=t.cmov(m,u,v);return{isValid:v,value:O}}}return b}function Sn(t,n){if(Ue(t),!t.isValid(n.A)\|\|!t.isValid(n.B)\|\|!t.isValid(n.Z))throw new Error("mapToCurveSimpleSWU: invalid opts");const e=Bn(t,n.Z);if(!t.isOdd)throw new Error("Fp.isOdd is not implemented!");return r=>{let s,o,c,f,i,a,d,l;s=t.sqr(r),s=t.mul(s,n.Z),o=t.sqr(s),o=t.add(o,s),c=t.add(o,t.ONE),c=t.mul(c,n.B),f=t.cmov(n.Z,t.neg(o),!t.eql(o,t.ZERO)),f=t.mul(f,n.A),o=t.sqr(c),a=t.sqr(f),i=t.mul(a,n.A),o=t.add(o,i),o=t.mul(o,c),a=t.mul(a,f),i=t.mul(a,n.B),o=t.add(o,i),d=t.mul(s,c);const{isValid:p,value:b}=e(o,a);l=t.mul(s,r),l=t.mul(l,b),d=t.cmov(d,c,p),l=t.cmov(l,b,p);const _=t.isOdd(r)===t.isOdd(l);l=t.cmov(t.neg(l),l,_);const g=Zt(t,[f],!0)[0];return d=t.mul(d,g),{x:d,y:l}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function An(t){return{hash:t,hmac:(n,...e)=>Se(t,n,$e(...e)),randomBytes:ve}}function _n(t,n){const e=r=>vn({...t,...An(r)});return{...e(n),create:e}}const In=X;function ot(t,n){if(Bt(t),Bt(n),t<0\|\|t>=1<<8n)throw new Error("invalid I2OSP input: "+t);const e=Array.from({length:n}).fill(0);for(let r=n-1;r>=0;r--)e[r]=t&255,t>>>=8;return new Uint8Array(e)}function On(t,n){const e=new Uint8Array(t.length);for(let r=0;r<t.length;r++)e[r]=t[r]^n[r];return e}function Bt(t){if(!Number.isSafeInteger(t))throw new Error("number expected")}function qn(t,n,e,r){it(t),it(n),Bt(e),n.length>255&&(n=r(D(oe("H2C-OVERSIZE-DST-"),n)));const{outputLen:s,blockLen:o}=r,c=Math.ceil(e/s);if(e>65535\|\|c>255)throw new Error("expand_message_xmd: invalid lenInBytes");const f=D(n,ot(n.length,1)),i=ot(0,o),a=ot(e,2),d=new Array(c),l=r(D(i,t,a,ot(0,1),f));d[0]=r(D(l,ot(1,1),f));for(let b=1;b<=c;b++){const _=[On(l,d[b-1]),ot(b+1,1),f];d[b]=r(D(..._))}return D(...d).slice(0,e)}function Nn(t,n,e,r,s){if(it(t),it(n),Bt(e),n.length>255){const o=Math.ceil(2r/8);n=s.create({dkLen:o}).update(oe("H2C-OVERSIZE-DST-")).update(n).digest()}if(e>65535\|\|n.length>255)throw new Error("expand_message_xof: invalid lenInBytes");return s.create({dkLen:e}).update(t).update(ot(e,2)).update(n).update(ot(n.length,1)).digest()}function me(t,n,e){It(e,{DST:"stringOrUint8Array",p:"bigint",m:"isSafeInteger",k:"isSafeInteger",hash:"hash"});const{p:r,k:s,m:o,hash:c,expand:f,DST:i}=e;it(t),Bt(n);const a=typeof i=="string"?oe(i):i,d=r.toString(2).length,l=Math.ceil((d+s)/8),p=nol;let b;if(f==="xmd")b=qn(t,a,p,c);else if(f==="xof")b=Nn(t,a,p,s,c);else if(f==="_internal_pass")b=t;else throw new Error('expand must be "xmd" or "xof"');const _=new Array(n);for(let g=0;g<n;g++){const T=new Array(o);for(let I=0;I<o;I++){const H=l(I+go),y=b.subarray(H,H+l);T[I]=Z(In(y),r)}_[g]=T}return _}function Rn(t,n){const e=n.map(r=>Array.from(r).reverse());return(r,s)=>{const[o,c,f,i]=e.map(l=>l.reduce((p,b)=>t.add(t.mul(p,r),b))),[a,d]=Zt(t,[c,i],!0);return r=t.mul(o,a),s=t.mul(s,t.mul(f,d)),{x:r,y:s}}}function Hn(t,n,e){if(typeof n!="function")throw new Error("mapToCurve() must be defined");function r(o){return t.fromAffine(n(o))}function s(o){const c=o.clearCofactor();return c.equals(t.ZERO)?t.ZERO:(c.assertValidity(),c)}return{defaults:e,hashToCurve(o,c){const f=me(o,2,{...e,DST:e.DST,...c}),i=r(f[0]),a=r(f[1]);return s(i.add(a))},encodeToCurve(o,c){const f=me(o,1,{...e,DST:e.encodeDST,...c});return s(r(f[0]))},mapToCurve(o){if(!Array.isArray(o))throw new Error("expected array of bigints");for(const c of o)if(typeof c!="bigint")throw new Error("expected array of bigints");return s(r(o))}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const Ot=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),Lt=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),se=BigInt(0),St=BigInt(1),Tt=BigInt(2),be=(t,n)=>(t+n/Tt)/n;function Ve(t){const n=Ot,e=BigInt(3),r=BigInt(6),s=BigInt(11),o=BigInt(22),c=BigInt(23),f=BigInt(44),i=BigInt(88),a=ttt%n,d=aat%n,l=Y(d,e,n)d%n,p=Y(l,e,n)d%n,b=Y(p,Tt,n)a%n,_=Y(b,s,n)b%n,g=Y(_,o,n)_%n,T=Y(g,f,n)g%n,I=Y(T,i,n)T%n,H=Y(I,f,n)g%n,y=Y(H,e,n)d%n,u=Y(y,c,n)_%n,m=Y(u,r,n)a%n,x=Y(m,Tt,n);if(!st.eql(st.sqr(x),t))throw new Error("Cannot find square root");return x}const st=ie(Ot,void 0,void 0,{sqrt:Ve}),zt=_n({a:se,b:BigInt(7),Fp:st,n:Lt,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const n=Lt,e=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-StBigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),o=e,c=BigInt("0x100000000000000000000000000000000"),f=be(ot,n),i=be(-rt,n);let a=Z(t-fe-is,n),d=Z(-fr-io,n);const l=a>c,p=d>c;if(l&&(a=n-a),p&&(d=n-d),a>c\|\|d>c)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:l,k1:a,k2neg:p,k2:d}}}},Ht),ye={};function kt(t,...n){let e=ye[t];if(e===void 0){const r=Ht(Uint8Array.from(t,s=>s.charCodeAt(0)));e=D(r,r),ye[t]=e}return Ht(D(e,...n))}const ce=t=>t.toRawBytes(!0).slice(1),ee=t=>lt(t,32),Xt=t=>Z(t,Ot),At=t=>Z(t,Lt),fe=(()=>zt.ProjectivePoint)(),Un=(t,n,e)=>fe.BASE.multiplyAndAddUnsafe(t,n,e);function ne(t){let n=zt.utils.normPrivateKeyToScalar(t),e=fe.fromPrivateKey(n);return{scalar:e.hasEvenY()?n:At(-n),bytes:ce(e)}}function Pe(t){ut("x",t,St,Ot);const n=Xt(tt),e=Xt(nt+BigInt(7));let r=Ve(e);r%Tt!==se&&(r=Xt(-r));const s=new fe(t,r,St);return s.assertValidity(),s}const gt=X;function Me(...t){return At(gt(kt("BIP0340/challenge",...t)))}function Ln(t){return ne(t).bytes}function Tn(t,n,e=ve(32)){const r=z("message",t),{bytes:s,scalar:o}=ne(n),c=z("auxRand",e,32),f=ee(o^gt(kt("BIP0340/aux",c))),i=kt("BIP0340/nonce",f,s,r),a=At(gt(i));if(a===se)throw new Error("sign failed: k is zero");const{bytes:d,scalar:l}=ne(a),p=Me(d,s,r),b=new Uint8Array(64);if(b.set(d,0),b.set(ee(At(l+p*o)),32),!je(b,r,s))throw new Error("sign: Invalid signature produced");return b}function je(t,n,e){const r=z("signature",t,64),s=z("message",n),o=z("publicKey",e,32);try{const c=Pe(gt(o)),f=gt(r.subarray(0,32));if(!vt(f,St,Ot))return!1;const i=gt(r.subarray(32,64));if(!vt(i,St,Lt))return!1;const a=Me(ee(f),ce(c),s),d=Un(c,i,At(-a));return!(!d\|\|!d.hasEvenY()\|\|d.toAffine().x!==f)}catch{return!1}}const sr=(()=>({getPublicKey:Ln,sign:Tn,verify:je,utils:{randomPrivateKey:zt.utils.randomPrivateKey,lift_x:Pe,pointToBytes:ce,numberToBytesBE:lt,bytesToNumberBE:X,taggedHash:kt,mod:Z}}))(),kn=(()=>Rn(st,[["0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7","0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581","0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262","0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c"],["0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b","0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14","0x0000000000000000000000000000000000000000000000000000000000000001"],["0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c","0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3","0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931","0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84"],["0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b","0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573","0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f","0x0000000000000000000000000000000000000000000000000000000000000001"]].map(t=>t.map(n=>BigInt(n)))))(),Cn=(()=>Sn(st,{A:BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),B:BigInt("1771"),Z:st.create(BigInt("-11"))}))(),Ke=(()=>Hn(zt.ProjectivePoint,t=>{const{x:n,y:e}=Cn(st.create(t[0]));return kn(n,e)},{DST:"secp256k1_XMD:SHA-256_SSWU_RO_",encodeDST:"secp256k1_XMD:SHA-256_SSWU_NU_",p:st.ORDER,m:1,k:128,expand:"xmd",hash:Ht}))(),cr=(()=>Ke.hashToCurve)(),fr=(()=>Ke.encodeToCurve)();export{fr as encodeToCurve,cr as hashToCurve,sr as schnorr,zt as secp256k1,Ke as secp256k1_hasher};
1	+ import{H as pe,v as Mt,w as Nt,x as xe,y as Ee,z as Ye,A as Rt,C as De,E as $,G as Ge,I as We,J as $e,L as ve}from"./wallets-331c410d.js";import"./signing-67cb53a5.js";import"./prepare-contract-call-ac31a985.js";import"./utils-74c631d9.js";import"./index-355751ab.js";import"./to-serializable-transaction-2ea802ff.js";import"./transaction-e500e7c4.js";import"./get-bytecode-8cb4e224.js";import"./execute-6c88dd5f.js";import"./redirect-state-202ec690.js";import"./index-5f847edd.js";import"./ethereum-667be7dc.js";import"./types-ba990c1e.js";import"./store-af6293b2.js";import"./hashTypedData-ba8e399b.js";import"./send-transaction-5984dc09.js";import"./eth_sendRawTransaction-5ae15b91.js";import"./index-276c1c99.js";import"./index-accd8060.js";import"./index-2124b7cd.js";import"./index-6ab757a5.js";import"./index-69ac8519.js";function Xe(t,n,e,r){if(typeof t.setBigUint64=="function")return t.setBigUint64(n,e,r);const s=BigInt(32),o=BigInt(4294967295),c=Number(e>>s&o),f=Number(e&o),i=r?4:0,a=r?0:4;t.setUint32(n+i,c,r),t.setUint32(n+a,f,r)}function Qe(t,n,e){return t&n^~t&e}function Je(t,n,e){return t&n^t&e^n&e}class Fe extends pe{constructor(n,e,r,s){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=n,this.outputLen=e,this.padOffset=r,this.isLE=s,this.buffer=new Uint8Array(n),this.view=Mt(this.buffer)}update(n){Nt(this),n=xe(n),Ee(n);const{view:e,buffer:r,blockLen:s}=this,o=n.length;for(let c=0;c<o;){const f=Math.min(s-this.pos,o-c);if(f===s){const i=Mt(n);for(;s<=o-c;c+=s)this.process(i,c);continue}r.set(n.subarray(c,c+f),this.pos),this.pos+=f,c+=f,this.pos===s&&(this.process(e,0),this.pos=0)}return this.length+=n.length,this.roundClean(),this}digestInto(n){Nt(this),Ye(n,this),this.finished=!0;const{buffer:e,view:r,blockLen:s,isLE:o}=this;let{pos:c}=this;e[c++]=128,Rt(this.buffer.subarray(c)),this.padOffset>s-c&&(this.process(r,0),c=0);for(let l=c;l<s;l++)e[l]=0;Xe(r,s-8,BigInt(this.length8),o),this.process(r,0);const f=Mt(n),i=this.outputLen;if(i%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const a=i/4,d=this.get();if(a>d.length)throw new Error("_sha2: outputLen bigger than state");for(let l=0;l<a;l++)f.setUint32(4l,d[l],o)}digest(){const{buffer:n,outputLen:e}=this;this.digestInto(n);const r=n.slice(0,e);return this.destroy(),r}_cloneInto(n){n\|\|(n=new this.constructor),n.set(...this.get());const{blockLen:e,buffer:r,length:s,finished:o,destroyed:c,pos:f}=this;return n.destroyed=c,n.finished=o,n.length=s,n.pos=f,s%e&&n.buffer.set(r),n}clone(){return this._cloneInto()}}const et=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),tn=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),nt=new Uint32Array(64);class en extends Fe{constructor(n=32){super(64,n,8,!1),this.A=et[0]\|0,this.B=et[1]\|0,this.C=et[2]\|0,this.D=et[3]\|0,this.E=et[4]\|0,this.F=et[5]\|0,this.G=et[6]\|0,this.H=et[7]\|0}get(){const{A:n,B:e,C:r,D:s,E:o,F:c,G:f,H:i}=this;return[n,e,r,s,o,c,f,i]}set(n,e,r,s,o,c,f,i){this.A=n\|0,this.B=e\|0,this.C=r\|0,this.D=s\|0,this.E=o\|0,this.F=c\|0,this.G=f\|0,this.H=i\|0}process(n,e){for(let l=0;l<16;l++,e+=4)nt[l]=n.getUint32(e,!1);for(let l=16;l<64;l++){const p=nt[l-15],b=nt[l-2],_=$(p,7)^$(p,18)^p>>>3,g=$(b,17)^$(b,19)^b>>>10;nt[l]=g+nt[l-7]+_+nt[l-16]\|0}let{A:r,B:s,C:o,D:c,E:f,F:i,G:a,H:d}=this;for(let l=0;l<64;l++){const p=$(f,6)^$(f,11)^$(f,25),b=d+p+Qe(f,i,a)+tn[l]+nt[l]\|0,g=($(r,2)^$(r,13)^$(r,22))+Je(r,s,o)\|0;d=a,a=i,i=f,f=c+b\|0,c=o,o=s,s=r,r=b+g\|0}r=r+this.A\|0,s=s+this.B\|0,o=o+this.C\|0,c=c+this.D\|0,f=f+this.E\|0,i=i+this.F\|0,a=a+this.G\|0,d=d+this.H\|0,this.set(r,s,o,c,f,i,a,d)}roundClean(){Rt(nt)}destroy(){this.set(0,0,0,0,0,0,0,0),Rt(this.buffer)}}const Ht=De(()=>new en);class Be extends pe{constructor(n,e){super(),this.finished=!1,this.destroyed=!1,Ge(n);const r=xe(e);if(this.iHash=n.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 s=this.blockLen,o=new Uint8Array(s);o.set(r.length>s?n.create().update(r).digest():r);for(let c=0;c<o.length;c++)o[c]^=54;this.iHash.update(o),this.oHash=n.create();for(let c=0;c<o.length;c++)o[c]^=106;this.oHash.update(o),Rt(o)}update(n){return Nt(this),this.iHash.update(n),this}digestInto(n){Nt(this),Ee(n,this.outputLen),this.finished=!0,this.iHash.digestInto(n),this.oHash.update(n),this.oHash.digestInto(n),this.destroy()}digest(){const n=new Uint8Array(this.oHash.outputLen);return this.digestInto(n),n}_cloneInto(n){n\|\|(n=Object.create(Object.getPrototypeOf(this),{}));const{oHash:e,iHash:r,finished:s,destroyed:o,blockLen:c,outputLen:f}=this;return n=n,n.finished=s,n.destroyed=o,n.blockLen=c,n.outputLen=f,n.oHash=e._cloneInto(n.oHash),n.iHash=r._cloneInto(n.iHash),n}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const Se=(t,n,e)=>new Be(t,n).update(e).digest();Se.create=(t,n)=>new Be(t,n);/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const re=BigInt(0),Qt=BigInt(1);function _t(t){return t instanceof Uint8Array\|\|ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function it(t){if(!_t(t))throw new Error("Uint8Array expected")}function xt(t,n){if(typeof n!="boolean")throw new Error(t+" boolean expected, got "+n)}function qt(t){const n=t.toString(16);return n.length&1?"0"+n:n}function Ae(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?re:BigInt("0x"+t)}const _e=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",nn=Array.from({length:256},(t,n)=>n.toString(16).padStart(2,"0"));function Et(t){if(it(t),_e)return t.toHex();let n="";for(let e=0;e<t.length;e++)n+=nn[t[e]];return n}const J={_0:48,_9:57,A:65,F:70,a:97,f:102};function ae(t){if(t>=J._0&&t<=J._9)return t-J._0;if(t>=J.A&&t<=J.F)return t-(J.A-10);if(t>=J.a&&t<=J.f)return t-(J.a-10)}function Ut(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(_e)return Uint8Array.fromHex(t);const n=t.length,e=n/2;if(n%2)throw new Error("hex string expected, got unpadded hex of length "+n);const r=new Uint8Array(e);for(let s=0,o=0;s<e;s++,o+=2){const c=ae(t.charCodeAt(o)),f=ae(t.charCodeAt(o+1));if(c===void 0\|\|f===void 0){const i=t[o]+t[o+1];throw new Error('hex string expected, got non-hex character "'+i+'" at index '+o)}r[s]=c16+f}return r}function X(t){return Ae(Et(t))}function Ie(t){return it(t),Ae(Et(Uint8Array.from(t).reverse()))}function lt(t,n){return Ut(t.toString(16).padStart(n2,"0"))}function Oe(t,n){return lt(t,n).reverse()}function z(t,n,e){let r;if(typeof n=="string")try{r=Ut(n)}catch(o){throw new Error(t+" must be hex string or Uint8Array, cause: "+o)}else if(_t(n))r=Uint8Array.from(n);else throw new Error(t+" must be hex string or Uint8Array");const s=r.length;if(typeof e=="number"&&s!==e)throw new Error(t+" of length "+e+" expected, got "+s);return r}function D(...t){let n=0;for(let r=0;r<t.length;r++){const s=t[r];it(s),n+=s.length}const e=new Uint8Array(n);for(let r=0,s=0;r<t.length;r++){const o=t[r];e.set(o,s),s+=o.length}return e}function oe(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}const jt=t=>typeof t=="bigint"&&re<=t;function vt(t,n,e){return jt(t)&&jt(n)&&jt(e)&&n<=t&&t<e}function ut(t,n,e,r){if(!vt(n,e,r))throw new Error("expected valid "+t+": "+e+" <= n < "+r+", got "+n)}function rn(t){let n;for(n=0;t>re;t>>=Qt,n+=1);return n}const Ct=t=>(Qt<<BigInt(t))-Qt,Kt=t=>new Uint8Array(t),ue=t=>Uint8Array.from(t);function on(t,n,e){if(typeof t!="number"\|\|t<2)throw new Error("hashLen must be a number");if(typeof n!="number"\|\|n<2)throw new Error("qByteLen must be a number");if(typeof e!="function")throw new Error("hmacFn must be a function");let r=Kt(t),s=Kt(t),o=0;const c=()=>{r.fill(1),s.fill(0),o=0},f=(...l)=>e(s,r,...l),i=(l=Kt(0))=>{s=f(ue([0]),l),r=f(),l.length!==0&&(s=f(ue([1]),l),r=f())},a=()=>{if(o++>=1e3)throw new Error("drbg: tried 1000 values");let l=0;const p=[];for(;l<n;){r=f();const b=r.slice();p.push(b),l+=r.length}return D(...p)};return(l,p)=>{c(),i(l);let b;for(;!(b=p(a()));)i();return c(),b}}const sn={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"\|\|_t(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,n)=>n.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function It(t,n,e={}){const r=(s,o,c)=>{const f=sn[o];if(typeof f!="function")throw new Error("invalid validator function");const i=t[s];if(!(c&&i===void 0)&&!f(i,t))throw new Error("param "+String(s)+" is invalid. Expected "+o+", got "+i)};for(const[s,o]of Object.entries(n))r(s,o,!1);for(const[s,o]of Object.entries(e))r(s,o,!0);return t}function le(t){const n=new WeakMap;return(e,...r)=>{const s=n.get(e);if(s!==void 0)return s;const o=t(e,...r);return n.set(e,o),o}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const K=BigInt(0),M=BigInt(1),at=BigInt(2),cn=BigInt(3),qe=BigInt(4),Ne=BigInt(5),Re=BigInt(8);function Z(t,n){const e=t%n;return e>=K?e:n+e}function Y(t,n,e){let r=t;for(;n-- >K;)r=r,r%=e;return r}function Jt(t,n){if(t===K)throw new Error("invert: expected non-zero number");if(n<=K)throw new Error("invert: expected positive modulus, got "+n);let e=Z(t,n),r=n,s=K,o=M;for(;e!==K;){const f=r/e,i=r%e,a=s-of;r=e,e=i,s=o,o=a}if(r!==M)throw new Error("invert: does not exist");return Z(s,n)}function He(t,n){const e=(t.ORDER+M)/qe,r=t.pow(n,e);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function fn(t,n){const e=(t.ORDER-Ne)/Re,r=t.mul(n,at),s=t.pow(r,e),o=t.mul(n,s),c=t.mul(t.mul(o,at),s),f=t.mul(o,t.sub(c,t.ONE));if(!t.eql(t.sqr(f),n))throw new Error("Cannot find square root");return f}function an(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-M,e=0;for(;n%at===K;)n/=at,e++;let r=at;const s=ie(t);for(;de(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(e===1)return He;let o=s.pow(r,n);const c=(n+M)/at;return function(i,a){if(i.is0(a))return a;if(de(i,a)!==1)throw new Error("Cannot find square root");let d=e,l=i.mul(i.ONE,o),p=i.pow(a,n),b=i.pow(a,c);for(;!i.eql(p,i.ONE);){if(i.is0(p))return i.ZERO;let _=1,g=i.sqr(p);for(;!i.eql(g,i.ONE);)if(_++,g=i.sqr(g),_===d)throw new Error("Cannot find square root");const T=M<<BigInt(d-_-1),I=i.pow(l,T);d=_,l=i.sqr(I),p=i.mul(p,l),b=i.mul(b,I)}return b}}function un(t){return t%qe===cn?He:t%Re===Ne?fn:an(t)}const ln=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Ue(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},e=ln.reduce((r,s)=>(r[s]="function",r),n);return It(t,e)}function dn(t,n,e){if(e<K)throw new Error("invalid exponent, negatives unsupported");if(e===K)return t.ONE;if(e===M)return n;let r=t.ONE,s=n;for(;e>K;)e&M&&(r=t.mul(r,s)),s=t.sqr(s),e>>=M;return r}function Zt(t,n,e=!1){const r=new Array(n.length).fill(e?t.ZERO:void 0),s=n.reduce((c,f,i)=>t.is0(f)?c:(r[i]=c,t.mul(c,f)),t.ONE),o=t.inv(s);return n.reduceRight((c,f,i)=>t.is0(f)?c:(r[i]=t.mul(c,r[i]),t.mul(c,f)),o),r}function de(t,n){const e=(t.ORDER-M)/at,r=t.pow(n,e),s=t.eql(r,t.ONE),o=t.eql(r,t.ZERO),c=t.eql(r,t.neg(t.ONE));if(!s&&!o&&!c)throw new Error("invalid Legendre symbol result");return s?1:o?0:-1}function Le(t,n){n!==void 0&&We(n);const e=n!==void 0?n:t.toString(2).length,r=Math.ceil(e/8);return{nBitLength:e,nByteLength:r}}function ie(t,n,e=!1,r={}){if(t<=K)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:o}=Le(t,n);if(o>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let c;const f=Object.freeze({ORDER:t,isLE:e,BITS:s,BYTES:o,MASK:Ct(s),ZERO:K,ONE:M,create:i=>Z(i,t),isValid:i=>{if(typeof i!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof i);return K<=i&&i<t},is0:i=>i===K,isOdd:i=>(i&M)===M,neg:i=>Z(-i,t),eql:(i,a)=>i===a,sqr:i=>Z(ii,t),add:(i,a)=>Z(i+a,t),sub:(i,a)=>Z(i-a,t),mul:(i,a)=>Z(ia,t),pow:(i,a)=>dn(f,i,a),div:(i,a)=>Z(iJt(a,t),t),sqrN:i=>ii,addN:(i,a)=>i+a,subN:(i,a)=>i-a,mulN:(i,a)=>ia,inv:i=>Jt(i,t),sqrt:r.sqrt\|\|(i=>(c\|\|(c=un(t)),c(f,i))),toBytes:i=>e?Oe(i,o):lt(i,o),fromBytes:i=>{if(i.length!==o)throw new Error("Field.fromBytes: expected "+o+" bytes, got "+i.length);return e?Ie(i):X(i)},invertBatch:i=>Zt(f,i),cmov:(i,a,d)=>d?a:i});return Object.freeze(f)}function Te(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function ke(t){const n=Te(t);return n+Math.ceil(n/2)}function hn(t,n,e=!1){const r=t.length,s=Te(n),o=ke(n);if(r<16\|\|r<o\|\|r>1024)throw new Error("expected "+o+"-1024 bytes of input, got "+r);const c=e?Ie(t):X(t),f=Z(c,n-M)+M;return e?Oe(f,s):lt(f,s)}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const he=BigInt(0),Ft=BigInt(1);function Yt(t,n){const e=n.negate();return t?e:n}function Ce(t,n){if(!Number.isSafeInteger(t)\|\|t<=0\|\|t>n)throw new Error("invalid window size, expected [1.."+n+"], got W="+t)}function Dt(t,n){Ce(t,n);const e=Math.ceil(n/t)+1,r=2(t-1),s=2t,o=Ct(t),c=BigInt(t);return{windows:e,windowSize:r,mask:o,maxNumber:s,shiftBy:c}}function we(t,n,e){const{windowSize:r,mask:s,maxNumber:o,shiftBy:c}=e;let f=Number(t&s),i=t>>c;f>r&&(f-=o,i+=Ft);const a=nr,d=a+Math.abs(f)-1,l=f===0,p=f<0,b=n%2!==0;return{nextN:i,offset:d,isZero:l,isNeg:p,isNegF:b,offsetF:a}}function wn(t,n){if(!Array.isArray(t))throw new Error("array expected");t.forEach((e,r)=>{if(!(e instanceof n))throw new Error("invalid point at index "+r)})}function gn(t,n){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((e,r)=>{if(!n.isValid(e))throw new Error("invalid scalar at index "+r)})}const Gt=new WeakMap,Ze=new WeakMap;function Wt(t){return Ze.get(t)\|\|1}function mn(t,n){return{constTimeNegate:Yt,hasPrecomputes(e){return Wt(e)!==1},unsafeLadder(e,r,s=t.ZERO){let o=e;for(;r>he;)r&Ft&&(s=s.add(o)),o=o.double(),r>>=Ft;return s},precomputeWindow(e,r){const{windows:s,windowSize:o}=Dt(r,n),c=[];let f=e,i=f;for(let a=0;a<s;a++){i=f,c.push(i);for(let d=1;d<o;d++)i=i.add(f),c.push(i);f=i.double()}return c},wNAF(e,r,s){let o=t.ZERO,c=t.BASE;const f=Dt(e,n);for(let i=0;i<f.windows;i++){const{nextN:a,offset:d,isZero:l,isNeg:p,isNegF:b,offsetF:_}=we(s,i,f);s=a,l?c=c.add(Yt(b,r[_])):o=o.add(Yt(p,r[d]))}return{p:o,f:c}},wNAFUnsafe(e,r,s,o=t.ZERO){const c=Dt(e,n);for(let f=0;f<c.windows&&s!==he;f++){const{nextN:i,offset:a,isZero:d,isNeg:l}=we(s,f,c);if(s=i,!d){const p=r[a];o=o.add(l?p.negate():p)}}return o},getPrecomputes(e,r,s){let o=Gt.get(r);return o\|\|(o=this.precomputeWindow(r,e),e!==1&&Gt.set(r,s(o))),o},wNAFCached(e,r,s){const o=Wt(e);return this.wNAF(o,this.getPrecomputes(o,e,s),r)},wNAFCachedUnsafe(e,r,s,o){const c=Wt(e);return c===1?this.unsafeLadder(e,r,o):this.wNAFUnsafe(c,this.getPrecomputes(c,e,s),r,o)},setWindowSize(e,r){Ce(r,n),Ze.set(e,r),Gt.delete(e)}}}function bn(t,n,e,r){wn(e,t),gn(r,n);const s=e.length,o=r.length;if(s!==o)throw new Error("arrays of points and scalars must have equal length");const c=t.ZERO,f=rn(BigInt(s));let i=1;f>12?i=f-3:f>4?i=f-2:f>0&&(i=2);const a=Ct(i),d=new Array(Number(a)+1).fill(c),l=Math.floor((n.BITS-1)/i)i;let p=c;for(let b=l;b>=0;b-=i){d.fill(c);for(let g=0;g<o;g++){const T=r[g],I=Number(T>>BigInt(b)&a);d[I]=d[I].add(e[g])}let _=c;for(let g=d.length-1,T=c;g>0;g--)T=T.add(d[g]),_=_.add(T);if(p=p.add(_),b!==0)for(let g=0;g<i;g++)p=p.double()}return p}function ze(t){return Ue(t.Fp),It(t,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Le(t.n,t.nBitLength),...t,p:t.Fp.ORDER})}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function ge(t){t.lowS!==void 0&&xt("lowS",t.lowS),t.prehash!==void 0&&xt("prehash",t.prehash)}function yn(t){const n=ze(t);It(n,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:e,Fp:r,a:s}=n;if(e){if(!r.eql(s,r.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof e!="object"\|\|typeof e.beta!="bigint"\|\|typeof e.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...n})}class pn extends Error{constructor(n=""){super(n)}}const F={Err:pn,_tlv:{encode:(t,n)=>{const{Err:e}=F;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length&1)throw new e("tlv.encode: unpadded data");const r=n.length/2,s=qt(r);if(s.length/2&128)throw new e("tlv.encode: long form length too big");const o=r>127?qt(s.length/2\|128):"";return qt(t)+o+s+n},decode(t,n){const{Err:e}=F;let r=0;if(t<0\|\|t>256)throw new e("tlv.encode: wrong tag");if(n.length<2\|\|n[r++]!==t)throw new e("tlv.decode: wrong tlv");const s=n[r++],o=!!(s&128);let c=0;if(!o)c=s;else{const i=s&127;if(!i)throw new e("tlv.decode(long): indefinite length not supported");if(i>4)throw new e("tlv.decode(long): byte length is too big");const a=n.subarray(r,r+i);if(a.length!==i)throw new e("tlv.decode: length bytes not complete");if(a[0]===0)throw new e("tlv.decode(long): zero leftmost byte");for(const d of a)c=c<<8\|d;if(r+=i,c<128)throw new e("tlv.decode(long): not minimal encoding")}const f=n.subarray(r,r+c);if(f.length!==c)throw new e("tlv.decode: wrong value length");return{v:f,l:n.subarray(r+c)}}},_int:{encode(t){const{Err:n}=F;if(t<W)throw new n("integer: negative integers are not allowed");let e=qt(t);if(Number.parseInt(e[0],16)&8&&(e="00"+e),e.length&1)throw new n("unexpected DER parsing assertion: unpadded hex");return e},decode(t){const{Err:n}=F;if(t[0]&128)throw new n("invalid signature integer: negative");if(t[0]===0&&!(t[1]&128))throw new n("invalid signature integer: unnecessary leading zero");return X(t)}},toSig(t){const{Err:n,_int:e,_tlv:r}=F,s=z("signature",t),{v:o,l:c}=r.decode(48,s);if(c.length)throw new n("invalid signature: left bytes after parsing");const{v:f,l:i}=r.decode(2,o),{v:a,l:d}=r.decode(2,i);if(d.length)throw new n("invalid signature: left bytes after parsing");return{r:e.decode(f),s:e.decode(a)}},hexFromSig(t){const{_tlv:n,_int:e}=F,r=n.encode(2,e.encode(t.r)),s=n.encode(2,e.encode(t.s)),o=r+s;return n.encode(48,o)}};function $t(t,n){return Et(lt(t,n))}const W=BigInt(0),k=BigInt(1),rt=BigInt(2),pt=BigInt(3),te=BigInt(4);function xn(t){const n=yn(t),{Fp:e}=n,r=ie(n.n,n.nBitLength),s=n.toBytes\|\|((y,u,m)=>{const x=u.toAffine();return D(Uint8Array.from([4]),e.toBytes(x.x),e.toBytes(x.y))}),o=n.fromBytes\|\|(y=>{const u=y.subarray(1),m=e.fromBytes(u.subarray(0,e.BYTES)),x=e.fromBytes(u.subarray(e.BYTES,2e.BYTES));return{x:m,y:x}});function c(y){const{a:u,b:m}=n,x=e.sqr(y),v=e.mul(x,y);return e.add(e.add(v,e.mul(y,u)),m)}function f(y,u){const m=e.sqr(u),x=c(y);return e.eql(m,x)}if(!f(n.Gx,n.Gy))throw new Error("bad curve params: generator point");const i=e.mul(e.pow(n.a,pt),te),a=e.mul(e.sqr(n.b),BigInt(27));if(e.is0(e.add(i,a)))throw new Error("bad curve params: a or b");function d(y){return vt(y,k,n.n)}function l(y){const{allowedPrivateKeyLengths:u,nByteLength:m,wrapPrivateKey:x,n:v}=n;if(u&&typeof y!="bigint"){if(_t(y)&&(y=Et(y)),typeof y!="string"\|\|!u.includes(y.length))throw new Error("invalid private key");y=y.padStart(m2,"0")}let O;try{O=typeof y=="bigint"?y:X(z("private key",y,m))}catch{throw new Error("invalid private key, expected hex or "+m+" bytes, got "+typeof y)}return x&&(O=Z(O,v)),ut("private key",O,k,v),O}function p(y){if(!(y instanceof g))throw new Error("ProjectivePoint expected")}const b=le((y,u)=>{const{px:m,py:x,pz:v}=y;if(e.eql(v,e.ONE))return{x:m,y:x};const O=y.is0();u==null&&(u=O?e.ONE:e.inv(v));const U=e.mul(m,u),L=e.mul(x,u),B=e.mul(v,u);if(O)return{x:e.ZERO,y:e.ZERO};if(!e.eql(B,e.ONE))throw new Error("invZ was invalid");return{x:U,y:L}}),_=le(y=>{if(y.is0()){if(n.allowInfinityPoint&&!e.is0(y.py))return;throw new Error("bad point: ZERO")}const{x:u,y:m}=y.toAffine();if(!e.isValid(u)\|\|!e.isValid(m))throw new Error("bad point: x or y not FE");if(!f(u,m))throw new Error("bad point: equation left != right");if(!y.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class g{constructor(u,m,x){if(u==null\|\|!e.isValid(u))throw new Error("x required");if(m==null\|\|!e.isValid(m)\|\|e.is0(m))throw new Error("y required");if(x==null\|\|!e.isValid(x))throw new Error("z required");this.px=u,this.py=m,this.pz=x,Object.freeze(this)}static fromAffine(u){const{x:m,y:x}=u\|\|{};if(!u\|\|!e.isValid(m)\|\|!e.isValid(x))throw new Error("invalid affine point");if(u instanceof g)throw new Error("projective point not allowed");const v=O=>e.eql(O,e.ZERO);return v(m)&&v(x)?g.ZERO:new g(m,x,e.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(u){const m=Zt(e,u.map(x=>x.pz));return u.map((x,v)=>x.toAffine(m[v])).map(g.fromAffine)}static fromHex(u){const m=g.fromAffine(o(z("pointHex",u)));return m.assertValidity(),m}static fromPrivateKey(u){return g.BASE.multiply(l(u))}static msm(u,m){return bn(g,r,u,m)}_setWindowSize(u){H.setWindowSize(this,u)}assertValidity(){_(this)}hasEvenY(){const{y:u}=this.toAffine();if(e.isOdd)return!e.isOdd(u);throw new Error("Field doesn't support isOdd")}equals(u){p(u);const{px:m,py:x,pz:v}=this,{px:O,py:U,pz:L}=u,B=e.eql(e.mul(m,L),e.mul(O,v)),R=e.eql(e.mul(x,L),e.mul(U,v));return B&&R}negate(){return new g(this.px,e.neg(this.py),this.pz)}double(){const{a:u,b:m}=n,x=e.mul(m,pt),{px:v,py:O,pz:U}=this;let L=e.ZERO,B=e.ZERO,R=e.ZERO,S=e.mul(v,v),V=e.mul(O,O),w=e.mul(U,U),h=e.mul(v,O);return h=e.add(h,h),R=e.mul(v,U),R=e.add(R,R),L=e.mul(u,R),B=e.mul(x,w),B=e.add(L,B),L=e.sub(V,B),B=e.add(V,B),B=e.mul(L,B),L=e.mul(h,L),R=e.mul(x,R),w=e.mul(u,w),h=e.sub(S,w),h=e.mul(u,h),h=e.add(h,R),R=e.add(S,S),S=e.add(R,S),S=e.add(S,w),S=e.mul(S,h),B=e.add(B,S),w=e.mul(O,U),w=e.add(w,w),S=e.mul(w,h),L=e.sub(L,S),R=e.mul(w,V),R=e.add(R,R),R=e.add(R,R),new g(L,B,R)}add(u){p(u);const{px:m,py:x,pz:v}=this,{px:O,py:U,pz:L}=u;let B=e.ZERO,R=e.ZERO,S=e.ZERO;const V=n.a,w=e.mul(n.b,pt);let h=e.mul(m,O),E=e.mul(x,U),N=e.mul(v,L),A=e.add(m,x),q=e.add(O,U);A=e.mul(A,q),q=e.add(h,E),A=e.sub(A,q),q=e.add(m,v);let C=e.add(O,L);return q=e.mul(q,C),C=e.add(h,N),q=e.sub(q,C),C=e.add(x,v),B=e.add(U,L),C=e.mul(C,B),B=e.add(E,N),C=e.sub(C,B),S=e.mul(V,q),B=e.mul(w,N),S=e.add(B,S),B=e.sub(E,S),S=e.add(E,S),R=e.mul(B,S),E=e.add(h,h),E=e.add(E,h),N=e.mul(V,N),q=e.mul(w,q),E=e.add(E,N),N=e.sub(h,N),N=e.mul(V,N),q=e.add(q,N),h=e.mul(E,q),R=e.add(R,h),h=e.mul(C,q),B=e.mul(A,B),B=e.sub(B,h),h=e.mul(A,E),S=e.mul(C,S),S=e.add(S,h),new g(B,R,S)}subtract(u){return this.add(u.negate())}is0(){return this.equals(g.ZERO)}wNAF(u){return H.wNAFCached(this,u,g.normalizeZ)}multiplyUnsafe(u){const{endo:m,n:x}=n;ut("scalar",u,W,x);const v=g.ZERO;if(u===W)return v;if(this.is0()\|\|u===k)return this;if(!m\|\|H.hasPrecomputes(this))return H.wNAFCachedUnsafe(this,u,g.normalizeZ);let{k1neg:O,k1:U,k2neg:L,k2:B}=m.splitScalar(u),R=v,S=v,V=this;for(;U>W\|\|B>W;)U&k&&(R=R.add(V)),B&k&&(S=S.add(V)),V=V.double(),U>>=k,B>>=k;return O&&(R=R.negate()),L&&(S=S.negate()),S=new g(e.mul(S.px,m.beta),S.py,S.pz),R.add(S)}multiply(u){const{endo:m,n:x}=n;ut("scalar",u,k,x);let v,O;if(m){const{k1neg:U,k1:L,k2neg:B,k2:R}=m.splitScalar(u);let{p:S,f:V}=this.wNAF(L),{p:w,f:h}=this.wNAF(R);S=H.constTimeNegate(U,S),w=H.constTimeNegate(B,w),w=new g(e.mul(w.px,m.beta),w.py,w.pz),v=S.add(w),O=V.add(h)}else{const{p:U,f:L}=this.wNAF(u);v=U,O=L}return g.normalizeZ([v,O])[0]}multiplyAndAddUnsafe(u,m,x){const v=g.BASE,O=(L,B)=>B===W\|\|B===k\|\|!L.equals(v)?L.multiplyUnsafe(B):L.multiply(B),U=O(this,m).add(O(u,x));return U.is0()?void 0:U}toAffine(u){return b(this,u)}isTorsionFree(){const{h:u,isTorsionFree:m}=n;if(u===k)return!0;if(m)return m(g,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:u,clearCofactor:m}=n;return u===k?this:m?m(g,this):this.multiplyUnsafe(n.h)}toRawBytes(u=!0){return xt("isCompressed",u),this.assertValidity(),s(g,this,u)}toHex(u=!0){return xt("isCompressed",u),Et(this.toRawBytes(u))}}g.BASE=new g(n.Gx,n.Gy,e.ONE),g.ZERO=new g(e.ZERO,e.ONE,e.ZERO);const{endo:T,nBitLength:I}=n,H=mn(g,T?Math.ceil(I/2):I);return{CURVE:n,ProjectivePoint:g,normPrivateKeyToScalar:l,weierstrassEquation:c,isWithinCurveOrder:d}}function En(t){const n=ze(t);return It(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function vn(t){const n=En(t),{Fp:e,n:r,nByteLength:s,nBitLength:o}=n,c=e.BYTES+1,f=2e.BYTES+1;function i(w){return Z(w,r)}function a(w){return Jt(w,r)}const{ProjectivePoint:d,normPrivateKeyToScalar:l,weierstrassEquation:p,isWithinCurveOrder:b}=xn({...n,toBytes(w,h,E){const N=h.toAffine(),A=e.toBytes(N.x),q=D;return xt("isCompressed",E),E?q(Uint8Array.from([h.hasEvenY()?2:3]),A):q(Uint8Array.from([4]),A,e.toBytes(N.y))},fromBytes(w){const h=w.length,E=w[0],N=w.subarray(1);if(h===c&&(E===2\|\|E===3)){const A=X(N);if(!vt(A,k,e.ORDER))throw new Error("Point is not on curve");const q=p(A);let C;try{C=e.sqrt(q)}catch(G){const j=G instanceof Error?": "+G.message:"";throw new Error("Point is not on curve"+j)}const P=(C&k)===k;return(E&1)===1!==P&&(C=e.neg(C)),{x:A,y:C}}else if(h===f&&E===4){const A=e.fromBytes(N.subarray(0,e.BYTES)),q=e.fromBytes(N.subarray(e.BYTES,2e.BYTES));return{x:A,y:q}}else{const A=c,q=f;throw new Error("invalid Point, expected length of "+A+", or uncompressed "+q+", got "+h)}}});function _(w){const h=r>>k;return w>h}function g(w){return _(w)?i(-w):w}const T=(w,h,E)=>X(w.slice(h,E));class I{constructor(h,E,N){ut("r",h,k,r),ut("s",E,k,r),this.r=h,this.s=E,N!=null&&(this.recovery=N),Object.freeze(this)}static fromCompact(h){const E=s;return h=z("compactSignature",h,E2),new I(T(h,0,E),T(h,E,2E))}static fromDER(h){const{r:E,s:N}=F.toSig(z("DER",h));return new I(E,N)}assertValidity(){}addRecoveryBit(h){return new I(this.r,this.s,h)}recoverPublicKey(h){const{r:E,s:N,recovery:A}=this,q=v(z("msgHash",h));if(A==null\|\|![0,1,2,3].includes(A))throw new Error("recovery id invalid");const C=A===2\|\|A===3?E+n.n:E;if(C>=e.ORDER)throw new Error("recovery id 2 or 3 invalid");const P=A&1?"03":"02",Q=d.fromHex(P+$t(C,e.BYTES)),G=a(C),j=i(-qG),dt=i(NG),tt=d.BASE.multiplyAndAddUnsafe(Q,j,dt);if(!tt)throw new Error("point at infinify");return tt.assertValidity(),tt}hasHighS(){return _(this.s)}normalizeS(){return this.hasHighS()?new I(this.r,i(-this.s),this.recovery):this}toDERRawBytes(){return Ut(this.toDERHex())}toDERHex(){return F.hexFromSig(this)}toCompactRawBytes(){return Ut(this.toCompactHex())}toCompactHex(){const h=s;return $t(this.r,h)+$t(this.s,h)}}const H={isValidPrivateKey(w){try{return l(w),!0}catch{return!1}},normPrivateKeyToScalar:l,randomPrivateKey:()=>{const w=ke(n.n);return hn(n.randomBytes(w),n.n)},precompute(w=8,h=d.BASE){return h._setWindowSize(w),h.multiply(BigInt(3)),h}};function y(w,h=!0){return d.fromPrivateKey(w).toRawBytes(h)}function u(w){if(typeof w=="bigint")return!1;if(w instanceof d)return!0;const E=z("key",w).length,N=e.BYTES,A=N+1,q=2N+1;if(!(n.allowedPrivateKeyLengths\|\|s===A))return E===A\|\|E===q}function m(w,h,E=!0){if(u(w)===!0)throw new Error("first arg must be private key");if(u(h)===!1)throw new Error("second arg must be public key");return d.fromHex(h).multiply(l(w)).toRawBytes(E)}const x=n.bits2int\|\|function(w){if(w.length>8192)throw new Error("input is too large");const h=X(w),E=w.length8-o;return E>0?h>>BigInt(E):h},v=n.bits2int_modN\|\|function(w){return i(x(w))},O=Ct(o);function U(w){return ut("num < 2^"+o,w,W,O),lt(w,s)}function L(w,h,E=B){if(["recovered","canonical"].some(ct=>ct in E))throw new Error("sign() legacy options not supported");const{hash:N,randomBytes:A}=n;let{lowS:q,prehash:C,extraEntropy:P}=E;q==null&&(q=!0),w=z("msgHash",w),ge(E),C&&(w=z("prehashed msgHash",N(w)));const Q=v(w),G=l(h),j=[U(G),U(Q)];if(P!=null&&P!==!1){const ct=P===!0?A(e.BYTES):P;j.push(z("extraEntropy",ct))}const dt=D(...j),tt=Q;function Vt(ct){const ht=x(ct);if(!b(ht))return;const Pt=a(ht),mt=d.BASE.multiply(ht).toAffine(),ft=i(mt.x);if(ft===W)return;const bt=i(Pti(tt+ftG));if(bt===W)return;let yt=(mt.x===ft?0:2)\|Number(mt.y&k),wt=bt;return q&&_(bt)&&(wt=g(bt),yt^=1),new I(ft,wt,yt)}return{seed:dt,k2sig:Vt}}const B={lowS:n.lowS,prehash:!1},R={lowS:n.lowS,prehash:!1};function S(w,h,E=B){const{seed:N,k2sig:A}=L(w,h,E),q=n;return on(q.hash.outputLen,q.nByteLength,q.hmac)(N,A)}d.BASE._setWindowSize(8);function V(w,h,E,N=R){var yt;const A=w;h=z("msgHash",h),E=z("publicKey",E);const{lowS:q,prehash:C,format:P}=N;if(ge(N),"strict"in N)throw new Error("options.strict was renamed to lowS");if(P!==void 0&&P!=="compact"&&P!=="der")throw new Error("format must be compact or der");const Q=typeof A=="string"\|\|_t(A),G=!Q&&!P&&typeof A=="object"&&A!==null&&typeof A.r=="bigint"&&typeof A.s=="bigint";if(!Q&&!G)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let j,dt;try{if(G&&(j=new I(A.r,A.s)),Q){try{P!=="compact"&&(j=I.fromDER(A))}catch(wt){if(!(wt instanceof F.Err))throw wt}!j&&P!=="der"&&(j=I.fromCompact(A))}dt=d.fromHex(E)}catch{return!1}if(!j\|\|q&&j.hasHighS())return!1;C&&(h=n.hash(h));const{r:tt,s:Vt}=j,ct=v(h),ht=a(Vt),Pt=i(ctht),mt=i(ttht),ft=(yt=d.BASE.multiplyAndAddUnsafe(dt,Pt,mt))==null?void 0:yt.toAffine();return ft?i(ft.x)===tt:!1}return{CURVE:n,getPublicKey:y,getSharedSecret:m,sign:S,verify:V,ProjectivePoint:d,Signature:I,utils:H}}function Bn(t,n){const e=t.ORDER;let r=W;for(let _=e-k;_%rt===W;_/=rt)r+=k;const s=r,o=rt<<s-k-k,c=ort,f=(e-k)/c,i=(f-k)/rt,a=c-k,d=o,l=t.pow(n,f),p=t.pow(n,(f+k)/rt);let b=(_,g)=>{let T=l,I=t.pow(g,a),H=t.sqr(I);H=t.mul(H,g);let y=t.mul(_,H);y=t.pow(y,i),y=t.mul(y,I),I=t.mul(y,g),H=t.mul(y,_);let u=t.mul(H,I);y=t.pow(u,d);let m=t.eql(y,t.ONE);I=t.mul(H,p),y=t.mul(u,T),H=t.cmov(I,H,m),u=t.cmov(y,u,m);for(let x=s;x>k;x--){let v=x-rt;v=rt<<v-k;let O=t.pow(u,v);const U=t.eql(O,t.ONE);I=t.mul(H,T),T=t.mul(T,T),O=t.mul(u,T),H=t.cmov(I,H,U),u=t.cmov(O,u,U)}return{isValid:m,value:H}};if(t.ORDER%te===pt){const _=(t.ORDER-pt)/te,g=t.sqrt(t.neg(n));b=(T,I)=>{let H=t.sqr(I);const y=t.mul(T,I);H=t.mul(H,y);let u=t.pow(H,_);u=t.mul(u,y);const m=t.mul(u,g),x=t.mul(t.sqr(u),I),v=t.eql(x,T);let O=t.cmov(m,u,v);return{isValid:v,value:O}}}return b}function Sn(t,n){if(Ue(t),!t.isValid(n.A)\|\|!t.isValid(n.B)\|\|!t.isValid(n.Z))throw new Error("mapToCurveSimpleSWU: invalid opts");const e=Bn(t,n.Z);if(!t.isOdd)throw new Error("Fp.isOdd is not implemented!");return r=>{let s,o,c,f,i,a,d,l;s=t.sqr(r),s=t.mul(s,n.Z),o=t.sqr(s),o=t.add(o,s),c=t.add(o,t.ONE),c=t.mul(c,n.B),f=t.cmov(n.Z,t.neg(o),!t.eql(o,t.ZERO)),f=t.mul(f,n.A),o=t.sqr(c),a=t.sqr(f),i=t.mul(a,n.A),o=t.add(o,i),o=t.mul(o,c),a=t.mul(a,f),i=t.mul(a,n.B),o=t.add(o,i),d=t.mul(s,c);const{isValid:p,value:b}=e(o,a);l=t.mul(s,r),l=t.mul(l,b),d=t.cmov(d,c,p),l=t.cmov(l,b,p);const _=t.isOdd(r)===t.isOdd(l);l=t.cmov(t.neg(l),l,_);const g=Zt(t,[f],!0)[0];return d=t.mul(d,g),{x:d,y:l}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /function An(t){return{hash:t,hmac:(n,...e)=>Se(t,n,$e(...e)),randomBytes:ve}}function _n(t,n){const e=r=>vn({...t,...An(r)});return{...e(n),create:e}}const In=X;function ot(t,n){if(Bt(t),Bt(n),t<0\|\|t>=1<<8n)throw new Error("invalid I2OSP input: "+t);const e=Array.from({length:n}).fill(0);for(let r=n-1;r>=0;r--)e[r]=t&255,t>>>=8;return new Uint8Array(e)}function On(t,n){const e=new Uint8Array(t.length);for(let r=0;r<t.length;r++)e[r]=t[r]^n[r];return e}function Bt(t){if(!Number.isSafeInteger(t))throw new Error("number expected")}function qn(t,n,e,r){it(t),it(n),Bt(e),n.length>255&&(n=r(D(oe("H2C-OVERSIZE-DST-"),n)));const{outputLen:s,blockLen:o}=r,c=Math.ceil(e/s);if(e>65535\|\|c>255)throw new Error("expand_message_xmd: invalid lenInBytes");const f=D(n,ot(n.length,1)),i=ot(0,o),a=ot(e,2),d=new Array(c),l=r(D(i,t,a,ot(0,1),f));d[0]=r(D(l,ot(1,1),f));for(let b=1;b<=c;b++){const _=[On(l,d[b-1]),ot(b+1,1),f];d[b]=r(D(..._))}return D(...d).slice(0,e)}function Nn(t,n,e,r,s){if(it(t),it(n),Bt(e),n.length>255){const o=Math.ceil(2r/8);n=s.create({dkLen:o}).update(oe("H2C-OVERSIZE-DST-")).update(n).digest()}if(e>65535\|\|n.length>255)throw new Error("expand_message_xof: invalid lenInBytes");return s.create({dkLen:e}).update(t).update(ot(e,2)).update(n).update(ot(n.length,1)).digest()}function me(t,n,e){It(e,{DST:"stringOrUint8Array",p:"bigint",m:"isSafeInteger",k:"isSafeInteger",hash:"hash"});const{p:r,k:s,m:o,hash:c,expand:f,DST:i}=e;it(t),Bt(n);const a=typeof i=="string"?oe(i):i,d=r.toString(2).length,l=Math.ceil((d+s)/8),p=nol;let b;if(f==="xmd")b=qn(t,a,p,c);else if(f==="xof")b=Nn(t,a,p,s,c);else if(f==="_internal_pass")b=t;else throw new Error('expand must be "xmd" or "xof"');const _=new Array(n);for(let g=0;g<n;g++){const T=new Array(o);for(let I=0;I<o;I++){const H=l(I+go),y=b.subarray(H,H+l);T[I]=Z(In(y),r)}_[g]=T}return _}function Rn(t,n){const e=n.map(r=>Array.from(r).reverse());return(r,s)=>{const[o,c,f,i]=e.map(l=>l.reduce((p,b)=>t.add(t.mul(p,r),b))),[a,d]=Zt(t,[c,i],!0);return r=t.mul(o,a),s=t.mul(s,t.mul(f,d)),{x:r,y:s}}}function Hn(t,n,e){if(typeof n!="function")throw new Error("mapToCurve() must be defined");function r(o){return t.fromAffine(n(o))}function s(o){const c=o.clearCofactor();return c.equals(t.ZERO)?t.ZERO:(c.assertValidity(),c)}return{defaults:e,hashToCurve(o,c){const f=me(o,2,{...e,DST:e.DST,...c}),i=r(f[0]),a=r(f[1]);return s(i.add(a))},encodeToCurve(o,c){const f=me(o,1,{...e,DST:e.encodeDST,...c});return s(r(f[0]))},mapToCurve(o){if(!Array.isArray(o))throw new Error("expected array of bigints");for(const c of o)if(typeof c!="bigint")throw new Error("expected array of bigints");return s(r(o))}}}/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /const Ot=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),Lt=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),se=BigInt(0),St=BigInt(1),Tt=BigInt(2),be=(t,n)=>(t+n/Tt)/n;function Ve(t){const n=Ot,e=BigInt(3),r=BigInt(6),s=BigInt(11),o=BigInt(22),c=BigInt(23),f=BigInt(44),i=BigInt(88),a=ttt%n,d=aat%n,l=Y(d,e,n)d%n,p=Y(l,e,n)d%n,b=Y(p,Tt,n)a%n,_=Y(b,s,n)b%n,g=Y(_,o,n)_%n,T=Y(g,f,n)g%n,I=Y(T,i,n)T%n,H=Y(I,f,n)g%n,y=Y(H,e,n)d%n,u=Y(y,c,n)_%n,m=Y(u,r,n)a%n,x=Y(m,Tt,n);if(!st.eql(st.sqr(x),t))throw new Error("Cannot find square root");return x}const st=ie(Ot,void 0,void 0,{sqrt:Ve}),zt=_n({a:se,b:BigInt(7),Fp:st,n:Lt,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const n=Lt,e=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-StBigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),o=e,c=BigInt("0x100000000000000000000000000000000"),f=be(ot,n),i=be(-rt,n);let a=Z(t-fe-is,n),d=Z(-fr-io,n);const l=a>c,p=d>c;if(l&&(a=n-a),p&&(d=n-d),a>c\|\|d>c)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:l,k1:a,k2neg:p,k2:d}}}},Ht),ye={};function kt(t,...n){let e=ye[t];if(e===void 0){const r=Ht(Uint8Array.from(t,s=>s.charCodeAt(0)));e=D(r,r),ye[t]=e}return Ht(D(e,...n))}const ce=t=>t.toRawBytes(!0).slice(1),ee=t=>lt(t,32),Xt=t=>Z(t,Ot),At=t=>Z(t,Lt),fe=(()=>zt.ProjectivePoint)(),Un=(t,n,e)=>fe.BASE.multiplyAndAddUnsafe(t,n,e);function ne(t){let n=zt.utils.normPrivateKeyToScalar(t),e=fe.fromPrivateKey(n);return{scalar:e.hasEvenY()?n:At(-n),bytes:ce(e)}}function Pe(t){ut("x",t,St,Ot);const n=Xt(tt),e=Xt(nt+BigInt(7));let r=Ve(e);r%Tt!==se&&(r=Xt(-r));const s=new fe(t,r,St);return s.assertValidity(),s}const gt=X;function Me(...t){return At(gt(kt("BIP0340/challenge",...t)))}function Ln(t){return ne(t).bytes}function Tn(t,n,e=ve(32)){const r=z("message",t),{bytes:s,scalar:o}=ne(n),c=z("auxRand",e,32),f=ee(o^gt(kt("BIP0340/aux",c))),i=kt("BIP0340/nonce",f,s,r),a=At(gt(i));if(a===se)throw new Error("sign failed: k is zero");const{bytes:d,scalar:l}=ne(a),p=Me(d,s,r),b=new Uint8Array(64);if(b.set(d,0),b.set(ee(At(l+p*o)),32),!je(b,r,s))throw new Error("sign: Invalid signature produced");return b}function je(t,n,e){const r=z("signature",t,64),s=z("message",n),o=z("publicKey",e,32);try{const c=Pe(gt(o)),f=gt(r.subarray(0,32));if(!vt(f,St,Ot))return!1;const i=gt(r.subarray(32,64));if(!vt(i,St,Lt))return!1;const a=Me(ee(f),ce(c),s),d=Un(c,i,At(-a));return!(!d\|\|!d.hasEvenY()\|\|d.toAffine().x!==f)}catch{return!1}}const sr=(()=>({getPublicKey:Ln,sign:Tn,verify:je,utils:{randomPrivateKey:zt.utils.randomPrivateKey,lift_x:Pe,pointToBytes:ce,numberToBytesBE:lt,bytesToNumberBE:X,taggedHash:kt,mod:Z}}))(),kn=(()=>Rn(st,[["0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7","0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581","0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262","0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c"],["0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b","0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14","0x0000000000000000000000000000000000000000000000000000000000000001"],["0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c","0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3","0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931","0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84"],["0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b","0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573","0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f","0x0000000000000000000000000000000000000000000000000000000000000001"]].map(t=>t.map(n=>BigInt(n)))))(),Cn=(()=>Sn(st,{A:BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),B:BigInt("1771"),Z:st.create(BigInt("-11"))}))(),Ke=(()=>Hn(zt.ProjectivePoint,t=>{const{x:n,y:e}=Cn(st.create(t[0]));return kn(n,e)},{DST:"secp256k1_XMD:SHA-256_SSWU_RO_",encodeDST:"secp256k1_XMD:SHA-256_SSWU_NU_",p:st.ORDER,m:1,k:128,expand:"xmd",hash:Ht}))(),cr=(()=>Ke.hashToCurve)(),fr=(()=>Ke.encodeToCurve)();export{fr as encodeToCurve,cr as hashToCurve,sr as schnorr,zt as secp256k1,Ke as secp256k1_hasher};