Actually, I may address it here. > This algorithm requires a lot of messages The algorithm requires (1) data propagation (proposal) messages and (2) heartbeat

Actually, I may address it here. > This algorithm requires a lot of messages The algorithm requires (1) data propagation (proposal) messages and (2) heartbeat messages that confirm progress similar to TCP ACKs. The amount of heartbeat messages is not dependent on the presence/absence/number of proposals. Both types of messages are more or less unavoidable. > one slow node ("straggler") can stall everything In fully asynchronous systems, consensus is impossible anyway. Hence, there is always some turn duration/timeout value.