{
  "slug": "byzantine-failure",
  "term": "Byzantine failure",
  "aliases": [
    "Byzantine fault",
    "arbitrary failure"
  ],
  "definition": "A Byzantine failure permits a component to deviate arbitrarily from its specified behavior, including sending conflicting information to different participants.",
  "note": "The model describes behavior, not intent: defects and malicious actions can both cause arbitrary deviations. Equivocation means conflicting statements about the same protocol decision; it is not a synonym for all Byzantine failures. [pbft-system] [pbft-algorithm]\n\nAuthentication identifies an origin, not truth. A faulty replica can sign conflicting statements using its own key. PBFT's basic client accepts matching authenticated replies from f + 1 distinct replicas for the same request, with at most f faulty replicas. [pbft-system] [pbft-algorithm]\n\nPBFT's 3f + 1 configuration is model-specific. Safety and liveness have different assumptions; liveness depends on communication timing. Consistent execution cannot make an authorized client's bad write useful, and a faulty replica may disclose information. A missing reply alone does not establish a Byzantine fault. [pbft-properties]\n\nSigned-message agreement can use a different fault bound. SM(m) assumes reliable delivery, detectable message absence and unforgeable signatures. Signature forwarding exposes conflicting orders; signatures alone do not supply the timing assumptions. This synchronous agreement result is not a replacement replica count for PBFT. [signed-messages]",
  "related": [
    "fault-model",
    "consensus",
    "quorum-intersection"
  ],
  "citations": [
    {
      "id": "pbft-system",
      "title": "Castro and Liskov. Practical Byzantine Fault Tolerance. OSDI 1999, section 2: System Model.",
      "url": "https://www.usenix.org/legacy/publications/library/proceedings/osdi99/full_papers/castro/castro_html/node2.html",
      "accessed": "2026-11-20"
    },
    {
      "id": "pbft-properties",
      "title": "Castro and Liskov. Practical Byzantine Fault Tolerance. OSDI 1999, section 3: Service Properties.",
      "url": "https://static.usenix.org/publications/library/proceedings/osdi99/full_papers/castro/castro_html/node3.html",
      "accessed": "2026-11-20"
    },
    {
      "id": "pbft-algorithm",
      "title": "Castro and Liskov. Practical Byzantine Fault Tolerance. OSDI 1999, sections 4.1-4.4: client replies, normal operation and view changes.",
      "url": "https://static.usenix.org/publications/library/proceedings/osdi99/full_papers/castro/castro_html/node4.html",
      "accessed": "2026-11-20"
    },
    {
      "id": "signed-messages",
      "title": "Lamport, Shostak and Pease. The Byzantine Generals Problem. TOPLAS 4(3), 382-401, 1982; sections 3, 4 and 6.",
      "url": "https://lamport.azurewebsites.net/pubs/byz.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "hesela-replies",
      "title": "Hesela. Storage timeouts: a signed reply can still be wrong.",
      "url": "https://hesela.com/analyses/storage-timeouts-uncertain-completion/#byzantine-replies",
      "accessed": "2026-11-20"
    }
  ],
  "status": "unknown",
  "advantages": [],
  "limitations": [
    {
      "text": "A Byzantine-fault-tolerant protocol's guarantees depend on its stated faulty-replica bound, authentication and progress assumptions; the term itself does not certify a deployment.",
      "citationIds": [
        "pbft-system",
        "pbft-properties"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "provenance": [
    "Primary-source synthesis of a failure-model concept; not a new consensus protocol, cluster experiment or estimate of failure frequency."
  ]
}
