mirror of
https://github.com/tendermint/tendermint.git
synced 2026-01-08 06:15:33 +00:00
c8c248d733
This change adds an overview of the proposer-based timestamps algorithm. The goal of this documentation is to give a plain enough explanation of the algorithm so that application developers and validators can understand both the utility of the algorithm and understand how the new constrains may affect their network and topology. I'm blanking on the scheme we decided on for docs linking, so if anyone could remind me what link format we decided on, I'll go clean that up ASAP. Once this is merged, I intend to create a runbook for chains that see slower block-times or higher nil prevotes and link that runbook to this document to provide a higher-level overview. closes: #8046
order, parent
| order | parent | ||||
|---|---|---|---|---|---|
| 1 |
|
Overview
This section dives into the internals of Go-Tendermint.
- Using Tendermint
- Subscribing to events
- Block Structure
- RPC
- Block Sync
- State Sync
- Mempool
- Light Client
- Consensus
- Peer Exchange (PEX)
- Evidence
For full specifications refer to the spec repo.