Papers › Corrfunc --- A Suite of Blazing Fast Correlation Functions on the CPU

Corrfunc --- A Suite of Blazing Fast Correlation Functions on the CPU

8 Nov 2019arXiv:1911.03545links table onlyarchive 2025-07-28

Manodeep Sinha, Lehman H. Garrison

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The two-point correlation function (2PCF) is the most widely used tool for quantifying the spatial distribution of galaxies. Since the distribution of galaxies is determined by galaxy formation physics as well as the underlying cosmology, fitting an observed correlation function yields valuable insights into both. The calculation for a 2PCF involves computing pair-wise separations and consequently, the computing time scales quadratically with the number of galaxies. The next-generation galaxy surveys are slated to observe many millions of galaxies, and computing the 2PCF for such surveys would be prohibitively time-consuming. Additionally, modern modelling techniques require the 2PCF to be calculated thousands of times on simulated galaxy catalogues of {\em at least} equal size to the data and would be completely unfeasible for the next generation surveys. Thus, calculating the 2PCF forms a substantial bottleneck in improving our understanding of the fundamental physics of the universe, and we need high-performance software to compute the correlation function. In this paper, we present Corrfunc --- a suite of highly optimised, OpenMP parallel clustering codes. The improved performance of Corrfunc arises from both efficient algorithms as well as software design that suits the underlying hardware of modern CPUs. Corrfunc can compute a wide range of 2-D and 3-D correlation functions in either simulation (Cartesian) space or on-sky coordinates. Corrfunc runs efficiently in both single- and multi-threaded modes and can compute a typical 2-point projected correlation function (wₚ(rₚ)) for ~1 million galaxies within a few seconds on a single thread. Corrfunc is designed to be both user-friendly and fast and is publicly available at https://github.com/manodeep/Corrfunc.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1911.03545")

Code

Syntology Ran 0 of 28 code samples harvested from 4 repositories linked to this paper; 28 have no recorded run.

By repository: official repository: 2 samples from 1 repository, 0 ran; community (archive-listed): 26 samples from 3 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

manodeep/Corrfunc officialmentioned in papermentioned on GitHub report
adematti/corrfunc mentioned on GitHubMIT report
kstoreyf/Corrfunc mentioned on GitHubMIT report
kstoreyf/suave mentioned on GitHub report
tyanndb/vegacorr mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

28 samples harvested; 0 ran; 0 honoured the contract we drafted; 28 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

28unverified

Licence: 0 of the 28 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 4 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

DD manodeep/Corrfunc/Corrfunc/theory/DD.py official repository unverified MIT (permissive) · 7fd6caf5bd5fd337 · report
DDrppi_mocks manodeep/Corrfunc/Corrfunc/mocks/DDrppi_mocks.py official repository unverified MIT (permissive) · bd6690646e113225 · report
DD kstoreyf/suave/Corrfunc/theory/DD.py community (archive-listed) unverified MIT (permissive) · 9e7bd0d41fdd0dea · report
DDrppi adematti/corrfunc/Corrfunc/theory/DDrppi.py community (archive-listed) unverified MIT (permissive) · b17d3205d420b876 · report
DDrppi kstoreyf/Corrfunc/Corrfunc/theory/DDrppi.py community (archive-listed) unverified MIT (permissive) · c33b62188bf120c6 · report
DDrppi_mocks kstoreyf/Corrfunc/Corrfunc/mocks/DDrppi_mocks.py community (archive-listed) unverified MIT (permissive) · 618c5e01b17db96e · report
DDsmu adematti/corrfunc/Corrfunc/theory/DDsmu.py community (archive-listed) unverified MIT (permissive) · e64834c441eaa52e · report
DDsmu_mocks adematti/corrfunc/Corrfunc/mocks/DDsmu_mocks.py community (archive-listed) unverified MIT (permissive) · a24dd214b8672883 · report
DDsmu_mocks kstoreyf/Corrfunc/Corrfunc/mocks/DDsmu_mocks.py community (archive-listed) unverified MIT (permissive) · 9daaf3c0f7c4a041 · report
DDtheta_mocks adematti/corrfunc/Corrfunc/mocks/DDtheta_mocks.py community (archive-listed) unverified MIT (permissive) · e57d6b3bf568baa0 · report
DDtheta_mocks kstoreyf/Corrfunc/Corrfunc/mocks/DDtheta_mocks.py community (archive-listed) unverified MIT (permissive) · 2b738c4e902d1427 · report
convert_3d_counts_to_cf adematti/corrfunc/Corrfunc/utils.py community (archive-listed) unverified MIT (permissive) · 3febe5bad899f2a1 · report
convert_3d_counts_to_cf kstoreyf/Corrfunc/Corrfunc/utils.py community (archive-listed) unverified MIT (permissive) · 9a639823e13920bf · report
convert_rp_pi_counts_to_wp adematti/corrfunc/Corrfunc/utils.py community (archive-listed) unverified MIT (permissive) · 06bf07676c20c837 · report
convert_rp_pi_counts_to_wp kstoreyf/Corrfunc/Corrfunc/utils.py community (archive-listed) unverified MIT (permissive) · 9ccc21330f1b3ba6 · report
find_fastest_DDtheta_mocks_bin_refs adematti/corrfunc/Corrfunc/mocks/DDtheta_mocks.py community (archive-listed) unverified MIT (permissive) · 665d94d0e057b310 · report
find_fastest_DDtheta_mocks_bin_refs kstoreyf/Corrfunc/Corrfunc/mocks/DDtheta_mocks.py community (archive-listed) unverified MIT (permissive) · 53e0a3c271672923 · report
read_ascii_catalog adematti/corrfunc/Corrfunc/io.py community (archive-listed) unverified MIT (permissive) · 71a35b97c2b3821c · report
read_ascii_catalog kstoreyf/Corrfunc/Corrfunc/io.py community (archive-listed) unverified MIT (permissive) · b799088a09243e5d · report
read_catalog adematti/corrfunc/Corrfunc/io.py community (archive-listed) unverified MIT (permissive) · 2f252d5e484fde7e · report
read_fastfood_catalog adematti/corrfunc/Corrfunc/io.py community (archive-listed) unverified MIT (permissive) · 49b2be2888acc783 · report
read_fastfood_catalog kstoreyf/Corrfunc/Corrfunc/io.py community (archive-listed) unverified MIT (permissive) · 6178d5d4d79e1ed7 · report
read_fortran_catalog kstoreyf/Corrfunc/Corrfunc/io.py community (archive-listed) unverified MIT (permissive) · 229aa65fa53a00aa · report
return_file_with_rbins adematti/corrfunc/Corrfunc/utils.py community (archive-listed) unverified MIT (permissive) · 1706462092886a80 · report
spline_bases kstoreyf/Corrfunc/Corrfunc/bases.py community (archive-listed) unverified MIT (permissive) · 0349ed5eb4d10ad3 · report
vpf adematti/corrfunc/Corrfunc/theory/vpf.py community (archive-listed) unverified MIT (permissive) · d4e127e9bcbf824f · report
vpf_mocks adematti/corrfunc/Corrfunc/mocks/vpf_mocks.py community (archive-listed) unverified MIT (permissive) · a315ef7c71ee60b4 · report
vpf_mocks kstoreyf/Corrfunc/Corrfunc/mocks/vpf_mocks.py community (archive-listed) unverified MIT (permissive) · ab5bffcf82ea781e · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections