In this talk we are going to discuss the structure of random van Kampen diagrams over finitely presented groups. Such diagrams have many remarkable properties which allow one to design new fast algorithms for the word problem in groups. This is joint work with Alexei Myasnikov (CUNY).