Questions about 25.11 version

[agentcn]

I am freshman about Mersenne Prime. I want to ask some questions. Could you explain it? Please use simple language.
First, The version is 25.11.I check the “type of work to get” in the “worker windows”. There are some choices:
1、Whatever make the most sense
2、World record sized numbers to test
3、First time tests
4、Double-check tests
5、Trial factoring
6、P-1 factoring
7、Trial factoring to test
8、ECM on small Mersenne number
9、ECM on Fermat numbers
10、100,000,000 digit numbers to test
So, my questions are as follow：
A、 What are the exact meanings about 1 to 10?
B、 Which one is used for discovering new Mersenne Prime?Which one is used for proving new Mersenne Prime?
C、Which one is suit for common computers, high performance and older computer? Which algorithm is most fast？
D、How many memory is best for the software?
Second,“CPU affinity”:
1、Run on any CPU
2、smart assignment
How to set the CPU affinity?
Third, what are the meanings of the symbols in “PrefersWorkType”? Such as GIMPS, LL, LL-WR, ECM-F, LL-10M,NF?
Fourth, what are the meanings of the symbols in “currentWorkType”?Such as S1, LL?

[Uncwilly]

Here is a partial reply, copied from the Mersennewiki.org
These are variations of the above (and appear as listed in the Prime95 menus).

• Whatever makes the most sense: This lets the PrimeNet server choose what type of assignment the machine will receive.
• World Record sized number to test: The PrimeNet server will hand out a first time LL test that is larger than the currently known record prime.
• First time tests: An LL primality test on a number that hasn't previously been tested for primality.
• Double-check tests: The same test as the Lucas-Lehmer, but performed on a different machine and with a different offset. Ensures that a prime was not missed by error.
• Trial factoring: Checking for factors of the Mersenne number. A found factor will conclusively prove that the number is composite, which elminates the need to run a primality test.
• P-1 factoring: A second method that finds factors.
• Trial factoring to low limits: PrimeNet assigned LMH work. Shorter duration TF work.
• ECM on small numbers: Doing ECM factoring on Mersenne numbers with exponents below 1,000,000.
• ECM on Fermat numbers: Doing ECM factoring on Fermat numbers. (This work type does not contribute toward GIMPS main goals.)
• 100,000,000 digit numbers to test: Performing L-L primality testing on Mersenne numbers that have at least 100-million decimal digits. A prime number found by this worktype would eligible for the next EFF prize.

If you want to discover new Mersenne Primes choose any of the following: First time, world record, or 100,000,000.

The algorithms are all suited to the specific task and are all fast.
Older -> newer (this is only an approximate list)
TF to low limits
ECM on small numbers
TF
Double check
P-1
First time / world record (these are basically the same)
100,000,000 (only if you really want to do this, it will take 12-14 months per test.)

Somebody else can tell you about affinity (I never have changed the default settings).

Third, what are the meanings of the symbols in “PrefersWorkType”? Such as GIMPS, LL, LL-WR, ECM-F, LL-10M,NF?
Fourth, what are the meanings of the symbols in “currentWorkType”?Such as S1, LL?

Those just show what type of work (see the explanation above) that the machine wants or uses. GIMPS=what ever makes the most sense, LL=first time, LL-10M=first time on numbers >10million digits.

Originally Posted by Uncwilly

Here is a partial reply, copied from the Mersennewiki.org
These are variations of the above (and appear as listed in the Prime95 menus).

• Whatever makes the most sense: This lets the PrimeNet server choose what type of assignment the machine will receive.
• World Record sized number to test: The PrimeNet server will hand out a first time LL test that is larger than the currently known record prime.
• First time tests: An LL primality test on a number that hasn't previously been tested for primality.
• Double-check tests: The same test as the Lucas-Lehmer, but performed on a different machine and with a different offset. Ensures that a prime was not missed by error.
• Trial factoring: Checking for factors of the Mersenne number. A found factor will conclusively prove that the number is composite, which elminates the need to run a primality test.
• P-1 factoring: A second method that finds factors.
• Trial factoring to low limits: PrimeNet assigned LMH work. Shorter duration TF work.
• ECM on small numbers: Doing ECM factoring on Mersenne numbers with exponents below 1,000,000.
• ECM on Fermat numbers: Doing ECM factoring on Fermat numbers. (This work type does not contribute toward GIMPS main goals.)
• 100,000,000 digit numbers to test: Performing L-L primality testing on Mersenne numbers that have at least 100-million decimal digits. A prime number found by this worktype would eligible for the next EFF prize.

If you want to discover new Mersenne Primes choose any of the following: First time, world record, or 100,000,000.

The algorithms are all suited to the specific task and are all fast.
Older -> newer (this is only an approximate list)
TF to low limits
ECM on small numbers
TF
Double check
P-1
First time / world record (these are basically the same)
100,000,000 (only if you really want to do this, it will take 12-14 months per test.)

Somebody else can tell you about affinity (I never have changed the default settings).

Those just show what type of work (see the explanation above) that the machine wants or uses. GIMPS=what ever makes the most sense, LL=first time, LL-10M=first time on numbers >10million digits.

"World Record sized number to test" is same as "First time tests"?

[KingKurly]

agentcn: Consider upgrading to version 26.5, it is new and better and came out just a few days ago.

Uncwilly: I notice the Wiki said that ECM small gives out exponents lower than 1M. I don't think that's necessarily true, I think I've gotten exponents as high as 5M on machines with more RAM. (agentcn, this doesn't really affect you, but I still recommend upgrading to 26.5)

[cheesehead]

Originally Posted by agentcn

1、Whatever make the most sense

In addition to what Uncwilly wrote about this type:

The PrimeNet server chooses what type to assign based on your computer's CPU type and speed, how much memory you have allocated to the GIMPS task and what worktype is most useful to the GIMPS project at that time.

If your CPU is a recent model (= "high-performance" in your question C), PrimeNet will probably assign worktype:
#2, #3 or #5 if you have only a small amount of memory allocated (PrimeNet will choose which one would be most useful to GIMPS at that time), or
#6 if you have a large amount of memory allocated.

If your CPU is not very recent, but not very old or slow either (= "common" in your question C), PrimeNet will probably assign worktype:
#4 of #5 if you have only a small amount of memory allocated (PrimeNet will choose which one would be most useful to GIMPS at that time), or
#6 if you have a large amount of memory allocated.

If your CPU is older and/or slower than most others used in GIMPS (= "older" in your question C), PrimeNet will probably assign worktype #5 or #7 (according to which one would be most useful to GIMPS at that time).

2、World record sized numbers to test

As Uncwilly wrote, PrimeNet will assign a first time LL test on an exponent that is larger than the currently known record prime.

But note that between the time that assignment is made and the time you complete the test, someone else might have found a Mersenne prime that sets a new world record higher than the record was at the time of your assignment, perhaps higher than the exponent you were assigned.

So, we can't absolutely guarantee that your assignment could find a new world record prime at the time you finish your assignment. There will an excellent chance, but not a 100% guaranteed chance.

BTW, it's quite an honor to be the discoverer of any new Mersenne prime, regardless of its size. Fewer than 50 people have ever done that, and all such discoverers are added to the list that is famous.

3、First time tests
4、Double-check tests
< snip >
10、100,000,000 digit numbers to test

In worktypes #3, #4 and #10, your assignment might also include a preliminary TF (trial factoring) or P-1 factoring test before it starts the main LL test. Don't be alarmed if you see that your computer has started trial factoring or P-1 factoring even though you asked for a first-time LL test or a double-check LL test.

In each case (TF or P-1), if your computer finds a factor that means you've saved yourself and GIMPS a lot of time, because then the long LL test is no longer needed! Also, once your computer reports that factor to PrimeNet, it will get another exponent assignment much sooner than if you had done the long LL test.

If your computer doesn't find a factor during TF or P-1, you will have saved someone else from doing the TF or P-1 later, and it will proceed to start the first-time LL test or double-check LL test.

So, my questions are as follow：
< snip >
Which one is used for proving new Mersenne Prime?

Once someone reports discovering a new Mersenne prime with a first-time test, two or more people will run double-checks on very fast computer systems that are not ordinarily used for GIMPS.

C、Which one is suit for common computers, high performance and older computer?

See what I wrote in my first comment above about:

"your CPU is a recent model" = high performance

"your CPU is not very recent, but not very old or slow either" = common

"your CPU is older and/or slower than most others used in GIMPS" = older

Which algorithm is most fast？

For every worktype, GIMPS uses the fastest algorithm that is known for that type of work.

[Rodrigo]

@Uncwilly
@cheesehead

Excellent rundown of the various choices and possibilities.

Rodrigo

[Mr. P-1]

Originally Posted by Unregistered

"World Record sized number to test" is same as "First time tests"?

No. Currently there are 1,919 exponents below M43112609 which have never had a first-time test. Most or all of these are assigned, but if they expire or are returned untested, then they will be available for assignment as first-time test, but not as World-record tests.

[cheesehead]

Originally Posted by Unregistered

"World Record sized number to test" is same as "First time tests"?

Another way 2 put it:

When you ask for "First time test", your assignment could be either under or over the current world record.

When you ask for "World Record sized number to test", your assignment will be over the current world record.

[KingKurly]

Originally Posted by cheesehead

When you ask for "World Record sized number to test", your assignment will be over the current world record.

...at the time the assignment is made.

It'd be pretty much impossible to offer anything stronger than that, without slowing up the project dramatically.