@intlayer/backend 7.1.4 → 7.1.5

package/dist/cjs/node_modules/node-forge/lib/pki.cjs

@@ -1,108 +0,0 @@
-const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
-const require_forge$1 = require('./forge.cjs');
-const require_util$1 = require('./util.cjs');
-const require_oids$1 = require('./oids.cjs');
-const require_asn1$1 = require('./asn1.cjs');
-const require_pem$1 = require('./pem.cjs');
-const require_pbkdf2$1 = require('./pbkdf2.cjs');
-const require_rsa$1 = require('./rsa.cjs');
-const require_pbe$1 = require('./pbe.cjs');
-const require_pss$1 = require('./pss.cjs');
-const require_x509$1 = require('./x509.cjs');
-const require_pkcs12$1 = require('./pkcs12.cjs');
-
-//#region ../../node_modules/node-forge/lib/pki.js
-var require_pki = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/pki.js": ((exports, module) => {
-	/**
-	* Javascript implementation of a basic Public Key Infrastructure, including
-	* support for RSA public and private keys.
-	*
-	* @author Dave Longley
-	*
-	* Copyright (c) 2010-2013 Digital Bazaar, Inc.
-	*/
-	var forge = require_forge$1.default;
-	require_asn1$1.default;
-	require_oids$1.default;
-	require_pbe$1.default;
-	require_pem$1.default;
-	require_pbkdf2$1.default;
-	require_pkcs12$1.default;
-	require_pss$1.default;
-	require_rsa$1.default;
-	require_util$1.default;
-	require_x509$1.default;
-	var asn1 = forge.asn1;
-	var pki = module.exports = forge.pki = forge.pki || {};
-	/**
-	* NOTE: THIS METHOD IS DEPRECATED. Use pem.decode() instead.
-	*
-	* Converts PEM-formatted data to DER.
-	*
-	* @param pem the PEM-formatted data.
-	*
-	* @return the DER-formatted data.
-	*/
-	pki.pemToDer = function(pem) {
-		var msg = forge.pem.decode(pem)[0];
-		if (msg.procType && msg.procType.type === "ENCRYPTED") throw new Error("Could not convert PEM to DER; PEM is encrypted.");
-		return forge.util.createBuffer(msg.body);
-	};
-	/**
-	* Converts an RSA private key from PEM format.
-	*
-	* @param pem the PEM-formatted private key.
-	*
-	* @return the private key.
-	*/
-	pki.privateKeyFromPem = function(pem) {
-		var msg = forge.pem.decode(pem)[0];
-		if (msg.type !== "PRIVATE KEY" && msg.type !== "RSA PRIVATE KEY") {
-			var error = /* @__PURE__ */ new Error("Could not convert private key from PEM; PEM header type is not \"PRIVATE KEY\" or \"RSA PRIVATE KEY\".");
-			error.headerType = msg.type;
-			throw error;
-		}
-		if (msg.procType && msg.procType.type === "ENCRYPTED") throw new Error("Could not convert private key from PEM; PEM is encrypted.");
-		var obj = asn1.fromDer(msg.body);
-		return pki.privateKeyFromAsn1(obj);
-	};
-	/**
-	* Converts an RSA private key to PEM format.
-	*
-	* @param key the private key.
-	* @param maxline the maximum characters per line, defaults to 64.
-	*
-	* @return the PEM-formatted private key.
-	*/
-	pki.privateKeyToPem = function(key, maxline) {
-		var msg = {
-			type: "RSA PRIVATE KEY",
-			body: asn1.toDer(pki.privateKeyToAsn1(key)).getBytes()
-		};
-		return forge.pem.encode(msg, { maxline });
-	};
-	/**
-	* Converts a PrivateKeyInfo to PEM format.
-	*
-	* @param pki the PrivateKeyInfo.
-	* @param maxline the maximum characters per line, defaults to 64.
-	*
-	* @return the PEM-formatted private key.
-	*/
-	pki.privateKeyInfoToPem = function(pki$1, maxline) {
-		var msg = {
-			type: "PRIVATE KEY",
-			body: asn1.toDer(pki$1).getBytes()
-		};
-		return forge.pem.encode(msg, { maxline });
-	};
-}) });
-
-//#endregion
-Object.defineProperty(exports, 'default', {
-  enumerable: true,
-  get: function () {
-    return require_pki();
-  }
-});
-//# sourceMappingURL=pki.cjs.map

package/dist/cjs/node_modules/node-forge/lib/pki.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"pki.cjs","names":["pki"],"sources":["../../../../../../../node_modules/node-forge/lib/pki.js"],"sourcesContent":["/**\n * Javascript implementation of a basic Public Key Infrastructure, including\n * support for RSA public and private keys.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2013 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./asn1');\nrequire('./oids');\nrequire('./pbe');\nrequire('./pem');\nrequire('./pbkdf2');\nrequire('./pkcs12');\nrequire('./pss');\nrequire('./rsa');\nrequire('./util');\nrequire('./x509');\n\n// shortcut for asn.1 API\nvar asn1 = forge.asn1;\n\n/* Public Key Infrastructure (PKI) implementation. */\nvar pki = module.exports = forge.pki = forge.pki || {};\n\n/**\n * NOTE: THIS METHOD IS DEPRECATED. Use pem.decode() instead.\n *\n * Converts PEM-formatted data to DER.\n *\n * @param pem the PEM-formatted data.\n *\n * @return the DER-formatted data.\n */\npki.pemToDer = function(pem) {\n  var msg = forge.pem.decode(pem)[0];\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert PEM to DER; PEM is encrypted.');\n  }\n  return forge.util.createBuffer(msg.body);\n};\n\n/**\n * Converts an RSA private key from PEM format.\n *\n * @param pem the PEM-formatted private key.\n *\n * @return the private key.\n */\npki.privateKeyFromPem = function(pem) {\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'PRIVATE KEY' && msg.type !== 'RSA PRIVATE KEY') {\n    var error = new Error('Could not convert private key from PEM; PEM ' +\n      'header type is not \"PRIVATE KEY\" or \"RSA PRIVATE KEY\".');\n    error.headerType = msg.type;\n    throw error;\n  }\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert private key from PEM; PEM is encrypted.');\n  }\n\n  // convert DER to ASN.1 object\n  var obj = asn1.fromDer(msg.body);\n\n  return pki.privateKeyFromAsn1(obj);\n};\n\n/**\n * Converts an RSA private key to PEM format.\n *\n * @param key the private key.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted private key.\n */\npki.privateKeyToPem = function(key, maxline) {\n  // convert to ASN.1, then DER, then PEM-encode\n  var msg = {\n    type: 'RSA PRIVATE KEY',\n    body: asn1.toDer(pki.privateKeyToAsn1(key)).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n\n/**\n * Converts a PrivateKeyInfo to PEM format.\n *\n * @param pki the PrivateKeyInfo.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted private key.\n */\npki.privateKeyInfoToPem = function(pki, maxline) {\n  // convert to DER, then PEM-encode\n  var msg = {\n    type: 'PRIVATE KEY',\n    body: asn1.toDer(pki).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;CAQA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CAGA,IAAI,OAAO,MAAM;CAGjB,IAAI,MAAM,OAAO,UAAU,MAAM,MAAM,MAAM,OAAO,EAAE;;;;;;;;;;AAWtD,KAAI,WAAW,SAAS,KAAK;EAC3B,IAAI,MAAM,MAAM,IAAI,OAAO,IAAI,CAAC;AAChC,MAAG,IAAI,YAAY,IAAI,SAAS,SAAS,YACvC,OAAM,IAAI,MAAM,kDAAkD;AAEpE,SAAO,MAAM,KAAK,aAAa,IAAI,KAAK;;;;;;;;;AAU1C,KAAI,oBAAoB,SAAS,KAAK;EACpC,IAAI,MAAM,MAAM,IAAI,OAAO,IAAI,CAAC;AAEhC,MAAG,IAAI,SAAS,iBAAiB,IAAI,SAAS,mBAAmB;GAC/D,IAAI,wBAAQ,IAAI,MAAM,yGACqC;AAC3D,SAAM,aAAa,IAAI;AACvB,SAAM;;AAER,MAAG,IAAI,YAAY,IAAI,SAAS,SAAS,YACvC,OAAM,IAAI,MAAM,4DAA4D;EAI9E,IAAI,MAAM,KAAK,QAAQ,IAAI,KAAK;AAEhC,SAAO,IAAI,mBAAmB,IAAI;;;;;;;;;;AAWpC,KAAI,kBAAkB,SAAS,KAAK,SAAS;EAE3C,IAAI,MAAM;GACR,MAAM;GACN,MAAM,KAAK,MAAM,IAAI,iBAAiB,IAAI,CAAC,CAAC,UAAU;GACvD;AACD,SAAO,MAAM,IAAI,OAAO,KAAK,EAAU,SAAQ,CAAC;;;;;;;;;;AAWlD,KAAI,sBAAsB,SAAS,OAAK,SAAS;EAE/C,IAAI,MAAM;GACR,MAAM;GACN,MAAM,KAAK,MAAMA,MAAI,CAAC,UAAU;GACjC;AACD,SAAO,MAAM,IAAI,OAAO,KAAK,EAAU,SAAQ,CAAC"}

package/dist/cjs/node_modules/node-forge/lib/prime.cjs

@@ -1,200 +0,0 @@
-const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
-const require_forge$1 = require('./forge.cjs');
-const require_util$1 = require('./util.cjs');
-const require_random$1 = require('./random.cjs');
-const require_jsbn$1 = require('./jsbn.cjs');
-
-//#region ../../node_modules/node-forge/lib/prime.js
-var require_prime = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/prime.js": ((exports, module) => {
-	/**
-	* Prime number generation API.
-	*
-	* @author Dave Longley
-	*
-	* Copyright (c) 2014 Digital Bazaar, Inc.
-	*/
-	var forge = require_forge$1.default;
-	require_util$1.default;
-	require_jsbn$1.default;
-	require_random$1.default;
-	(function() {
-		if (forge.prime) {
-			module.exports = forge.prime;
-			return;
-		}
-		var prime = module.exports = forge.prime = forge.prime || {};
-		var BigInteger = forge.jsbn.BigInteger;
-		var GCD_30_DELTA = [
-			6,
-			4,
-			2,
-			4,
-			2,
-			4,
-			6,
-			2
-		];
-		var THIRTY = new BigInteger(null);
-		THIRTY.fromInt(30);
-		var op_or = function(x, y) {
-			return x | y;
-		};
-		/**
-		* Generates a random probable prime with the given number of bits.
-		*
-		* Alternative algorithms can be specified by name as a string or as an
-		* object with custom options like so:
-		*
-		* {
-		*   name: 'PRIMEINC',
-		*   options: {
-		*     maxBlockTime: <the maximum amount of time to block the main
-		*       thread before allowing I/O other JS to run>,
-		*     millerRabinTests: <the number of miller-rabin tests to run>,
-		*     workerScript: <the worker script URL>,
-		*     workers: <the number of web workers (if supported) to use,
-		*       -1 to use estimated cores minus one>.
-		*     workLoad: the size of the work load, ie: number of possible prime
-		*       numbers for each web worker to check per work assignment,
-		*       (default: 100).
-		*   }
-		* }
-		*
-		* @param bits the number of bits for the prime number.
-		* @param options the options to use.
-		*          [algorithm] the algorithm to use (default: 'PRIMEINC').
-		*          [prng] a custom crypto-secure pseudo-random number generator to use,
-		*            that must define "getBytesSync".
-		*
-		* @return callback(err, num) called once the operation completes.
-		*/
-		prime.generateProbablePrime = function(bits, options, callback) {
-			if (typeof options === "function") {
-				callback = options;
-				options = {};
-			}
-			options = options || {};
-			var algorithm = options.algorithm || "PRIMEINC";
-			if (typeof algorithm === "string") algorithm = { name: algorithm };
-			algorithm.options = algorithm.options || {};
-			var prng = options.prng || forge.random;
-			var rng = { nextBytes: function(x) {
-				var b = prng.getBytesSync(x.length);
-				for (var i = 0; i < x.length; ++i) x[i] = b.charCodeAt(i);
-			} };
-			if (algorithm.name === "PRIMEINC") return primeincFindPrime(bits, rng, algorithm.options, callback);
-			throw new Error("Invalid prime generation algorithm: " + algorithm.name);
-		};
-		function primeincFindPrime(bits, rng, options, callback) {
-			if ("workers" in options) return primeincFindPrimeWithWorkers(bits, rng, options, callback);
-			return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);
-		}
-		function primeincFindPrimeWithoutWorkers(bits, rng, options, callback) {
-			var num = generateRandom(bits, rng);
-			var deltaIdx = 0;
-			var mrTests = getMillerRabinTests(num.bitLength());
-			if ("millerRabinTests" in options) mrTests = options.millerRabinTests;
-			var maxBlockTime = 10;
-			if ("maxBlockTime" in options) maxBlockTime = options.maxBlockTime;
-			_primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);
-		}
-		function _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback) {
-			var start = +/* @__PURE__ */ new Date();
-			do {
-				if (num.bitLength() > bits) num = generateRandom(bits, rng);
-				if (num.isProbablePrime(mrTests)) return callback(null, num);
-				num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);
-			} while (maxBlockTime < 0 || +/* @__PURE__ */ new Date() - start < maxBlockTime);
-			forge.util.setImmediate(function() {
-				_primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);
-			});
-		}
-		function primeincFindPrimeWithWorkers(bits, rng, options, callback) {
-			if (typeof Worker === "undefined") return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);
-			var num = generateRandom(bits, rng);
-			var numWorkers = options.workers;
-			var workLoad = options.workLoad || 100;
-			var range = workLoad * 30 / 8;
-			var workerScript = options.workerScript || "forge/prime.worker.js";
-			if (numWorkers === -1) return forge.util.estimateCores(function(err, cores) {
-				if (err) cores = 2;
-				numWorkers = cores - 1;
-				generate();
-			});
-			generate();
-			function generate() {
-				numWorkers = Math.max(1, numWorkers);
-				var workers = [];
-				for (var i = 0; i < numWorkers; ++i) workers[i] = new Worker(workerScript);
-				var running = numWorkers;
-				for (var i = 0; i < numWorkers; ++i) workers[i].addEventListener("message", workerMessage);
-				var found = false;
-				function workerMessage(e) {
-					if (found) return;
-					--running;
-					var data = e.data;
-					if (data.found) {
-						for (var i$1 = 0; i$1 < workers.length; ++i$1) workers[i$1].terminate();
-						found = true;
-						return callback(null, new BigInteger(data.prime, 16));
-					}
-					if (num.bitLength() > bits) num = generateRandom(bits, rng);
-					var hex = num.toString(16);
-					e.target.postMessage({
-						hex,
-						workLoad
-					});
-					num.dAddOffset(range, 0);
-				}
-			}
-		}
-		/**
-		* Generates a random number using the given number of bits and RNG.
-		*
-		* @param bits the number of bits for the number.
-		* @param rng the random number generator to use.
-		*
-		* @return the random number.
-		*/
-		function generateRandom(bits, rng) {
-			var num = new BigInteger(bits, rng);
-			var bits1 = bits - 1;
-			if (!num.testBit(bits1)) num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, num);
-			num.dAddOffset(31 - num.mod(THIRTY).byteValue(), 0);
-			return num;
-		}
-		/**
-		* Returns the required number of Miller-Rabin tests to generate a
-		* prime with an error probability of (1/2)^80.
-		*
-		* See Handbook of Applied Cryptography Chapter 4, Table 4.4.
-		*
-		* @param bits the bit size.
-		*
-		* @return the required number of iterations.
-		*/
-		function getMillerRabinTests(bits) {
-			if (bits <= 100) return 27;
-			if (bits <= 150) return 18;
-			if (bits <= 200) return 15;
-			if (bits <= 250) return 12;
-			if (bits <= 300) return 9;
-			if (bits <= 350) return 8;
-			if (bits <= 400) return 7;
-			if (bits <= 500) return 6;
-			if (bits <= 600) return 5;
-			if (bits <= 800) return 4;
-			if (bits <= 1250) return 3;
-			return 2;
-		}
-	})();
-}) });
-
-//#endregion
-Object.defineProperty(exports, 'default', {
-  enumerable: true,
-  get: function () {
-    return require_prime();
-  }
-});
-//# sourceMappingURL=prime.cjs.map

package/dist/cjs/node_modules/node-forge/lib/prime.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"prime.cjs","names":["i"],"sources":["../../../../../../../node_modules/node-forge/lib/prime.js"],"sourcesContent":["/**\n * Prime number generation API.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\nrequire('./jsbn');\nrequire('./random');\n\n(function() {\n\n// forge.prime already defined\nif(forge.prime) {\n  module.exports = forge.prime;\n  return;\n}\n\n/* PRIME API */\nvar prime = module.exports = forge.prime = forge.prime || {};\n\nvar BigInteger = forge.jsbn.BigInteger;\n\n// primes are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29\nvar GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];\nvar THIRTY = new BigInteger(null);\nTHIRTY.fromInt(30);\nvar op_or = function(x, y) {return x|y;};\n\n/**\n * Generates a random probable prime with the given number of bits.\n *\n * Alternative algorithms can be specified by name as a string or as an\n * object with custom options like so:\n *\n * {\n *   name: 'PRIMEINC',\n *   options: {\n *     maxBlockTime: <the maximum amount of time to block the main\n *       thread before allowing I/O other JS to run>,\n *     millerRabinTests: <the number of miller-rabin tests to run>,\n *     workerScript: <the worker script URL>,\n *     workers: <the number of web workers (if supported) to use,\n *       -1 to use estimated cores minus one>.\n *     workLoad: the size of the work load, ie: number of possible prime\n *       numbers for each web worker to check per work assignment,\n *       (default: 100).\n *   }\n * }\n *\n * @param bits the number of bits for the prime number.\n * @param options the options to use.\n *          [algorithm] the algorithm to use (default: 'PRIMEINC').\n *          [prng] a custom crypto-secure pseudo-random number generator to use,\n *            that must define \"getBytesSync\".\n *\n * @return callback(err, num) called once the operation completes.\n */\nprime.generateProbablePrime = function(bits, options, callback) {\n  if(typeof options === 'function') {\n    callback = options;\n    options = {};\n  }\n  options = options || {};\n\n  // default to PRIMEINC algorithm\n  var algorithm = options.algorithm || 'PRIMEINC';\n  if(typeof algorithm === 'string') {\n    algorithm = {name: algorithm};\n  }\n  algorithm.options = algorithm.options || {};\n\n  // create prng with api that matches BigInteger secure random\n  var prng = options.prng || forge.random;\n  var rng = {\n    // x is an array to fill with bytes\n    nextBytes: function(x) {\n      var b = prng.getBytesSync(x.length);\n      for(var i = 0; i < x.length; ++i) {\n        x[i] = b.charCodeAt(i);\n      }\n    }\n  };\n\n  if(algorithm.name === 'PRIMEINC') {\n    return primeincFindPrime(bits, rng, algorithm.options, callback);\n  }\n\n  throw new Error('Invalid prime generation algorithm: ' + algorithm.name);\n};\n\nfunction primeincFindPrime(bits, rng, options, callback) {\n  if('workers' in options) {\n    return primeincFindPrimeWithWorkers(bits, rng, options, callback);\n  }\n  return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);\n}\n\nfunction primeincFindPrimeWithoutWorkers(bits, rng, options, callback) {\n  // initialize random number\n  var num = generateRandom(bits, rng);\n\n  /* Note: All primes are of the form 30k+i for i < 30 and gcd(30, i)=1. The\n  number we are given is always aligned at 30k + 1. Each time the number is\n  determined not to be prime we add to get to the next 'i', eg: if the number\n  was at 30k + 1 we add 6. */\n  var deltaIdx = 0;\n\n  // get required number of MR tests\n  var mrTests = getMillerRabinTests(num.bitLength());\n  if('millerRabinTests' in options) {\n    mrTests = options.millerRabinTests;\n  }\n\n  // find prime nearest to 'num' for maxBlockTime ms\n  // 10 ms gives 5ms of leeway for other calculations before dropping\n  // below 60fps (1000/60 == 16.67), but in reality, the number will\n  // likely be higher due to an 'atomic' big int modPow\n  var maxBlockTime = 10;\n  if('maxBlockTime' in options) {\n    maxBlockTime = options.maxBlockTime;\n  }\n\n  _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);\n}\n\nfunction _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback) {\n  var start = +new Date();\n  do {\n    // overflow, regenerate random number\n    if(num.bitLength() > bits) {\n      num = generateRandom(bits, rng);\n    }\n    // do primality test\n    if(num.isProbablePrime(mrTests)) {\n      return callback(null, num);\n    }\n    // get next potential prime\n    num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);\n  } while(maxBlockTime < 0 || (+new Date() - start < maxBlockTime));\n\n  // keep trying later\n  forge.util.setImmediate(function() {\n    _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);\n  });\n}\n\n// NOTE: This algorithm is indeterminate in nature because workers\n// run in parallel looking at different segments of numbers. Even if this\n// algorithm is run twice with the same input from a predictable RNG, it\n// may produce different outputs.\nfunction primeincFindPrimeWithWorkers(bits, rng, options, callback) {\n  // web workers unavailable\n  if(typeof Worker === 'undefined') {\n    return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);\n  }\n\n  // initialize random number\n  var num = generateRandom(bits, rng);\n\n  // use web workers to generate keys\n  var numWorkers = options.workers;\n  var workLoad = options.workLoad || 100;\n  var range = workLoad * 30 / 8;\n  var workerScript = options.workerScript || 'forge/prime.worker.js';\n  if(numWorkers === -1) {\n    return forge.util.estimateCores(function(err, cores) {\n      if(err) {\n        // default to 2\n        cores = 2;\n      }\n      numWorkers = cores - 1;\n      generate();\n    });\n  }\n  generate();\n\n  function generate() {\n    // require at least 1 worker\n    numWorkers = Math.max(1, numWorkers);\n\n    // TODO: consider optimizing by starting workers outside getPrime() ...\n    // note that in order to clean up they will have to be made internally\n    // asynchronous which may actually be slower\n\n    // start workers immediately\n    var workers = [];\n    for(var i = 0; i < numWorkers; ++i) {\n      // FIXME: fix path or use blob URLs\n      workers[i] = new Worker(workerScript);\n    }\n    var running = numWorkers;\n\n    // listen for requests from workers and assign ranges to find prime\n    for(var i = 0; i < numWorkers; ++i) {\n      workers[i].addEventListener('message', workerMessage);\n    }\n\n    /* Note: The distribution of random numbers is unknown. Therefore, each\n    web worker is continuously allocated a range of numbers to check for a\n    random number until one is found.\n\n    Every 30 numbers will be checked just 8 times, because prime numbers\n    have the form:\n\n    30k+i, for i < 30 and gcd(30, i)=1 (there are 8 values of i for this)\n\n    Therefore, if we want a web worker to run N checks before asking for\n    a new range of numbers, each range must contain N*30/8 numbers.\n\n    For 100 checks (workLoad), this is a range of 375. */\n\n    var found = false;\n    function workerMessage(e) {\n      // ignore message, prime already found\n      if(found) {\n        return;\n      }\n\n      --running;\n      var data = e.data;\n      if(data.found) {\n        // terminate all workers\n        for(var i = 0; i < workers.length; ++i) {\n          workers[i].terminate();\n        }\n        found = true;\n        return callback(null, new BigInteger(data.prime, 16));\n      }\n\n      // overflow, regenerate random number\n      if(num.bitLength() > bits) {\n        num = generateRandom(bits, rng);\n      }\n\n      // assign new range to check\n      var hex = num.toString(16);\n\n      // start prime search\n      e.target.postMessage({\n        hex: hex,\n        workLoad: workLoad\n      });\n\n      num.dAddOffset(range, 0);\n    }\n  }\n}\n\n/**\n * Generates a random number using the given number of bits and RNG.\n *\n * @param bits the number of bits for the number.\n * @param rng the random number generator to use.\n *\n * @return the random number.\n */\nfunction generateRandom(bits, rng) {\n  var num = new BigInteger(bits, rng);\n  // force MSB set\n  var bits1 = bits - 1;\n  if(!num.testBit(bits1)) {\n    num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, num);\n  }\n  // align number on 30k+1 boundary\n  num.dAddOffset(31 - num.mod(THIRTY).byteValue(), 0);\n  return num;\n}\n\n/**\n * Returns the required number of Miller-Rabin tests to generate a\n * prime with an error probability of (1/2)^80.\n *\n * See Handbook of Applied Cryptography Chapter 4, Table 4.4.\n *\n * @param bits the bit size.\n *\n * @return the required number of iterations.\n */\nfunction getMillerRabinTests(bits) {\n  if(bits <= 100) return 27;\n  if(bits <= 150) return 18;\n  if(bits <= 200) return 15;\n  if(bits <= 250) return 12;\n  if(bits <= 300) return 9;\n  if(bits <= 350) return 8;\n  if(bits <= 400) return 7;\n  if(bits <= 500) return 6;\n  if(bits <= 600) return 5;\n  if(bits <= 800) return 4;\n  if(bits <= 1250) return 3;\n  return 2;\n}\n\n})();\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;CAOA,IAAI;AACJ;AACA;AACA;AAEA,EAAC,WAAW;AAGZ,MAAG,MAAM,OAAO;AACd,UAAO,UAAU,MAAM;AACvB;;EAIF,IAAI,QAAQ,OAAO,UAAU,MAAM,QAAQ,MAAM,SAAS,EAAE;EAE5D,IAAI,aAAa,MAAM,KAAK;EAG5B,IAAI,eAAe;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE;EAC3C,IAAI,SAAS,IAAI,WAAW,KAAK;AACjC,SAAO,QAAQ,GAAG;EAClB,IAAI,QAAQ,SAAS,GAAG,GAAG;AAAC,UAAO,IAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BrC,QAAM,wBAAwB,SAAS,MAAM,SAAS,UAAU;AAC9D,OAAG,OAAO,YAAY,YAAY;AAChC,eAAW;AACX,cAAU,EAAE;;AAEd,aAAU,WAAW,EAAE;GAGvB,IAAI,YAAY,QAAQ,aAAa;AACrC,OAAG,OAAO,cAAc,SACtB,aAAY,EAAC,MAAM,WAAU;AAE/B,aAAU,UAAU,UAAU,WAAW,EAAE;GAG3C,IAAI,OAAO,QAAQ,QAAQ,MAAM;GACjC,IAAI,MAAM,EAER,WAAW,SAAS,GAAG;IACrB,IAAI,IAAI,KAAK,aAAa,EAAE,OAAO;AACnC,SAAI,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,EAC7B,GAAE,KAAK,EAAE,WAAW,EAAE;MAG3B;AAED,OAAG,UAAU,SAAS,WACpB,QAAO,kBAAkB,MAAM,KAAK,UAAU,SAAS,SAAS;AAGlE,SAAM,IAAI,MAAM,yCAAyC,UAAU,KAAK;;EAG1E,SAAS,kBAAkB,MAAM,KAAK,SAAS,UAAU;AACvD,OAAG,aAAa,QACd,QAAO,6BAA6B,MAAM,KAAK,SAAS,SAAS;AAEnE,UAAO,gCAAgC,MAAM,KAAK,SAAS,SAAS;;EAGtE,SAAS,gCAAgC,MAAM,KAAK,SAAS,UAAU;GAErE,IAAI,MAAM,eAAe,MAAM,IAAI;GAMnC,IAAI,WAAW;GAGf,IAAI,UAAU,oBAAoB,IAAI,WAAW,CAAC;AAClD,OAAG,sBAAsB,QACvB,WAAU,QAAQ;GAOpB,IAAI,eAAe;AACnB,OAAG,kBAAkB,QACnB,gBAAe,QAAQ;AAGzB,aAAU,KAAK,MAAM,KAAK,UAAU,SAAS,cAAc,SAAS;;EAGtE,SAAS,UAAU,KAAK,MAAM,KAAK,UAAU,SAAS,cAAc,UAAU;GAC5E,IAAI,QAAQ,iBAAC,IAAI,MAAM;AACvB,MAAG;AAED,QAAG,IAAI,WAAW,GAAG,KACnB,OAAM,eAAe,MAAM,IAAI;AAGjC,QAAG,IAAI,gBAAgB,QAAQ,CAC7B,QAAO,SAAS,MAAM,IAAI;AAG5B,QAAI,WAAW,aAAa,aAAa,IAAI,EAAE;YACzC,eAAe,KAAM,iBAAC,IAAI,MAAM,GAAG,QAAQ;AAGnD,SAAM,KAAK,aAAa,WAAW;AACjC,cAAU,KAAK,MAAM,KAAK,UAAU,SAAS,cAAc,SAAS;KACpE;;EAOJ,SAAS,6BAA6B,MAAM,KAAK,SAAS,UAAU;AAElE,OAAG,OAAO,WAAW,YACnB,QAAO,gCAAgC,MAAM,KAAK,SAAS,SAAS;GAItE,IAAI,MAAM,eAAe,MAAM,IAAI;GAGnC,IAAI,aAAa,QAAQ;GACzB,IAAI,WAAW,QAAQ,YAAY;GACnC,IAAI,QAAQ,WAAW,KAAK;GAC5B,IAAI,eAAe,QAAQ,gBAAgB;AAC3C,OAAG,eAAe,GAChB,QAAO,MAAM,KAAK,cAAc,SAAS,KAAK,OAAO;AACnD,QAAG,IAED,SAAQ;AAEV,iBAAa,QAAQ;AACrB,cAAU;KACV;AAEJ,aAAU;GAEV,SAAS,WAAW;AAElB,iBAAa,KAAK,IAAI,GAAG,WAAW;IAOpC,IAAI,UAAU,EAAE;AAChB,SAAI,IAAI,IAAI,GAAG,IAAI,YAAY,EAAE,EAE/B,SAAQ,KAAK,IAAI,OAAO,aAAa;IAEvC,IAAI,UAAU;AAGd,SAAI,IAAI,IAAI,GAAG,IAAI,YAAY,EAAE,EAC/B,SAAQ,GAAG,iBAAiB,WAAW,cAAc;IAiBvD,IAAI,QAAQ;IACZ,SAAS,cAAc,GAAG;AAExB,SAAG,MACD;AAGF,OAAE;KACF,IAAI,OAAO,EAAE;AACb,SAAG,KAAK,OAAO;AAEb,WAAI,IAAIA,MAAI,GAAGA,MAAI,QAAQ,QAAQ,EAAEA,IACnC,SAAQA,KAAG,WAAW;AAExB,cAAQ;AACR,aAAO,SAAS,MAAM,IAAI,WAAW,KAAK,OAAO,GAAG,CAAC;;AAIvD,SAAG,IAAI,WAAW,GAAG,KACnB,OAAM,eAAe,MAAM,IAAI;KAIjC,IAAI,MAAM,IAAI,SAAS,GAAG;AAG1B,OAAE,OAAO,YAAY;MACd;MACK;MACX,CAAC;AAEF,SAAI,WAAW,OAAO,EAAE;;;;;;;;;;;;EAa9B,SAAS,eAAe,MAAM,KAAK;GACjC,IAAI,MAAM,IAAI,WAAW,MAAM,IAAI;GAEnC,IAAI,QAAQ,OAAO;AACnB,OAAG,CAAC,IAAI,QAAQ,MAAM,CACpB,KAAI,UAAU,WAAW,IAAI,UAAU,MAAM,EAAE,OAAO,IAAI;AAG5D,OAAI,WAAW,KAAK,IAAI,IAAI,OAAO,CAAC,WAAW,EAAE,EAAE;AACnD,UAAO;;;;;;;;;;;;EAaT,SAAS,oBAAoB,MAAM;AACjC,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,IAAK,QAAO;AACvB,OAAG,QAAQ,KAAM,QAAO;AACxB,UAAO;;KAGL"}

package/dist/cjs/node_modules/node-forge/lib/prng.cjs

@@ -1,297 +0,0 @@
-const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
-const require_forge$1 = require('./forge.cjs');
-const require_util$1 = require('./util.cjs');
-
-//#region ../../node_modules/node-forge/lib/prng.js
-var require_prng = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/prng.js": ((exports, module) => {
-	/**
-	* A javascript implementation of a cryptographically-secure
-	* Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed
-	* here though the use of SHA-256 is not enforced; when generating an
-	* a PRNG context, the hashing algorithm and block cipher used for
-	* the generator are specified via a plugin.
-	*
-	* @author Dave Longley
-	*
-	* Copyright (c) 2010-2014 Digital Bazaar, Inc.
-	*/
-	var forge = require_forge$1.default;
-	require_util$1.default;
-	var _crypto = null;
-	if (forge.util.isNodejs && !forge.options.usePureJavaScript && !process.versions["node-webkit"]) _crypto = require("crypto");
-	var prng = module.exports = forge.prng = forge.prng || {};
-	/**
-	* Creates a new PRNG context.
-	*
-	* A PRNG plugin must be passed in that will provide:
-	*
-	* 1. A function that initializes the key and seed of a PRNG context. It
-	*   will be given a 16 byte key and a 16 byte seed. Any key expansion
-	*   or transformation of the seed from a byte string into an array of
-	*   integers (or similar) should be performed.
-	* 2. The cryptographic function used by the generator. It takes a key and
-	*   a seed.
-	* 3. A seed increment function. It takes the seed and returns seed + 1.
-	* 4. An api to create a message digest.
-	*
-	* For an example, see random.js.
-	*
-	* @param plugin the PRNG plugin to use.
-	*/
-	prng.create = function(plugin) {
-		var ctx = {
-			plugin,
-			key: null,
-			seed: null,
-			time: null,
-			reseeds: 0,
-			generated: 0,
-			keyBytes: ""
-		};
-		var md = plugin.md;
-		var pools = new Array(32);
-		for (var i = 0; i < 32; ++i) pools[i] = md.create();
-		ctx.pools = pools;
-		ctx.pool = 0;
-		/**
-		* Generates random bytes. The bytes may be generated synchronously or
-		* asynchronously. Web workers must use the asynchronous interface or
-		* else the behavior is undefined.
-		*
-		* @param count the number of random bytes to generate.
-		* @param [callback(err, bytes)] called once the operation completes.
-		*
-		* @return count random bytes as a string.
-		*/
-		ctx.generate = function(count, callback) {
-			if (!callback) return ctx.generateSync(count);
-			var cipher = ctx.plugin.cipher;
-			var increment = ctx.plugin.increment;
-			var formatKey = ctx.plugin.formatKey;
-			var formatSeed = ctx.plugin.formatSeed;
-			var b = forge.util.createBuffer();
-			ctx.key = null;
-			generate();
-			function generate(err) {
-				if (err) return callback(err);
-				if (b.length() >= count) return callback(null, b.getBytes(count));
-				if (ctx.generated > 1048575) ctx.key = null;
-				if (ctx.key === null) return forge.util.nextTick(function() {
-					_reseed(generate);
-				});
-				var bytes = cipher(ctx.key, ctx.seed);
-				ctx.generated += bytes.length;
-				b.putBytes(bytes);
-				ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
-				ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));
-				forge.util.setImmediate(generate);
-			}
-		};
-		/**
-		* Generates random bytes synchronously.
-		*
-		* @param count the number of random bytes to generate.
-		*
-		* @return count random bytes as a string.
-		*/
-		ctx.generateSync = function(count) {
-			var cipher = ctx.plugin.cipher;
-			var increment = ctx.plugin.increment;
-			var formatKey = ctx.plugin.formatKey;
-			var formatSeed = ctx.plugin.formatSeed;
-			ctx.key = null;
-			var b = forge.util.createBuffer();
-			while (b.length() < count) {
-				if (ctx.generated > 1048575) ctx.key = null;
-				if (ctx.key === null) _reseedSync();
-				var bytes = cipher(ctx.key, ctx.seed);
-				ctx.generated += bytes.length;
-				b.putBytes(bytes);
-				ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
-				ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));
-			}
-			return b.getBytes(count);
-		};
-		/**
-		* Private function that asynchronously reseeds a generator.
-		*
-		* @param callback(err) called once the operation completes.
-		*/
-		function _reseed(callback) {
-			if (ctx.pools[0].messageLength >= 32) {
-				_seed();
-				return callback();
-			}
-			var needed = 32 - ctx.pools[0].messageLength << 5;
-			ctx.seedFile(needed, function(err, bytes) {
-				if (err) return callback(err);
-				ctx.collect(bytes);
-				_seed();
-				callback();
-			});
-		}
-		/**
-		* Private function that synchronously reseeds a generator.
-		*/
-		function _reseedSync() {
-			if (ctx.pools[0].messageLength >= 32) return _seed();
-			var needed = 32 - ctx.pools[0].messageLength << 5;
-			ctx.collect(ctx.seedFileSync(needed));
-			_seed();
-		}
-		/**
-		* Private function that seeds a generator once enough bytes are available.
-		*/
-		function _seed() {
-			ctx.reseeds = ctx.reseeds === 4294967295 ? 0 : ctx.reseeds + 1;
-			var md$1 = ctx.plugin.md.create();
-			md$1.update(ctx.keyBytes);
-			var _2powK = 1;
-			for (var k = 0; k < 32; ++k) {
-				if (ctx.reseeds % _2powK === 0) {
-					md$1.update(ctx.pools[k].digest().getBytes());
-					ctx.pools[k].start();
-				}
-				_2powK = _2powK << 1;
-			}
-			ctx.keyBytes = md$1.digest().getBytes();
-			md$1.start();
-			md$1.update(ctx.keyBytes);
-			var seedBytes = md$1.digest().getBytes();
-			ctx.key = ctx.plugin.formatKey(ctx.keyBytes);
-			ctx.seed = ctx.plugin.formatSeed(seedBytes);
-			ctx.generated = 0;
-		}
-		/**
-		* The built-in default seedFile. This seedFile is used when entropy
-		* is needed immediately.
-		*
-		* @param needed the number of bytes that are needed.
-		*
-		* @return the random bytes.
-		*/
-		function defaultSeedFile(needed) {
-			var getRandomValues = null;
-			var globalScope = forge.util.globalScope;
-			var _crypto$1 = globalScope.crypto || globalScope.msCrypto;
-			if (_crypto$1 && _crypto$1.getRandomValues) getRandomValues = function(arr) {
-				return _crypto$1.getRandomValues(arr);
-			};
-			var b = forge.util.createBuffer();
-			if (getRandomValues) while (b.length() < needed) {
-				var count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);
-				var entropy = new Uint32Array(Math.floor(count));
-				try {
-					getRandomValues(entropy);
-					for (var i$1 = 0; i$1 < entropy.length; ++i$1) b.putInt32(entropy[i$1]);
-				} catch (e) {
-					if (!(typeof QuotaExceededError !== "undefined" && e instanceof QuotaExceededError)) throw e;
-				}
-			}
-			if (b.length() < needed) {
-				var hi, lo, next;
-				var seed = Math.floor(Math.random() * 65536);
-				while (b.length() < needed) {
-					lo = 16807 * (seed & 65535);
-					hi = 16807 * (seed >> 16);
-					lo += (hi & 32767) << 16;
-					lo += hi >> 15;
-					lo = (lo & 2147483647) + (lo >> 31);
-					seed = lo & 4294967295;
-					for (var i$1 = 0; i$1 < 3; ++i$1) {
-						next = seed >>> (i$1 << 3);
-						next ^= Math.floor(Math.random() * 256);
-						b.putByte(next & 255);
-					}
-				}
-			}
-			return b.getBytes(needed);
-		}
-		if (_crypto) {
-			ctx.seedFile = function(needed, callback) {
-				_crypto.randomBytes(needed, function(err, bytes) {
-					if (err) return callback(err);
-					callback(null, bytes.toString());
-				});
-			};
-			ctx.seedFileSync = function(needed) {
-				return _crypto.randomBytes(needed).toString();
-			};
-		} else {
-			ctx.seedFile = function(needed, callback) {
-				try {
-					callback(null, defaultSeedFile(needed));
-				} catch (e) {
-					callback(e);
-				}
-			};
-			ctx.seedFileSync = defaultSeedFile;
-		}
-		/**
-		* Adds entropy to a prng ctx's accumulator.
-		*
-		* @param bytes the bytes of entropy as a string.
-		*/
-		ctx.collect = function(bytes) {
-			var count = bytes.length;
-			for (var i$1 = 0; i$1 < count; ++i$1) {
-				ctx.pools[ctx.pool].update(bytes.substr(i$1, 1));
-				ctx.pool = ctx.pool === 31 ? 0 : ctx.pool + 1;
-			}
-		};
-		/**
-		* Collects an integer of n bits.
-		*
-		* @param i the integer entropy.
-		* @param n the number of bits in the integer.
-		*/
-		ctx.collectInt = function(i$1, n) {
-			var bytes = "";
-			for (var x = 0; x < n; x += 8) bytes += String.fromCharCode(i$1 >> x & 255);
-			ctx.collect(bytes);
-		};
-		/**
-		* Registers a Web Worker to receive immediate entropy from the main thread.
-		* This method is required until Web Workers can access the native crypto
-		* API. This method should be called twice for each created worker, once in
-		* the main thread, and once in the worker itself.
-		*
-		* @param worker the worker to register.
-		*/
-		ctx.registerWorker = function(worker) {
-			if (worker === self) ctx.seedFile = function(needed, callback) {
-				function listener$1(e) {
-					var data = e.data;
-					if (data.forge && data.forge.prng) {
-						self.removeEventListener("message", listener$1);
-						callback(data.forge.prng.err, data.forge.prng.bytes);
-					}
-				}
-				self.addEventListener("message", listener$1);
-				self.postMessage({ forge: { prng: { needed } } });
-			};
-			else {
-				var listener = function(e) {
-					var data = e.data;
-					if (data.forge && data.forge.prng) ctx.seedFile(data.forge.prng.needed, function(err, bytes) {
-						worker.postMessage({ forge: { prng: {
-							err,
-							bytes
-						} } });
-					});
-				};
-				worker.addEventListener("message", listener);
-			}
-		};
-		return ctx;
-	};
-}) });
-
-//#endregion
-Object.defineProperty(exports, 'default', {
-  enumerable: true,
-  get: function () {
-    return require_prng();
-  }
-});
-//# sourceMappingURL=prng.cjs.map