Qaynaq LABS · TOOLS

CRYPTO GLOSSARY

Byzantine fault tolerance

A system’s ability to function correctly even when some components fail or act maliciously. In blockchain, it ensures the network remains reliable despite dishonest nodes.

Technical definition

Byzantine fault tolerance (BFT) refers to a distributed system’s capacity to reach consensus when up to one-third of nodes may fail or behave arbitrarily (e.g., sending conflicting messages). It requires a majority of honest nodes to agree on the system’s state, using algorithms like Practical BFT (PBFT) or Tendermint. These systems prioritize consistency over availability, ensuring correctness even if some participants are compromised or offline.

An analogy

Imagine a jury in a trial where some jurors might lie or be distracted. The jury can still deliver a fair verdict if enough honest jurors agree on the facts, ignoring the unreliable ones.

Why it matters

BFT is critical for blockchain networks because it ensures trust and reliability without a central authority. It prevents malicious actors from disrupting the system or altering past transactions.

Where it came from

The term originates from the Byzantine Generals Problem, a 1982 thought experiment illustrating the challenge of achieving consensus in distributed systems despite traitors. It was later adapted for computer science and blockchain applications.

Example in practice

The Cosmos network uses Tendermint BFT to achieve consensus across its interconnected blockchains, ensuring that even if some validators are offline or malicious, the network remains secure and operational.

Common misconceptions

  • BFT guarantees 100% uptime → BFT ensures correctness but not availability; the system may halt if too many nodes fail.
  • BFT is only for permissioned blockchains → While common in permissioned systems, some public blockchains (e.g., Cosmos, Algorand) use BFT variants.

Risks & limitations

  • Performance overhead: BFT systems often require more communication between nodes, reducing throughput compared to simpler consensus models.
  • Centralization risk: Some BFT systems rely on a fixed set of validators, which may concentrate power and reduce decentralization.
  • Sybil attacks: If the system allows open participation, an attacker could create many fake nodes to exceed the one-third failure threshold.

Related terms

About "Byzantine fault tolerance" in crypto

Cryptocurrency vocabulary moves faster than any other technical field. New terms appear weekly, old terms quietly change meaning, and most "definitions" online were written by someone trying to sell you something. Qaynaq Labs' crypto glossary aims for the opposite: neutral, accurate, skeptical explainers that include the downside.

This entry covers the technical mechanics, a real-world analogy, where the concept came from, and what could go wrong. Pair it with the related terms to build a working mental model of how the pieces fit together.

Frequently asked

Can a blockchain achieve BFT with 51% honest nodes?

No. BFT requires at least two-thirds of nodes to be honest to tolerate up to one-third Byzantine faults. A 51% honest majority is insufficient for BFT.

Is BFT faster than Proof of Work?

Generally, yes. BFT consensus can finalize blocks in seconds, whereas Proof of Work may take minutes and requires energy-intensive computations.