What is AleoBFT?
AleoBFT (Aleo Byzantine Fault Tolerance) is the specialized consensus algorithm powering the Aleo blockchain, designed to combine high throughput, decentralization, and privacy-preserving capabilities.
Key Features
Hybrid Consensus Mechanism
- AleoBFT merges elements from proof-of-stake (PoS) and proof-of-work (PoW), leveraging zero-knowledge proofs for privacy, with PoS-secured instant finality1234.
- It is a DAG-based (Directed Acyclic Graph) protocol, drawing inspiration from well-researched protocols like Narwhal and Bullshark, which enhances the scalability and efficiency of block propagation and ordering2.
Role Separation
- Provers: Solve cryptographic (coinbase) puzzles using specialized hardware, producing zero-knowledge proofs called PoSW (Proof-of-Succinct-Work). Provers are rewarded pro-rata based on their contributions to each block, improving fairness and hardware commoditization456.
- Validators: Elected via PoS, they collect proofs from provers, bundle them into blocks, validate transactions, and achieve consensus using the AleoBFT protocol. Validators stake Aleo Credits as collateral and receive rewards for proposing valid blocks217.
- Stakers: Delegate Aleo Tokens to validators, enhancing the security and decentralization of the network6.
Security & Finality
- Formal verification ensures that blockchains produced by different validators never fork, greatly increasing security and correctness2.
- Instant finality means transactions are finalized as soon as consensus is reached, improving user experience and making interoperability easier8.
Innovation for Privacy and Decentralization
- By separating roles (provers generate proofs, validators finalize state), AleoBFT incentivizes decentralization and allows a broader set of participants to benefit from rewards58.
- The protocol encourages the scaling of proof-generating hardware, which benefits the entire privacy-focused Aleo ecosystem by making zero-knowledge computation cheaper and more accessible35.
- Users pay Aleo Credits for computation and blockspace, aligning incentives for both provers and validators7.
Technical Summary Table