Closed sbellem closed 6 years ago
Of relevance for the tendermint-based arch: https://blog.cosmos.network/light-clients-in-tendermint-consensus-1237cfbda104
/cc @codegeschrei @vrde
@sbellem Since a BFT network requires >2/3
votes for a transaction to be commited. Would it make sense to just query one node and verify if f+1
nodes voted/signed the transaction?
This is needed, but now that we have BEPs it should be made into a BEP (discussions about it included)
Problem
Given a permissioned network of
N
nodes, capable to toleratef
byzantine nodes, such thatN >= 3*f + 1
, a client needs to obtain a trustworthy answer from the network.As an example, a client may need to know whether a transaction has been committed to the blockchain. How many nodes should the client query?
lower bound:
f + 1
upper bound:2*f + 1
Assuming that
N >= 3*f + 1
, then as soon as a client obtainsf + 1
identical answers, then this answer should be reliable. The client may need to query up to and including2*f + 1
nodes in order to obtainf + 1
identical answers.