![]() |
![]() |
#1 |
May 2013
East. Always East.
6BF16 Posts |
![]()
I was just wondering about a GPU going bad while doing trial factoring and returning wrong results.
If a GPU incorrectly returns "No Factor Found" it will be a bit unfortunate, but not the end of the world. If a GPU incorrectly returns "Factor Found", I assume it would be insanely easy to check if that is in fact a factor. Does any double checking happen? And how? |
![]() |
![]() |
![]() |
#2 |
"Mr. Meeseeks"
Jan 2012
California, USA
27×17 Posts |
![]()
Have you ever tried to submit a "fake" factor?
|
![]() |
![]() |
![]() |
#3 |
May 2013
East. Always East.
11×157 Posts |
![]()
No. Is it funny? Or do I get killed by a giant prime number?
|
![]() |
![]() |
![]() |
#4 |
"Mr. Meeseeks"
Jan 2012
California, USA
27×17 Posts |
![]() |
![]() |
![]() |
![]() |
#5 |
May 2013
East. Always East.
11·157 Posts |
![]()
Oh good. I just tried to fake one. Blah not a factor of blah. Nothing too aggressive.
|
![]() |
![]() |
![]() |
#6 |
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
![]() |
![]() |
![]() |
![]() |
#7 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
101010100011002 Posts |
![]() |
![]() |
![]() |
![]() |
#8 |
May 2013
East. Always East.
11·157 Posts |
![]()
This actually raises another older question of mine. Can mfaktc find multiple factors if there are more than one in the tested range? Do they all get through or does the server just care about the fact that one was found in the first place?
|
![]() |
![]() |
![]() |
#9 | |
Jul 2012
Saarland / Germany
10001002 Posts |
![]()
yes, this is in mfaktc/o !
Quote:
of course you can find factors of a low bit level and again on a higher level. but make it sense to search again on the same exponent on a high level if a factor is found on a low level ? so setting 2 make more sense or not ? Norman Last fiddled with by NormanRKN on 2013-08-09 at 01:24 |
|
![]() |
![]() |
![]() |
#10 |
"Bill Staffen"
Jan 2013
Pittsburgh, PA, USA
23·53 Posts |
![]()
Certainly, 2 makes the most sense if you want it to stop as soon as possible after you find a factor. 0 makes the most sense if you want to find all the factors in range.
1 makes the most sense if you have stages turned on and turning in partially checked bit levels gives you mental hives. I run 2, because I'm mostly just trying to rule out prime numbers. |
![]() |
![]() |
![]() |
#11 |
Jun 2013
107 Posts |
![]()
What is generating results like these, with the results ordered by factor?
(Also, there were no no-factor results in between.) I'm wondering because there's a huge range of exponents there, from 2M to 19M not counting the seperate bit at the bottom. Is this a different algorithm being used for factoring or something? Because as cheesehead said the server double checks factors so they must be correct...? http://pastebin.com/bULhTKwr |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Status of Double Checked LL Test | justinstevens42 | Information & Answers | 2 | 2018-01-22 16:03 |
FACTS | lavalamp | Lounge | 0 | 2009-08-22 23:33 |
Double checked exponent does not show as completed | Daffy | PrimeNet | 6 | 2008-02-13 05:14 |
factored or double checked exponents assigned | S485122 | PrimeNet | 1 | 2007-11-19 12:59 |
All exponents below 13,000,000 double-checked. | Aillas | Lounge | 5 | 2006-06-30 07:27 |