This study makes the first attempt to accelerate the singular boundary method (SBM) by the precorrected-FFT (PFFT) for large-scale three-dimensional potential problems. The SBM with the GMRES solver requires computational complexity, where N is the number of the unknowns. To speed up the SBM, the PFFT is employed to accelerate the SBM matrix-vector multiplication at each iteration step of the GMRES. Consequently, the computational complexity can be reduced to . Several numerical examples are presented to validate the developed PFFT accelerated SBM (PFFT-SBM) scheme, and the results are compared with those of the SBM without the PFFT and the analytical solutions. It is clearly found that the present PFFT-SBM is very efficient and suitable for 3D large-scale potential problems.