|
2017-09-06, 02:54
|
#1 |
"Mihai Preda"
Apr 2015
55B16 Posts |
Genefer's FFT applied to Mersenne squaring
Hi, from what I understand genefer uses a different underlying FFT primitive (Bruun?) then the FFT used by CUDALucas or clLucas.
Could genefer's FFT be re-purposed for Mersennes multiplication, with a performance benefit? (especially in OpenCL/gpu). |
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Small inconsistencies between mersenne.org and mersenne.ca factor databases | GP2 | mersenne.ca | 44 | 2016-06-19 19:29 |
| genefer/CUDA | msft | GPU Computing | 177 | 2013-07-28 03:58 |
| Squaring large Numbers | SQUARE | Information & Answers | 7 | 2009-05-10 09:13 |
| LFT applied to big Mersenne's numbers | VolMike | PrimeNet | 5 | 2007-06-28 14:46 |
| Mersenne Wiki: Improving the mersenne primes web site by FOSS methods | optim | PrimeNet | 13 | 2004-07-09 13:51 |
