Proposal : Introducing RPF: A Faster and More Efficient Alternative to Karatsuba for Large-Number Operations

[Paul Zimmermann]

       Hi Krishil Rohit Sheth,

if you want to convince people that your algorithm is faster than Karatsuba,
a simple figure is not enough:

* please publish your algorithm

* please publish an implementation that people can play with, and check it is faster
  than GMP

Best regards,
Paul Zimmermann

> From: KRISHIL SHETH <krishilsheth at gmail.com>
> Date: Sun, 20 Apr 2025 16:33:34 +0530
> 
> 
> [1:text/plain Hide]
> 
> Hi GMP Team,
> 
> I’m Krishil Rohit Sheth, an independent researcher and developer.
> Over the past 4 years, I’ve developed a new squaring algorithm, which I
> call *RPF* (Rapid Precision Formula).
> 
> In my benchmarks, *RPF consistently outperforms Karatsuba* — both in raw
> performance and when enhanced using GMP — especially for real-world input
> sizes (small to mid-sized big numbers).
> Notably, RPF also shows faster results than FFT-based methods for numbers
> up to ~800 digits.
> 
> I believe this could bring measurable improvements to GMP's already
> excellent performance, especially in areas like cryptography, scientific
> computation, and finance where big number squaring is critical.