New insights into distributed and concurrent programming
summary
Replica IO proposes reversible deterministic concurrency: circuits of deterministic, reversible components with interaction lines that are one-shot, demand-driven, and type-matched. The talk shows concrete primitives (sum, controlled-swap, delay/timer, synchronization bar), replication boxes, a transposer diamond, and a select fed by an undefined value to model nondeterministic choice. At model level it composes a one-shot asynchronous consistent-broadcast and Bracha reliable-broadcast and sketches Tendermint; this is research-grade modeling on replica-io.dev, not yet a formalized or production Rust implementation.
AI-written summary · about
chapters (10)
- 0:00Replica IO project intro
- 1:19Concurrency challenges in distributed systems
- 3:12Physical principles for protocols
- 6:09Reversible deterministic concurrency
- 7:44Circuit-based system structure
- 15:40Domain modeling of distributed systems
- 18:15Protocol modeling example
- 20:53Open questions and future work
- 22:02Project funding and thanks
- 22:33Q&A
related talks
41mProgramming Distributed Systems
48mCRDTs: From sequential to concurrent executions
29mAbout Combining Functional Reactive Programming and Replicated Data Types
30mCONQUERING CONCURRENCY WITH FUNCTIONAL PROGRAMMING
01h 30mImplementing, verifying and debugging distributed event-based systems
48mHow to build distributed concurrency primitives
43mWhat We Talk About When We Talk About Distributed Systems
36mConflict-Free Replicated Datatypes (CRDT)