In this talk, we introduce a fast meshfree algorithm for the linear bond-based linear peridynamic model. The fast method reduces the computational work from O(N2) per time step in a traditional meshless method to O(NlogN) and the memory requirement from O(N2) in a traditional method to O(N), where N is the number of unknowns in the discrete system. Furthermore, the method reduces the computational work of evaluating and assembling the stiffness matrix, which often constitutes a major portion of the overall computational work, from O(N2) in a meshfree method to O(N). The significant reduction of the CPU times and storage in the fast method is achieved by carefully exploring the structure of the stiffness matrix of the traditional method without any lossy compression involved. In other words, the fast method is evaluated in an equivalent but more efficient manner. Therefore, the fast method generates identical numerical solutions as the traditional method does and naturally inherits the stability and convergence properties that were already proved for a traditional method. Numerical results are presented to show the utility of the fast method.