mersenneforum.org  

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

Reply
 
Thread Tools
Old 2010-12-18, 04:20   #12
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

2×11×283 Posts
Default

Quote:
Originally Posted by axn View Post
Unless that line itself is checksum protected to prevent/detect tampering, I can hand edit the values to something ridiculously big*. Now _that_ would be open to abuse.

*Find the largest factor of p-1. Set my B1 = that factor - 1. Then set B2 = 10000 * that factor.
For eg:- 9125624223117137685847-1 = 2*3*13*109*5392193*199056357361
Set B1 = 199056357360 and B2 = 1990563573600000. Watch the credits roll in
Well if PrimeNet-credits == dollars then it might be worthwhile to some people to do that. But currently there is no point to amassing false credit. You'd just make yourself look stupid. Or in my case -- stupider.
retina is online now   Reply With Quote
Old 2010-12-18, 04:28   #13
axn
 
axn's Avatar
 
Jun 2003

32×5×113 Posts
Default

Quote:
Originally Posted by retina View Post
Well if PrimeNet-credits == dollars then it might be worthwhile to some people to do that. But currently there is no point to amassing false credit. You'd just make yourself look stupid. Or in my case -- stupider.
Yep
axn is offline   Reply With Quote
Old 2010-12-18, 20:27   #14
Bdot
 
Bdot's Avatar
 
Nov 2010
Germany

3×199 Posts
Default

Quote:
Originally Posted by axn View Post
Unless that line itself is checksum protected to prevent/detect tampering,
I would not mind a checksum per complete result, not just for the last line. But I'm also OK with the way it is right now. I think it is better to have a successful run (i.e. find a factor) than having the credit account bigger than the factors I find.

Quote:
Originally Posted by axn View Post
9125624223117137685847-1 = 2*3*13*109*5392193*199056357361
What do you use to factor the (factors-1)? prime95 isn't doing that, is it?
Bdot is offline   Reply With Quote
Old 2010-12-18, 20:51   #15
axn
 
axn's Avatar
 
Jun 2003

32×5×113 Posts
Default

Quote:
Originally Posted by Bdot View Post
What do you use to factor the (factors-1)? prime95 isn't doing that, is it?
There are a number of programs freely available. I used PARI/GP. msieve and yafu can do much harder factorizations.
axn is offline   Reply With Quote
Old 2010-12-19, 02:49   #16
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by Bdot View Post
What do you use to factor the (factors-1)? prime95 isn't doing that, is it?
Quote:
Originally Posted by axn View Post
There are a number of programs freely available. I used PARI/GP. msieve and yafu can do much harder factorizations.
Another simple way to do it is to look it up at factordb.com. It does easy factorizations like that near-instantly when you ask for the page.

Last fiddled with by Mini-Geek on 2010-12-19 at 02:50
Mini-Geek is offline   Reply With Quote
Old 2010-12-19, 22:03   #17
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22×3×641 Posts
Default

Or at Factoris http://wims.unice.fr/wims/wims.cgi?c...ebra/factor.en
cheesehead is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Insufficient Information for accurate CPU Credit TheMawn GPU Computing 4 2014-06-07 20:52
Account Information Primeinator Information & Answers 13 2011-12-03 19:42
Insufficient information for accurate CPU credit Yura Information & Answers 11 2011-06-22 11:52
Program information use Unregistered Information & Answers 0 2009-08-30 19:03
Is More Information Better? davar55 Puzzles 3 2009-07-02 20:25

All times are UTC. The time now is 06:51.


Fri Aug 6 06:51:39 UTC 2021 up 14 days, 1:20, 1 user, load averages: 2.73, 2.83, 2.78

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.