2 papers
cs.DC2026
Obfuscated Consensus
James Aspnes, Shlomi Dolev, Amit Hendin
The classic Fischer, Lynch, and Paterson impossibility proof demonstrates that any deterministic protocol for consensus in either a message-passing or shared-memory system must vio…
cs.DC2025
Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults
Shlomi Dolev, Amit Hendin, Maurice Herlihy +2
The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol req…