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.
  */