20190223, 20:49  #23 
"/X\(‘‘)/X\"
Jan 2013
Ͳօɾօղէօ
2^{2}·5·139 Posts 
Couple thoughts.
It's pretty easy to guard against most throwaway email domains by using https://github.com/ivolo/disposableemaildomains We could move to giving TF credit only when a factor is found. We have enough data to figure out the probabilities of finding a factor, so we can estimate the work done to find the factor. Disadvantages are not seeing when someone submits a bunch of bogus lines, and it could be discouraging to new users... though most people doing TF have been doing LL for a while... 
20190223, 20:52  #24  
2×5×7×11^{2} Posts 
Quote:
That would make my trialfactoring today totally useless and unfructuous as no factor found !!! 

20190223, 20:56  #25  
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2^{3}·3·13·17 Posts 
Quote:


20190223, 20:59  #26  
"James Heinrich"
May 2004
exNorthern Ontario
5411_{8} Posts 
Quote:
Not at all. Over time you will have some days where you find factors and some where you don't, but when you do find a factor it would be worth the estimated effort to find it (the time to run the actual TF that found the factor, plus the other ~70 TF runs that found no factor). Nofactor result value drops to zero, Factor result value jumps by about 70x. 

20190223, 21:13  #27 
"/X\(‘‘)/X\"
Jan 2013
Ͳօɾօղէօ
2^{2}×5×139 Posts 
I guess the major free providers have started requiring numbers, haven't they?

20190223, 21:15  #28  
26A0_{16} Posts 
Quote:
but in some way by dropping the value to 0 you effectively hide GHz/day information. I find a better way to deal with this is to require email verification ! 

20190223, 21:23  #29  
"James Heinrich"
May 2004
exNorthern Ontario
5^{2}×113 Posts 
Quote:
Certainly a worthy first step, but I can guarantee that anyone who wants to be a nuisance will not be deterred by such simple things. 

20190224, 00:16  #30  
"Robert Gerbicz"
Oct 2005
Hungary
1,327 Posts 
Foolproof on TF (5 sigma)
Quote:
Quote:
In the past I've thought that it is just impossible, don't have an exact idea what would be the slowdown on gpu (I'd say that less than 1%), but the check on the server would be terrible fast and close to impossible to fool it: Let x mod N the unique mod N residue in [0,N). and H=hash(p,q,t)=(2^p mod q) mod (2^t) we are expecting to see H=1 for cnt/p/2^(t+1) different q primes (q=1,7 mod 8) if there are cnt primes in [2^b,2^(b+1)). Save these q numbers if q is prime ( or pseudoprime ) and send them to the server at the end of the computation. The number of hits follows a binomial distribution with: Binom(N,r)=Binom(cnt/2/p,1/2^t) Code:
where: N=cnt/(2*p) r=1/2^t ev=N*r (the expected value) sigma=sqrt(N*r*(1r)) choose such t for that say 1000<ev<2000 (there'll be a unique t if N>1000, and if the range is not very small). ps. For large bounds we have exact prime counts for [2^b,2^(b+1)), but you can also use estimations. Don't count composite q values, because that mess up these things, depends on your sieving bound etc. Why would be hard to fool it? Because for actual q prime divisors of mp we have also H=1, if you could find these q much faster, than the whole tf would be also much faster. Last fiddled with by R. Gerbicz on 20190224 at 00:19 Reason: typo 

20190224, 01:03  #31  
Serpentine Vermin Jar
Jul 2014
3·5·7·31 Posts 
Quote:
I just specified the cpu type as "Nvidia,RTX2080" just to have something in there (a true, standard format should be adopted so any devs are agreeing to a common thing like "Manufacturer,Model,whatever") Some other things like L1/L2 cache sizes, # of cores, I just set to 0 for cache, 1 for # of cores. The exact values there don't matter so much although it could come into play during assignments when trying to see if an assignment could feasibly complete in X amount of time. Other things like the "feature set"... not sure what would be agreeable for GPUs there since I'm not a GPU guy. Point being there, I was able to shove in a new computer account that way. 

20190224, 01:14  #32  
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
17·251 Posts 
Quote:
There were hundreds or maybe over a thousand TF users who did not report a single factor; some with several hundred attempts. They would get a big ZERO thanks for nothing and probably never return. Then there were several dozen users with success rates well well over 1% (not only TJAOI at 99%) but a few who it seems don't bother to report NF. These would get relatively very large credit. 

20190224, 01:15  #33  
Serpentine Vermin Jar
Jul 2014
CB7_{16} Posts 
Quote:
If you're doing TF and not finding any factors, there's something wrong there (or in the case of these fraudsters, they're just making it up as they go). I'm not convinced whoever is doing this is just doing it for the credit, since it's essentially meaningless to anyone outside the Mersenne prime finder community, and it's a prestige thing really. Not sure what someone things they'll gain by doing this besides just being a <insert whatever bad word here> 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Results  ET_  Operazione Doppi Mersennes  604  20200326 15:17 
Where have all the TF results gone?...  lycorn  PrimeNet  22  20171002 02:40 
PGS Results  danaj  Prime Gap Searches  0  20170814 18:35 
CPU Results last 24 hrs  Unregistered  Information & Answers  3  20100726 00:49 
0x results...  Mike  PrimeNet  11  20040523 12:55 