We demonstrate termination of binary consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove its impossibility - in complete asynchrony and one unannounced crash-fail. We present a consensus algorithm with agreement about a dataset containing the initial values of processes. It tolerates one transient process crash-fail and ensures termination in complete asynchrony. After termination, the processes individually compute the decision value with a deterministic function taking the agreed dataset as input. Key findings: Direct causal relationship between asynchrony and impossible consensus termination does not exist. Dependency of agreement on the content of the initial value can prevent computation of binary decision value, but not termination.

翻译：我们在Fischer、Lynch和Patterson（FLP）用于证明其不可能性的模型与条件下（即完全异步且存在一次未宣布的崩溃故障）展示了二进制共识的终止性。我们提出了一种共识算法，该算法就能包含进程初始值的数据集达成一致。该算法能够容忍一次瞬时进程崩溃故障，并在完全异步条件下确保终止性。终止后，各进程通过一个确定性函数（以达成一致的数据集为输入）分别计算决策值。关键发现：异步性与不可能的共识终止性之间并不存在直接的因果关系。对初始值内容的依赖可能会阻止二进制决策值的计算，但不会阻碍终止性。