Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol

Authors Kiayias, Aggelos; Russell, Alexander; David, Bernardo; Oliynykov, Roman
Year 2017
Project Cardano
License CC BY 4.0 (IACR ePrint version)
Official Source IACR ePrint 2016/889 — paper and version history

This page is an educational summary and analysis of an official research paper. It is not a verbatim reproduction. CryptoGloss does not claim authorship of the original work. Intellectual property rights remain with the original authors. The official paper is linked above.

Ouroboros is a proof-of-stake blockchain protocol described in a peer-reviewed CRYPTO 2017 paper. It uses stake-weighted slot-leader selection and epoch-based stake snapshots, then analyzes ledger persistence and liveness under explicit network, participation, and adversary assumptions. Those qualifications matter: the paper proves properties of a specified protocol model, not an unconditional guarantee about every later Cardano implementation.

Publication and Versioning

The paper, “Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol,” was written by Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. The proceedings version appeared in Advances in Cryptology – CRYPTO 2017, volume 10401 of Lecture Notes in Computer Science, pages 357–388; Springer records its first online publication as July 29, 2017. IACR ePrint 2016/889 is a separate archive record: it was received in 2016 and its current file is a later major revision, dated July 20, 2019. The two records should not be treated as the same publication version.

The IACR record lists CC BY 4.0 for its ePrint version. The Springer proceedings record carries the 2017 copyright notice for the International Association for Cryptologic Research. The ePrint license should not be presented as the license for every copy or edition.

Why the Protocol Was Designed

Proof of work elects block producers through computational work. A proof-of-stake protocol instead uses the stake recorded in its ledger to weight who may produce a block. That creates a design challenge: the protocol must generate leader-election randomness without letting a participant choose a favorable result, while the stake distribution itself can change as transactions move funds.

The authors organize time into slots and epochs. A slot is a discrete opportunity to extend the ledger; an epoch groups slots and gives the protocol a regular point at which to use a stake snapshot. This avoids making every leader selection depend on stake changes arriving in that same slot. The paper models these mechanics as a consensus mechanism and analyzes how competing valid chains can arise before participants converge on a stable history.

Protocol Outline

  1. Stake-weighted selection: Stake influences the probability that a participant is selected for a slot or an epoch committee. It is not a proof that a participant has locked all of their coins, and it is not the same design as every later proof-of-stake system.
  2. Epoch snapshots: The protocol uses a designated stake distribution for an epoch rather than reacting to every round-to-round change. Later epochs can use a snapshot derived from the preceding chain, subject to the paper’s bounds on how quickly stake shifts.
  3. Randomness generation: The design uses a secure multi-party coin-flipping process to produce randomness for leader selection. Participants commit to contributions and use publicly verifiable secret sharing to address withholding; the blockchain is used as a broadcast channel in the construction. The security claim depends on the protocol’s assumptions and parameters, not on randomness being magically impossible to influence in every environment.
  4. Chain updates: Slot leaders propose blocks and participants extend a valid chain according to the protocol’s chain-selection rule. Forks can occur. The analysis asks when honest participants’ chains share a sufficiently long common prefix and when valid transactions become stable.

Security Model and Guarantees

The paper defines ledger properties rather than promising that transactions are instantly or absolutely final. In simplified terms, persistence means that once a transaction is stable for an honest participant, other honest participants will also treat it as stable, except with the bounded error captured by the security parameters. Liveness means an honestly submitted transaction that remains available long enough eventually becomes stable. The paper relates these goals to common-prefix, chain-growth, and chain-quality properties.

The proof is conditional. Its model assumes bounded message delays (synchrony), an honest majority of stake with a margin, enough honest participants available for protocol steps, and limits on how long honest participants can remain offline. It also restricts adaptive corruption through a delay, or alternatively assumes an anonymous broadcast channel. The dynamic-stake analysis adds bounds on changes in the stake distribution. Changing those assumptions can change what the theorems establish.

For that reason, a statement such as “a transaction is permanent after a fixed number of confirmations” is too strong without naming the paper’s parameter choices, failure probability, and environment. Persistence is a probabilistic property of the formal model; it is not an unconditional promise that no reorganization or implementation failure can ever occur.

Incentives and Delegation

The paper also studies incentives. It proposes input endorsers and a reward mechanism, then argues that following the protocol can be an approximate Nash equilibrium under stated assumptions, including assumptions about the costs of running protocol steps. This is a game-theoretic result within that model, not a guarantee that all participants in a live network will always act honestly or that the incentives cannot need adjustment.

Its delegation section proposes ways for stakeholders to delegate protocol participation and block-signing rights through proxy signatures; the authors note that this can give rise to stake pools. That is a research design in the paper. It should not be read as a complete description of every later Cardano delegation rule or operational detail.

Ouroboros Is a Protocol Family

Ouroboros later became a family of related protocols. Cardano’s documentation distinguishes the original design from Ouroboros BFT, Praos, and Genesis. Praos changes the security setting and leader-selection approach; Genesis adds a chain-selection rule aimed at allowing new or returning participants to bootstrap from the genesis block under its own model. These later papers and implementations have their own assumptions and results. The original 2017 paper is not a specification for every version in the family or for the current behavior of a live network.

Common Misconceptions

  • “The proof means the software cannot fail.” A formal proof applies to its mathematical protocol and assumptions. It does not by itself prove every implementation, wallet, application, or network deployment is bug-free.
  • “Proof of stake has unconditional finality.” The paper’s persistence and liveness results are parameterized and probabilistic; the assumptions are part of the claim.
  • “Signing competing forks reveals a participant’s private key.” The paper discusses forking and nothing-at-stake attacks, but it does not describe a rule in which equivocation automatically discloses a private key. That explanation should not be used as a summary of Ouroboros.
  • “The paper’s delegation section is the complete modern Cardano staking system.” It presents a protocol design. Later versions and deployed systems require their own documentation.

Authors

The CRYPTO 2017 paper lists publication-time affiliations: Aggelos Kiayias with the University of Edinburgh and IOHK; Alexander Russell with the University of Connecticut; Bernardo David with Tokyo Institute of Technology and IOHK; and Roman Oliynykov with IOHK in Kyiv. These are the affiliations printed with the paper, not claims about the authors’ current roles.

Social Media Sentiment

A small, nonrepresentative sample of r/cardano discussions shows two recurring reactions: some posts praise Cardano’s peer-reviewed research approach, while others ask for clearer explanations of Ouroboros or challenge broad “as secure as proof of work” claims when the model assumptions are omitted. The sample includes a July 2026 research-first discussion and older threads about the paper’s technical difficulty and security claims. These posts are discussion examples, not a survey of Cardano users or a measure of overall sentiment.

Last updated: 2026-10

Related Terms

See Also

Sources