integer-simple by default

naur at naur at
Tue Feb 23 12:34:45 EST 2010


Yet another data point would be my current use of Haskell in various integer factorization activities where I would consider the performance, even for relatively large integers (say, 100-1000 decimal digits) very important. However, I wouldn't complain if some simple and manageable implementation were introduced, as long as the re-introduction of the efficient use of some well-tuned library (like GMP) were not hampered needlessly.

Best regards

----- Original meddelelse -----
> Fra: Yitzchak Gale <gale at>
> Til: Greg Fitzgerald <garious at>
> Cc: glasgow-haskell-users at
> Dato: Tir, 23. feb 2010 00:04
> Emne: Re: integer-simple by default
> I wrote:
> >> As another data point, Python has also re-invented the GMP
> >> wheel, likely for the same licensing reasons. They have
> >> been using a simple implementation of Karatsuba
> >> multiplication for years. I have never heard of anyone
> >> complaining about it
> Greg Fitzgerald wrote:
> > Looks like they swapped out their integer implementation for
> Python3
> Interesting! This will be new in Python 3.2 - the first changes in
> many
> years. It's not exactly swapped out, but there are many changes.
> At first glance, it looks like better 64-bit support, a new
> division
> algorithm via floating-point, a new exponentiation algorithm
> using a 5-bits-at-a-time trick in some cases, optimized Read
> and Show instances (pardon the expression), a few other things.
> A lot of the new stuff seems to be from HAC. As before, everything
> is fully explained in expository comments inside the code, with
> references; a worthwhile read. Multiplication is still the same
> basic
> idea though - naive up to about 2000 bits, followed by just
> Karatsuba and nothing more.
> Thanks,
> Yitz
> _______________________________________________
> Glasgow-haskell-users mailing list
> Glasgow-haskell-users at

More information about the Glasgow-haskell-users mailing list