mersenneforum.org 65 bit to 66 bit unit time expansion
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2002-12-19, 23:04 #1 Jwb52z     Sep 2002 3×269 Posts 65 bit to 66 bit unit time expansion What's the expansion factor/rate when going from 65 to 66 bits in relation to the time that units take to finish?
2002-12-20, 07:15   #2

"Richard B. Woods"
Aug 2002
Wisconsin USA

1E0C16 Posts

There are twice as many potential factors between 2^65 and 2^66 as there are between 2^64 and 2^65.

In general, trial factoring from 2^n to 2^n+1 requires about as many trials of potential factors as trial factoring from 2^1 all the way to 2^n. I.e., each increase of 1 in the power-of-2 doubles the total trials requirement up to the power-of-2 limit.

Here's a section of comment in the source code of Prime95 module commonc.c:
Quote:
 /* If factoring, guess how long that will take. Timings are based on */ /* how long it takes my PII-400 to process the exponent 12,000,017. */ /* Below 2^60, prime95 runs through 0.004093*2^58 factors in 3.198 seconds. */ /* Below 2^62, prime95 runs through 0.004093*2^58 factors in 3.204 seconds. */ /* Below 2^64, prime95 runs through 0.004093*2^58 factors in 5.949 seconds. */ /* Above 2^64, prime95 runs through 0.004093*2^58 factors in 13.511 seconds. */ /* Compute timing * 2^limit / (0.004093 * 2^58) * (12,000,017 / p) */ /* Which simplifies to: timing * 2^(limit-44) * 178945.25 / p */

 Similar Threads Thread Thread Starter Forum Replies Last Post rogue FermatSearch 6 2016-07-16 14:14 cmd cmd 118 2010-05-28 09:18 jinydu Lounge 4 2008-10-01 07:45 ltd Prime Sierpinski Project 12 2005-01-30 18:04 jinydu Lounge 2 2004-05-05 08:33

All times are UTC. The time now is 03:55.

Thu Dec 2 03:55:23 UTC 2021 up 131 days, 22:24, 0 users, load averages: 1.59, 1.59, 1.44

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.