In a classic cheap talk game, the holder of private information communicates this information via a costless and unverifiable message. We relax the latter criterion by introducing a verification technology to the uninformed player. While communication remains costless, verficiation is costly. We characterize novel verification equilibria that are fundamentally different from the partitional equilibria of canonical cheap talk. We look specifically at two types of games: i) Crawford-Sobel setup with quadratic utilities; and ii) Cournot Duopoly with one-sided private information. We discuss possible applications to networks, accounting, labour market signaling, and coordination games.