This document summarizes key points about consensus agreement algorithms. It discusses how consensus can be solved with halting (crash) failures in synchronous systems using a simple algorithm that requires f+1 rounds, where f is the maximum number of failures. It also proves that no consensus algorithm can solve the problem in less than f+1 rounds. For asynchronous systems, the document notes that even one halting failure makes consensus insolvable. Byzantine agreement is also impossible to solve in asynchronous systems.