20210609, 03:00  #166 
"Ben"
Feb 2007
2^{2}·3·293 Posts 
Remaining composites for (4,9) and (3,9) got more work at 11M, no more factors.
Code:
06/08/21 17:59:09, Finished 5120 curves using AVXECM method on C198 input, B1=11M, B2=1100M 06/08/21 19:00:52, Finished 5120 curves using AVXECM method on C203 input, B1=11M, B2=1100M 06/08/21 19:42:15, Finished 5120 curves using AVXECM method on C168 input, B1=11M, B2=1100M 06/08/21 20:43:55, Finished 5120 curves using AVXECM method on C234 input, B1=11M, B2=1100M [edit] Several small factors removed, now a c130, c235, c287, and c300 remaining. [edit2] The c199 of point (8,9) has survived 13056 curves at 43M. I will finish by snfs if I can get a poly for it. Last fiddled with by bsquared on 20210609 at 03:42 
20210609, 07:16  #167  
Aug 2020
454_{8} Posts 
Quote:
I used your equations to calculate the parameters and tried some variations, but it didn't do much. I tried algebraic and rational side sieving. Here's the latest parameters I used (note the commented lines). Cado chose 17,000,000 relations wanted. Code:
tasks.lim0 = 13600000 tasks.lim1 = 13600000 tasks.lpb0 = 28 tasks.lpb1 = 27 tasks.sieve.mfb0 = 55 tasks.sieve.mfb1 = 54 tasks.sieve.lambda0 = 2.5 tasks.sieve.lambda1 = 2.5 #tasks.sieve.ncurves0 = 20 #tasks.sieve.ncurves1 = 17 tasks.I = 13 tasks.qmin = 200000 tasks.sieve.qrange = 10000 #tasks.sieve.rels_wanted = 35000000 tasks.sieve.sqside = 0 That's the poly: Code:
n: 763374743763081217914694138634486780344024237091539368674972788624046972741046710708718787293421106975357383724033172253608940141301420411687874833865804305796864727 skew: 5.27952 c4: 1 c3: 12 c2: 62 c1: 168 c0: 196 Y1: 1419008023915103851777842927951067360939048893550 Y0: 23208752137879949244324153950621937803310882681351 Last fiddled with by bur on 20210609 at 07:18 

20210609, 13:18  #168 
"Curtis"
Feb 2005
Riverside, CA
1001100000000_{2} Posts 
I'd raise both large prime bounds by 2, and both mfb's by 4.
I'd consider I=13 and I=14, using whichever sieved faster (lower ETA after, say, 1% of the job or a couple workunits per client had finished). If the ETAs are close, use the larger siever as it will generate fewer duplicate relations and thus gain time in a hidden way. 
20210609, 13:55  #169 
Aug 2020
2^{2}·3·5^{2} Posts 
For I=13 that results in 18000 rels / 10000 q, but also in 63e6 rels wanted and an ETA of 38 h (34 h for initial parameters), so unless the previous relations were grossly underestimated that wouldn't be a gain.
I=14 yields even more rels/q (47000rels/10000q), but since sieving takes longer, so ETA after 0.4% is 44 hours. So if the relswanted estimated by cado for the initial parameters is correct, I should continue with them, especially since I already sieved for some hours. On the other hand, if the 63e6 is overestimated, then these new parameters would be much faster. Using the equation from the SNFS thread, the relations cado choose seems good. I get 15e6 for the inital parameters (28/27) and 68e6 for the new ones (30/29). Last fiddled with by bur on 20210609 at 14:41 
20210609, 15:00  #170  
"Max"
Jun 2016
Toronto
19·47 Posts 
Quote:
(9, 8) http://factordb.com/index.php?id=1100000002598671066 c158/snfs188 (survived t40 2800@B1=3M) c169 split by GCD; Stargate38  1; bsquared  1; 4 SNFS polys are coming for c158 

20210609, 15:45  #171  
"Curtis"
Feb 2005
Riverside, CA
2^{8}×19 Posts 
Quote:
I'm curious to hear how many relations / hours this job needs at the smaller parameters you chose; this thread may not be the place for it, you can PM me details if you decide not to post about them. I don't run jobs that have initial yield below 3.5 (35k relations per 10kQ), but that doesn't make it right. Last fiddled with by VBCurtis on 20210609 at 15:46 Reason: typo 8 hours > 6 hours 

20210609, 16:19  #172 
Jan 2012
Toronto, Canada
127_{8} Posts 
c188 = p51 * c138 by ECM, looks like I'll be doing both by GNFS  no polys needed.

20210609, 16:55  #173 
"Max"
Jun 2016
Toronto
37D_{16} Posts 
GCD run on June 8
@swishzzz
I attach a copy of my output. I used radius 2 instead of 1 (<=2 at the end of the line in your script). As expected, there were diagonal points with long GCDs (not anymore, as far as I see, we are just too fast at factoring). I will post my math analysis a bit later. For now, it seems that the factors of the 6th poly in the Magma script (x^4  24*x^3 + 152*x^2  336*x + 196, where x = a) can be (at least sometimes) recovered by 2 GCDs on three consecutive points (x1, y), (x, y), and (x+1, y). Last fiddled with by Max0526 on 20210609 at 17:03 
20210609, 18:04  #174  
"Ben"
Feb 2007
DBC_{16} Posts 
Quote:
Code:
n: 65450905747953132329287628843212925588466942908707926747521851453432385566465577084163919043429825490519033179336453712931411833277467544260317417144700707839 type: snfs skew: 3.741 c4: 1 c3: 6 c2: 17 c1: 84 c0: 196 Y0: 31163499011003626601359716776483379457194762910 Y1: 15539382401903125112142699946841259192950669329 Over my lunch hour I modified yafu to be able to read in these polynomials and suggest parameters. yafu has some builtin heuristics for skewing polynomials with badly mismatched norms. This is what it came up with for this poly, sieving with 13e on the rational side: Code:
rlim: 6955967 alim: 5208806 lpbr: 29 lpba: 27 mfbr: 58 mfba: 54 rlambda: 2.5 alambda: 2.5 

20210609, 18:25  #175  
"Max"
Jun 2016
Toronto
19×47 Posts 
Quote:
For the 3rd and 4th SNFS polys please see https://mersenneforum.org/showpost.p...&postcount=132 

20210609, 18:37  #176  
"Ben"
Feb 2007
DBC_{16} Posts 
Quote:
The 4 possible polys scores I see are: a1 Murphy = 1.533000e11 a2 Murphy = 9.510000e12 a3 Murphy = 1.335000e11 a4 Murphy = 1.274000e11 So the first one is the best. I have been getting the rational coefficient variations by plugging the following into wolfram alpha, where obviously the a1 changes based on the magma output: Code:
a1 = 31163499011003626601359716776483379457194762910/15539382401903125112142699946841259192950669329; a2=7*(a14)/(2*a17); a3 = 14/a1; a4 = 2*(2*a17)/(a14) Last fiddled with by bsquared on 20210609 at 18:37 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
factoring 2ⁿ2 equivalent to factoring 2ⁿ1(I think)  baih  Miscellaneous Math  9  20200921 07:11 
OpenCL GPU P1 Factoring and ECM Factoring  xx005fs  GPU Computing  3  20181027 14:49 