Winning the Caucus Race: Continuous Leader Election via Public Randomness

نویسندگان

  • Sarah Azouvi
  • Patrick McCorry
  • Sarah Meiklejohn
چکیده

Consensus protocols inherently rely on the notion of leader election, in which one or a subset of participants are temporarily elected to authorize and announce the network’s latest state. While leader election is a well studied problem, the rise of distributed ledgers (i.e., blockchains) has led to a new perspective on how to perform large-scale leader elections via solving a computationally difficult puzzle (i.e., proof of work). In this paper, we present Caucus, a large-scale leader election protocol with minimal coordination costs that does not require the computational cost of proof-of-work. We evaluate Caucus in terms of its security, using a new model for blockchainfocused leader election, before testing an implementation of Caucus on an Ethereum private network. Our experiments highlight that one variant of Caucus costs only $0.10 per leader election if deployed on Ethereum.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcast Abstraction in a Stochastic Calculus for Mobile Networks

We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network is modeled by a stochastic mobility function which allows to change part of a network topology depending on an exponentially distributed delay and a network topology constraint. We allow continuous time stochastic behavior of processes running at network nodes, ...

متن کامل

Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots

This summary presents two leader election protocols for radio networks, in both telephone and walkie-talkie model, where the number of radios is unknown. Those randomized protocols are shown to elect a leader in O(log n) expected time, and to be energy-efficient due to a small total awake time of the radio stations.

متن کامل

Leader Election in Anonymous Radio Networks: Model Checking Energy Consumption

Leader election has been studied intensively in recent years. In this paper, we present an analysis of a randomized leader election using probabilistic model checking with PRISM. We first investigate the quantitative properties of the original protocol such as the expected number of election rounds. Then we modify the protocol so that it consumes less energy and process with larger energy amoun...

متن کامل

Leader Election Algorithms for Multi-channel Wireless Networks

We study the leader election problem in single-hop multichannel wireless networks with single-antenna radio nodes. The objective is to elect leaders for all channels on which one or more nodes in the network can operate. We assume that nodes do not have collision detection capability. In this paper, we propose three algorithms for leader election: one deterministic and two randomized. The deter...

متن کامل

A Modified Leader Election Algorithm for MANET

Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1801.07965  شماره 

صفحات  -

تاریخ انتشار 2018