You can get a whole crowd to agree on something even if everyone only knows what the person right next to them is thinking.
March 23, 2026
Original Paper
Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
arXiv · 2603.19472
AI-generated illustration
The Takeaway
It was previously thought impossible for decentralized systems to reach a global consensus without a central leader or complex instructions. This discovery proves that simple networks can solve complex global logic problems using only local information, revealing how collective intelligence can emerge from simple parts.
From the abstract
The global majority problem, often referred to as the Density Classification Task, is a classical benchmark in the context of probing the computational capabilities of automata networks. It poses the simple yet challenging problem of determining, by totally local means, whether an arbitrary initial configuration of binary states can evolve to a final, homogeneous global configuration that reflects the initial global majority. Although it is known that in the specific case of cellular automata wi