You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+28-23Lines changed: 28 additions & 23 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -211,29 +211,34 @@ ECM on Mersenne numbers
211
211
------------------------
212
212
ECM is a probabilistic generalization of P−1/P+1: it succeeds when the group order on a random curve has a cofactor that’s B1,B2-smooth, so B1/B2 should be chosen for the target factor size.
213
213
214
-
ECM on Mersenne numbers N = 2^p - 1. Stage 1 multiplies by all prime powers <= B1; Stage 2 scans primes in (B1, B2]. Without flags you get the plain prime-by-prime Stage 2. "-brent d" enables a simplified Brent-Suyama extension by using q^d (a bit more extra reach beyond B2). "-bsgs" batches several multipliers into one ladder call to reduce overhead. Both flags are complementary and can be combined. You can pass pre-known factors via "-factors <list>" (decimal or 0x hex); they are divided out (with multiplicities) before ECM. For p=701, 796337 is a known factor. Runs are checkpointed periodically; re-running the same command resumes safely.
215
-
```
216
-
# Plain ECM on M_p (here p=701)
217
-
./prmers 701 -ecm -b1 6000 -b2 33333 -K 8
218
-
219
-
# ECM + batching only (same primes, fewer ladder calls)
220
-
./prmers 701 -ecm -b1 6000 -b2 33333 -K 8 -bsgs
221
-
222
-
# ECM + simplified Brent-Suyama only (q -> q^3 here)
0 commit comments