Different Perspectives on FLP Impossibility

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.