mirror of
https://github.com/tendermint/tendermint.git
synced 2026-01-05 21:14:53 +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 |
|
ABCI
ABCI stands for "Application Blockchain Interface".
ABCI is the interface between Tendermint (a state-machine replication engine)
and your application (the actual state machine). It consists of a set of
methods, each with a corresponding Request and Responsemessage type.
To perform state-machine replication, Tendermint calls the ABCI methods on the
ABCI application by sending the Request* messages and receiving the Response* messages in return.
All ABCI messages and methods are defined in protocol buffers. This allows Tendermint to run with applications written in many programming languages.
This specification is split as follows:
- Methods and Types - complete details on all ABCI methods and message types
- Applications - how to manage ABCI application state and other details about building ABCI applications
- Client and Server - for those looking to implement their own ABCI application servers