Consensus/pbft library
Practical Byzantine Fault Tolerance (PBFT) - simplified engine
A compact PBFT engine capturing pre-prepare/prepare/commit phases, view numbers, and basic message flow. The implementation is intentionally small and deterministic for tests and education, but mirrors the message counting and quorum rules used in production PBFT deployments.
Contract:
- Input: n nodes, f tolerated faults, incoming messages (phase and view)
- Output: whether the protocol reaches commit for a given view and seq
- Errors: throws on invalid parameters