From b6129550e56d84bd8a10112700091e87595dfc8e Mon Sep 17 00:00:00 2001 From: juanelas Date: Mon, 9 Dec 2019 13:18:10 +0100 Subject: [PATCH] Fixed prime fn doc in README --- src/main.js | 1 - 1 file changed, 1 deletion(-) diff --git a/src/main.js b/src/main.js index caa77c0..d5c0382 100644 --- a/src/main.js +++ b/src/main.js @@ -281,7 +281,6 @@ export function modPow(b, e, n) { * * @param {number} bitLength The required bit length for the generated prime * @param {number} [iterations = 16] The number of iterations for the Miller-Rabin Probabilistic Primality Test - * @param {boolean} sync NOT RECOMMENDED. Invoke the function synchronously. It won't use workers so it'll be slower and may freeze thw window in browser's javascript. * * @returns {Promise} A promise that resolves to a bigint probable prime of bitLength bits. */