Run P-1 twice (or 1.5x)?
 

I sometimes get LL asignments for exponents that have only experienced stage 1 of P-1. I know that PrimeNet chooses a higher B1 value then. Wouldn't it make sense to run only stage 2 again on my PC which offers enough RAM to Prime95? I thought most factors were found in stage 2...
Moreover, I cannot get manual assignments or use undoc options to manually do only stage 2...
Any thoughts? It's a question of probability.

To run stage 2, you have to have an end result from stage 1. I think for GIMPS numbers this is several MB. It should be possible to run stage 2 on a different computer from stage 1, but you can't only run stage 2.
I think about half of the factors should be found in stage 2 (when it's run).

[QUOTE=Brain;242513]I sometimes get LL asignments for exponents that have only experienced stage 1 of P-1. I know that PrimeNet chooses a higher B1 value then. Wouldn't it make sense to run only stage 2 again on my PC which offers enough RAM to Prime95? I thought most factors were found in stage 2...
Moreover, I cannot get manual assignments or use undoc options to manually do only stage 2...
Any thoughts? It's a question of probability.[/QUOTE]
You can get estimates of the probabilities here: [url]http://mersenne-aries.sili.net/prob.php[/url]

Consensus is that doing more P-1 is usually not worth it, unless it's a case like [URL="http://www.mersenne.org/report_exponent/?exp_lo=48090437&exp_hi=&B1=Get+status"]48090437[/URL], which had been done to B1=2500, B2=5000.

I have just received my first P-1 test and it has gone to stage 2. I allocate 512MB of memory by default. Upon completion, it stated,

[code]
[Work thread Dec 19 04:22] Starting stage 1 GCD - please be patient.
[Work thread Dec 19 04:24] Stage 1 GCD complete. Time: 112.506 sec.
[Work thread Dec 19 04:24] Using 498MB of memory. Processing 19 relative primes (0 of 480 already processed).
[Work thread Dec 19 04:33] M47907107 stage 2 is 1.38% complete. Time: 548.246 sec.
[/code]

Would it help or adversely affect the outcome if I bumped it up to 1024 (1GB) of RAM? How do I know the optimal memory allocation for a given test? Are there only two stages to this process (is it like factoring but with extra work?)?

[QUOTE=imwithid;242565]I have just received my first P-1 test and it has gone to stage 2. I allocate 512MB of memory by default. Upon completion, it stated,

[code]
[Work thread Dec 19 04:22] Starting stage 1 GCD - please be patient.
[Work thread Dec 19 04:24] Stage 1 GCD complete. Time: 112.506 sec.
[Work thread Dec 19 04:24] Using 498MB of memory. Processing 19 relative primes (0 of 480 already processed).
[Work thread Dec 19 04:33] M47907107 stage 2 is 1.38% complete. Time: 548.246 sec.
[/code]

Would it help or adversely affect the outcome if I bumped it up to 1024 (1GB) of RAM?[/QUOTE]

It will have no effect on the final result, but you will complete the computation a little more quickly.

If you had increased the memory before Stage 1 had completed, it would have recomputed the bounds, resulting in a slightly deeper P-1 test and giving you a slightly greater chance of finding a factor.

[QUOTE]How do I know the optimal memory allocation for a given test? Are there only two stages to this process.[/QUOTE]

There are only two stages, and either is capable of yielding a factor. The rule of thumb for memory is "as much as you can let it have, without thrashing".

[QUOTE](is it like factoring but with extra work?)?[/QUOTE]

I'm not sure I understand the question. Trial Factorisation will quickly find a small factor, if there is one. P-1 gives a chance of finding a much larger factor. They're "like" each other in the sense that the both find factors, but different in that they use different methods and find different factors.

Mr. P-1 beat me to it, with a better answer than mine would have been, but I'll stick my beak in anyway.
[QUOTE=imwithid;242565]Would it help or adversely affect the outcome if I bumped it up to 1024 (1GB) of RAM? How do I know the optimal memory allocation for a given test?[/QUOTE]
Agreed - more is better, if you can.

On the other hand, what's a "reasonable" minimum that lets prime95/mprime work "reasonably" well? Perhaps you regularly use an application that runs more slowly if it has less memory available to it, or maybe you just want to be conservative. Well, apparently 500MB is good, according to [URL="http://www.mersenneforum.org/showthread.php?p=152423#post152423"]this[/URL].

[QUOTE]Are there only two stages to this process (is it like factoring but with extra work?)?[/QUOTE]
Yes - two stages, & yes - they're similar in that they both have a chance of finding a factor. [URL="http://www.mersenne.org/various/math.php"]The math page[/URL] has a good, short description of each.

[QUOTE=markr;242570]On the other hand, what's a "reasonable" minimum that lets prime95/mprime work "reasonably" well? Perhaps you regularly use an application that runs more slowly if it has less memory available to it, or maybe you just want to be conservative. Well, apparently 500MB is good...[/QUOTE]

A reasonable minimum, in my view, is any amount enough to get you a high memory plan for stage two. How much that is depends upon the FFT size, whether you have more than one worker thread, and what the other threads are doing.

You know you have a high memory plan when it says "(xx of 480 already processed)". If there is any number other than 480, then you are on a restricted memory plan, and would do well to increase the memory for the next exponent. (I don't think it would greatly help the one you're on, because you can't change plans midway.)

Beyond that, I try to arrange to do a number of relative primes per pass that either divides 480 exactly or with a large remainder. 19 is a "miss" in this respect because 480/19 = 25 remainder 5.

If imwithid is comfortable committing 1GB, then I suggest aiming at 40 relative primes per pass.

[QUOTE=markr;242570][URL="http://www.mersenne.org/various/math.php"]The math page[/URL] has a good, short description of each.[/QUOTE]

The wiki has a excellent albeit more technical explanation of the [url=http://www.mersennewiki.org/index.php/P-1_Factorization_Method]P-1 method[/url].

[QUOTE=imwithid;242565](is it like factoring but with extra work?)?[/QUOTE]Just to clear up some terminology:

There are several different methods for factoring (trying to find a factor). Many messages in Prime95 that say "factoring" really should say "trial factoring" to avoid confusion, because they're referring to only that method. In prime95's early stages, trial factoring was the only factoring method built into it; those messages date from then.

Two other factoring methods, P-1 and ECM, have been added to prime95 since then. Messages refer to them as "P-1" and "ECM", without the word "factoring", but they both are factoring methods (and both have two stages).