Algorithmic Committee Ordering

In algorithmic committee ordering schemes, a committee oversees the transaction ordering. Transactions are sent directly to the committee and the committee agrees upon a fair ordering through consensus. Generally, these approaches can handle less than one third of the committee members being byzantine.

Positives

  • Goodput stays unchanged
  • No significant delay

Negatives

  • Medium Scope as back-running still possible
  • Bad security as attacks still possible
  • Reduced decentralization
  • Increased costs
  • Jostling increased

Methods

Abbreviations

  1. DCN: Decentralized Clock Network
  1. SMR: State Machine Replication
  1. FIFO: First In First Out

This page is mantained by the Distributed Computing group at ETH Zürich. We are not liable for any false information.

Copyright © 2024 Distributed Computing Group, ETH Zürich