1. Byzantine-fault-tolerant distributed logging
CSE 552
preparation for reading

2. Background: PeerReview
Goal: Detect Byzantine behavior in a distributed system

3. Background: PeerReview4 B 1 2 3 5 D C

4. Background: Attested append-only memory1 1 1 2 3
Jacob R. Lorch
TrInc: Small Trusted Hardware for Large Distributed Systems

5. Background: Attested append-only memory
Just the fact that there’s only
one is good enough for me. 3 B A
A2M can make PBFT safe and live with only 2f+1 nodes
Assigning semantic meaning to message counters obviates full log transmission.
When correctness of a prefix has been established, one can do log truncation. C 1 2 3 3
Jacob R. Lorch
TrInc: Small Trusted Hardware for Large Distributed Systems