![]() |
![]() |
#1 |
May 2013
Poland
2×53 Posts |
![]()
I'm using Prime95v. 30. 7b4
During implementation: Pminus1=N/A,1,2,3779,-1,40000000000,2000000000000,68,"7559,2086009,6084191,274476660553,5086072485847,6306850735777,3476227576267836521,2078022893280176212649" The program aborted after finishing the first stage and calculating B2=999*B1=39960000000000 without any message, writing to the log, or sending the result to the GIMPS server (See Photo1). I restarted the program forcing the value B2=2000000000000 Pminus1=N/A,1,2,3779,-1,40000000000,2000000000000,"7559,2086009,6084191,274476660553,5086072485847,6306850735777,3476227576267836521,2078022893280176212649" The program has again terminated unexpectedly (See Photo2). Perhaps the B2 value used (calculated) is too large and exceeds the allowable limit? I don't know, because there is no announcement. |
![]() |
![]() |
![]() |
#2 | |
"Viliam Furík"
Jul 2018
Martin, Slovakia
25×52 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#3 |
May 2013
Poland
1528 Posts |
![]()
And what's the biggest value B2 can be?
|
![]() |
![]() |
![]() |
#4 |
"Viliam Furík"
Jul 2018
Martin, Slovakia
25·52 Posts |
![]() |
![]() |
![]() |
![]() |
#5 |
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
11101011001102 Posts |
![]() |
![]() |
![]() |
![]() |
#6 |
"Viliam Furík"
Jul 2018
Martin, Slovakia
25·52 Posts |
![]() |
![]() |
![]() |
![]() |
#7 |
P90 years forever!
Aug 2002
Yeehaw, FL
2·17·241 Posts |
![]() |
![]() |
![]() |
![]() |
#8 |
"Tucker Kao"
Jan 2020
Head Base M168202123
24·5·11 Posts |
![]()
It depends on the available memories of the user's PC. Many larger factors require the bounds to be up to 2^14 or greater which can be out of reach by many models. ECM has the higher chance to find such the useful factors, but require many curves to be run before able to find 1.
|
![]() |
![]() |
![]() |
#9 |
Einyen
Dec 2003
Denmark
D7616 Posts |
![]()
With GMP-ECM you can run stage2 in as many stages as you want, going as high as you want. First you run stage1 and save the result:
ecm.exe -v -pm1 -save M3779stage1.txt 4e10 4e10 < M3779.txt The "M3779.txt" file is just this line: Code:
(2^3779-1)/7559/2086009/6084191/274476660553/5086072485847/6306850735777/3476227576267836521/2078022893280176212649 ecm.exe -v -pm1 -resume M3779stage1.txt 4e10 4e10-1e13 < M3779.txt ecm.exe -v -pm1 -resume M3779stage1.txt 4e10 1e13-2e13 < M3779.txt ecm.exe -v -pm1 -resume M3779stage1.txt 4e10 2e13-3e13 < M3779.txt etc. You can adjust the interval you want to run each time depending on how much memory you want to use. 1e13 takes 2784 MB. Generally I think running as high an interval as possible each time is faster than running many small intervals, but don't remember if that is always the case. I seem to remember testing than sometimes it was not. Last fiddled with by ATH on 2021-11-19 at 06:20 |
![]() |
![]() |
![]() |
#10 |
May 2013
Poland
2·53 Posts |
![]()
I made several attempts to determine the value of B2 to complete my task.
Only B2=B1=40000000000 was successful. In this experimental way I found out that for small Mersenne numbers the P-1 method is not a good method. |
![]() |
![]() |
![]() |
#11 |
P90 years forever!
Aug 2002
Yeehaw, FL
100000000000102 Posts |
![]()
Keep the save file. Version 30.8 may be able to complete stage 2.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Unexpected from AMD | M344587487 | Hardware | 18 | 2018-08-08 15:17 |
Unexpected Factor | apocalypse | PrimeNet | 6 | 2015-03-15 19:31 |
Unexpected jackpot | fivemack | Factoring | 6 | 2010-11-10 19:34 |
Aliquot Termination Question - Largest Prime? | EdH | Aliquot Sequences | 6 | 2010-04-06 00:12 |
A new termination below 100k | 10metreh | Aliquot Sequences | 0 | 2010-03-11 18:24 |