How are infinitely large numbers represented and used like Python’s int class and Haskell’s Integer type?

• gmp-wasm

  38 12 10.0 C

  Fork of the GNU Multiple Precision Arithmetic Library (GMP), suitable for compilation into WebAssembly.

  

In C, the GMP library (aka GNU MP Bignum library) is the most well-known library in the domain. It offers unparalleled performance for arithmetic, at the cost of being fairly big.

• CPython

  1,320 60,047 10.0 Python

  The Python programming language

  

You can find the python implementation for big integers at "https://github.com/python/cpython/blob/main/Objects/longobject.c". In resume, big integers are stored as linear arrays of 32 bits integers on the heap, the number is stored base 230, I dont remember exactly why they let 2 bits out, but I guess there is some edge cases when doing arithmetic that need those extra bits, this base makes it easier to speedup computations using bitwise operations and base 10 is really inefficient sinse we are working with binary computers. The algorithms in the python source are taken from "The Art of Computer Programming Volume 2" Book from Donald Knuth, I have also implemented some of those algorithms on my computer algebra system, so if you are having difficulty following the python source I recomend you give a look at "https://github.com/Marcos30004347/gauss/blob/main/gauss/Algebra/Int.hpp", there you will find some extra references as well.

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• gauss

  1 3 0.0 HTML

  Symbolic Math Library (by Marcos30004347)

You can find the python implementation for big integers at "https://github.com/python/cpython/blob/main/Objects/longobject.c". In resume, big integers are stored as linear arrays of 32 bits integers on the heap, the number is stored base 230, I dont remember exactly why they let 2 bits out, but I guess there is some edge cases when doing arithmetic that need those extra bits, this base makes it easier to speedup computations using bitwise operations and base 10 is really inefficient sinse we are working with binary computers. The algorithms in the python source are taken from "The Art of Computer Programming Volume 2" Book from Donald Knuth, I have also implemented some of those algorithms on my computer algebra system, so if you are having difficulty following the python source I recomend you give a look at "https://github.com/Marcos30004347/gauss/blob/main/gauss/Algebra/Int.hpp", there you will find some extra references as well.

• tomsfastmath

  1 204 5.5 C

  TomsFastMath is a fast public domain, open source, large integer arithmetic library written in portable ISO C.

  

tcl uses tomsmath.

Suggest a related project