![]() |
|
|
#1277 |
|
"Mark"
Apr 2003
Between here and the
2×3×1,223 Posts |
I have tracked down and resolved the issue with Legendre tables in srsieve2. That being written I have released mtsieve 2.5.0. Here are the changes:
Code:
framework: Fix how max p tested is computed as it could be wrong when running many workers. srsieve2/srsieve2cl: version 1.7.2 Reverted part of the change for algebraic factorizations as it excluded too many. Fix issue when using Legendre tables where factors would be missed. twinsieve: version 1.6.2 Fixed issue with base 2 where even k are factored even though even k are not used. The same issue can occur with odd bases. xyyxsieve/xyyxsievecl: version 2.1 Added -Z to allow user to force sparse logic, which can be faster or slower depending upon the density of x and y. Fixed an issue when starting with -i that can lead to a crash. Last fiddled with by rogue on 2023-06-23 at 17:17 |
|
|
|
|
|
#1278 |
|
Jun 2012
Boulder, CO
32·53 Posts |
Let me send you my input file in a PM. I can repro it pretty consistently.
|
|
|
|
|
|
#1279 |
|
"Mark"
Apr 2003
Between here and the
2·3·1,223 Posts |
|
|
|
|
|
|
#1280 | |
|
Jun 2012
Boulder, CO
32·53 Posts |
Quote:
Code:
$ ./xyyxsievecl -P 1e12 -g 108 -i ./xyyx_1.5M.txt -o out.txt xyyxsieve v2.1, a program to find factors numbers of the form x^y+y^x or x^y-y^x GPU primes per worker is 2985984 Sieve started: 2009105977 <= p <= 1e12 with 295337 terms (300000 <= x <= 302000, 150001 <= y <= 159999) (expecting 66376 factors) |
|
|
|
|
|
|
#1281 |
|
Dec 2011
After 1.58M nines:)
1,699 Posts |
It looks like you fixed srsieve2. Now we have increase in speed since we can use Legendre tables, and still all factors are found :)
Good work! and thanks! |
|
|
|
|
|
#1282 | |
|
Random Account
Aug 2009
Not U. + S.A.
2·1,429 Posts |
Quote:
There is somewhat of a speed difference. 1.6.9 was running 210K p/sec. 1.7.2 is running 160K p/sec. If this is a result of error corrections, then this is the way it will be. I have no problems with it. Many thanks!
|
|
|
|
|
|
|
#1283 |
|
Jun 2012
Boulder, CO
47710 Posts |
With xyyxsievecl 2.1, both the file reading bug and the "Fatal Error" crash after 1 hour appear to be fixed.
Code:
p=11285155907, 22.40K p/sec, 22114 factors found at 1.67 sec per factor (last 303 min), 0.9% done. ETC 2023-07-16 20:51 |
|
|
|
|
|
#1284 |
|
"Gary"
May 2007
Overland Park, KS
300716 Posts |
Srsieve2 1.7.2 fails on algebraic factor removal similar to how versions 1.7.0 and prior did.
It is removing algebraic factors that it should not be when the k and base are different perfect powers. Therefore primes could be subsequently missed. This was fixed in version 1.7.1 at the expense of having it not remove some algebraic factors that it should. Unfortunately it is now removing more than it should. Examples: 9*8^n-1: It removes all terms. It should only remove terms divisible by 2. 27*32^n-1: It removes all terms. It should only remove terms divisible by 3. 32*125^n-1: It removes all terms. It should only remove terms divisible by 5. As best as I can tell, this is only happening on the Riesel side at this time. On the Sierpinski side, it is still missing some algebraic factors but that would have no affect on future primes found. For anyone using 1.7.2 for the extra speed because it is no longer missing factors when using the Legendre tables, you should be OK if your base is not a power. Storm and Pepi, this means you will be OK. Your bases 78 and 773 are not powers so this error will not affect them. I will Email Mark the test cases for this later this morning. Last fiddled with by gd_barnes on 2023-06-24 at 06:46 |
|
|
|
|
|
#1285 |
|
Dec 2011
After 1.58M nines:)
1,699 Posts |
Ok thanks Gary
|
|
|
|
|
|
#1286 |
|
"Mark"
Apr 2003
Between here and the
11100101010102 Posts |
|
|
|
|
|
|
#1287 | |
|
"Mark"
Apr 2003
Between here and the
2×3×1,223 Posts |
Quote:
I hope to take a look at it this weekend. The speed loss is due to the fixed code. |
|
|
|
|