Efficient Consensus for Every Eventuality

cordial miners fast and efficient consensus n.w
1 / 9
Embed
Share

"Explore 'Cordial Miners' - a fast and efficient consensus protocol presented by Joseph Oglio. Learn about requirements, comparison, leader paths, and main differences between Asynchronous and Eventual Synchrony models. Discover the key mechanisms for achieving safe and live signed messages in this innovative approach."

  • Consensus
  • Cordial Miners
  • Efficient
  • Eventuality
  • Asynchrony

Uploaded on | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.

E N D

Presentation Transcript


  1. Cordial Miners: Fast and Efficient Consensus for Every Eventuality Authors: Idit Keidar, Oded Naor, Ouri Poupko, and Ehud Shapiro Presentation by Joseph Oglio

  2. Requirements n > 3, f < n/3 Signed messages Safe - if output sequences of correct miners are consistent Live - if every message sent by a correct miner is eventually output by every correct miner with probability 1 Two models one in Asynchrony (adversary controls message delay) and Eventual Synchrony (global stabilization time) > (n + f) / 2 messages received constitute a round and may provide a super majority same as > 2/3 All correct processes broadcast a message each round

  3. Comparison

  4. Ordered by Leader Path to Leader Final leader block Leader

  5. Main Differences In ES round robin can be used but in Aysnch a common coin is needed to decide the leader in the last round of the wave, so the adversary doesn t delay the leaders block from everyone ES needs to successful ratifications (for pipelining) otherwise it would take w=3

More Related Content