BFT，PBFT和BA共识算法 [英] BFT and PBFT and BA consensus algorithm

问题描述

我一直在研究授权区块链中一些最常用的共识算法，但被困住了。

I've been digging into some of the most used consensus algorithms in permissioned blockchains and I got stuck.

我知道BFT（拜占庭式容错）是一种一些算法的特性，而pBFT是算法本身。那正确吗？

I understood that BFT (Byzantine Fault Tolerance) is a property of some algorithms and pBFT is an algorithm itself. Is that right?

这个规则是网络中2/3的节点足以达成共识，是所有BFT算法还是pBFT？

This rule that 2/3 of the nodes in the network are enough to reach consensus, is it for all BFT algorithms or just pBFT?

拜占庭协议和BFT有什么区别？

Also what is the difference between Byzantine Agreement and BFT?

如果您能提供可靠的信息来源，我将不胜感激。

If you could provide a reliable source of information, I'd be thankful.

推荐答案

我了解BFT（拜占庭式容错）是某些算法的属性，而pBFT是算法本身。是吗？

I understood that BFT (Byzantine Fault Tolerance) is a property of some algorithms and pBFT is an algorithm itself. Is that right?

是。

这个规则是网络中2/3的节点足以达成共识，是针对所有BFT算法还是仅针对pBFT？

This rule that 2/3 of the nodes in the network are enough to reach consensus, is it for all BFT algorithms or just pBFT?

拜占庭协议的算法最多可以容忍 3f + 1 个节点中的 f 个失败，但它们甚至可能不是能够忍受那么多。原因是，如果拜占庭节点停止参与，则 nf 节点必须能够达成共识，但是如果消息延迟暂时隐藏 f 好节点，则其余的好节点应占多数（因此 nf> = 2f + 1 和 n > = 3f + 1 ）。

Algorithms for Byzantine agreement can tolerate at most f failures in 3f+1 nodes, but they may not even be able to tolerate that many. The reasoning is that, if the Byzantine nodes stop participating, then n-f nodes have to be able to reach consensus, but if message delays temporarily hide f good nodes, then the remaining good nodes should be in the majority (so n-f >= 2f+1, and n >= 3f+1).

拜占庭协议和BFT有什么区别？

Also what is the difference between Byzantine Agreement and BFT?

前者是分布式计算问题，通常称为共识。后者是协议的属性。

The former is a distributed computing problem, more often referred to as consensus. The latter is a property of a protocol.

这篇关于BFT，PBFT和BA共识算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！