Cellular Automata (CA) is a state machine with a collection of nodes, each changing its state following a local rule that only depends on its neighbors. Each node only has a few neighbor nodes. Propagating through local interactions, local states will eventually affect the global behavior of CA. The desired openness of network is determined by the homogeneity of Cellular Automata where all nodes are identical, forming a fully decentralized P2P (peer-to-peer) network. Each node in the NKN network is constantly updating based on its current state as well as the states of neighbors. The neighbors of each node are also dynamically changing so that the network topology is also dynamic without changing its underlying infrastructure and protocols.
NKN utilizes CA to achieve efficient, decentralized, and dynamical topology such that information and data can be transmitted efficiently and dynamically without centralized connectivity.
Rules as Formulas!
The Cellular Automata programming formula is called “local rule”, which is an indispensable rule for next generation network of NKN and has an important influence on the network topology. Proper choice of local rules leads to Cellular Automata with complex but self-organized behaviors on the boundary between stability and chaos. Rules are essential because they are formulas to program Cellular Automata and Automata Networks.
The NKN team believes CA-based or CA-driven systems are more natural and organic than current approaches utilizing static and fully connected topology. Complex systems with such a simple structure are closer to natural systems, thus enabling self-evolution.