GMP used during 3 and a half years to solve MIT's LCS35

Torbjörn Granlund tg at
Tue Apr 30 08:26:52 UTC 2019

Bernard Fabrot <bfabrot at> writes:


  I wanted to thank you a lot for GMP and let you know that GMP did the 79
  685 186 856 218 modulo/squarings without failing once.

How large were typical operands (e.g. in bits)?

Please encrypt, key id 0xC8601622

More information about the gmp-discuss mailing list