Subject: One elaboration for last notes Simple protocol for f crashes: Share news (candidate values) for f+1 rounds, and then settle on smallest seen My proof: Some round is crash-free; all subsequent perceptions same (Clear in variant where both news and ``olds'' are shared. Our version needs simple observation/lemma: If a live processor knows a value that is not known by *every* live processor, then it is news.)