mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Msieve (https://www.mersenneforum.org/forumdisplay.php?f=83)
-   -   Polynomial Request Thread (https://www.mersenneforum.org/showthread.php?t=18368)

swellman 2018-07-18 14:05

C178
 
We have several candidate polys to test sieve for the C178. I’m assuming everyone has finished searching? I’ll do test sieving later this week.

As to additional work, I have several GNFS type composites in the 188-190 range but they each need partial (~0.5) t60 run first, i.e. I got nuthin.

Max0526 2018-07-18 15:33

C178 polys
 
[QUOTE=swellman;492052]We have several candidate polys to test sieve for the C178. I’m assuming everyone has finished searching? I’ll do test sieving later this week.

As to additional work, I have several GNFS type composites in the 188-190 range but they each need partial (~0.5) t60 run first, i.e. I got nuthin.[/QUOTE]
I'll run a bulk CADO optimization on all candidates with E above 1e-13. You'll probably have some improvement on some of them by midday Friday.

swellman 2018-07-18 19:26

Thank you Max. Sounds good!

Max0526 2018-07-23 21:26

C178 polys
 
I didn't find anything better than E = 1.193e-13, sorry.

swellman 2018-07-24 00:21

[QUOTE=Max0526;492364]I didn't find anything better than E = 1.193e-13, sorry.[/QUOTE]

Thanks Max. That poly by Gimarel proved to be a winner, especially with 3 LP on the algebraic side. Characterizing it now, will post it sometime tomorrow.

Aliquot sequence 3366 has a C196 cofactor that is currently being ECM’d by yoyo up through t60. Should be done by late next week if folks are looking for a next GNFS target.

RichD 2018-07-25 02:15

C173 Poly
 
I have an OPN number ready for NFS. It would normally be considered for SNFS because the difficulty is about 239. With an exponent of 19, these are better sieved on the -a side. Still, it is a 32-bit job for 14e. I am hoping, with a really good poly, this could be shoe horned into a 31-bit GNFS job for the 14e queue.

3867675755483^19-1
[CODE]n: 17091144404057182526808435052712333380560284935301487306675211495551817989135893565600385540258585226003866292895782708444388831056595759837645167391205220793744645983786599[/CODE]

I'll take 1-2M.

swellman 2018-07-25 15:40

C173
 
I’ll be happy to help, but starting the effort will have to wait until some electrical work on my house is completed. Unsteady power while the electrician does his thing. Should be over by Monday.

Reserving 3-4M.

Max0526 2018-07-25 19:12

polyselect stage 1 question
 
I am sorry for posting it here, please refer me to the correct thread.

For a composite number n
[code]
n: 178840658547056398340661035575701801836589428489697812907837151638999043827732425417122362163295769975015657207507501412348850500995123605989554924733
[/code]and a module m1
[code]
m1: 77972851604033576932147301042208297167089808387024826713877498412713003039299041150987999294960402131018323564915377911651481766718632966635527763373
[/code]there exists a pair of (small) integers Y0 and Y1
[code]
Y0: -135858192307790840273969982972
Y1: 570849297736093
[/code]such that Y0 and Y1 can be used instead of m1, because
[code]
m1 = -Y0/Y1 mod n
[/code]I need to change the module to m2, m3, m4, and m5.
[code]
m2: 67047611475527282028037472437033488695089016240828896923379148834946058660177028494822752491424788233958196885277392148625303965906549424801644974992
m3: 111017471840654252200329108609908409127753430184477403583875663426566104676686520668738357823163330085395810708538692488780859948394461777982154709615
m4: 121279539261425493119920629465732455170326965790648352435420959581656047635052464730404054806274369280885771421718875648266735969599540314423373943177
m5: 5892545913983215686386404616596609555524647347312629057159864063118414958270401829793469076372922231244647819270503633352967621419209599900062563763
[/code]Is there any cost-effective way to find a new (small) pair of Y0 and Y1 for each of m2..m5.
If it helps, all of m1..m5 and n are factored on factordb.com.
Any advice is really appreciated.

Edit: Also, is there a way to find a different coprime pair Y0 and Y1 for m1?

Max0526 2018-07-25 20:20

polyselect stage 1
 
The quintic poly for the question above is
[code]
c0: 1643980082281399683050813997173432365
c1: 5927315077145304592680838374047
c2: 1141628259420241069559409
c3: -1020260890681555799
c4: -33414674686
c5: 3864
[/code]

RichD 2018-07-27 05:20

C173 Poly
 
Initial baseline.
[CODE]N: 17091144404057182526808435052712333380560284935301487306675211495551817989135893565600385540258585226003866292895782708444388831056595759837645167391205220793744645983786599
# expecting poly E from 2.27e-13 to > 2.61e-13
R0: -1738090497459750195898936653501944
R1: 2146814785490243
A0: 46181464502919860836995378136577256668853
A1: -94050063041537378096483400233223331
A2: 1698218502294420613255801753
A3: -16720100425522195909
A4: 51248834906034
A5: 1077480
skew 16673018.44, size 7.630e-17, alpha -7.486, combined = 2.435e-13 rroots = 3[/CODE]

Max0526 2018-07-27 19:42

C173
 
[QUOTE=RichD;492564]Initial baseline.
[CODE]N: 17091144404057182526808435052712333380560284935301487306675211495551817989135893565600385540258585226003866292895782708444388831056595759837645167391205220793744645983786599
# expecting poly E from 2.27e-13 to > 2.61e-13
R0: -1738090497459750195898936653501944
R1: 2146814785490243
A0: 46181464502919860836995378136577256668853
A1: -94050063041537378096483400233223331
A2: 1698218502294420613255801753
A3: -16720100425522195909
A4: 51248834906034
A5: 1077480
skew 16673018.44, size 7.630e-17, alpha -7.486, combined = 2.435e-13 rroots = 3[/CODE][/QUOTE]
It's a very solid baseline, only 6% below the current record. I can't spin it up.
I started CADO on this C173, I'll do 0-500K.


All times are UTC. The time now is 23:05.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.