“…The present implementation takes advantage of the several significant improvements recently made in Crystal in terms of increased parallel and massive-parallel scalability, reduced use of memory per node and increased exploitation of symmetry at all steps of the calculation, which recently allowed the program to be run in parallel mode over 32'000 CPUs and to study systems containing up to about 14'000 atoms and 200'000 basis functions. [17][18][19] Specific features of the current implementation are: i) possibility of studying systems of any dimensionality within the same formal and numerical framework (from 0D molecules, to 1D polymers, nanotubes, helices and nano-rods, to 2D slabs and 3D crystals); ii) efficient use of several DFT functionals, belonging to four rungs of the well-known "Jacob's ladder" 20 (local density approximation, LDA, generalized gradient approximation, GGA, global or range-separated hybrids and meta-GGA); iii) full exploitation of any residual symmetry; iv) parallelization of all algorithms related to the evaluation of ρ(r), its gradient and Laplacian, of the X-ray structure factors, of Bader's topological analysis (as generalized to periodic systems by C. Gatti's Topond package, 21,22 which has recently been merged into the Crystal program), of directional Compton profiles, of the electrostatic potential and its derivatives, of the electronic band structure and density-of-states. The Crystal program adopts an atom-centered basis set of Gaussian-type functions (GTF); all density matrix-based algorithms have been parallelized on the number of orbital shell-shell pairs, which guarantees a good load balance among processors and thus a satisfactory speedup for most systems.…”