![]() |
|
|
#375 | |
|
Sep 2003
5×11×47 Posts |
Quote:
"Mainstream support" for Windows 7 ended in January 2015, and it is now on "extended support" until January 2020. "Extended support", in Microsoft-speak, means they aren't adding any new features. |
|
|
|
|
|
|
#376 |
|
Feb 2005
Colorado
10100011112 Posts |
In case it hasn't already been reported, I noticed that while performing Fermat ECM work that the program will stop the worker to perform needed benchmarks, but then not perform any, then immediately restart the worker.
|
|
|
|
|
|
#377 |
|
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
2·32·7·43 Posts |
When Microsoft proclaimed Windows X forever, they erred by 3.
|
|
|
|
|
|
#378 |
|
Mar 2011
Germany
3·31 Posts |
Hi, I just noticed that the PRP test in prime95/mprime seems to be broken since version 29.4 (at least on Linux 64 Bit).
Test cases for the worktodo.txt (all should be prime): Code:
PRP=1,10,19,-1,"9" PRP=1,10,23,-1,"9" PRP=1,10,317,-1,"9" PRP=1,10,1031,-1,"9" PRP=1,10,49081,-1,"9" PRP=1,10,86453,-1,"9" PRP=1,10,109297,-1,"9" PRP=1,10,270343,-1,"9" Code:
10^270343-1/9 is not prime. Type-5 RES64: 8E38E38E38E38E39 Last fiddled with by MrRepunit on 2018-12-27 at 20:31 Reason: not sure which exact build version 29.3 is |
|
|
|
|
|
#379 | |
|
Sep 2003
5·11·47 Posts |
Quote:
Type 1 residues do work, and since there is no Gerbicz error checking for repunits other than Mersenne (b=2) and Wagstaff (b=−2), there is no advantage to using type 5 for any bases other than Mersenne and Wagstaff. You can get type 1 residues with PRP base = 3 by specifying, for example: Code:
PRP=1,10,19,-1,"9",99,0,3,1 The drawback is that the numerical value of a non-zero type-1 residue will be entirely different from the non-zero type-5 residue for the same composite Mersenne number. So you can't mix and match results for the two residue types. In 29.4, for the exponent 19 I got the type 5 residue 0x7B5BAD595E238E39, which is 8888888888888888889 in decimal. By reverse engineering, I figured out what mprime 29.4 is actually calculating when it calculates residues: Code:
zero = mpz(0)
one = mpz(1)
minus_two = mpz(-2)
b = mpz(args.repunit) # 10
a = mpz(args.prp_base) # 3
t = args.bit_length # 64
pow2_t = mpz(1<<t)
if b > zero:
mp_numer = b**p - one
mp_denom = b - one
mp_ratio = mp_numer // mp_denom
if args.residue_type == 1:
res = pow(a, mp_ratio - one, mp_ratio) % pow2_t
elif args.residue_type == 5:
res = pow(a, mp_ratio - one, mp_numer) % pow2_t
else:
mp_numer = (-b)**p + one
mp_denom = -b + one
mp_ratio = mp_numer // mp_denom
if args.residue_type == 1:
res = pow(a, mp_ratio - one, mp_ratio) % pow2_t
elif args.residue_type == 5 and b != minus_two:
res = pow(a, mp_ratio - one, mp_numer) % pow2_t
elif args.residue_type == 5 and b == minus_two:
res = pow(a, mp_numer - one, mp_numer) % pow2_t
Last fiddled with by GP2 on 2018-12-27 at 23:58 |
|
|
|
|
|
|
#380 |
|
Feb 2005
Colorado
5×131 Posts |
Hmmm. While doing a 50M double check, I just got a Jacobi error. After it was finished checking through backup files, it reported the chances of a good test as "fair".
The test is 50% done. After I investigate and decide the hardware is fixed, should I start the test over and lose 5 days for sure, or should I let it finish and lose 10 days, but only if the test turns out to be bad? Last fiddled with by PhilF on 2018-12-28 at 00:52 |
|
|
|
|
|
#381 | |
|
"/X\(‘-‘)/X\"
Jan 2013
2×5×293 Posts |
Quote:
|
|
|
|
|
|
|
#382 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2·4,909 Posts |
That is what DC's are for, checking on machines.
|
|
|
|
|
|
#383 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
2·3,767 Posts |
|
|
|
|
|
|
#384 | |
|
Romulan Interpreter
Jun 2011
Thailand
72×197 Posts |
Quote:
I would let it finish. And after, switch to PRP testing (where the error check is more robust), at least for next few exponents, to be sure the hardware is really fixed. |
|
|
|
|
|
|
#385 |
|
Sep 2003
A1916 Posts |
I can't remember if I asked this before, but...
We can't do PRP base 2 for Mersenne or Wagstaff testing, so by default we choose PRP base 3. However, for other choices of b in k*b^n+c, we could use PRP base 2. For instance, for repunits using b=10, we could use either PRP base 2 or base 3 (or others). Would there be any speed advantage to using PRP base 2 over base 3? |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Prime95 version 27.3 | Prime95 | Software | 148 | 2012-03-18 19:24 |
| Prime95 version 26.3 | Prime95 | Software | 76 | 2010-12-11 00:11 |
| Prime95 version 25.5 | Prime95 | PrimeNet | 369 | 2008-02-26 05:21 |
| Prime95 version 25.4 | Prime95 | PrimeNet | 143 | 2007-09-24 21:01 |
| When the next prime95 version ? | pacionet | Software | 74 | 2006-12-07 20:30 |