20210903, 09:52  #1838 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·1,657 Posts 

20210903, 14:09  #1839 
Aug 2005
Seattle, WA
2·3^{4}·11 Posts 

20210903, 15:02  #1840  
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3×1,657 Posts 
Quote:
Dates are here (https://formulaboinc.org/sprint.py?...ang=&year=2021), a project is announced 24h before start but by its voting from the forum you can have an idea which one could be. 

20210903, 15:10  #1841  
Jun 2012
3,203 Posts 
Quote:
Does anyone have composites ready for factoring? If so please post them! 

20210903, 15:38  #1842 
Sep 2009
2×3×163 Posts 
Several ideas from nearrepdigit:
* in the 15e range, https://stdkmd.net/nrr/c.cgi?q=14449_260 is at t55 for SNFS difficulty 261, so it wouldn't be too bad of an ECM miss. https://stdkmd.net/nrr/c.cgi?q=19997_274 and https://stdkmd.net/nrr/c.cgi?q=79999_277 are at t55 as well, so with higher risks of ECM miss, and closer to the end of the optimal 15e difficulty range; * https://stdkmd.net/nrr/c.cgi?q=71111_329 is supposedly at t65 and has a polynomial. Factoring this 208digit number would blast the current GNFS factorization record for the nearrepdigit project, currently at 183 digits. It's way beyond the lesser difficulties I'm used to for 14e and 15e to a lesser extent, so I have no clue whether this polynomial is good and which siever is best for such a number Last fiddled with by debrouxl on 20210903 at 15:44 
20210903, 16:13  #1843 
Sep 2009
2×3^{2}×11^{2} Posts 
I'll test sieve a few Brent tables numbers, to be sieved on either 15e or 15e_small as needed to keep the queues full.

20210903, 16:27  #1844  
Jun 2012
3,203 Posts 
Quote:
Code:
n: 1122306776491337588607322631818708778200214577213206237089370253284687138834200770294167044440649977604444005064220843458726284245767449140856119245849745806395315477933380280425456889166505800707705642211253 skew: 326211947.89 type: gnfs lss: 0 c0: 192558034193459742319046371398586259699707875364425 c1: 5387479895042599888816938205129089277819185 c2: 1098937059524264818729815697407187 c3: 104048030268009541344497393 c4: 47857156754642446 c5: 421635720 Y0: 4842112079991293167491670985200158992968 Y1: 4692246580297096789 # Murphy_E = 1.439e15, selected by Erik Branger # Polynomial selection took 4 months on a GTX760 # selected mechanically rlim: 1180000000 alim: 1180000000 lpbr: 32 lpba: 32 mfbr: 69 mfba: 69 rlambda: 2.8 alambda: 2.8 

20210903, 16:44  #1845 
Sep 2008
Kansas
2^{3}×431 Posts 

20210903, 16:53  #1846  
Aug 2005
Seattle, WA
2·3^{4}·11 Posts 
Quote:
 The numbers already in esmall should just about be enough to satisfy the demand.  One more number in e should be sufficient to satisfy demand there.  We won't even come close to finishing the next fsmall number. Of course, it would be nice to have a margin for error. But I don't think we have to scour far and wide for candidates. Just two or three of a reasonable size should do it. 

20210903, 17:10  #1847 
Jun 2012
3,203 Posts 

20210903, 17:15  #1848  
Jun 2012
3,203 Posts 
Quote:
I just like the idea of a G208 but it may be too difficult for 16f_small. Perhaps a team sieve? It is a record poly found over 4 years ago but never sieved. 

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 