This presentation was originally given as a retrospective at the 25th POPL. It reviews the progress of compiler optimization and the ideas and impact of Static Single Assignment form and the algorithms that are used to convert programs to SSA form, analyze SSA form programs and transform SSA based programs to more efficient ones. We also ruminate on the future of the field and where the important problems may lie.