![]() |
![]() |
#1 |
Nov 2008
1FD16 Posts |
![]()
I am nearing the end of a project to TF all exponents below 1M to at least 64 bits (is there an old version of mfaktc that do exponents < 100K anywhere?)
I pick up the ranges from this report You will see that the 0.13M range has 143 exponents left to test. If you drill down into the report... 1. click on 0.13m 2. on next page put factored through to 63 bits and get data 3. get a long list of all those candidates 4. click on output TF worktodo and enter 64 bits as the upper limit 5. Get just a SINGLE exponent back See screen caps. This report is fundamentally broken, often you will get a "complete" list, factor them out of the way then rerun the same report, you would expect no candidates right? Wrong, on many an occasion it "finds" more candidates that need checking. |
![]() |
![]() |
![]() |
#2 | |
Sep 2014
1D16 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#3 | |
Nov 2008
509 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#4 | |
Sep 2014
29 Posts |
![]() Quote:
http://www.mersenneforum.org/showpos...&postcount=498 |
|
![]() |
![]() |
![]() |
#5 | |
"Curtis"
Feb 2005
Riverside, CA
2×5×599 Posts |
![]() Quote:
For every 8000 factors of 19 digits, one would be (expected to be) missed by a t25. But only ~5% of exponents have a factor of 19 digits length (or are mersennes different from the usual heuristic?), so you'd expect a missed factor something like 1 out of 160,000 tests. Note that even 25% of a t30 would halve the chances of a missed factor, and exponents at 130,000 level have a t30 complete. |
|
![]() |
![]() |
![]() |
#6 | |
Serpentine Vermin Jar
Jul 2014
23·7·61 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
"GIMFS"
Sep 2002
Oeiras, Portugal
3·232 Posts |
![]()
If memory serves me, 100K is the lowest we can gousing mfaktc.. Former versions wouldn´t factor exponents lower than 1M.
|
![]() |
![]() |
![]() |
#8 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
2×5,179 Posts |
![]()
The versions of mfaktX that sieve with the GPU are like that (i.e. all since/after v0.18, for mfaktc). Older versions of mfaktc which sieve only with the CPU exist, where you can go as low as 2k for the exponent, but they are about 5 times slower (still 40 times faster than the CPU) than the last version of mfaktc, and they also keep the CPU busy (you can not run P95 in the same time, or you can, but the output is lousy). I just used one to factor all expos between 2k and 100k from 57 to 58 (sometime higher) for the "skipped bitlevels" project from Mark.
Last fiddled with by LaurV on 2016-02-10 at 06:50 Reason: clarification added |
![]() |
![]() |
![]() |
#9 |
"GIMFS"
Sep 2002
Oeiras, Portugal
3·232 Posts |
![]()
You´re right|
Your memory is better than mine. DDR4 vs DDR2?... ![]() |
![]() |
![]() |
![]() |
#10 |
"GIMFS"
Sep 2002
Oeiras, Portugal
63316 Posts |
![]()
While we´re at it: the report isn´t updating. The latest version is from the 7th Feb.
|
![]() |
![]() |
![]() |
#11 |
"GIMFS"
Sep 2002
Oeiras, Portugal
63316 Posts |
![]()
Stuck again
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Mersenne.ca Status Report | Gordon | mersenne.ca | 168 | 2018-06-17 22:48 |
Factoring Limit Report --> Assignment | 0PolarBearsHere | PrimeNet | 9 | 2015-12-09 08:15 |
Mersenne.ca Status Report | Gordon | mersenne.ca | 1 | 2015-09-22 10:53 |
Mersenne statistics on p-1 factoring | diep | Factoring | 10 | 2010-11-14 19:27 |
Mersenne NUmber Factoring | andi314 | Math | 4 | 2002-11-26 14:25 |