[QUOTE=kriesel;492071]I had thought that Prime95 would report the combined odds of all PRP and LL tests in the worktodo file finding a prime.[/QUOTE]

I am running all PRP and I get no odds of finding a prime.

[QUOTE=kriesel;492071]
Is this a known issue, or intended behavior?[/QUOTE]

Previously unknown issue, will be fixed.

[QUOTE=Prime95;479687]Build 8 now available for download from [URL]ftp://mersenne.org/gimps[/URL]. Windows and Linux 64-bit only.

Two changes (compare to build 7):

1) Fixes bug where autobench interrupts a torture test.
2) Linked with hwloc 1.11.9. Fixes a crash bug on a new unreleased CPU.[/QUOTE]


I had an unexpected reboot issue with a previous version so I have not ran it in a long time. It would do this while running ECM's. I left the memory settings at their default, for now. My plan is to gradually raise them on a daily basis and see what happens. Hopefully, there will be no issues.

prime95/mprime p-1 exponent limit?
 

From prime95 v29.4's whatsnew.txt:
[QUOTE]New features in Version 25.5 of prime95.exe
6) ECM and P-1 now support B1 and B2 values above 4.29 billion. ECM now
pays attention to the memory settings in the Options/CPU dialog box.

New features in Version 24.12 of prime95.exe
1) For SSE2 machines the larger FFTs have been changed to more effectively
use a wide variety of L2 cache sizes. The previous version was optimized
for a 256KB L2 cache only. Depending on your CPU and FFT size, you could
see an improvement of several percent.
2) As a side "benefit" even larger FFT sizes are now supported. This allows
testing of exponents up to 596 million. Not recommended.[/QUOTE]I did not find in readme.txt, whatsnew.txt, or undoc.txt, an indication of what P-1 factoring's maximum exponent was. Is it the same as for LL or PRP test, 596M?

[QUOTE=kriesel;493227]From prime95 v29.4's whatsnew.txt:
I did not find in readme.txt, whatsnew.txt, or undoc.txt, an indication of what P-1 factoring's maximum exponent was. Is it the same as for LL or PRP test, 596M?[/QUOTE]

Probably the same yes. You can do ECM on F29 which is the same size as a ~537M exponent. But it takes quite some times and you need at least 16 GB RAM for stage2 I think. It might be possible with less, but would take longer time.

[QUOTE=ATH;493229]Probably the same yes. You can do ECM on F29 which is the same size as a ~537M exponent. But it takes quite some times and you need at least 16 GB RAM for stage2 I think. It might be possible with less, but would take longer time.[/QUOTE]
I tried entering a high exponent in prime95's worktodo.txt manually, and got a run time estimate of a year for 544M P-1 on an i3-M370. I've seen in other software that ability to accept and start running an assignment sometimes does not result in successful completion. A cpu-core-year per datapoint is expensive.

An indication from the author what prime95 is intended to handle or known to handle would be good. Or anecdotal info about high values that have been completed. Unfortunately, P-1 shows up in assignments but not in work completed in the work distribution map of primenet.

There's this [URL]https://www.mersenne.org/report_exponent/?exp_lo=595000139&exp_hi=&full=1[/URL] but it doesn't indicate what program was used. [URL]https://www.mersenne.org/report_factoring_effort/?exp_lo=604000000&exp_hi=999999999&bits_lo=81&bits_hi=99&txt=1&tftobits=82[/URL] goes higher but again does not show which software was used.

I did a few ECM curves of F29 on a single core of a Skylake, with B1=50,000 and B2=100 * B1. There was 128 GB of memory on the machine, and for each curve it took about 78 hours to do stage 1 and 40 hours to do stage 2. If 280 curves were completed, this would complete t=25 (that is, the probability of missing a factor under 25 digits would be 1/e, for e=2.7182818...).

I stopped because it turns out that enough exhaustive search on k has been done to eliminate factors smaller than 26 digits. (mentioned [URL="http://mersenneforum.org/showthread.php?p=492270&postcount=25"]here[/URL]). So ECM for F29 only makes sense at the next level of B1=250,000 and B2=100 * B1, but each curve would take quite a lot longer and you'd need to do 640 of them to complete t=30. Maybe a few decades, if done on that single core.

For P−1 to make sense, obviously B1 and B2 would probably need to be quite a bit higher.

[QUOTE=kriesel;493227]I did not find in readme.txt, whatsnew.txt, or undoc.txt, an indication of what P-1 factoring's maximum exponent was. Is it the same as for LL or PRP test, 596M?[/QUOTE]

P-1 is limited by the FFTs, just like LL testing. Thus, 596M is the official maximum. The latest versions support about 920M for FMA3 cpus. This is not heavily advertised as it is painfully slow.

[QUOTE]When looking for probable primes, the following 3 options are available in prime.txt:
SilentVictoryPRP=0 or 1 (default is 1)
OutputPrimes=0 or 1 (default is 1)
OutputComposites=0 or 1 (default is 1)
Setting SilentVictory=0 will cause prime95 to make a continuous noise if a PRP is found.
Setting OutputPrimes=0 will cause prime95 to NOT output probable primes to results.txt.
Setting OutputComposites=0 will cause prime95 to NOT output composite PRP tests to results.txt.[/QUOTE]


I put OutputComposites=0 , but regardless of that fact: Prime95 still output composite to results.txt
Same is if I put OutputPrimes=1 , so Prime95 should in that case only output prp in results.txt
Last, it looks like both settings are related if SilentVictoryPRP is set to 0 or 1

The latest undoc.txt says:

[CODE]When Looking For Probable Primes, The Following 4 Options Are Available In Prime.Txt:
Silentvictoryprp=0 Or 1 (Default Is 1)
Outputprimes=0 Or 1 (Default Is 0)
Outputcomposites=0 Or 1 (Default Is 0)
Outputjson=0 Or 1 (Default Is 1)
Setting Silentvictoryprp=0 Will Cause Prime95 To Make A Continuous Noise If A Prp Is Found.
Setting Outputprimes=1 Will Cause Prime95 To Output A Non-Json Message For Probable Primes To Results.Txt.
Setting Outputcomposites=1 Will Cause Prime95 To Output A Non-Json Message For Composite Prp Tests To Results.Txt.
Setting Outputjson=0 Will Cause Prime95 To Not Output The Json Message For Prp Tests To Results.Txt.
[/CODE]

Is it the JSON text that you are seeing in results.txt? Are you running the latest build?

I think it is not JSON style


3036*140^5007+1 is a probable prime! Wg4: 271E271E,00000000