mersenneforum.org Report top-5000 primes here
 Register FAQ Search Today's Posts Mark Forums Read

2013-06-20, 14:10   #287
Puzzle-Peter

Jun 2009

683 Posts

Quote:
 Originally Posted by MyDogBuster 90*748^116015+1 is prime
Well done! I wanna be next, there's been enough of a dry spell if you ask me...

 2013-07-01, 13:30 #288 Cruelty     May 2005 23·7·29 Posts 7019*10^881309-1 (881313 digits)
2013-07-01, 14:26   #289
MyDogBuster

May 2008
Wilmington, DE

1011001001002 Posts

Quote:
 7019*10^881309-1 (881313 digits)
Nice one Borys - 93 on the big list

CRUS's largest to date and R10 is now a 1ker

Last fiddled with by MyDogBuster on 2013-07-01 at 14:27

 2013-07-01, 14:28 #290 Cruelty     May 2005 23×7×29 Posts Thanks, still one remaining for R10 and another one for S10
 2013-07-01, 14:32 #291 Puzzle-Peter     Jun 2009 683 Posts Good one! Stamina pays off in the long run...
2013-07-01, 16:45   #292
rogue

"Mark"
Apr 2003
Between here and the

23×5×157 Posts

Quote:
 Originally Posted by Cruelty 7019*10^881309-1 (881313 digits)
Awesome!

 2013-07-01, 18:30 #293 henryzz Just call me Henry     "David" Sep 2007 Cambridge (GMT/BST) 5,857 Posts The depressing part is that I calculate only 19.56% chance of a prime by n=2M for r10.
 2013-07-01, 19:06 #294 Cruelty     May 2005 31308 Posts What is really needed is a fixed-k non-base-2 GPU sieve similar to srsieve
 2013-07-01, 20:12 #295 Siemelink     Jan 2006 Hungary 22·67 Posts An excellent reward for three years of persistence. 8579*10^373260-1 seems to have been your previous R10 prime... Willem.
2013-07-01, 21:01   #296
rogue

"Mark"
Apr 2003
Between here and the

628010 Posts

Quote:
 Originally Posted by Cruelty What is really needed is a fixed-k non-base-2 GPU sieve similar to srsieve
Unfortunately we are a way from doing that. BSGS needs too much memory so the GPU is not practical. Memory light methods are not very smooth.

2013-07-01, 22:28   #297
henryzz
Just call me Henry

"David"
Sep 2007
Cambridge (GMT/BST)

5,857 Posts

Quote:
 Originally Posted by rogue Unfortunately we are a way from doing that. BSGS needs too much memory so the GPU is not practical. Memory light methods are not very smooth.
This has been discussed in the past.
http://www.mersenneforum.org/showthr...ht=bsgs&page=3
Is the memory usage dependent on p or the range of p?
Also you talk about needing 256 sets of 80MB data as there are 256 cores. Is there a way to utilize multiple cores on the same set of data?
Another option is to make it use only a few cores(as many as possible) and expect the user to also run a thread of mfaktc to saturate the gpu.

Last fiddled with by henryzz on 2013-07-01 at 22:33

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes No Prime Left Behind 1499 2021-03-30 22:04 gd_barnes No Prime Left Behind 688 2020-04-24 07:31 Batalov Conjectures 'R Us 10 2013-03-29 01:29 masser Lounge 9 2008-08-27 12:31 jasong jasong 1 2007-06-09 22:51

All times are UTC. The time now is 03:10.

Thu Apr 15 03:10:46 UTC 2021 up 6 days, 21:51, 0 users, load averages: 1.55, 1.34, 1.25

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.