Cooperative Agreement or Capitalist Takeover? You decide!

[davieddy]

Originally Posted by Dubslow

Ah, seems kind of obvious now.

From your PM apparently not.
3) was supposed to mean "Ask Ernst about it"

[xilman]

Originally Posted by davieddy

From your PM apparently not.
3) was supposed to mean "Ask Ernst about it"

As in "How shall we go FORTH and multiply, oh Lord?"

[davieddy]

Blessed are the cheesemakers.

[Dubslow]

As chalsall pointed out somewhere, M@H has apparently shutdown. It appears that the admin wasn't not able to continue with it for personal reasons, though I may be reading too much into it.

He did recommend GIMPS for those with an interest in Mersenne primes.

Originally Posted by Sebastian Bobrecki

I regret inform that unfortunately I have no further possibility of engaging in and maintaining the project. Therefore, I decided to turn it off. I'm sorry that it did not give this information earlier, but I was hoping that maybe is possible to do something so that this did not happen. I would also like to thank all the volunteers and the BOINC community for your support.

I also encourage everyone to continue support other BOINC projects, and those particularly interested in the subject of Mersenne numbers, to the GIMPS project.

At this site you can find all the divider from the project database. It will remain available for some time.

Once again, I would like to thank all of you and good luck.

I think this dump should be taken seriously, as this very thread has proven that GIMPS has missed some factors.

[Uncwilly]

Originally Posted by Dubslow

I think this dump should be taken seriously, as this very thread has proven that GIMPS has missed some factors.

Has anyone compared them to the list from GIMPS and submitted those that were missed?

[Dubslow]

Originally Posted by Uncwilly

Has anyone compared them to the list from GIMPS and submitted those that were missed?

I'd do it myself, but today is the start of a five day vacation and I can't write code. If no one has done it then, I'll do it. (I think chalsall could do it easily enough.)

PS I knew I forgot something in my first post!!!

Now that M@H is out of business, should we consider BOINCifying Prime95 and creating a server? I'm pretty sure we could get a massive throughput increase.

First, someone would need to BOINCify Prime95. (GC?)

Second, and harder, someone would need to create a BOINC server that's integrated with PrimeNet. Ideally this would be on the same hardware, but considering that we can barely get PrimeNet alone to work, that may not be viable, but I'm not sure how else it could be done with any sort of decent efficiency. (Mayber, perhaps it's possible to do something like GPU273, but then that would require advanced reservations as GPU273 does now. Probably not a good idea.)

[Uncwilly]

Originally Posted by Dubslow

Now that M@H is out of business, should we consider BOINCifying Prime95 and creating a server? I'm pretty sure we could get a massive throughput increase.

First, someone would need to BOINCify Prime95.

I think that TF and ECM would be good work types for it. If the extra resources are put toward 60m-100m, they could be given discreet areas and levels. Then the GPU's could follow through taking them to the upper bit levels.

[Batalov]

Originally Posted by Uncwilly

Has anyone compared them to the list from GIMPS and submitted those that were missed?

George said that he was on it already (low priority, though).

He also had contact with Bobrecki and loaded the June batch into PrimeNet. There were ~100 factors, mostly for those exponents that had already had a factor (this is how TF mod 120 works; cf. mfaktc; the first found factor is not necessarily the smallest but the default behaviour was to report and get the next one).

That dump seems huge, but if you'd care to get it (as I did), you will find that it contains mostly other people's factors (e.g. for p<1200 from Cunnighams; huge factors; they couldn't have found them). The largest part of the dump file are factors for 10^9<p<10^10. Many are simply 2p+1. The whole file could have been reorganized for storing k's and putting very small k's in a separate dump.

EDIT2: you don't have to get the file if you are only curious. It contains just one factor per exponent (ostensibly the smallest); it would be a big hit on the GIMPS database if everyone (and their mums) will start essentially screenscraping known factors from it. The bottleneck is to efficiently dump the known factors from GIMPS and compare. It is best left to George.

[chalsall]

Originally Posted by Dubslow

First, someone would need to BOINCify Prime95. (GC?)

Second, and harder, someone would need to create a BOINC server that's integrated with PrimeNet. Ideally this would be on the same hardware, but considering that we can barely get PrimeNet alone to work, that may not be viable, but I'm not sure how else it could be done with any sort of decent efficiency. (Mayber, perhaps it's possible to do something like GPU273, but then that would require advanced reservations as GPU273 does now. Probably not a good idea.)

If someone was willing to BOINCify Prime95/mprime (and possibly mfakt*), I'd be willing to take responsibility for the BOINC server side of things. I could run it on the same server as GPU72.com (lots of capacity), and I've been looking into BOINC already for another project.

As with GPU273 (), this would have to be done with the knowledge and approval of George. But I don't see any real issues with reserving reasonable ranges and quantities of candidates.

[Dubslow]

Originally Posted by chalsall

If someone was willing to BOINCify Prime95/mprime (and possibly mfakt*), I'd be willing to take responsibility for the BOINC server side of things. I could run it on the same server as GPU72.com (lots of capacity), and I've been looking into BOINC already for another project.

As with GPU273 (), this would have to be done with the knowledge and approval of George. But I don't see any real issues with reserving reasonable ranges and quantities of candidates.

Interesting: BOINC's description of volunteer computing mentions GIMPS more than once.

http://boinc.berkeley.edu/trac/wiki/VolunteerComputing

The main problem I see with BOINCifying Prime95 is the conflict between Prime95's built-in priority/affinity routines and those that come with BOINC. I'd be curious what Greg (or other such knowledgeable persons) think about such an endeavor.

Edit: The other problem is the security code. How does BOINC secure its communications?

[axn]

Originally Posted by Dubslow

The main problem I see with BOINCifying Prime95 is the conflict between Prime95's built-in priority/affinity routines and those that come with BOINC. I'd be curious what Greg (or other such knowledgeable persons) think about such an endeavor.

In BOINC world, when crunching multiple WU's, you launch multiple copies of the app. So BOINC-ified P95 would benefit by cutting out all multi-threaded codes, dealing with affinities, etc -- just assume that you're running one thread only.