[QUOTE=hhh;102093]
Free-time-Veto again. If somebody wants to do P-1, he can, but then correctly, please. It's still fast enough.
[/QUOTE]

I agree.:smile:

I think there should be some LLR ranges in the LLR thread.

Do you plan to go beyond 5M? I might be able to make the sieve program faster, if you plan to.

I plan to, if necessary, and if the interest in the project makes it possible. I would wait a month, though, before we decide about that and before you start heavy work. Up to now I'm very happy it is starting well.

As for the LLR-ranges, I will put some as soon as ET_ has done his P-1 job. The sieve-file will be updated this evening.

H.

[QUOTE=hhh;102115]
As for the LLR-ranges, I will put some as soon as ET_ has done his P-1 job. The sieve-file will be updated this evening.

H.[/QUOTE]

Done! :razz:

Luigi

Linux version
 

I have implemented the algorithm described by Citrix in [url=http://www.mersenneforum.org/showpost.php?p=92720&postcount=9]this[/url] post, with two small improvements:

1. When generating the table of powers 2^1, 2^2, ..., 2^max_gap (all mod p) I take advantage of the regularity of the gaps. For the project data all gaps are multiples of 6, so only 2^6, 2^12, ..., 2^max_gap (all mod p) need to be generated.

2. There are many more small gaps than large gaps, so while almost all of the entries in the first half of the above table are needed, in the second half there are many unused entries. I fill every entry in the first half, but only fill the needed entries in the second half.

Source and some binaries are [url=http://www.geocities.com/g_w_reynolds/gcwsieve/]here[/url]. To sieve for factors p in the range P0 < p < P1 run `gcwsieve -i <infile> -o <outfile> -f <factors_file> -p <P0> -P <P1>'.

It is a bit slower than the modified MultiSieve with the Windows machine that I tested it on, but it is better than nothing for Linux users. It may be faster on 64-bit Linux. Very little testing has been done.

I will try to fix any bugs reported, but I don't plan to spend much time making it faster unless I think of a big improvement to the main algorithm. Feel free to use anything in the source to improve MultiSieve (A lot of it is based on rogue's code anyway).

[QUOTE=geoff;102260]I have implemented the algorithm described by Citrix in [url=http://www.mersenneforum.org/showpost.php?p=92720&postcount=9]this[/url] post, with two small improvements:

1. When generating the table of powers 2^1, 2^2, ..., 2^max_gap (all mod p) I take advantage of the regularity of the gaps. For the project data all gaps are multiples of 6, so only 2^6, 2^12, ..., 2^max_gap (all mod p) need to be generated.

2. There are many more small gaps than large gaps, so while almost all of the entries in the first half of the above table are needed, in the second half there are many unused entries. I fill every entry in the first half, but only fill the needed entries in the second half.
[/QUOTE]

Modified multisieve already does this. I just din't mention it in the algorithm.

[QUOTE=geoff;102271]Reserving 150-160.[/QUOTE]

Do you plan to use your client?

@hhh, please keep track of program used for each range, in case there is a bug in one of the programs and we need to recheck the ranges etc...

150-160 done, 13 factors (using gcwsieve 1.0.0).

Reserving 160-200.

[QUOTE=Citrix;102272]Do you plan to use your client?[/QUOTE]

Yes. I have a P3/800 that I can only get to run from a floppy disk, this project is ideal because the sieve and factors files are small. It does 62kp/s for the range above.

I get 62kps with your program on a 2.63 Ghz Intel celeron. What is wrong with the computer?

Any way to speed it up?

[QUOTE=Citrix;102465]I get 62kps with your program on a 2.63 Ghz Intel celeron. What is wrong with the computer?

Any way to speed it up?[/QUOTE]

It seems to run slow on P4 machines, I have added an SSE2 version of the main loop in version 1.0.1, but it is still quite slow with GCC 3.4 which is all I have for the Windows build.

The Linux binaries built with GCC 4.1 are faster, but even there the P3 makes the P4 look sick.

Multisieve is also very slow on P4's. I suggest P-1/LLR for all users with P4's.

Any way to use the linux version on windows?

[QUOTE=Citrix;102470]Multisieve is also very slow on P4's. I suggest P-1/LLR for all users with P4's.

Any way to use the linux version on windows?[/QUOTE]

It may be possible to compile with cygwin-gcc 4.1, but I don't have a cross-compiler, it needs to be done from Windows.