Abstract: Mal’tsev introduced conjugacy separability to provide an algorithm to solve the conjugacy problem for finitely presented group using finite quotients. Following Lawton, Louder, and McReynolds, we provide a quantification of conjugacy separability for lamplighter groups which provides a complexity bound for the conjugacy problem. This is joint work with Michal Ferov.