@vicin/sigil 2.2.1 → 3.0.0

package/dist/index.global.js

@@ -1,2381 +1,6 @@
-(function (exports) {
-  'use strict';
+(function(exports){'use strict';var xt=Object.defineProperty;var Et=(i,r,h)=>r in i?xt(i,r,{enumerable:true,configurable:true,writable:true,value:h}):i[r]=h;var q=(i,r,h)=>Et(i,typeof r!="symbol"?r+"":r,h);var ae={labelValidation:null,skipLabelInheritanceCheck:false,autofillLabels:true},_t=i=>{if("autofillLabels"in i){if(typeof i.autofillLabels!="boolean")throw new Error("'updateSigilOptions.autofillLabels' must be boolean");ae.autofillLabels=i.autofillLabels;}if("skipLabelInheritanceCheck"in i){if(typeof i.skipLabelInheritanceCheck!="boolean")throw new Error("'updateSigilOptions.skipLabelInheritanceCheck' must be boolean");ae.skipLabelInheritanceCheck=i.skipLabelInheritanceCheck;}if("labelValidation"in i){let r=i.labelValidation;if(r!==null&&typeof r!="function"&&!(r instanceof RegExp))throw new Error("'updateSigilOptions.labelValidation' must be null, function or RegExp");ae.labelValidation=r!=null?r:null;}},yt=/^@[\w-]+(?:\/[\w-]+)*\.[A-Z][A-Za-z0-9]*$/;var Ne=Symbol.for("@vicin/sigil.__SIGIL__"),Te=Symbol.for("@vicin/sigil.__SIGIL_BASE__"),Be=Symbol.for("@vicin/sigil.__DECORATED__"),Ce=Symbol.for("@vicin/sigil.__INHERITANCE_CHECKED__"),Q=Symbol.for("@vicin/sigil.__LABEL__"),pe=Symbol.for("@vicin/sigil.__EFFECTIVE_LABEL__"),H=Symbol.for("@vicin/sigil.__LABEL_LINEAGE__"),ie=Symbol.for("@vicin/sigil.__LABEL_SET__");var xe=BigInt(4294967295),We=BigInt(32);function Lt(i,r=false){return r?{h:Number(i&xe),l:Number(i>>We&xe)}:{h:Number(i>>We&xe)|0,l:Number(i&xe)|0}}function Ke(i,r=false){let h=i.length,S=new Uint32Array(h),d=new Uint32Array(h);for(let _=0;_<h;_++){let{h:p,l:x}=Lt(i[_],r);[S[_],d[_]]=[p,x];}return [S,d]}var Ye=(i,r,h)=>i<<h|r>>>32-h,Ze=(i,r,h)=>r<<h|i>>>32-h,Je=(i,r,h)=>r<<h-32|i>>>64-h,Qe=(i,r,h)=>i<<h-32|r>>>64-h;function mt(i){return i instanceof Uint8Array||ArrayBuffer.isView(i)&&i.constructor.name==="Uint8Array"}function ve(i,r=""){if(!Number.isSafeInteger(i)||i<0){let h=r&&`"${r}" `;throw new Error(`${h}expected integer >= 0, got ${i}`)}}function Ee(i,r,h=""){let S=mt(i),d=i==null?void 0:i.length,_=r!==void 0;if(!S||_){let p=h&&`"${h}" `,x="",O=S?`length=${d}`:`type=${typeof i}`;throw new Error(p+"expected Uint8Array"+x+", got "+O)}return i}function De(i,r=true){if(i.destroyed)throw new Error("Hash instance has been destroyed");if(r&&i.finished)throw new Error("Hash#digest() has already been called")}function et(i,r){Ee(i,void 0,"digestInto() output");let h=r.outputLen;if(i.length<h)throw new Error('"digestInto() output" expected to be of length >='+h)}function tt(i){return new Uint32Array(i.buffer,i.byteOffset,Math.floor(i.byteLength/4))}function Re(...i){for(let r=0;r<i.length;r++)i[r].fill(0);}var Ot=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function bt(i){return i<<24&4278190080|i<<8&16711680|i>>>8&65280|i>>>24&255}function It(i){for(let r=0;r<i.length;r++)i[r]=bt(i[r]);return i}var Pe=Ot?i=>i:It;function it(i,r={}){let h=(d,_)=>i(_).update(d).digest(),S=i(void 0);return h.outputLen=S.outputLen,h.blockLen=S.blockLen,h.create=d=>i(d),Object.assign(h,r),Object.freeze(h)}var nt=i=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,i])});var At=BigInt(0),de=BigInt(1),kt=BigInt(2),Nt=BigInt(7),Tt=BigInt(256),Bt=BigInt(113),st=[],ct=[],lt=[];for(let i=0,r=de,h=1,S=0;i<24;i++){[h,S]=[S,(2*h+3*S)%5],st.push(2*(5*S+h)),ct.push((i+1)*(i+2)/2%64);let d=At;for(let _=0;_<7;_++)r=(r<<de^(r>>Nt)*Bt)%Tt,r&kt&&(d^=de<<(de<<BigInt(_))-de);lt.push(d);}var ft=Ke(lt,true),Ct=ft[0],vt=ft[1],rt=(i,r,h)=>h>32?Je(i,r,h):Ye(i,r,h),ot=(i,r,h)=>h>32?Qe(i,r,h):Ze(i,r,h);function Dt(i,r=24){let h=new Uint32Array(10);for(let S=24-r;S<24;S++){for(let p=0;p<10;p++)h[p]=i[p]^i[p+10]^i[p+20]^i[p+30]^i[p+40];for(let p=0;p<10;p+=2){let x=(p+8)%10,O=(p+2)%10,m=h[O],N=h[O+1],D=rt(m,N,1)^h[x],V=ot(m,N,1)^h[x+1];for(let Z=0;Z<50;Z+=10)i[p+Z]^=D,i[p+Z+1]^=V;}let d=i[2],_=i[3];for(let p=0;p<24;p++){let x=ct[p],O=rt(d,_,x),m=ot(d,_,x),N=st[p];d=i[N],_=i[N+1],i[N]=O,i[N+1]=m;}for(let p=0;p<50;p+=10){for(let x=0;x<10;x++)h[x]=i[p+x];for(let x=0;x<10;x++)i[p+x]^=~h[(x+2)%10]&h[(x+4)%10];}i[0]^=Ct[S],i[1]^=vt[S];}Re(h);}var Ue=class i{constructor(r,h,S,d=false,_=24){q(this,"state");q(this,"pos",0);q(this,"posOut",0);q(this,"finished",false);q(this,"state32");q(this,"destroyed",false);q(this,"blockLen");q(this,"suffix");q(this,"outputLen");q(this,"enableXOF",false);q(this,"rounds");if(this.blockLen=r,this.suffix=h,this.outputLen=S,this.enableXOF=d,this.rounds=_,ve(S,"outputLen"),!(0<r&&r<200))throw new Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=tt(this.state);}clone(){return this._cloneInto()}keccak(){Pe(this.state32),Dt(this.state32,this.rounds),Pe(this.state32),this.posOut=0,this.pos=0;}update(r){De(this),Ee(r);let{blockLen:h,state:S}=this,d=r.length;for(let _=0;_<d;){let p=Math.min(h-this.pos,d-_);for(let x=0;x<p;x++)S[this.pos++]^=r[_++];this.pos===h&&this.keccak();}return this}finish(){if(this.finished)return;this.finished=true;let{state:r,suffix:h,pos:S,blockLen:d}=this;r[S]^=h,(h&128)!==0&&S===d-1&&this.keccak(),r[d-1]^=128,this.keccak();}writeInto(r){De(this,false),Ee(r),this.finish();let h=this.state,{blockLen:S}=this;for(let d=0,_=r.length;d<_;){this.posOut>=S&&this.keccak();let p=Math.min(S-this.posOut,_-d);r.set(h.subarray(this.posOut,this.posOut+p),d),this.posOut+=p,d+=p;}return r}xofInto(r){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(r)}xof(r){return ve(r),this.xofInto(new Uint8Array(r))}digestInto(r){if(et(r,this),this.finished)throw new Error("digest() was already called");return this.writeInto(r),this.destroy(),r}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=true,Re(this.state);}_cloneInto(r){let{blockLen:h,suffix:S,outputLen:d,rounds:_,enableXOF:p}=this;return r||(r=new i(h,S,d,p,_)),r.state32.set(this.state32),r.pos=this.pos,r.posOut=this.posOut,r.finished=this.finished,r.rounds=_,r.suffix=S,r.outputLen=d,r.enableXOF=p,r.destroyed=this.destroyed,r}},Rt=(i,r,h,S={})=>it(()=>new Ue(r,i,h),S);var at=Rt(6,72,64,nt(10));var Pt=/^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,Fe=Math.ceil,z=Math.floor,M="[BigNumber Error] ",ut=M+"Number primitive has more than 15 significant digits: ",Y=1e14,b=14,He=9007199254740991,Me=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],se=1e7,P=1e9;function ht(i){var r,h,S,d=E.prototype={constructor:E,toString:null,valueOf:null},_=new E(1),p=20,x=4,O=-7,m=21,N=-1e7,D=1e7,V=false,Z=1,oe=0,me={prefix:"",groupSize:3,secondaryGroupSize:0,groupSeparator:",",decimalSeparator:".",fractionGroupSize:0,fractionGroupSeparator:"\xA0",suffix:""},fe="0123456789abcdefghijklmnopqrstuvwxyz",Oe=true;function E(e,t){var n,a,s,l,g,o,c,u,f=this;if(!(f instanceof E))return new E(e,t);if(t==null){if(e&&e._isBigNumber===true){f.s=e.s,!e.c||e.e>D?f.c=f.e=null:e.e<N?f.c=[f.e=0]:(f.e=e.e,f.c=e.c.slice());return}if((o=typeof e=="number")&&e*0==0){if(f.s=1/e<0?(e=-e,-1):1,e===~~e){for(l=0,g=e;g>=10;g/=10,l++);l>D?f.c=f.e=null:(f.e=l,f.c=[e]);return}u=String(e);}else {if(!Pt.test(u=String(e)))return S(f,u,o);f.s=u.charCodeAt(0)==45?(u=u.slice(1),-1):1;}(l=u.indexOf("."))>-1&&(u=u.replace(".","")),(g=u.search(/e/i))>0?(l<0&&(l=g),l+=+u.slice(g+1),u=u.substring(0,g)):l<0&&(l=u.length);}else {if(B(t,2,fe.length,"Base"),t==10&&Oe)return f=new E(e),G(f,p+f.e+1,x);if(u=String(e),o=typeof e=="number"){if(e*0!=0)return S(f,u,o,t);if(f.s=1/e<0?(u=u.slice(1),-1):1,E.DEBUG&&u.replace(/^0\.0*|\./,"").length>15)throw Error(ut+e)}else f.s=u.charCodeAt(0)===45?(u=u.slice(1),-1):1;for(n=fe.slice(0,t),l=g=0,c=u.length;g<c;g++)if(n.indexOf(a=u.charAt(g))<0){if(a=="."){if(g>l){l=c;continue}}else if(!s&&(u==u.toUpperCase()&&(u=u.toLowerCase())||u==u.toLowerCase()&&(u=u.toUpperCase()))){s=true,g=-1,l=0;continue}return S(f,String(e),o,t)}o=false,u=h(u,t,10,f.s),(l=u.indexOf("."))>-1?u=u.replace(".",""):l=u.length;}for(g=0;u.charCodeAt(g)===48;g++);for(c=u.length;u.charCodeAt(--c)===48;);if(u=u.slice(g,++c)){if(c-=g,o&&E.DEBUG&&c>15&&(e>He||e!==z(e)))throw Error(ut+f.s*e);if((l=l-g-1)>D)f.c=f.e=null;else if(l<N)f.c=[f.e=0];else {if(f.e=l,f.c=[],g=(l+1)%b,l<0&&(g+=b),g<c){for(g&&f.c.push(+u.slice(0,g)),c-=b;g<c;)f.c.push(+u.slice(g,g+=b));g=b-(u=u.slice(g)).length;}else g-=c;for(;g--;u+="0");f.c.push(+u);}}else f.c=[f.e=0];}E.clone=ht,E.ROUND_UP=0,E.ROUND_DOWN=1,E.ROUND_CEIL=2,E.ROUND_FLOOR=3,E.ROUND_HALF_UP=4,E.ROUND_HALF_DOWN=5,E.ROUND_HALF_EVEN=6,E.ROUND_HALF_CEIL=7,E.ROUND_HALF_FLOOR=8,E.EUCLID=9,E.config=E.set=function(e){var t,n;if(e!=null)if(typeof e=="object"){if(e.hasOwnProperty(t="DECIMAL_PLACES")&&(n=e[t],B(n,0,P,t),p=n),e.hasOwnProperty(t="ROUNDING_MODE")&&(n=e[t],B(n,0,8,t),x=n),e.hasOwnProperty(t="EXPONENTIAL_AT")&&(n=e[t],n&&n.pop?(B(n[0],-P,0,t),B(n[1],0,P,t),O=n[0],m=n[1]):(B(n,-P,P,t),O=-(m=n<0?-n:n))),e.hasOwnProperty(t="RANGE"))if(n=e[t],n&&n.pop)B(n[0],-P,-1,t),B(n[1],1,P,t),N=n[0],D=n[1];else if(B(n,-P,P,t),n)N=-(D=n<0?-n:n);else throw Error(M+t+" cannot be zero: "+n);if(e.hasOwnProperty(t="CRYPTO"))if(n=e[t],n===!!n)if(n)if(typeof crypto!="undefined"&&crypto&&(crypto.getRandomValues||crypto.randomBytes))V=n;else throw V=!n,Error(M+"crypto unavailable");else V=n;else throw Error(M+t+" not true or false: "+n);if(e.hasOwnProperty(t="MODULO_MODE")&&(n=e[t],B(n,0,9,t),Z=n),e.hasOwnProperty(t="POW_PRECISION")&&(n=e[t],B(n,0,P,t),oe=n),e.hasOwnProperty(t="FORMAT"))if(n=e[t],typeof n=="object")me=n;else throw Error(M+t+" not an object: "+n);if(e.hasOwnProperty(t="ALPHABET"))if(n=e[t],typeof n=="string"&&!/^.?$|[+\-.\s]|(.).*\1/.test(n))Oe=n.slice(0,10)=="0123456789",fe=n;else throw Error(M+t+" invalid: "+n)}else throw Error(M+"Object expected: "+e);return {DECIMAL_PLACES:p,ROUNDING_MODE:x,EXPONENTIAL_AT:[O,m],RANGE:[N,D],CRYPTO:V,MODULO_MODE:Z,POW_PRECISION:oe,FORMAT:me,ALPHABET:fe}},E.isBigNumber=function(e){if(!e||e._isBigNumber!==true)return  false;if(!E.DEBUG)return  true;var t,n,a=e.c,s=e.e,l=e.s;e:if({}.toString.call(a)=="[object Array]"){if((l===1||l===-1)&&s>=-P&&s<=P&&s===z(s)){if(a[0]===0){if(s===0&&a.length===1)return  true;break e}if(t=(s+1)%b,t<1&&(t+=b),String(a[0]).length==t){for(t=0;t<a.length;t++)if(n=a[t],n<0||n>=Y||n!==z(n))break e;if(n!==0)return  true}}}else if(a===null&&s===null&&(l===null||l===1||l===-1))return  true;throw Error(M+"Invalid BigNumber: "+e)},E.maximum=E.max=function(){return ze(arguments,-1)},E.minimum=E.min=function(){return ze(arguments,1)},E.random=(function(){var e=9007199254740992,t=Math.random()*e&2097151?function(){return z(Math.random()*e)}:function(){return (Math.random()*1073741824|0)*8388608+(Math.random()*8388608|0)};return function(n){var a,s,l,g,o,c=0,u=[],f=new E(_);if(n==null?n=p:B(n,0,P),g=Fe(n/b),V)if(crypto.getRandomValues){for(a=crypto.getRandomValues(new Uint32Array(g*=2));c<g;)o=a[c]*131072+(a[c+1]>>>11),o>=9e15?(s=crypto.getRandomValues(new Uint32Array(2)),a[c]=s[0],a[c+1]=s[1]):(u.push(o%1e14),c+=2);c=g/2;}else if(crypto.randomBytes){for(a=crypto.randomBytes(g*=7);c<g;)o=(a[c]&31)*281474976710656+a[c+1]*1099511627776+a[c+2]*4294967296+a[c+3]*16777216+(a[c+4]<<16)+(a[c+5]<<8)+a[c+6],o>=9e15?crypto.randomBytes(7).copy(a,c):(u.push(o%1e14),c+=7);c=g/7;}else throw V=false,Error(M+"crypto unavailable");if(!V)for(;c<g;)o=t(),o<9e15&&(u[c++]=o%1e14);for(g=u[--c],n%=b,g&&n&&(o=Me[b-n],u[c]=z(g/o)*o);u[c]===0;u.pop(),c--);if(c<0)u=[l=0];else {for(l=-1;u[0]===0;u.splice(0,1),l-=b);for(c=1,o=u[0];o>=10;o/=10,c++);c<b&&(l-=b-c);}return f.e=l,f.c=u,f}})(),E.sum=function(){for(var e=1,t=arguments,n=new E(t[0]);e<t.length;)n=n.plus(t[e++]);return n},h=(function(){var e="0123456789";function t(n,a,s,l){for(var g,o=[0],c,u=0,f=n.length;u<f;){for(c=o.length;c--;o[c]*=a);for(o[0]+=l.indexOf(n.charAt(u++)),g=0;g<o.length;g++)o[g]>s-1&&(o[g+1]==null&&(o[g+1]=0),o[g+1]+=o[g]/s|0,o[g]%=s);}return o.reverse()}return function(n,a,s,l,g){var o,c,u,f,w,y,L,A,C=n.indexOf("."),R=p,I=x;for(C>=0&&(f=oe,oe=0,n=n.replace(".",""),A=new E(a),y=A.pow(n.length-C),oe=f,A.c=t(ne(X(y.c),y.e,"0"),10,s,e),A.e=A.c.length),L=t(n,a,s,g?(o=fe,e):(o=e,fe)),u=f=L.length;L[--f]==0;L.pop());if(!L[0])return o.charAt(0);if(C<0?--u:(y.c=L,y.e=u,y.s=l,y=r(y,A,R,I,s),L=y.c,w=y.r,u=y.e),c=u+R+1,C=L[c],f=s/2,w=w||c<0||L[c+1]!=null,w=I<4?(C!=null||w)&&(I==0||I==(y.s<0?3:2)):C>f||C==f&&(I==4||w||I==6&&L[c-1]&1||I==(y.s<0?8:7)),c<1||!L[0])n=w?ne(o.charAt(1),-R,o.charAt(0)):o.charAt(0);else {if(L.length=c,w)for(--s;++L[--c]>s;)L[c]=0,c||(++u,L=[1].concat(L));for(f=L.length;!L[--f];);for(C=0,n="";C<=f;n+=o.charAt(L[C++]));n=ne(n,u,o.charAt(0));}return n}})(),r=(function(){function e(a,s,l){var g,o,c,u,f=0,w=a.length,y=s%se,L=s/se|0;for(a=a.slice();w--;)c=a[w]%se,u=a[w]/se|0,g=L*c+u*y,o=y*c+g%se*se+f,f=(o/l|0)+(g/se|0)+L*u,a[w]=o%l;return f&&(a=[f].concat(a)),a}function t(a,s,l,g){var o,c;if(l!=g)c=l>g?1:-1;else for(o=c=0;o<l;o++)if(a[o]!=s[o]){c=a[o]>s[o]?1:-1;break}return c}function n(a,s,l,g){for(var o=0;l--;)a[l]-=o,o=a[l]<s[l]?1:0,a[l]=o*g+a[l]-s[l];for(;!a[0]&&a.length>1;a.splice(0,1));}return function(a,s,l,g,o){var c,u,f,w,y,L,A,C,R,I,k,U,Se,Ae,ke,J,ge,j=a.s==s.s?1:-1,F=a.c,v=s.c;if(!F||!F[0]||!v||!v[0])return new E(!a.s||!s.s||(F?v&&F[0]==v[0]:!v)?NaN:F&&F[0]==0||!v?j*0:j/0);for(C=new E(j),R=C.c=[],u=a.e-s.e,j=l+u+1,o||(o=Y,u=W(a.e/b)-W(s.e/b),j=j/b|0),f=0;v[f]==(F[f]||0);f++);if(v[f]>(F[f]||0)&&u--,j<0)R.push(1),w=true;else {for(Ae=F.length,J=v.length,f=0,j+=2,y=z(o/(v[0]+1)),y>1&&(v=e(v,y,o),F=e(F,y,o),J=v.length,Ae=F.length),Se=J,I=F.slice(0,J),k=I.length;k<J;I[k++]=0);ge=v.slice(),ge=[0].concat(ge),ke=v[0],v[1]>=o/2&&ke++;do{if(y=0,c=t(v,I,J,k),c<0){if(U=I[0],J!=k&&(U=U*o+(I[1]||0)),y=z(U/ke),y>1)for(y>=o&&(y=o-1),L=e(v,y,o),A=L.length,k=I.length;t(L,I,A,k)==1;)y--,n(L,J<A?ge:v,A,o),A=L.length,c=1;else y==0&&(c=y=1),L=v.slice(),A=L.length;if(A<k&&(L=[0].concat(L)),n(I,L,k,o),k=I.length,c==-1)for(;t(v,I,J,k)<1;)y++,n(I,J<k?ge:v,k,o),k=I.length;}else c===0&&(y++,I=[0]);R[f++]=y,I[0]?I[k++]=F[Se]||0:(I=[F[Se]],k=1);}while((Se++<Ae||I[0]!=null)&&j--);w=I[0]!=null,R[0]||R.splice(0,1);}if(o==Y){for(f=1,j=R[0];j>=10;j/=10,f++);G(C,l+(C.e=f+u*b-1)+1,g,w);}else C.e=u,C.r=+w;return C}})();function be(e,t,n,a){var s,l,g,o,c;if(n==null?n=x:B(n,0,8),!e.c)return e.toString();if(s=e.c[0],g=e.e,t==null)c=X(e.c),c=a==1||a==2&&(g<=O||g>=m)?ye(c,g):ne(c,g,"0");else if(e=G(new E(e),t,n),l=e.e,c=X(e.c),o=c.length,a==1||a==2&&(t<=l||l<=O)){for(;o<t;c+="0",o++);c=ye(c,l);}else if(t-=g+(a===2&&l>g),c=ne(c,l,"0"),l+1>o){if(--t>0)for(c+=".";t--;c+="0");}else if(t+=l-o,t>0)for(l+1==o&&(c+=".");t--;c+="0");return e.s<0&&s?"-"+c:c}function ze(e,t){for(var n,a,s=1,l=new E(e[0]);s<e.length;s++)a=new E(e[s]),(!a.s||(n=ue(l,a))===t||n===0&&l.s===t)&&(l=a);return l}function Ie(e,t,n){for(var a=1,s=t.length;!t[--s];t.pop());for(s=t[0];s>=10;s/=10,a++);return (n=a+n*b-1)>D?e.c=e.e=null:n<N?e.c=[e.e=0]:(e.e=n,e.c=t),e}S=(function(){var e=/^(-?)0([xbo])(?=\w[\w.]*$)/i,t=/^([^.]+)\.$/,n=/^\.([^.]+)$/,a=/^-?(Infinity|NaN)$/,s=/^\s*\+(?=[\w.])|^\s+|\s+$/g;return function(l,g,o,c){var u,f=o?g:g.replace(s,"");if(a.test(f))l.s=isNaN(f)?null:f<0?-1:1;else {if(!o&&(f=f.replace(e,function(w,y,L){return u=(L=L.toLowerCase())=="x"?16:L=="b"?2:8,!c||c==u?y:w}),c&&(u=c,f=f.replace(t,"$1").replace(n,"0.$1")),g!=f))return new E(f,u);if(E.DEBUG)throw Error(M+"Not a"+(c?" base "+c:"")+" number: "+g);l.s=null;}l.c=l.e=null;}})();function G(e,t,n,a){var s,l,g,o,c,u,f,w=e.c,y=Me;if(w){e:{for(s=1,o=w[0];o>=10;o/=10,s++);if(l=t-s,l<0)l+=b,g=t,c=w[u=0],f=z(c/y[s-g-1]%10);else if(u=Fe((l+1)/b),u>=w.length)if(a){for(;w.length<=u;w.push(0));c=f=0,s=1,l%=b,g=l-b+1;}else break e;else {for(c=o=w[u],s=1;o>=10;o/=10,s++);l%=b,g=l-b+s,f=g<0?0:z(c/y[s-g-1]%10);}if(a=a||t<0||w[u+1]!=null||(g<0?c:c%y[s-g-1]),a=n<4?(f||a)&&(n==0||n==(e.s<0?3:2)):f>5||f==5&&(n==4||a||n==6&&(l>0?g>0?c/y[s-g]:0:w[u-1])%10&1||n==(e.s<0?8:7)),t<1||!w[0])return w.length=0,a?(t-=e.e+1,w[0]=y[(b-t%b)%b],e.e=-t||0):w[0]=e.e=0,e;if(l==0?(w.length=u,o=1,u--):(w.length=u+1,o=y[b-l],w[u]=g>0?z(c/y[s-g]%y[g])*o:0),a)for(;;)if(u==0){for(l=1,g=w[0];g>=10;g/=10,l++);for(g=w[0]+=o,o=1;g>=10;g/=10,o++);l!=o&&(e.e++,w[0]==Y&&(w[0]=1));break}else {if(w[u]+=o,w[u]!=Y)break;w[u--]=0,o=1;}for(l=w.length;w[--l]===0;w.pop());}e.e>D?e.c=e.e=null:e.e<N&&(e.c=[e.e=0]);}return e}function te(e){var t,n=e.e;return n===null?e.toString():(t=X(e.c),t=n<=O||n>=m?ye(t,n):ne(t,n,"0"),e.s<0?"-"+t:t)}return d.absoluteValue=d.abs=function(){var e=new E(this);return e.s<0&&(e.s=1),e},d.comparedTo=function(e,t){return ue(this,new E(e,t))},d.decimalPlaces=d.dp=function(e,t){var n,a,s,l=this;if(e!=null)return B(e,0,P),t==null?t=x:B(t,0,8),G(new E(l),e+l.e+1,t);if(!(n=l.c))return null;if(a=((s=n.length-1)-W(this.e/b))*b,s=n[s])for(;s%10==0;s/=10,a--);return a<0&&(a=0),a},d.dividedBy=d.div=function(e,t){return r(this,new E(e,t),p,x)},d.dividedToIntegerBy=d.idiv=function(e,t){return r(this,new E(e,t),0,1)},d.exponentiatedBy=d.pow=function(e,t){var n,a,s,l,g,o,c,u,f,w=this;if(e=new E(e),e.c&&!e.isInteger())throw Error(M+"Exponent not an integer: "+te(e));if(t!=null&&(t=new E(t)),o=e.e>14,!w.c||!w.c[0]||w.c[0]==1&&!w.e&&w.c.length==1||!e.c||!e.c[0])return f=new E(Math.pow(+te(w),o?e.s*(2-_e(e)):+te(e))),t?f.mod(t):f;if(c=e.s<0,t){if(t.c?!t.c[0]:!t.s)return new E(NaN);a=!c&&w.isInteger()&&t.isInteger(),a&&(w=w.mod(t));}else {if(e.e>9&&(w.e>0||w.e<-1||(w.e==0?w.c[0]>1||o&&w.c[1]>=24e7:w.c[0]<8e13||o&&w.c[0]<=9999975e7)))return l=w.s<0&&_e(e)?-0:0,w.e>-1&&(l=1/l),new E(c?1/l:l);oe&&(l=Fe(oe/b+2));}for(o?(n=new E(.5),c&&(e.s=1),u=_e(e)):(s=Math.abs(+te(e)),u=s%2),f=new E(_);;){if(u){if(f=f.times(w),!f.c)break;l?f.c.length>l&&(f.c.length=l):a&&(f=f.mod(t));}if(s){if(s=z(s/2),s===0)break;u=s%2;}else if(e=e.times(n),G(e,e.e+1,1),e.e>14)u=_e(e);else {if(s=+te(e),s===0)break;u=s%2;}w=w.times(w),l?w.c&&w.c.length>l&&(w.c.length=l):a&&(w=w.mod(t));}return a?f:(c&&(f=_.div(f)),t?f.mod(t):l?G(f,oe,x,g):f)},d.integerValue=function(e){var t=new E(this);return e==null?e=x:B(e,0,8),G(t,t.e+1,e)},d.isEqualTo=d.eq=function(e,t){return ue(this,new E(e,t))===0},d.isFinite=function(){return !!this.c},d.isGreaterThan=d.gt=function(e,t){return ue(this,new E(e,t))>0},d.isGreaterThanOrEqualTo=d.gte=function(e,t){return (t=ue(this,new E(e,t)))===1||t===0},d.isInteger=function(){return !!this.c&&W(this.e/b)>this.c.length-2},d.isLessThan=d.lt=function(e,t){return ue(this,new E(e,t))<0},d.isLessThanOrEqualTo=d.lte=function(e,t){return (t=ue(this,new E(e,t)))===-1||t===0},d.isNaN=function(){return !this.s},d.isNegative=function(){return this.s<0},d.isPositive=function(){return this.s>0},d.isZero=function(){return !!this.c&&this.c[0]==0},d.minus=function(e,t){var n,a,s,l,g=this,o=g.s;if(e=new E(e,t),t=e.s,!o||!t)return new E(NaN);if(o!=t)return e.s=-t,g.plus(e);var c=g.e/b,u=e.e/b,f=g.c,w=e.c;if(!c||!u){if(!f||!w)return f?(e.s=-t,e):new E(w?g:NaN);if(!f[0]||!w[0])return w[0]?(e.s=-t,e):new E(f[0]?g:x==3?-0:0)}if(c=W(c),u=W(u),f=f.slice(),o=c-u){for((l=o<0)?(o=-o,s=f):(u=c,s=w),s.reverse(),t=o;t--;s.push(0));s.reverse();}else for(a=(l=(o=f.length)<(t=w.length))?o:t,o=t=0;t<a;t++)if(f[t]!=w[t]){l=f[t]<w[t];break}if(l&&(s=f,f=w,w=s,e.s=-e.s),t=(a=w.length)-(n=f.length),t>0)for(;t--;f[n++]=0);for(t=Y-1;a>o;){if(f[--a]<w[a]){for(n=a;n&&!f[--n];f[n]=t);--f[n],f[a]+=Y;}f[a]-=w[a];}for(;f[0]==0;f.splice(0,1),--u);return f[0]?Ie(e,f,u):(e.s=x==3?-1:1,e.c=[e.e=0],e)},d.modulo=d.mod=function(e,t){var n,a,s=this;return e=new E(e,t),!s.c||!e.s||e.c&&!e.c[0]?new E(NaN):!e.c||s.c&&!s.c[0]?new E(s):(Z==9?(a=e.s,e.s=1,n=r(s,e,0,3),e.s=a,n.s*=a):n=r(s,e,0,Z),e=s.minus(n.times(e)),!e.c[0]&&Z==1&&(e.s=s.s),e)},d.multipliedBy=d.times=function(e,t){var n,a,s,l,g,o,c,u,f,w,y,L,A,C,R,I=this,k=I.c,U=(e=new E(e,t)).c;if(!k||!U||!k[0]||!U[0])return !I.s||!e.s||k&&!k[0]&&!U||U&&!U[0]&&!k?e.c=e.e=e.s=null:(e.s*=I.s,!k||!U?e.c=e.e=null:(e.c=[0],e.e=0)),e;for(a=W(I.e/b)+W(e.e/b),e.s*=I.s,c=k.length,w=U.length,c<w&&(A=k,k=U,U=A,s=c,c=w,w=s),s=c+w,A=[];s--;A.push(0));for(C=Y,R=se,s=w;--s>=0;){for(n=0,y=U[s]%R,L=U[s]/R|0,g=c,l=s+g;l>s;)u=k[--g]%R,f=k[g]/R|0,o=L*u+f*y,u=y*u+o%R*R+A[l]+n,n=(u/C|0)+(o/R|0)+L*f,A[l--]=u%C;A[l]=n;}return n?++a:A.splice(0,1),Ie(e,A,a)},d.negated=function(){var e=new E(this);return e.s=-e.s||null,e},d.plus=function(e,t){var n,a=this,s=a.s;if(e=new E(e,t),t=e.s,!s||!t)return new E(NaN);if(s!=t)return e.s=-t,a.minus(e);var l=a.e/b,g=e.e/b,o=a.c,c=e.c;if(!l||!g){if(!o||!c)return new E(s/0);if(!o[0]||!c[0])return c[0]?e:new E(o[0]?a:s*0)}if(l=W(l),g=W(g),o=o.slice(),s=l-g){for(s>0?(g=l,n=c):(s=-s,n=o),n.reverse();s--;n.push(0));n.reverse();}for(s=o.length,t=c.length,s-t<0&&(n=c,c=o,o=n,t=s),s=0;t;)s=(o[--t]=o[t]+c[t]+s)/Y|0,o[t]=Y===o[t]?0:o[t]%Y;return s&&(o=[s].concat(o),++g),Ie(e,o,g)},d.precision=d.sd=function(e,t){var n,a,s,l=this;if(e!=null&&e!==!!e)return B(e,1,P),t==null?t=x:B(t,0,8),G(new E(l),e,t);if(!(n=l.c))return null;if(s=n.length-1,a=s*b+1,s=n[s]){for(;s%10==0;s/=10,a--);for(s=n[0];s>=10;s/=10,a++);}return e&&l.e+1>a&&(a=l.e+1),a},d.shiftedBy=function(e){return B(e,-He,He),this.times("1e"+e)},d.squareRoot=d.sqrt=function(){var e,t,n,a,s,l=this,g=l.c,o=l.s,c=l.e,u=p+4,f=new E("0.5");if(o!==1||!g||!g[0])return new E(!o||o<0&&(!g||g[0])?NaN:g?l:1/0);if(o=Math.sqrt(+te(l)),o==0||o==1/0?(t=X(g),(t.length+c)%2==0&&(t+="0"),o=Math.sqrt(+t),c=W((c+1)/2)-(c<0||c%2),o==1/0?t="5e"+c:(t=o.toExponential(),t=t.slice(0,t.indexOf("e")+1)+c),n=new E(t)):n=new E(o+""),n.c[0]){for(c=n.e,o=c+u,o<3&&(o=0);;)if(s=n,n=f.times(s.plus(r(l,s,u,1))),X(s.c).slice(0,o)===(t=X(n.c)).slice(0,o))if(n.e<c&&--o,t=t.slice(o-3,o+1),t=="9999"||!a&&t=="4999"){if(!a&&(G(s,s.e+p+2,0),s.times(s).eq(l))){n=s;break}u+=4,o+=4,a=1;}else {(!+t||!+t.slice(1)&&t.charAt(0)=="5")&&(G(n,n.e+p+2,1),e=!n.times(n).eq(l));break}}return G(n,n.e+p+1,x,e)},d.toExponential=function(e,t){return e!=null&&(B(e,0,P),e++),be(this,e,t,1)},d.toFixed=function(e,t){return e!=null&&(B(e,0,P),e=e+this.e+1),be(this,e,t)},d.toFormat=function(e,t,n){var a,s=this;if(n==null)e!=null&&t&&typeof t=="object"?(n=t,t=null):e&&typeof e=="object"?(n=e,e=t=null):n=me;else if(typeof n!="object")throw Error(M+"Argument not an object: "+n);if(a=s.toFixed(e,t),s.c){var l,g=a.split("."),o=+n.groupSize,c=+n.secondaryGroupSize,u=n.groupSeparator||"",f=g[0],w=g[1],y=s.s<0,L=y?f.slice(1):f,A=L.length;if(c&&(l=o,o=c,c=l,A-=l),o>0&&A>0){for(l=A%o||o,f=L.substr(0,l);l<A;l+=o)f+=u+L.substr(l,o);c>0&&(f+=u+L.slice(l)),y&&(f="-"+f);}a=w?f+(n.decimalSeparator||"")+((c=+n.fractionGroupSize)?w.replace(new RegExp("\\d{"+c+"}\\B","g"),"$&"+(n.fractionGroupSeparator||"")):w):f;}return (n.prefix||"")+a+(n.suffix||"")},d.toFraction=function(e){var t,n,a,s,l,g,o,c,u,f,w,y,L=this,A=L.c;if(e!=null&&(o=new E(e),!o.isInteger()&&(o.c||o.s!==1)||o.lt(_)))throw Error(M+"Argument "+(o.isInteger()?"out of range: ":"not an integer: ")+te(o));if(!A)return new E(L);for(t=new E(_),u=n=new E(_),a=c=new E(_),y=X(A),l=t.e=y.length-L.e-1,t.c[0]=Me[(g=l%b)<0?b+g:g],e=!e||o.comparedTo(t)>0?l>0?t:u:o,g=D,D=1/0,o=new E(y),c.c[0]=0;f=r(o,t,0,1),s=n.plus(f.times(a)),s.comparedTo(e)!=1;)n=a,a=s,u=c.plus(f.times(s=u)),c=s,t=o.minus(f.times(s=t)),o=s;return s=r(e.minus(n),a,0,1),c=c.plus(s.times(u)),n=n.plus(s.times(a)),c.s=u.s=L.s,l=l*2,w=r(u,a,l,x).minus(L).abs().comparedTo(r(c,n,l,x).minus(L).abs())<1?[u,a]:[c,n],D=g,w},d.toNumber=function(){return +te(this)},d.toPrecision=function(e,t){return e!=null&&B(e,1,P),be(this,e,t,2)},d.toString=function(e){var t,n=this,a=n.s,s=n.e;return s===null?a?(t="Infinity",a<0&&(t="-"+t)):t="NaN":(e==null?t=s<=O||s>=m?ye(X(n.c),s):ne(X(n.c),s,"0"):e===10&&Oe?(n=G(new E(n),p+s+1,x),t=ne(X(n.c),n.e,"0")):(B(e,2,fe.length,"Base"),t=h(ne(X(n.c),s,"0"),10,e,a,true)),a<0&&n.c[0]&&(t="-"+t)),t},d.valueOf=d.toJSON=function(){return te(this)},d._isBigNumber=true,d[Symbol.toStringTag]="BigNumber",d[Symbol.for("nodejs.util.inspect.custom")]=d.valueOf,i!=null&&E.set(i),E}function W(i){var r=i|0;return i>0||i===r?r:r-1}function X(i){for(var r,h,S=1,d=i.length,_=i[0]+"";S<d;){for(r=i[S++]+"",h=b-r.length;h--;r="0"+r);_+=r;}for(d=_.length;_.charCodeAt(--d)===48;);return _.slice(0,d+1||1)}function ue(i,r){var h,S,d=i.c,_=r.c,p=i.s,x=r.s,O=i.e,m=r.e;if(!p||!x)return null;if(h=d&&!d[0],S=_&&!_[0],h||S)return h?S?0:-x:p;if(p!=x)return p;if(h=p<0,S=O==m,!d||!_)return S?0:!d^h?1:-1;if(!S)return O>m^h?1:-1;for(x=(O=d.length)<(m=_.length)?O:m,p=0;p<x;p++)if(d[p]!=_[p])return d[p]>_[p]^h?1:-1;return O==m?0:O>m^h?1:-1}function B(i,r,h,S){if(i<r||i>h||i!==z(i))throw Error(M+(S||"Argument")+(typeof i=="number"?i<r||i>h?" out of range: ":" not an integer: ":" not a primitive number: ")+String(i))}function _e(i){var r=i.c.length-1;return W(i.e/b)==r&&i.c[r]%2!=0}function ye(i,r){return (i.length>1?i.charAt(0)+"."+i.slice(1):i)+(r<0?"e":"e+")+r}function ne(i,r,h){var S,d;if(r<0){for(d=h+".";++r;d+=h);i=d+i;}else if(S=i.length,++r>S){for(d=h,r-=S;--r;d+=h);i+=d;}else r<S&&(i=i.slice(0,r)+"."+i.slice(r));return i}var Ut=ht(),gt=Ut;var Ft=24,we=32,Ht=()=>typeof globalThis!="undefined"&&globalThis.crypto&&typeof globalThis.crypto.getRandomValues=="function"?()=>{let i=new Uint32Array(1);return globalThis.crypto.getRandomValues(i),i[0]/4294967296}:Math.random,$e=Ht(),Ve=(i=4,r=$e)=>{let h="";for(;h.length<i;)h=h+Math.floor(r()*36).toString(36);return h};function Mt(i){let r=new gt(0);for(let h of i.values())r=r.multipliedBy(256).plus(h);return r}var dt=(i="")=>{let r=new TextEncoder;return Mt(at(r.encode(i))).toString(36).slice(1)},pt=Array.from({length:26},(i,r)=>String.fromCharCode(r+97)),Vt=i=>pt[Math.floor(i()*pt.length)],$t=({globalObj:i=typeof global!="undefined"?global:typeof window!="undefined"?window:{},random:r=$e}={})=>{let h=Object.keys(i).toString(),S=h.length?h+Ve(we,r):Ve(we,r);return dt(S).substring(0,we)},Gt=i=>()=>i++,jt=476782367,wt=({random:i=$e,counter:r=Gt(Math.floor(i()*jt)),length:h=Ft,fingerprint:S=$t({random:i})}={})=>{if(h>we)throw new Error(`Length must be between 2 and ${we}. Received: ${h}`);return function(){let _=Vt(i),p=Date.now().toString(36),x=r().toString(36),O=Ve(h,i),m=`${p+O+x+S}`;return `${_+dt(m).substring(1,h)}`}},Ge=qt(wt);function qt(i){let r;return ()=>(r||(r=i()),r())}function ce(i,r,h){if(process.env.NODE_ENV!=="production"&&Xe(i))throw new Error(`Constructor ${i} is already decorated. if you are using 'withSigilTyped()' & '@WithSigil()' at the same time remove one of them.`);Object.defineProperty(i,Q,{value:r,configurable:true,enumerable:false,writable:false}),h!=null&&h.isInheritanceCheck||Object.defineProperty(i,pe,{value:r,configurable:true,enumerable:false,writable:false});let S=Object.getPrototypeOf(i),d=S&&S[H]?S[H]:[],_=h!=null&&h.isMixin&&r!=="Sigil"?["Sigil",...d,r]:[...d,r];Object.defineProperty(i,H,{value:_,configurable:true,enumerable:false,writable:false}),Object.defineProperty(i,ie,{value:new Set(_),configurable:true,enumerable:false,writable:false}),h!=null&&h.isInheritanceCheck||Xt(i);}function $(i,r){var _,p;if(re(i)||((_=r==null?void 0:r.skipLabelInheritanceCheck)!=null?_:ae.skipLabelInheritanceCheck))return;let h=[i],S=Object.getPrototypeOf(i);for(;ee(S);)h.push(S),S=Object.getPrototypeOf(S);let d=new Map;for(let x=h.length-1;x>=0;x--){let O=h[x];if(!O)continue;let m=O[Q];if(d.has(m)){if(process.env.NODE_ENV!=="production"&&(Xe(O)||!((p=r==null?void 0:r.autofillLabels)!=null?p:ae.autofillLabels)))throw new Error(`[Sigil Error] Class "${O.name}" re-uses Sigil label "${m}" from ancestor "${d.get(m)}". Each Sigil subclass must use a unique label. Did you forget to use "WithSigil(newLabel)" on the subclass?`);m=le(),ce(O,m,{isInheritanceCheck:true});}d.set(m,O.name);}zt(i);}function he(i,r){var S;let h=(S=r==null?void 0:r.labelValidation)!=null?S:ae.labelValidation;if(h){let d;if(h instanceof RegExp?d=h.test(i):d=h(i),process.env.NODE_ENV!=="production"&&!d)throw new Error(`[Sigil] Invalid identity label "${i}". Make sure that supplied label matches validation regex or function.`)}}function le(){return `@Sigil.auto-${Ge()}`}function je(i){Object.defineProperty(i,Ne,{value:true,configurable:false,enumerable:false,writable:false});}function qe(i){Object.defineProperty(i,Te,{value:true,configurable:false,enumerable:false,writable:false});}function Xt(i){Object.defineProperty(i,Be,{value:true,configurable:false,enumerable:false,writable:false});}function zt(i){Object.defineProperty(i,Ce,{value:true,configurable:false,enumerable:false,writable:false});}function ee(i){return typeof i=="function"&&i[Ne]===true}function K(i){if(!i||typeof i!="object")return  false;let r=T(i);return ee(r)}function St(i){return Object.hasOwn(i,Te)}function Wt(i){if(!i||typeof i!="object")return  false;let r=T(i);return St(r)}function Xe(i){return Object.hasOwn(i,Be)}function re(i){return Object.hasOwn(i,Ce)}function T(i){var r,h,S;return !i||typeof i!="object"?null:(S=(h=i.constructor)!=null?h:(r=Object.getPrototypeOf(i))==null?void 0:r.constructor)!=null?S:null}function Le(i,r,h){if(ee(i))throw new Error(`[Sigil Error] 'Sigilify(${r})' already sigilified.`);let S;r?(he(r,h),S=r):S=le();class d extends i{static get SigilLabel(){return re(this)||$(this),this[Q]}static get SigilEffectiveLabel(){return this[pe]}static get SigilLabelLineage(){var p;return re(this)||$(this),[...(p=this[H])!=null?p:[]]}static get SigilLabelSet(){re(this)||$(this);let p=new Set;for(let x of this[ie])p.add(x);return p}constructor(...p){super(...p),Object.getPrototypeOf(this)!==new.target.prototype&&Object.setPrototypeOf(this,new.target.prototype);let x=T(this);if(!x){if(process.env.NODE_ENV!=="production")throw new Error(`[Sigil Error] 'Sigilify(${r})' instance without constructor`);return}$(x);}static isSigilified(p){return K(p)}static isOfType(p){var m;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[ie],O=this[Q];return !!x&&x.has(O)}static isOfTypeStrict(p){var m;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[H],O=this[H];return !!x&&O.every((N,D)=>N===x[D])}isOfType(p){var m;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[ie],O=T(this)[Q];return !!x&&x.has(O)}isOfTypeStrict(p){var m,N;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[H],O=(N=T(this))==null?void 0:N[H];return !!x&&O.every((D,V)=>D===x[V])}getSigilLabel(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return "@Sigil.unknown"}return p.SigilLabel}getSigilEffectiveLabel(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return "@Sigil.unknown"}return p.SigilEffectiveLabel}getSigilLabelLineage(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return ["@Sigil.unknown"]}return p.SigilLabelLineage}getSigilLabelSet(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return new Set(["@Sigil.unknown"])}return p.SigilLabelSet}}return ce(d,S,{isMixin:true}),je(d),qe(d),d}function Kt(i,r,h){if(ee(i))throw new Error(`[Sigil Error] 'Sigilify(${r})' already sigilified.`);let S;r?(he(r,h),S=r):S=le();class d extends i{static get SigilLabel(){return re(this)||$(this),this[Q]}static get SigilEffectiveLabel(){return this[pe]}static get SigilLabelLineage(){var p;return re(this)||$(this),[...(p=this[H])!=null?p:[]]}static get SigilLabelSet(){re(this)||$(this);let p=new Set;for(let x of this[ie])p.add(x);return p}constructor(...p){super(...p),Object.getPrototypeOf(this)!==new.target.prototype&&Object.setPrototypeOf(this,new.target.prototype);let x=T(this);if(!x){if(process.env.NODE_ENV!=="production")throw new Error(`[Sigil Error] 'Sigilify(${r})' instance without constructor`);return}$(x);}static isSigilified(p){return K(p)}static isOfType(p){var m;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[ie],O=this[Q];return !!x&&x.has(O)}static isOfTypeStrict(p){var m;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[H],O=this[H];return !!x&&O.every((N,D)=>N===x[D])}isOfType(p){var m;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[ie],O=T(this)[Q];return !!x&&x.has(O)}isOfTypeStrict(p){var m,N;if(!K(p))return  false;let x=(m=T(p))==null?void 0:m[H],O=(N=T(this))==null?void 0:N[H];return !!x&&O.every((D,V)=>D===x[V])}getSigilLabel(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return "@Sigil.unknown"}return p.SigilLabel}getSigilEffectiveLabel(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return "@Sigil.unknown"}return p.SigilEffectiveLabel}getSigilLabelLineage(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return ["@Sigil.unknown"]}return p.SigilLabelLineage}getSigilLabelSet(){let p=T(this);if(!p){if(process.env.NODE_ENV!=="production")throw new Error("[Sigil Error] Sigil class instance without constructor");return new Set(["@Sigil.unknown"])}return p.SigilLabelSet}}return ce(d,S,{isMixin:true}),je(d),qe(d),d}var Yt=Le(class{},"Sigil"),Zt=Le(Error,"SigilError");function Jt(i,r){let h;return i?(he(i,r),h=i):h=le(),function(S,d){if(d.kind==="class"){if(!ee(S))throw new Error(`[Sigil Error] 'WithSigil' decorator accept only Sigil classes but used on class ${S.name}`);ce(S,h),$(S,r);}}}function Qt(i,r,h){var _;if(!ee(i))throw new Error(`[Sigil Error] 'withSigil' HOF accept only Sigil classes  but used on class ${(_=i==null?void 0:i.name)!=null?_:"unknown"}`);let S;r?(he(r,h),S=r):S=le();let d=i;return ce(d,S),$(d,h),i}/*! Bundled license information:
 
-  var __defProp = Object.defineProperty;
-  var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
-  var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
-
-  // src/core/options.ts
-  var OPTIONS = {
-    labelValidation: null,
-    skipLabelInheritanceCheck: false,
-    autofillLabels: true
-  };
-  var updateSigilOptions = (opts) => {
-    if ("autofillLabels" in opts) {
-      if (typeof opts.autofillLabels !== "boolean")
-        throw new Error("'updateSigilOptions.autofillLabels' must be boolean");
-      OPTIONS.autofillLabels = opts.autofillLabels;
-    }
-    if ("skipLabelInheritanceCheck" in opts) {
-      if (typeof opts.skipLabelInheritanceCheck !== "boolean")
-        throw new Error("'updateSigilOptions.skipLabelInheritanceCheck' must be boolean");
-      OPTIONS.skipLabelInheritanceCheck = opts.skipLabelInheritanceCheck;
-    }
-    if ("labelValidation" in opts) {
-      const val = opts.labelValidation;
-      if (val !== null && typeof val !== "function" && !(val instanceof RegExp))
-        throw new Error("'updateSigilOptions.labelValidation' must be null, function or RegExp");
-      OPTIONS.labelValidation = val != null ? val : null;
-    }
-  };
-  var DEFAULT_LABEL_REGEX = /^@[\w-]+(?:\/[\w-]+)*\.[A-Z][A-Za-z0-9]*$/;
-
-  // src/core/symbols.ts
-  var __SIGIL__ = /* @__PURE__ */ Symbol.for("@Sigil.__SIGIL__");
-  var __SIGIL_BASE__ = /* @__PURE__ */ Symbol.for("@Sigil.__SIGIL_BASE__");
-  var __DECORATED__ = /* @__PURE__ */ Symbol.for("@Sigil.__DECORATED__");
-  var __INHERITANCE_CHECKED__ = /* @__PURE__ */ Symbol.for("@Sigil.__INHERITANCE_CHECKED__");
-  var __LABEL__ = /* @__PURE__ */ Symbol.for("@Sigil.__LABEL__");
-  var __EFFECTIVE_LABEL__ = /* @__PURE__ */ Symbol.for("@Sigil.__EFFECTIVE_LABEL__");
-  var __LABEL_LINEAGE__ = /* @__PURE__ */ Symbol.for("@Sigil.__LABEL_LINEAGE__");
-  var __LABEL_SET__ = /* @__PURE__ */ Symbol.for("@Sigil.__LABEL_SET__");
-
-  // node_modules/@noble/hashes/_u64.js
-  var U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-  var _32n = /* @__PURE__ */ BigInt(32);
-  function fromBig(n, le = false) {
-    if (le)
-      return { h: Number(n & U32_MASK64), l: Number(n >> _32n & U32_MASK64) };
-    return { h: Number(n >> _32n & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
-  }
-  function split(lst, le = false) {
-    const len = lst.length;
-    let Ah = new Uint32Array(len);
-    let Al = new Uint32Array(len);
-    for (let i = 0; i < len; i++) {
-      const { h, l } = fromBig(lst[i], le);
-      [Ah[i], Al[i]] = [h, l];
-    }
-    return [Ah, Al];
-  }
-  var rotlSH = (h, l, s) => h << s | l >>> 32 - s;
-  var rotlSL = (h, l, s) => l << s | h >>> 32 - s;
-  var rotlBH = (h, l, s) => l << s - 32 | h >>> 64 - s;
-  var rotlBL = (h, l, s) => h << s - 32 | l >>> 64 - s;
-
-  // node_modules/@noble/hashes/utils.js
-  function isBytes(a) {
-    return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
-  }
-  function anumber(n, title = "") {
-    if (!Number.isSafeInteger(n) || n < 0) {
-      const prefix = title && `"${title}" `;
-      throw new Error(`${prefix}expected integer >= 0, got ${n}`);
-    }
-  }
-  function abytes(value, length, title = "") {
-    const bytes = isBytes(value);
-    const len = value == null ? void 0 : value.length;
-    const needsLen = length !== void 0;
-    if (!bytes || needsLen) {
-      const prefix = title && `"${title}" `;
-      const ofLen = "";
-      const got = bytes ? `length=${len}` : `type=${typeof value}`;
-      throw new Error(prefix + "expected Uint8Array" + ofLen + ", got " + got);
-    }
-    return value;
-  }
-  function aexists(instance, checkFinished = true) {
-    if (instance.destroyed)
-      throw new Error("Hash instance has been destroyed");
-    if (checkFinished && instance.finished)
-      throw new Error("Hash#digest() has already been called");
-  }
-  function aoutput(out, instance) {
-    abytes(out, void 0, "digestInto() output");
-    const min = instance.outputLen;
-    if (out.length < min) {
-      throw new Error('"digestInto() output" expected to be of length >=' + min);
-    }
-  }
-  function u32(arr) {
-    return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
-  }
-  function clean(...arrays) {
-    for (let i = 0; i < arrays.length; i++) {
-      arrays[i].fill(0);
-    }
-  }
-  var isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68)();
-  function byteSwap(word) {
-    return word << 24 & 4278190080 | word << 8 & 16711680 | word >>> 8 & 65280 | word >>> 24 & 255;
-  }
-  function byteSwap32(arr) {
-    for (let i = 0; i < arr.length; i++) {
-      arr[i] = byteSwap(arr[i]);
-    }
-    return arr;
-  }
-  var swap32IfBE = isLE ? (u) => u : byteSwap32;
-  function createHasher(hashCons, info = {}) {
-    const hashC = (msg, opts) => hashCons(opts).update(msg).digest();
-    const tmp = hashCons(void 0);
-    hashC.outputLen = tmp.outputLen;
-    hashC.blockLen = tmp.blockLen;
-    hashC.create = (opts) => hashCons(opts);
-    Object.assign(hashC, info);
-    return Object.freeze(hashC);
-  }
-  var oidNist = (suffix) => ({
-    oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, suffix])
-  });
-
-  // node_modules/@noble/hashes/sha3.js
-  var _0n = BigInt(0);
-  var _1n = BigInt(1);
-  var _2n = BigInt(2);
-  var _7n = BigInt(7);
-  var _256n = BigInt(256);
-  var _0x71n = BigInt(113);
-  var SHA3_PI = [];
-  var SHA3_ROTL = [];
-  var _SHA3_IOTA = [];
-  for (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {
-    [x, y] = [y, (2 * x + 3 * y) % 5];
-    SHA3_PI.push(2 * (5 * y + x));
-    SHA3_ROTL.push((round + 1) * (round + 2) / 2 % 64);
-    let t = _0n;
-    for (let j = 0; j < 7; j++) {
-      R = (R << _1n ^ (R >> _7n) * _0x71n) % _256n;
-      if (R & _2n)
-        t ^= _1n << (_1n << BigInt(j)) - _1n;
-    }
-    _SHA3_IOTA.push(t);
-  }
-  var IOTAS = split(_SHA3_IOTA, true);
-  var SHA3_IOTA_H = IOTAS[0];
-  var SHA3_IOTA_L = IOTAS[1];
-  var rotlH = (h, l, s) => s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s);
-  var rotlL = (h, l, s) => s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s);
-  function keccakP(s, rounds = 24) {
-    const B = new Uint32Array(5 * 2);
-    for (let round = 24 - rounds; round < 24; round++) {
-      for (let x = 0; x < 10; x++)
-        B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];
-      for (let x = 0; x < 10; x += 2) {
-        const idx1 = (x + 8) % 10;
-        const idx0 = (x + 2) % 10;
-        const B0 = B[idx0];
-        const B1 = B[idx0 + 1];
-        const Th = rotlH(B0, B1, 1) ^ B[idx1];
-        const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];
-        for (let y = 0; y < 50; y += 10) {
-          s[x + y] ^= Th;
-          s[x + y + 1] ^= Tl;
-        }
-      }
-      let curH = s[2];
-      let curL = s[3];
-      for (let t = 0; t < 24; t++) {
-        const shift = SHA3_ROTL[t];
-        const Th = rotlH(curH, curL, shift);
-        const Tl = rotlL(curH, curL, shift);
-        const PI = SHA3_PI[t];
-        curH = s[PI];
-        curL = s[PI + 1];
-        s[PI] = Th;
-        s[PI + 1] = Tl;
-      }
-      for (let y = 0; y < 50; y += 10) {
-        for (let x = 0; x < 10; x++)
-          B[x] = s[y + x];
-        for (let x = 0; x < 10; x++)
-          s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];
-      }
-      s[0] ^= SHA3_IOTA_H[round];
-      s[1] ^= SHA3_IOTA_L[round];
-    }
-    clean(B);
-  }
-  var Keccak = class _Keccak {
-    // NOTE: we accept arguments in bytes instead of bits here.
-    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {
-      __publicField(this, "state");
-      __publicField(this, "pos", 0);
-      __publicField(this, "posOut", 0);
-      __publicField(this, "finished", false);
-      __publicField(this, "state32");
-      __publicField(this, "destroyed", false);
-      __publicField(this, "blockLen");
-      __publicField(this, "suffix");
-      __publicField(this, "outputLen");
-      __publicField(this, "enableXOF", false);
-      __publicField(this, "rounds");
-      this.blockLen = blockLen;
-      this.suffix = suffix;
-      this.outputLen = outputLen;
-      this.enableXOF = enableXOF;
-      this.rounds = rounds;
-      anumber(outputLen, "outputLen");
-      if (!(0 < blockLen && blockLen < 200))
-        throw new Error("only keccak-f1600 function is supported");
-      this.state = new Uint8Array(200);
-      this.state32 = u32(this.state);
-    }
-    clone() {
-      return this._cloneInto();
-    }
-    keccak() {
-      swap32IfBE(this.state32);
-      keccakP(this.state32, this.rounds);
-      swap32IfBE(this.state32);
-      this.posOut = 0;
-      this.pos = 0;
-    }
-    update(data) {
-      aexists(this);
-      abytes(data);
-      const { blockLen, state } = this;
-      const len = data.length;
-      for (let pos = 0; pos < len; ) {
-        const take = Math.min(blockLen - this.pos, len - pos);
-        for (let i = 0; i < take; i++)
-          state[this.pos++] ^= data[pos++];
-        if (this.pos === blockLen)
-          this.keccak();
-      }
-      return this;
-    }
-    finish() {
-      if (this.finished)
-        return;
-      this.finished = true;
-      const { state, suffix, pos, blockLen } = this;
-      state[pos] ^= suffix;
-      if ((suffix & 128) !== 0 && pos === blockLen - 1)
-        this.keccak();
-      state[blockLen - 1] ^= 128;
-      this.keccak();
-    }
-    writeInto(out) {
-      aexists(this, false);
-      abytes(out);
-      this.finish();
-      const bufferOut = this.state;
-      const { blockLen } = this;
-      for (let pos = 0, len = out.length; pos < len; ) {
-        if (this.posOut >= blockLen)
-          this.keccak();
-        const take = Math.min(blockLen - this.posOut, len - pos);
-        out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);
-        this.posOut += take;
-        pos += take;
-      }
-      return out;
-    }
-    xofInto(out) {
-      if (!this.enableXOF)
-        throw new Error("XOF is not possible for this instance");
-      return this.writeInto(out);
-    }
-    xof(bytes) {
-      anumber(bytes);
-      return this.xofInto(new Uint8Array(bytes));
-    }
-    digestInto(out) {
-      aoutput(out, this);
-      if (this.finished)
-        throw new Error("digest() was already called");
-      this.writeInto(out);
-      this.destroy();
-      return out;
-    }
-    digest() {
-      return this.digestInto(new Uint8Array(this.outputLen));
-    }
-    destroy() {
-      this.destroyed = true;
-      clean(this.state);
-    }
-    _cloneInto(to) {
-      const { blockLen, suffix, outputLen, rounds, enableXOF } = this;
-      to || (to = new _Keccak(blockLen, suffix, outputLen, enableXOF, rounds));
-      to.state32.set(this.state32);
-      to.pos = this.pos;
-      to.posOut = this.posOut;
-      to.finished = this.finished;
-      to.rounds = rounds;
-      to.suffix = suffix;
-      to.outputLen = outputLen;
-      to.enableXOF = enableXOF;
-      to.destroyed = this.destroyed;
-      return to;
-    }
-  };
-  var genKeccak = (suffix, blockLen, outputLen, info = {}) => createHasher(() => new Keccak(blockLen, suffix, outputLen), info);
-  var sha3_512 = /* @__PURE__ */ genKeccak(
-    6,
-    72,
-    64,
-    /* @__PURE__ */ oidNist(10)
-  );
-
-  // node_modules/bignumber.js/bignumber.mjs
-  var isNumeric = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i;
-  var mathceil = Math.ceil;
-  var mathfloor = Math.floor;
-  var bignumberError = "[BigNumber Error] ";
-  var tooManyDigits = bignumberError + "Number primitive has more than 15 significant digits: ";
-  var BASE = 1e14;
-  var LOG_BASE = 14;
-  var MAX_SAFE_INTEGER = 9007199254740991;
-  var POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13];
-  var SQRT_BASE = 1e7;
-  var MAX = 1e9;
-  function clone(configObject) {
-    var div, convertBase, parseNumeric, P = BigNumber2.prototype = { constructor: BigNumber2, toString: null, valueOf: null }, ONE = new BigNumber2(1), DECIMAL_PLACES = 20, ROUNDING_MODE = 4, TO_EXP_NEG = -7, TO_EXP_POS = 21, MIN_EXP = -1e7, MAX_EXP = 1e7, CRYPTO = false, MODULO_MODE = 1, POW_PRECISION = 0, FORMAT = {
-      prefix: "",
-      groupSize: 3,
-      secondaryGroupSize: 0,
-      groupSeparator: ",",
-      decimalSeparator: ".",
-      fractionGroupSize: 0,
-      fractionGroupSeparator: "\xA0",
-      // non-breaking space
-      suffix: ""
-    }, ALPHABET = "0123456789abcdefghijklmnopqrstuvwxyz", alphabetHasNormalDecimalDigits = true;
-    function BigNumber2(v, b) {
-      var alphabet2, c, caseChanged, e, i, isNum, len, str, x = this;
-      if (!(x instanceof BigNumber2)) return new BigNumber2(v, b);
-      if (b == null) {
-        if (v && v._isBigNumber === true) {
-          x.s = v.s;
-          if (!v.c || v.e > MAX_EXP) {
-            x.c = x.e = null;
-          } else if (v.e < MIN_EXP) {
-            x.c = [x.e = 0];
-          } else {
-            x.e = v.e;
-            x.c = v.c.slice();
-          }
-          return;
-        }
-        if ((isNum = typeof v == "number") && v * 0 == 0) {
-          x.s = 1 / v < 0 ? (v = -v, -1) : 1;
-          if (v === ~~v) {
-            for (e = 0, i = v; i >= 10; i /= 10, e++) ;
-            if (e > MAX_EXP) {
-              x.c = x.e = null;
-            } else {
-              x.e = e;
-              x.c = [v];
-            }
-            return;
-          }
-          str = String(v);
-        } else {
-          if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);
-          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
-        }
-        if ((e = str.indexOf(".")) > -1) str = str.replace(".", "");
-        if ((i = str.search(/e/i)) > 0) {
-          if (e < 0) e = i;
-          e += +str.slice(i + 1);
-          str = str.substring(0, i);
-        } else if (e < 0) {
-          e = str.length;
-        }
-      } else {
-        intCheck(b, 2, ALPHABET.length, "Base");
-        if (b == 10 && alphabetHasNormalDecimalDigits) {
-          x = new BigNumber2(v);
-          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);
-        }
-        str = String(v);
-        if (isNum = typeof v == "number") {
-          if (v * 0 != 0) return parseNumeric(x, str, isNum, b);
-          x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;
-          if (BigNumber2.DEBUG && str.replace(/^0\.0*|\./, "").length > 15) {
-            throw Error(tooManyDigits + v);
-          }
-        } else {
-          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
-        }
-        alphabet2 = ALPHABET.slice(0, b);
-        e = i = 0;
-        for (len = str.length; i < len; i++) {
-          if (alphabet2.indexOf(c = str.charAt(i)) < 0) {
-            if (c == ".") {
-              if (i > e) {
-                e = len;
-                continue;
-              }
-            } else if (!caseChanged) {
-              if (str == str.toUpperCase() && (str = str.toLowerCase()) || str == str.toLowerCase() && (str = str.toUpperCase())) {
-                caseChanged = true;
-                i = -1;
-                e = 0;
-                continue;
-              }
-            }
-            return parseNumeric(x, String(v), isNum, b);
-          }
-        }
-        isNum = false;
-        str = convertBase(str, b, 10, x.s);
-        if ((e = str.indexOf(".")) > -1) str = str.replace(".", "");
-        else e = str.length;
-      }
-      for (i = 0; str.charCodeAt(i) === 48; i++) ;
-      for (len = str.length; str.charCodeAt(--len) === 48; ) ;
-      if (str = str.slice(i, ++len)) {
-        len -= i;
-        if (isNum && BigNumber2.DEBUG && len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {
-          throw Error(tooManyDigits + x.s * v);
-        }
-        if ((e = e - i - 1) > MAX_EXP) {
-          x.c = x.e = null;
-        } else if (e < MIN_EXP) {
-          x.c = [x.e = 0];
-        } else {
-          x.e = e;
-          x.c = [];
-          i = (e + 1) % LOG_BASE;
-          if (e < 0) i += LOG_BASE;
-          if (i < len) {
-            if (i) x.c.push(+str.slice(0, i));
-            for (len -= LOG_BASE; i < len; ) {
-              x.c.push(+str.slice(i, i += LOG_BASE));
-            }
-            i = LOG_BASE - (str = str.slice(i)).length;
-          } else {
-            i -= len;
-          }
-          for (; i--; str += "0") ;
-          x.c.push(+str);
-        }
-      } else {
-        x.c = [x.e = 0];
-      }
-    }
-    BigNumber2.clone = clone;
-    BigNumber2.ROUND_UP = 0;
-    BigNumber2.ROUND_DOWN = 1;
-    BigNumber2.ROUND_CEIL = 2;
-    BigNumber2.ROUND_FLOOR = 3;
-    BigNumber2.ROUND_HALF_UP = 4;
-    BigNumber2.ROUND_HALF_DOWN = 5;
-    BigNumber2.ROUND_HALF_EVEN = 6;
-    BigNumber2.ROUND_HALF_CEIL = 7;
-    BigNumber2.ROUND_HALF_FLOOR = 8;
-    BigNumber2.EUCLID = 9;
-    BigNumber2.config = BigNumber2.set = function(obj) {
-      var p, v;
-      if (obj != null) {
-        if (typeof obj == "object") {
-          if (obj.hasOwnProperty(p = "DECIMAL_PLACES")) {
-            v = obj[p];
-            intCheck(v, 0, MAX, p);
-            DECIMAL_PLACES = v;
-          }
-          if (obj.hasOwnProperty(p = "ROUNDING_MODE")) {
-            v = obj[p];
-            intCheck(v, 0, 8, p);
-            ROUNDING_MODE = v;
-          }
-          if (obj.hasOwnProperty(p = "EXPONENTIAL_AT")) {
-            v = obj[p];
-            if (v && v.pop) {
-              intCheck(v[0], -MAX, 0, p);
-              intCheck(v[1], 0, MAX, p);
-              TO_EXP_NEG = v[0];
-              TO_EXP_POS = v[1];
-            } else {
-              intCheck(v, -MAX, MAX, p);
-              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);
-            }
-          }
-          if (obj.hasOwnProperty(p = "RANGE")) {
-            v = obj[p];
-            if (v && v.pop) {
-              intCheck(v[0], -MAX, -1, p);
-              intCheck(v[1], 1, MAX, p);
-              MIN_EXP = v[0];
-              MAX_EXP = v[1];
-            } else {
-              intCheck(v, -MAX, MAX, p);
-              if (v) {
-                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);
-              } else {
-                throw Error(bignumberError + p + " cannot be zero: " + v);
-              }
-            }
-          }
-          if (obj.hasOwnProperty(p = "CRYPTO")) {
-            v = obj[p];
-            if (v === !!v) {
-              if (v) {
-                if (typeof crypto != "undefined" && crypto && (crypto.getRandomValues || crypto.randomBytes)) {
-                  CRYPTO = v;
-                } else {
-                  CRYPTO = !v;
-                  throw Error(bignumberError + "crypto unavailable");
-                }
-              } else {
-                CRYPTO = v;
-              }
-            } else {
-              throw Error(bignumberError + p + " not true or false: " + v);
-            }
-          }
-          if (obj.hasOwnProperty(p = "MODULO_MODE")) {
-            v = obj[p];
-            intCheck(v, 0, 9, p);
-            MODULO_MODE = v;
-          }
-          if (obj.hasOwnProperty(p = "POW_PRECISION")) {
-            v = obj[p];
-            intCheck(v, 0, MAX, p);
-            POW_PRECISION = v;
-          }
-          if (obj.hasOwnProperty(p = "FORMAT")) {
-            v = obj[p];
-            if (typeof v == "object") FORMAT = v;
-            else throw Error(bignumberError + p + " not an object: " + v);
-          }
-          if (obj.hasOwnProperty(p = "ALPHABET")) {
-            v = obj[p];
-            if (typeof v == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(v)) {
-              alphabetHasNormalDecimalDigits = v.slice(0, 10) == "0123456789";
-              ALPHABET = v;
-            } else {
-              throw Error(bignumberError + p + " invalid: " + v);
-            }
-          }
-        } else {
-          throw Error(bignumberError + "Object expected: " + obj);
-        }
-      }
-      return {
-        DECIMAL_PLACES,
-        ROUNDING_MODE,
-        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],
-        RANGE: [MIN_EXP, MAX_EXP],
-        CRYPTO,
-        MODULO_MODE,
-        POW_PRECISION,
-        FORMAT,
-        ALPHABET
-      };
-    };
-    BigNumber2.isBigNumber = function(v) {
-      if (!v || v._isBigNumber !== true) return false;
-      if (!BigNumber2.DEBUG) return true;
-      var i, n, c = v.c, e = v.e, s = v.s;
-      out: if ({}.toString.call(c) == "[object Array]") {
-        if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {
-          if (c[0] === 0) {
-            if (e === 0 && c.length === 1) return true;
-            break out;
-          }
-          i = (e + 1) % LOG_BASE;
-          if (i < 1) i += LOG_BASE;
-          if (String(c[0]).length == i) {
-            for (i = 0; i < c.length; i++) {
-              n = c[i];
-              if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;
-            }
-            if (n !== 0) return true;
-          }
-        }
-      } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {
-        return true;
-      }
-      throw Error(bignumberError + "Invalid BigNumber: " + v);
-    };
-    BigNumber2.maximum = BigNumber2.max = function() {
-      return maxOrMin(arguments, -1);
-    };
-    BigNumber2.minimum = BigNumber2.min = function() {
-      return maxOrMin(arguments, 1);
-    };
-    BigNumber2.random = (function() {
-      var pow2_53 = 9007199254740992;
-      var random53bitInt = Math.random() * pow2_53 & 2097151 ? function() {
-        return mathfloor(Math.random() * pow2_53);
-      } : function() {
-        return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
-      };
-      return function(dp) {
-        var a, b, e, k, v, i = 0, c = [], rand = new BigNumber2(ONE);
-        if (dp == null) dp = DECIMAL_PLACES;
-        else intCheck(dp, 0, MAX);
-        k = mathceil(dp / LOG_BASE);
-        if (CRYPTO) {
-          if (crypto.getRandomValues) {
-            a = crypto.getRandomValues(new Uint32Array(k *= 2));
-            for (; i < k; ) {
-              v = a[i] * 131072 + (a[i + 1] >>> 11);
-              if (v >= 9e15) {
-                b = crypto.getRandomValues(new Uint32Array(2));
-                a[i] = b[0];
-                a[i + 1] = b[1];
-              } else {
-                c.push(v % 1e14);
-                i += 2;
-              }
-            }
-            i = k / 2;
-          } else if (crypto.randomBytes) {
-            a = crypto.randomBytes(k *= 7);
-            for (; i < k; ) {
-              v = (a[i] & 31) * 281474976710656 + a[i + 1] * 1099511627776 + a[i + 2] * 4294967296 + a[i + 3] * 16777216 + (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];
-              if (v >= 9e15) {
-                crypto.randomBytes(7).copy(a, i);
-              } else {
-                c.push(v % 1e14);
-                i += 7;
-              }
-            }
-            i = k / 7;
-          } else {
-            CRYPTO = false;
-            throw Error(bignumberError + "crypto unavailable");
-          }
-        }
-        if (!CRYPTO) {
-          for (; i < k; ) {
-            v = random53bitInt();
-            if (v < 9e15) c[i++] = v % 1e14;
-          }
-        }
-        k = c[--i];
-        dp %= LOG_BASE;
-        if (k && dp) {
-          v = POWS_TEN[LOG_BASE - dp];
-          c[i] = mathfloor(k / v) * v;
-        }
-        for (; c[i] === 0; c.pop(), i--) ;
-        if (i < 0) {
-          c = [e = 0];
-        } else {
-          for (e = -1; c[0] === 0; c.splice(0, 1), e -= LOG_BASE) ;
-          for (i = 1, v = c[0]; v >= 10; v /= 10, i++) ;
-          if (i < LOG_BASE) e -= LOG_BASE - i;
-        }
-        rand.e = e;
-        rand.c = c;
-        return rand;
-      };
-    })();
-    BigNumber2.sum = function() {
-      var i = 1, args = arguments, sum = new BigNumber2(args[0]);
-      for (; i < args.length; ) sum = sum.plus(args[i++]);
-      return sum;
-    };
-    convertBase = /* @__PURE__ */ (function() {
-      var decimal = "0123456789";
-      function toBaseOut(str, baseIn, baseOut, alphabet2) {
-        var j, arr = [0], arrL, i = 0, len = str.length;
-        for (; i < len; ) {
-          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn) ;
-          arr[0] += alphabet2.indexOf(str.charAt(i++));
-          for (j = 0; j < arr.length; j++) {
-            if (arr[j] > baseOut - 1) {
-              if (arr[j + 1] == null) arr[j + 1] = 0;
-              arr[j + 1] += arr[j] / baseOut | 0;
-              arr[j] %= baseOut;
-            }
-          }
-        }
-        return arr.reverse();
-      }
-      return function(str, baseIn, baseOut, sign, callerIsToString) {
-        var alphabet2, d, e, k, r, x, xc, y, i = str.indexOf("."), dp = DECIMAL_PLACES, rm = ROUNDING_MODE;
-        if (i >= 0) {
-          k = POW_PRECISION;
-          POW_PRECISION = 0;
-          str = str.replace(".", "");
-          y = new BigNumber2(baseIn);
-          x = y.pow(str.length - i);
-          POW_PRECISION = k;
-          y.c = toBaseOut(
-            toFixedPoint(coeffToString(x.c), x.e, "0"),
-            10,
-            baseOut,
-            decimal
-          );
-          y.e = y.c.length;
-        }
-        xc = toBaseOut(str, baseIn, baseOut, callerIsToString ? (alphabet2 = ALPHABET, decimal) : (alphabet2 = decimal, ALPHABET));
-        e = k = xc.length;
-        for (; xc[--k] == 0; xc.pop()) ;
-        if (!xc[0]) return alphabet2.charAt(0);
-        if (i < 0) {
-          --e;
-        } else {
-          x.c = xc;
-          x.e = e;
-          x.s = sign;
-          x = div(x, y, dp, rm, baseOut);
-          xc = x.c;
-          r = x.r;
-          e = x.e;
-        }
-        d = e + dp + 1;
-        i = xc[d];
-        k = baseOut / 2;
-        r = r || d < 0 || xc[d + 1] != null;
-        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) : i > k || i == k && (rm == 4 || r || rm == 6 && xc[d - 1] & 1 || rm == (x.s < 0 ? 8 : 7));
-        if (d < 1 || !xc[0]) {
-          str = r ? toFixedPoint(alphabet2.charAt(1), -dp, alphabet2.charAt(0)) : alphabet2.charAt(0);
-        } else {
-          xc.length = d;
-          if (r) {
-            for (--baseOut; ++xc[--d] > baseOut; ) {
-              xc[d] = 0;
-              if (!d) {
-                ++e;
-                xc = [1].concat(xc);
-              }
-            }
-          }
-          for (k = xc.length; !xc[--k]; ) ;
-          for (i = 0, str = ""; i <= k; str += alphabet2.charAt(xc[i++])) ;
-          str = toFixedPoint(str, e, alphabet2.charAt(0));
-        }
-        return str;
-      };
-    })();
-    div = /* @__PURE__ */ (function() {
-      function multiply(x, k, base) {
-        var m, temp, xlo, xhi, carry = 0, i = x.length, klo = k % SQRT_BASE, khi = k / SQRT_BASE | 0;
-        for (x = x.slice(); i--; ) {
-          xlo = x[i] % SQRT_BASE;
-          xhi = x[i] / SQRT_BASE | 0;
-          m = khi * xlo + xhi * klo;
-          temp = klo * xlo + m % SQRT_BASE * SQRT_BASE + carry;
-          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;
-          x[i] = temp % base;
-        }
-        if (carry) x = [carry].concat(x);
-        return x;
-      }
-      function compare2(a, b, aL, bL) {
-        var i, cmp;
-        if (aL != bL) {
-          cmp = aL > bL ? 1 : -1;
-        } else {
-          for (i = cmp = 0; i < aL; i++) {
-            if (a[i] != b[i]) {
-              cmp = a[i] > b[i] ? 1 : -1;
-              break;
-            }
-          }
-        }
-        return cmp;
-      }
-      function subtract(a, b, aL, base) {
-        var i = 0;
-        for (; aL--; ) {
-          a[aL] -= i;
-          i = a[aL] < b[aL] ? 1 : 0;
-          a[aL] = i * base + a[aL] - b[aL];
-        }
-        for (; !a[0] && a.length > 1; a.splice(0, 1)) ;
-      }
-      return function(x, y, dp, rm, base) {
-        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0, yL, yz, s = x.s == y.s ? 1 : -1, xc = x.c, yc = y.c;
-        if (!xc || !xc[0] || !yc || !yc[0]) {
-          return new BigNumber2(
-            // Return NaN if either NaN, or both Infinity or 0.
-            !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN : (
-              // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
-              xc && xc[0] == 0 || !yc ? s * 0 : s / 0
-            )
-          );
-        }
-        q = new BigNumber2(s);
-        qc = q.c = [];
-        e = x.e - y.e;
-        s = dp + e + 1;
-        if (!base) {
-          base = BASE;
-          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);
-          s = s / LOG_BASE | 0;
-        }
-        for (i = 0; yc[i] == (xc[i] || 0); i++) ;
-        if (yc[i] > (xc[i] || 0)) e--;
-        if (s < 0) {
-          qc.push(1);
-          more = true;
-        } else {
-          xL = xc.length;
-          yL = yc.length;
-          i = 0;
-          s += 2;
-          n = mathfloor(base / (yc[0] + 1));
-          if (n > 1) {
-            yc = multiply(yc, n, base);
-            xc = multiply(xc, n, base);
-            yL = yc.length;
-            xL = xc.length;
-          }
-          xi = yL;
-          rem = xc.slice(0, yL);
-          remL = rem.length;
-          for (; remL < yL; rem[remL++] = 0) ;
-          yz = yc.slice();
-          yz = [0].concat(yz);
-          yc0 = yc[0];
-          if (yc[1] >= base / 2) yc0++;
-          do {
-            n = 0;
-            cmp = compare2(yc, rem, yL, remL);
-            if (cmp < 0) {
-              rem0 = rem[0];
-              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
-              n = mathfloor(rem0 / yc0);
-              if (n > 1) {
-                if (n >= base) n = base - 1;
-                prod = multiply(yc, n, base);
-                prodL = prod.length;
-                remL = rem.length;
-                while (compare2(prod, rem, prodL, remL) == 1) {
-                  n--;
-                  subtract(prod, yL < prodL ? yz : yc, prodL, base);
-                  prodL = prod.length;
-                  cmp = 1;
-                }
-              } else {
-                if (n == 0) {
-                  cmp = n = 1;
-                }
-                prod = yc.slice();
-                prodL = prod.length;
-              }
-              if (prodL < remL) prod = [0].concat(prod);
-              subtract(rem, prod, remL, base);
-              remL = rem.length;
-              if (cmp == -1) {
-                while (compare2(yc, rem, yL, remL) < 1) {
-                  n++;
-                  subtract(rem, yL < remL ? yz : yc, remL, base);
-                  remL = rem.length;
-                }
-              }
-            } else if (cmp === 0) {
-              n++;
-              rem = [0];
-            }
-            qc[i++] = n;
-            if (rem[0]) {
-              rem[remL++] = xc[xi] || 0;
-            } else {
-              rem = [xc[xi]];
-              remL = 1;
-            }
-          } while ((xi++ < xL || rem[0] != null) && s--);
-          more = rem[0] != null;
-          if (!qc[0]) qc.splice(0, 1);
-        }
-        if (base == BASE) {
-          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++) ;
-          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);
-        } else {
-          q.e = e;
-          q.r = +more;
-        }
-        return q;
-      };
-    })();
-    function format(n, i, rm, id) {
-      var c0, e, ne, len, str;
-      if (rm == null) rm = ROUNDING_MODE;
-      else intCheck(rm, 0, 8);
-      if (!n.c) return n.toString();
-      c0 = n.c[0];
-      ne = n.e;
-      if (i == null) {
-        str = coeffToString(n.c);
-        str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS) ? toExponential(str, ne) : toFixedPoint(str, ne, "0");
-      } else {
-        n = round(new BigNumber2(n), i, rm);
-        e = n.e;
-        str = coeffToString(n.c);
-        len = str.length;
-        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {
-          for (; len < i; str += "0", len++) ;
-          str = toExponential(str, e);
-        } else {
-          i -= ne + (id === 2 && e > ne);
-          str = toFixedPoint(str, e, "0");
-          if (e + 1 > len) {
-            if (--i > 0) for (str += "."; i--; str += "0") ;
-          } else {
-            i += e - len;
-            if (i > 0) {
-              if (e + 1 == len) str += ".";
-              for (; i--; str += "0") ;
-            }
-          }
-        }
-      }
-      return n.s < 0 && c0 ? "-" + str : str;
-    }
-    function maxOrMin(args, n) {
-      var k, y, i = 1, x = new BigNumber2(args[0]);
-      for (; i < args.length; i++) {
-        y = new BigNumber2(args[i]);
-        if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {
-          x = y;
-        }
-      }
-      return x;
-    }
-    function normalise(n, c, e) {
-      var i = 1, j = c.length;
-      for (; !c[--j]; c.pop()) ;
-      for (j = c[0]; j >= 10; j /= 10, i++) ;
-      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {
-        n.c = n.e = null;
-      } else if (e < MIN_EXP) {
-        n.c = [n.e = 0];
-      } else {
-        n.e = e;
-        n.c = c;
-      }
-      return n;
-    }
-    parseNumeric = /* @__PURE__ */ (function() {
-      var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i, dotAfter = /^([^.]+)\.$/, dotBefore = /^\.([^.]+)$/, isInfinityOrNaN = /^-?(Infinity|NaN)$/, whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-      return function(x, str, isNum, b) {
-        var base, s = isNum ? str : str.replace(whitespaceOrPlus, "");
-        if (isInfinityOrNaN.test(s)) {
-          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;
-        } else {
-          if (!isNum) {
-            s = s.replace(basePrefix, function(m, p1, p2) {
-              base = (p2 = p2.toLowerCase()) == "x" ? 16 : p2 == "b" ? 2 : 8;
-              return !b || b == base ? p1 : m;
-            });
-            if (b) {
-              base = b;
-              s = s.replace(dotAfter, "$1").replace(dotBefore, "0.$1");
-            }
-            if (str != s) return new BigNumber2(s, base);
-          }
-          if (BigNumber2.DEBUG) {
-            throw Error(bignumberError + "Not a" + (b ? " base " + b : "") + " number: " + str);
-          }
-          x.s = null;
-        }
-        x.c = x.e = null;
-      };
-    })();
-    function round(x, sd, rm, r) {
-      var d, i, j, k, n, ni, rd, xc = x.c, pows10 = POWS_TEN;
-      if (xc) {
-        out: {
-          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++) ;
-          i = sd - d;
-          if (i < 0) {
-            i += LOG_BASE;
-            j = sd;
-            n = xc[ni = 0];
-            rd = mathfloor(n / pows10[d - j - 1] % 10);
-          } else {
-            ni = mathceil((i + 1) / LOG_BASE);
-            if (ni >= xc.length) {
-              if (r) {
-                for (; xc.length <= ni; xc.push(0)) ;
-                n = rd = 0;
-                d = 1;
-                i %= LOG_BASE;
-                j = i - LOG_BASE + 1;
-              } else {
-                break out;
-              }
-            } else {
-              n = k = xc[ni];
-              for (d = 1; k >= 10; k /= 10, d++) ;
-              i %= LOG_BASE;
-              j = i - LOG_BASE + d;
-              rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);
-            }
-          }
-          r = r || sd < 0 || // Are there any non-zero digits after the rounding digit?
-          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right
-          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
-          xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);
-          r = rm < 4 ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 && // Check whether the digit to the left of the rounding digit is odd.
-          (i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10 & 1 || rm == (x.s < 0 ? 8 : 7));
-          if (sd < 1 || !xc[0]) {
-            xc.length = 0;
-            if (r) {
-              sd -= x.e + 1;
-              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];
-              x.e = -sd || 0;
-            } else {
-              xc[0] = x.e = 0;
-            }
-            return x;
-          }
-          if (i == 0) {
-            xc.length = ni;
-            k = 1;
-            ni--;
-          } else {
-            xc.length = ni + 1;
-            k = pows10[LOG_BASE - i];
-            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;
-          }
-          if (r) {
-            for (; ; ) {
-              if (ni == 0) {
-                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++) ;
-                j = xc[0] += k;
-                for (k = 1; j >= 10; j /= 10, k++) ;
-                if (i != k) {
-                  x.e++;
-                  if (xc[0] == BASE) xc[0] = 1;
-                }
-                break;
-              } else {
-                xc[ni] += k;
-                if (xc[ni] != BASE) break;
-                xc[ni--] = 0;
-                k = 1;
-              }
-            }
-          }
-          for (i = xc.length; xc[--i] === 0; xc.pop()) ;
-        }
-        if (x.e > MAX_EXP) {
-          x.c = x.e = null;
-        } else if (x.e < MIN_EXP) {
-          x.c = [x.e = 0];
-        }
-      }
-      return x;
-    }
-    function valueOf(n) {
-      var str, e = n.e;
-      if (e === null) return n.toString();
-      str = coeffToString(n.c);
-      str = e <= TO_EXP_NEG || e >= TO_EXP_POS ? toExponential(str, e) : toFixedPoint(str, e, "0");
-      return n.s < 0 ? "-" + str : str;
-    }
-    P.absoluteValue = P.abs = function() {
-      var x = new BigNumber2(this);
-      if (x.s < 0) x.s = 1;
-      return x;
-    };
-    P.comparedTo = function(y, b) {
-      return compare(this, new BigNumber2(y, b));
-    };
-    P.decimalPlaces = P.dp = function(dp, rm) {
-      var c, n, v, x = this;
-      if (dp != null) {
-        intCheck(dp, 0, MAX);
-        if (rm == null) rm = ROUNDING_MODE;
-        else intCheck(rm, 0, 8);
-        return round(new BigNumber2(x), dp + x.e + 1, rm);
-      }
-      if (!(c = x.c)) return null;
-      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;
-      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--) ;
-      if (n < 0) n = 0;
-      return n;
-    };
-    P.dividedBy = P.div = function(y, b) {
-      return div(this, new BigNumber2(y, b), DECIMAL_PLACES, ROUNDING_MODE);
-    };
-    P.dividedToIntegerBy = P.idiv = function(y, b) {
-      return div(this, new BigNumber2(y, b), 0, 1);
-    };
-    P.exponentiatedBy = P.pow = function(n, m) {
-      var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y, x = this;
-      n = new BigNumber2(n);
-      if (n.c && !n.isInteger()) {
-        throw Error(bignumberError + "Exponent not an integer: " + valueOf(n));
-      }
-      if (m != null) m = new BigNumber2(m);
-      nIsBig = n.e > 14;
-      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {
-        y = new BigNumber2(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));
-        return m ? y.mod(m) : y;
-      }
-      nIsNeg = n.s < 0;
-      if (m) {
-        if (m.c ? !m.c[0] : !m.s) return new BigNumber2(NaN);
-        isModExp = !nIsNeg && x.isInteger() && m.isInteger();
-        if (isModExp) x = x.mod(m);
-      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0 ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7 : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {
-        k = x.s < 0 && isOdd(n) ? -0 : 0;
-        if (x.e > -1) k = 1 / k;
-        return new BigNumber2(nIsNeg ? 1 / k : k);
-      } else if (POW_PRECISION) {
-        k = mathceil(POW_PRECISION / LOG_BASE + 2);
-      }
-      if (nIsBig) {
-        half = new BigNumber2(0.5);
-        if (nIsNeg) n.s = 1;
-        nIsOdd = isOdd(n);
-      } else {
-        i = Math.abs(+valueOf(n));
-        nIsOdd = i % 2;
-      }
-      y = new BigNumber2(ONE);
-      for (; ; ) {
-        if (nIsOdd) {
-          y = y.times(x);
-          if (!y.c) break;
-          if (k) {
-            if (y.c.length > k) y.c.length = k;
-          } else if (isModExp) {
-            y = y.mod(m);
-          }
-        }
-        if (i) {
-          i = mathfloor(i / 2);
-          if (i === 0) break;
-          nIsOdd = i % 2;
-        } else {
-          n = n.times(half);
-          round(n, n.e + 1, 1);
-          if (n.e > 14) {
-            nIsOdd = isOdd(n);
-          } else {
-            i = +valueOf(n);
-            if (i === 0) break;
-            nIsOdd = i % 2;
-          }
-        }
-        x = x.times(x);
-        if (k) {
-          if (x.c && x.c.length > k) x.c.length = k;
-        } else if (isModExp) {
-          x = x.mod(m);
-        }
-      }
-      if (isModExp) return y;
-      if (nIsNeg) y = ONE.div(y);
-      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;
-    };
-    P.integerValue = function(rm) {
-      var n = new BigNumber2(this);
-      if (rm == null) rm = ROUNDING_MODE;
-      else intCheck(rm, 0, 8);
-      return round(n, n.e + 1, rm);
-    };
-    P.isEqualTo = P.eq = function(y, b) {
-      return compare(this, new BigNumber2(y, b)) === 0;
-    };
-    P.isFinite = function() {
-      return !!this.c;
-    };
-    P.isGreaterThan = P.gt = function(y, b) {
-      return compare(this, new BigNumber2(y, b)) > 0;
-    };
-    P.isGreaterThanOrEqualTo = P.gte = function(y, b) {
-      return (b = compare(this, new BigNumber2(y, b))) === 1 || b === 0;
-    };
-    P.isInteger = function() {
-      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;
-    };
-    P.isLessThan = P.lt = function(y, b) {
-      return compare(this, new BigNumber2(y, b)) < 0;
-    };
-    P.isLessThanOrEqualTo = P.lte = function(y, b) {
-      return (b = compare(this, new BigNumber2(y, b))) === -1 || b === 0;
-    };
-    P.isNaN = function() {
-      return !this.s;
-    };
-    P.isNegative = function() {
-      return this.s < 0;
-    };
-    P.isPositive = function() {
-      return this.s > 0;
-    };
-    P.isZero = function() {
-      return !!this.c && this.c[0] == 0;
-    };
-    P.minus = function(y, b) {
-      var i, j, t, xLTy, x = this, a = x.s;
-      y = new BigNumber2(y, b);
-      b = y.s;
-      if (!a || !b) return new BigNumber2(NaN);
-      if (a != b) {
-        y.s = -b;
-        return x.plus(y);
-      }
-      var xe = x.e / LOG_BASE, ye = y.e / LOG_BASE, xc = x.c, yc = y.c;
-      if (!xe || !ye) {
-        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber2(yc ? x : NaN);
-        if (!xc[0] || !yc[0]) {
-          return yc[0] ? (y.s = -b, y) : new BigNumber2(xc[0] ? x : (
-            // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
-            ROUNDING_MODE == 3 ? -0 : 0
-          ));
-        }
-      }
-      xe = bitFloor(xe);
-      ye = bitFloor(ye);
-      xc = xc.slice();
-      if (a = xe - ye) {
-        if (xLTy = a < 0) {
-          a = -a;
-          t = xc;
-        } else {
-          ye = xe;
-          t = yc;
-        }
-        t.reverse();
-        for (b = a; b--; t.push(0)) ;
-        t.reverse();
-      } else {
-        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;
-        for (a = b = 0; b < j; b++) {
-          if (xc[b] != yc[b]) {
-            xLTy = xc[b] < yc[b];
-            break;
-          }
-        }
-      }
-      if (xLTy) {
-        t = xc;
-        xc = yc;
-        yc = t;
-        y.s = -y.s;
-      }
-      b = (j = yc.length) - (i = xc.length);
-      if (b > 0) for (; b--; xc[i++] = 0) ;
-      b = BASE - 1;
-      for (; j > a; ) {
-        if (xc[--j] < yc[j]) {
-          for (i = j; i && !xc[--i]; xc[i] = b) ;
-          --xc[i];
-          xc[j] += BASE;
-        }
-        xc[j] -= yc[j];
-      }
-      for (; xc[0] == 0; xc.splice(0, 1), --ye) ;
-      if (!xc[0]) {
-        y.s = ROUNDING_MODE == 3 ? -1 : 1;
-        y.c = [y.e = 0];
-        return y;
-      }
-      return normalise(y, xc, ye);
-    };
-    P.modulo = P.mod = function(y, b) {
-      var q, s, x = this;
-      y = new BigNumber2(y, b);
-      if (!x.c || !y.s || y.c && !y.c[0]) {
-        return new BigNumber2(NaN);
-      } else if (!y.c || x.c && !x.c[0]) {
-        return new BigNumber2(x);
-      }
-      if (MODULO_MODE == 9) {
-        s = y.s;
-        y.s = 1;
-        q = div(x, y, 0, 3);
-        y.s = s;
-        q.s *= s;
-      } else {
-        q = div(x, y, 0, MODULO_MODE);
-      }
-      y = x.minus(q.times(y));
-      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;
-      return y;
-    };
-    P.multipliedBy = P.times = function(y, b) {
-      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc, base, sqrtBase, x = this, xc = x.c, yc = (y = new BigNumber2(y, b)).c;
-      if (!xc || !yc || !xc[0] || !yc[0]) {
-        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {
-          y.c = y.e = y.s = null;
-        } else {
-          y.s *= x.s;
-          if (!xc || !yc) {
-            y.c = y.e = null;
-          } else {
-            y.c = [0];
-            y.e = 0;
-          }
-        }
-        return y;
-      }
-      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);
-      y.s *= x.s;
-      xcL = xc.length;
-      ycL = yc.length;
-      if (xcL < ycL) {
-        zc = xc;
-        xc = yc;
-        yc = zc;
-        i = xcL;
-        xcL = ycL;
-        ycL = i;
-      }
-      for (i = xcL + ycL, zc = []; i--; zc.push(0)) ;
-      base = BASE;
-      sqrtBase = SQRT_BASE;
-      for (i = ycL; --i >= 0; ) {
-        c = 0;
-        ylo = yc[i] % sqrtBase;
-        yhi = yc[i] / sqrtBase | 0;
-        for (k = xcL, j = i + k; j > i; ) {
-          xlo = xc[--k] % sqrtBase;
-          xhi = xc[k] / sqrtBase | 0;
-          m = yhi * xlo + xhi * ylo;
-          xlo = ylo * xlo + m % sqrtBase * sqrtBase + zc[j] + c;
-          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;
-          zc[j--] = xlo % base;
-        }
-        zc[j] = c;
-      }
-      if (c) {
-        ++e;
-      } else {
-        zc.splice(0, 1);
-      }
-      return normalise(y, zc, e);
-    };
-    P.negated = function() {
-      var x = new BigNumber2(this);
-      x.s = -x.s || null;
-      return x;
-    };
-    P.plus = function(y, b) {
-      var t, x = this, a = x.s;
-      y = new BigNumber2(y, b);
-      b = y.s;
-      if (!a || !b) return new BigNumber2(NaN);
-      if (a != b) {
-        y.s = -b;
-        return x.minus(y);
-      }
-      var xe = x.e / LOG_BASE, ye = y.e / LOG_BASE, xc = x.c, yc = y.c;
-      if (!xe || !ye) {
-        if (!xc || !yc) return new BigNumber2(a / 0);
-        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber2(xc[0] ? x : a * 0);
-      }
-      xe = bitFloor(xe);
-      ye = bitFloor(ye);
-      xc = xc.slice();
-      if (a = xe - ye) {
-        if (a > 0) {
-          ye = xe;
-          t = yc;
-        } else {
-          a = -a;
-          t = xc;
-        }
-        t.reverse();
-        for (; a--; t.push(0)) ;
-        t.reverse();
-      }
-      a = xc.length;
-      b = yc.length;
-      if (a - b < 0) {
-        t = yc;
-        yc = xc;
-        xc = t;
-        b = a;
-      }
-      for (a = 0; b; ) {
-        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;
-        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;
-      }
-      if (a) {
-        xc = [a].concat(xc);
-        ++ye;
-      }
-      return normalise(y, xc, ye);
-    };
-    P.precision = P.sd = function(sd, rm) {
-      var c, n, v, x = this;
-      if (sd != null && sd !== !!sd) {
-        intCheck(sd, 1, MAX);
-        if (rm == null) rm = ROUNDING_MODE;
-        else intCheck(rm, 0, 8);
-        return round(new BigNumber2(x), sd, rm);
-      }
-      if (!(c = x.c)) return null;
-      v = c.length - 1;
-      n = v * LOG_BASE + 1;
-      if (v = c[v]) {
-        for (; v % 10 == 0; v /= 10, n--) ;
-        for (v = c[0]; v >= 10; v /= 10, n++) ;
-      }
-      if (sd && x.e + 1 > n) n = x.e + 1;
-      return n;
-    };
-    P.shiftedBy = function(k) {
-      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);
-      return this.times("1e" + k);
-    };
-    P.squareRoot = P.sqrt = function() {
-      var m, n, r, rep, t, x = this, c = x.c, s = x.s, e = x.e, dp = DECIMAL_PLACES + 4, half = new BigNumber2("0.5");
-      if (s !== 1 || !c || !c[0]) {
-        return new BigNumber2(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);
-      }
-      s = Math.sqrt(+valueOf(x));
-      if (s == 0 || s == 1 / 0) {
-        n = coeffToString(c);
-        if ((n.length + e) % 2 == 0) n += "0";
-        s = Math.sqrt(+n);
-        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);
-        if (s == 1 / 0) {
-          n = "5e" + e;
-        } else {
-          n = s.toExponential();
-          n = n.slice(0, n.indexOf("e") + 1) + e;
-        }
-        r = new BigNumber2(n);
-      } else {
-        r = new BigNumber2(s + "");
-      }
-      if (r.c[0]) {
-        e = r.e;
-        s = e + dp;
-        if (s < 3) s = 0;
-        for (; ; ) {
-          t = r;
-          r = half.times(t.plus(div(x, t, dp, 1)));
-          if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {
-            if (r.e < e) --s;
-            n = n.slice(s - 3, s + 1);
-            if (n == "9999" || !rep && n == "4999") {
-              if (!rep) {
-                round(t, t.e + DECIMAL_PLACES + 2, 0);
-                if (t.times(t).eq(x)) {
-                  r = t;
-                  break;
-                }
-              }
-              dp += 4;
-              s += 4;
-              rep = 1;
-            } else {
-              if (!+n || !+n.slice(1) && n.charAt(0) == "5") {
-                round(r, r.e + DECIMAL_PLACES + 2, 1);
-                m = !r.times(r).eq(x);
-              }
-              break;
-            }
-          }
-        }
-      }
-      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);
-    };
-    P.toExponential = function(dp, rm) {
-      if (dp != null) {
-        intCheck(dp, 0, MAX);
-        dp++;
-      }
-      return format(this, dp, rm, 1);
-    };
-    P.toFixed = function(dp, rm) {
-      if (dp != null) {
-        intCheck(dp, 0, MAX);
-        dp = dp + this.e + 1;
-      }
-      return format(this, dp, rm);
-    };
-    P.toFormat = function(dp, rm, format2) {
-      var str, x = this;
-      if (format2 == null) {
-        if (dp != null && rm && typeof rm == "object") {
-          format2 = rm;
-          rm = null;
-        } else if (dp && typeof dp == "object") {
-          format2 = dp;
-          dp = rm = null;
-        } else {
-          format2 = FORMAT;
-        }
-      } else if (typeof format2 != "object") {
-        throw Error(bignumberError + "Argument not an object: " + format2);
-      }
-      str = x.toFixed(dp, rm);
-      if (x.c) {
-        var i, arr = str.split("."), g1 = +format2.groupSize, g2 = +format2.secondaryGroupSize, groupSeparator = format2.groupSeparator || "", intPart = arr[0], fractionPart = arr[1], isNeg = x.s < 0, intDigits = isNeg ? intPart.slice(1) : intPart, len = intDigits.length;
-        if (g2) {
-          i = g1;
-          g1 = g2;
-          g2 = i;
-          len -= i;
-        }
-        if (g1 > 0 && len > 0) {
-          i = len % g1 || g1;
-          intPart = intDigits.substr(0, i);
-          for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);
-          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);
-          if (isNeg) intPart = "-" + intPart;
-        }
-        str = fractionPart ? intPart + (format2.decimalSeparator || "") + ((g2 = +format2.fractionGroupSize) ? fractionPart.replace(
-          new RegExp("\\d{" + g2 + "}\\B", "g"),
-          "$&" + (format2.fractionGroupSeparator || "")
-        ) : fractionPart) : intPart;
-      }
-      return (format2.prefix || "") + str + (format2.suffix || "");
-    };
-    P.toFraction = function(md) {
-      var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s, x = this, xc = x.c;
-      if (md != null) {
-        n = new BigNumber2(md);
-        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {
-          throw Error(bignumberError + "Argument " + (n.isInteger() ? "out of range: " : "not an integer: ") + valueOf(n));
-        }
-      }
-      if (!xc) return new BigNumber2(x);
-      d = new BigNumber2(ONE);
-      n1 = d0 = new BigNumber2(ONE);
-      d1 = n0 = new BigNumber2(ONE);
-      s = coeffToString(xc);
-      e = d.e = s.length - x.e - 1;
-      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];
-      md = !md || n.comparedTo(d) > 0 ? e > 0 ? d : n1 : n;
-      exp = MAX_EXP;
-      MAX_EXP = 1 / 0;
-      n = new BigNumber2(s);
-      n0.c[0] = 0;
-      for (; ; ) {
-        q = div(n, d, 0, 1);
-        d2 = d0.plus(q.times(d1));
-        if (d2.comparedTo(md) == 1) break;
-        d0 = d1;
-        d1 = d2;
-        n1 = n0.plus(q.times(d2 = n1));
-        n0 = d2;
-        d = n.minus(q.times(d2 = d));
-        n = d2;
-      }
-      d2 = div(md.minus(d0), d1, 0, 1);
-      n0 = n0.plus(d2.times(n1));
-      d0 = d0.plus(d2.times(d1));
-      n0.s = n1.s = x.s;
-      e = e * 2;
-      r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(
-        div(n0, d0, e, ROUNDING_MODE).minus(x).abs()
-      ) < 1 ? [n1, d1] : [n0, d0];
-      MAX_EXP = exp;
-      return r;
-    };
-    P.toNumber = function() {
-      return +valueOf(this);
-    };
-    P.toPrecision = function(sd, rm) {
-      if (sd != null) intCheck(sd, 1, MAX);
-      return format(this, sd, rm, 2);
-    };
-    P.toString = function(b) {
-      var str, n = this, s = n.s, e = n.e;
-      if (e === null) {
-        if (s) {
-          str = "Infinity";
-          if (s < 0) str = "-" + str;
-        } else {
-          str = "NaN";
-        }
-      } else {
-        if (b == null) {
-          str = e <= TO_EXP_NEG || e >= TO_EXP_POS ? toExponential(coeffToString(n.c), e) : toFixedPoint(coeffToString(n.c), e, "0");
-        } else if (b === 10 && alphabetHasNormalDecimalDigits) {
-          n = round(new BigNumber2(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);
-          str = toFixedPoint(coeffToString(n.c), n.e, "0");
-        } else {
-          intCheck(b, 2, ALPHABET.length, "Base");
-          str = convertBase(toFixedPoint(coeffToString(n.c), e, "0"), 10, b, s, true);
-        }
-        if (s < 0 && n.c[0]) str = "-" + str;
-      }
-      return str;
-    };
-    P.valueOf = P.toJSON = function() {
-      return valueOf(this);
-    };
-    P._isBigNumber = true;
-    P[Symbol.toStringTag] = "BigNumber";
-    P[/* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom")] = P.valueOf;
-    if (configObject != null) BigNumber2.set(configObject);
-    return BigNumber2;
-  }
-  function bitFloor(n) {
-    var i = n | 0;
-    return n > 0 || n === i ? i : i - 1;
-  }
-  function coeffToString(a) {
-    var s, z, i = 1, j = a.length, r = a[0] + "";
-    for (; i < j; ) {
-      s = a[i++] + "";
-      z = LOG_BASE - s.length;
-      for (; z--; s = "0" + s) ;
-      r += s;
-    }
-    for (j = r.length; r.charCodeAt(--j) === 48; ) ;
-    return r.slice(0, j + 1 || 1);
-  }
-  function compare(x, y) {
-    var a, b, xc = x.c, yc = y.c, i = x.s, j = y.s, k = x.e, l = y.e;
-    if (!i || !j) return null;
-    a = xc && !xc[0];
-    b = yc && !yc[0];
-    if (a || b) return a ? b ? 0 : -j : i;
-    if (i != j) return i;
-    a = i < 0;
-    b = k == l;
-    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;
-    if (!b) return k > l ^ a ? 1 : -1;
-    j = (k = xc.length) < (l = yc.length) ? k : l;
-    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;
-    return k == l ? 0 : k > l ^ a ? 1 : -1;
-  }
-  function intCheck(n, min, max, name) {
-    if (n < min || n > max || n !== mathfloor(n)) {
-      throw Error(bignumberError + (name || "Argument") + (typeof n == "number" ? n < min || n > max ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(n));
-    }
-  }
-  function isOdd(n) {
-    var k = n.c.length - 1;
-    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;
-  }
-  function toExponential(str, e) {
-    return (str.length > 1 ? str.charAt(0) + "." + str.slice(1) : str) + (e < 0 ? "e" : "e+") + e;
-  }
-  function toFixedPoint(str, e, z) {
-    var len, zs;
-    if (e < 0) {
-      for (zs = z + "."; ++e; zs += z) ;
-      str = zs + str;
-    } else {
-      len = str.length;
-      if (++e > len) {
-        for (zs = z, e -= len; --e; zs += z) ;
-        str += zs;
-      } else if (e < len) {
-        str = str.slice(0, e) + "." + str.slice(e);
-      }
-    }
-    return str;
-  }
-  var BigNumber = clone();
-  var bignumber_default = BigNumber;
-
-  // node_modules/@paralleldrive/cuid2/src/index.js
-  var defaultLength = 24;
-  var bigLength = 32;
-  var createRandom = () => {
-    if (typeof globalThis !== "undefined" && globalThis.crypto && typeof globalThis.crypto.getRandomValues === "function") {
-      return () => {
-        const buffer = new Uint32Array(1);
-        globalThis.crypto.getRandomValues(buffer);
-        return buffer[0] / 4294967296;
-      };
-    }
-    return Math.random;
-  };
-  var random = createRandom();
-  var createEntropy = (length = 4, rand = random) => {
-    let entropy = "";
-    while (entropy.length < length) {
-      entropy = entropy + Math.floor(rand() * 36).toString(36);
-    }
-    return entropy;
-  };
-  function bufToBigInt(buf) {
-    let value = new bignumber_default(0);
-    for (const i of buf.values()) {
-      value = value.multipliedBy(256).plus(i);
-    }
-    return value;
-  }
-  var hash = (input = "") => {
-    const encoder = new TextEncoder();
-    return bufToBigInt(sha3_512(encoder.encode(input))).toString(36).slice(1);
-  };
-  var alphabet = Array.from(
-    { length: 26 },
-    (x, i) => String.fromCharCode(i + 97)
-  );
-  var randomLetter = (rand) => alphabet[Math.floor(rand() * alphabet.length)];
-  var createFingerprint = ({
-    globalObj = typeof global !== "undefined" ? global : typeof window !== "undefined" ? window : {},
-    random: rand = random
-  } = {}) => {
-    const globals = Object.keys(globalObj).toString();
-    const sourceString = globals.length ? globals + createEntropy(bigLength, rand) : createEntropy(bigLength, rand);
-    return hash(sourceString).substring(0, bigLength);
-  };
-  var createCounter = (count) => () => {
-    return count++;
-  };
-  var initialCountMax = 476782367;
-  var init = ({
-    // Fallback if the user does not pass in a CSPRNG. This should be OK
-    // because we don't rely solely on the random number generator for entropy.
-    // We also use the host fingerprint, current time, and a session counter.
-    random: rand = random,
-    counter = createCounter(Math.floor(rand() * initialCountMax)),
-    length = defaultLength,
-    fingerprint = createFingerprint({ random: rand })
-  } = {}) => {
-    if (length > bigLength) {
-      throw new Error(
-        `Length must be between 2 and ${bigLength}. Received: ${length}`
-      );
-    }
-    return function cuid2() {
-      const firstLetter = randomLetter(rand);
-      const time = Date.now().toString(36);
-      const count = counter().toString(36);
-      const salt = createEntropy(length, rand);
-      const hashInput = `${time + salt + count + fingerprint}`;
-      return `${firstLetter + hash(hashInput).substring(1, length)}`;
-    };
-  };
-  var createId = lazy(init);
-  function lazy(fn) {
-    let initialized;
-    return () => {
-      if (!initialized) {
-        initialized = fn();
-      }
-      return initialized();
-    };
-  }
-
-  // src/core/helpers.ts
-  function decorateCtor(ctor, label, runtime) {
-    if (process.env.NODE_ENV !== "production") {
-      if (isDecorated(ctor))
-        throw new Error(
-          `Constructor ${ctor} is already decorated. if you are using 'withSigilTyped()' & '@WithSigil()' at the same time remove one of them.`
-        );
-    }
-    Object.defineProperty(ctor, __LABEL__, {
-      value: label,
-      configurable: true,
-      enumerable: false,
-      writable: false
-    });
-    if (!(runtime == null ? void 0 : runtime.isInheritanceCheck))
-      Object.defineProperty(ctor, __EFFECTIVE_LABEL__, {
-        value: label,
-        configurable: true,
-        enumerable: false,
-        writable: false
-      });
-    const parent = Object.getPrototypeOf(ctor);
-    const parentChain = parent && parent[__LABEL_LINEAGE__] ? parent[__LABEL_LINEAGE__] : [];
-    const ctorChain = (runtime == null ? void 0 : runtime.isMixin) && label !== "Sigil" ? ["Sigil", ...parentChain, label] : [...parentChain, label];
-    Object.defineProperty(ctor, __LABEL_LINEAGE__, {
-      value: ctorChain,
-      configurable: true,
-      enumerable: false,
-      writable: false
-    });
-    Object.defineProperty(ctor, __LABEL_SET__, {
-      value: new Set(ctorChain),
-      configurable: true,
-      enumerable: false,
-      writable: false
-    });
-    if (!(runtime == null ? void 0 : runtime.isInheritanceCheck)) markDecorated(ctor);
-  }
-  function checkInheritance(ctor, opts) {
-    var _a, _b;
-    if (isInheritanceChecked(ctor) || ((_a = opts == null ? void 0 : opts.skipLabelInheritanceCheck) != null ? _a : OPTIONS.skipLabelInheritanceCheck))
-      return;
-    const ctors = [ctor];
-    let ancestor = Object.getPrototypeOf(ctor);
-    while (isSigilCtor(ancestor)) {
-      ctors.push(ancestor);
-      ancestor = Object.getPrototypeOf(ancestor);
-    }
-    const labelOwner = /* @__PURE__ */ new Map();
-    for (let i = ctors.length - 1; i >= 0; i--) {
-      const ctor2 = ctors[i];
-      if (!ctor2) continue;
-      let label = ctor2[__LABEL__];
-      if (labelOwner.has(label)) {
-        if (process.env.NODE_ENV !== "production") {
-          if (isDecorated(ctor2) || !((_b = opts == null ? void 0 : opts.autofillLabels) != null ? _b : OPTIONS.autofillLabels))
-            throw new Error(
-              `[Sigil Error] Class "${ctor2.name}" re-uses Sigil label "${label}" from ancestor "${labelOwner.get(label)}". Each Sigil subclass must use a unique label. Did you forget to use "WithSigil(newLabel)" on the subclass?`
-            );
-        }
-        label = generateRandomLabel();
-        decorateCtor(ctor2, label, { isInheritanceCheck: true });
-      }
-      labelOwner.set(label, ctor2.name);
-    }
-    markInheritanceChecked(ctor);
-  }
-  function verifyLabel(label, opts) {
-    var _a;
-    const labelValidation = (_a = opts == null ? void 0 : opts.labelValidation) != null ? _a : OPTIONS.labelValidation;
-    if (labelValidation) {
-      let valid;
-      if (labelValidation instanceof RegExp) valid = labelValidation.test(label);
-      else valid = labelValidation(label);
-      if (process.env.NODE_ENV !== "production") {
-        if (!valid)
-          throw new Error(
-            `[Sigil] Invalid identity label "${label}". Make sure that supplied label matches validation regex or function.`
-          );
-      }
-    }
-  }
-  function generateRandomLabel() {
-    let label = createId();
-    return `@Sigil.auto-${label}`;
-  }
-  function markSigil(ctor) {
-    Object.defineProperty(ctor, __SIGIL__, {
-      value: true,
-      configurable: false,
-      enumerable: false,
-      writable: false
-    });
-  }
-  function markSigilBase(ctor) {
-    Object.defineProperty(ctor, __SIGIL_BASE__, {
-      value: true,
-      configurable: false,
-      enumerable: false,
-      writable: false
-    });
-  }
-  function markDecorated(ctor) {
-    Object.defineProperty(ctor, __DECORATED__, {
-      value: true,
-      configurable: false,
-      enumerable: false,
-      writable: false
-    });
-  }
-  function markInheritanceChecked(ctor) {
-    Object.defineProperty(ctor, __INHERITANCE_CHECKED__, {
-      value: true,
-      configurable: false,
-      enumerable: false,
-      writable: false
-    });
-  }
-  function isSigilCtor(ctor) {
-    return typeof ctor === "function" && ctor[__SIGIL__] === true;
-  }
-  function isSigilInstance(inst) {
-    if (!inst || typeof inst !== "object") return false;
-    const ctor = getConstructor(inst);
-    return isSigilCtor(ctor);
-  }
-  function isSigilBaseCtor(ctor) {
-    return Object.hasOwn(ctor, __SIGIL_BASE__);
-  }
-  function isSigilBaseInstance(inst) {
-    if (!inst || typeof inst !== "object") return false;
-    const ctor = getConstructor(inst);
-    return isSigilBaseCtor(ctor);
-  }
-  function isDecorated(ctor) {
-    return Object.hasOwn(ctor, __DECORATED__);
-  }
-  function isInheritanceChecked(ctor) {
-    return Object.hasOwn(ctor, __INHERITANCE_CHECKED__);
-  }
-  function getConstructor(obj) {
-    var _a, _b, _c;
-    if (!obj || typeof obj !== "object") return null;
-    return (_c = (_b = obj.constructor) != null ? _b : (_a = Object.getPrototypeOf(obj)) == null ? void 0 : _a.constructor) != null ? _c : null;
-  }
-
-  // src/core/mixin.ts
-  function Sigilify(Base, label, opts) {
-    if (isSigilCtor(Base)) throw new Error(`[Sigil Error] 'Sigilify(${label})' already sigilified.`);
-    let l;
-    if (label) {
-      verifyLabel(label, opts);
-      l = label;
-    } else l = generateRandomLabel();
-    class Sigilified extends Base {
-      /**
-       * Class-level identity label constant for this sigil constructor.
-       */
-      static get SigilLabel() {
-        if (!isInheritanceChecked(this)) checkInheritance(this);
-        return this[__LABEL__];
-      }
-      /**
-       * Class-level human-readable label constant for this sigil constructor, last passed label in 'Sigil' chain by developer.
-       */
-      static get SigilEffectiveLabel() {
-        return this[__EFFECTIVE_LABEL__];
-      }
-      /**
-       * Copy of the linearized sigil type label chain for the current constructor.
-       *
-       * Useful for debugging and performing strict lineage comparisons.
-       *
-       * @returns An array of labels representing parent → child type labels.
-       */
-      static get SigilLabelLineage() {
-        var _a;
-        if (!isInheritanceChecked(this)) checkInheritance(this);
-        return [...(_a = this[__LABEL_LINEAGE__]) != null ? _a : []];
-      }
-      /**
-       * Copy of the sigil type label set for the current constructor.
-       *
-       * Useful for quick membership checks (O(1) lookups) and debugging.
-       *
-       * @returns A Readonly Set of labels that represent the type lineage.
-       */
-      static get SigilLabelSet() {
-        if (!isInheritanceChecked(this)) checkInheritance(this);
-        const set = /* @__PURE__ */ new Set();
-        for (const s of this[__LABEL_SET__]) set.add(s);
-        return set;
-      }
-      constructor(...args) {
-        super(...args);
-        if (Object.getPrototypeOf(this) !== new.target.prototype)
-          Object.setPrototypeOf(this, new.target.prototype);
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);
-          return;
-        }
-        checkInheritance(ctor);
-      }
-      /**
-       * Runtime predicate indicating whether `obj` is an instance produced by a sigil class.
-       *
-       * @param obj - The value to test.
-       * @returns `true` if `obj` is a sigil instance.
-       */
-      static isSigilified(obj) {
-        return isSigilInstance(obj);
-      }
-      /**
-       * Check whether `other` is (or inherits from) the type represented by the calling constructor.
-       *
-       * This replaces `instanceof` so that checks remain valid across bundles/realms
-       * and when subclassing.
-       *
-       * @typeParam T - The calling constructor type (narrowing the returned instance type).
-       * @param this - The constructor performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` is an instance of this type or a subtype.
-       */
-      static isOfType(other) {
-        var _a;
-        if (!isSigilInstance(other)) return false;
-        const otherSet = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_SET__];
-        const thisType = this[__LABEL__];
-        return !!otherSet && otherSet.has(thisType);
-      }
-      /**
-       * Strict lineage check: compares the type label lineage arrays element-by-element.
-       *
-       * @typeParam T - The calling constructor type.
-       * @param this - The constructor performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` has an identical lineage up to the length of this constructor's lineage.
-       */
-      static isOfTypeStrict(other) {
-        var _a;
-        if (!isSigilInstance(other)) return false;
-        const otherLineage = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_LINEAGE__];
-        const thisLineage = this[__LABEL_LINEAGE__];
-        return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);
-      }
-      /**
-       * Check whether `other` is (or inherits from) the type instance.
-       *
-       * Allows 'instanceof' like checks but in instances.
-       *
-       * @typeParam T - The instance type.
-       * @param this - The instance performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` is the same instance of this type or a subtype.
-       */
-      isOfType(other) {
-        var _a;
-        if (!isSigilInstance(other)) return false;
-        const otherSet = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_SET__];
-        const thisType = getConstructor(this)[__LABEL__];
-        return !!otherSet && otherSet.has(thisType);
-      }
-      /**
-       * Strict lineage check: compares the type label lineage arrays element-by-element.
-       *
-       * Allows 'instanceof' like checks but in instances.
-       *
-       * @typeParam T - The instance type.
-       * @param this - The instance performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` has an identical lineage up to the length of this instance's lineage.
-       */
-      isOfTypeStrict(other) {
-        var _a, _b;
-        if (!isSigilInstance(other)) return false;
-        const otherLineage = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_LINEAGE__];
-        const thisLineage = (_b = getConstructor(this)) == null ? void 0 : _b[__LABEL_LINEAGE__];
-        return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);
-      }
-      /**
-       * Returns the identity sigil label of this instance's constructor.
-       *
-       * @returns The label string if passed (e.g. '@scope/pkg.ClassName'), random label if not passed (e.g. '@Sigil.auto-dq62ib6jnvmmlfbjhxh2937h') or '@Sigil.unknown' if constructor is missing.
-       */
-      getSigilLabel() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return "@Sigil.unknown";
-        }
-        return ctor.SigilLabel;
-      }
-      /**
-       * Returns the human-readable sigil label of this instance's constructor.
-       *
-       * @returns The last passed label string (e.g. '@scope/pkg.ClassName') or '@Sigil.unknown' if constructor is missing.
-       */
-      getSigilEffectiveLabel() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return "@Sigil.unknown";
-        }
-        return ctor.SigilEffectiveLabel;
-      }
-      /**
-       * Returns a copy of the sigil type label lineage for this instance's constructor.
-       *
-       * @returns readonly array of labels representing the type lineage.
-       */
-      getSigilLabelLineage() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return ["@Sigil.unknown"];
-        }
-        return ctor.SigilLabelLineage;
-      }
-      /**
-       * Returns a readonly copy of the sigil type label set for this instance's constructor.
-       *
-       * @returns A Readonly Set of labels representing the type lineage for O(1) membership tests.
-       */
-      getSigilLabelSet() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return /* @__PURE__ */ new Set(["@Sigil.unknown"]);
-        }
-        return ctor.SigilLabelSet;
-      }
-    }
-    decorateCtor(Sigilified, l, { isMixin: true });
-    markSigil(Sigilified);
-    markSigilBase(Sigilified);
-    return Sigilified;
-  }
-  function SigilifyAbstract(Base, label, opts) {
-    if (isSigilCtor(Base)) throw new Error(`[Sigil Error] 'Sigilify(${label})' already sigilified.`);
-    let l;
-    if (label) {
-      verifyLabel(label, opts);
-      l = label;
-    } else l = generateRandomLabel();
-    class Sigilified extends Base {
-      /**
-       * Class-level identity label constant for this sigil constructor.
-       */
-      static get SigilLabel() {
-        if (!isInheritanceChecked(this)) checkInheritance(this);
-        return this[__LABEL__];
-      }
-      /**
-       * Class-level human-readable label constant for this sigil constructor, last passed label in 'Sigil' chain by developer.
-       */
-      static get SigilEffectiveLabel() {
-        return this[__EFFECTIVE_LABEL__];
-      }
-      /**
-       * Copy of the linearized sigil type label chain for the current constructor.
-       *
-       * Useful for debugging and performing strict lineage comparisons.
-       *
-       * @returns An array of labels representing parent → child type labels.
-       */
-      static get SigilLabelLineage() {
-        var _a;
-        if (!isInheritanceChecked(this)) checkInheritance(this);
-        return [...(_a = this[__LABEL_LINEAGE__]) != null ? _a : []];
-      }
-      /**
-       * Copy of the sigil type label set for the current constructor.
-       *
-       * Useful for quick membership checks (O(1) lookups) and debugging.
-       *
-       * @returns A Readonly Set of labels that represent the type lineage.
-       */
-      static get SigilLabelSet() {
-        if (!isInheritanceChecked(this)) checkInheritance(this);
-        const set = /* @__PURE__ */ new Set();
-        for (const s of this[__LABEL_SET__]) set.add(s);
-        return set;
-      }
-      constructor(...args) {
-        super(...args);
-        if (Object.getPrototypeOf(this) !== new.target.prototype)
-          Object.setPrototypeOf(this, new.target.prototype);
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);
-          return;
-        }
-        checkInheritance(ctor);
-      }
-      /**
-       * Runtime predicate indicating whether `obj` is an instance produced by a sigil class.
-       *
-       * @param obj - The value to test.
-       * @returns `true` if `obj` is a sigil instance.
-       */
-      static isSigilified(obj) {
-        return isSigilInstance(obj);
-      }
-      /**
-       * Check whether `other` is (or inherits from) the type represented by the calling constructor.
-       *
-       * Implementation detail:
-       * - Uses the other instance's `__LABEL_SET__` for O(1) membership test.
-       * - O(1) and reliable as long as `OPTIONS.skipLabelInheritanceCheck` is `false`.
-       *
-       * This replaces `instanceof` so that checks remain valid across bundles/realms
-       * and when subclassing.
-       *
-       * @typeParam T - The calling constructor type (narrowing the returned instance type).
-       * @param this - The constructor performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` is an instance of this type or a subtype.
-       */
-      static isOfType(other) {
-        var _a;
-        if (!isSigilInstance(other)) return false;
-        const otherSet = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_SET__];
-        const thisType = this[__LABEL__];
-        return !!otherSet && otherSet.has(thisType);
-      }
-      /**
-       * Strict lineage check: compares the type label lineage arrays element-by-element.
-       *
-       * Implementation detail:
-       * - Works in O(n) time where n is the depth of the lineage.
-       * - Reliable when `OPTIONS.skipLabelInheritanceCheck` is `false`.
-       *
-       * @typeParam T - The calling constructor type.
-       * @param this - The constructor performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` has an identical lineage up to the length of this constructor's lineage.
-       */
-      static isOfTypeStrict(other) {
-        var _a;
-        if (!isSigilInstance(other)) return false;
-        const otherLineage = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_LINEAGE__];
-        const thisLineage = this[__LABEL_LINEAGE__];
-        return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);
-      }
-      /**
-       * Check whether `other` is (or inherits from) the type instance.
-       *
-       * Allows 'instanceof' like checks but in instances.
-       *
-       * @typeParam T - The instance type.
-       * @param this - The instance performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` is the same instance of this type or a subtype.
-       */
-      isOfType(other) {
-        var _a;
-        if (!isSigilInstance(other)) return false;
-        const otherSet = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_SET__];
-        const thisType = getConstructor(this)[__LABEL__];
-        return !!otherSet && otherSet.has(thisType);
-      }
-      /**
-       * Strict lineage check: compares the type label lineage arrays element-by-element.
-       *
-       * Allows 'instanceof' like checks but in instances.
-       *
-       * @typeParam T - The instance type.
-       * @param this - The instance performing the check.
-       * @param other - The object to test.
-       * @returns `true` if `other` has an identical lineage up to the length of this instance's lineage.
-       */
-      isOfTypeStrict(other) {
-        var _a, _b;
-        if (!isSigilInstance(other)) return false;
-        const otherLineage = (_a = getConstructor(other)) == null ? void 0 : _a[__LABEL_LINEAGE__];
-        const thisLineage = (_b = getConstructor(this)) == null ? void 0 : _b[__LABEL_LINEAGE__];
-        return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);
-      }
-      /**
-       * Returns the identity sigil label of this instance's constructor.
-       *
-       * @returns The label string if passed (e.g. '@scope/pkg.ClassName'), random label if not passed (e.g. '@Sigil.auto-dq62ib6jnvmmlfbjhxh2937h') or '@Sigil.unknown' if constructor is missing.
-       */
-      getSigilLabel() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return "@Sigil.unknown";
-        }
-        return ctor.SigilLabel;
-      }
-      /**
-       * Returns the human-readable sigil label of this instance's constructor.
-       *
-       * @returns The last passed label string (e.g. '@scope/pkg.ClassName') or '@Sigil.unknown' if constructor is missing.
-       */
-      getSigilEffectiveLabel() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return "@Sigil.unknown";
-        }
-        return ctor.SigilEffectiveLabel;
-      }
-      /**
-       * Returns a copy of the sigil type label lineage for this instance's constructor.
-       *
-       * @returns readonly array of labels representing the type lineage.
-       */
-      getSigilLabelLineage() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return ["@Sigil.unknown"];
-        }
-        return ctor.SigilLabelLineage;
-      }
-      /**
-       * Returns a readonly copy of the sigil type label set for this instance's constructor.
-       *
-       * @returns A Readonly Set of labels representing the type lineage for O(1) membership tests.
-       */
-      getSigilLabelSet() {
-        const ctor = getConstructor(this);
-        if (!ctor) {
-          if (process.env.NODE_ENV !== "production")
-            throw new Error(`[Sigil Error] Sigil class instance without constructor`);
-          return /* @__PURE__ */ new Set(["@Sigil.unknown"]);
-        }
-        return ctor.SigilLabelSet;
-      }
-    }
-    decorateCtor(Sigilified, l, { isMixin: true });
-    markSigil(Sigilified);
-    markSigilBase(Sigilified);
-    return Sigilified;
-  }
-
-  // src/core/classes.ts
-  var Sigil = Sigilify(class {
-  }, "Sigil");
-  var SigilError = Sigilify(Error, "SigilError");
-
-  // src/core/decorator.ts
-  function WithSigil(label, opts) {
-    let l;
-    if (label) {
-      verifyLabel(label, opts);
-      l = label;
-    } else l = generateRandomLabel();
-    return function(value, context) {
-      if (context.kind !== "class") return;
-      if (!isSigilCtor(value))
-        throw new Error(
-          `[Sigil Error] 'WithSigil' decorator accept only Sigil classes but used on class ${value.name}`
-        );
-      decorateCtor(value, l);
-      checkInheritance(value, opts);
-    };
-  }
-
-  // src/core/hof.ts
-  function withSigil(Class, label, opts) {
-    var _a;
-    if (!isSigilCtor(Class))
-      throw new Error(
-        `[Sigil Error] 'withSigil' HOF accept only Sigil classes  but used on class ${(_a = Class == null ? void 0 : Class.name) != null ? _a : "unknown"}`
-      );
-    let l;
-    if (label) {
-      verifyLabel(label, opts);
-      l = label;
-    } else l = generateRandomLabel();
-    const ctor = Class;
-    decorateCtor(ctor, l);
-    checkInheritance(ctor, opts);
-    return Class;
-  }
-  function withSigilTyped(Class, label, opts) {
-    var _a;
-    if (!isSigilCtor(Class))
-      throw new Error(
-        `[Sigil Error] 'withSigilTyped' HOF accept only Sigil classes but used on class ${(_a = Class == null ? void 0 : Class.name) != null ? _a : "unknown"}`
-      );
-    let l;
-    if (label) {
-      verifyLabel(label, opts);
-      l = label;
-    } else l = generateRandomLabel();
-    const ctor = Class;
-    decorateCtor(ctor, l);
-    checkInheritance(ctor, opts);
-    return Class;
-  }
-  /*! Bundled license information:
-
-  @noble/hashes/utils.js:
-    (*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-  */
-
-  exports.DEFAULT_LABEL_REGEX = DEFAULT_LABEL_REGEX;
-  exports.Sigil = Sigil;
-  exports.SigilError = SigilError;
-  exports.Sigilify = Sigilify;
-  exports.SigilifyAbstract = SigilifyAbstract;
-  exports.WithSigil = WithSigil;
-  exports.isDecorated = isDecorated;
-  exports.isInheritanceChecked = isInheritanceChecked;
-  exports.isSigilBaseCtor = isSigilBaseCtor;
-  exports.isSigilBaseInstance = isSigilBaseInstance;
-  exports.isSigilCtor = isSigilCtor;
-  exports.isSigilInstance = isSigilInstance;
-  exports.updateSigilOptions = updateSigilOptions;
-  exports.withSigil = withSigil;
-  exports.withSigilTyped = withSigilTyped;
-
-  return exports;
-
-})({});
-//# sourceMappingURL=index.global.js.map
+@noble/hashes/utils.js:
+  (*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
+*/exports.DEFAULT_LABEL_REGEX=yt;exports.Sigil=Yt;exports.SigilError=Zt;exports.Sigilify=Le;exports.SigilifyAbstract=Kt;exports.WithSigil=Jt;exports.isDecorated=Xe;exports.isInheritanceChecked=re;exports.isSigilBaseCtor=St;exports.isSigilBaseInstance=Wt;exports.isSigilCtor=ee;exports.isSigilInstance=K;exports.updateSigilOptions=_t;exports.withSigil=Qt;return exports;})({});//# sourceMappingURL=index.global.js.map
 //# sourceMappingURL=index.global.js.map