mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > PrimeNet

Reply
 
Thread Tools
Old 2016-03-08, 04:44   #100
Mark Rose
 
Mark Rose's Avatar
 
"/X\(‘-‘)/X\"
Jan 2013

22·733 Posts
Default

Yeah, the work involved for that batch was basically all duplicate work anyway, based on the only 1 factor found for 45 THz-days of work.

The 80 factors I've found in the last few days is about a 1.1% success rate, indicating virgin territory for skipped trial factoring. Perhaps credit is deserved there.
Mark Rose is offline   Reply With Quote
Old 2016-03-08, 20:23   #101
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

95616 Posts
Default

It some trial factoring at lower levels was not done correctly either. For example, an old result for M17458547 says it has no factors up to 65 bits, but TJAOI found a 63-bit factor: http://mersenne.org/M17458547

Last fiddled with by ixfd64 on 2016-03-08 at 20:23
ixfd64 is offline   Reply With Quote
Old 2016-03-08, 21:20   #102
Mark Rose
 
Mark Rose's Avatar
 
"/X\(‘-‘)/X\"
Jan 2013

22·733 Posts
Default

I suppose I could do an analysis of the exponents TJAOI found and identify bad users. Madpoo could probably do a better job at that with direct access to the database.

Last fiddled with by Mark Rose on 2016-03-08 at 21:22
Mark Rose is offline   Reply With Quote
Old 2016-03-09, 01:12   #103
Gordon
 
Gordon's Avatar
 
Nov 2008

50110 Posts
Default

Quote:
Originally Posted by Madpoo View Post
I thought that was the server rejecting a TF result for *lower* bit ranges than what has already been checked in.

I think what Mark is suggesting is that if you tried to turn in results for 2^64 to 2^65 but there's no record of it being done from 2^63 to 2^64, it would pop up some message saying "hey, what about the lower range, do that first"
Nope, it's doing what I said it was. Try it, pick any exponent, then manually check in a result with the TF level higher than what is recorded.

In the example I gave, the db only showed factor attempt to bit 62, hence it rejected the 63-64 submission, but accepted the 62-63 one....
Gordon is offline   Reply With Quote
Old 2016-03-09, 08:04   #104
dbaugh
 
dbaugh's Avatar
 
Aug 2005

2×59 Posts
Default

There is also the issue of skipped bit sub-levels. If one is doing TF on an exponent in say 2^68 to 2^69 and has it set to bail out if a factor is found, then that exponent has not truly been fully searched at that bit level. I have found several dual factors in a given bit level. Does exponent status have a way to distinguish finished searching results versus bailed out? I think it does. If so, then the bail outs need to be finished.

It all comes down to eliminating an exponent as quickly as possible versus developing a database of Mersenne factors.

Last fiddled with by dbaugh on 2016-03-09 at 08:08
dbaugh is offline   Reply With Quote
Old 2016-03-09, 08:10   #105
axn
 
axn's Avatar
 
Jun 2003

5,051 Posts
Default

Quote:
Originally Posted by dbaugh View Post
If so, then the bail outs need to be finished.
If anyone is re-doing any TF, I would suggest to redo the whole exponent from scratch. For example, if you're planning to re-do bit level 68-69 for an exponent, redo the whole 0-69 range. It would take no more than 2x the time (probably much less), and will give some good assurance that there were no factors missed out due to <insert all possible reasons>
axn is offline   Reply With Quote
Old 2016-03-09, 10:17   #106
bloodIce
 
bloodIce's Avatar
 
Feb 2010
Sweden

AD16 Posts
Default

Quote:
Originally Posted by axn View Post
If anyone is re-doing any TF, I would suggest to redo the whole exponent from scratch. For example, if you're planning to re-do bit level 68-69 for an exponent, redo the whole 0-69 range. It would take no more than 2x the time (probably much less), and will give some good assurance that there were no factors missed out due to <insert all possible reasons>
There is absolutely no sense to re-do anything bellow TF59 or soon TF60. That is because of TJAOI's systematic work climbing slowly in the whole exponent space.
From very recently I do something that Madpoo is probably not very happy to see. I am re-doing all exponents in 900M range from TF60 to TF64 regardless if they have or not a factor. There is a chance to find a miss-reported exponent (did not happen so far) and obliviously a way to complete the database in this range to TF64. In my defense: TJAOI will do it anyhow soon. I have tried to do TF0-64 and there was nothing bellow TF59, which was not reported by TJAOI or someone else. I suggest that you do not spend time in less than TF60. As a little gratification to the effort (there is very little credit associated) you can see a small “bluefication” of the range in James' graphs (http://www.mersenne.ca/graphs/factor...M_20160309.png). Yeah, probably James is not that happy too.
bloodIce is offline   Reply With Quote
Old 2016-03-09, 10:50   #107
axn
 
axn's Avatar
 
Jun 2003

5,051 Posts
Default

Quote:
Originally Posted by bloodIce View Post
There is absolutely no sense to re-do anything bellow TF59 or soon TF60. That is because of TJAOI's systematic work climbing slowly in the whole exponent space.
Unless TJAOI (or his software or hardware) has achieved godhood, consider them all to be fallible. Avoiding the lowest bit levels is false savings - they will get done almost instantly. Since the purpose is to make sure that we're catching all missed factors (for exponents that have been conclusively proven as prime), it is best to be thorough.

Anyway, not my cycles; just a suggestion.
axn is offline   Reply With Quote
Old 2016-03-09, 12:26   #108
Mark Rose
 
Mark Rose's Avatar
 
"/X\(‘-‘)/X\"
Jan 2013

55648 Posts
Default

The lower bit levels are done almost instantly, but they have a large impact on GHzd/d. I've noticed this when redoing the various unreported bit levels.
Mark Rose is offline   Reply With Quote
Old 2016-03-09, 16:08   #109
Gordon
 
Gordon's Avatar
 
Nov 2008

50110 Posts
Default

Quote:
Originally Posted by dbaugh View Post
... versus developing a database of Mersenne factors.
Some of us would like to see every candidate factored and are working to try and build such a list
Gordon is offline   Reply With Quote
Old 2016-03-09, 19:07   #110
Madpoo
Serpentine Vermin Jar
 
Madpoo's Avatar
 
Jul 2014

63578 Posts
Default

Quote:
Originally Posted by Dubslow View Post
madpoo directly fiddled with the DB to add those results; PrimeNet (and its result submission process, which assigns credit etc) had nothing to do with it.

Of course the credit still deserves to be awarded, in some sense, though IIRC the participants (Mark Rose and madpoo primarily) had agreed that the credit wasn't of substantial importance and not worth the likely-large amount of manual work that would be needed to get it assigned. (It's probably doable, with some sort of hacking of the scripts to be run offline, but almost certainly more trouble than it's worth.)
I reserve the option to figure out how to appropriately apply credit later. Since I had to insert these records manually (they would have been rejected as unnecessary otherwise) I couldn't benefit from the credit calculations that the web code applies. I'm not familiar enough with how ghz-days is figured so for now I left it at zero.
Madpoo is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Normalising rent levels Bundu Math 4 2017-09-27 06:14
Racism or low light levels or...? jasong jasong 2 2016-09-25 05:07
Missing bit levels? NBtarheel_33 Data 6 2016-05-31 15:27
Is the data missing or did we miss a couple TF bit levels petrw1 PrimeNet 2 2015-05-07 05:09
Recommended TF bit levels for M(>10^8) NBtarheel_33 Math 19 2008-11-03 17:19

All times are UTC. The time now is 19:55.


Fri Jul 16 19:55:04 UTC 2021 up 49 days, 17:42, 1 user, load averages: 2.05, 2.15, 2.39

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.