20170111, 22:31  #12  
Dec 2011
After milion nines:)
1,289 Posts 
Quote:
This is link ( on my Dropbox) https://www.dropbox.com/s/750j4s4aphyj475/d.pl?dl=0 

20170112, 09:39  #13 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
727 Posts 
Thx Pepi.
I tested 3 Bases (R738, R396 and R1023) from Riesel, and the same there. I´ll now test any sieve file (only .zip and suitable .txtfiles with k´s like 8) from the Riesel side. Last fiddled with by MisterBitcoin on 20170112 at 10:20 
20170112, 11:17  #14 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
727 Posts 
And it´s done.
Attached are factors for 57 bases, only on Riesel side. 
20170113, 07:40  #15 
May 2007
Kansas; USA
2^{2}·2,539 Posts 
If sr(x)sieve is modified to remove additional algebraic factors I expect that extensive beta and parallel testing be done before it is released to the public as an official version. It should be tested behindthescenes by multiple users without any increments done to official alpha version of the program(s). I would like to see detailed testing and test plans to see that no current processes have been affected. In other words I want to see it tested in a manner like a company would test a major program change as though it had major financial incentives to get it correct the first time. We had very serious issues previously when the first version of srsieve came out with algebraic factors being removed and I believe it caused a number of problems on several of our bases on this project.
Personally I would prefer that srsieve is not modified to remove any more algebraic factors than it already does. The simple ones for squares and cubes are enough. When the program was designed in the first place it was never intended to remove algebraic factors; only fixed numeric factors. Since Batalov has a script that removes more complex algebraic factors that is great and should be used. Sr(x)sieve should be left alone. The fact that it does not remove more complex algebraic factors is not a bug. Last fiddled with by gd_barnes on 20170113 at 07:41 
20170113, 09:47  #16 
Dec 2011
After milion nines:)
1,289 Posts 
Well it is Ok to think about it, but then we must ask one question: will we prefer time ( for solving bases) over security ( to dont remove something that should not be removed).
I am pretty new here, so my voice is maybe irrelevant,but I am sure that many of us has very limited resources. That is not problem when N is small and LLR is done in short amount of time. But I will never forget when I take S155 and Batalov script "saves me" from 4 month of 24/7 LLR in second , because factors was not removed from sieve file. So real question is : how to "force" people who sieving and people who take sieve to process to check before start. Peoples are lazy, they take sieve file, and split it , then start to LLR. They expect everything is made on sieve file. But it is not. And many months can be saved using script. So what I suggest is to modify Batalov script in small exe for Windows, so user have to input file name of sieve, press "Remove" and program write new output file(with removed factors), and file with factors ( if any) and that program to be uploaded to Boinc Confederation page. Nobody will search for small script on this forum, but if you put it there, and write what program do.. that will be different story. Last fiddled with by pepi37 on 20170113 at 09:51 
20170113, 20:20  #17 
Jul 2003
wear a mask
555_{16} Posts 
Please just leave sr(x)sieve alone. Reasons:
1. Since you need to sieve further for large exponents, the likelihood that you won't find a factor for one of the terms in the algebraic factorization goes down significantly. 2. Very light P1 factoring would further significantly reduce the likelihood of an unfactored, large exponent term with algebraic factors. 3. We have a program that will identify the algebraic factors; just use it. 4. The best software does one welldefined thing well. We have a sieve program; we have a program that identifies algebraic factors. Let's not kluge them together. 
20170113, 23:00  #18 
Dec 2011
After milion nines:)
1,289 Posts 

20170113, 23:05  #19  
Jul 2003
wear a mask
3×5×7×13 Posts 
Quote:
If you are a Windows exclusive person and a masochist, you could probably create prime95 input with Excel. Edit: I think srsieve comes with srfile; that will do it too. Last fiddled with by masser on 20170113 at 23:07 

20170114, 00:59  #20  
"Serge"
Mar 2008
Phi(3,3^1118781+1)/3
13×17×41 Posts 
Quote:
So, "The simple ones for squares and cubes are enough." I could agree with that, it would be a good start. "The fact that it does not remove P.S. If one removes cubes with P1, perhaps one is a masochist. You said it, not me. 

20170115, 08:45  #21 
May 2007
Kansas; USA
10156_{10} Posts 
OK, I likely misstated. I was not aware of which specific algebraic factors that it removes. If it only removes simple sqaures then I stand corrected.
Thanks for chiming in Masser. Clearly you think exactly as I do. The best programs do one thing extremely well. Last fiddled with by gd_barnes on 20170115 at 08:45 
20170115, 16:55  #22  
"Serge"
Mar 2008
Phi(3,3^1118781+1)/3
21545_{8} Posts 
Quote:
And yes, I have a code idea that implements that. After the initialization block where a bitmask for the n's is prepared, the code should check:  is k a cube? is c a cube (attention!  both negative and positive cube) ?  if yes, drop the bitmask bits for all n that are divisible by 3. Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
RSP Sieve Files for k*2^n1 from PrimeGrid  pinhodecarlos  Riesel Prime Search  90  20200711 15:38 
Generalizing algebraic factors on Riesel bases  gd_barnes  Conjectures 'R Us  31  20100406 02:04 
Constructing a sieve for trial factors  davieddy  Math  48  20090707 19:42 
program to verify factors found by sr(x)sieve?  mdettweiler  Software  16  20090308 02:06 
Algebraic factors  henryzz  ElevenSmooth  13  20071218 09:12 