Anyone knows about primegrid
 

I see the site [url]http://primegrid.com/[/url] . In this site they run project like NFSNET for factoring a RSA challenge number.But they are not mentinoning algorithm they are used.I hope they are using GGNFS implementations.
Anyone knows about it?

[QUOTE=koders333]I see the site [url]http://primegrid.com/[/url] . In this site they run project like NFSNET for factoring a RSA challenge number.But they are not mentinoning algorithm they are used.I hope they are using GGNFS implementations.
Anyone knows about it?[/QUOTE]

They are using..... (drum roll please!)

TRIAL DIVISION.

The Neo Project part 2. :rolleyes:

I'll check back on their progress in a couple billion years.

Not just <drum roll> trial division </drum roll> but
<cymbals>
trial division by all odd numbers
</cymbals>

[QUOTE=ColdFury]The Neo Project part 2. :rolleyes:

I'll check back on their progress in a couple billion years.[/QUOTE]
I've been wondering what this project could do better. It basically is run by one guy, who has zero time and whose primary interest is building a BOINC scheduler in perl. Going after RSA numbers is just a hook to lure people.

So, the obvious question: if you need a bunch of volunteers to test your code, and you have zero time to come up with something, and the something has to be interesting, what should you do?

jasonp

PS: NFS happens not to be an option with PrimeGrid, because of the data storage needs. ECM is not an option either, because the ECM that people care about requires even more memory in the client than an NFS siever.

[QUOTE=garo]trial division by all odd numbers[/QUOTE]

Hey, that increases their search speed by cutting out half of the numbers to try right???? :flex: :censored:

[QUOTE=jasonp]I've been wondering what this project could do better. It basically is run by one guy, who has zero time and whose primary interest is building a BOINC scheduler in perl. Going after RSA numbers is just a hook to lure people.

So, the obvious question: if you need a bunch of volunteers to test your code, and you have zero time to come up with something, and the something has to be interesting, what should you do?[/QUOTE]How about trial division of Fermat or iterated Mersenne numbers with exponents > 30 bits or so? That way, even if their trial-division code sucks they at least have >= (a snowball's chance in hell) of finding a previously unknown factor. Tony Forbes' MFAC code isn't all that fast (though probably an order of magnitude faster than the app in question here), but still managed to find the first known factor of F31. With RSA challenge numbers they have what is for all intents and purposes zero chance of success. Why doom oneself from the start? The only plausible answer I can come up with is ... because one is an idiot.

[QUOTE=jasonp]I've been wondering what this project could do better. It basically is run by one guy, who has zero time and whose primary interest is building a BOINC scheduler in perl. Going after RSA numbers is just a hook to lure people.

So, the obvious question: if you need a bunch of volunteers to test your code, and you have zero time to come up with something, and the something has to be interesting, what should you do?

jasonp

PS: NFS happens not to be an option with PrimeGrid, because of the data storage needs. ECM is not an option either, because the ECM that people care about requires even more memory in the client than an NFS siever.[/QUOTE]

I've heard the Dutch Power Cows are working at starting another ECCP project and are looking for developers. Perhaps he could offer his services to them?

[QUOTE=jasonp]ECM is not an option either, because the ECM that people care about requires even more memory in the client than an NFS siever.[/QUOTE]

He could easily generate a huge amount of small ECM work by deciding to work on Brent's factor list for bases larger than 1000. But then he would generate lots of factors, and have to spend time managing the results, another distraction for a manager already short on time. His present project will never overload him with results.