@dcl/shop 0.1.0-29111888971.commit-e1b927a → 0.1.0-29111917255.commit-e6715c3

package/assets/{secp256k1-DFslM7tB.js → secp256k1-CrKymG_Q.js}

@@ -1 +1 @@
-import{bp as ee,bq as ne,br as re,bs as oe,bt as qt,bu as se,bv as _t,bw as tt,bx as Ct,by as lt,bz as ut,bA as dt,bB as ie,bC as ce,bD as Bt,bE as ot,bF as K,bG as At,bH as Mt,bI as ae,bJ as at,bK as vt,bL as jt,bM as ft,bN as Lt,bO as fe,bP as le,bQ as ue}from"./sendRawTransaction-DT-ObNx8.js";class Vt extends ee{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,ne(e);const o=re(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 c=this.blockLen,s=new Uint8Array(c);s.set(o.length>c?e.create().update(o).digest():o);for(let a=0;a<s.length;a++)s[a]^=54;this.iHash.update(s),this.oHash=e.create();for(let a=0;a<s.length;a++)s[a]^=106;this.oHash.update(s),oe(s)}update(e){return qt(this),this.iHash.update(e),this}digestInto(e){qt(this),se(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:o,finished:c,destroyed:s,blockLen:a,outputLen:d}=this;return e=e,e.finished=c,e.destroyed=s,e.blockLen=a,e.outputLen=d,e.oHash=t._cloneInto(e.oHash),e.iHash=o._cloneInto(e.iHash),e}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const Yt=(n,e,t)=>new Vt(n,e).update(t).digest();Yt.create=(n,e)=>new Vt(n,e);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const Y=BigInt(0),M=BigInt(1),J=BigInt(2),de=BigInt(3),Ut=BigInt(4),Kt=BigInt(5),Pt=BigInt(8);function V(n,e){const t=n%e;return t>=Y?t:e+t}function U(n,e,t){let o=n;for(;e-- >Y;)o*=o,o%=t;return o}function xt(n,e){if(n===Y)throw new Error("invert: expected non-zero number");if(e<=Y)throw new Error("invert: expected positive modulus, got "+e);let t=V(n,e),o=e,c=Y,s=M;for(;t!==Y;){const d=o/t,r=o%t,u=c-s*d;o=t,t=r,c=s,s=u}if(o!==M)throw new Error("invert: does not exist");return V(c,e)}function $t(n,e){const t=(n.ORDER+M)/Ut,o=n.pow(e,t);if(!n.eql(n.sqr(o),e))throw new Error("Cannot find square root");return o}function he(n,e){const t=(n.ORDER-Kt)/Pt,o=n.mul(e,J),c=n.pow(o,t),s=n.mul(e,c),a=n.mul(n.mul(s,J),c),d=n.mul(s,n.sub(a,n.ONE));if(!n.eql(n.sqr(d),e))throw new Error("Cannot find square root");return d}function we(n){if(n<BigInt(3))throw new Error("sqrt is not defined for small field");let e=n-M,t=0;for(;e%J===Y;)e/=J,t++;let o=J;const c=Ot(n);for(;Ht(c,o)===1;)if(o++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(t===1)return $t;let s=c.pow(o,e);const a=(e+M)/J;return function(r,u){if(r.is0(u))return u;if(Ht(r,u)!==1)throw new Error("Cannot find square root");let m=t,H=r.mul(r.ONE,s),q=r.pow(u,e),Z=r.pow(u,a);for(;!r.eql(q,r.ONE);){if(r.is0(q))return r.ZERO;let R=1,g=r.sqr(q);for(;!r.eql(g,r.ONE);)if(R++,g=r.sqr(g),R===m)throw new Error("Cannot find square root");const _=M<<BigInt(m-R-1),z=r.pow(H,_);m=R,H=r.sqr(z),q=r.mul(q,H),Z=r.mul(Z,z)}return Z}}function ge(n){return n%Ut===de?$t:n%Pt===Kt?he:we(n)}const me=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function be(n){const e={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},t=me.reduce((o,c)=>(o[c]="function",o),e);return dt(n,t)}function pe(n,e,t){if(t<Y)throw new Error("invalid exponent, negatives unsupported");if(t===Y)return n.ONE;if(t===M)return e;let o=n.ONE,c=e;for(;t>Y;)t&M&&(o=n.mul(o,c)),c=n.sqr(c),t>>=M;return o}function Dt(n,e,t=!1){const o=new Array(e.length).fill(t?n.ZERO:void 0),c=e.reduce((a,d,r)=>n.is0(d)?a:(o[r]=a,n.mul(a,d)),n.ONE),s=n.inv(c);return e.reduceRight((a,d,r)=>n.is0(d)?a:(o[r]=n.mul(a,o[r]),n.mul(a,d)),s),o}function Ht(n,e){const t=(n.ORDER-M)/J,o=n.pow(e,t),c=n.eql(o,n.ONE),s=n.eql(o,n.ZERO),a=n.eql(o,n.neg(n.ONE));if(!c&&!s&&!a)throw new Error("invalid Legendre symbol result");return c?1:s?0:-1}function Gt(n,e){e!==void 0&&ie(e);const t=e!==void 0?e:n.toString(2).length,o=Math.ceil(t/8);return{nBitLength:t,nByteLength:o}}function Ot(n,e,t=!1,o={}){if(n<=Y)throw new Error("invalid field: expected ORDER > 0, got "+n);const{nBitLength:c,nByteLength:s}=Gt(n,e);if(s>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let a;const d=Object.freeze({ORDER:n,isLE:t,BITS:c,BYTES:s,MASK:ut(c),ZERO:Y,ONE:M,create:r=>V(r,n),isValid:r=>{if(typeof r!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof r);return Y<=r&&r<n},is0:r=>r===Y,isOdd:r=>(r&M)===M,neg:r=>V(-r,n),eql:(r,u)=>r===u,sqr:r=>V(r*r,n),add:(r,u)=>V(r+u,n),sub:(r,u)=>V(r-u,n),mul:(r,u)=>V(r*u,n),pow:(r,u)=>pe(d,r,u),div:(r,u)=>V(r*xt(u,n),n),sqrN:r=>r*r,addN:(r,u)=>r+u,subN:(r,u)=>r-u,mulN:(r,u)=>r*u,inv:r=>xt(r,n),sqrt:o.sqrt||(r=>(a||(a=ge(n)),a(d,r))),toBytes:r=>t?Ct(r,s):lt(r,s),fromBytes:r=>{if(r.length!==s)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+r.length);return t?_t(r):tt(r)},invertBatch:r=>Dt(d,r),cmov:(r,u,m)=>m?u:r});return Object.freeze(d)}function Wt(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 Xt(n){const e=Wt(n);return e+Math.ceil(e/2)}function ye(n,e,t=!1){const o=n.length,c=Wt(e),s=Xt(e);if(o<16||o<s||o>1024)throw new Error("expected "+s+"-1024 bytes of input, got "+o);const a=t?_t(n):tt(n),d=V(a,e-M)+M;return t?Ct(d,c):lt(d,c)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const Rt=BigInt(0),St=BigInt(1);function gt(n,e){const t=e.negate();return n?t:e}function Qt(n,e){if(!Number.isSafeInteger(n)||n<=0||n>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+n)}function mt(n,e){Qt(n,e);const t=Math.ceil(e/n)+1,o=2**(n-1),c=2**n,s=ut(n),a=BigInt(n);return{windows:t,windowSize:o,mask:s,maxNumber:c,shiftBy:a}}function zt(n,e,t){const{windowSize:o,mask:c,maxNumber:s,shiftBy:a}=t;let d=Number(n&c),r=n>>a;d>o&&(d-=s,r+=St);const u=e*o,m=u+Math.abs(d)-1,H=d===0,q=d<0,Z=e%2!==0;return{nextN:r,offset:m,isZero:H,isNeg:q,isNegF:Z,offsetF:u}}function Ee(n,e){if(!Array.isArray(n))throw new Error("array expected");n.forEach((t,o)=>{if(!(t instanceof e))throw new Error("invalid point at index "+o)})}function Be(n,e){if(!Array.isArray(n))throw new Error("array of scalars expected");n.forEach((t,o)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+o)})}const bt=new WeakMap,Ft=new WeakMap;function pt(n){return Ft.get(n)||1}function ve(n,e){return{constTimeNegate:gt,hasPrecomputes(t){return pt(t)!==1},unsafeLadder(t,o,c=n.ZERO){let s=t;for(;o>Rt;)o&St&&(c=c.add(s)),s=s.double(),o>>=St;return c},precomputeWindow(t,o){const{windows:c,windowSize:s}=mt(o,e),a=[];let d=t,r=d;for(let u=0;u<c;u++){r=d,a.push(r);for(let m=1;m<s;m++)r=r.add(d),a.push(r);d=r.double()}return a},wNAF(t,o,c){let s=n.ZERO,a=n.BASE;const d=mt(t,e);for(let r=0;r<d.windows;r++){const{nextN:u,offset:m,isZero:H,isNeg:q,isNegF:Z,offsetF:R}=zt(c,r,d);c=u,H?a=a.add(gt(Z,o[R])):s=s.add(gt(q,o[m]))}return{p:s,f:a}},wNAFUnsafe(t,o,c,s=n.ZERO){const a=mt(t,e);for(let d=0;d<a.windows&&c!==Rt;d++){const{nextN:r,offset:u,isZero:m,isNeg:H}=zt(c,d,a);if(c=r,!m){const q=o[u];s=s.add(H?q.negate():q)}}return s},getPrecomputes(t,o,c){let s=bt.get(o);return s||(s=this.precomputeWindow(o,t),t!==1&&bt.set(o,c(s))),s},wNAFCached(t,o,c){const s=pt(t);return this.wNAF(s,this.getPrecomputes(s,t,c),o)},wNAFCachedUnsafe(t,o,c,s){const a=pt(t);return a===1?this.unsafeLadder(t,o,s):this.wNAFUnsafe(a,this.getPrecomputes(a,t,c),o,s)},setWindowSize(t,o){Qt(o,e),Ft.set(t,o),bt.delete(t)}}}function xe(n,e,t,o){Ee(t,n),Be(o,e);const c=t.length,s=o.length;if(c!==s)throw new Error("arrays of points and scalars must have equal length");const a=n.ZERO,d=ce(BigInt(c));let r=1;d>12?r=d-3:d>4?r=d-2:d>0&&(r=2);const u=ut(r),m=new Array(Number(u)+1).fill(a),H=Math.floor((e.BITS-1)/r)*r;let q=a;for(let Z=H;Z>=0;Z-=r){m.fill(a);for(let g=0;g<s;g++){const _=o[g],z=Number(_>>BigInt(Z)&u);m[z]=m[z].add(t[g])}let R=a;for(let g=m.length-1,_=a;g>0;g--)_=_.add(m[g]),R=R.add(_);if(q=q.add(R),Z!==0)for(let g=0;g<r;g++)q=q.double()}return q}function Jt(n){return be(n.Fp),dt(n,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Gt(n.n,n.nBitLength),...n,p:n.Fp.ORDER})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function Zt(n){n.lowS!==void 0&&at("lowS",n.lowS),n.prehash!==void 0&&at("prehash",n.prehash)}function Se(n){const e=Jt(n);dt(e,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:t,Fp:o,a:c}=e;if(t){if(!o.eql(c,o.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...e})}class Ie extends Error{constructor(e=""){super(e)}}const G={Err:Ie,_tlv:{encode:(n,e)=>{const{Err:t}=G;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length&1)throw new t("tlv.encode: unpadded data");const o=e.length/2,c=ft(o);if(c.length/2&128)throw new t("tlv.encode: long form length too big");const s=o>127?ft(c.length/2|128):"";return ft(n)+s+c+e},decode(n,e){const{Err:t}=G;let o=0;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length<2||e[o++]!==n)throw new t("tlv.decode: wrong tlv");const c=e[o++],s=!!(c&128);let a=0;if(!s)a=c;else{const r=c&127;if(!r)throw new t("tlv.decode(long): indefinite length not supported");if(r>4)throw new t("tlv.decode(long): byte length is too big");const u=e.subarray(o,o+r);if(u.length!==r)throw new t("tlv.decode: length bytes not complete");if(u[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const m of u)a=a<<8|m;if(o+=r,a<128)throw new t("tlv.decode(long): not minimal encoding")}const d=e.subarray(o,o+a);if(d.length!==a)throw new t("tlv.decode: wrong value length");return{v:d,l:e.subarray(o+a)}}},_int:{encode(n){const{Err:e}=G;if(n<W)throw new e("integer: negative integers are not allowed");let t=ft(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}=G;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 tt(n)}},toSig(n){const{Err:e,_int:t,_tlv:o}=G,c=K("signature",n),{v:s,l:a}=o.decode(48,c);if(a.length)throw new e("invalid signature: left bytes after parsing");const{v:d,l:r}=o.decode(2,s),{v:u,l:m}=o.decode(2,r);if(m.length)throw new e("invalid signature: left bytes after parsing");return{r:t.decode(d),s:t.decode(u)}},hexFromSig(n){const{_tlv:e,_int:t}=G,o=e.encode(2,t.encode(n.r)),c=e.encode(2,t.encode(n.s)),s=o+c;return e.encode(48,s)}};function yt(n,e){return vt(lt(n,e))}const W=BigInt(0),T=BigInt(1);BigInt(2);const Et=BigInt(3),Ne=BigInt(4);function Oe(n){const e=Se(n),{Fp:t}=e,o=Ot(e.n,e.nBitLength),c=e.toBytes||((x,i,h)=>{const b=i.toAffine();return Bt(Uint8Array.from([4]),t.toBytes(b.x),t.toBytes(b.y))}),s=e.fromBytes||(x=>{const i=x.subarray(1),h=t.fromBytes(i.subarray(0,t.BYTES)),b=t.fromBytes(i.subarray(t.BYTES,2*t.BYTES));return{x:h,y:b}});function a(x){const{a:i,b:h}=e,b=t.sqr(x),B=t.mul(b,x);return t.add(t.add(B,t.mul(x,i)),h)}function d(x,i){const h=t.sqr(i),b=a(x);return t.eql(h,b)}if(!d(e.Gx,e.Gy))throw new Error("bad curve params: generator point");const r=t.mul(t.pow(e.a,Et),Ne),u=t.mul(t.sqr(e.b),BigInt(27));if(t.is0(t.add(r,u)))throw new Error("bad curve params: a or b");function m(x){return jt(x,T,e.n)}function H(x){const{allowedPrivateKeyLengths:i,nByteLength:h,wrapPrivateKey:b,n:B}=e;if(i&&typeof x!="bigint"){if(Mt(x)&&(x=vt(x)),typeof x!="string"||!i.includes(x.length))throw new Error("invalid private key");x=x.padStart(h*2,"0")}let N;try{N=typeof x=="bigint"?x:tt(K("private key",x,h))}catch{throw new Error("invalid private key, expected hex or "+h+" bytes, got "+typeof x)}return b&&(N=V(N,B)),ot("private key",N,T,B),N}function q(x){if(!(x instanceof g))throw new Error("ProjectivePoint expected")}const Z=Lt((x,i)=>{const{px:h,py:b,pz:B}=x;if(t.eql(B,t.ONE))return{x:h,y:b};const N=x.is0();i==null&&(i=N?t.ONE:t.inv(B));const A=t.mul(h,i),O=t.mul(b,i),p=t.mul(B,i);if(N)return{x:t.ZERO,y:t.ZERO};if(!t.eql(p,t.ONE))throw new Error("invZ was invalid");return{x:A,y:O}}),R=Lt(x=>{if(x.is0()){if(e.allowInfinityPoint&&!t.is0(x.py))return;throw new Error("bad point: ZERO")}const{x:i,y:h}=x.toAffine();if(!t.isValid(i)||!t.isValid(h))throw new Error("bad point: x or y not FE");if(!d(i,h))throw new Error("bad point: equation left != right");if(!x.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class g{constructor(i,h,b){if(i==null||!t.isValid(i))throw new Error("x required");if(h==null||!t.isValid(h)||t.is0(h))throw new Error("y required");if(b==null||!t.isValid(b))throw new Error("z required");this.px=i,this.py=h,this.pz=b,Object.freeze(this)}static fromAffine(i){const{x:h,y:b}=i||{};if(!i||!t.isValid(h)||!t.isValid(b))throw new Error("invalid affine point");if(i instanceof g)throw new Error("projective point not allowed");const B=N=>t.eql(N,t.ZERO);return B(h)&&B(b)?g.ZERO:new g(h,b,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(i){const h=Dt(t,i.map(b=>b.pz));return i.map((b,B)=>b.toAffine(h[B])).map(g.fromAffine)}static fromHex(i){const h=g.fromAffine(s(K("pointHex",i)));return h.assertValidity(),h}static fromPrivateKey(i){return g.BASE.multiply(H(i))}static msm(i,h){return xe(g,o,i,h)}_setWindowSize(i){$.setWindowSize(this,i)}assertValidity(){R(this)}hasEvenY(){const{y:i}=this.toAffine();if(t.isOdd)return!t.isOdd(i);throw new Error("Field doesn't support isOdd")}equals(i){q(i);const{px:h,py:b,pz:B}=this,{px:N,py:A,pz:O}=i,p=t.eql(t.mul(h,O),t.mul(N,B)),I=t.eql(t.mul(b,O),t.mul(A,B));return p&&I}negate(){return new g(this.px,t.neg(this.py),this.pz)}double(){const{a:i,b:h}=e,b=t.mul(h,Et),{px:B,py:N,pz:A}=this;let O=t.ZERO,p=t.ZERO,I=t.ZERO,y=t.mul(B,B),k=t.mul(N,N),l=t.mul(A,A),f=t.mul(B,N);return f=t.add(f,f),I=t.mul(B,A),I=t.add(I,I),O=t.mul(i,I),p=t.mul(b,l),p=t.add(O,p),O=t.sub(k,p),p=t.add(k,p),p=t.mul(O,p),O=t.mul(f,O),I=t.mul(b,I),l=t.mul(i,l),f=t.sub(y,l),f=t.mul(i,f),f=t.add(f,I),I=t.add(y,y),y=t.add(I,y),y=t.add(y,l),y=t.mul(y,f),p=t.add(p,y),l=t.mul(N,A),l=t.add(l,l),y=t.mul(l,f),O=t.sub(O,y),I=t.mul(l,k),I=t.add(I,I),I=t.add(I,I),new g(O,p,I)}add(i){q(i);const{px:h,py:b,pz:B}=this,{px:N,py:A,pz:O}=i;let p=t.ZERO,I=t.ZERO,y=t.ZERO;const k=e.a,l=t.mul(e.b,Et);let f=t.mul(h,N),w=t.mul(b,A),S=t.mul(B,O),E=t.add(h,b),v=t.add(N,A);E=t.mul(E,v),v=t.add(f,w),E=t.sub(E,v),v=t.add(h,B);let L=t.add(N,O);return v=t.mul(v,L),L=t.add(f,S),v=t.sub(v,L),L=t.add(b,B),p=t.add(A,O),L=t.mul(L,p),p=t.add(w,S),L=t.sub(L,p),y=t.mul(k,v),p=t.mul(l,S),y=t.add(p,y),p=t.sub(w,y),y=t.add(w,y),I=t.mul(p,y),w=t.add(f,f),w=t.add(w,f),S=t.mul(k,S),v=t.mul(l,v),w=t.add(w,S),S=t.sub(f,S),S=t.mul(k,S),v=t.add(v,S),f=t.mul(w,v),I=t.add(I,f),f=t.mul(L,v),p=t.mul(E,p),p=t.sub(p,f),f=t.mul(E,w),y=t.mul(L,y),y=t.add(y,f),new g(p,I,y)}subtract(i){return this.add(i.negate())}is0(){return this.equals(g.ZERO)}wNAF(i){return $.wNAFCached(this,i,g.normalizeZ)}multiplyUnsafe(i){const{endo:h,n:b}=e;ot("scalar",i,W,b);const B=g.ZERO;if(i===W)return B;if(this.is0()||i===T)return this;if(!h||$.hasPrecomputes(this))return $.wNAFCachedUnsafe(this,i,g.normalizeZ);let{k1neg:N,k1:A,k2neg:O,k2:p}=h.splitScalar(i),I=B,y=B,k=this;for(;A>W||p>W;)A&T&&(I=I.add(k)),p&T&&(y=y.add(k)),k=k.double(),A>>=T,p>>=T;return N&&(I=I.negate()),O&&(y=y.negate()),y=new g(t.mul(y.px,h.beta),y.py,y.pz),I.add(y)}multiply(i){const{endo:h,n:b}=e;ot("scalar",i,T,b);let B,N;if(h){const{k1neg:A,k1:O,k2neg:p,k2:I}=h.splitScalar(i);let{p:y,f:k}=this.wNAF(O),{p:l,f}=this.wNAF(I);y=$.constTimeNegate(A,y),l=$.constTimeNegate(p,l),l=new g(t.mul(l.px,h.beta),l.py,l.pz),B=y.add(l),N=k.add(f)}else{const{p:A,f:O}=this.wNAF(i);B=A,N=O}return g.normalizeZ([B,N])[0]}multiplyAndAddUnsafe(i,h,b){const B=g.BASE,N=(O,p)=>p===W||p===T||!O.equals(B)?O.multiplyUnsafe(p):O.multiply(p),A=N(this,h).add(N(i,b));return A.is0()?void 0:A}toAffine(i){return Z(this,i)}isTorsionFree(){const{h:i,isTorsionFree:h}=e;if(i===T)return!0;if(h)return h(g,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:i,clearCofactor:h}=e;return i===T?this:h?h(g,this):this.multiplyUnsafe(e.h)}toRawBytes(i=!0){return at("isCompressed",i),this.assertValidity(),c(g,this,i)}toHex(i=!0){return at("isCompressed",i),vt(this.toRawBytes(i))}}g.BASE=new g(e.Gx,e.Gy,t.ONE),g.ZERO=new g(t.ZERO,t.ONE,t.ZERO);const{endo:_,nBitLength:z}=e,$=ve(g,_?Math.ceil(z/2):z);return{CURVE:e,ProjectivePoint:g,normPrivateKeyToScalar:H,weierstrassEquation:a,isWithinCurveOrder:m}}function qe(n){const e=Jt(n);return dt(e,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...e})}function Ae(n){const e=qe(n),{Fp:t,n:o,nByteLength:c,nBitLength:s}=e,a=t.BYTES+1,d=2*t.BYTES+1;function r(l){return V(l,o)}function u(l){return xt(l,o)}const{ProjectivePoint:m,normPrivateKeyToScalar:H,weierstrassEquation:q,isWithinCurveOrder:Z}=Oe({...e,toBytes(l,f,w){const S=f.toAffine(),E=t.toBytes(S.x),v=Bt;return at("isCompressed",w),w?v(Uint8Array.from([f.hasEvenY()?2:3]),E):v(Uint8Array.from([4]),E,t.toBytes(S.y))},fromBytes(l){const f=l.length,w=l[0],S=l.subarray(1);if(f===a&&(w===2||w===3)){const E=tt(S);if(!jt(E,T,t.ORDER))throw new Error("Point is not on curve");const v=q(E);let L;try{L=t.sqrt(v)}catch(P){const j=P instanceof Error?": "+P.message:"";throw new Error("Point is not on curve"+j)}const C=(L&T)===T;return(w&1)===1!==C&&(L=t.neg(L)),{x:E,y:L}}else if(f===d&&w===4){const E=t.fromBytes(S.subarray(0,t.BYTES)),v=t.fromBytes(S.subarray(t.BYTES,2*t.BYTES));return{x:E,y:v}}else{const E=a,v=d;throw new Error("invalid Point, expected length of "+E+", or uncompressed "+v+", got "+f)}}});function R(l){const f=o>>T;return l>f}function g(l){return R(l)?r(-l):l}const _=(l,f,w)=>tt(l.slice(f,w));class z{constructor(f,w,S){ot("r",f,T,o),ot("s",w,T,o),this.r=f,this.s=w,S!=null&&(this.recovery=S),Object.freeze(this)}static fromCompact(f){const w=c;return f=K("compactSignature",f,w*2),new z(_(f,0,w),_(f,w,2*w))}static fromDER(f){const{r:w,s:S}=G.toSig(K("DER",f));return new z(w,S)}assertValidity(){}addRecoveryBit(f){return new z(this.r,this.s,f)}recoverPublicKey(f){const{r:w,s:S,recovery:E}=this,v=B(K("msgHash",f));if(E==null||![0,1,2,3].includes(E))throw new Error("recovery id invalid");const L=E===2||E===3?w+e.n:w;if(L>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const C=(E&1)===0?"02":"03",D=m.fromHex(C+yt(L,t.BYTES)),P=u(L),j=r(-v*P),et=r(S*P),X=m.BASE.multiplyAndAddUnsafe(D,j,et);if(!X)throw new Error("point at infinify");return X.assertValidity(),X}hasHighS(){return R(this.s)}normalizeS(){return this.hasHighS()?new z(this.r,r(-this.s),this.recovery):this}toDERRawBytes(){return At(this.toDERHex())}toDERHex(){return G.hexFromSig(this)}toCompactRawBytes(){return At(this.toCompactHex())}toCompactHex(){const f=c;return yt(this.r,f)+yt(this.s,f)}}const $={isValidPrivateKey(l){try{return H(l),!0}catch{return!1}},normPrivateKeyToScalar:H,randomPrivateKey:()=>{const l=Xt(e.n);return ye(e.randomBytes(l),e.n)},precompute(l=8,f=m.BASE){return f._setWindowSize(l),f.multiply(BigInt(3)),f}};function x(l,f=!0){return m.fromPrivateKey(l).toRawBytes(f)}function i(l){if(typeof l=="bigint")return!1;if(l instanceof m)return!0;const w=K("key",l).length,S=t.BYTES,E=S+1,v=2*S+1;if(!(e.allowedPrivateKeyLengths||c===E))return w===E||w===v}function h(l,f,w=!0){if(i(l)===!0)throw new Error("first arg must be private key");if(i(f)===!1)throw new Error("second arg must be public key");return m.fromHex(f).multiply(H(l)).toRawBytes(w)}const b=e.bits2int||function(l){if(l.length>8192)throw new Error("input is too large");const f=tt(l),w=l.length*8-s;return w>0?f>>BigInt(w):f},B=e.bits2int_modN||function(l){return r(b(l))},N=ut(s);function A(l){return ot("num < 2^"+s,l,W,N),lt(l,c)}function O(l,f,w=p){if(["recovered","canonical"].some(Q=>Q in w))throw new Error("sign() legacy options not supported");const{hash:S,randomBytes:E}=e;let{lowS:v,prehash:L,extraEntropy:C}=w;v==null&&(v=!0),l=K("msgHash",l),Zt(w),L&&(l=K("prehashed msgHash",S(l)));const D=B(l),P=H(f),j=[A(P),A(D)];if(C!=null&&C!==!1){const Q=C===!0?E(t.BYTES):C;j.push(K("extraEntropy",Q))}const et=Bt(...j),X=D;function ht(Q){const nt=b(Q);if(!Z(nt))return;const wt=u(nt),st=m.BASE.multiply(nt).toAffine(),F=r(st.x);if(F===W)return;const it=r(wt*r(X+F*P));if(it===W)return;let ct=(st.x===F?0:2)|Number(st.y&T),rt=it;return v&&R(it)&&(rt=g(it),ct^=1),new z(F,rt,ct)}return{seed:et,k2sig:ht}}const p={lowS:e.lowS,prehash:!1},I={lowS:e.lowS,prehash:!1};function y(l,f,w=p){const{seed:S,k2sig:E}=O(l,f,w),v=e;return ae(v.hash.outputLen,v.nByteLength,v.hmac)(S,E)}m.BASE._setWindowSize(8);function k(l,f,w,S=I){var ct;const E=l;f=K("msgHash",f),w=K("publicKey",w);const{lowS:v,prehash:L,format:C}=S;if(Zt(S),"strict"in S)throw new Error("options.strict was renamed to lowS");if(C!==void 0&&C!=="compact"&&C!=="der")throw new Error("format must be compact or der");const D=typeof E=="string"||Mt(E),P=!D&&!C&&typeof E=="object"&&E!==null&&typeof E.r=="bigint"&&typeof E.s=="bigint";if(!D&&!P)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let j,et;try{if(P&&(j=new z(E.r,E.s)),D){try{C!=="compact"&&(j=z.fromDER(E))}catch(rt){if(!(rt instanceof G.Err))throw rt}!j&&C!=="der"&&(j=z.fromCompact(E))}et=m.fromHex(w)}catch{return!1}if(!j||v&&j.hasHighS())return!1;L&&(f=e.hash(f));const{r:X,s:ht}=j,Q=B(f),nt=u(ht),wt=r(Q*nt),st=r(X*nt),F=(ct=m.BASE.multiplyAndAddUnsafe(et,wt,st))==null?void 0:ct.toAffine();return F?r(F.x)===X:!1}return{CURVE:e,getPublicKey:x,getSharedSecret:h,sign:y,verify:k,ProjectivePoint:m,Signature:z,utils:$}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function Le(n){return{hash:n,hmac:(e,...t)=>Yt(n,e,le(...t)),randomBytes:fe}}function He(n,e){const t=o=>Ae({...n,...Le(o)});return{...t(e),create:t}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const te=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),Tt=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),Re=BigInt(0),ze=BigInt(1),It=BigInt(2),kt=(n,e)=>(n+e/It)/e;function Ze(n){const e=te,t=BigInt(3),o=BigInt(6),c=BigInt(11),s=BigInt(22),a=BigInt(23),d=BigInt(44),r=BigInt(88),u=n*n*n%e,m=u*u*n%e,H=U(m,t,e)*m%e,q=U(H,t,e)*m%e,Z=U(q,It,e)*u%e,R=U(Z,c,e)*Z%e,g=U(R,s,e)*R%e,_=U(g,d,e)*g%e,z=U(_,r,e)*_%e,$=U(z,d,e)*g%e,x=U($,t,e)*m%e,i=U(x,a,e)*R%e,h=U(i,o,e)*u%e,b=U(h,It,e);if(!Nt.eql(Nt.sqr(b),n))throw new Error("Cannot find square root");return b}const Nt=Ot(te,void 0,void 0,{sqrt:Ze}),Te=He({a:Re,b:BigInt(7),Fp:Nt,n:Tt,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:n=>{const e=Tt,t=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),o=-ze*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),c=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),s=t,a=BigInt("0x100000000000000000000000000000000"),d=kt(s*n,e),r=kt(-o*n,e);let u=V(n-d*t-r*c,e),m=V(-d*o-r*s,e);const H=u>a,q=m>a;if(H&&(u=e-u),q&&(m=e-m),u>a||m>a)throw new Error("splitScalar: Endomorphism failed, k="+n);return{k1neg:H,k1:u,k2neg:q,k2:m}}}},ue),_e=Object.freeze(Object.defineProperty({__proto__:null,secp256k1:Te},Symbol.toStringTag,{value:"Module"}));export{Ot as F,_e as a,He as c,Te as s};
+import{bp as ee,bq as ne,br as re,bs as oe,bt as qt,bu as se,bv as _t,bw as tt,bx as Ct,by as lt,bz as ut,bA as dt,bB as ie,bC as ce,bD as Bt,bE as ot,bF as K,bG as At,bH as Mt,bI as ae,bJ as at,bK as vt,bL as jt,bM as ft,bN as Lt,bO as fe,bP as le,bQ as ue}from"./sendRawTransaction-YUhe5FDd.js";class Vt extends ee{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,ne(e);const o=re(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 c=this.blockLen,s=new Uint8Array(c);s.set(o.length>c?e.create().update(o).digest():o);for(let a=0;a<s.length;a++)s[a]^=54;this.iHash.update(s),this.oHash=e.create();for(let a=0;a<s.length;a++)s[a]^=106;this.oHash.update(s),oe(s)}update(e){return qt(this),this.iHash.update(e),this}digestInto(e){qt(this),se(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:o,finished:c,destroyed:s,blockLen:a,outputLen:d}=this;return e=e,e.finished=c,e.destroyed=s,e.blockLen=a,e.outputLen=d,e.oHash=t._cloneInto(e.oHash),e.iHash=o._cloneInto(e.iHash),e}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const Yt=(n,e,t)=>new Vt(n,e).update(t).digest();Yt.create=(n,e)=>new Vt(n,e);/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const Y=BigInt(0),M=BigInt(1),J=BigInt(2),de=BigInt(3),Ut=BigInt(4),Kt=BigInt(5),Pt=BigInt(8);function V(n,e){const t=n%e;return t>=Y?t:e+t}function U(n,e,t){let o=n;for(;e-- >Y;)o*=o,o%=t;return o}function xt(n,e){if(n===Y)throw new Error("invert: expected non-zero number");if(e<=Y)throw new Error("invert: expected positive modulus, got "+e);let t=V(n,e),o=e,c=Y,s=M;for(;t!==Y;){const d=o/t,r=o%t,u=c-s*d;o=t,t=r,c=s,s=u}if(o!==M)throw new Error("invert: does not exist");return V(c,e)}function $t(n,e){const t=(n.ORDER+M)/Ut,o=n.pow(e,t);if(!n.eql(n.sqr(o),e))throw new Error("Cannot find square root");return o}function he(n,e){const t=(n.ORDER-Kt)/Pt,o=n.mul(e,J),c=n.pow(o,t),s=n.mul(e,c),a=n.mul(n.mul(s,J),c),d=n.mul(s,n.sub(a,n.ONE));if(!n.eql(n.sqr(d),e))throw new Error("Cannot find square root");return d}function we(n){if(n<BigInt(3))throw new Error("sqrt is not defined for small field");let e=n-M,t=0;for(;e%J===Y;)e/=J,t++;let o=J;const c=Ot(n);for(;Ht(c,o)===1;)if(o++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(t===1)return $t;let s=c.pow(o,e);const a=(e+M)/J;return function(r,u){if(r.is0(u))return u;if(Ht(r,u)!==1)throw new Error("Cannot find square root");let m=t,H=r.mul(r.ONE,s),q=r.pow(u,e),Z=r.pow(u,a);for(;!r.eql(q,r.ONE);){if(r.is0(q))return r.ZERO;let R=1,g=r.sqr(q);for(;!r.eql(g,r.ONE);)if(R++,g=r.sqr(g),R===m)throw new Error("Cannot find square root");const _=M<<BigInt(m-R-1),z=r.pow(H,_);m=R,H=r.sqr(z),q=r.mul(q,H),Z=r.mul(Z,z)}return Z}}function ge(n){return n%Ut===de?$t:n%Pt===Kt?he:we(n)}const me=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function be(n){const e={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},t=me.reduce((o,c)=>(o[c]="function",o),e);return dt(n,t)}function pe(n,e,t){if(t<Y)throw new Error("invalid exponent, negatives unsupported");if(t===Y)return n.ONE;if(t===M)return e;let o=n.ONE,c=e;for(;t>Y;)t&M&&(o=n.mul(o,c)),c=n.sqr(c),t>>=M;return o}function Dt(n,e,t=!1){const o=new Array(e.length).fill(t?n.ZERO:void 0),c=e.reduce((a,d,r)=>n.is0(d)?a:(o[r]=a,n.mul(a,d)),n.ONE),s=n.inv(c);return e.reduceRight((a,d,r)=>n.is0(d)?a:(o[r]=n.mul(a,o[r]),n.mul(a,d)),s),o}function Ht(n,e){const t=(n.ORDER-M)/J,o=n.pow(e,t),c=n.eql(o,n.ONE),s=n.eql(o,n.ZERO),a=n.eql(o,n.neg(n.ONE));if(!c&&!s&&!a)throw new Error("invalid Legendre symbol result");return c?1:s?0:-1}function Gt(n,e){e!==void 0&&ie(e);const t=e!==void 0?e:n.toString(2).length,o=Math.ceil(t/8);return{nBitLength:t,nByteLength:o}}function Ot(n,e,t=!1,o={}){if(n<=Y)throw new Error("invalid field: expected ORDER > 0, got "+n);const{nBitLength:c,nByteLength:s}=Gt(n,e);if(s>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let a;const d=Object.freeze({ORDER:n,isLE:t,BITS:c,BYTES:s,MASK:ut(c),ZERO:Y,ONE:M,create:r=>V(r,n),isValid:r=>{if(typeof r!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof r);return Y<=r&&r<n},is0:r=>r===Y,isOdd:r=>(r&M)===M,neg:r=>V(-r,n),eql:(r,u)=>r===u,sqr:r=>V(r*r,n),add:(r,u)=>V(r+u,n),sub:(r,u)=>V(r-u,n),mul:(r,u)=>V(r*u,n),pow:(r,u)=>pe(d,r,u),div:(r,u)=>V(r*xt(u,n),n),sqrN:r=>r*r,addN:(r,u)=>r+u,subN:(r,u)=>r-u,mulN:(r,u)=>r*u,inv:r=>xt(r,n),sqrt:o.sqrt||(r=>(a||(a=ge(n)),a(d,r))),toBytes:r=>t?Ct(r,s):lt(r,s),fromBytes:r=>{if(r.length!==s)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+r.length);return t?_t(r):tt(r)},invertBatch:r=>Dt(d,r),cmov:(r,u,m)=>m?u:r});return Object.freeze(d)}function Wt(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 Xt(n){const e=Wt(n);return e+Math.ceil(e/2)}function ye(n,e,t=!1){const o=n.length,c=Wt(e),s=Xt(e);if(o<16||o<s||o>1024)throw new Error("expected "+s+"-1024 bytes of input, got "+o);const a=t?_t(n):tt(n),d=V(a,e-M)+M;return t?Ct(d,c):lt(d,c)}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const Rt=BigInt(0),St=BigInt(1);function gt(n,e){const t=e.negate();return n?t:e}function Qt(n,e){if(!Number.isSafeInteger(n)||n<=0||n>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+n)}function mt(n,e){Qt(n,e);const t=Math.ceil(e/n)+1,o=2**(n-1),c=2**n,s=ut(n),a=BigInt(n);return{windows:t,windowSize:o,mask:s,maxNumber:c,shiftBy:a}}function zt(n,e,t){const{windowSize:o,mask:c,maxNumber:s,shiftBy:a}=t;let d=Number(n&c),r=n>>a;d>o&&(d-=s,r+=St);const u=e*o,m=u+Math.abs(d)-1,H=d===0,q=d<0,Z=e%2!==0;return{nextN:r,offset:m,isZero:H,isNeg:q,isNegF:Z,offsetF:u}}function Ee(n,e){if(!Array.isArray(n))throw new Error("array expected");n.forEach((t,o)=>{if(!(t instanceof e))throw new Error("invalid point at index "+o)})}function Be(n,e){if(!Array.isArray(n))throw new Error("array of scalars expected");n.forEach((t,o)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+o)})}const bt=new WeakMap,Ft=new WeakMap;function pt(n){return Ft.get(n)||1}function ve(n,e){return{constTimeNegate:gt,hasPrecomputes(t){return pt(t)!==1},unsafeLadder(t,o,c=n.ZERO){let s=t;for(;o>Rt;)o&St&&(c=c.add(s)),s=s.double(),o>>=St;return c},precomputeWindow(t,o){const{windows:c,windowSize:s}=mt(o,e),a=[];let d=t,r=d;for(let u=0;u<c;u++){r=d,a.push(r);for(let m=1;m<s;m++)r=r.add(d),a.push(r);d=r.double()}return a},wNAF(t,o,c){let s=n.ZERO,a=n.BASE;const d=mt(t,e);for(let r=0;r<d.windows;r++){const{nextN:u,offset:m,isZero:H,isNeg:q,isNegF:Z,offsetF:R}=zt(c,r,d);c=u,H?a=a.add(gt(Z,o[R])):s=s.add(gt(q,o[m]))}return{p:s,f:a}},wNAFUnsafe(t,o,c,s=n.ZERO){const a=mt(t,e);for(let d=0;d<a.windows&&c!==Rt;d++){const{nextN:r,offset:u,isZero:m,isNeg:H}=zt(c,d,a);if(c=r,!m){const q=o[u];s=s.add(H?q.negate():q)}}return s},getPrecomputes(t,o,c){let s=bt.get(o);return s||(s=this.precomputeWindow(o,t),t!==1&&bt.set(o,c(s))),s},wNAFCached(t,o,c){const s=pt(t);return this.wNAF(s,this.getPrecomputes(s,t,c),o)},wNAFCachedUnsafe(t,o,c,s){const a=pt(t);return a===1?this.unsafeLadder(t,o,s):this.wNAFUnsafe(a,this.getPrecomputes(a,t,c),o,s)},setWindowSize(t,o){Qt(o,e),Ft.set(t,o),bt.delete(t)}}}function xe(n,e,t,o){Ee(t,n),Be(o,e);const c=t.length,s=o.length;if(c!==s)throw new Error("arrays of points and scalars must have equal length");const a=n.ZERO,d=ce(BigInt(c));let r=1;d>12?r=d-3:d>4?r=d-2:d>0&&(r=2);const u=ut(r),m=new Array(Number(u)+1).fill(a),H=Math.floor((e.BITS-1)/r)*r;let q=a;for(let Z=H;Z>=0;Z-=r){m.fill(a);for(let g=0;g<s;g++){const _=o[g],z=Number(_>>BigInt(Z)&u);m[z]=m[z].add(t[g])}let R=a;for(let g=m.length-1,_=a;g>0;g--)_=_.add(m[g]),R=R.add(_);if(q=q.add(R),Z!==0)for(let g=0;g<r;g++)q=q.double()}return q}function Jt(n){return be(n.Fp),dt(n,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Gt(n.n,n.nBitLength),...n,p:n.Fp.ORDER})}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function Zt(n){n.lowS!==void 0&&at("lowS",n.lowS),n.prehash!==void 0&&at("prehash",n.prehash)}function Se(n){const e=Jt(n);dt(e,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:t,Fp:o,a:c}=e;if(t){if(!o.eql(c,o.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...e})}class Ie extends Error{constructor(e=""){super(e)}}const G={Err:Ie,_tlv:{encode:(n,e)=>{const{Err:t}=G;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length&1)throw new t("tlv.encode: unpadded data");const o=e.length/2,c=ft(o);if(c.length/2&128)throw new t("tlv.encode: long form length too big");const s=o>127?ft(c.length/2|128):"";return ft(n)+s+c+e},decode(n,e){const{Err:t}=G;let o=0;if(n<0||n>256)throw new t("tlv.encode: wrong tag");if(e.length<2||e[o++]!==n)throw new t("tlv.decode: wrong tlv");const c=e[o++],s=!!(c&128);let a=0;if(!s)a=c;else{const r=c&127;if(!r)throw new t("tlv.decode(long): indefinite length not supported");if(r>4)throw new t("tlv.decode(long): byte length is too big");const u=e.subarray(o,o+r);if(u.length!==r)throw new t("tlv.decode: length bytes not complete");if(u[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const m of u)a=a<<8|m;if(o+=r,a<128)throw new t("tlv.decode(long): not minimal encoding")}const d=e.subarray(o,o+a);if(d.length!==a)throw new t("tlv.decode: wrong value length");return{v:d,l:e.subarray(o+a)}}},_int:{encode(n){const{Err:e}=G;if(n<W)throw new e("integer: negative integers are not allowed");let t=ft(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}=G;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 tt(n)}},toSig(n){const{Err:e,_int:t,_tlv:o}=G,c=K("signature",n),{v:s,l:a}=o.decode(48,c);if(a.length)throw new e("invalid signature: left bytes after parsing");const{v:d,l:r}=o.decode(2,s),{v:u,l:m}=o.decode(2,r);if(m.length)throw new e("invalid signature: left bytes after parsing");return{r:t.decode(d),s:t.decode(u)}},hexFromSig(n){const{_tlv:e,_int:t}=G,o=e.encode(2,t.encode(n.r)),c=e.encode(2,t.encode(n.s)),s=o+c;return e.encode(48,s)}};function yt(n,e){return vt(lt(n,e))}const W=BigInt(0),T=BigInt(1);BigInt(2);const Et=BigInt(3),Ne=BigInt(4);function Oe(n){const e=Se(n),{Fp:t}=e,o=Ot(e.n,e.nBitLength),c=e.toBytes||((x,i,h)=>{const b=i.toAffine();return Bt(Uint8Array.from([4]),t.toBytes(b.x),t.toBytes(b.y))}),s=e.fromBytes||(x=>{const i=x.subarray(1),h=t.fromBytes(i.subarray(0,t.BYTES)),b=t.fromBytes(i.subarray(t.BYTES,2*t.BYTES));return{x:h,y:b}});function a(x){const{a:i,b:h}=e,b=t.sqr(x),B=t.mul(b,x);return t.add(t.add(B,t.mul(x,i)),h)}function d(x,i){const h=t.sqr(i),b=a(x);return t.eql(h,b)}if(!d(e.Gx,e.Gy))throw new Error("bad curve params: generator point");const r=t.mul(t.pow(e.a,Et),Ne),u=t.mul(t.sqr(e.b),BigInt(27));if(t.is0(t.add(r,u)))throw new Error("bad curve params: a or b");function m(x){return jt(x,T,e.n)}function H(x){const{allowedPrivateKeyLengths:i,nByteLength:h,wrapPrivateKey:b,n:B}=e;if(i&&typeof x!="bigint"){if(Mt(x)&&(x=vt(x)),typeof x!="string"||!i.includes(x.length))throw new Error("invalid private key");x=x.padStart(h*2,"0")}let N;try{N=typeof x=="bigint"?x:tt(K("private key",x,h))}catch{throw new Error("invalid private key, expected hex or "+h+" bytes, got "+typeof x)}return b&&(N=V(N,B)),ot("private key",N,T,B),N}function q(x){if(!(x instanceof g))throw new Error("ProjectivePoint expected")}const Z=Lt((x,i)=>{const{px:h,py:b,pz:B}=x;if(t.eql(B,t.ONE))return{x:h,y:b};const N=x.is0();i==null&&(i=N?t.ONE:t.inv(B));const A=t.mul(h,i),O=t.mul(b,i),p=t.mul(B,i);if(N)return{x:t.ZERO,y:t.ZERO};if(!t.eql(p,t.ONE))throw new Error("invZ was invalid");return{x:A,y:O}}),R=Lt(x=>{if(x.is0()){if(e.allowInfinityPoint&&!t.is0(x.py))return;throw new Error("bad point: ZERO")}const{x:i,y:h}=x.toAffine();if(!t.isValid(i)||!t.isValid(h))throw new Error("bad point: x or y not FE");if(!d(i,h))throw new Error("bad point: equation left != right");if(!x.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class g{constructor(i,h,b){if(i==null||!t.isValid(i))throw new Error("x required");if(h==null||!t.isValid(h)||t.is0(h))throw new Error("y required");if(b==null||!t.isValid(b))throw new Error("z required");this.px=i,this.py=h,this.pz=b,Object.freeze(this)}static fromAffine(i){const{x:h,y:b}=i||{};if(!i||!t.isValid(h)||!t.isValid(b))throw new Error("invalid affine point");if(i instanceof g)throw new Error("projective point not allowed");const B=N=>t.eql(N,t.ZERO);return B(h)&&B(b)?g.ZERO:new g(h,b,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(i){const h=Dt(t,i.map(b=>b.pz));return i.map((b,B)=>b.toAffine(h[B])).map(g.fromAffine)}static fromHex(i){const h=g.fromAffine(s(K("pointHex",i)));return h.assertValidity(),h}static fromPrivateKey(i){return g.BASE.multiply(H(i))}static msm(i,h){return xe(g,o,i,h)}_setWindowSize(i){$.setWindowSize(this,i)}assertValidity(){R(this)}hasEvenY(){const{y:i}=this.toAffine();if(t.isOdd)return!t.isOdd(i);throw new Error("Field doesn't support isOdd")}equals(i){q(i);const{px:h,py:b,pz:B}=this,{px:N,py:A,pz:O}=i,p=t.eql(t.mul(h,O),t.mul(N,B)),I=t.eql(t.mul(b,O),t.mul(A,B));return p&&I}negate(){return new g(this.px,t.neg(this.py),this.pz)}double(){const{a:i,b:h}=e,b=t.mul(h,Et),{px:B,py:N,pz:A}=this;let O=t.ZERO,p=t.ZERO,I=t.ZERO,y=t.mul(B,B),k=t.mul(N,N),l=t.mul(A,A),f=t.mul(B,N);return f=t.add(f,f),I=t.mul(B,A),I=t.add(I,I),O=t.mul(i,I),p=t.mul(b,l),p=t.add(O,p),O=t.sub(k,p),p=t.add(k,p),p=t.mul(O,p),O=t.mul(f,O),I=t.mul(b,I),l=t.mul(i,l),f=t.sub(y,l),f=t.mul(i,f),f=t.add(f,I),I=t.add(y,y),y=t.add(I,y),y=t.add(y,l),y=t.mul(y,f),p=t.add(p,y),l=t.mul(N,A),l=t.add(l,l),y=t.mul(l,f),O=t.sub(O,y),I=t.mul(l,k),I=t.add(I,I),I=t.add(I,I),new g(O,p,I)}add(i){q(i);const{px:h,py:b,pz:B}=this,{px:N,py:A,pz:O}=i;let p=t.ZERO,I=t.ZERO,y=t.ZERO;const k=e.a,l=t.mul(e.b,Et);let f=t.mul(h,N),w=t.mul(b,A),S=t.mul(B,O),E=t.add(h,b),v=t.add(N,A);E=t.mul(E,v),v=t.add(f,w),E=t.sub(E,v),v=t.add(h,B);let L=t.add(N,O);return v=t.mul(v,L),L=t.add(f,S),v=t.sub(v,L),L=t.add(b,B),p=t.add(A,O),L=t.mul(L,p),p=t.add(w,S),L=t.sub(L,p),y=t.mul(k,v),p=t.mul(l,S),y=t.add(p,y),p=t.sub(w,y),y=t.add(w,y),I=t.mul(p,y),w=t.add(f,f),w=t.add(w,f),S=t.mul(k,S),v=t.mul(l,v),w=t.add(w,S),S=t.sub(f,S),S=t.mul(k,S),v=t.add(v,S),f=t.mul(w,v),I=t.add(I,f),f=t.mul(L,v),p=t.mul(E,p),p=t.sub(p,f),f=t.mul(E,w),y=t.mul(L,y),y=t.add(y,f),new g(p,I,y)}subtract(i){return this.add(i.negate())}is0(){return this.equals(g.ZERO)}wNAF(i){return $.wNAFCached(this,i,g.normalizeZ)}multiplyUnsafe(i){const{endo:h,n:b}=e;ot("scalar",i,W,b);const B=g.ZERO;if(i===W)return B;if(this.is0()||i===T)return this;if(!h||$.hasPrecomputes(this))return $.wNAFCachedUnsafe(this,i,g.normalizeZ);let{k1neg:N,k1:A,k2neg:O,k2:p}=h.splitScalar(i),I=B,y=B,k=this;for(;A>W||p>W;)A&T&&(I=I.add(k)),p&T&&(y=y.add(k)),k=k.double(),A>>=T,p>>=T;return N&&(I=I.negate()),O&&(y=y.negate()),y=new g(t.mul(y.px,h.beta),y.py,y.pz),I.add(y)}multiply(i){const{endo:h,n:b}=e;ot("scalar",i,T,b);let B,N;if(h){const{k1neg:A,k1:O,k2neg:p,k2:I}=h.splitScalar(i);let{p:y,f:k}=this.wNAF(O),{p:l,f}=this.wNAF(I);y=$.constTimeNegate(A,y),l=$.constTimeNegate(p,l),l=new g(t.mul(l.px,h.beta),l.py,l.pz),B=y.add(l),N=k.add(f)}else{const{p:A,f:O}=this.wNAF(i);B=A,N=O}return g.normalizeZ([B,N])[0]}multiplyAndAddUnsafe(i,h,b){const B=g.BASE,N=(O,p)=>p===W||p===T||!O.equals(B)?O.multiplyUnsafe(p):O.multiply(p),A=N(this,h).add(N(i,b));return A.is0()?void 0:A}toAffine(i){return Z(this,i)}isTorsionFree(){const{h:i,isTorsionFree:h}=e;if(i===T)return!0;if(h)return h(g,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:i,clearCofactor:h}=e;return i===T?this:h?h(g,this):this.multiplyUnsafe(e.h)}toRawBytes(i=!0){return at("isCompressed",i),this.assertValidity(),c(g,this,i)}toHex(i=!0){return at("isCompressed",i),vt(this.toRawBytes(i))}}g.BASE=new g(e.Gx,e.Gy,t.ONE),g.ZERO=new g(t.ZERO,t.ONE,t.ZERO);const{endo:_,nBitLength:z}=e,$=ve(g,_?Math.ceil(z/2):z);return{CURVE:e,ProjectivePoint:g,normPrivateKeyToScalar:H,weierstrassEquation:a,isWithinCurveOrder:m}}function qe(n){const e=Jt(n);return dt(e,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...e})}function Ae(n){const e=qe(n),{Fp:t,n:o,nByteLength:c,nBitLength:s}=e,a=t.BYTES+1,d=2*t.BYTES+1;function r(l){return V(l,o)}function u(l){return xt(l,o)}const{ProjectivePoint:m,normPrivateKeyToScalar:H,weierstrassEquation:q,isWithinCurveOrder:Z}=Oe({...e,toBytes(l,f,w){const S=f.toAffine(),E=t.toBytes(S.x),v=Bt;return at("isCompressed",w),w?v(Uint8Array.from([f.hasEvenY()?2:3]),E):v(Uint8Array.from([4]),E,t.toBytes(S.y))},fromBytes(l){const f=l.length,w=l[0],S=l.subarray(1);if(f===a&&(w===2||w===3)){const E=tt(S);if(!jt(E,T,t.ORDER))throw new Error("Point is not on curve");const v=q(E);let L;try{L=t.sqrt(v)}catch(P){const j=P instanceof Error?": "+P.message:"";throw new Error("Point is not on curve"+j)}const C=(L&T)===T;return(w&1)===1!==C&&(L=t.neg(L)),{x:E,y:L}}else if(f===d&&w===4){const E=t.fromBytes(S.subarray(0,t.BYTES)),v=t.fromBytes(S.subarray(t.BYTES,2*t.BYTES));return{x:E,y:v}}else{const E=a,v=d;throw new Error("invalid Point, expected length of "+E+", or uncompressed "+v+", got "+f)}}});function R(l){const f=o>>T;return l>f}function g(l){return R(l)?r(-l):l}const _=(l,f,w)=>tt(l.slice(f,w));class z{constructor(f,w,S){ot("r",f,T,o),ot("s",w,T,o),this.r=f,this.s=w,S!=null&&(this.recovery=S),Object.freeze(this)}static fromCompact(f){const w=c;return f=K("compactSignature",f,w*2),new z(_(f,0,w),_(f,w,2*w))}static fromDER(f){const{r:w,s:S}=G.toSig(K("DER",f));return new z(w,S)}assertValidity(){}addRecoveryBit(f){return new z(this.r,this.s,f)}recoverPublicKey(f){const{r:w,s:S,recovery:E}=this,v=B(K("msgHash",f));if(E==null||![0,1,2,3].includes(E))throw new Error("recovery id invalid");const L=E===2||E===3?w+e.n:w;if(L>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const C=(E&1)===0?"02":"03",D=m.fromHex(C+yt(L,t.BYTES)),P=u(L),j=r(-v*P),et=r(S*P),X=m.BASE.multiplyAndAddUnsafe(D,j,et);if(!X)throw new Error("point at infinify");return X.assertValidity(),X}hasHighS(){return R(this.s)}normalizeS(){return this.hasHighS()?new z(this.r,r(-this.s),this.recovery):this}toDERRawBytes(){return At(this.toDERHex())}toDERHex(){return G.hexFromSig(this)}toCompactRawBytes(){return At(this.toCompactHex())}toCompactHex(){const f=c;return yt(this.r,f)+yt(this.s,f)}}const $={isValidPrivateKey(l){try{return H(l),!0}catch{return!1}},normPrivateKeyToScalar:H,randomPrivateKey:()=>{const l=Xt(e.n);return ye(e.randomBytes(l),e.n)},precompute(l=8,f=m.BASE){return f._setWindowSize(l),f.multiply(BigInt(3)),f}};function x(l,f=!0){return m.fromPrivateKey(l).toRawBytes(f)}function i(l){if(typeof l=="bigint")return!1;if(l instanceof m)return!0;const w=K("key",l).length,S=t.BYTES,E=S+1,v=2*S+1;if(!(e.allowedPrivateKeyLengths||c===E))return w===E||w===v}function h(l,f,w=!0){if(i(l)===!0)throw new Error("first arg must be private key");if(i(f)===!1)throw new Error("second arg must be public key");return m.fromHex(f).multiply(H(l)).toRawBytes(w)}const b=e.bits2int||function(l){if(l.length>8192)throw new Error("input is too large");const f=tt(l),w=l.length*8-s;return w>0?f>>BigInt(w):f},B=e.bits2int_modN||function(l){return r(b(l))},N=ut(s);function A(l){return ot("num < 2^"+s,l,W,N),lt(l,c)}function O(l,f,w=p){if(["recovered","canonical"].some(Q=>Q in w))throw new Error("sign() legacy options not supported");const{hash:S,randomBytes:E}=e;let{lowS:v,prehash:L,extraEntropy:C}=w;v==null&&(v=!0),l=K("msgHash",l),Zt(w),L&&(l=K("prehashed msgHash",S(l)));const D=B(l),P=H(f),j=[A(P),A(D)];if(C!=null&&C!==!1){const Q=C===!0?E(t.BYTES):C;j.push(K("extraEntropy",Q))}const et=Bt(...j),X=D;function ht(Q){const nt=b(Q);if(!Z(nt))return;const wt=u(nt),st=m.BASE.multiply(nt).toAffine(),F=r(st.x);if(F===W)return;const it=r(wt*r(X+F*P));if(it===W)return;let ct=(st.x===F?0:2)|Number(st.y&T),rt=it;return v&&R(it)&&(rt=g(it),ct^=1),new z(F,rt,ct)}return{seed:et,k2sig:ht}}const p={lowS:e.lowS,prehash:!1},I={lowS:e.lowS,prehash:!1};function y(l,f,w=p){const{seed:S,k2sig:E}=O(l,f,w),v=e;return ae(v.hash.outputLen,v.nByteLength,v.hmac)(S,E)}m.BASE._setWindowSize(8);function k(l,f,w,S=I){var ct;const E=l;f=K("msgHash",f),w=K("publicKey",w);const{lowS:v,prehash:L,format:C}=S;if(Zt(S),"strict"in S)throw new Error("options.strict was renamed to lowS");if(C!==void 0&&C!=="compact"&&C!=="der")throw new Error("format must be compact or der");const D=typeof E=="string"||Mt(E),P=!D&&!C&&typeof E=="object"&&E!==null&&typeof E.r=="bigint"&&typeof E.s=="bigint";if(!D&&!P)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let j,et;try{if(P&&(j=new z(E.r,E.s)),D){try{C!=="compact"&&(j=z.fromDER(E))}catch(rt){if(!(rt instanceof G.Err))throw rt}!j&&C!=="der"&&(j=z.fromCompact(E))}et=m.fromHex(w)}catch{return!1}if(!j||v&&j.hasHighS())return!1;L&&(f=e.hash(f));const{r:X,s:ht}=j,Q=B(f),nt=u(ht),wt=r(Q*nt),st=r(X*nt),F=(ct=m.BASE.multiplyAndAddUnsafe(et,wt,st))==null?void 0:ct.toAffine();return F?r(F.x)===X:!1}return{CURVE:e,getPublicKey:x,getSharedSecret:h,sign:y,verify:k,ProjectivePoint:m,Signature:z,utils:$}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function Le(n){return{hash:n,hmac:(e,...t)=>Yt(n,e,le(...t)),randomBytes:fe}}function He(n,e){const t=o=>Ae({...n,...Le(o)});return{...t(e),create:t}}/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const te=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),Tt=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),Re=BigInt(0),ze=BigInt(1),It=BigInt(2),kt=(n,e)=>(n+e/It)/e;function Ze(n){const e=te,t=BigInt(3),o=BigInt(6),c=BigInt(11),s=BigInt(22),a=BigInt(23),d=BigInt(44),r=BigInt(88),u=n*n*n%e,m=u*u*n%e,H=U(m,t,e)*m%e,q=U(H,t,e)*m%e,Z=U(q,It,e)*u%e,R=U(Z,c,e)*Z%e,g=U(R,s,e)*R%e,_=U(g,d,e)*g%e,z=U(_,r,e)*_%e,$=U(z,d,e)*g%e,x=U($,t,e)*m%e,i=U(x,a,e)*R%e,h=U(i,o,e)*u%e,b=U(h,It,e);if(!Nt.eql(Nt.sqr(b),n))throw new Error("Cannot find square root");return b}const Nt=Ot(te,void 0,void 0,{sqrt:Ze}),Te=He({a:Re,b:BigInt(7),Fp:Nt,n:Tt,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:n=>{const e=Tt,t=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),o=-ze*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),c=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),s=t,a=BigInt("0x100000000000000000000000000000000"),d=kt(s*n,e),r=kt(-o*n,e);let u=V(n-d*t-r*c,e),m=V(-d*o-r*s,e);const H=u>a,q=m>a;if(H&&(u=e-u),q&&(m=e-m),u>a||m>a)throw new Error("splitScalar: Endomorphism failed, k="+n);return{k1neg:H,k1:u,k2neg:q,k2:m}}}},ue),_e=Object.freeze(Object.defineProperty({__proto__:null,secp256k1:Te},Symbol.toStringTag,{value:"Module"}));export{Ot as F,_e as a,He as c,Te as s};

package/assets/{secp256k1-DHqlJ8nk.js → secp256k1-D1Tuv2c6.js}

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

package/assets/{send-DXVwWcB5.js → send-C1EU45CZ.js}

@@ -1,4 +1,4 @@
-import{i as b,b as c}from"./lit-element-B3y9oplH.js";import{n as d,r as u,o as Q}from"./class-map-CxwNmq0D.js";import{d as x,r as K,e as G}from"./index-DIMSfymy.js";import{c as v,U as I}from"./index-BOQwd6ZB.js";import"./index-BZ5hUBd_.js";import"./index-D3hzhbb8.js";import"./index-CzfG6alx.js";import{e as H,n as L}from"./ref-BsAZ42-h.js";import{b as O,C as g,k as V,J as a,R as h,N as E,M as Y,S as y,d as X,n as Z,q as J,V as M,X as q,E as ee}from"./W3MFrameProviderSingleton-D4DCXtQm.js";import"./index-IfYZnKCO.js";import"./index-CDMAFM2h.js";import"./index-C2U9pe20.js";import{S as P}from"./SwapController-BDZMxnNb.js";import"./index-LSZxonl2.js";import"./index-BF6unOoT.js";import"./index--_rHc9Od.js";import"./index-CzFnbzvY.js";import"./index-C7-iTfFV.js";import"./react-Vu6nbGi5.js";import"./ethers-DHDSyreX.js";import"./index-C6FQ8I_Q.js";import"./index-Pp2oEhTr.js";import"./index-CdfeQ7YK.js";import"./index-nibyPLVP.js";import"./index-jYazATJj.js";import"./index.es-IGCEipYb.js";import"./browser-ponyfill-rND5WOqr.js";import"./NetworkUtil-Ddexw9-U.js";import"./index-CbJmVQBN.js";import"./async-directive-BRxn_Py3.js";import"./index-CMavzzI_.js";const te=x`
+import{i as b,b as c}from"./lit-element-B3y9oplH.js";import{n as d,r as u,o as Q}from"./class-map-CxwNmq0D.js";import{d as x,r as K,e as G}from"./index-BA1ToKo5.js";import{c as v,U as I}from"./index-BRAKTMPG.js";import"./index-6YdbHDXd.js";import"./index-BBTg_Taa.js";import"./index-B0PvzweT.js";import{e as H,n as L}from"./ref-BsAZ42-h.js";import{b as O,C as g,k as V,J as a,R as h,N as E,M as Y,S as y,d as X,n as Z,q as J,V as M,X as q,E as ee}from"./W3MFrameProviderSingleton-DXEpVsCm.js";import"./index-_AHcKVpB.js";import"./index-CkCZBr-g.js";import"./index-CMib98th.js";import{S as P}from"./SwapController-C07T-0ls.js";import"./index-BnrCQ-kr.js";import"./index-DWk4e-hQ.js";import"./index-BNjQhTuO.js";import"./index-DFJdN6PH.js";import"./index-CI_HQD35.js";import"./react-Vu6nbGi5.js";import"./ethers-JeCAM1sd.js";import"./index-C9P6N44e.js";import"./index-Blc7OGRU.js";import"./index-BcyJUD4U.js";import"./index-nibyPLVP.js";import"./index-Bu2DcNS5.js";import"./index.es-CbOKB2xh.js";import"./browser-ponyfill-rND5WOqr.js";import"./NetworkUtil-DDES604E.js";import"./index-CoACJ04N.js";import"./async-directive-BRxn_Py3.js";import"./index-Cl4u62mB.js";const te=x`
   :host {
     width: 100%;
     height: 100px;

package/assets/{send-batch-transaction-D1j9aZww.js → send-batch-transaction-BTFORkZH.js}

@@ -1 +1 @@
-import{v as w,w as h,x as r}from"./signing-CoPa7cSW.js";import{w as u}from"./wait-for-tx-receipt-Dm2aAIs1.js";async function v(t){const n=await w(t);return u(n)}async function B(t){const{account:n,transactions:s}=t;if(!n)throw new Error("not connected");if(s.length===0)throw new Error("No transactions to send");const o=s[0];if(!o)throw new Error("No transactions to send");if(n.sendBatchTransaction){const e=await Promise.all(s.map(async a=>{const[i,c,d,l]=await Promise.all([h(a),r(a.to),r(a.accessList),r(a.value)]);return{accessList:d,chainId:a.chain.id,data:i,to:c,value:l}}));return{...await n.sendBatchTransaction(e),chain:o.chain,client:o.client}}throw new Error("Account doesn't implement sendBatchTransaction")}export{v as a,B as s};
+import{v as w,w as h,x as r}from"./signing-DqVkCMNZ.js";import{w as u}from"./wait-for-tx-receipt-D0UsY_wi.js";async function v(t){const n=await w(t);return u(n)}async function B(t){const{account:n,transactions:s}=t;if(!n)throw new Error("not connected");if(s.length===0)throw new Error("No transactions to send");const o=s[0];if(!o)throw new Error("No transactions to send");if(n.sendBatchTransaction){const e=await Promise.all(s.map(async a=>{const[i,c,d,l]=await Promise.all([h(a),r(a.to),r(a.accessList),r(a.value)]);return{accessList:d,chainId:a.chain.id,data:i,to:c,value:l}}));return{...await n.sendBatchTransaction(e),chain:o.chain,client:o.client}}throw new Error("Account doesn't implement sendBatchTransaction")}export{v as a,B as s};

package/assets/{send-eip712-transaction-CrryJAyV.js → send-eip712-transaction-CJ_pjExq.js}

@@ -1,2 +1,2 @@
-const __vite__mapDeps=(i,m=__vite__mapDeps,d=(m.f||(m.f=["assets/signing-CoPa7cSW.js","assets/utils-nbkSUjEy.js","assets/ethers-DHDSyreX.js","assets/react-Vu6nbGi5.js","assets/index-C7-iTfFV.js","assets/index-DCrqkiFN.css"])))=>i.map(i=>d[i]);
-import{_ as B}from"./index-C7-iTfFV.js";import{B as b,T as h,U as v,u as L,V as m,m as G,W as D,x as P,g as z,t as O,w as S,X as A,Y as M}from"./signing-CoPa7cSW.js";import{m as $,s as V,t as H}from"./sha256-BxR-wXll.js";const _=$*32n;class R extends b{constructor({givenLength:e,maxBytecodeSize:a}){super(`Bytecode cannot be longer than ${a} bytes. Given length: ${e}`,{name:"BytecodeLengthExceedsMaxSizeError"})}}class W extends b{constructor({givenLengthInWords:e}){super(`Bytecode length in 32-byte words must be odd. Given length in words: ${e}`,{name:"BytecodeLengthInWordsMustBeOddError"})}}class U extends b{constructor({givenLength:e}){super(`The bytecode length in bytes must be divisible by 32. Given length: ${e}`,{name:"BytecodeLengthMustBeDivisibleBy32Error"})}}function k(t){const e=h(t);if(e.length%32!==0)throw new U({givenLength:e.length});if(e.length>_)throw new R({givenLength:e.length,maxBytecodeSize:_});const a=V(e),n=h(a),r=e.length/32;if(r%2===0)throw new W({givenLengthInWords:r});const i=h(r),s=v(i,{size:2}),o=new Uint8Array([1,0]);return n.set(o,0),n.set(s,2),n}function f(t){if(["string","number"].includes(typeof t)&&!Number.isInteger(Number(t)))throw new Error(`Expected value to be an integer to convert to a bigint, got ${t} of type ${typeof t}`);return t instanceof Uint8Array?BigInt(L(t)):BigInt(t)}const x=(t,e)=>typeof t=="bigint"?e(t):Array.isArray(t)?t.map(a=>x(a,e)):t&&typeof t=="object"?Object.fromEntries(Object.entries(t).map(([a,n])=>[a,x(n,e)])):t,T=50000n,N=t=>{const e=X(t);return{domain:{chainId:t.chainId,name:"zkSync",version:"2"},message:e,primaryType:"Transaction",types:{Transaction:[{name:"txType",type:"uint256"},{name:"from",type:"uint256"},{name:"to",type:"uint256"},{name:"gasLimit",type:"uint256"},{name:"gasPerPubdataByteLimit",type:"uint256"},{name:"maxFeePerGas",type:"uint256"},{name:"maxPriorityFeePerGas",type:"uint256"},{name:"paymaster",type:"uint256"},{name:"nonce",type:"uint256"},{name:"value",type:"uint256"},{name:"data",type:"bytes"},{name:"factoryDeps",type:"bytes32[]"},{name:"paymasterInput",type:"bytes"}]}}};function X(t){const{gas:e,nonce:a,to:n,from:r,value:i,maxFeePerGas:s,maxPriorityFeePerGas:o,paymaster:d,paymasterInput:u,gasPerPubdata:y,data:g,factoryDeps:p}=t;return{data:g||"0x0",factoryDeps:(p==null?void 0:p.map(c=>m(k(c))))??[],from:BigInt(r),gasLimit:e??0n,gasPerPubdataByteLimit:y??T,maxFeePerGas:s??0n,maxPriorityFeePerGas:o??0n,nonce:a?BigInt(a):0n,paymaster:d?BigInt(d):0n,paymasterInput:u||"0x",to:n?BigInt(n):0n,txType:113n,value:i??0n}}async function C(t){const{account:e,transaction:a}=t,n=await I(t),r=await w({account:e,chainId:a.chain.id,eip712Transaction:n}),i=G(a),s=await D(i,r);return{chain:a.chain,client:a.client,transactionHash:s}}async function w(t){const{account:e,eip712Transaction:a,chainId:n}=t,r=N(a),i=await e.signTypedData({...r});return Y({...a,chainId:n,customSignature:i})}async function I(t){const{account:e,transaction:a}=t,{gas:n,maxFeePerGas:r,maxPriorityFeePerGas:i,gasPerPubdata:s}=await F({from:z(e.address),transaction:a});return{...await O({from:e.address,transaction:{...a,gas:n,maxFeePerGas:r,maxPriorityFeePerGas:i}}),...a.eip712,from:e.address,gasPerPubdata:s}}function Y(t){const{chainId:e,gas:a,nonce:n,to:r,from:i,value:s,maxFeePerGas:o,maxPriorityFeePerGas:d,customSignature:u,factoryDeps:y,paymaster:g,paymasterInput:p,gasPerPubdata:c,data:l}=t,E=[n?m(n):"0x",d?m(d):"0x",o?m(o):"0x",a?m(a):"0x",r??"0x",s?m(s):"0x",l??"0x0",m(e),m(""),m(""),m(e),i??"0x",c?m(c):m(T),y??[],u??"0x",g&&p?[g,p]:[]];return M(["0x71",H(E)])}async function F(t){const{transaction:e,from:a}=t;let[n,r,i,s]=await Promise.all([P(e.gas),P(e.maxFeePerGas),P(e.maxPriorityFeePerGas),P(e.eip712)]),o=s==null?void 0:s.gasPerPubdata;if(n===void 0||r===void 0||i===void 0){const d=G(e),u=await Z({from:a,transaction:e});try{const y=await d({method:"zks_estimateFee",params:[x(u,m)]});n=f(y.gas_limit)*2n,r=f(y.max_fee_per_gas)*2n,i=f(y.max_priority_fee_per_gas)||1n,o=f(y.gas_per_pubdata_limit)*2n,o<50000n&&(o=50000n)}catch{const[{estimateGas:y},{getDefaultGasOverrides:g}]=await Promise.all([B(()=>import("./signing-CoPa7cSW.js").then(l=>l.cX),__vite__mapDeps([0,1,2,3,4,5])),B(()=>import("./signing-CoPa7cSW.js").then(l=>l.cV),__vite__mapDeps([0,1,2,3,4,5]))]),[p,c]=await Promise.all([n===void 0?y({transaction:e,from:a}):Promise.resolve(n),g(e.client,e.chain)]);n=p*2n,"maxFeePerGas"in c&&c.maxFeePerGas?r=c.maxFeePerGas*2n:"gasPrice"in c&&c.gasPrice&&(r=c.gasPrice*2n),"maxPriorityFeePerGas"in c&&c.maxPriorityFeePerGas?i=c.maxPriorityFeePerGas:i=1n,o=100000n}}return{gas:n,gasPerPubdata:o,maxFeePerGas:r,maxPriorityFeePerGas:i}}async function Z(t){var d;const{transaction:e,from:a}=t,[n,r,i,s]=await Promise.all([S(e),P(e.to),P(e.value),P(e.eip712)]),o=s==null?void 0:s.gasPerPubdata;return{data:n,eip712Meta:{...s,factoryDeps:(d=s==null?void 0:s.factoryDeps)==null?void 0:d.map(u=>Array.from(A(u))),gasPerPubdata:o||50000n},from:a,gasPerPubdata:o,to:r,type:"0x71",value:i}}const Q=Object.freeze(Object.defineProperty({__proto__:null,getZkGasFees:F,populateEip712Transaction:I,sendEip712Transaction:C,signEip712Transaction:w},Symbol.toStringTag,{value:"Module"}));export{Q as a,I as p,w as s,f as t};
+const __vite__mapDeps=(i,m=__vite__mapDeps,d=(m.f||(m.f=["assets/signing-DqVkCMNZ.js","assets/utils-BmX8TqzP.js","assets/ethers-JeCAM1sd.js","assets/react-Vu6nbGi5.js","assets/index-CI_HQD35.js","assets/index-DCrqkiFN.css"])))=>i.map(i=>d[i]);
+import{_ as B}from"./index-CI_HQD35.js";import{B as b,T as h,U as v,u as L,V as m,m as G,W as D,x as P,g as z,t as O,w as S,X as A,Y as M}from"./signing-DqVkCMNZ.js";import{m as $,s as V,t as H}from"./sha256-De0VIEFf.js";const _=$*32n;class R extends b{constructor({givenLength:e,maxBytecodeSize:a}){super(`Bytecode cannot be longer than ${a} bytes. Given length: ${e}`,{name:"BytecodeLengthExceedsMaxSizeError"})}}class W extends b{constructor({givenLengthInWords:e}){super(`Bytecode length in 32-byte words must be odd. Given length in words: ${e}`,{name:"BytecodeLengthInWordsMustBeOddError"})}}class U extends b{constructor({givenLength:e}){super(`The bytecode length in bytes must be divisible by 32. Given length: ${e}`,{name:"BytecodeLengthMustBeDivisibleBy32Error"})}}function k(t){const e=h(t);if(e.length%32!==0)throw new U({givenLength:e.length});if(e.length>_)throw new R({givenLength:e.length,maxBytecodeSize:_});const a=V(e),n=h(a),r=e.length/32;if(r%2===0)throw new W({givenLengthInWords:r});const i=h(r),s=v(i,{size:2}),o=new Uint8Array([1,0]);return n.set(o,0),n.set(s,2),n}function f(t){if(["string","number"].includes(typeof t)&&!Number.isInteger(Number(t)))throw new Error(`Expected value to be an integer to convert to a bigint, got ${t} of type ${typeof t}`);return t instanceof Uint8Array?BigInt(L(t)):BigInt(t)}const x=(t,e)=>typeof t=="bigint"?e(t):Array.isArray(t)?t.map(a=>x(a,e)):t&&typeof t=="object"?Object.fromEntries(Object.entries(t).map(([a,n])=>[a,x(n,e)])):t,T=50000n,N=t=>{const e=X(t);return{domain:{chainId:t.chainId,name:"zkSync",version:"2"},message:e,primaryType:"Transaction",types:{Transaction:[{name:"txType",type:"uint256"},{name:"from",type:"uint256"},{name:"to",type:"uint256"},{name:"gasLimit",type:"uint256"},{name:"gasPerPubdataByteLimit",type:"uint256"},{name:"maxFeePerGas",type:"uint256"},{name:"maxPriorityFeePerGas",type:"uint256"},{name:"paymaster",type:"uint256"},{name:"nonce",type:"uint256"},{name:"value",type:"uint256"},{name:"data",type:"bytes"},{name:"factoryDeps",type:"bytes32[]"},{name:"paymasterInput",type:"bytes"}]}}};function X(t){const{gas:e,nonce:a,to:n,from:r,value:i,maxFeePerGas:s,maxPriorityFeePerGas:o,paymaster:d,paymasterInput:u,gasPerPubdata:y,data:g,factoryDeps:p}=t;return{data:g||"0x0",factoryDeps:(p==null?void 0:p.map(c=>m(k(c))))??[],from:BigInt(r),gasLimit:e??0n,gasPerPubdataByteLimit:y??T,maxFeePerGas:s??0n,maxPriorityFeePerGas:o??0n,nonce:a?BigInt(a):0n,paymaster:d?BigInt(d):0n,paymasterInput:u||"0x",to:n?BigInt(n):0n,txType:113n,value:i??0n}}async function C(t){const{account:e,transaction:a}=t,n=await I(t),r=await w({account:e,chainId:a.chain.id,eip712Transaction:n}),i=G(a),s=await D(i,r);return{chain:a.chain,client:a.client,transactionHash:s}}async function w(t){const{account:e,eip712Transaction:a,chainId:n}=t,r=N(a),i=await e.signTypedData({...r});return Y({...a,chainId:n,customSignature:i})}async function I(t){const{account:e,transaction:a}=t,{gas:n,maxFeePerGas:r,maxPriorityFeePerGas:i,gasPerPubdata:s}=await F({from:z(e.address),transaction:a});return{...await O({from:e.address,transaction:{...a,gas:n,maxFeePerGas:r,maxPriorityFeePerGas:i}}),...a.eip712,from:e.address,gasPerPubdata:s}}function Y(t){const{chainId:e,gas:a,nonce:n,to:r,from:i,value:s,maxFeePerGas:o,maxPriorityFeePerGas:d,customSignature:u,factoryDeps:y,paymaster:g,paymasterInput:p,gasPerPubdata:c,data:l}=t,E=[n?m(n):"0x",d?m(d):"0x",o?m(o):"0x",a?m(a):"0x",r??"0x",s?m(s):"0x",l??"0x0",m(e),m(""),m(""),m(e),i??"0x",c?m(c):m(T),y??[],u??"0x",g&&p?[g,p]:[]];return M(["0x71",H(E)])}async function F(t){const{transaction:e,from:a}=t;let[n,r,i,s]=await Promise.all([P(e.gas),P(e.maxFeePerGas),P(e.maxPriorityFeePerGas),P(e.eip712)]),o=s==null?void 0:s.gasPerPubdata;if(n===void 0||r===void 0||i===void 0){const d=G(e),u=await Z({from:a,transaction:e});try{const y=await d({method:"zks_estimateFee",params:[x(u,m)]});n=f(y.gas_limit)*2n,r=f(y.max_fee_per_gas)*2n,i=f(y.max_priority_fee_per_gas)||1n,o=f(y.gas_per_pubdata_limit)*2n,o<50000n&&(o=50000n)}catch{const[{estimateGas:y},{getDefaultGasOverrides:g}]=await Promise.all([B(()=>import("./signing-DqVkCMNZ.js").then(l=>l.cX),__vite__mapDeps([0,1,2,3,4,5])),B(()=>import("./signing-DqVkCMNZ.js").then(l=>l.cV),__vite__mapDeps([0,1,2,3,4,5]))]),[p,c]=await Promise.all([n===void 0?y({transaction:e,from:a}):Promise.resolve(n),g(e.client,e.chain)]);n=p*2n,"maxFeePerGas"in c&&c.maxFeePerGas?r=c.maxFeePerGas*2n:"gasPrice"in c&&c.gasPrice&&(r=c.gasPrice*2n),"maxPriorityFeePerGas"in c&&c.maxPriorityFeePerGas?i=c.maxPriorityFeePerGas:i=1n,o=100000n}}return{gas:n,gasPerPubdata:o,maxFeePerGas:r,maxPriorityFeePerGas:i}}async function Z(t){var d;const{transaction:e,from:a}=t,[n,r,i,s]=await Promise.all([S(e),P(e.to),P(e.value),P(e.eip712)]),o=s==null?void 0:s.gasPerPubdata;return{data:n,eip712Meta:{...s,factoryDeps:(d=s==null?void 0:s.factoryDeps)==null?void 0:d.map(u=>Array.from(A(u))),gasPerPubdata:o||50000n},from:a,gasPerPubdata:o,to:r,type:"0x71",value:i}}const Q=Object.freeze(Object.defineProperty({__proto__:null,getZkGasFees:F,populateEip712Transaction:I,sendEip712Transaction:C,signEip712Transaction:w},Symbol.toStringTag,{value:"Module"}));export{Q as a,I as p,w as s,f as t};

package/assets/{send-gasless-transaction-B7YcLCGg.js → send-gasless-transaction-CHYN-ATV.js}

@@ -1,2 +1,2 @@
-const __vite__mapDeps=(i,m=__vite__mapDeps,d=(m.f||(m.f=["assets/biconomy-C6flCXA4.js","assets/signing-CoPa7cSW.js","assets/utils-nbkSUjEy.js","assets/ethers-DHDSyreX.js","assets/react-Vu6nbGi5.js","assets/index-C7-iTfFV.js","assets/index-DCrqkiFN.css","assets/openzeppelin-DwFpqgXP.js","assets/engine-Bjifrd8K.js","assets/wait-for-tx-receipt-Dm2aAIs1.js","assets/transactionReceipt-C2iQ3ozz.js","assets/sleep-mAKpSMLY.js"])))=>i.map(i=>d[i]);
-import{_ as p}from"./index-C7-iTfFV.js";import{c as d}from"./signing-CoPa7cSW.js";import"./react-Vu6nbGi5.js";import"./ethers-DHDSyreX.js";import"./utils-nbkSUjEy.js";async function y({account:i,transaction:e,serializableTransaction:o,gasless:r}){if(o.value&&o.value>0n)throw new Error("Gasless transactions cannot have a value");let n;if(r.provider==="biconomy"){const{relayBiconomyTransaction:t}=await p(async()=>{const{relayBiconomyTransaction:a}=await import("./biconomy-C6flCXA4.js");return{relayBiconomyTransaction:a}},__vite__mapDeps([0,1,2,3,4,5,6]));n=await t({account:i,gasless:r,serializableTransaction:o,transaction:e})}if(r.provider==="openzeppelin"){const{relayOpenZeppelinTransaction:t}=await p(async()=>{const{relayOpenZeppelinTransaction:a}=await import("./openzeppelin-DwFpqgXP.js");return{relayOpenZeppelinTransaction:a}},__vite__mapDeps([7,1,2,3,4,5,6]));n=await t({account:i,gasless:r,serializableTransaction:o,transaction:e})}if(r.provider==="engine"){const{relayEngineTransaction:t}=await p(async()=>{const{relayEngineTransaction:a}=await import("./engine-Bjifrd8K.js");return{relayEngineTransaction:a}},__vite__mapDeps([8,1,2,3,4,5,6,9,10,11]));n=await t({account:i,gasless:r,serializableTransaction:o,transaction:e})}if(!n)throw new Error("Unsupported gasless provider");return d({address:i.address,chainId:e.chain.id,transactionHash:n.transactionHash}),n}export{y as sendGaslessTransaction};
+const __vite__mapDeps=(i,m=__vite__mapDeps,d=(m.f||(m.f=["assets/biconomy-BQtB5Ab0.js","assets/signing-DqVkCMNZ.js","assets/utils-BmX8TqzP.js","assets/ethers-JeCAM1sd.js","assets/react-Vu6nbGi5.js","assets/index-CI_HQD35.js","assets/index-DCrqkiFN.css","assets/openzeppelin-B2NGugOR.js","assets/engine-Cs_nlYqC.js","assets/wait-for-tx-receipt-D0UsY_wi.js","assets/transactionReceipt-BcAWHNof.js","assets/sleep-mAKpSMLY.js"])))=>i.map(i=>d[i]);
+import{_ as p}from"./index-CI_HQD35.js";import{c as d}from"./signing-DqVkCMNZ.js";import"./react-Vu6nbGi5.js";import"./ethers-JeCAM1sd.js";import"./utils-BmX8TqzP.js";async function y({account:i,transaction:e,serializableTransaction:o,gasless:r}){if(o.value&&o.value>0n)throw new Error("Gasless transactions cannot have a value");let n;if(r.provider==="biconomy"){const{relayBiconomyTransaction:t}=await p(async()=>{const{relayBiconomyTransaction:a}=await import("./biconomy-BQtB5Ab0.js");return{relayBiconomyTransaction:a}},__vite__mapDeps([0,1,2,3,4,5,6]));n=await t({account:i,gasless:r,serializableTransaction:o,transaction:e})}if(r.provider==="openzeppelin"){const{relayOpenZeppelinTransaction:t}=await p(async()=>{const{relayOpenZeppelinTransaction:a}=await import("./openzeppelin-B2NGugOR.js");return{relayOpenZeppelinTransaction:a}},__vite__mapDeps([7,1,2,3,4,5,6]));n=await t({account:i,gasless:r,serializableTransaction:o,transaction:e})}if(r.provider==="engine"){const{relayEngineTransaction:t}=await p(async()=>{const{relayEngineTransaction:a}=await import("./engine-Cs_nlYqC.js");return{relayEngineTransaction:a}},__vite__mapDeps([8,1,2,3,4,5,6,9,10,11]));n=await t({account:i,gasless:r,serializableTransaction:o,transaction:e})}if(!n)throw new Error("Unsupported gasless provider");return d({address:i.address,chainId:e.chain.id,transactionHash:n.transactionHash}),n}export{y as sendGaslessTransaction};