![]() |
|
|
#386 |
|
Mar 2006
Germany
22·727 Posts |
all factorizations above 90 digits have to be done manually by msieve.
Markus (Syd) implemented this border, so his workers will not be occupied by such amount of work. all work for this number you have done here, more work is not worth. if i use the workers, i try about 3 or 4 times of the ECM levels each, then you can be sure there's no low factor missed. |
|
|
|
|
|
#387 |
|
May 2007
Kansas; USA
32·13·89 Posts |
OK, thanks Karsten. That is basically what I tried...several hits on each of the ECM levels before giving up.
Can you provide me with a link to the latest msieve for Windows? A linux version would be OK but my "play around" machine is Windows. Although I've messed around with Alpertron's applet quite a bit, I'm mostly a newbie to the factoring arena. This database is very cool. I just now had the same problem on that sequence with n=326 that has a 93-digit composite factor. Last fiddled with by gd_barnes on 2009-06-13 at 11:20 |
|
|
|
|
|
#388 |
|
Mar 2006
Germany
22×727 Posts |
|
|
|
|
|
|
#389 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts |
I've noticed the Sieve and Very High Limits buttons disappear after a certain amount of work, too. (Edit: Ok, so Gary's issue is just that Sieve isn't allowed on large numbers, but my statements still stand) It doesn't make sense to me either, Gary. Is this by design Syd? I'd think if anything it should be just the opposite: after work at a certain level gets completed and practically eliminates the chance of finding a factor at a lower level, the lower levels should become unavailable. And, unless I'm misunderstanding something about the P-1 method, the P-1 button should disappear or switch to higher limits after a P-1 is run with equal or higher limits than what happens when you click that button. I think something similar with P+1 after 3-5 runs would be in order as well.
(similar to kar_bon's link...) Here are links to download compiled versions of several good factoring programs: http://gilchrist.ca/jeff/factoring/ As kar_bon implied, numbers of this size are easily done by a single computer with a little patience. Using the SIQS method with YAFU or Msieve (they're about as fast, you could do some testing to see which is faster on your CPU, for mine it's YAFU) would probably be the best option for a number this size. Last fiddled with by Mini-Geek on 2009-06-13 at 11:48 |
|
|
|
|
|
#390 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
16FE16 Posts |
try http://factorization.ath.cx/workerstatus.php
for explanations of what the limits are |
|
|
|
|
|
#391 | |
|
May 2007
Kansas; USA
242558 Posts |
Quote:
Actually, my main issue is not that sieve disappears on larger numbers. It's that "ECM to very high limits" is not available on smaller numbers, i.e. about 87-95 digits. If it is available for a 100+-digit number, why is it not available for a 90-digit number? 90-digit numbers should take far less time to factor. Syd, shouldn't smaller numbers take less time to factor and so shouldn't 'ECM to very high limits' be allowed on any number where a sieve is not allowed? That said, I believe there is a much larger longer-range problem. From my experience, many of the factors currently in the queue for "ECM to very high limits" will take many CPU months to even years to find a factor. Am I correct on that? If so, there is a big slippery slope here. The last I looked, there are 27 numbers in the queue. I see there eventually being 100, then 200, then 300, etc. until there is such a queue of numbers that virtually none would ever get solved. Perhaps the issue that I described is attempting to avoid the above long-range problem. Unfortunately it is the those large numbers that stack up in the 'ECM to very high limits" queue. I saw one last night for 307 digits, which (by my experience) may not get solved within a decade of CPU years. The smaller factors would likely get solved at some point. Regardless, once again, this is an outstanding piece of work that, from what I can tell, has been needed for a long time. ![]() Gary |
|
|
|
|
|
|
#392 | ||
|
Nov 2008
91216 Posts |
Quote:
Quote:
Last fiddled with by 10metreh on 2009-06-13 at 17:13 |
||
|
|
|
|
|
#393 | |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
10110111111102 Posts |
Quote:
for example to run 30 digit ecm on a c60 would take 15 minutes and probably find a factor but the number could be definitely(forgetting bugs in the program and such like ) factored by QS in 5 minutesthe reason that you cannot use the database to factorize numbers above c85 is that it would clog up the database by taking an hour or more each VHL disappears when it is judged that the optimal amount of ecm has been done and it is time to move to QS or for >~c90 GNFS we are actually rather lucky with the database it does more ecm than many people would recommend on small numbers Last fiddled with by henryzz on 2009-06-13 at 18:12 |
|
|
|
|
|
|
#394 |
|
Nov 2008
2×33×43 Posts |
|
|
|
|
|
|
#395 |
|
"Sander"
Oct 2002
52.345322,5.52471
100101001012 Posts |
|
|
|
|
|
|
#396 |
|
Nov 2008
2·33·43 Posts |
Of course. I'm not asking Syd to add that. I am merely pointing out that using Syd's workers on a c99 no longer does a full test prior to GNFS.
Last fiddled with by 10metreh on 2009-06-13 at 19:08 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Database for k-b-b's: | 3.14159 | Miscellaneous Math | 325 | 2016-04-09 17:45 |
| Factoring database issues | Mini-Geek | Factoring | 5 | 2009-07-01 11:51 |
| database.zip | HiddenWarrior | Data | 1 | 2004-03-29 03:53 |
| Database layout | Prime95 | PrimeNet | 1 | 2003-01-18 00:49 |
| Is there a performance database? | Joe O | Lounge | 35 | 2002-09-06 20:19 |