Hash Chemistry: Minimal Models for Evolutionary Growth of Complexity
Authors: Ilya Horiguchi, Hiroki Sayama
Organizations: Graduate School of Arts and Sciences, The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo, 153-8902, Japan. · Binghamton Center of Complex Systems, Binghamton University, State University of New York, Binghamton, NY, 13902, USA. · Systems Engineering, Cornell University, Ithaca, NY, 14850, USA. · Waseda Innovation Lab, Waseda University, Tokyo, Japan.
Abstract
Hash Chemistry is a family of minimalistic evolutionary models in which a deterministic hash function assigns a scalar score to entities of arbitrary size, opening a combinatorially vast possibility space (a ``cardinality leap''). Since its introduction, the idea has been realized in several settings, from the original spatial formulation to a fast non-spatial variant and then to structural cellular models. Here we review the Hash Chemistry family as a coherent modeling framework and use it to explore how minimal systems can demonstrate the mechanisms behind multiscale open-ended evolutionary dynamics. The most recent model, Structural Cellular Hash Chemistry (SCHC), successfully demonstrated multiscale ecological interaction/adaptation and complexity growth of replicators in a computationally efficient manner. In this study, we first extend SCHC to incorporate spatial locality and dyadicity of competitive interactions among replicating structures. We show this extension substantially enhances SCHC's evolutionary dynamics. Furthermore, we explore SCHC in a significantly larger spatial domain using a GPU-accelerated implementation. We show that the size of the space acts as a control parameter for a stochastic, nucleation-like transition between a compact-replicator regime and a runaway size-dominance regime, and we separate the responsible mechanism into a non-spatial, size-biased sampling feedback and a finite-size spatial effect. Altogether, these results illustrate the rich potential of Hash Chemistry as a minimal, mechanistically transparent testbed for studying open-ended evolution across scales.
Open-ended evolution (OEE) in artificial life is typically driven by uninterpretable, black-box neural-network complexity metrics, leaving life-like systems disconnected from physical theories of complexity. We introduce MSPD (Multi-Scale Path Divergence, denoted DP ), a renormalization-group-inspired scalar that quantifies the temporal multiscale organization of heterogeneity in local transition laws. MSPD is defined at the population level as a functional of the realised trajectory and is computed as a windowed finite-resolution estimator, with consistency between the two stated as a proposition. The metric is an explicit formula and plays a dual role: as a gradient-free fitness function and as a post-hoc analytical lens on any simulation that exposes local transition laws. Empirically, MSPD-optimized parameters produce higher held-out complexity scores than matched random parameters from the same substrate. High-HDeltat states correspond to states with higher instability to external interventions, so the metric tracks the biology of the underlying dynamics rather than noise. Higher MSPD corresponds to stronger scale-dependent frustration: high-complexity systems exhibit larger differences between the dynamics expressed at different spatial extents, linking MSPD directly to the frustration criterion of biological complexity in the sense of Vanchurin et al. [ 23 ]. The same protocol transfers beyond the primary Flow-Lenia substrate to Life-like cellular automata and Particle Life++, where C1, C2 and C5 all hold. A single explicit formula thus both directs open-ended evolution and provides a principled bridge to the physics of complexity that black-box drivers do not.
Mikhail Akhtyrchenko, Mikhail I. Katsnelson, Andrey Ustyuzhanin
Can evolutionary dynamics characteristic of biological development arise without a designer-specified fitness function? We present Genesis, a platform in which agents inhabit a Gray-Scott reaction-diffusion substrate and evolve under physical constraints alone. Three successive experimental cycles, each testing one falsifiable hypothesis, show: (1) constraint-driven selection sustains evolutionary activity after complete fitness removal but reaches a hard phenotypic complexity ceiling; (2) agent-mediated niche construction via chemical secretion is real but causally insufficient to break that ceiling; and (3) replacing the fixed-alphabet genome with a Compositional Pattern Producing Network (CPPN) indirect encoding, protected by NEAT-style speciation, produces the first evidence of progressive structural complexification in a fitness-free system. Null results are treated as precise, informative answers rather than failures, yielding reusable diagnostic tools and a sham-control protocol applicable to any open-ended evolution evaluation pipeline.
We study an in-silico substrate in which every pixel of a two-channel cellular-automata grid carries a tiny neural network (an agent) that senses its Moore neighborhood. A cell persists only by self-replication: a living neighbor is cloned and its weights are mutated by a uniform perturbation, so that phenotype (cell state) is driven entirely by genotype (network weights). From a handful of seeded founders the system grows into a spatially organized ecosystem of coexisting, competing and dominating species. Our main contribution is a battery of coarse-grained diversity metrics that make such growth measurable at two scales: four phenotypic tools based on cellular-type frequency, entropy and cell variance, and two genotypic tools that colour each agent by a hash of its full weight vector versus a sparse random-weight probe. Across a five-fold sweep of 1680 small runs and 24 long (1000-generation, 200 x 200) runs, the substrate is persistent and self-maintaining in 20 of the 24 long configurations and exposes a clear phenotype-genotype diversity trade-off: raising phenotypic diversity collapses genotypic diversity and vice versa. Full-genome hash colouring further reveals lineage structure that a random-weight probe systematically misses. Code, data and animations are released as supplementary material.