20090910, 13:26  #34  
Tribal Bullet
Oct 2004
3×1,181 Posts 
Quote:
Mea culpa. 

20090910, 14:16  #35 
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}×3^{2}×179 Posts 
I think that's simply that for a long time they were the largest; even now they're thirdlargest, after some lucky ECM results on the 7 tables and mersenneforum's hammering away at 2. It looks as if the BOINC project is pretty much exactly the right scale for finishing off the Cunningham mostwanted lists; if it sieves faster than Greg can process alone, I'm happy to contribute a quadcore.

20090910, 14:19  #36  
Jun 2005
lehigh.edu
2^{10} Posts 
Quote:
page 106 that aren't yet reserved. (We recently finished the last one from page 107.) Last I heard, Greg's looking at two more numbers under difficulty 250. Bruce 

20090910, 15:09  #37  
Jun 2005
lehigh.edu
400_{16} Posts 
Quote:
at one of the RSA conferences (in California), if I recall correctly from the seti people; I'm thinking 19992001, ridiculing distributed factoring projects for not managing to produce clients that could be run by people that don't already have advanced degrees in computing, math or physics. There was an early attempt at such a client in the project that factored RSA130 in 1995, as for example at http://www.npac.syr.edu/factoring.html I ran a hand distribution project for a small slice of the first snfs factorization above 768bits. For a laugh, you could check http://www.lehigh.edu/~bad0/cabal773.html from March 2000. Unfortunately, the files from the NFSNet project no longer seem to be available, but the discussion here on the forum dates from 2003. An early project from the era of that RSA presentation (without much wide participation, but the first parallel matrix use) is extracted at http://www.lehigh.edu/~bad0/msg06332.html One last reference, if I'm recalling correctly, the group at epfl (with some of the leading factoring research) had BOINC clients for some portion of their work on MD5/SHA1. But still, no BOINC wrapper for NFS factoring until your group. Can you account for your success at an objective that's been so elusive for such a long time? We all knew Quote:
Bruce 

20090910, 19:07  #38 
Sep 2009
2·3·163 Posts 
My Internet access at home came back today without intervention on our part, after going away for two days without intervention on our part... so if things remain the same, I'll be able to reply in the topics, and launch some WUs and do other administrative stuff on the rsals BOINC server.
Well, I'd be fairly surprised that nobody before us had ever tried making a BOINC version of any NFS implementation... so I have no convincing explanation for our success at an objective that's been elusive for a long time (we didn't know that, we learnt it in jasonp's post) In the TIZ80 & TI68k communities, nobody but "FloppusMaximus" Benjamin Moody ever figured that in 2009, factoring 512bit integers is, after all, rather easy (~73 days on his single, fairly ancient, dualcore Athlon 64). "Godzil" suggested making a BOINC client, and "squalyl" implemented a small set of modifications that did the job well enough, with contributions from "FloppusMaximus". Now, we can all work together (well, those who aren't on holiday or otherwise busy  squalyl is) on gnfslasieve* and other items of the common wish/todo list I don't know what kind of integers rsals is going to tackle next, but it's clear that we need to learn a few tricks so as to become more efficient. This forum is an excellent place for that 
20090911, 08:35  #39  
(loop (#_fork))
Feb 2006
Cambridge, England
192C_{16} Posts 
Quote:
I am sure the BOINC basic infrastructure is very efficient, but if you leave the graphical frontend boincmgr running 24/7 it eats about a quarter of a CPU. 

20090911, 12:28  #40  
Nov 2003
2^{2}·5·373 Posts 
Quote:
It depends upon one's objectives. If one merely wants to produce factorizations, then NFS@HOME is a fantastic idea. However, I don't see NFS@HOME as being a leading edge research tool. Does anyone envision it attempting (say) the RSA768 effort that is now underway? However, factorizations by themselves don't have all that much value. It is certainly fun, but I still think that O. Atkin's comment is applicable. If one wants to do research into improving factoring algorithms (and the code used to implement them), then advanced degrees become a requirement. 

20090911, 15:36  #41 
A Sunny Moo
Aug 2007
USA (GMT5)
3×2,083 Posts 
Really? You sure on that one? Because I don't remember it being that bad back when I ran BOINC fulltime a few years ago. Or do you only mean that it eats a quarter of the CPU time if you leave boincmgr actually up on the screen, rather than minimized to the system tray?

20090911, 16:08  #42  
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}×3^{2}×179 Posts 
Quote:


20090911, 16:08  #43  
Jun 2003
Ottawa, Canada
3·17·23 Posts 
Quote:
Jeff. Last fiddled with by Jeff Gilchrist on 20090911 at 16:09 

20090911, 16:27  #44  
A Sunny Moo
Aug 2007
USA (GMT5)
3×2,083 Posts 
Quote:
As I recall, boincmgr didn't use tons of CPU time on Windows; but then again, I had it minimized to the system tray most of the time. I think boinc.exe itself actually accumulated more CPU time (on the order of a couple of minutes a week) than boincmgr.exe did for the same period of time (about 1520 seconds at max). 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Boinc Statistics for NFS@Home borked ?  thomasn  NFS@Home  1  20131002 15:31 
BOINC NFS sieving  RSALS  debrouxl  NFS@Home  621  20121214 23:44 
BOINC?  masser  Sierpinski/Riesel Base 5  1  20090209 01:10 
BOINC?  KEP  Twin Prime Search  212  20070425 10:29 
BOINC  bebarce  Software  3  20051215 18:35 