![]() |
![]() |
#1 | |
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
291016 Posts |
![]() Quote:
I'd be happy to join with you on this one if you'd like a cow-orker. (Or is that core-searcher?) Paul |
|
![]() |
![]() |
![]() |
#2 | |
Nov 2003
22×5×373 Posts |
![]() Quote:
I can help as well. Will you be doing line or lattice sieving? I only have a small number of machines, and prefer to use my own code. It's output conforms to the CWI format. I'd send the data via snail mail CD. |
|
![]() |
![]() |
![]() |
#3 |
"Nancy"
Aug 2002
Alexandria
2,467 Posts |
![]()
I'm doing lattice sieving, the only line siever I have is CWI's and it's not terribly fast. Some line sieving over the lattice siever's factor base would make sense, though. I've chosen fb primes < 20M on both sides, large primes <2^30 and will sieve special-q up to 60M - 70M on each side.
I'm doing sq in [20M, 30M] on the algebraic side atm. Feel free to take any range above that for lattice sieving. Please post which sq range you are doing, or if you're doing line sieving. Oh, and the polynomial is the obvious 3x^6+1. Alex |
![]() |
![]() |
![]() |
#4 | |
Nov 2003
22×5×373 Posts |
![]() Quote:
I will start with 5K. I don't know how many I will be able to do, but will start this weekend. |
|
![]() |
![]() |
![]() |
#5 | |
Nov 2003
11101001001002 Posts |
![]() Quote:
A factor base bound of 20M is quite a bit too small. I would recommend a bound in the 30M to 35M range. |
|
![]() |
![]() |
![]() |
#6 |
Nov 2003
22·5·373 Posts |
![]() |
![]() |
![]() |
![]() |
#7 |
"Nancy"
Aug 2002
Alexandria
9A316 Posts |
![]()
When I sieve sq on the rational side, I'll use fb limit of 60M on the algebraic side, and increase the fb limit on the rational side along with the sq value. That should catch nearly all relations where the norms on both sides are 60M-smooth with up to two large primes.
Alex Edit: > Please tell me if you definitely want an fb bound of only 20M. 20M is a lower limit for the sq value I'll use on each side. At first, this will also be the factor base limit, but not throughout all the sieving. Last fiddled with by akruppa on 2007-01-04 at 16:07 |
![]() |
![]() |
![]() |
#8 | |
Nov 2003
22×5×373 Posts |
![]() Quote:
that some array isn't big enough and that I need to recompile. I don't have the time to investigate right now, so this will have to wait. |
|
![]() |
![]() |
![]() |
#9 | |
Nov 2003
22×5×373 Posts |
![]() Quote:
in one of the input files. I have started sieving 3,499+ on 3 machines. |
|
![]() |
![]() |
![]() |
#10 |
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
24·32·73 Posts |
![]()
I'm sieving algebraic special-q from 30M to 31M now and will take q up to 40M when some other machines come on line.
Relations seem to be coming in at something over 5 per second. When the other machines come on-line I hope to be able to increase that rate to about 40 per second. Paul |
![]() |
![]() |
![]() |
#11 | |
Nov 2003
746010 Posts |
![]() Quote:
machines. I have been sieving since Friday on 3 machines and started another last night. I have a total of just under 1.3 million total relations. ??? Do we have an estimate of how many will be needed? ????? My most recent results, with a factor base bound of about 30M and large prime bounds of 700M required about 80 million total relations. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
2^947+1 status | fivemack | Factoring | 17 | 2014-05-06 18:00 |
Status | bsquared | Game 2 - ββββββ - Shaolin Pirates | 4 | 2013-10-01 06:18 |
Status of p-1.... | dave_0273 | Marin's Mersenne-aries | 80 | 2008-01-28 00:18 |
7,295- status and discussion | Raman | Cunningham Tables | 2 | 2008-01-01 14:52 |
status | wfgarnett3 | PSearch | 3 | 2004-03-02 18:04 |