The CM software implements the construction of ring class fields of imaginary quadratic number fields and of elliptic curves with complex multiplication via floating point approximations. Additionally it provides an implementation of the fastECPP algorithm for proving primality of integers. It consists of libraries that can be called from within a C program and of executable command line applications. For the implemented algorithms, see A. Enge, The complexity of class polynomial computation via floating point approximations, Mathematics of Computation 78 (266), 2009, pp. 1089–1107.
Found via https://matheplanet.at/matheplanet/nuke/html/viewtopic.php?topic=266257&post_id=1939590

See also https://www.multiprecision.org/paridroid/index.html for PariDroid, a port of PARI/GP to Android

Factors of numbers b^n+/-1, together with the names of the researchers and the methods used.

Self-initializing quadratic sieve (SIQS), on a 2GHz Opteron, a 95 digit factorization takes 4 hours, and a 100-digit factorization takes just under 12 hours (possibly more). Public domain library for integer factorization, implementing Pollard-rho, ECM, self-initializing Quadratic Sieve and parts of NFS.
On 2022-06-21, the original page http://www.boo.net/~jasonp/qs.html is off-line: "All Delmarva Online services have been discontinued.  December 27, 2014"
With the help of http://web.archive.org/web/20110723030828/http://www.boo.net/~jasonp/qs.html, I could locate the repository https://sourceforge.net/projects/msieve/files/msieve/ which has been updated 2016-11-11. I changed the URL for the bookmark to the sourceforge repository.

According to Thomas R. Nicely, these are the most extensive tables of the prime-counting function pi(x). There is