Hacker News Reader

You can't blame this on GMP. People are free to interface with it in better ways from the languages you mention.

As for speed, I'm sure some very specialized applications can do better if they have constraints that allow for specific optimization, but as far as a general library goes I haven't seen better performance than GMP personally.

View on HN

GMP doesn't do well in prime fields with a small, fixed number of limbs. Poly1305 and elliptic curves are both good examples. Its general routines aren't as fast as custom routines, and it doesn't execute in constant time.

MPFQ exists for short finite field work, but it hasn't achieved the popularity of GNU MP.

https://gitlab.inria.fr/mpfq/mpfq

Reply on news.ycombinator.com