Feb. 29, 2024, 5:11 a.m. | Geoffrey Ramseyer, Ashish Goel

cs.CR updates on arXiv.org arxiv.org

arXiv:2304.02730v3 Announce Type: replace
Abstract: Prior work studies the question of ``fairly'' ordering transactions in a replicated state machine. Each of $n$ replicas receives transactions in a possibly different order, and the system must aggregate the observed orderings into a single order. We argue that this problem is best viewed through the lens of social choice theory, in which (in the preference aggregation problem) rankings on candidates are aggregated into an election result.
Two features make this problem novel. First, …

arxiv cs.cr fair lens machine order problem question single social state state machine streaming studies system theory transactions work

CyberSOC Technical Lead

@ Integrity360 | Sandyford, Dublin, Ireland

Cyber Security Strategy Consultant

@ Capco | New York City

Cyber Security Senior Consultant

@ Capco | Chicago, IL

Sr. Product Manager

@ MixMode | Remote, US

Corporate Intern - Information Security (Year Round)

@ Associated Bank | US WI Remote

Senior Offensive Security Engineer

@ CoStar Group | US-DC Washington, DC