mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2021-02-02, 09:52   #452
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

3·7·29 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
Extracting it actually locked up my desktop (ran out of memory), forcing me to reboot, and killed my mprime P-1 job on my new 64 GB RAM laptop (same reason), so I had to make the necessary trimming in the standard Unix line editor ed (which still took up over 6 GB of RAM even with no visual display).
Quote:
Originally Posted by storm5510 View Post
I wouldn't think you would be having problems with 64GB or RAM. I can open any of the archives and view the details with 16GB of RAM on my Windows 10 machine. You mention running a server of some type. If this is on the same system, then it may be using up a lot of RAM.
I guess I should clarify. The PRPNet servers (most of the RAM hit is actually the MySQL server) run on the desktop, which is 11 years old and only has 8 GB of RAM. I tried to open it using a graphical editor, and it locked the machine up. (i.e. It wasn't the extraction, it was opening the text file that froze it.) While I was waiting for it to respond (it never did, so I rebooted it), I re-downloaded the file to the laptop (with 64 GB of RAM), extracted it, and tried to open it in the graphical editor (Kate, to be specific, since these are Kubuntu systems). It ballooned to about 45 GB of RAM usage, killing the mprime instance running a P-1 job (which was allocated 32 GB) in the process, before I killed the editor and ended up using ed. I didn't actually have a copy of srfile on that laptop (I just set it up a week ago and haven't gotten around to copying all of the important executables), so I figured it was an excuse to use ed (which I have an odd obsession with; I'm on their mailing list and maintain a GitHub mirror of the code, despite only having a basic proficiency with it).

Long story short, please do use srfile.

Last fiddled with by Happy5214 on 2021-02-02 at 09:54
Happy5214 is offline   Reply With Quote
Old 2021-02-02, 15:40   #453
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009

111100101102 Posts
Default

Quote:
Originally Posted by kar_bon View Post
To give more hints:
- the link Happy given is the thread, so you have to go to the last post in it from 2021-01-19 (although the suspended sieves didn't changed since then in the first post)
- next download rsp1M_20150702.abcd (suspended sieves): this file contains all sieves for Riesel 3<k<10000 and n<1M
- copy in a directory, unzip it and use srfile.exe to call:
srfile -g rsp1M_20150702.abcd
(output looks: Read 145955447 terms for 4998 sequences from ABCD format file `rsp1M_20150702.abcd'.)
to create every sieve file for all k's separately
- grap the t17_b2_k6927.npg to use this as input for LLR
it contains 23784 n-values <1M for k=6927

For higher n-values use the "rsp2M_xxx", "rsp3M_xxx" and so on.
Excellent! Thank you so much.

In the wiki, k=6927 shows n=400e3 in the "max n" column. The largest value in the "primes for n" column is 743,481. Removing everything from the sieve < this value leaves 6,077 terms. This is where I will start. If this is not correct, then let me know.
storm5510 is offline   Reply With Quote
Old 2021-02-03, 01:56   #454
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009

2×971 Posts
Default

Quote:
Originally Posted by storm5510 View Post
..In the wiki, k=6927 shows n=400e3 in the "max n" column. The largest value in the "primes for n" column is 743,481. Removing everything from the sieve < this value leaves 6,077 terms. This is where I will start. If this is not correct, then let me know.
A correction: I went back to the "max n" in the wiki, 400e3, and started there.
storm5510 is offline   Reply With Quote
Old 2021-03-29, 10:29   #455
manrus
 
"Dmitrii"
Mar 2021
St.Petersburg,Russia

5 Posts
Default

Does it mean if I sieve k=3317 n=4e6-43e5 up to 10e12 then primegrid sieve files aren't needed?
manrus is offline   Reply With Quote
Old 2021-03-29, 20:37   #456
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

22·2,593 Posts
Default

Quote:
Originally Posted by manrus View Post
Does it mean if I sieve k=3317 n=4e6-43e5 up to 10e12 then primegrid sieve files aren't needed?

You should use the PrimeGrid sieve file for testing. All k<10000 for n=1 to 3M are sieved to P=100P (100e15). The file will save you a lot of time in sieving and testing.
gd_barnes is offline   Reply With Quote
Old 2021-03-30, 07:21   #457
manrus
 
"Dmitrii"
Mar 2021
St.Petersburg,Russia

1012 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
You should use the PrimeGrid sieve file for testing. All k<10000 for n=1 to 3M are sieved to P=100P (100e15). The file will save you a lot of time in sieving and testing.
So k=3317 n>= 4M sieved up to 400e15?

I opened rsp5M_20150702.abcd and see "..// Sieved to 1000000000 with srsieve". What it is mean?
manrus is offline   Reply With Quote
Old 2021-03-30, 07:30   #458
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

22×2,593 Posts
Default

Quote:
Originally Posted by manrus View Post
So k=3317 n>= 4M sieved up to 400e15?

I opened rsp5M_20150702.abcd and see "..// Sieved to 1000000000 with srsieve". What it is mean?
rsp4M = 3M to 4M
rsp5M = 4M to 5M
rsp6M = 5M to 6M

It is n=3M to 6M that are sieved to 400e15.
(n=0 to 3M are sieved to 100e15.)

Ignore the header line in the sieve file. It means nothing. Pay attention to what it says in that post. You can tell by the fewer number of tests in each range than you would get by sieving yourself.
gd_barnes is offline   Reply With Quote
Old 2021-03-30, 07:50   #459
manrus
 
"Dmitrii"
Mar 2021
St.Petersburg,Russia

5 Posts
Smile

gd_barnes, Thank you a lot
manrus is offline   Reply With Quote
Old 2021-04-26, 12:19   #460
manrus
 
"Dmitrii"
Mar 2021
St.Petersburg,Russia

58 Posts
Default

K=3317

Checked 1M, 48 primes:
Quote:
3317*2^2-1 is prime! (5 decimal digits, Trial divisions) Time : 0.000 ms.
3317*2^34-1 is prime! (14 decimal digits, APRCL test) Time : 0.194 ms.
3317*2^44-1 is prime! (17 decimal digits, APRCL test) Time : 0.646 ms.
3317*2^50-1 is prime! (19 decimal digits, APRCL test) Time : 0.405 ms.
3317*2^72-1 is prime! (26 decimal digits, APRCL test) Time : 0.723 ms.
3317*2^74-1 is prime! (26 decimal digits, APRCL test) Time : 0.744 ms.
3317*2^86-1 is prime! (30 decimal digits, APRCL test) Time : 1.300 ms.
3317*2^90-1 is prime! (31 decimal digits, APRCL test) Time : 1.354 ms.
3317*2^92-1 is prime! (32 decimal digits, APRCL test) Time : 1.348 ms.
3317*2^124-1 is prime! (41 decimal digits, APRCL test) Time : 3.772 ms.
3317*2^162-1 is prime! (53 decimal digits, APRCL test) Time : 6.736 ms.
3317*2^282-1 is prime! (89 decimal digits, APRCL test) Time : 27.656 ms.
3317*2^416-1 is prime! (129 decimal digits, APRCL test) Time : 86.887 ms.
3317*2^450-1 is prime! (139 decimal digits, APRCL test) Time : 117.059 ms.
3317*2^570-1 is prime! (176 decimal digits, APRCL test) Time : 237.570 ms.
3317*2^764-1 is prime! (234 decimal digits) Time : 2.979 ms.
3317*2^866-1 is prime! (265 decimal digits) Time : 5.717 ms.
3317*2^1056-1 is prime! (322 decimal digits) Time : 3.758 ms.
3317*2^1078-1 is prime! (329 decimal digits) Time : 5.789 ms.
3317*2^1124-1 is prime! (342 decimal digits) Time : 3.393 ms.
3317*2^1398-1 is prime! (425 decimal digits) Time : 4.606 ms.
3317*2^1540-1 is prime! (468 decimal digits) Time : 4.558 ms.
3317*2^2534-1 is prime! (767 decimal digits) Time : 4.232 ms.
3317*2^4174-1 is prime! (1261 decimal digits) Time : 5.732 ms.
3317*2^4638-1 is prime! (1400 decimal digits) Time : 6.827 ms.
3317*2^7720-1 is prime! (2328 decimal digits) Time : 12.427 ms.
3317*2^19450-1 is prime! (5859 decimal digits) Time : 49.236 ms.
3317*2^20710-1 is prime! (6238 decimal digits) Time : 69.967 ms.
3317*2^21194-1 is prime! (6384 decimal digits) Time : 66.265 ms.
3317*2^21394-1 is prime! (6444 decimal digits) Time : 66.267 ms.
3317*2^24130-1 is prime! (7268 decimal digits) Time : 71.892 ms.
3317*2^27172-1 is prime! (8184 decimal digits) Time : 105.724 ms.
3317*2^30810-1 is prime! (9279 decimal digits) Time : 119.536 ms.
3317*2^30884-1 is prime! (9301 decimal digits) Time : 120.821 ms.
3317*2^41054-1 is prime! (12363 decimal digits) Time : 262.599 ms.
3317*2^80706-1 is prime! (24299 decimal digits) Time : 2.803 sec.
3317*2^86212-1 is prime! (25956 decimal digits) Time : 2.970 sec.
3317*2^90984-1 is prime! (27393 decimal digits) Time : 3.200 sec.
3317*2^93458-1 is prime! (28138 decimal digits) Time : 3.271 sec.
3317*2^149264-1 is prime! (44937 decimal digits) Time : 5.064 sec.
3317*2^152506-1 is prime! (45913 decimal digits) Time : 5.005 sec.
3317*2^239112-1 is prime! (71984 decimal digits) Time : 12.113 sec.
3317*2^258818-1 is prime! (77916 decimal digits) Time : 17.224 sec.
3317*2^304392-1 is prime! (91635 decimal digits) Time : 18.408 sec.
3317*2^461216-1 is prime! (138844 decimal digits) Time : 40.613 sec.
3317*2^552272-1 is prime! (166254 decimal digits) Time : 61.995 sec.
3317*2^685360-1 is prime! (206318 decimal digits) Time : 87.721 sec.
3317*2^962150-1 is prime! (289640 decimal digits) Time : 95.252 sec.
2M done 33,68%
3M started
manrus is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
16e Post Processing Progress pinhodecarlos NFS@Home 8 2018-11-28 13:45
Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve mickfrancis Factoring 2 2016-05-06 08:13
Sierpinski/Riesel Base 5: Post Primes Here robert44444uk Sierpinski/Riesel Base 5 358 2008-12-08 16:28
Small Primes Housemouse Math 2 2008-06-04 05:23
POST PRIMES you've found here, and name or prover code TTn 15k Search 415 2006-03-02 21:17

All times are UTC. The time now is 23:15.

Mon May 17 23:15:14 UTC 2021 up 39 days, 17:56, 0 users, load averages: 3.01, 2.51, 2.43

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.