mirrors/tendermint
1
0
Fork 0
mirror of https://github.com/tendermint/tendermint.git synced 2026-02-07 04:20:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

PBTS: redundant not changes in algorithm removed

Browse Source
This commit is contained in:
Daniel Cason
2022-05-12 17:20:41 +02:00
committed by Daniel
parent 798bd3c4c6
commit e9e2a0c63f
1 changed files with 2 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
spec/consensus/proposer-based-timestamp/pbts-algorithm_002_draft.md
View File

@@ -113,23 +113,14 @@ upon ⟨PROPOSAL, h_p, round_p, v, −1⟩ from proposer(h_p, round_p) while ste
}
```
#### Rules at Lines 28 - 33 remain unchanged
#### All other rules remains unchanged
The rule on line 28 applies to values `v` proposed again in the current round because its proposer received `2f + 1 PREVOTE`s for `v` in a previous round `vr`.
This means that there was a round `r <= vr` in which `2f + 1` processes accepted `v` for the first time, and so sent `PREVOTE`s for `v`.
Which, in turn, means that these processes executed the line 22 of the algorithm, and therefore judged `v` as a `timely` proposal.
In other words, we don't need to verify whether `v` is a timely proposal because at least `f + 1` processes judged `v` as `timely` in a previous round,
and because, since `v` was re-proposed as a `validValue` (line 16), `v.time` has not being updated from its original proposal.
**All other rules remains unchanged.**
Notice, in particular, that the rule on line 28 for values re-proposed, and backed by `2f + 1`-equivalent voting power `PREVOTE` messages, is not affected by the changes.
Back to [main document][main].
[main]: ./README.md
[algorithm_v1]: ./v1/pbts-algorithm_001_draft.md
[sysmodel]: ./pbts-sysmodel_002_draft.md
[bfttime]: https://github.com/tendermint/tendermint/blob/master/spec/consensus/bft-time.md