GMP Performnce

[CHEN]

Dear GMP developers,

My name is John Chen and I am currently conducting a survey for Professor
Fateman at UC Berkeley.  We are looking into a number of bignum packages
that are available as libraries or as a part of computer algebra systems.
Our intention is to find the fastest at bignum arithmetic.

Currently here is a short list of packages that we are looking at:
MPFUN
GMP
LEDA
Fermat
Maple
Pari-GP
Magma.

Recently we've read that Magma claims that they are 20-40% faster and
bignum arithmetic and some sources believe that Pari-GP is faster.

We like to ask you what the strengths of your libraries are and in what
senarios does your algorithm out perform others.  In addition, do you have
any recommendations on how we should approach testing your functions
head-to-head against others. Do you have a .DLL of your latest version of
GMP?  Any additional comments or feedback is welcomed.

Thanks for your time and have a nice day.

Sincerely,

John Chen