Two failure models in distributed systems. Crash faults assume nodes either work correctly or stop entirely (fail-stop). Byzantine faults assume nodes can behave arbitrarily — sending conflicting messages, lying, or acting maliciously. Blockchains must tolerate Byzantine faults, requiring BFT consensus (like Solana's Tower BFT) that works even with up to 1/3 malicious validators.
Start with the shortest useful explanation before going deeper.
Two failure models in distributed systems. Crash faults assume nodes either work correctly or stop entirely (fail-stop). Byzantine faults assume nodes can behave arbitrarily — sending conflicting messages, lying, or acting maliciously. Blockchains must tolerate Byzantine faults, requiring BFT consensus (like Solana's Tower BFT) that works even with up to 1/3 malicious validators.
Use the quick analogy first so the term is easier to reason about when you meet it in code, docs, or prompts.
Think of it as a building block that connects one definition to the larger Solana system around it.
Place the term inside its Solana layer so the definition is easier to reason about.
Serialization, memory, data structures, and core engineering basics.
Turn the term from vocabulary into something operational for product and engineering work.
This term unlocks adjacent concepts quickly, so it works best when you treat it as a junction instead of an isolated definition.
Use this compact block when you want to give an agent or assistant grounded context without dumping the entire page.
Crash Fault vs Byzantine Fault (crash-fault-vs-byzantine) Category: Programming Fundamentals Definition: Two failure models in distributed systems. Crash faults assume nodes either work correctly or stop entirely (fail-stop). Byzantine faults assume nodes can behave arbitrarily — sending conflicting messages, lying, or acting maliciously. Blockchains must tolerate Byzantine faults, requiring BFT consensus (like Solana's Tower BFT) that works even with up to 1/3 malicious validators. Related: Byzantine Fault Tolerance (BFT), Consensus Mechanism, Tower BFT
Use glossary context, relationships, mental models, and builder paths to get structured answers instead of generic chat output.
Optional: paste Anchor, Solana, or Rust code so the Copilot can map primitives back to glossary terms.
The Copilot will answer using the current term, related concepts, mental models, and the surrounding glossary graph.
These branches show which concepts this term touches directly and what sits one layer beyond them.
The ability of a distributed system to reach consensus despite some nodes behaving arbitrarily (maliciously or failing). BFT algorithms tolerate up to f faulty nodes in a network of 3f+1 total nodes (1/3 threshold). Solana's Tower BFT, Tendermint, and PBFT are BFT consensus variants. BFT is essential for permissionless blockchains.
The protocol by which nodes in a distributed network agree on the current state of the ledger. Common mechanisms include Proof of Work (Bitcoin), Proof of Stake (Ethereum, Solana), and BFT variants. Consensus ensures all honest nodes converge on the same transaction history despite potential network delays or malicious actors.
Solana's custom BFT consensus algorithm built on top of Proof of History. Tower BFT uses PoH as a clock to reduce communication overhead in traditional PBFT from O(n²) to O(n). Validators vote on forks with exponentially increasing lockout periods—each consecutive vote doubles the lockout, making rollbacks progressively more expensive. A fork is finalized when it reaches supermajority (66.7%+ of stake).
These are the next concepts worth opening if you want this term to make more sense inside a real Solana workflow.
These entries are easy to mix up when you are reading quickly, prompting an LLM, or onboarding into a new layer of Solana.
Practical Byzantine Fault Tolerance. Classical BFT consensus algorithm (Castro & Liskov, 1999) tolerating up to f faulty nodes in 3f+1 total, requiring O(n^2) message complexity per round. Solana's Tower BFT reduces this to O(n) by using Proof of History as a clock, replacing round-based message exchanges with time-based vote lockouts.
Glossary entries become useful when they are connected. These links are the shortest path to adjacent ideas.
The ability of a distributed system to reach consensus despite some nodes behaving arbitrarily (maliciously or failing). BFT algorithms tolerate up to f faulty nodes in a network of 3f+1 total nodes (1/3 threshold). Solana's Tower BFT, Tendermint, and PBFT are BFT consensus variants. BFT is essential for permissionless blockchains.
The protocol by which nodes in a distributed network agree on the current state of the ledger. Common mechanisms include Proof of Work (Bitcoin), Proof of Stake (Ethereum, Solana), and BFT variants. Consensus ensures all honest nodes converge on the same transaction history despite potential network delays or malicious actors.
Solana's custom BFT consensus algorithm built on top of Proof of History. Tower BFT uses PoH as a clock to reduce communication overhead in traditional PBFT from O(n²) to O(n). Validators vote on forks with exponentially increasing lockout periods—each consecutive vote doubles the lockout, making rollbacks progressively more expensive. A fork is finalized when it reaches supermajority (66.7%+ of stake).
These entries live beside the current term and help the page feel like part of a larger knowledge graph instead of a dead end.
A systems programming language emphasizing memory safety, zero-cost abstractions, and concurrency without a garbage collector. Rust uses an ownership model with borrow checking at compile time to prevent data races and null pointer bugs. It is the primary language for Solana program development (via Anchor or native solana-program crate) and the Agave validator client.
A statically typed superset of JavaScript that compiles to plain JavaScript. TypeScript adds type annotations, interfaces, generics, and enums to catch errors at compile time. It is the standard language for Solana client-side development—wallet adapters, dApp frontends, test suites, and SDK interactions (web3.js, Anchor client) are typically written in TypeScript.
The ubiquitous scripting language for web development, running in browsers and Node.js. JavaScript is dynamically typed and event-driven. Most Solana dApp frontends and scripts use JavaScript/TypeScript with libraries like @solana/web3.js. Node.js enables server-side JS for backend services, indexers, and bot development.
A JavaScript runtime built on Chrome's V8 engine that enables server-side JavaScript execution. Node.js uses an event-driven, non-blocking I/O model. In the Solana ecosystem, Node.js is used for: running Anchor tests (Mocha/Jest), backend services, transaction bots, indexers, and CLI tools. npm/yarn/pnpm manage JavaScript package dependencies.