Traditional blockchains achieve consensus using centralized mechanisms.
Cellular automata and related systems make possible distributed mechanisms providing a new level of efficiency and robustness.
This conference explored the science and algorithms of distributed consensus with cellular automata and related systems.
Will consensus always be reached? How long will it take? How much effect will random errors have? Can errors be arranged to corrupt the result? What effect does connectivity pattern have? What if nodes or connections have weights? What about dynamic connectivity? What about asynchronous updating? What can be rigorously proved?
This conference was of interest to those interested in the leading edge of blockchain algorithms and their connection to areas such as physics, complex systems, discrete mathematics and computation theory.
Topics & approaches involved:
- Graph Cellular Automata
- Probabilistic Cellular Automata
- Fault-Tolerant Cellular Automata
- Voter Models
- Directed Percolation
- Spin Systems
- Phase Transitions
- Byzantine Attacks
- Statistical Physics
- Discrete Mathematics
- Computational Experiments
- Computation Theory
- Dynamical Systems Theory
- Distributed Algorithms
- Randomized Algorithm
- Adaptive Algorithms
- Automated Theorem Proving
- Error Correction ....
Invited Speakers
