![]() |
![]() |
#12 | |
"Frank <^>"
Dec 2004
CDP Janesville
2×1,061 Posts |
![]() Quote:
Code:
linear algebra completed 222519 of 223174 dimensions (99.7%, ETA 0h 0m) lanczos halted after 3528 iterations (dim = 222925) recovered 32 nontrivial dependencies commencing square root phase reading relations for dependency 1 read 111749 cycles cycles contain 455893 unique relations read 455893 relations multiplying 366356 relations multiply complete, coefficients have about 14.51 million bits initial square root is modulo 215881931 prp52 factor: 7570380941541769441561745312556684037938683763298177 prp52 factor: 8145994460731835857997597172380480561830720426463929 elapsed time 00:29:25 ![]() ![]() Nice split there!!! |
|
![]() |
![]() |
![]() |
#13 |
Jun 2005
373 Posts |
![]()
Msieve 1.41. So, the problem was not oversieving, but the brilliance. Perhaps we should tell the case to the maker of Msieve, for that he knows that some functionality is lost in version 1.41.
Anyway, cheers, H. |
![]() |
![]() |
![]() |
#14 |
Nov 2008
2×33×43 Posts |
![]() |
![]() |
![]() |
![]() |
#15 | ||
"Frank <^>"
Dec 2004
CDP Janesville
84A16 Posts |
![]() Quote:
Quote:
Maybe the solution is to keep 1.39 around as a fallback if there are similar problems in the future. |
||
![]() |
![]() |
![]() |
#16 | |
Jun 2005
373 Posts |
![]()
You, here, post number 4. Actually, you didn't, but I understood it like that, my bad.
I was inclined to such a suggestion as you had some similar problem here with some p47*p49. I can be completely mistaken. Quote:
Anyway, we have learned something (at least I have), that's something,too. Cheers, H. |
|
![]() |
![]() |
![]() |
#17 | |
Jun 2005
373 Posts |
![]()
OK, here we go again.
Quote:
Last fiddled with by hhh on 2009-05-07 at 13:05 |
|
![]() |
![]() |
![]() |
#18 |
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,857 Posts |
![]()
have you tried again?
|
![]() |
![]() |
![]() |
#19 |
Tribal Bullet
Oct 2004
33×131 Posts |
![]()
This job is very heavily oversieved; try it with ~2/3 the total number of relations (it was not oversieved enough to trigger the new code in v1.41 for dealing with very heavy oversieving).
|
![]() |
![]() |
![]() |
#20 | |
"Frank <^>"
Dec 2004
CDP Janesville
41128 Posts |
![]() Quote:
Code:
found 1261318 hash collisions in 8230451 relations commencing duplicate removal, pass 2 found 2115181 duplicates and 6115270 unique relations hhh, I can take another stab at it if you like, or you can try one more block of sieving and see what happens......let me know and we can setup an FTP transfer again. |
|
![]() |
![]() |
![]() |
#21 |
Jun 2005
373 Posts |
![]()
I have got the impression that when I restart aliqueit, it keeps resieving the same spot. How can I manually sieve a chunk and manually start the postprocessing? That would be of much help. Thanks for all your concern, H.
|
![]() |
![]() |
![]() |
#22 |
"Frank <^>"
Dec 2004
CDP Janesville
41128 Posts |
![]()
Maybe someone else can chime in, since I only run aliqueit on sequences until they hit 100-digits; but do you only run NFS jobs under aliqueit? My solution would be to use one of the fact*.pl scripts and adjust the .job file to move the next chunks up above where it's already been sieved.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
P-1 factoring attempts at smallest-remaining Mersenne numbers with no known factors | UberNumberGeek | Factoring | 51 | 2017-02-13 20:30 |
Attempts vs. Successes oddity | Rodrigo | GPU Computing | 8 | 2014-09-19 08:44 |
pie chart: LL attempts | sixblueboxes | PrimeNet | 8 | 2014-04-18 14:46 |
LL-D attempts and successes | Christenson | Information & Answers | 1 | 2011-02-03 05:25 |
Postprocessing error: "too many merge attempts" | mdettweiler | Msieve | 4 | 2009-03-03 16:53 |