Homology software What software is there to efficiently compute homology?
Specifically:

*

*What software can take a simplicial complex (provided by a file listing maximal simplices, for example) and quickly compute its homology? I am interested in which coefficients it allows ($\mathbb{Q}, \mathbb{F}_q, \mathbb{Z}$).

*What software can take a point cloud, distance matrix, graph and compute its persistent homology? An additional feature relevant for this question is which kinds of filtrations it can compute (Vietoris-Rips, Delaunay, Alpha).

I am interested in whether the software is ready to use (e.g. binary tools, Python/Julia library) or a C++ library that I first need to write a tool out of. I am also interested in the quality of the documentation.
My motivation for asking (1) is that there is a lot of software but if I simply want to compute homology of some big complex with coefficients in $\mathbb{F}_3$ and I want it to be highly optimized, I don't know what to use. I include (2) because I will have to deal with it and because it will likely come up anyway.
My question is similar to this one; mine has a slightly different focus but mainly the other one is ten years old, so there might be new developments.
Here is a list of software I am aware of, but I am happy about precise information:

*

*CHomP based at Rutgers, last change 2017, no documentation. C++ library and binary tools. The library seems flexible but the tools seem to only compute rational homology.

*LinBox, last change 2019, no documentation on homology computations. C++ library with GAP frontend). Computes homology with integral coefficients.

*Sage can compute homology with integral and field coefficients and has good documentation.

*JavaPlex (and its predecessor jPlex) based at Stanford, last change 2018, tutorial. Java library with Matlab bindings. Computes homology with coefficients in $\mathbb{Q}$ or $\mathbb{F}_q$. Computes persistent homology of filtered complexes and produces these from (at least) point clouds.

*Dionysus 2 by Dmitriy Morozov in Berkley, last change 2021, tutorial. C++ library with Python bindings. Unclear what coefficients it uses ($\mathbb{F}_2$?). Computes persistent homology of filtered complexes and produces these from (at least) point clouds.

*Ripser by Ulrich Bauer in Munich, last change 2021, Readme. C++ binary. Can use coefficients in $\mathbb{Q}$ or $\mathbb{F}_q$. Computes persistence barcodes of Vietors-Rips filtrations obtained from distance matrices or point clouds.

*DIPHA by Jan Reininghaus, Ulrich Bauer, Michael Kerber, last change 2017. C++ library with binary tools and Matlab bindings. Coefficients unclear. Computes persistence of Vietoris-Rips (?) filtrations from various input data.

*GUDHI developed at INRIA Sophia Antipolis and INRIA Saclay, latest change 2021, extensive examples. C++ library with Python bindings. Can compute (at least) with coefficients in a finite field. Can produce various kinds of complexes (Rips, Čech, Alpha) and computer their persistent homology.

*Eirene, last change 2021, tutorial. Julia library. Coefficients in $\mathbb{F}_2$. Computes persistence of Vietoris-Rips complexes from point clouds aand distance matrices.

 A: The homalg_project at GitHub could be worth evaluating.
Appears to be actively maintained, updates range from days to several months ago.
Packages are documented (HTML and PDF formats).
A: Perseus (already mentioned in the older question linked to) computes persistent homology.
A: The package SimplicialComplexes for Macaulay2 can be used to compute reduced homology of simplicial complexes over your favorite field or over $\mathbb{Z}$. Here's an example session using Reisner's triangulation of the real projective plane to show that homology may depend on the coefficients chosen.
needsPackage "SimplicialComplexes";

S =  ZZ[a..f];

-- Reisner's example given by its facets
C = simplicialComplex {a*b*c, a*b*d, a*c*e, a*d*f, a*e*f, b*c*f, b*d*e, b*e*f, c*d*e, c*d*f};

prune homology C -- homology over ZZ
prune homology (C, ZZ/2) -- homology over ZZ/2
prune homology (C, ZZ/3) -- homology over ZZ/3

A: Concerning CHomP (1. on the list above) Shaun Harker just created a branch with tools to compute with $\mathbb{F}_2$ and $\mathbb{F}_3$ coefficients (and it's easy to extrapolate these to arbitrary coefficients). He also pointed out the library pyCHomP with Python bindings which, however, only does $\mathbb{F}_2$-coefficients at the moment.
A: I don't know all of the latest capabilities of the software packages, but I try to keep an alphabetical list of software packages for computing persistent homology at https://www.math.colostate.edu/~adams/advising/appliedTopologySoftware/.
If you know of software packages to add to this list, please pass them along!
A: giotto-ph is another alternative for persistent homology. Quote from the documentation: It consists of an improved reimplementation of Morozov and Nigmetov's "lock-free Ripser" and in addition makes use of a parallel implementation of the apparent pairs optimization used in Ripser v1.2.

*

*Software is ready to use

*Documentation exists

