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

The problem the paper names

Early proof-of-stake proposals were often engineering sketches. Ouroboros asks for a protocol that says who may extend the chain, how randomness is produced, and which assumptions the security proof actually uses.

What the design proposes

• Time is divided into epochs and slots. A stakeholder is elected leader of a slot in proportion to stake.
• Leaders propose blocks. Honest majority of stake, not of hash power, is the assumption.
• Randomness for the next epoch is derived from the protocol rather than from an outside beacon that nobody accounts for.

How the mechanism is specified

• The paper works in a synchronous setting and says so. Network delay assumptions are part of the result.
• Stake distribution is taken from a settled earlier state so the current election cannot be rewritten cheaply.
• Follow-on papers (Praos, Genesis, and others) change the model. They are not this paper.

What this page does not treat as proven

• Publishing a proof about Ouroboros is not a statement about Cardano's market, clients or governance.
• The proof does not cover every later feature added around the settlement layer.
• Synchronous assumptions fail in messy networks. The paper's value is that it names them.

Why a venture studio still reads it

When a venture says 'we use proof of stake', ask which protocol, which honesty assumption, and which paper. Ouroboros is the example of a design that can be pointed at.