20080417, 15:31  #1  
Quasi Admin Thing
May 2005
3CC_{16} Posts 
Riesel base 3 reservations/statuses/primes
Completed and in process reservations for Riesel base 3 posted from the previous "Riesel base 3 attack" subforum":
Code:
krange nrange status 4M2.147G 500K1M completed by BOINC 4M10M 100K500K completed by henryzz 10M20M 100K425K completed by henryzz 10M20M 425K500K completed by PuzzlePeter 20M6G 100K500K completed by BOINC 6G10G 100K250K completed by BOINC >63G 100K500K completed by MisterBitcoin <100M 25K100K completed by minidrive I 100M200M 25K100K completed by KEP 200M250M 25K100K completed by Mattyp101 250M500M 25K100K completed by grueny 500M2G 25K30K completed by VBCurtis 500M2G 30K100K completed by Lennart 2G2.05G 25K100K completed by VBCurtis 2.05G2.5G 25K100K completed by PuzzlePeter 2.5G8G 25K100K completed by Lennart 8G21G 25K100K completed by KEP 21G22G 25K100K completed by PuzzlePeter 22G23G 25K50K completed by Siemelink 22G23G 50K100K completed by BOINC 23G25G 25K100K completed by PuzzlePeter 25G60G 25K50K completed by rogue 25G35G 50K100K completed by BOINC 35G45G 50K100K completed by rogue 45G46G 50K100K completed by pokemonlover123 46G60G 50K100K completed by rogue 60G63G 25K100K completed by VBCurtis >63G 25K100K completed by MyDogBuster <500M 25K completed by KEP 500M510M 25K completed by michaf 510M520M 25K completed by Flatlander 520M570M 25K completed by michaf 570M580M 25K completed by MiniGeek 580M600M 25K completed by KEP 600M650M 25K completed by Flatlander 650M660M 25K completed by henryzz 660M700M 25K completed by Flatlander 700M800M 25K completed by gd_barnes 800M810M 25K completed by MiniGeek 810M820M 25K completed by gd_barnes 820M830M 25K completed by henryzz 830M2G 25K completed by PuzzlePeter 2G2.05G 25K completed by VBCurtis 2.05G2.5G 25K completed by gd_barnes 2.5G3G 25K completed by Lennart 3G11G 25K completed by PuzzlePeter 11G12G 25K completed by KEP 12G13G 25K completed by PuzzlePeter 13G14G 25K completed by KEP 14G15G 25K completed by PuzzlePeter 15G60G 25K completed by KEP 60G63G 25K completed by rogue >63G 25K completed by KEP Quote:
1. test 2,500,000 equal k's for being PrP up to n=25,000 (commandline: "input.txt lxxM.txt") 2. Verify those PrP (commandline: "pfgw.log tc") 3. List all those k's remaining, and make them publicly availeable on my google page Hope that explained, but the short answer to your question Gary is: Yes that was exactly what I am doing regards my attack on the Base3 riesel. Now I've a question. Is there anyway to make WinPFGW work a list of k's from e.g. n=25,001 to n=100,000? Also to the developers of WinPFGW, it would be very nice if you could make a way to avoid save a log file with factors and such stuff, and make a way to save only the Primes, the PrP and k or n remaining. I think that such a k or n function should be asked to save only for every 10 % which in my example would mean at n: 2,500 5,000 7,500 10,000 12,500 15,000 17,500 20,000 22,500 25,000 That way a lot of storage (and writing time) will be saved and it will be easier to list the k's missing and compare the number to the amount of primes found :) Thanks everyone and happy holidays. Regards KEP Last fiddled with by gd_barnes on 20211215 at 08:50 Reason: update status 

20080417, 17:50  #2 
Quasi Admin Thing
May 2005
972_{10} Posts 
Everyone interested can follow the progress in the Riesel Base 3 conjecture attack on following site: (none)
Expect it to be updated no more than in the weekends or extended weekends, so in case of vacation it can be more than a week or 2 or 3 weeks before I gets to update the latest progress. Thanks for understanding. I know by the way that the webpage is crap, but I doesn't have much experience using google pages yet, and does it really matter ;), there is the most nescessary to follow the progress. Take care everyone! Last fiddled with by gd_barnes on 20081217 at 12:44 Reason: Remove reference to invalid web page 
20080419, 05:28  #3  
May 2007
Kansas; USA
2964_{16} Posts 
Quote:
Yes, you would just tell it to do so in your script. But doing so would be very inefficient. Sieving should be done first for nvalues that are so high. After sieving, you could then use LLR or PFGW (or Phrot) to do primality testing. Gary Last fiddled with by gd_barnes on 20080419 at 05:35 

20080419, 06:11  #4 
May 2007
Kansas; USA
2^{2}·3·883 Posts 
On April 13th, I got an Email from KEP listing the primes for Riesel base 3 up to k=100K. ZERO k's were remaining. The reservation update and 10 highest primes are shown on the web pages.
Gary 
20080425, 21:43  #5 
Quasi Admin Thing
May 2005
2^{2}·3^{5} Posts 
The Riesel base 3 is tested up to k=2M and n=25k. There is a 12 remaining k's and the ranges up to 100M is in progress at once. I found that taking the k to only n=5,000 and then do sieve of the remaining k's is much more efficient (about 90% faster). Is anyony by the way knowing of a great way to sieve many different k values from n=5,001 to n=25,000? I used to use NewPGen, but it requires a great deal of manual work to prepare the sieve files. Once the sieve files is prepared Sr1sieve can be used, using a .bat file and then sieveing will be rather easy, but anyone with a great idea to speedup and reduce the amont of manual work, please consider replying to me :)
On other notice to gary: I'm not working on the base 12 k=404 (sierpinski) since it appears that my reservation did not come through, and also I feel like wanting to do more somewhere else e.g. Base 3 Riesel Conjecture :) 
20080426, 01:50  #6  
A Sunny Moo
Aug 2007
USA (GMT5)
1869_{16} Posts 
Quote:
As for your base 12 k=404 reservation not going through, Gary is on vacation so though he can get on mersenneforum a couple times a day, he can't update any of the web pages. So, even though it's not marked on the page yet, your reservation is still OKthough if you don't want to search it after all that's fine too. Last fiddled with by mdettweiler on 20080426 at 01:51 

20080426, 05:47  #7  
Quasi Admin Thing
May 2005
2^{2}×3^{5} Posts 
Quote:
About the base 12 attack, I feel like its better to release it, since I've a lot of testing to do to find the most efficient way to attack the base3 problem. And about Gart being on vacation (hope that I was Gary now) I didn't know that, so thanks for telling me. So to sum up, I'm releasing the Base 12 sierpinski range for others to work on, and will now only consider to find the most efficient way to attack the base 3 riesel conjecture. The most efficient way seems to be as follows: 1. Use WinPFGW to n=2,500 2. Use srsieve from n=2,501 to n=25,000 3. To start out by testing the lowest k. If it fails to prime, then move all k's that somewhere is the product of 3 of tested k, which has no n value higher than n=25,000(the times that k has been multiplied by 3). Doing this requires some manual work, but saves up to 8 hours LLR testing per k :) If you have any questions about this please feel free to ask them or if you feels like joining the war please consider help :) Go to to this page: (none) to check the progress and what I'm up to with this base. On this page you can also see what battleplans (I know dont lay out your plans in the open for your enemy to see) on how to combat this k the fastest :) Thank you and take care! KEP Last fiddled with by gd_barnes on 20081217 at 12:44 Reason: Remove reference to invalid web page 

20080426, 05:52  #8 
Oct 2006
100000011_{2} Posts 
with large number of k (>300), forget about sr2sieve ! only use srsieve
i have 2000k left in my base 31 file and i can't use sr2 sieve (after 300k, i'm at 1.5 GB of memory used) the problem is the legendre symbol table that is too big ... 
20080426, 06:33  #9  
Quasi Admin Thing
May 2005
2^{2}×3^{5} Posts 
Quote:
1. Maybe you can PM me how you got started using srsieve, since I don't seem to be able to get it started. So would you be kind enough to tell me how you got started?... you doesn't have to PM me you can also tell me here :) 2. Also can't sr2sieve be told not to build the legendre table if it seems to take up all the memory? Now about my first question to Mr a :), I found the answer myself, and I'm assuming that I should be able to go directly to sr2sieve.exe, if this is wrong please correct me. 

20080426, 06:56  #10  
A Sunny Moo
Aug 2007
USA (GMT5)
3·2,083 Posts 
Quote:
Of course, though, as you said, if you have too many k's in the sieve, memory usage becomes a problem. In that case, of course, srsieve is your only option. Quote:
1) In your srsieve folder, make a new text file called "equations.txt" or something along those lines. Open it in a text editor, and list each k you want in the sieve on its own line, like this: Code:
100*3^n1 200*3^n1 300*3^n1 2) Make another text file in your srsieve folder, named "run_srsieve.bat" or something like that. Open it and type the following line, substituting various values where specified: Code:
srsieve m 4e9 n lower end of nrange N upper end of nrange equations.txt 3) Doubleclick on run_srsieve.bat, and you'll see a DOS window pop up, wherein srsieve displays its output. It outputs status reports every minute; below 4G it won't display factors found, but once it gets past 4G it will show every factor found on screen. (Earlier on in the sieve you'll want to minimize the window when you're not watching it, so the computer won't waste CPU time trying to display the factors on screen.) To interrupt srsieve press CtrlC, and the DOS window will close. 4) If you interrupt srsieve, it will generate a file called srsieve.out (it also generates this file for backup purposes every 60 minutes even if you don't interrupt it). Rename this to something else, so that it won't write on top of it when you continue the sieve. (I usually name my partiallysieved files based on the datefor example, "Apr261.txt" if it's the first file I saved on April 26.) Then, when you want to start srsieve again and continue the sieve, open run_srsieve.bat in a text editor, and change the command line therein to the following: Code:
srsieve m 4e9 name of previous sieve file 5) Srsieve will output p/sec. and sec./factor rates onscreen, updated every minute. When you've reached a satisfactory factor rate and want to stop the sieve so you can start the PRPing, press CtrlC to halt srsieve as before. (There's no need to rename the output file this time, you can leave it at srsieve.out now.) Create a new text file called "srfile.bat". Open it in a text editor, and enter the following line: Code:
srfile G srsieve.out 6) You can now go ahead and delete all your intermediate sieve files (there will be one for each time you stopped and restarted srsieve), as well as srsieve.log if you want. You may want to keep the batch files, just remember to change them to the appropriate new values for the next sieve you do. Hope this helps! Anon 

20080426, 07:24  #11 
Quasi Admin Thing
May 2005
2^{2}×3^{5} Posts 
@ anon:
Thanks for your tip, it actually worked and it appears to be at least 10 times as efficient as sieving all terms individually, I'm actually quite sure that now a further speedincrease will be seen :) So on behalf of myself and those who will join me in the future (maybe rieselsieve once they complete their base 2 mission) I give you my true and deep felt thank you :) To the rest of you, good luck on what ever part of these conjectures you are struggeling with :) 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bases 632 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  1415  20220125 19:13 
Bases 251500 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  2377  20220125 01:08 
Bases 33100 reservations/statuses/primes  Siemelink  Conjectures 'R Us  1715  20220123 14:23 
Bases 101250 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  967  20220123 14:21 
Sierp base 3 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  405  20211029 14:34 