Performance of the consensus algorithm

Consensus
#1

After reading the technical whitepaper, I noticed that the consensus algo is like EOS pretty much. Both chains use BFT to settle the transactions. EOS utilizes dPOS consensus. dPOS has two phases: a “pre-consensus” and the final settlement. The final settlement is made by BFT. It usually takes 200-300s to reach the consensus between 21 block producers. However with the “pre-consensus” layer in which the BPs sign the raw blocks in turn, can reach a block time as short as 0.5s. This trade-off between efficiency and security makes EOS very different from other blockchain.

I didn’t find the chapter describing the performance of the algorithm. Any ideas?

1 Like
#2

They seem to only describe perfomance in terms of steps and validations required.
Interestingly its pointed out that their early tests confirm hotstuff findings in this paper: HotStuff: BFT Consensus in the Lens of Blockchain, so nothing certain but an idea of performance (Latency seems to be in the neighborhood of 30 to 20 ms having 128 nodes)

3 Likes
#3

As mentioned in our technical report https://developers.libra.org/docs/assets/papers/the-libra-blockchain.pdf, our early prototypes confirmed high throughput and low transaction latency as independently measured in HotStuff.

We will be doing more formal benchmarking of LibraBFT in a variety of different configurations and look forward to sharing the results in the future.

4 Likes
#5

LibraBFT is a Byzantine fault-tolerant (BFT) consensus protocol that achieves finality upon completing the 3-chain commit rule. As with other BFT consensus protocols, it is not probabilistic.

See Section 3.1 in https://developers.libra.org/docs/assets/papers/the-libra-blockchain.pdf to get more information about how transaction fees will be calculated.

1 Like
#6

Hi,
So, do you mean then 30 Ts/sec, is it per node ? From my side, I need to write a smart contract able to settle a transaction within a second.