![]() |
[quote=ET_;218522]Thank you, so Issue 2 is cleared :smile:
As for k*2^n+/-1, they are quite the numbers I'm sieving as possible Fermat factors... Luigi[/quote] Could you post one or more of the headers from the ABCD file here? (They're the lines that start with "ABCD".) It's possible that FermFact uses a nonstandard format as compared to the ones generally used by srsieve (which, as I understand it, is what ppsieve is designed to read--though I will disclaim that I have never used ppsieve myself). |
[QUOTE=mdettweiler;218525]Could you post one or more of the headers from the ABCD file here? (They're the lines that start with "ABCD".) It's possible that FermFact uses a nonstandard format as compared to the ones generally used by srsieve (which, as I understand it, is what ppsieve is designed to read--though I will disclaim that I have never used ppsieve myself).[/QUOTE]
Here they are: ABC file: [code] ABC $a*2^$b+1 1201 100016 1201 100076 1201 100148 1201 100168 1201 100268 1201 100360 1201 100388 1201 100416 [/code] ABCD file: [code] ABCD $a*2^100000+1 [1255] 18 20 52 8 4 120 44 34 18 62 10 30 42 [/code] Thanks :smile: Luigi |
[quote=ET_;218530]Here they are:
ABC file: [code] ABC $a*2^$b+1 1201 100016 1201 100076 1201 100148 1201 100168 1201 100268 1201 100360 1201 100388 1201 100416 [/code] ABCD file: [code] ABCD $a*2^100000+1 [1255] 18 20 52 8 4 120 44 34 18 62 10 30 42 [/code] Thanks :smile: Luigi[/quote] Aha, I think I see what the problem is. Your first ABC file should be fine, but the ABCD file is for a fixed-n format--ppsieve is designed for fixed-k sieves, so it won't understand that kind of notation. If you can convert it to an $a*2^$b+1 or k*2^$b+1 format, it will likely work. |
[QUOTE=mdettweiler;218541]Aha, I think I see what the problem is. Your first ABC file should be fine, but the ABCD file is for a fixed-n format--ppsieve is designed for fixed-k sieves, so it won't understand that kind of notation. If you can convert it to an $a*2^$b+1 or k*2^$b+1 format, it will likely work.[/QUOTE]
I'm afraid not... I tested the ABC file, and it is not correctly parsed either. :-( Luigi |
[quote=ET_;218569]I'm afraid not... I tested the ABC file, and it is not correctly parsed either. :-(
Luigi[/quote] Huh, that's strange. Since it's designed for k*2^n+1 numbers, I would think that it would surely work fine with them. Here, I've got another idea. Try replacing the "ABC $a*2^$b+1" in the first file with "0:P:0:2:257"--essentially changing the file to NewPGen format. Then, run it through the srfile program (included with the previously-linked srsieve) as: [I]srfile -a filename[/I] where filename is the name of your now-NewPGen format sieve file. srfile should then convert the file to an "ABCD k*2^$a+1" format file--which ppsieve surely should take. |
Hi, :smile:
[QUOTE]M( 70022021 )C, 0x8fc5e5f795149ff8, n = 4194304, MacLucasFFTW v8.1 Ballester[/QUOTE] |
How long did it take?
|
Nice, there are only 12 exponents above that available for double-checking, the highest of which is in 150M range. What is the upper limit of 8M fft?
|
Hi, lycorn
[QUOTE=lycorn;220346]How long did it take?[/QUOTE] 18 days.:smile: |
Hi, wavelet3000
[QUOTE=wavelet3000;220358]Nice, there are only 12 exponents above that available for double-checking, the highest of which is in 150M range. What is the upper limit of 8M fft?[/QUOTE] This program is memory eater.:down: I think GTX480 can support 16M fft. |
[QUOTE=msft;220368]I think GTX480 can support 16M fft.[/QUOTE]
Nope. On the GTX 480, the 8M FFT runs at 18.53 ms/iteration, but the 16M FFT gives cufftSafeCall() CUFFT error in the cufftPlan1d() call. |
| All times are UTC. The time now is 22:00. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.