The Coherence Engine: Exploring the Space of Coherent Structures

This work introduces the coherence engine, a computational framework for constructing and executing coherent structures in the untyped λ-calculus. Beginning from stochastic β-reduction under finite reduction budgets, the framework generates coherent chains that admit recursive collapse into compact computational representations. We show that independently generated chains compose through junctions satisfying a non-divergence property, giving rise to feed-forward and recurrent coherent structures with convergent execution. This work develops the computational theory of coherent structures and serves as a companion to The Universal Explainer, which investigates how such structures acquire physical meaning through representational theories.