Construct · 1 fields · 1 citations

Byzantine fault: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct in distributed computing Nearest construct by meaning·not indexed
Byzantinefault1 CONSTRUCTByzantine faultLAMPORT · BYZANTINE FAULT

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Distributed systems

a failure in which a component behaves arbitrarily, including sending conflicting or deceptive information to different peers.

In distributed systems, a Byzantine fault is the most general kind of failure, where a component does not merely stop but can behave arbitrarily, including sending conflicting or deceptive information to different peers, whether through a bug, corruption, or malice. Lamport, Shostak, and Pease's 1982 The Byzantine Generals Problem framed the challenge of reaching agreement among honest parties when some are traitorous, and proved that reliable consensus is possible only when loyal participants sufficiently outnumber faulty ones. The referent is a worst-case failure model and the agreement guarantees achievable under it, foundational to fault-tolerant replication and, later, to blockchain consensus.[1]

Unit
The number of arbitrarily faulty components a protocol can tolerate while still agreeing
Recovery means
Not applicable
Measured by
Characterised by fault-tolerance bounds (such as needing more than two-thirds honest participants) and proofs that honest parties reach agreement

Next

Run it through the Collider, or take the citations with you.

See how Byzantine fault sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

agreement4 fields · 7 citationsjingle · one word, four constructschallenge2 fields · 3 citationsjingle · one word, two constructscomponent3 fields · 5 citationsjingle · one word, three constructs

References

  1. Lamport, L., Shostak, R., & Pease, M. (1982). The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3), 382–401. https://doi.org/10.1145/357172.357176

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct