Verifying a distributed system with combinatorial topology

on YouTube ↗50m

" summary

Claims that combinatorial topology can enumerate every node perspective and all possible interconnections at once, turning a distributed system into countable topological bodies that can be subdivided and analyzed. Uses graph adjacency, algebraic-topology constructions and published algorithms (see Distributed Computing Through Combinatorial Topology) to generate complete state spaces, surface unexpected edges (e.g. an unseen 5–6 link) and guide chaos experiments. Prototype verification comes from postgraduate work and early industry prototyping, promising but not a silver bullet.

AI-written summary · about

" chapters (5)

1. 0:00Start
2. 6:00Ideal Distributed System
3. 7:50Design for Failure
4. 19:57Combinatorial (Algebraic) Topology
5. 26:59Subdivisions

" related talks

• 34mThe Math Behind Distributed SystemsVeronica Lopez · ScaleConf Colombia 2018
• 05mInterviewWyatt Meldman Floch · Scale By The Bay 2018
• 28mReasoning about Distributed Reconfigurable SystemsRadu Iosif · OOPSLA 2022
• 48mThe Verification of a Distributed SystemCaitie McCaffrey · Devoxx US 2017
• 22mOptimizing network topologies...Wyatt Meldman Floch, Ryle Goehausen · Scale By The Bay 2018
• 38mThe Verification of a Distributed SystemCaitie McCaffrey · GOTO Chicago 2016
• 11mFinding Invariants of Distributed Systems: It's a Small (Enough) World After AllBryan Parno, Ruben Martins, Travis Hance, Marijn Heule · NSDI ’21
• 34mA NASA Perspective on Quantum Computing, with Emphasis on Recent Results in Distributed ComputingEleanor Rieffel · Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms