Draft:Cerberus (consensus algorithm)


Cerberus is a family of consensus algorithms for distributed ledger technology (DLT) designed for parallel operation across multiple shards.[1] It was developed by Radix DLT in a research collaboration with the University of California, Davis. The protocol uses a parallelized Byzantine Fault Tolerance (BFT) model that allows independent sets of transactions to be processed concurrently on different shards.[2] A stated feature of the design is atomic composability, which ensures that transactions spanning multiple shards are treated as a single indivisible operation.[3]

The formal specification for Cerberus was published in 2023 in the peer-reviewed Journal of Systems Research.[1]

History

[edit]

The concept for Cerberus was developed within Radix DLT, which published an initial white paper in March 2020.[4] That same month, the company announced a research partnership with the ExpoLab group at the University of California, Davis, to formalize the protocol.[5]

An early version of the academic work appeared as an arXiv preprint in August 2020,[6] with the final peer-reviewed article being accepted for publication three years later.[7]

A simplified, single-shard implementation of Cerberus was deployed on the Radix public network with its "Olympia" release in July 2021.[8]

Protocol design

[edit]

A 2024 survey of consensus algorithms classifies Cerberus as a fragmented Byzantine Fault Tolerance protocol.[2] It employs state sharding, dividing the global state of the ledger into a large number of shards to enable concurrent processing.[1] In the Radix implementation, this address space is divided into 2^256 shards, and the consensus protocol is paired with a delegated proof-of-stake (DPoS) mechanism for selecting validators.[3]

The formal model is based on an UTXO-style data structure to minimize dependencies between shards. The academic paper demonstrates the protocol's safety in asynchronous networks and its liveness under conditions of partial synchrony.[1]

Protocol variants

[edit]

The 2023 paper by Hellings et al. defines three related protocols within the Cerberus family:[1]

  • Core-Cerberus: A foundational version with minimal coordination between shards.
  • Optimistic-Cerberus: A variant optimized for environments with rare adversarial behavior, which includes recovery procedures for attacks.
  • Resilient-Cerberus: A variant designed for environments with frequent adversarial behavior, which adds more coordination overhead to simplify recovery.

See also

[edit]

References

[edit]
  1. ^ a b c d e Hellings, Jelle; Hughes, Daniel P.; Primero, Joshua; Sadoghi, Mohammad (2023). "Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing". Journal of Systems Research. 3 (1). doi:10.5070/SR33161314.
  2. ^ a b "Review of blockchain consensus algorithms: Comparative analysis and future directions". Journal of Computer Engineering and Information Management. 2024.
  3. ^ a b Radix DLT (2022). Radix DeFi White Paper v2.05 (PDF) (Technical report).
  4. ^ "We're proud to publish the Cerberus whitepaper". Radix DLT Blog. RDX Works. 2020-03-08.
  5. ^ "Radix partners with top US research lab to bring its new Cerberus consensus to life". Radix DLT Blog. RDX Works. 2020-03-25.
  6. ^ Hellings, Jelle; Hughes, Daniel P.; Primero, Joshua; Sadoghi, Mohammad (2020). "Cerberus: Minimalistic multi-shard Byzantine-resilient transaction processing". arXiv:2008.04450 [cs.DC].
  7. ^ "Cerberus consensus is now peer reviewed". Radix DLT Blog. RDX Works. 2023-06-09.
  8. ^ "Radix Olympia mainnet is here". Radix DLT Blog. RDX Works. 2021-07-28.