DSAC as a Realization of Transputation A Candidate Architecture for Internal Adjudication Under Closure

Paper 76 defines transputation as the internal adjudicative layer forced under closure and record-divergent choice in diagonal-capable frameworks. This paper presents DSAC (Delta Self-Adjudicative Computation) as a candidate realization family, supported by an abstract interface-level formalization in transputation-lean. We map the \Delta-machine architecture—continuous lattice, reflexive constraint graph, scenario-driven execution—to the realization criteria of Paper 76. DSAC is presented as a candidate realization family satisfying the Paper 76 realization criteria; it is evidence of realizability, not the definition of the adjudicative class. We summarize validation evidence from a series of experiments: SAT, Max-SAT, constraint discovery, metric closure, and the traveling salesman problem (TSP). DSAC is not the definition of transputation; it is one implementation family that operationalizes the structural role identified in Paper 76. This overview presents the core NEMS theorem engine and selected applications; stronger domain-specific derivation and ontological synthesis claims belong to separate release surfaces with their own premise bundles and formal artifacts. Trust boundary. Scenario performance is empirical; machine-checked content is the interface layer in transputation-lean (see ). No claim is made that the \Delta-machine dynamics have been fully formalized in Lean.