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

[Torbjörn Granlund]

Bernard Fabrot <bfabrot at gmail.com> writes:

  https://www.csail.mit.edu/news/programmers-solve-mits-20-year-old-cryptographic-puzzle

Cool!

  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)?

-- 
Torbjörn
Please encrypt, key id 0xC8601622