mirror of
https://github.com/tendermint/tendermint.git
synced 2026-08-22 07:06:14 +00:00
add diagram
This commit is contained in:
@@ -28,6 +28,8 @@ transactions from "IBC relayers", who make RPC requests to full nodes on behalf
|
||||
|
||||
## Structure
|
||||
|
||||
### Components
|
||||
|
||||
The Tendermint Light Client consists of three primary components:
|
||||
|
||||
- [Core Verification](./verification.md): verifying hashes, signatures, and validator set changes
|
||||
@@ -40,8 +42,17 @@ be done by full nodes and validators, and is thus more accurately a component of
|
||||
the full node consensus protocol, though it is included here since it is
|
||||
primarily concerned with providing security to light clients.
|
||||
|
||||
A schematic of the core verification and fork detection components in
|
||||
a Light Node are depicted below. The schematic is quite similar for other use cases.
|
||||
Note fork accountability is not depicted, as it is the responsibility of the
|
||||
full nodes.
|
||||
|
||||
.
|
||||
|
||||
### Synchrony
|
||||
|
||||
Light clients are fundamentally synchronous protocols,
|
||||
where security is grounded ultimately in the interval during which a validator can be punished
|
||||
where security is restricted by the interval during which a validator can be punished
|
||||
for byzantine behaviour. We assume here that such intervals have fixed and known minima
|
||||
referred to commonly as a blockchain's Unbonding Period.
|
||||
|
||||
@@ -50,3 +61,6 @@ core verification, fork detection, and fork accountability -
|
||||
each with their own synchrony assumptions and fault model, can execute
|
||||
sequentially and to completion within the given Unbonding Period.
|
||||
|
||||
TODO: define all the synchrony parameters used in the protocol and their
|
||||
relation to the Unbonding Period.
|
||||
|
||||
|
||||
Binary file not shown.
|
After Width: | Height: | Size: 31 KiB |
Reference in New Issue
Block a user