Go Back > Factoring Projects > NFS@Home

Thread Tools
Old 2021-05-05, 23:25   #1
Xyzzy's Avatar
Aug 2002

1FCA16 Posts
Default Adding unique relations

We played around with a bunch of old .dat files today and learned that once there are ~200-300M relations in a file, any additional relations that you add have ~50-70% duplicates.

So, if you want to add 10M unique relations to a job you really need to add ~20M relations.

This might already be obvious to everyone else, but it was new to us!

Xyzzy is offline   Reply With Quote
Old 2021-05-06, 02:15   #2
VBCurtis's Avatar
Feb 2005
Riverside, CA

2×32×5×53 Posts

This depends quite heavily on what size large primes are in use. 200M relations is just getting started for a 33LP job, and will still have pleasant duplication rates in the 20% range.

Also, the duplication rate seems to depend on the ratio of q-max to q-min; if you run 20-200MQ, the 200-210MQ range will have a higher duplicate rate than 200-210 would on a job that has only run 50-200M.

My testing with CADO and GNFS numbers is that a Qmax-to-Qmin ratio of 7 to 8 is about optimal- smaller Q sieve faster, but make the duplicate rate worse. Thus, the typical 25-200M or 30M-210M Q-ranges are just right for GNFS jobs!
VBCurtis is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
RDS's unique pedagogic ways R.D. Silverman Soap Box 137 2012-01-07 07:52
Factors for unique exponents? Dubslow Information & Answers 15 2011-10-17 02:53
A unique bug probably never before seen fivemack Msieve 1 2009-08-19 19:59
More relations mean many more relations wanted fivemack Factoring 7 2007-08-04 17:32
Unique Logic circuit grid. mfgoode Math 6 2006-10-03 17:10

All times are UTC. The time now is 18:39.

Thu May 6 18:39:19 UTC 2021 up 28 days, 13:20, 0 users, load averages: 3.21, 2.41, 2.22

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.