![]() |
![]() |
#1 |
(loop (#_fork))
Feb 2006
Cambridge, England
2·3,191 Posts |
![]()
When I run
Code:
gunzip -c L3655A.dat.gz | nl | grep -a "000000[^0-9a-f,]" | tee every-millionth I'm having a bit of difficulty working out which Q-values are affected by this, because some versions of the sieving client put the special-Q at the end of the list of factors and some sort the factors numerically, so given a line it's not trivial to find the special-Q that it was. My inclination is to write a better special-Q-finder, figure out the corrupt ranges, and sieve them myself with 16e; I'm not sure I'll get that done before I go to Australia in eight days. |
![]() |
![]() |
![]() |
#2 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
5·7·139 Posts |
![]()
Is it possible to cheat on sieving?
|
![]() |
![]() |
![]() |
#3 |
(loop (#_fork))
Feb 2006
Cambridge, England
2×3,191 Posts |
![]()
At a first analysis, there are no special-Q larger than 966392000 in the output file despite sieving supposedly having been done to 1200M
I don't see any suspiciously large gaps before Q=880M or so. |
![]() |
![]() |
![]() |
#4 |
(loop (#_fork))
Feb 2006
Cambridge, England
2×3,191 Posts |
![]()
With my embarrassed hat on, I also need to point out that I forgot to put an lss: 0 directive in the polynomial file so all the sieving was done on the lower-yielding side - I wondered why the yield was so low.
I will fix this, it will take a few tens of thousands of core hours at my side but that seems a reasonable penalty for me to pay. |
![]() |
![]() |
![]() |
#5 |
Sep 2008
Kansas
2×11×149 Posts |
![]() |
![]() |
![]() |
![]() |
#6 |
Jun 2012
32×7×47 Posts |
![]()
Agreed. Penance is for sins, not simple mistakes. Use the grid.
No stones being thrown here! |
![]() |
![]() |
![]() |
#7 |
"Curtis"
Feb 2005
Riverside, CA
52×11×17 Posts |
![]()
On my home copies of lasieve4e, Qmax is near 1060M. I get errors above that and the sieve exits without trying any Q's. Perhaps someone might test-sieve Q=1100M or 1200M to see if that's even possible on the BOINC-ified sievers?
|
![]() |
![]() |
![]() |
#8 |
Jul 2003
So Cal
22·11·47 Posts |
![]() |
![]() |
![]() |
![]() |
#9 |
(loop (#_fork))
Feb 2006
Cambridge, England
2×3,191 Posts |
![]()
OK: my computers are doing the small gaps and the grid job L3655Ab is taking the strain. I will have to manage some of this on an iPad from the other side of the planet, which might be less efficient than the most efficient protocol but should work.
|
![]() |
![]() |
![]() |
#10 |
(loop (#_fork))
Feb 2006
Cambridge, England
2×3,191 Posts |
![]()
I have replaced L3655Ab with L3655Ac, which has a more sensible sieving region and, importantly, remembered to put the alim: and rlim: lines in the polynomial file.
|
![]() |
![]() |
![]() |
#11 |
(loop (#_fork))
Feb 2006
Cambridge, England
2·3,191 Posts |
![]()
Another data quality issue: 5009_73m1 only has 345131720 usable relations despite a claim of 450653495, and so I can't yet build a matrix. I will investigate which regions are missing and put in a new sieving job.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
16e Post Processing Progress | pinhodecarlos | NFS@Home | 8 | 2018-11-28 13:45 |
NFS@Home Post-Processing Rack Build | pinhodecarlos | NFS@Home | 1 | 2016-09-27 12:34 |
Crash doing large post-processing job | wombatman | Msieve | 22 | 2013-12-04 01:37 |
Update on 7^254+1 post processing | dleclair | NFSNET Discussion | 4 | 2005-04-05 09:51 |
Post processing for 2,757- | xilman | NFSNET Discussion | 3 | 2003-11-06 14:23 |