We demonstrate possibility for consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove impossibility of binary consensus - in complete asynchrony and up to one unannounced process crash-fail. We also show that: i) assembling by every process a dataset containing the initial values of individual processes is an inevitable phase of binary consensus; and ii) agreeing on this dataset is sufficient for a quasi-binary consensus. Key findings: Direct causal relationship between complete asynchrony and the impossibility to solve consensus does not exist. The impossibility to solve consensus is caused only and entirely by the dependence of agreement on the content of the initial values.

翻译：我们证明，在Fischer、Lynch和Patterson（FLP）用于证明二元共识不可能性的模型和条件下（即完全异步且最多一个未宣布的进程崩溃故障），共识具有可行性。我们还表明：i）每个进程组装包含各进程初始值的数据集，是二元共识不可避免的阶段；ii）对此数据集达成一致，足以实现准二元共识。关键发现：完全异步与共识求解不可能性之间不存在直接的因果关系。共识求解的不可能性完全且唯一地由共识对初始值内容的依赖性所致。