Phase retrieval algorithms reconstruct signal from the magnitude of linear transformation of the signal such as the magnitude of its Fourier transform. Alternating projection methods, such as the seminal Fienup and Gerchberg-Saxton (GS) algorithms, were the first algorithms to solve the phase retrieval problem. Approximate message passing algorithms form an interesting family of heuristic algorithms and so at best offer only asymptotic guarantees, however, they are accurate, robust to noise, generally very fast, and can easily incorporate priors into the reconstruction. We have recently developed an algorithm named as prVAMP an extension of prSAMP which is much more robust to noise and orders of magnitude faster than the existing AMP algorithms.