mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2022-05-06, 23:34   #551
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

53·149 Posts
Default

30.8 build 15

Same as build 14 with a benchmarking bug fixed.

Windows 64-bit: https://mersenne.org/ftp_root/gimps/...8b15.win64.zip
Linux 64-bit: https://mersenne.org/ftp_root/gimps/...linux64.tar.gz
Source: https://mersenne.org/ftp_root/gimps/...b15.source.zip
Windows 32-bit: https://mersenne.org/ftp_root/gimps/...8b15.win32.zip
Linux 32-bit: https://mersenne.org/ftp_root/gimps/...linux32.tar.gz
Windows 64-bit service: https://mersenne.org/ftp_root/gimps/...64.service.zip
Windows 32-bit service: https://mersenne.org/ftp_root/gimps/...32.service.zip
Prime95 is offline   Reply With Quote
Old 2022-05-11, 02:48   #552
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

3,733 Posts
Default

While experimenting with an exponent that doesn't really need P-1 factoring, I found some unexpected/undesirable behavior. I put in worktodo:
Pfactor=1,2,30759907,-1,67,4,"321626045933562402713,450961853042521358761,914209853451433227449"
Prime95 asked the server for AID, server said not needed, so Prime95 rewrote the assignment line with N/A which is fine, but in doing so it lost the list of known factors:
Pfactor=N/A,1,2,30759907,-1,67,4

Small related request, when an assignment line does include a list of known factors it would be nice if the worker window displayed the list of skipped factors during P-1 initialization:
Quote:
Optimal P-1 factoring of M30759907 using up to 32768MB of memory.
Assuming no factors below 2^67 and 4 primality tests saved if a factor is found.
Already known factors: 321626045933562402713,450961853042521358761,914209853451433227449
Optimal bounds are B1=877000, B2=670821000
Chance of finding a factor is an estimated 12.1%
James Heinrich is offline   Reply With Quote
Old 2022-05-11, 03:50   #553
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

1ED916 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
While experimenting ... I put in worktodo:
Pfactor=1,2,30759907,-1,67,4,"321626045933562402713,450961853042521358761,914209853451433227449"
Pfactor= does not support a list of known factors.
Prime95 is offline   Reply With Quote
Old 2022-05-11, 10:41   #554
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

72258 Posts
Default

Quote:
Originally Posted by Prime95 View Post
Pfactor= does not support a list of known factors.
Mea culpa.

Would it be hard to make Pfactor support known-factors list?
James Heinrich is offline   Reply With Quote
Old 2022-05-11, 11:23   #555
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

373310 Posts
Default

Another obscure output request: If worktodo says Factor=<exponent>,72,73 the worker window says things like:
Quote:
Starting trial factoring of <exponent> to 2^73
Trial factoring <exponent> to 2^73.
Trial factoring <exponent> to 2^73 is 0.090127% complete. Time: 11.789 sec.
It notably says the TF target level but does not mention the starting bit level. The output would be better with:
Quote:
Starting trial factoring of <exponent> from 2^72 to 2^73
Trial factoring <exponent> from 2^72 to 2^73.
Trial factoring <exponent> from 2^72 to 2^73 is 0.090127% complete. Time: 11.789 sec.
I know Prime95 should rarely-to-never be used for TF these days, but should be a trivial fix.

Last fiddled with by James Heinrich on 2022-05-11 at 11:24
James Heinrich is offline   Reply With Quote
Old 2022-05-11, 14:45   #556
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
Not U. + S.A.

7·307 Posts
Default

Quote:
Originally Posted by Prime95 View Post
Pfactor= does not support a list of known factors.
But Pminus1 does, I believe.

Off-topic: gpuOwl does not support Pminus1. The best time I can get using Prime95 for a wavefront P-1 is around 8 hours. I can do it with gpuOwl in 2 using a 6.x version. I note the bounds Prime95 uses and set the gpuOwl bounds slightly higher.
storm5510 is offline   Reply With Quote
Old 2022-05-11, 15:14   #557
axn
 
axn's Avatar
 
Jun 2003

2·2,687 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
Would it be hard to make Pfactor support known-factors list?
Doesn't make sense. WIth PFactor, the bounds are determined by the number of tests saved. If it already has a factor, then why bother? Pminus1 has exactly what you need.
axn is offline   Reply With Quote
Old 2022-05-11, 15:26   #558
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

3,733 Posts
Default

Quote:
Originally Posted by axn View Post
Doesn't make sense. WIth PFactor, the bounds are determined by the number of tests saved. If it already has a factor, then why bother? Pminus1 has exactly what you need.
Sure it makes sense. It allows me to quickly and easily ask Prime95 to do a "good" or "great" or whatever kind of P-1 without me performing any kind of calculations as to what bounds are appropriate for that exponent. Pminus1 is good if you care exactly what bounds are used, but not very useful if you want Prime95 to auto-select the bounds (unless I'm missing something?).
James Heinrich is offline   Reply With Quote
Old 2022-05-11, 15:55   #559
slandrum
 
Jan 2021
California

421 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
Sure it makes sense. It allows me to quickly and easily ask Prime95 to do a "good" or "great" or whatever kind of P-1 without me performing any kind of calculations as to what bounds are appropriate for that exponent. Pminus1 is good if you care exactly what bounds are used, but not very useful if you want Prime95 to auto-select the bounds (unless I'm missing something?).
On what basis is Prime95 supposed to decide what the bounds are? Tests saved will be 0 (there are already known factors), so this is obviously not meant to assist in the finding of Mersenne primes.
slandrum is offline   Reply With Quote
Old 2022-05-11, 16:03   #560
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

E9516 Posts
Default

Quote:
Originally Posted by slandrum View Post
On what basis is Prime95 supposed to decide what the bounds are?
On the basis of how many tests I tell Prime95 will be saved in the worktodo line. Same as always. Obviously no Mersenne primes will be discovered, nor candidates eliminated, when running P-1 on an exponent with known factor(s) but that's not at issue.

And you can't fault me for running P-1 on exponents that don't need it if George does the same thing.

Last fiddled with by James Heinrich on 2022-05-11 at 16:06
James Heinrich is offline   Reply With Quote
Old 2022-05-11, 18:50   #561
masser
 
masser's Avatar
 
Jul 2003
Behind BB

3×5×127 Posts
Default

Quote:
Originally Posted by slandrum View Post
On what basis is Prime95 supposed to decide what the bounds are? Tests saved will be 0 (there are already known factors), so this is obviously not meant to assist in the finding of Mersenne primes.
One could make the argument that every additional factor found saves an eventual PRP check on the Mersenne cofactor.

To be clear, finding additional factors (for a specific exponent) does not help the Mersenne Prime search, but there are various other (much smaller) efforts that have some interest in the zoo of factors.

Last fiddled with by masser on 2022-05-11 at 18:51
masser is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime95 beta version 28.4 Prime95 Software 20 2014-03-02 02:51
Prime95 beta version 28.3 Prime95 Software 68 2014-02-23 05:42
Prime95 version 27.1 early preview, not-even-close-to-beta release Prime95 Software 126 2012-02-09 16:17
Beta version 24.12 available Prime95 Software 33 2005-06-14 13:19
Beta version of PRP Prime95 PSearch 15 2004-09-17 19:21

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


Mon Jun 27 02:03:55 UTC 2022 up 74 days, 5 mins, 1 user, load averages: 1.38, 1.11, 1.00

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔