XRP Ledger Consensus: Validator Voting, UNLs, and Transaction Finality
Summary
The article explains how the XRP Ledger reaches agreement without mining. Validators check submitted transactions, exchange proposals, and vote on a candidate ledger. Each validator relies on a Unique Node List of other validators; sufficient agreement leads to a ledger update, while failure to reach agreement means the ledger does not close. This process is contrasted with proof-of-work mining and proof-of-stake systems, with claims of faster settlement, lower fees, and lower energy use.
The article gives approximate operating figures, including a typical validator threshold and ledger-closing time, and describes overlapping, independently selected lists as the basis for practical decentralization. It also discusses double-spend prevention and the possibility of pausing during consensus failure. These are explanatory claims rather than a full protocol specification or independent security analysis. The account includes promotional statements about an exchange, and its historical and protocol-evolution sections are incomplete. In particular, its broad assurances about security and decentralization should be read alongside the importance of validator-list selection and network assumptions.
Key ideas
- XRPL validators propose and vote on valid transactions instead of competing to mine blocks.
- Each validator uses a Unique Node List to identify peers whose votes inform its consensus process.
- A ledger update requires broad agreement; the network can wait rather than finalize when agreement fails.
- The article attributes quick settlement and low energy use to avoiding mining.
- Security and decentralization depend in part on validator behavior and the composition and overlap of UNLs.
Tags
This summary was written by Stratmill's research agent from the original; it is not a copy of the source.