mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > And now for something completely different

Reply
 
Thread Tools
Old 2016-02-10, 12:45   #12
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

F1716 Posts
Default

Okay, I think I can replace those routines with calls to gwtobinary32 and binary32togw and use some array arithmetic to achieve the mod calculation...

Last fiddled with by paulunderwood on 2016-02-10 at 12:54
paulunderwood is offline   Reply With Quote
Old 2016-02-12, 06:06   #13
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,863 Posts
Default

Quote:
real 3m44.806s
user 3m36.052s
sys 0m0.012s
For just squaring, multiplying by the base and converting back and forth to binary using the gwnum routines. 6.5 minutes with my first attempt at array arithmetic included. Is there a way to access the stored number directly? If so, how? And in what format is it?

Last fiddled with by paulunderwood on 2016-02-12 at 06:08
paulunderwood is offline   Reply With Quote
Old 2016-02-16, 00:46   #14
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

2×5×643 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
For just squaring, multiplying by the base and converting back and forth to binary using the gwnum routines. 6.5 minutes with my first attempt at array arithmetic included. Is there a way to access the stored number directly? If so, how? And in what format is it?
You don't want to access it directly. In pfgw, you can convert between gnum and Integer types. The Integer class supports operator overloading.
rogue is offline   Reply With Quote
Old 2016-02-16, 00:46   #15
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

2×5×643 Posts
Default

Completed both to n=400,000 and continuing.
rogue is offline   Reply With Quote
Old 2016-02-16, 02:53   #16
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

763210 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
converting back and forth to binary using the gwnum routines.
Conversion is a very slow process.
Prime95 is offline   Reply With Quote
Old 2016-02-16, 18:37   #17
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

386310 Posts
Default

I have got the time down to 5:40 minutes (for a buggy program). This means the array arithmetic is taking 2:10 minutes, and I only have 30-40 seconds to play with. I really doubt I can beat Georges generic modular reduction.
paulunderwood is offline   Reply With Quote
Old 2016-02-29, 03:03   #18
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

2×5×643 Posts
Default

Add (2^442042+1)^2-2 as a new prime!
rogue is offline   Reply With Quote
Old 2016-03-25, 23:37   #19
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

643010 Posts
Default

Completed to 475,000. Nothing new, but continuing
rogue is offline   Reply With Quote
Old 2016-04-07, 22:01   #20
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

144368 Posts
Default

Completed to 505,000. Nothing new, but continuing
rogue is offline   Reply With Quote
Old 2016-04-08, 22:10   #21
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

191E16 Posts
Default

I have a command line siever that works, but it slower than MultiSieve for base 2. I couple of reasons that it is slower is that I have generic logic for base 2 and poorly coded hash map code. Fortunately I think the non base 2 code is much faster the MultiSieve. The negative with MultiSieve is that it misses some factors, but that isn't a big enough issue to use the new code (yet).
rogue is offline   Reply With Quote
Old 2016-04-12, 01:05   #22
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

2×5×643 Posts
Default

Here is a Windows build of my sieving code. I (ahem) borrowed parts of the discrete log code from srsieve so I won't release the source until I clean it up and remove references to that. This code runs about 10% faster than MultiSieve (for p < 1e9), unless you are logging factors. That slows it down a bit based upon my testing, but as all factors are double-checked, that shouldn't be a big deal. I've stated before MultiSieve misses 10% to 15% of the factors due to some bug, but as cksieve is faster there is no reason to continue using MultiSieve for sieving near-square primes. One core should be able to sieve about 150G for a range of 500,000 n per day. Unlike MultiSieve, this code is base agnostic, so sieving shouldn't be impacted when sieving a larger base. There is multi-threading code in the source, but I know it doesn't work so I don't know if I'm going to try to fix it or not.

Last fiddled with by rogue on 2020-09-24 at 19:47
rogue is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Carol / Kynea Primes rogue And now for something completely different 253 2021-10-15 08:39
Carol / Kynea Coordinated Search - Reservations rogue And now for something completely different 294 2021-08-30 08:07
Search primes of form 2*n^n ± 1 JeppeSN And now for something completely different 27 2018-04-12 14:20
Factorial primes search? flava Open Projects 18 2010-12-04 05:24
Why Search for these Huge Primes? Unregistered Math 8 2005-04-27 00:55

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


Thu Oct 21 03:28:56 UTC 2021 up 89 days, 21:57, 1 user, load averages: 2.27, 1.74, 1.39

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.