mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2016-05-04, 14:39   #1
mickfrancis
 
Apr 2014
Marlow, UK

3816 Posts
Default Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve

As I understand it, in the Small Prime Variation of the Quadratic Sieve, primes less than a threshold (Pmin, say) are not used for sieving, as the cost of sieving is disproportionately high given the contribution of these primes.

Sieving with powers of primes that are themselves used in sieving is also less beneficial than sieving with other primes of size comparable to these powers (e.g. the contribution for p^2 is the same as for p).

However, it seems to me that for primes in the factor base less than Pmin it ought still to make sense to sieve with the lowest powers that are Pmin or above, as the contribution is just as high as that of similarly-sized primes (why would I sieve with the prime 257 but not 256 (28), for example)?

In the implementations I've looked at, this does not appear to be done, and I was wondering why; is the benefit outweighed by the added complexity?
mickfrancis is offline   Reply With Quote
Old 2016-05-06, 02:19   #2
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

22×883 Posts
Default

Once the problem size gets above a fairly small threshold, the runtime needed for sieving small primes becomes insignificant compared to sieving everything else; there are only a few such, and they cache nicely, so they're done in a flash compared to the thousands of larger primes you must also sieve with.
jasonp is offline   Reply With Quote
Old 2016-05-06, 08:13   #3
mickfrancis
 
Apr 2014
Marlow, UK

23·7 Posts
Default

Quote:
Originally Posted by jasonp View Post
Once the problem size gets above a fairly small threshold, the runtime needed for sieving small primes becomes insignificant compared to sieving everything else; there are only a few such, and they cache nicely, so they're done in a flash compared to the thousands of larger primes you must also sieve with.
Makes sense - thanks Jason.
mickfrancis is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime Gap Length with consecutive integers divisible by small primes carpetpool Prime Gap Searches 45 2017-09-30 20:51
Non-sieving version of Quadratic Sieve mickfrancis Factoring 5 2016-03-31 06:21
Sieving polynoms in Quadratic Sieve ThiloHarich Factoring 13 2009-01-04 18:19
Small Primes Housemouse Math 2 2008-06-04 05:23
Using p=2 for sieving (Quadratic sieve algorithm) R1zZ1 Factoring 36 2007-11-02 15:59

All times are UTC. The time now is 04:12.

Wed Dec 2 04:12:16 UTC 2020 up 83 days, 1:23, 1 user, load averages: 2.41, 2.41, 2.20

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.