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

[KRISHIL SHETH]

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.

I would love to discuss:

   -

   Sharing detailed benchmarks and technical information
   -

   Exploring possible collaboration or contribution pathways
   -

   Understanding your process for reviewing and integrating algorithmic
   enhancements

I deeply respect GMP’s impact on the open-source and mathematics
communities and would be honored to contribute meaningfully.

Please let me know if we could schedule a brief discussion or if you'd
prefer a formal technical submission first.

Looking forward to hearing from you.

Best regards,



*Krishil Rohit ShethIndia , *
-------------- next part --------------
A non-text attachment was scrubbed...
Name: RPF_Vs_Karatsuba.pdf
Type: application/pdf
Size: 186673 bytes
Desc: not available
URL: <https://gmplib.org/list-archives/gmp-devel/attachments/20250420/fde6a94d/attachment-0001.pdf>