logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Consensus in asynchrony

delete2026-01-01
delete0
PRE
AI
K
Klianev, Ivan *
DOI：10.1080/17445760.2026.2621249delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We demonstrate sufficiency of events-based synchronisation for solving deterministic fault-tolerant consensus in asynchrony. Main result is an algorithm that terminates with valid vector agreement, hence operates with safety, liveness, and tolerance to one crash. Reconciling with the FLP impossibility result, we identified: (i) existence of two types of agreements: data-independent and data-dependent; and (ii) dependence of FLP theorem correctness on three implicit assumptions. Consensus impossibility with data-dependent agreement is contingent on two of them. The theorem-stated impossibility with every agreement type hinges entirely on the third. We provide experimental results showing that the third assumption has no evidence in support.
Keywords:
Deterministic consensus
fault-tolerant consensus
consensus in asynchrony
binary agreement
vector agreement
termination with valid agreement

Journal

I
International Journal of Parallel Emergent and Distributed Systems
IF:
0.7
Papers:
45
Citations:
266

Organization

No organization information available