Fast Computation of Pairwise Hamming Distances R package FastHamming version 1.2 Pairwise Hamming distances are computed between the rows of a binary (0/1) matrix using highly optimized 'C' code. The input is an integer matrix where each row represents a binary feature vector and returns a symmetric integer matrix of pairwise distances. Internally, rows are bit-packed into 64-bit words for fast XOR-based comparisons, with hardware-accelerated popcount operations to count differences. 'OpenMP' parallelization ensures efficient performance for large matrices. Software Depends: R (>= 4.0.0) Ravi Varadhan <ravi.varadhan@jhu.edu> Comprehensive R Archive Network (CRAN) Ravi Varadhan [aut, cre] GPL-3 2025-04-27 application/tgz https://CRAN.R-project.org/package=FastHamming doi:10.32614/CRAN.package.FastHamming