Raft-Forensics: High Performance CFT Consensus with Accountability for Byzantine Faults. (arXiv:2305.09123v1 [cs.DC])

Crash fault tolerant (CFT) consensus algorithms are commonly used in
scenarios where system components are trusted, such as enterprise settings. CFT
algorithms offer high throughput and low latency, making them an attractive
option for centralized operations that require fault tolerance. However, CFT
consensus is vulnerable to Byzantine faults, which can be introduced by a
single corrupt component. Such faults can break consensus in the system.
Byzantine fault tolerant (BFT) consensus algorithms withstand Byzantine faults,
but they are not as competitive …

accountability algorithms crash enterprise forensics high latency low making offer operations performance settings system tolerance vulnerable