@antseed/gateway-console 0.1.7 → 0.1.9

package/dist/assets/models-KtwCOBAB.js

@@ -1 +0,0 @@
-import{j as n,r as l,V as c,bl as u,ak as o}from"./index-BadBPNlq.js";function m({links:r}){return r!=null&&r.length?n.jsx("span",{className:"gc-verified-links",children:r.map(e=>n.jsx("a",{className:"gc-verified-link",href:e.href,target:"_blank",rel:"noopener noreferrer",title:e.kind==="domain"?`Verified domain: ${e.label}`:`Verified GitHub: ${e.label}`,onClick:t=>t.stopPropagation(),children:e.label},`${e.kind}:${e.href}`))}):null}function p({list:r,panel:e,onClose:t,closeLabel:i="Close panel"}){const a=l.useRef(null);e&&(a.current=e);const s=e??a.current;return n.jsxs(n.Fragment,{children:[r,n.jsx(c,{isOpen:e!==null,onClose:t,closeLabel:i,className:"gc-side-panel",title:(s==null?void 0:s.title)??"",subtitle:s==null?void 0:s.subtitle,eyebrow:s==null?void 0:s.eyebrow,children:s==null?void 0:s.body})]})}function g({title:r,actions:e,children:t}){return n.jsxs("section",{className:"gc-panel-section",children:[n.jsxs("div",{className:"gc-panel-section__head",children:[n.jsx("h3",{className:"gc-panel-section__title",children:r}),e&&n.jsx("div",{className:"gc-panel-section__actions",children:e})]}),t]})}function x({title:r,meta:e,badges:t,actions:i,selected:a}){return n.jsxs("li",{className:a?"gc-panel-row gc-panel-row--on":"gc-panel-row",children:[n.jsxs("div",{className:"gc-panel-row__main",children:[n.jsx("div",{className:"gc-panel-row__title",children:r}),e&&n.jsx("div",{className:"gc-panel-row__meta",children:e}),t]}),i&&n.jsx("div",{className:"gc-panel-row__actions",children:i})]})}const _={text:"Text",image:"Image",video:"Video",decision:"Decision"},j={toolUse:"Tool use",reasoning:"Reasoning",structuredOutput:"Structured output",vision:"Vision"},d=["text","image","video","decision"];function P(r){const e=new Set((r??[]).map(t=>t.type));return d.filter(t=>e.has(t))}function h(r,e){const t=e.search.trim().toLowerCase();return r.filter(i=>!(t&&![i.id,i.name,...i.aliases].some(a=>a.toLowerCase().includes(t))||e.type&&i.type!==e.type||e.free&&!i.free))}function N(r,e){const t=e.trim().toLowerCase(),i=r??[];return i.find(a=>a.id.toLowerCase()===t)??i.find(a=>a.aliases.some(s=>s.toLowerCase()===t))??null}function b(r){if(r.usdPerImage)return r.usdPerImage.max===0?"Free":`${u(r.usdPerImage)} per image`;const{inputUsdPerMillion:e,outputUsdPerMillion:t}=r;return e===null&&t===null?r.free?"Free":"No price advertised":(e??0)===0&&(t??0)===0?"Free":`${o(e)} in · ${o(t)} out /M`}export{j as C,_ as M,g as P,p as S,m as V,h as a,x as b,N as f,P as m,b as p};

package/dist/assets/secp256k1-Cb4vPU9D.js

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

package/dist/assets/secp256k1-qeEbqQxX.js

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

package/dist/assets/usage-E97PY8Eg.js

@@ -1 +0,0 @@
-import{m as h}from"./index-BadBPNlq.js";const p=864e5;function k(t){const e=new Date(t);return Date.UTC(e.getUTCFullYear(),e.getUTCMonth(),e.getUTCDate())}function b(t){return new Date(t).toISOString().slice(0,10)}const D="\0others";function U(t){return t.group!==D?t.label||t.group:t.others===void 0?"Other users":`${t.others} other ${t.others===1?"user":"users"}`}function E(t,e,u){const n=new Map;for(const s of(t==null?void 0:t.groups)??[])n.set(s.group.slice(0,10),{spent:h(s.spent),requests:s.requests});const a=[];for(let s=k(e);s<=u;s+=p){const i=b(s),o=n.get(i),l=new Date(s).toLocaleDateString("en-US",{month:"short",day:"numeric",timeZone:"UTC"});a.push({label:l,value:(o==null?void 0:o.spent)??0,sub:`${(o==null?void 0:o.requests)??0} requests`})}return a}const q=[{id:"24h",label:"24 hours",ms:p},{id:"7d",label:"7 days",ms:7*p},{id:"30d",label:"30 days",ms:30*p},{id:"90d",label:"90 days",ms:90*p}];function O(t,e=Date.now()){const u=q.find(n=>n.id===t);return t==="24h"?e-u.ms:k(e-u.ms+p)}const d=36e5;function M(t,e=Date.now()){const u=[];if(t==="24h"){const s=Math.floor(e/d)*d+d;for(let i=s-24*d;i<s;i+=d){const o=new Date(i).toLocaleTimeString("en-US",{hour:"numeric",timeZone:"UTC"});u.push({from:i,to:Math.min(i+d,e+1),label:o})}return u}const n=t==="90d"?7*p:p,a=O(t,e);for(let s=a;s<=e;s+=n){const i=new Date(s).toLocaleDateString("en-US",{month:"short",day:"numeric",timeZone:"UTC"});u.push({from:s,to:Math.min(s+n,e+1),label:i})}return u}function m(t,e){return e==="spend"?h(t.spent):e==="requests"?t.requests:t.inputTokens+t.outputTokens}const T="__other__";function _(t,e,u=6){const n=new Map;for(const r of t)for(const c of(r==null?void 0:r.groups)??[]){const f=n.get(c.group)??{label:U(c),total:0};f.total+=m(c,e),n.set(c.group,f)}const a=[...n.entries()].filter(([,r])=>r.total>0).sort((r,c)=>c[1].total-r[1].total),s=a.slice(0,u),i=new Set(s.map(([r])=>r)),o=a.slice(u).reduce((r,[,c])=>r+c.total,0),l=s.map(([r,c])=>({key:r,label:c.label,total:c.total}));o>0&&l.push({key:T,label:"Other",total:o});const S=t.map(r=>{const c={};for(const f of(r==null?void 0:r.groups)??[]){const g=i.has(f.group)?f.group:T;c[g]=(c[g]??0)+m(f,e)}return c});return{series:l,columns:S}}function N(t){return t==="24h"?"hour":"day"}function R(t){return/^\d{4}-\d{2}-\d{2}T\d{2}$/.test(t)?Date.parse(`${t}:00:00Z`):/^\d{4}-\d{2}-\d{2}$/.test(t)?Date.parse(`${t}T00:00:00Z`):Number.NaN}function $(t,e){const u=e.map(()=>new Map);for(const n of(t==null?void 0:t.groups)??[]){const a=R(n.group),s=e.findIndex(o=>a>=o.from&&a<o.to);if(s===-1)continue;const i=u[s];for(const o of n.splits??[]){const l=i.get(o.group);if(!l){i.set(o.group,{...o});continue}l.requests+=o.requests,l.failedRequests+=o.failedRequests,l.spent=(h(l.spent)+h(o.spent)).toFixed(6),l.inputTokens+=o.inputTokens,l.cachedInputTokens+=o.cachedInputTokens,l.outputTokens+=o.outputTokens}}return u.map(n=>({groups:[...n.values()]}))}const y=[{key:"input",label:"Input"},{key:"cached",label:"Cached input"},{key:"output",label:"Output"}];function w(t){const e={input:0,cached:0,output:0},u=t.map(n=>{const a={input:0,cached:0,output:0};for(const s of(n==null?void 0:n.groups)??[])a.cached+=s.cachedInputTokens,a.input+=Math.max(0,s.inputTokens-s.cachedInputTokens),a.output+=s.outputTokens;return e.input+=a.input,e.cached+=a.cached,e.output+=a.output,a});return{series:y.map(n=>({...n,total:e[n.key]})),columns:u}}function v(t){return t.reduce((e,u)=>e+((u==null?void 0:u.groups)??[]).reduce((n,a)=>n+a.requests,0),0)}const I=600*1e3;function x(t,e){return t.spent!==null?"spent":t.servedFree?"free":t.costPending?e-(t.finishedAt??t.startedAt)<I?"pending":"not-recorded":null}export{T as O,q as R,M as a,$ as b,v as c,N as d,E as e,x as f,U as g,O as r,_ as s,w as t};

package/dist/assets/useTx-sWvJMTA4.js

@@ -1 +0,0 @@
-import{x as J,y as Q,A as D,z as X,D as Z,B as tt,E as F,F as et,G as at,h as U,I as nt,L as rt,J as st,K as ot,M as it,N as z,O as ct,P as W,Q as ut,R as dt,S as Y,T as I,U as lt,V as ft,X as ht,f as wt,Y as pt,c as K,q as _,u as mt,Z as yt,w as gt}from"./en_US-Y4ZOVFV4-D2zZwqC_.js";import{bx as Ct,c1 as At,j as R,ag as B,r as b,c2 as Et,aN as Rt}from"./index-BadBPNlq.js";function xt({chain:t,currentChainId:e}){if(!t)throw new J;if(e!==t.id)throw new Q({chain:t,currentChainId:e})}const G=new rt(128);async function St(t,e){var S,d,p,q,L;const{account:a=t.account,assertChainId:s=!0,chain:r=t.chain,accessList:n,authorizationList:o,blobs:c,data:l,dataSuffix:f=typeof t.dataSuffix=="string"?t.dataSuffix:(S=t.dataSuffix)==null?void 0:S.value,gas:u,gasPrice:m,maxFeePerBlobGas:h,maxFeePerGas:y,maxPriorityFeePerGas:C,nonce:N,type:w,value:g,...x}=e;if(typeof a>"u")throw new D({docsPath:"/docs/actions/wallet/sendTransaction"});const i=a?W(a):null;try{X(e);const A=await(async()=>{if(e.to)return e.to;if(e.to!==null&&o&&o.length>0)return await Z({authorization:o[0]}).catch(()=>{throw new tt("`to` is required. Could not infer from `authorizationList`.")})})();if((i==null?void 0:i.type)==="json-rpc"||i===null){let T;r!==null&&(T=await F(t,et,"getChainId")({}),s&&xt({currentChainId:T,chain:r}));const P=(q=(p=(d=t.chain)==null?void 0:d.formatters)==null?void 0:p.transactionRequest)==null?void 0:q.format,k=(P||at)({...nt(x,{format:P}),accessList:n,account:i,authorizationList:o,blobs:c,chainId:T,data:f?U([l??"0x",f]):l,gas:u,gasPrice:m,maxFeePerBlobGas:h,maxFeePerGas:y,maxPriorityFeePerGas:C,nonce:N,to:A,type:w,value:g},"sendTransaction"),$=G.get(t.uid),V=$?"wallet_sendTransaction":"eth_sendTransaction";try{return await t.request({method:V,params:[k]},{retryCount:0})}catch(H){if($===!1)throw H;const E=H;if(E.name==="InvalidInputRpcError"||E.name==="InvalidParamsRpcError"||E.name==="MethodNotFoundRpcError"||E.name==="MethodNotSupportedRpcError")return await t.request({method:"wallet_sendTransaction",params:[k]},{retryCount:0}).then(v=>(G.set(t.uid,!0),v)).catch(v=>{const M=v;throw M.name==="MethodNotFoundRpcError"||M.name==="MethodNotSupportedRpcError"?(G.set(t.uid,!1),E):M});throw E}}if((i==null?void 0:i.type)==="local"){const T=await F(t,st,"prepareTransactionRequest")({account:i,accessList:n,authorizationList:o,blobs:c,chain:r,data:f?U([l??"0x",f]):l,gas:u,gasPrice:m,maxFeePerBlobGas:h,maxFeePerGas:y,maxPriorityFeePerGas:C,nonce:N,nonceManager:i.nonceManager,parameters:[...ot,"sidecars"],type:w,value:g,...x,to:A}),P=(L=r==null?void 0:r.serializers)==null?void 0:L.transaction,j=await i.signTransaction(T,{serializer:P});return await F(t,it,"sendRawTransaction")({serializedTransaction:j})}throw(i==null?void 0:i.type)==="smart"?new z({metaMessages:["Consider using the `sendUserOperation` Action instead."],docsPath:"/docs/actions/bundler/sendUserOperation",type:"smart"}):new z({docsPath:"/docs/actions/wallet/sendTransaction",type:i==null?void 0:i.type})}catch(A){throw A instanceof z?A:ct(A,{...e,account:i,chain:e.chain||void 0})}}async function O(t,e){return O.internal(t,St,"sendTransaction",e)}(function(t){async function e(a,s,r,n){const{abi:o,account:c=a.account,address:l,args:f,functionName:u,...m}=n;if(typeof c>"u")throw new D({docsPath:"/docs/contract/writeContract"});const h=c?W(c):null,y=ut({abi:o,args:f,functionName:u});try{return await F(a,s,r)({data:y,to:l,account:h,...m})}catch(C){throw dt(C,{abi:o,address:l,args:f,docsPath:"/docs/contract/writeContract",functionName:u,sender:h==null?void 0:h.address})}}t.internal=e})(O||(O={}));async function Ft(t,e){const{abi:a,chainId:s,connector:r,...n}=e;let o;e.account?o=e.account:o=(await Y(t,{assertChainId:!1,chainId:s,connector:r})).account;const c=t.getClient({chainId:s}),l=I(c,lt,"simulateContract"),{result:f,request:u}=await l({...n,abi:a,account:o});return{chainId:c.chain.id,result:f,request:{...u,chainId:s}}}async function Tt(t,e){const{chainId:a,timeout:s=0,...r}=e,n=t.getClient({chainId:a}),c=await I(n,ft,"waitForTransactionReceipt")({...r,timeout:s});if(c.status==="reverted"){const l=I(n,ht,"getTransaction"),{from:f,...u}=await l({hash:c.transactionHash}),h=await I(n,wt,"call")({...u,account:f,data:u.input,gasPrice:u.type!=="eip1559"?u.gasPrice:void 0,maxFeePerGas:u.type==="eip1559"?u.maxFeePerGas:void 0,maxPriorityFeePerGas:u.type==="eip1559"?u.maxPriorityFeePerGas:void 0}),y=h!=null&&h.data?pt(`0x${h.data.substring(138)}`):"unknown reason";throw new Error(y)}return{...c,chainId:n.chain.id}}async function bt(t,e){const{account:a,chainId:s,connector:r,...n}=e;let o;return typeof a=="object"&&(a==null?void 0:a.type)==="local"?o=t.getClient({chainId:s}):o=await Y(t,{account:a??void 0,assertChainId:!1,chainId:s,connector:r}),await I(o,O,"writeContract")({...n,...a?{account:a}:{},chain:s?{id:s}:null})}function It(t){return{mutationFn(e){return bt(t,e)},mutationKey:["writeContract"]}}function Ot(t={}){const{mutation:e}=t,a=K(t),s=It(a),{mutate:r,mutateAsync:n,...o}=Ct({...e,...s});return{...o,writeContract:r,writeContractAsync:n}}const _t=_(["function getOperator(address buyer) view returns (address)","function getOperatorNonce(address buyer) view returns (uint256)","function setOperator(address buyer, address operator, uint256 nonce, bytes buyerSig)","function transferOperator(address buyer, address newOperator)","function withdraw(address buyer, uint256 amount)","error NotAuthorized()","error InvalidAmount()","error InvalidAddress()","error InsufficientBalance()","error InvalidSignature()","error InvalidNonce()","error OperatorAlreadySet()"]),qt=_(["function claimBuyerReward(address buyer, uint256 epoch)","error NotRewardRecipient()","error RewardRecipientUnavailable()"]),vt=_(["function channels(bytes32 channelId) view returns (address buyer, address seller, uint128 deposit, uint128 settled, bytes32 metadataHash, uint256 deadline, uint256 settledAt, uint256 closeRequestedAt, uint8 status)","function requestClose(bytes32 channelId)","function withdraw(bytes32 channelId)","error ChannelNotActive()","error NotAuthorized()","error CloseAlreadyRequested()","error CloseNotReady()"]),Mt=_(["function claimBuyerEmissions(address buyer, uint256[] epochs)","error NotAuthorized()","error EpochNotFinalized()"]);function zt({chain:t,runner:e,done:a="Confirmed on chain."}){const s=e.lastHash?At(t,e.lastHash):null,r=s&&R.jsx("a",{className:"gc-link",href:s,target:"_blank",rel:"noopener noreferrer",children:"View transaction"});return R.jsxs(R.Fragment,{children:[e.status&&R.jsxs(B,{tone:"info",children:[e.status," ",e.running&&e.lastHash&&r]}),e.error&&R.jsxs(B,{tone:"danger",children:[e.error," ",!e.running&&r]}),!e.running&&!e.error&&e.confirmed&&R.jsxs(B,{tone:"success",children:[a," ",r]})]})}function Bt(t){const e=K(),{chainId:a}=mt(),{switchChainAsync:s}=yt(),[r,n]=b.useState(null),[o,c]=b.useState(null),[l,f]=b.useState(null),[u,m]=b.useState(null),[h,y]=b.useState(!1);async function C(N,w={}){var x,i,S;let g=null;y(!0),c(null),m(null),f(null);try{a!==t&&(n("Switch network in your wallet…"),await s({chainId:t}));for(const d of N){d.check&&(n(`${d.label}: checking…`),await d.check()),n(`${d.label}: confirm in your wallet…`);const p=await d.send();if(g=p,f(p),n(`${d.label}: waiting for confirmation…`),(await Tt(e,{hash:p,chainId:t})).status!=="success")throw new Error(`${d.label} reverted on chain.`)}return n(null),m(g),g}catch(d){n(null);const p=Et(d);return p?(c(p.message),p.refresh&&((x=w.onStale)==null||x.call(w))):d instanceof Rt?(c(d.message),d.refresh&&((i=w.onStale)==null||i.call(w))):(c(gt(d)),g&&((S=w.onStale)==null||S.call(w))),null}finally{y(!1)}}return{run:C,running:h,status:r,setStatus:n,error:o,lastHash:l,confirmed:u,wrongChain:a!==void 0&&a!==t,setError:c}}export{vt as C,_t as D,Mt as L,zt as T,qt as U,Ot as a,Ft as s,Bt as u};