mirror of
https://github.com/fluencelabs/tendermint
synced 2025-04-24 22:32:15 +00:00
docs: fix some language issues and deprecated link (#3733)
This commit is contained in:
parent
ed18ffdca3
commit
60827f7562
@ -44,7 +44,7 @@ module.exports = {
|
|||||||
"/app-dev/app-development",
|
"/app-dev/app-development",
|
||||||
"/app-dev/subscribing-to-events-via-websocket",
|
"/app-dev/subscribing-to-events-via-websocket",
|
||||||
"/app-dev/indexing-transactions",
|
"/app-dev/indexing-transactions",
|
||||||
"/app-dev/abci-spec",
|
"/spec/abci/abci",
|
||||||
"/app-dev/ecosystem"
|
"/app-dev/ecosystem"
|
||||||
]
|
]
|
||||||
},
|
},
|
||||||
|
@ -133,8 +133,8 @@ the mempool. If Tendermint is just started or the clients sent more than
|
|||||||
100k transactions, old transactions may be sent to the application. So
|
100k transactions, old transactions may be sent to the application. So
|
||||||
it is important CheckTx implements some logic to handle them.
|
it is important CheckTx implements some logic to handle them.
|
||||||
|
|
||||||
There are cases where a transaction will (or may) become valid in some
|
If there are cases in your application where a transaction may become invalid in some
|
||||||
future state, in which case you probably want to disable Tendermint's
|
future state, you probably want to disable Tendermint's
|
||||||
cache. You can do that by setting `[mempool] cache_size = 0` in the
|
cache. You can do that by setting `[mempool] cache_size = 0` in the
|
||||||
config.
|
config.
|
||||||
|
|
||||||
@ -205,7 +205,7 @@ Once all processing of the block is complete, Tendermint sends the
|
|||||||
Commit request and blocks waiting for a response. While the mempool may
|
Commit request and blocks waiting for a response. While the mempool may
|
||||||
run concurrently with block processing (the BeginBlock, DeliverTxs, and
|
run concurrently with block processing (the BeginBlock, DeliverTxs, and
|
||||||
EndBlock), it is locked for the Commit request so that its state can be
|
EndBlock), it is locked for the Commit request so that its state can be
|
||||||
safely reset during Commit. This means the app _MUST NOT_ do any
|
safely updated during Commit. This means the app _MUST NOT_ do any
|
||||||
blocking communication with the mempool (ie. broadcast_tx) during
|
blocking communication with the mempool (ie. broadcast_tx) during
|
||||||
Commit, or there will be deadlock. Note also that all remaining
|
Commit, or there will be deadlock. Note also that all remaining
|
||||||
transactions in the mempool are replayed on the mempool connection
|
transactions in the mempool are replayed on the mempool connection
|
||||||
|
@ -141,7 +141,7 @@ on them. All other fields in the `Response*` must be strictly deterministic.
|
|||||||
## Block Execution
|
## Block Execution
|
||||||
|
|
||||||
The first time a new blockchain is started, Tendermint calls
|
The first time a new blockchain is started, Tendermint calls
|
||||||
`InitChain`. From then on, the follow sequence of methods is executed for each
|
`InitChain`. From then on, the following sequence of methods is executed for each
|
||||||
block:
|
block:
|
||||||
|
|
||||||
`BeginBlock, [DeliverTx], EndBlock, Commit`
|
`BeginBlock, [DeliverTx], EndBlock, Commit`
|
||||||
|
@ -218,7 +218,7 @@ func MerkleRoot(items [][]byte) []byte{
|
|||||||
case 0:
|
case 0:
|
||||||
return nil
|
return nil
|
||||||
case 1:
|
case 1:
|
||||||
return leafHash(leafs[0])
|
return leafHash(items[0])
|
||||||
default:
|
default:
|
||||||
k := getSplitPoint(len(items))
|
k := getSplitPoint(len(items))
|
||||||
left := MerkleRoot(items[:k])
|
left := MerkleRoot(items[:k])
|
||||||
|
@ -59,7 +59,7 @@ type Validator struct {
|
|||||||
When hashing the Validator struct, the address is not included,
|
When hashing the Validator struct, the address is not included,
|
||||||
because it is redundant with the pubkey.
|
because it is redundant with the pubkey.
|
||||||
|
|
||||||
The `state.Validators`, `state.LastValidators`, and `state.NextValidators`, must always by sorted by validator address,
|
The `state.Validators`, `state.LastValidators`, and `state.NextValidators`, must always be sorted by validator address,
|
||||||
so that there is a canonical order for computing the MerkleRoot.
|
so that there is a canonical order for computing the MerkleRoot.
|
||||||
|
|
||||||
We also define a `TotalVotingPower` function, to return the total voting power:
|
We also define a `TotalVotingPower` function, to return the total voting power:
|
||||||
|
@ -202,8 +202,10 @@ Note that raw hex cannot be used in `POST` transactions.
|
|||||||
|
|
||||||
## Reset
|
## Reset
|
||||||
|
|
||||||
**WARNING: UNSAFE** Only do this in development and only if you can
|
::: warning
|
||||||
|
**UNSAFE** Only do this in development and only if you can
|
||||||
afford to lose all blockchain data!
|
afford to lose all blockchain data!
|
||||||
|
:::
|
||||||
|
|
||||||
To reset a blockchain, stop the node and run:
|
To reset a blockchain, stop the node and run:
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user