20180930, 17:36  #331 
Sep 2008
Kansas
3,449 Posts 
Attached is a Linux build (with .exe) using CUDA 8.0 and sm_20, 30, 35, 50, 52, 61.
Last fiddled with by RichD on 20180930 at 17:37 Reason: add attachment 
20181001, 13:48  #332 
Banned
"Luigi"
Aug 2002
Team Italia
4830_{10} Posts 

20181002, 15:28  #333 
Sep 2008
Kansas
3,449 Posts 
I recalled this from the earlier days. You might be able to run mmff without installing the entire CUDA suite by referencing the dynamic library. I added a "lib" folder to the previous package. It can be run by:
Code:
LD_LIBRARY_PATH=./lib ./mmff.exe 
20181024, 09:17  #334  
Banned
"Luigi"
Aug 2002
Team Italia
2×3×5×7×23 Posts 
Quote:


20190112, 19:00  #335 
"Dylan"
Mar 2017
586_{10} Posts 
Attached is a Windows 64bit executable and source for mmff set for CUDA 10. I post this here since this executable still gives me the error "Class problems. Factor divisible by 2, 3, 5, 7, or 11" even though the makefile "Makefile.win" is set to produce code for CC 3.0 and above (including 6.1 which covers Pascal cards, which is what I have) and I want to see if others can replicate the issue and provide me a fix, as Luigi was unable to help. Note you will need the CUDA 10 cudart dll, it can be found here: https://www.mersenneforum.org/mfaktc...in.cuda100.zip.

20190115, 17:00  #336  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
3^{3}·5·43 Posts 
Quote:


20190626, 14:41  #337 
Sep 2003
5×11×47 Posts 
Errors in the mmff code?
I downloaded the mmff0.28 source code.
In mfaktc.c, there are lines like this (line 166 to 168): Code:
if (exp == 31) { unsigned int exp_mod8, exp_mod3, exp_mod5, exp_mod7, exp_mod11; exp_mod8 = 7; exp_mod3 = 1; exp_mod5 = 2; exp_mod7 = 1; exp_mod11 = 1; Similarly for exp==61, exp==89, exp==107. But exp==127 does seems to use the right numbers. This seems like a misguided optimization attempt. The code for exp == 31, 61, 89, 107, 127 could be removed, and just let the default code remain (the code that explicitly uses exp % 8 and exp % 3 etc.) This is the code that selects classes. If it doesn't select the right classes, it won't find factors. 
20190626, 18:27  #338  
Banned
"Luigi"
Aug 2002
Team Italia
12DE_{16} Posts 
Quote:


20190627, 04:00  #339 
Sep 2003
A19_{16} Posts 
Yes, I made an elementary mistake. Obviously, it's not 31 mod n, it's 2^31−1 mod n that has to be calculated, and then the values mod 8, 3, 5, 7, 11 are 7, 1, 2, 1, 1 as expected.

20190627, 05:39  #340 
P90 years forever!
Aug 2002
Yeehaw, FL
1110111010110_{2} Posts 

20190628, 19:56  #341 
Jul 2003
1143_{8} Posts 
hi,
please can someone compile mmff for nvidia turing cards for win64 ? 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Mersenne trial division implementation  mathPuzzles  Math  8  20170421 07:21 
trial division over a factor base  Peter Hackman  Factoring  7  20091026 18:27 
P95 trial division strategy  SPWorley  Math  8  20090824 23:26 
Trial division software for Mersenne  SPWorley  Factoring  7  20090816 00:23 
Need GMP trialdivision timings  ewmayer  Factoring  7  20081211 22:12 