3 ms·
interesting to notice the text in the "comparisons to other implementations" "How fast is CPython's implementation of bignums compared to other implementations
by mistrial9 6y ago
interesting to notice the text in the "comparisons to other implementations"
"How fast is CPython's implementation of bignums compared to other implementations? ... One important thing to know about these results is that the fastest programs use bignums provided by the GMP library and not the bignums provided by the language. If we exclude the programs that use GMP bindings, we get the following results... "
- igouy 6y agoAmazing! If we don't want the programs that used the GMP library, then we can simply not show those results! Except "Some languages rely on GMP to implement built-in bignums. They are marked with an asterisk (*)." — why are they shown? (And why isn't there a C program + GMP measurement?)
- r4victor 6y agoI assumed the readers would follow the link to see the original results. GMP is undoubtedly the state-of-the-art of arbitrary-precision arithmetic. The point of this table was to compare bignum implementations provided by different languages, so programs that use GMP bindings are excluded. Probably it would make sense to include the best result that uses GMP, but I think GHC is quite representative of GMP's performance. I'm not the first one who draw such a comparison. This article goes into some more detail: http://www.wilfred.me.uk/blog/2014/10/20/the-fastest-bigint-in-the-west/ http://www.wilfred.me.uk/blog/2014/10/20/the-fastest-bigint-...
- igouy 6y agoAmazing that Wilfred Hughes and yourself took such a straightforward approach instead-of complaining that a lot of the programs used GMP. (Take that as praise.)