* Tries to generate a test that is not in the tested set. * The algorithm is written rather naively, but this is fine (although inefficient) because

* Keeps track of if a threshold has been passed, and returns true if it has. * @param {number} num

* Used to simplify the set lookup (since the values getting stuck in there are quite large.) * @param {string} str * @returns {string}

* Replaces one of the characters in the keyframe with a random character. * @param {string} keyFrame

* This generates a series of multipliers that are multiplied to the original prime to try to find a new prime.

* @param {number} time

* Keeps track of how many times it has been invoked to trigger an escape, this is for generateTests, * which is implemented naively. * @param {numbe

* Extracts the prime value from the result returned from OpenSSL. * @param {string} str

* @param {string} val * @param {number} simultaneous * @returns {Promise<string>}

* Finds a character that the algorithm is allowed to modify. * @param {string} keyFrame * @returns {number}

* Generates a collection of tests that are not in the tested set. * This is used so we may execute the tests in parallel. * * @param {Set<string>}

* Selects a random element from an array. * @template T * @param {T[]} arr