[QUOTE=Miszka;576741]32GB[/QUOTE]

I would try the worktodo line that I posted above; if that works, maybe try subsequent doublings of B1 to see if there's a value where the code stops working. Report back here. It might be a bug, if the code doesn't gracefully adapt to constrained memory conditions yet.

OR maybe the code doesn't behave if the TF bit level is set to a value that is much too high.

30.6b2:
"KeepPplus1SaveFiles=0" is default and you have to use "KeepPplus1SaveFiles=1" to turn it on, which is opposite of what undoc.txt states.



When you do P-1/P+1 on Fermat numbers: Pminus1=1,2,<2[SUP]n[/SUP]>,1 the server automatically notices and calls it Fn and fills out the known factors in the P-1/P+1 line, which is awesome.

Could this be possible for Mersenne numbers that it checks for known factors on the server, and fills them in? or would it strain the server too much?
If possible we could use some notation like empty quotation marks "" in the factors spot or zero: "0" to have it fetch automatically, just in case we want to retain the option to run curves on the full Mersenne number.

[QUOTE=axn;576736]Could be a bug. However, I am confused about the bolded parameter: Pplus1=N/A,1,2,1000033,-1,10000000,250000000,2,[B]1000000000[/B],"6000199"

It is supposed to be the depth of TF in bits. The value you've given (1000000000) is way too high. Don't know if that has anything to do with the bug.[/QUOTE]

The sieve depth must be less than 100. For reasons unknown (code was cut/pasted from parsing P-1 lines) the parsing stops with a sieve depth >= 100.

[QUOTE=masser;576742]I would try the worktodo line that I posted above; if that works, maybe try subsequent doublings of B1 to see if there's a value where the code stops working. Report back here. It might be a bug, if the code doesn't gracefully adapt to constrained memory conditions yet.

OR maybe the code doesn't behave if the TF bit level is set to a value that is much too high.[/QUOTE]

For Pplus1=N/A,1,2,1000033,-1,1000000,250000000,2,[B]66[/B],"6000199"

[Apr 24 18:59] Worker starting
[Apr 24 18:59] Setting affinity to run worker on CPU core #2
[Apr 24 18:59]
[Apr 24 18:59] P+1 on M1000033 with B1=1000000, B2=TBD
[Apr 24 18:59] Setting affinity to run helper thread 1 on CPU core #3
[Apr 24 18:59] Setting affinity to run helper thread 2 on CPU core #4
[Apr 24 18:59] Setting affinity to run helper thread 3 on CPU core #5
[Apr 24 18:59] Using FMA3 FFT length 48K, Pass1=768, Pass2=64, clm=2, 4 threads
[Apr 24 19:06] M1000033 stage 1 complete. 4357352 transforms. Time: 407.104 sec.
[Apr 24 19:06] Stage 1 GCD complete. Time: 0.083 sec.
[Apr 24 19:06] With trial factoring done to 2^66, optimal B2 is 64*B1 = 64000000.
[Apr 24 19:06] Chance of a new factor assuming no ECM has been done is 0.7%
[Apr 24 19:06] D: 2730, relative primes: 9507, stage 2 primes: 3706588, pair%=97.25
[Apr 24 19:06] Using 3603MB of memory.
[Apr 24 19:06] Stage 2 init complete. 30085 transforms. Time: 5.316 sec.
[Apr 24 19:12] M1000033 stage 2 complete. 3851030 transforms. Time: 329.027 sec.
[Apr 24 19:12] Stage 2 GCD complete. Time: 0.083 sec.
[Apr 24 19:12] M1000033 completed P+1, B1=1000000, B2=64000000, Wi4: 1A33F4F5

As you can see with correct parameters it works fine. My mistake was that I set the [I]how_far_factored[/I] parameter too high (I misinterpreted it)

[QUOTE=ATH;576652]7 factors out of 1599 curves: 2 P+1 smooth, 4 P-1 smooth, 1 both P+1/P-1 smooth


List sorted by time found, I might update this list for a bit with new factors

[CODE]
2021-04-22 06:48:35.610 [M]287873[/M] B1=10000000 B2=1000000000 start=2/7 167460871862758047584571103871 97 bits P+1/P-1 smooth P+1=2^7*3*7*149*31153*137737*1326817*73440613 P-1=2*5*287873*7162339*55539811*146235611
2021-04-23 03:15:32.123 [M]1600967[/M] B1=2000000 B2=146000000 start=2/7 20960634373165261374400215271 94 bits P-1 smooth P+1=2^3*11*13*16047334103*1141761785856421 P-1=2*3^4*5*219889*864733*1600967*85006373
2021-04-23 10:25:31.597 [M]1601783[/M] B1=2000000 B2=146000000 start=2/7 5920048152491971978196689064497 102 bits P-1 smooth P+1=2*7*1034951899*408579937608148822093 P-1=2^4*3*191*6637*10103*53017*1601783*113399107
2021-04-23 11:04:21.267 [M]296663[/M] B1=10000000 B2=500000000 start=2/7 33472736879943425145991507583 95 bits P+1 smooth P+1=2^7*3^2*7*79*3361*41897*9979727*37388971 P-1=2*23*149*34963*296663*470841841030657
2021-04-23 11:51:30.253 [M]1602143[/M] B1=2000000 B2=146000000 start=2/7 43496906104874570142712609 85 bits P-1 smooth P+1=2*5*7*11*56489488447889052133393 P-1=2^5*3^3*15241*17977*1602143*114686597
2021-04-23 16:33:29.030 [M]298307[/M] B1=10000000 B2=500000000 start=2/7 14600351802304915562080191901748143 113 bits P-1 smooth P+1=2^4*17*53677763979062189566471293756427 P-1=2*3*59*119591*298307*1512431*2126617*359445677
2021-04-24 10:32:21.530 [M]92821[/M] B1=40000000 B2=5240000000 start=2/7 6042060144547476324897523777583 102 bits P+1 smooth P+1=2^4*3*23*131*331*1039*2791*9151*19069*249427781 P-1=2*7*92821*3105342439*1497273943641227
[/CODE][/QUOTE]

Got a 6/5:

[CODE]{"status":"F", "exponent":14033251, "worktype":"P+1", "factors":["105040117068459648578879"], "b1":500000, "b2":10000000, "start":"6/5", "fft-length":737280, "security-code":"6B8F2965", "program":{"name":"Prime95", "version":"30.6", "build":1, "port":8}, "timestamp":"2021-04-24 18:17:38"}[/CODE]

[QUOTE=ATH;576747]30.6b2:
"KeepPplus1SaveFiles=0" is default and you have to use "KeepPplus1SaveFiles=1" to turn it on, which is opposite of what undoc.txt states.
[/QUOTE]

When turning this on doing P+1 in the 53K range, some files are 7 KB while others are 200+ MB, I think because they contain stage2 data right?
Is it possible to leave the small files just after stage1 completed?

[QUOTE=ATH;576768]When turning this on doing P+1 in the 53K range, some files are 7 KB while others are 200+ MB, I think because they contain stage2 data right?
Is it possible to leave the small files just after stage1 completed?[/QUOTE]

If any big files are left behind, that is a bug.

[QUOTE=ATH;576652]List sorted by time found, I might update this list for a bit with new factors[/QUOTE]Or you could just look at the live report:
[url]https://www.mersenne.org/report_pplus1/?f=1[/url]

The factor fpund for M14033251 is really NOT smooth,
k= 19^2 *10 367157 737 549


I do not really understand how pp1 work

[QUOTE=firejuggler;576772]The factor fpund for M14033251 is really NOT smooth,
k= 19^2 *10 367157 737 549
[/QUOTE]

You're stuck on thinking of factors as f = 2kp+1.

The factor is: f = 105040117068459648578879
The factor+1 is: f+1 = 105040117068459648578880 = 2^6 × 3 × 5 × 13 × 47 × 2377 × 5743 × 5953 × 2 203631
So, if I had chosen B1 = 6000 and B2 = 2500000, with enough P+1 runs, I would have found this factor.

With P+1 we're looking for f+1 to be smooth, or f+1 = 2kp+2 = 2(kp+1) => kp+1 has to be smooth.

Ah, thank you for your explanation.