20190418, 22:38  #12  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
2^{4}·3·157 Posts 
Quote:
(That's http://mpir.org/, for anyone unfamiliar) http://mpir.org/news.html shows no content since early 2017. 

20190418, 23:06  #13  
Sep 2016
373 Posts 
Quote:
The main difference is that the MPIR devs actually considered doing parallelization. But IIRC, they quickly realized it's not that simple with the whole API and framework and everything. The MPIR devs have also mentioned not having any manpower to continue the project beyond basic maintenance. 

20191119, 02:52  #14  
Sep 2002
Database er0rr
2×5^{2}×7×13 Posts 
Faster Integer Multiplication Using Preprocessing
I am no FFT expert, but I wonder if this paper leads to any speed ups for finding primes.
https://arxiv.org/abs/1911.07124 Quote:
FYI. Last fiddled with by paulunderwood on 20191119 at 03:00 

20191120, 14:01  #15  
"Bob Silverman"
Nov 2003
North of Boston
2^{3}·3·313 Posts 
Quote:
(and their size). It fails to discuss any kind of implementation or give benchmarks. There is no discussion of how large the numbers need to be for practicality. It VERY frequently introduces variables and notation without definition. It is sloppy with notation. e.g. k log n log log n/k fails to parenthesize (n/k). etc. etc. There are so many errors of this type that I did not bother to try to check it for correctness. If I were asked to referee this paper, I would reject it. There are too many flaws to even suggest a partial rewrite. 

20200521, 09:26  #16 
"David Barina"
Jul 2016
Brno
2^{3}×5 Posts 
Just for fun, here is another algorithm for fast multiplication of large integers, which is most likely only of theoretical interest. The time complexity of multiplying two numbers is \(O(kn)\), where the \(k\) is the number of odd steps in the Collatz trajectory of the first multiplicand.
Last fiddled with by retina on 20200521 at 10:23 Reason: Rewrite URL to remove tracking tokens, and avoid the URL tracker 
20200521, 12:44  #17  
"Robert Gerbicz"
Oct 2005
Hungary
1,621 Posts 
Quote:


20200521, 19:51  #18 
"David Barina"
Jul 2016
Brno
2^{3}·5 Posts 
Yes, the algorithm is efficient only for a specific class of numbers, as explained in the paper. The long multiplication is better on average.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
k*b^n+/c where b is an integer greater than 2 and c is an integer from 1 to b1  jasong  Miscellaneous Math  5  20160424 03:40 
5 digit multiplication  MattcAnderson  Puzzles  8  20141205 15:09 
Mixed floating/integer transform for faster LL testing  ewmayer  Computer Science & Computational Number Theory  6  20140514 21:03 
Faster LucasLehmer test using integer arithmetic?  __HRB__  Software  188  20100809 11:13 
Montgomery Multiplication  dave_dm  Math  2  20041224 11:00 