Why Extension-Based Proofs Fail
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Volume abs/1811.01421, 2019, Pages 986-996.
combinatorial topology impossibility proofs set agreement valency arguments
It is impossible to deterministically solve wait-free consensus in an asynchronous system. The classic proof uses a valency argument, which constructs an infinite execution by repeatedly extending a finite execution. We introduce extension-based proofs, a class of impossibility proofs that are modelled as an interaction between a prover a...More
Full Text (Upload PDF)
PPT (Upload PPT)