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.
Comece pela explicação mais curta e útil antes de aprofundar.
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 primeiro a analogia curta para raciocinar melhor sobre o termo quando ele aparecer em código, docs ou prompts.
Pense nisso como um bloco de construção que ajuda a ligar uma definição isolada ao sistema maior onde ela vive.
Coloque o termo dentro da camada de Solana em que ele vive para raciocinar melhor sobre ele.
Serialização, memória, estruturas de dados e bases de engenharia.
Transforme o termo de vocabulário em algo operacional para produto e engenharia.
Este termo destrava conceitos adjacentes rapidamente, então funciona melhor quando você o trata como um ponto de conexão, não como definição isolada.
Use este bloco compacto quando quiser dar contexto aterrado para um agente ou assistente sem despejar a página inteira.
Crash Fault vs Byzantine Fault (crash-fault-vs-byzantine) Categoria: Fundamentos de Programação Definição: 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. Relacionados: Byzantine Fault Tolerance (BFT), Mecanismo de Consenso, Tower BFT
Use contexto do glossário, relações entre termos, modelos mentais e builder paths para receber respostas estruturadas em vez de output genérico.
Opcional: cole código Anchor, Solana ou Rust para o Copilot mapear primitivas de volta para termos do glossário.
O Copilot vai responder usando o termo atual, conceitos relacionados, modelos mentais e o grafo ao redor do glossário.
Esses ramos mostram quais conceitos esse termo toca diretamente e o que existe uma camada além deles.
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).
Estes são os próximos conceitos que valem abrir se você quiser que este termo faça mais sentido dentro de um workflow real de Solana.
Essas entradas são fáceis de misturar quando você lê rápido, faz prompting em um LLM ou está entrando em uma nova camada de 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.
Entradas de glossário só ficam úteis quando estão conectadas. Esses links são o caminho mais curto para ideias adjacentes.
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).
Essas entradas vivem ao lado do termo atual e ajudam a página a parecer parte de um grafo maior, não um beco sem saída.
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.