Fast Breeding (guru management) - Page 50

xilman · 2016-05-17, 08:38

Quote:

Originally Posted by debrouxl

If CADO generates better polynomials than msieve in the difficulty ranges we're interested in, like it does for large numbers nowadays, yeah, that would make sense. I suggested msieve because that's what we know best, and using it is easy

Having used both cado-nfs and msieve, I'd say the choice isn't clear cut. For a given amount of computation, cado-nfs usually generates better polynomials. For a given amount of time, msieve running on a gpu-equipped machine usually wins out. Brute force can indeed be competitive with smartness.

Quote:

Originally Posted by debrouxl

all projects maintain information about factors and who found them.

Something I've been keen on for the GCW and HCN projects since day one. It irritates me intensely that three factorizations in the GCW tables are labelled "Anonymous lookup 2016-0x-yz" because the only source I can find is FactorDB. In these cases the date is that when I looked up the factorization, not the date when it was first discovered.

chris2be8 · 2016-05-17, 15:52

Quote:

Originally Posted by xilman

It irritates me intensely that three factorizations in the GCW tables are labelled "Anonymous lookup 2016-0x-yz" because the only source I can find is FactorDB. In these cases the date is that when I looked up the factorization, not the date when it was first discovered.

If you look up each of the factors and click the arrow next to "More information" you should be able to find when the factor was added to factordb.

I know factordb keeps other information, including the IP address it was submitted from, but I don't know any way to get that (short of asking Syd, if you can find him).

Chris

swellman · 2016-05-17, 20:40

Here are the last of the "easy" xyyx composites needing no additional ECM. Polys are attached.

C187_133_54
C215_134_80
C189_134_82
C211_123_77
C179_125_73
C203_125_72
C203_148_46
C225_122_79
C209_131_59
C207_130_108
C216_150_44
C204_121_84

C199_121_91 (survived 8000 curves @B1=11e7)

The remaining SNFS numbers of the xyyx project are being queued for proper ECM vetting.

XYYXF · 2016-05-19, 04:39

Quote:

Originally Posted by debrouxl

Andrey: which number / polynomial from that page, exactly ?

That would be food for 15e. And I'll probably queue it before the big GNFS 188.

Here we are:

Code:

n: 344791381226851287279185036034642635800505109743063349757290593755437104984269862201468187980362970210149169351930
33172364267380987223293686993196656448672279611520337389721
skew: 1335808.0
c0: 387791869088524171451616910842298125552
c1: -1627706106635766854677420302311924
c2: 713730807612923775332352144
c3: 2041990797545923660967
c4: -104446892249868
c5: 36412740
Y0: -1232221203350897612542968561876865
Y1: 18890353014002536254449
# MurphyE (Bf=1.00e+07,Bg=5.00e+06,area=1.00e+16) = 2.25e-13
# lognorm 53.56

Dubslow · 2016-05-19, 05:09

I see I'll have to look into providing test sieving as well as poly select...

VBCurtis · 2016-05-19, 05:44

I'll have a 2.26 and a pair of 2.20's in the poly select thread for this C173 shortly. A second -npr run is finishing up presently.

jasonp · 2016-05-19, 13:45

Grid-based GNFS polynomial selection is something that has interested me for years. Adding a GPU application to NFS@Home can potentially bring in hordes of new contributors, and I think that nobody has really pushed the limits of massively parallel polynomial selection at the largest input sizes. Also, if the administrative effort is tolerable we can run CADO-NFS for smaller poly selection jobs (say, 1 host = 1 number) and GPU Msieve for larger ones, possibly as a first stage for the latter with offline CADO polishing of the best results.

I would be willing to devote time to make some fraction of the above happen; what would we need?

pinhodecarlos · 2016-05-19, 14:23

Quote:

Originally Posted by jasonp

I would be willing to devote time to make some fraction of the above happen; what would we need?

Contact Greg in first instance...
From my side I'll bring some GPU power to the project (it must pay very good credits like Collatz project, 3500 points per 60 seconds run)

fivemack · 2016-05-21, 08:35

nfs@home is sieving, and Dmitri is linear-algebraing, 118^109+109^118, but this is already factored in factordb and in XYYXF's results2.txt file (creation date of factor 29/4/2016 0106 or so)

unconnected · 2016-05-21, 09:43

Quote:

Originally Posted by fivemack

nfs@home is sieving, and Dmitri is linear-algebraing, 118^109+109^118, but this is already factored in factordb and in XYYXF's results2.txt file (creation date of factor 29/4/2016 0106 or so)

It's already reported - http://mersenneforum.org/showthread....664#post432664

And C167 from aliquot 3366:2132 was factored too - http://mersenneforum.org/showthread....503#post433503

They can be removed from the list.

swellman · 2016-05-21, 10:50

146^61+61^146 has been reported as well. http://www.mersenneforum.org/showpos...&postcount=849. It can be moved to completed status.

2016-05-21, 08:35	#548
fivemack (loop (#_fork)) Feb 2006 Cambridge, England 2³×11×73 Posts	An error has occurred nfs@home is sieving, and Dmitri is linear-algebraing, 118^109+109^118, but this is already factored in factordb and in XYYXF's results2.txt file (creation date of factor 29/4/2016 0106 or so)

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
System management notes	kriesel	kriesel	7	2020-10-21 18:52
Improving the queue management.	debrouxl	NFS@Home	10	2018-05-06 21:05
Script-based Primenet assignment management	ewmayer	Software	3	2017-05-25 04:02
Do normal adults give themselves an allowance? (...to fast or not to fast - there is no question!)	jasong	jasong	35	2016-12-11 00:57
Power Management settings	PrimeCroat	Hardware	3	2004-02-17 19:11

2016-05-19, 05:09	#544
Dubslow Basketry That Evening! "Bunslow the Bold" Jun 2011 40<A<43 -89<O<-88 3×29×83 Posts	I see I'll have to look into providing test sieving as well as poly select...

2016-05-19, 05:44	#545
VBCurtis "Curtis" Feb 2005 Riverside, CA 11·443 Posts	I'll have a 2.26 and a pair of 2.20's in the poly select thread for this C173 shortly. A second -npr run is finishing up presently.

2016-05-19, 13:45	#546
jasonp Tribal Bullet Oct 2004 3×1,181 Posts	Grid-based GNFS polynomial selection is something that has interested me for years. Adding a GPU application to NFS@Home can potentially bring in hordes of new contributors, and I think that nobody has really pushed the limits of massively parallel polynomial selection at the largest input sizes. Also, if the administrative effort is tolerable we can run CADO-NFS for smaller poly selection jobs (say, 1 host = 1 number) and GPU Msieve for larger ones, possibly as a first stage for the latter with offline CADO polishing of the best results. I would be willing to devote time to make some fraction of the above happen; what would we need?

2016-05-21, 10:50	#550
swellman Jun 2012 11·281 Posts	146^61+61^146 has been reported as well. http://www.mersenneforum.org/showpos...&postcount=849. It can be moved to completed status.