20211219, 03:42  #34 
Jun 2003
3063_{8} Posts 
Can you compile a generalized version that can work for any base (positive or negative) with no limits on the size of the base (<32 bits). If it does not calculate the remainders (Legendre/Jacobi symbols) that would be fine.
Thanks. 
20211224, 08:18  #35  
Mar 2011
Germany
61_{16} Posts 
Quote:
Hi, there is no quick way in doing so since the fast GPU assembler routines are only using 32 bit integer multiplication. To extend this to 64 bit exponents one would have to rewrite all the routines which are using the exponent, e.g. mod_192_96() in tf_96bit.cu. I'll have a look into this but won't promise anything. 

20211225, 11:26  #36  
Jun 2003
3·23^{2} Posts 
Quote:
For example, the current program cannot handle factoring 10000001^999431+1 I just wanted to clarify to make sure we were talking about the same thing. 

20211225, 22:54  #37  
Mar 2011
Germany
97 Posts 
Quote:
Okay, your example helped to understand what the problem was: There was a buffer overflow due to the too long checkpoint file name generated from the base and exponent. I fixed this, see attached checkpoint.c file. Just replace it and recompile. If you need a Linux 64 Bit executable I can provide you with one, but chances are low that it runs on your system anyway. I hope this helps. 

20211226, 21:53  #38 
Mar 2011
Germany
97 Posts 
I attached the executable for Linux 64 bit (CUDA 11.20).
Code:
$ ./grmfaktc.exe tf 10000001 999431 1 60 mfaktc (generalized repunit edition) v0.21 (64bit built) Compiled on Dec 25 2021 <snip> CUDA version info binary compiled for CUDA 11.20 CUDA runtime version 11.20 CUDA driver version 11.20 <snip> got assignment: base=10000001 exp=999431 bit_min=1 bit_max=60 (0.15 GHzdays) Starting trial factoring R[10000001]999431 from 2^1 to 2^60 (0.15 GHzdays) INFO: No known remainders for base 10000001, falling back to simple trial factoring. INFO: Testing 1920 out of 4620 classes. k_min = 0 k_max = 576788945213 Using GPU kernel "64bit_mul32_gs" Date Time  class Pct  time ETA  GHzd/day Sieve  Exp Base bitrange Dec 26 22:51  4618 100.0%  0.020 n.a.  345.77 78133  999431 10000001 1:60 no factor for R[10000001]999431 from 2^1 to 2^60 [mfaktc 0.21 64bit_mul32_gs] tf(): total time spent: 40.149s 
20211226, 23:02  #39 
Mar 2019
2×131 Posts 
Hi,
What's the link for the latest grmfaktc source code, if I want to compile myself for Linux? Thanks! 
20211226, 23:18  #40 
"James Heinrich"
May 2004
exNorthern Ontario
2×3×619 Posts 
I keep a mirror of sorts at https://download.mersenne.ca/mfaktcgr but the most recent update I have is from over a year ago.

20211227, 12:45  #41 
Mar 2011
Germany
141_{8} Posts 
Here is the newest source code with included Linux 64 Bit binary, currently I cannot build a Windows binary. Not much has changed since last year, only the recent bugfix and some minor additional output.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
mfaktc: a CUDA program for Mersenne prefactoring  TheJudger  GPU Computing  3541  20220421 22:37 
mfakto: an OpenCL program for Mersenne prefactoring  Bdot  GPU Computing  1684  20220419 20:25 
The P1 factoring CUDA program  firejuggler  GPU Computing  753  20201212 18:07 
World's seconddumbest CUDA program  fivemack  Programming  112  20150212 22:51 
World's dumbest CUDA program?  xilman  Programming  1  20091116 10:26 