mersenneforum.org gr-mfaktc: a CUDA program for generalized repunits prefactoring
 Register FAQ Search Today's Posts Mark Forums Read

 2021-12-19, 03:42 #34 Citrix     Jun 2003 22×397 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.
2021-12-24, 08:18   #35
MrRepunit

Mar 2011
Germany

97 Posts

Quote:
 Originally Posted by Citrix 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.

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.

2021-12-25, 11:26   #36
Citrix

Jun 2003

22×397 Posts

Quote:
 Originally Posted by MrRepunit 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.
I appreciate your efforts. I am looking to work on larger 32 bit bases and not larger 64 bit exponents.
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.

2021-12-25, 22:54   #37
MrRepunit

Mar 2011
Germany

97 Posts

Quote:
 Originally Posted by Citrix I appreciate your efforts. I am looking to work on larger 32 bit bases and not larger 64 bit exponents. 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.

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.
Attached Files
 checkpoint.c.zip (1.7 KB, 82 views)

2021-12-26, 21:53   #38
MrRepunit

Mar 2011
Germany

97 Posts

I attached the executable for Linux 64 bit (CUDA 11.20).
Code:
\$ ./gr-mfaktc.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 GHz-days)
Starting trial factoring R[10000001]999431 from 2^1 to 2^60 (0.15 GHz-days)
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 | GHz-d/day    Sieve  | Exp        Base         bit-range
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
Attached Files
 gr-mfaktc.exe.zip (595.5 KB, 91 views)

 2021-12-26, 23:02 #39 mathwiz   Mar 2019 3×101 Posts Hi, What's the link for the latest gr-mfaktc source code, if I want to compile myself for Linux? Thanks!
 2021-12-26, 23:18 #40 James Heinrich     "James Heinrich" May 2004 ex-Northern Ontario 23×167 Posts I keep a mirror of sorts at https://download.mersenne.ca/mfaktc-gr but the most recent update I have is from over a year ago.
2021-12-27, 12:45   #41
MrRepunit

Mar 2011
Germany

97 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.
Attached Files
 gr-mfaktc-2021-11-27.zip (1.07 MB, 87 views)

 2022-05-30, 07:57 #42 Citrix     Jun 2003 63416 Posts Does anyone have a compiled windows version for the latest code? Thanks.

 Similar Threads Thread Thread Starter Forum Replies Last Post TheJudger GPU Computing 3541 2022-04-21 22:37 Bdot GPU Computing 1684 2022-04-19 20:25 firejuggler GPU Computing 753 2020-12-12 18:07 fivemack Programming 112 2015-02-12 22:51 xilman Programming 1 2009-11-16 10:26

All times are UTC. The time now is 18:30.

Sat Oct 1 18:30:26 UTC 2022 up 44 days, 15:59, 1 user, load averages: 0.89, 0.90, 0.92