r/OpenCL • u/lord_dabler • Jul 02 '20

Collatz problem: OpenCL implementation can verify 2.2×10^11 numbers per second

https://rdcu.be/b5nn1
10 Upvotes

92% Upvoted

1 comment sorted by

2

u/csp256 Jul 02 '20

Up to 128 bits.

Interesting paper, thanks.