20090911, 19:04  #45  
Jul 2003
So Cal
2^{4}×139 Posts 
Quote:


20090911, 20:57  #46 
Jul 2003
So Cal
2224_{10} Posts 
The first factors are in. 2,2214L factors as
87digit prime factor: 650129030757448838848987009049036364296974617097033424890396170500076127717454884707697 104digit prime factor: 11946827680341235646112762882603877501599655320760206302298918228497279186673314456312477897500132634593 Greg 
20090911, 21:05  #47 
Sep 2009
2×3×163 Posts 
FWIW, for the 512bit RSA keys of rsals, each WU (gnfslasieve4I14e, 32bit) usually took less than 150 MB of RAM.
frmky: nice How much raw CPU time for gnfs and for msieve ? Last fiddled with by debrouxl on 20090911 at 21:12 
20090911, 21:23  #48 
Jul 2003
So Cal
2^{4}·139 Posts 
The community contributed about 140 days of CPU time to the sieving. msieve took 2 days to do the filtering, linear algebra, and square roots. For reference, this was about as difficult as 492bit RSA would be, so a bit easier than RSA512.
The sieving for 5,353+ is nearly done. For that one, the community has contributed about 2 years of CPU time. For reference, that is about as difficult as 547bit RSA would be. 
20090911, 23:38  #49  
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}·3^{2}·179 Posts 
Quote:
The sieving is however (as I've heard attributed, but not citably, to Churchill) a matter of applying increasingly great resources to a wellunderstood problem. http://ludwigsun1.unil.ch/~hstockin/crypto/ has information about one of the grant requests for doing the sieving, on a grid; Quote:
Last fiddled with by fivemack on 20090911 at 23:39 

20090912, 00:11  #50 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
59×163 Posts 

20090912, 02:49  #51  
Nov 2003
2^{2}×5×373 Posts 
Quote:
The U.S. government gives access grants to large scale compute projects. The grants are for the 80,000+ node (yes, 80,000 CPUs) supercomputer at Oakridge. I suspect that this machine is big enough/fast enough. 

20090912, 04:10  #52 
Jul 2003
So Cal
2^{4}·139 Posts 

20090912, 06:40  #53 
Nov 2008
2·3^{3}·43 Posts 
Could you quickly (a few hours) put an end to the c141 that is blocking aliquot sequence 4788? Noone seems to want to find a poly.

20090912, 06:44  #54  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
13462_{8} Posts 
Quote:
TBH it would take me a while to do a large enough poly search if anyone fancies doing it quickly feel free 

20090912, 14:21  #55  
Jan 2005
Minsk, Belarus
2^{4}·5^{2} Posts 
Quote:
since I'm the coordinator of this project, please let me know if some new results appear :) 

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 