Mathematicians find a new class of digitally delicate primes

Re:Mathematicians find a new class of digitally delicate primes by mpoteat on Thursday April 01, 2021 @08:04PM (#26667801)

I am unsure whether or not GPUs are good at work involving arbitrary precision numbers. My intuition was that they excelled at doing massively parallel operations for which accuracy is not a high concern.

I would probably look into using some sort of large integer sieve if I were trying to search for an example. Thinking about it though, I am even unsure whether it is decidable that N is widely digitally delicate.

[ Parent | on HN ]

Re:Mathematicians find a new class of digitally delicate primes by ElderMillennial on Thursday April 01, 2021 @09:35PM (#26668313)

Wide integer multiplication works fine on a GPU:

Your number is broken up into 32-bit coefficients to 2^32 as a compounding power (sum over a_i * 2^32i) -- and then you can do it as tensor(ish) operations, if you fiddle with carry/mod steps in between to keep the coefficients the right size and partial results properly aligned.

[ Parent | on HN ]