Merkle-Damgard construction was used in the design of many popular hash algorithms such as MD5, SHA-1 and SHA-2.
Merkle-Damgard construction was described in Ralph Merkle's Ph.D. thesis in 1979 where he and Ivan Damgård independently proved that the structure is sound: that is, if an appropriate padding scheme is used and the compression function is collision-resistant, then the hash function will also be collision-resistant.[3][4]