Register FAQ Search Today's Posts Mark Forums Read

2020-05-22, 07:46   #496
fivemack
(loop (#_fork))

Feb 2006
Cambridge, England

22×3×232 Posts
L4375B done

This popped up on the Mersennus.net page and I managed to complete it in three real-time weeks on one machine (I'll admit it was an i9-7940X so quite a fast machine) - 2.5 days polynomial search, a bit of a gap while other jobs finished and I did the trial sieving, 12 days sieving, 1 day linear algebra.

32-bit LP, three algebraic large primes, alim=rlim=5e7, sieve Q=25M-75M (which is nice and round, but was determined by looking at yields incrementally rather than entirely in advance)

Notice how smooth the yield curve is when corrected for ideal count, and how the peak here is at alim. With this extra smoothness reasonable-sized trial sieving gives much more credible numbers; I'm not sure I'd have used 3lpa for things this small but it was clearly several percent better in the trial-sieve.

Expecting baby before next factor :)
Attached Thumbnails

Attached Files
 L4375B.log (37.1 KB, 13 views)

Last fiddled with by fivemack on 2020-05-22 at 07:47

2020-05-25, 15:33   #497
chris2be8

Sep 2009

2·3·7·43 Posts

Quote:
 Originally Posted by fivemack Notice how smooth the yield curve is when corrected for ideal count
Can you confirm the ideal count is the first number on the following line output by gnfs-lasieve4I14e (in this case over a range of 10k special-Q):
Code:
522 Special q, 3933 reduction iterations
If that's true how many ideals should I assume per 10M special-Q? This would be a big help trial sieving numbers for NFS@Home.

Chris

 Similar Threads Thread Thread Starter Forum Replies Last Post wblipp Factoring 463 2019-05-30 07:19 FactorEyes Factoring 2 2011-04-09 05:45 MatWur-S530113 PrimeNet 11 2009-01-21 19:08 jasong Programming 16 2006-11-07 01:03 GP2 Hardware 7 2003-11-24 06:13

All times are UTC. The time now is 17:20.

Sun May 31 17:20:56 UTC 2020 up 67 days, 14:54, 1 user, load averages: 1.58, 1.62, 1.66