View Single Post
Old 2021-12-24, 08:18   #35
MrRepunit's Avatar
Mar 2011

97 Posts

Originally Posted by Citrix View Post
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.


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 I'll have a look into this but won't promise anything.
MrRepunit is offline   Reply With Quote