diff --git a/README.md b/README.md
index d7e70aa4..a1045bdc 100644
--- a/README.md
+++ b/README.md
@@ -91,8 +91,7 @@ yarn cli <action> --help
 To run you will use the "shares" command
 
 **Input parameters:**
-- keystore (ks) = The validator keystore file path. Only one keystore file can be specified using this argument
-- keystore-path (kp) = The path to the folder containing validator keystore files. If a folder is provided, all keystore files within the provided folder will be split according to the provided arguments. This argument should not be used together with the `keystore` argument
+- keystore (ks) = The path to either a validator keystore file or a folder that contains multiple validator keystore files. If a folder is provided, it will split in bulk all the keystore files within it according to the additional arguments provided
 - password (ps) = The keystore file encryption password, if a folder was provided the password will be used for all keystore files in the folder
 - operator-ids (oids) = Comma-separated list of operator IDs. The amount must be 3f+1 compatible
 - operator-keys (oks) = Comma-separated list of operator keys (same sequence as operator ids). The amount must be 3f+1 compatible
diff --git a/dist/esbuild/main.js b/dist/esbuild/main.js
index 343bde37..484cd405 100644
--- a/dist/esbuild/main.js
+++ b/dist/esbuild/main.js
@@ -1,4 +1,4 @@
-"use strict";var ee=Object.create;var D=Object.defineProperty,te=Object.defineProperties,kn=Object.getOwnPropertyDescriptor,re=Object.getOwnPropertyDescriptors,ie=Object.getOwnPropertyNames,Pn=Object.getOwnPropertySymbols,se=Object.getPrototypeOf,Mn=Object.prototype.hasOwnProperty,ae=Object.prototype.propertyIsEnumerable;var Un=(t,n,e)=>n in t?D(t,n,{enumerable:!0,configurable:!0,writable:!0,value:e}):t[n]=e,Ln=(t,n)=>{for(var e in n||(n={}))Mn.call(n,e)&&Un(t,e,n[e]);if(Pn)for(var e of Pn(n))ae.call(n,e)&&Un(t,e,n[e]);return t},Cn=(t,n)=>te(t,re(n));var oe=(t,n)=>()=>(n||t((n={exports:{}}).exports,n),n.exports),pe=(t,n)=>{for(var e in n)D(t,e,{get:n[e],enumerable:!0})},Jn=(t,n,e,r)=>{if(n&&typeof n=="object"||typeof n=="function")for(let i of ie(n))!Mn.call(t,i)&&i!==e&&D(t,i,{get:()=>n[i],enumerable:!(r=kn(n,i))||r.enumerable});return t};var m=(t,n,e)=>(e=t!=null?ee(se(t)):{},Jn(n||!t||!t.__esModule?D(e,"default",{value:t,enumerable:!0}):e,t)),ce=t=>Jn(D({},"__esModule",{value:!0}),t),l=(t,n,e,r)=>{for(var i=r>1?void 0:r?kn(n,e):n,s=t.length-1,o;s>=0;s--)(o=t[s])&&(i=(r?o(n,e,i):o(i))||i);return r&&i&&D(n,e,i),i};var u=(t,n,e)=>new Promise((r,i)=>{var s=h=>{try{a(e.next(h))}catch(d){i(d)}},o=h=>{try{a(e.throw(h))}catch(d){i(d)}},a=h=>h.done?r(h.value):Promise.resolve(h.value).then(s,o);a((e=e.apply(t,n)).next())});var Wn=oe((exports,module)=>{"use strict";var window=global;(function(t){if(typeof exports=="object"&&typeof module!="undefined")module.exports=t();else if(typeof define=="function"&&define.amd)define([],t);else{var n;typeof global!="undefined"?n=global:typeof self!="undefined"?n=self:n=this,n.JSEncrypt=t()}})(function(){var define,module,exports;return function(){function t(n,e,r){function i(a,h){if(!e[a]){if(!n[a]){var d=typeof require=="function"&&require;if(!h&&d)return d(a,!0);if(s)return s(a,!0);var f=new Error("Cannot find module '"+a+"'");throw f.code="MODULE_NOT_FOUND",f}var j=e[a]={exports:{}};n[a][0].call(j.exports,function(z){var ne=n[a][1][z];return i(ne||z)},j,j.exports,t,n,e,r)}return e[a].exports}for(var s=typeof require=="function"&&require,o=0;o<r.length;o++)i(r[o]);return i}return t}()({1:[function(t,n,e){let r=t("jsencrypt");n.exports=r},{jsencrypt:2}],2:[function(require,module,exports){(function(n,e){typeof exports=="object"&&typeof module=="object"?module.exports=e():typeof define=="function"&&define.amd?define([],e):typeof exports=="object"?exports.JSEncrypt=e():n.JSEncrypt=e()})(window,function(){return(()=>{"use strict";var __webpack_modules__={"./lib/JSEncrypt.js":(__unused_webpack_module,__webpack_exports__,__webpack_require__)=>{eval(`__webpack_require__.r(__webpack_exports__);
+"use strict";var ee=Object.create;var D=Object.defineProperty,te=Object.defineProperties,kn=Object.getOwnPropertyDescriptor,re=Object.getOwnPropertyDescriptors,ie=Object.getOwnPropertyNames,Pn=Object.getOwnPropertySymbols,se=Object.getPrototypeOf,Mn=Object.prototype.hasOwnProperty,ae=Object.prototype.propertyIsEnumerable;var Un=(t,n,e)=>n in t?D(t,n,{enumerable:!0,configurable:!0,writable:!0,value:e}):t[n]=e,Ln=(t,n)=>{for(var e in n||(n={}))Mn.call(n,e)&&Un(t,e,n[e]);if(Pn)for(var e of Pn(n))ae.call(n,e)&&Un(t,e,n[e]);return t},Cn=(t,n)=>te(t,re(n));var oe=(t,n)=>()=>(n||t((n={exports:{}}).exports,n),n.exports),ce=(t,n)=>{for(var e in n)D(t,e,{get:n[e],enumerable:!0})},Jn=(t,n,e,r)=>{if(n&&typeof n=="object"||typeof n=="function")for(let i of ie(n))!Mn.call(t,i)&&i!==e&&D(t,i,{get:()=>n[i],enumerable:!(r=kn(n,i))||r.enumerable});return t};var b=(t,n,e)=>(e=t!=null?ee(se(t)):{},Jn(n||!t||!t.__esModule?D(e,"default",{value:t,enumerable:!0}):e,t)),pe=t=>Jn(D({},"__esModule",{value:!0}),t),p=(t,n,e,r)=>{for(var i=r>1?void 0:r?kn(n,e):n,s=t.length-1,o;s>=0;s--)(o=t[s])&&(i=(r?o(n,e,i):o(i))||i);return r&&i&&D(n,e,i),i};var u=(t,n,e)=>new Promise((r,i)=>{var s=h=>{try{a(e.next(h))}catch(d){i(d)}},o=h=>{try{a(e.throw(h))}catch(d){i(d)}},a=h=>h.done?r(h.value):Promise.resolve(h.value).then(s,o);a((e=e.apply(t,n)).next())});var Wn=oe((exports,module)=>{"use strict";var window=global;(function(t){if(typeof exports=="object"&&typeof module!="undefined")module.exports=t();else if(typeof define=="function"&&define.amd)define([],t);else{var n;typeof global!="undefined"?n=global:typeof self!="undefined"?n=self:n=this,n.JSEncrypt=t()}})(function(){var define,module,exports;return function(){function t(n,e,r){function i(a,h){if(!e[a]){if(!n[a]){var d=typeof require=="function"&&require;if(!h&&d)return d(a,!0);if(s)return s(a,!0);var f=new Error("Cannot find module '"+a+"'");throw f.code="MODULE_NOT_FOUND",f}var j=e[a]={exports:{}};n[a][0].call(j.exports,function(z){var ne=n[a][1][z];return i(ne||z)},j,j.exports,t,n,e,r)}return e[a].exports}for(var s=typeof require=="function"&&require,o=0;o<r.length;o++)i(r[o]);return i}return t}()({1:[function(t,n,e){let r=t("jsencrypt");n.exports=r},{jsencrypt:2}],2:[function(require,module,exports){(function(n,e){typeof exports=="object"&&typeof module=="object"?module.exports=e():typeof define=="function"&&define.amd?define([],e):typeof exports=="object"?exports.JSEncrypt=e():n.JSEncrypt=e()})(window,function(){return(()=>{"use strict";var __webpack_modules__={"./lib/JSEncrypt.js":(__unused_webpack_module,__webpack_exports__,__webpack_require__)=>{eval(`__webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "JSEncrypt": () => (/* binding */ JSEncrypt)
 /* harmony export */ });
@@ -5481,4 +5481,4 @@ YAHOO.lang = {
 
 //# sourceURL=webpack://JSEncrypt/./lib/lib/jsrsasign/yahoo.js?`)},"./lib/version.json":module=>{eval(`module.exports = {"version":"3.2.1"};
 
-//# sourceURL=webpack://JSEncrypt/./lib/version.json?`)}},__webpack_module_cache__={};function __webpack_require__(t){var n=__webpack_module_cache__[t];if(n!==void 0)return n.exports;var e=__webpack_module_cache__[t]={exports:{}};return __webpack_modules__[t](e,e.exports,__webpack_require__),e.exports}__webpack_require__.d=(t,n)=>{for(var e in n)__webpack_require__.o(n,e)&&!__webpack_require__.o(t,e)&&Object.defineProperty(t,e,{enumerable:!0,get:n[e]})},__webpack_require__.o=(t,n)=>Object.prototype.hasOwnProperty.call(t,n),__webpack_require__.r=t=>{typeof Symbol!="undefined"&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})};var __webpack_exports__=__webpack_require__("./lib/index.js");return __webpack_exports__=__webpack_exports__.default,__webpack_exports__})()})},{}]},{},[1])(1)})});var de={};pe(de,{Encryption:()=>I,EthereumKeyStore:()=>U,KeyShares:()=>F,KeySharesItem:()=>y,SSVKeys:()=>q,SSVKeysException:()=>c,Threshold:()=>P});module.exports=ce(de);var gn;try{window.crypto,gn=require("bls-eth-wasm/browser")}catch(t){gn=require("bls-eth-wasm")}var p=gn;var c=class extends Error{constructor(e){super(e);this.name=this.constructor.name,Error.captureStackTrace(this,this.constructor),this.trace=this.stack,this.stack=`${this.name}: ${this.message}`}};var G=class extends c{constructor(e,r){super(r);this.data=e}},Y=class extends c{constructor(e,r){super(r);this.data=e}},$=class extends c{constructor(n){super(n)}},v=class extends c{constructor(n){super(n)}},Z=class extends c{constructor(e,r){super(r);this.data=e}},w=class extends c{constructor(e,r){super(r);this.data=e}},R=class extends c{constructor(e,r){super(r);this.data=e}};var qn=m(require("eth2-keystore-js"));var le=m(require("moment")),Vn=require("fs");var Hn=(t,n=!0)=>u(void 0,null,function*(){return Vn.promises.readFile(t,{encoding:"utf-8"}).then(e=>n?JSON.parse(e):e)});var fn=class{constructor(){this.keystoreFilePath=""}validatePassword(n,e){return u(this,null,function*(){if(!n.trim().length)return"Password is empty";let r="Invalid keystore file password.",i;try{let s=yield Hn(e);i=!!(yield new qn.default(s).getPrivateKey(n))}catch(s){i=r}return i})}},ue=new fn;var _n=class{constructor(){this.operatorsCount=3}setOperatorsCount(n){this.operatorsCount=n}},mn=t=>!(t<4||t>13||t%3!=1),Re=new _n;var yn=require("js-base64");var bn;try{window.crypto,bn=require("jsencrypt").JSEncrypt}catch(t){bn=Wn()}var Q=bn;var X=class extends c{constructor(e,r){super(r);this.operator=e}},nn=class extends c{constructor(e,r){super(r);this.operator=e}},E=class extends c{constructor(e,r,i){super(i);this.listOne=e,this.listTwo=r}},O=class extends c{constructor(e,r){super(r);this.operator=e}};var N=t=>{t=t.trim();let n="-----BEGIN RSA PUBLIC KEY-----",e="-----END RSA PUBLIC KEY-----",r=new Q({}),i="";try{let s="";if(t.startsWith(n))s=t;else{if(t.length<98)throw new Error("The length of the operator public key must be at least 98 characters.");try{s=(0,yn.decode)(t).trim()}catch(o){throw new Error("Failed to decode the operator public key. Ensure it's correctly base64 encoded.")}if(!s.startsWith(n))throw new Error(`Operator public key does not start with '${n}'`)}if(!s.endsWith(e))throw new Error(`Operator public key does not end with '${e}'`);try{let o=s.slice(n.length,t.length-e.length).trim();i=(0,yn.decode)(o)}catch(o){throw new Error("Failed to decode the RSA public key. Ensure it's correctly base64 encoded.")}try{r.setPublicKey(i)}catch(o){throw new Error("Invalid operator key format, make sure the operator exists in the network.")}}catch(s){throw new O({rsa:i,base64:t},s.message)}return!0};var En=class extends c{constructor(e,r){super(r);this.operators=e}},Sn=class extends c{constructor(e,r){super(r);this.operator=e}},xn=class{constructor(){this.shares=[]}static get DEFAULT_THRESHOLD_NUMBER(){return 3}create(n,e){return u(this,null,function*(){if(!n.startsWith("0x"))throw new Z(n,"The private key must be provided in the 0x format.");if(e.map(a=>{if(!Number.isInteger(a))throw new Sn(a,`Operator must be integer. Got: ${a}`)}),!mn(e.length))throw new En(e,"Invalid operators amount. Enter an 3f+1 compatible amount of operator ids.");let r=[],i=[];p.deserializeHexStrToSecretKey||(yield p.init(p.BLS12_381)),this.privateKey=p.deserializeHexStrToSecretKey(n.replace("0x","")),this.publicKey=this.privateKey.getPublicKey(),r.push(this.privateKey),i.push(this.publicKey);let s=(e.length-1)/3;for(let a=1;a<e.length-s;a+=1){let h=new p.SecretKey;h.setByCSPRNG(),r.push(h);let d=h.getPublicKey();i.push(d)}for(let a of e){let h=new p.Id;h.setInt(a);let d=new p.SecretKey;d.share(r,h);let f=new p.PublicKey;f.share(i,h),this.shares.push({privateKey:`0x${d.serializeToHexStr()}`,publicKey:`0x${f.serializeToHexStr()}`,id:h})}return{privateKey:`0x${this.privateKey.serializeToHexStr()}`,publicKey:`0x${this.publicKey.serializeToHexStr()}`,shares:this.shares}})}},P=xn;var vn=m(require("crypto")),Fn=require("scrypt-js"),en=m(require("ethereumjs-wallet")),tn=require("ethereumjs-util");var Rn=class{constructor(n){this.privateKey="";if(!n)throw new G(n,"Key store data should be JSON or string");if(typeof n=="string"?this.keyStoreData=JSON.parse(n):this.keyStoreData=n,!this.keyStoreData.version)throw new Y(this.keyStoreData,"Invalid keystore file")}getPublicKey(){var n;if(this.keyStoreData)switch((n=this.keyStoreData.version)!=null?n:this.keyStoreData.Version){case 1:return this.keyStoreData.Address;case 3:return this.keyStoreData.id;case 4:return this.keyStoreData.pubkey}return""}getPrivateKey(n=""){return u(this,null,function*(){if(this.privateKey)return this.privateKey;switch(this.keyStoreData.version){case 1:this.wallet=yield en.default.fromV1(this.keyStoreData,n);break;case 3:this.wallet=yield en.default.fromV3(this.keyStoreData,n,!0);break;case 4:this.wallet=yield this.fromV4(this.keyStoreData,n);break}if(this.wallet&&(this.privateKey=this.wallet.getPrivateKey().toString("hex"),!this.privateKey))throw new $("Invalid password");return this.privateKey})}fromV4(n,e){return u(this,null,function*(){let r=typeof n=="object"?n:JSON.parse(n);if(r.version!==4)throw new v("Not a V4 wallet");let i,s;if(r.crypto.kdf.function==="scrypt")s=r.crypto.kdf.params,i=(0,Fn.syncScrypt)(Buffer.from(e),Buffer.from(s.salt,"hex"),s.n,s.r,s.p,s.dklen);else if(r.crypto.kdf.function==="pbkdf2"){if(s=r.crypto.kdf.params,s.prf!=="hmac-sha256")throw new v("Unsupported parameters to PBKDF2");i=vn.default.pbkdf2Sync(Buffer.from(e),Buffer.from(s.salt,"hex"),s.c,s.dklen,"sha256")}else throw new v("Unsupported key derivation scheme");let o=Buffer.from(r.crypto.cipher.message,"hex"),a=Buffer.concat([Buffer.from(i.slice(16,32)),o]),d={keccak256:tn.keccak256,sha256:tn.sha256}[r.crypto.checksum.function];if(d(a).toString("hex")!==r.crypto.checksum.message)throw new v("Invalid password");let j=vn.default.createDecipheriv(r.crypto.cipher.function,i.slice(0,16),Buffer.from(r.crypto.cipher.params.iv,"hex")),z=this.runCipherBuffer(j,o);return new en.default(z)})}runCipherBuffer(n,e){return Buffer.concat([n.update(e),n.final()])}static toHexString(n){return Array.from(n,e=>`0${(e&255).toString(16)}`.slice(-2)).join("")}},U=Rn;var I=class{constructor(n,e){this.operatorPublicKeys=[...n],this.shares=e}encrypt(){let n=[];for(let[e,r]of this.operatorPublicKeys.entries()){N(r);let i=new Q({});i.setPublicKey(r);let s=i.encrypt(this.shares[e].privateKey);if(!s)throw new O({rsa:r,base64:s},"Private key encryption failed.");let o={operatorPublicKey:r,privateKey:s,publicKey:this.shares[e].publicKey};n.push(o)}return n}};var _=require("class-validator");var rn=require("class-validator");var k=class{validate(n){let e=new Set,r=new Set;for(let i of n||[]){if(e.has(i.id))throw new X(i,`The operator ID '${i.id}' is duplicated in the list`);if(e.add(i.id),r.has(i.operatorKey))throw new nn(i,`The public key for operator ID ${i.id} is duplicated in the list`);r.add(i.operatorKey)}return!0}defaultMessage(){return"The list of operators contains duplicate entries"}};k=l([(0,rn.ValidatorConstraint)({name:"uniqueList",async:!1})],k);function In(t){return function(n,e){(0,rn.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:k})}}var on=require("class-validator");var sn=class extends c{constructor(e,r){super(r);this.publicKey=e}},an=class extends c{constructor(e,r){super(r);this.data=e}};var M=class{validate(n){return u(this,null,function*(){try{typeof n=="string"?p.deserializeHexStrToPublicKey(n.replace("0x","")):n.forEach(e=>p.deserializeHexStrToPublicKey(e.replace("0x","")))}catch(e){throw new sn(n,"Failed to BLS deserialize validator public key")}return!0})}defaultMessage(){return"Invalid public key"}};M=l([(0,on.ValidatorConstraint)({name:"publicKey",async:!0})],M);function L(t){return function(n,e){(0,on.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:M})}}var cn=require("class-validator");var zn=m(require("web3")),Gn=m(require("ethers")),An=m(require("ethereumjs-util"));var C=new zn.default;var pn=t=>{let n=new Uint8Array(t.map(e=>[...Gn.utils.arrayify(e)]).flat());return Buffer.from(n)},Yn=(t,n)=>u(void 0,null,function*(){p.deserializeHexStrToSecretKey||(yield p.init(p.BLS12_381));let e=p.deserializeHexStrToSecretKey(n.replace("0x","")),r=An.keccak256(Buffer.from(t));return`0x${e.sign(new Uint8Array(r)).serializeToHexStr()}`}),$n=(t,n,e)=>u(void 0,null,function*(){p.deserializeHexStrToSecretKey||(yield p.init(p.BLS12_381));let r=p.deserializeHexStrToPublicKey(e.replace("0x","")),i=p.deserializeHexStrToSignature(n.replace("0x","")),s=An.keccak256(Buffer.from(t));if(!r.verify(i,new Uint8Array(s)))throw new an(n,"Single shares signature is invalid")}),Zn=t=>u(void 0,null,function*(){return p.deserializeHexStrToSecretKey||(yield p.init(p.BLS12_381)),`0x${p.deserializeHexStrToSecretKey(t.replace("0x","")).getPublicKey().serializeToHexStr()}`});var J=class{validate(n){try{C.utils.toChecksumAddress(n)}catch(e){throw new w(n,"Owner address is not a valid Ethereum address")}return!0}defaultMessage(){return"Invalid owner address"}};J=l([(0,cn.ValidatorConstraint)({name:"ownerAddress",async:!1})],J);function Dn(t){return function(n,e){(0,cn.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:J})}}var ln=require("class-validator");var V=class{validate(n){if(!Number.isInteger(n)||n<0)throw new R(n,"Owner nonce is not positive integer");return!0}defaultMessage(){return"Invalid owner nonce"}};V=l([(0,ln.ValidatorConstraint)({name:"ownerNonce",async:!1})],V);function wn(t){return function(n,e){(0,ln.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:V})}}var On=require("class-validator");var un=class{validate(n,e){let[r,i]=e.constraints,s=e.object[r].length;if(!Array.isArray(n))Object.values(n).forEach(o=>{if(s!==o.length)throw new E(e.object[r],n,i.message)});else if(s!==n.length)throw new E(e.object[r],n,i.message);return!0}defaultMessage(){return"The length of the entries lists are not equal"}};un=l([(0,On.ValidatorConstraint)({name:"matchLength",async:!1})],un);var hn=require("class-validator");var H=class{validate(n){return N(n)}defaultMessage(){return"Invalid operator public key"}};H=l([(0,hn.ValidatorConstraint)({name:"operatorKey",async:!1})],H);function Bn(t){return function(n,e){(0,hn.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:H})}}var B=class{constructor(n){this.id=n.id,this.operatorKey=n.operatorKey,this.validate()}validate(){(0,_.validateSync)(this)}};l([(0,_.IsNotEmpty)({message:"The operator id is null"}),(0,_.IsDefined)({message:"The operator id is undefined"}),(0,_.IsInt)({message:"The operator id must be an integer"})],B.prototype,"id",2),l([(0,_.IsNotEmpty)({message:"The operator public key is null"}),(0,_.IsDefined)({message:"The operator public key is undefined"}),(0,_.IsString)({message:"The operator public key must be a string"}),Bn()],B.prototype,"operatorKey",2);var A=t=>{let n=t.map(i=>i.id),e=t.map(i=>i.operatorKey),r=t.map(i=>{let s=parseInt(i.id,10);if(isNaN(s))throw new E(n,e,`Invalid operator ID: ${i.id}`);if(!i.operatorKey)throw new E(n,e,`Operator key is missing for operator ID: ${s}`);return Cn(Ln({},i),{id:s})});return r.sort((i,s)=>i.id-s.id),r.map(i=>new B(i))};var q=class{extractKeys(n,e){return u(this,null,function*(){let r=yield new U(n).getPrivateKey(e);return p.deserializeHexStrToSecretKey||(yield p.init(p.BLS12_381)),{privateKey:`0x${r}`,publicKey:`0x${p.deserializeHexStrToSecretKey(r).getPublicKey().serializeToHexStr()}`}})}createThreshold(n,e){return u(this,null,function*(){let r=A(e);return this.threshold=yield new P().create(n,r.map(i=>i.id)),this.threshold})}encryptShares(n,e){return u(this,null,function*(){let i=A(n).map(s=>Buffer.from(s.operatorKey,"base64").toString());return new I(i,e).encrypt()})}buildShares(n,e){return u(this,null,function*(){let r=yield this.createThreshold(n,e);return this.encryptShares(e,r.shares)})}getThreshold(){return this.threshold}};q.SHARES_FORMAT_ABI="abi";var W=m(require("ethers"));var x=require("class-validator");var g=require("class-validator");var S=class{constructor(){this.ownerNonce=null;this.ownerAddress=null;this.publicKey=null;this.operators=null}update(n){n.ownerAddress&&(this.ownerAddress=n.ownerAddress),typeof n.ownerNonce=="number"&&(this.ownerNonce=n.ownerNonce),n.publicKey&&(this.publicKey=n.publicKey),n.operators&&(this.operators=A(n.operators))}validate(){return u(this,null,function*(){(0,g.validateSync)(this)})}get operatorIds(){var n;return(n=this.operators)!=null&&n.length?this.operators.map(e=>parseInt(String(e.id),10)):[]}get operatorPublicKeys(){var n;return(n=this.operators)!=null&&n.length?this.operators.map(e=>String(e.operatorKey)):[]}};l([(0,g.IsOptional)(),(0,g.IsNumber)(),wn()],S.prototype,"ownerNonce",2),l([(0,g.IsOptional)(),(0,g.IsString)(),Dn()],S.prototype,"ownerAddress",2),l([(0,g.IsOptional)(),(0,g.IsString)(),(0,g.Length)(98,98),L()],S.prototype,"publicKey",2),l([(0,g.IsOptional)(),(0,g.ValidateNested)({each:!0}),In()],S.prototype,"operators",2);var b=require("class-validator");var T=class{_sharesToBytes(n,e){let r=[...e].map(s=>"0x"+Buffer.from(s,"base64").toString("hex"));return`0x${pn([...n,...r]).toString("hex")}`}update(n){this.publicKey=n.publicKey,this.sharesData=n.sharesData,this.operatorIds=n.operatorIds,this.validate()}validate(){(0,b.validateSync)(this)}build(n){return this.publicKey=n.publicKey,this.operatorIds=n.operatorIds,this.sharesData=this._sharesToBytes(n.encryptedShares.map(e=>e.publicKey),n.encryptedShares.map(e=>e.privateKey)),this}};l([(0,b.IsString)()],T.prototype,"sharesData",2),l([(0,b.IsString)(),(0,b.Length)(98,98),L()],T.prototype,"publicKey",2),l([(0,b.IsNumber)({},{each:!0})],T.prototype,"operatorIds",2);var Qn=192,Xn=96,Kn=class{constructor(){this.data=new S,this.payload=new T}buildPayload(n,e){return u(this,null,function*(){let{ownerAddress:r,ownerNonce:i,privateKey:s}=e;if(!Number.isInteger(i)||i<0)throw new R(i,"Owner nonce is not positive integer");let o;try{o=C.utils.toChecksumAddress(r)}catch(f){throw new w(r,"Owner address is not a valid Ethereum address")}let a=this.payload.build({publicKey:n.publicKey,operatorIds:A(n.operators).map(f=>f.id),encryptedShares:n.encryptedShares}),h=yield Yn(`${o}:${i}`,s),d=pn([h,a.sharesData]);return a.sharesData=`0x${d.toString("hex")}`,yield this.validateSingleShares(a.sharesData,{ownerAddress:r,ownerNonce:i,publicKey:yield Zn(s)}),a})}validateSingleShares(n,e){return u(this,null,function*(){let{ownerAddress:r,ownerNonce:i,publicKey:s}=e;if(!Number.isInteger(i)||i<0)throw new R(i,"Owner nonce is not positive integer");let o=C.utils.toChecksumAddress(r),a=n.replace("0x","").substring(0,Qn);yield $n(`${o}:${i}`,`0x${a}`,s)})}buildSharesFromBytes(n,e){if(!n.startsWith("0x")||!/^(0x)?[0-9a-fA-F]*$/.test(n))throw new c("Invalid byte string format");if(e<=0||!Number.isInteger(e))throw new c("Invalid operator count");let i=n.replace("0x","").substring(Qn).substring(0,e*Xn),s=W.utils.arrayify("0x"+i),o=this.splitArray(e,s).map(f=>W.utils.hexlify(f)),a=n.substring(e*Xn),h=W.utils.arrayify("0x"+a),d=this.splitArray(e,h).map(f=>Buffer.from(W.utils.hexlify(f).replace("0x",""),"hex").toString("base64"));return{sharesPublicKeys:o,encryptedKeys:d}}update(n){this.data.update(n),this.validate()}validate(){(0,x.validateSync)(this)}toJson(){return JSON.stringify({data:this.data||null,payload:this.payload||null},null,2)}splitArray(n,e){let r=Math.floor(e.length/n),i=[];for(let s=0;s<n;s++){let o=s*r,a=o+r;i.push(e.slice(o,a))}return i}static fromJson(n){return u(this,null,function*(){let e=typeof n=="string"?JSON.parse(n):n,r=new Kn;return r.data.update(e.data),r.payload.update(e.payload),r.validate(),yield r.validateSingleShares(r.payload.sharesData,{ownerAddress:r.data.ownerAddress,ownerNonce:r.data.ownerNonce,publicKey:r.data.publicKey}),r})}},y=Kn;l([(0,x.IsOptional)(),(0,x.ValidateNested)()],y.prototype,"data",2),l([(0,x.IsOptional)(),(0,x.ValidateNested)()],y.prototype,"payload",2);var jn=m(require("semver"));var dn={name:"ssv-keys",version:"1.0.6",description:"Tool for splitting a validator key into a predefined threshold of shares via Shamir-Secret-Sharing (SSS), and encrypt them with a set of operator keys.",author:"SSV.Network",repository:"https://github.com/bloxapp/ssv-keys",license:"MIT",keywords:["ssv","ssv.network","keystore","shares"],main:"./dist/tsc/src/main.js",types:"./dist/tsc/src/main.d.ts",bin:{"ssv-keys":"./dist/tsc/src/cli.js"},engines:{node:">=12"},scripts:{"dev:cli":"ts-node src/cli.ts","dev:icli":"ts-node src/cli-interactive.ts",icli:"node ./dist/tsc/src/cli-interactive.js",cli:"node ./dist/tsc/src/cli.js",lint:"eslint src/ --ext .js,.jsx,.ts,.tsx",test:"jest",clean:"rm -rf dist build package","ts-node":"ts-node",docs:"typedoc",build:"tsc -p tsconfig.json","build-all":"yarn clean && yarn build && yarn esbuild",esbuild:"node ./esbuild.js","pre-commit":"yarn test && yarn lint && yarn build-all","package-linux":"pkg dist/tsc/src/cli-interactive.js --targets node14-linux-x64 --output bin/linux/ssv-keys-lin --compress GZip","package-macos":"pkg dist/tsc/src/cli-interactive.js --targets node14-macos-x64 --output bin/macos/ssv-keys-mac --compress GZip","package-win":"pkg dist/tsc/src/cli-interactive.js --targets node14-win-x64 --output bin/win/ssv-keys.exe --compress GZip","package-all":"yarn package-linux && yarn package-macos && yarn package-win"},devDependencies:{"@testing-library/jest-dom":"^5.16.4","@types/argparse":"^2.0.10","@types/atob":"^2.1.2","@types/btoa":"^1.2.3","@types/jest":"^26.0.24","@types/node":"^15.14.9","@types/prompts":"^2.0.14","@types/semver":"^7.5.0","@typescript-eslint/eslint-plugin":"^4.33.0","@typescript-eslint/parser":"^4.33.0",esbuild:"^0.14.38","esbuild-node-externals":"^1.4.1",eslint:"^7.32.0",husky:"^7.0.4",jest:"^26.6.3","jest-environment-jsdom":"^26.6.2","jest-environment-node":"^26.6.2","jest-environment-uint8array":"^1.0.0","jest-watch-typeahead":"0.6.5",jsdom:"^16.5.3","jsdom-global":"^3.0.2",pkg:"^5.7.0","ts-jest":"^26.5.6","ts-node":"^10.9.1",typedoc:"^0.22.15",typescript:"^4.6.4"},dependencies:{"@types/figlet":"^1.5.4","@types/underscore":"^1.11.4","@types/yargs":"^17.0.12",argparse:"^2.0.1",assert:"^2.0.0",atob:"^2.1.2","bls-eth-wasm":"^1.0.4","bls-signatures":"^0.2.5",btoa:"^1.2.1","class-validator":"^0.13.2",colors:"^1.4.0",crypto:"^1.0.1","eth2-keystore-js":"^1.0.8","ethereumjs-util":"^7.1.5","ethereumjs-wallet":"^1.0.1",ethers:"^5.7.2",events:"^3.3.0",figlet:"^1.5.2","js-base64":"^3.7.2",jsencrypt:"3.2.1",minimist:"^1.2.6",moment:"^2.29.3","node-jsencrypt":"^1.0.0",prompts:"https://github.com/meshin-blox/prompts.git","scrypt-js":"^3.0.1",semver:"^7.5.1",stream:"^0.0.2",underscore:"^1.13.4",web3:"1.7.3",yargs:"^17.5.1"},licenses:[{MIT:"SEE LICENSE IN LICENCE FILE"}]};var K=require("class-validator");var Nn=class{constructor(n=[]){this.shares=[...n]}add(n){this.shares.push(n)}list(){return this.shares}validate(){(0,K.validateSync)(this)}toJson(){return JSON.stringify({version:`v${dn.version}`,createdAt:new Date().toISOString(),shares:this.shares.length>0?this.shares:null},null,2)}static fromJson(n){return u(this,null,function*(){let e=typeof n=="string"?JSON.parse(n):n,r=jn.default.parse(e.version),i=jn.default.parse(dn.version);if(!r||!i)throw new c("The file for keyshares must contain a version mark provided by ssv-keys.");if(!r||i.major!==r.major||i.minor!==r.minor)throw new c(`The keyshares file you are attempting to reuse does not have the same version (v${dn.version}) as supported by ssv-keys`);let s=new Nn;if(s.shares=[],Array.isArray(e.shares))for(let o of e.shares)s.shares.push(yield y.fromJson(o));else s.shares.push(yield y.fromJson(e));return s})}},F=Nn;l([(0,K.IsOptional)(),(0,K.ValidateNested)({each:!0})],F.prototype,"shares",2);0&&(module.exports={Encryption,EthereumKeyStore,KeyShares,KeySharesItem,SSVKeys,SSVKeysException,Threshold});
+//# sourceURL=webpack://JSEncrypt/./lib/version.json?`)}},__webpack_module_cache__={};function __webpack_require__(t){var n=__webpack_module_cache__[t];if(n!==void 0)return n.exports;var e=__webpack_module_cache__[t]={exports:{}};return __webpack_modules__[t](e,e.exports,__webpack_require__),e.exports}__webpack_require__.d=(t,n)=>{for(var e in n)__webpack_require__.o(n,e)&&!__webpack_require__.o(t,e)&&Object.defineProperty(t,e,{enumerable:!0,get:n[e]})},__webpack_require__.o=(t,n)=>Object.prototype.hasOwnProperty.call(t,n),__webpack_require__.r=t=>{typeof Symbol!="undefined"&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})};var __webpack_exports__=__webpack_require__("./lib/index.js");return __webpack_exports__=__webpack_exports__.default,__webpack_exports__})()})},{}]},{},[1])(1)})});var de={};ce(de,{Encryption:()=>I,EthereumKeyStore:()=>U,KeyShares:()=>F,KeySharesItem:()=>m,SSVKeys:()=>q,SSVKeysException:()=>l,Threshold:()=>P});module.exports=pe(de);var gn;try{window.crypto,gn=require("bls-eth-wasm/browser")}catch(t){gn=require("bls-eth-wasm")}var c=gn;var l=class extends Error{constructor(e){super(e);this.name=this.constructor.name,Error.captureStackTrace(this,this.constructor),this.trace=this.stack,this.stack=`${this.name}: ${this.message}`}};var G=class extends l{constructor(e,r){super(r);this.data=e}},Y=class extends l{constructor(e,r){super(r);this.data=e}},$=class extends l{constructor(n){super(n)}},v=class extends l{constructor(n){super(n)}},Z=class extends l{constructor(e,r){super(r);this.data=e}},w=class extends l{constructor(e,r){super(r);this.data=e}},R=class extends l{constructor(e,r){super(r);this.data=e}};var qn=b(require("eth2-keystore-js"));var le=b(require("moment")),Vn=require("fs");var Hn=(t,n=!0)=>u(void 0,null,function*(){return Vn.promises.readFile(t,{encoding:"utf-8"}).then(e=>n?JSON.parse(e):e)});var fn=class{constructor(){this.keystoreFilePath=""}validatePassword(n,e){return u(this,null,function*(){if(!n.trim().length)return"Password is empty";let r="Invalid keystore file password.",i;try{let s=yield Hn(e);i=!!(yield new qn.default(s).getPrivateKey(n))}catch(s){i=r}return i})}},ue=new fn;var _n=class{constructor(){this.operatorsCount=3}setOperatorsCount(n){this.operatorsCount=n}},mn=t=>!(t<4||t>13||t%3!=1),Re=new _n;var yn=require("js-base64");var bn;try{window.crypto,bn=require("jsencrypt").JSEncrypt}catch(t){bn=Wn()}var Q=bn;var X=class extends l{constructor(e,r){super(r);this.operator=e}},nn=class extends l{constructor(e,r){super(r);this.operator=e}},S=class extends l{constructor(e,r,i){super(i);this.listOne=e,this.listTwo=r}},O=class extends l{constructor(e,r){super(r);this.operator=e}};var N=t=>{t=t.trim();let n="-----BEGIN RSA PUBLIC KEY-----",e="-----END RSA PUBLIC KEY-----",r=new Q({}),i="";try{let s="";if(t.startsWith(n))s=t;else{if(t.length<98)throw new Error("The length of the operator public key must be at least 98 characters.");try{s=(0,yn.decode)(t).trim()}catch(o){throw new Error("Failed to decode the operator public key. Ensure it's correctly base64 encoded.")}if(!s.startsWith(n))throw new Error(`Operator public key does not start with '${n}'`)}if(!s.endsWith(e))throw new Error(`Operator public key does not end with '${e}'`);try{let o=s.slice(n.length,t.length-e.length).trim();i=(0,yn.decode)(o)}catch(o){throw new Error("Failed to decode the RSA public key. Ensure it's correctly base64 encoded.")}try{r.setPublicKey(i)}catch(o){throw new Error("Invalid operator key format, make sure the operator exists in the network.")}}catch(s){throw new O({rsa:i,base64:t},s.message)}return!0};var En=class extends l{constructor(e,r){super(r);this.operators=e}},Sn=class extends l{constructor(e,r){super(r);this.operator=e}},xn=class{constructor(){this.shares=[]}static get DEFAULT_THRESHOLD_NUMBER(){return 3}create(n,e){return u(this,null,function*(){if(!n.startsWith("0x"))throw new Z(n,"The private key must be provided in the 0x format.");if(e.map(a=>{if(!Number.isInteger(a))throw new Sn(a,`Operator must be integer. Got: ${a}`)}),!mn(e.length))throw new En(e,"Invalid operators amount. Enter an 3f+1 compatible amount of operator ids.");let r=[],i=[];c.deserializeHexStrToSecretKey||(yield c.init(c.BLS12_381)),this.privateKey=c.deserializeHexStrToSecretKey(n.replace("0x","")),this.publicKey=this.privateKey.getPublicKey(),r.push(this.privateKey),i.push(this.publicKey);let s=(e.length-1)/3;for(let a=1;a<e.length-s;a+=1){let h=new c.SecretKey;h.setByCSPRNG(),r.push(h);let d=h.getPublicKey();i.push(d)}for(let a of e){let h=new c.Id;h.setInt(a);let d=new c.SecretKey;d.share(r,h);let f=new c.PublicKey;f.share(i,h),this.shares.push({privateKey:`0x${d.serializeToHexStr()}`,publicKey:`0x${f.serializeToHexStr()}`,id:h})}return{privateKey:`0x${this.privateKey.serializeToHexStr()}`,publicKey:`0x${this.publicKey.serializeToHexStr()}`,shares:this.shares}})}},P=xn;var vn=b(require("crypto")),Fn=require("scrypt-js"),en=b(require("ethereumjs-wallet")),tn=require("ethereumjs-util");var Rn=class{constructor(n){this.privateKey="";if(!n)throw new G(n,"Key store data should be JSON or string");if(typeof n=="string"?this.keyStoreData=JSON.parse(n):this.keyStoreData=n,!this.keyStoreData.version)throw new Y(this.keyStoreData,"Invalid keystore file")}getPublicKey(){var n;if(this.keyStoreData)switch((n=this.keyStoreData.version)!=null?n:this.keyStoreData.Version){case 1:return this.keyStoreData.Address;case 3:return this.keyStoreData.id;case 4:return this.keyStoreData.pubkey}return""}getPrivateKey(n=""){return u(this,null,function*(){if(this.privateKey)return this.privateKey;switch(this.keyStoreData.version){case 1:this.wallet=yield en.default.fromV1(this.keyStoreData,n);break;case 3:this.wallet=yield en.default.fromV3(this.keyStoreData,n,!0);break;case 4:this.wallet=yield this.fromV4(this.keyStoreData,n);break}if(this.wallet&&(this.privateKey=this.wallet.getPrivateKey().toString("hex"),!this.privateKey))throw new $("Invalid password");return this.privateKey})}fromV4(n,e){return u(this,null,function*(){let r=typeof n=="object"?n:JSON.parse(n);if(r.version!==4)throw new v("Not a V4 wallet");let i,s;if(r.crypto.kdf.function==="scrypt")s=r.crypto.kdf.params,i=(0,Fn.syncScrypt)(Buffer.from(e),Buffer.from(s.salt,"hex"),s.n,s.r,s.p,s.dklen);else if(r.crypto.kdf.function==="pbkdf2"){if(s=r.crypto.kdf.params,s.prf!=="hmac-sha256")throw new v("Unsupported parameters to PBKDF2");i=vn.default.pbkdf2Sync(Buffer.from(e),Buffer.from(s.salt,"hex"),s.c,s.dklen,"sha256")}else throw new v("Unsupported key derivation scheme");let o=Buffer.from(r.crypto.cipher.message,"hex"),a=Buffer.concat([Buffer.from(i.slice(16,32)),o]),d={keccak256:tn.keccak256,sha256:tn.sha256}[r.crypto.checksum.function];if(d(a).toString("hex")!==r.crypto.checksum.message)throw new v("Invalid password");let j=vn.default.createDecipheriv(r.crypto.cipher.function,i.slice(0,16),Buffer.from(r.crypto.cipher.params.iv,"hex")),z=this.runCipherBuffer(j,o);return new en.default(z)})}runCipherBuffer(n,e){return Buffer.concat([n.update(e),n.final()])}static toHexString(n){return Array.from(n,e=>`0${(e&255).toString(16)}`.slice(-2)).join("")}},U=Rn;var I=class{constructor(n,e){this.operatorPublicKeys=[...n],this.shares=e}encrypt(){let n=[];for(let[e,r]of this.operatorPublicKeys.entries()){N(r);let i=new Q({});i.setPublicKey(r);let s=i.encrypt(this.shares[e].privateKey);if(!s)throw new O({rsa:r,base64:s},"Private key encryption failed.");let o={operatorPublicKey:r,privateKey:s,publicKey:this.shares[e].publicKey};n.push(o)}return n}};var _=require("class-validator");var rn=require("class-validator");var k=class{validate(n){let e=new Set,r=new Set;for(let i of n||[]){if(e.has(i.id))throw new X(i,`The operator ID '${i.id}' is duplicated in the list`);if(e.add(i.id),r.has(i.operatorKey))throw new nn(i,`The public key for operator ID ${i.id} is duplicated in the list`);r.add(i.operatorKey)}return!0}defaultMessage(){return"The list of operators contains duplicate entries"}};k=p([(0,rn.ValidatorConstraint)({name:"uniqueList",async:!1})],k);function In(t){return function(n,e){(0,rn.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:k})}}var on=require("class-validator");var sn=class extends l{constructor(e,r){super(r);this.publicKey=e}},an=class extends l{constructor(e,r){super(r);this.data=e}};var M=class{validate(n){return u(this,null,function*(){try{typeof n=="string"?c.deserializeHexStrToPublicKey(n.replace("0x","")):n.forEach(e=>c.deserializeHexStrToPublicKey(e.replace("0x","")))}catch(e){throw new sn(n,"Failed to BLS deserialize validator public key")}return!0})}defaultMessage(){return"Invalid public key"}};M=p([(0,on.ValidatorConstraint)({name:"publicKey",async:!0})],M);function L(t){return function(n,e){(0,on.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:M})}}var pn=require("class-validator");var zn=b(require("web3")),Gn=b(require("ethers")),An=b(require("ethereumjs-util"));var C=new zn.default;var cn=t=>{let n=new Uint8Array(t.map(e=>[...Gn.utils.arrayify(e)]).flat());return Buffer.from(n)},Yn=(t,n)=>u(void 0,null,function*(){c.deserializeHexStrToSecretKey||(yield c.init(c.BLS12_381));let e=c.deserializeHexStrToSecretKey(n.replace("0x","")),r=An.keccak256(Buffer.from(t));return`0x${e.sign(new Uint8Array(r)).serializeToHexStr()}`}),$n=(t,n,e)=>u(void 0,null,function*(){c.deserializeHexStrToSecretKey||(yield c.init(c.BLS12_381));let r=c.deserializeHexStrToPublicKey(e.replace("0x","")),i=c.deserializeHexStrToSignature(n.replace("0x","")),s=An.keccak256(Buffer.from(t));if(!r.verify(i,new Uint8Array(s)))throw new an(n,"Single shares signature is invalid")}),Zn=t=>u(void 0,null,function*(){return c.deserializeHexStrToSecretKey||(yield c.init(c.BLS12_381)),`0x${c.deserializeHexStrToSecretKey(t.replace("0x","")).getPublicKey().serializeToHexStr()}`});var J=class{validate(n){try{C.utils.toChecksumAddress(n)}catch(e){throw new w(n,"Owner address is not a valid Ethereum address")}return!0}defaultMessage(){return"Invalid owner address"}};J=p([(0,pn.ValidatorConstraint)({name:"ownerAddress",async:!1})],J);function Dn(t){return function(n,e){(0,pn.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:J})}}var ln=require("class-validator");var V=class{validate(n){if(!Number.isInteger(n)||n<0)throw new R(n,"Owner nonce is not positive integer");return!0}defaultMessage(){return"Invalid owner nonce"}};V=p([(0,ln.ValidatorConstraint)({name:"ownerNonce",async:!1})],V);function wn(t){return function(n,e){(0,ln.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:V})}}var On=require("class-validator");var un=class{validate(n,e){let[r,i]=e.constraints,s=e.object[r].length;if(!Array.isArray(n))Object.values(n).forEach(o=>{if(s!==o.length)throw new S(e.object[r],n,i.message)});else if(s!==n.length)throw new S(e.object[r],n,i.message);return!0}defaultMessage(){return"The length of the entries lists are not equal"}};un=p([(0,On.ValidatorConstraint)({name:"matchLength",async:!1})],un);var hn=require("class-validator");var H=class{validate(n){return N(n)}defaultMessage(){return"Invalid operator public key"}};H=p([(0,hn.ValidatorConstraint)({name:"operatorKey",async:!1})],H);function Bn(t){return function(n,e){(0,hn.registerDecorator)({target:n.constructor,propertyName:e,options:t,constraints:[],validator:H})}}var B=class{constructor(n){this.id=n.id,this.operatorKey=n.operatorKey,this.validate()}validate(){(0,_.validateSync)(this)}};p([(0,_.IsNotEmpty)({message:"The operator id is null"}),(0,_.IsDefined)({message:"The operator id is undefined"}),(0,_.IsInt)({message:"The operator id must be an integer"})],B.prototype,"id",2),p([(0,_.IsNotEmpty)({message:"The operator public key is null"}),(0,_.IsDefined)({message:"The operator public key is undefined"}),(0,_.IsString)({message:"The operator public key must be a string"}),Bn()],B.prototype,"operatorKey",2);var A=t=>{let n=t.map(i=>i.id),e=t.map(i=>i.operatorKey),r=t.map(i=>{let s=parseInt(i.id,10);if(isNaN(s))throw new S(n,e,`Invalid operator ID: ${i.id}`);if(!i.operatorKey)throw new S(n,e,`Operator key is missing for operator ID: ${s}`);return Cn(Ln({},i),{id:s})});return r.sort((i,s)=>i.id-s.id),r.map(i=>new B(i))};var q=class{extractKeys(n,e){return u(this,null,function*(){let r=yield new U(n).getPrivateKey(e);return c.deserializeHexStrToSecretKey||(yield c.init(c.BLS12_381)),{privateKey:`0x${r}`,publicKey:`0x${c.deserializeHexStrToSecretKey(r).getPublicKey().serializeToHexStr()}`}})}createThreshold(n,e){return u(this,null,function*(){let r=A(e);return this.threshold=yield new P().create(n,r.map(i=>i.id)),this.threshold})}encryptShares(n,e){return u(this,null,function*(){let i=A(n).map(s=>Buffer.from(s.operatorKey,"base64").toString());return new I(i,e).encrypt()})}buildShares(n,e){return u(this,null,function*(){let r=yield this.createThreshold(n,e);return this.encryptShares(e,r.shares)})}getThreshold(){return this.threshold}};q.SHARES_FORMAT_ABI="abi";var W=b(require("ethers"));var E=require("class-validator");var g=require("class-validator");var x=class{constructor(){this.ownerNonce=null;this.ownerAddress=null;this.publicKey=null;this.operators=null}update(n){n.ownerAddress&&(this.ownerAddress=n.ownerAddress),typeof n.ownerNonce=="number"&&(this.ownerNonce=n.ownerNonce),n.publicKey&&(this.publicKey=n.publicKey),n.operators&&(this.operators=A(n.operators))}validate(){return u(this,null,function*(){(0,g.validateSync)(this)})}get operatorIds(){var n;return(n=this.operators)!=null&&n.length?this.operators.map(e=>parseInt(String(e.id),10)):[]}get operatorPublicKeys(){var n;return(n=this.operators)!=null&&n.length?this.operators.map(e=>String(e.operatorKey)):[]}};p([(0,g.IsOptional)(),(0,g.IsNumber)(),wn()],x.prototype,"ownerNonce",2),p([(0,g.IsOptional)(),(0,g.IsString)(),Dn()],x.prototype,"ownerAddress",2),p([(0,g.IsOptional)(),(0,g.IsString)(),(0,g.Length)(98,98),L()],x.prototype,"publicKey",2),p([(0,g.IsOptional)(),(0,g.ValidateNested)({each:!0}),In()],x.prototype,"operators",2);var y=require("class-validator");var T=class{_sharesToBytes(n,e){let r=[...e].map(s=>"0x"+Buffer.from(s,"base64").toString("hex"));return`0x${cn([...n,...r]).toString("hex")}`}update(n){this.publicKey=n.publicKey,this.sharesData=n.sharesData,this.operatorIds=n.operatorIds,this.validate()}validate(){(0,y.validateSync)(this)}build(n){return this.publicKey=n.publicKey,this.operatorIds=n.operatorIds,this.sharesData=this._sharesToBytes(n.encryptedShares.map(e=>e.publicKey),n.encryptedShares.map(e=>e.privateKey)),this}};p([(0,y.IsString)()],T.prototype,"sharesData",2),p([(0,y.IsString)(),(0,y.Length)(98,98),L()],T.prototype,"publicKey",2),p([(0,y.IsNumber)({},{each:!0})],T.prototype,"operatorIds",2);var Qn=192,Xn=96,Kn=class{constructor(){this.error=null;this.data=new x,this.payload=new T}buildPayload(n,e){return u(this,null,function*(){let{ownerAddress:r,ownerNonce:i,privateKey:s}=e;if(!Number.isInteger(i)||i<0)throw new R(i,"Owner nonce is not positive integer");let o;try{o=C.utils.toChecksumAddress(r)}catch(f){throw new w(r,"Owner address is not a valid Ethereum address")}let a=this.payload.build({publicKey:n.publicKey,operatorIds:A(n.operators).map(f=>f.id),encryptedShares:n.encryptedShares}),h=yield Yn(`${o}:${i}`,s),d=cn([h,a.sharesData]);return a.sharesData=`0x${d.toString("hex")}`,yield this.validateSingleShares(a.sharesData,{ownerAddress:r,ownerNonce:i,publicKey:yield Zn(s)}),a})}validateSingleShares(n,e){return u(this,null,function*(){let{ownerAddress:r,ownerNonce:i,publicKey:s}=e;if(!Number.isInteger(i)||i<0)throw new R(i,"Owner nonce is not positive integer");let o=C.utils.toChecksumAddress(r),a=n.replace("0x","").substring(0,Qn);yield $n(`${o}:${i}`,`0x${a}`,s)})}buildSharesFromBytes(n,e){if(!n.startsWith("0x")||!/^(0x)?[0-9a-fA-F]*$/.test(n))throw new l("Invalid byte string format");if(e<=0||!Number.isInteger(e))throw new l("Invalid operator count");let i=n.replace("0x","").substring(Qn).substring(0,e*Xn),s=W.utils.arrayify("0x"+i),o=this.splitArray(e,s).map(f=>W.utils.hexlify(f)),a=n.substring(e*Xn),h=W.utils.arrayify("0x"+a),d=this.splitArray(e,h).map(f=>Buffer.from(W.utils.hexlify(f).replace("0x",""),"hex").toString("base64"));return{sharesPublicKeys:o,encryptedKeys:d}}update(n){this.data.update(n),this.validate()}validate(){(0,E.validateSync)(this)}toJson(){return JSON.stringify({data:this.data||null,payload:this.payload||null},null,2)}splitArray(n,e){let r=Math.floor(e.length/n),i=[];for(let s=0;s<n;s++){let o=s*r,a=o+r;i.push(e.slice(o,a))}return i}static fromJson(n){return u(this,null,function*(){let e=typeof n=="string"?JSON.parse(n):n,r=new Kn;try{r.data.update(e.data),r.payload.update(e.payload),r.validate(),yield r.validateSingleShares(r.payload.sharesData,{ownerAddress:r.data.ownerAddress,ownerNonce:r.data.ownerNonce,publicKey:r.data.publicKey})}catch(i){r.error=i}return r})}},m=Kn;p([(0,E.IsOptional)(),(0,E.ValidateNested)()],m.prototype,"data",2),p([(0,E.IsOptional)(),(0,E.ValidateNested)()],m.prototype,"payload",2),p([(0,E.IsOptional)()],m.prototype,"error",2);var jn=b(require("semver"));var dn={name:"ssv-keys",version:"1.0.10",description:"Tool for splitting a validator key into a predefined threshold of shares via Shamir-Secret-Sharing (SSS), and encrypt them with a set of operator keys.",author:"SSV.Network",repository:"https://github.com/bloxapp/ssv-keys",license:"MIT",keywords:["ssv","ssv.network","keystore","shares"],main:"./dist/tsc/src/main.js",types:"./dist/tsc/src/main.d.ts",bin:{"ssv-keys":"./dist/tsc/src/cli.js"},engines:{node:">=12"},scripts:{"dev:cli":"ts-node src/cli.ts","dev:icli":"ts-node src/cli-interactive.ts",icli:"node ./dist/tsc/src/cli-interactive.js",cli:"node ./dist/tsc/src/cli.js",lint:"eslint src/ --ext .js,.jsx,.ts,.tsx",test:"jest",clean:"rm -rf dist build package","ts-node":"ts-node",docs:"typedoc",build:"tsc -p tsconfig.json","build-all":"yarn clean && yarn build && yarn esbuild",esbuild:"node ./esbuild.js","pre-commit":"yarn test && yarn lint && yarn build-all","package-linux":"pkg dist/tsc/src/cli-interactive.js --targets node14-linux-x64 --output bin/linux/ssv-keys-lin --compress GZip","package-macos":"pkg dist/tsc/src/cli-interactive.js --targets node14-macos-x64 --output bin/macos/ssv-keys-mac --compress GZip","package-win":"pkg dist/tsc/src/cli-interactive.js --targets node14-win-x64 --output bin/win/ssv-keys.exe --compress GZip","package-all":"yarn package-linux && yarn package-macos && yarn package-win"},devDependencies:{"@testing-library/jest-dom":"^5.16.4","@types/argparse":"^2.0.10","@types/atob":"^2.1.2","@types/btoa":"^1.2.3","@types/jest":"^26.0.24","@types/node":"^15.14.9","@types/prompts":"^2.0.14","@types/semver":"^7.5.0","@typescript-eslint/eslint-plugin":"^4.33.0","@typescript-eslint/parser":"^4.33.0",esbuild:"^0.14.38","esbuild-node-externals":"^1.4.1",eslint:"^7.32.0",husky:"^7.0.4",jest:"^26.6.3","jest-environment-jsdom":"^26.6.2","jest-environment-node":"^26.6.2","jest-environment-uint8array":"^1.0.0","jest-watch-typeahead":"0.6.5",jsdom:"^16.5.3","jsdom-global":"^3.0.2",pkg:"^5.7.0","ts-jest":"^26.5.6","ts-node":"^10.9.1",typedoc:"^0.22.15",typescript:"^4.6.4"},dependencies:{"@types/figlet":"^1.5.4","@types/underscore":"^1.11.4","@types/yargs":"^17.0.12",argparse:"^2.0.1",assert:"^2.0.0",atob:"^2.1.2","bls-eth-wasm":"^1.0.4","bls-signatures":"^0.2.5",btoa:"^1.2.1","class-validator":"^0.13.2",colors:"^1.4.0",crypto:"^1.0.1","eth2-keystore-js":"^1.0.8","ethereumjs-util":"^7.1.5","ethereumjs-wallet":"^1.0.1",ethers:"^5.7.2",events:"^3.3.0",figlet:"^1.5.2","js-base64":"^3.7.2",jsencrypt:"3.2.1",minimist:"^1.2.6",moment:"^2.29.3","node-jsencrypt":"^1.0.0",prompts:"https://github.com/meshin-blox/prompts.git","scrypt-js":"^3.0.1",semver:"^7.5.1",stream:"^0.0.2",underscore:"^1.13.4",web3:"1.7.3",yargs:"^17.5.1"},licenses:[{MIT:"SEE LICENSE IN LICENCE FILE"}]};var K=require("class-validator");var Nn=class{constructor(n=[]){this.shares=[...n]}add(n){this.shares.push(n)}list(){return this.shares}validate(){(0,K.validateSync)(this)}toJson(){return JSON.stringify({version:`v${dn.version}`,createdAt:new Date().toISOString(),shares:this.shares.length>0?this.shares:null},null,2)}static fromJson(n){return u(this,null,function*(){let e=typeof n=="string"?JSON.parse(n):n,r=jn.default.parse(e.version),i=jn.default.parse(dn.version);if(!r||!i)throw new l("The file for keyshares must contain a version mark provided by ssv-keys.");if(!r||i.major!==r.major||i.minor!==r.minor)throw new l(`The keyshares file you are attempting to reuse does not have the same version (v${dn.version}) as supported by ssv-keys`);let s=new Nn;if(s.shares=[],Array.isArray(e.shares))for(let o of e.shares)s.shares.push(yield m.fromJson(o));else s.shares.push(yield m.fromJson(e));return s})}},F=Nn;p([(0,K.IsOptional)(),(0,K.ValidateNested)({each:!0})],F.prototype,"shares",2);0&&(module.exports={Encryption,EthereumKeyStore,KeyShares,KeySharesItem,SSVKeys,SSVKeysException,Threshold});
diff --git a/dist/esbuild/main.js.map b/dist/esbuild/main.js.map
index 7f181b4c..12338f05 100644
--- a/dist/esbuild/main.js.map
+++ b/dist/esbuild/main.js.map
@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/lib/JSEncrypt/jsencrypt.bundle.js", "../../src/main.ts", "../../src/lib/BLS/index.ts", "../../src/lib/exceptions/base.ts", "../../src/lib/exceptions/keystore.ts", "../../src/commands/actions/validators/keystore-password.ts", "../../src/lib/helpers/file.helper.ts", "../../src/commands/actions/validators/operator-ids.ts", "../../src/commands/actions/validators/operator.ts", "../../src/lib/JSEncrypt/index.ts", "../../src/lib/exceptions/operator.ts", "../../src/lib/Threshold/Threshold.ts", "../../src/lib/EthereumKeyStore/EthereumKeyStore.ts", "../../src/lib/Encryption/Encryption.ts", "../../src/lib/KeyShares/KeySharesData/OperatorData.ts", "../../src/lib/KeyShares/KeySharesData/validators/operator-unique.ts", "../../src/lib/KeyShares/KeySharesData/validators/public-key.ts", "../../src/lib/exceptions/bls.ts", "../../src/lib/KeyShares/KeySharesData/validators/owner-address.ts", "../../src/lib/helpers/web3.helper.ts", "../../src/lib/KeyShares/KeySharesData/validators/owner-nonce.ts", "../../src/lib/KeyShares/KeySharesData/validators/match.ts", "../../src/lib/KeyShares/KeySharesData/validators/operator-public-key.ts", "../../src/lib/helpers/operator.helper.ts", "../../src/lib/SSVKeys.ts", "../../src/lib/KeyShares/KeySharesItem.ts", "../../src/lib/KeyShares/KeySharesData/KeySharesData.ts", "../../src/lib/KeyShares/KeySharesData/KeySharesPayload.ts", "../../src/lib/KeyShares/KeyShares.ts"],
-  "sourcesContent": ["const window = global;(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}g.JSEncrypt = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){\n\nconst JSEncrypt = require('jsencrypt');\n\nmodule.exports = JSEncrypt;\n\n},{\"jsencrypt\":2}],2:[function(require,module,exports){\n/*\n * ATTENTION: The \"eval\" devtool has been used (maybe by default in mode: \"development\").\n * This devtool is neither made for production nor for readable output files.\n * It uses \"eval()\" calls to create a separate source file in the browser devtools.\n * If you are trying to read the output file, select a different devtool (https://webpack.js.org/configuration/devtool/)\n * or disable the default devtool with \"devtool: false\".\n * If you are looking for production-ready output files, see mode: \"production\" (https://webpack.js.org/configuration/mode/).\n */\n(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"JSEncrypt\"] = factory();\n\telse\n\t\troot[\"JSEncrypt\"] = factory();\n})(window, function() {\nreturn /******/ (() => { // webpackBootstrap\n/******/ \t\"use strict\";\n/******/ \tvar __webpack_modules__ = ({\n\n/***/ \"./lib/JSEncrypt.js\":\n/*!**************************!*\\\n  !*** ./lib/JSEncrypt.js ***!\n  \\**************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"JSEncrypt\\\": () => (/* binding */ JSEncrypt)\\n/* harmony export */ });\\n/* harmony import */ var _lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./lib/jsbn/base64 */ \\\"./lib/lib/jsbn/base64.js\\\");\\n/* harmony import */ var _JSEncryptRSAKey__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./JSEncryptRSAKey */ \\\"./lib/JSEncryptRSAKey.js\\\");\\n/* harmony import */ var _version_json__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./version.json */ \\\"./lib/version.json\\\");\\n\\n\\n\\n/**\\n *\\n * @param {Object} [options = {}] - An object to customize JSEncrypt behaviour\\n * possible parameters are:\\n * - default_key_size        {number}  default: 1024 the key size in bit\\n * - default_public_exponent {string}  default: '010001' the hexadecimal representation of the public exponent\\n * - log                     {boolean} default: false whether log warn/error or not\\n * @constructor\\n */\\nvar JSEncrypt = /** @class */ (function () {\\n    function JSEncrypt(options) {\\n        if (options === void 0) { options = {}; }\\n        options = options || {};\\n        this.default_key_size = options.default_key_size ? parseInt(options.default_key_size, 10) : 1024;\\n        this.default_public_exponent = options.default_public_exponent || \\\"010001\\\"; // 65537 default openssl public exponent for rsa key type\\n        this.log = options.log || false;\\n        // The private and public key.\\n        this.key = null;\\n    }\\n    /**\\n     * Method to set the rsa key parameter (one method is enough to set both the public\\n     * and the private key, since the private key contains the public key paramenters)\\n     * Log a warning if logs are enabled\\n     * @param {Object|string} key the pem encoded string or an object (with or without header/footer)\\n     * @public\\n     */\\n    JSEncrypt.prototype.setKey = function (key) {\\n        if (this.log && this.key) {\\n            console.warn(\\\"A key was already set, overriding existing.\\\");\\n        }\\n        this.key = new _JSEncryptRSAKey__WEBPACK_IMPORTED_MODULE_1__.JSEncryptRSAKey(key);\\n    };\\n    /**\\n     * Proxy method for setKey, for api compatibility\\n     * @see setKey\\n     * @public\\n     */\\n    JSEncrypt.prototype.setPrivateKey = function (privkey) {\\n        // Create the key.\\n        this.setKey(privkey);\\n    };\\n    /**\\n     * Proxy method for setKey, for api compatibility\\n     * @see setKey\\n     * @public\\n     */\\n    JSEncrypt.prototype.setPublicKey = function (pubkey) {\\n        // Sets the public key.\\n        this.setKey(pubkey);\\n    };\\n    /**\\n     * Proxy method for RSAKey object's decrypt, decrypt the string using the private\\n     * components of the rsa key object. Note that if the object was not set will be created\\n     * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor\\n     * @param {string} str base64 encoded crypted string to decrypt\\n     * @return {string} the decrypted string\\n     * @public\\n     */\\n    JSEncrypt.prototype.decrypt = function (str) {\\n        // Return the decrypted string.\\n        try {\\n            return this.getKey().decrypt((0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.b64tohex)(str));\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Proxy method for RSAKey object's encrypt, encrypt the string using the public\\n     * components of the rsa key object. Note that if the object was not set will be created\\n     * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor\\n     * @param {string} str the string to encrypt\\n     * @return {string} the encrypted string encoded in base64\\n     * @public\\n     */\\n    JSEncrypt.prototype.encrypt = function (str) {\\n        // Return the encrypted string.\\n        try {\\n            return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getKey().encrypt(str));\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Proxy method for RSAKey object's sign.\\n     * @param {string} str the string to sign\\n     * @param {function} digestMethod hash method\\n     * @param {string} digestName the name of the hash algorithm\\n     * @return {string} the signature encoded in base64\\n     * @public\\n     */\\n    JSEncrypt.prototype.sign = function (str, digestMethod, digestName) {\\n        // return the RSA signature of 'str' in 'hex' format.\\n        try {\\n            return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getKey().sign(str, digestMethod, digestName));\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Proxy method for RSAKey object's verify.\\n     * @param {string} str the string to verify\\n     * @param {string} signature the signature encoded in base64 to compare the string to\\n     * @param {function} digestMethod hash method\\n     * @return {boolean} whether the data and signature match\\n     * @public\\n     */\\n    JSEncrypt.prototype.verify = function (str, signature, digestMethod) {\\n        // Return the decrypted 'digest' of the signature.\\n        try {\\n            return this.getKey().verify(str, (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.b64tohex)(signature), digestMethod);\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Getter for the current JSEncryptRSAKey object. If it doesn't exists a new object\\n     * will be created and returned\\n     * @param {callback} [cb] the callback to be called if we want the key to be generated\\n     * in an async fashion\\n     * @returns {JSEncryptRSAKey} the JSEncryptRSAKey object\\n     * @public\\n     */\\n    JSEncrypt.prototype.getKey = function (cb) {\\n        // Only create new if it does not exist.\\n        if (!this.key) {\\n            // Get a new private key.\\n            this.key = new _JSEncryptRSAKey__WEBPACK_IMPORTED_MODULE_1__.JSEncryptRSAKey();\\n            if (cb && {}.toString.call(cb) === \\\"[object Function]\\\") {\\n                this.key.generateAsync(this.default_key_size, this.default_public_exponent, cb);\\n                return;\\n            }\\n            // Generate the key.\\n            this.key.generate(this.default_key_size, this.default_public_exponent);\\n        }\\n        return this.key;\\n    };\\n    /**\\n     * Returns the pem encoded representation of the private key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the private key WITH header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPrivateKey = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPrivateKey();\\n    };\\n    /**\\n     * Returns the pem encoded representation of the private key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the private key WITHOUT header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPrivateKeyB64 = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPrivateBaseKeyB64();\\n    };\\n    /**\\n     * Returns the pem encoded representation of the public key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the public key WITH header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPublicKey = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPublicKey();\\n    };\\n    /**\\n     * Returns the pem encoded representation of the public key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the public key WITHOUT header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPublicKeyB64 = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPublicBaseKeyB64();\\n    };\\n    JSEncrypt.version = _version_json__WEBPACK_IMPORTED_MODULE_2__.version;\\n    return JSEncrypt;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/JSEncrypt.js?\");\n\n/***/ }),\n\n/***/ \"./lib/JSEncryptRSAKey.js\":\n/*!********************************!*\\\n  !*** ./lib/JSEncryptRSAKey.js ***!\n  \\********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"JSEncryptRSAKey\\\": () => (/* binding */ JSEncryptRSAKey)\\n/* harmony export */ });\\n/* harmony import */ var _lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./lib/jsbn/base64 */ \\\"./lib/lib/jsbn/base64.js\\\");\\n/* harmony import */ var _lib_asn1js_hex__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./lib/asn1js/hex */ \\\"./lib/lib/asn1js/hex.js\\\");\\n/* harmony import */ var _lib_asn1js_base64__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./lib/asn1js/base64 */ \\\"./lib/lib/asn1js/base64.js\\\");\\n/* harmony import */ var _lib_asn1js_asn1__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./lib/asn1js/asn1 */ \\\"./lib/lib/asn1js/asn1.js\\\");\\n/* harmony import */ var _lib_jsbn_rsa__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./lib/jsbn/rsa */ \\\"./lib/lib/jsbn/rsa.js\\\");\\n/* harmony import */ var _lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./lib/jsbn/jsbn */ \\\"./lib/lib/jsbn/jsbn.js\\\");\\n/* harmony import */ var _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./lib/jsrsasign/asn1-1.0 */ \\\"./lib/lib/jsrsasign/asn1-1.0.js\\\");\\nvar __extends = (undefined && undefined.__extends) || (function () {\\n    var extendStatics = function (d, b) {\\n        extendStatics = Object.setPrototypeOf ||\\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\\n        return extendStatics(d, b);\\n    };\\n    return function (d, b) {\\n        if (typeof b !== \\\"function\\\" && b !== null)\\n            throw new TypeError(\\\"Class extends value \\\" + String(b) + \\\" is not a constructor or null\\\");\\n        extendStatics(d, b);\\n        function __() { this.constructor = d; }\\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\\n    };\\n})();\\n\\n\\n\\n\\n\\n\\n\\n/**\\n * Create a new JSEncryptRSAKey that extends Tom Wu's RSA key object.\\n * This object is just a decorator for parsing the key parameter\\n * @param {string|Object} key - The key in string format, or an object containing\\n * the parameters needed to build a RSAKey object.\\n * @constructor\\n */\\nvar JSEncryptRSAKey = /** @class */ (function (_super) {\\n    __extends(JSEncryptRSAKey, _super);\\n    function JSEncryptRSAKey(key) {\\n        var _this = _super.call(this) || this;\\n        // Call the super constructor.\\n        //  RSAKey.call(this);\\n        // If a key key was provided.\\n        if (key) {\\n            // If this is a string...\\n            if (typeof key === \\\"string\\\") {\\n                _this.parseKey(key);\\n            }\\n            else if (JSEncryptRSAKey.hasPrivateKeyProperty(key) ||\\n                JSEncryptRSAKey.hasPublicKeyProperty(key)) {\\n                // Set the values for the key.\\n                _this.parsePropertiesFrom(key);\\n            }\\n        }\\n        return _this;\\n    }\\n    /**\\n     * Method to parse a pem encoded string containing both a public or private key.\\n     * The method will translate the pem encoded string in a der encoded string and\\n     * will parse private key and public key parameters. This method accepts public key\\n     * in the rsaencryption pkcs #1 format (oid: 1.2.840.113549.1.1.1).\\n     *\\n     * @todo Check how many rsa formats use the same format of pkcs #1.\\n     *\\n     * The format is defined as:\\n     * PublicKeyInfo ::= SEQUENCE {\\n     *   algorithm       AlgorithmIdentifier,\\n     *   PublicKey       BIT STRING\\n     * }\\n     * Where AlgorithmIdentifier is:\\n     * AlgorithmIdentifier ::= SEQUENCE {\\n     *   algorithm       OBJECT IDENTIFIER,     the OID of the enc algorithm\\n     *   parameters      ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)\\n     * }\\n     * and PublicKey is a SEQUENCE encapsulated in a BIT STRING\\n     * RSAPublicKey ::= SEQUENCE {\\n     *   modulus           INTEGER,  -- n\\n     *   publicExponent    INTEGER   -- e\\n     * }\\n     * it's possible to examine the structure of the keys obtained from openssl using\\n     * an asn.1 dumper as the one used here to parse the components: http://lapo.it/asn1js/\\n     * @argument {string} pem the pem encoded string, can include the BEGIN/END header/footer\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.parseKey = function (pem) {\\n        try {\\n            var modulus = 0;\\n            var public_exponent = 0;\\n            var reHex = /^\\\\s*(?:[0-9A-Fa-f][0-9A-Fa-f]\\\\s*)+$/;\\n            var der = reHex.test(pem) ? _lib_asn1js_hex__WEBPACK_IMPORTED_MODULE_1__.Hex.decode(pem) : _lib_asn1js_base64__WEBPACK_IMPORTED_MODULE_2__.Base64.unarmor(pem);\\n            var asn1 = _lib_asn1js_asn1__WEBPACK_IMPORTED_MODULE_3__.ASN1.decode(der);\\n            // Fixes a bug with OpenSSL 1.0+ private keys\\n            if (asn1.sub.length === 3) {\\n                asn1 = asn1.sub[2].sub[0];\\n            }\\n            if (asn1.sub.length === 9) {\\n                // Parse the private key.\\n                modulus = asn1.sub[1].getHexStringValue(); // bigint\\n                this.n = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(modulus, 16);\\n                public_exponent = asn1.sub[2].getHexStringValue(); // int\\n                this.e = parseInt(public_exponent, 16);\\n                var private_exponent = asn1.sub[3].getHexStringValue(); // bigint\\n                this.d = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(private_exponent, 16);\\n                var prime1 = asn1.sub[4].getHexStringValue(); // bigint\\n                this.p = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(prime1, 16);\\n                var prime2 = asn1.sub[5].getHexStringValue(); // bigint\\n                this.q = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(prime2, 16);\\n                var exponent1 = asn1.sub[6].getHexStringValue(); // bigint\\n                this.dmp1 = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(exponent1, 16);\\n                var exponent2 = asn1.sub[7].getHexStringValue(); // bigint\\n                this.dmq1 = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(exponent2, 16);\\n                var coefficient = asn1.sub[8].getHexStringValue(); // bigint\\n                this.coeff = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(coefficient, 16);\\n            }\\n            else if (asn1.sub.length === 2) {\\n                // Parse the public key.\\n                var bit_string = asn1.sub[1];\\n                var sequence = bit_string.sub[0];\\n                modulus = sequence.sub[0].getHexStringValue();\\n                this.n = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(modulus, 16);\\n                public_exponent = sequence.sub[1].getHexStringValue();\\n                this.e = parseInt(public_exponent, 16);\\n            }\\n            else {\\n                return false;\\n            }\\n            return true;\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Translate rsa parameters in a hex encoded string representing the rsa key.\\n     *\\n     * The translation follow the ASN.1 notation :\\n     * RSAPrivateKey ::= SEQUENCE {\\n     *   version           Version,\\n     *   modulus           INTEGER,  -- n\\n     *   publicExponent    INTEGER,  -- e\\n     *   privateExponent   INTEGER,  -- d\\n     *   prime1            INTEGER,  -- p\\n     *   prime2            INTEGER,  -- q\\n     *   exponent1         INTEGER,  -- d mod (p1)\\n     *   exponent2         INTEGER,  -- d mod (q-1)\\n     *   coefficient       INTEGER,  -- (inverse of q) mod p\\n     * }\\n     * @returns {string}  DER Encoded String representing the rsa private key\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.getPrivateBaseKey = function () {\\n        var options = {\\n            array: [\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ int: 0 }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.n }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ int: this.e }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.d }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.p }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.q }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.dmp1 }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.dmq1 }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.coeff })\\n            ]\\n        };\\n        var seq = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence(options);\\n        return seq.getEncodedHex();\\n    };\\n    /**\\n     * base64 (pem) encoded version of the DER encoded representation\\n     * @returns {string} pem encoded representation without header and footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPrivateBaseKeyB64 = function () {\\n        return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getPrivateBaseKey());\\n    };\\n    /**\\n     * Translate rsa parameters in a hex encoded string representing the rsa public key.\\n     * The representation follow the ASN.1 notation :\\n     * PublicKeyInfo ::= SEQUENCE {\\n     *   algorithm       AlgorithmIdentifier,\\n     *   PublicKey       BIT STRING\\n     * }\\n     * Where AlgorithmIdentifier is:\\n     * AlgorithmIdentifier ::= SEQUENCE {\\n     *   algorithm       OBJECT IDENTIFIER,     the OID of the enc algorithm\\n     *   parameters      ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)\\n     * }\\n     * and PublicKey is a SEQUENCE encapsulated in a BIT STRING\\n     * RSAPublicKey ::= SEQUENCE {\\n     *   modulus           INTEGER,  -- n\\n     *   publicExponent    INTEGER   -- e\\n     * }\\n     * @returns {string} DER Encoded String representing the rsa public key\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.getPublicBaseKey = function () {\\n        var first_sequence = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence({\\n            array: [\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERObjectIdentifier({ oid: \\\"1.2.840.113549.1.1.1\\\" }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERNull()\\n            ]\\n        });\\n        var second_sequence = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence({\\n            array: [\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.n }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ int: this.e })\\n            ]\\n        });\\n        var bit_string = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERBitString({\\n            hex: \\\"00\\\" + second_sequence.getEncodedHex()\\n        });\\n        var seq = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence({\\n            array: [\\n                first_sequence,\\n                bit_string\\n            ]\\n        });\\n        return seq.getEncodedHex();\\n    };\\n    /**\\n     * base64 (pem) encoded version of the DER encoded representation\\n     * @returns {string} pem encoded representation without header and footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPublicBaseKeyB64 = function () {\\n        return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getPublicBaseKey());\\n    };\\n    /**\\n     * wrap the string in block of width chars. The default value for rsa keys is 64\\n     * characters.\\n     * @param {string} str the pem encoded string without header and footer\\n     * @param {Number} [width=64] - the length the string has to be wrapped at\\n     * @returns {string}\\n     * @private\\n     */\\n    JSEncryptRSAKey.wordwrap = function (str, width) {\\n        width = width || 64;\\n        if (!str) {\\n            return str;\\n        }\\n        var regex = \\\"(.{1,\\\" + width + \\\"})( +|$\\\\n?)|(.{1,\\\" + width + \\\"})\\\";\\n        return str.match(RegExp(regex, \\\"g\\\")).join(\\\"\\\\n\\\");\\n    };\\n    /**\\n     * Retrieve the pem encoded private key\\n     * @returns {string} the pem encoded private key with header/footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPrivateKey = function () {\\n        var key = \\\"-----BEGIN RSA PRIVATE KEY-----\\\\n\\\";\\n        key += JSEncryptRSAKey.wordwrap(this.getPrivateBaseKeyB64()) + \\\"\\\\n\\\";\\n        key += \\\"-----END RSA PRIVATE KEY-----\\\";\\n        return key;\\n    };\\n    /**\\n     * Retrieve the pem encoded public key\\n     * @returns {string} the pem encoded public key with header/footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPublicKey = function () {\\n        var key = \\\"-----BEGIN PUBLIC KEY-----\\\\n\\\";\\n        key += JSEncryptRSAKey.wordwrap(this.getPublicBaseKeyB64()) + \\\"\\\\n\\\";\\n        key += \\\"-----END PUBLIC KEY-----\\\";\\n        return key;\\n    };\\n    /**\\n     * Check if the object contains the necessary parameters to populate the rsa modulus\\n     * and public exponent parameters.\\n     * @param {Object} [obj={}] - An object that may contain the two public key\\n     * parameters\\n     * @returns {boolean} true if the object contains both the modulus and the public exponent\\n     * properties (n and e)\\n     * @todo check for types of n and e. N should be a parseable bigInt object, E should\\n     * be a parseable integer number\\n     * @private\\n     */\\n    JSEncryptRSAKey.hasPublicKeyProperty = function (obj) {\\n        obj = obj || {};\\n        return (obj.hasOwnProperty(\\\"n\\\") &&\\n            obj.hasOwnProperty(\\\"e\\\"));\\n    };\\n    /**\\n     * Check if the object contains ALL the parameters of an RSA key.\\n     * @param {Object} [obj={}] - An object that may contain nine rsa key\\n     * parameters\\n     * @returns {boolean} true if the object contains all the parameters needed\\n     * @todo check for types of the parameters all the parameters but the public exponent\\n     * should be parseable bigint objects, the public exponent should be a parseable integer number\\n     * @private\\n     */\\n    JSEncryptRSAKey.hasPrivateKeyProperty = function (obj) {\\n        obj = obj || {};\\n        return (obj.hasOwnProperty(\\\"n\\\") &&\\n            obj.hasOwnProperty(\\\"e\\\") &&\\n            obj.hasOwnProperty(\\\"d\\\") &&\\n            obj.hasOwnProperty(\\\"p\\\") &&\\n            obj.hasOwnProperty(\\\"q\\\") &&\\n            obj.hasOwnProperty(\\\"dmp1\\\") &&\\n            obj.hasOwnProperty(\\\"dmq1\\\") &&\\n            obj.hasOwnProperty(\\\"coeff\\\"));\\n    };\\n    /**\\n     * Parse the properties of obj in the current rsa object. Obj should AT LEAST\\n     * include the modulus and public exponent (n, e) parameters.\\n     * @param {Object} obj - the object containing rsa parameters\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.parsePropertiesFrom = function (obj) {\\n        this.n = obj.n;\\n        this.e = obj.e;\\n        if (obj.hasOwnProperty(\\\"d\\\")) {\\n            this.d = obj.d;\\n            this.p = obj.p;\\n            this.q = obj.q;\\n            this.dmp1 = obj.dmp1;\\n            this.dmq1 = obj.dmq1;\\n            this.coeff = obj.coeff;\\n        }\\n    };\\n    return JSEncryptRSAKey;\\n}(_lib_jsbn_rsa__WEBPACK_IMPORTED_MODULE_4__.RSAKey));\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/JSEncryptRSAKey.js?\");\n\n/***/ }),\n\n/***/ \"./lib/index.js\":\n/*!**********************!*\\\n  !*** ./lib/index.js ***!\n  \\**********************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"JSEncrypt\\\": () => (/* reexport safe */ _JSEncrypt__WEBPACK_IMPORTED_MODULE_0__.JSEncrypt),\\n/* harmony export */   \\\"default\\\": () => (__WEBPACK_DEFAULT_EXPORT__)\\n/* harmony export */ });\\n/* harmony import */ var _JSEncrypt__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./JSEncrypt */ \\\"./lib/JSEncrypt.js\\\");\\n\\n\\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (_JSEncrypt__WEBPACK_IMPORTED_MODULE_0__.JSEncrypt);\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/index.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/asn1.js\":\n/*!********************************!*\\\n  !*** ./lib/lib/asn1js/asn1.js ***!\n  \\********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Stream\\\": () => (/* binding */ Stream),\\n/* harmony export */   \\\"ASN1\\\": () => (/* binding */ ASN1),\\n/* harmony export */   \\\"ASN1Tag\\\": () => (/* binding */ ASN1Tag)\\n/* harmony export */ });\\n/* harmony import */ var _int10__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./int10 */ \\\"./lib/lib/asn1js/int10.js\\\");\\n// ASN.1 JavaScript decoder\\n// Copyright (c) 2008-2014 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\n/*global oids */\\n\\nvar ellipsis = \\\"\\\\u2026\\\";\\nvar reTimeS = /^(\\\\d\\\\d)(0[1-9]|1[0-2])(0[1-9]|[12]\\\\d|3[01])([01]\\\\d|2[0-3])(?:([0-5]\\\\d)(?:([0-5]\\\\d)(?:[.,](\\\\d{1,3}))?)?)?(Z|[-+](?:[0]\\\\d|1[0-2])([0-5]\\\\d)?)?$/;\\nvar reTimeL = /^(\\\\d\\\\d\\\\d\\\\d)(0[1-9]|1[0-2])(0[1-9]|[12]\\\\d|3[01])([01]\\\\d|2[0-3])(?:([0-5]\\\\d)(?:([0-5]\\\\d)(?:[.,](\\\\d{1,3}))?)?)?(Z|[-+](?:[0]\\\\d|1[0-2])([0-5]\\\\d)?)?$/;\\nfunction stringCut(str, len) {\\n    if (str.length > len) {\\n        str = str.substring(0, len) + ellipsis;\\n    }\\n    return str;\\n}\\nvar Stream = /** @class */ (function () {\\n    function Stream(enc, pos) {\\n        this.hexDigits = \\\"0123456789ABCDEF\\\";\\n        if (enc instanceof Stream) {\\n            this.enc = enc.enc;\\n            this.pos = enc.pos;\\n        }\\n        else {\\n            // enc should be an array or a binary string\\n            this.enc = enc;\\n            this.pos = pos;\\n        }\\n    }\\n    Stream.prototype.get = function (pos) {\\n        if (pos === undefined) {\\n            pos = this.pos++;\\n        }\\n        if (pos >= this.enc.length) {\\n            throw new Error(\\\"Requesting byte offset \\\" + pos + \\\" on a stream of length \\\" + this.enc.length);\\n        }\\n        return (\\\"string\\\" === typeof this.enc) ? this.enc.charCodeAt(pos) : this.enc[pos];\\n    };\\n    Stream.prototype.hexByte = function (b) {\\n        return this.hexDigits.charAt((b >> 4) & 0xF) + this.hexDigits.charAt(b & 0xF);\\n    };\\n    Stream.prototype.hexDump = function (start, end, raw) {\\n        var s = \\\"\\\";\\n        for (var i = start; i < end; ++i) {\\n            s += this.hexByte(this.get(i));\\n            if (raw !== true) {\\n                switch (i & 0xF) {\\n                    case 0x7:\\n                        s += \\\"  \\\";\\n                        break;\\n                    case 0xF:\\n                        s += \\\"\\\\n\\\";\\n                        break;\\n                    default:\\n                        s += \\\" \\\";\\n                }\\n            }\\n        }\\n        return s;\\n    };\\n    Stream.prototype.isASCII = function (start, end) {\\n        for (var i = start; i < end; ++i) {\\n            var c = this.get(i);\\n            if (c < 32 || c > 176) {\\n                return false;\\n            }\\n        }\\n        return true;\\n    };\\n    Stream.prototype.parseStringISO = function (start, end) {\\n        var s = \\\"\\\";\\n        for (var i = start; i < end; ++i) {\\n            s += String.fromCharCode(this.get(i));\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseStringUTF = function (start, end) {\\n        var s = \\\"\\\";\\n        for (var i = start; i < end;) {\\n            var c = this.get(i++);\\n            if (c < 128) {\\n                s += String.fromCharCode(c);\\n            }\\n            else if ((c > 191) && (c < 224)) {\\n                s += String.fromCharCode(((c & 0x1F) << 6) | (this.get(i++) & 0x3F));\\n            }\\n            else {\\n                s += String.fromCharCode(((c & 0x0F) << 12) | ((this.get(i++) & 0x3F) << 6) | (this.get(i++) & 0x3F));\\n            }\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseStringBMP = function (start, end) {\\n        var str = \\\"\\\";\\n        var hi;\\n        var lo;\\n        for (var i = start; i < end;) {\\n            hi = this.get(i++);\\n            lo = this.get(i++);\\n            str += String.fromCharCode((hi << 8) | lo);\\n        }\\n        return str;\\n    };\\n    Stream.prototype.parseTime = function (start, end, shortYear) {\\n        var s = this.parseStringISO(start, end);\\n        var m = (shortYear ? reTimeS : reTimeL).exec(s);\\n        if (!m) {\\n            return \\\"Unrecognized time: \\\" + s;\\n        }\\n        if (shortYear) {\\n            // to avoid querying the timer, use the fixed range [1970, 2069]\\n            // it will conform with ITU X.400 [-10, +40] sliding window until 2030\\n            m[1] = +m[1];\\n            m[1] += (+m[1] < 70) ? 2000 : 1900;\\n        }\\n        s = m[1] + \\\"-\\\" + m[2] + \\\"-\\\" + m[3] + \\\" \\\" + m[4];\\n        if (m[5]) {\\n            s += \\\":\\\" + m[5];\\n            if (m[6]) {\\n                s += \\\":\\\" + m[6];\\n                if (m[7]) {\\n                    s += \\\".\\\" + m[7];\\n                }\\n            }\\n        }\\n        if (m[8]) {\\n            s += \\\" UTC\\\";\\n            if (m[8] != \\\"Z\\\") {\\n                s += m[8];\\n                if (m[9]) {\\n                    s += \\\":\\\" + m[9];\\n                }\\n            }\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseInteger = function (start, end) {\\n        var v = this.get(start);\\n        var neg = (v > 127);\\n        var pad = neg ? 255 : 0;\\n        var len;\\n        var s = \\\"\\\";\\n        // skip unuseful bits (not allowed in DER)\\n        while (v == pad && ++start < end) {\\n            v = this.get(start);\\n        }\\n        len = end - start;\\n        if (len === 0) {\\n            return neg ? -1 : 0;\\n        }\\n        // show bit length of huge integers\\n        if (len > 4) {\\n            s = v;\\n            len <<= 3;\\n            while (((+s ^ pad) & 0x80) == 0) {\\n                s = +s << 1;\\n                --len;\\n            }\\n            s = \\\"(\\\" + len + \\\" bit)\\\\n\\\";\\n        }\\n        // decode the integer\\n        if (neg) {\\n            v = v - 256;\\n        }\\n        var n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10(v);\\n        for (var i = start + 1; i < end; ++i) {\\n            n.mulAdd(256, this.get(i));\\n        }\\n        return s + n.toString();\\n    };\\n    Stream.prototype.parseBitString = function (start, end, maxLength) {\\n        var unusedBit = this.get(start);\\n        var lenBit = ((end - start - 1) << 3) - unusedBit;\\n        var intro = \\\"(\\\" + lenBit + \\\" bit)\\\\n\\\";\\n        var s = \\\"\\\";\\n        for (var i = start + 1; i < end; ++i) {\\n            var b = this.get(i);\\n            var skip = (i == end - 1) ? unusedBit : 0;\\n            for (var j = 7; j >= skip; --j) {\\n                s += (b >> j) & 1 ? \\\"1\\\" : \\\"0\\\";\\n            }\\n            if (s.length > maxLength) {\\n                return intro + stringCut(s, maxLength);\\n            }\\n        }\\n        return intro + s;\\n    };\\n    Stream.prototype.parseOctetString = function (start, end, maxLength) {\\n        if (this.isASCII(start, end)) {\\n            return stringCut(this.parseStringISO(start, end), maxLength);\\n        }\\n        var len = end - start;\\n        var s = \\\"(\\\" + len + \\\" byte)\\\\n\\\";\\n        maxLength /= 2; // we work in bytes\\n        if (len > maxLength) {\\n            end = start + maxLength;\\n        }\\n        for (var i = start; i < end; ++i) {\\n            s += this.hexByte(this.get(i));\\n        }\\n        if (len > maxLength) {\\n            s += ellipsis;\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseOID = function (start, end, maxLength) {\\n        var s = \\\"\\\";\\n        var n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10();\\n        var bits = 0;\\n        for (var i = start; i < end; ++i) {\\n            var v = this.get(i);\\n            n.mulAdd(128, v & 0x7F);\\n            bits += 7;\\n            if (!(v & 0x80)) { // finished\\n                if (s === \\\"\\\") {\\n                    n = n.simplify();\\n                    if (n instanceof _int10__WEBPACK_IMPORTED_MODULE_0__.Int10) {\\n                        n.sub(80);\\n                        s = \\\"2.\\\" + n.toString();\\n                    }\\n                    else {\\n                        var m = n < 80 ? n < 40 ? 0 : 1 : 2;\\n                        s = m + \\\".\\\" + (n - m * 40);\\n                    }\\n                }\\n                else {\\n                    s += \\\".\\\" + n.toString();\\n                }\\n                if (s.length > maxLength) {\\n                    return stringCut(s, maxLength);\\n                }\\n                n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10();\\n                bits = 0;\\n            }\\n        }\\n        if (bits > 0) {\\n            s += \\\".incomplete\\\";\\n        }\\n        return s;\\n    };\\n    return Stream;\\n}());\\n\\nvar ASN1 = /** @class */ (function () {\\n    function ASN1(stream, header, length, tag, sub) {\\n        if (!(tag instanceof ASN1Tag)) {\\n            throw new Error(\\\"Invalid tag value.\\\");\\n        }\\n        this.stream = stream;\\n        this.header = header;\\n        this.length = length;\\n        this.tag = tag;\\n        this.sub = sub;\\n    }\\n    ASN1.prototype.typeName = function () {\\n        switch (this.tag.tagClass) {\\n            case 0: // universal\\n                switch (this.tag.tagNumber) {\\n                    case 0x00:\\n                        return \\\"EOC\\\";\\n                    case 0x01:\\n                        return \\\"BOOLEAN\\\";\\n                    case 0x02:\\n                        return \\\"INTEGER\\\";\\n                    case 0x03:\\n                        return \\\"BIT_STRING\\\";\\n                    case 0x04:\\n                        return \\\"OCTET_STRING\\\";\\n                    case 0x05:\\n                        return \\\"NULL\\\";\\n                    case 0x06:\\n                        return \\\"OBJECT_IDENTIFIER\\\";\\n                    case 0x07:\\n                        return \\\"ObjectDescriptor\\\";\\n                    case 0x08:\\n                        return \\\"EXTERNAL\\\";\\n                    case 0x09:\\n                        return \\\"REAL\\\";\\n                    case 0x0A:\\n                        return \\\"ENUMERATED\\\";\\n                    case 0x0B:\\n                        return \\\"EMBEDDED_PDV\\\";\\n                    case 0x0C:\\n                        return \\\"UTF8String\\\";\\n                    case 0x10:\\n                        return \\\"SEQUENCE\\\";\\n                    case 0x11:\\n                        return \\\"SET\\\";\\n                    case 0x12:\\n                        return \\\"NumericString\\\";\\n                    case 0x13:\\n                        return \\\"PrintableString\\\"; // ASCII subset\\n                    case 0x14:\\n                        return \\\"TeletexString\\\"; // aka T61String\\n                    case 0x15:\\n                        return \\\"VideotexString\\\";\\n                    case 0x16:\\n                        return \\\"IA5String\\\"; // ASCII\\n                    case 0x17:\\n                        return \\\"UTCTime\\\";\\n                    case 0x18:\\n                        return \\\"GeneralizedTime\\\";\\n                    case 0x19:\\n                        return \\\"GraphicString\\\";\\n                    case 0x1A:\\n                        return \\\"VisibleString\\\"; // ASCII subset\\n                    case 0x1B:\\n                        return \\\"GeneralString\\\";\\n                    case 0x1C:\\n                        return \\\"UniversalString\\\";\\n                    case 0x1E:\\n                        return \\\"BMPString\\\";\\n                }\\n                return \\\"Universal_\\\" + this.tag.tagNumber.toString();\\n            case 1:\\n                return \\\"Application_\\\" + this.tag.tagNumber.toString();\\n            case 2:\\n                return \\\"[\\\" + this.tag.tagNumber.toString() + \\\"]\\\"; // Context\\n            case 3:\\n                return \\\"Private_\\\" + this.tag.tagNumber.toString();\\n        }\\n    };\\n    ASN1.prototype.content = function (maxLength) {\\n        if (this.tag === undefined) {\\n            return null;\\n        }\\n        if (maxLength === undefined) {\\n            maxLength = Infinity;\\n        }\\n        var content = this.posContent();\\n        var len = Math.abs(this.length);\\n        if (!this.tag.isUniversal()) {\\n            if (this.sub !== null) {\\n                return \\\"(\\\" + this.sub.length + \\\" elem)\\\";\\n            }\\n            return this.stream.parseOctetString(content, content + len, maxLength);\\n        }\\n        switch (this.tag.tagNumber) {\\n            case 0x01: // BOOLEAN\\n                return (this.stream.get(content) === 0) ? \\\"false\\\" : \\\"true\\\";\\n            case 0x02: // INTEGER\\n                return this.stream.parseInteger(content, content + len);\\n            case 0x03: // BIT_STRING\\n                return this.sub ? \\\"(\\\" + this.sub.length + \\\" elem)\\\" :\\n                    this.stream.parseBitString(content, content + len, maxLength);\\n            case 0x04: // OCTET_STRING\\n                return this.sub ? \\\"(\\\" + this.sub.length + \\\" elem)\\\" :\\n                    this.stream.parseOctetString(content, content + len, maxLength);\\n            // case 0x05: // NULL\\n            case 0x06: // OBJECT_IDENTIFIER\\n                return this.stream.parseOID(content, content + len, maxLength);\\n            // case 0x07: // ObjectDescriptor\\n            // case 0x08: // EXTERNAL\\n            // case 0x09: // REAL\\n            // case 0x0A: // ENUMERATED\\n            // case 0x0B: // EMBEDDED_PDV\\n            case 0x10: // SEQUENCE\\n            case 0x11: // SET\\n                if (this.sub !== null) {\\n                    return \\\"(\\\" + this.sub.length + \\\" elem)\\\";\\n                }\\n                else {\\n                    return \\\"(no elem)\\\";\\n                }\\n            case 0x0C: // UTF8String\\n                return stringCut(this.stream.parseStringUTF(content, content + len), maxLength);\\n            case 0x12: // NumericString\\n            case 0x13: // PrintableString\\n            case 0x14: // TeletexString\\n            case 0x15: // VideotexString\\n            case 0x16: // IA5String\\n            // case 0x19: // GraphicString\\n            case 0x1A: // VisibleString\\n                // case 0x1B: // GeneralString\\n                // case 0x1C: // UniversalString\\n                return stringCut(this.stream.parseStringISO(content, content + len), maxLength);\\n            case 0x1E: // BMPString\\n                return stringCut(this.stream.parseStringBMP(content, content + len), maxLength);\\n            case 0x17: // UTCTime\\n            case 0x18: // GeneralizedTime\\n                return this.stream.parseTime(content, content + len, (this.tag.tagNumber == 0x17));\\n        }\\n        return null;\\n    };\\n    ASN1.prototype.toString = function () {\\n        return this.typeName() + \\\"@\\\" + this.stream.pos + \\\"[header:\\\" + this.header + \\\",length:\\\" + this.length + \\\",sub:\\\" + ((this.sub === null) ? \\\"null\\\" : this.sub.length) + \\\"]\\\";\\n    };\\n    ASN1.prototype.toPrettyString = function (indent) {\\n        if (indent === undefined) {\\n            indent = \\\"\\\";\\n        }\\n        var s = indent + this.typeName() + \\\" @\\\" + this.stream.pos;\\n        if (this.length >= 0) {\\n            s += \\\"+\\\";\\n        }\\n        s += this.length;\\n        if (this.tag.tagConstructed) {\\n            s += \\\" (constructed)\\\";\\n        }\\n        else if ((this.tag.isUniversal() && ((this.tag.tagNumber == 0x03) || (this.tag.tagNumber == 0x04))) && (this.sub !== null)) {\\n            s += \\\" (encapsulates)\\\";\\n        }\\n        s += \\\"\\\\n\\\";\\n        if (this.sub !== null) {\\n            indent += \\\"  \\\";\\n            for (var i = 0, max = this.sub.length; i < max; ++i) {\\n                s += this.sub[i].toPrettyString(indent);\\n            }\\n        }\\n        return s;\\n    };\\n    ASN1.prototype.posStart = function () {\\n        return this.stream.pos;\\n    };\\n    ASN1.prototype.posContent = function () {\\n        return this.stream.pos + this.header;\\n    };\\n    ASN1.prototype.posEnd = function () {\\n        return this.stream.pos + this.header + Math.abs(this.length);\\n    };\\n    ASN1.prototype.toHexString = function () {\\n        return this.stream.hexDump(this.posStart(), this.posEnd(), true);\\n    };\\n    ASN1.decodeLength = function (stream) {\\n        var buf = stream.get();\\n        var len = buf & 0x7F;\\n        if (len == buf) {\\n            return len;\\n        }\\n        // no reason to use Int10, as it would be a huge buffer anyways\\n        if (len > 6) {\\n            throw new Error(\\\"Length over 48 bits not supported at position \\\" + (stream.pos - 1));\\n        }\\n        if (len === 0) {\\n            return null;\\n        } // undefined\\n        buf = 0;\\n        for (var i = 0; i < len; ++i) {\\n            buf = (buf * 256) + stream.get();\\n        }\\n        return buf;\\n    };\\n    /**\\n     * Retrieve the hexadecimal value (as a string) of the current ASN.1 element\\n     * @returns {string}\\n     * @public\\n     */\\n    ASN1.prototype.getHexStringValue = function () {\\n        var hexString = this.toHexString();\\n        var offset = this.header * 2;\\n        var length = this.length * 2;\\n        return hexString.substr(offset, length);\\n    };\\n    ASN1.decode = function (str) {\\n        var stream;\\n        if (!(str instanceof Stream)) {\\n            stream = new Stream(str, 0);\\n        }\\n        else {\\n            stream = str;\\n        }\\n        var streamStart = new Stream(stream);\\n        var tag = new ASN1Tag(stream);\\n        var len = ASN1.decodeLength(stream);\\n        var start = stream.pos;\\n        var header = start - streamStart.pos;\\n        var sub = null;\\n        var getSub = function () {\\n            var ret = [];\\n            if (len !== null) {\\n                // definite length\\n                var end = start + len;\\n                while (stream.pos < end) {\\n                    ret[ret.length] = ASN1.decode(stream);\\n                }\\n                if (stream.pos != end) {\\n                    throw new Error(\\\"Content size is not correct for container starting at offset \\\" + start);\\n                }\\n            }\\n            else {\\n                // undefined length\\n                try {\\n                    for (;;) {\\n                        var s = ASN1.decode(stream);\\n                        if (s.tag.isEOC()) {\\n                            break;\\n                        }\\n                        ret[ret.length] = s;\\n                    }\\n                    len = start - stream.pos; // undefined lengths are represented as negative values\\n                }\\n                catch (e) {\\n                    throw new Error(\\\"Exception while decoding undefined length content: \\\" + e);\\n                }\\n            }\\n            return ret;\\n        };\\n        if (tag.tagConstructed) {\\n            // must have valid content\\n            sub = getSub();\\n        }\\n        else if (tag.isUniversal() && ((tag.tagNumber == 0x03) || (tag.tagNumber == 0x04))) {\\n            // sometimes BitString and OctetString are used to encapsulate ASN.1\\n            try {\\n                if (tag.tagNumber == 0x03) {\\n                    if (stream.get() != 0) {\\n                        throw new Error(\\\"BIT STRINGs with unused bits cannot encapsulate.\\\");\\n                    }\\n                }\\n                sub = getSub();\\n                for (var i = 0; i < sub.length; ++i) {\\n                    if (sub[i].tag.isEOC()) {\\n                        throw new Error(\\\"EOC is not supposed to be actual content.\\\");\\n                    }\\n                }\\n            }\\n            catch (e) {\\n                // but silently ignore when they don't\\n                sub = null;\\n            }\\n        }\\n        if (sub === null) {\\n            if (len === null) {\\n                throw new Error(\\\"We can't skip over an invalid tag with undefined length at offset \\\" + start);\\n            }\\n            stream.pos = start + Math.abs(len);\\n        }\\n        return new ASN1(streamStart, header, len, tag, sub);\\n    };\\n    return ASN1;\\n}());\\n\\nvar ASN1Tag = /** @class */ (function () {\\n    function ASN1Tag(stream) {\\n        var buf = stream.get();\\n        this.tagClass = buf >> 6;\\n        this.tagConstructed = ((buf & 0x20) !== 0);\\n        this.tagNumber = buf & 0x1F;\\n        if (this.tagNumber == 0x1F) { // long tag\\n            var n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10();\\n            do {\\n                buf = stream.get();\\n                n.mulAdd(128, buf & 0x7F);\\n            } while (buf & 0x80);\\n            this.tagNumber = n.simplify();\\n        }\\n    }\\n    ASN1Tag.prototype.isUniversal = function () {\\n        return this.tagClass === 0x00;\\n    };\\n    ASN1Tag.prototype.isEOC = function () {\\n        return this.tagClass === 0x00 && this.tagNumber === 0x00;\\n    };\\n    return ASN1Tag;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/asn1.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/base64.js\":\n/*!**********************************!*\\\n  !*** ./lib/lib/asn1js/base64.js ***!\n  \\**********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Base64\\\": () => (/* binding */ Base64)\\n/* harmony export */ });\\n// Base64 JavaScript decoder\\n// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\nvar decoder;\\nvar Base64 = {\\n    decode: function (a) {\\n        var i;\\n        if (decoder === undefined) {\\n            var b64 = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\";\\n            var ignore = \\\"= \\\\f\\\\n\\\\r\\\\t\\\\u00A0\\\\u2028\\\\u2029\\\";\\n            decoder = Object.create(null);\\n            for (i = 0; i < 64; ++i) {\\n                decoder[b64.charAt(i)] = i;\\n            }\\n            decoder['-'] = 62; //+\\n            decoder['_'] = 63; //-\\n            for (i = 0; i < ignore.length; ++i) {\\n                decoder[ignore.charAt(i)] = -1;\\n            }\\n        }\\n        var out = [];\\n        var bits = 0;\\n        var char_count = 0;\\n        for (i = 0; i < a.length; ++i) {\\n            var c = a.charAt(i);\\n            if (c == \\\"=\\\") {\\n                break;\\n            }\\n            c = decoder[c];\\n            if (c == -1) {\\n                continue;\\n            }\\n            if (c === undefined) {\\n                throw new Error(\\\"Illegal character at offset \\\" + i);\\n            }\\n            bits |= c;\\n            if (++char_count >= 4) {\\n                out[out.length] = (bits >> 16);\\n                out[out.length] = (bits >> 8) & 0xFF;\\n                out[out.length] = bits & 0xFF;\\n                bits = 0;\\n                char_count = 0;\\n            }\\n            else {\\n                bits <<= 6;\\n            }\\n        }\\n        switch (char_count) {\\n            case 1:\\n                throw new Error(\\\"Base64 encoding incomplete: at least 2 bits missing\\\");\\n            case 2:\\n                out[out.length] = (bits >> 10);\\n                break;\\n            case 3:\\n                out[out.length] = (bits >> 16);\\n                out[out.length] = (bits >> 8) & 0xFF;\\n                break;\\n        }\\n        return out;\\n    },\\n    re: /-----BEGIN [^-]+-----([A-Za-z0-9+\\\\/=\\\\s]+)-----END [^-]+-----|begin-base64[^\\\\n]+\\\\n([A-Za-z0-9+\\\\/=\\\\s]+)====/,\\n    unarmor: function (a) {\\n        var m = Base64.re.exec(a);\\n        if (m) {\\n            if (m[1]) {\\n                a = m[1];\\n            }\\n            else if (m[2]) {\\n                a = m[2];\\n            }\\n            else {\\n                throw new Error(\\\"RegExp out of sync\\\");\\n            }\\n        }\\n        return Base64.decode(a);\\n    }\\n};\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/base64.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/hex.js\":\n/*!*******************************!*\\\n  !*** ./lib/lib/asn1js/hex.js ***!\n  \\*******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Hex\\\": () => (/* binding */ Hex)\\n/* harmony export */ });\\n// Hex JavaScript decoder\\n// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\nvar decoder;\\nvar Hex = {\\n    decode: function (a) {\\n        var i;\\n        if (decoder === undefined) {\\n            var hex = \\\"0123456789ABCDEF\\\";\\n            var ignore = \\\" \\\\f\\\\n\\\\r\\\\t\\\\u00A0\\\\u2028\\\\u2029\\\";\\n            decoder = {};\\n            for (i = 0; i < 16; ++i) {\\n                decoder[hex.charAt(i)] = i;\\n            }\\n            hex = hex.toLowerCase();\\n            for (i = 10; i < 16; ++i) {\\n                decoder[hex.charAt(i)] = i;\\n            }\\n            for (i = 0; i < ignore.length; ++i) {\\n                decoder[ignore.charAt(i)] = -1;\\n            }\\n        }\\n        var out = [];\\n        var bits = 0;\\n        var char_count = 0;\\n        for (i = 0; i < a.length; ++i) {\\n            var c = a.charAt(i);\\n            if (c == \\\"=\\\") {\\n                break;\\n            }\\n            c = decoder[c];\\n            if (c == -1) {\\n                continue;\\n            }\\n            if (c === undefined) {\\n                throw new Error(\\\"Illegal character at offset \\\" + i);\\n            }\\n            bits |= c;\\n            if (++char_count >= 2) {\\n                out[out.length] = bits;\\n                bits = 0;\\n                char_count = 0;\\n            }\\n            else {\\n                bits <<= 4;\\n            }\\n        }\\n        if (char_count) {\\n            throw new Error(\\\"Hex encoding incomplete: 4 bits missing\\\");\\n        }\\n        return out;\\n    }\\n};\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/hex.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/int10.js\":\n/*!*********************************!*\\\n  !*** ./lib/lib/asn1js/int10.js ***!\n  \\*********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Int10\\\": () => (/* binding */ Int10)\\n/* harmony export */ });\\n// Big integer base-10 printing library\\n// Copyright (c) 2014 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\nvar max = 10000000000000; // biggest integer that can still fit 2^53 when multiplied by 256\\nvar Int10 = /** @class */ (function () {\\n    function Int10(value) {\\n        this.buf = [+value || 0];\\n    }\\n    Int10.prototype.mulAdd = function (m, c) {\\n        // assert(m <= 256)\\n        var b = this.buf;\\n        var l = b.length;\\n        var i;\\n        var t;\\n        for (i = 0; i < l; ++i) {\\n            t = b[i] * m + c;\\n            if (t < max) {\\n                c = 0;\\n            }\\n            else {\\n                c = 0 | (t / max);\\n                t -= c * max;\\n            }\\n            b[i] = t;\\n        }\\n        if (c > 0) {\\n            b[i] = c;\\n        }\\n    };\\n    Int10.prototype.sub = function (c) {\\n        // assert(m <= 256)\\n        var b = this.buf;\\n        var l = b.length;\\n        var i;\\n        var t;\\n        for (i = 0; i < l; ++i) {\\n            t = b[i] - c;\\n            if (t < 0) {\\n                t += max;\\n                c = 1;\\n            }\\n            else {\\n                c = 0;\\n            }\\n            b[i] = t;\\n        }\\n        while (b[b.length - 1] === 0) {\\n            b.pop();\\n        }\\n    };\\n    Int10.prototype.toString = function (base) {\\n        if ((base || 10) != 10) {\\n            throw new Error(\\\"only base 10 is supported\\\");\\n        }\\n        var b = this.buf;\\n        var s = b[b.length - 1].toString();\\n        for (var i = b.length - 2; i >= 0; --i) {\\n            s += (max + b[i]).toString().substring(1);\\n        }\\n        return s;\\n    };\\n    Int10.prototype.valueOf = function () {\\n        var b = this.buf;\\n        var v = 0;\\n        for (var i = b.length - 1; i >= 0; --i) {\\n            v = v * max + b[i];\\n        }\\n        return v;\\n    };\\n    Int10.prototype.simplify = function () {\\n        var b = this.buf;\\n        return (b.length == 1) ? b[0] : this;\\n    };\\n    return Int10;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/int10.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/base64.js\":\n/*!********************************!*\\\n  !*** ./lib/lib/jsbn/base64.js ***!\n  \\********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"hex2b64\\\": () => (/* binding */ hex2b64),\\n/* harmony export */   \\\"b64tohex\\\": () => (/* binding */ b64tohex),\\n/* harmony export */   \\\"b64toBA\\\": () => (/* binding */ b64toBA)\\n/* harmony export */ });\\n/* harmony import */ var _util__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./util */ \\\"./lib/lib/jsbn/util.js\\\");\\n\\nvar b64map = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\";\\nvar b64pad = \\\"=\\\";\\nfunction hex2b64(h) {\\n    var i;\\n    var c;\\n    var ret = \\\"\\\";\\n    for (i = 0; i + 3 <= h.length; i += 3) {\\n        c = parseInt(h.substring(i, i + 3), 16);\\n        ret += b64map.charAt(c >> 6) + b64map.charAt(c & 63);\\n    }\\n    if (i + 1 == h.length) {\\n        c = parseInt(h.substring(i, i + 1), 16);\\n        ret += b64map.charAt(c << 2);\\n    }\\n    else if (i + 2 == h.length) {\\n        c = parseInt(h.substring(i, i + 2), 16);\\n        ret += b64map.charAt(c >> 2) + b64map.charAt((c & 3) << 4);\\n    }\\n    while ((ret.length & 3) > 0) {\\n        ret += b64pad;\\n    }\\n    return ret;\\n}\\n// convert a base64 string to hex\\nfunction b64tohex(s) {\\n    var ret = \\\"\\\";\\n    var i;\\n    var k = 0; // b64 state, 0-3\\n    var slop = 0;\\n    for (i = 0; i < s.length; ++i) {\\n        if (s.charAt(i) == b64pad) {\\n            break;\\n        }\\n        var v = b64map.indexOf(s.charAt(i));\\n        if (v < 0) {\\n            continue;\\n        }\\n        if (k == 0) {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(v >> 2);\\n            slop = v & 3;\\n            k = 1;\\n        }\\n        else if (k == 1) {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)((slop << 2) | (v >> 4));\\n            slop = v & 0xf;\\n            k = 2;\\n        }\\n        else if (k == 2) {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(slop);\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(v >> 2);\\n            slop = v & 3;\\n            k = 3;\\n        }\\n        else {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)((slop << 2) | (v >> 4));\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(v & 0xf);\\n            k = 0;\\n        }\\n    }\\n    if (k == 1) {\\n        ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(slop << 2);\\n    }\\n    return ret;\\n}\\n// convert a base64 string to a byte/number array\\nfunction b64toBA(s) {\\n    // piggyback on b64tohex for now, optimize later\\n    var h = b64tohex(s);\\n    var i;\\n    var a = [];\\n    for (i = 0; 2 * i < h.length; ++i) {\\n        a[i] = parseInt(h.substring(2 * i, 2 * i + 2), 16);\\n    }\\n    return a;\\n}\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/base64.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/jsbn.js\":\n/*!******************************!*\\\n  !*** ./lib/lib/jsbn/jsbn.js ***!\n  \\******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"BigInteger\\\": () => (/* binding */ BigInteger),\\n/* harmony export */   \\\"nbi\\\": () => (/* binding */ nbi),\\n/* harmony export */   \\\"parseBigInt\\\": () => (/* binding */ parseBigInt),\\n/* harmony export */   \\\"intAt\\\": () => (/* binding */ intAt),\\n/* harmony export */   \\\"nbv\\\": () => (/* binding */ nbv),\\n/* harmony export */   \\\"nbits\\\": () => (/* binding */ nbits)\\n/* harmony export */ });\\n/* harmony import */ var _util__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./util */ \\\"./lib/lib/jsbn/util.js\\\");\\n// Copyright (c) 2005  Tom Wu\\n// All Rights Reserved.\\n// See \\\"LICENSE\\\" for details.\\n// Basic JavaScript BN library - subset useful for RSA encryption.\\n\\n// Bits per digit\\nvar dbits;\\n// JavaScript engine analysis\\nvar canary = 0xdeadbeefcafe;\\nvar j_lm = ((canary & 0xffffff) == 0xefcafe);\\n//#region\\nvar lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];\\nvar lplim = (1 << 26) / lowprimes[lowprimes.length - 1];\\n//#endregion\\n// (public) Constructor\\nvar BigInteger = /** @class */ (function () {\\n    function BigInteger(a, b, c) {\\n        if (a != null) {\\n            if (\\\"number\\\" == typeof a) {\\n                this.fromNumber(a, b, c);\\n            }\\n            else if (b == null && \\\"string\\\" != typeof a) {\\n                this.fromString(a, 256);\\n            }\\n            else {\\n                this.fromString(a, b);\\n            }\\n        }\\n    }\\n    //#region PUBLIC\\n    // BigInteger.prototype.toString = bnToString;\\n    // (public) return string representation in given radix\\n    BigInteger.prototype.toString = function (b) {\\n        if (this.s < 0) {\\n            return \\\"-\\\" + this.negate().toString(b);\\n        }\\n        var k;\\n        if (b == 16) {\\n            k = 4;\\n        }\\n        else if (b == 8) {\\n            k = 3;\\n        }\\n        else if (b == 2) {\\n            k = 1;\\n        }\\n        else if (b == 32) {\\n            k = 5;\\n        }\\n        else if (b == 4) {\\n            k = 2;\\n        }\\n        else {\\n            return this.toRadix(b);\\n        }\\n        var km = (1 << k) - 1;\\n        var d;\\n        var m = false;\\n        var r = \\\"\\\";\\n        var i = this.t;\\n        var p = this.DB - (i * this.DB) % k;\\n        if (i-- > 0) {\\n            if (p < this.DB && (d = this[i] >> p) > 0) {\\n                m = true;\\n                r = (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(d);\\n            }\\n            while (i >= 0) {\\n                if (p < k) {\\n                    d = (this[i] & ((1 << p) - 1)) << (k - p);\\n                    d |= this[--i] >> (p += this.DB - k);\\n                }\\n                else {\\n                    d = (this[i] >> (p -= k)) & km;\\n                    if (p <= 0) {\\n                        p += this.DB;\\n                        --i;\\n                    }\\n                }\\n                if (d > 0) {\\n                    m = true;\\n                }\\n                if (m) {\\n                    r += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(d);\\n                }\\n            }\\n        }\\n        return m ? r : \\\"0\\\";\\n    };\\n    // BigInteger.prototype.negate = bnNegate;\\n    // (public) -this\\n    BigInteger.prototype.negate = function () {\\n        var r = nbi();\\n        BigInteger.ZERO.subTo(this, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.abs = bnAbs;\\n    // (public) |this|\\n    BigInteger.prototype.abs = function () {\\n        return (this.s < 0) ? this.negate() : this;\\n    };\\n    // BigInteger.prototype.compareTo = bnCompareTo;\\n    // (public) return + if this > a, - if this < a, 0 if equal\\n    BigInteger.prototype.compareTo = function (a) {\\n        var r = this.s - a.s;\\n        if (r != 0) {\\n            return r;\\n        }\\n        var i = this.t;\\n        r = i - a.t;\\n        if (r != 0) {\\n            return (this.s < 0) ? -r : r;\\n        }\\n        while (--i >= 0) {\\n            if ((r = this[i] - a[i]) != 0) {\\n                return r;\\n            }\\n        }\\n        return 0;\\n    };\\n    // BigInteger.prototype.bitLength = bnBitLength;\\n    // (public) return the number of bits in \\\"this\\\"\\n    BigInteger.prototype.bitLength = function () {\\n        if (this.t <= 0) {\\n            return 0;\\n        }\\n        return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n    };\\n    // BigInteger.prototype.mod = bnMod;\\n    // (public) this mod a\\n    BigInteger.prototype.mod = function (a) {\\n        var r = nbi();\\n        this.abs().divRemTo(a, null, r);\\n        if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {\\n            a.subTo(r, r);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.modPowInt = bnModPowInt;\\n    // (public) this^e % m, 0 <= e < 2^32\\n    BigInteger.prototype.modPowInt = function (e, m) {\\n        var z;\\n        if (e < 256 || m.isEven()) {\\n            z = new Classic(m);\\n        }\\n        else {\\n            z = new Montgomery(m);\\n        }\\n        return this.exp(e, z);\\n    };\\n    // BigInteger.prototype.clone = bnClone;\\n    // (public)\\n    BigInteger.prototype.clone = function () {\\n        var r = nbi();\\n        this.copyTo(r);\\n        return r;\\n    };\\n    // BigInteger.prototype.intValue = bnIntValue;\\n    // (public) return value as integer\\n    BigInteger.prototype.intValue = function () {\\n        if (this.s < 0) {\\n            if (this.t == 1) {\\n                return this[0] - this.DV;\\n            }\\n            else if (this.t == 0) {\\n                return -1;\\n            }\\n        }\\n        else if (this.t == 1) {\\n            return this[0];\\n        }\\n        else if (this.t == 0) {\\n            return 0;\\n        }\\n        // assumes 16 < DB < 32\\n        return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];\\n    };\\n    // BigInteger.prototype.byteValue = bnByteValue;\\n    // (public) return value as byte\\n    BigInteger.prototype.byteValue = function () {\\n        return (this.t == 0) ? this.s : (this[0] << 24) >> 24;\\n    };\\n    // BigInteger.prototype.shortValue = bnShortValue;\\n    // (public) return value as short (assumes DB>=16)\\n    BigInteger.prototype.shortValue = function () {\\n        return (this.t == 0) ? this.s : (this[0] << 16) >> 16;\\n    };\\n    // BigInteger.prototype.signum = bnSigNum;\\n    // (public) 0 if this == 0, 1 if this > 0\\n    BigInteger.prototype.signum = function () {\\n        if (this.s < 0) {\\n            return -1;\\n        }\\n        else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) {\\n            return 0;\\n        }\\n        else {\\n            return 1;\\n        }\\n    };\\n    // BigInteger.prototype.toByteArray = bnToByteArray;\\n    // (public) convert to bigendian byte array\\n    BigInteger.prototype.toByteArray = function () {\\n        var i = this.t;\\n        var r = [];\\n        r[0] = this.s;\\n        var p = this.DB - (i * this.DB) % 8;\\n        var d;\\n        var k = 0;\\n        if (i-- > 0) {\\n            if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p) {\\n                r[k++] = d | (this.s << (this.DB - p));\\n            }\\n            while (i >= 0) {\\n                if (p < 8) {\\n                    d = (this[i] & ((1 << p) - 1)) << (8 - p);\\n                    d |= this[--i] >> (p += this.DB - 8);\\n                }\\n                else {\\n                    d = (this[i] >> (p -= 8)) & 0xff;\\n                    if (p <= 0) {\\n                        p += this.DB;\\n                        --i;\\n                    }\\n                }\\n                if ((d & 0x80) != 0) {\\n                    d |= -256;\\n                }\\n                if (k == 0 && (this.s & 0x80) != (d & 0x80)) {\\n                    ++k;\\n                }\\n                if (k > 0 || d != this.s) {\\n                    r[k++] = d;\\n                }\\n            }\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.equals = bnEquals;\\n    BigInteger.prototype.equals = function (a) {\\n        return (this.compareTo(a) == 0);\\n    };\\n    // BigInteger.prototype.min = bnMin;\\n    BigInteger.prototype.min = function (a) {\\n        return (this.compareTo(a) < 0) ? this : a;\\n    };\\n    // BigInteger.prototype.max = bnMax;\\n    BigInteger.prototype.max = function (a) {\\n        return (this.compareTo(a) > 0) ? this : a;\\n    };\\n    // BigInteger.prototype.and = bnAnd;\\n    BigInteger.prototype.and = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_and, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.or = bnOr;\\n    BigInteger.prototype.or = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_or, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.xor = bnXor;\\n    BigInteger.prototype.xor = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_xor, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.andNot = bnAndNot;\\n    BigInteger.prototype.andNot = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_andnot, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.not = bnNot;\\n    // (public) ~this\\n    BigInteger.prototype.not = function () {\\n        var r = nbi();\\n        for (var i = 0; i < this.t; ++i) {\\n            r[i] = this.DM & ~this[i];\\n        }\\n        r.t = this.t;\\n        r.s = ~this.s;\\n        return r;\\n    };\\n    // BigInteger.prototype.shiftLeft = bnShiftLeft;\\n    // (public) this << n\\n    BigInteger.prototype.shiftLeft = function (n) {\\n        var r = nbi();\\n        if (n < 0) {\\n            this.rShiftTo(-n, r);\\n        }\\n        else {\\n            this.lShiftTo(n, r);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.shiftRight = bnShiftRight;\\n    // (public) this >> n\\n    BigInteger.prototype.shiftRight = function (n) {\\n        var r = nbi();\\n        if (n < 0) {\\n            this.lShiftTo(-n, r);\\n        }\\n        else {\\n            this.rShiftTo(n, r);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\\n    // (public) returns index of lowest 1-bit (or -1 if none)\\n    BigInteger.prototype.getLowestSetBit = function () {\\n        for (var i = 0; i < this.t; ++i) {\\n            if (this[i] != 0) {\\n                return i * this.DB + (0,_util__WEBPACK_IMPORTED_MODULE_0__.lbit)(this[i]);\\n            }\\n        }\\n        if (this.s < 0) {\\n            return this.t * this.DB;\\n        }\\n        return -1;\\n    };\\n    // BigInteger.prototype.bitCount = bnBitCount;\\n    // (public) return number of set bits\\n    BigInteger.prototype.bitCount = function () {\\n        var r = 0;\\n        var x = this.s & this.DM;\\n        for (var i = 0; i < this.t; ++i) {\\n            r += (0,_util__WEBPACK_IMPORTED_MODULE_0__.cbit)(this[i] ^ x);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.testBit = bnTestBit;\\n    // (public) true iff nth bit is set\\n    BigInteger.prototype.testBit = function (n) {\\n        var j = Math.floor(n / this.DB);\\n        if (j >= this.t) {\\n            return (this.s != 0);\\n        }\\n        return ((this[j] & (1 << (n % this.DB))) != 0);\\n    };\\n    // BigInteger.prototype.setBit = bnSetBit;\\n    // (public) this | (1<<n)\\n    BigInteger.prototype.setBit = function (n) {\\n        return this.changeBit(n, _util__WEBPACK_IMPORTED_MODULE_0__.op_or);\\n    };\\n    // BigInteger.prototype.clearBit = bnClearBit;\\n    // (public) this & ~(1<<n)\\n    BigInteger.prototype.clearBit = function (n) {\\n        return this.changeBit(n, _util__WEBPACK_IMPORTED_MODULE_0__.op_andnot);\\n    };\\n    // BigInteger.prototype.flipBit = bnFlipBit;\\n    // (public) this ^ (1<<n)\\n    BigInteger.prototype.flipBit = function (n) {\\n        return this.changeBit(n, _util__WEBPACK_IMPORTED_MODULE_0__.op_xor);\\n    };\\n    // BigInteger.prototype.add = bnAdd;\\n    // (public) this + a\\n    BigInteger.prototype.add = function (a) {\\n        var r = nbi();\\n        this.addTo(a, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.subtract = bnSubtract;\\n    // (public) this - a\\n    BigInteger.prototype.subtract = function (a) {\\n        var r = nbi();\\n        this.subTo(a, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.multiply = bnMultiply;\\n    // (public) this * a\\n    BigInteger.prototype.multiply = function (a) {\\n        var r = nbi();\\n        this.multiplyTo(a, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.divide = bnDivide;\\n    // (public) this / a\\n    BigInteger.prototype.divide = function (a) {\\n        var r = nbi();\\n        this.divRemTo(a, r, null);\\n        return r;\\n    };\\n    // BigInteger.prototype.remainder = bnRemainder;\\n    // (public) this % a\\n    BigInteger.prototype.remainder = function (a) {\\n        var r = nbi();\\n        this.divRemTo(a, null, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\\n    // (public) [this/a,this%a]\\n    BigInteger.prototype.divideAndRemainder = function (a) {\\n        var q = nbi();\\n        var r = nbi();\\n        this.divRemTo(a, q, r);\\n        return [q, r];\\n    };\\n    // BigInteger.prototype.modPow = bnModPow;\\n    // (public) this^e % m (HAC 14.85)\\n    BigInteger.prototype.modPow = function (e, m) {\\n        var i = e.bitLength();\\n        var k;\\n        var r = nbv(1);\\n        var z;\\n        if (i <= 0) {\\n            return r;\\n        }\\n        else if (i < 18) {\\n            k = 1;\\n        }\\n        else if (i < 48) {\\n            k = 3;\\n        }\\n        else if (i < 144) {\\n            k = 4;\\n        }\\n        else if (i < 768) {\\n            k = 5;\\n        }\\n        else {\\n            k = 6;\\n        }\\n        if (i < 8) {\\n            z = new Classic(m);\\n        }\\n        else if (m.isEven()) {\\n            z = new Barrett(m);\\n        }\\n        else {\\n            z = new Montgomery(m);\\n        }\\n        // precomputation\\n        var g = [];\\n        var n = 3;\\n        var k1 = k - 1;\\n        var km = (1 << k) - 1;\\n        g[1] = z.convert(this);\\n        if (k > 1) {\\n            var g2 = nbi();\\n            z.sqrTo(g[1], g2);\\n            while (n <= km) {\\n                g[n] = nbi();\\n                z.mulTo(g2, g[n - 2], g[n]);\\n                n += 2;\\n            }\\n        }\\n        var j = e.t - 1;\\n        var w;\\n        var is1 = true;\\n        var r2 = nbi();\\n        var t;\\n        i = nbits(e[j]) - 1;\\n        while (j >= 0) {\\n            if (i >= k1) {\\n                w = (e[j] >> (i - k1)) & km;\\n            }\\n            else {\\n                w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);\\n                if (j > 0) {\\n                    w |= e[j - 1] >> (this.DB + i - k1);\\n                }\\n            }\\n            n = k;\\n            while ((w & 1) == 0) {\\n                w >>= 1;\\n                --n;\\n            }\\n            if ((i -= n) < 0) {\\n                i += this.DB;\\n                --j;\\n            }\\n            if (is1) { // ret == 1, don't bother squaring or multiplying it\\n                g[w].copyTo(r);\\n                is1 = false;\\n            }\\n            else {\\n                while (n > 1) {\\n                    z.sqrTo(r, r2);\\n                    z.sqrTo(r2, r);\\n                    n -= 2;\\n                }\\n                if (n > 0) {\\n                    z.sqrTo(r, r2);\\n                }\\n                else {\\n                    t = r;\\n                    r = r2;\\n                    r2 = t;\\n                }\\n                z.mulTo(r2, g[w], r);\\n            }\\n            while (j >= 0 && (e[j] & (1 << i)) == 0) {\\n                z.sqrTo(r, r2);\\n                t = r;\\n                r = r2;\\n                r2 = t;\\n                if (--i < 0) {\\n                    i = this.DB - 1;\\n                    --j;\\n                }\\n            }\\n        }\\n        return z.revert(r);\\n    };\\n    // BigInteger.prototype.modInverse = bnModInverse;\\n    // (public) 1/this % m (HAC 14.61)\\n    BigInteger.prototype.modInverse = function (m) {\\n        var ac = m.isEven();\\n        if ((this.isEven() && ac) || m.signum() == 0) {\\n            return BigInteger.ZERO;\\n        }\\n        var u = m.clone();\\n        var v = this.clone();\\n        var a = nbv(1);\\n        var b = nbv(0);\\n        var c = nbv(0);\\n        var d = nbv(1);\\n        while (u.signum() != 0) {\\n            while (u.isEven()) {\\n                u.rShiftTo(1, u);\\n                if (ac) {\\n                    if (!a.isEven() || !b.isEven()) {\\n                        a.addTo(this, a);\\n                        b.subTo(m, b);\\n                    }\\n                    a.rShiftTo(1, a);\\n                }\\n                else if (!b.isEven()) {\\n                    b.subTo(m, b);\\n                }\\n                b.rShiftTo(1, b);\\n            }\\n            while (v.isEven()) {\\n                v.rShiftTo(1, v);\\n                if (ac) {\\n                    if (!c.isEven() || !d.isEven()) {\\n                        c.addTo(this, c);\\n                        d.subTo(m, d);\\n                    }\\n                    c.rShiftTo(1, c);\\n                }\\n                else if (!d.isEven()) {\\n                    d.subTo(m, d);\\n                }\\n                d.rShiftTo(1, d);\\n            }\\n            if (u.compareTo(v) >= 0) {\\n                u.subTo(v, u);\\n                if (ac) {\\n                    a.subTo(c, a);\\n                }\\n                b.subTo(d, b);\\n            }\\n            else {\\n                v.subTo(u, v);\\n                if (ac) {\\n                    c.subTo(a, c);\\n                }\\n                d.subTo(b, d);\\n            }\\n        }\\n        if (v.compareTo(BigInteger.ONE) != 0) {\\n            return BigInteger.ZERO;\\n        }\\n        if (d.compareTo(m) >= 0) {\\n            return d.subtract(m);\\n        }\\n        if (d.signum() < 0) {\\n            d.addTo(m, d);\\n        }\\n        else {\\n            return d;\\n        }\\n        if (d.signum() < 0) {\\n            return d.add(m);\\n        }\\n        else {\\n            return d;\\n        }\\n    };\\n    // BigInteger.prototype.pow = bnPow;\\n    // (public) this^e\\n    BigInteger.prototype.pow = function (e) {\\n        return this.exp(e, new NullExp());\\n    };\\n    // BigInteger.prototype.gcd = bnGCD;\\n    // (public) gcd(this,a) (HAC 14.54)\\n    BigInteger.prototype.gcd = function (a) {\\n        var x = (this.s < 0) ? this.negate() : this.clone();\\n        var y = (a.s < 0) ? a.negate() : a.clone();\\n        if (x.compareTo(y) < 0) {\\n            var t = x;\\n            x = y;\\n            y = t;\\n        }\\n        var i = x.getLowestSetBit();\\n        var g = y.getLowestSetBit();\\n        if (g < 0) {\\n            return x;\\n        }\\n        if (i < g) {\\n            g = i;\\n        }\\n        if (g > 0) {\\n            x.rShiftTo(g, x);\\n            y.rShiftTo(g, y);\\n        }\\n        while (x.signum() > 0) {\\n            if ((i = x.getLowestSetBit()) > 0) {\\n                x.rShiftTo(i, x);\\n            }\\n            if ((i = y.getLowestSetBit()) > 0) {\\n                y.rShiftTo(i, y);\\n            }\\n            if (x.compareTo(y) >= 0) {\\n                x.subTo(y, x);\\n                x.rShiftTo(1, x);\\n            }\\n            else {\\n                y.subTo(x, y);\\n                y.rShiftTo(1, y);\\n            }\\n        }\\n        if (g > 0) {\\n            y.lShiftTo(g, y);\\n        }\\n        return y;\\n    };\\n    // BigInteger.prototype.isProbablePrime = bnIsProbablePrime;\\n    // (public) test primality with certainty >= 1-.5^t\\n    BigInteger.prototype.isProbablePrime = function (t) {\\n        var i;\\n        var x = this.abs();\\n        if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {\\n            for (i = 0; i < lowprimes.length; ++i) {\\n                if (x[0] == lowprimes[i]) {\\n                    return true;\\n                }\\n            }\\n            return false;\\n        }\\n        if (x.isEven()) {\\n            return false;\\n        }\\n        i = 1;\\n        while (i < lowprimes.length) {\\n            var m = lowprimes[i];\\n            var j = i + 1;\\n            while (j < lowprimes.length && m < lplim) {\\n                m *= lowprimes[j++];\\n            }\\n            m = x.modInt(m);\\n            while (i < j) {\\n                if (m % lowprimes[i++] == 0) {\\n                    return false;\\n                }\\n            }\\n        }\\n        return x.millerRabin(t);\\n    };\\n    //#endregion PUBLIC\\n    //#region PROTECTED\\n    // BigInteger.prototype.copyTo = bnpCopyTo;\\n    // (protected) copy this to r\\n    BigInteger.prototype.copyTo = function (r) {\\n        for (var i = this.t - 1; i >= 0; --i) {\\n            r[i] = this[i];\\n        }\\n        r.t = this.t;\\n        r.s = this.s;\\n    };\\n    // BigInteger.prototype.fromInt = bnpFromInt;\\n    // (protected) set from integer value x, -DV <= x < DV\\n    BigInteger.prototype.fromInt = function (x) {\\n        this.t = 1;\\n        this.s = (x < 0) ? -1 : 0;\\n        if (x > 0) {\\n            this[0] = x;\\n        }\\n        else if (x < -1) {\\n            this[0] = x + this.DV;\\n        }\\n        else {\\n            this.t = 0;\\n        }\\n    };\\n    // BigInteger.prototype.fromString = bnpFromString;\\n    // (protected) set from string and radix\\n    BigInteger.prototype.fromString = function (s, b) {\\n        var k;\\n        if (b == 16) {\\n            k = 4;\\n        }\\n        else if (b == 8) {\\n            k = 3;\\n        }\\n        else if (b == 256) {\\n            k = 8;\\n            /* byte array */\\n        }\\n        else if (b == 2) {\\n            k = 1;\\n        }\\n        else if (b == 32) {\\n            k = 5;\\n        }\\n        else if (b == 4) {\\n            k = 2;\\n        }\\n        else {\\n            this.fromRadix(s, b);\\n            return;\\n        }\\n        this.t = 0;\\n        this.s = 0;\\n        var i = s.length;\\n        var mi = false;\\n        var sh = 0;\\n        while (--i >= 0) {\\n            var x = (k == 8) ? (+s[i]) & 0xff : intAt(s, i);\\n            if (x < 0) {\\n                if (s.charAt(i) == \\\"-\\\") {\\n                    mi = true;\\n                }\\n                continue;\\n            }\\n            mi = false;\\n            if (sh == 0) {\\n                this[this.t++] = x;\\n            }\\n            else if (sh + k > this.DB) {\\n                this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n                this[this.t++] = (x >> (this.DB - sh));\\n            }\\n            else {\\n                this[this.t - 1] |= x << sh;\\n            }\\n            sh += k;\\n            if (sh >= this.DB) {\\n                sh -= this.DB;\\n            }\\n        }\\n        if (k == 8 && ((+s[0]) & 0x80) != 0) {\\n            this.s = -1;\\n            if (sh > 0) {\\n                this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n            }\\n        }\\n        this.clamp();\\n        if (mi) {\\n            BigInteger.ZERO.subTo(this, this);\\n        }\\n    };\\n    // BigInteger.prototype.clamp = bnpClamp;\\n    // (protected) clamp off excess high words\\n    BigInteger.prototype.clamp = function () {\\n        var c = this.s & this.DM;\\n        while (this.t > 0 && this[this.t - 1] == c) {\\n            --this.t;\\n        }\\n    };\\n    // BigInteger.prototype.dlShiftTo = bnpDLShiftTo;\\n    // (protected) r = this << n*DB\\n    BigInteger.prototype.dlShiftTo = function (n, r) {\\n        var i;\\n        for (i = this.t - 1; i >= 0; --i) {\\n            r[i + n] = this[i];\\n        }\\n        for (i = n - 1; i >= 0; --i) {\\n            r[i] = 0;\\n        }\\n        r.t = this.t + n;\\n        r.s = this.s;\\n    };\\n    // BigInteger.prototype.drShiftTo = bnpDRShiftTo;\\n    // (protected) r = this >> n*DB\\n    BigInteger.prototype.drShiftTo = function (n, r) {\\n        for (var i = n; i < this.t; ++i) {\\n            r[i - n] = this[i];\\n        }\\n        r.t = Math.max(this.t - n, 0);\\n        r.s = this.s;\\n    };\\n    // BigInteger.prototype.lShiftTo = bnpLShiftTo;\\n    // (protected) r = this << n\\n    BigInteger.prototype.lShiftTo = function (n, r) {\\n        var bs = n % this.DB;\\n        var cbs = this.DB - bs;\\n        var bm = (1 << cbs) - 1;\\n        var ds = Math.floor(n / this.DB);\\n        var c = (this.s << bs) & this.DM;\\n        for (var i = this.t - 1; i >= 0; --i) {\\n            r[i + ds + 1] = (this[i] >> cbs) | c;\\n            c = (this[i] & bm) << bs;\\n        }\\n        for (var i = ds - 1; i >= 0; --i) {\\n            r[i] = 0;\\n        }\\n        r[ds] = c;\\n        r.t = this.t + ds + 1;\\n        r.s = this.s;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.rShiftTo = bnpRShiftTo;\\n    // (protected) r = this >> n\\n    BigInteger.prototype.rShiftTo = function (n, r) {\\n        r.s = this.s;\\n        var ds = Math.floor(n / this.DB);\\n        if (ds >= this.t) {\\n            r.t = 0;\\n            return;\\n        }\\n        var bs = n % this.DB;\\n        var cbs = this.DB - bs;\\n        var bm = (1 << bs) - 1;\\n        r[0] = this[ds] >> bs;\\n        for (var i = ds + 1; i < this.t; ++i) {\\n            r[i - ds - 1] |= (this[i] & bm) << cbs;\\n            r[i - ds] = this[i] >> bs;\\n        }\\n        if (bs > 0) {\\n            r[this.t - ds - 1] |= (this.s & bm) << cbs;\\n        }\\n        r.t = this.t - ds;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.subTo = bnpSubTo;\\n    // (protected) r = this - a\\n    BigInteger.prototype.subTo = function (a, r) {\\n        var i = 0;\\n        var c = 0;\\n        var m = Math.min(a.t, this.t);\\n        while (i < m) {\\n            c += this[i] - a[i];\\n            r[i++] = c & this.DM;\\n            c >>= this.DB;\\n        }\\n        if (a.t < this.t) {\\n            c -= a.s;\\n            while (i < this.t) {\\n                c += this[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c += this.s;\\n        }\\n        else {\\n            c += this.s;\\n            while (i < a.t) {\\n                c -= a[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c -= a.s;\\n        }\\n        r.s = (c < 0) ? -1 : 0;\\n        if (c < -1) {\\n            r[i++] = this.DV + c;\\n        }\\n        else if (c > 0) {\\n            r[i++] = c;\\n        }\\n        r.t = i;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.multiplyTo = bnpMultiplyTo;\\n    // (protected) r = this * a, r != this,a (HAC 14.12)\\n    // \\\"this\\\" should be the larger one if appropriate.\\n    BigInteger.prototype.multiplyTo = function (a, r) {\\n        var x = this.abs();\\n        var y = a.abs();\\n        var i = x.t;\\n        r.t = i + y.t;\\n        while (--i >= 0) {\\n            r[i] = 0;\\n        }\\n        for (i = 0; i < y.t; ++i) {\\n            r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);\\n        }\\n        r.s = 0;\\n        r.clamp();\\n        if (this.s != a.s) {\\n            BigInteger.ZERO.subTo(r, r);\\n        }\\n    };\\n    // BigInteger.prototype.squareTo = bnpSquareTo;\\n    // (protected) r = this^2, r != this (HAC 14.16)\\n    BigInteger.prototype.squareTo = function (r) {\\n        var x = this.abs();\\n        var i = r.t = 2 * x.t;\\n        while (--i >= 0) {\\n            r[i] = 0;\\n        }\\n        for (i = 0; i < x.t - 1; ++i) {\\n            var c = x.am(i, x[i], r, 2 * i, 0, 1);\\n            if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {\\n                r[i + x.t] -= x.DV;\\n                r[i + x.t + 1] = 1;\\n            }\\n        }\\n        if (r.t > 0) {\\n            r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);\\n        }\\n        r.s = 0;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.divRemTo = bnpDivRemTo;\\n    // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\\n    // r != q, this != m.  q or r may be null.\\n    BigInteger.prototype.divRemTo = function (m, q, r) {\\n        var pm = m.abs();\\n        if (pm.t <= 0) {\\n            return;\\n        }\\n        var pt = this.abs();\\n        if (pt.t < pm.t) {\\n            if (q != null) {\\n                q.fromInt(0);\\n            }\\n            if (r != null) {\\n                this.copyTo(r);\\n            }\\n            return;\\n        }\\n        if (r == null) {\\n            r = nbi();\\n        }\\n        var y = nbi();\\n        var ts = this.s;\\n        var ms = m.s;\\n        var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus\\n        if (nsh > 0) {\\n            pm.lShiftTo(nsh, y);\\n            pt.lShiftTo(nsh, r);\\n        }\\n        else {\\n            pm.copyTo(y);\\n            pt.copyTo(r);\\n        }\\n        var ys = y.t;\\n        var y0 = y[ys - 1];\\n        if (y0 == 0) {\\n            return;\\n        }\\n        var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);\\n        var d1 = this.FV / yt;\\n        var d2 = (1 << this.F1) / yt;\\n        var e = 1 << this.F2;\\n        var i = r.t;\\n        var j = i - ys;\\n        var t = (q == null) ? nbi() : q;\\n        y.dlShiftTo(j, t);\\n        if (r.compareTo(t) >= 0) {\\n            r[r.t++] = 1;\\n            r.subTo(t, r);\\n        }\\n        BigInteger.ONE.dlShiftTo(ys, t);\\n        t.subTo(y, y); // \\\"negative\\\" y so we can replace sub with am later\\n        while (y.t < ys) {\\n            y[y.t++] = 0;\\n        }\\n        while (--j >= 0) {\\n            // Estimate quotient digit\\n            var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);\\n            if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) { // Try it out\\n                y.dlShiftTo(j, t);\\n                r.subTo(t, r);\\n                while (r[i] < --qd) {\\n                    r.subTo(t, r);\\n                }\\n            }\\n        }\\n        if (q != null) {\\n            r.drShiftTo(ys, q);\\n            if (ts != ms) {\\n                BigInteger.ZERO.subTo(q, q);\\n            }\\n        }\\n        r.t = ys;\\n        r.clamp();\\n        if (nsh > 0) {\\n            r.rShiftTo(nsh, r);\\n        } // Denormalize remainder\\n        if (ts < 0) {\\n            BigInteger.ZERO.subTo(r, r);\\n        }\\n    };\\n    // BigInteger.prototype.invDigit = bnpInvDigit;\\n    // (protected) return \\\"-1/this % 2^DB\\\"; useful for Mont. reduction\\n    // justification:\\n    //         xy == 1 (mod m)\\n    //         xy =  1+km\\n    //   xy(2-xy) = (1+km)(1-km)\\n    // x[y(2-xy)] = 1-k^2m^2\\n    // x[y(2-xy)] == 1 (mod m^2)\\n    // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\\n    // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\\n    // JS multiply \\\"overflows\\\" differently from C/C++, so care is needed here.\\n    BigInteger.prototype.invDigit = function () {\\n        if (this.t < 1) {\\n            return 0;\\n        }\\n        var x = this[0];\\n        if ((x & 1) == 0) {\\n            return 0;\\n        }\\n        var y = x & 3; // y == 1/x mod 2^2\\n        y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4\\n        y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8\\n        y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16\\n        // last step - calculate inverse mod DV directly;\\n        // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\\n        y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits\\n        // we really want the negative inverse, and -DV < y < DV\\n        return (y > 0) ? this.DV - y : -y;\\n    };\\n    // BigInteger.prototype.isEven = bnpIsEven;\\n    // (protected) true iff this is even\\n    BigInteger.prototype.isEven = function () {\\n        return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;\\n    };\\n    // BigInteger.prototype.exp = bnpExp;\\n    // (protected) this^e, e < 2^32, doing sqr and mul with \\\"r\\\" (HAC 14.79)\\n    BigInteger.prototype.exp = function (e, z) {\\n        if (e > 0xffffffff || e < 1) {\\n            return BigInteger.ONE;\\n        }\\n        var r = nbi();\\n        var r2 = nbi();\\n        var g = z.convert(this);\\n        var i = nbits(e) - 1;\\n        g.copyTo(r);\\n        while (--i >= 0) {\\n            z.sqrTo(r, r2);\\n            if ((e & (1 << i)) > 0) {\\n                z.mulTo(r2, g, r);\\n            }\\n            else {\\n                var t = r;\\n                r = r2;\\n                r2 = t;\\n            }\\n        }\\n        return z.revert(r);\\n    };\\n    // BigInteger.prototype.chunkSize = bnpChunkSize;\\n    // (protected) return x s.t. r^x < DV\\n    BigInteger.prototype.chunkSize = function (r) {\\n        return Math.floor(Math.LN2 * this.DB / Math.log(r));\\n    };\\n    // BigInteger.prototype.toRadix = bnpToRadix;\\n    // (protected) convert to radix string\\n    BigInteger.prototype.toRadix = function (b) {\\n        if (b == null) {\\n            b = 10;\\n        }\\n        if (this.signum() == 0 || b < 2 || b > 36) {\\n            return \\\"0\\\";\\n        }\\n        var cs = this.chunkSize(b);\\n        var a = Math.pow(b, cs);\\n        var d = nbv(a);\\n        var y = nbi();\\n        var z = nbi();\\n        var r = \\\"\\\";\\n        this.divRemTo(d, y, z);\\n        while (y.signum() > 0) {\\n            r = (a + z.intValue()).toString(b).substr(1) + r;\\n            y.divRemTo(d, y, z);\\n        }\\n        return z.intValue().toString(b) + r;\\n    };\\n    // BigInteger.prototype.fromRadix = bnpFromRadix;\\n    // (protected) convert from radix string\\n    BigInteger.prototype.fromRadix = function (s, b) {\\n        this.fromInt(0);\\n        if (b == null) {\\n            b = 10;\\n        }\\n        var cs = this.chunkSize(b);\\n        var d = Math.pow(b, cs);\\n        var mi = false;\\n        var j = 0;\\n        var w = 0;\\n        for (var i = 0; i < s.length; ++i) {\\n            var x = intAt(s, i);\\n            if (x < 0) {\\n                if (s.charAt(i) == \\\"-\\\" && this.signum() == 0) {\\n                    mi = true;\\n                }\\n                continue;\\n            }\\n            w = b * w + x;\\n            if (++j >= cs) {\\n                this.dMultiply(d);\\n                this.dAddOffset(w, 0);\\n                j = 0;\\n                w = 0;\\n            }\\n        }\\n        if (j > 0) {\\n            this.dMultiply(Math.pow(b, j));\\n            this.dAddOffset(w, 0);\\n        }\\n        if (mi) {\\n            BigInteger.ZERO.subTo(this, this);\\n        }\\n    };\\n    // BigInteger.prototype.fromNumber = bnpFromNumber;\\n    // (protected) alternate constructor\\n    BigInteger.prototype.fromNumber = function (a, b, c) {\\n        if (\\\"number\\\" == typeof b) {\\n            // new BigInteger(int,int,RNG)\\n            if (a < 2) {\\n                this.fromInt(1);\\n            }\\n            else {\\n                this.fromNumber(a, c);\\n                if (!this.testBit(a - 1)) {\\n                    // force MSB set\\n                    this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), _util__WEBPACK_IMPORTED_MODULE_0__.op_or, this);\\n                }\\n                if (this.isEven()) {\\n                    this.dAddOffset(1, 0);\\n                } // force odd\\n                while (!this.isProbablePrime(b)) {\\n                    this.dAddOffset(2, 0);\\n                    if (this.bitLength() > a) {\\n                        this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);\\n                    }\\n                }\\n            }\\n        }\\n        else {\\n            // new BigInteger(int,RNG)\\n            var x = [];\\n            var t = a & 7;\\n            x.length = (a >> 3) + 1;\\n            b.nextBytes(x);\\n            if (t > 0) {\\n                x[0] &= ((1 << t) - 1);\\n            }\\n            else {\\n                x[0] = 0;\\n            }\\n            this.fromString(x, 256);\\n        }\\n    };\\n    // BigInteger.prototype.bitwiseTo = bnpBitwiseTo;\\n    // (protected) r = this op a (bitwise)\\n    BigInteger.prototype.bitwiseTo = function (a, op, r) {\\n        var i;\\n        var f;\\n        var m = Math.min(a.t, this.t);\\n        for (i = 0; i < m; ++i) {\\n            r[i] = op(this[i], a[i]);\\n        }\\n        if (a.t < this.t) {\\n            f = a.s & this.DM;\\n            for (i = m; i < this.t; ++i) {\\n                r[i] = op(this[i], f);\\n            }\\n            r.t = this.t;\\n        }\\n        else {\\n            f = this.s & this.DM;\\n            for (i = m; i < a.t; ++i) {\\n                r[i] = op(f, a[i]);\\n            }\\n            r.t = a.t;\\n        }\\n        r.s = op(this.s, a.s);\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.changeBit = bnpChangeBit;\\n    // (protected) this op (1<<n)\\n    BigInteger.prototype.changeBit = function (n, op) {\\n        var r = BigInteger.ONE.shiftLeft(n);\\n        this.bitwiseTo(r, op, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.addTo = bnpAddTo;\\n    // (protected) r = this + a\\n    BigInteger.prototype.addTo = function (a, r) {\\n        var i = 0;\\n        var c = 0;\\n        var m = Math.min(a.t, this.t);\\n        while (i < m) {\\n            c += this[i] + a[i];\\n            r[i++] = c & this.DM;\\n            c >>= this.DB;\\n        }\\n        if (a.t < this.t) {\\n            c += a.s;\\n            while (i < this.t) {\\n                c += this[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c += this.s;\\n        }\\n        else {\\n            c += this.s;\\n            while (i < a.t) {\\n                c += a[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c += a.s;\\n        }\\n        r.s = (c < 0) ? -1 : 0;\\n        if (c > 0) {\\n            r[i++] = c;\\n        }\\n        else if (c < -1) {\\n            r[i++] = this.DV + c;\\n        }\\n        r.t = i;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.dMultiply = bnpDMultiply;\\n    // (protected) this *= n, this >= 0, 1 < n < DV\\n    BigInteger.prototype.dMultiply = function (n) {\\n        this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);\\n        ++this.t;\\n        this.clamp();\\n    };\\n    // BigInteger.prototype.dAddOffset = bnpDAddOffset;\\n    // (protected) this += n << w words, this >= 0\\n    BigInteger.prototype.dAddOffset = function (n, w) {\\n        if (n == 0) {\\n            return;\\n        }\\n        while (this.t <= w) {\\n            this[this.t++] = 0;\\n        }\\n        this[w] += n;\\n        while (this[w] >= this.DV) {\\n            this[w] -= this.DV;\\n            if (++w >= this.t) {\\n                this[this.t++] = 0;\\n            }\\n            ++this[w];\\n        }\\n    };\\n    // BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\\n    // (protected) r = lower n words of \\\"this * a\\\", a.t <= n\\n    // \\\"this\\\" should be the larger one if appropriate.\\n    BigInteger.prototype.multiplyLowerTo = function (a, n, r) {\\n        var i = Math.min(this.t + a.t, n);\\n        r.s = 0; // assumes a,this >= 0\\n        r.t = i;\\n        while (i > 0) {\\n            r[--i] = 0;\\n        }\\n        for (var j = r.t - this.t; i < j; ++i) {\\n            r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);\\n        }\\n        for (var j = Math.min(a.t, n); i < j; ++i) {\\n            this.am(0, a[i], r, i, 0, n - i);\\n        }\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\\n    // (protected) r = \\\"this * a\\\" without lower n words, n > 0\\n    // \\\"this\\\" should be the larger one if appropriate.\\n    BigInteger.prototype.multiplyUpperTo = function (a, n, r) {\\n        --n;\\n        var i = r.t = this.t + a.t - n;\\n        r.s = 0; // assumes a,this >= 0\\n        while (--i >= 0) {\\n            r[i] = 0;\\n        }\\n        for (i = Math.max(n - this.t, 0); i < a.t; ++i) {\\n            r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);\\n        }\\n        r.clamp();\\n        r.drShiftTo(1, r);\\n    };\\n    // BigInteger.prototype.modInt = bnpModInt;\\n    // (protected) this % n, n < 2^26\\n    BigInteger.prototype.modInt = function (n) {\\n        if (n <= 0) {\\n            return 0;\\n        }\\n        var d = this.DV % n;\\n        var r = (this.s < 0) ? n - 1 : 0;\\n        if (this.t > 0) {\\n            if (d == 0) {\\n                r = this[0] % n;\\n            }\\n            else {\\n                for (var i = this.t - 1; i >= 0; --i) {\\n                    r = (d * r + this[i]) % n;\\n                }\\n            }\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.millerRabin = bnpMillerRabin;\\n    // (protected) true if probably prime (HAC 4.24, Miller-Rabin)\\n    BigInteger.prototype.millerRabin = function (t) {\\n        var n1 = this.subtract(BigInteger.ONE);\\n        var k = n1.getLowestSetBit();\\n        if (k <= 0) {\\n            return false;\\n        }\\n        var r = n1.shiftRight(k);\\n        t = (t + 1) >> 1;\\n        if (t > lowprimes.length) {\\n            t = lowprimes.length;\\n        }\\n        var a = nbi();\\n        for (var i = 0; i < t; ++i) {\\n            // Pick bases at random, instead of starting at 2\\n            a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);\\n            var y = a.modPow(r, this);\\n            if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\\n                var j = 1;\\n                while (j++ < k && y.compareTo(n1) != 0) {\\n                    y = y.modPowInt(2, this);\\n                    if (y.compareTo(BigInteger.ONE) == 0) {\\n                        return false;\\n                    }\\n                }\\n                if (y.compareTo(n1) != 0) {\\n                    return false;\\n                }\\n            }\\n        }\\n        return true;\\n    };\\n    // BigInteger.prototype.square = bnSquare;\\n    // (public) this^2\\n    BigInteger.prototype.square = function () {\\n        var r = nbi();\\n        this.squareTo(r);\\n        return r;\\n    };\\n    //#region ASYNC\\n    // Public API method\\n    BigInteger.prototype.gcda = function (a, callback) {\\n        var x = (this.s < 0) ? this.negate() : this.clone();\\n        var y = (a.s < 0) ? a.negate() : a.clone();\\n        if (x.compareTo(y) < 0) {\\n            var t = x;\\n            x = y;\\n            y = t;\\n        }\\n        var i = x.getLowestSetBit();\\n        var g = y.getLowestSetBit();\\n        if (g < 0) {\\n            callback(x);\\n            return;\\n        }\\n        if (i < g) {\\n            g = i;\\n        }\\n        if (g > 0) {\\n            x.rShiftTo(g, x);\\n            y.rShiftTo(g, y);\\n        }\\n        // Workhorse of the algorithm, gets called 200 - 800 times per 512 bit keygen.\\n        var gcda1 = function () {\\n            if ((i = x.getLowestSetBit()) > 0) {\\n                x.rShiftTo(i, x);\\n            }\\n            if ((i = y.getLowestSetBit()) > 0) {\\n                y.rShiftTo(i, y);\\n            }\\n            if (x.compareTo(y) >= 0) {\\n                x.subTo(y, x);\\n                x.rShiftTo(1, x);\\n            }\\n            else {\\n                y.subTo(x, y);\\n                y.rShiftTo(1, y);\\n            }\\n            if (!(x.signum() > 0)) {\\n                if (g > 0) {\\n                    y.lShiftTo(g, y);\\n                }\\n                setTimeout(function () { callback(y); }, 0); // escape\\n            }\\n            else {\\n                setTimeout(gcda1, 0);\\n            }\\n        };\\n        setTimeout(gcda1, 10);\\n    };\\n    // (protected) alternate constructor\\n    BigInteger.prototype.fromNumberAsync = function (a, b, c, callback) {\\n        if (\\\"number\\\" == typeof b) {\\n            if (a < 2) {\\n                this.fromInt(1);\\n            }\\n            else {\\n                this.fromNumber(a, c);\\n                if (!this.testBit(a - 1)) {\\n                    this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), _util__WEBPACK_IMPORTED_MODULE_0__.op_or, this);\\n                }\\n                if (this.isEven()) {\\n                    this.dAddOffset(1, 0);\\n                }\\n                var bnp_1 = this;\\n                var bnpfn1_1 = function () {\\n                    bnp_1.dAddOffset(2, 0);\\n                    if (bnp_1.bitLength() > a) {\\n                        bnp_1.subTo(BigInteger.ONE.shiftLeft(a - 1), bnp_1);\\n                    }\\n                    if (bnp_1.isProbablePrime(b)) {\\n                        setTimeout(function () { callback(); }, 0); // escape\\n                    }\\n                    else {\\n                        setTimeout(bnpfn1_1, 0);\\n                    }\\n                };\\n                setTimeout(bnpfn1_1, 0);\\n            }\\n        }\\n        else {\\n            var x = [];\\n            var t = a & 7;\\n            x.length = (a >> 3) + 1;\\n            b.nextBytes(x);\\n            if (t > 0) {\\n                x[0] &= ((1 << t) - 1);\\n            }\\n            else {\\n                x[0] = 0;\\n            }\\n            this.fromString(x, 256);\\n        }\\n    };\\n    return BigInteger;\\n}());\\n\\n//#region REDUCERS\\n//#region NullExp\\nvar NullExp = /** @class */ (function () {\\n    function NullExp() {\\n    }\\n    // NullExp.prototype.convert = nNop;\\n    NullExp.prototype.convert = function (x) {\\n        return x;\\n    };\\n    // NullExp.prototype.revert = nNop;\\n    NullExp.prototype.revert = function (x) {\\n        return x;\\n    };\\n    // NullExp.prototype.mulTo = nMulTo;\\n    NullExp.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n    };\\n    // NullExp.prototype.sqrTo = nSqrTo;\\n    NullExp.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n    };\\n    return NullExp;\\n}());\\n// Modular reduction using \\\"classic\\\" algorithm\\nvar Classic = /** @class */ (function () {\\n    function Classic(m) {\\n        this.m = m;\\n    }\\n    // Classic.prototype.convert = cConvert;\\n    Classic.prototype.convert = function (x) {\\n        if (x.s < 0 || x.compareTo(this.m) >= 0) {\\n            return x.mod(this.m);\\n        }\\n        else {\\n            return x;\\n        }\\n    };\\n    // Classic.prototype.revert = cRevert;\\n    Classic.prototype.revert = function (x) {\\n        return x;\\n    };\\n    // Classic.prototype.reduce = cReduce;\\n    Classic.prototype.reduce = function (x) {\\n        x.divRemTo(this.m, null, x);\\n    };\\n    // Classic.prototype.mulTo = cMulTo;\\n    Classic.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n        this.reduce(r);\\n    };\\n    // Classic.prototype.sqrTo = cSqrTo;\\n    Classic.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n        this.reduce(r);\\n    };\\n    return Classic;\\n}());\\n//#endregion\\n//#region Montgomery\\n// Montgomery reduction\\nvar Montgomery = /** @class */ (function () {\\n    function Montgomery(m) {\\n        this.m = m;\\n        this.mp = m.invDigit();\\n        this.mpl = this.mp & 0x7fff;\\n        this.mph = this.mp >> 15;\\n        this.um = (1 << (m.DB - 15)) - 1;\\n        this.mt2 = 2 * m.t;\\n    }\\n    // Montgomery.prototype.convert = montConvert;\\n    // xR mod m\\n    Montgomery.prototype.convert = function (x) {\\n        var r = nbi();\\n        x.abs().dlShiftTo(this.m.t, r);\\n        r.divRemTo(this.m, null, r);\\n        if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {\\n            this.m.subTo(r, r);\\n        }\\n        return r;\\n    };\\n    // Montgomery.prototype.revert = montRevert;\\n    // x/R mod m\\n    Montgomery.prototype.revert = function (x) {\\n        var r = nbi();\\n        x.copyTo(r);\\n        this.reduce(r);\\n        return r;\\n    };\\n    // Montgomery.prototype.reduce = montReduce;\\n    // x = x/R mod m (HAC 14.32)\\n    Montgomery.prototype.reduce = function (x) {\\n        while (x.t <= this.mt2) {\\n            // pad x so am has enough room later\\n            x[x.t++] = 0;\\n        }\\n        for (var i = 0; i < this.m.t; ++i) {\\n            // faster way of calculating u0 = x[i]*mp mod DV\\n            var j = x[i] & 0x7fff;\\n            var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;\\n            // use am to combine the multiply-shift-add into one call\\n            j = i + this.m.t;\\n            x[j] += this.m.am(0, u0, x, i, 0, this.m.t);\\n            // propagate carry\\n            while (x[j] >= x.DV) {\\n                x[j] -= x.DV;\\n                x[++j]++;\\n            }\\n        }\\n        x.clamp();\\n        x.drShiftTo(this.m.t, x);\\n        if (x.compareTo(this.m) >= 0) {\\n            x.subTo(this.m, x);\\n        }\\n    };\\n    // Montgomery.prototype.mulTo = montMulTo;\\n    // r = \\\"xy/R mod m\\\"; x,y != r\\n    Montgomery.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n        this.reduce(r);\\n    };\\n    // Montgomery.prototype.sqrTo = montSqrTo;\\n    // r = \\\"x^2/R mod m\\\"; x != r\\n    Montgomery.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n        this.reduce(r);\\n    };\\n    return Montgomery;\\n}());\\n//#endregion Montgomery\\n//#region Barrett\\n// Barrett modular reduction\\nvar Barrett = /** @class */ (function () {\\n    function Barrett(m) {\\n        this.m = m;\\n        // setup Barrett\\n        this.r2 = nbi();\\n        this.q3 = nbi();\\n        BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);\\n        this.mu = this.r2.divide(m);\\n    }\\n    // Barrett.prototype.convert = barrettConvert;\\n    Barrett.prototype.convert = function (x) {\\n        if (x.s < 0 || x.t > 2 * this.m.t) {\\n            return x.mod(this.m);\\n        }\\n        else if (x.compareTo(this.m) < 0) {\\n            return x;\\n        }\\n        else {\\n            var r = nbi();\\n            x.copyTo(r);\\n            this.reduce(r);\\n            return r;\\n        }\\n    };\\n    // Barrett.prototype.revert = barrettRevert;\\n    Barrett.prototype.revert = function (x) {\\n        return x;\\n    };\\n    // Barrett.prototype.reduce = barrettReduce;\\n    // x = x mod m (HAC 14.42)\\n    Barrett.prototype.reduce = function (x) {\\n        x.drShiftTo(this.m.t - 1, this.r2);\\n        if (x.t > this.m.t + 1) {\\n            x.t = this.m.t + 1;\\n            x.clamp();\\n        }\\n        this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);\\n        this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);\\n        while (x.compareTo(this.r2) < 0) {\\n            x.dAddOffset(1, this.m.t + 1);\\n        }\\n        x.subTo(this.r2, x);\\n        while (x.compareTo(this.m) >= 0) {\\n            x.subTo(this.m, x);\\n        }\\n    };\\n    // Barrett.prototype.mulTo = barrettMulTo;\\n    // r = x*y mod m; x,y != r\\n    Barrett.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n        this.reduce(r);\\n    };\\n    // Barrett.prototype.sqrTo = barrettSqrTo;\\n    // r = x^2 mod m; x != r\\n    Barrett.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n        this.reduce(r);\\n    };\\n    return Barrett;\\n}());\\n//#endregion\\n//#endregion REDUCERS\\n// return new, unset BigInteger\\nfunction nbi() { return new BigInteger(null); }\\nfunction parseBigInt(str, r) {\\n    return new BigInteger(str, r);\\n}\\n// am: Compute w_j += (x*this_i), propagate carries,\\n// c is initial carry, returns final carry.\\n// c < 3*dvalue, x < 2*dvalue, this_i < dvalue\\n// We need to select the fastest one that works in this environment.\\nvar inBrowser = typeof navigator !== \\\"undefined\\\";\\nif (inBrowser && j_lm && (navigator.appName == \\\"Microsoft Internet Explorer\\\")) {\\n    // am2 avoids a big mult-and-extract completely.\\n    // Max digit bits should be <= 30 because we do bitwise ops\\n    // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\\n    BigInteger.prototype.am = function am2(i, x, w, j, c, n) {\\n        var xl = x & 0x7fff;\\n        var xh = x >> 15;\\n        while (--n >= 0) {\\n            var l = this[i] & 0x7fff;\\n            var h = this[i++] >> 15;\\n            var m = xh * l + h * xl;\\n            l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n            c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n            w[j++] = l & 0x3fffffff;\\n        }\\n        return c;\\n    };\\n    dbits = 30;\\n}\\nelse if (inBrowser && j_lm && (navigator.appName != \\\"Netscape\\\")) {\\n    // am1: use a single mult and divide to get the high bits,\\n    // max digit bits should be 26 because\\n    // max internal value = 2*dvalue^2-2*dvalue (< 2^53)\\n    BigInteger.prototype.am = function am1(i, x, w, j, c, n) {\\n        while (--n >= 0) {\\n            var v = x * this[i++] + w[j] + c;\\n            c = Math.floor(v / 0x4000000);\\n            w[j++] = v & 0x3ffffff;\\n        }\\n        return c;\\n    };\\n    dbits = 26;\\n}\\nelse { // Mozilla/Netscape seems to prefer am3\\n    // Alternately, set max digit bits to 28 since some\\n    // browsers slow down when dealing with 32-bit numbers.\\n    BigInteger.prototype.am = function am3(i, x, w, j, c, n) {\\n        var xl = x & 0x3fff;\\n        var xh = x >> 14;\\n        while (--n >= 0) {\\n            var l = this[i] & 0x3fff;\\n            var h = this[i++] >> 14;\\n            var m = xh * l + h * xl;\\n            l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;\\n            c = (l >> 28) + (m >> 14) + xh * h;\\n            w[j++] = l & 0xfffffff;\\n        }\\n        return c;\\n    };\\n    dbits = 28;\\n}\\nBigInteger.prototype.DB = dbits;\\nBigInteger.prototype.DM = ((1 << dbits) - 1);\\nBigInteger.prototype.DV = (1 << dbits);\\nvar BI_FP = 52;\\nBigInteger.prototype.FV = Math.pow(2, BI_FP);\\nBigInteger.prototype.F1 = BI_FP - dbits;\\nBigInteger.prototype.F2 = 2 * dbits - BI_FP;\\n// Digit conversions\\nvar BI_RC = [];\\nvar rr;\\nvar vv;\\nrr = \\\"0\\\".charCodeAt(0);\\nfor (vv = 0; vv <= 9; ++vv) {\\n    BI_RC[rr++] = vv;\\n}\\nrr = \\\"a\\\".charCodeAt(0);\\nfor (vv = 10; vv < 36; ++vv) {\\n    BI_RC[rr++] = vv;\\n}\\nrr = \\\"A\\\".charCodeAt(0);\\nfor (vv = 10; vv < 36; ++vv) {\\n    BI_RC[rr++] = vv;\\n}\\nfunction intAt(s, i) {\\n    var c = BI_RC[s.charCodeAt(i)];\\n    return (c == null) ? -1 : c;\\n}\\n// return bigint initialized to value\\nfunction nbv(i) {\\n    var r = nbi();\\n    r.fromInt(i);\\n    return r;\\n}\\n// returns bit length of the integer x\\nfunction nbits(x) {\\n    var r = 1;\\n    var t;\\n    if ((t = x >>> 16) != 0) {\\n        x = t;\\n        r += 16;\\n    }\\n    if ((t = x >> 8) != 0) {\\n        x = t;\\n        r += 8;\\n    }\\n    if ((t = x >> 4) != 0) {\\n        x = t;\\n        r += 4;\\n    }\\n    if ((t = x >> 2) != 0) {\\n        x = t;\\n        r += 2;\\n    }\\n    if ((t = x >> 1) != 0) {\\n        x = t;\\n        r += 1;\\n    }\\n    return r;\\n}\\n// \\\"constants\\\"\\nBigInteger.ZERO = nbv(0);\\nBigInteger.ONE = nbv(1);\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/jsbn.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/prng4.js\":\n/*!*******************************!*\\\n  !*** ./lib/lib/jsbn/prng4.js ***!\n  \\*******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Arcfour\\\": () => (/* binding */ Arcfour),\\n/* harmony export */   \\\"prng_newstate\\\": () => (/* binding */ prng_newstate),\\n/* harmony export */   \\\"rng_psize\\\": () => (/* binding */ rng_psize)\\n/* harmony export */ });\\n// prng4.js - uses Arcfour as a PRNG\\nvar Arcfour = /** @class */ (function () {\\n    function Arcfour() {\\n        this.i = 0;\\n        this.j = 0;\\n        this.S = [];\\n    }\\n    // Arcfour.prototype.init = ARC4init;\\n    // Initialize arcfour context from key, an array of ints, each from [0..255]\\n    Arcfour.prototype.init = function (key) {\\n        var i;\\n        var j;\\n        var t;\\n        for (i = 0; i < 256; ++i) {\\n            this.S[i] = i;\\n        }\\n        j = 0;\\n        for (i = 0; i < 256; ++i) {\\n            j = (j + this.S[i] + key[i % key.length]) & 255;\\n            t = this.S[i];\\n            this.S[i] = this.S[j];\\n            this.S[j] = t;\\n        }\\n        this.i = 0;\\n        this.j = 0;\\n    };\\n    // Arcfour.prototype.next = ARC4next;\\n    Arcfour.prototype.next = function () {\\n        var t;\\n        this.i = (this.i + 1) & 255;\\n        this.j = (this.j + this.S[this.i]) & 255;\\n        t = this.S[this.i];\\n        this.S[this.i] = this.S[this.j];\\n        this.S[this.j] = t;\\n        return this.S[(t + this.S[this.i]) & 255];\\n    };\\n    return Arcfour;\\n}());\\n\\n// Plug in your RNG constructor here\\nfunction prng_newstate() {\\n    return new Arcfour();\\n}\\n// Pool size must be a multiple of 4 and greater than 32.\\n// An array of bytes the size of the pool will be passed to init()\\nvar rng_psize = 256;\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/prng4.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/rng.js\":\n/*!*****************************!*\\\n  !*** ./lib/lib/jsbn/rng.js ***!\n  \\*****************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"SecureRandom\\\": () => (/* binding */ SecureRandom)\\n/* harmony export */ });\\n/* harmony import */ var _prng4__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./prng4 */ \\\"./lib/lib/jsbn/prng4.js\\\");\\n// Random number generator - requires a PRNG backend, e.g. prng4.js\\n\\nvar rng_state;\\nvar rng_pool = null;\\nvar rng_pptr;\\n// Initialize the pool with junk if needed.\\nif (rng_pool == null) {\\n    rng_pool = [];\\n    rng_pptr = 0;\\n    var t = void 0;\\n    if (window.crypto && window.crypto.getRandomValues) {\\n        // Extract entropy (2048 bits) from RNG if available\\n        var z = new Uint32Array(256);\\n        window.crypto.getRandomValues(z);\\n        for (t = 0; t < z.length; ++t) {\\n            rng_pool[rng_pptr++] = z[t] & 255;\\n        }\\n    }\\n    // Use mouse events for entropy, if we do not have enough entropy by the time\\n    // we need it, entropy will be generated by Math.random.\\n    var count = 0;\\n    var onMouseMoveListener_1 = function (ev) {\\n        count = count || 0;\\n        if (count >= 256 || rng_pptr >= _prng4__WEBPACK_IMPORTED_MODULE_0__.rng_psize) {\\n            if (window.removeEventListener) {\\n                window.removeEventListener(\\\"mousemove\\\", onMouseMoveListener_1, false);\\n            }\\n            else if (window.detachEvent) {\\n                window.detachEvent(\\\"onmousemove\\\", onMouseMoveListener_1);\\n            }\\n            return;\\n        }\\n        try {\\n            var mouseCoordinates = ev.x + ev.y;\\n            rng_pool[rng_pptr++] = mouseCoordinates & 255;\\n            count += 1;\\n        }\\n        catch (e) {\\n            // Sometimes Firefox will deny permission to access event properties for some reason. Ignore.\\n        }\\n    };\\n    if (window.addEventListener) {\\n        window.addEventListener(\\\"mousemove\\\", onMouseMoveListener_1, false);\\n    }\\n    else if (window.attachEvent) {\\n        window.attachEvent(\\\"onmousemove\\\", onMouseMoveListener_1);\\n    }\\n}\\nfunction rng_get_byte() {\\n    if (rng_state == null) {\\n        rng_state = (0,_prng4__WEBPACK_IMPORTED_MODULE_0__.prng_newstate)();\\n        // At this point, we may not have collected enough entropy.  If not, fall back to Math.random\\n        while (rng_pptr < _prng4__WEBPACK_IMPORTED_MODULE_0__.rng_psize) {\\n            var random = Math.floor(65536 * Math.random());\\n            rng_pool[rng_pptr++] = random & 255;\\n        }\\n        rng_state.init(rng_pool);\\n        for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr) {\\n            rng_pool[rng_pptr] = 0;\\n        }\\n        rng_pptr = 0;\\n    }\\n    // TODO: allow reseeding after first request\\n    return rng_state.next();\\n}\\nvar SecureRandom = /** @class */ (function () {\\n    function SecureRandom() {\\n    }\\n    SecureRandom.prototype.nextBytes = function (ba) {\\n        for (var i = 0; i < ba.length; ++i) {\\n            ba[i] = rng_get_byte();\\n        }\\n    };\\n    return SecureRandom;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/rng.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/rsa.js\":\n/*!*****************************!*\\\n  !*** ./lib/lib/jsbn/rsa.js ***!\n  \\*****************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"RSAKey\\\": () => (/* binding */ RSAKey)\\n/* harmony export */ });\\n/* harmony import */ var _jsbn__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./jsbn */ \\\"./lib/lib/jsbn/jsbn.js\\\");\\n/* harmony import */ var _rng__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./rng */ \\\"./lib/lib/jsbn/rng.js\\\");\\n// Depends on jsbn.js and rng.js\\n// Version 1.1: support utf-8 encoding in pkcs1pad2\\n// convert a (hex) string to a bignum object\\n\\n\\n// function linebrk(s,n) {\\n//   var ret = \\\"\\\";\\n//   var i = 0;\\n//   while(i + n < s.length) {\\n//     ret += s.substring(i,i+n) + \\\"\\\\n\\\";\\n//     i += n;\\n//   }\\n//   return ret + s.substring(i,s.length);\\n// }\\n// function byte2Hex(b) {\\n//   if(b < 0x10)\\n//     return \\\"0\\\" + b.toString(16);\\n//   else\\n//     return b.toString(16);\\n// }\\nfunction pkcs1pad1(s, n) {\\n    if (n < s.length + 22) {\\n        console.error(\\\"Message too long for RSA\\\");\\n        return null;\\n    }\\n    var len = n - s.length - 6;\\n    var filler = \\\"\\\";\\n    for (var f = 0; f < len; f += 2) {\\n        filler += \\\"ff\\\";\\n    }\\n    var m = \\\"0001\\\" + filler + \\\"00\\\" + s;\\n    return (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(m, 16);\\n}\\n// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint\\nfunction pkcs1pad2(s, n) {\\n    if (n < s.length + 11) { // TODO: fix for utf-8\\n        console.error(\\\"Message too long for RSA\\\");\\n        return null;\\n    }\\n    var ba = [];\\n    var i = s.length - 1;\\n    while (i >= 0 && n > 0) {\\n        var c = s.charCodeAt(i--);\\n        if (c < 128) { // encode using utf-8\\n            ba[--n] = c;\\n        }\\n        else if ((c > 127) && (c < 2048)) {\\n            ba[--n] = (c & 63) | 128;\\n            ba[--n] = (c >> 6) | 192;\\n        }\\n        else {\\n            ba[--n] = (c & 63) | 128;\\n            ba[--n] = ((c >> 6) & 63) | 128;\\n            ba[--n] = (c >> 12) | 224;\\n        }\\n    }\\n    ba[--n] = 0;\\n    var rng = new _rng__WEBPACK_IMPORTED_MODULE_1__.SecureRandom();\\n    var x = [];\\n    while (n > 2) { // random non-zero pad\\n        x[0] = 0;\\n        while (x[0] == 0) {\\n            rng.nextBytes(x);\\n        }\\n        ba[--n] = x[0];\\n    }\\n    ba[--n] = 2;\\n    ba[--n] = 0;\\n    return new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(ba);\\n}\\n// \\\"empty\\\" RSA key constructor\\nvar RSAKey = /** @class */ (function () {\\n    function RSAKey() {\\n        this.n = null;\\n        this.e = 0;\\n        this.d = null;\\n        this.p = null;\\n        this.q = null;\\n        this.dmp1 = null;\\n        this.dmq1 = null;\\n        this.coeff = null;\\n    }\\n    //#region PROTECTED\\n    // protected\\n    // RSAKey.prototype.doPublic = RSADoPublic;\\n    // Perform raw public operation on \\\"x\\\": return x^e (mod n)\\n    RSAKey.prototype.doPublic = function (x) {\\n        return x.modPowInt(this.e, this.n);\\n    };\\n    // RSAKey.prototype.doPrivate = RSADoPrivate;\\n    // Perform raw private operation on \\\"x\\\": return x^d (mod n)\\n    RSAKey.prototype.doPrivate = function (x) {\\n        if (this.p == null || this.q == null) {\\n            return x.modPow(this.d, this.n);\\n        }\\n        // TODO: re-calculate any missing CRT params\\n        var xp = x.mod(this.p).modPow(this.dmp1, this.p);\\n        var xq = x.mod(this.q).modPow(this.dmq1, this.q);\\n        while (xp.compareTo(xq) < 0) {\\n            xp = xp.add(this.p);\\n        }\\n        return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq);\\n    };\\n    //#endregion PROTECTED\\n    //#region PUBLIC\\n    // RSAKey.prototype.setPublic = RSASetPublic;\\n    // Set the public key fields N and e from hex strings\\n    RSAKey.prototype.setPublic = function (N, E) {\\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\\n            this.n = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(N, 16);\\n            this.e = parseInt(E, 16);\\n        }\\n        else {\\n            console.error(\\\"Invalid RSA public key\\\");\\n        }\\n    };\\n    // RSAKey.prototype.encrypt = RSAEncrypt;\\n    // Return the PKCS#1 RSA encryption of \\\"text\\\" as an even-length hex string\\n    RSAKey.prototype.encrypt = function (text) {\\n        var maxLength = (this.n.bitLength() + 7) >> 3;\\n        var m = pkcs1pad2(text, maxLength);\\n        if (m == null) {\\n            return null;\\n        }\\n        var c = this.doPublic(m);\\n        if (c == null) {\\n            return null;\\n        }\\n        var h = c.toString(16);\\n        var length = h.length;\\n        // fix zero before result\\n        for (var i = 0; i < maxLength * 2 - length; i++) {\\n            h = \\\"0\\\" + h;\\n        }\\n        return h;\\n    };\\n    // RSAKey.prototype.setPrivate = RSASetPrivate;\\n    // Set the private key fields N, e, and d from hex strings\\n    RSAKey.prototype.setPrivate = function (N, E, D) {\\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\\n            this.n = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(N, 16);\\n            this.e = parseInt(E, 16);\\n            this.d = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(D, 16);\\n        }\\n        else {\\n            console.error(\\\"Invalid RSA private key\\\");\\n        }\\n    };\\n    // RSAKey.prototype.setPrivateEx = RSASetPrivateEx;\\n    // Set the private key fields N, e, d and CRT params from hex strings\\n    RSAKey.prototype.setPrivateEx = function (N, E, D, P, Q, DP, DQ, C) {\\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\\n            this.n = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(N, 16);\\n            this.e = parseInt(E, 16);\\n            this.d = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(D, 16);\\n            this.p = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(P, 16);\\n            this.q = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(Q, 16);\\n            this.dmp1 = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(DP, 16);\\n            this.dmq1 = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(DQ, 16);\\n            this.coeff = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(C, 16);\\n        }\\n        else {\\n            console.error(\\\"Invalid RSA private key\\\");\\n        }\\n    };\\n    // RSAKey.prototype.generate = RSAGenerate;\\n    // Generate a new random private key B bits long, using public expt E\\n    RSAKey.prototype.generate = function (B, E) {\\n        var rng = new _rng__WEBPACK_IMPORTED_MODULE_1__.SecureRandom();\\n        var qs = B >> 1;\\n        this.e = parseInt(E, 16);\\n        var ee = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(E, 16);\\n        for (;;) {\\n            for (;;) {\\n                this.p = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(B - qs, 1, rng);\\n                if (this.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) {\\n                    break;\\n                }\\n            }\\n            for (;;) {\\n                this.q = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(qs, 1, rng);\\n                if (this.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) {\\n                    break;\\n                }\\n            }\\n            if (this.p.compareTo(this.q) <= 0) {\\n                var t = this.p;\\n                this.p = this.q;\\n                this.q = t;\\n            }\\n            var p1 = this.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n            var q1 = this.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n            var phi = p1.multiply(q1);\\n            if (phi.gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0) {\\n                this.n = this.p.multiply(this.q);\\n                this.d = ee.modInverse(phi);\\n                this.dmp1 = this.d.mod(p1);\\n                this.dmq1 = this.d.mod(q1);\\n                this.coeff = this.q.modInverse(this.p);\\n                break;\\n            }\\n        }\\n    };\\n    // RSAKey.prototype.decrypt = RSADecrypt;\\n    // Return the PKCS#1 RSA decryption of \\\"ctext\\\".\\n    // \\\"ctext\\\" is an even-length hex string and the output is a plain string.\\n    RSAKey.prototype.decrypt = function (ctext) {\\n        var c = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(ctext, 16);\\n        var m = this.doPrivate(c);\\n        if (m == null) {\\n            return null;\\n        }\\n        return pkcs1unpad2(m, (this.n.bitLength() + 7) >> 3);\\n    };\\n    // Generate a new random private key B bits long, using public expt E\\n    RSAKey.prototype.generateAsync = function (B, E, callback) {\\n        var rng = new _rng__WEBPACK_IMPORTED_MODULE_1__.SecureRandom();\\n        var qs = B >> 1;\\n        this.e = parseInt(E, 16);\\n        var ee = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(E, 16);\\n        var rsa = this;\\n        // These functions have non-descript names because they were originally for(;;) loops.\\n        // I don't know about cryptography to give them better names than loop1-4.\\n        var loop1 = function () {\\n            var loop4 = function () {\\n                if (rsa.p.compareTo(rsa.q) <= 0) {\\n                    var t = rsa.p;\\n                    rsa.p = rsa.q;\\n                    rsa.q = t;\\n                }\\n                var p1 = rsa.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n                var q1 = rsa.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n                var phi = p1.multiply(q1);\\n                if (phi.gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0) {\\n                    rsa.n = rsa.p.multiply(rsa.q);\\n                    rsa.d = ee.modInverse(phi);\\n                    rsa.dmp1 = rsa.d.mod(p1);\\n                    rsa.dmq1 = rsa.d.mod(q1);\\n                    rsa.coeff = rsa.q.modInverse(rsa.p);\\n                    setTimeout(function () { callback(); }, 0); // escape\\n                }\\n                else {\\n                    setTimeout(loop1, 0);\\n                }\\n            };\\n            var loop3 = function () {\\n                rsa.q = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.nbi)();\\n                rsa.q.fromNumberAsync(qs, 1, rng, function () {\\n                    rsa.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcda(ee, function (r) {\\n                        if (r.compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && rsa.q.isProbablePrime(10)) {\\n                            setTimeout(loop4, 0);\\n                        }\\n                        else {\\n                            setTimeout(loop3, 0);\\n                        }\\n                    });\\n                });\\n            };\\n            var loop2 = function () {\\n                rsa.p = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.nbi)();\\n                rsa.p.fromNumberAsync(B - qs, 1, rng, function () {\\n                    rsa.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcda(ee, function (r) {\\n                        if (r.compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && rsa.p.isProbablePrime(10)) {\\n                            setTimeout(loop3, 0);\\n                        }\\n                        else {\\n                            setTimeout(loop2, 0);\\n                        }\\n                    });\\n                });\\n            };\\n            setTimeout(loop2, 0);\\n        };\\n        setTimeout(loop1, 0);\\n    };\\n    RSAKey.prototype.sign = function (text, digestMethod, digestName) {\\n        var header = getDigestHeader(digestName);\\n        var digest = header + digestMethod(text).toString();\\n        var m = pkcs1pad1(digest, this.n.bitLength() / 4);\\n        if (m == null) {\\n            return null;\\n        }\\n        var c = this.doPrivate(m);\\n        if (c == null) {\\n            return null;\\n        }\\n        var h = c.toString(16);\\n        if ((h.length & 1) == 0) {\\n            return h;\\n        }\\n        else {\\n            return \\\"0\\\" + h;\\n        }\\n    };\\n    RSAKey.prototype.verify = function (text, signature, digestMethod) {\\n        var c = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(signature, 16);\\n        var m = this.doPublic(c);\\n        if (m == null) {\\n            return null;\\n        }\\n        var unpadded = m.toString(16).replace(/^1f+00/, \\\"\\\");\\n        var digest = removeDigestHeader(unpadded);\\n        return digest == digestMethod(text).toString();\\n    };\\n    return RSAKey;\\n}());\\n\\n// Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext\\nfunction pkcs1unpad2(d, n) {\\n    var b = d.toByteArray();\\n    var i = 0;\\n    while (i < b.length && b[i] == 0) {\\n        ++i;\\n    }\\n    if (b.length - i != n - 1 || b[i] != 2) {\\n        return null;\\n    }\\n    ++i;\\n    while (b[i] != 0) {\\n        if (++i >= b.length) {\\n            return null;\\n        }\\n    }\\n    var ret = \\\"\\\";\\n    while (++i < b.length) {\\n        var c = b[i] & 255;\\n        if (c < 128) { // utf-8 decode\\n            ret += String.fromCharCode(c);\\n        }\\n        else if ((c > 191) && (c < 224)) {\\n            ret += String.fromCharCode(((c & 31) << 6) | (b[i + 1] & 63));\\n            ++i;\\n        }\\n        else {\\n            ret += String.fromCharCode(((c & 15) << 12) | ((b[i + 1] & 63) << 6) | (b[i + 2] & 63));\\n            i += 2;\\n        }\\n    }\\n    return ret;\\n}\\n// https://tools.ietf.org/html/rfc3447#page-43\\nvar DIGEST_HEADERS = {\\n    md2: \\\"3020300c06082a864886f70d020205000410\\\",\\n    md5: \\\"3020300c06082a864886f70d020505000410\\\",\\n    sha1: \\\"3021300906052b0e03021a05000414\\\",\\n    sha224: \\\"302d300d06096086480165030402040500041c\\\",\\n    sha256: \\\"3031300d060960864801650304020105000420\\\",\\n    sha384: \\\"3041300d060960864801650304020205000430\\\",\\n    sha512: \\\"3051300d060960864801650304020305000440\\\",\\n    ripemd160: \\\"3021300906052b2403020105000414\\\"\\n};\\nfunction getDigestHeader(name) {\\n    return DIGEST_HEADERS[name] || \\\"\\\";\\n}\\nfunction removeDigestHeader(str) {\\n    for (var name_1 in DIGEST_HEADERS) {\\n        if (DIGEST_HEADERS.hasOwnProperty(name_1)) {\\n            var header = DIGEST_HEADERS[name_1];\\n            var len = header.length;\\n            if (str.substr(0, len) == header) {\\n                return str.substr(len);\\n            }\\n        }\\n    }\\n    return str;\\n}\\n// Return the PKCS#1 RSA encryption of \\\"text\\\" as a Base64-encoded string\\n// function RSAEncryptB64(text) {\\n//  var h = this.encrypt(text);\\n//  if(h) return hex2b64(h); else return null;\\n// }\\n// public\\n// RSAKey.prototype.encrypt_b64 = RSAEncryptB64;\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/rsa.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/util.js\":\n/*!******************************!*\\\n  !*** ./lib/lib/jsbn/util.js ***!\n  \\******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"int2char\\\": () => (/* binding */ int2char),\\n/* harmony export */   \\\"op_and\\\": () => (/* binding */ op_and),\\n/* harmony export */   \\\"op_or\\\": () => (/* binding */ op_or),\\n/* harmony export */   \\\"op_xor\\\": () => (/* binding */ op_xor),\\n/* harmony export */   \\\"op_andnot\\\": () => (/* binding */ op_andnot),\\n/* harmony export */   \\\"lbit\\\": () => (/* binding */ lbit),\\n/* harmony export */   \\\"cbit\\\": () => (/* binding */ cbit)\\n/* harmony export */ });\\nvar BI_RM = \\\"0123456789abcdefghijklmnopqrstuvwxyz\\\";\\nfunction int2char(n) {\\n    return BI_RM.charAt(n);\\n}\\n//#region BIT_OPERATIONS\\n// (public) this & a\\nfunction op_and(x, y) {\\n    return x & y;\\n}\\n// (public) this | a\\nfunction op_or(x, y) {\\n    return x | y;\\n}\\n// (public) this ^ a\\nfunction op_xor(x, y) {\\n    return x ^ y;\\n}\\n// (public) this & ~a\\nfunction op_andnot(x, y) {\\n    return x & ~y;\\n}\\n// return index of lowest 1-bit in x, x < 2^31\\nfunction lbit(x) {\\n    if (x == 0) {\\n        return -1;\\n    }\\n    var r = 0;\\n    if ((x & 0xffff) == 0) {\\n        x >>= 16;\\n        r += 16;\\n    }\\n    if ((x & 0xff) == 0) {\\n        x >>= 8;\\n        r += 8;\\n    }\\n    if ((x & 0xf) == 0) {\\n        x >>= 4;\\n        r += 4;\\n    }\\n    if ((x & 3) == 0) {\\n        x >>= 2;\\n        r += 2;\\n    }\\n    if ((x & 1) == 0) {\\n        ++r;\\n    }\\n    return r;\\n}\\n// return number of 1 bits in x\\nfunction cbit(x) {\\n    var r = 0;\\n    while (x != 0) {\\n        x &= x - 1;\\n        ++r;\\n    }\\n    return r;\\n}\\n//#endregion BIT_OPERATIONS\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/util.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsrsasign/asn1-1.0.js\":\n/*!***************************************!*\\\n  !*** ./lib/lib/jsrsasign/asn1-1.0.js ***!\n  \\***************************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"KJUR\\\": () => (/* binding */ KJUR)\\n/* harmony export */ });\\n/* harmony import */ var _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../jsbn/jsbn */ \\\"./lib/lib/jsbn/jsbn.js\\\");\\n/* harmony import */ var _yahoo__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./yahoo */ \\\"./lib/lib/jsrsasign/yahoo.js\\\");\\n/* asn1-1.0.13.js (c) 2013-2017 Kenji Urushima | kjur.github.com/jsrsasign/license\\n */\\n/*\\n * asn1.js - ASN.1 DER encoder classes\\n *\\n * Copyright (c) 2013-2017 Kenji Urushima (kenji.urushima@gmail.com)\\n *\\n * This software is licensed under the terms of the MIT License.\\n * https://kjur.github.io/jsrsasign/license\\n *\\n * The above copyright and license notice shall be\\n * included in all copies or substantial portions of the Software.\\n */\\n\\n\\n/**\\n * @fileOverview\\n * @name asn1-1.0.js\\n * @author Kenji Urushima kenji.urushima@gmail.com\\n * @version asn1 1.0.13 (2017-Jun-02)\\n * @since jsrsasign 2.1\\n * @license <a href=\\\"https://kjur.github.io/jsrsasign/license/\\\">MIT License</a>\\n */\\n/**\\n * kjur's class library name space\\n * <p>\\n * This name space provides following name spaces:\\n * <ul>\\n * <li>{@link KJUR.asn1} - ASN.1 primitive hexadecimal encoder</li>\\n * <li>{@link KJUR.asn1.x509} - ASN.1 structure for X.509 certificate and CRL</li>\\n * <li>{@link KJUR.crypto} - Java Cryptographic Extension(JCE) style MessageDigest/Signature\\n * class and utilities</li>\\n * </ul>\\n * </p>\\n * NOTE: Please ignore method summary and document of this namespace. This caused by a bug of jsdoc2.\\n * @name KJUR\\n * @namespace kjur's class library name space\\n */\\nvar KJUR = {};\\n/**\\n * kjur's ASN.1 class library name space\\n * <p>\\n * This is ITU-T X.690 ASN.1 DER encoder class library and\\n * class structure and methods is very similar to\\n * org.bouncycastle.asn1 package of\\n * well known BouncyCaslte Cryptography Library.\\n * <h4>PROVIDING ASN.1 PRIMITIVES</h4>\\n * Here are ASN.1 DER primitive classes.\\n * <ul>\\n * <li>0x01 {@link KJUR.asn1.DERBoolean}</li>\\n * <li>0x02 {@link KJUR.asn1.DERInteger}</li>\\n * <li>0x03 {@link KJUR.asn1.DERBitString}</li>\\n * <li>0x04 {@link KJUR.asn1.DEROctetString}</li>\\n * <li>0x05 {@link KJUR.asn1.DERNull}</li>\\n * <li>0x06 {@link KJUR.asn1.DERObjectIdentifier}</li>\\n * <li>0x0a {@link KJUR.asn1.DEREnumerated}</li>\\n * <li>0x0c {@link KJUR.asn1.DERUTF8String}</li>\\n * <li>0x12 {@link KJUR.asn1.DERNumericString}</li>\\n * <li>0x13 {@link KJUR.asn1.DERPrintableString}</li>\\n * <li>0x14 {@link KJUR.asn1.DERTeletexString}</li>\\n * <li>0x16 {@link KJUR.asn1.DERIA5String}</li>\\n * <li>0x17 {@link KJUR.asn1.DERUTCTime}</li>\\n * <li>0x18 {@link KJUR.asn1.DERGeneralizedTime}</li>\\n * <li>0x30 {@link KJUR.asn1.DERSequence}</li>\\n * <li>0x31 {@link KJUR.asn1.DERSet}</li>\\n * </ul>\\n * <h4>OTHER ASN.1 CLASSES</h4>\\n * <ul>\\n * <li>{@link KJUR.asn1.ASN1Object}</li>\\n * <li>{@link KJUR.asn1.DERAbstractString}</li>\\n * <li>{@link KJUR.asn1.DERAbstractTime}</li>\\n * <li>{@link KJUR.asn1.DERAbstractStructured}</li>\\n * <li>{@link KJUR.asn1.DERTaggedObject}</li>\\n * </ul>\\n * <h4>SUB NAME SPACES</h4>\\n * <ul>\\n * <li>{@link KJUR.asn1.cades} - CAdES long term signature format</li>\\n * <li>{@link KJUR.asn1.cms} - Cryptographic Message Syntax</li>\\n * <li>{@link KJUR.asn1.csr} - Certificate Signing Request (CSR/PKCS#10)</li>\\n * <li>{@link KJUR.asn1.tsp} - RFC 3161 Timestamping Protocol Format</li>\\n * <li>{@link KJUR.asn1.x509} - RFC 5280 X.509 certificate and CRL</li>\\n * </ul>\\n * </p>\\n * NOTE: Please ignore method summary and document of this namespace.\\n * This caused by a bug of jsdoc2.\\n * @name KJUR.asn1\\n * @namespace\\n */\\nif (typeof KJUR.asn1 == \\\"undefined\\\" || !KJUR.asn1)\\n    KJUR.asn1 = {};\\n/**\\n * ASN1 utilities class\\n * @name KJUR.asn1.ASN1Util\\n * @class ASN1 utilities class\\n * @since asn1 1.0.2\\n */\\nKJUR.asn1.ASN1Util = new function () {\\n    this.integerToByteHex = function (i) {\\n        var h = i.toString(16);\\n        if ((h.length % 2) == 1)\\n            h = '0' + h;\\n        return h;\\n    };\\n    this.bigIntToMinTwosComplementsHex = function (bigIntegerValue) {\\n        var h = bigIntegerValue.toString(16);\\n        if (h.substr(0, 1) != '-') {\\n            if (h.length % 2 == 1) {\\n                h = '0' + h;\\n            }\\n            else {\\n                if (!h.match(/^[0-7]/)) {\\n                    h = '00' + h;\\n                }\\n            }\\n        }\\n        else {\\n            var hPos = h.substr(1);\\n            var xorLen = hPos.length;\\n            if (xorLen % 2 == 1) {\\n                xorLen += 1;\\n            }\\n            else {\\n                if (!h.match(/^[0-7]/)) {\\n                    xorLen += 2;\\n                }\\n            }\\n            var hMask = '';\\n            for (var i = 0; i < xorLen; i++) {\\n                hMask += 'f';\\n            }\\n            var biMask = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(hMask, 16);\\n            var biNeg = biMask.xor(bigIntegerValue).add(_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n            h = biNeg.toString(16).replace(/^-/, '');\\n        }\\n        return h;\\n    };\\n    /**\\n     * get PEM string from hexadecimal data and header string\\n     * @name getPEMStringFromHex\\n     * @memberOf KJUR.asn1.ASN1Util\\n     * @function\\n     * @param {String} dataHex hexadecimal string of PEM body\\n     * @param {String} pemHeader PEM header string (ex. 'RSA PRIVATE KEY')\\n     * @return {String} PEM formatted string of input data\\n     * @description\\n     * This method converts a hexadecimal string to a PEM string with\\n     * a specified header. Its line break will be CRLF(\\\"\\\\r\\\\n\\\").\\n     * @example\\n     * var pem  = KJUR.asn1.ASN1Util.getPEMStringFromHex('616161', 'RSA PRIVATE KEY');\\n     * // value of pem will be:\\n     * -----BEGIN PRIVATE KEY-----\\n     * YWFh\\n     * -----END PRIVATE KEY-----\\n     */\\n    this.getPEMStringFromHex = function (dataHex, pemHeader) {\\n        return hextopem(dataHex, pemHeader);\\n    };\\n    /**\\n     * generate ASN1Object specifed by JSON parameters\\n     * @name newObject\\n     * @memberOf KJUR.asn1.ASN1Util\\n     * @function\\n     * @param {Array} param JSON parameter to generate ASN1Object\\n     * @return {KJUR.asn1.ASN1Object} generated object\\n     * @since asn1 1.0.3\\n     * @description\\n     * generate any ASN1Object specified by JSON param\\n     * including ASN.1 primitive or structured.\\n     * Generally 'param' can be described as follows:\\n     * <blockquote>\\n     * {TYPE-OF-ASNOBJ: ASN1OBJ-PARAMETER}\\n     * </blockquote>\\n     * 'TYPE-OF-ASN1OBJ' can be one of following symbols:\\n     * <ul>\\n     * <li>'bool' - DERBoolean</li>\\n     * <li>'int' - DERInteger</li>\\n     * <li>'bitstr' - DERBitString</li>\\n     * <li>'octstr' - DEROctetString</li>\\n     * <li>'null' - DERNull</li>\\n     * <li>'oid' - DERObjectIdentifier</li>\\n     * <li>'enum' - DEREnumerated</li>\\n     * <li>'utf8str' - DERUTF8String</li>\\n     * <li>'numstr' - DERNumericString</li>\\n     * <li>'prnstr' - DERPrintableString</li>\\n     * <li>'telstr' - DERTeletexString</li>\\n     * <li>'ia5str' - DERIA5String</li>\\n     * <li>'utctime' - DERUTCTime</li>\\n     * <li>'gentime' - DERGeneralizedTime</li>\\n     * <li>'seq' - DERSequence</li>\\n     * <li>'set' - DERSet</li>\\n     * <li>'tag' - DERTaggedObject</li>\\n     * </ul>\\n     * @example\\n     * newObject({'prnstr': 'aaa'});\\n     * newObject({'seq': [{'int': 3}, {'prnstr': 'aaa'}]})\\n     * // ASN.1 Tagged Object\\n     * newObject({'tag': {'tag': 'a1',\\n     *                    'explicit': true,\\n     *                    'obj': {'seq': [{'int': 3}, {'prnstr': 'aaa'}]}}});\\n     * // more simple representation of ASN.1 Tagged Object\\n     * newObject({'tag': ['a1',\\n     *                    true,\\n     *                    {'seq': [\\n     *                      {'int': 3},\\n     *                      {'prnstr': 'aaa'}]}\\n     *                   ]});\\n     */\\n    this.newObject = function (param) {\\n        var _KJUR = KJUR, _KJUR_asn1 = _KJUR.asn1, _DERBoolean = _KJUR_asn1.DERBoolean, _DERInteger = _KJUR_asn1.DERInteger, _DERBitString = _KJUR_asn1.DERBitString, _DEROctetString = _KJUR_asn1.DEROctetString, _DERNull = _KJUR_asn1.DERNull, _DERObjectIdentifier = _KJUR_asn1.DERObjectIdentifier, _DEREnumerated = _KJUR_asn1.DEREnumerated, _DERUTF8String = _KJUR_asn1.DERUTF8String, _DERNumericString = _KJUR_asn1.DERNumericString, _DERPrintableString = _KJUR_asn1.DERPrintableString, _DERTeletexString = _KJUR_asn1.DERTeletexString, _DERIA5String = _KJUR_asn1.DERIA5String, _DERUTCTime = _KJUR_asn1.DERUTCTime, _DERGeneralizedTime = _KJUR_asn1.DERGeneralizedTime, _DERSequence = _KJUR_asn1.DERSequence, _DERSet = _KJUR_asn1.DERSet, _DERTaggedObject = _KJUR_asn1.DERTaggedObject, _newObject = _KJUR_asn1.ASN1Util.newObject;\\n        var keys = Object.keys(param);\\n        if (keys.length != 1)\\n            throw \\\"key of param shall be only one.\\\";\\n        var key = keys[0];\\n        if (\\\":bool:int:bitstr:octstr:null:oid:enum:utf8str:numstr:prnstr:telstr:ia5str:utctime:gentime:seq:set:tag:\\\".indexOf(\\\":\\\" + key + \\\":\\\") == -1)\\n            throw \\\"undefined key: \\\" + key;\\n        if (key == \\\"bool\\\")\\n            return new _DERBoolean(param[key]);\\n        if (key == \\\"int\\\")\\n            return new _DERInteger(param[key]);\\n        if (key == \\\"bitstr\\\")\\n            return new _DERBitString(param[key]);\\n        if (key == \\\"octstr\\\")\\n            return new _DEROctetString(param[key]);\\n        if (key == \\\"null\\\")\\n            return new _DERNull(param[key]);\\n        if (key == \\\"oid\\\")\\n            return new _DERObjectIdentifier(param[key]);\\n        if (key == \\\"enum\\\")\\n            return new _DEREnumerated(param[key]);\\n        if (key == \\\"utf8str\\\")\\n            return new _DERUTF8String(param[key]);\\n        if (key == \\\"numstr\\\")\\n            return new _DERNumericString(param[key]);\\n        if (key == \\\"prnstr\\\")\\n            return new _DERPrintableString(param[key]);\\n        if (key == \\\"telstr\\\")\\n            return new _DERTeletexString(param[key]);\\n        if (key == \\\"ia5str\\\")\\n            return new _DERIA5String(param[key]);\\n        if (key == \\\"utctime\\\")\\n            return new _DERUTCTime(param[key]);\\n        if (key == \\\"gentime\\\")\\n            return new _DERGeneralizedTime(param[key]);\\n        if (key == \\\"seq\\\") {\\n            var paramList = param[key];\\n            var a = [];\\n            for (var i = 0; i < paramList.length; i++) {\\n                var asn1Obj = _newObject(paramList[i]);\\n                a.push(asn1Obj);\\n            }\\n            return new _DERSequence({ 'array': a });\\n        }\\n        if (key == \\\"set\\\") {\\n            var paramList = param[key];\\n            var a = [];\\n            for (var i = 0; i < paramList.length; i++) {\\n                var asn1Obj = _newObject(paramList[i]);\\n                a.push(asn1Obj);\\n            }\\n            return new _DERSet({ 'array': a });\\n        }\\n        if (key == \\\"tag\\\") {\\n            var tagParam = param[key];\\n            if (Object.prototype.toString.call(tagParam) === '[object Array]' &&\\n                tagParam.length == 3) {\\n                var obj = _newObject(tagParam[2]);\\n                return new _DERTaggedObject({ tag: tagParam[0],\\n                    explicit: tagParam[1],\\n                    obj: obj });\\n            }\\n            else {\\n                var newParam = {};\\n                if (tagParam.explicit !== undefined)\\n                    newParam.explicit = tagParam.explicit;\\n                if (tagParam.tag !== undefined)\\n                    newParam.tag = tagParam.tag;\\n                if (tagParam.obj === undefined)\\n                    throw \\\"obj shall be specified for 'tag'.\\\";\\n                newParam.obj = _newObject(tagParam.obj);\\n                return new _DERTaggedObject(newParam);\\n            }\\n        }\\n    };\\n    /**\\n     * get encoded hexadecimal string of ASN1Object specifed by JSON parameters\\n     * @name jsonToASN1HEX\\n     * @memberOf KJUR.asn1.ASN1Util\\n     * @function\\n     * @param {Array} param JSON parameter to generate ASN1Object\\n     * @return hexadecimal string of ASN1Object\\n     * @since asn1 1.0.4\\n     * @description\\n     * As for ASN.1 object representation of JSON object,\\n     * please see {@link newObject}.\\n     * @example\\n     * jsonToASN1HEX({'prnstr': 'aaa'});\\n     */\\n    this.jsonToASN1HEX = function (param) {\\n        var asn1Obj = this.newObject(param);\\n        return asn1Obj.getEncodedHex();\\n    };\\n};\\n/**\\n * get dot noted oid number string from hexadecimal value of OID\\n * @name oidHexToInt\\n * @memberOf KJUR.asn1.ASN1Util\\n * @function\\n * @param {String} hex hexadecimal value of object identifier\\n * @return {String} dot noted string of object identifier\\n * @since jsrsasign 4.8.3 asn1 1.0.7\\n * @description\\n * This static method converts from hexadecimal string representation of\\n * ASN.1 value of object identifier to oid number string.\\n * @example\\n * KJUR.asn1.ASN1Util.oidHexToInt('550406') &rarr; \\\"2.5.4.6\\\"\\n */\\nKJUR.asn1.ASN1Util.oidHexToInt = function (hex) {\\n    var s = \\\"\\\";\\n    var i01 = parseInt(hex.substr(0, 2), 16);\\n    var i0 = Math.floor(i01 / 40);\\n    var i1 = i01 % 40;\\n    var s = i0 + \\\".\\\" + i1;\\n    var binbuf = \\\"\\\";\\n    for (var i = 2; i < hex.length; i += 2) {\\n        var value = parseInt(hex.substr(i, 2), 16);\\n        var bin = (\\\"00000000\\\" + value.toString(2)).slice(-8);\\n        binbuf = binbuf + bin.substr(1, 7);\\n        if (bin.substr(0, 1) == \\\"0\\\") {\\n            var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(binbuf, 2);\\n            s = s + \\\".\\\" + bi.toString(10);\\n            binbuf = \\\"\\\";\\n        }\\n    }\\n    ;\\n    return s;\\n};\\n/**\\n * get hexadecimal value of object identifier from dot noted oid value\\n * @name oidIntToHex\\n * @memberOf KJUR.asn1.ASN1Util\\n * @function\\n * @param {String} oidString dot noted string of object identifier\\n * @return {String} hexadecimal value of object identifier\\n * @since jsrsasign 4.8.3 asn1 1.0.7\\n * @description\\n * This static method converts from object identifier value string.\\n * to hexadecimal string representation of it.\\n * @example\\n * KJUR.asn1.ASN1Util.oidIntToHex(\\\"2.5.4.6\\\") &rarr; \\\"550406\\\"\\n */\\nKJUR.asn1.ASN1Util.oidIntToHex = function (oidString) {\\n    var itox = function (i) {\\n        var h = i.toString(16);\\n        if (h.length == 1)\\n            h = '0' + h;\\n        return h;\\n    };\\n    var roidtox = function (roid) {\\n        var h = '';\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(roid, 10);\\n        var b = bi.toString(2);\\n        var padLen = 7 - b.length % 7;\\n        if (padLen == 7)\\n            padLen = 0;\\n        var bPad = '';\\n        for (var i = 0; i < padLen; i++)\\n            bPad += '0';\\n        b = bPad + b;\\n        for (var i = 0; i < b.length - 1; i += 7) {\\n            var b8 = b.substr(i, 7);\\n            if (i != b.length - 7)\\n                b8 = '1' + b8;\\n            h += itox(parseInt(b8, 2));\\n        }\\n        return h;\\n    };\\n    if (!oidString.match(/^[0-9.]+$/)) {\\n        throw \\\"malformed oid string: \\\" + oidString;\\n    }\\n    var h = '';\\n    var a = oidString.split('.');\\n    var i0 = parseInt(a[0]) * 40 + parseInt(a[1]);\\n    h += itox(i0);\\n    a.splice(0, 2);\\n    for (var i = 0; i < a.length; i++) {\\n        h += roidtox(a[i]);\\n    }\\n    return h;\\n};\\n// ********************************************************************\\n//  Abstract ASN.1 Classes\\n// ********************************************************************\\n// ********************************************************************\\n/**\\n * base class for ASN.1 DER encoder object\\n * @name KJUR.asn1.ASN1Object\\n * @class base class for ASN.1 DER encoder object\\n * @property {Boolean} isModified flag whether internal data was changed\\n * @property {String} hTLV hexadecimal string of ASN.1 TLV\\n * @property {String} hT hexadecimal string of ASN.1 TLV tag(T)\\n * @property {String} hL hexadecimal string of ASN.1 TLV length(L)\\n * @property {String} hV hexadecimal string of ASN.1 TLV value(V)\\n * @description\\n */\\nKJUR.asn1.ASN1Object = function () {\\n    var isModified = true;\\n    var hTLV = null;\\n    var hT = '00';\\n    var hL = '00';\\n    var hV = '';\\n    /**\\n     * get hexadecimal ASN.1 TLV length(L) bytes from TLV value(V)\\n     * @name getLengthHexFromValue\\n     * @memberOf KJUR.asn1.ASN1Object#\\n     * @function\\n     * @return {String} hexadecimal string of ASN.1 TLV length(L)\\n     */\\n    this.getLengthHexFromValue = function () {\\n        if (typeof this.hV == \\\"undefined\\\" || this.hV == null) {\\n            throw \\\"this.hV is null or undefined.\\\";\\n        }\\n        if (this.hV.length % 2 == 1) {\\n            throw \\\"value hex must be even length: n=\\\" + hV.length + \\\",v=\\\" + this.hV;\\n        }\\n        var n = this.hV.length / 2;\\n        var hN = n.toString(16);\\n        if (hN.length % 2 == 1) {\\n            hN = \\\"0\\\" + hN;\\n        }\\n        if (n < 128) {\\n            return hN;\\n        }\\n        else {\\n            var hNlen = hN.length / 2;\\n            if (hNlen > 15) {\\n                throw \\\"ASN.1 length too long to represent by 8x: n = \\\" + n.toString(16);\\n            }\\n            var head = 128 + hNlen;\\n            return head.toString(16) + hN;\\n        }\\n    };\\n    /**\\n     * get hexadecimal string of ASN.1 TLV bytes\\n     * @name getEncodedHex\\n     * @memberOf KJUR.asn1.ASN1Object#\\n     * @function\\n     * @return {String} hexadecimal string of ASN.1 TLV\\n     */\\n    this.getEncodedHex = function () {\\n        if (this.hTLV == null || this.isModified) {\\n            this.hV = this.getFreshValueHex();\\n            this.hL = this.getLengthHexFromValue();\\n            this.hTLV = this.hT + this.hL + this.hV;\\n            this.isModified = false;\\n            //alert(\\\"first time: \\\" + this.hTLV);\\n        }\\n        return this.hTLV;\\n    };\\n    /**\\n     * get hexadecimal string of ASN.1 TLV value(V) bytes\\n     * @name getValueHex\\n     * @memberOf KJUR.asn1.ASN1Object#\\n     * @function\\n     * @return {String} hexadecimal string of ASN.1 TLV value(V) bytes\\n     */\\n    this.getValueHex = function () {\\n        this.getEncodedHex();\\n        return this.hV;\\n    };\\n    this.getFreshValueHex = function () {\\n        return '';\\n    };\\n};\\n// == BEGIN DERAbstractString ================================================\\n/**\\n * base class for ASN.1 DER string classes\\n * @name KJUR.asn1.DERAbstractString\\n * @class base class for ASN.1 DER string classes\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @property {String} s internal string of value\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>str - specify initial ASN.1 value(V) by a string</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERAbstractString = function (params) {\\n    KJUR.asn1.DERAbstractString.superclass.constructor.call(this);\\n    var s = null;\\n    var hV = null;\\n    /**\\n     * get string value of this string object\\n     * @name getString\\n     * @memberOf KJUR.asn1.DERAbstractString#\\n     * @function\\n     * @return {String} string value of this string object\\n     */\\n    this.getString = function () {\\n        return this.s;\\n    };\\n    /**\\n     * set value by a string\\n     * @name setString\\n     * @memberOf KJUR.asn1.DERAbstractString#\\n     * @function\\n     * @param {String} newS value by a string to set\\n     */\\n    this.setString = function (newS) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = newS;\\n        this.hV = stohex(this.s);\\n    };\\n    /**\\n     * set value by a hexadecimal string\\n     * @name setStringHex\\n     * @memberOf KJUR.asn1.DERAbstractString#\\n     * @function\\n     * @param {String} newHexString value by a hexadecimal string to set\\n     */\\n    this.setStringHex = function (newHexString) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = null;\\n        this.hV = newHexString;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params == \\\"string\\\") {\\n            this.setString(params);\\n        }\\n        else if (typeof params['str'] != \\\"undefined\\\") {\\n            this.setString(params['str']);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setStringHex(params['hex']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERAbstractString, KJUR.asn1.ASN1Object);\\n// == END   DERAbstractString ================================================\\n// == BEGIN DERAbstractTime ==================================================\\n/**\\n * base class for ASN.1 DER Generalized/UTCTime class\\n * @name KJUR.asn1.DERAbstractTime\\n * @class base class for ASN.1 DER Generalized/UTCTime class\\n * @param {Array} params associative array of parameters (ex. {'str': '130430235959Z'})\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERAbstractTime = function (params) {\\n    KJUR.asn1.DERAbstractTime.superclass.constructor.call(this);\\n    var s = null;\\n    var date = null;\\n    // --- PRIVATE METHODS --------------------\\n    this.localDateToUTC = function (d) {\\n        utc = d.getTime() + (d.getTimezoneOffset() * 60000);\\n        var utcDate = new Date(utc);\\n        return utcDate;\\n    };\\n    /*\\n     * format date string by Data object\\n     * @name formatDate\\n     * @memberOf KJUR.asn1.AbstractTime;\\n     * @param {Date} dateObject\\n     * @param {string} type 'utc' or 'gen'\\n     * @param {boolean} withMillis flag for with millisections or not\\n     * @description\\n     * 'withMillis' flag is supported from asn1 1.0.6.\\n     */\\n    this.formatDate = function (dateObject, type, withMillis) {\\n        var pad = this.zeroPadding;\\n        var d = this.localDateToUTC(dateObject);\\n        var year = String(d.getFullYear());\\n        if (type == 'utc')\\n            year = year.substr(2, 2);\\n        var month = pad(String(d.getMonth() + 1), 2);\\n        var day = pad(String(d.getDate()), 2);\\n        var hour = pad(String(d.getHours()), 2);\\n        var min = pad(String(d.getMinutes()), 2);\\n        var sec = pad(String(d.getSeconds()), 2);\\n        var s = year + month + day + hour + min + sec;\\n        if (withMillis === true) {\\n            var millis = d.getMilliseconds();\\n            if (millis != 0) {\\n                var sMillis = pad(String(millis), 3);\\n                sMillis = sMillis.replace(/[0]+$/, \\\"\\\");\\n                s = s + \\\".\\\" + sMillis;\\n            }\\n        }\\n        return s + \\\"Z\\\";\\n    };\\n    this.zeroPadding = function (s, len) {\\n        if (s.length >= len)\\n            return s;\\n        return new Array(len - s.length + 1).join('0') + s;\\n    };\\n    // --- PUBLIC METHODS --------------------\\n    /**\\n     * get string value of this string object\\n     * @name getString\\n     * @memberOf KJUR.asn1.DERAbstractTime#\\n     * @function\\n     * @return {String} string value of this time object\\n     */\\n    this.getString = function () {\\n        return this.s;\\n    };\\n    /**\\n     * set value by a string\\n     * @name setString\\n     * @memberOf KJUR.asn1.DERAbstractTime#\\n     * @function\\n     * @param {String} newS value by a string to set such like \\\"130430235959Z\\\"\\n     */\\n    this.setString = function (newS) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = newS;\\n        this.hV = stohex(newS);\\n    };\\n    /**\\n     * set value by a Date object\\n     * @name setByDateValue\\n     * @memberOf KJUR.asn1.DERAbstractTime#\\n     * @function\\n     * @param {Integer} year year of date (ex. 2013)\\n     * @param {Integer} month month of date between 1 and 12 (ex. 12)\\n     * @param {Integer} day day of month\\n     * @param {Integer} hour hours of date\\n     * @param {Integer} min minutes of date\\n     * @param {Integer} sec seconds of date\\n     */\\n    this.setByDateValue = function (year, month, day, hour, min, sec) {\\n        var dateObject = new Date(Date.UTC(year, month - 1, day, hour, min, sec, 0));\\n        this.setByDate(dateObject);\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERAbstractTime, KJUR.asn1.ASN1Object);\\n// == END   DERAbstractTime ==================================================\\n// == BEGIN DERAbstractStructured ============================================\\n/**\\n * base class for ASN.1 DER structured class\\n * @name KJUR.asn1.DERAbstractStructured\\n * @class base class for ASN.1 DER structured class\\n * @property {Array} asn1Array internal array of ASN1Object\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERAbstractStructured = function (params) {\\n    KJUR.asn1.DERAbstractString.superclass.constructor.call(this);\\n    var asn1Array = null;\\n    /**\\n     * set value by array of ASN1Object\\n     * @name setByASN1ObjectArray\\n     * @memberOf KJUR.asn1.DERAbstractStructured#\\n     * @function\\n     * @param {array} asn1ObjectArray array of ASN1Object to set\\n     */\\n    this.setByASN1ObjectArray = function (asn1ObjectArray) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.asn1Array = asn1ObjectArray;\\n    };\\n    /**\\n     * append an ASN1Object to internal array\\n     * @name appendASN1Object\\n     * @memberOf KJUR.asn1.DERAbstractStructured#\\n     * @function\\n     * @param {ASN1Object} asn1Object to add\\n     */\\n    this.appendASN1Object = function (asn1Object) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.asn1Array.push(asn1Object);\\n    };\\n    this.asn1Array = new Array();\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['array'] != \\\"undefined\\\") {\\n            this.asn1Array = params['array'];\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERAbstractStructured, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n//  ASN.1 Object Classes\\n// ********************************************************************\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Boolean\\n * @name KJUR.asn1.DERBoolean\\n * @class class for ASN.1 DER Boolean\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERBoolean = function () {\\n    KJUR.asn1.DERBoolean.superclass.constructor.call(this);\\n    this.hT = \\\"01\\\";\\n    this.hTLV = \\\"0101ff\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERBoolean, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Integer\\n * @name KJUR.asn1.DERInteger\\n * @class class for ASN.1 DER Integer\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>int - specify initial ASN.1 value(V) by integer value</li>\\n * <li>bigint - specify initial ASN.1 value(V) by BigInteger object</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERInteger = function (params) {\\n    KJUR.asn1.DERInteger.superclass.constructor.call(this);\\n    this.hT = \\\"02\\\";\\n    /**\\n     * set value by Tom Wu's BigInteger object\\n     * @name setByBigInteger\\n     * @memberOf KJUR.asn1.DERInteger#\\n     * @function\\n     * @param {BigInteger} bigIntegerValue to set\\n     */\\n    this.setByBigInteger = function (bigIntegerValue) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = KJUR.asn1.ASN1Util.bigIntToMinTwosComplementsHex(bigIntegerValue);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setByInteger\\n     * @memberOf KJUR.asn1.DERInteger\\n     * @function\\n     * @param {Integer} integer value to set\\n     */\\n    this.setByInteger = function (intValue) {\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(String(intValue), 10);\\n        this.setByBigInteger(bi);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setValueHex\\n     * @memberOf KJUR.asn1.DERInteger#\\n     * @function\\n     * @param {String} hexadecimal string of integer value\\n     * @description\\n     * <br/>\\n     * NOTE: Value shall be represented by minimum octet length of\\n     * two's complement representation.\\n     * @example\\n     * new KJUR.asn1.DERInteger(123);\\n     * new KJUR.asn1.DERInteger({'int': 123});\\n     * new KJUR.asn1.DERInteger({'hex': '1fad'});\\n     */\\n    this.setValueHex = function (newHexString) {\\n        this.hV = newHexString;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['bigint'] != \\\"undefined\\\") {\\n            this.setByBigInteger(params['bigint']);\\n        }\\n        else if (typeof params['int'] != \\\"undefined\\\") {\\n            this.setByInteger(params['int']);\\n        }\\n        else if (typeof params == \\\"number\\\") {\\n            this.setByInteger(params);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setValueHex(params['hex']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERInteger, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER encoded BitString primitive\\n * @name KJUR.asn1.DERBitString\\n * @class class for ASN.1 DER encoded BitString primitive\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>bin - specify binary string (ex. '10111')</li>\\n * <li>array - specify array of boolean (ex. [true,false,true,true])</li>\\n * <li>hex - specify hexadecimal string of ASN.1 value(V) including unused bits</li>\\n * <li>obj - specify {@link KJUR.asn1.ASN1Util.newObject}\\n * argument for \\\"BitString encapsulates\\\" structure.</li>\\n * </ul>\\n * NOTE1: 'params' can be omitted.<br/>\\n * NOTE2: 'obj' parameter have been supported since\\n * asn1 1.0.11, jsrsasign 6.1.1 (2016-Sep-25).<br/>\\n * @example\\n * // default constructor\\n * o = new KJUR.asn1.DERBitString();\\n * // initialize with binary string\\n * o = new KJUR.asn1.DERBitString({bin: \\\"1011\\\"});\\n * // initialize with boolean array\\n * o = new KJUR.asn1.DERBitString({array: [true,false,true,true]});\\n * // initialize with hexadecimal string (04 is unused bits)\\n * o = new KJUR.asn1.DEROctetString({hex: \\\"04bac0\\\"});\\n * // initialize with ASN1Util.newObject argument for encapsulated\\n * o = new KJUR.asn1.DERBitString({obj: {seq: [{int: 3}, {prnstr: 'aaa'}]}});\\n * // above generates a ASN.1 data like this:\\n * // BIT STRING, encapsulates {\\n * //   SEQUENCE {\\n * //     INTEGER 3\\n * //     PrintableString 'aaa'\\n * //     }\\n * //   }\\n */\\nKJUR.asn1.DERBitString = function (params) {\\n    if (params !== undefined && typeof params.obj !== \\\"undefined\\\") {\\n        var o = KJUR.asn1.ASN1Util.newObject(params.obj);\\n        params.hex = \\\"00\\\" + o.getEncodedHex();\\n    }\\n    KJUR.asn1.DERBitString.superclass.constructor.call(this);\\n    this.hT = \\\"03\\\";\\n    /**\\n     * set ASN.1 value(V) by a hexadecimal string including unused bits\\n     * @name setHexValueIncludingUnusedBits\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {String} newHexStringIncludingUnusedBits\\n     */\\n    this.setHexValueIncludingUnusedBits = function (newHexStringIncludingUnusedBits) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = newHexStringIncludingUnusedBits;\\n    };\\n    /**\\n     * set ASN.1 value(V) by unused bit and hexadecimal string of value\\n     * @name setUnusedBitsAndHexValue\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {Integer} unusedBits\\n     * @param {String} hValue\\n     */\\n    this.setUnusedBitsAndHexValue = function (unusedBits, hValue) {\\n        if (unusedBits < 0 || 7 < unusedBits) {\\n            throw \\\"unused bits shall be from 0 to 7: u = \\\" + unusedBits;\\n        }\\n        var hUnusedBits = \\\"0\\\" + unusedBits;\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = hUnusedBits + hValue;\\n    };\\n    /**\\n     * set ASN.1 DER BitString by binary string<br/>\\n     * @name setByBinaryString\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {String} binaryString binary value string (i.e. '10111')\\n     * @description\\n     * Its unused bits will be calculated automatically by length of\\n     * 'binaryValue'. <br/>\\n     * NOTE: Trailing zeros '0' will be ignored.\\n     * @example\\n     * o = new KJUR.asn1.DERBitString();\\n     * o.setByBooleanArray(\\\"01011\\\");\\n     */\\n    this.setByBinaryString = function (binaryString) {\\n        binaryString = binaryString.replace(/0+$/, '');\\n        var unusedBits = 8 - binaryString.length % 8;\\n        if (unusedBits == 8)\\n            unusedBits = 0;\\n        for (var i = 0; i <= unusedBits; i++) {\\n            binaryString += '0';\\n        }\\n        var h = '';\\n        for (var i = 0; i < binaryString.length - 1; i += 8) {\\n            var b = binaryString.substr(i, 8);\\n            var x = parseInt(b, 2).toString(16);\\n            if (x.length == 1)\\n                x = '0' + x;\\n            h += x;\\n        }\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = '0' + unusedBits + h;\\n    };\\n    /**\\n     * set ASN.1 TLV value(V) by an array of boolean<br/>\\n     * @name setByBooleanArray\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {array} booleanArray array of boolean (ex. [true, false, true])\\n     * @description\\n     * NOTE: Trailing falses will be ignored in the ASN.1 DER Object.\\n     * @example\\n     * o = new KJUR.asn1.DERBitString();\\n     * o.setByBooleanArray([false, true, false, true, true]);\\n     */\\n    this.setByBooleanArray = function (booleanArray) {\\n        var s = '';\\n        for (var i = 0; i < booleanArray.length; i++) {\\n            if (booleanArray[i] == true) {\\n                s += '1';\\n            }\\n            else {\\n                s += '0';\\n            }\\n        }\\n        this.setByBinaryString(s);\\n    };\\n    /**\\n     * generate an array of falses with specified length<br/>\\n     * @name newFalseArray\\n     * @memberOf KJUR.asn1.DERBitString\\n     * @function\\n     * @param {Integer} nLength length of array to generate\\n     * @return {array} array of boolean falses\\n     * @description\\n     * This static method may be useful to initialize boolean array.\\n     * @example\\n     * o = new KJUR.asn1.DERBitString();\\n     * o.newFalseArray(3) &rarr; [false, false, false]\\n     */\\n    this.newFalseArray = function (nLength) {\\n        var a = new Array(nLength);\\n        for (var i = 0; i < nLength; i++) {\\n            a[i] = false;\\n        }\\n        return a;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params == \\\"string\\\" && params.toLowerCase().match(/^[0-9a-f]+$/)) {\\n            this.setHexValueIncludingUnusedBits(params);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setHexValueIncludingUnusedBits(params['hex']);\\n        }\\n        else if (typeof params['bin'] != \\\"undefined\\\") {\\n            this.setByBinaryString(params['bin']);\\n        }\\n        else if (typeof params['array'] != \\\"undefined\\\") {\\n            this.setByBooleanArray(params['array']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERBitString, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER OctetString<br/>\\n * @name KJUR.asn1.DEROctetString\\n * @class class for ASN.1 DER OctetString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * This class provides ASN.1 OctetString simple type.<br/>\\n * Supported \\\"params\\\" attributes are:\\n * <ul>\\n * <li>str - to set a string as a value</li>\\n * <li>hex - to set a hexadecimal string as a value</li>\\n * <li>obj - to set a encapsulated ASN.1 value by JSON object\\n * which is defined in {@link KJUR.asn1.ASN1Util.newObject}</li>\\n * </ul>\\n * NOTE: A parameter 'obj' have been supported\\n * for \\\"OCTET STRING, encapsulates\\\" structure.\\n * since asn1 1.0.11, jsrsasign 6.1.1 (2016-Sep-25).\\n * @see KJUR.asn1.DERAbstractString - superclass\\n * @example\\n * // default constructor\\n * o = new KJUR.asn1.DEROctetString();\\n * // initialize with string\\n * o = new KJUR.asn1.DEROctetString({str: \\\"aaa\\\"});\\n * // initialize with hexadecimal string\\n * o = new KJUR.asn1.DEROctetString({hex: \\\"616161\\\"});\\n * // initialize with ASN1Util.newObject argument\\n * o = new KJUR.asn1.DEROctetString({obj: {seq: [{int: 3}, {prnstr: 'aaa'}]}});\\n * // above generates a ASN.1 data like this:\\n * // OCTET STRING, encapsulates {\\n * //   SEQUENCE {\\n * //     INTEGER 3\\n * //     PrintableString 'aaa'\\n * //     }\\n * //   }\\n */\\nKJUR.asn1.DEROctetString = function (params) {\\n    if (params !== undefined && typeof params.obj !== \\\"undefined\\\") {\\n        var o = KJUR.asn1.ASN1Util.newObject(params.obj);\\n        params.hex = o.getEncodedHex();\\n    }\\n    KJUR.asn1.DEROctetString.superclass.constructor.call(this, params);\\n    this.hT = \\\"04\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DEROctetString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Null\\n * @name KJUR.asn1.DERNull\\n * @class class for ASN.1 DER Null\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERNull = function () {\\n    KJUR.asn1.DERNull.superclass.constructor.call(this);\\n    this.hT = \\\"05\\\";\\n    this.hTLV = \\\"0500\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERNull, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER ObjectIdentifier\\n * @name KJUR.asn1.DERObjectIdentifier\\n * @class class for ASN.1 DER ObjectIdentifier\\n * @param {Array} params associative array of parameters (ex. {'oid': '2.5.4.5'})\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>oid - specify initial ASN.1 value(V) by a oid string (ex. 2.5.4.13)</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERObjectIdentifier = function (params) {\\n    var itox = function (i) {\\n        var h = i.toString(16);\\n        if (h.length == 1)\\n            h = '0' + h;\\n        return h;\\n    };\\n    var roidtox = function (roid) {\\n        var h = '';\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(roid, 10);\\n        var b = bi.toString(2);\\n        var padLen = 7 - b.length % 7;\\n        if (padLen == 7)\\n            padLen = 0;\\n        var bPad = '';\\n        for (var i = 0; i < padLen; i++)\\n            bPad += '0';\\n        b = bPad + b;\\n        for (var i = 0; i < b.length - 1; i += 7) {\\n            var b8 = b.substr(i, 7);\\n            if (i != b.length - 7)\\n                b8 = '1' + b8;\\n            h += itox(parseInt(b8, 2));\\n        }\\n        return h;\\n    };\\n    KJUR.asn1.DERObjectIdentifier.superclass.constructor.call(this);\\n    this.hT = \\\"06\\\";\\n    /**\\n     * set value by a hexadecimal string\\n     * @name setValueHex\\n     * @memberOf KJUR.asn1.DERObjectIdentifier#\\n     * @function\\n     * @param {String} newHexString hexadecimal value of OID bytes\\n     */\\n    this.setValueHex = function (newHexString) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = null;\\n        this.hV = newHexString;\\n    };\\n    /**\\n     * set value by a OID string<br/>\\n     * @name setValueOidString\\n     * @memberOf KJUR.asn1.DERObjectIdentifier#\\n     * @function\\n     * @param {String} oidString OID string (ex. 2.5.4.13)\\n     * @example\\n     * o = new KJUR.asn1.DERObjectIdentifier();\\n     * o.setValueOidString(\\\"2.5.4.13\\\");\\n     */\\n    this.setValueOidString = function (oidString) {\\n        if (!oidString.match(/^[0-9.]+$/)) {\\n            throw \\\"malformed oid string: \\\" + oidString;\\n        }\\n        var h = '';\\n        var a = oidString.split('.');\\n        var i0 = parseInt(a[0]) * 40 + parseInt(a[1]);\\n        h += itox(i0);\\n        a.splice(0, 2);\\n        for (var i = 0; i < a.length; i++) {\\n            h += roidtox(a[i]);\\n        }\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = null;\\n        this.hV = h;\\n    };\\n    /**\\n     * set value by a OID name\\n     * @name setValueName\\n     * @memberOf KJUR.asn1.DERObjectIdentifier#\\n     * @function\\n     * @param {String} oidName OID name (ex. 'serverAuth')\\n     * @since 1.0.1\\n     * @description\\n     * OID name shall be defined in 'KJUR.asn1.x509.OID.name2oidList'.\\n     * Otherwise raise error.\\n     * @example\\n     * o = new KJUR.asn1.DERObjectIdentifier();\\n     * o.setValueName(\\\"serverAuth\\\");\\n     */\\n    this.setValueName = function (oidName) {\\n        var oid = KJUR.asn1.x509.OID.name2oid(oidName);\\n        if (oid !== '') {\\n            this.setValueOidString(oid);\\n        }\\n        else {\\n            throw \\\"DERObjectIdentifier oidName undefined: \\\" + oidName;\\n        }\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (params !== undefined) {\\n        if (typeof params === \\\"string\\\") {\\n            if (params.match(/^[0-2].[0-9.]+$/)) {\\n                this.setValueOidString(params);\\n            }\\n            else {\\n                this.setValueName(params);\\n            }\\n        }\\n        else if (params.oid !== undefined) {\\n            this.setValueOidString(params.oid);\\n        }\\n        else if (params.hex !== undefined) {\\n            this.setValueHex(params.hex);\\n        }\\n        else if (params.name !== undefined) {\\n            this.setValueName(params.name);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERObjectIdentifier, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Enumerated\\n * @name KJUR.asn1.DEREnumerated\\n * @class class for ASN.1 DER Enumerated\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>int - specify initial ASN.1 value(V) by integer value</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n * @example\\n * new KJUR.asn1.DEREnumerated(123);\\n * new KJUR.asn1.DEREnumerated({int: 123});\\n * new KJUR.asn1.DEREnumerated({hex: '1fad'});\\n */\\nKJUR.asn1.DEREnumerated = function (params) {\\n    KJUR.asn1.DEREnumerated.superclass.constructor.call(this);\\n    this.hT = \\\"0a\\\";\\n    /**\\n     * set value by Tom Wu's BigInteger object\\n     * @name setByBigInteger\\n     * @memberOf KJUR.asn1.DEREnumerated#\\n     * @function\\n     * @param {BigInteger} bigIntegerValue to set\\n     */\\n    this.setByBigInteger = function (bigIntegerValue) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = KJUR.asn1.ASN1Util.bigIntToMinTwosComplementsHex(bigIntegerValue);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setByInteger\\n     * @memberOf KJUR.asn1.DEREnumerated#\\n     * @function\\n     * @param {Integer} integer value to set\\n     */\\n    this.setByInteger = function (intValue) {\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(String(intValue), 10);\\n        this.setByBigInteger(bi);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setValueHex\\n     * @memberOf KJUR.asn1.DEREnumerated#\\n     * @function\\n     * @param {String} hexadecimal string of integer value\\n     * @description\\n     * <br/>\\n     * NOTE: Value shall be represented by minimum octet length of\\n     * two's complement representation.\\n     */\\n    this.setValueHex = function (newHexString) {\\n        this.hV = newHexString;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['int'] != \\\"undefined\\\") {\\n            this.setByInteger(params['int']);\\n        }\\n        else if (typeof params == \\\"number\\\") {\\n            this.setByInteger(params);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setValueHex(params['hex']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DEREnumerated, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER UTF8String\\n * @name KJUR.asn1.DERUTF8String\\n * @class class for ASN.1 DER UTF8String\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERUTF8String = function (params) {\\n    KJUR.asn1.DERUTF8String.superclass.constructor.call(this, params);\\n    this.hT = \\\"0c\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERUTF8String, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER NumericString\\n * @name KJUR.asn1.DERNumericString\\n * @class class for ASN.1 DER NumericString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERNumericString = function (params) {\\n    KJUR.asn1.DERNumericString.superclass.constructor.call(this, params);\\n    this.hT = \\\"12\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERNumericString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER PrintableString\\n * @name KJUR.asn1.DERPrintableString\\n * @class class for ASN.1 DER PrintableString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERPrintableString = function (params) {\\n    KJUR.asn1.DERPrintableString.superclass.constructor.call(this, params);\\n    this.hT = \\\"13\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERPrintableString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER TeletexString\\n * @name KJUR.asn1.DERTeletexString\\n * @class class for ASN.1 DER TeletexString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERTeletexString = function (params) {\\n    KJUR.asn1.DERTeletexString.superclass.constructor.call(this, params);\\n    this.hT = \\\"14\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERTeletexString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER IA5String\\n * @name KJUR.asn1.DERIA5String\\n * @class class for ASN.1 DER IA5String\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERIA5String = function (params) {\\n    KJUR.asn1.DERIA5String.superclass.constructor.call(this, params);\\n    this.hT = \\\"16\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERIA5String, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER UTCTime\\n * @name KJUR.asn1.DERUTCTime\\n * @class class for ASN.1 DER UTCTime\\n * @param {Array} params associative array of parameters (ex. {'str': '130430235959Z'})\\n * @extends KJUR.asn1.DERAbstractTime\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>str - specify initial ASN.1 value(V) by a string (ex.'130430235959Z')</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * <li>date - specify Date object.</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n * <h4>EXAMPLES</h4>\\n * @example\\n * d1 = new KJUR.asn1.DERUTCTime();\\n * d1.setString('130430125959Z');\\n *\\n * d2 = new KJUR.asn1.DERUTCTime({'str': '130430125959Z'});\\n * d3 = new KJUR.asn1.DERUTCTime({'date': new Date(Date.UTC(2015, 0, 31, 0, 0, 0, 0))});\\n * d4 = new KJUR.asn1.DERUTCTime('130430125959Z');\\n */\\nKJUR.asn1.DERUTCTime = function (params) {\\n    KJUR.asn1.DERUTCTime.superclass.constructor.call(this, params);\\n    this.hT = \\\"17\\\";\\n    /**\\n     * set value by a Date object<br/>\\n     * @name setByDate\\n     * @memberOf KJUR.asn1.DERUTCTime#\\n     * @function\\n     * @param {Date} dateObject Date object to set ASN.1 value(V)\\n     * @example\\n     * o = new KJUR.asn1.DERUTCTime();\\n     * o.setByDate(new Date(\\\"2016/12/31\\\"));\\n     */\\n    this.setByDate = function (dateObject) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.date = dateObject;\\n        this.s = this.formatDate(this.date, 'utc');\\n        this.hV = stohex(this.s);\\n    };\\n    this.getFreshValueHex = function () {\\n        if (typeof this.date == \\\"undefined\\\" && typeof this.s == \\\"undefined\\\") {\\n            this.date = new Date();\\n            this.s = this.formatDate(this.date, 'utc');\\n            this.hV = stohex(this.s);\\n        }\\n        return this.hV;\\n    };\\n    if (params !== undefined) {\\n        if (params.str !== undefined) {\\n            this.setString(params.str);\\n        }\\n        else if (typeof params == \\\"string\\\" && params.match(/^[0-9]{12}Z$/)) {\\n            this.setString(params);\\n        }\\n        else if (params.hex !== undefined) {\\n            this.setStringHex(params.hex);\\n        }\\n        else if (params.date !== undefined) {\\n            this.setByDate(params.date);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERUTCTime, KJUR.asn1.DERAbstractTime);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER GeneralizedTime\\n * @name KJUR.asn1.DERGeneralizedTime\\n * @class class for ASN.1 DER GeneralizedTime\\n * @param {Array} params associative array of parameters (ex. {'str': '20130430235959Z'})\\n * @property {Boolean} withMillis flag to show milliseconds or not\\n * @extends KJUR.asn1.DERAbstractTime\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>str - specify initial ASN.1 value(V) by a string (ex.'20130430235959Z')</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * <li>date - specify Date object.</li>\\n * <li>millis - specify flag to show milliseconds (from 1.0.6)</li>\\n * </ul>\\n * NOTE1: 'params' can be omitted.\\n * NOTE2: 'withMillis' property is supported from asn1 1.0.6.\\n */\\nKJUR.asn1.DERGeneralizedTime = function (params) {\\n    KJUR.asn1.DERGeneralizedTime.superclass.constructor.call(this, params);\\n    this.hT = \\\"18\\\";\\n    this.withMillis = false;\\n    /**\\n     * set value by a Date object\\n     * @name setByDate\\n     * @memberOf KJUR.asn1.DERGeneralizedTime#\\n     * @function\\n     * @param {Date} dateObject Date object to set ASN.1 value(V)\\n     * @example\\n     * When you specify UTC time, use 'Date.UTC' method like this:<br/>\\n     * o1 = new DERUTCTime();\\n     * o1.setByDate(date);\\n     *\\n     * date = new Date(Date.UTC(2015, 0, 31, 23, 59, 59, 0)); #2015JAN31 23:59:59\\n     */\\n    this.setByDate = function (dateObject) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.date = dateObject;\\n        this.s = this.formatDate(this.date, 'gen', this.withMillis);\\n        this.hV = stohex(this.s);\\n    };\\n    this.getFreshValueHex = function () {\\n        if (this.date === undefined && this.s === undefined) {\\n            this.date = new Date();\\n            this.s = this.formatDate(this.date, 'gen', this.withMillis);\\n            this.hV = stohex(this.s);\\n        }\\n        return this.hV;\\n    };\\n    if (params !== undefined) {\\n        if (params.str !== undefined) {\\n            this.setString(params.str);\\n        }\\n        else if (typeof params == \\\"string\\\" && params.match(/^[0-9]{14}Z$/)) {\\n            this.setString(params);\\n        }\\n        else if (params.hex !== undefined) {\\n            this.setStringHex(params.hex);\\n        }\\n        else if (params.date !== undefined) {\\n            this.setByDate(params.date);\\n        }\\n        if (params.millis === true) {\\n            this.withMillis = true;\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERGeneralizedTime, KJUR.asn1.DERAbstractTime);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Sequence\\n * @name KJUR.asn1.DERSequence\\n * @class class for ASN.1 DER Sequence\\n * @extends KJUR.asn1.DERAbstractStructured\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>array - specify array of ASN1Object to set elements of content</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERSequence = function (params) {\\n    KJUR.asn1.DERSequence.superclass.constructor.call(this, params);\\n    this.hT = \\\"30\\\";\\n    this.getFreshValueHex = function () {\\n        var h = '';\\n        for (var i = 0; i < this.asn1Array.length; i++) {\\n            var asn1Obj = this.asn1Array[i];\\n            h += asn1Obj.getEncodedHex();\\n        }\\n        this.hV = h;\\n        return this.hV;\\n    };\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERSequence, KJUR.asn1.DERAbstractStructured);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Set\\n * @name KJUR.asn1.DERSet\\n * @class class for ASN.1 DER Set\\n * @extends KJUR.asn1.DERAbstractStructured\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>array - specify array of ASN1Object to set elements of content</li>\\n * <li>sortflag - flag for sort (default: true). ASN.1 BER is not sorted in 'SET OF'.</li>\\n * </ul>\\n * NOTE1: 'params' can be omitted.<br/>\\n * NOTE2: sortflag is supported since 1.0.5.\\n */\\nKJUR.asn1.DERSet = function (params) {\\n    KJUR.asn1.DERSet.superclass.constructor.call(this, params);\\n    this.hT = \\\"31\\\";\\n    this.sortFlag = true; // item shall be sorted only in ASN.1 DER\\n    this.getFreshValueHex = function () {\\n        var a = new Array();\\n        for (var i = 0; i < this.asn1Array.length; i++) {\\n            var asn1Obj = this.asn1Array[i];\\n            a.push(asn1Obj.getEncodedHex());\\n        }\\n        if (this.sortFlag == true)\\n            a.sort();\\n        this.hV = a.join('');\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params.sortflag != \\\"undefined\\\" &&\\n            params.sortflag == false)\\n            this.sortFlag = false;\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERSet, KJUR.asn1.DERAbstractStructured);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER TaggedObject\\n * @name KJUR.asn1.DERTaggedObject\\n * @class class for ASN.1 DER TaggedObject\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * Parameter 'tagNoNex' is ASN.1 tag(T) value for this object.\\n * For example, if you find '[1]' tag in a ASN.1 dump,\\n * 'tagNoHex' will be 'a1'.\\n * <br/>\\n * As for optional argument 'params' for constructor, you can specify *ANY* of\\n * following properties:\\n * <ul>\\n * <li>explicit - specify true if this is explicit tag otherwise false\\n *     (default is 'true').</li>\\n * <li>tag - specify tag (default is 'a0' which means [0])</li>\\n * <li>obj - specify ASN1Object which is tagged</li>\\n * </ul>\\n * @example\\n * d1 = new KJUR.asn1.DERUTF8String({'str':'a'});\\n * d2 = new KJUR.asn1.DERTaggedObject({'obj': d1});\\n * hex = d2.getEncodedHex();\\n */\\nKJUR.asn1.DERTaggedObject = function (params) {\\n    KJUR.asn1.DERTaggedObject.superclass.constructor.call(this);\\n    this.hT = \\\"a0\\\";\\n    this.hV = '';\\n    this.isExplicit = true;\\n    this.asn1Object = null;\\n    /**\\n     * set value by an ASN1Object\\n     * @name setString\\n     * @memberOf KJUR.asn1.DERTaggedObject#\\n     * @function\\n     * @param {Boolean} isExplicitFlag flag for explicit/implicit tag\\n     * @param {Integer} tagNoHex hexadecimal string of ASN.1 tag\\n     * @param {ASN1Object} asn1Object ASN.1 to encapsulate\\n     */\\n    this.setASN1Object = function (isExplicitFlag, tagNoHex, asn1Object) {\\n        this.hT = tagNoHex;\\n        this.isExplicit = isExplicitFlag;\\n        this.asn1Object = asn1Object;\\n        if (this.isExplicit) {\\n            this.hV = this.asn1Object.getEncodedHex();\\n            this.hTLV = null;\\n            this.isModified = true;\\n        }\\n        else {\\n            this.hV = null;\\n            this.hTLV = asn1Object.getEncodedHex();\\n            this.hTLV = this.hTLV.replace(/^../, tagNoHex);\\n            this.isModified = false;\\n        }\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['tag'] != \\\"undefined\\\") {\\n            this.hT = params['tag'];\\n        }\\n        if (typeof params['explicit'] != \\\"undefined\\\") {\\n            this.isExplicit = params['explicit'];\\n        }\\n        if (typeof params['obj'] != \\\"undefined\\\") {\\n            this.asn1Object = params['obj'];\\n            this.setASN1Object(this.isExplicit, this.hT, this.asn1Object);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERTaggedObject, KJUR.asn1.ASN1Object);\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsrsasign/asn1-1.0.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsrsasign/yahoo.js\":\n/*!************************************!*\\\n  !*** ./lib/lib/jsrsasign/yahoo.js ***!\n  \\************************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"YAHOO\\\": () => (/* binding */ YAHOO)\\n/* harmony export */ });\\n/*!\\nCopyright (c) 2011, Yahoo! Inc. All rights reserved.\\nCode licensed under the BSD License:\\nhttp://developer.yahoo.com/yui/license.html\\nversion: 2.9.0\\n*/\\nvar YAHOO = {};\\nYAHOO.lang = {\\n    /**\\n     * Utility to set up the prototype, constructor and superclass properties to\\n     * support an inheritance strategy that can chain constructors and methods.\\n     * Static members will not be inherited.\\n     *\\n     * @method extend\\n     * @static\\n     * @param {Function} subc   the object to modify\\n     * @param {Function} superc the object to inherit\\n     * @param {Object} overrides  additional properties/methods to add to the\\n     *                              subclass prototype.  These will override the\\n     *                              matching items obtained from the superclass\\n     *                              if present.\\n     */\\n    extend: function (subc, superc, overrides) {\\n        if (!superc || !subc) {\\n            throw new Error(\\\"YAHOO.lang.extend failed, please check that \\\" +\\n                \\\"all dependencies are included.\\\");\\n        }\\n        var F = function () { };\\n        F.prototype = superc.prototype;\\n        subc.prototype = new F();\\n        subc.prototype.constructor = subc;\\n        subc.superclass = superc.prototype;\\n        if (superc.prototype.constructor == Object.prototype.constructor) {\\n            superc.prototype.constructor = superc;\\n        }\\n        if (overrides) {\\n            var i;\\n            for (i in overrides) {\\n                subc.prototype[i] = overrides[i];\\n            }\\n            /*\\n             * IE will not enumerate native functions in a derived object even if the\\n             * function was overridden.  This is a workaround for specific functions\\n             * we care about on the Object prototype.\\n             * @property _IEEnumFix\\n             * @param {Function} r  the object to receive the augmentation\\n             * @param {Function} s  the object that supplies the properties to augment\\n             * @static\\n             * @private\\n             */\\n            var _IEEnumFix = function () { }, ADD = [\\\"toString\\\", \\\"valueOf\\\"];\\n            try {\\n                if (/MSIE/.test(navigator.userAgent)) {\\n                    _IEEnumFix = function (r, s) {\\n                        for (i = 0; i < ADD.length; i = i + 1) {\\n                            var fname = ADD[i], f = s[fname];\\n                            if (typeof f === 'function' && f != Object.prototype[fname]) {\\n                                r[fname] = f;\\n                            }\\n                        }\\n                    };\\n                }\\n            }\\n            catch (ex) { }\\n            ;\\n            _IEEnumFix(subc.prototype, overrides);\\n        }\\n    }\\n};\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsrsasign/yahoo.js?\");\n\n/***/ }),\n\n/***/ \"./lib/version.json\":\n/*!**************************!*\\\n  !*** ./lib/version.json ***!\n  \\**************************/\n/***/ ((module) => {\n\neval(\"module.exports = {\\\"version\\\":\\\"3.2.1\\\"};\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/version.json?\");\n\n/***/ })\n\n/******/ \t});\n/************************************************************************/\n/******/ \t// The module cache\n/******/ \tvar __webpack_module_cache__ = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/ \t\t// Check if module is in cache\n/******/ \t\tvar cachedModule = __webpack_module_cache__[moduleId];\n/******/ \t\tif (cachedModule !== undefined) {\n/******/ \t\t\treturn cachedModule.exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = __webpack_module_cache__[moduleId] = {\n/******/ \t\t\t// no module.id needed\n/******/ \t\t\t// no module.loaded needed\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/************************************************************************/\n/******/ \t/* webpack/runtime/define property getters */\n/******/ \t(() => {\n/******/ \t\t// define getter functions for harmony exports\n/******/ \t\t__webpack_require__.d = (exports, definition) => {\n/******/ \t\t\tfor(var key in definition) {\n/******/ \t\t\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n/******/ \t\t\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n/******/ \t\t\t\t}\n/******/ \t\t\t}\n/******/ \t\t};\n/******/ \t})();\n/******/\n/******/ \t/* webpack/runtime/hasOwnProperty shorthand */\n/******/ \t(() => {\n/******/ \t\t__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))\n/******/ \t})();\n/******/\n/******/ \t/* webpack/runtime/make namespace object */\n/******/ \t(() => {\n/******/ \t\t// define __esModule on exports\n/******/ \t\t__webpack_require__.r = (exports) => {\n/******/ \t\t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n/******/ \t\t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n/******/ \t\t\t}\n/******/ \t\t\tObject.defineProperty(exports, '__esModule', { value: true });\n/******/ \t\t};\n/******/ \t})();\n/******/\n/************************************************************************/\n/******/\n/******/ \t// startup\n/******/ \t// Load entry module and return exports\n/******/ \t// This entry module can't be inlined because the eval devtool is used.\n/******/ \tvar __webpack_exports__ = __webpack_require__(\"./lib/index.js\");\n/******/ \t__webpack_exports__ = __webpack_exports__.default;\n/******/\n/******/ \treturn __webpack_exports__;\n/******/ })()\n;\n});\n},{}]},{},[1])(1)\n});\n", "export { SSVKeys } from './lib/SSVKeys';\nexport { EncryptShare } from './lib/Encryption/Encryption';\nexport { default as Threshold } from './lib/Threshold/Threshold';\nexport { ISharesKeyPairs, IShares } from './lib/Threshold/Threshold';\nexport { default as EthereumKeyStore } from './lib/EthereumKeyStore';\nexport { KeySharesItem } from './lib/KeyShares/KeySharesItem';\nexport { KeyShares } from './lib/KeyShares/KeyShares';\nexport { default as Encryption } from './lib/Encryption/Encryption';\nexport { SSVKeysException } from './lib/exceptions/base';\n", "let index: any;\n\ntry {\n  window.crypto;\n  index = require('bls-eth-wasm/browser');\n} catch {\n  index = require('bls-eth-wasm');\n}\n\nexport default index;\n", "export class SSVKeysException extends Error {\n  public trace: any;\n\n  constructor(message: string) {\n    super(message);\n    this.name = this.constructor.name;\n    Error.captureStackTrace(this, this.constructor);\n    this.trace = this.stack;\n    this.stack = `${this.name}: ${this.message}`; // Customizing stack\n  }\n}\n", "import { SSVKeysException } from './base';\n\nexport class KeyStoreDataFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class KeyStoreInvalidError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class KeyStorePasswordError extends SSVKeysException {\n  constructor(message: string) {\n    super(message);\n  }\n}\n\nexport class EthereumWalletError extends SSVKeysException {\n  constructor(message: string) {\n    super(message);\n  }\n}\n\nexport class PrivateKeyFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class OwnerAddressFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class OwnerNonceFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n", "import EthereumKeyStore from 'eth2-keystore-js';\nimport { readFile } from '../../../lib/helpers/file.helper';\n\n\nexport class KeystorePasswordValidator {\n  protected keystoreFilePath = '';\n\n  /*\n  setKeystoreFilePath(filePath: string): void {\n    this.keystoreFilePath = filePath;\n  }\n  */\n\n  async validatePassword(password: string, keystoreFilePath: string): Promise<boolean | string> {\n    if (!password.trim().length) {\n      return 'Password is empty';\n    }\n    const errorMessage = 'Invalid keystore file password.';\n    // let messageInterval: any;\n    let output: any;\n    try {\n      /*\n      if (showProgress) {\n        let dots = 1;\n        const message = `\\rChecking password`\n        process.stdout.write('\\r' + String(' ').repeat(250));\n        process.stdout.write(`\\r${message}`);\n        messageInterval = setInterval(() => {\n          const progressMessage = `\\r${message}` +\n            `${String('.').repeat(dots)}${String(' ').repeat(30 - dots)}`;\n          process.stdout.write(progressMessage);\n          dots += 1;\n          if (dots > 3) {\n            dots = 1;\n          }\n        }, 1000);\n      }\n      */\n      const data = await readFile(keystoreFilePath);\n      const keyStore = new EthereumKeyStore(data);\n      const privateKey = await keyStore.getPrivateKey(password)\n      output = !!privateKey;\n    } catch (e) {\n      output = errorMessage;\n    }\n    /*\n    if (showProgress) {\n      process.stdout.write('\\n');\n      clearInterval(messageInterval);\n    }\n    */\n    return output;\n  }\n}\n\nexport const keystorePasswordValidator = new KeystorePasswordValidator();\n", "import fs from 'fs';\nimport path from 'path';\nimport moment from 'moment';\nimport { promises as fsp } from 'fs';\nimport { SSVKeysException } from '../../lib/exceptions/base';\n\n/**\n * Read file contents and return json data from it.\n * @param filePath\n * @param json\n */\nexport const readFile = async (filePath: string, json=true): Promise<any> => {\n  return fsp.readFile(filePath, { encoding: 'utf-8' }).then((data) => {\n    return json ? JSON.parse(data) : data;\n  });\n}\n\n/**\n * Write file contents.\n * @param filePath\n * @param data\n */\nexport const writeFile = async (filePath: string, data: string): Promise<any> => {\n  fsp.writeFile(filePath, data, { encoding: 'utf-8' });\n}\n\n/**\n * Create SSV keys directory to work in scope of in user home directory\n */\nexport const createSSVDir = async (outputFolder: string): Promise<any> => {\n  return fsp.mkdir(outputFolder, { recursive: true });\n}\n\n/**\n * Get SSV keys directory to work in scope of in user home directory.\n * Create it before, if it doesn't exist.\n */\nexport const getSSVDir = async (outputFolder: string): Promise<string> => {\n  if (!fs.existsSync(outputFolder)) {\n    await createSSVDir(outputFolder);\n  }\n  return outputFolder.endsWith(path.sep) ? outputFolder : `${outputFolder}${path.sep}`;\n}\n\nexport const getFilePath = async (name: string, outputFolder: string, withTime = true): Promise<string> => {\n  return `${await getSSVDir(outputFolder)}${name}${withTime ? `-${moment().unix()}` : ''}.json`;\n}\n\nexport type KeyStoreFilesResult = {\n  files: string[];\n  isFolder: boolean;\n}\n\nexport const getKeyStoreFiles = async (keystorePath: string): Promise<KeyStoreFilesResult> => {\n  const stat = await fsp.stat(keystorePath);\n  const isFolder = stat.isDirectory();\n\n  let files;\n  if (isFolder) {\n    const folderContent = await fsp.readdir(keystorePath);\n    if (folderContent.length === 0) {\n      throw new SSVKeysException('No keystore files detected. Please provide a folder with correct keystore files and try again.');\n    }\n    files = folderContent.map(file => path.join(keystorePath, file)).sort();\n  } else {\n    files = [keystorePath];\n  }\n  return { files, isFolder };\n}\n", "export class OperatorIdsValidator {\n  public operatorsCount = 3;\n\n  setOperatorsCount(amount: number): void {\n    this.operatorsCount = amount;\n  }\n}\n\nexport const isOperatorsLengthValid = (length: number) => {\n  if (length < 4 || length > 13 || length % 3 != 1) {\n    return false;\n  }\n  return true;\n}\n\nexport const operatorIdsValidator = new OperatorIdsValidator();\n", "import { decode } from 'js-base64';\nimport JSEncrypt from '../../../lib/JSEncrypt';\nimport { OperatorPublicKeyError } from '../../../lib/exceptions/operator';\n\nexport const operatorPublicKeyValidator = (publicKey: string): boolean => {\n  publicKey = publicKey.trim();\n\n  const begin = '-----BEGIN RSA PUBLIC KEY-----';\n  const end = '-----END RSA PUBLIC KEY-----';\n\n  const encrypt = new JSEncrypt({});\n  let decodedOperator = '';\n  try {\n    let decodedPublicKey = '';\n\n    if (!publicKey.startsWith(begin)) {\n      if (publicKey.length < 98) {\n        throw new Error('The length of the operator public key must be at least 98 characters.');\n      }\n\n      try {\n        decodedPublicKey = decode(publicKey).trim();\n      } catch (error) {\n        throw new Error(\"Failed to decode the operator public key. Ensure it's correctly base64 encoded.\");\n      }\n\n      if (!decodedPublicKey.startsWith(begin)) {\n        throw new Error(`Operator public key does not start with '${begin}'`);\n      }\n    } else {\n      decodedPublicKey = publicKey;\n    }\n\n    if (!decodedPublicKey.endsWith(end)) {\n      throw new Error(`Operator public key does not end with '${end}'`);\n    }\n\n    try {\n      // Get the content without the header and footer\n      const content = decodedPublicKey.slice(begin.length, publicKey.length - end.length).trim();\n      decodedOperator = decode(content);\n    } catch (error) {\n      throw new Error(\"Failed to decode the RSA public key. Ensure it's correctly base64 encoded.\");\n    }\n\n    try {\n      encrypt.setPublicKey(decodedOperator);\n    } catch (error: any) {\n      throw new Error(\"Invalid operator key format, make sure the operator exists in the network.\");\n    }\n  } catch (error: any) {\n    throw new OperatorPublicKeyError(\n      {\n        rsa: decodedOperator,\n        base64: publicKey,\n      },\n      error.message,\n    );\n  }\n  return true;\n}\n", "let index: any;\n\ntry {\n  window.crypto;\n  index = require('jsencrypt').JSEncrypt;\n} catch {\n  index = require('./jsencrypt.bundle');\n}\n\nexport default index;\n", "import { SSVKeysException } from './base';\n\nimport { IOperatorData } from '../KeyShares/KeySharesData/IOperatorData';\n\nexport class DuplicatedOperatorIdError extends SSVKeysException {\n  public operator: IOperatorData;\n\n  constructor(operator: IOperatorData, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n\nexport class DuplicatedOperatorPublicKeyError extends SSVKeysException {\n  public operator: IOperatorData;\n\n  constructor(operator: IOperatorData, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n\nexport class OperatorsCountsMismatchError extends SSVKeysException {\n  public listOne: any[] | null | undefined;\n  public listTwo: any[] | null | undefined;\n\n  constructor(propertyListOne: any[] | null | undefined, propertyListTwo: any[] | null | undefined, message: string) {\n    super(message);\n    this.listOne = propertyListOne;\n    this.listTwo = propertyListTwo;\n  }\n}\n\nexport class OperatorPublicKeyError extends SSVKeysException {\n  public operator: any;\n\n  constructor(operator: { rsa: string, base64: string }, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n", "import bls from '../BLS';\n\nimport { SecretKeyType } from 'bls-eth-wasm';\n\nimport { SSVKeysException } from '../exceptions/base';\nimport { PrivateKeyFormatError } from '../exceptions/keystore';\nimport { isOperatorsLengthValid } from '../../commands/actions/validators';\n\nexport interface IShares {\n    privateKey: string,\n    publicKey: string,\n    id?: any\n}\n\nexport interface ISharesKeyPairs {\n  privateKey: string,\n    publicKey: string,\n    shares: IShares[]\n}\n\nexport class ThresholdInvalidOperatorsLengthError extends SSVKeysException {\n  public operators: number[];\n\n  // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\n  constructor(operators: number[], message: string) {\n    super(message);\n    this.operators = operators;\n  }\n}\n\nexport class ThresholdInvalidOperatorIdError extends SSVKeysException {\n  public operator: any;\n\n  // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\n  constructor(operator: any, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n\n/**\n * Building threshold for list of operator IDs\n */\nclass Threshold {\n  protected publicKey: any;\n  protected privateKey: any;\n  protected shares: Array<any> = [];\n\n  static get DEFAULT_THRESHOLD_NUMBER(): number {\n    return 3;\n  }\n\n  /**\n   * Receives list of operators IDs.\n   *  len(operator IDs) := 3 * F + 1\n   *\n   * If F calculated from this formula is not integer number - it will raise exception.\n   * Generate keys and return promise\n   */\n  async create(privateKeyString: string, operatorIds: number[]): Promise<ISharesKeyPairs> {\n    if (!privateKeyString.startsWith('0x')) {\n      throw new PrivateKeyFormatError(privateKeyString, 'The private key must be provided in the 0x format.')\n    }\n    // Validation\n    operatorIds.map(operatorId => {\n      if (!Number.isInteger(operatorId)) {\n        throw new ThresholdInvalidOperatorIdError(\n          operatorId,\n          `Operator must be integer. Got: ${operatorId}`\n        );\n      }\n    });\n\n    if (!isOperatorsLengthValid(operatorIds.length)) {\n      throw new ThresholdInvalidOperatorsLengthError(\n        operatorIds,\n        'Invalid operators amount. Enter an 3f+1 compatible amount of operator ids.'\n      );\n    }\n\n    const msk = [];\n    const mpk = [];\n\n    if (!bls.deserializeHexStrToSecretKey) {\n      await bls.init(bls.BLS12_381);\n    }\n    // Master key Polynomial\n    this.privateKey = bls.deserializeHexStrToSecretKey(privateKeyString.replace('0x', ''));\n    this.publicKey = this.privateKey.getPublicKey();\n\n    msk.push(this.privateKey);\n    mpk.push(this.publicKey);\n\n    const F = (operatorIds.length - 1) / 3;\n    // Construct poly\n    for (let i = 1; i < operatorIds.length - F; i += 1) {\n      const sk: SecretKeyType = new bls.SecretKey();\n      sk.setByCSPRNG();\n      msk.push(sk);\n      const pk = sk.getPublicKey();\n      mpk.push(pk);\n    }\n\n    // Evaluate shares - starting from 1 because 0 is master key\n    for (const operatorId of operatorIds) {\n      const id = new bls.Id();\n      id.setInt(operatorId);\n      const shareSecretKey = new bls.SecretKey();\n      shareSecretKey.share(msk, id);\n\n      const sharePublicKey = new bls.PublicKey();\n      sharePublicKey.share(mpk, id);\n\n      this.shares.push({\n        privateKey: `0x${shareSecretKey.serializeToHexStr()}`,\n        publicKey: `0x${sharePublicKey.serializeToHexStr()}`,\n        id,\n      });\n    }\n\n    const response: ISharesKeyPairs = {\n      privateKey: `0x${this.privateKey.serializeToHexStr()}`,\n      publicKey: `0x${this.publicKey.serializeToHexStr()}`,\n      shares: this.shares,\n    };\n\n    return response;\n  }\n}\n\nexport default Threshold;\n", "import crypto from 'crypto';\nimport { syncScrypt } from 'scrypt-js';\nimport Wallet from 'ethereumjs-wallet';\nimport { keccak256, sha256 } from 'ethereumjs-util';\nimport { EthereumWalletError, KeyStoreDataFormatError, KeyStoreInvalidError, KeyStorePasswordError } from '../exceptions/keystore';\n\ninterface V4Keystore {\n  crypto: {\n    kdf: {\n      function: string,\n      params: {\n        dklen: number,\n        n: number,\n        r: number,\n        p: number,\n        salt: string\n      },\n      message: string\n    },\n    checksum: {\n      function: string,\n      params: any,\n      message: string\n    },\n    cipher: {\n      function: string,\n      params: {\n        iv: string\n      },\n      message: string\n    }\n  },\n  description: string,\n  pubkey: string,\n  path: string,\n  uuid: string\n  version: number\n}\n\n/**\n * Decrypt private key from key store data\n * Supports key store versions: v1, v3, v4\n *\n * Example of usage (Node env):\n *\n *  const keyStoreFilePath = path.join(process.cwd(), 'validator_keys', 'keystore.json');\n *  const keyStoreString: string = fs.readFileSync(keyStoreFilePath).toString();\n *  const keyStoreData = JSON.parse(keyStoreString);\n *  const keyStore = new EthereumKeyStore(keyStoreData);\n *  const password = 'testtest';\n *  console.log('Private Key:', await keyStore.getPrivateKey(password));\n */\nclass EthereumKeyStore {\n  private readonly keyStoreData: any;\n  private privateKey = '';\n  private wallet: Wallet | undefined;\n\n  /**\n   * Receive key store data from string or parsed JSON\n   * @param keyStoreData\n   */\n  constructor(keyStoreData: any) {\n    if (!keyStoreData) {\n      throw new KeyStoreDataFormatError(keyStoreData, 'Key store data should be JSON or string');\n    }\n    if (typeof keyStoreData === 'string') {\n      this.keyStoreData = JSON.parse(keyStoreData);\n    } else {\n      this.keyStoreData = keyStoreData;\n    }\n    if (!this.keyStoreData.version) {\n      throw new KeyStoreInvalidError(this.keyStoreData, 'Invalid keystore file');\n    }\n  }\n\n  getPublicKey(): string {\n    if (this.keyStoreData) {\n      switch (this.keyStoreData.version ?? this.keyStoreData.Version) {\n        case 1:\n          return this.keyStoreData.Address;\n        case 3:\n          return this.keyStoreData.id;\n        case 4:\n          return this.keyStoreData.pubkey;\n      }\n    }\n    return '';\n  }\n\n  /**\n   * Decrypt private key using user password\n   * @param password\n   */\n  async getPrivateKey(password = ''): Promise<string> {\n    // In case private key exist we return it\n    if (this.privateKey) return this.privateKey;\n    switch (this.keyStoreData.version) {\n      case 1:\n        this.wallet = await Wallet.fromV1(this.keyStoreData, password);\n        break;\n      case 3:\n        this.wallet = await Wallet.fromV3(this.keyStoreData, password, true);\n        break;\n      case 4:\n        this.wallet = await this.fromV4(this.keyStoreData, password);\n        break;\n    }\n    if (this.wallet) {\n      this.privateKey = this.wallet.getPrivateKey().toString('hex');\n      if (!this.privateKey) {\n        throw new KeyStorePasswordError('Invalid password');\n      }\n    }\n    return this.privateKey;\n  }\n\n  /**\n   * Import a wallet (Version 4 of the Ethereum wallet format).\n   *\n   * @param input A JSON serialized string, or an object representing V3 Keystore.\n   * @param password The keystore password.\n   */\n  public async fromV4(\n    input: string | V4Keystore,\n    password: string,\n  ): Promise<Wallet> {\n    const json: V4Keystore = typeof input === 'object' ? input : JSON.parse(input);\n\n    if (json.version !== 4) {\n      throw new EthereumWalletError('Not a V4 wallet');\n    }\n\n    let derivedKey: Uint8Array;\n    let kdfParams: any;\n    if (json.crypto.kdf.function === 'scrypt') {\n      kdfParams = json.crypto.kdf.params;\n      derivedKey = syncScrypt(\n        Buffer.from(password),\n        Buffer.from(kdfParams.salt, 'hex'),\n        kdfParams.n,\n        kdfParams.r,\n        kdfParams.p,\n        kdfParams.dklen,\n      );\n    } else if (json.crypto.kdf.function === 'pbkdf2') {\n      kdfParams = json.crypto.kdf.params;\n\n      if (kdfParams.prf !== 'hmac-sha256') {\n        throw new EthereumWalletError('Unsupported parameters to PBKDF2');\n      }\n\n      derivedKey = crypto.pbkdf2Sync(\n        Buffer.from(password),\n        Buffer.from(kdfParams.salt, 'hex'),\n        kdfParams.c,\n        kdfParams.dklen,\n        'sha256',\n      );\n    } else {\n      throw new EthereumWalletError('Unsupported key derivation scheme');\n    }\n\n    const ciphertext = Buffer.from(json.crypto.cipher.message, 'hex');\n    const checksumBuffer = Buffer.concat([Buffer.from(derivedKey.slice(16, 32)), ciphertext]);\n    const hashFunctions: Record<string, any> = {\n      keccak256,\n      sha256,\n    };\n    const hashFunction: any = hashFunctions[json.crypto.checksum.function];\n    const mac: Buffer = hashFunction(checksumBuffer);\n    if (mac.toString('hex') !== json.crypto.checksum.message) {\n      throw new EthereumWalletError('Invalid password');\n    }\n\n    const decipher = crypto.createDecipheriv(\n      json.crypto.cipher.function,\n      derivedKey.slice(0, 16),\n      Buffer.from(json.crypto.cipher.params.iv, 'hex'),\n    );\n    const seed: Buffer = this.runCipherBuffer(decipher, ciphertext);\n    return new Wallet(seed);\n  }\n\n  /**\n   * @param cipher\n   * @param data\n   */\n  protected runCipherBuffer(cipher: crypto.Cipher | crypto.Decipher, data: Buffer): Buffer {\n    return Buffer.concat([cipher.update(data), cipher.final()]);\n  }\n\n  /**\n   * Convert byte array to string\n   * @param byteArray\n   */\n  static toHexString(byteArray: Uint8Array): string {\n    return Array.from(byteArray, (byte: number) => {\n      // eslint-disable-next-line no-bitwise\n      return (`0${(byte & 0xFF).toString(16)}`).slice(-2);\n    }).join('');\n  }\n}\n\nexport default EthereumKeyStore;\n", "import JSEncrypt from '../JSEncrypt';\n\nimport { IShares } from '../Threshold';\n\nimport { operatorPublicKeyValidator } from '../../commands/actions/validators';\nimport { OperatorPublicKeyError } from '../exceptions/operator';\n\nexport interface EncryptShare {\n    operatorPublicKey: string,\n    privateKey: string,\n    publicKey: string\n}\n\nexport default class Encryption {\n  private readonly operatorPublicKeys: string[];\n  private readonly shares: IShares[];\n\n\n  constructor(operatorPublicKeys: string[], shares: IShares[]) {\n    this.operatorPublicKeys = [...operatorPublicKeys];\n    this.shares = shares;\n  }\n\n  encrypt(): EncryptShare[] {\n    const encryptedShares: EncryptShare[] = [];\n    for (const [idx, operatorPublicKey] of this.operatorPublicKeys.entries()) {\n      operatorPublicKeyValidator(operatorPublicKey);\n      const jsEncrypt = new JSEncrypt({});\n      jsEncrypt.setPublicKey(operatorPublicKey)\n      const encryptedPrivateKey = jsEncrypt.encrypt(this.shares[idx].privateKey);\n      if (!encryptedPrivateKey) {\n        throw new OperatorPublicKeyError(\n          {\n            rsa: operatorPublicKey,\n            base64: encryptedPrivateKey,\n          },\n          'Private key encryption failed.',\n        );\n      }\n      const encryptedShare: EncryptShare = {\n          operatorPublicKey,\n          privateKey: encryptedPrivateKey,\n          publicKey: this.shares[idx].publicKey,\n      };\n      encryptedShares.push(encryptedShare);\n    }\n    return encryptedShares;\n  }\n}\n", "import { IsDefined, IsInt, IsNotEmpty, IsString, validateSync } from 'class-validator';\nimport { IOperator } from './IOperator';\nimport { IOperatorData } from './IOperatorData';\nimport { OpeatorPublicKeyValidator } from './validators';\n\nexport class OperatorData implements IOperatorData {\n  @IsNotEmpty({ message: 'The operator id is null'})\n  @IsDefined({ message: 'The operator id is undefined'})\n  @IsInt({ message: 'The operator id must be an integer'})\n  public id: number;\n\n  @IsNotEmpty({ message: 'The operator public key is null'})\n  @IsDefined({ message: 'The operator public key is undefined'})\n  @IsString({ message: 'The operator public key must be a string'})\n  @OpeatorPublicKeyValidator()\n  public operatorKey: string;\n\n  constructor(data: IOperator) {\n    this.id = data.id;\n    this.operatorKey = data.operatorKey;\n    this.validate();\n  }\n\n  /**\n   * Validate operator id and public key\n   */\n  validate(): void {\n    validateSync(this);\n  }\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport { DuplicatedOperatorIdError, DuplicatedOperatorPublicKeyError } from '../../../exceptions/operator';\n\n@ValidatorConstraint({ name: 'uniqueList', async: false })\nexport class OpeatorsListValidatorConstraint implements ValidatorConstraintInterface {\n  validate(operatorsList: any) {\n    const operatorIds = new Set(), operatorPublicKeys = new Set();\n    for (const operator of operatorsList || []) {\n      if (operatorIds.has(operator.id)) {\n        throw new DuplicatedOperatorIdError(operator, `The operator ID '${operator.id}' is duplicated in the list`);\n      }\n      operatorIds.add(operator.id);\n\n      if (operatorPublicKeys.has(operator.operatorKey)) {\n        throw new DuplicatedOperatorPublicKeyError(operator, `The public key for operator ID ${operator.id} is duplicated in the list`);\n      }\n      operatorPublicKeys.add(operator.operatorKey);\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'The list of operators contains duplicate entries';\n  }\n}\n\nexport function OpeatorsListValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OpeatorsListValidatorConstraint,\n    });\n  };\n}\n\n\n", "import bls from '../../../BLS';\nimport {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport { BLSDeserializeError } from '../../../exceptions/bls';\n\n/* Try to BLS deserialize validator public key. */\n@ValidatorConstraint({ name: 'publicKey', async: true })\nexport class PublicKeyValidatorConstraint implements ValidatorConstraintInterface {\n  async validate(value: any) {\n    try {\n      if (typeof value === 'string') {\n        bls.deserializeHexStrToPublicKey(value.replace('0x', ''));\n      } else {\n        value.forEach((item: string) => bls.deserializeHexStrToPublicKey(item.replace('0x', '')));\n      }\n    } catch (e) {\n      throw new BLSDeserializeError( value, 'Failed to BLS deserialize validator public key');\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'Invalid public key';\n  }\n}\n\nexport function PublicKeyValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: PublicKeyValidatorConstraint,\n    });\n  };\n}\n", "import { SSVKeysException } from './base';\nexport class BLSDeserializeError extends SSVKeysException {\n  public publicKey: string;\n\n  constructor(publicKey: string, message: string) {\n    super(message);\n    this.publicKey = publicKey;\n  }\n}\n\nexport class SingleSharesSignatureInvalid extends SSVKeysException {\n  public data: string;\n\n  constructor(data: string, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport * as web3Helper from '../../../helpers/web3.helper';\n\nimport { OwnerAddressFormatError } from '../../../exceptions/keystore';\n\n/* Try to validate ethereum owner address. */\n@ValidatorConstraint({ name: 'ownerAddress', async: false })\nexport class OwnerAddressValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any) {\n    try {\n      web3Helper.web3.utils.toChecksumAddress(value);\n    } catch {\n      throw new OwnerAddressFormatError(value, 'Owner address is not a valid Ethereum address');\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'Invalid owner address';\n  }\n}\n\nexport function OwnerAddressValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OwnerAddressValidatorConstraint,\n    });\n  };\n}\n", "import Web3 from 'web3';\nimport * as ethers from 'ethers';\nimport * as ethUtil from 'ethereumjs-util';\n\nimport bls from '../BLS';\nimport { SingleSharesSignatureInvalid } from '../exceptions/bls';\n\nexport const web3 = new Web3();\n\n/**\n * Encode with Web3 eth abi method any fields of shares array required for transaction.\n * @param encryptedShares\n * @param field\n */\nexport const abiEncode = (encryptedShares: any[], field?: string): string[] => {\n  return encryptedShares.map(share => {\n    const value = field ? Object(share)[field] : share;\n    if (String(value).startsWith('0x')) {\n      return value;\n    }\n    return web3.eth.abi.encodeParameter('string', value);\n  });\n}\n\n/**\n * This function converts a hexadecimal string into a Uint8Array.\n * It removes the prefix '0x' if present and maps each hexadecimal byte into a Uint8Array.\n *\n * @param {string} hex - The hexadecimal string input, it can start with '0x'.\n * @returns {Uint8Array} - It returns a Uint8Array, where each element in the array is a byte from the hexadecimal string.\n *\n */\nexport const hexToUint8Array = (hex: string) => {\n  if (hex.startsWith('0x')) {\n    hex = hex.slice(2);\n  }\n  const length = hex.length / 2;\n  const result = new Uint8Array(length);\n  for (let i = 0; i < length; i++) {\n    const start = i * 2;\n    const end = start + 2;\n    const byte = parseInt(hex.slice(start, end), 16);\n    result[i] = byte;\n  }\n  return result;\n}\n\n/**\n * This function transforms an array of hexadecimal strings into a single Node.js Buffer.\n * It employs ethers.utils.arrayify to convert each hex string into a Uint8Array, flattens them into a single array, and converts that to a Buffer.\n *\n * @param {string[]} hexArr - An array of hexadecimal strings. Each string can represent bytes of arbitrary length. *\n * @returns {Buffer} - A Node.js Buffer that concatenates the bytes represented by the hexadecimal strings in the input array.\n *\n */\nexport const hexArrayToBytes = (hexArr: string[]): Buffer => {\n  const uint8Array = new Uint8Array(hexArr.map(item => [...ethers.utils.arrayify(item)]).flat());\n  return Buffer.from(uint8Array);\n}\n\n/**\n * Asynchronously creates a BLS signature for given data using a private key.\n *\n * @param {string} dataToSign - The data to be signed.\n * @param {string} privateKeyHex - Hexadecimal representation of the private key.\n * @returns {Promise<string>} - A promise that resolves to the BLS signature in hexadecimal format.\n *\n * The function initializes the BLS library if needed, deserializes the private key from a hexadecimal string,\n * computes the Keccak-256 hash of the data, signs the hashed data using the deserialized private key,\n * and returns the signature in hexadecimal format, prefixed with '0x'.\n */\nexport const buildSignature = async(dataToSign: string, privateKeyHex: string): Promise<string> => {\n  if (!bls.deserializeHexStrToSecretKey) {\n    await bls.init(bls.BLS12_381);\n  }\n\n  const privateKey = bls.deserializeHexStrToSecretKey(privateKeyHex.replace('0x', ''));\n\n  const messageHash = ethUtil.keccak256(Buffer.from(dataToSign));\n  const signature = privateKey.sign(new Uint8Array(messageHash));\n  const signatureHex = signature.serializeToHexStr();\n  return `0x${signatureHex}`;\n}\n\n/**\n * Asynchronously validates a BLS signature for given signed data.\n *\n * @param {string} signedData - Data that has been signed.\n * @param {string} signatureHex - Hexadecimal representation of the BLS signature.\n * @param {string} publicKey - Hexadecimal representation of the public key.\n * @throws {SingleSharesSignatureInvalid} - Throws an error if the signature is invalid.\n * @returns {Promise<void>} - Resolves when the signature is successfully verified.\n *\n * The function initializes the BLS library if needed, deserializes the public key and signature from hexadecimal strings,\n * computes the Keccak-256 hash of the signed data, and verifies the signature using the deserialized public key.\n */\nexport const validateSignature = async(signedData: string, signatureHex: string, publicKey: string): Promise<void> => {\n  if (!bls.deserializeHexStrToSecretKey) {\n    await bls.init(bls.BLS12_381);\n  }\n\n  const blsPublicKey = bls.deserializeHexStrToPublicKey(publicKey.replace('0x', ''));\n  const signature = bls.deserializeHexStrToSignature(signatureHex.replace('0x', ''));\n\n  const messageHash = ethUtil.keccak256(Buffer.from(signedData));\n\n  if (!blsPublicKey.verify(signature, new Uint8Array(messageHash))) {\n    throw new SingleSharesSignatureInvalid(signatureHex, 'Single shares signature is invalid');\n  }\n}\n\nexport const privateToPublicKey = async(privateKey: string): Promise<string> => {\n  if (!bls.deserializeHexStrToSecretKey) {\n    await bls.init(bls.BLS12_381);\n  }\n  return `0x${bls.deserializeHexStrToSecretKey(privateKey.replace('0x', '')).getPublicKey().serializeToHexStr()}`;\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\n\nimport { OwnerNonceFormatError } from '../../../exceptions/keystore';\n\n/* Try to validate owner nonce. */\n@ValidatorConstraint({ name: 'ownerNonce', async: false })\nexport class OwnerNonceValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any) {\n    if (!Number.isInteger(value) || value < 0) {\n      throw new OwnerNonceFormatError(value, 'Owner nonce is not positive integer');\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'Invalid owner nonce';\n  }\n}\n\nexport function OwnerNonceValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OwnerNonceValidatorConstraint,\n    });\n  };\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n  ValidationArguments,\n} from 'class-validator';\nimport { OperatorsCountsMismatchError } from '../../../exceptions/operator';\n\n@ValidatorConstraint({ name: 'matchLength', async: false })\nexport class MatchLengthValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any, args: ValidationArguments) {\n    const [relatedPropertyName, customError] = args.constraints;\n    const relatedLength = (args.object as any)[relatedPropertyName].length;\n    if (!Array.isArray(value)) {\n      Object.values(value).forEach((arr: any) => {\n        if (relatedLength !== arr.length) {\n          throw new OperatorsCountsMismatchError((args.object as any)[relatedPropertyName], value, customError.message);\n        }\n      })\n    } else {\n      if (relatedLength !== value.length) {\n        throw new OperatorsCountsMismatchError((args.object as any)[relatedPropertyName], value, customError.message);\n      }\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'The length of the entries lists are not equal';\n  }\n}\n\nexport function MatchLengthValidator(property: string, validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [property, validationOptions],\n      validator: MatchLengthValidatorConstraint,\n    });\n  };\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport { operatorPublicKeyValidator } from '../../../../commands/actions/validators';\n\n@ValidatorConstraint({ name: 'operatorKey', async: false })\nexport class OpeatorPublicKeyValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any) {\n    return operatorPublicKeyValidator(value);\n  }\n\n  defaultMessage() {\n    return 'Invalid operator public key';\n  }\n}\n\nexport function OpeatorPublicKeyValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OpeatorPublicKeyValidatorConstraint,\n    });\n  };\n}\n", "import { IOperator } from \"../KeyShares/KeySharesData/IOperator\";\nimport { OperatorData } from \"../KeyShares/KeySharesData/OperatorData\";\nimport { OperatorsCountsMismatchError } from \"../exceptions/operator\";\n\n/**\n * Sort operators input.\n * @param operators list\n */\n\nexport const operatorSortedList = (operators: IOperator[]): OperatorData[] => {\n  // Extracting IDs and operatorKeys for error reporting\n  const ids = operators.map(op => op.id);\n  const operatorKeys = operators.map(op => op.operatorKey);\n\n  // Validate and convert IDs to numbers for sorting\n  const validatedOperators = operators.map((operator: any) => {\n    const id = parseInt(operator.id, 10);\n    if (isNaN(id)) {\n      throw new OperatorsCountsMismatchError(ids, operatorKeys, `Invalid operator ID: ${operator.id}`);\n    }\n    if (!operator.operatorKey) {\n      throw new OperatorsCountsMismatchError(ids, operatorKeys, `Operator key is missing for operator ID: ${id}`);\n    }\n    return { ...operator, id };\n  });\n\n  // Sort operators by ID\n  validatedOperators.sort((a, b) => a.id - b.id);\n\n  // Map to OperatorData objects\n  return validatedOperators.map(operator => new OperatorData(operator));\n};\n", "// import atob from 'atob';\nimport bls from './BLS';\n\nimport Threshold, { IShares, ISharesKeyPairs } from './Threshold';\nimport EthereumKeyStore from './EthereumKeyStore/EthereumKeyStore';\nimport Encryption, { EncryptShare } from './Encryption/Encryption';\nimport { operatorSortedList } from './helpers/operator.helper';\nimport { IOperator } from './KeyShares/KeySharesData/IOperator';\n\nexport interface ExtractedKeys {\n  privateKey: string;\n  publicKey: string;\n}\n\n/**\n * SSVKeys class provides high-level methods to easily work with entire flow:\n *  - getting private key from keystore file using password\n *  - creating shares threshold\n *  - creating final shares\n *  - building final payload which is ready to be used in web3 transaction\n */\nexport class SSVKeys {\n  static SHARES_FORMAT_ABI = 'abi';\n\n  protected threshold: ISharesKeyPairs | undefined;\n\n  /**\n   * Extract private key from keystore data using keystore password.\n   * Generally can be used in browsers when the keystore data has been provided by browser.\n   * @param data\n   * @param password\n   */\n  async extractKeys(data: string, password: string): Promise<ExtractedKeys> {\n    const privateKey = await new EthereumKeyStore(data).getPrivateKey(password);\n    if (!bls.deserializeHexStrToSecretKey) {\n      await bls.init(bls.BLS12_381);\n    }\n    return {\n      privateKey: `0x${privateKey}`,\n      publicKey: `0x${bls.deserializeHexStrToSecretKey(privateKey).getPublicKey().serializeToHexStr()}`\n    };\n  }\n\n  /**\n   * Build threshold using private key and list of operators.\n   * @param privateKey\n   * @param operators\n   */\n  async createThreshold(privateKey: string, operators: IOperator[]): Promise<ISharesKeyPairs> {\n    const sortedOperators = operatorSortedList(operators);\n    this.threshold = await new Threshold().create(privateKey, sortedOperators.map(item => item.id));\n    return this.threshold;\n  }\n\n  /**\n   * Encrypt operators shares using operators list (id, publicKey).\n   * @param operators\n   * @param shares\n   */\n  async encryptShares(operators: IOperator[], shares: IShares[]): Promise<EncryptShare[]> {\n    const sortedOperators = operatorSortedList(operators);\n    const decodedOperatorPublicKeys = sortedOperators.map(item => Buffer.from(item.operatorKey, 'base64').toString());\n    return new Encryption(decodedOperatorPublicKeys, shares).encrypt();\n  }\n\n  /**\n   * Build shares from private key, operators list\n   * @param privateKey\n   * @param operators\n   */\n  async buildShares(privateKey: string, operators: IOperator[]): Promise<EncryptShare[]> {\n    const threshold = await this.createThreshold(privateKey, operators);\n    return this.encryptShares(operators, threshold.shares);\n  }\n\n  /**\n   * Getting threshold if it has been created before.\n   */\n  getThreshold()  {\n    return this.threshold;\n  }\n}\n", "import * as ethers from 'ethers';\nimport * as web3Helper from '../helpers/web3.helper';\nimport {\n  IsOptional,\n  ValidateNested,\n  validateSync\n} from 'class-validator';\n\nimport { KeySharesData } from './KeySharesData/KeySharesData';\nimport { KeySharesPayload } from './KeySharesData/KeySharesPayload';\nimport { EncryptShare } from '../Encryption/Encryption';\nimport { IKeySharesPartitialData } from './KeySharesData/IKeySharesData';\nimport { IOperator } from './KeySharesData/IOperator';\nimport { operatorSortedList } from '../helpers/operator.helper';\nimport { OwnerAddressFormatError, OwnerNonceFormatError } from '../exceptions/keystore';\nimport { SSVKeysException } from '../../lib/exceptions/base';\n\nexport interface IKeySharesPayloadData {\n  publicKey: string,\n  operators: IOperator[],\n  encryptedShares: EncryptShare[],\n}\n\nexport interface IKeySharesToSignatureData {\n  ownerAddress: string,\n  ownerNonce: number,\n  privateKey: string,\n}\n\nexport interface IKeySharesFromSignatureData {\n  ownerAddress: string,\n  ownerNonce: number,\n  publicKey: string,\n}\n\nconst SIGNATURE_LENGHT = 192;\nconst PUBLIC_KEY_LENGHT = 96;\n\n/**\n * Key shares file data interface.\n */\nexport class KeySharesItem {\n  @IsOptional()\n  @ValidateNested()\n  public data: KeySharesData;\n\n  @IsOptional()\n  @ValidateNested()\n  public payload: KeySharesPayload;\n\n  constructor() {\n    this.data = new KeySharesData();\n    this.payload = new KeySharesPayload();\n  }\n\n  /**\n   * Build payload from operators list, encrypted shares and validator public key\n   * @param publicKey\n   * @param operatorIds\n   * @param encryptedShares\n   */\n  async buildPayload(metaData: IKeySharesPayloadData, toSignatureData: IKeySharesToSignatureData): Promise<any> {\n    const {\n      ownerAddress,\n      ownerNonce,\n      privateKey,\n    } = toSignatureData;\n\n    if (!Number.isInteger(ownerNonce) || ownerNonce < 0) {\n      throw new OwnerNonceFormatError(ownerNonce, 'Owner nonce is not positive integer');\n    }\n\n    let address;\n    try {\n      address = web3Helper.web3.utils.toChecksumAddress(ownerAddress);\n    } catch {\n      throw new OwnerAddressFormatError(ownerAddress, 'Owner address is not a valid Ethereum address');\n    }\n\n    const payload = this.payload.build({\n      publicKey: metaData.publicKey,\n      operatorIds: operatorSortedList(metaData.operators).map(operator => operator.id),\n      encryptedShares: metaData.encryptedShares,\n    });\n\n    const signature = await web3Helper.buildSignature(`${address}:${ownerNonce}`, privateKey);\n    const signSharesBytes = web3Helper.hexArrayToBytes([signature, payload.sharesData]);\n\n    payload.sharesData = `0x${signSharesBytes.toString('hex')}`;\n\n    // verify signature\n    await this.validateSingleShares(payload.sharesData, {\n      ownerAddress,\n      ownerNonce,\n      publicKey: await web3Helper.privateToPublicKey(privateKey),\n    });\n\n    return payload;\n  }\n\n\n  async validateSingleShares(shares: string, fromSignatureData: IKeySharesFromSignatureData): Promise<void> {\n    const { ownerAddress, ownerNonce, publicKey } = fromSignatureData;\n\n    if (!Number.isInteger(ownerNonce) || ownerNonce < 0) {\n      throw new OwnerNonceFormatError(ownerNonce, 'Owner nonce is not positive integer');\n    }\n\n    const address = web3Helper.web3.utils.toChecksumAddress(ownerAddress);\n    const signaturePt = shares.replace('0x', '').substring(0, SIGNATURE_LENGHT);\n\n    await web3Helper.validateSignature(`${address}:${ownerNonce}`, `0x${signaturePt}`, publicKey);\n  }\n\n  /**\n   * Build shares from bytes string and operators list length\n   * @param bytes\n   * @param operatorCount\n   */\n  buildSharesFromBytes(bytes: string, operatorCount: number): any {\n    // Validate the byte string format (hex string starting with '0x')\n    if (!bytes.startsWith('0x') || !/^(0x)?[0-9a-fA-F]*$/.test(bytes)) {\n      throw new SSVKeysException('Invalid byte string format');\n    }\n\n    // Validate the operator count (positive integer)\n    if (operatorCount <= 0 || !Number.isInteger(operatorCount)) {\n      throw new SSVKeysException('Invalid operator count');\n    }\n\n    const sharesPt = bytes.replace('0x', '').substring(SIGNATURE_LENGHT);\n\n    const pkSplit = sharesPt.substring(0, operatorCount * PUBLIC_KEY_LENGHT);\n    const pkArray = ethers.utils.arrayify('0x' + pkSplit);\n    const sharesPublicKeys = this.splitArray(operatorCount, pkArray)\n      .map(item => ethers.utils.hexlify(item));\n\n    const eSplit = bytes.substring(operatorCount * PUBLIC_KEY_LENGHT);\n    const eArray = ethers.utils.arrayify('0x' + eSplit);\n    const encryptedKeys = this.splitArray(operatorCount, eArray).map(item =>\n      Buffer.from(ethers.utils.hexlify(item).replace('0x', ''), 'hex').toString(\n        'base64',\n      ),\n    );\n\n    return { sharesPublicKeys, encryptedKeys };\n  }\n\n  /**\n   * Updates the current instance with partial data and payload, and validates.\n   * @param data Partial key shares data.\n   * @param payload Partial key shares payload.\n   */\n  update(data: IKeySharesPartitialData): void {\n    this.data.update(data);\n    this.validate();\n  }\n\n  /**\n   * Validate everything\n   */\n  validate(): any {\n    validateSync(this);\n  }\n\n  /**\n   * Stringify key shares to be ready for saving in file.\n   */\n  toJson(): string {\n    return JSON.stringify({\n      data: this.data || null,\n      payload: this.payload || null,\n    }, null, 2);\n  }\n\n  private splitArray(parts: number, arr: Uint8Array) {\n    const partLength = Math.floor(arr.length / parts);\n    const partsArr = [];\n    for (let i = 0; i < parts; i++) {\n      const start = i * partLength;\n      const end = start + partLength;\n      partsArr.push(arr.slice(start, end));\n    }\n    return partsArr;\n  }\n\n  /**\n   * Initialise from JSON or object data.\n   */\n  static async fromJson(content: string | any): Promise<KeySharesItem> {\n    const body = typeof content === 'string' ? JSON.parse(content) : content;\n    const instance = new KeySharesItem();\n    instance.data.update(body.data);\n    instance.payload.update(body.payload);\n    instance.validate();\n    // Custom validation: verify signature\n    await instance.validateSingleShares(instance.payload.sharesData, {\n      ownerAddress: instance.data.ownerAddress as string,\n      ownerNonce: instance.data.ownerNonce as number,\n      publicKey: instance.data.publicKey as string,\n    });\n\n    return instance;\n  }\n}\n", "import { IsString, Length, ValidateNested, IsOptional, validateSync, IsNumber } from 'class-validator';\nimport { OperatorData } from './OperatorData';\nimport { IKeySharesData, IKeySharesPartitialData } from './IKeySharesData';\nimport { OpeatorsListValidator, PublicKeyValidator, OwnerAddressValidator, OwnerNonceValidator } from './validators';\nimport { operatorSortedList } from '../../helpers/operator.helper';\n\nexport class KeySharesData implements IKeySharesData {\n  @IsOptional()\n  @IsNumber()\n  @OwnerNonceValidator()\n  public ownerNonce?: number | null = null;\n\n  @IsOptional()\n  @IsString()\n  @OwnerAddressValidator()\n  public ownerAddress?: string | null = null;\n\n  @IsOptional()\n  @IsString()\n  @Length(98, 98)\n  @PublicKeyValidator()\n  public publicKey?: string | null = null;\n\n  @IsOptional()\n  @ValidateNested({ each: true })\n  @OpeatorsListValidator()\n  public operators?: OperatorData[] | null = null;\n\n  update(data: IKeySharesPartitialData) {\n    if (data.ownerAddress) {\n      this.ownerAddress = data.ownerAddress;\n    }\n    if (typeof data.ownerNonce === 'number') {\n      this.ownerNonce = data.ownerNonce;\n    }\n    if (data.publicKey) {\n      this.publicKey = data.publicKey;\n    }\n    if (data.operators) {\n      this.operators = operatorSortedList(data.operators);\n    }\n  }\n\n  /**\n   * Do all possible validations.\n   */\n  async validate(): Promise<any> {\n    validateSync(this);\n  }\n\n  /**\n   * Get the list of operators IDs.\n   */\n  get operatorIds(): number[] {\n    if (!this.operators?.length) {\n      return [];\n    }\n    return this.operators.map(operator => parseInt(String(operator.id), 10));\n  }\n\n  /**\n   * Get the list of operators public keys.\n   */\n  get operatorPublicKeys(): string[] {\n    if (!this.operators?.length) {\n      return [];\n    }\n    return this.operators.map(operator => String(operator.operatorKey));\n  }\n}\n", "import * as web3Helper from '../../helpers/web3.helper';\n\nimport { IsString, Length, validateSync, IsNumber } from 'class-validator';\nimport { PublicKeyValidator } from './validators';\n\nimport { IKeySharesPartitialPayload, IKeySharesPayload } from './IKeySharesPayload';\nimport { EncryptShare } from '../../Encryption/Encryption';\n\n/**\n * Key Shares Payload\n */\nexport class KeySharesPayload implements IKeySharesPayload {\n  @IsString()\n  public sharesData!: string;\n\n  @IsString()\n  @Length(98, 98)\n  @PublicKeyValidator()\n  public publicKey!: string;\n\n  @IsNumber({}, { each: true })\n  public operatorIds!: number[];\n\n  /**\n   * Converts arrays of public and private keys to a single hexadecimal string.\n   * @param publicKeys Array of public keys.\n   * @param privateKeys Array of private keys.\n   * @returns Hexadecimal string representation of keys.\n   */\n  private _sharesToBytes(publicKeys: string[], privateKeys: string[]) {\n    const encryptedShares = [...privateKeys].map(item => ('0x' + Buffer.from(item, 'base64').toString('hex')));\n    const pkPsBytes = web3Helper.hexArrayToBytes([...publicKeys, ...encryptedShares]);\n    return `0x${pkPsBytes.toString('hex')}`;\n  }\n\n  /**\n   * Updates the payload with new data and validates it.\n   * @param data Partial key shares payload to update.\n   */\n  update(data: IKeySharesPartitialPayload): void {\n    this.publicKey = data.publicKey;\n    this.sharesData = data.sharesData;\n    this.operatorIds = data.operatorIds;\n    this.validate();\n  }\n\n  /**\n   * Validates the current state of the instance.\n   * @returns {void | ValidationError[]} Validation errors if any, otherwise undefined.\n   */\n  validate(): any {\n    validateSync(this);\n  }\n\n  /**\n   * Builds the payload from the given data.\n   * @param data Data to build the payload.\n   * @returns {KeySharesPayload} The current instance for chaining.\n   */\n  build(data: any): KeySharesPayload {\n    this.publicKey = data.publicKey;\n    this.operatorIds = data.operatorIds;\n    this.sharesData = this._sharesToBytes(\n      data.encryptedShares.map((share: EncryptShare) => share.publicKey),\n      data.encryptedShares.map((share: EncryptShare) => share.privateKey)\n    );\n\n    return this;\n  }\n}\n", "import semver from 'semver';\nimport pkg from '../../../package.json';\n\nimport { IsOptional, ValidateNested, validateSync } from 'class-validator';\nimport { KeySharesItem } from './KeySharesItem';\nimport { SSVKeysException } from '../../lib/exceptions/base';\n\n/**\n * Represents a collection of KeyShares items with functionality for serialization,\n * deserialization, and validation.\n */\nexport class KeyShares {\n  @IsOptional()\n  @ValidateNested({ each: true })\n  private shares: KeySharesItem[];\n\n  constructor(shares: KeySharesItem[] = []) {\n    this.shares = [...shares];\n  }\n\n  /**\n   * Add a single KeyShares item to the collection.\n   * @param keySharesItem The KeyShares item to add.\n   */\n  add(keySharesItem: KeySharesItem): void {\n    this.shares.push(keySharesItem);\n  }\n\n  list(): KeySharesItem[] {\n    return this.shares;\n  }\n\n  /**\n   * Validate the KeyShares instance using class-validator.\n   * @returns The validation result.\n   */\n  validate(): any {\n    validateSync(this);\n  }\n\n  /**\n   * Converts the KeyShares instance to a JSON string.\n   * @returns The JSON string representation of the KeyShares instance.\n   */\n  toJson(): string {\n    return JSON.stringify({\n      version: `v${pkg.version}`,\n      createdAt: new Date().toISOString(),\n      shares: this.shares.length > 0 ? this.shares : null,\n    }, null, 2);\n  }\n\n  /**\n   * Initialize the KeyShares instance from JSON or object data.\n   * @param content The JSON string or object to initialize from.\n   * @returns The KeyShares instance.\n   * @throws Error if the version is incompatible or the shares array is invalid.\n   */\n  static async fromJson(content: string | any): Promise<KeyShares> {\n    const body = typeof content === 'string' ? JSON.parse(content) : content;\n    const extVersion = semver.parse(body.version);\n    const currentVersion = semver.parse(pkg.version);\n\n    if (!extVersion || !currentVersion) {\n      throw new SSVKeysException(`The file for keyshares must contain a version mark provided by ssv-keys.`);\n    }\n\n    if (!extVersion || (currentVersion.major !== extVersion.major) || (currentVersion.minor !== extVersion.minor)) {\n      throw new SSVKeysException(`The keyshares file you are attempting to reuse does not have the same version (v${pkg.version}) as supported by ssv-keys`);\n    }\n\n    const instance = new KeyShares();\n    instance.shares = [];\n\n    if (Array.isArray(body.shares)) {\n      // Process each item in the array\n      for (const item of body.shares) {\n        instance.shares.push(await KeySharesItem.fromJson(item));\n      }\n    } else {\n      // Handle old format (single item)\n      instance.shares.push(await KeySharesItem.fromJson(body));\n    }\n\n    return instance;\n  }\n}\n"],
-  "mappings": "0zCAAA,IAAAA,GAAAC,GAAA,oCAAM,OAAS,QAAQ,SAASC,EAAE,CAAC,GAAG,OAAO,SAAU,UAAU,OAAO,QAAS,YAAa,OAAO,QAAQA,EAAE,UAAU,OAAO,QAAS,YAAY,OAAO,IAAK,OAAO,CAAC,EAAEA,CAAC,MAAM,CAAC,IAAIC,EAAK,OAAO,QAAS,YAAaA,EAAE,OAAe,OAAO,MAAO,YAAaA,EAAE,KAAUA,EAAE,KAAKA,EAAE,UAAYD,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,OAAO,OAAO,QAAQ,OAAQ,UAAU,CAAC,SAASE,EAAEC,EAAEC,EAAEC,EAAE,CAAC,SAASC,EAAEC,EAAEP,EAAE,CAAC,GAAG,CAACI,EAAEG,GAAG,CAAC,GAAG,CAACJ,EAAEI,GAAG,CAAC,IAAIC,EAAc,OAAO,SAAnB,YAA4B,QAAQ,GAAG,CAACR,GAAGQ,EAAE,OAAOA,EAAED,EAAE,EAAE,EAAE,GAAGE,EAAE,OAAOA,EAAEF,EAAE,EAAE,EAAE,IAAIG,EAAE,IAAI,MAAM,uBAAuBH,EAAE,GAAG,EAAE,MAAMG,EAAE,KAAK,mBAAmBA,CAAC,CAAC,IAAIC,EAAEP,EAAEG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAEJ,EAAEI,GAAG,GAAG,KAAKI,EAAE,QAAQ,SAAST,EAAE,CAAC,IAAIE,GAAED,EAAEI,GAAG,GAAGL,GAAG,OAAOI,EAAEF,IAAGF,CAAC,CAAC,EAAES,EAAEA,EAAE,QAAQT,EAAEC,EAAEC,EAAEC,CAAC,CAAC,CAAC,OAAOD,EAAEG,GAAG,OAAO,CAAC,QAAQE,EAAc,OAAO,SAAnB,YAA4B,QAAQF,EAAE,EAAEA,EAAEF,EAAE,OAAOE,IAAID,EAAED,EAAEE,EAAE,EAAE,OAAOD,CAAC,CAAC,OAAOJ,CAAC,EAAG,EAAE,CAAC,EAAE,CAAC,SAASU,EAAQC,EAAOC,EAAQ,CAEz0B,IAAMC,EAAYH,EAAQ,WAAW,EAErCC,EAAO,QAAUE,CAEjB,EAAE,CAAC,UAAY,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,QAAQ,OAAO,QAAQ,EASrD,SAA0CC,EAAMC,EAAS,CACtD,OAAO,SAAY,UAAY,OAAO,QAAW,SACnD,OAAO,QAAUA,EAAQ,EAClB,OAAO,QAAW,YAAc,OAAO,IAC9C,OAAO,CAAC,EAAGA,CAAO,EACX,OAAO,SAAY,SAC1B,QAAQ,UAAeA,EAAQ,EAE/BD,EAAK,UAAeC,EAAQ,CAC9B,GAAG,OAAQ,UAAW,CACtB,OAAiB,IAAM,CACb,aACA,IAAI,oBAAuB,CAE/B,qBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sDAAmrQ,CAElrQ,EAEA,2BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4DAA0of,CAEzof,EAEA,iBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kDAA6nB,CAE5nB,EAEA,2BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4DAAmtqB,CAEltqB,EAEA,6BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8DAAo9G,CAEn9G,EAEA,0BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DAA+kF,CAE9kF,EAEA,4BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,6DAA6jG,CAE5jG,EAEA,2BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4DAAsxF,CAErxF,EAEA,yBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0DAAq4sD,CAEp4sD,EAEA,0BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DAA+vD,CAE9vD,EAEA,wBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yDAA+kG,CAE9kG,EAEA,wBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yDAA4od,CAE3od,EAEA,yBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0DAAqsD,CAEpsD,EAEA,kCAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mEAAi40D,CAEh40D,EAEA,+BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gEAAogG,CAEngG,EAEA,qBAIE,QAAW,CAEnB,KAAK;AAAA;AAAA,sDAAoG,CAEnG,CAEI,EAGI,yBAA2B,CAAC,EAGhC,SAAS,oBAAoBC,EAAU,CAEtC,IAAIC,EAAe,yBAAyBD,GAC5C,GAAIC,IAAiB,OACpB,OAAOA,EAAa,QAGrB,IAAIN,EAAS,yBAAyBK,GAAY,CAGjD,QAAS,CAAC,CACX,EAGA,2BAAoBA,GAAUL,EAAQA,EAAO,QAAS,mBAAmB,EAGlEA,EAAO,OACf,CAMC,oBAAoB,EAAI,CAACC,EAASM,IAAe,CAChD,QAAQC,KAAOD,EACX,oBAAoB,EAAEA,EAAYC,CAAG,GAAK,CAAC,oBAAoB,EAAEP,EAASO,CAAG,GAC/E,OAAO,eAAeP,EAASO,EAAK,CAAE,WAAY,GAAM,IAAKD,EAAWC,EAAK,CAAC,CAGjF,EAKA,oBAAoB,EAAI,CAACC,EAAKC,IAAU,OAAO,UAAU,eAAe,KAAKD,EAAKC,CAAI,EAMtF,oBAAoB,EAAKT,GAAY,CACjC,OAAO,QAAW,aAAe,OAAO,aAC1C,OAAO,eAAeA,EAAS,OAAO,YAAa,CAAE,MAAO,QAAS,CAAC,EAEvE,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,CAC7D,EAQD,IAAI,oBAAsB,oBAAoB,gBAAgB,EAC9D,2BAAsB,oBAAoB,QAEnC,mBACR,GAAG,CAEZ,CAAC,CACD,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAChB,CAAC,ICjQD,IAAAU,GAAA,GAAAC,GAAAD,GAAA,gBAAAE,EAAA,qBAAAC,EAAA,cAAAC,EAAA,kBAAAC,EAAA,YAAAC,EAAA,qBAAAC,EAAA,cAAAC,IAAA,eAAAC,GAAAT,ICAA,IAAIU,GAEJ,GAAI,CACF,OAAO,OACPA,GAAQ,QAAQ,uBAClB,OAAQC,EAAN,CACAD,GAAQ,QAAQ,eAClB,CAEA,IAAOE,EAAQF,GCTR,IAAMG,EAAN,cAA+B,KAAM,CAG1C,YAAYC,EAAiB,CAC3B,MAAMA,CAAO,EACb,KAAK,KAAO,KAAK,YAAY,KAC7B,MAAM,kBAAkB,KAAM,KAAK,WAAW,EAC9C,KAAK,MAAQ,KAAK,MAClB,KAAK,MAAQ,GAAG,KAAK,SAAS,KAAK,SACrC,CACF,ECRO,IAAMC,EAAN,cAAsCC,CAAiB,CAG5D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaE,EAAN,cAAmCH,CAAiB,CAGzD,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaG,EAAN,cAAoCJ,CAAiB,CAC1D,YAAYE,EAAiB,CAC3B,MAAMA,CAAO,CACf,CACF,EAEaG,EAAN,cAAkCL,CAAiB,CACxD,YAAYE,EAAiB,CAC3B,MAAMA,CAAO,CACf,CACF,EAEaI,EAAN,cAAoCN,CAAiB,CAG1D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaM,EAAN,cAAsCP,CAAiB,CAG5D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaO,EAAN,cAAoCR,CAAiB,CAG1D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,ECzDA,IAAAQ,GAA6B,+BCE7B,IAAAC,GAAmB,qBACnBC,GAAgC,cAQzB,IAAMC,GAAW,CAAOC,EAAkBC,EAAK,KAAuBC,EAAA,wBAC3E,OAAO,GAAAC,SAAI,SAASH,EAAU,CAAE,SAAU,OAAQ,CAAC,EAAE,KAAMI,GAClDH,EAAO,KAAK,MAAMG,CAAI,EAAIA,CAClC,CACH,GDXO,IAAMC,GAAN,KAAgC,CAAhC,cACL,KAAU,iBAAmB,GAQvB,iBAAiBC,EAAkBC,EAAqD,QAAAC,EAAA,sBAC5F,GAAI,CAACF,EAAS,KAAK,EAAE,OACnB,MAAO,oBAET,IAAMG,EAAe,kCAEjBC,EACJ,GAAI,CAkBF,IAAMC,EAAO,MAAMC,GAASL,CAAgB,EAG5CG,EAAS,CAAC,EADS,MADF,IAAI,GAAAG,QAAiBF,CAAI,EACR,cAAcL,CAAQ,EAE1D,OAASQ,EAAP,CACAJ,EAASD,CACX,CAOA,OAAOC,CACT,GACF,EAEaK,GAA4B,IAAIV,GEvDtC,IAAMW,GAAN,KAA2B,CAA3B,cACL,KAAO,eAAiB,EAExB,kBAAkBC,EAAsB,CACtC,KAAK,eAAiBA,CACxB,CACF,EAEaC,GAA0BC,GACjC,EAAAA,EAAS,GAAKA,EAAS,IAAMA,EAAS,GAAK,GAMpCC,GAAuB,IAAIJ,GCfxC,IAAAK,GAAuB,qBCAvB,IAAIC,GAEJ,GAAI,CACF,OAAO,OACPA,GAAQ,QAAQ,aAAa,SAC/B,OAAQC,EAAN,CACAD,GAAQ,IACV,CAEA,IAAOE,EAAQF,GCLR,IAAMG,EAAN,cAAwCC,CAAiB,CAG9D,YAAYC,EAAyBC,EAAiB,CACpD,MAAMA,CAAO,EACb,KAAK,SAAWD,CAClB,CACF,EAEaE,GAAN,cAA+CH,CAAiB,CAGrE,YAAYC,EAAyBC,EAAiB,CACpD,MAAMA,CAAO,EACb,KAAK,SAAWD,CAClB,CACF,EAEaG,EAAN,cAA2CJ,CAAiB,CAIjE,YAAYK,EAA2CC,EAA2CJ,EAAiB,CACjH,MAAMA,CAAO,EACb,KAAK,QAAUG,EACf,KAAK,QAAUC,CACjB,CACF,EAEaC,EAAN,cAAqCP,CAAiB,CAG3D,YAAYC,EAA2CC,EAAiB,CACtE,MAAMA,CAAO,EACb,KAAK,SAAWD,CAClB,CACF,EFpCO,IAAMO,EAA8BC,GAA+B,CACxEA,EAAYA,EAAU,KAAK,EAE3B,IAAMC,EAAQ,iCACRC,EAAM,+BAENC,EAAU,IAAIC,EAAU,CAAC,CAAC,EAC5BC,EAAkB,GACtB,GAAI,CACF,IAAIC,EAAmB,GAEvB,GAAKN,EAAU,WAAWC,CAAK,EAe7BK,EAAmBN,MAfa,CAChC,GAAIA,EAAU,OAAS,GACrB,MAAM,IAAI,MAAM,uEAAuE,EAGzF,GAAI,CACFM,KAAmB,WAAON,CAAS,EAAE,KAAK,CAC5C,OAASO,EAAP,CACA,MAAM,IAAI,MAAM,iFAAiF,CACnG,CAEA,GAAI,CAACD,EAAiB,WAAWL,CAAK,EACpC,MAAM,IAAI,MAAM,4CAA4CA,IAAQ,CAExE,CAIA,GAAI,CAACK,EAAiB,SAASJ,CAAG,EAChC,MAAM,IAAI,MAAM,0CAA0CA,IAAM,EAGlE,GAAI,CAEF,IAAMM,EAAUF,EAAiB,MAAML,EAAM,OAAQD,EAAU,OAASE,EAAI,MAAM,EAAE,KAAK,EACzFG,KAAkB,WAAOG,CAAO,CAClC,OAASD,EAAP,CACA,MAAM,IAAI,MAAM,4EAA4E,CAC9F,CAEA,GAAI,CACFJ,EAAQ,aAAaE,CAAe,CACtC,OAASE,EAAP,CACA,MAAM,IAAI,MAAM,4EAA4E,CAC9F,CACF,OAASA,EAAP,CACA,MAAM,IAAIE,EACR,CACE,IAAKJ,EACL,OAAQL,CACV,EACAO,EAAM,OACR,CACF,CACA,MAAO,EACT,EGxCO,IAAMG,GAAN,cAAmDC,CAAiB,CAIzE,YAAYC,EAAqBC,EAAiB,CAChD,MAAMA,CAAO,EACb,KAAK,UAAYD,CACnB,CACF,EAEaE,GAAN,cAA8CH,CAAiB,CAIpE,YAAYI,EAAeF,EAAiB,CAC1C,MAAMA,CAAO,EACb,KAAK,SAAWE,CAClB,CACF,EAKMC,GAAN,KAAgB,CAAhB,cAGE,KAAU,OAAqB,CAAC,EAEhC,WAAW,0BAAmC,CAC5C,MAAO,EACT,CASM,OAAOC,EAA0BC,EAAiD,QAAAC,EAAA,sBACtF,GAAI,CAACF,EAAiB,WAAW,IAAI,EACnC,MAAM,IAAIG,EAAsBH,EAAkB,oDAAoD,EAYxG,GATAC,EAAY,IAAIG,GAAc,CAC5B,GAAI,CAAC,OAAO,UAAUA,CAAU,EAC9B,MAAM,IAAIP,GACRO,EACA,kCAAkCA,GACpC,CAEJ,CAAC,EAEG,CAACC,GAAuBJ,EAAY,MAAM,EAC5C,MAAM,IAAIR,GACRQ,EACA,4EACF,EAGF,IAAMK,EAAM,CAAC,EACPC,EAAM,CAAC,EAERC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAG9B,KAAK,WAAaA,EAAI,6BAA6BR,EAAiB,QAAQ,KAAM,EAAE,CAAC,EACrF,KAAK,UAAY,KAAK,WAAW,aAAa,EAE9CM,EAAI,KAAK,KAAK,UAAU,EACxBC,EAAI,KAAK,KAAK,SAAS,EAEvB,IAAME,GAAKR,EAAY,OAAS,GAAK,EAErC,QAASS,EAAI,EAAGA,EAAIT,EAAY,OAASQ,EAAGC,GAAK,EAAG,CAClD,IAAMC,EAAoB,IAAIH,EAAI,UAClCG,EAAG,YAAY,EACfL,EAAI,KAAKK,CAAE,EACX,IAAMC,EAAKD,EAAG,aAAa,EAC3BJ,EAAI,KAAKK,CAAE,CACb,CAGA,QAAWR,KAAcH,EAAa,CACpC,IAAMY,EAAK,IAAIL,EAAI,GACnBK,EAAG,OAAOT,CAAU,EACpB,IAAMU,EAAiB,IAAIN,EAAI,UAC/BM,EAAe,MAAMR,EAAKO,CAAE,EAE5B,IAAME,EAAiB,IAAIP,EAAI,UAC/BO,EAAe,MAAMR,EAAKM,CAAE,EAE5B,KAAK,OAAO,KAAK,CACf,WAAY,KAAKC,EAAe,kBAAkB,IAClD,UAAW,KAAKC,EAAe,kBAAkB,IACjD,GAAAF,CACF,CAAC,CACH,CAQA,MANkC,CAChC,WAAY,KAAK,KAAK,WAAW,kBAAkB,IACnD,UAAW,KAAK,KAAK,UAAU,kBAAkB,IACjD,OAAQ,KAAK,MACf,CAGF,GACF,EAEOG,EAAQjB,GClIf,IAAAkB,GAAmB,qBACnBC,GAA2B,qBAC3BC,GAAmB,gCACnBC,GAAkC,2BAiDlC,IAAMC,GAAN,KAAuB,CASrB,YAAYC,EAAmB,CAP/B,KAAQ,WAAa,GAQnB,GAAI,CAACA,EACH,MAAM,IAAIC,EAAwBD,EAAc,yCAAyC,EAO3F,GALI,OAAOA,GAAiB,SAC1B,KAAK,aAAe,KAAK,MAAMA,CAAY,EAE3C,KAAK,aAAeA,EAElB,CAAC,KAAK,aAAa,QACrB,MAAM,IAAIE,EAAqB,KAAK,aAAc,uBAAuB,CAE7E,CAEA,cAAuB,CA3EzB,IAAAC,EA4EI,GAAI,KAAK,aACP,QAAQA,EAAA,KAAK,aAAa,UAAlB,KAAAA,EAA6B,KAAK,aAAa,aAChD,GACH,OAAO,KAAK,aAAa,YACtB,GACH,OAAO,KAAK,aAAa,OACtB,GACH,OAAO,KAAK,aAAa,OAG/B,MAAO,EACT,CAMM,cAAcC,EAAW,GAAqB,QAAAC,EAAA,sBAElD,GAAI,KAAK,WAAY,OAAO,KAAK,WACjC,OAAQ,KAAK,aAAa,aACnB,GACH,KAAK,OAAS,MAAM,GAAAC,QAAO,OAAO,KAAK,aAAcF,CAAQ,EAC7D,UACG,GACH,KAAK,OAAS,MAAM,GAAAE,QAAO,OAAO,KAAK,aAAcF,EAAU,EAAI,EACnE,UACG,GACH,KAAK,OAAS,MAAM,KAAK,OAAO,KAAK,aAAcA,CAAQ,EAC3D,MAEJ,GAAI,KAAK,SACP,KAAK,WAAa,KAAK,OAAO,cAAc,EAAE,SAAS,KAAK,EACxD,CAAC,KAAK,YACR,MAAM,IAAIG,EAAsB,kBAAkB,EAGtD,OAAO,KAAK,UACd,GAQa,OACXC,EACAJ,EACiB,QAAAC,EAAA,sBACjB,IAAMI,EAAmB,OAAOD,GAAU,SAAWA,EAAQ,KAAK,MAAMA,CAAK,EAE7E,GAAIC,EAAK,UAAY,EACnB,MAAM,IAAIC,EAAoB,iBAAiB,EAGjD,IAAIC,EACAC,EACJ,GAAIH,EAAK,OAAO,IAAI,WAAa,SAC/BG,EAAYH,EAAK,OAAO,IAAI,OAC5BE,KAAa,eACX,OAAO,KAAKP,CAAQ,EACpB,OAAO,KAAKQ,EAAU,KAAM,KAAK,EACjCA,EAAU,EACVA,EAAU,EACVA,EAAU,EACVA,EAAU,KACZ,UACSH,EAAK,OAAO,IAAI,WAAa,SAAU,CAGhD,GAFAG,EAAYH,EAAK,OAAO,IAAI,OAExBG,EAAU,MAAQ,cACpB,MAAM,IAAIF,EAAoB,kCAAkC,EAGlEC,EAAa,GAAAE,QAAO,WAClB,OAAO,KAAKT,CAAQ,EACpB,OAAO,KAAKQ,EAAU,KAAM,KAAK,EACjCA,EAAU,EACVA,EAAU,MACV,QACF,CACF,KACE,OAAM,IAAIF,EAAoB,mCAAmC,EAGnE,IAAMI,EAAa,OAAO,KAAKL,EAAK,OAAO,OAAO,QAAS,KAAK,EAC1DM,EAAiB,OAAO,OAAO,CAAC,OAAO,KAAKJ,EAAW,MAAM,GAAI,EAAE,CAAC,EAAGG,CAAU,CAAC,EAKlFE,EAJqC,CACzC,uBACA,gBACF,EACwCP,EAAK,OAAO,SAAS,UAE7D,GADoBO,EAAaD,CAAc,EACvC,SAAS,KAAK,IAAMN,EAAK,OAAO,SAAS,QAC/C,MAAM,IAAIC,EAAoB,kBAAkB,EAGlD,IAAMO,EAAW,GAAAJ,QAAO,iBACtBJ,EAAK,OAAO,OAAO,SACnBE,EAAW,MAAM,EAAG,EAAE,EACtB,OAAO,KAAKF,EAAK,OAAO,OAAO,OAAO,GAAI,KAAK,CACjD,EACMS,EAAe,KAAK,gBAAgBD,EAAUH,CAAU,EAC9D,OAAO,IAAI,GAAAR,QAAOY,CAAI,CACxB,GAMU,gBAAgBC,EAAyCC,EAAsB,CACvF,OAAO,OAAO,OAAO,CAACD,EAAO,OAAOC,CAAI,EAAGD,EAAO,MAAM,CAAC,CAAC,CAC5D,CAMA,OAAO,YAAYE,EAA+B,CAChD,OAAO,MAAM,KAAKA,EAAYC,GAEpB,KAAKA,EAAO,KAAM,SAAS,EAAE,IAAK,MAAM,EAAE,CACnD,EAAE,KAAK,EAAE,CACZ,CACF,EAEOC,EAAQxB,GC9Lf,IAAqByB,EAArB,KAAgC,CAK9B,YAAYC,EAA8BC,EAAmB,CAC3D,KAAK,mBAAqB,CAAC,GAAGD,CAAkB,EAChD,KAAK,OAASC,CAChB,CAEA,SAA0B,CACxB,IAAMC,EAAkC,CAAC,EACzC,OAAW,CAACC,EAAKC,CAAiB,IAAK,KAAK,mBAAmB,QAAQ,EAAG,CACxEC,EAA2BD,CAAiB,EAC5C,IAAME,EAAY,IAAIC,EAAU,CAAC,CAAC,EAClCD,EAAU,aAAaF,CAAiB,EACxC,IAAMI,EAAsBF,EAAU,QAAQ,KAAK,OAAOH,GAAK,UAAU,EACzE,GAAI,CAACK,EACH,MAAM,IAAIC,EACR,CACE,IAAKL,EACL,OAAQI,CACV,EACA,gCACF,EAEF,IAAME,EAA+B,CACjC,kBAAAN,EACA,WAAYI,EACZ,UAAW,KAAK,OAAOL,GAAK,SAChC,EACAD,EAAgB,KAAKQ,CAAc,CACrC,CACA,OAAOR,CACT,CACF,EChDA,IAAAS,EAAqE,2BCArE,IAAAC,GAKO,2BAIA,IAAMC,EAAN,KAA8E,CACnF,SAASC,EAAoB,CAC3B,IAAMC,EAAc,IAAI,IAAOC,EAAqB,IAAI,IACxD,QAAWC,KAAYH,GAAiB,CAAC,EAAG,CAC1C,GAAIC,EAAY,IAAIE,EAAS,EAAE,EAC7B,MAAM,IAAIC,EAA0BD,EAAU,oBAAoBA,EAAS,+BAA+B,EAI5G,GAFAF,EAAY,IAAIE,EAAS,EAAE,EAEvBD,EAAmB,IAAIC,EAAS,WAAW,EAC7C,MAAM,IAAIE,GAAiCF,EAAU,kCAAkCA,EAAS,8BAA8B,EAEhID,EAAmB,IAAIC,EAAS,WAAW,CAC7C,CACA,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,kDACT,CACF,EApBaJ,EAANO,EAAA,IADN,wBAAoB,CAAE,KAAM,aAAc,MAAO,EAAM,CAAC,GAC5CP,GAsBN,SAASQ,GAAsBC,EAAuC,CAC3E,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWT,CACb,CAAC,CACH,CACF,CCxCA,IAAAY,GAKO,2BCLA,IAAMC,GAAN,cAAkCC,CAAiB,CAGxD,YAAYC,EAAmBC,EAAiB,CAC9C,MAAMA,CAAO,EACb,KAAK,UAAYD,CACnB,CACF,EAEaE,GAAN,cAA2CH,CAAiB,CAGjE,YAAYI,EAAcF,EAAiB,CACzC,MAAMA,CAAO,EACb,KAAK,KAAOE,CACd,CACF,EDNO,IAAMC,EAAN,KAA2E,CAC1E,SAASC,EAAY,QAAAC,EAAA,sBACzB,GAAI,CACE,OAAOD,GAAU,SACnBE,EAAI,6BAA6BF,EAAM,QAAQ,KAAM,EAAE,CAAC,EAExDA,EAAM,QAASG,GAAiBD,EAAI,6BAA6BC,EAAK,QAAQ,KAAM,EAAE,CAAC,CAAC,CAE5F,OAAS,EAAP,CACA,MAAM,IAAIC,GAAqBJ,EAAO,gDAAgD,CACxF,CACA,MAAO,EACT,GAEA,gBAAiB,CACf,MAAO,oBACT,CACF,EAjBaD,EAANM,EAAA,IADN,wBAAoB,CAAE,KAAM,YAAa,MAAO,EAAK,CAAC,GAC1CN,GAmBN,SAASO,EAAmBC,EAAuC,CACxE,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWR,CACb,CAAC,CACH,CACF,CExCA,IAAAW,GAKO,2BCLP,IAAAC,GAAiB,mBACjBC,GAAwB,qBACxBC,GAAyB,8BAKlB,IAAMC,EAAO,IAAI,GAAAC,QAgDjB,IAAMC,GAAmBC,GAA6B,CAC3D,IAAMC,EAAa,IAAI,WAAWD,EAAO,IAAIE,GAAQ,CAAC,GAAU,SAAM,SAASA,CAAI,CAAC,CAAC,EAAE,KAAK,CAAC,EAC7F,OAAO,OAAO,KAAKD,CAAU,CAC/B,EAaaE,GAAiB,CAAMC,EAAoBC,IAA2CC,EAAA,wBAC5FC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAG9B,IAAMC,EAAaD,EAAI,6BAA6BF,EAAc,QAAQ,KAAM,EAAE,CAAC,EAE7EI,EAAsB,aAAU,OAAO,KAAKL,CAAU,CAAC,EAG7D,MAAO,KAFWI,EAAW,KAAK,IAAI,WAAWC,CAAW,CAAC,EAC9B,kBAAkB,GAEnD,GAcaC,GAAoB,CAAMC,EAAoBC,EAAsBC,IAAqCP,EAAA,wBAC/GC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAG9B,IAAMO,EAAeP,EAAI,6BAA6BM,EAAU,QAAQ,KAAM,EAAE,CAAC,EAC3EE,EAAYR,EAAI,6BAA6BK,EAAa,QAAQ,KAAM,EAAE,CAAC,EAE3EH,EAAsB,aAAU,OAAO,KAAKE,CAAU,CAAC,EAE7D,GAAI,CAACG,EAAa,OAAOC,EAAW,IAAI,WAAWN,CAAW,CAAC,EAC7D,MAAM,IAAIO,GAA6BJ,EAAc,oCAAoC,CAE7F,GAEaK,GAA2BT,GAAwCF,EAAA,wBAC9E,OAAKC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAEvB,KAAKA,EAAI,6BAA6BC,EAAW,QAAQ,KAAM,EAAE,CAAC,EAAE,aAAa,EAAE,kBAAkB,GAC9G,GDxGO,IAAMU,EAAN,KAA8E,CACnF,SAASC,EAAY,CACnB,GAAI,CACSC,EAAK,MAAM,kBAAkBD,CAAK,CAC/C,OAAQ,EAAN,CACA,MAAM,IAAIE,EAAwBF,EAAO,+CAA+C,CAC1F,CACA,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,uBACT,CACF,EAbaD,EAANI,EAAA,IADN,wBAAoB,CAAE,KAAM,eAAgB,MAAO,EAAM,CAAC,GAC9CJ,GAeN,SAASK,GAAsBC,EAAuC,CAC3E,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWN,CACb,CAAC,CACH,CACF,CErCA,IAAAS,GAKO,2BAMA,IAAMC,EAAN,KAA4E,CACjF,SAASC,EAAY,CACnB,GAAI,CAAC,OAAO,UAAUA,CAAK,GAAKA,EAAQ,EACtC,MAAM,IAAIC,EAAsBD,EAAO,qCAAqC,EAE9E,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,qBACT,CACF,EAXaD,EAANG,EAAA,IADN,wBAAoB,CAAE,KAAM,aAAc,MAAO,EAAM,CAAC,GAC5CH,GAaN,SAASI,GAAoBC,EAAuC,CACzE,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWL,CACb,CAAC,CACH,CACF,CClCA,IAAAQ,GAMO,2BAIA,IAAMC,GAAN,KAA6E,CAClF,SAASC,EAAYC,EAA2B,CAC9C,GAAM,CAACC,EAAqBC,CAAW,EAAIF,EAAK,YAC1CG,EAAiBH,EAAK,OAAeC,GAAqB,OAChE,GAAI,CAAC,MAAM,QAAQF,CAAK,EACtB,OAAO,OAAOA,CAAK,EAAE,QAASK,GAAa,CACzC,GAAID,IAAkBC,EAAI,OACxB,MAAM,IAAIC,EAA8BL,EAAK,OAAeC,GAAsBF,EAAOG,EAAY,OAAO,CAEhH,CAAC,UAEGC,IAAkBJ,EAAM,OAC1B,MAAM,IAAIM,EAA8BL,EAAK,OAAeC,GAAsBF,EAAOG,EAAY,OAAO,EAGhH,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,+CACT,CACF,EArBaJ,GAANQ,EAAA,IADN,wBAAoB,CAAE,KAAM,cAAe,MAAO,EAAM,CAAC,GAC7CR,ICVb,IAAAS,GAKO,2BAIA,IAAMC,EAAN,KAAkF,CACvF,SAASC,EAAY,CACnB,OAAOC,EAA2BD,CAAK,CACzC,CAEA,gBAAiB,CACf,MAAO,6BACT,CACF,EARaD,EAANG,EAAA,IADN,wBAAoB,CAAE,KAAM,cAAe,MAAO,EAAM,CAAC,GAC7CH,GAUN,SAASI,GAA0BC,EAAuC,CAC/E,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWL,CACb,CAAC,CACH,CACF,CRxBO,IAAMQ,EAAN,KAA4C,CAYjD,YAAYC,EAAiB,CAC3B,KAAK,GAAKA,EAAK,GACf,KAAK,YAAcA,EAAK,YACxB,KAAK,SAAS,CAChB,CAKA,UAAiB,IACf,gBAAa,IAAI,CACnB,CACF,EApBSC,EAAA,IAHN,cAAW,CAAE,QAAS,yBAAyB,CAAC,KAChD,aAAU,CAAE,QAAS,8BAA8B,CAAC,KACpD,SAAM,CAAE,QAAS,oCAAoC,CAAC,GAH5CF,EAIJ,kBAMAE,EAAA,IAJN,cAAW,CAAE,QAAS,iCAAiC,CAAC,KACxD,aAAU,CAAE,QAAS,sCAAsC,CAAC,KAC5D,YAAS,CAAE,QAAS,0CAA0C,CAAC,EAC/DC,GAA0B,GAThBH,EAUJ,2BSNF,IAAMI,EAAsBC,GAA2C,CAE5E,IAAMC,EAAMD,EAAU,IAAIE,GAAMA,EAAG,EAAE,EAC/BC,EAAeH,EAAU,IAAIE,GAAMA,EAAG,WAAW,EAGjDE,EAAqBJ,EAAU,IAAKK,GAAkB,CAC1D,IAAMC,EAAK,SAASD,EAAS,GAAI,EAAE,EACnC,GAAI,MAAMC,CAAE,EACV,MAAM,IAAIC,EAA6BN,EAAKE,EAAc,wBAAwBE,EAAS,IAAI,EAEjG,GAAI,CAACA,EAAS,YACZ,MAAM,IAAIE,EAA6BN,EAAKE,EAAc,4CAA4CG,GAAI,EAE5G,OAAOE,GAAAC,GAAA,GAAKJ,GAAL,CAAe,GAAAC,CAAG,EAC3B,CAAC,EAGD,OAAAF,EAAmB,KAAK,CAACM,EAAGC,IAAMD,EAAE,GAAKC,EAAE,EAAE,EAGtCP,EAAmB,IAAIC,GAAY,IAAIO,EAAaP,CAAQ,CAAC,CACtE,ECVO,IAAMQ,EAAN,KAAc,CAWb,YAAYC,EAAcC,EAA0C,QAAAC,EAAA,sBACxE,IAAMC,EAAa,MAAM,IAAIC,EAAiBJ,CAAI,EAAE,cAAcC,CAAQ,EAC1E,OAAKI,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAEvB,CACL,WAAY,KAAKF,IACjB,UAAW,KAAKE,EAAI,6BAA6BF,CAAU,EAAE,aAAa,EAAE,kBAAkB,GAChG,CACF,GAOM,gBAAgBA,EAAoBG,EAAkD,QAAAJ,EAAA,sBAC1F,IAAMK,EAAkBC,EAAmBF,CAAS,EACpD,YAAK,UAAY,MAAM,IAAIG,EAAU,EAAE,OAAON,EAAYI,EAAgB,IAAIG,GAAQA,EAAK,EAAE,CAAC,EACvF,KAAK,SACd,GAOM,cAAcJ,EAAwBK,EAA4C,QAAAT,EAAA,sBAEtF,IAAMU,EADkBJ,EAAmBF,CAAS,EACF,IAAII,GAAQ,OAAO,KAAKA,EAAK,YAAa,QAAQ,EAAE,SAAS,CAAC,EAChH,OAAO,IAAIG,EAAWD,EAA2BD,CAAM,EAAE,QAAQ,CACnE,GAOM,YAAYR,EAAoBG,EAAiD,QAAAJ,EAAA,sBACrF,IAAMY,EAAY,MAAM,KAAK,gBAAgBX,EAAYG,CAAS,EAClE,OAAO,KAAK,cAAcA,EAAWQ,EAAU,MAAM,CACvD,GAKA,cAAgB,CACd,OAAO,KAAK,SACd,CACF,EA5Daf,EACJ,kBAAoB,MCtB7B,IAAAgB,EAAwB,qBAExB,IAAAC,EAIO,2BCNP,IAAAC,EAAqF,2BAM9E,IAAMC,EAAN,KAA8C,CAA9C,cAIL,KAAO,WAA6B,KAKpC,KAAO,aAA+B,KAMtC,KAAO,UAA4B,KAKnC,KAAO,UAAoC,KAE3C,OAAOC,EAA+B,CAChCA,EAAK,eACP,KAAK,aAAeA,EAAK,cAEvB,OAAOA,EAAK,YAAe,WAC7B,KAAK,WAAaA,EAAK,YAErBA,EAAK,YACP,KAAK,UAAYA,EAAK,WAEpBA,EAAK,YACP,KAAK,UAAYC,EAAmBD,EAAK,SAAS,EAEtD,CAKM,UAAyB,QAAAE,EAAA,yBAC7B,gBAAa,IAAI,CACnB,GAKA,IAAI,aAAwB,CArD9B,IAAAC,EAsDI,OAAKA,EAAA,KAAK,YAAL,MAAAA,EAAgB,OAGd,KAAK,UAAU,IAAIC,GAAY,SAAS,OAAOA,EAAS,EAAE,EAAG,EAAE,CAAC,EAF9D,CAAC,CAGZ,CAKA,IAAI,oBAA+B,CA/DrC,IAAAD,EAgEI,OAAKA,EAAA,KAAK,YAAL,MAAAA,EAAgB,OAGd,KAAK,UAAU,IAAIC,GAAY,OAAOA,EAAS,WAAW,CAAC,EAFzD,CAAC,CAGZ,CACF,EA3DSC,EAAA,IAHN,cAAW,KACX,YAAS,EACTC,GAAoB,GAHVP,EAIJ,0BAKAM,EAAA,IAHN,cAAW,KACX,YAAS,EACTE,GAAsB,GARZR,EASJ,4BAMAM,EAAA,IAJN,cAAW,KACX,YAAS,KACT,UAAO,GAAI,EAAE,EACbG,EAAmB,GAdTT,EAeJ,yBAKAM,EAAA,IAHN,cAAW,KACX,kBAAe,CAAE,KAAM,EAAK,CAAC,EAC7BI,GAAsB,GAnBZV,EAoBJ,yBCxBT,IAAAW,EAAyD,2BASlD,IAAMC,EAAN,KAAoD,CAkBjD,eAAeC,EAAsBC,EAAuB,CAClE,IAAMC,EAAkB,CAAC,GAAGD,CAAW,EAAE,IAAIE,GAAS,KAAO,OAAO,KAAKA,EAAM,QAAQ,EAAE,SAAS,KAAK,CAAE,EAEzG,MAAO,KADsBC,GAAgB,CAAC,GAAGJ,EAAY,GAAGE,CAAe,CAAC,EAC1D,SAAS,KAAK,GACtC,CAMA,OAAOG,EAAwC,CAC7C,KAAK,UAAYA,EAAK,UACtB,KAAK,WAAaA,EAAK,WACvB,KAAK,YAAcA,EAAK,YACxB,KAAK,SAAS,CAChB,CAMA,UAAgB,IACd,gBAAa,IAAI,CACnB,CAOA,MAAMA,EAA6B,CACjC,YAAK,UAAYA,EAAK,UACtB,KAAK,YAAcA,EAAK,YACxB,KAAK,WAAa,KAAK,eACrBA,EAAK,gBAAgB,IAAKC,GAAwBA,EAAM,SAAS,EACjED,EAAK,gBAAgB,IAAKC,GAAwBA,EAAM,UAAU,CACpE,EAEO,IACT,CACF,EAxDSC,EAAA,IADN,YAAS,GADCR,EAEJ,0BAKAQ,EAAA,IAHN,YAAS,KACT,UAAO,GAAI,EAAE,EACbC,EAAmB,GANTT,EAOJ,yBAGAQ,EAAA,IADN,YAAS,CAAC,EAAG,CAAE,KAAM,EAAK,CAAC,GATjBR,EAUJ,2BFcT,IAAMU,GAAmB,IACnBC,GAAoB,GAKbC,GAAN,KAAoB,CASzB,aAAc,CACZ,KAAK,KAAO,IAAIC,EAChB,KAAK,QAAU,IAAIC,CACrB,CAQM,aAAaC,EAAiCC,EAA0D,QAAAC,EAAA,sBAC5G,GAAM,CACJ,aAAAC,EACA,WAAAC,EACA,WAAAC,CACF,EAAIJ,EAEJ,GAAI,CAAC,OAAO,UAAUG,CAAU,GAAKA,EAAa,EAChD,MAAM,IAAIE,EAAsBF,EAAY,qCAAqC,EAGnF,IAAIG,EACJ,GAAI,CACFA,EAAqBC,EAAK,MAAM,kBAAkBL,CAAY,CAChE,OAAQM,EAAN,CACA,MAAM,IAAIC,EAAwBP,EAAc,+CAA+C,CACjG,CAEA,IAAMQ,EAAU,KAAK,QAAQ,MAAM,CACjC,UAAWX,EAAS,UACpB,YAAaY,EAAmBZ,EAAS,SAAS,EAAE,IAAIa,GAAYA,EAAS,EAAE,EAC/E,gBAAiBb,EAAS,eAC5B,CAAC,EAEKc,EAAY,MAAiBC,GAAe,GAAGR,KAAWH,IAAcC,CAAU,EAClFW,EAA6BC,GAAgB,CAACH,EAAWH,EAAQ,UAAU,CAAC,EAElF,OAAAA,EAAQ,WAAa,KAAKK,EAAgB,SAAS,KAAK,IAGxD,MAAM,KAAK,qBAAqBL,EAAQ,WAAY,CAClD,aAAAR,EACA,WAAAC,EACA,UAAW,MAAiBc,GAAmBb,CAAU,CAC3D,CAAC,EAEMM,CACT,GAGM,qBAAqBQ,EAAgBC,EAA+D,QAAAlB,EAAA,sBACxG,GAAM,CAAE,aAAAC,EAAc,WAAAC,EAAY,UAAAiB,CAAU,EAAID,EAEhD,GAAI,CAAC,OAAO,UAAUhB,CAAU,GAAKA,EAAa,EAChD,MAAM,IAAIE,EAAsBF,EAAY,qCAAqC,EAGnF,IAAMG,EAAqBC,EAAK,MAAM,kBAAkBL,CAAY,EAC9DmB,EAAcH,EAAO,QAAQ,KAAM,EAAE,EAAE,UAAU,EAAGxB,EAAgB,EAE1E,MAAiB4B,GAAkB,GAAGhB,KAAWH,IAAc,KAAKkB,IAAeD,CAAS,CAC9F,GAOA,qBAAqBG,EAAeC,EAA4B,CAE9D,GAAI,CAACD,EAAM,WAAW,IAAI,GAAK,CAAC,sBAAsB,KAAKA,CAAK,EAC9D,MAAM,IAAIE,EAAiB,4BAA4B,EAIzD,GAAID,GAAiB,GAAK,CAAC,OAAO,UAAUA,CAAa,EACvD,MAAM,IAAIC,EAAiB,wBAAwB,EAKrD,IAAMC,EAFWH,EAAM,QAAQ,KAAM,EAAE,EAAE,UAAU7B,EAAgB,EAE1C,UAAU,EAAG8B,EAAgB7B,EAAiB,EACjEgC,EAAiB,QAAM,SAAS,KAAOD,CAAO,EAC9CE,EAAmB,KAAK,WAAWJ,EAAeG,CAAO,EAC5D,IAAIE,GAAe,QAAM,QAAQA,CAAI,CAAC,EAEnCC,EAASP,EAAM,UAAUC,EAAgB7B,EAAiB,EAC1DoC,EAAgB,QAAM,SAAS,KAAOD,CAAM,EAC5CE,EAAgB,KAAK,WAAWR,EAAeO,CAAM,EAAE,IAAIF,GAC/D,OAAO,KAAY,QAAM,QAAQA,CAAI,EAAE,QAAQ,KAAM,EAAE,EAAG,KAAK,EAAE,SAC/D,QACF,CACF,EAEA,MAAO,CAAE,iBAAAD,EAAkB,cAAAI,CAAc,CAC3C,CAOA,OAAOC,EAAqC,CAC1C,KAAK,KAAK,OAAOA,CAAI,EACrB,KAAK,SAAS,CAChB,CAKA,UAAgB,IACd,gBAAa,IAAI,CACnB,CAKA,QAAiB,CACf,OAAO,KAAK,UAAU,CACpB,KAAM,KAAK,MAAQ,KACnB,QAAS,KAAK,SAAW,IAC3B,EAAG,KAAM,CAAC,CACZ,CAEQ,WAAWC,EAAeC,EAAiB,CACjD,IAAMC,EAAa,KAAK,MAAMD,EAAI,OAASD,CAAK,EAC1CG,EAAW,CAAC,EAClB,QAASC,EAAI,EAAGA,EAAIJ,EAAOI,IAAK,CAC9B,IAAMC,EAAQD,EAAIF,EACZI,EAAMD,EAAQH,EACpBC,EAAS,KAAKF,EAAI,MAAMI,EAAOC,CAAG,CAAC,CACrC,CACA,OAAOH,CACT,CAKA,OAAa,SAASI,EAA+C,QAAAxC,EAAA,sBACnE,IAAMyC,EAAO,OAAOD,GAAY,SAAW,KAAK,MAAMA,CAAO,EAAIA,EAC3DE,EAAW,IAAI/C,GACrB,OAAA+C,EAAS,KAAK,OAAOD,EAAK,IAAI,EAC9BC,EAAS,QAAQ,OAAOD,EAAK,OAAO,EACpCC,EAAS,SAAS,EAElB,MAAMA,EAAS,qBAAqBA,EAAS,QAAQ,WAAY,CAC/D,aAAcA,EAAS,KAAK,aAC5B,WAAYA,EAAS,KAAK,WAC1B,UAAWA,EAAS,KAAK,SAC3B,CAAC,EAEMA,CACT,GACF,EAnKaC,EAANhD,GAGEiD,EAAA,IAFN,cAAW,KACX,kBAAe,GAFLD,EAGJ,oBAIAC,EAAA,IAFN,cAAW,KACX,kBAAe,GANLD,EAOJ,uBGhDT,IAAAE,GAAmB,wuFAGnB,IAAAC,EAAyD,2BAQlD,IAAMC,GAAN,KAAgB,CAKrB,YAAYC,EAA0B,CAAC,EAAG,CACxC,KAAK,OAAS,CAAC,GAAGA,CAAM,CAC1B,CAMA,IAAIC,EAAoC,CACtC,KAAK,OAAO,KAAKA,CAAa,CAChC,CAEA,MAAwB,CACtB,OAAO,KAAK,MACd,CAMA,UAAgB,IACd,gBAAa,IAAI,CACnB,CAMA,QAAiB,CACf,OAAO,KAAK,UAAU,CACpB,QAAS,IAAIC,GAAI,UACjB,UAAW,IAAI,KAAK,EAAE,YAAY,EAClC,OAAQ,KAAK,OAAO,OAAS,EAAI,KAAK,OAAS,IACjD,EAAG,KAAM,CAAC,CACZ,CAQA,OAAa,SAASC,EAA2C,QAAAC,EAAA,sBAC/D,IAAMC,EAAO,OAAOF,GAAY,SAAW,KAAK,MAAMA,CAAO,EAAIA,EAC3DG,EAAa,GAAAC,QAAO,MAAMF,EAAK,OAAO,EACtCG,EAAiB,GAAAD,QAAO,MAAML,GAAI,OAAO,EAE/C,GAAI,CAACI,GAAc,CAACE,EAClB,MAAM,IAAIC,EAAiB,0EAA0E,EAGvG,GAAI,CAACH,GAAeE,EAAe,QAAUF,EAAW,OAAWE,EAAe,QAAUF,EAAW,MACrG,MAAM,IAAIG,EAAiB,mFAAmFP,GAAI,mCAAmC,EAGvJ,IAAMQ,EAAW,IAAIX,GAGrB,GAFAW,EAAS,OAAS,CAAC,EAEf,MAAM,QAAQL,EAAK,MAAM,EAE3B,QAAWM,KAAQN,EAAK,OACtBK,EAAS,OAAO,KAAK,MAAME,EAAc,SAASD,CAAI,CAAC,OAIzDD,EAAS,OAAO,KAAK,MAAME,EAAc,SAASP,CAAI,CAAC,EAGzD,OAAOK,CACT,GACF,EA3EaG,EAANd,GAGGe,EAAA,IAFP,cAAW,KACX,kBAAe,CAAE,KAAM,EAAK,CAAC,GAFnBD,EAGH",
+  "sourcesContent": ["const window = global;(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}g.JSEncrypt = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){\n\nconst JSEncrypt = require('jsencrypt');\n\nmodule.exports = JSEncrypt;\n\n},{\"jsencrypt\":2}],2:[function(require,module,exports){\n/*\n * ATTENTION: The \"eval\" devtool has been used (maybe by default in mode: \"development\").\n * This devtool is neither made for production nor for readable output files.\n * It uses \"eval()\" calls to create a separate source file in the browser devtools.\n * If you are trying to read the output file, select a different devtool (https://webpack.js.org/configuration/devtool/)\n * or disable the default devtool with \"devtool: false\".\n * If you are looking for production-ready output files, see mode: \"production\" (https://webpack.js.org/configuration/mode/).\n */\n(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"JSEncrypt\"] = factory();\n\telse\n\t\troot[\"JSEncrypt\"] = factory();\n})(window, function() {\nreturn /******/ (() => { // webpackBootstrap\n/******/ \t\"use strict\";\n/******/ \tvar __webpack_modules__ = ({\n\n/***/ \"./lib/JSEncrypt.js\":\n/*!**************************!*\\\n  !*** ./lib/JSEncrypt.js ***!\n  \\**************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"JSEncrypt\\\": () => (/* binding */ JSEncrypt)\\n/* harmony export */ });\\n/* harmony import */ var _lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./lib/jsbn/base64 */ \\\"./lib/lib/jsbn/base64.js\\\");\\n/* harmony import */ var _JSEncryptRSAKey__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./JSEncryptRSAKey */ \\\"./lib/JSEncryptRSAKey.js\\\");\\n/* harmony import */ var _version_json__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./version.json */ \\\"./lib/version.json\\\");\\n\\n\\n\\n/**\\n *\\n * @param {Object} [options = {}] - An object to customize JSEncrypt behaviour\\n * possible parameters are:\\n * - default_key_size        {number}  default: 1024 the key size in bit\\n * - default_public_exponent {string}  default: '010001' the hexadecimal representation of the public exponent\\n * - log                     {boolean} default: false whether log warn/error or not\\n * @constructor\\n */\\nvar JSEncrypt = /** @class */ (function () {\\n    function JSEncrypt(options) {\\n        if (options === void 0) { options = {}; }\\n        options = options || {};\\n        this.default_key_size = options.default_key_size ? parseInt(options.default_key_size, 10) : 1024;\\n        this.default_public_exponent = options.default_public_exponent || \\\"010001\\\"; // 65537 default openssl public exponent for rsa key type\\n        this.log = options.log || false;\\n        // The private and public key.\\n        this.key = null;\\n    }\\n    /**\\n     * Method to set the rsa key parameter (one method is enough to set both the public\\n     * and the private key, since the private key contains the public key paramenters)\\n     * Log a warning if logs are enabled\\n     * @param {Object|string} key the pem encoded string or an object (with or without header/footer)\\n     * @public\\n     */\\n    JSEncrypt.prototype.setKey = function (key) {\\n        if (this.log && this.key) {\\n            console.warn(\\\"A key was already set, overriding existing.\\\");\\n        }\\n        this.key = new _JSEncryptRSAKey__WEBPACK_IMPORTED_MODULE_1__.JSEncryptRSAKey(key);\\n    };\\n    /**\\n     * Proxy method for setKey, for api compatibility\\n     * @see setKey\\n     * @public\\n     */\\n    JSEncrypt.prototype.setPrivateKey = function (privkey) {\\n        // Create the key.\\n        this.setKey(privkey);\\n    };\\n    /**\\n     * Proxy method for setKey, for api compatibility\\n     * @see setKey\\n     * @public\\n     */\\n    JSEncrypt.prototype.setPublicKey = function (pubkey) {\\n        // Sets the public key.\\n        this.setKey(pubkey);\\n    };\\n    /**\\n     * Proxy method for RSAKey object's decrypt, decrypt the string using the private\\n     * components of the rsa key object. Note that if the object was not set will be created\\n     * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor\\n     * @param {string} str base64 encoded crypted string to decrypt\\n     * @return {string} the decrypted string\\n     * @public\\n     */\\n    JSEncrypt.prototype.decrypt = function (str) {\\n        // Return the decrypted string.\\n        try {\\n            return this.getKey().decrypt((0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.b64tohex)(str));\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Proxy method for RSAKey object's encrypt, encrypt the string using the public\\n     * components of the rsa key object. Note that if the object was not set will be created\\n     * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor\\n     * @param {string} str the string to encrypt\\n     * @return {string} the encrypted string encoded in base64\\n     * @public\\n     */\\n    JSEncrypt.prototype.encrypt = function (str) {\\n        // Return the encrypted string.\\n        try {\\n            return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getKey().encrypt(str));\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Proxy method for RSAKey object's sign.\\n     * @param {string} str the string to sign\\n     * @param {function} digestMethod hash method\\n     * @param {string} digestName the name of the hash algorithm\\n     * @return {string} the signature encoded in base64\\n     * @public\\n     */\\n    JSEncrypt.prototype.sign = function (str, digestMethod, digestName) {\\n        // return the RSA signature of 'str' in 'hex' format.\\n        try {\\n            return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getKey().sign(str, digestMethod, digestName));\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Proxy method for RSAKey object's verify.\\n     * @param {string} str the string to verify\\n     * @param {string} signature the signature encoded in base64 to compare the string to\\n     * @param {function} digestMethod hash method\\n     * @return {boolean} whether the data and signature match\\n     * @public\\n     */\\n    JSEncrypt.prototype.verify = function (str, signature, digestMethod) {\\n        // Return the decrypted 'digest' of the signature.\\n        try {\\n            return this.getKey().verify(str, (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.b64tohex)(signature), digestMethod);\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Getter for the current JSEncryptRSAKey object. If it doesn't exists a new object\\n     * will be created and returned\\n     * @param {callback} [cb] the callback to be called if we want the key to be generated\\n     * in an async fashion\\n     * @returns {JSEncryptRSAKey} the JSEncryptRSAKey object\\n     * @public\\n     */\\n    JSEncrypt.prototype.getKey = function (cb) {\\n        // Only create new if it does not exist.\\n        if (!this.key) {\\n            // Get a new private key.\\n            this.key = new _JSEncryptRSAKey__WEBPACK_IMPORTED_MODULE_1__.JSEncryptRSAKey();\\n            if (cb && {}.toString.call(cb) === \\\"[object Function]\\\") {\\n                this.key.generateAsync(this.default_key_size, this.default_public_exponent, cb);\\n                return;\\n            }\\n            // Generate the key.\\n            this.key.generate(this.default_key_size, this.default_public_exponent);\\n        }\\n        return this.key;\\n    };\\n    /**\\n     * Returns the pem encoded representation of the private key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the private key WITH header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPrivateKey = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPrivateKey();\\n    };\\n    /**\\n     * Returns the pem encoded representation of the private key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the private key WITHOUT header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPrivateKeyB64 = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPrivateBaseKeyB64();\\n    };\\n    /**\\n     * Returns the pem encoded representation of the public key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the public key WITH header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPublicKey = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPublicKey();\\n    };\\n    /**\\n     * Returns the pem encoded representation of the public key\\n     * If the key doesn't exists a new key will be created\\n     * @returns {string} pem encoded representation of the public key WITHOUT header and footer\\n     * @public\\n     */\\n    JSEncrypt.prototype.getPublicKeyB64 = function () {\\n        // Return the private representation of this key.\\n        return this.getKey().getPublicBaseKeyB64();\\n    };\\n    JSEncrypt.version = _version_json__WEBPACK_IMPORTED_MODULE_2__.version;\\n    return JSEncrypt;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/JSEncrypt.js?\");\n\n/***/ }),\n\n/***/ \"./lib/JSEncryptRSAKey.js\":\n/*!********************************!*\\\n  !*** ./lib/JSEncryptRSAKey.js ***!\n  \\********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"JSEncryptRSAKey\\\": () => (/* binding */ JSEncryptRSAKey)\\n/* harmony export */ });\\n/* harmony import */ var _lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./lib/jsbn/base64 */ \\\"./lib/lib/jsbn/base64.js\\\");\\n/* harmony import */ var _lib_asn1js_hex__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./lib/asn1js/hex */ \\\"./lib/lib/asn1js/hex.js\\\");\\n/* harmony import */ var _lib_asn1js_base64__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./lib/asn1js/base64 */ \\\"./lib/lib/asn1js/base64.js\\\");\\n/* harmony import */ var _lib_asn1js_asn1__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./lib/asn1js/asn1 */ \\\"./lib/lib/asn1js/asn1.js\\\");\\n/* harmony import */ var _lib_jsbn_rsa__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./lib/jsbn/rsa */ \\\"./lib/lib/jsbn/rsa.js\\\");\\n/* harmony import */ var _lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./lib/jsbn/jsbn */ \\\"./lib/lib/jsbn/jsbn.js\\\");\\n/* harmony import */ var _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./lib/jsrsasign/asn1-1.0 */ \\\"./lib/lib/jsrsasign/asn1-1.0.js\\\");\\nvar __extends = (undefined && undefined.__extends) || (function () {\\n    var extendStatics = function (d, b) {\\n        extendStatics = Object.setPrototypeOf ||\\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\\n        return extendStatics(d, b);\\n    };\\n    return function (d, b) {\\n        if (typeof b !== \\\"function\\\" && b !== null)\\n            throw new TypeError(\\\"Class extends value \\\" + String(b) + \\\" is not a constructor or null\\\");\\n        extendStatics(d, b);\\n        function __() { this.constructor = d; }\\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\\n    };\\n})();\\n\\n\\n\\n\\n\\n\\n\\n/**\\n * Create a new JSEncryptRSAKey that extends Tom Wu's RSA key object.\\n * This object is just a decorator for parsing the key parameter\\n * @param {string|Object} key - The key in string format, or an object containing\\n * the parameters needed to build a RSAKey object.\\n * @constructor\\n */\\nvar JSEncryptRSAKey = /** @class */ (function (_super) {\\n    __extends(JSEncryptRSAKey, _super);\\n    function JSEncryptRSAKey(key) {\\n        var _this = _super.call(this) || this;\\n        // Call the super constructor.\\n        //  RSAKey.call(this);\\n        // If a key key was provided.\\n        if (key) {\\n            // If this is a string...\\n            if (typeof key === \\\"string\\\") {\\n                _this.parseKey(key);\\n            }\\n            else if (JSEncryptRSAKey.hasPrivateKeyProperty(key) ||\\n                JSEncryptRSAKey.hasPublicKeyProperty(key)) {\\n                // Set the values for the key.\\n                _this.parsePropertiesFrom(key);\\n            }\\n        }\\n        return _this;\\n    }\\n    /**\\n     * Method to parse a pem encoded string containing both a public or private key.\\n     * The method will translate the pem encoded string in a der encoded string and\\n     * will parse private key and public key parameters. This method accepts public key\\n     * in the rsaencryption pkcs #1 format (oid: 1.2.840.113549.1.1.1).\\n     *\\n     * @todo Check how many rsa formats use the same format of pkcs #1.\\n     *\\n     * The format is defined as:\\n     * PublicKeyInfo ::= SEQUENCE {\\n     *   algorithm       AlgorithmIdentifier,\\n     *   PublicKey       BIT STRING\\n     * }\\n     * Where AlgorithmIdentifier is:\\n     * AlgorithmIdentifier ::= SEQUENCE {\\n     *   algorithm       OBJECT IDENTIFIER,     the OID of the enc algorithm\\n     *   parameters      ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)\\n     * }\\n     * and PublicKey is a SEQUENCE encapsulated in a BIT STRING\\n     * RSAPublicKey ::= SEQUENCE {\\n     *   modulus           INTEGER,  -- n\\n     *   publicExponent    INTEGER   -- e\\n     * }\\n     * it's possible to examine the structure of the keys obtained from openssl using\\n     * an asn.1 dumper as the one used here to parse the components: http://lapo.it/asn1js/\\n     * @argument {string} pem the pem encoded string, can include the BEGIN/END header/footer\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.parseKey = function (pem) {\\n        try {\\n            var modulus = 0;\\n            var public_exponent = 0;\\n            var reHex = /^\\\\s*(?:[0-9A-Fa-f][0-9A-Fa-f]\\\\s*)+$/;\\n            var der = reHex.test(pem) ? _lib_asn1js_hex__WEBPACK_IMPORTED_MODULE_1__.Hex.decode(pem) : _lib_asn1js_base64__WEBPACK_IMPORTED_MODULE_2__.Base64.unarmor(pem);\\n            var asn1 = _lib_asn1js_asn1__WEBPACK_IMPORTED_MODULE_3__.ASN1.decode(der);\\n            // Fixes a bug with OpenSSL 1.0+ private keys\\n            if (asn1.sub.length === 3) {\\n                asn1 = asn1.sub[2].sub[0];\\n            }\\n            if (asn1.sub.length === 9) {\\n                // Parse the private key.\\n                modulus = asn1.sub[1].getHexStringValue(); // bigint\\n                this.n = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(modulus, 16);\\n                public_exponent = asn1.sub[2].getHexStringValue(); // int\\n                this.e = parseInt(public_exponent, 16);\\n                var private_exponent = asn1.sub[3].getHexStringValue(); // bigint\\n                this.d = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(private_exponent, 16);\\n                var prime1 = asn1.sub[4].getHexStringValue(); // bigint\\n                this.p = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(prime1, 16);\\n                var prime2 = asn1.sub[5].getHexStringValue(); // bigint\\n                this.q = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(prime2, 16);\\n                var exponent1 = asn1.sub[6].getHexStringValue(); // bigint\\n                this.dmp1 = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(exponent1, 16);\\n                var exponent2 = asn1.sub[7].getHexStringValue(); // bigint\\n                this.dmq1 = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(exponent2, 16);\\n                var coefficient = asn1.sub[8].getHexStringValue(); // bigint\\n                this.coeff = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(coefficient, 16);\\n            }\\n            else if (asn1.sub.length === 2) {\\n                // Parse the public key.\\n                var bit_string = asn1.sub[1];\\n                var sequence = bit_string.sub[0];\\n                modulus = sequence.sub[0].getHexStringValue();\\n                this.n = (0,_lib_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_5__.parseBigInt)(modulus, 16);\\n                public_exponent = sequence.sub[1].getHexStringValue();\\n                this.e = parseInt(public_exponent, 16);\\n            }\\n            else {\\n                return false;\\n            }\\n            return true;\\n        }\\n        catch (ex) {\\n            return false;\\n        }\\n    };\\n    /**\\n     * Translate rsa parameters in a hex encoded string representing the rsa key.\\n     *\\n     * The translation follow the ASN.1 notation :\\n     * RSAPrivateKey ::= SEQUENCE {\\n     *   version           Version,\\n     *   modulus           INTEGER,  -- n\\n     *   publicExponent    INTEGER,  -- e\\n     *   privateExponent   INTEGER,  -- d\\n     *   prime1            INTEGER,  -- p\\n     *   prime2            INTEGER,  -- q\\n     *   exponent1         INTEGER,  -- d mod (p1)\\n     *   exponent2         INTEGER,  -- d mod (q-1)\\n     *   coefficient       INTEGER,  -- (inverse of q) mod p\\n     * }\\n     * @returns {string}  DER Encoded String representing the rsa private key\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.getPrivateBaseKey = function () {\\n        var options = {\\n            array: [\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ int: 0 }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.n }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ int: this.e }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.d }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.p }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.q }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.dmp1 }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.dmq1 }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.coeff })\\n            ]\\n        };\\n        var seq = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence(options);\\n        return seq.getEncodedHex();\\n    };\\n    /**\\n     * base64 (pem) encoded version of the DER encoded representation\\n     * @returns {string} pem encoded representation without header and footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPrivateBaseKeyB64 = function () {\\n        return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getPrivateBaseKey());\\n    };\\n    /**\\n     * Translate rsa parameters in a hex encoded string representing the rsa public key.\\n     * The representation follow the ASN.1 notation :\\n     * PublicKeyInfo ::= SEQUENCE {\\n     *   algorithm       AlgorithmIdentifier,\\n     *   PublicKey       BIT STRING\\n     * }\\n     * Where AlgorithmIdentifier is:\\n     * AlgorithmIdentifier ::= SEQUENCE {\\n     *   algorithm       OBJECT IDENTIFIER,     the OID of the enc algorithm\\n     *   parameters      ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)\\n     * }\\n     * and PublicKey is a SEQUENCE encapsulated in a BIT STRING\\n     * RSAPublicKey ::= SEQUENCE {\\n     *   modulus           INTEGER,  -- n\\n     *   publicExponent    INTEGER   -- e\\n     * }\\n     * @returns {string} DER Encoded String representing the rsa public key\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.getPublicBaseKey = function () {\\n        var first_sequence = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence({\\n            array: [\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERObjectIdentifier({ oid: \\\"1.2.840.113549.1.1.1\\\" }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERNull()\\n            ]\\n        });\\n        var second_sequence = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence({\\n            array: [\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ bigint: this.n }),\\n                new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERInteger({ int: this.e })\\n            ]\\n        });\\n        var bit_string = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERBitString({\\n            hex: \\\"00\\\" + second_sequence.getEncodedHex()\\n        });\\n        var seq = new _lib_jsrsasign_asn1_1_0__WEBPACK_IMPORTED_MODULE_6__.KJUR.asn1.DERSequence({\\n            array: [\\n                first_sequence,\\n                bit_string\\n            ]\\n        });\\n        return seq.getEncodedHex();\\n    };\\n    /**\\n     * base64 (pem) encoded version of the DER encoded representation\\n     * @returns {string} pem encoded representation without header and footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPublicBaseKeyB64 = function () {\\n        return (0,_lib_jsbn_base64__WEBPACK_IMPORTED_MODULE_0__.hex2b64)(this.getPublicBaseKey());\\n    };\\n    /**\\n     * wrap the string in block of width chars. The default value for rsa keys is 64\\n     * characters.\\n     * @param {string} str the pem encoded string without header and footer\\n     * @param {Number} [width=64] - the length the string has to be wrapped at\\n     * @returns {string}\\n     * @private\\n     */\\n    JSEncryptRSAKey.wordwrap = function (str, width) {\\n        width = width || 64;\\n        if (!str) {\\n            return str;\\n        }\\n        var regex = \\\"(.{1,\\\" + width + \\\"})( +|$\\\\n?)|(.{1,\\\" + width + \\\"})\\\";\\n        return str.match(RegExp(regex, \\\"g\\\")).join(\\\"\\\\n\\\");\\n    };\\n    /**\\n     * Retrieve the pem encoded private key\\n     * @returns {string} the pem encoded private key with header/footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPrivateKey = function () {\\n        var key = \\\"-----BEGIN RSA PRIVATE KEY-----\\\\n\\\";\\n        key += JSEncryptRSAKey.wordwrap(this.getPrivateBaseKeyB64()) + \\\"\\\\n\\\";\\n        key += \\\"-----END RSA PRIVATE KEY-----\\\";\\n        return key;\\n    };\\n    /**\\n     * Retrieve the pem encoded public key\\n     * @returns {string} the pem encoded public key with header/footer\\n     * @public\\n     */\\n    JSEncryptRSAKey.prototype.getPublicKey = function () {\\n        var key = \\\"-----BEGIN PUBLIC KEY-----\\\\n\\\";\\n        key += JSEncryptRSAKey.wordwrap(this.getPublicBaseKeyB64()) + \\\"\\\\n\\\";\\n        key += \\\"-----END PUBLIC KEY-----\\\";\\n        return key;\\n    };\\n    /**\\n     * Check if the object contains the necessary parameters to populate the rsa modulus\\n     * and public exponent parameters.\\n     * @param {Object} [obj={}] - An object that may contain the two public key\\n     * parameters\\n     * @returns {boolean} true if the object contains both the modulus and the public exponent\\n     * properties (n and e)\\n     * @todo check for types of n and e. N should be a parseable bigInt object, E should\\n     * be a parseable integer number\\n     * @private\\n     */\\n    JSEncryptRSAKey.hasPublicKeyProperty = function (obj) {\\n        obj = obj || {};\\n        return (obj.hasOwnProperty(\\\"n\\\") &&\\n            obj.hasOwnProperty(\\\"e\\\"));\\n    };\\n    /**\\n     * Check if the object contains ALL the parameters of an RSA key.\\n     * @param {Object} [obj={}] - An object that may contain nine rsa key\\n     * parameters\\n     * @returns {boolean} true if the object contains all the parameters needed\\n     * @todo check for types of the parameters all the parameters but the public exponent\\n     * should be parseable bigint objects, the public exponent should be a parseable integer number\\n     * @private\\n     */\\n    JSEncryptRSAKey.hasPrivateKeyProperty = function (obj) {\\n        obj = obj || {};\\n        return (obj.hasOwnProperty(\\\"n\\\") &&\\n            obj.hasOwnProperty(\\\"e\\\") &&\\n            obj.hasOwnProperty(\\\"d\\\") &&\\n            obj.hasOwnProperty(\\\"p\\\") &&\\n            obj.hasOwnProperty(\\\"q\\\") &&\\n            obj.hasOwnProperty(\\\"dmp1\\\") &&\\n            obj.hasOwnProperty(\\\"dmq1\\\") &&\\n            obj.hasOwnProperty(\\\"coeff\\\"));\\n    };\\n    /**\\n     * Parse the properties of obj in the current rsa object. Obj should AT LEAST\\n     * include the modulus and public exponent (n, e) parameters.\\n     * @param {Object} obj - the object containing rsa parameters\\n     * @private\\n     */\\n    JSEncryptRSAKey.prototype.parsePropertiesFrom = function (obj) {\\n        this.n = obj.n;\\n        this.e = obj.e;\\n        if (obj.hasOwnProperty(\\\"d\\\")) {\\n            this.d = obj.d;\\n            this.p = obj.p;\\n            this.q = obj.q;\\n            this.dmp1 = obj.dmp1;\\n            this.dmq1 = obj.dmq1;\\n            this.coeff = obj.coeff;\\n        }\\n    };\\n    return JSEncryptRSAKey;\\n}(_lib_jsbn_rsa__WEBPACK_IMPORTED_MODULE_4__.RSAKey));\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/JSEncryptRSAKey.js?\");\n\n/***/ }),\n\n/***/ \"./lib/index.js\":\n/*!**********************!*\\\n  !*** ./lib/index.js ***!\n  \\**********************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"JSEncrypt\\\": () => (/* reexport safe */ _JSEncrypt__WEBPACK_IMPORTED_MODULE_0__.JSEncrypt),\\n/* harmony export */   \\\"default\\\": () => (__WEBPACK_DEFAULT_EXPORT__)\\n/* harmony export */ });\\n/* harmony import */ var _JSEncrypt__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./JSEncrypt */ \\\"./lib/JSEncrypt.js\\\");\\n\\n\\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (_JSEncrypt__WEBPACK_IMPORTED_MODULE_0__.JSEncrypt);\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/index.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/asn1.js\":\n/*!********************************!*\\\n  !*** ./lib/lib/asn1js/asn1.js ***!\n  \\********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Stream\\\": () => (/* binding */ Stream),\\n/* harmony export */   \\\"ASN1\\\": () => (/* binding */ ASN1),\\n/* harmony export */   \\\"ASN1Tag\\\": () => (/* binding */ ASN1Tag)\\n/* harmony export */ });\\n/* harmony import */ var _int10__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./int10 */ \\\"./lib/lib/asn1js/int10.js\\\");\\n// ASN.1 JavaScript decoder\\n// Copyright (c) 2008-2014 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\n/*global oids */\\n\\nvar ellipsis = \\\"\\\\u2026\\\";\\nvar reTimeS = /^(\\\\d\\\\d)(0[1-9]|1[0-2])(0[1-9]|[12]\\\\d|3[01])([01]\\\\d|2[0-3])(?:([0-5]\\\\d)(?:([0-5]\\\\d)(?:[.,](\\\\d{1,3}))?)?)?(Z|[-+](?:[0]\\\\d|1[0-2])([0-5]\\\\d)?)?$/;\\nvar reTimeL = /^(\\\\d\\\\d\\\\d\\\\d)(0[1-9]|1[0-2])(0[1-9]|[12]\\\\d|3[01])([01]\\\\d|2[0-3])(?:([0-5]\\\\d)(?:([0-5]\\\\d)(?:[.,](\\\\d{1,3}))?)?)?(Z|[-+](?:[0]\\\\d|1[0-2])([0-5]\\\\d)?)?$/;\\nfunction stringCut(str, len) {\\n    if (str.length > len) {\\n        str = str.substring(0, len) + ellipsis;\\n    }\\n    return str;\\n}\\nvar Stream = /** @class */ (function () {\\n    function Stream(enc, pos) {\\n        this.hexDigits = \\\"0123456789ABCDEF\\\";\\n        if (enc instanceof Stream) {\\n            this.enc = enc.enc;\\n            this.pos = enc.pos;\\n        }\\n        else {\\n            // enc should be an array or a binary string\\n            this.enc = enc;\\n            this.pos = pos;\\n        }\\n    }\\n    Stream.prototype.get = function (pos) {\\n        if (pos === undefined) {\\n            pos = this.pos++;\\n        }\\n        if (pos >= this.enc.length) {\\n            throw new Error(\\\"Requesting byte offset \\\" + pos + \\\" on a stream of length \\\" + this.enc.length);\\n        }\\n        return (\\\"string\\\" === typeof this.enc) ? this.enc.charCodeAt(pos) : this.enc[pos];\\n    };\\n    Stream.prototype.hexByte = function (b) {\\n        return this.hexDigits.charAt((b >> 4) & 0xF) + this.hexDigits.charAt(b & 0xF);\\n    };\\n    Stream.prototype.hexDump = function (start, end, raw) {\\n        var s = \\\"\\\";\\n        for (var i = start; i < end; ++i) {\\n            s += this.hexByte(this.get(i));\\n            if (raw !== true) {\\n                switch (i & 0xF) {\\n                    case 0x7:\\n                        s += \\\"  \\\";\\n                        break;\\n                    case 0xF:\\n                        s += \\\"\\\\n\\\";\\n                        break;\\n                    default:\\n                        s += \\\" \\\";\\n                }\\n            }\\n        }\\n        return s;\\n    };\\n    Stream.prototype.isASCII = function (start, end) {\\n        for (var i = start; i < end; ++i) {\\n            var c = this.get(i);\\n            if (c < 32 || c > 176) {\\n                return false;\\n            }\\n        }\\n        return true;\\n    };\\n    Stream.prototype.parseStringISO = function (start, end) {\\n        var s = \\\"\\\";\\n        for (var i = start; i < end; ++i) {\\n            s += String.fromCharCode(this.get(i));\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseStringUTF = function (start, end) {\\n        var s = \\\"\\\";\\n        for (var i = start; i < end;) {\\n            var c = this.get(i++);\\n            if (c < 128) {\\n                s += String.fromCharCode(c);\\n            }\\n            else if ((c > 191) && (c < 224)) {\\n                s += String.fromCharCode(((c & 0x1F) << 6) | (this.get(i++) & 0x3F));\\n            }\\n            else {\\n                s += String.fromCharCode(((c & 0x0F) << 12) | ((this.get(i++) & 0x3F) << 6) | (this.get(i++) & 0x3F));\\n            }\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseStringBMP = function (start, end) {\\n        var str = \\\"\\\";\\n        var hi;\\n        var lo;\\n        for (var i = start; i < end;) {\\n            hi = this.get(i++);\\n            lo = this.get(i++);\\n            str += String.fromCharCode((hi << 8) | lo);\\n        }\\n        return str;\\n    };\\n    Stream.prototype.parseTime = function (start, end, shortYear) {\\n        var s = this.parseStringISO(start, end);\\n        var m = (shortYear ? reTimeS : reTimeL).exec(s);\\n        if (!m) {\\n            return \\\"Unrecognized time: \\\" + s;\\n        }\\n        if (shortYear) {\\n            // to avoid querying the timer, use the fixed range [1970, 2069]\\n            // it will conform with ITU X.400 [-10, +40] sliding window until 2030\\n            m[1] = +m[1];\\n            m[1] += (+m[1] < 70) ? 2000 : 1900;\\n        }\\n        s = m[1] + \\\"-\\\" + m[2] + \\\"-\\\" + m[3] + \\\" \\\" + m[4];\\n        if (m[5]) {\\n            s += \\\":\\\" + m[5];\\n            if (m[6]) {\\n                s += \\\":\\\" + m[6];\\n                if (m[7]) {\\n                    s += \\\".\\\" + m[7];\\n                }\\n            }\\n        }\\n        if (m[8]) {\\n            s += \\\" UTC\\\";\\n            if (m[8] != \\\"Z\\\") {\\n                s += m[8];\\n                if (m[9]) {\\n                    s += \\\":\\\" + m[9];\\n                }\\n            }\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseInteger = function (start, end) {\\n        var v = this.get(start);\\n        var neg = (v > 127);\\n        var pad = neg ? 255 : 0;\\n        var len;\\n        var s = \\\"\\\";\\n        // skip unuseful bits (not allowed in DER)\\n        while (v == pad && ++start < end) {\\n            v = this.get(start);\\n        }\\n        len = end - start;\\n        if (len === 0) {\\n            return neg ? -1 : 0;\\n        }\\n        // show bit length of huge integers\\n        if (len > 4) {\\n            s = v;\\n            len <<= 3;\\n            while (((+s ^ pad) & 0x80) == 0) {\\n                s = +s << 1;\\n                --len;\\n            }\\n            s = \\\"(\\\" + len + \\\" bit)\\\\n\\\";\\n        }\\n        // decode the integer\\n        if (neg) {\\n            v = v - 256;\\n        }\\n        var n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10(v);\\n        for (var i = start + 1; i < end; ++i) {\\n            n.mulAdd(256, this.get(i));\\n        }\\n        return s + n.toString();\\n    };\\n    Stream.prototype.parseBitString = function (start, end, maxLength) {\\n        var unusedBit = this.get(start);\\n        var lenBit = ((end - start - 1) << 3) - unusedBit;\\n        var intro = \\\"(\\\" + lenBit + \\\" bit)\\\\n\\\";\\n        var s = \\\"\\\";\\n        for (var i = start + 1; i < end; ++i) {\\n            var b = this.get(i);\\n            var skip = (i == end - 1) ? unusedBit : 0;\\n            for (var j = 7; j >= skip; --j) {\\n                s += (b >> j) & 1 ? \\\"1\\\" : \\\"0\\\";\\n            }\\n            if (s.length > maxLength) {\\n                return intro + stringCut(s, maxLength);\\n            }\\n        }\\n        return intro + s;\\n    };\\n    Stream.prototype.parseOctetString = function (start, end, maxLength) {\\n        if (this.isASCII(start, end)) {\\n            return stringCut(this.parseStringISO(start, end), maxLength);\\n        }\\n        var len = end - start;\\n        var s = \\\"(\\\" + len + \\\" byte)\\\\n\\\";\\n        maxLength /= 2; // we work in bytes\\n        if (len > maxLength) {\\n            end = start + maxLength;\\n        }\\n        for (var i = start; i < end; ++i) {\\n            s += this.hexByte(this.get(i));\\n        }\\n        if (len > maxLength) {\\n            s += ellipsis;\\n        }\\n        return s;\\n    };\\n    Stream.prototype.parseOID = function (start, end, maxLength) {\\n        var s = \\\"\\\";\\n        var n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10();\\n        var bits = 0;\\n        for (var i = start; i < end; ++i) {\\n            var v = this.get(i);\\n            n.mulAdd(128, v & 0x7F);\\n            bits += 7;\\n            if (!(v & 0x80)) { // finished\\n                if (s === \\\"\\\") {\\n                    n = n.simplify();\\n                    if (n instanceof _int10__WEBPACK_IMPORTED_MODULE_0__.Int10) {\\n                        n.sub(80);\\n                        s = \\\"2.\\\" + n.toString();\\n                    }\\n                    else {\\n                        var m = n < 80 ? n < 40 ? 0 : 1 : 2;\\n                        s = m + \\\".\\\" + (n - m * 40);\\n                    }\\n                }\\n                else {\\n                    s += \\\".\\\" + n.toString();\\n                }\\n                if (s.length > maxLength) {\\n                    return stringCut(s, maxLength);\\n                }\\n                n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10();\\n                bits = 0;\\n            }\\n        }\\n        if (bits > 0) {\\n            s += \\\".incomplete\\\";\\n        }\\n        return s;\\n    };\\n    return Stream;\\n}());\\n\\nvar ASN1 = /** @class */ (function () {\\n    function ASN1(stream, header, length, tag, sub) {\\n        if (!(tag instanceof ASN1Tag)) {\\n            throw new Error(\\\"Invalid tag value.\\\");\\n        }\\n        this.stream = stream;\\n        this.header = header;\\n        this.length = length;\\n        this.tag = tag;\\n        this.sub = sub;\\n    }\\n    ASN1.prototype.typeName = function () {\\n        switch (this.tag.tagClass) {\\n            case 0: // universal\\n                switch (this.tag.tagNumber) {\\n                    case 0x00:\\n                        return \\\"EOC\\\";\\n                    case 0x01:\\n                        return \\\"BOOLEAN\\\";\\n                    case 0x02:\\n                        return \\\"INTEGER\\\";\\n                    case 0x03:\\n                        return \\\"BIT_STRING\\\";\\n                    case 0x04:\\n                        return \\\"OCTET_STRING\\\";\\n                    case 0x05:\\n                        return \\\"NULL\\\";\\n                    case 0x06:\\n                        return \\\"OBJECT_IDENTIFIER\\\";\\n                    case 0x07:\\n                        return \\\"ObjectDescriptor\\\";\\n                    case 0x08:\\n                        return \\\"EXTERNAL\\\";\\n                    case 0x09:\\n                        return \\\"REAL\\\";\\n                    case 0x0A:\\n                        return \\\"ENUMERATED\\\";\\n                    case 0x0B:\\n                        return \\\"EMBEDDED_PDV\\\";\\n                    case 0x0C:\\n                        return \\\"UTF8String\\\";\\n                    case 0x10:\\n                        return \\\"SEQUENCE\\\";\\n                    case 0x11:\\n                        return \\\"SET\\\";\\n                    case 0x12:\\n                        return \\\"NumericString\\\";\\n                    case 0x13:\\n                        return \\\"PrintableString\\\"; // ASCII subset\\n                    case 0x14:\\n                        return \\\"TeletexString\\\"; // aka T61String\\n                    case 0x15:\\n                        return \\\"VideotexString\\\";\\n                    case 0x16:\\n                        return \\\"IA5String\\\"; // ASCII\\n                    case 0x17:\\n                        return \\\"UTCTime\\\";\\n                    case 0x18:\\n                        return \\\"GeneralizedTime\\\";\\n                    case 0x19:\\n                        return \\\"GraphicString\\\";\\n                    case 0x1A:\\n                        return \\\"VisibleString\\\"; // ASCII subset\\n                    case 0x1B:\\n                        return \\\"GeneralString\\\";\\n                    case 0x1C:\\n                        return \\\"UniversalString\\\";\\n                    case 0x1E:\\n                        return \\\"BMPString\\\";\\n                }\\n                return \\\"Universal_\\\" + this.tag.tagNumber.toString();\\n            case 1:\\n                return \\\"Application_\\\" + this.tag.tagNumber.toString();\\n            case 2:\\n                return \\\"[\\\" + this.tag.tagNumber.toString() + \\\"]\\\"; // Context\\n            case 3:\\n                return \\\"Private_\\\" + this.tag.tagNumber.toString();\\n        }\\n    };\\n    ASN1.prototype.content = function (maxLength) {\\n        if (this.tag === undefined) {\\n            return null;\\n        }\\n        if (maxLength === undefined) {\\n            maxLength = Infinity;\\n        }\\n        var content = this.posContent();\\n        var len = Math.abs(this.length);\\n        if (!this.tag.isUniversal()) {\\n            if (this.sub !== null) {\\n                return \\\"(\\\" + this.sub.length + \\\" elem)\\\";\\n            }\\n            return this.stream.parseOctetString(content, content + len, maxLength);\\n        }\\n        switch (this.tag.tagNumber) {\\n            case 0x01: // BOOLEAN\\n                return (this.stream.get(content) === 0) ? \\\"false\\\" : \\\"true\\\";\\n            case 0x02: // INTEGER\\n                return this.stream.parseInteger(content, content + len);\\n            case 0x03: // BIT_STRING\\n                return this.sub ? \\\"(\\\" + this.sub.length + \\\" elem)\\\" :\\n                    this.stream.parseBitString(content, content + len, maxLength);\\n            case 0x04: // OCTET_STRING\\n                return this.sub ? \\\"(\\\" + this.sub.length + \\\" elem)\\\" :\\n                    this.stream.parseOctetString(content, content + len, maxLength);\\n            // case 0x05: // NULL\\n            case 0x06: // OBJECT_IDENTIFIER\\n                return this.stream.parseOID(content, content + len, maxLength);\\n            // case 0x07: // ObjectDescriptor\\n            // case 0x08: // EXTERNAL\\n            // case 0x09: // REAL\\n            // case 0x0A: // ENUMERATED\\n            // case 0x0B: // EMBEDDED_PDV\\n            case 0x10: // SEQUENCE\\n            case 0x11: // SET\\n                if (this.sub !== null) {\\n                    return \\\"(\\\" + this.sub.length + \\\" elem)\\\";\\n                }\\n                else {\\n                    return \\\"(no elem)\\\";\\n                }\\n            case 0x0C: // UTF8String\\n                return stringCut(this.stream.parseStringUTF(content, content + len), maxLength);\\n            case 0x12: // NumericString\\n            case 0x13: // PrintableString\\n            case 0x14: // TeletexString\\n            case 0x15: // VideotexString\\n            case 0x16: // IA5String\\n            // case 0x19: // GraphicString\\n            case 0x1A: // VisibleString\\n                // case 0x1B: // GeneralString\\n                // case 0x1C: // UniversalString\\n                return stringCut(this.stream.parseStringISO(content, content + len), maxLength);\\n            case 0x1E: // BMPString\\n                return stringCut(this.stream.parseStringBMP(content, content + len), maxLength);\\n            case 0x17: // UTCTime\\n            case 0x18: // GeneralizedTime\\n                return this.stream.parseTime(content, content + len, (this.tag.tagNumber == 0x17));\\n        }\\n        return null;\\n    };\\n    ASN1.prototype.toString = function () {\\n        return this.typeName() + \\\"@\\\" + this.stream.pos + \\\"[header:\\\" + this.header + \\\",length:\\\" + this.length + \\\",sub:\\\" + ((this.sub === null) ? \\\"null\\\" : this.sub.length) + \\\"]\\\";\\n    };\\n    ASN1.prototype.toPrettyString = function (indent) {\\n        if (indent === undefined) {\\n            indent = \\\"\\\";\\n        }\\n        var s = indent + this.typeName() + \\\" @\\\" + this.stream.pos;\\n        if (this.length >= 0) {\\n            s += \\\"+\\\";\\n        }\\n        s += this.length;\\n        if (this.tag.tagConstructed) {\\n            s += \\\" (constructed)\\\";\\n        }\\n        else if ((this.tag.isUniversal() && ((this.tag.tagNumber == 0x03) || (this.tag.tagNumber == 0x04))) && (this.sub !== null)) {\\n            s += \\\" (encapsulates)\\\";\\n        }\\n        s += \\\"\\\\n\\\";\\n        if (this.sub !== null) {\\n            indent += \\\"  \\\";\\n            for (var i = 0, max = this.sub.length; i < max; ++i) {\\n                s += this.sub[i].toPrettyString(indent);\\n            }\\n        }\\n        return s;\\n    };\\n    ASN1.prototype.posStart = function () {\\n        return this.stream.pos;\\n    };\\n    ASN1.prototype.posContent = function () {\\n        return this.stream.pos + this.header;\\n    };\\n    ASN1.prototype.posEnd = function () {\\n        return this.stream.pos + this.header + Math.abs(this.length);\\n    };\\n    ASN1.prototype.toHexString = function () {\\n        return this.stream.hexDump(this.posStart(), this.posEnd(), true);\\n    };\\n    ASN1.decodeLength = function (stream) {\\n        var buf = stream.get();\\n        var len = buf & 0x7F;\\n        if (len == buf) {\\n            return len;\\n        }\\n        // no reason to use Int10, as it would be a huge buffer anyways\\n        if (len > 6) {\\n            throw new Error(\\\"Length over 48 bits not supported at position \\\" + (stream.pos - 1));\\n        }\\n        if (len === 0) {\\n            return null;\\n        } // undefined\\n        buf = 0;\\n        for (var i = 0; i < len; ++i) {\\n            buf = (buf * 256) + stream.get();\\n        }\\n        return buf;\\n    };\\n    /**\\n     * Retrieve the hexadecimal value (as a string) of the current ASN.1 element\\n     * @returns {string}\\n     * @public\\n     */\\n    ASN1.prototype.getHexStringValue = function () {\\n        var hexString = this.toHexString();\\n        var offset = this.header * 2;\\n        var length = this.length * 2;\\n        return hexString.substr(offset, length);\\n    };\\n    ASN1.decode = function (str) {\\n        var stream;\\n        if (!(str instanceof Stream)) {\\n            stream = new Stream(str, 0);\\n        }\\n        else {\\n            stream = str;\\n        }\\n        var streamStart = new Stream(stream);\\n        var tag = new ASN1Tag(stream);\\n        var len = ASN1.decodeLength(stream);\\n        var start = stream.pos;\\n        var header = start - streamStart.pos;\\n        var sub = null;\\n        var getSub = function () {\\n            var ret = [];\\n            if (len !== null) {\\n                // definite length\\n                var end = start + len;\\n                while (stream.pos < end) {\\n                    ret[ret.length] = ASN1.decode(stream);\\n                }\\n                if (stream.pos != end) {\\n                    throw new Error(\\\"Content size is not correct for container starting at offset \\\" + start);\\n                }\\n            }\\n            else {\\n                // undefined length\\n                try {\\n                    for (;;) {\\n                        var s = ASN1.decode(stream);\\n                        if (s.tag.isEOC()) {\\n                            break;\\n                        }\\n                        ret[ret.length] = s;\\n                    }\\n                    len = start - stream.pos; // undefined lengths are represented as negative values\\n                }\\n                catch (e) {\\n                    throw new Error(\\\"Exception while decoding undefined length content: \\\" + e);\\n                }\\n            }\\n            return ret;\\n        };\\n        if (tag.tagConstructed) {\\n            // must have valid content\\n            sub = getSub();\\n        }\\n        else if (tag.isUniversal() && ((tag.tagNumber == 0x03) || (tag.tagNumber == 0x04))) {\\n            // sometimes BitString and OctetString are used to encapsulate ASN.1\\n            try {\\n                if (tag.tagNumber == 0x03) {\\n                    if (stream.get() != 0) {\\n                        throw new Error(\\\"BIT STRINGs with unused bits cannot encapsulate.\\\");\\n                    }\\n                }\\n                sub = getSub();\\n                for (var i = 0; i < sub.length; ++i) {\\n                    if (sub[i].tag.isEOC()) {\\n                        throw new Error(\\\"EOC is not supposed to be actual content.\\\");\\n                    }\\n                }\\n            }\\n            catch (e) {\\n                // but silently ignore when they don't\\n                sub = null;\\n            }\\n        }\\n        if (sub === null) {\\n            if (len === null) {\\n                throw new Error(\\\"We can't skip over an invalid tag with undefined length at offset \\\" + start);\\n            }\\n            stream.pos = start + Math.abs(len);\\n        }\\n        return new ASN1(streamStart, header, len, tag, sub);\\n    };\\n    return ASN1;\\n}());\\n\\nvar ASN1Tag = /** @class */ (function () {\\n    function ASN1Tag(stream) {\\n        var buf = stream.get();\\n        this.tagClass = buf >> 6;\\n        this.tagConstructed = ((buf & 0x20) !== 0);\\n        this.tagNumber = buf & 0x1F;\\n        if (this.tagNumber == 0x1F) { // long tag\\n            var n = new _int10__WEBPACK_IMPORTED_MODULE_0__.Int10();\\n            do {\\n                buf = stream.get();\\n                n.mulAdd(128, buf & 0x7F);\\n            } while (buf & 0x80);\\n            this.tagNumber = n.simplify();\\n        }\\n    }\\n    ASN1Tag.prototype.isUniversal = function () {\\n        return this.tagClass === 0x00;\\n    };\\n    ASN1Tag.prototype.isEOC = function () {\\n        return this.tagClass === 0x00 && this.tagNumber === 0x00;\\n    };\\n    return ASN1Tag;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/asn1.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/base64.js\":\n/*!**********************************!*\\\n  !*** ./lib/lib/asn1js/base64.js ***!\n  \\**********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Base64\\\": () => (/* binding */ Base64)\\n/* harmony export */ });\\n// Base64 JavaScript decoder\\n// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\nvar decoder;\\nvar Base64 = {\\n    decode: function (a) {\\n        var i;\\n        if (decoder === undefined) {\\n            var b64 = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\";\\n            var ignore = \\\"= \\\\f\\\\n\\\\r\\\\t\\\\u00A0\\\\u2028\\\\u2029\\\";\\n            decoder = Object.create(null);\\n            for (i = 0; i < 64; ++i) {\\n                decoder[b64.charAt(i)] = i;\\n            }\\n            decoder['-'] = 62; //+\\n            decoder['_'] = 63; //-\\n            for (i = 0; i < ignore.length; ++i) {\\n                decoder[ignore.charAt(i)] = -1;\\n            }\\n        }\\n        var out = [];\\n        var bits = 0;\\n        var char_count = 0;\\n        for (i = 0; i < a.length; ++i) {\\n            var c = a.charAt(i);\\n            if (c == \\\"=\\\") {\\n                break;\\n            }\\n            c = decoder[c];\\n            if (c == -1) {\\n                continue;\\n            }\\n            if (c === undefined) {\\n                throw new Error(\\\"Illegal character at offset \\\" + i);\\n            }\\n            bits |= c;\\n            if (++char_count >= 4) {\\n                out[out.length] = (bits >> 16);\\n                out[out.length] = (bits >> 8) & 0xFF;\\n                out[out.length] = bits & 0xFF;\\n                bits = 0;\\n                char_count = 0;\\n            }\\n            else {\\n                bits <<= 6;\\n            }\\n        }\\n        switch (char_count) {\\n            case 1:\\n                throw new Error(\\\"Base64 encoding incomplete: at least 2 bits missing\\\");\\n            case 2:\\n                out[out.length] = (bits >> 10);\\n                break;\\n            case 3:\\n                out[out.length] = (bits >> 16);\\n                out[out.length] = (bits >> 8) & 0xFF;\\n                break;\\n        }\\n        return out;\\n    },\\n    re: /-----BEGIN [^-]+-----([A-Za-z0-9+\\\\/=\\\\s]+)-----END [^-]+-----|begin-base64[^\\\\n]+\\\\n([A-Za-z0-9+\\\\/=\\\\s]+)====/,\\n    unarmor: function (a) {\\n        var m = Base64.re.exec(a);\\n        if (m) {\\n            if (m[1]) {\\n                a = m[1];\\n            }\\n            else if (m[2]) {\\n                a = m[2];\\n            }\\n            else {\\n                throw new Error(\\\"RegExp out of sync\\\");\\n            }\\n        }\\n        return Base64.decode(a);\\n    }\\n};\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/base64.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/hex.js\":\n/*!*******************************!*\\\n  !*** ./lib/lib/asn1js/hex.js ***!\n  \\*******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Hex\\\": () => (/* binding */ Hex)\\n/* harmony export */ });\\n// Hex JavaScript decoder\\n// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\nvar decoder;\\nvar Hex = {\\n    decode: function (a) {\\n        var i;\\n        if (decoder === undefined) {\\n            var hex = \\\"0123456789ABCDEF\\\";\\n            var ignore = \\\" \\\\f\\\\n\\\\r\\\\t\\\\u00A0\\\\u2028\\\\u2029\\\";\\n            decoder = {};\\n            for (i = 0; i < 16; ++i) {\\n                decoder[hex.charAt(i)] = i;\\n            }\\n            hex = hex.toLowerCase();\\n            for (i = 10; i < 16; ++i) {\\n                decoder[hex.charAt(i)] = i;\\n            }\\n            for (i = 0; i < ignore.length; ++i) {\\n                decoder[ignore.charAt(i)] = -1;\\n            }\\n        }\\n        var out = [];\\n        var bits = 0;\\n        var char_count = 0;\\n        for (i = 0; i < a.length; ++i) {\\n            var c = a.charAt(i);\\n            if (c == \\\"=\\\") {\\n                break;\\n            }\\n            c = decoder[c];\\n            if (c == -1) {\\n                continue;\\n            }\\n            if (c === undefined) {\\n                throw new Error(\\\"Illegal character at offset \\\" + i);\\n            }\\n            bits |= c;\\n            if (++char_count >= 2) {\\n                out[out.length] = bits;\\n                bits = 0;\\n                char_count = 0;\\n            }\\n            else {\\n                bits <<= 4;\\n            }\\n        }\\n        if (char_count) {\\n            throw new Error(\\\"Hex encoding incomplete: 4 bits missing\\\");\\n        }\\n        return out;\\n    }\\n};\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/hex.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/asn1js/int10.js\":\n/*!*********************************!*\\\n  !*** ./lib/lib/asn1js/int10.js ***!\n  \\*********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Int10\\\": () => (/* binding */ Int10)\\n/* harmony export */ });\\n// Big integer base-10 printing library\\n// Copyright (c) 2014 Lapo Luchini <lapo@lapo.it>\\n// Permission to use, copy, modify, and/or distribute this software for any\\n// purpose with or without fee is hereby granted, provided that the above\\n// copyright notice and this permission notice appear in all copies.\\n//\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\\nvar max = 10000000000000; // biggest integer that can still fit 2^53 when multiplied by 256\\nvar Int10 = /** @class */ (function () {\\n    function Int10(value) {\\n        this.buf = [+value || 0];\\n    }\\n    Int10.prototype.mulAdd = function (m, c) {\\n        // assert(m <= 256)\\n        var b = this.buf;\\n        var l = b.length;\\n        var i;\\n        var t;\\n        for (i = 0; i < l; ++i) {\\n            t = b[i] * m + c;\\n            if (t < max) {\\n                c = 0;\\n            }\\n            else {\\n                c = 0 | (t / max);\\n                t -= c * max;\\n            }\\n            b[i] = t;\\n        }\\n        if (c > 0) {\\n            b[i] = c;\\n        }\\n    };\\n    Int10.prototype.sub = function (c) {\\n        // assert(m <= 256)\\n        var b = this.buf;\\n        var l = b.length;\\n        var i;\\n        var t;\\n        for (i = 0; i < l; ++i) {\\n            t = b[i] - c;\\n            if (t < 0) {\\n                t += max;\\n                c = 1;\\n            }\\n            else {\\n                c = 0;\\n            }\\n            b[i] = t;\\n        }\\n        while (b[b.length - 1] === 0) {\\n            b.pop();\\n        }\\n    };\\n    Int10.prototype.toString = function (base) {\\n        if ((base || 10) != 10) {\\n            throw new Error(\\\"only base 10 is supported\\\");\\n        }\\n        var b = this.buf;\\n        var s = b[b.length - 1].toString();\\n        for (var i = b.length - 2; i >= 0; --i) {\\n            s += (max + b[i]).toString().substring(1);\\n        }\\n        return s;\\n    };\\n    Int10.prototype.valueOf = function () {\\n        var b = this.buf;\\n        var v = 0;\\n        for (var i = b.length - 1; i >= 0; --i) {\\n            v = v * max + b[i];\\n        }\\n        return v;\\n    };\\n    Int10.prototype.simplify = function () {\\n        var b = this.buf;\\n        return (b.length == 1) ? b[0] : this;\\n    };\\n    return Int10;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/asn1js/int10.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/base64.js\":\n/*!********************************!*\\\n  !*** ./lib/lib/jsbn/base64.js ***!\n  \\********************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"hex2b64\\\": () => (/* binding */ hex2b64),\\n/* harmony export */   \\\"b64tohex\\\": () => (/* binding */ b64tohex),\\n/* harmony export */   \\\"b64toBA\\\": () => (/* binding */ b64toBA)\\n/* harmony export */ });\\n/* harmony import */ var _util__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./util */ \\\"./lib/lib/jsbn/util.js\\\");\\n\\nvar b64map = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\";\\nvar b64pad = \\\"=\\\";\\nfunction hex2b64(h) {\\n    var i;\\n    var c;\\n    var ret = \\\"\\\";\\n    for (i = 0; i + 3 <= h.length; i += 3) {\\n        c = parseInt(h.substring(i, i + 3), 16);\\n        ret += b64map.charAt(c >> 6) + b64map.charAt(c & 63);\\n    }\\n    if (i + 1 == h.length) {\\n        c = parseInt(h.substring(i, i + 1), 16);\\n        ret += b64map.charAt(c << 2);\\n    }\\n    else if (i + 2 == h.length) {\\n        c = parseInt(h.substring(i, i + 2), 16);\\n        ret += b64map.charAt(c >> 2) + b64map.charAt((c & 3) << 4);\\n    }\\n    while ((ret.length & 3) > 0) {\\n        ret += b64pad;\\n    }\\n    return ret;\\n}\\n// convert a base64 string to hex\\nfunction b64tohex(s) {\\n    var ret = \\\"\\\";\\n    var i;\\n    var k = 0; // b64 state, 0-3\\n    var slop = 0;\\n    for (i = 0; i < s.length; ++i) {\\n        if (s.charAt(i) == b64pad) {\\n            break;\\n        }\\n        var v = b64map.indexOf(s.charAt(i));\\n        if (v < 0) {\\n            continue;\\n        }\\n        if (k == 0) {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(v >> 2);\\n            slop = v & 3;\\n            k = 1;\\n        }\\n        else if (k == 1) {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)((slop << 2) | (v >> 4));\\n            slop = v & 0xf;\\n            k = 2;\\n        }\\n        else if (k == 2) {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(slop);\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(v >> 2);\\n            slop = v & 3;\\n            k = 3;\\n        }\\n        else {\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)((slop << 2) | (v >> 4));\\n            ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(v & 0xf);\\n            k = 0;\\n        }\\n    }\\n    if (k == 1) {\\n        ret += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(slop << 2);\\n    }\\n    return ret;\\n}\\n// convert a base64 string to a byte/number array\\nfunction b64toBA(s) {\\n    // piggyback on b64tohex for now, optimize later\\n    var h = b64tohex(s);\\n    var i;\\n    var a = [];\\n    for (i = 0; 2 * i < h.length; ++i) {\\n        a[i] = parseInt(h.substring(2 * i, 2 * i + 2), 16);\\n    }\\n    return a;\\n}\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/base64.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/jsbn.js\":\n/*!******************************!*\\\n  !*** ./lib/lib/jsbn/jsbn.js ***!\n  \\******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"BigInteger\\\": () => (/* binding */ BigInteger),\\n/* harmony export */   \\\"nbi\\\": () => (/* binding */ nbi),\\n/* harmony export */   \\\"parseBigInt\\\": () => (/* binding */ parseBigInt),\\n/* harmony export */   \\\"intAt\\\": () => (/* binding */ intAt),\\n/* harmony export */   \\\"nbv\\\": () => (/* binding */ nbv),\\n/* harmony export */   \\\"nbits\\\": () => (/* binding */ nbits)\\n/* harmony export */ });\\n/* harmony import */ var _util__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./util */ \\\"./lib/lib/jsbn/util.js\\\");\\n// Copyright (c) 2005  Tom Wu\\n// All Rights Reserved.\\n// See \\\"LICENSE\\\" for details.\\n// Basic JavaScript BN library - subset useful for RSA encryption.\\n\\n// Bits per digit\\nvar dbits;\\n// JavaScript engine analysis\\nvar canary = 0xdeadbeefcafe;\\nvar j_lm = ((canary & 0xffffff) == 0xefcafe);\\n//#region\\nvar lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];\\nvar lplim = (1 << 26) / lowprimes[lowprimes.length - 1];\\n//#endregion\\n// (public) Constructor\\nvar BigInteger = /** @class */ (function () {\\n    function BigInteger(a, b, c) {\\n        if (a != null) {\\n            if (\\\"number\\\" == typeof a) {\\n                this.fromNumber(a, b, c);\\n            }\\n            else if (b == null && \\\"string\\\" != typeof a) {\\n                this.fromString(a, 256);\\n            }\\n            else {\\n                this.fromString(a, b);\\n            }\\n        }\\n    }\\n    //#region PUBLIC\\n    // BigInteger.prototype.toString = bnToString;\\n    // (public) return string representation in given radix\\n    BigInteger.prototype.toString = function (b) {\\n        if (this.s < 0) {\\n            return \\\"-\\\" + this.negate().toString(b);\\n        }\\n        var k;\\n        if (b == 16) {\\n            k = 4;\\n        }\\n        else if (b == 8) {\\n            k = 3;\\n        }\\n        else if (b == 2) {\\n            k = 1;\\n        }\\n        else if (b == 32) {\\n            k = 5;\\n        }\\n        else if (b == 4) {\\n            k = 2;\\n        }\\n        else {\\n            return this.toRadix(b);\\n        }\\n        var km = (1 << k) - 1;\\n        var d;\\n        var m = false;\\n        var r = \\\"\\\";\\n        var i = this.t;\\n        var p = this.DB - (i * this.DB) % k;\\n        if (i-- > 0) {\\n            if (p < this.DB && (d = this[i] >> p) > 0) {\\n                m = true;\\n                r = (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(d);\\n            }\\n            while (i >= 0) {\\n                if (p < k) {\\n                    d = (this[i] & ((1 << p) - 1)) << (k - p);\\n                    d |= this[--i] >> (p += this.DB - k);\\n                }\\n                else {\\n                    d = (this[i] >> (p -= k)) & km;\\n                    if (p <= 0) {\\n                        p += this.DB;\\n                        --i;\\n                    }\\n                }\\n                if (d > 0) {\\n                    m = true;\\n                }\\n                if (m) {\\n                    r += (0,_util__WEBPACK_IMPORTED_MODULE_0__.int2char)(d);\\n                }\\n            }\\n        }\\n        return m ? r : \\\"0\\\";\\n    };\\n    // BigInteger.prototype.negate = bnNegate;\\n    // (public) -this\\n    BigInteger.prototype.negate = function () {\\n        var r = nbi();\\n        BigInteger.ZERO.subTo(this, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.abs = bnAbs;\\n    // (public) |this|\\n    BigInteger.prototype.abs = function () {\\n        return (this.s < 0) ? this.negate() : this;\\n    };\\n    // BigInteger.prototype.compareTo = bnCompareTo;\\n    // (public) return + if this > a, - if this < a, 0 if equal\\n    BigInteger.prototype.compareTo = function (a) {\\n        var r = this.s - a.s;\\n        if (r != 0) {\\n            return r;\\n        }\\n        var i = this.t;\\n        r = i - a.t;\\n        if (r != 0) {\\n            return (this.s < 0) ? -r : r;\\n        }\\n        while (--i >= 0) {\\n            if ((r = this[i] - a[i]) != 0) {\\n                return r;\\n            }\\n        }\\n        return 0;\\n    };\\n    // BigInteger.prototype.bitLength = bnBitLength;\\n    // (public) return the number of bits in \\\"this\\\"\\n    BigInteger.prototype.bitLength = function () {\\n        if (this.t <= 0) {\\n            return 0;\\n        }\\n        return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n    };\\n    // BigInteger.prototype.mod = bnMod;\\n    // (public) this mod a\\n    BigInteger.prototype.mod = function (a) {\\n        var r = nbi();\\n        this.abs().divRemTo(a, null, r);\\n        if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {\\n            a.subTo(r, r);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.modPowInt = bnModPowInt;\\n    // (public) this^e % m, 0 <= e < 2^32\\n    BigInteger.prototype.modPowInt = function (e, m) {\\n        var z;\\n        if (e < 256 || m.isEven()) {\\n            z = new Classic(m);\\n        }\\n        else {\\n            z = new Montgomery(m);\\n        }\\n        return this.exp(e, z);\\n    };\\n    // BigInteger.prototype.clone = bnClone;\\n    // (public)\\n    BigInteger.prototype.clone = function () {\\n        var r = nbi();\\n        this.copyTo(r);\\n        return r;\\n    };\\n    // BigInteger.prototype.intValue = bnIntValue;\\n    // (public) return value as integer\\n    BigInteger.prototype.intValue = function () {\\n        if (this.s < 0) {\\n            if (this.t == 1) {\\n                return this[0] - this.DV;\\n            }\\n            else if (this.t == 0) {\\n                return -1;\\n            }\\n        }\\n        else if (this.t == 1) {\\n            return this[0];\\n        }\\n        else if (this.t == 0) {\\n            return 0;\\n        }\\n        // assumes 16 < DB < 32\\n        return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];\\n    };\\n    // BigInteger.prototype.byteValue = bnByteValue;\\n    // (public) return value as byte\\n    BigInteger.prototype.byteValue = function () {\\n        return (this.t == 0) ? this.s : (this[0] << 24) >> 24;\\n    };\\n    // BigInteger.prototype.shortValue = bnShortValue;\\n    // (public) return value as short (assumes DB>=16)\\n    BigInteger.prototype.shortValue = function () {\\n        return (this.t == 0) ? this.s : (this[0] << 16) >> 16;\\n    };\\n    // BigInteger.prototype.signum = bnSigNum;\\n    // (public) 0 if this == 0, 1 if this > 0\\n    BigInteger.prototype.signum = function () {\\n        if (this.s < 0) {\\n            return -1;\\n        }\\n        else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) {\\n            return 0;\\n        }\\n        else {\\n            return 1;\\n        }\\n    };\\n    // BigInteger.prototype.toByteArray = bnToByteArray;\\n    // (public) convert to bigendian byte array\\n    BigInteger.prototype.toByteArray = function () {\\n        var i = this.t;\\n        var r = [];\\n        r[0] = this.s;\\n        var p = this.DB - (i * this.DB) % 8;\\n        var d;\\n        var k = 0;\\n        if (i-- > 0) {\\n            if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p) {\\n                r[k++] = d | (this.s << (this.DB - p));\\n            }\\n            while (i >= 0) {\\n                if (p < 8) {\\n                    d = (this[i] & ((1 << p) - 1)) << (8 - p);\\n                    d |= this[--i] >> (p += this.DB - 8);\\n                }\\n                else {\\n                    d = (this[i] >> (p -= 8)) & 0xff;\\n                    if (p <= 0) {\\n                        p += this.DB;\\n                        --i;\\n                    }\\n                }\\n                if ((d & 0x80) != 0) {\\n                    d |= -256;\\n                }\\n                if (k == 0 && (this.s & 0x80) != (d & 0x80)) {\\n                    ++k;\\n                }\\n                if (k > 0 || d != this.s) {\\n                    r[k++] = d;\\n                }\\n            }\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.equals = bnEquals;\\n    BigInteger.prototype.equals = function (a) {\\n        return (this.compareTo(a) == 0);\\n    };\\n    // BigInteger.prototype.min = bnMin;\\n    BigInteger.prototype.min = function (a) {\\n        return (this.compareTo(a) < 0) ? this : a;\\n    };\\n    // BigInteger.prototype.max = bnMax;\\n    BigInteger.prototype.max = function (a) {\\n        return (this.compareTo(a) > 0) ? this : a;\\n    };\\n    // BigInteger.prototype.and = bnAnd;\\n    BigInteger.prototype.and = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_and, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.or = bnOr;\\n    BigInteger.prototype.or = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_or, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.xor = bnXor;\\n    BigInteger.prototype.xor = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_xor, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.andNot = bnAndNot;\\n    BigInteger.prototype.andNot = function (a) {\\n        var r = nbi();\\n        this.bitwiseTo(a, _util__WEBPACK_IMPORTED_MODULE_0__.op_andnot, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.not = bnNot;\\n    // (public) ~this\\n    BigInteger.prototype.not = function () {\\n        var r = nbi();\\n        for (var i = 0; i < this.t; ++i) {\\n            r[i] = this.DM & ~this[i];\\n        }\\n        r.t = this.t;\\n        r.s = ~this.s;\\n        return r;\\n    };\\n    // BigInteger.prototype.shiftLeft = bnShiftLeft;\\n    // (public) this << n\\n    BigInteger.prototype.shiftLeft = function (n) {\\n        var r = nbi();\\n        if (n < 0) {\\n            this.rShiftTo(-n, r);\\n        }\\n        else {\\n            this.lShiftTo(n, r);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.shiftRight = bnShiftRight;\\n    // (public) this >> n\\n    BigInteger.prototype.shiftRight = function (n) {\\n        var r = nbi();\\n        if (n < 0) {\\n            this.lShiftTo(-n, r);\\n        }\\n        else {\\n            this.rShiftTo(n, r);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\\n    // (public) returns index of lowest 1-bit (or -1 if none)\\n    BigInteger.prototype.getLowestSetBit = function () {\\n        for (var i = 0; i < this.t; ++i) {\\n            if (this[i] != 0) {\\n                return i * this.DB + (0,_util__WEBPACK_IMPORTED_MODULE_0__.lbit)(this[i]);\\n            }\\n        }\\n        if (this.s < 0) {\\n            return this.t * this.DB;\\n        }\\n        return -1;\\n    };\\n    // BigInteger.prototype.bitCount = bnBitCount;\\n    // (public) return number of set bits\\n    BigInteger.prototype.bitCount = function () {\\n        var r = 0;\\n        var x = this.s & this.DM;\\n        for (var i = 0; i < this.t; ++i) {\\n            r += (0,_util__WEBPACK_IMPORTED_MODULE_0__.cbit)(this[i] ^ x);\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.testBit = bnTestBit;\\n    // (public) true iff nth bit is set\\n    BigInteger.prototype.testBit = function (n) {\\n        var j = Math.floor(n / this.DB);\\n        if (j >= this.t) {\\n            return (this.s != 0);\\n        }\\n        return ((this[j] & (1 << (n % this.DB))) != 0);\\n    };\\n    // BigInteger.prototype.setBit = bnSetBit;\\n    // (public) this | (1<<n)\\n    BigInteger.prototype.setBit = function (n) {\\n        return this.changeBit(n, _util__WEBPACK_IMPORTED_MODULE_0__.op_or);\\n    };\\n    // BigInteger.prototype.clearBit = bnClearBit;\\n    // (public) this & ~(1<<n)\\n    BigInteger.prototype.clearBit = function (n) {\\n        return this.changeBit(n, _util__WEBPACK_IMPORTED_MODULE_0__.op_andnot);\\n    };\\n    // BigInteger.prototype.flipBit = bnFlipBit;\\n    // (public) this ^ (1<<n)\\n    BigInteger.prototype.flipBit = function (n) {\\n        return this.changeBit(n, _util__WEBPACK_IMPORTED_MODULE_0__.op_xor);\\n    };\\n    // BigInteger.prototype.add = bnAdd;\\n    // (public) this + a\\n    BigInteger.prototype.add = function (a) {\\n        var r = nbi();\\n        this.addTo(a, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.subtract = bnSubtract;\\n    // (public) this - a\\n    BigInteger.prototype.subtract = function (a) {\\n        var r = nbi();\\n        this.subTo(a, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.multiply = bnMultiply;\\n    // (public) this * a\\n    BigInteger.prototype.multiply = function (a) {\\n        var r = nbi();\\n        this.multiplyTo(a, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.divide = bnDivide;\\n    // (public) this / a\\n    BigInteger.prototype.divide = function (a) {\\n        var r = nbi();\\n        this.divRemTo(a, r, null);\\n        return r;\\n    };\\n    // BigInteger.prototype.remainder = bnRemainder;\\n    // (public) this % a\\n    BigInteger.prototype.remainder = function (a) {\\n        var r = nbi();\\n        this.divRemTo(a, null, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\\n    // (public) [this/a,this%a]\\n    BigInteger.prototype.divideAndRemainder = function (a) {\\n        var q = nbi();\\n        var r = nbi();\\n        this.divRemTo(a, q, r);\\n        return [q, r];\\n    };\\n    // BigInteger.prototype.modPow = bnModPow;\\n    // (public) this^e % m (HAC 14.85)\\n    BigInteger.prototype.modPow = function (e, m) {\\n        var i = e.bitLength();\\n        var k;\\n        var r = nbv(1);\\n        var z;\\n        if (i <= 0) {\\n            return r;\\n        }\\n        else if (i < 18) {\\n            k = 1;\\n        }\\n        else if (i < 48) {\\n            k = 3;\\n        }\\n        else if (i < 144) {\\n            k = 4;\\n        }\\n        else if (i < 768) {\\n            k = 5;\\n        }\\n        else {\\n            k = 6;\\n        }\\n        if (i < 8) {\\n            z = new Classic(m);\\n        }\\n        else if (m.isEven()) {\\n            z = new Barrett(m);\\n        }\\n        else {\\n            z = new Montgomery(m);\\n        }\\n        // precomputation\\n        var g = [];\\n        var n = 3;\\n        var k1 = k - 1;\\n        var km = (1 << k) - 1;\\n        g[1] = z.convert(this);\\n        if (k > 1) {\\n            var g2 = nbi();\\n            z.sqrTo(g[1], g2);\\n            while (n <= km) {\\n                g[n] = nbi();\\n                z.mulTo(g2, g[n - 2], g[n]);\\n                n += 2;\\n            }\\n        }\\n        var j = e.t - 1;\\n        var w;\\n        var is1 = true;\\n        var r2 = nbi();\\n        var t;\\n        i = nbits(e[j]) - 1;\\n        while (j >= 0) {\\n            if (i >= k1) {\\n                w = (e[j] >> (i - k1)) & km;\\n            }\\n            else {\\n                w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);\\n                if (j > 0) {\\n                    w |= e[j - 1] >> (this.DB + i - k1);\\n                }\\n            }\\n            n = k;\\n            while ((w & 1) == 0) {\\n                w >>= 1;\\n                --n;\\n            }\\n            if ((i -= n) < 0) {\\n                i += this.DB;\\n                --j;\\n            }\\n            if (is1) { // ret == 1, don't bother squaring or multiplying it\\n                g[w].copyTo(r);\\n                is1 = false;\\n            }\\n            else {\\n                while (n > 1) {\\n                    z.sqrTo(r, r2);\\n                    z.sqrTo(r2, r);\\n                    n -= 2;\\n                }\\n                if (n > 0) {\\n                    z.sqrTo(r, r2);\\n                }\\n                else {\\n                    t = r;\\n                    r = r2;\\n                    r2 = t;\\n                }\\n                z.mulTo(r2, g[w], r);\\n            }\\n            while (j >= 0 && (e[j] & (1 << i)) == 0) {\\n                z.sqrTo(r, r2);\\n                t = r;\\n                r = r2;\\n                r2 = t;\\n                if (--i < 0) {\\n                    i = this.DB - 1;\\n                    --j;\\n                }\\n            }\\n        }\\n        return z.revert(r);\\n    };\\n    // BigInteger.prototype.modInverse = bnModInverse;\\n    // (public) 1/this % m (HAC 14.61)\\n    BigInteger.prototype.modInverse = function (m) {\\n        var ac = m.isEven();\\n        if ((this.isEven() && ac) || m.signum() == 0) {\\n            return BigInteger.ZERO;\\n        }\\n        var u = m.clone();\\n        var v = this.clone();\\n        var a = nbv(1);\\n        var b = nbv(0);\\n        var c = nbv(0);\\n        var d = nbv(1);\\n        while (u.signum() != 0) {\\n            while (u.isEven()) {\\n                u.rShiftTo(1, u);\\n                if (ac) {\\n                    if (!a.isEven() || !b.isEven()) {\\n                        a.addTo(this, a);\\n                        b.subTo(m, b);\\n                    }\\n                    a.rShiftTo(1, a);\\n                }\\n                else if (!b.isEven()) {\\n                    b.subTo(m, b);\\n                }\\n                b.rShiftTo(1, b);\\n            }\\n            while (v.isEven()) {\\n                v.rShiftTo(1, v);\\n                if (ac) {\\n                    if (!c.isEven() || !d.isEven()) {\\n                        c.addTo(this, c);\\n                        d.subTo(m, d);\\n                    }\\n                    c.rShiftTo(1, c);\\n                }\\n                else if (!d.isEven()) {\\n                    d.subTo(m, d);\\n                }\\n                d.rShiftTo(1, d);\\n            }\\n            if (u.compareTo(v) >= 0) {\\n                u.subTo(v, u);\\n                if (ac) {\\n                    a.subTo(c, a);\\n                }\\n                b.subTo(d, b);\\n            }\\n            else {\\n                v.subTo(u, v);\\n                if (ac) {\\n                    c.subTo(a, c);\\n                }\\n                d.subTo(b, d);\\n            }\\n        }\\n        if (v.compareTo(BigInteger.ONE) != 0) {\\n            return BigInteger.ZERO;\\n        }\\n        if (d.compareTo(m) >= 0) {\\n            return d.subtract(m);\\n        }\\n        if (d.signum() < 0) {\\n            d.addTo(m, d);\\n        }\\n        else {\\n            return d;\\n        }\\n        if (d.signum() < 0) {\\n            return d.add(m);\\n        }\\n        else {\\n            return d;\\n        }\\n    };\\n    // BigInteger.prototype.pow = bnPow;\\n    // (public) this^e\\n    BigInteger.prototype.pow = function (e) {\\n        return this.exp(e, new NullExp());\\n    };\\n    // BigInteger.prototype.gcd = bnGCD;\\n    // (public) gcd(this,a) (HAC 14.54)\\n    BigInteger.prototype.gcd = function (a) {\\n        var x = (this.s < 0) ? this.negate() : this.clone();\\n        var y = (a.s < 0) ? a.negate() : a.clone();\\n        if (x.compareTo(y) < 0) {\\n            var t = x;\\n            x = y;\\n            y = t;\\n        }\\n        var i = x.getLowestSetBit();\\n        var g = y.getLowestSetBit();\\n        if (g < 0) {\\n            return x;\\n        }\\n        if (i < g) {\\n            g = i;\\n        }\\n        if (g > 0) {\\n            x.rShiftTo(g, x);\\n            y.rShiftTo(g, y);\\n        }\\n        while (x.signum() > 0) {\\n            if ((i = x.getLowestSetBit()) > 0) {\\n                x.rShiftTo(i, x);\\n            }\\n            if ((i = y.getLowestSetBit()) > 0) {\\n                y.rShiftTo(i, y);\\n            }\\n            if (x.compareTo(y) >= 0) {\\n                x.subTo(y, x);\\n                x.rShiftTo(1, x);\\n            }\\n            else {\\n                y.subTo(x, y);\\n                y.rShiftTo(1, y);\\n            }\\n        }\\n        if (g > 0) {\\n            y.lShiftTo(g, y);\\n        }\\n        return y;\\n    };\\n    // BigInteger.prototype.isProbablePrime = bnIsProbablePrime;\\n    // (public) test primality with certainty >= 1-.5^t\\n    BigInteger.prototype.isProbablePrime = function (t) {\\n        var i;\\n        var x = this.abs();\\n        if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {\\n            for (i = 0; i < lowprimes.length; ++i) {\\n                if (x[0] == lowprimes[i]) {\\n                    return true;\\n                }\\n            }\\n            return false;\\n        }\\n        if (x.isEven()) {\\n            return false;\\n        }\\n        i = 1;\\n        while (i < lowprimes.length) {\\n            var m = lowprimes[i];\\n            var j = i + 1;\\n            while (j < lowprimes.length && m < lplim) {\\n                m *= lowprimes[j++];\\n            }\\n            m = x.modInt(m);\\n            while (i < j) {\\n                if (m % lowprimes[i++] == 0) {\\n                    return false;\\n                }\\n            }\\n        }\\n        return x.millerRabin(t);\\n    };\\n    //#endregion PUBLIC\\n    //#region PROTECTED\\n    // BigInteger.prototype.copyTo = bnpCopyTo;\\n    // (protected) copy this to r\\n    BigInteger.prototype.copyTo = function (r) {\\n        for (var i = this.t - 1; i >= 0; --i) {\\n            r[i] = this[i];\\n        }\\n        r.t = this.t;\\n        r.s = this.s;\\n    };\\n    // BigInteger.prototype.fromInt = bnpFromInt;\\n    // (protected) set from integer value x, -DV <= x < DV\\n    BigInteger.prototype.fromInt = function (x) {\\n        this.t = 1;\\n        this.s = (x < 0) ? -1 : 0;\\n        if (x > 0) {\\n            this[0] = x;\\n        }\\n        else if (x < -1) {\\n            this[0] = x + this.DV;\\n        }\\n        else {\\n            this.t = 0;\\n        }\\n    };\\n    // BigInteger.prototype.fromString = bnpFromString;\\n    // (protected) set from string and radix\\n    BigInteger.prototype.fromString = function (s, b) {\\n        var k;\\n        if (b == 16) {\\n            k = 4;\\n        }\\n        else if (b == 8) {\\n            k = 3;\\n        }\\n        else if (b == 256) {\\n            k = 8;\\n            /* byte array */\\n        }\\n        else if (b == 2) {\\n            k = 1;\\n        }\\n        else if (b == 32) {\\n            k = 5;\\n        }\\n        else if (b == 4) {\\n            k = 2;\\n        }\\n        else {\\n            this.fromRadix(s, b);\\n            return;\\n        }\\n        this.t = 0;\\n        this.s = 0;\\n        var i = s.length;\\n        var mi = false;\\n        var sh = 0;\\n        while (--i >= 0) {\\n            var x = (k == 8) ? (+s[i]) & 0xff : intAt(s, i);\\n            if (x < 0) {\\n                if (s.charAt(i) == \\\"-\\\") {\\n                    mi = true;\\n                }\\n                continue;\\n            }\\n            mi = false;\\n            if (sh == 0) {\\n                this[this.t++] = x;\\n            }\\n            else if (sh + k > this.DB) {\\n                this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n                this[this.t++] = (x >> (this.DB - sh));\\n            }\\n            else {\\n                this[this.t - 1] |= x << sh;\\n            }\\n            sh += k;\\n            if (sh >= this.DB) {\\n                sh -= this.DB;\\n            }\\n        }\\n        if (k == 8 && ((+s[0]) & 0x80) != 0) {\\n            this.s = -1;\\n            if (sh > 0) {\\n                this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n            }\\n        }\\n        this.clamp();\\n        if (mi) {\\n            BigInteger.ZERO.subTo(this, this);\\n        }\\n    };\\n    // BigInteger.prototype.clamp = bnpClamp;\\n    // (protected) clamp off excess high words\\n    BigInteger.prototype.clamp = function () {\\n        var c = this.s & this.DM;\\n        while (this.t > 0 && this[this.t - 1] == c) {\\n            --this.t;\\n        }\\n    };\\n    // BigInteger.prototype.dlShiftTo = bnpDLShiftTo;\\n    // (protected) r = this << n*DB\\n    BigInteger.prototype.dlShiftTo = function (n, r) {\\n        var i;\\n        for (i = this.t - 1; i >= 0; --i) {\\n            r[i + n] = this[i];\\n        }\\n        for (i = n - 1; i >= 0; --i) {\\n            r[i] = 0;\\n        }\\n        r.t = this.t + n;\\n        r.s = this.s;\\n    };\\n    // BigInteger.prototype.drShiftTo = bnpDRShiftTo;\\n    // (protected) r = this >> n*DB\\n    BigInteger.prototype.drShiftTo = function (n, r) {\\n        for (var i = n; i < this.t; ++i) {\\n            r[i - n] = this[i];\\n        }\\n        r.t = Math.max(this.t - n, 0);\\n        r.s = this.s;\\n    };\\n    // BigInteger.prototype.lShiftTo = bnpLShiftTo;\\n    // (protected) r = this << n\\n    BigInteger.prototype.lShiftTo = function (n, r) {\\n        var bs = n % this.DB;\\n        var cbs = this.DB - bs;\\n        var bm = (1 << cbs) - 1;\\n        var ds = Math.floor(n / this.DB);\\n        var c = (this.s << bs) & this.DM;\\n        for (var i = this.t - 1; i >= 0; --i) {\\n            r[i + ds + 1] = (this[i] >> cbs) | c;\\n            c = (this[i] & bm) << bs;\\n        }\\n        for (var i = ds - 1; i >= 0; --i) {\\n            r[i] = 0;\\n        }\\n        r[ds] = c;\\n        r.t = this.t + ds + 1;\\n        r.s = this.s;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.rShiftTo = bnpRShiftTo;\\n    // (protected) r = this >> n\\n    BigInteger.prototype.rShiftTo = function (n, r) {\\n        r.s = this.s;\\n        var ds = Math.floor(n / this.DB);\\n        if (ds >= this.t) {\\n            r.t = 0;\\n            return;\\n        }\\n        var bs = n % this.DB;\\n        var cbs = this.DB - bs;\\n        var bm = (1 << bs) - 1;\\n        r[0] = this[ds] >> bs;\\n        for (var i = ds + 1; i < this.t; ++i) {\\n            r[i - ds - 1] |= (this[i] & bm) << cbs;\\n            r[i - ds] = this[i] >> bs;\\n        }\\n        if (bs > 0) {\\n            r[this.t - ds - 1] |= (this.s & bm) << cbs;\\n        }\\n        r.t = this.t - ds;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.subTo = bnpSubTo;\\n    // (protected) r = this - a\\n    BigInteger.prototype.subTo = function (a, r) {\\n        var i = 0;\\n        var c = 0;\\n        var m = Math.min(a.t, this.t);\\n        while (i < m) {\\n            c += this[i] - a[i];\\n            r[i++] = c & this.DM;\\n            c >>= this.DB;\\n        }\\n        if (a.t < this.t) {\\n            c -= a.s;\\n            while (i < this.t) {\\n                c += this[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c += this.s;\\n        }\\n        else {\\n            c += this.s;\\n            while (i < a.t) {\\n                c -= a[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c -= a.s;\\n        }\\n        r.s = (c < 0) ? -1 : 0;\\n        if (c < -1) {\\n            r[i++] = this.DV + c;\\n        }\\n        else if (c > 0) {\\n            r[i++] = c;\\n        }\\n        r.t = i;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.multiplyTo = bnpMultiplyTo;\\n    // (protected) r = this * a, r != this,a (HAC 14.12)\\n    // \\\"this\\\" should be the larger one if appropriate.\\n    BigInteger.prototype.multiplyTo = function (a, r) {\\n        var x = this.abs();\\n        var y = a.abs();\\n        var i = x.t;\\n        r.t = i + y.t;\\n        while (--i >= 0) {\\n            r[i] = 0;\\n        }\\n        for (i = 0; i < y.t; ++i) {\\n            r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);\\n        }\\n        r.s = 0;\\n        r.clamp();\\n        if (this.s != a.s) {\\n            BigInteger.ZERO.subTo(r, r);\\n        }\\n    };\\n    // BigInteger.prototype.squareTo = bnpSquareTo;\\n    // (protected) r = this^2, r != this (HAC 14.16)\\n    BigInteger.prototype.squareTo = function (r) {\\n        var x = this.abs();\\n        var i = r.t = 2 * x.t;\\n        while (--i >= 0) {\\n            r[i] = 0;\\n        }\\n        for (i = 0; i < x.t - 1; ++i) {\\n            var c = x.am(i, x[i], r, 2 * i, 0, 1);\\n            if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {\\n                r[i + x.t] -= x.DV;\\n                r[i + x.t + 1] = 1;\\n            }\\n        }\\n        if (r.t > 0) {\\n            r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);\\n        }\\n        r.s = 0;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.divRemTo = bnpDivRemTo;\\n    // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\\n    // r != q, this != m.  q or r may be null.\\n    BigInteger.prototype.divRemTo = function (m, q, r) {\\n        var pm = m.abs();\\n        if (pm.t <= 0) {\\n            return;\\n        }\\n        var pt = this.abs();\\n        if (pt.t < pm.t) {\\n            if (q != null) {\\n                q.fromInt(0);\\n            }\\n            if (r != null) {\\n                this.copyTo(r);\\n            }\\n            return;\\n        }\\n        if (r == null) {\\n            r = nbi();\\n        }\\n        var y = nbi();\\n        var ts = this.s;\\n        var ms = m.s;\\n        var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus\\n        if (nsh > 0) {\\n            pm.lShiftTo(nsh, y);\\n            pt.lShiftTo(nsh, r);\\n        }\\n        else {\\n            pm.copyTo(y);\\n            pt.copyTo(r);\\n        }\\n        var ys = y.t;\\n        var y0 = y[ys - 1];\\n        if (y0 == 0) {\\n            return;\\n        }\\n        var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);\\n        var d1 = this.FV / yt;\\n        var d2 = (1 << this.F1) / yt;\\n        var e = 1 << this.F2;\\n        var i = r.t;\\n        var j = i - ys;\\n        var t = (q == null) ? nbi() : q;\\n        y.dlShiftTo(j, t);\\n        if (r.compareTo(t) >= 0) {\\n            r[r.t++] = 1;\\n            r.subTo(t, r);\\n        }\\n        BigInteger.ONE.dlShiftTo(ys, t);\\n        t.subTo(y, y); // \\\"negative\\\" y so we can replace sub with am later\\n        while (y.t < ys) {\\n            y[y.t++] = 0;\\n        }\\n        while (--j >= 0) {\\n            // Estimate quotient digit\\n            var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);\\n            if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) { // Try it out\\n                y.dlShiftTo(j, t);\\n                r.subTo(t, r);\\n                while (r[i] < --qd) {\\n                    r.subTo(t, r);\\n                }\\n            }\\n        }\\n        if (q != null) {\\n            r.drShiftTo(ys, q);\\n            if (ts != ms) {\\n                BigInteger.ZERO.subTo(q, q);\\n            }\\n        }\\n        r.t = ys;\\n        r.clamp();\\n        if (nsh > 0) {\\n            r.rShiftTo(nsh, r);\\n        } // Denormalize remainder\\n        if (ts < 0) {\\n            BigInteger.ZERO.subTo(r, r);\\n        }\\n    };\\n    // BigInteger.prototype.invDigit = bnpInvDigit;\\n    // (protected) return \\\"-1/this % 2^DB\\\"; useful for Mont. reduction\\n    // justification:\\n    //         xy == 1 (mod m)\\n    //         xy =  1+km\\n    //   xy(2-xy) = (1+km)(1-km)\\n    // x[y(2-xy)] = 1-k^2m^2\\n    // x[y(2-xy)] == 1 (mod m^2)\\n    // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\\n    // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\\n    // JS multiply \\\"overflows\\\" differently from C/C++, so care is needed here.\\n    BigInteger.prototype.invDigit = function () {\\n        if (this.t < 1) {\\n            return 0;\\n        }\\n        var x = this[0];\\n        if ((x & 1) == 0) {\\n            return 0;\\n        }\\n        var y = x & 3; // y == 1/x mod 2^2\\n        y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4\\n        y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8\\n        y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16\\n        // last step - calculate inverse mod DV directly;\\n        // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\\n        y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits\\n        // we really want the negative inverse, and -DV < y < DV\\n        return (y > 0) ? this.DV - y : -y;\\n    };\\n    // BigInteger.prototype.isEven = bnpIsEven;\\n    // (protected) true iff this is even\\n    BigInteger.prototype.isEven = function () {\\n        return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;\\n    };\\n    // BigInteger.prototype.exp = bnpExp;\\n    // (protected) this^e, e < 2^32, doing sqr and mul with \\\"r\\\" (HAC 14.79)\\n    BigInteger.prototype.exp = function (e, z) {\\n        if (e > 0xffffffff || e < 1) {\\n            return BigInteger.ONE;\\n        }\\n        var r = nbi();\\n        var r2 = nbi();\\n        var g = z.convert(this);\\n        var i = nbits(e) - 1;\\n        g.copyTo(r);\\n        while (--i >= 0) {\\n            z.sqrTo(r, r2);\\n            if ((e & (1 << i)) > 0) {\\n                z.mulTo(r2, g, r);\\n            }\\n            else {\\n                var t = r;\\n                r = r2;\\n                r2 = t;\\n            }\\n        }\\n        return z.revert(r);\\n    };\\n    // BigInteger.prototype.chunkSize = bnpChunkSize;\\n    // (protected) return x s.t. r^x < DV\\n    BigInteger.prototype.chunkSize = function (r) {\\n        return Math.floor(Math.LN2 * this.DB / Math.log(r));\\n    };\\n    // BigInteger.prototype.toRadix = bnpToRadix;\\n    // (protected) convert to radix string\\n    BigInteger.prototype.toRadix = function (b) {\\n        if (b == null) {\\n            b = 10;\\n        }\\n        if (this.signum() == 0 || b < 2 || b > 36) {\\n            return \\\"0\\\";\\n        }\\n        var cs = this.chunkSize(b);\\n        var a = Math.pow(b, cs);\\n        var d = nbv(a);\\n        var y = nbi();\\n        var z = nbi();\\n        var r = \\\"\\\";\\n        this.divRemTo(d, y, z);\\n        while (y.signum() > 0) {\\n            r = (a + z.intValue()).toString(b).substr(1) + r;\\n            y.divRemTo(d, y, z);\\n        }\\n        return z.intValue().toString(b) + r;\\n    };\\n    // BigInteger.prototype.fromRadix = bnpFromRadix;\\n    // (protected) convert from radix string\\n    BigInteger.prototype.fromRadix = function (s, b) {\\n        this.fromInt(0);\\n        if (b == null) {\\n            b = 10;\\n        }\\n        var cs = this.chunkSize(b);\\n        var d = Math.pow(b, cs);\\n        var mi = false;\\n        var j = 0;\\n        var w = 0;\\n        for (var i = 0; i < s.length; ++i) {\\n            var x = intAt(s, i);\\n            if (x < 0) {\\n                if (s.charAt(i) == \\\"-\\\" && this.signum() == 0) {\\n                    mi = true;\\n                }\\n                continue;\\n            }\\n            w = b * w + x;\\n            if (++j >= cs) {\\n                this.dMultiply(d);\\n                this.dAddOffset(w, 0);\\n                j = 0;\\n                w = 0;\\n            }\\n        }\\n        if (j > 0) {\\n            this.dMultiply(Math.pow(b, j));\\n            this.dAddOffset(w, 0);\\n        }\\n        if (mi) {\\n            BigInteger.ZERO.subTo(this, this);\\n        }\\n    };\\n    // BigInteger.prototype.fromNumber = bnpFromNumber;\\n    // (protected) alternate constructor\\n    BigInteger.prototype.fromNumber = function (a, b, c) {\\n        if (\\\"number\\\" == typeof b) {\\n            // new BigInteger(int,int,RNG)\\n            if (a < 2) {\\n                this.fromInt(1);\\n            }\\n            else {\\n                this.fromNumber(a, c);\\n                if (!this.testBit(a - 1)) {\\n                    // force MSB set\\n                    this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), _util__WEBPACK_IMPORTED_MODULE_0__.op_or, this);\\n                }\\n                if (this.isEven()) {\\n                    this.dAddOffset(1, 0);\\n                } // force odd\\n                while (!this.isProbablePrime(b)) {\\n                    this.dAddOffset(2, 0);\\n                    if (this.bitLength() > a) {\\n                        this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);\\n                    }\\n                }\\n            }\\n        }\\n        else {\\n            // new BigInteger(int,RNG)\\n            var x = [];\\n            var t = a & 7;\\n            x.length = (a >> 3) + 1;\\n            b.nextBytes(x);\\n            if (t > 0) {\\n                x[0] &= ((1 << t) - 1);\\n            }\\n            else {\\n                x[0] = 0;\\n            }\\n            this.fromString(x, 256);\\n        }\\n    };\\n    // BigInteger.prototype.bitwiseTo = bnpBitwiseTo;\\n    // (protected) r = this op a (bitwise)\\n    BigInteger.prototype.bitwiseTo = function (a, op, r) {\\n        var i;\\n        var f;\\n        var m = Math.min(a.t, this.t);\\n        for (i = 0; i < m; ++i) {\\n            r[i] = op(this[i], a[i]);\\n        }\\n        if (a.t < this.t) {\\n            f = a.s & this.DM;\\n            for (i = m; i < this.t; ++i) {\\n                r[i] = op(this[i], f);\\n            }\\n            r.t = this.t;\\n        }\\n        else {\\n            f = this.s & this.DM;\\n            for (i = m; i < a.t; ++i) {\\n                r[i] = op(f, a[i]);\\n            }\\n            r.t = a.t;\\n        }\\n        r.s = op(this.s, a.s);\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.changeBit = bnpChangeBit;\\n    // (protected) this op (1<<n)\\n    BigInteger.prototype.changeBit = function (n, op) {\\n        var r = BigInteger.ONE.shiftLeft(n);\\n        this.bitwiseTo(r, op, r);\\n        return r;\\n    };\\n    // BigInteger.prototype.addTo = bnpAddTo;\\n    // (protected) r = this + a\\n    BigInteger.prototype.addTo = function (a, r) {\\n        var i = 0;\\n        var c = 0;\\n        var m = Math.min(a.t, this.t);\\n        while (i < m) {\\n            c += this[i] + a[i];\\n            r[i++] = c & this.DM;\\n            c >>= this.DB;\\n        }\\n        if (a.t < this.t) {\\n            c += a.s;\\n            while (i < this.t) {\\n                c += this[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c += this.s;\\n        }\\n        else {\\n            c += this.s;\\n            while (i < a.t) {\\n                c += a[i];\\n                r[i++] = c & this.DM;\\n                c >>= this.DB;\\n            }\\n            c += a.s;\\n        }\\n        r.s = (c < 0) ? -1 : 0;\\n        if (c > 0) {\\n            r[i++] = c;\\n        }\\n        else if (c < -1) {\\n            r[i++] = this.DV + c;\\n        }\\n        r.t = i;\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.dMultiply = bnpDMultiply;\\n    // (protected) this *= n, this >= 0, 1 < n < DV\\n    BigInteger.prototype.dMultiply = function (n) {\\n        this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);\\n        ++this.t;\\n        this.clamp();\\n    };\\n    // BigInteger.prototype.dAddOffset = bnpDAddOffset;\\n    // (protected) this += n << w words, this >= 0\\n    BigInteger.prototype.dAddOffset = function (n, w) {\\n        if (n == 0) {\\n            return;\\n        }\\n        while (this.t <= w) {\\n            this[this.t++] = 0;\\n        }\\n        this[w] += n;\\n        while (this[w] >= this.DV) {\\n            this[w] -= this.DV;\\n            if (++w >= this.t) {\\n                this[this.t++] = 0;\\n            }\\n            ++this[w];\\n        }\\n    };\\n    // BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\\n    // (protected) r = lower n words of \\\"this * a\\\", a.t <= n\\n    // \\\"this\\\" should be the larger one if appropriate.\\n    BigInteger.prototype.multiplyLowerTo = function (a, n, r) {\\n        var i = Math.min(this.t + a.t, n);\\n        r.s = 0; // assumes a,this >= 0\\n        r.t = i;\\n        while (i > 0) {\\n            r[--i] = 0;\\n        }\\n        for (var j = r.t - this.t; i < j; ++i) {\\n            r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);\\n        }\\n        for (var j = Math.min(a.t, n); i < j; ++i) {\\n            this.am(0, a[i], r, i, 0, n - i);\\n        }\\n        r.clamp();\\n    };\\n    // BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\\n    // (protected) r = \\\"this * a\\\" without lower n words, n > 0\\n    // \\\"this\\\" should be the larger one if appropriate.\\n    BigInteger.prototype.multiplyUpperTo = function (a, n, r) {\\n        --n;\\n        var i = r.t = this.t + a.t - n;\\n        r.s = 0; // assumes a,this >= 0\\n        while (--i >= 0) {\\n            r[i] = 0;\\n        }\\n        for (i = Math.max(n - this.t, 0); i < a.t; ++i) {\\n            r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);\\n        }\\n        r.clamp();\\n        r.drShiftTo(1, r);\\n    };\\n    // BigInteger.prototype.modInt = bnpModInt;\\n    // (protected) this % n, n < 2^26\\n    BigInteger.prototype.modInt = function (n) {\\n        if (n <= 0) {\\n            return 0;\\n        }\\n        var d = this.DV % n;\\n        var r = (this.s < 0) ? n - 1 : 0;\\n        if (this.t > 0) {\\n            if (d == 0) {\\n                r = this[0] % n;\\n            }\\n            else {\\n                for (var i = this.t - 1; i >= 0; --i) {\\n                    r = (d * r + this[i]) % n;\\n                }\\n            }\\n        }\\n        return r;\\n    };\\n    // BigInteger.prototype.millerRabin = bnpMillerRabin;\\n    // (protected) true if probably prime (HAC 4.24, Miller-Rabin)\\n    BigInteger.prototype.millerRabin = function (t) {\\n        var n1 = this.subtract(BigInteger.ONE);\\n        var k = n1.getLowestSetBit();\\n        if (k <= 0) {\\n            return false;\\n        }\\n        var r = n1.shiftRight(k);\\n        t = (t + 1) >> 1;\\n        if (t > lowprimes.length) {\\n            t = lowprimes.length;\\n        }\\n        var a = nbi();\\n        for (var i = 0; i < t; ++i) {\\n            // Pick bases at random, instead of starting at 2\\n            a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);\\n            var y = a.modPow(r, this);\\n            if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\\n                var j = 1;\\n                while (j++ < k && y.compareTo(n1) != 0) {\\n                    y = y.modPowInt(2, this);\\n                    if (y.compareTo(BigInteger.ONE) == 0) {\\n                        return false;\\n                    }\\n                }\\n                if (y.compareTo(n1) != 0) {\\n                    return false;\\n                }\\n            }\\n        }\\n        return true;\\n    };\\n    // BigInteger.prototype.square = bnSquare;\\n    // (public) this^2\\n    BigInteger.prototype.square = function () {\\n        var r = nbi();\\n        this.squareTo(r);\\n        return r;\\n    };\\n    //#region ASYNC\\n    // Public API method\\n    BigInteger.prototype.gcda = function (a, callback) {\\n        var x = (this.s < 0) ? this.negate() : this.clone();\\n        var y = (a.s < 0) ? a.negate() : a.clone();\\n        if (x.compareTo(y) < 0) {\\n            var t = x;\\n            x = y;\\n            y = t;\\n        }\\n        var i = x.getLowestSetBit();\\n        var g = y.getLowestSetBit();\\n        if (g < 0) {\\n            callback(x);\\n            return;\\n        }\\n        if (i < g) {\\n            g = i;\\n        }\\n        if (g > 0) {\\n            x.rShiftTo(g, x);\\n            y.rShiftTo(g, y);\\n        }\\n        // Workhorse of the algorithm, gets called 200 - 800 times per 512 bit keygen.\\n        var gcda1 = function () {\\n            if ((i = x.getLowestSetBit()) > 0) {\\n                x.rShiftTo(i, x);\\n            }\\n            if ((i = y.getLowestSetBit()) > 0) {\\n                y.rShiftTo(i, y);\\n            }\\n            if (x.compareTo(y) >= 0) {\\n                x.subTo(y, x);\\n                x.rShiftTo(1, x);\\n            }\\n            else {\\n                y.subTo(x, y);\\n                y.rShiftTo(1, y);\\n            }\\n            if (!(x.signum() > 0)) {\\n                if (g > 0) {\\n                    y.lShiftTo(g, y);\\n                }\\n                setTimeout(function () { callback(y); }, 0); // escape\\n            }\\n            else {\\n                setTimeout(gcda1, 0);\\n            }\\n        };\\n        setTimeout(gcda1, 10);\\n    };\\n    // (protected) alternate constructor\\n    BigInteger.prototype.fromNumberAsync = function (a, b, c, callback) {\\n        if (\\\"number\\\" == typeof b) {\\n            if (a < 2) {\\n                this.fromInt(1);\\n            }\\n            else {\\n                this.fromNumber(a, c);\\n                if (!this.testBit(a - 1)) {\\n                    this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), _util__WEBPACK_IMPORTED_MODULE_0__.op_or, this);\\n                }\\n                if (this.isEven()) {\\n                    this.dAddOffset(1, 0);\\n                }\\n                var bnp_1 = this;\\n                var bnpfn1_1 = function () {\\n                    bnp_1.dAddOffset(2, 0);\\n                    if (bnp_1.bitLength() > a) {\\n                        bnp_1.subTo(BigInteger.ONE.shiftLeft(a - 1), bnp_1);\\n                    }\\n                    if (bnp_1.isProbablePrime(b)) {\\n                        setTimeout(function () { callback(); }, 0); // escape\\n                    }\\n                    else {\\n                        setTimeout(bnpfn1_1, 0);\\n                    }\\n                };\\n                setTimeout(bnpfn1_1, 0);\\n            }\\n        }\\n        else {\\n            var x = [];\\n            var t = a & 7;\\n            x.length = (a >> 3) + 1;\\n            b.nextBytes(x);\\n            if (t > 0) {\\n                x[0] &= ((1 << t) - 1);\\n            }\\n            else {\\n                x[0] = 0;\\n            }\\n            this.fromString(x, 256);\\n        }\\n    };\\n    return BigInteger;\\n}());\\n\\n//#region REDUCERS\\n//#region NullExp\\nvar NullExp = /** @class */ (function () {\\n    function NullExp() {\\n    }\\n    // NullExp.prototype.convert = nNop;\\n    NullExp.prototype.convert = function (x) {\\n        return x;\\n    };\\n    // NullExp.prototype.revert = nNop;\\n    NullExp.prototype.revert = function (x) {\\n        return x;\\n    };\\n    // NullExp.prototype.mulTo = nMulTo;\\n    NullExp.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n    };\\n    // NullExp.prototype.sqrTo = nSqrTo;\\n    NullExp.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n    };\\n    return NullExp;\\n}());\\n// Modular reduction using \\\"classic\\\" algorithm\\nvar Classic = /** @class */ (function () {\\n    function Classic(m) {\\n        this.m = m;\\n    }\\n    // Classic.prototype.convert = cConvert;\\n    Classic.prototype.convert = function (x) {\\n        if (x.s < 0 || x.compareTo(this.m) >= 0) {\\n            return x.mod(this.m);\\n        }\\n        else {\\n            return x;\\n        }\\n    };\\n    // Classic.prototype.revert = cRevert;\\n    Classic.prototype.revert = function (x) {\\n        return x;\\n    };\\n    // Classic.prototype.reduce = cReduce;\\n    Classic.prototype.reduce = function (x) {\\n        x.divRemTo(this.m, null, x);\\n    };\\n    // Classic.prototype.mulTo = cMulTo;\\n    Classic.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n        this.reduce(r);\\n    };\\n    // Classic.prototype.sqrTo = cSqrTo;\\n    Classic.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n        this.reduce(r);\\n    };\\n    return Classic;\\n}());\\n//#endregion\\n//#region Montgomery\\n// Montgomery reduction\\nvar Montgomery = /** @class */ (function () {\\n    function Montgomery(m) {\\n        this.m = m;\\n        this.mp = m.invDigit();\\n        this.mpl = this.mp & 0x7fff;\\n        this.mph = this.mp >> 15;\\n        this.um = (1 << (m.DB - 15)) - 1;\\n        this.mt2 = 2 * m.t;\\n    }\\n    // Montgomery.prototype.convert = montConvert;\\n    // xR mod m\\n    Montgomery.prototype.convert = function (x) {\\n        var r = nbi();\\n        x.abs().dlShiftTo(this.m.t, r);\\n        r.divRemTo(this.m, null, r);\\n        if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {\\n            this.m.subTo(r, r);\\n        }\\n        return r;\\n    };\\n    // Montgomery.prototype.revert = montRevert;\\n    // x/R mod m\\n    Montgomery.prototype.revert = function (x) {\\n        var r = nbi();\\n        x.copyTo(r);\\n        this.reduce(r);\\n        return r;\\n    };\\n    // Montgomery.prototype.reduce = montReduce;\\n    // x = x/R mod m (HAC 14.32)\\n    Montgomery.prototype.reduce = function (x) {\\n        while (x.t <= this.mt2) {\\n            // pad x so am has enough room later\\n            x[x.t++] = 0;\\n        }\\n        for (var i = 0; i < this.m.t; ++i) {\\n            // faster way of calculating u0 = x[i]*mp mod DV\\n            var j = x[i] & 0x7fff;\\n            var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;\\n            // use am to combine the multiply-shift-add into one call\\n            j = i + this.m.t;\\n            x[j] += this.m.am(0, u0, x, i, 0, this.m.t);\\n            // propagate carry\\n            while (x[j] >= x.DV) {\\n                x[j] -= x.DV;\\n                x[++j]++;\\n            }\\n        }\\n        x.clamp();\\n        x.drShiftTo(this.m.t, x);\\n        if (x.compareTo(this.m) >= 0) {\\n            x.subTo(this.m, x);\\n        }\\n    };\\n    // Montgomery.prototype.mulTo = montMulTo;\\n    // r = \\\"xy/R mod m\\\"; x,y != r\\n    Montgomery.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n        this.reduce(r);\\n    };\\n    // Montgomery.prototype.sqrTo = montSqrTo;\\n    // r = \\\"x^2/R mod m\\\"; x != r\\n    Montgomery.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n        this.reduce(r);\\n    };\\n    return Montgomery;\\n}());\\n//#endregion Montgomery\\n//#region Barrett\\n// Barrett modular reduction\\nvar Barrett = /** @class */ (function () {\\n    function Barrett(m) {\\n        this.m = m;\\n        // setup Barrett\\n        this.r2 = nbi();\\n        this.q3 = nbi();\\n        BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);\\n        this.mu = this.r2.divide(m);\\n    }\\n    // Barrett.prototype.convert = barrettConvert;\\n    Barrett.prototype.convert = function (x) {\\n        if (x.s < 0 || x.t > 2 * this.m.t) {\\n            return x.mod(this.m);\\n        }\\n        else if (x.compareTo(this.m) < 0) {\\n            return x;\\n        }\\n        else {\\n            var r = nbi();\\n            x.copyTo(r);\\n            this.reduce(r);\\n            return r;\\n        }\\n    };\\n    // Barrett.prototype.revert = barrettRevert;\\n    Barrett.prototype.revert = function (x) {\\n        return x;\\n    };\\n    // Barrett.prototype.reduce = barrettReduce;\\n    // x = x mod m (HAC 14.42)\\n    Barrett.prototype.reduce = function (x) {\\n        x.drShiftTo(this.m.t - 1, this.r2);\\n        if (x.t > this.m.t + 1) {\\n            x.t = this.m.t + 1;\\n            x.clamp();\\n        }\\n        this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);\\n        this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);\\n        while (x.compareTo(this.r2) < 0) {\\n            x.dAddOffset(1, this.m.t + 1);\\n        }\\n        x.subTo(this.r2, x);\\n        while (x.compareTo(this.m) >= 0) {\\n            x.subTo(this.m, x);\\n        }\\n    };\\n    // Barrett.prototype.mulTo = barrettMulTo;\\n    // r = x*y mod m; x,y != r\\n    Barrett.prototype.mulTo = function (x, y, r) {\\n        x.multiplyTo(y, r);\\n        this.reduce(r);\\n    };\\n    // Barrett.prototype.sqrTo = barrettSqrTo;\\n    // r = x^2 mod m; x != r\\n    Barrett.prototype.sqrTo = function (x, r) {\\n        x.squareTo(r);\\n        this.reduce(r);\\n    };\\n    return Barrett;\\n}());\\n//#endregion\\n//#endregion REDUCERS\\n// return new, unset BigInteger\\nfunction nbi() { return new BigInteger(null); }\\nfunction parseBigInt(str, r) {\\n    return new BigInteger(str, r);\\n}\\n// am: Compute w_j += (x*this_i), propagate carries,\\n// c is initial carry, returns final carry.\\n// c < 3*dvalue, x < 2*dvalue, this_i < dvalue\\n// We need to select the fastest one that works in this environment.\\nvar inBrowser = typeof navigator !== \\\"undefined\\\";\\nif (inBrowser && j_lm && (navigator.appName == \\\"Microsoft Internet Explorer\\\")) {\\n    // am2 avoids a big mult-and-extract completely.\\n    // Max digit bits should be <= 30 because we do bitwise ops\\n    // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\\n    BigInteger.prototype.am = function am2(i, x, w, j, c, n) {\\n        var xl = x & 0x7fff;\\n        var xh = x >> 15;\\n        while (--n >= 0) {\\n            var l = this[i] & 0x7fff;\\n            var h = this[i++] >> 15;\\n            var m = xh * l + h * xl;\\n            l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n            c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n            w[j++] = l & 0x3fffffff;\\n        }\\n        return c;\\n    };\\n    dbits = 30;\\n}\\nelse if (inBrowser && j_lm && (navigator.appName != \\\"Netscape\\\")) {\\n    // am1: use a single mult and divide to get the high bits,\\n    // max digit bits should be 26 because\\n    // max internal value = 2*dvalue^2-2*dvalue (< 2^53)\\n    BigInteger.prototype.am = function am1(i, x, w, j, c, n) {\\n        while (--n >= 0) {\\n            var v = x * this[i++] + w[j] + c;\\n            c = Math.floor(v / 0x4000000);\\n            w[j++] = v & 0x3ffffff;\\n        }\\n        return c;\\n    };\\n    dbits = 26;\\n}\\nelse { // Mozilla/Netscape seems to prefer am3\\n    // Alternately, set max digit bits to 28 since some\\n    // browsers slow down when dealing with 32-bit numbers.\\n    BigInteger.prototype.am = function am3(i, x, w, j, c, n) {\\n        var xl = x & 0x3fff;\\n        var xh = x >> 14;\\n        while (--n >= 0) {\\n            var l = this[i] & 0x3fff;\\n            var h = this[i++] >> 14;\\n            var m = xh * l + h * xl;\\n            l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;\\n            c = (l >> 28) + (m >> 14) + xh * h;\\n            w[j++] = l & 0xfffffff;\\n        }\\n        return c;\\n    };\\n    dbits = 28;\\n}\\nBigInteger.prototype.DB = dbits;\\nBigInteger.prototype.DM = ((1 << dbits) - 1);\\nBigInteger.prototype.DV = (1 << dbits);\\nvar BI_FP = 52;\\nBigInteger.prototype.FV = Math.pow(2, BI_FP);\\nBigInteger.prototype.F1 = BI_FP - dbits;\\nBigInteger.prototype.F2 = 2 * dbits - BI_FP;\\n// Digit conversions\\nvar BI_RC = [];\\nvar rr;\\nvar vv;\\nrr = \\\"0\\\".charCodeAt(0);\\nfor (vv = 0; vv <= 9; ++vv) {\\n    BI_RC[rr++] = vv;\\n}\\nrr = \\\"a\\\".charCodeAt(0);\\nfor (vv = 10; vv < 36; ++vv) {\\n    BI_RC[rr++] = vv;\\n}\\nrr = \\\"A\\\".charCodeAt(0);\\nfor (vv = 10; vv < 36; ++vv) {\\n    BI_RC[rr++] = vv;\\n}\\nfunction intAt(s, i) {\\n    var c = BI_RC[s.charCodeAt(i)];\\n    return (c == null) ? -1 : c;\\n}\\n// return bigint initialized to value\\nfunction nbv(i) {\\n    var r = nbi();\\n    r.fromInt(i);\\n    return r;\\n}\\n// returns bit length of the integer x\\nfunction nbits(x) {\\n    var r = 1;\\n    var t;\\n    if ((t = x >>> 16) != 0) {\\n        x = t;\\n        r += 16;\\n    }\\n    if ((t = x >> 8) != 0) {\\n        x = t;\\n        r += 8;\\n    }\\n    if ((t = x >> 4) != 0) {\\n        x = t;\\n        r += 4;\\n    }\\n    if ((t = x >> 2) != 0) {\\n        x = t;\\n        r += 2;\\n    }\\n    if ((t = x >> 1) != 0) {\\n        x = t;\\n        r += 1;\\n    }\\n    return r;\\n}\\n// \\\"constants\\\"\\nBigInteger.ZERO = nbv(0);\\nBigInteger.ONE = nbv(1);\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/jsbn.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/prng4.js\":\n/*!*******************************!*\\\n  !*** ./lib/lib/jsbn/prng4.js ***!\n  \\*******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"Arcfour\\\": () => (/* binding */ Arcfour),\\n/* harmony export */   \\\"prng_newstate\\\": () => (/* binding */ prng_newstate),\\n/* harmony export */   \\\"rng_psize\\\": () => (/* binding */ rng_psize)\\n/* harmony export */ });\\n// prng4.js - uses Arcfour as a PRNG\\nvar Arcfour = /** @class */ (function () {\\n    function Arcfour() {\\n        this.i = 0;\\n        this.j = 0;\\n        this.S = [];\\n    }\\n    // Arcfour.prototype.init = ARC4init;\\n    // Initialize arcfour context from key, an array of ints, each from [0..255]\\n    Arcfour.prototype.init = function (key) {\\n        var i;\\n        var j;\\n        var t;\\n        for (i = 0; i < 256; ++i) {\\n            this.S[i] = i;\\n        }\\n        j = 0;\\n        for (i = 0; i < 256; ++i) {\\n            j = (j + this.S[i] + key[i % key.length]) & 255;\\n            t = this.S[i];\\n            this.S[i] = this.S[j];\\n            this.S[j] = t;\\n        }\\n        this.i = 0;\\n        this.j = 0;\\n    };\\n    // Arcfour.prototype.next = ARC4next;\\n    Arcfour.prototype.next = function () {\\n        var t;\\n        this.i = (this.i + 1) & 255;\\n        this.j = (this.j + this.S[this.i]) & 255;\\n        t = this.S[this.i];\\n        this.S[this.i] = this.S[this.j];\\n        this.S[this.j] = t;\\n        return this.S[(t + this.S[this.i]) & 255];\\n    };\\n    return Arcfour;\\n}());\\n\\n// Plug in your RNG constructor here\\nfunction prng_newstate() {\\n    return new Arcfour();\\n}\\n// Pool size must be a multiple of 4 and greater than 32.\\n// An array of bytes the size of the pool will be passed to init()\\nvar rng_psize = 256;\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/prng4.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/rng.js\":\n/*!*****************************!*\\\n  !*** ./lib/lib/jsbn/rng.js ***!\n  \\*****************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"SecureRandom\\\": () => (/* binding */ SecureRandom)\\n/* harmony export */ });\\n/* harmony import */ var _prng4__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./prng4 */ \\\"./lib/lib/jsbn/prng4.js\\\");\\n// Random number generator - requires a PRNG backend, e.g. prng4.js\\n\\nvar rng_state;\\nvar rng_pool = null;\\nvar rng_pptr;\\n// Initialize the pool with junk if needed.\\nif (rng_pool == null) {\\n    rng_pool = [];\\n    rng_pptr = 0;\\n    var t = void 0;\\n    if (window.crypto && window.crypto.getRandomValues) {\\n        // Extract entropy (2048 bits) from RNG if available\\n        var z = new Uint32Array(256);\\n        window.crypto.getRandomValues(z);\\n        for (t = 0; t < z.length; ++t) {\\n            rng_pool[rng_pptr++] = z[t] & 255;\\n        }\\n    }\\n    // Use mouse events for entropy, if we do not have enough entropy by the time\\n    // we need it, entropy will be generated by Math.random.\\n    var count = 0;\\n    var onMouseMoveListener_1 = function (ev) {\\n        count = count || 0;\\n        if (count >= 256 || rng_pptr >= _prng4__WEBPACK_IMPORTED_MODULE_0__.rng_psize) {\\n            if (window.removeEventListener) {\\n                window.removeEventListener(\\\"mousemove\\\", onMouseMoveListener_1, false);\\n            }\\n            else if (window.detachEvent) {\\n                window.detachEvent(\\\"onmousemove\\\", onMouseMoveListener_1);\\n            }\\n            return;\\n        }\\n        try {\\n            var mouseCoordinates = ev.x + ev.y;\\n            rng_pool[rng_pptr++] = mouseCoordinates & 255;\\n            count += 1;\\n        }\\n        catch (e) {\\n            // Sometimes Firefox will deny permission to access event properties for some reason. Ignore.\\n        }\\n    };\\n    if (window.addEventListener) {\\n        window.addEventListener(\\\"mousemove\\\", onMouseMoveListener_1, false);\\n    }\\n    else if (window.attachEvent) {\\n        window.attachEvent(\\\"onmousemove\\\", onMouseMoveListener_1);\\n    }\\n}\\nfunction rng_get_byte() {\\n    if (rng_state == null) {\\n        rng_state = (0,_prng4__WEBPACK_IMPORTED_MODULE_0__.prng_newstate)();\\n        // At this point, we may not have collected enough entropy.  If not, fall back to Math.random\\n        while (rng_pptr < _prng4__WEBPACK_IMPORTED_MODULE_0__.rng_psize) {\\n            var random = Math.floor(65536 * Math.random());\\n            rng_pool[rng_pptr++] = random & 255;\\n        }\\n        rng_state.init(rng_pool);\\n        for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr) {\\n            rng_pool[rng_pptr] = 0;\\n        }\\n        rng_pptr = 0;\\n    }\\n    // TODO: allow reseeding after first request\\n    return rng_state.next();\\n}\\nvar SecureRandom = /** @class */ (function () {\\n    function SecureRandom() {\\n    }\\n    SecureRandom.prototype.nextBytes = function (ba) {\\n        for (var i = 0; i < ba.length; ++i) {\\n            ba[i] = rng_get_byte();\\n        }\\n    };\\n    return SecureRandom;\\n}());\\n\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/rng.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/rsa.js\":\n/*!*****************************!*\\\n  !*** ./lib/lib/jsbn/rsa.js ***!\n  \\*****************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"RSAKey\\\": () => (/* binding */ RSAKey)\\n/* harmony export */ });\\n/* harmony import */ var _jsbn__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./jsbn */ \\\"./lib/lib/jsbn/jsbn.js\\\");\\n/* harmony import */ var _rng__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./rng */ \\\"./lib/lib/jsbn/rng.js\\\");\\n// Depends on jsbn.js and rng.js\\n// Version 1.1: support utf-8 encoding in pkcs1pad2\\n// convert a (hex) string to a bignum object\\n\\n\\n// function linebrk(s,n) {\\n//   var ret = \\\"\\\";\\n//   var i = 0;\\n//   while(i + n < s.length) {\\n//     ret += s.substring(i,i+n) + \\\"\\\\n\\\";\\n//     i += n;\\n//   }\\n//   return ret + s.substring(i,s.length);\\n// }\\n// function byte2Hex(b) {\\n//   if(b < 0x10)\\n//     return \\\"0\\\" + b.toString(16);\\n//   else\\n//     return b.toString(16);\\n// }\\nfunction pkcs1pad1(s, n) {\\n    if (n < s.length + 22) {\\n        console.error(\\\"Message too long for RSA\\\");\\n        return null;\\n    }\\n    var len = n - s.length - 6;\\n    var filler = \\\"\\\";\\n    for (var f = 0; f < len; f += 2) {\\n        filler += \\\"ff\\\";\\n    }\\n    var m = \\\"0001\\\" + filler + \\\"00\\\" + s;\\n    return (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(m, 16);\\n}\\n// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint\\nfunction pkcs1pad2(s, n) {\\n    if (n < s.length + 11) { // TODO: fix for utf-8\\n        console.error(\\\"Message too long for RSA\\\");\\n        return null;\\n    }\\n    var ba = [];\\n    var i = s.length - 1;\\n    while (i >= 0 && n > 0) {\\n        var c = s.charCodeAt(i--);\\n        if (c < 128) { // encode using utf-8\\n            ba[--n] = c;\\n        }\\n        else if ((c > 127) && (c < 2048)) {\\n            ba[--n] = (c & 63) | 128;\\n            ba[--n] = (c >> 6) | 192;\\n        }\\n        else {\\n            ba[--n] = (c & 63) | 128;\\n            ba[--n] = ((c >> 6) & 63) | 128;\\n            ba[--n] = (c >> 12) | 224;\\n        }\\n    }\\n    ba[--n] = 0;\\n    var rng = new _rng__WEBPACK_IMPORTED_MODULE_1__.SecureRandom();\\n    var x = [];\\n    while (n > 2) { // random non-zero pad\\n        x[0] = 0;\\n        while (x[0] == 0) {\\n            rng.nextBytes(x);\\n        }\\n        ba[--n] = x[0];\\n    }\\n    ba[--n] = 2;\\n    ba[--n] = 0;\\n    return new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(ba);\\n}\\n// \\\"empty\\\" RSA key constructor\\nvar RSAKey = /** @class */ (function () {\\n    function RSAKey() {\\n        this.n = null;\\n        this.e = 0;\\n        this.d = null;\\n        this.p = null;\\n        this.q = null;\\n        this.dmp1 = null;\\n        this.dmq1 = null;\\n        this.coeff = null;\\n    }\\n    //#region PROTECTED\\n    // protected\\n    // RSAKey.prototype.doPublic = RSADoPublic;\\n    // Perform raw public operation on \\\"x\\\": return x^e (mod n)\\n    RSAKey.prototype.doPublic = function (x) {\\n        return x.modPowInt(this.e, this.n);\\n    };\\n    // RSAKey.prototype.doPrivate = RSADoPrivate;\\n    // Perform raw private operation on \\\"x\\\": return x^d (mod n)\\n    RSAKey.prototype.doPrivate = function (x) {\\n        if (this.p == null || this.q == null) {\\n            return x.modPow(this.d, this.n);\\n        }\\n        // TODO: re-calculate any missing CRT params\\n        var xp = x.mod(this.p).modPow(this.dmp1, this.p);\\n        var xq = x.mod(this.q).modPow(this.dmq1, this.q);\\n        while (xp.compareTo(xq) < 0) {\\n            xp = xp.add(this.p);\\n        }\\n        return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq);\\n    };\\n    //#endregion PROTECTED\\n    //#region PUBLIC\\n    // RSAKey.prototype.setPublic = RSASetPublic;\\n    // Set the public key fields N and e from hex strings\\n    RSAKey.prototype.setPublic = function (N, E) {\\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\\n            this.n = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(N, 16);\\n            this.e = parseInt(E, 16);\\n        }\\n        else {\\n            console.error(\\\"Invalid RSA public key\\\");\\n        }\\n    };\\n    // RSAKey.prototype.encrypt = RSAEncrypt;\\n    // Return the PKCS#1 RSA encryption of \\\"text\\\" as an even-length hex string\\n    RSAKey.prototype.encrypt = function (text) {\\n        var maxLength = (this.n.bitLength() + 7) >> 3;\\n        var m = pkcs1pad2(text, maxLength);\\n        if (m == null) {\\n            return null;\\n        }\\n        var c = this.doPublic(m);\\n        if (c == null) {\\n            return null;\\n        }\\n        var h = c.toString(16);\\n        var length = h.length;\\n        // fix zero before result\\n        for (var i = 0; i < maxLength * 2 - length; i++) {\\n            h = \\\"0\\\" + h;\\n        }\\n        return h;\\n    };\\n    // RSAKey.prototype.setPrivate = RSASetPrivate;\\n    // Set the private key fields N, e, and d from hex strings\\n    RSAKey.prototype.setPrivate = function (N, E, D) {\\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\\n            this.n = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(N, 16);\\n            this.e = parseInt(E, 16);\\n            this.d = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(D, 16);\\n        }\\n        else {\\n            console.error(\\\"Invalid RSA private key\\\");\\n        }\\n    };\\n    // RSAKey.prototype.setPrivateEx = RSASetPrivateEx;\\n    // Set the private key fields N, e, d and CRT params from hex strings\\n    RSAKey.prototype.setPrivateEx = function (N, E, D, P, Q, DP, DQ, C) {\\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\\n            this.n = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(N, 16);\\n            this.e = parseInt(E, 16);\\n            this.d = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(D, 16);\\n            this.p = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(P, 16);\\n            this.q = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(Q, 16);\\n            this.dmp1 = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(DP, 16);\\n            this.dmq1 = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(DQ, 16);\\n            this.coeff = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(C, 16);\\n        }\\n        else {\\n            console.error(\\\"Invalid RSA private key\\\");\\n        }\\n    };\\n    // RSAKey.prototype.generate = RSAGenerate;\\n    // Generate a new random private key B bits long, using public expt E\\n    RSAKey.prototype.generate = function (B, E) {\\n        var rng = new _rng__WEBPACK_IMPORTED_MODULE_1__.SecureRandom();\\n        var qs = B >> 1;\\n        this.e = parseInt(E, 16);\\n        var ee = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(E, 16);\\n        for (;;) {\\n            for (;;) {\\n                this.p = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(B - qs, 1, rng);\\n                if (this.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) {\\n                    break;\\n                }\\n            }\\n            for (;;) {\\n                this.q = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(qs, 1, rng);\\n                if (this.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) {\\n                    break;\\n                }\\n            }\\n            if (this.p.compareTo(this.q) <= 0) {\\n                var t = this.p;\\n                this.p = this.q;\\n                this.q = t;\\n            }\\n            var p1 = this.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n            var q1 = this.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n            var phi = p1.multiply(q1);\\n            if (phi.gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0) {\\n                this.n = this.p.multiply(this.q);\\n                this.d = ee.modInverse(phi);\\n                this.dmp1 = this.d.mod(p1);\\n                this.dmq1 = this.d.mod(q1);\\n                this.coeff = this.q.modInverse(this.p);\\n                break;\\n            }\\n        }\\n    };\\n    // RSAKey.prototype.decrypt = RSADecrypt;\\n    // Return the PKCS#1 RSA decryption of \\\"ctext\\\".\\n    // \\\"ctext\\\" is an even-length hex string and the output is a plain string.\\n    RSAKey.prototype.decrypt = function (ctext) {\\n        var c = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(ctext, 16);\\n        var m = this.doPrivate(c);\\n        if (m == null) {\\n            return null;\\n        }\\n        return pkcs1unpad2(m, (this.n.bitLength() + 7) >> 3);\\n    };\\n    // Generate a new random private key B bits long, using public expt E\\n    RSAKey.prototype.generateAsync = function (B, E, callback) {\\n        var rng = new _rng__WEBPACK_IMPORTED_MODULE_1__.SecureRandom();\\n        var qs = B >> 1;\\n        this.e = parseInt(E, 16);\\n        var ee = new _jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(E, 16);\\n        var rsa = this;\\n        // These functions have non-descript names because they were originally for(;;) loops.\\n        // I don't know about cryptography to give them better names than loop1-4.\\n        var loop1 = function () {\\n            var loop4 = function () {\\n                if (rsa.p.compareTo(rsa.q) <= 0) {\\n                    var t = rsa.p;\\n                    rsa.p = rsa.q;\\n                    rsa.q = t;\\n                }\\n                var p1 = rsa.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n                var q1 = rsa.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n                var phi = p1.multiply(q1);\\n                if (phi.gcd(ee).compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0) {\\n                    rsa.n = rsa.p.multiply(rsa.q);\\n                    rsa.d = ee.modInverse(phi);\\n                    rsa.dmp1 = rsa.d.mod(p1);\\n                    rsa.dmq1 = rsa.d.mod(q1);\\n                    rsa.coeff = rsa.q.modInverse(rsa.p);\\n                    setTimeout(function () { callback(); }, 0); // escape\\n                }\\n                else {\\n                    setTimeout(loop1, 0);\\n                }\\n            };\\n            var loop3 = function () {\\n                rsa.q = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.nbi)();\\n                rsa.q.fromNumberAsync(qs, 1, rng, function () {\\n                    rsa.q.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcda(ee, function (r) {\\n                        if (r.compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && rsa.q.isProbablePrime(10)) {\\n                            setTimeout(loop4, 0);\\n                        }\\n                        else {\\n                            setTimeout(loop3, 0);\\n                        }\\n                    });\\n                });\\n            };\\n            var loop2 = function () {\\n                rsa.p = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.nbi)();\\n                rsa.p.fromNumberAsync(B - qs, 1, rng, function () {\\n                    rsa.p.subtract(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE).gcda(ee, function (r) {\\n                        if (r.compareTo(_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE) == 0 && rsa.p.isProbablePrime(10)) {\\n                            setTimeout(loop3, 0);\\n                        }\\n                        else {\\n                            setTimeout(loop2, 0);\\n                        }\\n                    });\\n                });\\n            };\\n            setTimeout(loop2, 0);\\n        };\\n        setTimeout(loop1, 0);\\n    };\\n    RSAKey.prototype.sign = function (text, digestMethod, digestName) {\\n        var header = getDigestHeader(digestName);\\n        var digest = header + digestMethod(text).toString();\\n        var m = pkcs1pad1(digest, this.n.bitLength() / 4);\\n        if (m == null) {\\n            return null;\\n        }\\n        var c = this.doPrivate(m);\\n        if (c == null) {\\n            return null;\\n        }\\n        var h = c.toString(16);\\n        if ((h.length & 1) == 0) {\\n            return h;\\n        }\\n        else {\\n            return \\\"0\\\" + h;\\n        }\\n    };\\n    RSAKey.prototype.verify = function (text, signature, digestMethod) {\\n        var c = (0,_jsbn__WEBPACK_IMPORTED_MODULE_0__.parseBigInt)(signature, 16);\\n        var m = this.doPublic(c);\\n        if (m == null) {\\n            return null;\\n        }\\n        var unpadded = m.toString(16).replace(/^1f+00/, \\\"\\\");\\n        var digest = removeDigestHeader(unpadded);\\n        return digest == digestMethod(text).toString();\\n    };\\n    return RSAKey;\\n}());\\n\\n// Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext\\nfunction pkcs1unpad2(d, n) {\\n    var b = d.toByteArray();\\n    var i = 0;\\n    while (i < b.length && b[i] == 0) {\\n        ++i;\\n    }\\n    if (b.length - i != n - 1 || b[i] != 2) {\\n        return null;\\n    }\\n    ++i;\\n    while (b[i] != 0) {\\n        if (++i >= b.length) {\\n            return null;\\n        }\\n    }\\n    var ret = \\\"\\\";\\n    while (++i < b.length) {\\n        var c = b[i] & 255;\\n        if (c < 128) { // utf-8 decode\\n            ret += String.fromCharCode(c);\\n        }\\n        else if ((c > 191) && (c < 224)) {\\n            ret += String.fromCharCode(((c & 31) << 6) | (b[i + 1] & 63));\\n            ++i;\\n        }\\n        else {\\n            ret += String.fromCharCode(((c & 15) << 12) | ((b[i + 1] & 63) << 6) | (b[i + 2] & 63));\\n            i += 2;\\n        }\\n    }\\n    return ret;\\n}\\n// https://tools.ietf.org/html/rfc3447#page-43\\nvar DIGEST_HEADERS = {\\n    md2: \\\"3020300c06082a864886f70d020205000410\\\",\\n    md5: \\\"3020300c06082a864886f70d020505000410\\\",\\n    sha1: \\\"3021300906052b0e03021a05000414\\\",\\n    sha224: \\\"302d300d06096086480165030402040500041c\\\",\\n    sha256: \\\"3031300d060960864801650304020105000420\\\",\\n    sha384: \\\"3041300d060960864801650304020205000430\\\",\\n    sha512: \\\"3051300d060960864801650304020305000440\\\",\\n    ripemd160: \\\"3021300906052b2403020105000414\\\"\\n};\\nfunction getDigestHeader(name) {\\n    return DIGEST_HEADERS[name] || \\\"\\\";\\n}\\nfunction removeDigestHeader(str) {\\n    for (var name_1 in DIGEST_HEADERS) {\\n        if (DIGEST_HEADERS.hasOwnProperty(name_1)) {\\n            var header = DIGEST_HEADERS[name_1];\\n            var len = header.length;\\n            if (str.substr(0, len) == header) {\\n                return str.substr(len);\\n            }\\n        }\\n    }\\n    return str;\\n}\\n// Return the PKCS#1 RSA encryption of \\\"text\\\" as a Base64-encoded string\\n// function RSAEncryptB64(text) {\\n//  var h = this.encrypt(text);\\n//  if(h) return hex2b64(h); else return null;\\n// }\\n// public\\n// RSAKey.prototype.encrypt_b64 = RSAEncryptB64;\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/rsa.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsbn/util.js\":\n/*!******************************!*\\\n  !*** ./lib/lib/jsbn/util.js ***!\n  \\******************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"int2char\\\": () => (/* binding */ int2char),\\n/* harmony export */   \\\"op_and\\\": () => (/* binding */ op_and),\\n/* harmony export */   \\\"op_or\\\": () => (/* binding */ op_or),\\n/* harmony export */   \\\"op_xor\\\": () => (/* binding */ op_xor),\\n/* harmony export */   \\\"op_andnot\\\": () => (/* binding */ op_andnot),\\n/* harmony export */   \\\"lbit\\\": () => (/* binding */ lbit),\\n/* harmony export */   \\\"cbit\\\": () => (/* binding */ cbit)\\n/* harmony export */ });\\nvar BI_RM = \\\"0123456789abcdefghijklmnopqrstuvwxyz\\\";\\nfunction int2char(n) {\\n    return BI_RM.charAt(n);\\n}\\n//#region BIT_OPERATIONS\\n// (public) this & a\\nfunction op_and(x, y) {\\n    return x & y;\\n}\\n// (public) this | a\\nfunction op_or(x, y) {\\n    return x | y;\\n}\\n// (public) this ^ a\\nfunction op_xor(x, y) {\\n    return x ^ y;\\n}\\n// (public) this & ~a\\nfunction op_andnot(x, y) {\\n    return x & ~y;\\n}\\n// return index of lowest 1-bit in x, x < 2^31\\nfunction lbit(x) {\\n    if (x == 0) {\\n        return -1;\\n    }\\n    var r = 0;\\n    if ((x & 0xffff) == 0) {\\n        x >>= 16;\\n        r += 16;\\n    }\\n    if ((x & 0xff) == 0) {\\n        x >>= 8;\\n        r += 8;\\n    }\\n    if ((x & 0xf) == 0) {\\n        x >>= 4;\\n        r += 4;\\n    }\\n    if ((x & 3) == 0) {\\n        x >>= 2;\\n        r += 2;\\n    }\\n    if ((x & 1) == 0) {\\n        ++r;\\n    }\\n    return r;\\n}\\n// return number of 1 bits in x\\nfunction cbit(x) {\\n    var r = 0;\\n    while (x != 0) {\\n        x &= x - 1;\\n        ++r;\\n    }\\n    return r;\\n}\\n//#endregion BIT_OPERATIONS\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsbn/util.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsrsasign/asn1-1.0.js\":\n/*!***************************************!*\\\n  !*** ./lib/lib/jsrsasign/asn1-1.0.js ***!\n  \\***************************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"KJUR\\\": () => (/* binding */ KJUR)\\n/* harmony export */ });\\n/* harmony import */ var _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../jsbn/jsbn */ \\\"./lib/lib/jsbn/jsbn.js\\\");\\n/* harmony import */ var _yahoo__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./yahoo */ \\\"./lib/lib/jsrsasign/yahoo.js\\\");\\n/* asn1-1.0.13.js (c) 2013-2017 Kenji Urushima | kjur.github.com/jsrsasign/license\\n */\\n/*\\n * asn1.js - ASN.1 DER encoder classes\\n *\\n * Copyright (c) 2013-2017 Kenji Urushima (kenji.urushima@gmail.com)\\n *\\n * This software is licensed under the terms of the MIT License.\\n * https://kjur.github.io/jsrsasign/license\\n *\\n * The above copyright and license notice shall be\\n * included in all copies or substantial portions of the Software.\\n */\\n\\n\\n/**\\n * @fileOverview\\n * @name asn1-1.0.js\\n * @author Kenji Urushima kenji.urushima@gmail.com\\n * @version asn1 1.0.13 (2017-Jun-02)\\n * @since jsrsasign 2.1\\n * @license <a href=\\\"https://kjur.github.io/jsrsasign/license/\\\">MIT License</a>\\n */\\n/**\\n * kjur's class library name space\\n * <p>\\n * This name space provides following name spaces:\\n * <ul>\\n * <li>{@link KJUR.asn1} - ASN.1 primitive hexadecimal encoder</li>\\n * <li>{@link KJUR.asn1.x509} - ASN.1 structure for X.509 certificate and CRL</li>\\n * <li>{@link KJUR.crypto} - Java Cryptographic Extension(JCE) style MessageDigest/Signature\\n * class and utilities</li>\\n * </ul>\\n * </p>\\n * NOTE: Please ignore method summary and document of this namespace. This caused by a bug of jsdoc2.\\n * @name KJUR\\n * @namespace kjur's class library name space\\n */\\nvar KJUR = {};\\n/**\\n * kjur's ASN.1 class library name space\\n * <p>\\n * This is ITU-T X.690 ASN.1 DER encoder class library and\\n * class structure and methods is very similar to\\n * org.bouncycastle.asn1 package of\\n * well known BouncyCaslte Cryptography Library.\\n * <h4>PROVIDING ASN.1 PRIMITIVES</h4>\\n * Here are ASN.1 DER primitive classes.\\n * <ul>\\n * <li>0x01 {@link KJUR.asn1.DERBoolean}</li>\\n * <li>0x02 {@link KJUR.asn1.DERInteger}</li>\\n * <li>0x03 {@link KJUR.asn1.DERBitString}</li>\\n * <li>0x04 {@link KJUR.asn1.DEROctetString}</li>\\n * <li>0x05 {@link KJUR.asn1.DERNull}</li>\\n * <li>0x06 {@link KJUR.asn1.DERObjectIdentifier}</li>\\n * <li>0x0a {@link KJUR.asn1.DEREnumerated}</li>\\n * <li>0x0c {@link KJUR.asn1.DERUTF8String}</li>\\n * <li>0x12 {@link KJUR.asn1.DERNumericString}</li>\\n * <li>0x13 {@link KJUR.asn1.DERPrintableString}</li>\\n * <li>0x14 {@link KJUR.asn1.DERTeletexString}</li>\\n * <li>0x16 {@link KJUR.asn1.DERIA5String}</li>\\n * <li>0x17 {@link KJUR.asn1.DERUTCTime}</li>\\n * <li>0x18 {@link KJUR.asn1.DERGeneralizedTime}</li>\\n * <li>0x30 {@link KJUR.asn1.DERSequence}</li>\\n * <li>0x31 {@link KJUR.asn1.DERSet}</li>\\n * </ul>\\n * <h4>OTHER ASN.1 CLASSES</h4>\\n * <ul>\\n * <li>{@link KJUR.asn1.ASN1Object}</li>\\n * <li>{@link KJUR.asn1.DERAbstractString}</li>\\n * <li>{@link KJUR.asn1.DERAbstractTime}</li>\\n * <li>{@link KJUR.asn1.DERAbstractStructured}</li>\\n * <li>{@link KJUR.asn1.DERTaggedObject}</li>\\n * </ul>\\n * <h4>SUB NAME SPACES</h4>\\n * <ul>\\n * <li>{@link KJUR.asn1.cades} - CAdES long term signature format</li>\\n * <li>{@link KJUR.asn1.cms} - Cryptographic Message Syntax</li>\\n * <li>{@link KJUR.asn1.csr} - Certificate Signing Request (CSR/PKCS#10)</li>\\n * <li>{@link KJUR.asn1.tsp} - RFC 3161 Timestamping Protocol Format</li>\\n * <li>{@link KJUR.asn1.x509} - RFC 5280 X.509 certificate and CRL</li>\\n * </ul>\\n * </p>\\n * NOTE: Please ignore method summary and document of this namespace.\\n * This caused by a bug of jsdoc2.\\n * @name KJUR.asn1\\n * @namespace\\n */\\nif (typeof KJUR.asn1 == \\\"undefined\\\" || !KJUR.asn1)\\n    KJUR.asn1 = {};\\n/**\\n * ASN1 utilities class\\n * @name KJUR.asn1.ASN1Util\\n * @class ASN1 utilities class\\n * @since asn1 1.0.2\\n */\\nKJUR.asn1.ASN1Util = new function () {\\n    this.integerToByteHex = function (i) {\\n        var h = i.toString(16);\\n        if ((h.length % 2) == 1)\\n            h = '0' + h;\\n        return h;\\n    };\\n    this.bigIntToMinTwosComplementsHex = function (bigIntegerValue) {\\n        var h = bigIntegerValue.toString(16);\\n        if (h.substr(0, 1) != '-') {\\n            if (h.length % 2 == 1) {\\n                h = '0' + h;\\n            }\\n            else {\\n                if (!h.match(/^[0-7]/)) {\\n                    h = '00' + h;\\n                }\\n            }\\n        }\\n        else {\\n            var hPos = h.substr(1);\\n            var xorLen = hPos.length;\\n            if (xorLen % 2 == 1) {\\n                xorLen += 1;\\n            }\\n            else {\\n                if (!h.match(/^[0-7]/)) {\\n                    xorLen += 2;\\n                }\\n            }\\n            var hMask = '';\\n            for (var i = 0; i < xorLen; i++) {\\n                hMask += 'f';\\n            }\\n            var biMask = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(hMask, 16);\\n            var biNeg = biMask.xor(bigIntegerValue).add(_jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger.ONE);\\n            h = biNeg.toString(16).replace(/^-/, '');\\n        }\\n        return h;\\n    };\\n    /**\\n     * get PEM string from hexadecimal data and header string\\n     * @name getPEMStringFromHex\\n     * @memberOf KJUR.asn1.ASN1Util\\n     * @function\\n     * @param {String} dataHex hexadecimal string of PEM body\\n     * @param {String} pemHeader PEM header string (ex. 'RSA PRIVATE KEY')\\n     * @return {String} PEM formatted string of input data\\n     * @description\\n     * This method converts a hexadecimal string to a PEM string with\\n     * a specified header. Its line break will be CRLF(\\\"\\\\r\\\\n\\\").\\n     * @example\\n     * var pem  = KJUR.asn1.ASN1Util.getPEMStringFromHex('616161', 'RSA PRIVATE KEY');\\n     * // value of pem will be:\\n     * -----BEGIN PRIVATE KEY-----\\n     * YWFh\\n     * -----END PRIVATE KEY-----\\n     */\\n    this.getPEMStringFromHex = function (dataHex, pemHeader) {\\n        return hextopem(dataHex, pemHeader);\\n    };\\n    /**\\n     * generate ASN1Object specifed by JSON parameters\\n     * @name newObject\\n     * @memberOf KJUR.asn1.ASN1Util\\n     * @function\\n     * @param {Array} param JSON parameter to generate ASN1Object\\n     * @return {KJUR.asn1.ASN1Object} generated object\\n     * @since asn1 1.0.3\\n     * @description\\n     * generate any ASN1Object specified by JSON param\\n     * including ASN.1 primitive or structured.\\n     * Generally 'param' can be described as follows:\\n     * <blockquote>\\n     * {TYPE-OF-ASNOBJ: ASN1OBJ-PARAMETER}\\n     * </blockquote>\\n     * 'TYPE-OF-ASN1OBJ' can be one of following symbols:\\n     * <ul>\\n     * <li>'bool' - DERBoolean</li>\\n     * <li>'int' - DERInteger</li>\\n     * <li>'bitstr' - DERBitString</li>\\n     * <li>'octstr' - DEROctetString</li>\\n     * <li>'null' - DERNull</li>\\n     * <li>'oid' - DERObjectIdentifier</li>\\n     * <li>'enum' - DEREnumerated</li>\\n     * <li>'utf8str' - DERUTF8String</li>\\n     * <li>'numstr' - DERNumericString</li>\\n     * <li>'prnstr' - DERPrintableString</li>\\n     * <li>'telstr' - DERTeletexString</li>\\n     * <li>'ia5str' - DERIA5String</li>\\n     * <li>'utctime' - DERUTCTime</li>\\n     * <li>'gentime' - DERGeneralizedTime</li>\\n     * <li>'seq' - DERSequence</li>\\n     * <li>'set' - DERSet</li>\\n     * <li>'tag' - DERTaggedObject</li>\\n     * </ul>\\n     * @example\\n     * newObject({'prnstr': 'aaa'});\\n     * newObject({'seq': [{'int': 3}, {'prnstr': 'aaa'}]})\\n     * // ASN.1 Tagged Object\\n     * newObject({'tag': {'tag': 'a1',\\n     *                    'explicit': true,\\n     *                    'obj': {'seq': [{'int': 3}, {'prnstr': 'aaa'}]}}});\\n     * // more simple representation of ASN.1 Tagged Object\\n     * newObject({'tag': ['a1',\\n     *                    true,\\n     *                    {'seq': [\\n     *                      {'int': 3},\\n     *                      {'prnstr': 'aaa'}]}\\n     *                   ]});\\n     */\\n    this.newObject = function (param) {\\n        var _KJUR = KJUR, _KJUR_asn1 = _KJUR.asn1, _DERBoolean = _KJUR_asn1.DERBoolean, _DERInteger = _KJUR_asn1.DERInteger, _DERBitString = _KJUR_asn1.DERBitString, _DEROctetString = _KJUR_asn1.DEROctetString, _DERNull = _KJUR_asn1.DERNull, _DERObjectIdentifier = _KJUR_asn1.DERObjectIdentifier, _DEREnumerated = _KJUR_asn1.DEREnumerated, _DERUTF8String = _KJUR_asn1.DERUTF8String, _DERNumericString = _KJUR_asn1.DERNumericString, _DERPrintableString = _KJUR_asn1.DERPrintableString, _DERTeletexString = _KJUR_asn1.DERTeletexString, _DERIA5String = _KJUR_asn1.DERIA5String, _DERUTCTime = _KJUR_asn1.DERUTCTime, _DERGeneralizedTime = _KJUR_asn1.DERGeneralizedTime, _DERSequence = _KJUR_asn1.DERSequence, _DERSet = _KJUR_asn1.DERSet, _DERTaggedObject = _KJUR_asn1.DERTaggedObject, _newObject = _KJUR_asn1.ASN1Util.newObject;\\n        var keys = Object.keys(param);\\n        if (keys.length != 1)\\n            throw \\\"key of param shall be only one.\\\";\\n        var key = keys[0];\\n        if (\\\":bool:int:bitstr:octstr:null:oid:enum:utf8str:numstr:prnstr:telstr:ia5str:utctime:gentime:seq:set:tag:\\\".indexOf(\\\":\\\" + key + \\\":\\\") == -1)\\n            throw \\\"undefined key: \\\" + key;\\n        if (key == \\\"bool\\\")\\n            return new _DERBoolean(param[key]);\\n        if (key == \\\"int\\\")\\n            return new _DERInteger(param[key]);\\n        if (key == \\\"bitstr\\\")\\n            return new _DERBitString(param[key]);\\n        if (key == \\\"octstr\\\")\\n            return new _DEROctetString(param[key]);\\n        if (key == \\\"null\\\")\\n            return new _DERNull(param[key]);\\n        if (key == \\\"oid\\\")\\n            return new _DERObjectIdentifier(param[key]);\\n        if (key == \\\"enum\\\")\\n            return new _DEREnumerated(param[key]);\\n        if (key == \\\"utf8str\\\")\\n            return new _DERUTF8String(param[key]);\\n        if (key == \\\"numstr\\\")\\n            return new _DERNumericString(param[key]);\\n        if (key == \\\"prnstr\\\")\\n            return new _DERPrintableString(param[key]);\\n        if (key == \\\"telstr\\\")\\n            return new _DERTeletexString(param[key]);\\n        if (key == \\\"ia5str\\\")\\n            return new _DERIA5String(param[key]);\\n        if (key == \\\"utctime\\\")\\n            return new _DERUTCTime(param[key]);\\n        if (key == \\\"gentime\\\")\\n            return new _DERGeneralizedTime(param[key]);\\n        if (key == \\\"seq\\\") {\\n            var paramList = param[key];\\n            var a = [];\\n            for (var i = 0; i < paramList.length; i++) {\\n                var asn1Obj = _newObject(paramList[i]);\\n                a.push(asn1Obj);\\n            }\\n            return new _DERSequence({ 'array': a });\\n        }\\n        if (key == \\\"set\\\") {\\n            var paramList = param[key];\\n            var a = [];\\n            for (var i = 0; i < paramList.length; i++) {\\n                var asn1Obj = _newObject(paramList[i]);\\n                a.push(asn1Obj);\\n            }\\n            return new _DERSet({ 'array': a });\\n        }\\n        if (key == \\\"tag\\\") {\\n            var tagParam = param[key];\\n            if (Object.prototype.toString.call(tagParam) === '[object Array]' &&\\n                tagParam.length == 3) {\\n                var obj = _newObject(tagParam[2]);\\n                return new _DERTaggedObject({ tag: tagParam[0],\\n                    explicit: tagParam[1],\\n                    obj: obj });\\n            }\\n            else {\\n                var newParam = {};\\n                if (tagParam.explicit !== undefined)\\n                    newParam.explicit = tagParam.explicit;\\n                if (tagParam.tag !== undefined)\\n                    newParam.tag = tagParam.tag;\\n                if (tagParam.obj === undefined)\\n                    throw \\\"obj shall be specified for 'tag'.\\\";\\n                newParam.obj = _newObject(tagParam.obj);\\n                return new _DERTaggedObject(newParam);\\n            }\\n        }\\n    };\\n    /**\\n     * get encoded hexadecimal string of ASN1Object specifed by JSON parameters\\n     * @name jsonToASN1HEX\\n     * @memberOf KJUR.asn1.ASN1Util\\n     * @function\\n     * @param {Array} param JSON parameter to generate ASN1Object\\n     * @return hexadecimal string of ASN1Object\\n     * @since asn1 1.0.4\\n     * @description\\n     * As for ASN.1 object representation of JSON object,\\n     * please see {@link newObject}.\\n     * @example\\n     * jsonToASN1HEX({'prnstr': 'aaa'});\\n     */\\n    this.jsonToASN1HEX = function (param) {\\n        var asn1Obj = this.newObject(param);\\n        return asn1Obj.getEncodedHex();\\n    };\\n};\\n/**\\n * get dot noted oid number string from hexadecimal value of OID\\n * @name oidHexToInt\\n * @memberOf KJUR.asn1.ASN1Util\\n * @function\\n * @param {String} hex hexadecimal value of object identifier\\n * @return {String} dot noted string of object identifier\\n * @since jsrsasign 4.8.3 asn1 1.0.7\\n * @description\\n * This static method converts from hexadecimal string representation of\\n * ASN.1 value of object identifier to oid number string.\\n * @example\\n * KJUR.asn1.ASN1Util.oidHexToInt('550406') &rarr; \\\"2.5.4.6\\\"\\n */\\nKJUR.asn1.ASN1Util.oidHexToInt = function (hex) {\\n    var s = \\\"\\\";\\n    var i01 = parseInt(hex.substr(0, 2), 16);\\n    var i0 = Math.floor(i01 / 40);\\n    var i1 = i01 % 40;\\n    var s = i0 + \\\".\\\" + i1;\\n    var binbuf = \\\"\\\";\\n    for (var i = 2; i < hex.length; i += 2) {\\n        var value = parseInt(hex.substr(i, 2), 16);\\n        var bin = (\\\"00000000\\\" + value.toString(2)).slice(-8);\\n        binbuf = binbuf + bin.substr(1, 7);\\n        if (bin.substr(0, 1) == \\\"0\\\") {\\n            var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(binbuf, 2);\\n            s = s + \\\".\\\" + bi.toString(10);\\n            binbuf = \\\"\\\";\\n        }\\n    }\\n    ;\\n    return s;\\n};\\n/**\\n * get hexadecimal value of object identifier from dot noted oid value\\n * @name oidIntToHex\\n * @memberOf KJUR.asn1.ASN1Util\\n * @function\\n * @param {String} oidString dot noted string of object identifier\\n * @return {String} hexadecimal value of object identifier\\n * @since jsrsasign 4.8.3 asn1 1.0.7\\n * @description\\n * This static method converts from object identifier value string.\\n * to hexadecimal string representation of it.\\n * @example\\n * KJUR.asn1.ASN1Util.oidIntToHex(\\\"2.5.4.6\\\") &rarr; \\\"550406\\\"\\n */\\nKJUR.asn1.ASN1Util.oidIntToHex = function (oidString) {\\n    var itox = function (i) {\\n        var h = i.toString(16);\\n        if (h.length == 1)\\n            h = '0' + h;\\n        return h;\\n    };\\n    var roidtox = function (roid) {\\n        var h = '';\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(roid, 10);\\n        var b = bi.toString(2);\\n        var padLen = 7 - b.length % 7;\\n        if (padLen == 7)\\n            padLen = 0;\\n        var bPad = '';\\n        for (var i = 0; i < padLen; i++)\\n            bPad += '0';\\n        b = bPad + b;\\n        for (var i = 0; i < b.length - 1; i += 7) {\\n            var b8 = b.substr(i, 7);\\n            if (i != b.length - 7)\\n                b8 = '1' + b8;\\n            h += itox(parseInt(b8, 2));\\n        }\\n        return h;\\n    };\\n    if (!oidString.match(/^[0-9.]+$/)) {\\n        throw \\\"malformed oid string: \\\" + oidString;\\n    }\\n    var h = '';\\n    var a = oidString.split('.');\\n    var i0 = parseInt(a[0]) * 40 + parseInt(a[1]);\\n    h += itox(i0);\\n    a.splice(0, 2);\\n    for (var i = 0; i < a.length; i++) {\\n        h += roidtox(a[i]);\\n    }\\n    return h;\\n};\\n// ********************************************************************\\n//  Abstract ASN.1 Classes\\n// ********************************************************************\\n// ********************************************************************\\n/**\\n * base class for ASN.1 DER encoder object\\n * @name KJUR.asn1.ASN1Object\\n * @class base class for ASN.1 DER encoder object\\n * @property {Boolean} isModified flag whether internal data was changed\\n * @property {String} hTLV hexadecimal string of ASN.1 TLV\\n * @property {String} hT hexadecimal string of ASN.1 TLV tag(T)\\n * @property {String} hL hexadecimal string of ASN.1 TLV length(L)\\n * @property {String} hV hexadecimal string of ASN.1 TLV value(V)\\n * @description\\n */\\nKJUR.asn1.ASN1Object = function () {\\n    var isModified = true;\\n    var hTLV = null;\\n    var hT = '00';\\n    var hL = '00';\\n    var hV = '';\\n    /**\\n     * get hexadecimal ASN.1 TLV length(L) bytes from TLV value(V)\\n     * @name getLengthHexFromValue\\n     * @memberOf KJUR.asn1.ASN1Object#\\n     * @function\\n     * @return {String} hexadecimal string of ASN.1 TLV length(L)\\n     */\\n    this.getLengthHexFromValue = function () {\\n        if (typeof this.hV == \\\"undefined\\\" || this.hV == null) {\\n            throw \\\"this.hV is null or undefined.\\\";\\n        }\\n        if (this.hV.length % 2 == 1) {\\n            throw \\\"value hex must be even length: n=\\\" + hV.length + \\\",v=\\\" + this.hV;\\n        }\\n        var n = this.hV.length / 2;\\n        var hN = n.toString(16);\\n        if (hN.length % 2 == 1) {\\n            hN = \\\"0\\\" + hN;\\n        }\\n        if (n < 128) {\\n            return hN;\\n        }\\n        else {\\n            var hNlen = hN.length / 2;\\n            if (hNlen > 15) {\\n                throw \\\"ASN.1 length too long to represent by 8x: n = \\\" + n.toString(16);\\n            }\\n            var head = 128 + hNlen;\\n            return head.toString(16) + hN;\\n        }\\n    };\\n    /**\\n     * get hexadecimal string of ASN.1 TLV bytes\\n     * @name getEncodedHex\\n     * @memberOf KJUR.asn1.ASN1Object#\\n     * @function\\n     * @return {String} hexadecimal string of ASN.1 TLV\\n     */\\n    this.getEncodedHex = function () {\\n        if (this.hTLV == null || this.isModified) {\\n            this.hV = this.getFreshValueHex();\\n            this.hL = this.getLengthHexFromValue();\\n            this.hTLV = this.hT + this.hL + this.hV;\\n            this.isModified = false;\\n            //alert(\\\"first time: \\\" + this.hTLV);\\n        }\\n        return this.hTLV;\\n    };\\n    /**\\n     * get hexadecimal string of ASN.1 TLV value(V) bytes\\n     * @name getValueHex\\n     * @memberOf KJUR.asn1.ASN1Object#\\n     * @function\\n     * @return {String} hexadecimal string of ASN.1 TLV value(V) bytes\\n     */\\n    this.getValueHex = function () {\\n        this.getEncodedHex();\\n        return this.hV;\\n    };\\n    this.getFreshValueHex = function () {\\n        return '';\\n    };\\n};\\n// == BEGIN DERAbstractString ================================================\\n/**\\n * base class for ASN.1 DER string classes\\n * @name KJUR.asn1.DERAbstractString\\n * @class base class for ASN.1 DER string classes\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @property {String} s internal string of value\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>str - specify initial ASN.1 value(V) by a string</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERAbstractString = function (params) {\\n    KJUR.asn1.DERAbstractString.superclass.constructor.call(this);\\n    var s = null;\\n    var hV = null;\\n    /**\\n     * get string value of this string object\\n     * @name getString\\n     * @memberOf KJUR.asn1.DERAbstractString#\\n     * @function\\n     * @return {String} string value of this string object\\n     */\\n    this.getString = function () {\\n        return this.s;\\n    };\\n    /**\\n     * set value by a string\\n     * @name setString\\n     * @memberOf KJUR.asn1.DERAbstractString#\\n     * @function\\n     * @param {String} newS value by a string to set\\n     */\\n    this.setString = function (newS) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = newS;\\n        this.hV = stohex(this.s);\\n    };\\n    /**\\n     * set value by a hexadecimal string\\n     * @name setStringHex\\n     * @memberOf KJUR.asn1.DERAbstractString#\\n     * @function\\n     * @param {String} newHexString value by a hexadecimal string to set\\n     */\\n    this.setStringHex = function (newHexString) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = null;\\n        this.hV = newHexString;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params == \\\"string\\\") {\\n            this.setString(params);\\n        }\\n        else if (typeof params['str'] != \\\"undefined\\\") {\\n            this.setString(params['str']);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setStringHex(params['hex']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERAbstractString, KJUR.asn1.ASN1Object);\\n// == END   DERAbstractString ================================================\\n// == BEGIN DERAbstractTime ==================================================\\n/**\\n * base class for ASN.1 DER Generalized/UTCTime class\\n * @name KJUR.asn1.DERAbstractTime\\n * @class base class for ASN.1 DER Generalized/UTCTime class\\n * @param {Array} params associative array of parameters (ex. {'str': '130430235959Z'})\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERAbstractTime = function (params) {\\n    KJUR.asn1.DERAbstractTime.superclass.constructor.call(this);\\n    var s = null;\\n    var date = null;\\n    // --- PRIVATE METHODS --------------------\\n    this.localDateToUTC = function (d) {\\n        utc = d.getTime() + (d.getTimezoneOffset() * 60000);\\n        var utcDate = new Date(utc);\\n        return utcDate;\\n    };\\n    /*\\n     * format date string by Data object\\n     * @name formatDate\\n     * @memberOf KJUR.asn1.AbstractTime;\\n     * @param {Date} dateObject\\n     * @param {string} type 'utc' or 'gen'\\n     * @param {boolean} withMillis flag for with millisections or not\\n     * @description\\n     * 'withMillis' flag is supported from asn1 1.0.6.\\n     */\\n    this.formatDate = function (dateObject, type, withMillis) {\\n        var pad = this.zeroPadding;\\n        var d = this.localDateToUTC(dateObject);\\n        var year = String(d.getFullYear());\\n        if (type == 'utc')\\n            year = year.substr(2, 2);\\n        var month = pad(String(d.getMonth() + 1), 2);\\n        var day = pad(String(d.getDate()), 2);\\n        var hour = pad(String(d.getHours()), 2);\\n        var min = pad(String(d.getMinutes()), 2);\\n        var sec = pad(String(d.getSeconds()), 2);\\n        var s = year + month + day + hour + min + sec;\\n        if (withMillis === true) {\\n            var millis = d.getMilliseconds();\\n            if (millis != 0) {\\n                var sMillis = pad(String(millis), 3);\\n                sMillis = sMillis.replace(/[0]+$/, \\\"\\\");\\n                s = s + \\\".\\\" + sMillis;\\n            }\\n        }\\n        return s + \\\"Z\\\";\\n    };\\n    this.zeroPadding = function (s, len) {\\n        if (s.length >= len)\\n            return s;\\n        return new Array(len - s.length + 1).join('0') + s;\\n    };\\n    // --- PUBLIC METHODS --------------------\\n    /**\\n     * get string value of this string object\\n     * @name getString\\n     * @memberOf KJUR.asn1.DERAbstractTime#\\n     * @function\\n     * @return {String} string value of this time object\\n     */\\n    this.getString = function () {\\n        return this.s;\\n    };\\n    /**\\n     * set value by a string\\n     * @name setString\\n     * @memberOf KJUR.asn1.DERAbstractTime#\\n     * @function\\n     * @param {String} newS value by a string to set such like \\\"130430235959Z\\\"\\n     */\\n    this.setString = function (newS) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = newS;\\n        this.hV = stohex(newS);\\n    };\\n    /**\\n     * set value by a Date object\\n     * @name setByDateValue\\n     * @memberOf KJUR.asn1.DERAbstractTime#\\n     * @function\\n     * @param {Integer} year year of date (ex. 2013)\\n     * @param {Integer} month month of date between 1 and 12 (ex. 12)\\n     * @param {Integer} day day of month\\n     * @param {Integer} hour hours of date\\n     * @param {Integer} min minutes of date\\n     * @param {Integer} sec seconds of date\\n     */\\n    this.setByDateValue = function (year, month, day, hour, min, sec) {\\n        var dateObject = new Date(Date.UTC(year, month - 1, day, hour, min, sec, 0));\\n        this.setByDate(dateObject);\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERAbstractTime, KJUR.asn1.ASN1Object);\\n// == END   DERAbstractTime ==================================================\\n// == BEGIN DERAbstractStructured ============================================\\n/**\\n * base class for ASN.1 DER structured class\\n * @name KJUR.asn1.DERAbstractStructured\\n * @class base class for ASN.1 DER structured class\\n * @property {Array} asn1Array internal array of ASN1Object\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERAbstractStructured = function (params) {\\n    KJUR.asn1.DERAbstractString.superclass.constructor.call(this);\\n    var asn1Array = null;\\n    /**\\n     * set value by array of ASN1Object\\n     * @name setByASN1ObjectArray\\n     * @memberOf KJUR.asn1.DERAbstractStructured#\\n     * @function\\n     * @param {array} asn1ObjectArray array of ASN1Object to set\\n     */\\n    this.setByASN1ObjectArray = function (asn1ObjectArray) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.asn1Array = asn1ObjectArray;\\n    };\\n    /**\\n     * append an ASN1Object to internal array\\n     * @name appendASN1Object\\n     * @memberOf KJUR.asn1.DERAbstractStructured#\\n     * @function\\n     * @param {ASN1Object} asn1Object to add\\n     */\\n    this.appendASN1Object = function (asn1Object) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.asn1Array.push(asn1Object);\\n    };\\n    this.asn1Array = new Array();\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['array'] != \\\"undefined\\\") {\\n            this.asn1Array = params['array'];\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERAbstractStructured, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n//  ASN.1 Object Classes\\n// ********************************************************************\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Boolean\\n * @name KJUR.asn1.DERBoolean\\n * @class class for ASN.1 DER Boolean\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERBoolean = function () {\\n    KJUR.asn1.DERBoolean.superclass.constructor.call(this);\\n    this.hT = \\\"01\\\";\\n    this.hTLV = \\\"0101ff\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERBoolean, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Integer\\n * @name KJUR.asn1.DERInteger\\n * @class class for ASN.1 DER Integer\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>int - specify initial ASN.1 value(V) by integer value</li>\\n * <li>bigint - specify initial ASN.1 value(V) by BigInteger object</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERInteger = function (params) {\\n    KJUR.asn1.DERInteger.superclass.constructor.call(this);\\n    this.hT = \\\"02\\\";\\n    /**\\n     * set value by Tom Wu's BigInteger object\\n     * @name setByBigInteger\\n     * @memberOf KJUR.asn1.DERInteger#\\n     * @function\\n     * @param {BigInteger} bigIntegerValue to set\\n     */\\n    this.setByBigInteger = function (bigIntegerValue) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = KJUR.asn1.ASN1Util.bigIntToMinTwosComplementsHex(bigIntegerValue);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setByInteger\\n     * @memberOf KJUR.asn1.DERInteger\\n     * @function\\n     * @param {Integer} integer value to set\\n     */\\n    this.setByInteger = function (intValue) {\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(String(intValue), 10);\\n        this.setByBigInteger(bi);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setValueHex\\n     * @memberOf KJUR.asn1.DERInteger#\\n     * @function\\n     * @param {String} hexadecimal string of integer value\\n     * @description\\n     * <br/>\\n     * NOTE: Value shall be represented by minimum octet length of\\n     * two's complement representation.\\n     * @example\\n     * new KJUR.asn1.DERInteger(123);\\n     * new KJUR.asn1.DERInteger({'int': 123});\\n     * new KJUR.asn1.DERInteger({'hex': '1fad'});\\n     */\\n    this.setValueHex = function (newHexString) {\\n        this.hV = newHexString;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['bigint'] != \\\"undefined\\\") {\\n            this.setByBigInteger(params['bigint']);\\n        }\\n        else if (typeof params['int'] != \\\"undefined\\\") {\\n            this.setByInteger(params['int']);\\n        }\\n        else if (typeof params == \\\"number\\\") {\\n            this.setByInteger(params);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setValueHex(params['hex']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERInteger, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER encoded BitString primitive\\n * @name KJUR.asn1.DERBitString\\n * @class class for ASN.1 DER encoded BitString primitive\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>bin - specify binary string (ex. '10111')</li>\\n * <li>array - specify array of boolean (ex. [true,false,true,true])</li>\\n * <li>hex - specify hexadecimal string of ASN.1 value(V) including unused bits</li>\\n * <li>obj - specify {@link KJUR.asn1.ASN1Util.newObject}\\n * argument for \\\"BitString encapsulates\\\" structure.</li>\\n * </ul>\\n * NOTE1: 'params' can be omitted.<br/>\\n * NOTE2: 'obj' parameter have been supported since\\n * asn1 1.0.11, jsrsasign 6.1.1 (2016-Sep-25).<br/>\\n * @example\\n * // default constructor\\n * o = new KJUR.asn1.DERBitString();\\n * // initialize with binary string\\n * o = new KJUR.asn1.DERBitString({bin: \\\"1011\\\"});\\n * // initialize with boolean array\\n * o = new KJUR.asn1.DERBitString({array: [true,false,true,true]});\\n * // initialize with hexadecimal string (04 is unused bits)\\n * o = new KJUR.asn1.DEROctetString({hex: \\\"04bac0\\\"});\\n * // initialize with ASN1Util.newObject argument for encapsulated\\n * o = new KJUR.asn1.DERBitString({obj: {seq: [{int: 3}, {prnstr: 'aaa'}]}});\\n * // above generates a ASN.1 data like this:\\n * // BIT STRING, encapsulates {\\n * //   SEQUENCE {\\n * //     INTEGER 3\\n * //     PrintableString 'aaa'\\n * //     }\\n * //   }\\n */\\nKJUR.asn1.DERBitString = function (params) {\\n    if (params !== undefined && typeof params.obj !== \\\"undefined\\\") {\\n        var o = KJUR.asn1.ASN1Util.newObject(params.obj);\\n        params.hex = \\\"00\\\" + o.getEncodedHex();\\n    }\\n    KJUR.asn1.DERBitString.superclass.constructor.call(this);\\n    this.hT = \\\"03\\\";\\n    /**\\n     * set ASN.1 value(V) by a hexadecimal string including unused bits\\n     * @name setHexValueIncludingUnusedBits\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {String} newHexStringIncludingUnusedBits\\n     */\\n    this.setHexValueIncludingUnusedBits = function (newHexStringIncludingUnusedBits) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = newHexStringIncludingUnusedBits;\\n    };\\n    /**\\n     * set ASN.1 value(V) by unused bit and hexadecimal string of value\\n     * @name setUnusedBitsAndHexValue\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {Integer} unusedBits\\n     * @param {String} hValue\\n     */\\n    this.setUnusedBitsAndHexValue = function (unusedBits, hValue) {\\n        if (unusedBits < 0 || 7 < unusedBits) {\\n            throw \\\"unused bits shall be from 0 to 7: u = \\\" + unusedBits;\\n        }\\n        var hUnusedBits = \\\"0\\\" + unusedBits;\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = hUnusedBits + hValue;\\n    };\\n    /**\\n     * set ASN.1 DER BitString by binary string<br/>\\n     * @name setByBinaryString\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {String} binaryString binary value string (i.e. '10111')\\n     * @description\\n     * Its unused bits will be calculated automatically by length of\\n     * 'binaryValue'. <br/>\\n     * NOTE: Trailing zeros '0' will be ignored.\\n     * @example\\n     * o = new KJUR.asn1.DERBitString();\\n     * o.setByBooleanArray(\\\"01011\\\");\\n     */\\n    this.setByBinaryString = function (binaryString) {\\n        binaryString = binaryString.replace(/0+$/, '');\\n        var unusedBits = 8 - binaryString.length % 8;\\n        if (unusedBits == 8)\\n            unusedBits = 0;\\n        for (var i = 0; i <= unusedBits; i++) {\\n            binaryString += '0';\\n        }\\n        var h = '';\\n        for (var i = 0; i < binaryString.length - 1; i += 8) {\\n            var b = binaryString.substr(i, 8);\\n            var x = parseInt(b, 2).toString(16);\\n            if (x.length == 1)\\n                x = '0' + x;\\n            h += x;\\n        }\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = '0' + unusedBits + h;\\n    };\\n    /**\\n     * set ASN.1 TLV value(V) by an array of boolean<br/>\\n     * @name setByBooleanArray\\n     * @memberOf KJUR.asn1.DERBitString#\\n     * @function\\n     * @param {array} booleanArray array of boolean (ex. [true, false, true])\\n     * @description\\n     * NOTE: Trailing falses will be ignored in the ASN.1 DER Object.\\n     * @example\\n     * o = new KJUR.asn1.DERBitString();\\n     * o.setByBooleanArray([false, true, false, true, true]);\\n     */\\n    this.setByBooleanArray = function (booleanArray) {\\n        var s = '';\\n        for (var i = 0; i < booleanArray.length; i++) {\\n            if (booleanArray[i] == true) {\\n                s += '1';\\n            }\\n            else {\\n                s += '0';\\n            }\\n        }\\n        this.setByBinaryString(s);\\n    };\\n    /**\\n     * generate an array of falses with specified length<br/>\\n     * @name newFalseArray\\n     * @memberOf KJUR.asn1.DERBitString\\n     * @function\\n     * @param {Integer} nLength length of array to generate\\n     * @return {array} array of boolean falses\\n     * @description\\n     * This static method may be useful to initialize boolean array.\\n     * @example\\n     * o = new KJUR.asn1.DERBitString();\\n     * o.newFalseArray(3) &rarr; [false, false, false]\\n     */\\n    this.newFalseArray = function (nLength) {\\n        var a = new Array(nLength);\\n        for (var i = 0; i < nLength; i++) {\\n            a[i] = false;\\n        }\\n        return a;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params == \\\"string\\\" && params.toLowerCase().match(/^[0-9a-f]+$/)) {\\n            this.setHexValueIncludingUnusedBits(params);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setHexValueIncludingUnusedBits(params['hex']);\\n        }\\n        else if (typeof params['bin'] != \\\"undefined\\\") {\\n            this.setByBinaryString(params['bin']);\\n        }\\n        else if (typeof params['array'] != \\\"undefined\\\") {\\n            this.setByBooleanArray(params['array']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERBitString, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER OctetString<br/>\\n * @name KJUR.asn1.DEROctetString\\n * @class class for ASN.1 DER OctetString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * This class provides ASN.1 OctetString simple type.<br/>\\n * Supported \\\"params\\\" attributes are:\\n * <ul>\\n * <li>str - to set a string as a value</li>\\n * <li>hex - to set a hexadecimal string as a value</li>\\n * <li>obj - to set a encapsulated ASN.1 value by JSON object\\n * which is defined in {@link KJUR.asn1.ASN1Util.newObject}</li>\\n * </ul>\\n * NOTE: A parameter 'obj' have been supported\\n * for \\\"OCTET STRING, encapsulates\\\" structure.\\n * since asn1 1.0.11, jsrsasign 6.1.1 (2016-Sep-25).\\n * @see KJUR.asn1.DERAbstractString - superclass\\n * @example\\n * // default constructor\\n * o = new KJUR.asn1.DEROctetString();\\n * // initialize with string\\n * o = new KJUR.asn1.DEROctetString({str: \\\"aaa\\\"});\\n * // initialize with hexadecimal string\\n * o = new KJUR.asn1.DEROctetString({hex: \\\"616161\\\"});\\n * // initialize with ASN1Util.newObject argument\\n * o = new KJUR.asn1.DEROctetString({obj: {seq: [{int: 3}, {prnstr: 'aaa'}]}});\\n * // above generates a ASN.1 data like this:\\n * // OCTET STRING, encapsulates {\\n * //   SEQUENCE {\\n * //     INTEGER 3\\n * //     PrintableString 'aaa'\\n * //     }\\n * //   }\\n */\\nKJUR.asn1.DEROctetString = function (params) {\\n    if (params !== undefined && typeof params.obj !== \\\"undefined\\\") {\\n        var o = KJUR.asn1.ASN1Util.newObject(params.obj);\\n        params.hex = o.getEncodedHex();\\n    }\\n    KJUR.asn1.DEROctetString.superclass.constructor.call(this, params);\\n    this.hT = \\\"04\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DEROctetString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Null\\n * @name KJUR.asn1.DERNull\\n * @class class for ASN.1 DER Null\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * @see KJUR.asn1.ASN1Object - superclass\\n */\\nKJUR.asn1.DERNull = function () {\\n    KJUR.asn1.DERNull.superclass.constructor.call(this);\\n    this.hT = \\\"05\\\";\\n    this.hTLV = \\\"0500\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERNull, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER ObjectIdentifier\\n * @name KJUR.asn1.DERObjectIdentifier\\n * @class class for ASN.1 DER ObjectIdentifier\\n * @param {Array} params associative array of parameters (ex. {'oid': '2.5.4.5'})\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>oid - specify initial ASN.1 value(V) by a oid string (ex. 2.5.4.13)</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERObjectIdentifier = function (params) {\\n    var itox = function (i) {\\n        var h = i.toString(16);\\n        if (h.length == 1)\\n            h = '0' + h;\\n        return h;\\n    };\\n    var roidtox = function (roid) {\\n        var h = '';\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(roid, 10);\\n        var b = bi.toString(2);\\n        var padLen = 7 - b.length % 7;\\n        if (padLen == 7)\\n            padLen = 0;\\n        var bPad = '';\\n        for (var i = 0; i < padLen; i++)\\n            bPad += '0';\\n        b = bPad + b;\\n        for (var i = 0; i < b.length - 1; i += 7) {\\n            var b8 = b.substr(i, 7);\\n            if (i != b.length - 7)\\n                b8 = '1' + b8;\\n            h += itox(parseInt(b8, 2));\\n        }\\n        return h;\\n    };\\n    KJUR.asn1.DERObjectIdentifier.superclass.constructor.call(this);\\n    this.hT = \\\"06\\\";\\n    /**\\n     * set value by a hexadecimal string\\n     * @name setValueHex\\n     * @memberOf KJUR.asn1.DERObjectIdentifier#\\n     * @function\\n     * @param {String} newHexString hexadecimal value of OID bytes\\n     */\\n    this.setValueHex = function (newHexString) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = null;\\n        this.hV = newHexString;\\n    };\\n    /**\\n     * set value by a OID string<br/>\\n     * @name setValueOidString\\n     * @memberOf KJUR.asn1.DERObjectIdentifier#\\n     * @function\\n     * @param {String} oidString OID string (ex. 2.5.4.13)\\n     * @example\\n     * o = new KJUR.asn1.DERObjectIdentifier();\\n     * o.setValueOidString(\\\"2.5.4.13\\\");\\n     */\\n    this.setValueOidString = function (oidString) {\\n        if (!oidString.match(/^[0-9.]+$/)) {\\n            throw \\\"malformed oid string: \\\" + oidString;\\n        }\\n        var h = '';\\n        var a = oidString.split('.');\\n        var i0 = parseInt(a[0]) * 40 + parseInt(a[1]);\\n        h += itox(i0);\\n        a.splice(0, 2);\\n        for (var i = 0; i < a.length; i++) {\\n            h += roidtox(a[i]);\\n        }\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.s = null;\\n        this.hV = h;\\n    };\\n    /**\\n     * set value by a OID name\\n     * @name setValueName\\n     * @memberOf KJUR.asn1.DERObjectIdentifier#\\n     * @function\\n     * @param {String} oidName OID name (ex. 'serverAuth')\\n     * @since 1.0.1\\n     * @description\\n     * OID name shall be defined in 'KJUR.asn1.x509.OID.name2oidList'.\\n     * Otherwise raise error.\\n     * @example\\n     * o = new KJUR.asn1.DERObjectIdentifier();\\n     * o.setValueName(\\\"serverAuth\\\");\\n     */\\n    this.setValueName = function (oidName) {\\n        var oid = KJUR.asn1.x509.OID.name2oid(oidName);\\n        if (oid !== '') {\\n            this.setValueOidString(oid);\\n        }\\n        else {\\n            throw \\\"DERObjectIdentifier oidName undefined: \\\" + oidName;\\n        }\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (params !== undefined) {\\n        if (typeof params === \\\"string\\\") {\\n            if (params.match(/^[0-2].[0-9.]+$/)) {\\n                this.setValueOidString(params);\\n            }\\n            else {\\n                this.setValueName(params);\\n            }\\n        }\\n        else if (params.oid !== undefined) {\\n            this.setValueOidString(params.oid);\\n        }\\n        else if (params.hex !== undefined) {\\n            this.setValueHex(params.hex);\\n        }\\n        else if (params.name !== undefined) {\\n            this.setValueName(params.name);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERObjectIdentifier, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Enumerated\\n * @name KJUR.asn1.DEREnumerated\\n * @class class for ASN.1 DER Enumerated\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>int - specify initial ASN.1 value(V) by integer value</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n * @example\\n * new KJUR.asn1.DEREnumerated(123);\\n * new KJUR.asn1.DEREnumerated({int: 123});\\n * new KJUR.asn1.DEREnumerated({hex: '1fad'});\\n */\\nKJUR.asn1.DEREnumerated = function (params) {\\n    KJUR.asn1.DEREnumerated.superclass.constructor.call(this);\\n    this.hT = \\\"0a\\\";\\n    /**\\n     * set value by Tom Wu's BigInteger object\\n     * @name setByBigInteger\\n     * @memberOf KJUR.asn1.DEREnumerated#\\n     * @function\\n     * @param {BigInteger} bigIntegerValue to set\\n     */\\n    this.setByBigInteger = function (bigIntegerValue) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.hV = KJUR.asn1.ASN1Util.bigIntToMinTwosComplementsHex(bigIntegerValue);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setByInteger\\n     * @memberOf KJUR.asn1.DEREnumerated#\\n     * @function\\n     * @param {Integer} integer value to set\\n     */\\n    this.setByInteger = function (intValue) {\\n        var bi = new _jsbn_jsbn__WEBPACK_IMPORTED_MODULE_0__.BigInteger(String(intValue), 10);\\n        this.setByBigInteger(bi);\\n    };\\n    /**\\n     * set value by integer value\\n     * @name setValueHex\\n     * @memberOf KJUR.asn1.DEREnumerated#\\n     * @function\\n     * @param {String} hexadecimal string of integer value\\n     * @description\\n     * <br/>\\n     * NOTE: Value shall be represented by minimum octet length of\\n     * two's complement representation.\\n     */\\n    this.setValueHex = function (newHexString) {\\n        this.hV = newHexString;\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['int'] != \\\"undefined\\\") {\\n            this.setByInteger(params['int']);\\n        }\\n        else if (typeof params == \\\"number\\\") {\\n            this.setByInteger(params);\\n        }\\n        else if (typeof params['hex'] != \\\"undefined\\\") {\\n            this.setValueHex(params['hex']);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DEREnumerated, KJUR.asn1.ASN1Object);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER UTF8String\\n * @name KJUR.asn1.DERUTF8String\\n * @class class for ASN.1 DER UTF8String\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERUTF8String = function (params) {\\n    KJUR.asn1.DERUTF8String.superclass.constructor.call(this, params);\\n    this.hT = \\\"0c\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERUTF8String, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER NumericString\\n * @name KJUR.asn1.DERNumericString\\n * @class class for ASN.1 DER NumericString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERNumericString = function (params) {\\n    KJUR.asn1.DERNumericString.superclass.constructor.call(this, params);\\n    this.hT = \\\"12\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERNumericString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER PrintableString\\n * @name KJUR.asn1.DERPrintableString\\n * @class class for ASN.1 DER PrintableString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERPrintableString = function (params) {\\n    KJUR.asn1.DERPrintableString.superclass.constructor.call(this, params);\\n    this.hT = \\\"13\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERPrintableString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER TeletexString\\n * @name KJUR.asn1.DERTeletexString\\n * @class class for ASN.1 DER TeletexString\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERTeletexString = function (params) {\\n    KJUR.asn1.DERTeletexString.superclass.constructor.call(this, params);\\n    this.hT = \\\"14\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERTeletexString, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER IA5String\\n * @name KJUR.asn1.DERIA5String\\n * @class class for ASN.1 DER IA5String\\n * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})\\n * @extends KJUR.asn1.DERAbstractString\\n * @description\\n * @see KJUR.asn1.DERAbstractString - superclass\\n */\\nKJUR.asn1.DERIA5String = function (params) {\\n    KJUR.asn1.DERIA5String.superclass.constructor.call(this, params);\\n    this.hT = \\\"16\\\";\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERIA5String, KJUR.asn1.DERAbstractString);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER UTCTime\\n * @name KJUR.asn1.DERUTCTime\\n * @class class for ASN.1 DER UTCTime\\n * @param {Array} params associative array of parameters (ex. {'str': '130430235959Z'})\\n * @extends KJUR.asn1.DERAbstractTime\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>str - specify initial ASN.1 value(V) by a string (ex.'130430235959Z')</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * <li>date - specify Date object.</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n * <h4>EXAMPLES</h4>\\n * @example\\n * d1 = new KJUR.asn1.DERUTCTime();\\n * d1.setString('130430125959Z');\\n *\\n * d2 = new KJUR.asn1.DERUTCTime({'str': '130430125959Z'});\\n * d3 = new KJUR.asn1.DERUTCTime({'date': new Date(Date.UTC(2015, 0, 31, 0, 0, 0, 0))});\\n * d4 = new KJUR.asn1.DERUTCTime('130430125959Z');\\n */\\nKJUR.asn1.DERUTCTime = function (params) {\\n    KJUR.asn1.DERUTCTime.superclass.constructor.call(this, params);\\n    this.hT = \\\"17\\\";\\n    /**\\n     * set value by a Date object<br/>\\n     * @name setByDate\\n     * @memberOf KJUR.asn1.DERUTCTime#\\n     * @function\\n     * @param {Date} dateObject Date object to set ASN.1 value(V)\\n     * @example\\n     * o = new KJUR.asn1.DERUTCTime();\\n     * o.setByDate(new Date(\\\"2016/12/31\\\"));\\n     */\\n    this.setByDate = function (dateObject) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.date = dateObject;\\n        this.s = this.formatDate(this.date, 'utc');\\n        this.hV = stohex(this.s);\\n    };\\n    this.getFreshValueHex = function () {\\n        if (typeof this.date == \\\"undefined\\\" && typeof this.s == \\\"undefined\\\") {\\n            this.date = new Date();\\n            this.s = this.formatDate(this.date, 'utc');\\n            this.hV = stohex(this.s);\\n        }\\n        return this.hV;\\n    };\\n    if (params !== undefined) {\\n        if (params.str !== undefined) {\\n            this.setString(params.str);\\n        }\\n        else if (typeof params == \\\"string\\\" && params.match(/^[0-9]{12}Z$/)) {\\n            this.setString(params);\\n        }\\n        else if (params.hex !== undefined) {\\n            this.setStringHex(params.hex);\\n        }\\n        else if (params.date !== undefined) {\\n            this.setByDate(params.date);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERUTCTime, KJUR.asn1.DERAbstractTime);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER GeneralizedTime\\n * @name KJUR.asn1.DERGeneralizedTime\\n * @class class for ASN.1 DER GeneralizedTime\\n * @param {Array} params associative array of parameters (ex. {'str': '20130430235959Z'})\\n * @property {Boolean} withMillis flag to show milliseconds or not\\n * @extends KJUR.asn1.DERAbstractTime\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>str - specify initial ASN.1 value(V) by a string (ex.'20130430235959Z')</li>\\n * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>\\n * <li>date - specify Date object.</li>\\n * <li>millis - specify flag to show milliseconds (from 1.0.6)</li>\\n * </ul>\\n * NOTE1: 'params' can be omitted.\\n * NOTE2: 'withMillis' property is supported from asn1 1.0.6.\\n */\\nKJUR.asn1.DERGeneralizedTime = function (params) {\\n    KJUR.asn1.DERGeneralizedTime.superclass.constructor.call(this, params);\\n    this.hT = \\\"18\\\";\\n    this.withMillis = false;\\n    /**\\n     * set value by a Date object\\n     * @name setByDate\\n     * @memberOf KJUR.asn1.DERGeneralizedTime#\\n     * @function\\n     * @param {Date} dateObject Date object to set ASN.1 value(V)\\n     * @example\\n     * When you specify UTC time, use 'Date.UTC' method like this:<br/>\\n     * o1 = new DERUTCTime();\\n     * o1.setByDate(date);\\n     *\\n     * date = new Date(Date.UTC(2015, 0, 31, 23, 59, 59, 0)); #2015JAN31 23:59:59\\n     */\\n    this.setByDate = function (dateObject) {\\n        this.hTLV = null;\\n        this.isModified = true;\\n        this.date = dateObject;\\n        this.s = this.formatDate(this.date, 'gen', this.withMillis);\\n        this.hV = stohex(this.s);\\n    };\\n    this.getFreshValueHex = function () {\\n        if (this.date === undefined && this.s === undefined) {\\n            this.date = new Date();\\n            this.s = this.formatDate(this.date, 'gen', this.withMillis);\\n            this.hV = stohex(this.s);\\n        }\\n        return this.hV;\\n    };\\n    if (params !== undefined) {\\n        if (params.str !== undefined) {\\n            this.setString(params.str);\\n        }\\n        else if (typeof params == \\\"string\\\" && params.match(/^[0-9]{14}Z$/)) {\\n            this.setString(params);\\n        }\\n        else if (params.hex !== undefined) {\\n            this.setStringHex(params.hex);\\n        }\\n        else if (params.date !== undefined) {\\n            this.setByDate(params.date);\\n        }\\n        if (params.millis === true) {\\n            this.withMillis = true;\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERGeneralizedTime, KJUR.asn1.DERAbstractTime);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Sequence\\n * @name KJUR.asn1.DERSequence\\n * @class class for ASN.1 DER Sequence\\n * @extends KJUR.asn1.DERAbstractStructured\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>array - specify array of ASN1Object to set elements of content</li>\\n * </ul>\\n * NOTE: 'params' can be omitted.\\n */\\nKJUR.asn1.DERSequence = function (params) {\\n    KJUR.asn1.DERSequence.superclass.constructor.call(this, params);\\n    this.hT = \\\"30\\\";\\n    this.getFreshValueHex = function () {\\n        var h = '';\\n        for (var i = 0; i < this.asn1Array.length; i++) {\\n            var asn1Obj = this.asn1Array[i];\\n            h += asn1Obj.getEncodedHex();\\n        }\\n        this.hV = h;\\n        return this.hV;\\n    };\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERSequence, KJUR.asn1.DERAbstractStructured);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER Set\\n * @name KJUR.asn1.DERSet\\n * @class class for ASN.1 DER Set\\n * @extends KJUR.asn1.DERAbstractStructured\\n * @description\\n * <br/>\\n * As for argument 'params' for constructor, you can specify one of\\n * following properties:\\n * <ul>\\n * <li>array - specify array of ASN1Object to set elements of content</li>\\n * <li>sortflag - flag for sort (default: true). ASN.1 BER is not sorted in 'SET OF'.</li>\\n * </ul>\\n * NOTE1: 'params' can be omitted.<br/>\\n * NOTE2: sortflag is supported since 1.0.5.\\n */\\nKJUR.asn1.DERSet = function (params) {\\n    KJUR.asn1.DERSet.superclass.constructor.call(this, params);\\n    this.hT = \\\"31\\\";\\n    this.sortFlag = true; // item shall be sorted only in ASN.1 DER\\n    this.getFreshValueHex = function () {\\n        var a = new Array();\\n        for (var i = 0; i < this.asn1Array.length; i++) {\\n            var asn1Obj = this.asn1Array[i];\\n            a.push(asn1Obj.getEncodedHex());\\n        }\\n        if (this.sortFlag == true)\\n            a.sort();\\n        this.hV = a.join('');\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params.sortflag != \\\"undefined\\\" &&\\n            params.sortflag == false)\\n            this.sortFlag = false;\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERSet, KJUR.asn1.DERAbstractStructured);\\n// ********************************************************************\\n/**\\n * class for ASN.1 DER TaggedObject\\n * @name KJUR.asn1.DERTaggedObject\\n * @class class for ASN.1 DER TaggedObject\\n * @extends KJUR.asn1.ASN1Object\\n * @description\\n * <br/>\\n * Parameter 'tagNoNex' is ASN.1 tag(T) value for this object.\\n * For example, if you find '[1]' tag in a ASN.1 dump,\\n * 'tagNoHex' will be 'a1'.\\n * <br/>\\n * As for optional argument 'params' for constructor, you can specify *ANY* of\\n * following properties:\\n * <ul>\\n * <li>explicit - specify true if this is explicit tag otherwise false\\n *     (default is 'true').</li>\\n * <li>tag - specify tag (default is 'a0' which means [0])</li>\\n * <li>obj - specify ASN1Object which is tagged</li>\\n * </ul>\\n * @example\\n * d1 = new KJUR.asn1.DERUTF8String({'str':'a'});\\n * d2 = new KJUR.asn1.DERTaggedObject({'obj': d1});\\n * hex = d2.getEncodedHex();\\n */\\nKJUR.asn1.DERTaggedObject = function (params) {\\n    KJUR.asn1.DERTaggedObject.superclass.constructor.call(this);\\n    this.hT = \\\"a0\\\";\\n    this.hV = '';\\n    this.isExplicit = true;\\n    this.asn1Object = null;\\n    /**\\n     * set value by an ASN1Object\\n     * @name setString\\n     * @memberOf KJUR.asn1.DERTaggedObject#\\n     * @function\\n     * @param {Boolean} isExplicitFlag flag for explicit/implicit tag\\n     * @param {Integer} tagNoHex hexadecimal string of ASN.1 tag\\n     * @param {ASN1Object} asn1Object ASN.1 to encapsulate\\n     */\\n    this.setASN1Object = function (isExplicitFlag, tagNoHex, asn1Object) {\\n        this.hT = tagNoHex;\\n        this.isExplicit = isExplicitFlag;\\n        this.asn1Object = asn1Object;\\n        if (this.isExplicit) {\\n            this.hV = this.asn1Object.getEncodedHex();\\n            this.hTLV = null;\\n            this.isModified = true;\\n        }\\n        else {\\n            this.hV = null;\\n            this.hTLV = asn1Object.getEncodedHex();\\n            this.hTLV = this.hTLV.replace(/^../, tagNoHex);\\n            this.isModified = false;\\n        }\\n    };\\n    this.getFreshValueHex = function () {\\n        return this.hV;\\n    };\\n    if (typeof params != \\\"undefined\\\") {\\n        if (typeof params['tag'] != \\\"undefined\\\") {\\n            this.hT = params['tag'];\\n        }\\n        if (typeof params['explicit'] != \\\"undefined\\\") {\\n            this.isExplicit = params['explicit'];\\n        }\\n        if (typeof params['obj'] != \\\"undefined\\\") {\\n            this.asn1Object = params['obj'];\\n            this.setASN1Object(this.isExplicit, this.hT, this.asn1Object);\\n        }\\n    }\\n};\\n_yahoo__WEBPACK_IMPORTED_MODULE_1__.YAHOO.lang.extend(KJUR.asn1.DERTaggedObject, KJUR.asn1.ASN1Object);\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsrsasign/asn1-1.0.js?\");\n\n/***/ }),\n\n/***/ \"./lib/lib/jsrsasign/yahoo.js\":\n/*!************************************!*\\\n  !*** ./lib/lib/jsrsasign/yahoo.js ***!\n  \\************************************/\n/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {\n\neval(\"__webpack_require__.r(__webpack_exports__);\\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\\n/* harmony export */   \\\"YAHOO\\\": () => (/* binding */ YAHOO)\\n/* harmony export */ });\\n/*!\\nCopyright (c) 2011, Yahoo! Inc. All rights reserved.\\nCode licensed under the BSD License:\\nhttp://developer.yahoo.com/yui/license.html\\nversion: 2.9.0\\n*/\\nvar YAHOO = {};\\nYAHOO.lang = {\\n    /**\\n     * Utility to set up the prototype, constructor and superclass properties to\\n     * support an inheritance strategy that can chain constructors and methods.\\n     * Static members will not be inherited.\\n     *\\n     * @method extend\\n     * @static\\n     * @param {Function} subc   the object to modify\\n     * @param {Function} superc the object to inherit\\n     * @param {Object} overrides  additional properties/methods to add to the\\n     *                              subclass prototype.  These will override the\\n     *                              matching items obtained from the superclass\\n     *                              if present.\\n     */\\n    extend: function (subc, superc, overrides) {\\n        if (!superc || !subc) {\\n            throw new Error(\\\"YAHOO.lang.extend failed, please check that \\\" +\\n                \\\"all dependencies are included.\\\");\\n        }\\n        var F = function () { };\\n        F.prototype = superc.prototype;\\n        subc.prototype = new F();\\n        subc.prototype.constructor = subc;\\n        subc.superclass = superc.prototype;\\n        if (superc.prototype.constructor == Object.prototype.constructor) {\\n            superc.prototype.constructor = superc;\\n        }\\n        if (overrides) {\\n            var i;\\n            for (i in overrides) {\\n                subc.prototype[i] = overrides[i];\\n            }\\n            /*\\n             * IE will not enumerate native functions in a derived object even if the\\n             * function was overridden.  This is a workaround for specific functions\\n             * we care about on the Object prototype.\\n             * @property _IEEnumFix\\n             * @param {Function} r  the object to receive the augmentation\\n             * @param {Function} s  the object that supplies the properties to augment\\n             * @static\\n             * @private\\n             */\\n            var _IEEnumFix = function () { }, ADD = [\\\"toString\\\", \\\"valueOf\\\"];\\n            try {\\n                if (/MSIE/.test(navigator.userAgent)) {\\n                    _IEEnumFix = function (r, s) {\\n                        for (i = 0; i < ADD.length; i = i + 1) {\\n                            var fname = ADD[i], f = s[fname];\\n                            if (typeof f === 'function' && f != Object.prototype[fname]) {\\n                                r[fname] = f;\\n                            }\\n                        }\\n                    };\\n                }\\n            }\\n            catch (ex) { }\\n            ;\\n            _IEEnumFix(subc.prototype, overrides);\\n        }\\n    }\\n};\\n\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/lib/jsrsasign/yahoo.js?\");\n\n/***/ }),\n\n/***/ \"./lib/version.json\":\n/*!**************************!*\\\n  !*** ./lib/version.json ***!\n  \\**************************/\n/***/ ((module) => {\n\neval(\"module.exports = {\\\"version\\\":\\\"3.2.1\\\"};\\n\\n//# sourceURL=webpack://JSEncrypt/./lib/version.json?\");\n\n/***/ })\n\n/******/ \t});\n/************************************************************************/\n/******/ \t// The module cache\n/******/ \tvar __webpack_module_cache__ = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/ \t\t// Check if module is in cache\n/******/ \t\tvar cachedModule = __webpack_module_cache__[moduleId];\n/******/ \t\tif (cachedModule !== undefined) {\n/******/ \t\t\treturn cachedModule.exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = __webpack_module_cache__[moduleId] = {\n/******/ \t\t\t// no module.id needed\n/******/ \t\t\t// no module.loaded needed\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/************************************************************************/\n/******/ \t/* webpack/runtime/define property getters */\n/******/ \t(() => {\n/******/ \t\t// define getter functions for harmony exports\n/******/ \t\t__webpack_require__.d = (exports, definition) => {\n/******/ \t\t\tfor(var key in definition) {\n/******/ \t\t\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n/******/ \t\t\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n/******/ \t\t\t\t}\n/******/ \t\t\t}\n/******/ \t\t};\n/******/ \t})();\n/******/\n/******/ \t/* webpack/runtime/hasOwnProperty shorthand */\n/******/ \t(() => {\n/******/ \t\t__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))\n/******/ \t})();\n/******/\n/******/ \t/* webpack/runtime/make namespace object */\n/******/ \t(() => {\n/******/ \t\t// define __esModule on exports\n/******/ \t\t__webpack_require__.r = (exports) => {\n/******/ \t\t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n/******/ \t\t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n/******/ \t\t\t}\n/******/ \t\t\tObject.defineProperty(exports, '__esModule', { value: true });\n/******/ \t\t};\n/******/ \t})();\n/******/\n/************************************************************************/\n/******/\n/******/ \t// startup\n/******/ \t// Load entry module and return exports\n/******/ \t// This entry module can't be inlined because the eval devtool is used.\n/******/ \tvar __webpack_exports__ = __webpack_require__(\"./lib/index.js\");\n/******/ \t__webpack_exports__ = __webpack_exports__.default;\n/******/\n/******/ \treturn __webpack_exports__;\n/******/ })()\n;\n});\n},{}]},{},[1])(1)\n});\n", "export { SSVKeys } from './lib/SSVKeys';\nexport { EncryptShare } from './lib/Encryption/Encryption';\nexport { default as Threshold } from './lib/Threshold/Threshold';\nexport { ISharesKeyPairs, IShares } from './lib/Threshold/Threshold';\nexport { default as EthereumKeyStore } from './lib/EthereumKeyStore';\nexport { KeySharesItem } from './lib/KeyShares/KeySharesItem';\nexport { KeyShares } from './lib/KeyShares/KeyShares';\nexport { default as Encryption } from './lib/Encryption/Encryption';\nexport { SSVKeysException } from './lib/exceptions/base';\n", "let index: any;\n\ntry {\n  window.crypto;\n  index = require('bls-eth-wasm/browser');\n} catch {\n  index = require('bls-eth-wasm');\n}\n\nexport default index;\n", "export class SSVKeysException extends Error {\n  public trace: any;\n\n  constructor(message: string) {\n    super(message);\n    this.name = this.constructor.name;\n    Error.captureStackTrace(this, this.constructor);\n    this.trace = this.stack;\n    this.stack = `${this.name}: ${this.message}`; // Customizing stack\n  }\n}\n", "import { SSVKeysException } from './base';\n\nexport class KeyStoreDataFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class KeyStoreInvalidError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class KeyStorePasswordError extends SSVKeysException {\n  constructor(message: string) {\n    super(message);\n  }\n}\n\nexport class EthereumWalletError extends SSVKeysException {\n  constructor(message: string) {\n    super(message);\n  }\n}\n\nexport class PrivateKeyFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class OwnerAddressFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\nexport class OwnerNonceFormatError extends SSVKeysException {\n  public data: any;\n\n  constructor(data: any, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n", "import EthereumKeyStore from 'eth2-keystore-js';\nimport { readFile } from '../../../lib/helpers/file.helper';\n\n\nexport class KeystorePasswordValidator {\n  protected keystoreFilePath = '';\n\n  /*\n  setKeystoreFilePath(filePath: string): void {\n    this.keystoreFilePath = filePath;\n  }\n  */\n\n  async validatePassword(password: string, keystoreFilePath: string): Promise<boolean | string> {\n    if (!password.trim().length) {\n      return 'Password is empty';\n    }\n    const errorMessage = 'Invalid keystore file password.';\n    // let messageInterval: any;\n    let output: any;\n    try {\n      /*\n      if (showProgress) {\n        let dots = 1;\n        const message = `\\rChecking password`\n        process.stdout.write('\\r' + String(' ').repeat(250));\n        process.stdout.write(`\\r${message}`);\n        messageInterval = setInterval(() => {\n          const progressMessage = `\\r${message}` +\n            `${String('.').repeat(dots)}${String(' ').repeat(30 - dots)}`;\n          process.stdout.write(progressMessage);\n          dots += 1;\n          if (dots > 3) {\n            dots = 1;\n          }\n        }, 1000);\n      }\n      */\n      const data = await readFile(keystoreFilePath);\n      const keyStore = new EthereumKeyStore(data);\n      const privateKey = await keyStore.getPrivateKey(password)\n      output = !!privateKey;\n    } catch (e) {\n      output = errorMessage;\n    }\n    /*\n    if (showProgress) {\n      process.stdout.write('\\n');\n      clearInterval(messageInterval);\n    }\n    */\n    return output;\n  }\n}\n\nexport const keystorePasswordValidator = new KeystorePasswordValidator();\n", "import fs from 'fs';\nimport path from 'path';\nimport moment from 'moment';\nimport { promises as fsp } from 'fs';\nimport { SSVKeysException } from '../../lib/exceptions/base';\n\n/**\n * Read file contents and return json data from it.\n * @param filePath\n * @param json\n */\nexport const readFile = async (filePath: string, json=true): Promise<any> => {\n  return fsp.readFile(filePath, { encoding: 'utf-8' }).then((data) => {\n    return json ? JSON.parse(data) : data;\n  });\n}\n\n/**\n * Write file contents.\n * @param filePath\n * @param data\n */\nexport const writeFile = async (filePath: string, data: string): Promise<any> => {\n  fsp.writeFile(filePath, data, { encoding: 'utf-8' });\n}\n\n/**\n * Create SSV keys directory to work in scope of in user home directory\n */\nexport const createSSVDir = async (outputFolder: string): Promise<any> => {\n  return fsp.mkdir(outputFolder, { recursive: true });\n}\n\n/**\n * Get SSV keys directory to work in scope of in user home directory.\n * Create it before, if it doesn't exist.\n */\nexport const getSSVDir = async (outputFolder: string): Promise<string> => {\n  if (!fs.existsSync(outputFolder)) {\n    await createSSVDir(outputFolder);\n  }\n  return outputFolder.endsWith(path.sep) ? outputFolder : `${outputFolder}${path.sep}`;\n}\n\nexport const getFilePath = async (name: string, outputFolder: string, withTime = true): Promise<string> => {\n  return `${await getSSVDir(outputFolder)}${name}${withTime ? `-${moment().unix()}` : ''}.json`;\n}\n\nexport type KeyStoreFilesResult = {\n  files: string[];\n  isFolder: boolean;\n}\n\nexport const getKeyStoreFiles = async (keystorePath: string): Promise<KeyStoreFilesResult> => {\n  const stat = await fsp.stat(keystorePath);\n  const isFolder = stat.isDirectory();\n\n  let files;\n  if (isFolder) {\n    const folderContent = await fsp.readdir(keystorePath);\n    if (folderContent.length === 0) {\n      throw new SSVKeysException('No keystore files detected. Please provide a folder with correct keystore files and try again.');\n    }\n    files = folderContent.map(file => path.join(keystorePath, file)).sort();\n  } else {\n    files = [keystorePath];\n  }\n  return { files, isFolder };\n}\n", "export class OperatorIdsValidator {\n  public operatorsCount = 3;\n\n  setOperatorsCount(amount: number): void {\n    this.operatorsCount = amount;\n  }\n}\n\nexport const isOperatorsLengthValid = (length: number) => {\n  if (length < 4 || length > 13 || length % 3 != 1) {\n    return false;\n  }\n  return true;\n}\n\nexport const operatorIdsValidator = new OperatorIdsValidator();\n", "import { decode } from 'js-base64';\nimport JSEncrypt from '../../../lib/JSEncrypt';\nimport { OperatorPublicKeyError } from '../../../lib/exceptions/operator';\n\nexport const operatorPublicKeyValidator = (publicKey: string): boolean => {\n  publicKey = publicKey.trim();\n\n  const begin = '-----BEGIN RSA PUBLIC KEY-----';\n  const end = '-----END RSA PUBLIC KEY-----';\n\n  const encrypt = new JSEncrypt({});\n  let decodedOperator = '';\n  try {\n    let decodedPublicKey = '';\n\n    if (!publicKey.startsWith(begin)) {\n      if (publicKey.length < 98) {\n        throw new Error('The length of the operator public key must be at least 98 characters.');\n      }\n\n      try {\n        decodedPublicKey = decode(publicKey).trim();\n      } catch (error) {\n        throw new Error(\"Failed to decode the operator public key. Ensure it's correctly base64 encoded.\");\n      }\n\n      if (!decodedPublicKey.startsWith(begin)) {\n        throw new Error(`Operator public key does not start with '${begin}'`);\n      }\n    } else {\n      decodedPublicKey = publicKey;\n    }\n\n    if (!decodedPublicKey.endsWith(end)) {\n      throw new Error(`Operator public key does not end with '${end}'`);\n    }\n\n    try {\n      // Get the content without the header and footer\n      const content = decodedPublicKey.slice(begin.length, publicKey.length - end.length).trim();\n      decodedOperator = decode(content);\n    } catch (error) {\n      throw new Error(\"Failed to decode the RSA public key. Ensure it's correctly base64 encoded.\");\n    }\n\n    try {\n      encrypt.setPublicKey(decodedOperator);\n    } catch (error: any) {\n      throw new Error(\"Invalid operator key format, make sure the operator exists in the network.\");\n    }\n  } catch (error: any) {\n    throw new OperatorPublicKeyError(\n      {\n        rsa: decodedOperator,\n        base64: publicKey,\n      },\n      error.message,\n    );\n  }\n  return true;\n}\n", "let index: any;\n\ntry {\n  window.crypto;\n  index = require('jsencrypt').JSEncrypt;\n} catch {\n  index = require('./jsencrypt.bundle');\n}\n\nexport default index;\n", "import { SSVKeysException } from './base';\n\nimport { IOperatorData } from '../KeyShares/KeySharesData/IOperatorData';\n\nexport class DuplicatedOperatorIdError extends SSVKeysException {\n  public operator: IOperatorData;\n\n  constructor(operator: IOperatorData, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n\nexport class DuplicatedOperatorPublicKeyError extends SSVKeysException {\n  public operator: IOperatorData;\n\n  constructor(operator: IOperatorData, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n\nexport class OperatorsCountsMismatchError extends SSVKeysException {\n  public listOne: any[] | null | undefined;\n  public listTwo: any[] | null | undefined;\n\n  constructor(propertyListOne: any[] | null | undefined, propertyListTwo: any[] | null | undefined, message: string) {\n    super(message);\n    this.listOne = propertyListOne;\n    this.listTwo = propertyListTwo;\n  }\n}\n\nexport class OperatorPublicKeyError extends SSVKeysException {\n  public operator: any;\n\n  constructor(operator: { rsa: string, base64: string }, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n", "import bls from '../BLS';\n\nimport { SecretKeyType } from 'bls-eth-wasm';\n\nimport { SSVKeysException } from '../exceptions/base';\nimport { PrivateKeyFormatError } from '../exceptions/keystore';\nimport { isOperatorsLengthValid } from '../../commands/actions/validators';\n\nexport interface IShares {\n    privateKey: string,\n    publicKey: string,\n    id?: any\n}\n\nexport interface ISharesKeyPairs {\n  privateKey: string,\n    publicKey: string,\n    shares: IShares[]\n}\n\nexport class ThresholdInvalidOperatorsLengthError extends SSVKeysException {\n  public operators: number[];\n\n  // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\n  constructor(operators: number[], message: string) {\n    super(message);\n    this.operators = operators;\n  }\n}\n\nexport class ThresholdInvalidOperatorIdError extends SSVKeysException {\n  public operator: any;\n\n  // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\n  constructor(operator: any, message: string) {\n    super(message);\n    this.operator = operator;\n  }\n}\n\n/**\n * Building threshold for list of operator IDs\n */\nclass Threshold {\n  protected publicKey: any;\n  protected privateKey: any;\n  protected shares: Array<any> = [];\n\n  static get DEFAULT_THRESHOLD_NUMBER(): number {\n    return 3;\n  }\n\n  /**\n   * Receives list of operators IDs.\n   *  len(operator IDs) := 3 * F + 1\n   *\n   * If F calculated from this formula is not integer number - it will raise exception.\n   * Generate keys and return promise\n   */\n  async create(privateKeyString: string, operatorIds: number[]): Promise<ISharesKeyPairs> {\n    if (!privateKeyString.startsWith('0x')) {\n      throw new PrivateKeyFormatError(privateKeyString, 'The private key must be provided in the 0x format.')\n    }\n    // Validation\n    operatorIds.map(operatorId => {\n      if (!Number.isInteger(operatorId)) {\n        throw new ThresholdInvalidOperatorIdError(\n          operatorId,\n          `Operator must be integer. Got: ${operatorId}`\n        );\n      }\n    });\n\n    if (!isOperatorsLengthValid(operatorIds.length)) {\n      throw new ThresholdInvalidOperatorsLengthError(\n        operatorIds,\n        'Invalid operators amount. Enter an 3f+1 compatible amount of operator ids.'\n      );\n    }\n\n    const msk = [];\n    const mpk = [];\n\n    if (!bls.deserializeHexStrToSecretKey) {\n      await bls.init(bls.BLS12_381);\n    }\n    // Master key Polynomial\n    this.privateKey = bls.deserializeHexStrToSecretKey(privateKeyString.replace('0x', ''));\n    this.publicKey = this.privateKey.getPublicKey();\n\n    msk.push(this.privateKey);\n    mpk.push(this.publicKey);\n\n    const F = (operatorIds.length - 1) / 3;\n    // Construct poly\n    for (let i = 1; i < operatorIds.length - F; i += 1) {\n      const sk: SecretKeyType = new bls.SecretKey();\n      sk.setByCSPRNG();\n      msk.push(sk);\n      const pk = sk.getPublicKey();\n      mpk.push(pk);\n    }\n\n    // Evaluate shares - starting from 1 because 0 is master key\n    for (const operatorId of operatorIds) {\n      const id = new bls.Id();\n      id.setInt(operatorId);\n      const shareSecretKey = new bls.SecretKey();\n      shareSecretKey.share(msk, id);\n\n      const sharePublicKey = new bls.PublicKey();\n      sharePublicKey.share(mpk, id);\n\n      this.shares.push({\n        privateKey: `0x${shareSecretKey.serializeToHexStr()}`,\n        publicKey: `0x${sharePublicKey.serializeToHexStr()}`,\n        id,\n      });\n    }\n\n    const response: ISharesKeyPairs = {\n      privateKey: `0x${this.privateKey.serializeToHexStr()}`,\n      publicKey: `0x${this.publicKey.serializeToHexStr()}`,\n      shares: this.shares,\n    };\n\n    return response;\n  }\n}\n\nexport default Threshold;\n", "import crypto from 'crypto';\nimport { syncScrypt } from 'scrypt-js';\nimport Wallet from 'ethereumjs-wallet';\nimport { keccak256, sha256 } from 'ethereumjs-util';\nimport { EthereumWalletError, KeyStoreDataFormatError, KeyStoreInvalidError, KeyStorePasswordError } from '../exceptions/keystore';\n\ninterface V4Keystore {\n  crypto: {\n    kdf: {\n      function: string,\n      params: {\n        dklen: number,\n        n: number,\n        r: number,\n        p: number,\n        salt: string\n      },\n      message: string\n    },\n    checksum: {\n      function: string,\n      params: any,\n      message: string\n    },\n    cipher: {\n      function: string,\n      params: {\n        iv: string\n      },\n      message: string\n    }\n  },\n  description: string,\n  pubkey: string,\n  path: string,\n  uuid: string\n  version: number\n}\n\n/**\n * Decrypt private key from key store data\n * Supports key store versions: v1, v3, v4\n *\n * Example of usage (Node env):\n *\n *  const keyStoreFilePath = path.join(process.cwd(), 'validator_keys', 'keystore.json');\n *  const keyStoreString: string = fs.readFileSync(keyStoreFilePath).toString();\n *  const keyStoreData = JSON.parse(keyStoreString);\n *  const keyStore = new EthereumKeyStore(keyStoreData);\n *  const password = 'testtest';\n *  console.log('Private Key:', await keyStore.getPrivateKey(password));\n */\nclass EthereumKeyStore {\n  private readonly keyStoreData: any;\n  private privateKey = '';\n  private wallet: Wallet | undefined;\n\n  /**\n   * Receive key store data from string or parsed JSON\n   * @param keyStoreData\n   */\n  constructor(keyStoreData: any) {\n    if (!keyStoreData) {\n      throw new KeyStoreDataFormatError(keyStoreData, 'Key store data should be JSON or string');\n    }\n    if (typeof keyStoreData === 'string') {\n      this.keyStoreData = JSON.parse(keyStoreData);\n    } else {\n      this.keyStoreData = keyStoreData;\n    }\n    if (!this.keyStoreData.version) {\n      throw new KeyStoreInvalidError(this.keyStoreData, 'Invalid keystore file');\n    }\n  }\n\n  getPublicKey(): string {\n    if (this.keyStoreData) {\n      switch (this.keyStoreData.version ?? this.keyStoreData.Version) {\n        case 1:\n          return this.keyStoreData.Address;\n        case 3:\n          return this.keyStoreData.id;\n        case 4:\n          return this.keyStoreData.pubkey;\n      }\n    }\n    return '';\n  }\n\n  /**\n   * Decrypt private key using user password\n   * @param password\n   */\n  async getPrivateKey(password = ''): Promise<string> {\n    // In case private key exist we return it\n    if (this.privateKey) return this.privateKey;\n    switch (this.keyStoreData.version) {\n      case 1:\n        this.wallet = await Wallet.fromV1(this.keyStoreData, password);\n        break;\n      case 3:\n        this.wallet = await Wallet.fromV3(this.keyStoreData, password, true);\n        break;\n      case 4:\n        this.wallet = await this.fromV4(this.keyStoreData, password);\n        break;\n    }\n    if (this.wallet) {\n      this.privateKey = this.wallet.getPrivateKey().toString('hex');\n      if (!this.privateKey) {\n        throw new KeyStorePasswordError('Invalid password');\n      }\n    }\n    return this.privateKey;\n  }\n\n  /**\n   * Import a wallet (Version 4 of the Ethereum wallet format).\n   *\n   * @param input A JSON serialized string, or an object representing V3 Keystore.\n   * @param password The keystore password.\n   */\n  public async fromV4(\n    input: string | V4Keystore,\n    password: string,\n  ): Promise<Wallet> {\n    const json: V4Keystore = typeof input === 'object' ? input : JSON.parse(input);\n\n    if (json.version !== 4) {\n      throw new EthereumWalletError('Not a V4 wallet');\n    }\n\n    let derivedKey: Uint8Array;\n    let kdfParams: any;\n    if (json.crypto.kdf.function === 'scrypt') {\n      kdfParams = json.crypto.kdf.params;\n      derivedKey = syncScrypt(\n        Buffer.from(password),\n        Buffer.from(kdfParams.salt, 'hex'),\n        kdfParams.n,\n        kdfParams.r,\n        kdfParams.p,\n        kdfParams.dklen,\n      );\n    } else if (json.crypto.kdf.function === 'pbkdf2') {\n      kdfParams = json.crypto.kdf.params;\n\n      if (kdfParams.prf !== 'hmac-sha256') {\n        throw new EthereumWalletError('Unsupported parameters to PBKDF2');\n      }\n\n      derivedKey = crypto.pbkdf2Sync(\n        Buffer.from(password),\n        Buffer.from(kdfParams.salt, 'hex'),\n        kdfParams.c,\n        kdfParams.dklen,\n        'sha256',\n      );\n    } else {\n      throw new EthereumWalletError('Unsupported key derivation scheme');\n    }\n\n    const ciphertext = Buffer.from(json.crypto.cipher.message, 'hex');\n    const checksumBuffer = Buffer.concat([Buffer.from(derivedKey.slice(16, 32)), ciphertext]);\n    const hashFunctions: Record<string, any> = {\n      keccak256,\n      sha256,\n    };\n    const hashFunction: any = hashFunctions[json.crypto.checksum.function];\n    const mac: Buffer = hashFunction(checksumBuffer);\n    if (mac.toString('hex') !== json.crypto.checksum.message) {\n      throw new EthereumWalletError('Invalid password');\n    }\n\n    const decipher = crypto.createDecipheriv(\n      json.crypto.cipher.function,\n      derivedKey.slice(0, 16),\n      Buffer.from(json.crypto.cipher.params.iv, 'hex'),\n    );\n    const seed: Buffer = this.runCipherBuffer(decipher, ciphertext);\n    return new Wallet(seed);\n  }\n\n  /**\n   * @param cipher\n   * @param data\n   */\n  protected runCipherBuffer(cipher: crypto.Cipher | crypto.Decipher, data: Buffer): Buffer {\n    return Buffer.concat([cipher.update(data), cipher.final()]);\n  }\n\n  /**\n   * Convert byte array to string\n   * @param byteArray\n   */\n  static toHexString(byteArray: Uint8Array): string {\n    return Array.from(byteArray, (byte: number) => {\n      // eslint-disable-next-line no-bitwise\n      return (`0${(byte & 0xFF).toString(16)}`).slice(-2);\n    }).join('');\n  }\n}\n\nexport default EthereumKeyStore;\n", "import JSEncrypt from '../JSEncrypt';\n\nimport { IShares } from '../Threshold';\n\nimport { operatorPublicKeyValidator } from '../../commands/actions/validators';\nimport { OperatorPublicKeyError } from '../exceptions/operator';\n\nexport interface EncryptShare {\n    operatorPublicKey: string,\n    privateKey: string,\n    publicKey: string\n}\n\nexport default class Encryption {\n  private readonly operatorPublicKeys: string[];\n  private readonly shares: IShares[];\n\n\n  constructor(operatorPublicKeys: string[], shares: IShares[]) {\n    this.operatorPublicKeys = [...operatorPublicKeys];\n    this.shares = shares;\n  }\n\n  encrypt(): EncryptShare[] {\n    const encryptedShares: EncryptShare[] = [];\n    for (const [idx, operatorPublicKey] of this.operatorPublicKeys.entries()) {\n      operatorPublicKeyValidator(operatorPublicKey);\n      const jsEncrypt = new JSEncrypt({});\n      jsEncrypt.setPublicKey(operatorPublicKey)\n      const encryptedPrivateKey = jsEncrypt.encrypt(this.shares[idx].privateKey);\n      if (!encryptedPrivateKey) {\n        throw new OperatorPublicKeyError(\n          {\n            rsa: operatorPublicKey,\n            base64: encryptedPrivateKey,\n          },\n          'Private key encryption failed.',\n        );\n      }\n      const encryptedShare: EncryptShare = {\n          operatorPublicKey,\n          privateKey: encryptedPrivateKey,\n          publicKey: this.shares[idx].publicKey,\n      };\n      encryptedShares.push(encryptedShare);\n    }\n    return encryptedShares;\n  }\n}\n", "import { IsDefined, IsInt, IsNotEmpty, IsString, validateSync } from 'class-validator';\nimport { IOperator } from './IOperator';\nimport { IOperatorData } from './IOperatorData';\nimport { OpeatorPublicKeyValidator } from './validators';\n\nexport class OperatorData implements IOperatorData {\n  @IsNotEmpty({ message: 'The operator id is null'})\n  @IsDefined({ message: 'The operator id is undefined'})\n  @IsInt({ message: 'The operator id must be an integer'})\n  public id: number;\n\n  @IsNotEmpty({ message: 'The operator public key is null'})\n  @IsDefined({ message: 'The operator public key is undefined'})\n  @IsString({ message: 'The operator public key must be a string'})\n  @OpeatorPublicKeyValidator()\n  public operatorKey: string;\n\n  constructor(data: IOperator) {\n    this.id = data.id;\n    this.operatorKey = data.operatorKey;\n    this.validate();\n  }\n\n  /**\n   * Validate operator id and public key\n   */\n  validate(): void {\n    validateSync(this);\n  }\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport { DuplicatedOperatorIdError, DuplicatedOperatorPublicKeyError } from '../../../exceptions/operator';\n\n@ValidatorConstraint({ name: 'uniqueList', async: false })\nexport class OpeatorsListValidatorConstraint implements ValidatorConstraintInterface {\n  validate(operatorsList: any) {\n    const operatorIds = new Set(), operatorPublicKeys = new Set();\n    for (const operator of operatorsList || []) {\n      if (operatorIds.has(operator.id)) {\n        throw new DuplicatedOperatorIdError(operator, `The operator ID '${operator.id}' is duplicated in the list`);\n      }\n      operatorIds.add(operator.id);\n\n      if (operatorPublicKeys.has(operator.operatorKey)) {\n        throw new DuplicatedOperatorPublicKeyError(operator, `The public key for operator ID ${operator.id} is duplicated in the list`);\n      }\n      operatorPublicKeys.add(operator.operatorKey);\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'The list of operators contains duplicate entries';\n  }\n}\n\nexport function OpeatorsListValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OpeatorsListValidatorConstraint,\n    });\n  };\n}\n\n\n", "import bls from '../../../BLS';\nimport {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport { BLSDeserializeError } from '../../../exceptions/bls';\n\n/* Try to BLS deserialize validator public key. */\n@ValidatorConstraint({ name: 'publicKey', async: true })\nexport class PublicKeyValidatorConstraint implements ValidatorConstraintInterface {\n  async validate(value: any) {\n    try {\n      if (typeof value === 'string') {\n        bls.deserializeHexStrToPublicKey(value.replace('0x', ''));\n      } else {\n        value.forEach((item: string) => bls.deserializeHexStrToPublicKey(item.replace('0x', '')));\n      }\n    } catch (e) {\n      throw new BLSDeserializeError( value, 'Failed to BLS deserialize validator public key');\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'Invalid public key';\n  }\n}\n\nexport function PublicKeyValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: PublicKeyValidatorConstraint,\n    });\n  };\n}\n", "import { SSVKeysException } from './base';\nexport class BLSDeserializeError extends SSVKeysException {\n  public publicKey: string;\n\n  constructor(publicKey: string, message: string) {\n    super(message);\n    this.publicKey = publicKey;\n  }\n}\n\nexport class SingleSharesSignatureInvalid extends SSVKeysException {\n  public data: string;\n\n  constructor(data: string, message: string) {\n    super(message);\n    this.data = data;\n  }\n}\n\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport * as web3Helper from '../../../helpers/web3.helper';\n\nimport { OwnerAddressFormatError } from '../../../exceptions/keystore';\n\n/* Try to validate ethereum owner address. */\n@ValidatorConstraint({ name: 'ownerAddress', async: false })\nexport class OwnerAddressValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any) {\n    try {\n      web3Helper.web3.utils.toChecksumAddress(value);\n    } catch {\n      throw new OwnerAddressFormatError(value, 'Owner address is not a valid Ethereum address');\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'Invalid owner address';\n  }\n}\n\nexport function OwnerAddressValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OwnerAddressValidatorConstraint,\n    });\n  };\n}\n", "import Web3 from 'web3';\nimport * as ethers from 'ethers';\nimport * as ethUtil from 'ethereumjs-util';\n\nimport bls from '../BLS';\nimport { SingleSharesSignatureInvalid } from '../exceptions/bls';\n\nexport const web3 = new Web3();\n\n/**\n * Encode with Web3 eth abi method any fields of shares array required for transaction.\n * @param encryptedShares\n * @param field\n */\nexport const abiEncode = (encryptedShares: any[], field?: string): string[] => {\n  return encryptedShares.map(share => {\n    const value = field ? Object(share)[field] : share;\n    if (String(value).startsWith('0x')) {\n      return value;\n    }\n    return web3.eth.abi.encodeParameter('string', value);\n  });\n}\n\n/**\n * This function converts a hexadecimal string into a Uint8Array.\n * It removes the prefix '0x' if present and maps each hexadecimal byte into a Uint8Array.\n *\n * @param {string} hex - The hexadecimal string input, it can start with '0x'.\n * @returns {Uint8Array} - It returns a Uint8Array, where each element in the array is a byte from the hexadecimal string.\n *\n */\nexport const hexToUint8Array = (hex: string) => {\n  if (hex.startsWith('0x')) {\n    hex = hex.slice(2);\n  }\n  const length = hex.length / 2;\n  const result = new Uint8Array(length);\n  for (let i = 0; i < length; i++) {\n    const start = i * 2;\n    const end = start + 2;\n    const byte = parseInt(hex.slice(start, end), 16);\n    result[i] = byte;\n  }\n  return result;\n}\n\n/**\n * This function transforms an array of hexadecimal strings into a single Node.js Buffer.\n * It employs ethers.utils.arrayify to convert each hex string into a Uint8Array, flattens them into a single array, and converts that to a Buffer.\n *\n * @param {string[]} hexArr - An array of hexadecimal strings. Each string can represent bytes of arbitrary length. *\n * @returns {Buffer} - A Node.js Buffer that concatenates the bytes represented by the hexadecimal strings in the input array.\n *\n */\nexport const hexArrayToBytes = (hexArr: string[]): Buffer => {\n  const uint8Array = new Uint8Array(hexArr.map(item => [...ethers.utils.arrayify(item)]).flat());\n  return Buffer.from(uint8Array);\n}\n\n/**\n * Asynchronously creates a BLS signature for given data using a private key.\n *\n * @param {string} dataToSign - The data to be signed.\n * @param {string} privateKeyHex - Hexadecimal representation of the private key.\n * @returns {Promise<string>} - A promise that resolves to the BLS signature in hexadecimal format.\n *\n * The function initializes the BLS library if needed, deserializes the private key from a hexadecimal string,\n * computes the Keccak-256 hash of the data, signs the hashed data using the deserialized private key,\n * and returns the signature in hexadecimal format, prefixed with '0x'.\n */\nexport const buildSignature = async(dataToSign: string, privateKeyHex: string): Promise<string> => {\n  if (!bls.deserializeHexStrToSecretKey) {\n    await bls.init(bls.BLS12_381);\n  }\n\n  const privateKey = bls.deserializeHexStrToSecretKey(privateKeyHex.replace('0x', ''));\n\n  const messageHash = ethUtil.keccak256(Buffer.from(dataToSign));\n  const signature = privateKey.sign(new Uint8Array(messageHash));\n  const signatureHex = signature.serializeToHexStr();\n  return `0x${signatureHex}`;\n}\n\n/**\n * Asynchronously validates a BLS signature for given signed data.\n *\n * @param {string} signedData - Data that has been signed.\n * @param {string} signatureHex - Hexadecimal representation of the BLS signature.\n * @param {string} publicKey - Hexadecimal representation of the public key.\n * @throws {SingleSharesSignatureInvalid} - Throws an error if the signature is invalid.\n * @returns {Promise<void>} - Resolves when the signature is successfully verified.\n *\n * The function initializes the BLS library if needed, deserializes the public key and signature from hexadecimal strings,\n * computes the Keccak-256 hash of the signed data, and verifies the signature using the deserialized public key.\n */\nexport const validateSignature = async(signedData: string, signatureHex: string, publicKey: string): Promise<void> => {\n  if (!bls.deserializeHexStrToSecretKey) {\n    await bls.init(bls.BLS12_381);\n  }\n\n  const blsPublicKey = bls.deserializeHexStrToPublicKey(publicKey.replace('0x', ''));\n  const signature = bls.deserializeHexStrToSignature(signatureHex.replace('0x', ''));\n\n  const messageHash = ethUtil.keccak256(Buffer.from(signedData));\n\n  if (!blsPublicKey.verify(signature, new Uint8Array(messageHash))) {\n    throw new SingleSharesSignatureInvalid(signatureHex, 'Single shares signature is invalid');\n  }\n}\n\nexport const privateToPublicKey = async(privateKey: string): Promise<string> => {\n  if (!bls.deserializeHexStrToSecretKey) {\n    await bls.init(bls.BLS12_381);\n  }\n  return `0x${bls.deserializeHexStrToSecretKey(privateKey.replace('0x', '')).getPublicKey().serializeToHexStr()}`;\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\n\nimport { OwnerNonceFormatError } from '../../../exceptions/keystore';\n\n/* Try to validate owner nonce. */\n@ValidatorConstraint({ name: 'ownerNonce', async: false })\nexport class OwnerNonceValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any) {\n    if (!Number.isInteger(value) || value < 0) {\n      throw new OwnerNonceFormatError(value, 'Owner nonce is not positive integer');\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'Invalid owner nonce';\n  }\n}\n\nexport function OwnerNonceValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OwnerNonceValidatorConstraint,\n    });\n  };\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n  ValidationArguments,\n} from 'class-validator';\nimport { OperatorsCountsMismatchError } from '../../../exceptions/operator';\n\n@ValidatorConstraint({ name: 'matchLength', async: false })\nexport class MatchLengthValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any, args: ValidationArguments) {\n    const [relatedPropertyName, customError] = args.constraints;\n    const relatedLength = (args.object as any)[relatedPropertyName].length;\n    if (!Array.isArray(value)) {\n      Object.values(value).forEach((arr: any) => {\n        if (relatedLength !== arr.length) {\n          throw new OperatorsCountsMismatchError((args.object as any)[relatedPropertyName], value, customError.message);\n        }\n      })\n    } else {\n      if (relatedLength !== value.length) {\n        throw new OperatorsCountsMismatchError((args.object as any)[relatedPropertyName], value, customError.message);\n      }\n    }\n    return true;\n  }\n\n  defaultMessage() {\n    return 'The length of the entries lists are not equal';\n  }\n}\n\nexport function MatchLengthValidator(property: string, validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [property, validationOptions],\n      validator: MatchLengthValidatorConstraint,\n    });\n  };\n}\n", "import {\n  registerDecorator,\n  ValidatorConstraint,\n  ValidatorConstraintInterface,\n  ValidationOptions,\n} from 'class-validator';\nimport { operatorPublicKeyValidator } from '../../../../commands/actions/validators';\n\n@ValidatorConstraint({ name: 'operatorKey', async: false })\nexport class OpeatorPublicKeyValidatorConstraint implements ValidatorConstraintInterface {\n  validate(value: any) {\n    return operatorPublicKeyValidator(value);\n  }\n\n  defaultMessage() {\n    return 'Invalid operator public key';\n  }\n}\n\nexport function OpeatorPublicKeyValidator(validationOptions?: ValidationOptions) {\n  return function (object: any, propertyName: string) {\n    registerDecorator({\n      target: object.constructor,\n      propertyName,\n      options: validationOptions,\n      constraints: [],\n      validator: OpeatorPublicKeyValidatorConstraint,\n    });\n  };\n}\n", "import { IOperator } from \"../KeyShares/KeySharesData/IOperator\";\nimport { OperatorData } from \"../KeyShares/KeySharesData/OperatorData\";\nimport { OperatorsCountsMismatchError } from \"../exceptions/operator\";\n\n/**\n * Sort operators input.\n * @param operators list\n */\n\nexport const operatorSortedList = (operators: IOperator[]): OperatorData[] => {\n  // Extracting IDs and operatorKeys for error reporting\n  const ids = operators.map(op => op.id);\n  const operatorKeys = operators.map(op => op.operatorKey);\n\n  // Validate and convert IDs to numbers for sorting\n  const validatedOperators = operators.map((operator: any) => {\n    const id = parseInt(operator.id, 10);\n    if (isNaN(id)) {\n      throw new OperatorsCountsMismatchError(ids, operatorKeys, `Invalid operator ID: ${operator.id}`);\n    }\n    if (!operator.operatorKey) {\n      throw new OperatorsCountsMismatchError(ids, operatorKeys, `Operator key is missing for operator ID: ${id}`);\n    }\n    return { ...operator, id };\n  });\n\n  // Sort operators by ID\n  validatedOperators.sort((a, b) => a.id - b.id);\n\n  // Map to OperatorData objects\n  return validatedOperators.map(operator => new OperatorData(operator));\n};\n", "// import atob from 'atob';\nimport bls from './BLS';\n\nimport Threshold, { IShares, ISharesKeyPairs } from './Threshold';\nimport EthereumKeyStore from './EthereumKeyStore/EthereumKeyStore';\nimport Encryption, { EncryptShare } from './Encryption/Encryption';\nimport { operatorSortedList } from './helpers/operator.helper';\nimport { IOperator } from './KeyShares/KeySharesData/IOperator';\n\nexport interface ExtractedKeys {\n  privateKey: string;\n  publicKey: string;\n}\n\n/**\n * SSVKeys class provides high-level methods to easily work with entire flow:\n *  - getting private key from keystore file using password\n *  - creating shares threshold\n *  - creating final shares\n *  - building final payload which is ready to be used in web3 transaction\n */\nexport class SSVKeys {\n  static SHARES_FORMAT_ABI = 'abi';\n\n  protected threshold: ISharesKeyPairs | undefined;\n\n  /**\n   * Extract private key from keystore data using keystore password.\n   * Generally can be used in browsers when the keystore data has been provided by browser.\n   * @param data\n   * @param password\n   */\n  async extractKeys(data: string, password: string): Promise<ExtractedKeys> {\n    const privateKey = await new EthereumKeyStore(data).getPrivateKey(password);\n    if (!bls.deserializeHexStrToSecretKey) {\n      await bls.init(bls.BLS12_381);\n    }\n    return {\n      privateKey: `0x${privateKey}`,\n      publicKey: `0x${bls.deserializeHexStrToSecretKey(privateKey).getPublicKey().serializeToHexStr()}`\n    };\n  }\n\n  /**\n   * Build threshold using private key and list of operators.\n   * @param privateKey\n   * @param operators\n   */\n  async createThreshold(privateKey: string, operators: IOperator[]): Promise<ISharesKeyPairs> {\n    const sortedOperators = operatorSortedList(operators);\n    this.threshold = await new Threshold().create(privateKey, sortedOperators.map(item => item.id));\n    return this.threshold;\n  }\n\n  /**\n   * Encrypt operators shares using operators list (id, publicKey).\n   * @param operators\n   * @param shares\n   */\n  async encryptShares(operators: IOperator[], shares: IShares[]): Promise<EncryptShare[]> {\n    const sortedOperators = operatorSortedList(operators);\n    const decodedOperatorPublicKeys = sortedOperators.map(item => Buffer.from(item.operatorKey, 'base64').toString());\n    return new Encryption(decodedOperatorPublicKeys, shares).encrypt();\n  }\n\n  /**\n   * Build shares from private key, operators list\n   * @param privateKey\n   * @param operators\n   */\n  async buildShares(privateKey: string, operators: IOperator[]): Promise<EncryptShare[]> {\n    const threshold = await this.createThreshold(privateKey, operators);\n    return this.encryptShares(operators, threshold.shares);\n  }\n\n  /**\n   * Getting threshold if it has been created before.\n   */\n  getThreshold()  {\n    return this.threshold;\n  }\n}\n", "import * as ethers from 'ethers';\nimport * as web3Helper from '../helpers/web3.helper';\nimport {\n  IsOptional,\n  ValidateNested,\n  validateSync\n} from 'class-validator';\n\nimport { KeySharesData } from './KeySharesData/KeySharesData';\nimport { KeySharesPayload } from './KeySharesData/KeySharesPayload';\nimport { EncryptShare } from '../Encryption/Encryption';\nimport { IKeySharesPartitialData } from './KeySharesData/IKeySharesData';\nimport { IOperator } from './KeySharesData/IOperator';\nimport { operatorSortedList } from '../helpers/operator.helper';\nimport { OwnerAddressFormatError, OwnerNonceFormatError } from '../exceptions/keystore';\nimport { SSVKeysException } from '../../lib/exceptions/base';\n\nexport interface IKeySharesPayloadData {\n  publicKey: string,\n  operators: IOperator[],\n  encryptedShares: EncryptShare[],\n}\n\nexport interface IKeySharesToSignatureData {\n  ownerAddress: string,\n  ownerNonce: number,\n  privateKey: string,\n}\n\nexport interface IKeySharesFromSignatureData {\n  ownerAddress: string,\n  ownerNonce: number,\n  publicKey: string,\n}\n\nconst SIGNATURE_LENGHT = 192;\nconst PUBLIC_KEY_LENGHT = 96;\n\n/**\n * Key shares file data interface.\n */\nexport class KeySharesItem {\n  @IsOptional()\n  @ValidateNested()\n  public data: KeySharesData;\n\n  @IsOptional()\n  @ValidateNested()\n  public payload: KeySharesPayload;\n\n  @IsOptional()\n  public error: SSVKeysException | null = null;\n\n  constructor() {\n    this.data = new KeySharesData();\n    this.payload = new KeySharesPayload();\n  }\n\n  /**\n   * Build payload from operators list, encrypted shares and validator public key\n   * @param publicKey\n   * @param operatorIds\n   * @param encryptedShares\n   */\n  async buildPayload(metaData: IKeySharesPayloadData, toSignatureData: IKeySharesToSignatureData): Promise<any> {\n    const {\n      ownerAddress,\n      ownerNonce,\n      privateKey,\n    } = toSignatureData;\n\n    if (!Number.isInteger(ownerNonce) || ownerNonce < 0) {\n      throw new OwnerNonceFormatError(ownerNonce, 'Owner nonce is not positive integer');\n    }\n\n    let address;\n    try {\n      address = web3Helper.web3.utils.toChecksumAddress(ownerAddress);\n    } catch {\n      throw new OwnerAddressFormatError(ownerAddress, 'Owner address is not a valid Ethereum address');\n    }\n\n    const payload = this.payload.build({\n      publicKey: metaData.publicKey,\n      operatorIds: operatorSortedList(metaData.operators).map(operator => operator.id),\n      encryptedShares: metaData.encryptedShares,\n    });\n\n    const signature = await web3Helper.buildSignature(`${address}:${ownerNonce}`, privateKey);\n    const signSharesBytes = web3Helper.hexArrayToBytes([signature, payload.sharesData]);\n\n    payload.sharesData = `0x${signSharesBytes.toString('hex')}`;\n\n    // verify signature\n    await this.validateSingleShares(payload.sharesData, {\n      ownerAddress,\n      ownerNonce,\n      publicKey: await web3Helper.privateToPublicKey(privateKey),\n    });\n\n    return payload;\n  }\n\n\n  async validateSingleShares(shares: string, fromSignatureData: IKeySharesFromSignatureData): Promise<void> {\n    const { ownerAddress, ownerNonce, publicKey } = fromSignatureData;\n\n    if (!Number.isInteger(ownerNonce) || ownerNonce < 0) {\n      throw new OwnerNonceFormatError(ownerNonce, 'Owner nonce is not positive integer');\n    }\n\n    const address = web3Helper.web3.utils.toChecksumAddress(ownerAddress);\n    const signaturePt = shares.replace('0x', '').substring(0, SIGNATURE_LENGHT);\n\n    await web3Helper.validateSignature(`${address}:${ownerNonce}`, `0x${signaturePt}`, publicKey);\n  }\n\n  /**\n   * Build shares from bytes string and operators list length\n   * @param bytes\n   * @param operatorCount\n   */\n  buildSharesFromBytes(bytes: string, operatorCount: number): any {\n    // Validate the byte string format (hex string starting with '0x')\n    if (!bytes.startsWith('0x') || !/^(0x)?[0-9a-fA-F]*$/.test(bytes)) {\n      throw new SSVKeysException('Invalid byte string format');\n    }\n\n    // Validate the operator count (positive integer)\n    if (operatorCount <= 0 || !Number.isInteger(operatorCount)) {\n      throw new SSVKeysException('Invalid operator count');\n    }\n\n    const sharesPt = bytes.replace('0x', '').substring(SIGNATURE_LENGHT);\n\n    const pkSplit = sharesPt.substring(0, operatorCount * PUBLIC_KEY_LENGHT);\n    const pkArray = ethers.utils.arrayify('0x' + pkSplit);\n    const sharesPublicKeys = this.splitArray(operatorCount, pkArray)\n      .map(item => ethers.utils.hexlify(item));\n\n    const eSplit = bytes.substring(operatorCount * PUBLIC_KEY_LENGHT);\n    const eArray = ethers.utils.arrayify('0x' + eSplit);\n    const encryptedKeys = this.splitArray(operatorCount, eArray).map(item =>\n      Buffer.from(ethers.utils.hexlify(item).replace('0x', ''), 'hex').toString(\n        'base64',\n      ),\n    );\n\n    return { sharesPublicKeys, encryptedKeys };\n  }\n\n  /**\n   * Updates the current instance with partial data and payload, and validates.\n   * @param data Partial key shares data.\n   * @param payload Partial key shares payload.\n   */\n  update(data: IKeySharesPartitialData): void {\n    this.data.update(data);\n    this.validate();\n  }\n\n  /**\n   * Validate everything\n   */\n  validate(): any {\n    validateSync(this);\n  }\n\n  /**\n   * Stringify key shares to be ready for saving in file.\n   */\n  toJson(): string {\n    return JSON.stringify({\n      data: this.data || null,\n      payload: this.payload || null,\n    }, null, 2);\n  }\n\n  private splitArray(parts: number, arr: Uint8Array) {\n    const partLength = Math.floor(arr.length / parts);\n    const partsArr = [];\n    for (let i = 0; i < parts; i++) {\n      const start = i * partLength;\n      const end = start + partLength;\n      partsArr.push(arr.slice(start, end));\n    }\n    return partsArr;\n  }\n\n  /**\n   * Initialise from JSON or object data.\n   */\n  static async fromJson(content: string | any): Promise<KeySharesItem> {\n    const body = typeof content === 'string' ? JSON.parse(content) : content;\n    const instance = new KeySharesItem();\n    try {\n      instance.data.update(body.data);\n      instance.payload.update(body.payload);\n      instance.validate();\n      // Custom validation: verify signature\n      await instance.validateSingleShares(instance.payload.sharesData, {\n        ownerAddress: instance.data.ownerAddress as string,\n        ownerNonce: instance.data.ownerNonce as number,\n        publicKey: instance.data.publicKey as string,\n      });\n    } catch (e: any) {\n      instance.error = e;\n    }\n    return instance;\n  }\n}\n", "import { IsString, Length, ValidateNested, IsOptional, validateSync, IsNumber } from 'class-validator';\nimport { OperatorData } from './OperatorData';\nimport { IKeySharesData, IKeySharesPartitialData } from './IKeySharesData';\nimport { OpeatorsListValidator, PublicKeyValidator, OwnerAddressValidator, OwnerNonceValidator } from './validators';\nimport { operatorSortedList } from '../../helpers/operator.helper';\n\nexport class KeySharesData implements IKeySharesData {\n  @IsOptional()\n  @IsNumber()\n  @OwnerNonceValidator()\n  public ownerNonce?: number | null = null;\n\n  @IsOptional()\n  @IsString()\n  @OwnerAddressValidator()\n  public ownerAddress?: string | null = null;\n\n  @IsOptional()\n  @IsString()\n  @Length(98, 98)\n  @PublicKeyValidator()\n  public publicKey?: string | null = null;\n\n  @IsOptional()\n  @ValidateNested({ each: true })\n  @OpeatorsListValidator()\n  public operators?: OperatorData[] | null = null;\n\n  update(data: IKeySharesPartitialData) {\n    if (data.ownerAddress) {\n      this.ownerAddress = data.ownerAddress;\n    }\n    if (typeof data.ownerNonce === 'number') {\n      this.ownerNonce = data.ownerNonce;\n    }\n    if (data.publicKey) {\n      this.publicKey = data.publicKey;\n    }\n    if (data.operators) {\n      this.operators = operatorSortedList(data.operators);\n    }\n  }\n\n  /**\n   * Do all possible validations.\n   */\n  async validate(): Promise<any> {\n    validateSync(this);\n  }\n\n  /**\n   * Get the list of operators IDs.\n   */\n  get operatorIds(): number[] {\n    if (!this.operators?.length) {\n      return [];\n    }\n    return this.operators.map(operator => parseInt(String(operator.id), 10));\n  }\n\n  /**\n   * Get the list of operators public keys.\n   */\n  get operatorPublicKeys(): string[] {\n    if (!this.operators?.length) {\n      return [];\n    }\n    return this.operators.map(operator => String(operator.operatorKey));\n  }\n}\n", "import * as web3Helper from '../../helpers/web3.helper';\n\nimport { IsString, Length, validateSync, IsNumber } from 'class-validator';\nimport { PublicKeyValidator } from './validators';\n\nimport { IKeySharesPartitialPayload, IKeySharesPayload } from './IKeySharesPayload';\nimport { EncryptShare } from '../../Encryption/Encryption';\n\n/**\n * Key Shares Payload\n */\nexport class KeySharesPayload implements IKeySharesPayload {\n  @IsString()\n  public sharesData!: string;\n\n  @IsString()\n  @Length(98, 98)\n  @PublicKeyValidator()\n  public publicKey!: string;\n\n  @IsNumber({}, { each: true })\n  public operatorIds!: number[];\n\n  /**\n   * Converts arrays of public and private keys to a single hexadecimal string.\n   * @param publicKeys Array of public keys.\n   * @param privateKeys Array of private keys.\n   * @returns Hexadecimal string representation of keys.\n   */\n  private _sharesToBytes(publicKeys: string[], privateKeys: string[]) {\n    const encryptedShares = [...privateKeys].map(item => ('0x' + Buffer.from(item, 'base64').toString('hex')));\n    const pkPsBytes = web3Helper.hexArrayToBytes([...publicKeys, ...encryptedShares]);\n    return `0x${pkPsBytes.toString('hex')}`;\n  }\n\n  /**\n   * Updates the payload with new data and validates it.\n   * @param data Partial key shares payload to update.\n   */\n  update(data: IKeySharesPartitialPayload): void {\n    this.publicKey = data.publicKey;\n    this.sharesData = data.sharesData;\n    this.operatorIds = data.operatorIds;\n    this.validate();\n  }\n\n  /**\n   * Validates the current state of the instance.\n   * @returns {void | ValidationError[]} Validation errors if any, otherwise undefined.\n   */\n  validate(): any {\n    validateSync(this);\n  }\n\n  /**\n   * Builds the payload from the given data.\n   * @param data Data to build the payload.\n   * @returns {KeySharesPayload} The current instance for chaining.\n   */\n  build(data: any): KeySharesPayload {\n    this.publicKey = data.publicKey;\n    this.operatorIds = data.operatorIds;\n    this.sharesData = this._sharesToBytes(\n      data.encryptedShares.map((share: EncryptShare) => share.publicKey),\n      data.encryptedShares.map((share: EncryptShare) => share.privateKey)\n    );\n\n    return this;\n  }\n}\n", "import semver from 'semver';\nimport pkg from '../../../package.json';\n\nimport { IsOptional, ValidateNested, validateSync } from 'class-validator';\nimport { KeySharesItem } from './KeySharesItem';\nimport { SSVKeysException } from '../../lib/exceptions/base';\n\n/**\n * Represents a collection of KeyShares items with functionality for serialization,\n * deserialization, and validation.\n */\nexport class KeyShares {\n  @IsOptional()\n  @ValidateNested({ each: true })\n  private shares: KeySharesItem[];\n\n  constructor(shares: KeySharesItem[] = []) {\n    this.shares = [...shares];\n  }\n\n  /**\n   * Add a single KeyShares item to the collection.\n   * @param keySharesItem The KeyShares item to add.\n   */\n  add(keySharesItem: KeySharesItem): void {\n    this.shares.push(keySharesItem);\n  }\n\n  list(): KeySharesItem[] {\n    return this.shares;\n  }\n\n  /**\n   * Validate the KeyShares instance using class-validator.\n   * @returns The validation result.\n   */\n  validate(): any {\n    validateSync(this);\n  }\n\n  /**\n   * Converts the KeyShares instance to a JSON string.\n   * @returns The JSON string representation of the KeyShares instance.\n   */\n  toJson(): string {\n    return JSON.stringify({\n      version: `v${pkg.version}`,\n      createdAt: new Date().toISOString(),\n      shares: this.shares.length > 0 ? this.shares : null,\n    }, null, 2);\n  }\n\n  /**\n   * Initialize the KeyShares instance from JSON or object data.\n   * @param content The JSON string or object to initialize from.\n   * @returns The KeyShares instance.\n   * @throws Error if the version is incompatible or the shares array is invalid.\n   */\n  static async fromJson(content: string | any): Promise<KeyShares> {\n    const body = typeof content === 'string' ? JSON.parse(content) : content;\n    const extVersion = semver.parse(body.version);\n    const currentVersion = semver.parse(pkg.version);\n\n    if (!extVersion || !currentVersion) {\n      throw new SSVKeysException(`The file for keyshares must contain a version mark provided by ssv-keys.`);\n    }\n\n    if (!extVersion || (currentVersion.major !== extVersion.major) || (currentVersion.minor !== extVersion.minor)) {\n      throw new SSVKeysException(`The keyshares file you are attempting to reuse does not have the same version (v${pkg.version}) as supported by ssv-keys`);\n    }\n\n    const instance = new KeyShares();\n    instance.shares = [];\n\n    if (Array.isArray(body.shares)) {\n      // Process each item in the array\n      for (const item of body.shares) {\n        instance.shares.push(await KeySharesItem.fromJson(item));\n      }\n    } else {\n      // Handle old format (single item)\n      instance.shares.push(await KeySharesItem.fromJson(body));\n    }\n    return instance;\n  }\n}\n"],
+  "mappings": "0zCAAA,IAAAA,GAAAC,GAAA,oCAAM,OAAS,QAAQ,SAASC,EAAE,CAAC,GAAG,OAAO,SAAU,UAAU,OAAO,QAAS,YAAa,OAAO,QAAQA,EAAE,UAAU,OAAO,QAAS,YAAY,OAAO,IAAK,OAAO,CAAC,EAAEA,CAAC,MAAM,CAAC,IAAIC,EAAK,OAAO,QAAS,YAAaA,EAAE,OAAe,OAAO,MAAO,YAAaA,EAAE,KAAUA,EAAE,KAAKA,EAAE,UAAYD,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,OAAO,OAAO,QAAQ,OAAQ,UAAU,CAAC,SAASE,EAAEC,EAAEC,EAAEC,EAAE,CAAC,SAASC,EAAEC,EAAEP,EAAE,CAAC,GAAG,CAACI,EAAEG,GAAG,CAAC,GAAG,CAACJ,EAAEI,GAAG,CAAC,IAAIC,EAAc,OAAO,SAAnB,YAA4B,QAAQ,GAAG,CAACR,GAAGQ,EAAE,OAAOA,EAAED,EAAE,EAAE,EAAE,GAAGE,EAAE,OAAOA,EAAEF,EAAE,EAAE,EAAE,IAAIG,EAAE,IAAI,MAAM,uBAAuBH,EAAE,GAAG,EAAE,MAAMG,EAAE,KAAK,mBAAmBA,CAAC,CAAC,IAAIC,EAAEP,EAAEG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAEJ,EAAEI,GAAG,GAAG,KAAKI,EAAE,QAAQ,SAAST,EAAE,CAAC,IAAIE,GAAED,EAAEI,GAAG,GAAGL,GAAG,OAAOI,EAAEF,IAAGF,CAAC,CAAC,EAAES,EAAEA,EAAE,QAAQT,EAAEC,EAAEC,EAAEC,CAAC,CAAC,CAAC,OAAOD,EAAEG,GAAG,OAAO,CAAC,QAAQE,EAAc,OAAO,SAAnB,YAA4B,QAAQF,EAAE,EAAEA,EAAEF,EAAE,OAAOE,IAAID,EAAED,EAAEE,EAAE,EAAE,OAAOD,CAAC,CAAC,OAAOJ,CAAC,EAAG,EAAE,CAAC,EAAE,CAAC,SAASU,EAAQC,EAAOC,EAAQ,CAEz0B,IAAMC,EAAYH,EAAQ,WAAW,EAErCC,EAAO,QAAUE,CAEjB,EAAE,CAAC,UAAY,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,QAAQ,OAAO,QAAQ,EASrD,SAA0CC,EAAMC,EAAS,CACtD,OAAO,SAAY,UAAY,OAAO,QAAW,SACnD,OAAO,QAAUA,EAAQ,EAClB,OAAO,QAAW,YAAc,OAAO,IAC9C,OAAO,CAAC,EAAGA,CAAO,EACX,OAAO,SAAY,SAC1B,QAAQ,UAAeA,EAAQ,EAE/BD,EAAK,UAAeC,EAAQ,CAC9B,GAAG,OAAQ,UAAW,CACtB,OAAiB,IAAM,CACb,aACA,IAAI,oBAAuB,CAE/B,qBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sDAAmrQ,CAElrQ,EAEA,2BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4DAA0of,CAEzof,EAEA,iBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kDAA6nB,CAE5nB,EAEA,2BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4DAAmtqB,CAEltqB,EAEA,6BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8DAAo9G,CAEn9G,EAEA,0BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DAA+kF,CAE9kF,EAEA,4BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,6DAA6jG,CAE5jG,EAEA,2BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4DAAsxF,CAErxF,EAEA,yBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0DAAq4sD,CAEp4sD,EAEA,0BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DAA+vD,CAE9vD,EAEA,wBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yDAA+kG,CAE9kG,EAEA,wBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yDAA4od,CAE3od,EAEA,yBAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0DAAqsD,CAEpsD,EAEA,kCAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mEAAi40D,CAEh40D,EAEA,+BAIC,CAAC,wBAAyB,oBAAqB,sBAAwB,CAE9E,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gEAAogG,CAEngG,EAEA,qBAIE,QAAW,CAEnB,KAAK;AAAA;AAAA,sDAAoG,CAEnG,CAEI,EAGI,yBAA2B,CAAC,EAGhC,SAAS,oBAAoBC,EAAU,CAEtC,IAAIC,EAAe,yBAAyBD,GAC5C,GAAIC,IAAiB,OACpB,OAAOA,EAAa,QAGrB,IAAIN,EAAS,yBAAyBK,GAAY,CAGjD,QAAS,CAAC,CACX,EAGA,2BAAoBA,GAAUL,EAAQA,EAAO,QAAS,mBAAmB,EAGlEA,EAAO,OACf,CAMC,oBAAoB,EAAI,CAACC,EAASM,IAAe,CAChD,QAAQC,KAAOD,EACX,oBAAoB,EAAEA,EAAYC,CAAG,GAAK,CAAC,oBAAoB,EAAEP,EAASO,CAAG,GAC/E,OAAO,eAAeP,EAASO,EAAK,CAAE,WAAY,GAAM,IAAKD,EAAWC,EAAK,CAAC,CAGjF,EAKA,oBAAoB,EAAI,CAACC,EAAKC,IAAU,OAAO,UAAU,eAAe,KAAKD,EAAKC,CAAI,EAMtF,oBAAoB,EAAKT,GAAY,CACjC,OAAO,QAAW,aAAe,OAAO,aAC1C,OAAO,eAAeA,EAAS,OAAO,YAAa,CAAE,MAAO,QAAS,CAAC,EAEvE,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,CAC7D,EAQD,IAAI,oBAAsB,oBAAoB,gBAAgB,EAC9D,2BAAsB,oBAAoB,QAEnC,mBACR,GAAG,CAEZ,CAAC,CACD,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAChB,CAAC,ICjQD,IAAAU,GAAA,GAAAC,GAAAD,GAAA,gBAAAE,EAAA,qBAAAC,EAAA,cAAAC,EAAA,kBAAAC,EAAA,YAAAC,EAAA,qBAAAC,EAAA,cAAAC,IAAA,eAAAC,GAAAT,ICAA,IAAIU,GAEJ,GAAI,CACF,OAAO,OACPA,GAAQ,QAAQ,uBAClB,OAAQC,EAAN,CACAD,GAAQ,QAAQ,eAClB,CAEA,IAAOE,EAAQF,GCTR,IAAMG,EAAN,cAA+B,KAAM,CAG1C,YAAYC,EAAiB,CAC3B,MAAMA,CAAO,EACb,KAAK,KAAO,KAAK,YAAY,KAC7B,MAAM,kBAAkB,KAAM,KAAK,WAAW,EAC9C,KAAK,MAAQ,KAAK,MAClB,KAAK,MAAQ,GAAG,KAAK,SAAS,KAAK,SACrC,CACF,ECRO,IAAMC,EAAN,cAAsCC,CAAiB,CAG5D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaE,EAAN,cAAmCH,CAAiB,CAGzD,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaG,EAAN,cAAoCJ,CAAiB,CAC1D,YAAYE,EAAiB,CAC3B,MAAMA,CAAO,CACf,CACF,EAEaG,EAAN,cAAkCL,CAAiB,CACxD,YAAYE,EAAiB,CAC3B,MAAMA,CAAO,CACf,CACF,EAEaI,EAAN,cAAoCN,CAAiB,CAG1D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaM,EAAN,cAAsCP,CAAiB,CAG5D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,EAEaO,EAAN,cAAoCR,CAAiB,CAG1D,YAAYC,EAAWC,EAAiB,CACtC,MAAMA,CAAO,EACb,KAAK,KAAOD,CACd,CACF,ECzDA,IAAAQ,GAA6B,+BCE7B,IAAAC,GAAmB,qBACnBC,GAAgC,cAQzB,IAAMC,GAAW,CAAOC,EAAkBC,EAAK,KAAuBC,EAAA,wBAC3E,OAAO,GAAAC,SAAI,SAASH,EAAU,CAAE,SAAU,OAAQ,CAAC,EAAE,KAAMI,GAClDH,EAAO,KAAK,MAAMG,CAAI,EAAIA,CAClC,CACH,GDXO,IAAMC,GAAN,KAAgC,CAAhC,cACL,KAAU,iBAAmB,GAQvB,iBAAiBC,EAAkBC,EAAqD,QAAAC,EAAA,sBAC5F,GAAI,CAACF,EAAS,KAAK,EAAE,OACnB,MAAO,oBAET,IAAMG,EAAe,kCAEjBC,EACJ,GAAI,CAkBF,IAAMC,EAAO,MAAMC,GAASL,CAAgB,EAG5CG,EAAS,CAAC,EADS,MADF,IAAI,GAAAG,QAAiBF,CAAI,EACR,cAAcL,CAAQ,EAE1D,OAASQ,EAAP,CACAJ,EAASD,CACX,CAOA,OAAOC,CACT,GACF,EAEaK,GAA4B,IAAIV,GEvDtC,IAAMW,GAAN,KAA2B,CAA3B,cACL,KAAO,eAAiB,EAExB,kBAAkBC,EAAsB,CACtC,KAAK,eAAiBA,CACxB,CACF,EAEaC,GAA0BC,GACjC,EAAAA,EAAS,GAAKA,EAAS,IAAMA,EAAS,GAAK,GAMpCC,GAAuB,IAAIJ,GCfxC,IAAAK,GAAuB,qBCAvB,IAAIC,GAEJ,GAAI,CACF,OAAO,OACPA,GAAQ,QAAQ,aAAa,SAC/B,OAAQC,EAAN,CACAD,GAAQ,IACV,CAEA,IAAOE,EAAQF,GCLR,IAAMG,EAAN,cAAwCC,CAAiB,CAG9D,YAAYC,EAAyBC,EAAiB,CACpD,MAAMA,CAAO,EACb,KAAK,SAAWD,CAClB,CACF,EAEaE,GAAN,cAA+CH,CAAiB,CAGrE,YAAYC,EAAyBC,EAAiB,CACpD,MAAMA,CAAO,EACb,KAAK,SAAWD,CAClB,CACF,EAEaG,EAAN,cAA2CJ,CAAiB,CAIjE,YAAYK,EAA2CC,EAA2CJ,EAAiB,CACjH,MAAMA,CAAO,EACb,KAAK,QAAUG,EACf,KAAK,QAAUC,CACjB,CACF,EAEaC,EAAN,cAAqCP,CAAiB,CAG3D,YAAYC,EAA2CC,EAAiB,CACtE,MAAMA,CAAO,EACb,KAAK,SAAWD,CAClB,CACF,EFpCO,IAAMO,EAA8BC,GAA+B,CACxEA,EAAYA,EAAU,KAAK,EAE3B,IAAMC,EAAQ,iCACRC,EAAM,+BAENC,EAAU,IAAIC,EAAU,CAAC,CAAC,EAC5BC,EAAkB,GACtB,GAAI,CACF,IAAIC,EAAmB,GAEvB,GAAKN,EAAU,WAAWC,CAAK,EAe7BK,EAAmBN,MAfa,CAChC,GAAIA,EAAU,OAAS,GACrB,MAAM,IAAI,MAAM,uEAAuE,EAGzF,GAAI,CACFM,KAAmB,WAAON,CAAS,EAAE,KAAK,CAC5C,OAASO,EAAP,CACA,MAAM,IAAI,MAAM,iFAAiF,CACnG,CAEA,GAAI,CAACD,EAAiB,WAAWL,CAAK,EACpC,MAAM,IAAI,MAAM,4CAA4CA,IAAQ,CAExE,CAIA,GAAI,CAACK,EAAiB,SAASJ,CAAG,EAChC,MAAM,IAAI,MAAM,0CAA0CA,IAAM,EAGlE,GAAI,CAEF,IAAMM,EAAUF,EAAiB,MAAML,EAAM,OAAQD,EAAU,OAASE,EAAI,MAAM,EAAE,KAAK,EACzFG,KAAkB,WAAOG,CAAO,CAClC,OAASD,EAAP,CACA,MAAM,IAAI,MAAM,4EAA4E,CAC9F,CAEA,GAAI,CACFJ,EAAQ,aAAaE,CAAe,CACtC,OAASE,EAAP,CACA,MAAM,IAAI,MAAM,4EAA4E,CAC9F,CACF,OAASA,EAAP,CACA,MAAM,IAAIE,EACR,CACE,IAAKJ,EACL,OAAQL,CACV,EACAO,EAAM,OACR,CACF,CACA,MAAO,EACT,EGxCO,IAAMG,GAAN,cAAmDC,CAAiB,CAIzE,YAAYC,EAAqBC,EAAiB,CAChD,MAAMA,CAAO,EACb,KAAK,UAAYD,CACnB,CACF,EAEaE,GAAN,cAA8CH,CAAiB,CAIpE,YAAYI,EAAeF,EAAiB,CAC1C,MAAMA,CAAO,EACb,KAAK,SAAWE,CAClB,CACF,EAKMC,GAAN,KAAgB,CAAhB,cAGE,KAAU,OAAqB,CAAC,EAEhC,WAAW,0BAAmC,CAC5C,MAAO,EACT,CASM,OAAOC,EAA0BC,EAAiD,QAAAC,EAAA,sBACtF,GAAI,CAACF,EAAiB,WAAW,IAAI,EACnC,MAAM,IAAIG,EAAsBH,EAAkB,oDAAoD,EAYxG,GATAC,EAAY,IAAIG,GAAc,CAC5B,GAAI,CAAC,OAAO,UAAUA,CAAU,EAC9B,MAAM,IAAIP,GACRO,EACA,kCAAkCA,GACpC,CAEJ,CAAC,EAEG,CAACC,GAAuBJ,EAAY,MAAM,EAC5C,MAAM,IAAIR,GACRQ,EACA,4EACF,EAGF,IAAMK,EAAM,CAAC,EACPC,EAAM,CAAC,EAERC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAG9B,KAAK,WAAaA,EAAI,6BAA6BR,EAAiB,QAAQ,KAAM,EAAE,CAAC,EACrF,KAAK,UAAY,KAAK,WAAW,aAAa,EAE9CM,EAAI,KAAK,KAAK,UAAU,EACxBC,EAAI,KAAK,KAAK,SAAS,EAEvB,IAAME,GAAKR,EAAY,OAAS,GAAK,EAErC,QAASS,EAAI,EAAGA,EAAIT,EAAY,OAASQ,EAAGC,GAAK,EAAG,CAClD,IAAMC,EAAoB,IAAIH,EAAI,UAClCG,EAAG,YAAY,EACfL,EAAI,KAAKK,CAAE,EACX,IAAMC,EAAKD,EAAG,aAAa,EAC3BJ,EAAI,KAAKK,CAAE,CACb,CAGA,QAAWR,KAAcH,EAAa,CACpC,IAAMY,EAAK,IAAIL,EAAI,GACnBK,EAAG,OAAOT,CAAU,EACpB,IAAMU,EAAiB,IAAIN,EAAI,UAC/BM,EAAe,MAAMR,EAAKO,CAAE,EAE5B,IAAME,EAAiB,IAAIP,EAAI,UAC/BO,EAAe,MAAMR,EAAKM,CAAE,EAE5B,KAAK,OAAO,KAAK,CACf,WAAY,KAAKC,EAAe,kBAAkB,IAClD,UAAW,KAAKC,EAAe,kBAAkB,IACjD,GAAAF,CACF,CAAC,CACH,CAQA,MANkC,CAChC,WAAY,KAAK,KAAK,WAAW,kBAAkB,IACnD,UAAW,KAAK,KAAK,UAAU,kBAAkB,IACjD,OAAQ,KAAK,MACf,CAGF,GACF,EAEOG,EAAQjB,GClIf,IAAAkB,GAAmB,qBACnBC,GAA2B,qBAC3BC,GAAmB,gCACnBC,GAAkC,2BAiDlC,IAAMC,GAAN,KAAuB,CASrB,YAAYC,EAAmB,CAP/B,KAAQ,WAAa,GAQnB,GAAI,CAACA,EACH,MAAM,IAAIC,EAAwBD,EAAc,yCAAyC,EAO3F,GALI,OAAOA,GAAiB,SAC1B,KAAK,aAAe,KAAK,MAAMA,CAAY,EAE3C,KAAK,aAAeA,EAElB,CAAC,KAAK,aAAa,QACrB,MAAM,IAAIE,EAAqB,KAAK,aAAc,uBAAuB,CAE7E,CAEA,cAAuB,CA3EzB,IAAAC,EA4EI,GAAI,KAAK,aACP,QAAQA,EAAA,KAAK,aAAa,UAAlB,KAAAA,EAA6B,KAAK,aAAa,aAChD,GACH,OAAO,KAAK,aAAa,YACtB,GACH,OAAO,KAAK,aAAa,OACtB,GACH,OAAO,KAAK,aAAa,OAG/B,MAAO,EACT,CAMM,cAAcC,EAAW,GAAqB,QAAAC,EAAA,sBAElD,GAAI,KAAK,WAAY,OAAO,KAAK,WACjC,OAAQ,KAAK,aAAa,aACnB,GACH,KAAK,OAAS,MAAM,GAAAC,QAAO,OAAO,KAAK,aAAcF,CAAQ,EAC7D,UACG,GACH,KAAK,OAAS,MAAM,GAAAE,QAAO,OAAO,KAAK,aAAcF,EAAU,EAAI,EACnE,UACG,GACH,KAAK,OAAS,MAAM,KAAK,OAAO,KAAK,aAAcA,CAAQ,EAC3D,MAEJ,GAAI,KAAK,SACP,KAAK,WAAa,KAAK,OAAO,cAAc,EAAE,SAAS,KAAK,EACxD,CAAC,KAAK,YACR,MAAM,IAAIG,EAAsB,kBAAkB,EAGtD,OAAO,KAAK,UACd,GAQa,OACXC,EACAJ,EACiB,QAAAC,EAAA,sBACjB,IAAMI,EAAmB,OAAOD,GAAU,SAAWA,EAAQ,KAAK,MAAMA,CAAK,EAE7E,GAAIC,EAAK,UAAY,EACnB,MAAM,IAAIC,EAAoB,iBAAiB,EAGjD,IAAIC,EACAC,EACJ,GAAIH,EAAK,OAAO,IAAI,WAAa,SAC/BG,EAAYH,EAAK,OAAO,IAAI,OAC5BE,KAAa,eACX,OAAO,KAAKP,CAAQ,EACpB,OAAO,KAAKQ,EAAU,KAAM,KAAK,EACjCA,EAAU,EACVA,EAAU,EACVA,EAAU,EACVA,EAAU,KACZ,UACSH,EAAK,OAAO,IAAI,WAAa,SAAU,CAGhD,GAFAG,EAAYH,EAAK,OAAO,IAAI,OAExBG,EAAU,MAAQ,cACpB,MAAM,IAAIF,EAAoB,kCAAkC,EAGlEC,EAAa,GAAAE,QAAO,WAClB,OAAO,KAAKT,CAAQ,EACpB,OAAO,KAAKQ,EAAU,KAAM,KAAK,EACjCA,EAAU,EACVA,EAAU,MACV,QACF,CACF,KACE,OAAM,IAAIF,EAAoB,mCAAmC,EAGnE,IAAMI,EAAa,OAAO,KAAKL,EAAK,OAAO,OAAO,QAAS,KAAK,EAC1DM,EAAiB,OAAO,OAAO,CAAC,OAAO,KAAKJ,EAAW,MAAM,GAAI,EAAE,CAAC,EAAGG,CAAU,CAAC,EAKlFE,EAJqC,CACzC,uBACA,gBACF,EACwCP,EAAK,OAAO,SAAS,UAE7D,GADoBO,EAAaD,CAAc,EACvC,SAAS,KAAK,IAAMN,EAAK,OAAO,SAAS,QAC/C,MAAM,IAAIC,EAAoB,kBAAkB,EAGlD,IAAMO,EAAW,GAAAJ,QAAO,iBACtBJ,EAAK,OAAO,OAAO,SACnBE,EAAW,MAAM,EAAG,EAAE,EACtB,OAAO,KAAKF,EAAK,OAAO,OAAO,OAAO,GAAI,KAAK,CACjD,EACMS,EAAe,KAAK,gBAAgBD,EAAUH,CAAU,EAC9D,OAAO,IAAI,GAAAR,QAAOY,CAAI,CACxB,GAMU,gBAAgBC,EAAyCC,EAAsB,CACvF,OAAO,OAAO,OAAO,CAACD,EAAO,OAAOC,CAAI,EAAGD,EAAO,MAAM,CAAC,CAAC,CAC5D,CAMA,OAAO,YAAYE,EAA+B,CAChD,OAAO,MAAM,KAAKA,EAAYC,GAEpB,KAAKA,EAAO,KAAM,SAAS,EAAE,IAAK,MAAM,EAAE,CACnD,EAAE,KAAK,EAAE,CACZ,CACF,EAEOC,EAAQxB,GC9Lf,IAAqByB,EAArB,KAAgC,CAK9B,YAAYC,EAA8BC,EAAmB,CAC3D,KAAK,mBAAqB,CAAC,GAAGD,CAAkB,EAChD,KAAK,OAASC,CAChB,CAEA,SAA0B,CACxB,IAAMC,EAAkC,CAAC,EACzC,OAAW,CAACC,EAAKC,CAAiB,IAAK,KAAK,mBAAmB,QAAQ,EAAG,CACxEC,EAA2BD,CAAiB,EAC5C,IAAME,EAAY,IAAIC,EAAU,CAAC,CAAC,EAClCD,EAAU,aAAaF,CAAiB,EACxC,IAAMI,EAAsBF,EAAU,QAAQ,KAAK,OAAOH,GAAK,UAAU,EACzE,GAAI,CAACK,EACH,MAAM,IAAIC,EACR,CACE,IAAKL,EACL,OAAQI,CACV,EACA,gCACF,EAEF,IAAME,EAA+B,CACjC,kBAAAN,EACA,WAAYI,EACZ,UAAW,KAAK,OAAOL,GAAK,SAChC,EACAD,EAAgB,KAAKQ,CAAc,CACrC,CACA,OAAOR,CACT,CACF,EChDA,IAAAS,EAAqE,2BCArE,IAAAC,GAKO,2BAIA,IAAMC,EAAN,KAA8E,CACnF,SAASC,EAAoB,CAC3B,IAAMC,EAAc,IAAI,IAAOC,EAAqB,IAAI,IACxD,QAAWC,KAAYH,GAAiB,CAAC,EAAG,CAC1C,GAAIC,EAAY,IAAIE,EAAS,EAAE,EAC7B,MAAM,IAAIC,EAA0BD,EAAU,oBAAoBA,EAAS,+BAA+B,EAI5G,GAFAF,EAAY,IAAIE,EAAS,EAAE,EAEvBD,EAAmB,IAAIC,EAAS,WAAW,EAC7C,MAAM,IAAIE,GAAiCF,EAAU,kCAAkCA,EAAS,8BAA8B,EAEhID,EAAmB,IAAIC,EAAS,WAAW,CAC7C,CACA,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,kDACT,CACF,EApBaJ,EAANO,EAAA,IADN,wBAAoB,CAAE,KAAM,aAAc,MAAO,EAAM,CAAC,GAC5CP,GAsBN,SAASQ,GAAsBC,EAAuC,CAC3E,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWT,CACb,CAAC,CACH,CACF,CCxCA,IAAAY,GAKO,2BCLA,IAAMC,GAAN,cAAkCC,CAAiB,CAGxD,YAAYC,EAAmBC,EAAiB,CAC9C,MAAMA,CAAO,EACb,KAAK,UAAYD,CACnB,CACF,EAEaE,GAAN,cAA2CH,CAAiB,CAGjE,YAAYI,EAAcF,EAAiB,CACzC,MAAMA,CAAO,EACb,KAAK,KAAOE,CACd,CACF,EDNO,IAAMC,EAAN,KAA2E,CAC1E,SAASC,EAAY,QAAAC,EAAA,sBACzB,GAAI,CACE,OAAOD,GAAU,SACnBE,EAAI,6BAA6BF,EAAM,QAAQ,KAAM,EAAE,CAAC,EAExDA,EAAM,QAASG,GAAiBD,EAAI,6BAA6BC,EAAK,QAAQ,KAAM,EAAE,CAAC,CAAC,CAE5F,OAAS,EAAP,CACA,MAAM,IAAIC,GAAqBJ,EAAO,gDAAgD,CACxF,CACA,MAAO,EACT,GAEA,gBAAiB,CACf,MAAO,oBACT,CACF,EAjBaD,EAANM,EAAA,IADN,wBAAoB,CAAE,KAAM,YAAa,MAAO,EAAK,CAAC,GAC1CN,GAmBN,SAASO,EAAmBC,EAAuC,CACxE,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWR,CACb,CAAC,CACH,CACF,CExCA,IAAAW,GAKO,2BCLP,IAAAC,GAAiB,mBACjBC,GAAwB,qBACxBC,GAAyB,8BAKlB,IAAMC,EAAO,IAAI,GAAAC,QAgDjB,IAAMC,GAAmBC,GAA6B,CAC3D,IAAMC,EAAa,IAAI,WAAWD,EAAO,IAAIE,GAAQ,CAAC,GAAU,SAAM,SAASA,CAAI,CAAC,CAAC,EAAE,KAAK,CAAC,EAC7F,OAAO,OAAO,KAAKD,CAAU,CAC/B,EAaaE,GAAiB,CAAMC,EAAoBC,IAA2CC,EAAA,wBAC5FC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAG9B,IAAMC,EAAaD,EAAI,6BAA6BF,EAAc,QAAQ,KAAM,EAAE,CAAC,EAE7EI,EAAsB,aAAU,OAAO,KAAKL,CAAU,CAAC,EAG7D,MAAO,KAFWI,EAAW,KAAK,IAAI,WAAWC,CAAW,CAAC,EAC9B,kBAAkB,GAEnD,GAcaC,GAAoB,CAAMC,EAAoBC,EAAsBC,IAAqCP,EAAA,wBAC/GC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAG9B,IAAMO,EAAeP,EAAI,6BAA6BM,EAAU,QAAQ,KAAM,EAAE,CAAC,EAC3EE,EAAYR,EAAI,6BAA6BK,EAAa,QAAQ,KAAM,EAAE,CAAC,EAE3EH,EAAsB,aAAU,OAAO,KAAKE,CAAU,CAAC,EAE7D,GAAI,CAACG,EAAa,OAAOC,EAAW,IAAI,WAAWN,CAAW,CAAC,EAC7D,MAAM,IAAIO,GAA6BJ,EAAc,oCAAoC,CAE7F,GAEaK,GAA2BT,GAAwCF,EAAA,wBAC9E,OAAKC,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAEvB,KAAKA,EAAI,6BAA6BC,EAAW,QAAQ,KAAM,EAAE,CAAC,EAAE,aAAa,EAAE,kBAAkB,GAC9G,GDxGO,IAAMU,EAAN,KAA8E,CACnF,SAASC,EAAY,CACnB,GAAI,CACSC,EAAK,MAAM,kBAAkBD,CAAK,CAC/C,OAAQ,EAAN,CACA,MAAM,IAAIE,EAAwBF,EAAO,+CAA+C,CAC1F,CACA,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,uBACT,CACF,EAbaD,EAANI,EAAA,IADN,wBAAoB,CAAE,KAAM,eAAgB,MAAO,EAAM,CAAC,GAC9CJ,GAeN,SAASK,GAAsBC,EAAuC,CAC3E,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWN,CACb,CAAC,CACH,CACF,CErCA,IAAAS,GAKO,2BAMA,IAAMC,EAAN,KAA4E,CACjF,SAASC,EAAY,CACnB,GAAI,CAAC,OAAO,UAAUA,CAAK,GAAKA,EAAQ,EACtC,MAAM,IAAIC,EAAsBD,EAAO,qCAAqC,EAE9E,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,qBACT,CACF,EAXaD,EAANG,EAAA,IADN,wBAAoB,CAAE,KAAM,aAAc,MAAO,EAAM,CAAC,GAC5CH,GAaN,SAASI,GAAoBC,EAAuC,CACzE,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWL,CACb,CAAC,CACH,CACF,CClCA,IAAAQ,GAMO,2BAIA,IAAMC,GAAN,KAA6E,CAClF,SAASC,EAAYC,EAA2B,CAC9C,GAAM,CAACC,EAAqBC,CAAW,EAAIF,EAAK,YAC1CG,EAAiBH,EAAK,OAAeC,GAAqB,OAChE,GAAI,CAAC,MAAM,QAAQF,CAAK,EACtB,OAAO,OAAOA,CAAK,EAAE,QAASK,GAAa,CACzC,GAAID,IAAkBC,EAAI,OACxB,MAAM,IAAIC,EAA8BL,EAAK,OAAeC,GAAsBF,EAAOG,EAAY,OAAO,CAEhH,CAAC,UAEGC,IAAkBJ,EAAM,OAC1B,MAAM,IAAIM,EAA8BL,EAAK,OAAeC,GAAsBF,EAAOG,EAAY,OAAO,EAGhH,MAAO,EACT,CAEA,gBAAiB,CACf,MAAO,+CACT,CACF,EArBaJ,GAANQ,EAAA,IADN,wBAAoB,CAAE,KAAM,cAAe,MAAO,EAAM,CAAC,GAC7CR,ICVb,IAAAS,GAKO,2BAIA,IAAMC,EAAN,KAAkF,CACvF,SAASC,EAAY,CACnB,OAAOC,EAA2BD,CAAK,CACzC,CAEA,gBAAiB,CACf,MAAO,6BACT,CACF,EARaD,EAANG,EAAA,IADN,wBAAoB,CAAE,KAAM,cAAe,MAAO,EAAM,CAAC,GAC7CH,GAUN,SAASI,GAA0BC,EAAuC,CAC/E,OAAO,SAAUC,EAAaC,EAAsB,IAClD,sBAAkB,CAChB,OAAQD,EAAO,YACf,aAAAC,EACA,QAASF,EACT,YAAa,CAAC,EACd,UAAWL,CACb,CAAC,CACH,CACF,CRxBO,IAAMQ,EAAN,KAA4C,CAYjD,YAAYC,EAAiB,CAC3B,KAAK,GAAKA,EAAK,GACf,KAAK,YAAcA,EAAK,YACxB,KAAK,SAAS,CAChB,CAKA,UAAiB,IACf,gBAAa,IAAI,CACnB,CACF,EApBSC,EAAA,IAHN,cAAW,CAAE,QAAS,yBAAyB,CAAC,KAChD,aAAU,CAAE,QAAS,8BAA8B,CAAC,KACpD,SAAM,CAAE,QAAS,oCAAoC,CAAC,GAH5CF,EAIJ,kBAMAE,EAAA,IAJN,cAAW,CAAE,QAAS,iCAAiC,CAAC,KACxD,aAAU,CAAE,QAAS,sCAAsC,CAAC,KAC5D,YAAS,CAAE,QAAS,0CAA0C,CAAC,EAC/DC,GAA0B,GAThBH,EAUJ,2BSNF,IAAMI,EAAsBC,GAA2C,CAE5E,IAAMC,EAAMD,EAAU,IAAIE,GAAMA,EAAG,EAAE,EAC/BC,EAAeH,EAAU,IAAIE,GAAMA,EAAG,WAAW,EAGjDE,EAAqBJ,EAAU,IAAKK,GAAkB,CAC1D,IAAMC,EAAK,SAASD,EAAS,GAAI,EAAE,EACnC,GAAI,MAAMC,CAAE,EACV,MAAM,IAAIC,EAA6BN,EAAKE,EAAc,wBAAwBE,EAAS,IAAI,EAEjG,GAAI,CAACA,EAAS,YACZ,MAAM,IAAIE,EAA6BN,EAAKE,EAAc,4CAA4CG,GAAI,EAE5G,OAAOE,GAAAC,GAAA,GAAKJ,GAAL,CAAe,GAAAC,CAAG,EAC3B,CAAC,EAGD,OAAAF,EAAmB,KAAK,CAACM,EAAGC,IAAMD,EAAE,GAAKC,EAAE,EAAE,EAGtCP,EAAmB,IAAIC,GAAY,IAAIO,EAAaP,CAAQ,CAAC,CACtE,ECVO,IAAMQ,EAAN,KAAc,CAWb,YAAYC,EAAcC,EAA0C,QAAAC,EAAA,sBACxE,IAAMC,EAAa,MAAM,IAAIC,EAAiBJ,CAAI,EAAE,cAAcC,CAAQ,EAC1E,OAAKI,EAAI,+BACP,MAAMA,EAAI,KAAKA,EAAI,SAAS,GAEvB,CACL,WAAY,KAAKF,IACjB,UAAW,KAAKE,EAAI,6BAA6BF,CAAU,EAAE,aAAa,EAAE,kBAAkB,GAChG,CACF,GAOM,gBAAgBA,EAAoBG,EAAkD,QAAAJ,EAAA,sBAC1F,IAAMK,EAAkBC,EAAmBF,CAAS,EACpD,YAAK,UAAY,MAAM,IAAIG,EAAU,EAAE,OAAON,EAAYI,EAAgB,IAAIG,GAAQA,EAAK,EAAE,CAAC,EACvF,KAAK,SACd,GAOM,cAAcJ,EAAwBK,EAA4C,QAAAT,EAAA,sBAEtF,IAAMU,EADkBJ,EAAmBF,CAAS,EACF,IAAII,GAAQ,OAAO,KAAKA,EAAK,YAAa,QAAQ,EAAE,SAAS,CAAC,EAChH,OAAO,IAAIG,EAAWD,EAA2BD,CAAM,EAAE,QAAQ,CACnE,GAOM,YAAYR,EAAoBG,EAAiD,QAAAJ,EAAA,sBACrF,IAAMY,EAAY,MAAM,KAAK,gBAAgBX,EAAYG,CAAS,EAClE,OAAO,KAAK,cAAcA,EAAWQ,EAAU,MAAM,CACvD,GAKA,cAAgB,CACd,OAAO,KAAK,SACd,CACF,EA5Daf,EACJ,kBAAoB,MCtB7B,IAAAgB,EAAwB,qBAExB,IAAAC,EAIO,2BCNP,IAAAC,EAAqF,2BAM9E,IAAMC,EAAN,KAA8C,CAA9C,cAIL,KAAO,WAA6B,KAKpC,KAAO,aAA+B,KAMtC,KAAO,UAA4B,KAKnC,KAAO,UAAoC,KAE3C,OAAOC,EAA+B,CAChCA,EAAK,eACP,KAAK,aAAeA,EAAK,cAEvB,OAAOA,EAAK,YAAe,WAC7B,KAAK,WAAaA,EAAK,YAErBA,EAAK,YACP,KAAK,UAAYA,EAAK,WAEpBA,EAAK,YACP,KAAK,UAAYC,EAAmBD,EAAK,SAAS,EAEtD,CAKM,UAAyB,QAAAE,EAAA,yBAC7B,gBAAa,IAAI,CACnB,GAKA,IAAI,aAAwB,CArD9B,IAAAC,EAsDI,OAAKA,EAAA,KAAK,YAAL,MAAAA,EAAgB,OAGd,KAAK,UAAU,IAAIC,GAAY,SAAS,OAAOA,EAAS,EAAE,EAAG,EAAE,CAAC,EAF9D,CAAC,CAGZ,CAKA,IAAI,oBAA+B,CA/DrC,IAAAD,EAgEI,OAAKA,EAAA,KAAK,YAAL,MAAAA,EAAgB,OAGd,KAAK,UAAU,IAAIC,GAAY,OAAOA,EAAS,WAAW,CAAC,EAFzD,CAAC,CAGZ,CACF,EA3DSC,EAAA,IAHN,cAAW,KACX,YAAS,EACTC,GAAoB,GAHVP,EAIJ,0BAKAM,EAAA,IAHN,cAAW,KACX,YAAS,EACTE,GAAsB,GARZR,EASJ,4BAMAM,EAAA,IAJN,cAAW,KACX,YAAS,KACT,UAAO,GAAI,EAAE,EACbG,EAAmB,GAdTT,EAeJ,yBAKAM,EAAA,IAHN,cAAW,KACX,kBAAe,CAAE,KAAM,EAAK,CAAC,EAC7BI,GAAsB,GAnBZV,EAoBJ,yBCxBT,IAAAW,EAAyD,2BASlD,IAAMC,EAAN,KAAoD,CAkBjD,eAAeC,EAAsBC,EAAuB,CAClE,IAAMC,EAAkB,CAAC,GAAGD,CAAW,EAAE,IAAIE,GAAS,KAAO,OAAO,KAAKA,EAAM,QAAQ,EAAE,SAAS,KAAK,CAAE,EAEzG,MAAO,KADsBC,GAAgB,CAAC,GAAGJ,EAAY,GAAGE,CAAe,CAAC,EAC1D,SAAS,KAAK,GACtC,CAMA,OAAOG,EAAwC,CAC7C,KAAK,UAAYA,EAAK,UACtB,KAAK,WAAaA,EAAK,WACvB,KAAK,YAAcA,EAAK,YACxB,KAAK,SAAS,CAChB,CAMA,UAAgB,IACd,gBAAa,IAAI,CACnB,CAOA,MAAMA,EAA6B,CACjC,YAAK,UAAYA,EAAK,UACtB,KAAK,YAAcA,EAAK,YACxB,KAAK,WAAa,KAAK,eACrBA,EAAK,gBAAgB,IAAKC,GAAwBA,EAAM,SAAS,EACjED,EAAK,gBAAgB,IAAKC,GAAwBA,EAAM,UAAU,CACpE,EAEO,IACT,CACF,EAxDSC,EAAA,IADN,YAAS,GADCR,EAEJ,0BAKAQ,EAAA,IAHN,YAAS,KACT,UAAO,GAAI,EAAE,EACbC,EAAmB,GANTT,EAOJ,yBAGAQ,EAAA,IADN,YAAS,CAAC,EAAG,CAAE,KAAM,EAAK,CAAC,GATjBR,EAUJ,2BFcT,IAAMU,GAAmB,IACnBC,GAAoB,GAKbC,GAAN,KAAoB,CAYzB,aAAc,CAFd,KAAO,MAAiC,KAGtC,KAAK,KAAO,IAAIC,EAChB,KAAK,QAAU,IAAIC,CACrB,CAQM,aAAaC,EAAiCC,EAA0D,QAAAC,EAAA,sBAC5G,GAAM,CACJ,aAAAC,EACA,WAAAC,EACA,WAAAC,CACF,EAAIJ,EAEJ,GAAI,CAAC,OAAO,UAAUG,CAAU,GAAKA,EAAa,EAChD,MAAM,IAAIE,EAAsBF,EAAY,qCAAqC,EAGnF,IAAIG,EACJ,GAAI,CACFA,EAAqBC,EAAK,MAAM,kBAAkBL,CAAY,CAChE,OAAQM,EAAN,CACA,MAAM,IAAIC,EAAwBP,EAAc,+CAA+C,CACjG,CAEA,IAAMQ,EAAU,KAAK,QAAQ,MAAM,CACjC,UAAWX,EAAS,UACpB,YAAaY,EAAmBZ,EAAS,SAAS,EAAE,IAAIa,GAAYA,EAAS,EAAE,EAC/E,gBAAiBb,EAAS,eAC5B,CAAC,EAEKc,EAAY,MAAiBC,GAAe,GAAGR,KAAWH,IAAcC,CAAU,EAClFW,EAA6BC,GAAgB,CAACH,EAAWH,EAAQ,UAAU,CAAC,EAElF,OAAAA,EAAQ,WAAa,KAAKK,EAAgB,SAAS,KAAK,IAGxD,MAAM,KAAK,qBAAqBL,EAAQ,WAAY,CAClD,aAAAR,EACA,WAAAC,EACA,UAAW,MAAiBc,GAAmBb,CAAU,CAC3D,CAAC,EAEMM,CACT,GAGM,qBAAqBQ,EAAgBC,EAA+D,QAAAlB,EAAA,sBACxG,GAAM,CAAE,aAAAC,EAAc,WAAAC,EAAY,UAAAiB,CAAU,EAAID,EAEhD,GAAI,CAAC,OAAO,UAAUhB,CAAU,GAAKA,EAAa,EAChD,MAAM,IAAIE,EAAsBF,EAAY,qCAAqC,EAGnF,IAAMG,EAAqBC,EAAK,MAAM,kBAAkBL,CAAY,EAC9DmB,EAAcH,EAAO,QAAQ,KAAM,EAAE,EAAE,UAAU,EAAGxB,EAAgB,EAE1E,MAAiB4B,GAAkB,GAAGhB,KAAWH,IAAc,KAAKkB,IAAeD,CAAS,CAC9F,GAOA,qBAAqBG,EAAeC,EAA4B,CAE9D,GAAI,CAACD,EAAM,WAAW,IAAI,GAAK,CAAC,sBAAsB,KAAKA,CAAK,EAC9D,MAAM,IAAIE,EAAiB,4BAA4B,EAIzD,GAAID,GAAiB,GAAK,CAAC,OAAO,UAAUA,CAAa,EACvD,MAAM,IAAIC,EAAiB,wBAAwB,EAKrD,IAAMC,EAFWH,EAAM,QAAQ,KAAM,EAAE,EAAE,UAAU7B,EAAgB,EAE1C,UAAU,EAAG8B,EAAgB7B,EAAiB,EACjEgC,EAAiB,QAAM,SAAS,KAAOD,CAAO,EAC9CE,EAAmB,KAAK,WAAWJ,EAAeG,CAAO,EAC5D,IAAIE,GAAe,QAAM,QAAQA,CAAI,CAAC,EAEnCC,EAASP,EAAM,UAAUC,EAAgB7B,EAAiB,EAC1DoC,EAAgB,QAAM,SAAS,KAAOD,CAAM,EAC5CE,EAAgB,KAAK,WAAWR,EAAeO,CAAM,EAAE,IAAIF,GAC/D,OAAO,KAAY,QAAM,QAAQA,CAAI,EAAE,QAAQ,KAAM,EAAE,EAAG,KAAK,EAAE,SAC/D,QACF,CACF,EAEA,MAAO,CAAE,iBAAAD,EAAkB,cAAAI,CAAc,CAC3C,CAOA,OAAOC,EAAqC,CAC1C,KAAK,KAAK,OAAOA,CAAI,EACrB,KAAK,SAAS,CAChB,CAKA,UAAgB,IACd,gBAAa,IAAI,CACnB,CAKA,QAAiB,CACf,OAAO,KAAK,UAAU,CACpB,KAAM,KAAK,MAAQ,KACnB,QAAS,KAAK,SAAW,IAC3B,EAAG,KAAM,CAAC,CACZ,CAEQ,WAAWC,EAAeC,EAAiB,CACjD,IAAMC,EAAa,KAAK,MAAMD,EAAI,OAASD,CAAK,EAC1CG,EAAW,CAAC,EAClB,QAASC,EAAI,EAAGA,EAAIJ,EAAOI,IAAK,CAC9B,IAAMC,EAAQD,EAAIF,EACZI,EAAMD,EAAQH,EACpBC,EAAS,KAAKF,EAAI,MAAMI,EAAOC,CAAG,CAAC,CACrC,CACA,OAAOH,CACT,CAKA,OAAa,SAASI,EAA+C,QAAAxC,EAAA,sBACnE,IAAMyC,EAAO,OAAOD,GAAY,SAAW,KAAK,MAAMA,CAAO,EAAIA,EAC3DE,EAAW,IAAI/C,GACrB,GAAI,CACF+C,EAAS,KAAK,OAAOD,EAAK,IAAI,EAC9BC,EAAS,QAAQ,OAAOD,EAAK,OAAO,EACpCC,EAAS,SAAS,EAElB,MAAMA,EAAS,qBAAqBA,EAAS,QAAQ,WAAY,CAC/D,aAAcA,EAAS,KAAK,aAC5B,WAAYA,EAAS,KAAK,WAC1B,UAAWA,EAAS,KAAK,SAC3B,CAAC,CACH,OAASnC,EAAP,CACAmC,EAAS,MAAQnC,CACnB,CACA,OAAOmC,CACT,GACF,EAzKaC,EAANhD,GAGEiD,EAAA,IAFN,cAAW,KACX,kBAAe,GAFLD,EAGJ,oBAIAC,EAAA,IAFN,cAAW,KACX,kBAAe,GANLD,EAOJ,uBAGAC,EAAA,IADN,cAAW,GATDD,EAUJ,qBGnDT,IAAAE,GAAmB,yuFAGnB,IAAAC,EAAyD,2BAQlD,IAAMC,GAAN,KAAgB,CAKrB,YAAYC,EAA0B,CAAC,EAAG,CACxC,KAAK,OAAS,CAAC,GAAGA,CAAM,CAC1B,CAMA,IAAIC,EAAoC,CACtC,KAAK,OAAO,KAAKA,CAAa,CAChC,CAEA,MAAwB,CACtB,OAAO,KAAK,MACd,CAMA,UAAgB,IACd,gBAAa,IAAI,CACnB,CAMA,QAAiB,CACf,OAAO,KAAK,UAAU,CACpB,QAAS,IAAIC,GAAI,UACjB,UAAW,IAAI,KAAK,EAAE,YAAY,EAClC,OAAQ,KAAK,OAAO,OAAS,EAAI,KAAK,OAAS,IACjD,EAAG,KAAM,CAAC,CACZ,CAQA,OAAa,SAASC,EAA2C,QAAAC,EAAA,sBAC/D,IAAMC,EAAO,OAAOF,GAAY,SAAW,KAAK,MAAMA,CAAO,EAAIA,EAC3DG,EAAa,GAAAC,QAAO,MAAMF,EAAK,OAAO,EACtCG,EAAiB,GAAAD,QAAO,MAAML,GAAI,OAAO,EAE/C,GAAI,CAACI,GAAc,CAACE,EAClB,MAAM,IAAIC,EAAiB,0EAA0E,EAGvG,GAAI,CAACH,GAAeE,EAAe,QAAUF,EAAW,OAAWE,EAAe,QAAUF,EAAW,MACrG,MAAM,IAAIG,EAAiB,mFAAmFP,GAAI,mCAAmC,EAGvJ,IAAMQ,EAAW,IAAIX,GAGrB,GAFAW,EAAS,OAAS,CAAC,EAEf,MAAM,QAAQL,EAAK,MAAM,EAE3B,QAAWM,KAAQN,EAAK,OACtBK,EAAS,OAAO,KAAK,MAAME,EAAc,SAASD,CAAI,CAAC,OAIzDD,EAAS,OAAO,KAAK,MAAME,EAAc,SAASP,CAAI,CAAC,EAEzD,OAAOK,CACT,GACF,EA1EaG,EAANd,GAGGe,EAAA,IAFP,cAAW,KACX,kBAAe,CAAE,KAAM,EAAK,CAAC,GAFnBD,EAGH",
   "names": ["require_jsencrypt_bundle", "__commonJSMin", "f", "g", "r", "e", "n", "t", "o", "i", "c", "u", "a", "p", "require", "module", "exports", "JSEncrypt", "root", "factory", "moduleId", "cachedModule", "definition", "key", "obj", "prop", "main_exports", "__export", "Encryption", "EthereumKeyStore_default", "KeyShares", "KeySharesItem", "SSVKeys", "SSVKeysException", "Threshold_default", "__toCommonJS", "index", "e", "BLS_default", "SSVKeysException", "message", "KeyStoreDataFormatError", "SSVKeysException", "data", "message", "KeyStoreInvalidError", "KeyStorePasswordError", "EthereumWalletError", "PrivateKeyFormatError", "OwnerAddressFormatError", "OwnerNonceFormatError", "import_eth2_keystore_js", "import_moment", "import_fs", "readFile", "filePath", "json", "__async", "fsp", "data", "KeystorePasswordValidator", "password", "keystoreFilePath", "__async", "errorMessage", "output", "data", "readFile", "EthereumKeyStore", "e", "keystorePasswordValidator", "OperatorIdsValidator", "amount", "isOperatorsLengthValid", "length", "operatorIdsValidator", "import_js_base64", "index", "e", "JSEncrypt_default", "DuplicatedOperatorIdError", "SSVKeysException", "operator", "message", "DuplicatedOperatorPublicKeyError", "OperatorsCountsMismatchError", "propertyListOne", "propertyListTwo", "OperatorPublicKeyError", "operatorPublicKeyValidator", "publicKey", "begin", "end", "encrypt", "JSEncrypt_default", "decodedOperator", "decodedPublicKey", "error", "content", "OperatorPublicKeyError", "ThresholdInvalidOperatorsLengthError", "SSVKeysException", "operators", "message", "ThresholdInvalidOperatorIdError", "operator", "Threshold", "privateKeyString", "operatorIds", "__async", "PrivateKeyFormatError", "operatorId", "isOperatorsLengthValid", "msk", "mpk", "BLS_default", "F", "i", "sk", "pk", "id", "shareSecretKey", "sharePublicKey", "Threshold_default", "import_crypto", "import_scrypt_js", "import_ethereumjs_wallet", "import_ethereumjs_util", "EthereumKeyStore", "keyStoreData", "KeyStoreDataFormatError", "KeyStoreInvalidError", "_a", "password", "__async", "Wallet", "KeyStorePasswordError", "input", "json", "EthereumWalletError", "derivedKey", "kdfParams", "crypto", "ciphertext", "checksumBuffer", "hashFunction", "decipher", "seed", "cipher", "data", "byteArray", "byte", "EthereumKeyStore_default", "Encryption", "operatorPublicKeys", "shares", "encryptedShares", "idx", "operatorPublicKey", "operatorPublicKeyValidator", "jsEncrypt", "JSEncrypt_default", "encryptedPrivateKey", "OperatorPublicKeyError", "encryptedShare", "import_class_validator", "import_class_validator", "OpeatorsListValidatorConstraint", "operatorsList", "operatorIds", "operatorPublicKeys", "operator", "DuplicatedOperatorIdError", "DuplicatedOperatorPublicKeyError", "__decorateClass", "OpeatorsListValidator", "validationOptions", "object", "propertyName", "import_class_validator", "BLSDeserializeError", "SSVKeysException", "publicKey", "message", "SingleSharesSignatureInvalid", "data", "PublicKeyValidatorConstraint", "value", "__async", "BLS_default", "item", "BLSDeserializeError", "__decorateClass", "PublicKeyValidator", "validationOptions", "object", "propertyName", "import_class_validator", "import_web3", "ethers", "ethUtil", "web3", "Web3", "hexArrayToBytes", "hexArr", "uint8Array", "item", "buildSignature", "dataToSign", "privateKeyHex", "__async", "BLS_default", "privateKey", "messageHash", "validateSignature", "signedData", "signatureHex", "publicKey", "blsPublicKey", "signature", "SingleSharesSignatureInvalid", "privateToPublicKey", "OwnerAddressValidatorConstraint", "value", "web3", "OwnerAddressFormatError", "__decorateClass", "OwnerAddressValidator", "validationOptions", "object", "propertyName", "import_class_validator", "OwnerNonceValidatorConstraint", "value", "OwnerNonceFormatError", "__decorateClass", "OwnerNonceValidator", "validationOptions", "object", "propertyName", "import_class_validator", "MatchLengthValidatorConstraint", "value", "args", "relatedPropertyName", "customError", "relatedLength", "arr", "OperatorsCountsMismatchError", "__decorateClass", "import_class_validator", "OpeatorPublicKeyValidatorConstraint", "value", "operatorPublicKeyValidator", "__decorateClass", "OpeatorPublicKeyValidator", "validationOptions", "object", "propertyName", "OperatorData", "data", "__decorateClass", "OpeatorPublicKeyValidator", "operatorSortedList", "operators", "ids", "op", "operatorKeys", "validatedOperators", "operator", "id", "OperatorsCountsMismatchError", "__spreadProps", "__spreadValues", "a", "b", "OperatorData", "SSVKeys", "data", "password", "__async", "privateKey", "EthereumKeyStore_default", "BLS_default", "operators", "sortedOperators", "operatorSortedList", "Threshold_default", "item", "shares", "decodedOperatorPublicKeys", "Encryption", "threshold", "ethers", "import_class_validator", "import_class_validator", "KeySharesData", "data", "operatorSortedList", "__async", "_a", "operator", "__decorateClass", "OwnerNonceValidator", "OwnerAddressValidator", "PublicKeyValidator", "OpeatorsListValidator", "import_class_validator", "KeySharesPayload", "publicKeys", "privateKeys", "encryptedShares", "item", "hexArrayToBytes", "data", "share", "__decorateClass", "PublicKeyValidator", "SIGNATURE_LENGHT", "PUBLIC_KEY_LENGHT", "_KeySharesItem", "KeySharesData", "KeySharesPayload", "metaData", "toSignatureData", "__async", "ownerAddress", "ownerNonce", "privateKey", "OwnerNonceFormatError", "address", "web3", "e", "OwnerAddressFormatError", "payload", "operatorSortedList", "operator", "signature", "buildSignature", "signSharesBytes", "hexArrayToBytes", "privateToPublicKey", "shares", "fromSignatureData", "publicKey", "signaturePt", "validateSignature", "bytes", "operatorCount", "SSVKeysException", "pkSplit", "pkArray", "sharesPublicKeys", "item", "eSplit", "eArray", "encryptedKeys", "data", "parts", "arr", "partLength", "partsArr", "i", "start", "end", "content", "body", "instance", "KeySharesItem", "__decorateClass", "import_semver", "import_class_validator", "_KeyShares", "shares", "keySharesItem", "package_default", "content", "__async", "body", "extVersion", "semver", "currentVersion", "SSVKeysException", "instance", "item", "KeySharesItem", "KeyShares", "__decorateClass"]
 }
diff --git a/dist/tsc/package.json b/dist/tsc/package.json
index 9b5d1bfc..289e13ec 100644
--- a/dist/tsc/package.json
+++ b/dist/tsc/package.json
@@ -1,6 +1,6 @@
 {
     "name": "ssv-keys",
-    "version": "1.0.9",
+    "version": "1.0.10",
     "description": "Tool for splitting a validator key into a predefined threshold of shares via Shamir-Secret-Sharing (SSS), and encrypt them with a set of operator keys.",
     "author": "SSV.Network",
     "repository": "https://github.com/bloxapp/ssv-keys",
diff --git a/dist/tsc/src/commands/actions/KeySharesAction.d.ts b/dist/tsc/src/commands/actions/KeySharesAction.d.ts
index 7cd7391a..b4ad5d4a 100644
--- a/dist/tsc/src/commands/actions/KeySharesAction.d.ts
+++ b/dist/tsc/src/commands/actions/KeySharesAction.d.ts
@@ -5,13 +5,9 @@ import { BaseAction } from './BaseAction';
 export declare class KeySharesAction extends BaseAction {
     static get options(): any;
     execute(): Promise<string>;
-    private getKeySharesList;
     private validateKeystoreArguments;
-    private isDirectory;
     private processKeystorePath;
-    private processKeystore;
     private validateKeystoreFiles;
-    private validateSingleKeystore;
     private getOperators;
     private processFile;
     private saveKeyShares;
diff --git a/dist/tsc/src/commands/actions/KeySharesAction.js b/dist/tsc/src/commands/actions/KeySharesAction.js
index 57c34ae0..8dcc7a6d 100644
--- a/dist/tsc/src/commands/actions/KeySharesAction.js
+++ b/dist/tsc/src/commands/actions/KeySharesAction.js
@@ -2,7 +2,6 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.KeySharesAction = void 0;
 const tslib_1 = require("tslib");
-const fs_1 = tslib_1.__importDefault(require("fs"));
 const BaseAction_1 = require("./BaseAction");
 const SSVKeys_1 = require("../../lib/SSVKeys");
 const KeySharesItem_1 = require("../../lib/KeyShares/KeySharesItem");
@@ -22,7 +21,6 @@ class KeySharesAction extends BaseAction_1.BaseAction {
             description: 'Generate shares for a list of operators from a validator keystore file',
             arguments: [
                 arguments_1.keystoreArgument,
-                arguments_1.keystorePathArgument,
                 arguments_1.keystorePasswordArgument,
                 arguments_1.operatorIdsArgument,
                 arguments_1.operatorPublicKeysArgument,
@@ -35,60 +33,26 @@ class KeySharesAction extends BaseAction_1.BaseAction {
     execute() {
         return tslib_1.__awaiter(this, void 0, void 0, function* () {
             this.validateKeystoreArguments(); // Validate keystore arguments
-            const keySharesList = yield this.getKeySharesList();
+            const keySharesList = yield this.processKeystorePath();
             const keySharesFilePath = yield this.saveKeyShares(keySharesList, this.args.output_folder);
             return keySharesFilePath;
         });
     }
-    getKeySharesList() {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            if (this.args.keystore) {
-                return [yield this.processKeystore()];
-            }
-            else if (this.args.keystore_path) {
-                return yield this.processKeystorePath();
-            }
-            throw new base_1.SSVKeysException('Either --keystore or --keystore-path must be provided.');
-        });
-    }
     validateKeystoreArguments() {
         const hasKeystore = !!this.args.keystore;
-        const hasKeystorePath = !!this.args.keystore_path;
-        if (hasKeystore && hasKeystorePath) {
-            throw new base_1.SSVKeysException('Only one of --keystore or --keystore-path should be provided.');
-        }
-        if (hasKeystorePath && !this.isDirectory(this.args.keystore_path)) {
-            throw new base_1.SSVKeysException('--keystore-path must be a directory.');
-        }
-    }
-    isDirectory(path) {
-        try {
-            const stats = fs_1.default.statSync(path);
-            return stats.isDirectory();
-        }
-        catch (error) {
-            // Handle errors (like path does not exist)
-            console.error(`Error checking if path is a directory: ${error.message}`);
-            return false;
+        if (!hasKeystore) {
+            throw new base_1.SSVKeysException('Please provide a path to the validator keystore file or to the folder containing multiple validator keystore files.');
         }
     }
     processKeystorePath() {
         return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            const keystorePath = (0, validators_1.sanitizePath)(String(this.args.keystore_path).trim());
+            const keystorePath = (0, validators_1.sanitizePath)(String(this.args.keystore).trim());
             const { files } = yield (0, file_helper_1.getKeyStoreFiles)(keystorePath);
             const validatedFiles = yield this.validateKeystoreFiles(files);
             const singleKeySharesList = yield Promise.all(validatedFiles.map((file, index) => this.processFile(file, this.args.password, this.getOperators(), this.args.owner_address, this.args.owner_nonce + index)));
             return singleKeySharesList;
         });
     }
-    processKeystore() {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            const keystore = this.args.keystore;
-            yield this.validateSingleKeystore(keystore);
-            const singleKeyShares = yield this.processFile(keystore, this.args.password, this.getOperators(), this.args.owner_address, this.args.owner_nonce);
-            return singleKeyShares;
-        });
-    }
     validateKeystoreFiles(files) {
         return tslib_1.__awaiter(this, void 0, void 0, function* () {
             const validatedFiles = [];
@@ -108,14 +72,6 @@ class KeySharesAction extends BaseAction_1.BaseAction {
             return validatedFiles;
         });
     }
-    validateSingleKeystore(keystore) {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            const isKeyStoreValid = yield arguments_1.keystoreArgument.interactive.options.validate(keystore);
-            if (isKeyStoreValid !== true) {
-                throw new base_1.SSVKeysException(String(isKeyStoreValid));
-            }
-        });
-    }
     getOperators() {
         const operatorIds = this.args.operator_ids.split(',');
         const operatorKeys = this.args.operator_keys.split(',');
diff --git a/dist/tsc/src/commands/actions/KeySharesAction.js.map b/dist/tsc/src/commands/actions/KeySharesAction.js.map
index 3f160df8..4206e2ee 100644
--- a/dist/tsc/src/commands/actions/KeySharesAction.js.map
+++ b/dist/tsc/src/commands/actions/KeySharesAction.js.map
@@ -1 +1 @@
-{"version":3,"file":"KeySharesAction.js","sourceRoot":"","sources":["../../../../../src/commands/actions/KeySharesAction.ts"],"names":[],"mappings":";;;;AAAA,oDAAoB;AAEpB,6CAA0C;AAC1C,+CAA4C;AAC5C,qEAAkE;AAClE,6DAA0D;AAC1D,oDAA6D;AAE7D,6CAAuE;AAEvE,2CASqB;AAErB,+DAAmG;AACnG,4DAA6E;AAO7E;;GAEG;AACH,MAAa,eAAgB,SAAQ,uBAAU;IAC7C,MAAM,KAAc,OAAO;QACzB,OAAO;YACL,MAAM,EAAE,QAAQ;YAChB,WAAW,EAAE,wEAAwE;YACrF,SAAS,EAAE;gBACT,4BAAgB;gBAChB,gCAAoB;gBACpB,oCAAwB;gBACxB,+BAAmB;gBACnB,sCAA0B;gBAC1B,gCAAoB;gBACpB,gCAAoB;gBACpB,8BAAkB;aACnB;SACF,CAAA;IACH,CAAC;IAEc,OAAO;;YACpB,IAAI,CAAC,yBAAyB,EAAE,CAAC,CAAC,8BAA8B;YAEhE,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACpD,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAC3F,OAAO,iBAAiB,CAAC;QAC3B,CAAC;KAAA;IAEa,gBAAgB;;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;gBACtB,OAAO,CAAC,MAAM,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;aACvC;iBAAM,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;gBAClC,OAAO,MAAM,IAAI,CAAC,mBAAmB,EAAE,CAAC;aACzC;YAED,MAAM,IAAI,uBAAgB,CAAC,wDAAwD,CAAC,CAAC;QACvF,CAAC;KAAA;IAEO,yBAAyB;QAC/B,MAAM,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;QACzC,MAAM,eAAe,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC;QAElD,IAAI,WAAW,IAAI,eAAe,EAAE;YAClC,MAAM,IAAI,uBAAgB,CAAC,+DAA+D,CAAC,CAAC;SAC7F;QAED,IAAI,eAAe,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE;YACjE,MAAM,IAAI,uBAAgB,CAAC,sCAAsC,CAAC,CAAC;SACpE;IACH,CAAC;IAEO,WAAW,CAAC,IAAY;QAC9B,IAAI;YACF,MAAM,KAAK,GAAG,YAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC,WAAW,EAAE,CAAC;SAC5B;QAAC,OAAO,KAAU,EAAE;YACnB,2CAA2C;YAC3C,OAAO,CAAC,KAAK,CAAC,0CAA0C,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACzE,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IAEa,mBAAmB;;YAC/B,MAAM,YAAY,GAAG,IAAA,yBAAY,EAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC1E,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,IAAA,8BAAgB,EAAC,YAAY,CAAC,CAAC;YACvD,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAE/D,MAAM,mBAAmB,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC/E,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,CACxH,CAAC,CAAC;YAEH,OAAO,mBAAmB,CAAC;QAC7B,CAAC;KAAA;IAEa,eAAe;;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;YACpC,MAAM,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClJ,OAAO,eAAe,CAAC;QACzB,CAAC;KAAA;IAEa,qBAAqB,CAAC,KAAe;;YACjD,MAAM,cAAc,GAAG,EAAE,CAAC;YAC1B,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;gBACxB,MAAM,eAAe,GAAG,MAAM,4BAAgB,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAClF,MAAM,eAAe,GAAG,MAAM,sCAAyB,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACnG,IAAI,eAAe,KAAK,IAAI,IAAI,eAAe,KAAK,IAAI,EAAE;oBACxD,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAC3B;qBAAM;oBACL,gBAAgB,EAAE,CAAC;iBACpB;gBACD,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,cAAc,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,2CAA2C,gBAAgB,oBAAoB,CAAC,CAAC;aACjJ;YACD,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3B,OAAO,cAAc,CAAC;QACxB,CAAC;KAAA;IAEa,sBAAsB,CAAC,QAAgB;;YACnD,MAAM,eAAe,GAAG,MAAM,4BAAgB,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACtF,IAAI,eAAe,KAAK,IAAI,EAAE;gBAC5B,MAAM,IAAI,uBAAgB,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC;aACrD;QACH,CAAC;KAAA;IAEO,YAAY;QAClB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAExD,IAAI,WAAW,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE;YAC9C,MAAM,IAAI,uCAA4B,CAAC,WAAW,EAAE,YAAY,EAAE,oDAAoD,CAAC,CAAC;SACzH;QAED,IAAI,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;YACzD,MAAM,IAAI,uBAAgB,CAAC,oDAAoD,CAAC,CAAC;SAClF;QAED,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE;YACzD,MAAM,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAClC,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE;gBACb,MAAM,IAAI,uBAAgB,CAAC,mCAAmC,KAAK,KAAK,QAAQ,EAAE,CAAC,CAAC;aACrF;YAED,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YACxC,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC;IAEa,WAAW,CAAC,gBAAwB,EAAE,QAAgB,EAAE,SAAqB,EAAE,YAAoB,EAAE,UAAkB;;YACnI,MAAM,YAAY,GAAG,MAAM,IAAA,sBAAQ,EAAC,gBAAgB,CAAC,CAAC;YAEtD,MAAM,OAAO,GAAG,IAAI,iBAAO,EAAE,CAAC;YAC9B,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YACpF,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAEzE,MAAM,aAAa,GAAG,IAAI,6BAAa,EAAE,CAAC;YAC1C,MAAM,aAAa,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;YAC/E,MAAM,aAAa,CAAC,YAAY,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,EAAE,EAAE,EAAE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAC;YAEtH,OAAO,aAAa,CAAC;QACvB,CAAC;KAAA;IAEa,aAAa,CAAC,cAA+B,EAAE,YAAoB;;YAC/E,MAAM,SAAS,GAAG,IAAI,qBAAS,EAAE,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;YAEtE,MAAM,iBAAiB,GAAG,MAAM,IAAA,yBAAW,EAAC,WAAW,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;YAC9E,MAAM,IAAA,uBAAS,EAAC,iBAAiB,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;YAEvD,OAAO,iBAAiB,CAAC;QAC3B,CAAC;KAAA;CACF;AArJD,0CAqJC"}
\ No newline at end of file
+{"version":3,"file":"KeySharesAction.js","sourceRoot":"","sources":["../../../../../src/commands/actions/KeySharesAction.ts"],"names":[],"mappings":";;;;AAAA,6CAA0C;AAC1C,+CAA4C;AAC5C,qEAAkE;AAClE,6DAA0D;AAC1D,oDAA6D;AAE7D,6CAAuE;AAEvE,2CAQqB;AAErB,+DAAmG;AACnG,4DAA6E;AAO7E;;GAEG;AACH,MAAa,eAAgB,SAAQ,uBAAU;IAC7C,MAAM,KAAc,OAAO;QACzB,OAAO;YACL,MAAM,EAAE,QAAQ;YAChB,WAAW,EAAE,wEAAwE;YACrF,SAAS,EAAE;gBACT,4BAAgB;gBAChB,oCAAwB;gBACxB,+BAAmB;gBACnB,sCAA0B;gBAC1B,gCAAoB;gBACpB,gCAAoB;gBACpB,8BAAkB;aACnB;SACF,CAAA;IACH,CAAC;IAEc,OAAO;;YACpB,IAAI,CAAC,yBAAyB,EAAE,CAAC,CAAC,8BAA8B;YAEhE,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,mBAAmB,EAAE,CAAC;YACvD,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAC3F,OAAO,iBAAiB,CAAC;QAC3B,CAAC;KAAA;IAEO,yBAAyB;QAC/B,MAAM,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;QACzC,IAAI,CAAC,WAAW,EAAE;YAChB,MAAM,IAAI,uBAAgB,CAAC,qHAAqH,CAAC,CAAC;SACnJ;IACH,CAAC;IAEa,mBAAmB;;YAC/B,MAAM,YAAY,GAAG,IAAA,yBAAY,EAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACrE,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,IAAA,8BAAgB,EAAC,YAAY,CAAC,CAAC;YACvD,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAE/D,MAAM,mBAAmB,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC/E,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,CACxH,CAAC,CAAC;YAEH,OAAO,mBAAmB,CAAC;QAC7B,CAAC;KAAA;IAEa,qBAAqB,CAAC,KAAe;;YACjD,MAAM,cAAc,GAAG,EAAE,CAAC;YAC1B,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;gBACxB,MAAM,eAAe,GAAG,MAAM,4BAAgB,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAClF,MAAM,eAAe,GAAG,MAAM,sCAAyB,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACnG,IAAI,eAAe,KAAK,IAAI,IAAI,eAAe,KAAK,IAAI,EAAE;oBACxD,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAC3B;qBAAM;oBACL,gBAAgB,EAAE,CAAC;iBACpB;gBACD,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,cAAc,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,2CAA2C,gBAAgB,oBAAoB,CAAC,CAAC;aACjJ;YACD,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3B,OAAO,cAAc,CAAC;QACxB,CAAC;KAAA;IAEO,YAAY;QAClB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAExD,IAAI,WAAW,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE;YAC9C,MAAM,IAAI,uCAA4B,CAAC,WAAW,EAAE,YAAY,EAAE,oDAAoD,CAAC,CAAC;SACzH;QAED,IAAI,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;YACzD,MAAM,IAAI,uBAAgB,CAAC,oDAAoD,CAAC,CAAC;SAClF;QAED,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE;YACzD,MAAM,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAClC,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE;gBACb,MAAM,IAAI,uBAAgB,CAAC,mCAAmC,KAAK,KAAK,QAAQ,EAAE,CAAC,CAAC;aACrF;YAED,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YACxC,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC;IAEa,WAAW,CAAC,gBAAwB,EAAE,QAAgB,EAAE,SAAqB,EAAE,YAAoB,EAAE,UAAkB;;YACnI,MAAM,YAAY,GAAG,MAAM,IAAA,sBAAQ,EAAC,gBAAgB,CAAC,CAAC;YAEtD,MAAM,OAAO,GAAG,IAAI,iBAAO,EAAE,CAAC;YAC9B,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YACpF,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAEzE,MAAM,aAAa,GAAG,IAAI,6BAAa,EAAE,CAAC;YAC1C,MAAM,aAAa,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;YAC/E,MAAM,aAAa,CAAC,YAAY,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,EAAE,EAAE,EAAE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAC;YAEtH,OAAO,aAAa,CAAC;QACvB,CAAC;KAAA;IAEa,aAAa,CAAC,cAA+B,EAAE,YAAoB;;YAC/E,MAAM,SAAS,GAAG,IAAI,qBAAS,EAAE,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;YAEtE,MAAM,iBAAiB,GAAG,MAAM,IAAA,yBAAW,EAAC,WAAW,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;YAC9E,MAAM,IAAA,uBAAS,EAAC,iBAAiB,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;YAEvD,OAAO,iBAAiB,CAAC;QAC3B,CAAC;KAAA;CACF;AA3GD,0CA2GC"}
\ No newline at end of file
diff --git a/dist/tsc/src/commands/actions/arguments/index.d.ts b/dist/tsc/src/commands/actions/arguments/index.d.ts
index a0adb1a1..c7794103 100644
--- a/dist/tsc/src/commands/actions/arguments/index.d.ts
+++ b/dist/tsc/src/commands/actions/arguments/index.d.ts
@@ -1,5 +1,4 @@
 export { default as keystoreArgument } from './keystore';
-export { default as keystorePathArgument } from './keystore-path';
 export { default as ownerNonceArgument } from './owner-nonce';
 export { default as operatorIdsArgument } from './operator-ids';
 export { default as ownerAddressArgument } from './owner-address';
diff --git a/dist/tsc/src/commands/actions/arguments/index.js b/dist/tsc/src/commands/actions/arguments/index.js
index 21e1cbb2..9b72a044 100644
--- a/dist/tsc/src/commands/actions/arguments/index.js
+++ b/dist/tsc/src/commands/actions/arguments/index.js
@@ -3,11 +3,9 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.operatorPublicKeysArgument = exports.outputFolderArgument = exports.keystorePasswordArgument = exports.ownerAddressArgument = exports.operatorIdsArgument = exports.ownerNonceArgument = exports.keystorePathArgument = exports.keystoreArgument = void 0;
+exports.operatorPublicKeysArgument = exports.outputFolderArgument = exports.keystorePasswordArgument = exports.ownerAddressArgument = exports.operatorIdsArgument = exports.ownerNonceArgument = exports.keystoreArgument = void 0;
 var keystore_1 = require("./keystore");
 Object.defineProperty(exports, "keystoreArgument", { enumerable: true, get: function () { return __importDefault(keystore_1).default; } });
-var keystore_path_1 = require("./keystore-path");
-Object.defineProperty(exports, "keystorePathArgument", { enumerable: true, get: function () { return __importDefault(keystore_path_1).default; } });
 var owner_nonce_1 = require("./owner-nonce");
 Object.defineProperty(exports, "ownerNonceArgument", { enumerable: true, get: function () { return __importDefault(owner_nonce_1).default; } });
 var operator_ids_1 = require("./operator-ids");
diff --git a/dist/tsc/src/commands/actions/arguments/index.js.map b/dist/tsc/src/commands/actions/arguments/index.js.map
index 2942efd0..87197de1 100644
--- a/dist/tsc/src/commands/actions/arguments/index.js.map
+++ b/dist/tsc/src/commands/actions/arguments/index.js.map
@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../src/commands/actions/arguments/index.ts"],"names":[],"mappings":";;;;;;AAAA,uCAAyD;AAAhD,6HAAA,OAAO,OAAoB;AACpC,iDAAkE;AAAzD,sIAAA,OAAO,OAAwB;AACxC,6CAA8D;AAArD,kIAAA,OAAO,OAAsB;AACtC,+CAAgE;AAAvD,oIAAA,OAAO,OAAuB;AACvC,iDAAkE;AAAzD,sIAAA,OAAO,OAAwB;AACxC,uCAAiE;AAAxD,qIAAA,OAAO,OAA4B;AAC5C,iDAAkE;AAAzD,sIAAA,OAAO,OAAwB;AACxC,+DAA+E;AAAtE,mJAAA,OAAO,OAA8B"}
\ No newline at end of file
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../src/commands/actions/arguments/index.ts"],"names":[],"mappings":";;;;;;AAAA,uCAAyD;AAAhD,6HAAA,OAAO,OAAoB;AACpC,6CAA8D;AAArD,kIAAA,OAAO,OAAsB;AACtC,+CAAgE;AAAvD,oIAAA,OAAO,OAAuB;AACvC,iDAAkE;AAAzD,sIAAA,OAAO,OAAwB;AACxC,uCAAiE;AAAxD,qIAAA,OAAO,OAA4B;AAC5C,iDAAkE;AAAzD,sIAAA,OAAO,OAAwB;AACxC,+DAA+E;AAAtE,mJAAA,OAAO,OAA8B"}
\ No newline at end of file
diff --git a/dist/tsc/src/commands/actions/arguments/keystore-path.d.ts b/dist/tsc/src/commands/actions/arguments/keystore-path.d.ts
deleted file mode 100644
index 3676d7a8..00000000
--- a/dist/tsc/src/commands/actions/arguments/keystore-path.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/**
- * Keystore argument validates if keystore file exists and is valid keystore file.
- */
-declare const _default: {
-    arg1: string;
-    arg2: string;
-    options: {
-        required: boolean;
-        type: StringConstructor;
-        help: string;
-    };
-};
-export default _default;
diff --git a/dist/tsc/src/commands/actions/arguments/keystore-path.js b/dist/tsc/src/commands/actions/arguments/keystore-path.js
deleted file mode 100644
index 7980be98..00000000
--- a/dist/tsc/src/commands/actions/arguments/keystore-path.js
+++ /dev/null
@@ -1,15 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * Keystore argument validates if keystore file exists and is valid keystore file.
- */
-exports.default = {
-    arg1: '-kp',
-    arg2: '--keystore-path',
-    options: {
-        required: false,
-        type: String,
-        help: 'The path to the folder containing validator keystore files'
-    }
-};
-//# sourceMappingURL=keystore-path.js.map
\ No newline at end of file
diff --git a/dist/tsc/src/commands/actions/arguments/keystore-path.js.map b/dist/tsc/src/commands/actions/arguments/keystore-path.js.map
deleted file mode 100644
index b1c44639..00000000
--- a/dist/tsc/src/commands/actions/arguments/keystore-path.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"keystore-path.js","sourceRoot":"","sources":["../../../../../../src/commands/actions/arguments/keystore-path.ts"],"names":[],"mappings":";;AAAA;;GAEG;AACH,kBAAe;IACb,IAAI,EAAE,KAAK;IACX,IAAI,EAAE,iBAAiB;IACvB,OAAO,EAAE;QACP,QAAQ,EAAE,KAAK;QACf,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,4DAA4D;KACnE;CACF,CAAC"}
\ No newline at end of file
diff --git a/dist/tsc/src/commands/actions/arguments/keystore.js b/dist/tsc/src/commands/actions/arguments/keystore.js
index 9631f04a..5843a4c9 100644
--- a/dist/tsc/src/commands/actions/arguments/keystore.js
+++ b/dist/tsc/src/commands/actions/arguments/keystore.js
@@ -1,12 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 const validators_1 = require("../validators");
-const validateKeystoreFile = (filePath) => {
-    let validation = (0, validators_1.fileExistsValidator)(filePath);
-    if (validation !== true) {
-        return { isValid: false, error: validation };
-    }
-    validation = (0, validators_1.jsonFileValidator)(filePath);
+const validateKeystoreFile = (path) => {
+    const validation = (0, validators_1.fileExistsValidator)(path);
     if (validation !== true) {
         return { isValid: false, error: validation };
     }
@@ -21,12 +17,12 @@ exports.default = {
     options: {
         required: false,
         type: String,
-        help: 'The validator keystore file path. Only one keystore file can be specified using this argument'
+        help: 'Path to a validator keystore file or a directory of keystore files for bulk processing'
     },
     interactive: {
         options: {
             type: 'text',
-            message: 'Provide the keystore file path',
+            message: 'Enter the path to your keystore file or directory containing multiple keystore files',
             validate: (filePath) => {
                 const result = validateKeystoreFile(filePath);
                 return result.isValid || result.error;
diff --git a/dist/tsc/src/commands/actions/arguments/keystore.js.map b/dist/tsc/src/commands/actions/arguments/keystore.js.map
index bbb8759e..871bd972 100644
--- a/dist/tsc/src/commands/actions/arguments/keystore.js.map
+++ b/dist/tsc/src/commands/actions/arguments/keystore.js.map
@@ -1 +1 @@
-{"version":3,"file":"keystore.js","sourceRoot":"","sources":["../../../../../../src/commands/actions/arguments/keystore.ts"],"names":[],"mappings":";;AAAA,8CAAuE;AAEvE,MAAM,oBAAoB,GAAG,CAAC,QAAgB,EAAE,EAAE;IAChD,IAAI,UAAU,GAAG,IAAA,gCAAmB,EAAC,QAAQ,CAAC,CAAC;IAC/C,IAAI,UAAU,KAAK,IAAI,EAAE;QACvB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;KAC9C;IAED,UAAU,GAAG,IAAA,8BAAiB,EAAC,QAAQ,CAAC,CAAC;IACzC,IAAI,UAAU,KAAK,IAAI,EAAE;QACvB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;KAC9C;IAED,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC3B,CAAC,CAAC;AAEF;;GAEG;AACH,kBAAe;IACb,IAAI,EAAE,KAAK;IACX,IAAI,EAAE,YAAY;IAClB,OAAO,EAAE;QACP,QAAQ,EAAE,KAAK;QACf,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,+FAA+F;KACtG;IACD,WAAW,EAAE;QACX,OAAO,EAAE;YACP,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,gCAAgC;YACzC,QAAQ,EAAE,CAAC,QAAgB,EAAE,EAAE;gBAC7B,MAAM,MAAM,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAC;gBAC9C,OAAO,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC;YACxC,CAAC;SACF;KACF;CACF,CAAC"}
\ No newline at end of file
+{"version":3,"file":"keystore.js","sourceRoot":"","sources":["../../../../../../src/commands/actions/arguments/keystore.ts"],"names":[],"mappings":";;AAAA,8CAAoD;AAEpD,MAAM,oBAAoB,GAAG,CAAC,IAAY,EAAE,EAAE;IAC5C,MAAM,UAAU,GAAG,IAAA,gCAAmB,EAAC,IAAI,CAAC,CAAC;IAC7C,IAAI,UAAU,KAAK,IAAI,EAAE;QACvB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;KAC9C;IAED,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC3B,CAAC,CAAC;AAEF;;GAEG;AACH,kBAAe;IACb,IAAI,EAAE,KAAK;IACX,IAAI,EAAE,YAAY;IAClB,OAAO,EAAE;QACP,QAAQ,EAAE,KAAK;QACf,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,wFAAwF;KAC/F;IACD,WAAW,EAAE;QACX,OAAO,EAAE;YACP,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,sFAAsF;YAC/F,QAAQ,EAAE,CAAC,QAAgB,EAAE,EAAE;gBAC7B,MAAM,MAAM,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAC;gBAC9C,OAAO,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC;YACxC,CAAC;SACF;KACF;CACF,CAAC"}
\ No newline at end of file
diff --git a/dist/tsc/src/commands/actions/validators/file.js b/dist/tsc/src/commands/actions/validators/file.js
index 63db2aa9..7288652e 100644
--- a/dist/tsc/src/commands/actions/validators/file.js
+++ b/dist/tsc/src/commands/actions/validators/file.js
@@ -7,15 +7,12 @@ const path_1 = tslib_1.__importDefault(require("path"));
 const fileExistsValidator = (filePath, message = '') => {
     filePath = (0, exports.sanitizePath)(String(filePath).trim());
     try {
-        const stat = fs_1.default.statSync(filePath);
-        if (!stat.isFile()) {
-            return 'The specified keystore path is not a file.';
-        }
+        fs_1.default.statSync(filePath);
         return true;
     }
     catch (error) {
         // Handle the error when the file does not exist
-        return message || 'Couldn’t locate the keystore file.';
+        return message || error.message || 'Couldn’t locate the keystore file.';
     }
 };
 exports.fileExistsValidator = fileExistsValidator;
diff --git a/dist/tsc/src/commands/actions/validators/file.js.map b/dist/tsc/src/commands/actions/validators/file.js.map
index 5e47a43a..bb184f11 100644
--- a/dist/tsc/src/commands/actions/validators/file.js.map
+++ b/dist/tsc/src/commands/actions/validators/file.js.map
@@ -1 +1 @@
-{"version":3,"file":"file.js","sourceRoot":"","sources":["../../../../../../src/commands/actions/validators/file.ts"],"names":[],"mappings":";;;;AAAA,oDAAoB;AACpB,wDAAwB;AAEjB,MAAM,mBAAmB,GAAG,CAAC,QAAgB,EAAE,OAAO,GAAG,EAAE,EAAoB,EAAE;IACtF,QAAQ,GAAG,IAAA,oBAAY,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAEjD,IAAI;QACF,MAAM,IAAI,GAAG,YAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAEnC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE;YAClB,OAAO,4CAA4C,CAAC;SACrD;QAED,OAAO,IAAI,CAAC;KACb;IAAC,OAAO,KAAK,EAAE;QACd,gDAAgD;QAChD,OAAO,OAAO,IAAI,oCAAoC,CAAC;KACxD;AACH,CAAC,CAAC;AAfW,QAAA,mBAAmB,uBAe9B;AAEK,MAAM,iBAAiB,GAAG,CAAC,QAAgB,EAAE,OAAO,GAAG,EAAE,EAAoB,EAAE;IACpF,IAAI,YAAY,CAAC;IACjB,QAAQ,GAAG,IAAA,oBAAY,EAAC,QAAQ,CAAC,CAAC;IAElC,IAAI;QACF,YAAY,GAAG,YAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;KACjE;IAAC,OAAO,CAAC,EAAE;QACV,OAAO,OAAO,IAAI,yCAAyC,CAAC;KAC7D;IACD,IAAI;QACF,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;KAC1B;IAAC,OAAO,CAAC,EAAE;QACV,OAAO,kBAAkB,QAAQ,wBAAwB,CAAC;KAC3D;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAfW,QAAA,iBAAiB,qBAe5B;AAEF;;;;GAIG;AACI,MAAM,YAAY,GAAG,CAAC,SAAiB,EAAU,EAAE;IACxD,0CAA0C;IAC1C,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;IAE3D,uDAAuD;IACvD,IAAI,aAAa,GAAG,cAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;IAEjD,yFAAyF;IACzF,2FAA2F;IAC3F,sCAAsC;IACtC,aAAa,GAAG,aAAa,CAAC,OAAO,CAAC,uBAAuB,EAAE,EAAE,CAAC,CAAC;IAEnE,wGAAwG;IACxG,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO,EAAE;QAChC,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAClD,IAAI,KAAK,EAAE;YACT,4FAA4F;YAC5F,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;SACnF;KACF;IAED,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC;AAtBW,QAAA,YAAY,gBAsBvB"}
\ No newline at end of file
+{"version":3,"file":"file.js","sourceRoot":"","sources":["../../../../../../src/commands/actions/validators/file.ts"],"names":[],"mappings":";;;;AAAA,oDAAoB;AACpB,wDAAwB;AAEjB,MAAM,mBAAmB,GAAG,CAAC,QAAgB,EAAE,OAAO,GAAG,EAAE,EAAoB,EAAE;IACtF,QAAQ,GAAG,IAAA,oBAAY,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACjD,IAAI;QACF,YAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;KACb;IAAC,OAAO,KAAU,EAAE;QACnB,gDAAgD;QAChD,OAAO,OAAO,IAAI,KAAK,CAAC,OAAO,IAAI,oCAAoC,CAAC;KACzE;AACH,CAAC,CAAC;AATW,QAAA,mBAAmB,uBAS9B;AAEK,MAAM,iBAAiB,GAAG,CAAC,QAAgB,EAAE,OAAO,GAAG,EAAE,EAAoB,EAAE;IACpF,IAAI,YAAY,CAAC;IACjB,QAAQ,GAAG,IAAA,oBAAY,EAAC,QAAQ,CAAC,CAAC;IAElC,IAAI;QACF,YAAY,GAAG,YAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;KACjE;IAAC,OAAO,CAAC,EAAE;QACV,OAAO,OAAO,IAAI,yCAAyC,CAAC;KAC7D;IACD,IAAI;QACF,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;KAC1B;IAAC,OAAO,CAAC,EAAE;QACV,OAAO,kBAAkB,QAAQ,wBAAwB,CAAC;KAC3D;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAfW,QAAA,iBAAiB,qBAe5B;AAEF;;;;GAIG;AACI,MAAM,YAAY,GAAG,CAAC,SAAiB,EAAU,EAAE;IACxD,0CAA0C;IAC1C,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;IAE3D,uDAAuD;IACvD,IAAI,aAAa,GAAG,cAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;IAEjD,yFAAyF;IACzF,2FAA2F;IAC3F,sCAAsC;IACtC,aAAa,GAAG,aAAa,CAAC,OAAO,CAAC,uBAAuB,EAAE,EAAE,CAAC,CAAC;IAEnE,wGAAwG;IACxG,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO,EAAE;QAChC,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAClD,IAAI,KAAK,EAAE;YACT,4FAA4F;YAC5F,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;SACnF;KACF;IAED,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC;AAtBW,QAAA,YAAY,gBAsBvB"}
\ No newline at end of file
diff --git a/package.json b/package.json
index 5a480973..e0a0d279 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "ssv-keys",
-  "version": "1.0.9",
+  "version": "1.0.10",
   "description": "Tool for splitting a validator key into a predefined threshold of shares via Shamir-Secret-Sharing (SSS), and encrypt them with a set of operator keys.",
   "author": "SSV.Network",
   "repository": "https://github.com/bloxapp/ssv-keys",
diff --git a/src/commands/actions/KeySharesAction.ts b/src/commands/actions/KeySharesAction.ts
index db7bae7e..4f63d9c2 100644
--- a/src/commands/actions/KeySharesAction.ts
+++ b/src/commands/actions/KeySharesAction.ts
@@ -1,5 +1,3 @@
-import fs from 'fs';
-
 import { BaseAction } from './BaseAction';
 import { SSVKeys } from '../../lib/SSVKeys';
 import { KeySharesItem } from '../../lib/KeyShares/KeySharesItem';
@@ -10,7 +8,6 @@ import { sanitizePath, keystorePasswordValidator } from './validators';
 
 import {
   keystoreArgument,
-  keystorePathArgument,
   ownerNonceArgument,
   operatorIdsArgument,
   ownerAddressArgument,
@@ -37,7 +34,6 @@ export class KeySharesAction extends BaseAction {
       description: 'Generate shares for a list of operators from a validator keystore file',
       arguments: [
         keystoreArgument,
-        keystorePathArgument,
         keystorePasswordArgument,
         operatorIdsArgument,
         operatorPublicKeysArgument,
@@ -51,47 +47,20 @@ export class KeySharesAction extends BaseAction {
   override async execute(): Promise<string> {
     this.validateKeystoreArguments(); // Validate keystore arguments
 
-    const keySharesList = await this.getKeySharesList();
+    const keySharesList = await this.processKeystorePath();
     const keySharesFilePath = await this.saveKeyShares(keySharesList, this.args.output_folder);
     return keySharesFilePath;
   }
 
-  private async getKeySharesList(): Promise<KeySharesItem[]> {
-    if (this.args.keystore) {
-      return [await this.processKeystore()];
-    } else if (this.args.keystore_path) {
-      return await this.processKeystorePath();
-    }
-
-    throw new SSVKeysException('Either --keystore or --keystore-path must be provided.');
-  }
-
   private validateKeystoreArguments(): void {
     const hasKeystore = !!this.args.keystore;
-    const hasKeystorePath = !!this.args.keystore_path;
-
-    if (hasKeystore && hasKeystorePath) {
-      throw new SSVKeysException('Only one of --keystore or --keystore-path should be provided.');
-    }
-
-    if (hasKeystorePath && !this.isDirectory(this.args.keystore_path)) {
-      throw new SSVKeysException('--keystore-path must be a directory.');
-    }
-  }
-
-  private isDirectory(path: string): boolean {
-    try {
-      const stats = fs.statSync(path);
-      return stats.isDirectory();
-    } catch (error: any) {
-      // Handle errors (like path does not exist)
-      console.error(`Error checking if path is a directory: ${error.message}`);
-      return false;
+    if (!hasKeystore) {
+      throw new SSVKeysException('Please provide a path to the validator keystore file or to the folder containing multiple validator keystore files.');
     }
   }
 
   private async processKeystorePath(): Promise<KeySharesItem[]> {
-    const keystorePath = sanitizePath(String(this.args.keystore_path).trim());
+    const keystorePath = sanitizePath(String(this.args.keystore).trim());
     const { files } = await getKeyStoreFiles(keystorePath);
     const validatedFiles = await this.validateKeystoreFiles(files);
 
@@ -102,13 +71,6 @@ export class KeySharesAction extends BaseAction {
     return singleKeySharesList;
   }
 
-  private async processKeystore(): Promise<KeySharesItem> {
-    const keystore = this.args.keystore;
-    await this.validateSingleKeystore(keystore);
-    const singleKeyShares = await this.processFile(keystore, this.args.password, this.getOperators(), this.args.owner_address, this.args.owner_nonce);
-    return singleKeyShares;
-  }
-
   private async validateKeystoreFiles(files: string[]): Promise<string[]> {
     const validatedFiles = [];
     let failedValidation = 0;
@@ -126,13 +88,6 @@ export class KeySharesAction extends BaseAction {
     return validatedFiles;
   }
 
-  private async validateSingleKeystore(keystore: string): Promise<void> {
-    const isKeyStoreValid = await keystoreArgument.interactive.options.validate(keystore);
-    if (isKeyStoreValid !== true) {
-      throw new SSVKeysException(String(isKeyStoreValid));
-    }
-  }
-
   private getOperators(): Operator[] {
     const operatorIds = this.args.operator_ids.split(',');
     const operatorKeys = this.args.operator_keys.split(',');
diff --git a/src/commands/actions/arguments/index.ts b/src/commands/actions/arguments/index.ts
index a0adb1a1..c7794103 100644
--- a/src/commands/actions/arguments/index.ts
+++ b/src/commands/actions/arguments/index.ts
@@ -1,5 +1,4 @@
 export { default as keystoreArgument } from './keystore';
-export { default as keystorePathArgument } from './keystore-path';
 export { default as ownerNonceArgument } from './owner-nonce';
 export { default as operatorIdsArgument } from './operator-ids';
 export { default as ownerAddressArgument } from './owner-address';
diff --git a/src/commands/actions/arguments/keystore-path.ts b/src/commands/actions/arguments/keystore-path.ts
deleted file mode 100644
index 26ad2fa1..00000000
--- a/src/commands/actions/arguments/keystore-path.ts
+++ /dev/null
@@ -1,12 +0,0 @@
-/**
- * Keystore argument validates if keystore file exists and is valid keystore file.
- */
-export default {
-  arg1: '-kp',
-  arg2: '--keystore-path',
-  options: {
-    required: false,
-    type: String,
-    help: 'The path to the folder containing validator keystore files'
-  }
-};
diff --git a/src/commands/actions/arguments/keystore.ts b/src/commands/actions/arguments/keystore.ts
index e56488d4..dc74b493 100644
--- a/src/commands/actions/arguments/keystore.ts
+++ b/src/commands/actions/arguments/keystore.ts
@@ -1,12 +1,7 @@
-import { fileExistsValidator, jsonFileValidator } from '../validators';
+import { fileExistsValidator } from '../validators';
 
-const validateKeystoreFile = (filePath: string) => {
-  let validation = fileExistsValidator(filePath);
-  if (validation !== true) {
-    return { isValid: false, error: validation };
-  }
-
-  validation = jsonFileValidator(filePath);
+const validateKeystoreFile = (path: string) => {
+  const validation = fileExistsValidator(path);
   if (validation !== true) {
     return { isValid: false, error: validation };
   }
@@ -23,12 +18,12 @@ export default {
   options: {
     required: false,
     type: String,
-    help: 'The validator keystore file path. Only one keystore file can be specified using this argument'
+    help: 'Path to a validator keystore file or a directory of keystore files for bulk processing'
   },
   interactive: {
     options: {
       type: 'text',
-      message: 'Provide the keystore file path',
+      message: 'Enter the path to your keystore file or directory containing multiple keystore files',
       validate: (filePath: string) => {
         const result = validateKeystoreFile(filePath);
         return result.isValid || result.error;
diff --git a/src/commands/actions/validators/file.ts b/src/commands/actions/validators/file.ts
index 19c7882c..b53dd5ed 100644
--- a/src/commands/actions/validators/file.ts
+++ b/src/commands/actions/validators/file.ts
@@ -3,18 +3,12 @@ import path from 'path';
 
 export const fileExistsValidator = (filePath: string, message = ''): boolean | string => {
   filePath = sanitizePath(String(filePath).trim());
-
   try {
-    const stat = fs.statSync(filePath);
-
-    if (!stat.isFile()) {
-      return 'The specified keystore path is not a file.';
-    }
-
+    fs.statSync(filePath);
     return true;
-  } catch (error) {
+  } catch (error: any) {
     // Handle the error when the file does not exist
-    return message || 'Couldn’t locate the keystore file.';
+    return message || error.message || 'Couldn’t locate the keystore file.';
   }
 };