You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I wrote a program that takes input N and looks for the first prime under 2^N. It works pretty good, my current speed on a RTX 2070 Super is ~14 min for input N=32kibibits(MAX). But I am trying to beat a record in my class, the current record is 1 million decimal digits. I was wondering if there is a plan to remove the limit? If not could I have some advice on what I should do? I searched this source for 32768 and 1024 and couldn't see any thing that looked like it checked the size, but maybe I will dive deeper into it if I get time. I also was suggested to go use XMP 1.0, does it have a limit?
The text was updated successfully, but these errors were encountered:
@darbysauter, very late to this party but pfgw would be a better starting place for large prime searching.
While I'm sure the limit could be increased to 64K digits it's unlikely to be increased to much beyond that and never to millions of digits as math at those limits requires FFT based convolutions which are touchy and complex.
I wrote a program that takes input N and looks for the first prime under 2^N. It works pretty good, my current speed on a RTX 2070 Super is ~14 min for input N=32kibibits(MAX). But I am trying to beat a record in my class, the current record is 1 million decimal digits. I was wondering if there is a plan to remove the limit? If not could I have some advice on what I should do? I searched this source for 32768 and 1024 and couldn't see any thing that looked like it checked the size, but maybe I will dive deeper into it if I get time. I also was suggested to go use XMP 1.0, does it have a limit?
The text was updated successfully, but these errors were encountered: