![]() |
|
|
#562 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
3·5·227 Posts |
GPU-TF threw off the balance of TF-PM1. In the old days (pre-GPU) there was alternation with low-TF, then P-1, then high-TF, then LL. GPU-TF changed the equation by making TF much cheaper. It might be useful to reexamine the methodology with the current set of GPU-TF, CPU/GPU-PM1, CPU/GPU-PRP+Cert software and see if the current order and limits of factoring methods is still optimal.
|
|
|
|
|
|
#563 |
|
"Bill Staffen"
Jan 2013
Pittsburgh, PA, USA
6508 Posts |
I'm working from very old and sluggish memories here, but the problem with running p-1 on GPUs was having enough memory to set useful bounds, right? That's why we do the gpu-tf; more discrete sizes?
|
|
|
|
|
|
#564 | |
|
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
2×7×383 Posts |
Quote:
GPUs go higher on TF because they are much faster at the single precision computations used in TF relative to DP-type computations used in primality testing or P-1; ratios ~11 to 40 or so are common. CPUs' speed ratios are much smaller, typically 0.7 to 1.5. |
|
|
|
|
|
|
#565 | |
|
Random Account
Aug 2009
36418 Posts |
Quote:
I ran a lot of P-1's in the pre-GPU days despite not being able to make a direct connection between P-1 bounds and TF start and stop bits. |
|
|
|
|
|
|
#566 |
|
"Oliver"
Sep 2017
Porta Westfalica, DE
72·11 Posts |
I guess in this case, your topic was "ignored" because no one had a good answer.
Especially, when P-1 are going to be reevaluated now.
|
|
|
|
|
|
#567 |
|
Random Account
Aug 2009
36418 Posts |
I understand what you mean by reevaluated, in this case. Their necessity, now that GPU's are becoming more powerful all the time. Recently, I have seen P-1 tests which indicate the exponent was trial-factored to 78 bits. 80, and beyond, TF's will not be all that far behind for those who can run them in what they feel is a practical period of time.
|
|
|
|
|
|
#568 |
|
"Oliver"
Sep 2017
Porta Westfalica, DE
72×11 Posts |
|
|
|
|
|
|
#569 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
3×5×227 Posts |
I don't think that's what kruoli meant, but rather the the calculus of optimal P-1 bounds (and TF limits) will change with the new PRP+Cert worktype that should, eventually replace LL+DC (or equivalent) with a single test and small verification, thereby eliminating (approximately) half the effort, therefore the effort applied to TF and P-1 should be approximately half what it currently is (in broad terms).
|
|
|
|
|
|
#570 | ||
|
Random Account
Aug 2009
32·7·31 Posts |
Quote:
Quote:
|
||
|
|
|
|
|
#571 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23×1,223 Posts |
Remember that each bit level of TF is twice the effort of the one before it. So, 1 bit level less. And that leaves more factors in the low end of the P-1 search to be found.
We live in interesting times.
|
|
|
|
|
|
#572 |
|
Random Account
Aug 2009
111101000012 Posts |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Prime95 version 29.2 | Prime95 | Software | 71 | 2017-09-16 16:55 |
| Prime95 version 29.1 | Prime95 | Software | 95 | 2017-08-22 22:46 |
| Prime95 version 26.5 | Prime95 | Software | 175 | 2011-04-04 22:35 |
| Prime95 version 25.9 | Prime95 | Software | 143 | 2010-01-05 22:53 |
| Prime95 version 25.8 | Prime95 | Software | 159 | 2009-09-21 16:30 |