@acedatacloud/nexior 3.182.0 → 3.183.0

package/dist/assets/{secp256k1-Dg6Q2hp-.js → secp256k1-BxtlyzR6.js}

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

package/dist/assets/{secp256k1-eVBltpi-.js → secp256k1-H46xRWcx.js}

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

package/dist/assets/seedream-4c335Nw0.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"タスク ID",description:"タスクの ID"},"name.task":{message:"タスクタイプ",description:"SeeDream 画像操作タイプ"},"name.generate":{message:"画像生成",description:"操作タイプ：画像生成"},"name.edits":{message:"画像編集",description:"操作タイプ：画像編集"},"name.imageUrls":{message:"参考画像",description:"編集用の参考画像"},"name.failure":{message:"失敗",description:"タスクの失敗"},"name.failureReason":{message:"失敗理由",description:"タスクの失敗理由"},"name.status":{message:"ステータス",description:"タスクのステータス"},"name.traceId":{message:"トレース ID",description:"トレース ID"},"name.elapsed":{message:"経過時間",description:"タスクの経過時間（秒）"},"name.prompt":{message:"画像プロンプト",description:"生成/編集のプロンプト"},"name.seedreamBot":{message:"SeeDream Bot",description:"SeeDream 画像生成器の名称"},"name.size":{message:"サイズ",description:"出力画像のサイズ"},"name.watermark":{message:"透かし",description:"透かしを追加するかどうか"},"description.prompt":{message:"画像生成または編集のためのプロンプト",description:"プロンプトの説明"},"description.model":{message:"画像生成または編集に使用するモデル。",description:"model パラメータの説明"},"description.size":{message:"画像サイズ。プリセット `1K`、`2K`、`4K` またはカスタム `<幅>x<高さ>` をサポート。",description:"size パラメータの説明"},"description.watermark":{message:"生成された画像に AI 透かしを追加するかどうか。デフォルトでオン。",description:"watermark パラメータの説明"},"description.imageUrls":{message:"1-14 枚の参考画像をアップロードして画像編集を有効にします。",description:"image パラメータの説明"},"status.pending":{message:"保留中",description:"タスクの保留状態"},"placeholder.select":{message:"選択",description:"選択のプレースホルダー"},"placeholder.size":{message:"プリセットを選択するか <幅>x<高さ> を入力",description:"size 選択/入力のプレースホルダー（el-select allow-create）"},"placeholder.prompt":{message:"プロンプトを入力してください。例：白いシャム猫",description:"プロンプトのプレースホルダー"},"button.generate":{message:"生成",description:"生成ボタン"},"button.uploadImageUrls":{message:"アップロード",description:"参考画像をアップロードするボタン（英語は「Upload」に簡略化し、「Upload Images」は使用しない）"},"button.confirmContinue":{message:"切り替えを続ける",description:"能力の衝突を示すポップアップの確認ボタン"},"button.cancelSwitch":{message:"キャンセル",description:"能力の衝突を示すポップアップのキャンセルボタン"},"message.startingTask":{message:"タスクを開始しています...",description:"タスク開始メッセージ"},"message.startTaskSuccess":{message:"生成タスクを正常に開始しました",description:"タスクが正常に作成されました"},"message.startTaskFailed":{message:"タスクの開始に失敗しました。管理者に連絡してください：",description:"タスク作成に失敗しました"},"message.usedUp":{message:"ポイントが使い切りました。追加のポイントを購入して続行してください",description:"使い切ったことを示すメッセージ"},"message.uploadImageExceed":{message:"最大 14 枚の画像をアップロードできます",description:"画像数が制限を超えた"},"message.uploadImageError":{message:"画像のアップロードに失敗しました。後で再試行してください",description:"アップロード失敗"},"message.featureNotSupportedTitle":{message:"確認が必要",description:"能力の衝突を示すポップアップのタイトル"},"message.featureNotSupportedBody":{message:"現在の選択は以下の有効な設定をサポートしていません：{fields}。続行するとこれらの設定がクリアされます。",description:"能力の衝突を示すポップアップの本文"},"message.featureRemovedNotice":{message:"サポートされていない設定がクリアされました：{fields}",description:"能力の衝突をクリアした後の通知メッセージ"},"name.model":{message:"モデル",description:"SeeDream モデル選択ラベル"},"model.seedream45":{message:"doubao-seedream-4.5",description:"SeeDream 4.5 モデルオプション"},"model.seedream40":{message:"doubao-seedream-4.0",description:"SeeDream 4.0 モデルオプション"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"SeeDream 3.0 t2i モデルオプション"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"SeeEdit 3.0 i2i モデルオプション"},"model.seedream50":{message:"doubao-seedream-5.0",description:"SeeDream 5.0 モデルオプション（グループ画像とストリーミング出力をサポート）"},"name.maxImages":{message:"画像枚数",description:"グループ画像生成の画像枚数（max_images）"},"description.maxImages":{message:"1 回のリクエストで生成する画像の数（1-15）。1 に設定すると単一画像モード；1 より大きい場合は自動的にグループ画像を有効にします（sequential_image_generation=auto）、画像間でキャラクター、スタイル、詳細を一貫させます。doubao-seedream-5.0 / 4.5 / 4.0 のみサポート；参考画像を同時にアップロードする場合、(参考画像数 + 生成数) ≤ 15 を満たす必要があります。請求は実際に生成された画像の枚数に基づきます。",description:"max_images パラメータの説明"},"name.seed":{message:"ランダムシード",description:"seed パラメータのラベル"},"description.seed":{message:"再現のためのランダムシード、範囲 [-1, 2147483647]。-1 は毎回ランダムを意味します。doubao-seedream-3.0-t2i と doubao-seededit-3.0-i2i のみサポート。",description:"seed パラメータの説明"},"name.guidanceScale":{message:"プロンプトの重み",description:"guidance_scale パラメータのラベル"},"description.guidanceScale":{message:"プロンプトの遵守強度、範囲 [1, 10]。値が大きいほどプロンプトに近づきます。doubao-seedream-3.0-t2i のデフォルトは 2.5、doubao-seededit-3.0-i2i のデフォルトは 5.5。",description:"guidance_scale パラメータの説明"},"name.outputFormat":{message:"出力形式",description:"output_format パラメータのラベル"},"description.outputFormat":{message:"生成される画像のファイル形式、jpeg または png、デフォルトは jpeg。doubao-seedream-5.0 のみサポート。",description:"output_format パラメータの説明"},"size.group.tier":{message:"解像度階層",description:"サイズドロップダウンの階層グループ（1K-4K）"},"size.group.adaptive":{message:"自適応",description:"サイズドロップダウンの自適応グループ"},"size.group.pixel":{message:"具体的なピクセルサイズ",description:"サイズドロップダウンのピクセルサイズグループ"},"size.adaptive":{message:"自適応（参照画像に一致）",description:"adaptive オプションのラベル"}};export{e as default};

package/dist/assets/seedream-BDhO0N-o.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"ID de tarea",description:"ID de la tarea"},"name.task":{message:"Tipo de tarea",description:"Tipo de operación de imagen de SeeDream"},"name.generate":{message:"Crear imagen",description:"Tipo de operación: crear imagen"},"name.edits":{message:"Editar imagen",description:"Tipo de operación: editar imagen"},"name.imageUrls":{message:"Imágenes de referencia",description:"Imágenes de referencia para editar"},"name.failure":{message:"Fallido",description:"La tarea ha fallado"},"name.failureReason":{message:"Razón del fallo",description:"Razón por la cual la tarea ha fallado"},"name.status":{message:"Estado",description:"Estado de la tarea"},"name.traceId":{message:"ID de seguimiento",description:"ID de seguimiento"},"name.elapsed":{message:"Tiempo transcurrido",description:"Tiempo transcurrido de la tarea (segundos)"},"name.prompt":{message:"Sugerencia de imagen",description:"Palabras clave para generar/editar"},"name.seedreamBot":{message:"Bot SeeDream",description:"Nombre del generador de imágenes SeeDream"},"name.size":{message:"Tamaño",description:"Tamaño de la imagen de salida"},"name.watermark":{message:"Marca de agua",description:"Si se debe agregar una marca de agua"},"description.prompt":{message:"Palabras clave para generar o editar la imagen",description:"Descripción de las palabras clave"},"description.model":{message:"Modelo utilizado para generar o editar imágenes.",description:"Descripción del parámetro model"},"description.size":{message:"Tamaño de la imagen. Soporta predefinidos `1K`, `2K`, `4K` o personalizado `<ancho>x<alto>`.",description:"Descripción del parámetro size"},"description.watermark":{message:"Si se debe agregar una marca de agua AI a la imagen generada. Activado por defecto.",description:"Descripción del parámetro watermark"},"description.imageUrls":{message:"Sube de 1 a 14 imágenes de referencia para habilitar la edición de imágenes.",description:"Descripción del parámetro image"},"status.pending":{message:"En espera",description:"Estado de espera de la tarea"},"placeholder.select":{message:"Seleccionar",description:"Marcador de posición de selección"},"placeholder.size":{message:"Selecciona un preset o ingresa <ancho>x<alto>",description:"Placeholder para selección/entrada de tamaño (el-select allow-create)"},"placeholder.prompt":{message:"Ingresa las palabras clave, por ejemplo: un gato siames blanco",description:"Marcador de posición de sugerencia"},"button.generate":{message:"Generar",description:"Botón de generar"},"button.uploadImageUrls":{message:"Subir",description:"Botón para subir imágenes de referencia (simplificado a 'Subir')"},"button.confirmContinue":{message:"Continuar cambio",description:"Botón de confirmación en el cuadro de advertencia de conflicto de capacidades"},"button.cancelSwitch":{message:"Cancelar",description:"Botón de cancelar en el cuadro de advertencia de conflicto de capacidades"},"message.startingTask":{message:"Iniciando tarea...",description:"Mensaje de inicio de tarea"},"message.startTaskSuccess":{message:"Tarea de generación iniciada con éxito",description:"Tarea creada con éxito"},"message.startTaskFailed":{message:"Error al iniciar la tarea, por favor contacta al administrador:",description:"Error en la creación de la tarea"},"message.usedUp":{message:"Se han agotado tus puntos, por favor compra más puntos para continuar usando",description:"Mensaje de agotamiento"},"message.uploadImageExceed":{message:"Se pueden subir hasta 14 imágenes",description:"Número de imágenes excede el límite"},"message.uploadImageError":{message:"Error al subir la imagen, por favor intenta de nuevo más tarde",description:"Error en la subida"},"message.featureNotSupportedTitle":{message:"Confirmación requerida",description:"Título del cuadro de advertencia de conflicto de capacidades"},"message.featureNotSupportedBody":{message:"La selección actual no soporta las siguientes configuraciones activadas: {fields}. Continuar limpiará estas configuraciones.",description:"Cuerpo del cuadro de advertencia de conflicto de capacidades"},"message.featureRemovedNotice":{message:"Se han limpiado las configuraciones no soportadas: {fields}",description:"Mensaje después de limpiar configuraciones no soportadas"},"name.model":{message:"Modelo",description:"Etiqueta de selección de modelo de SeeDream"},"model.seedream45":{message:"doubao-seedream-4.5",description:"Opción de modelo SeeDream 4.5"},"model.seedream40":{message:"doubao-seedream-4.0",description:"Opción de modelo SeeDream 4.0"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"Opción de modelo SeeDream 3.0 t2i"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"Opción de modelo SeeEdit 3.0 i2i"},"model.seedream50":{message:"doubao-seedream-5.0",description:"Opción de modelo SeeDream 5.0 (soporta generación de imágenes en grupo y salida en flujo)"},"name.maxImages":{message:"Número de imágenes",description:"Número de imágenes generadas en grupo (max_images)"},"description.maxImages":{message:"Número de imágenes generadas en una sola solicitud (1-15). Si se establece en 1, es modo de imagen única; si es mayor que 1, se activa automáticamente la generación de imágenes en grupo (sequential_image_generation=auto), manteniendo el personaje, estilo y detalles consistentes entre imágenes. Solo se admite doubao-seedream-5.0 / 4.5 / 4.0; si se suben imágenes de referencia, debe cumplirse (número de imágenes de referencia + número de generación) ≤ 15. La facturación se basa en el número real de imágenes generadas.",description:"Descripción del parámetro max_images"},"name.seed":{message:"Semilla aleatoria",description:"Etiqueta del parámetro seed"},"description.seed":{message:"Semilla aleatoria para reproducir resultados, rango [-1, 2147483647]. -1 significa aleatorio cada vez. Solo soportado por doubao-seedream-3.0-t2i y doubao-seededit-3.0-i2i.",description:"Explicación del parámetro seed"},"name.guidanceScale":{message:"Peso del prompt",description:"Etiqueta del parámetro guidance_scale"},"description.guidanceScale":{message:"Intensidad de seguimiento del prompt, rango [1, 10]. Valores más altos siguen más de cerca el prompt. doubao-seedream-3.0-t2i por defecto 2.5, doubao-seededit-3.0-i2i por defecto 5.5.",description:"Explicación del parámetro guidance_scale"},"name.outputFormat":{message:"Formato de salida",description:"Etiqueta del parámetro output_format"},"description.outputFormat":{message:"Formato de archivo de la imagen generada, jpeg o png, por defecto jpeg. Solo soportado por doubao-seedream-5.0.",description:"Explicación del parámetro output_format"},"size.group.tier":{message:"Resolución",description:"Grupo de niveles de resolución en el desplegable (1K-4K)"},"size.group.adaptive":{message:"Adaptativo",description:"Grupo de tamaño adaptativo en el desplegable"},"size.group.pixel":{message:"Tamaño en píxeles",description:"Grupo de tamaño por píxeles en el desplegable"},"size.adaptive":{message:"Adaptativo (igual que la imagen de referencia)",description:"Etiqueta de opción adaptive"}};export{e as default};

package/dist/assets/seedream-C8bLaFrG.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"ID attività",description:"ID dell'attività"},"name.task":{message:"Tipo di attività",description:"Tipo di operazione dell'immagine SeeDream"},"name.generate":{message:"Crea immagine",description:"Tipo di operazione: crea immagine"},"name.edits":{message:"Modifica immagine",description:"Tipo di operazione: modifica immagine"},"name.imageUrls":{message:"Immagini di riferimento",description:"Immagini di riferimento per la modifica"},"name.failure":{message:"Fallito",description:"Attività fallita"},"name.failureReason":{message:"Motivo del fallimento",description:"Motivo del fallimento dell'attività"},"name.status":{message:"Stato",description:"Stato dell'attività"},"name.traceId":{message:"ID tracciamento",description:"ID di tracciamento"},"name.elapsed":{message:"Tempo impiegato",description:"Tempo impiegato per l'attività (secondi)"},"name.prompt":{message:"Suggerimento immagine",description:"Parole chiave per generare/modificare"},"name.seedreamBot":{message:"SeeDream Bot",description:"Nome del generatore di immagini SeeDream"},"name.size":{message:"Dimensione",description:"Dimensione dell'immagine di output"},"name.watermark":{message:"Filigrana",description:"Se aggiungere una filigrana"},"description.prompt":{message:"Parole chiave per generare o modificare l'immagine",description:"Descrizione delle parole chiave"},"description.model":{message:"Modello utilizzato per generare o modificare l'immagine.",description:"Descrizione del parametro model"},"description.size":{message:"Dimensione dell'immagine. Supporta preset `1K`, `2K`, `4K` o personalizzati `<larghezza>x<altezza>`.",description:"Descrizione del parametro size"},"description.watermark":{message:"Se aggiungere una filigrana AI all'immagine generata. Attivato per impostazione predefinita.",description:"Descrizione del parametro watermark"},"description.imageUrls":{message:"Carica da 1 a 14 immagini di riferimento per abilitare la modifica dell'immagine.",description:"Descrizione del parametro image"},"status.pending":{message:"In attesa",description:"Stato di attesa dell'attività"},"placeholder.select":{message:"Seleziona",description:"Segnaposto per la selezione"},"placeholder.size":{message:"Seleziona preset o inserisci <larghezza>x<altezza>",description:"Segnaposto per la selezione/inserimento della dimensione (el-select allow-create)"},"placeholder.prompt":{message:"Inserisci parole chiave, ad esempio: un gatto siamese bianco",description:"Segnaposto per le parole chiave"},"button.generate":{message:"Genera",description:"Pulsante di generazione"},"button.uploadImageUrls":{message:"Carica",description:"Pulsante per caricare immagini di riferimento (semplificare in 'Carica', non usare 'Carica immagini')"},"button.confirmContinue":{message:"Continua il cambio",description:"Pulsante di conferma nella finestra di avviso per conflitti di capacità"},"button.cancelSwitch":{message:"Annulla",description:"Pulsante di annullamento nella finestra di avviso per conflitti di capacità"},"message.startingTask":{message:"Avvio dell'attività in corso...",description:"Messaggio di avvio dell'attività"},"message.startTaskSuccess":{message:"Attività di generazione avviata con successo",description:"Attività creata con successo"},"message.startTaskFailed":{message:"Avvio dell'attività fallito, contattare l'amministratore:",description:"Creazione dell'attività fallita"},"message.usedUp":{message:"I tuoi crediti sono esauriti, acquista più crediti per continuare a utilizzare",description:"Messaggio di esaurimento"},"message.uploadImageExceed":{message:"Puoi caricare al massimo 14 immagini",description:"Numero di immagini oltre il limite"},"message.uploadImageError":{message:"Caricamento immagine fallito, riprova più tardi",description:"Caricamento fallito"},"message.featureNotSupportedTitle":{message:"Richiesta di conferma",description:"Titolo della finestra di avviso per conflitti di capacità"},"message.featureNotSupportedBody":{message:"La selezione attuale non supporta le seguenti impostazioni abilitate: {fields}. Continuare pulirà queste impostazioni.",description:"Corpo del messaggio nella finestra di avviso per conflitti di capacità"},"message.featureRemovedNotice":{message:"Impostazioni non supportate rimosse: {fields}",description:"Messaggio di avviso dopo la pulizia dei conflitti di capacità"},"name.model":{message:"Modello",description:"Etichetta di selezione del modello SeeDream"},"model.seedream45":{message:"doubao-seedream-4.5",description:"Opzione modello SeeDream 4.5"},"model.seedream40":{message:"doubao-seedream-4.0",description:"Opzione modello SeeDream 4.0"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"Opzione modello SeeDream 3.0 t2i"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"Opzione modello SeeEdit 3.0 i2i"},"model.seedream50":{message:"doubao-seedream-5.0",description:"Opzione modello SeeDream 5.0 (supporta output a gruppi e in streaming)"},"name.maxImages":{message:"Numero di immagini",description:"Numero di immagini generate in un gruppo (max_images)"},"description.maxImages":{message:"Numero di immagini generate in una singola richiesta (1-15). Impostato su 1 per la modalità singola; maggiore di 1 attiva automaticamente il gruppo (sequential_image_generation=auto), mantenendo coerenza di personaggi, stile e dettagli tra le immagini. Supporta solo doubao-seedream-5.0 / 4.5 / 4.0; se caricate immagini di riferimento, devono soddisfare (numero di immagini di riferimento + numero di generazione) ≤ 15. La fatturazione è basata sul numero effettivo di immagini generate.",description:"Descrizione del parametro max_images"},"name.seed":{message:"Seme casuale",description:"Etichetta del parametro seed"},"description.seed":{message:"Semenza casuale per la riproduzione, intervallo [-1, 2147483647]. -1 indica casualità ogni volta. Supportato solo da doubao-seedream-3.0-t2i e doubao-seededit-3.0-i2i.",description:"Descrizione del parametro seed"},"name.guidanceScale":{message:"Peso del prompt",description:"Etichetta del parametro guidance_scale"},"description.guidanceScale":{message:"Intensità di aderenza al prompt, intervallo [1, 10]. Valori più alti si avvicinano di più al prompt. doubao-seedream-3.0-t2i predefinito 2.5, doubao-seededit-3.0-i2i predefinito 5.5.",description:"Descrizione del parametro guidance_scale"},"name.outputFormat":{message:"Formato di output",description:"Etichetta del parametro output_format"},"description.outputFormat":{message:"Formato del file dell'immagine generata, jpeg o png, predefinito jpeg. Supportato solo da doubao-seedream-5.0.",description:"Descrizione del parametro output_format"},"size.group.tier":{message:"Livello di risoluzione",description:"Gruppo di livelli nel menu a discesa delle dimensioni (1K-4K)"},"size.group.adaptive":{message:"Adattivo",description:"Gruppo adattivo nel menu a discesa delle dimensioni"},"size.group.pixel":{message:"Dimensioni pixel specifiche",description:"Gruppo di dimensioni pixel nel menu a discesa delle dimensioni"},"size.adaptive":{message:"Adattivo (coerente con l'immagine di riferimento)",description:"Etichetta dell'opzione adattiva"}};export{e as default};

package/dist/assets/seedream-CF3AkOjA.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"ID de tâche",description:"ID de la tâche"},"name.task":{message:"Type de tâche",description:"Type d'opération d'image SeeDream"},"name.generate":{message:"Créer une image",description:"Type d'opération : créer une image"},"name.edits":{message:"Éditer une image",description:"Type d'opération : éditer une image"},"name.imageUrls":{message:"Images de référence",description:"Images de référence utilisées pour l'édition"},"name.failure":{message:"Échec",description:"Échec de la tâche"},"name.failureReason":{message:"Raison de l'échec",description:"Raison de l'échec de la tâche"},"name.status":{message:"Statut",description:"Statut de la tâche"},"name.traceId":{message:"ID de suivi",description:"ID de suivi"},"name.elapsed":{message:"Temps écoulé",description:"Temps écoulé pour la tâche (secondes)"},"name.prompt":{message:"Invite d'image",description:"Mots d'invite pour générer/éditer"},"name.seedreamBot":{message:"Bot SeeDream",description:"Nom du générateur d'images SeeDream"},"name.size":{message:"Taille",description:"Taille de l'image de sortie"},"name.watermark":{message:"Filigrane",description:"Ajouter un filigrane ou non"},"description.prompt":{message:"Mots d'invite pour générer ou éditer une image",description:"Description des mots d'invite"},"description.model":{message:"Modèle utilisé pour générer ou éditer des images.",description:"Description du paramètre modèle"},"description.size":{message:"Taille de l'image. Prend en charge les préréglages `1K`, `2K`, `4K` ou personnalisée `<largeur>x<hauteur>`.",description:"Description du paramètre taille"},"description.watermark":{message:"Ajouter un filigrane AI à l'image générée. Activé par défaut.",description:"Description du paramètre filigrane"},"description.imageUrls":{message:"Téléchargez 1 à 14 images de référence pour activer l'édition d'images.",description:"Description du paramètre image"},"status.pending":{message:"En attente",description:"État d'attente de la tâche"},"placeholder.select":{message:"Sélectionner",description:"Espace réservé pour la sélection"},"placeholder.size":{message:"Choisir un preset ou saisir <largeur>x<hauteur>",description:"Texte d'espace réservé pour la sélection/saisie de taille (el-select allow-create)"},"placeholder.prompt":{message:"Entrez les mots d'invite, par exemple : un chat siamois blanc",description:"Espace réservé pour les mots d'invite"},"button.generate":{message:"Générer",description:"Bouton de génération"},"button.uploadImageUrls":{message:"Télécharger",description:"Bouton pour télécharger des images de référence (simplifiez en anglais à 'Upload', ne pas utiliser 'Upload Images')"},"button.confirmContinue":{message:"Continuer le changement",description:"Bouton de confirmation dans la boîte de dialogue de conflit de fonctionnalités"},"button.cancelSwitch":{message:"Annuler",description:"Bouton d'annulation dans la boîte de dialogue de conflit de fonctionnalités"},"message.startingTask":{message:"Démarrage de la tâche...",description:"Message de début de tâche"},"message.startTaskSuccess":{message:"Tâche de génération lancée avec succès",description:"Tâche créée avec succès"},"message.startTaskFailed":{message:"Échec du lancement de la tâche, veuillez contacter l'administrateur :",description:"Échec de la création de la tâche"},"message.usedUp":{message:"Vos crédits sont épuisés, veuillez acheter plus de crédits pour continuer",description:"Message d'épuisement"},"message.uploadImageExceed":{message:"Vous pouvez télécharger jusqu'à 14 images",description:"Nombre d'images dépassant la limite"},"message.uploadImageError":{message:"Échec du téléchargement de l'image, veuillez réessayer plus tard",description:"Échec du téléchargement"},"message.featureNotSupportedTitle":{message:"Confirmation requise",description:"Titre de la boîte de dialogue de conflit de fonctionnalités"},"message.featureNotSupportedBody":{message:"Les paramètres activés suivants ne sont pas pris en charge par la sélection actuelle : {fields}. Continuer supprimera ces paramètres.",description:"Contenu de la boîte de dialogue de conflit de fonctionnalités"},"message.featureRemovedNotice":{message:"Paramètres non pris en charge supprimés : {fields}",description:"Message après nettoyage des paramètres non pris en charge"},"name.model":{message:"Modèle",description:"Étiquette de sélection du modèle SeeDream"},"model.seedream45":{message:"doubao-seedream-4.5",description:"Option de modèle SeeDream 4.5"},"model.seedream40":{message:"doubao-seedream-4.0",description:"Option de modèle SeeDream 4.0"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"Option de modèle SeeDream 3.0 t2i"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"Option de modèle SeeEdit 3.0 i2i"},"model.seedream50":{message:"doubao-seedream-5.0",description:"Option de modèle SeeDream 5.0 (prend en charge la génération d'images en série et la sortie en continu)"},"name.maxImages":{message:"Nombre d'images",description:"Nombre d'images générées pour la série d'images (max_images)"},"description.maxImages":{message:"Nombre d'images générées par demande (1-15). Défini à 1 pour le mode image unique ; supérieur à 1 active automatiquement la génération d'images en série (sequential_image_generation=auto), en maintenant la cohérence des personnages, du style et des détails entre les images. Prend uniquement en charge doubao-seedream-5.0 / 4.5 / 4.0 ; si des images de référence sont téléchargées en même temps, il faut respecter (nombre d'images de référence + nombre généré) ≤ 15. La facturation est basée sur le nombre d'images réellement générées.",description:"Description du paramètre max_images"},"name.seed":{message:"Graine aléatoire",description:"Étiquette du paramètre seed"},"description.seed":{message:"Graine aléatoire pour reproduction, plage [-1, 2147483647]. -1 signifie aléatoire à chaque fois. Supporté uniquement par doubao-seedream-3.0-t2i et doubao-seededit-3.0-i2i.",description:"Explication du paramètre seed"},"name.guidanceScale":{message:"Poids du prompt",description:"Étiquette du paramètre guidance_scale"},"description.guidanceScale":{message:"Intensité de suivi du prompt, plage [1, 10]. Plus la valeur est élevée, plus le résultat suit le prompt. Par défaut : doubao-seedream-3.0-t2i 2.5, doubao-seededit-3.0-i2i 5.5.",description:"Explication du paramètre guidance_scale"},"name.outputFormat":{message:"Format de sortie",description:"Étiquette du paramètre output_format"},"description.outputFormat":{message:"Format de fichier pour l'image générée, jpeg ou png, par défaut jpeg. Supporté uniquement par doubao-seedream-5.0.",description:"Explication du paramètre output_format"},"size.group.tier":{message:"Niveau de résolution",description:"Groupe de niveaux de résolution dans le menu déroulant (1K-4K)"},"size.group.adaptive":{message:"Adaptatif",description:"Groupe adaptatif dans le menu déroulant de tailles"},"size.group.pixel":{message:"Taille en pixels",description:"Groupe de tailles en pixels dans le menu déroulant"},"size.adaptive":{message:"Adaptatif (comme l'image de référence)",description:"Étiquette de l'option adaptive"}};export{e as default};

package/dist/assets/seedream-CK4W9z-Q.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"ID εργασίας",description:"Το ID της εργασίας"},"name.task":{message:"Τύπος εργασίας",description:"Τύπος λειτουργίας εικόνας SeeDream"},"name.generate":{message:"Δημιουργία εικόνας",description:"Τύπος λειτουργίας: Δημιουργία εικόνας"},"name.edits":{message:"Επεξεργασία εικόνας",description:"Τύπος λειτουργίας: Επεξεργασία εικόνας"},"name.imageUrls":{message:"Αναφορές εικόνας",description:"Αναφορές εικόνας για επεξεργασία"},"name.failure":{message:"Αποτυχία",description:"Η εργασία απέτυχε"},"name.failureReason":{message:"Λόγος αποτυχίας",description:"Λόγος αποτυχίας της εργασίας"},"name.status":{message:"Κατάσταση",description:"Κατάσταση της εργασίας"},"name.traceId":{message:"ID παρακολούθησης",description:"ID παρακολούθησης"},"name.elapsed":{message:"Χρόνος εκτέλεσης",description:"Χρόνος εκτέλεσης της εργασίας (σε δευτερόλεπτα)"},"name.prompt":{message:"Υπόδειξη εικόνας",description:"Λέξεις-κλειδιά για δημιουργία/επεξεργασία"},"name.seedreamBot":{message:"SeeDream Bot",description:"Όνομα του δημιουργού εικόνας SeeDream"},"name.size":{message:"Μέγεθος",description:"Μέγεθος της εξόδου εικόνας"},"name.watermark":{message:"Υδατογράφημα",description:"Προσθήκη υδατογραφήματος"},"description.prompt":{message:"Λέξεις-κλειδιά για δημιουργία ή επεξεργασία εικόνας",description:"Περιγραφή λέξεων-κλειδιών"},"description.model":{message:"Μοντέλο για δημιουργία ή επεξεργασία εικόνας.",description:"Περιγραφή παραμέτρου μοντέλου"},"description.size":{message:"Μέγεθος εικόνας. Υποστηρίζει προεπιλογές `1K`, `2K`, `4K` ή προσαρμοσμένο `<πλάτος>x<ύψος>`.",description:"Περιγραφή παραμέτρου μεγέθους"},"description.watermark":{message:"Προσθήκη AI υδατογραφήματος στην παραγόμενη εικόνα. Προεπιλογή ενεργοποιημένη.",description:"Περιγραφή παραμέτρου υδατογραφήματος"},"description.imageUrls":{message:"Ανεβάστε 1-14 αναφορές εικόνας για να ενεργοποιήσετε την επεξεργασία εικόνας.",description:"Περιγραφή παραμέτρου εικόνας"},"status.pending":{message:"Σε αναμονή",description:"Κατάσταση αναμονής της εργασίας"},"placeholder.select":{message:"Επιλέξτε",description:"Επιλογή placeholder"},"placeholder.size":{message:"Επιλέξτε προεπιλογή ή εισάγετε <Πλάτος>x<Ύψος>",description:"Κείμενο κράτησης θέσης για επιλογή/εισαγωγή μεγέθους (el-select allow-create)"},"placeholder.prompt":{message:"Εισάγετε λέξεις-κλειδιά, π.χ.: μια λευκή Σιαμέζα γάτα",description:"Placeholder λέξεων-κλειδιών"},"button.generate":{message:"Δημιουργία",description:"Κουμπί δημιουργίας"},"button.uploadImageUrls":{message:"Ανέβασμα",description:"Κουμπί ανέβασμα αναφορών εικόνας (απλοποιήστε στα Αγγλικά σε 'Upload', μην χρησιμοποιήσετε 'Upload Images')"},"button.confirmContinue":{message:"Συνέχεια αλλαγής",description:"Κουμπί επιβεβαίωσης στο πλαίσιο διαλόγου σύγκρουσης δυνατοτήτων"},"button.cancelSwitch":{message:"Ακύρωση",description:"Κουμπί ακύρωσης στο πλαίσιο διαλόγου σύγκρουσης δυνατοτήτων"},"message.startingTask":{message:"Εκκίνηση εργασίας...",description:"Μήνυμα εκκίνησης εργασίας"},"message.startTaskSuccess":{message:"Επιτυχής εκκίνηση εργασίας δημιουργίας",description:"Η εργασία δημιουργήθηκε με επιτυχία"},"message.startTaskFailed":{message:"Αποτυχία εκκίνησης εργασίας, παρακαλώ επικοινωνήστε με τον διαχειριστή:",description:"Αποτυχία δημιουργίας εργασίας"},"message.usedUp":{message:"Τα σημεία σας έχουν εξαντληθεί, παρακαλώ αγοράστε περισσότερα σημεία για να συνεχίσετε",description:"Μήνυμα εξάντλησης"},"message.uploadImageExceed":{message:"Μπορείτε να ανεβάσετε έως 14 εικόνες",description:"Περιορισμός αριθμού εικόνας"},"message.uploadImageError":{message:"Αποτυχία ανέβασματος εικόνας, παρακαλώ δοκιμάστε ξανά αργότερα",description:"Αποτυχία ανέβασματος"},"message.featureNotSupportedTitle":{message:"Απαιτείται επιβεβαίωση",description:"Τίτλος του πλαισίου διαλόγου σύγκρουσης δυνατοτήτων"},"message.featureNotSupportedBody":{message:"Η τρέχουσα επιλογή δεν υποστηρίζει τις ενεργοποιημένες ρυθμίσεις: {fields}. Η συνέχιση θα καθαρίσει αυτές τις ρυθμίσεις.",description:"Κείμενο του πλαισίου διαλόγου σύγκρουσης δυνατοτήτων"},"message.featureRemovedNotice":{message:"Καθαρίστηκαν οι μη υποστηριζόμενες ρυθμίσεις: {fields}",description:"Μήνυμα μετά τον καθαρισμό των ρυθμίσεων που δεν υποστηρίζονται"},"name.model":{message:"Μοντέλο",description:"Ετικέτα επιλογής μοντέλου SeeDream"},"model.seedream45":{message:"doubao-seedream-4.5",description:"Επιλογή μοντέλου SeeDream 4.5"},"model.seedream40":{message:"doubao-seedream-4.0",description:"Επιλογή μοντέλου SeeDream 4.0"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"Επιλογή μοντέλου SeeDream 3.0 t2i"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"Επιλογή μοντέλου SeeEdit 3.0 i2i"},"model.seedream50":{message:"doubao-seedream-5.0",description:"Επιλογή μοντέλου SeeDream 5.0 (υποστηρίζει ομαδική και ροή εξόδου)"},"name.maxImages":{message:"Αριθμός εικόνων",description:"Αριθμός εικόνων για ομαδική δημιουργία (max_images)"},"description.maxImages":{message:"Αριθμός εικόνων που δημιουργούνται σε μία αίτηση (1-15). Αν οριστεί σε 1, είναι σε λειτουργία μεμονωμένης εικόνας; αν είναι μεγαλύτερο από 1, ενεργοποιείται αυτόματα η ομαδική δημιουργία (sequential_image_generation=auto), διατηρώντας τον χαρακτήρα, το στυλ και τις λεπτομέρειες σταυρωτά. Υποστηρίζεται μόνο από doubao-seedream-5.0 / 4.5 / 4.0; αν ανεβάσετε αναφορές εικόνας, πρέπει να πληρούν (αριθμός αναφορών + αριθμός δημιουργίας) ≤ 15. Η χρέωση γίνεται με βάση τον πραγματικό αριθμό εικόνων που δημιουργούνται.",description:"Περιγραφή παραμέτρου max_images"},"name.seed":{message:"Τυχαίος σπόρος",description:"Ετικέτα παραμέτρου seed"},"description.seed":{message:"Τυχαίος σπόρος για αναπαραγωγή, εύρος [-1, 2147483647]. -1 σημαίνει τυχαίο κάθε φορά. Υποστηρίζεται μόνο από doubao-seedream-3.0-t2i και doubao-seededit-3.0-i2i.",description:"Περιγραφή παραμέτρου seed"},"name.guidanceScale":{message:"Βάρος προτροπής",description:"Ετικέτα παραμέτρου guidance_scale"},"description.guidanceScale":{message:"Ένταση συμμόρφωσης με την προτροπή, εύρος [1, 10]. Όσο μεγαλύτερη η τιμή, τόσο πιο πιστό στο prompt. Προεπιλογή doubao-seedream-3.0-t2i: 2.5, doubao-seededit-3.0-i2i: 5.5.",description:"Περιγραφή παραμέτρου guidance_scale"},"name.outputFormat":{message:"Μορφή εξόδου",description:"Ετικέτα παραμέτρου output_format"},"description.outputFormat":{message:"Μορφή αρχείου της παραγόμενης εικόνας, jpeg ή png, προεπιλογή jpeg. Υποστηρίζεται μόνο από doubao-seedream-5.0.",description:"Περιγραφή παραμέτρου output_format"},"size.group.tier":{message:"Επίπεδα ανάλυσης",description:"Ομάδα επιπέδων ανάλυσης (1K-4K) στο dropdown"},"size.group.adaptive":{message:"Προσαρμοστικό",description:"Ομάδα προσαρμοστικών μεγεθών στο dropdown"},"size.group.pixel":{message:"Συγκεκριμένες διαστάσεις σε pixels",description:"Ομάδα διαστάσεων σε pixels στο dropdown"},"size.adaptive":{message:"Προσαρμοστικό (ίδιο με την αναφορά εικόνας)",description:"Ετικέτα επιλογής adaptive"}};export{e as default};

package/dist/assets/seedream-CWNldNIG.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"Uppgift ID",description:"Uppgiftens ID"},"name.task":{message:"Uppgiftstyp",description:"SeeDream bildoperationstyp"},"name.generate":{message:"Skapa bild",description:"Operationstyp: Skapa bild"},"name.edits":{message:"Redigera bild",description:"Operationstyp: Redigera bild"},"name.imageUrls":{message:"Referensbilder",description:"Referensbilder för redigering"},"name.failure":{message:"Misslyckades",description:"Uppgiften misslyckades"},"name.failureReason":{message:"Orsak till misslyckande",description:"Orsak till att uppgiften misslyckades"},"name.status":{message:"Status",description:"Uppgiftens status"},"name.traceId":{message:"Spårnings ID",description:"Spårnings ID"},"name.elapsed":{message:"Tid förbrukad",description:"Tid som uppgiften tog (sekunder)"},"name.prompt":{message:"Bildprompt",description:"Prompt för att generera/redigera"},"name.seedreamBot":{message:"SeeDream Bot",description:"Namn på SeeDream bildgenerator"},"name.size":{message:"Storlek",description:"Utdata bildstorlek"},"name.watermark":{message:"Vattenstämpel",description:"Om vattenstämpel ska läggas till"},"description.prompt":{message:"Prompt för att generera eller redigera bild",description:"Beskrivning av prompt"},"description.model":{message:"Modellen som används för att generera eller redigera bilder.",description:"Beskrivning av model parameter"},"description.size":{message:"Bildstorlek. Stöder förinställningar `1K`, `2K`, `4K` eller anpassad `<bredd>x<höjd>`.",description:"Beskrivning av size parameter"},"description.watermark":{message:"Om AI-vattenstämpel ska läggas till i den genererade bilden. Som standard aktiverad.",description:"Beskrivning av watermark parameter"},"description.imageUrls":{message:"Ladda upp 1-14 referensbilder för att aktivera bildredigering.",description:"Beskrivning av image parameter"},"status.pending":{message:"Väntar",description:"Uppgiftens väntande status"},"placeholder.select":{message:"Välj",description:"Välj platshållare"},"placeholder.size":{message:"Välj förinställning eller ange <bredd>x<höjd>",description:"Platshållare för size-val/ingång (el-select allow-create)"},"placeholder.prompt":{message:"Ange prompt, t.ex.: en vit siamesisk katt",description:"Prompt platshållare"},"button.generate":{message:"Generera",description:"Generera knapp"},"button.uploadImageUrls":{message:"Ladda upp",description:"Ladda upp referensbilder knapp (engelska förenklas till 'Upload', använd inte 'Upload Images')"},"button.confirmContinue":{message:"Fortsätt byta",description:"Bekräfta-knappen i varningsdialogen för funktionskonflikt"},"button.cancelSwitch":{message:"Avbryt",description:"Avbryt-knappen i varningsdialogen för funktionskonflikt"},"message.startingTask":{message:"Startar uppgift...",description:"Meddelande om att starta uppgift"},"message.startTaskSuccess":{message:"Uppgift för generering startad framgångsrikt",description:"Uppgiften skapades framgångsrikt"},"message.startTaskFailed":{message:"Misslyckades med att starta uppgift, vänligen kontakta administratören:",description:"Uppgiftsskapande misslyckades"},"message.usedUp":{message:"Dina poäng är slut, vänligen köp fler poäng för att fortsätta använda",description:"Meddelande om att poängen är slut"},"message.uploadImageExceed":{message:"Maximalt 14 bilder kan laddas upp",description:"Antalet bilder överskrider gränsen"},"message.uploadImageError":{message:"Misslyckades med att ladda upp bild, vänligen försök igen senare",description:"Misslyckades med uppladdning"},"message.featureNotSupportedTitle":{message:"Bekräftelse krävs",description:"Titel i varningsdialog för funktionskonflikt"},"message.featureNotSupportedBody":{message:"Det aktuella valet stöder inte följande aktiverade inställningar: {fields}. Om du fortsätter kommer dessa inställningar att tas bort.",description:"Huvudtext i varningsdialog för funktionskonflikt"},"message.featureRemovedNotice":{message:"Ej stödda inställningar har tagits bort: {fields}",description:"Meddelande efter att funktionskonflikt rensats"},"name.model":{message:"Modell",description:"Etikett för val av SeeDream-modell"},"model.seedream45":{message:"doubao-seedream-4.5",description:"Val av SeeDream 4.5-modell"},"model.seedream40":{message:"doubao-seedream-4.0",description:"Val av SeeDream 4.0-modell"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"Val av SeeDream 3.0 t2i-modell"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"Val av SeeEdit 3.0 i2i-modell"},"model.seedream50":{message:"doubao-seedream-5.0",description:"Val av SeeDream 5.0-modell (stöder bildserie och strömmande utdata)"},"name.maxImages":{message:"Antal bilder",description:"Antal bilder som genereras i en bildserie (max_images)"},"description.maxImages":{message:"Antal bilder som genereras i en begäran (1-15). Sätt till 1 för enstaka bildläge; mer än 1 aktiverar automatiskt bildserie (sequential_image_generation=auto), och håller karaktär, stil och detaljer konsekventa över bilder. Endast doubao-seedream-5.0 / 4.5 / 4.0 stöds; om referensbilder laddas upp, måste (antal referensbilder + antal genererade) ≤ 15. Avgifter baseras på det faktiska antalet genererade bilder.",description:"Beskrivning av max_images parameter"},"name.seed":{message:"Slumpfrö",description:"Etikett för parametern seed"},"description.seed":{message:"Slumpmässigt frö för reproducerbarhet, intervall [-1, 2147483647]. -1 innebär helt slumpmässigt. Endast doubao-seedream-3.0-t2i och doubao-seededit-3.0-i2i stöds.",description:"Förklaring av parametern seed"},"name.guidanceScale":{message:"Promptvikt",description:"Etikett för parametern guidance_scale"},"description.guidanceScale":{message:"Promptens efterlevnadsgrad, intervall [1, 10]. Ju högre värde, desto närmare prompten. doubao-seedream-3.0-t2i standard 2,5, doubao-seededit-3.0-i2i standard 5,5.",description:"Förklaring av parametern guidance_scale"},"name.outputFormat":{message:"Utdataformat",description:"Etikett för parametern output_format"},"description.outputFormat":{message:"Filformat för genererade bilder, jpeg eller png, standard jpeg. Endast doubao-seedream-5.0 stöds.",description:"Förklaring av parametern output_format"},"size.group.tier":{message:"Upplösningsnivå",description:"Nivågrupp i storleksrullgardin (1K-4K)"},"size.group.adaptive":{message:"Adaptiv",description:"Adaptiv grupp i storleksrullgardin"},"size.group.pixel":{message:"Specifik pixeldimension",description:"Pixelgrupp i storleksrullgardin"},"size.adaptive":{message:"Adaptiv (samma som referensbild)",description:"Etikett för adaptive-valet"}};export{e as default};

package/dist/assets/{seedream-DN5QwC3v.js → seedream-ClAiq-ga.js}

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

package/dist/assets/seedream-Cq7q1IyE.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"ID da Tarefa",description:"ID da tarefa"},"name.task":{message:"Tipo de Tarefa",description:"Tipo de operação de imagem SeeDream"},"name.generate":{message:"Criar Imagem",description:"Tipo de operação: criar imagem"},"name.edits":{message:"Editar Imagem",description:"Tipo de operação: editar imagem"},"name.imageUrls":{message:"Imagens de Referência",description:"Imagens de referência para edição"},"name.failure":{message:"Falha",description:"Tarefa falhou"},"name.failureReason":{message:"Razão da Falha",description:"Razão pela qual a tarefa falhou"},"name.status":{message:"Status",description:"Status da tarefa"},"name.traceId":{message:"ID de Rastreamento",description:"ID de rastreamento"},"name.elapsed":{message:"Tempo Decorrido",description:"Tempo decorrido da tarefa (segundos)"},"name.prompt":{message:"Prompt de Imagem",description:"Palavras-chave para gerar/editar"},"name.seedreamBot":{message:"SeeDream Bot",description:"Nome do gerador de imagens SeeDream"},"name.size":{message:"Tamanho",description:"Tamanho da imagem de saída"},"name.watermark":{message:"Marca d'água",description:"Adicionar marca d'água"},"description.prompt":{message:"Palavras-chave para gerar ou editar a imagem",description:"Descrição do prompt"},"description.model":{message:"Modelo usado para gerar ou editar imagens.",description:"Descrição do parâmetro model"},"description.size":{message:"Tamanho da imagem. Suporta predefinições `1K`, `2K`, `4K` ou personalizadas `<largura>x<altura>`.",description:"Descrição do parâmetro size"},"description.watermark":{message:"Adicionar marca d'água AI à imagem gerada. Ativado por padrão.",description:"Descrição do parâmetro watermark"},"description.imageUrls":{message:"Envie de 1 a 14 imagens de referência para habilitar a edição de imagens.",description:"Descrição do parâmetro image"},"status.pending":{message:"Aguardando",description:"Status de espera da tarefa"},"placeholder.select":{message:"Selecionar",description:"Placeholder de seleção"},"placeholder.size":{message:"Escolha um preset ou insira <largura>x<altura>",description:"Placeholder para seleção/entrada de size (el-select allow-create)"},"placeholder.prompt":{message:"Digite o prompt, por exemplo: um gato siames branco",description:"Placeholder do prompt"},"button.generate":{message:"Gerar",description:"Botão de gerar"},"button.uploadImageUrls":{message:"Enviar",description:"Botão para enviar imagens de referência (simplificado para 'Enviar')"},"button.confirmContinue":{message:"Continuar troca",description:"Botão de confirmar na caixa de aviso de conflito de recurso"},"button.cancelSwitch":{message:"Cancelar",description:"Botão de cancelar na caixa de aviso de conflito de recurso"},"message.startingTask":{message:"Iniciando tarefa...",description:"Mensagem de início da tarefa"},"message.startTaskSuccess":{message:"Tarefa de geração iniciada com sucesso",description:"Tarefa criada com sucesso"},"message.startTaskFailed":{message:"Falha ao iniciar a tarefa, entre em contato com o administrador:",description:"Falha na criação da tarefa"},"message.usedUp":{message:"Seus créditos acabaram, por favor, compre mais créditos para continuar usando",description:"Mensagem de créditos esgotados"},"message.uploadImageExceed":{message:"Máximo de 14 imagens podem ser enviadas",description:"Número de imagens excedeu o limite"},"message.uploadImageError":{message:"Falha ao enviar a imagem, por favor, tente novamente mais tarde",description:"Falha no envio"},"message.featureNotSupportedTitle":{message:"Confirmação necessária",description:"Título da caixa de aviso de conflito de recurso"},"message.featureNotSupportedBody":{message:"As seguintes configurações habilitadas não são suportadas pela seleção atual: {fields}. Continuar irá limpar essas configurações.",description:"Corpo da caixa de aviso de conflito de recurso"},"message.featureRemovedNotice":{message:"Configurações não suportadas limpas: {fields}",description:"Mensagem exibida após limpeza de configurações não suportadas"},"name.model":{message:"Modelo",description:"Etiqueta de seleção do modelo SeeDream"},"model.seedream45":{message:"doubao-seedream-4.5",description:"Opção de modelo SeeDream 4.5"},"model.seedream40":{message:"doubao-seedream-4.0",description:"Opção de modelo SeeDream 4.0"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"Opção de modelo SeeDream 3.0 t2i"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"Opção de modelo SeeEdit 3.0 i2i"},"model.seedream50":{message:"doubao-seedream-5.0",description:"Opção de modelo SeeDream 5.0 (suporta geração de imagens em grupo e saída contínua)"},"name.maxImages":{message:"Número de Imagens",description:"Número de imagens geradas em grupo (max_images)"},"description.maxImages":{message:"Número de imagens geradas em uma única solicitação (1-15). Definido como 1 para modo de imagem única; maior que 1 ativa automaticamente a geração de imagens em grupo (sequential_image_generation=auto), mantendo personagens, estilo e detalhes consistentes entre as imagens. Suporta apenas doubao-seedream-5.0 / 4.5 / 4.0; se imagens de referência forem enviadas, deve-se atender a (número de imagens de referência + número gerado) ≤ 15. A cobrança é feita com base no número real de imagens geradas.",description:"Descrição do parâmetro max_images"},"name.seed":{message:"Semente aleatória",description:"Etiqueta do parâmetro seed"},"description.seed":{message:"Semente aleatória para reprodução, intervalo [-1, 2147483647]. -1 gera aleatório a cada vez. Suportado apenas por doubao-seedream-3.0-t2i e doubao-seededit-3.0-i2i.",description:"Descrição do parâmetro seed"},"name.guidanceScale":{message:"Peso do prompt",description:"Etiqueta do parâmetro guidance_scale"},"description.guidanceScale":{message:"Intensidade de aderência ao prompt, intervalo [1, 10]. Quanto maior, mais próximo do prompt. doubao-seedream-3.0-t2i padrão 2,5, doubao-seededit-3.0-i2i padrão 5,5.",description:"Descrição do parâmetro guidance_scale"},"name.outputFormat":{message:"Formato de saída",description:"Etiqueta do parâmetro output_format"},"description.outputFormat":{message:"Formato do arquivo da imagem gerada, jpeg ou png, padrão jpeg. Suportado apenas pelo doubao-seedream-5.0.",description:"Descrição do parâmetro output_format"},"size.group.tier":{message:"Níveis de resolução",description:"Grupo de níveis (1K-4K) no dropdown de tamanho"},"size.group.adaptive":{message:"Adaptativo",description:"Grupo adaptativo no dropdown de tamanho"},"size.group.pixel":{message:"Tamanho em pixels específico",description:"Grupo de tamanhos em pixels no dropdown de tamanho"},"size.adaptive":{message:"Adaptativo (igual à imagem de referência)",description:"Etiqueta da opção adaptive"}};export{e as default};

package/dist/assets/seedream-Cw-Jr5K3.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"ID задачи",description:"ID задачи"},"name.task":{message:"Тип задачи",description:"Тип операции с изображением SeeDream"},"name.generate":{message:"Создать изображение",description:"Тип операции: создать изображение"},"name.edits":{message:"Редактировать изображение",description:"Тип операции: редактировать изображение"},"name.imageUrls":{message:"Ссылки на изображения",description:"Ссылки на изображения для редактирования"},"name.failure":{message:"Ошибка",description:"Задача завершилась неудачей"},"name.failureReason":{message:"Причина ошибки",description:"Причина неудачи задачи"},"name.status":{message:"Статус",description:"Статус задачи"},"name.traceId":{message:"ID отслеживания",description:"ID отслеживания"},"name.elapsed":{message:"Время выполнения",description:"Время выполнения задачи (в секундах)"},"name.prompt":{message:"Подсказка для изображения",description:"Подсказка для генерации/редактирования"},"name.seedreamBot":{message:"SeeDream Bot",description:"Название генератора изображений SeeDream"},"name.size":{message:"Размер",description:"Размер выходного изображения"},"name.watermark":{message:"Водяной знак",description:"Добавить ли водяной знак"},"description.prompt":{message:"Подсказка для генерации или редактирования изображения",description:"Описание подсказки"},"description.model":{message:"Модель, используемая для генерации или редактирования изображений.",description:"Описание параметра model"},"description.size":{message:"Размер изображения. Поддерживаются предустановки `1K`, `2K`, `4K` или пользовательские `<ширина>x<высота>`.",description:"Описание параметра size"},"description.watermark":{message:"Добавить ли AI водяной знак в сгенерированное изображение. По умолчанию включено.",description:"Описание параметра watermark"},"description.imageUrls":{message:"Загрузите от 1 до 14 ссылок на изображения для включения редактирования.",description:"Описание параметра image"},"status.pending":{message:"В ожидании",description:"Статус ожидания задачи"},"placeholder.select":{message:"Выбрать",description:"Заполнитель для выбора"},"placeholder.size":{message:"Выберите пресет или введите <ширина>x<высота>",description:"Заполнитель для выбора/ввода размера (el-select allow-create)"},"placeholder.prompt":{message:"Введите подсказку, например: белый сиамский кот",description:"Заполнитель для подсказки"},"button.generate":{message:"Сгенерировать",description:"Кнопка генерации"},"button.uploadImageUrls":{message:"Загрузить",description:"Кнопка загрузки ссылок на изображения (упростите до 'Загрузить', не используйте 'Загрузить изображения')"},"button.confirmContinue":{message:"Продолжить переключение",description:"Кнопка подтверждения в окне конфликта возможностей"},"button.cancelSwitch":{message:"Отмена",description:"Кнопка отмены в окне конфликта возможностей"},"message.startingTask":{message:"Запуск задачи...",description:"Сообщение о начале задачи"},"message.startTaskSuccess":{message:"Задача на генерацию успешно запущена",description:"Задача успешно создана"},"message.startTaskFailed":{message:"Не удалось запустить задачу, пожалуйста, свяжитесь с администратором:",description:"Неудача при создании задачи"},"message.usedUp":{message:"Ваши кредиты исчерпаны, пожалуйста, купите больше кредитов для продолжения использования",description:"Сообщение об исчерпании"},"message.uploadImageExceed":{message:"Максимум можно загрузить 14 изображений",description:"Количество изображений превышает лимит"},"message.uploadImageError":{message:"Не удалось загрузить изображение, пожалуйста, попробуйте позже",description:"Ошибка загрузки"},"message.featureNotSupportedTitle":{message:"Требуется подтверждение",description:"Заголовок окна конфликта возможностей"},"message.featureNotSupportedBody":{message:"Выбранная конфигурация не поддерживает следующие активные настройки: {fields}. Продолжение приведет к их очистке.",description:"Основной текст окна конфликта возможностей"},"message.featureRemovedNotice":{message:"Очищены неподдерживаемые настройки: {fields}",description:"Сообщение после очистки неподдерживаемых настроек"},"name.model":{message:"Модель",description:"Метка выбора модели SeeDream"},"model.seedream45":{message:"doubao-seedream-4.5",description:"Опция модели SeeDream 4.5"},"model.seedream40":{message:"doubao-seedream-4.0",description:"Опция модели SeeDream 4.0"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"Опция модели SeeDream 3.0 t2i"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"Опция модели SeeEdit 3.0 i2i"},"model.seedream50":{message:"doubao-seedream-5.0",description:"Опция модели SeeDream 5.0 (поддерживает групповые и потоковые выводы)"},"name.maxImages":{message:"Количество изображений",description:"Количество изображений для групповой генерации (max_images)"},"description.maxImages":{message:"Количество изображений, генерируемых за один запрос (1-15). Установите 1 для одиночного режима; больше 1 автоматически включает групповую генерацию (sequential_image_generation=auto), сохраняя персонажа, стиль и детали между изображениями. Поддерживаются только doubao-seedream-5.0 / 4.5 / 4.0; если загружены ссылки на изображения, необходимо, чтобы (количество ссылок + количество генерируемых) ≤ 15. Оплата производится за фактическое количество сгенерированных изображений.",description:"Описание параметра max_images"},"name.seed":{message:"Случайное семя",description:"Метка параметра seed"},"description.seed":{message:"Случайное семя для воспроизводимости, диапазон [-1, 2147483647]. -1 означает случайное значение при каждом запуске. Поддерживается только doubao-seedream-3.0-t2i и doubao-seededit-3.0-i2i.",description:"Описание параметра seed"},"name.guidanceScale":{message:"Вес подсказки",description:"Метка параметра guidance_scale"},"description.guidanceScale":{message:"Интенсивность следования подсказке, диапазон [1, 10]. Чем выше значение, тем точнее соответствие подсказке. doubao-seedream-3.0-t2i по умолчанию 2.5, doubao-seededit-3.0-i2i по умолчанию 5.5.",description:"Описание параметра guidance_scale"},"name.outputFormat":{message:"Формат вывода",description:"Метка параметра output_format"},"description.outputFormat":{message:"Формат файла для создаваемого изображения, jpeg или png, по умолчанию jpeg. Поддерживается только doubao-seedream-5.0.",description:"Описание параметра output_format"},"size.group.tier":{message:"Уровни разрешения",description:"Группа уровней разрешения в выпадающем списке (1K-4K)"},"size.group.adaptive":{message:"Адаптивно",description:"Группа адаптивных размеров в выпадающем списке"},"size.group.pixel":{message:"Конкретные пиксельные размеры",description:"Группа пиксельных размеров в выпадающем списке"},"size.adaptive":{message:"Адаптивно (соответствует образцу)",description:"Метка опции adaptive"}};export{e as default};

package/dist/assets/seedream-D1GbaU57.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"معرف المهمة",description:"معرف المهمة"},"name.task":{message:"نوع المهمة",description:"نوع عملية SeeDream للصورة"},"name.generate":{message:"إنشاء صورة",description:"نوع العملية: إنشاء صورة"},"name.edits":{message:"تحرير صورة",description:"نوع العملية: تحرير صورة"},"name.imageUrls":{message:"صور مرجعية",description:"صور مرجعية للاستخدام في التحرير"},"name.failure":{message:"فشل",description:"فشل المهمة"},"name.failureReason":{message:"سبب الفشل",description:"سبب فشل المهمة"},"name.status":{message:"الحالة",description:"حالة المهمة"},"name.traceId":{message:"معرف التتبع",description:"معرف التتبع"},"name.elapsed":{message:"الوقت المستغرق",description:"الوقت المستغرق للمهمة (بالثواني)"},"name.prompt":{message:"نص الصورة",description:"نص التوليد/التحرير"},"name.seedreamBot":{message:"روبوت SeeDream",description:"اسم مولد الصور SeeDream"},"name.size":{message:"الحجم",description:"حجم الصورة الناتجة"},"name.watermark":{message:"علامة مائية",description:"هل يتم إضافة علامة مائية"},"description.prompt":{message:"نص التوليد أو التحرير للصورة",description:"وصف نص التوليد"},"description.model":{message:"النموذج المستخدم لتوليد أو تحرير الصور.",description:"وصف معلمة النموذج"},"description.size":{message:"حجم الصورة. يدعم الإعدادات المسبقة `1K`، `2K`، `4K` أو حجم مخصص `<عرض>x<ارتفاع>`.",description:"وصف معلمة الحجم"},"description.watermark":{message:"هل يتم إضافة علامة مائية للذكاء الاصطناعي في الصورة الناتجة. مفعل بشكل افتراضي.",description:"وصف معلمة العلامة المائية"},"description.imageUrls":{message:"قم بتحميل من 1 إلى 14 صورة مرجعية لتمكين تحرير الصور.",description:"وصف معلمة الصور"},"status.pending":{message:"في الانتظار",description:"حالة انتظار المهمة"},"placeholder.select":{message:"اختر",description:"نص العنصر المحدد"},"placeholder.size":{message:"اختر إعدادًا مسبقًا أو أدخل <العرض>x<الارتفاع>",description:"عنصر نائب لاختيار/إدخال الحجم (el-select allow-create)"},"placeholder.prompt":{message:"أدخل نص التوليد، مثل: قطة سيامية بيضاء",description:"نص العنصر المحدد"},"button.generate":{message:"توليد",description:"زر التوليد"},"button.uploadImageUrls":{message:"تحميل",description:"زر تحميل الصور المرجعية (يرجى تبسيط إلى 'تحميل'، لا تستخدم 'تحميل الصور')"},"button.confirmContinue":{message:"متابعة التبديل",description:"زر التأكيد في مربع حوار تعارض القدرات"},"button.cancelSwitch":{message:"إلغاء",description:"زر الإلغاء في مربع حوار تعارض القدرات"},"message.startingTask":{message:"جارٍ بدء المهمة...",description:"رسالة بدء المهمة"},"message.startTaskSuccess":{message:"تم بدء مهمة التوليد بنجاح",description:"تم إنشاء المهمة بنجاح"},"message.startTaskFailed":{message:"فشل بدء المهمة، يرجى الاتصال بالمسؤول:",description:"فشل إنشاء المهمة"},"message.usedUp":{message:"لقد نفدت نقاطك، يرجى شراء المزيد من النقاط للاستمرار في الاستخدام",description:"رسالة نفاد النقاط"},"message.uploadImageExceed":{message:"يمكنك تحميل ما يصل إلى 14 صورة",description:"تجاوز عدد الصور الحد المسموح به"},"message.uploadImageError":{message:"فشل تحميل الصورة، يرجى المحاولة لاحقًا",description:"فشل التحميل"},"message.featureNotSupportedTitle":{message:"تأكيد مطلوب",description:"عنوان مربع حوار تعارض القدرات"},"message.featureNotSupportedBody":{message:"الإعدادات التالية المفعلة غير مدعومة في الاختيار الحالي: {fields}. الاستمرار سيؤدي إلى مسح هذه الإعدادات.",description:"محتوى مربع حوار تعارض القدرات"},"message.featureRemovedNotice":{message:"تم مسح الإعدادات غير المدعومة: {fields}",description:"رسالة بعد تنظيف إعدادات غير مدعومة"},"name.model":{message:"النموذج",description:"علامة اختيار نموذج SeeDream"},"model.seedream45":{message:"doubao-seedream-4.5",description:"خيار نموذج SeeDream 4.5"},"model.seedream40":{message:"doubao-seedream-4.0",description:"خيار نموذج SeeDream 4.0"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"خيار نموذج SeeDream 3.0 t2i"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"خيار نموذج SeeEdit 3.0 i2i"},"model.seedream50":{message:"doubao-seedream-5.0",description:"خيار نموذج SeeDream 5.0 (يدعم توليد الصور المتسلسلة والإخراج المتدفق)"},"name.maxImages":{message:"عدد الصور",description:"عدد الصور التي يتم توليدها في مجموعة الصور (max_images)"},"description.maxImages":{message:"عدد الصور التي يتم توليدها في طلب واحد (1-15). إذا تم تعيينها إلى 1، فهي وضع صورة واحدة؛ إذا كانت أكبر من 1، يتم تفعيل مجموعة الصور تلقائيًا (sequential_image_generation=auto)، مع الحفاظ على الشخصيات والأسلوب والتفاصيل متسقة عبر الصور. يدعم فقط doubao-seedream-5.0 / 4.5 / 4.0؛ إذا تم تحميل صور مرجعية، يجب أن تفي بالشرط (عدد الصور المرجعية + عدد الصور الناتجة) ≤ 15. يتم احتساب الرسوم بناءً على عدد الصور الناتجة الفعلي.",description:"وصف معلمة max_images"},"name.seed":{message:"البذرة العشوائية",description:"تسمية معلمة seed"},"description.seed":{message:"البذرة العشوائية لإعادة الإنتاج، النطاق [-1, 2147483647]. -1 يعني عشوائي في كل مرة. مدعوم فقط في doubao-seedream-3.0-t2i و doubao-seededit-3.0-i2i.",description:"شرح معلمة seed"},"name.guidanceScale":{message:"وزن التعليمات",description:"تسمية معلمة guidance_scale"},"description.guidanceScale":{message:"قوة اتباع التعليمات، النطاق [1, 10]. كلما زاد الرقم، كان الناتج أقرب للتعليمات. doubao-seedream-3.0-t2i الافتراضي 2.5، doubao-seededit-3.0-i2i الافتراضي 5.5.",description:"شرح معلمة guidance_scale"},"name.outputFormat":{message:"صيغة الإخراج",description:"تسمية معلمة output_format"},"description.outputFormat":{message:"صيغة الملف للصورة المولدة، jpeg أو png، الافتراضي jpeg. مدعوم فقط في doubao-seedream-5.0.",description:"شرح معلمة output_format"},"size.group.tier":{message:"مستوى الدقة",description:"مجموعة مستويات الدقة في قائمة الأحجام المنسدلة (1K-4K)"},"size.group.adaptive":{message:"تلقائي",description:"مجموعة adaptive في قائمة الأحجام المنسدلة"},"size.group.pixel":{message:"أبعاد بكسل محددة",description:"مجموعة أبعاد البكسل في قائمة الأحجام المنسدلة"},"size.adaptive":{message:"تلقائي (مطابق للصورة المرجعية)",description:"تسمية خيار adaptive"}};export{e as default};

package/dist/assets/seedream-DD82YLfF.js

@@ -0,0 +1 @@
+const e={"name.taskId":{message:"任務 ID",description:"任務的 ID"},"name.task":{message:"任務類型",description:"SeeDream 圖片操作類型"},"name.generate":{message:"創建圖片",description:"操作類型：創建圖片"},"name.edits":{message:"編輯圖片",description:"操作類型：編輯圖片"},"name.imageUrls":{message:"參考圖片",description:"用於編輯的參考圖片"},"name.failure":{message:"失敗",description:"任務失敗"},"name.failureReason":{message:"失敗原因",description:"任務失敗原因"},"name.status":{message:"狀態",description:"任務狀態"},"name.traceId":{message:"追蹤 ID",description:"追蹤 ID"},"name.elapsed":{message:"耗時",description:"任務的耗時（秒）"},"name.prompt":{message:"圖像提示",description:"生成/編輯的提示詞"},"name.seedreamBot":{message:"SeeDream Bot",description:"SeeDream 圖片生成器名稱"},"name.size":{message:"尺寸",description:"輸出圖片尺寸"},"name.watermark":{message:"水印",description:"是否添加水印"},"description.prompt":{message:"生成或編輯圖像的提示詞",description:"提示詞描述"},"description.model":{message:"用於生成或編輯圖片的模型。",description:"model 參數說明"},"description.size":{message:"圖片尺寸。支持預設 `1K`、`2K`、`4K` 或自定義 `<寬>x<高>`。",description:"size 參數說明"},"description.watermark":{message:"是否在生成的圖片中添加 AI 水印。默認開啟。",description:"watermark 參數說明"},"description.imageUrls":{message:"上傳 1-14 張參考圖片以啟用圖片編輯。",description:"image 參數說明"},"status.pending":{message:"等待中",description:"任務等待狀態"},"placeholder.select":{message:"選擇",description:"選擇佔位"},"placeholder.size":{message:"選擇預設或輸入 <寬>x<高>",description:"size 選擇/輸入佔位（el-select allow-create）"},"placeholder.prompt":{message:"輸入提示詞，例如：一隻白色的暹羅貓",description:"提示佔位"},"button.generate":{message:"生成",description:"生成按鈕"},"button.uploadImageUrls":{message:"上傳圖片",description:"上傳參考圖片按鈕（英文請簡化為“Upload”，不要用“Upload Images”）"},"button.confirmContinue":{message:"繼續切換",description:"能力衝突提示框的確認按鈕"},"button.cancelSwitch":{message:"取消",description:"能力衝突提示框的取消按鈕"},"message.startingTask":{message:"正在啟動任務...",description:"開始任務消息"},"message.startTaskSuccess":{message:"成功發起生成任務",description:"任務成功創建"},"message.startTaskFailed":{message:"發起任務失敗，請聯繫管理員：",description:"任務創建失敗"},"message.usedUp":{message:"您的積分已用完，請購買更多積分後繼續使用",description:"已用完提示"},"message.uploadImageExceed":{message:"最多可上傳 14 張圖片",description:"圖片數量超過限制"},"message.uploadImageError":{message:"上傳圖片失敗，請稍後重試",description:"上傳失敗"},"message.featureNotSupportedTitle":{message:"需要確認",description:"能力衝突提示框標題"},"message.featureNotSupportedBody":{message:"當前選擇不支持以下已啟用的設置：{fields}。繼續將清理這些設置。",description:"能力衝突提示框正文"},"message.featureRemovedNotice":{message:"已清理不支持的設置：{fields}",description:"能力衝突清理後的提示消息"},"name.model":{message:"模型",description:"SeeDream 模型選擇標籤"},"model.seedream45":{message:"doubao-seedream-4.5",description:"SeeDream 4.5 模型選項"},"model.seedream40":{message:"doubao-seedream-4.0",description:"SeeDream 4.0 模型選項"},"model.seedream30t2i":{message:"doubao-seedream-3.0-t2i",description:"SeeDream 3.0 t2i 模型選項"},"model.seededit30i2i":{message:"doubao-seededit-3.0-i2i",description:"SeeEdit 3.0 i2i 模型選項"},"model.seedream50":{message:"doubao-seedream-5.0",description:"SeeDream 5.0 模型選項（支持組圖與流式輸出）"},"name.maxImages":{message:"圖片張數",description:"組圖生成的圖片張數（max_images）"},"description.maxImages":{message:"一次請求生成的圖片數量（1-15）。設為 1 時為單圖模式；大於 1 時自動啟用組圖（sequential_image_generation=auto），跨圖保持角色、風格與細節一致。僅支持 doubao-seedream-5.0 / 4.5 / 4.0；如同時上傳參考圖，需滿足 (參考圖數 + 生成數) ≤ 15。計費按實際生成的圖片張數。",description:"max_images 參數說明"},"name.seed":{message:"隨機種子",description:"seed 參數標籤"},"description.seed":{message:"用於復現的隨機種子，範圍 [-1, 2147483647]。-1 表示每次隨機。僅支持 doubao-seedream-3.0-t2i 與 doubao-seededit-3.0-i2i。",description:"seed 參數說明"},"name.guidanceScale":{message:"提示詞權重",description:"guidance_scale 參數標籤"},"description.guidanceScale":{message:"提示詞遵循強度，範圍 [1, 10]。值越大越貼近提示詞。doubao-seedream-3.0-t2i 默認 2.5，doubao-seededit-3.0-i2i 默認 5.5。",description:"guidance_scale 參數說明"},"name.outputFormat":{message:"輸出格式",description:"output_format 參數標籤"},"description.outputFormat":{message:"生成圖片的文件格式，jpeg 或 png，默認 jpeg。僅 doubao-seedream-5.0 支持。",description:"output_format 參數說明"},"size.group.tier":{message:"分辨率檔位",description:"尺寸下拉的檔位分組（1K-4K）"},"size.group.adaptive":{message:"自適應",description:"尺寸下拉的自適應分組"},"size.group.pixel":{message:"具體像素尺寸",description:"尺寸下拉的像素尺寸分組"},"size.adaptive":{message:"自適應（與參考圖一致）",description:"adaptive 選項標籤"}};export{e as default};