![]() |
|
|
#1 |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
978210 Posts |
Morning all.
I've just noticed a very strange ECM assignment from the V5 server: 2097152 Since Mersenne Primes must have an exponent which is also prime, I'm wondering why this was handed out. And, in fact, this was assigned to one of my machines three times. It *did* find a factor (4485296422913), and yet its continuing to work on the same assignment again (and taking several days to do so). Unfortunately I can't readily access this machine, so I'm going to have to simply wait for it to finish wasting its time. Any ideas? |
|
|
|
|
|
#2 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
19·397 Posts |
You are doing ecm on the 21st Fermat number. There is one known factor - and the work assignment should tell the client what it is (a bug was fixed in that regard about a week ago). If the assignment is very recent, send me the prime.log file.
|
|
|
|
|
|
#3 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
2×67×73 Posts |
Quote:
The only other thing I found strange was it assigned the same number to the same machine three times -- and it's diligently finding the same factor... I'm afraid I don't have easy access to that machine, so I can't send you the prime.log. |
|
|
|
|
|
|
#4 | ||
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22·3·641 Posts |
chalsall,
The nature of ECM's search for factors differs from that of TF or P-1. Those two methodically step through a given search space and are guaranteed to find a factor if one exists within the search space bounded by the given parameters (start and end for TF, B1/B2 for P-1). In each case, after an unsuccessful search concludes, it is possible to later resume at the particular point where the unsuccessful search stopped and then proceed to higher bounds than the previous search covered, without overlap. Although ECM also has B1/B2 bounds like P-1, it does not methodically step through the search space defined by them, but instead tries random elliptical curves that are defined within that search space. (AFAIK there is no practical way to do an exhaustive search of an ECM search space by methodically stepping through it as with TF or P-1. According to my understanding, another way of saying this is that any attempted methodical choice of curves gets the same or worse result as a random choice of curves, but I'm not an ECM expert so that last part may be wrong.) The more curves it tries, the higher are its chances of finding a factor if one exists within that search space, but there's never a 100% guarantee that it will succeed. ECM is like fly-fishing (or casting), compared to net-fishing (TF,P-1), but its "fly-fishing" (or casting) can be tried in regions too big for practical "net-fishing". Quote:
Quote:
Normally, the ECM assignment should include a list of known factors for the number being ECMed, so that when any of them is (re)found, the program will just skip it instead of reporting it as a found factor. That's what George meant by "There is one known factor - and the work assignment should tell the client what it is". Last fiddled with by cheesehead on 2008-12-19 at 18:40 |
||
|
|
|
|
|
#5 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2×5,393 Posts |
|
|
|
|
|
|
#6 | |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
11110000011002 Posts |
Quote:
![]() I mixed up my astronomy with my math. |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Something strange ... | bayanne | Software | 6 | 2016-04-06 04:33 |
| Something *really* strange | schickel | FactorDB | 7 | 2012-02-02 00:10 |
| A strange RSA key | siew | Factoring | 70 | 2010-05-31 22:31 |
| Strange bug with GMP-ECM | MatWur-S530113 | GMP-ECM | 2 | 2007-11-19 00:01 |
| Strange bug | HiddenWarrior | Software | 5 | 2005-08-22 08:34 |