--- title: Thermodynamic Binding Networks in Molecular Computation url: https://www.emergentmind.com/topics/thermodynamic-binding-networks-tbns type: topic --- # Thermodynamic Binding Networks in Molecular Computation Searching arXiv for papers on Thermodynamic Binding Networks to ground the article in the primary literature. Thermodynamic Binding Networks (TBNs) are an abstract model of molecular computation in which the thermodynamically favored outcomes of a system are determined solely by two combinatorial quantities: how many complementary bonds are formed and how many connected complexes, or polymers, exist in the resulting configuration. The model was introduced to study whether the intended outputs of molecular systems can be made consistent with thermodynamic equilibrium rather than only with a desired kinetic pathway [1709.07922]. In the TBN limit used in the foundational work, binding is prioritized infinitely more strongly than entropy, but among maximally bonded states the preferred configurations are those with more separate polymers [1709.08731]. This makes TBNs a geometry-free framework for analyzing strand displacement cascades, algorithmic tile assembly, and related synthetic molecular systems in which equilibrium correctness is a central design constraint [1709.07922]. ## 1. Formal model and thermodynamic criterion A standard presentation defines a TBN as a triple \[ \mathcal{T} = (D, *, \mathbf{T}), \] where \(D\) is a finite set of site types, \(*:D\to D\) is an involution with no fixed points, and \(\mathbf{T}\) is a finite multiset of monomer types, each monomer type itself being a finite multiset over \(D\) [1709.08731]. Closely related presentations instead write \(\mathcal{T}=(D,M)\), with \(D\) the set of primary domain types and \(M\) a finite set of monomer types over \(D\cup D^*\) [1709.07922]. The 2018 kinetic-barrier work explicitly notes that multiple equivalent ways of defining or packaging the model do not change the essential thermodynamic or computational behavior [1810.12889]. In all of these formulations, site or domain types come in complementary pairs such as \(a\) and \(a^*\), and bonds may form only between complementary types [1709.07922]. Monomers are treated as unstructured multisets of sites rather than geometric objects. A configuration is therefore determined by connectivity, not by shape, orientation, or steric constraints [1709.08731]. This geometry-free character is deliberate: TBNs ignore spatial layout and sequence detail in order to isolate the combinatorial consequences of bond formation and configurational entropy [1810.12889]. The thermodynamic objective is lexicographic. In the foundational formulation, a configuration is **saturated** if no complementary pair remains both unbound, equivalently if it maximizes the number of bonds among all configurations of the same monomer collection [1709.07922]. A configuration is **stable** if it is saturated and, among all saturated configurations, has the maximum number of connected components [1709.07922]. The same idea is sometimes expressed as a free-energy tradeoff of the form \[ G(\sigma) = -b(\sigma) + c(\sigma), \] where \(b(\sigma)\) is the number of bonds and \(c(\sigma)\) is the number of complexes, with the understanding that the model studies the regime in which bond maximization dominates and the complex count breaks ties among bond-maximal states [1810.12889]. A recurring misconception is that TBN stability is determined only by bond count. The model explicitly rejects that simplification: two saturated configurations with the same number of bonds can differ in thermodynamic preference because the one with more separate polymers has higher configurational entropy and is preferred in the TBN limit [1709.08731]. ## 2. Configurations, polymers, and saturation In the explicit-matching formalization, a configuration chooses pairings between sites such that each site is paired with at most one complementary site and only complementary types may pair [1709.08731]. Two monomers bind if any site on one pairs with a site on the other, and a polymer is a connected component under this binding relation [1709.08731]. The number of polymers is denoted \(\#\text{polymers}\) [1709.08731]. The 2020 integer-programming formulation reorganizes the same thermodynamic notion in polymer-centric terms. There a configuration is a partition of the monomers into polymers, and a polymer is **self-saturated** if it has no exposed starred sites; a configuration is saturated if every polymer is self-saturated [2011.10677]. Under the star-limiting convention, where the total supply of each starred site is at most the supply of its unstarred complement, saturation is equivalent to forming all possible bonds [2011.10677]. The 2017 complexity paper gives a related characterization: a configuration is saturated iff every limiting site is paired, where a site type is limiting if its complement occurs at least as often as it does [1709.08731]. Later work made the entropy term more operational. The 2020 formulation shows that among saturated configurations, stable ones are exactly those minimizing the number of polymer merge operations needed to reach them from the all-singleton state [2011.10677]. If \(\gamma\) is a configuration and \(\overline{\gamma}\) is the set of its non-singleton polymers, the merge count is \[ m(\gamma)=\left(\sum_{P\in \overline{\gamma}} |P|\right)-|\overline{\gamma}|, \] so stability can be read equivalently as **saturated plus minimum merge count** [2011.10677]. The 2023 signal-amplification paper adopts the same perspective via the all-melted configuration \(melt(T)\), the merginess \(m(\alpha)\), and the starriness \(s(\alpha)\), with saturation characterized by \(s(\alpha)=0\) [2307.01550]. This family of equivalent viewpoints is significant because it permits both explicit combinatorial reasoning about pairings and higher-level optimization over polymers. A plausible implication is that TBNs are best understood not as a single syntactic formalism but as a thermodynamic principle that admits several mathematically convenient representations. ## 3. Equilibrium computation and design The original purpose of TBNs was to study whether computation can be encoded directly into thermodynamically favored final states rather than only into prescribed time evolutions [1709.07922]. The foundational paper gives constructions for Boolean AND/OR formulas and for a self-assembling binary counter whose desired outputs are exactly the stable configurations [1709.07922]. It distinguishes **weak output convention**, where output \(1\) means there exists a stable configuration with free output monomer, from **strong output convention**, where output \(1\) means every stable configuration has the output monomer free and output \(0\) means every stable configuration has it bound [1709.07922]. A key robustness notion in those constructions is **distance to stability**, the entropy gap between the best stable state and the best saturated state with the wrong output [1709.07922]. For trees of AND gates of depth \(k\) with redundancy \(n\), the paper proves that if at least one input is absent, then the distance to stability for any saturated configuration with output \(1\) is at least \(n-2k-1\), and notes a stronger refined bound of \(n-2\) [1709.07922]. For translator cascades of depth \(k\) and redundancy \(n\), any saturated configuration with output \(1\) has entropy \(n(k-1)+2\), whereas the intended output-\(0\) configuration has entropy \(nk+1\), giving an entropy gap of \(n-1\) [1709.07922]. The computational scope of the model was extended in "Thermodynamically Favorable Computation via Tile Self-assembly" [1802.02686]. That work defines what it means for a TBN to simulate an \(s\)-space-bounded Turing machine or a Boolean circuit in equilibrium, gives constructions robust to variability in monomer counts and to multiple copies of the computation forming in parallel, and shows that a naïve strategy of porting abstract Tile Assembly Model systems directly into TBNs can fail because the lack of geometry permits splicing and rewiring [1802.02686]. To repair that deficiency, it introduces **Geometric Thermodynamic Binding Networks (GTBNs)**, in which monomers are rigid geometric objects and saturation is replaced by **effective saturation**, allowing unbound complementary domains only when geometry makes binding impossible [1802.02686]. The same paper shows that GTBNs can simulate Turing machines with \(O(|Q||\Gamma|)\) domain and monomer type complexity, comparable to the aTAM, whereas the ordinary TBN simulation requires location-specific monomers and is therefore much less efficient [1802.02686]. This establishes a central limitation of ordinary TBNs: abstracting away geometry yields broad generality and strong equilibrium reasoning, but it can also erase the spatial constraints needed for efficient faithful simulation of kinetic assembly systems. ## 4. Complexity of stable-state analysis The first systematic complexity study defines \[ S(\mathcal{T})=\max\{\text{\#polymers in a saturated configuration of }\mathcal{T}\}, \] the maximum number of polymers achievable in a saturated configuration [1709.08731]. This quantity is central because it determines whether a given saturated configuration is stable and underlies reductions for other questions [1709.08731]. | Problem | Decision question | Complexity | |---|---|---| | \(\textsc{SaturatedConfig}\) | Does a TBN have a saturated configuration with at least \(k\) polymers? | NP-complete | | \(\textsc{StablyFree}\) | Can monomer \(m\) be free in some stable configuration? | \(P^{NP}_{\parallel}\)-complete | | \(\textsc{StablyTogether}\) | Can monomers \(m_1,m_2\) be in the same polymer in some stable configuration? | \(P^{NP}_{\parallel}\)-complete | The NP-hardness of \(\textsc{SaturatedConfig}\) is obtained by reduction from Exact Cover [1709.08731]. The construction yields a TBN \(\mathcal{T}(X)\) such that \(S(\mathcal{T}(X))=2\) if \(X\in\textsc{ExactCover}\) and \(S(\mathcal{T}(X))=1\) otherwise [1709.08731]. The paper strengthens this to a gap construction \(\mathcal{T}_j(X)\) with \(S(\mathcal{T}_j(X))=j\) in the yes-case and \(1\) otherwise, implying that for any \(\delta<1\), no polynomial-time \(n^\delta\)-approximation exists for \(S(\mathcal{T})\) unless \(P=NP\) [1709.08731]. The problems \(\textsc{StablyFree}\) and \(\textsc{StablyTogether}\) are motivated by molecular readout conventions. A monomer free in a stable configuration can model output release in strand displacement; two monomers in the same polymer can model co-localization-based readout [1709.08731]. Their completeness proofs use graph-theoretic reductions through maximum independent sets and minimum vertex covers [1709.08731]. The paper also gives black-box reductions connecting these problems back to \(S(\mathcal{T})\); for example, if monomer \(m\) can be free, then \[ free(m)=S(\mathcal{T}\setminus\{m\})+1, \] and \(m\) is stably free iff \(free(m)=S(\mathcal{T})\) [1709.08731]. These results establish that worst-case equilibrium verification is intrinsically hard. The significance of later algorithmic work is therefore not that it eliminates hardness, but that it identifies representations in which many practically relevant instances remain tractable. ## 5. Verification methods, integer programming, and algebraic structure The first practical verification method for TBNs reduces stability questions to SAT. The encoding uses Boolean variables \(\textsf{Pair}_{s,t}\) for site pairings, \(\textsf{Bind}_{m_1,m_2}\) for monomer binding, \(\textsf{Rep}_m\) for polymer representatives, and \(\textsf{Sum}_{i,j}\) for counting representatives [1709.08731]. It enforces saturation using the characterization that every limiting site must be paired, ensures polymer connectivity via transitivity of \(\textsf{Bind}\), and imposes \(\sum \textsf{Rep}_m \ge k\) through a simplified Sinz-style cardinality encoding [1709.08731]. The reported encoding size is \(O(n^2)\) clauses of size \(O(n)\) for saturation, \(O(n^3)\) constant-size clauses for polymer structure, and \(O(nk)\) clauses for the \(k\)-polymer constraint [1709.08731]. The 2020 paper replaces explicit monomer copies and explicit bond matchings with an integer-programming formulation over monomer-type counts per polymer slot [2011.10677]. If no better bound is known, it takes \(B=|\mathcal{T}_L|\), the number of limiting monomers, as an upper bound on the number of non-singleton polymers [2011.10677]. With integer variables \((m,j)\) giving the count of monomer type \(m\) in polymer \(P_j\) and Boolean variables \((j)\) indicating nonemptiness, the objective is \[ \min \sum_{j=1}^{B}\left[\left(\sum_{m\in \mathcal{T}} (m,j)\right)-(j)\right], \] which is exactly the total merge count over nonempty polymers [2011.10677]. The formulation incorporates conservation, self-saturation, nonemptiness, big-\(C\) constraints for exact emptiness when enumerating optima, and lexicographic symmetry-breaking constraints [2011.10677]. This IP formulation avoids two major symmetries of the SAT approach: permutation symmetry among identical monomer copies and bond-configuration symmetry within a polymer [2011.10677]. It also handles infinite counts of nonlimiting monomers, which the paper emphasizes SAT-based approaches cannot do directly [2011.10677]. The authors report using SCIP to find the optimal objective value quickly and CP-SAT to enumerate all optimal solutions [2011.10677]. The same paper gives a structural theorem: if \(A_M\) is the monomer matrix whose columns are monomer net-count vectors, then self-saturated polymers are precisely the integer points in the pointed cone \[ \{p\in \mathbb{R}^m : A_Mp\ge 0 \text{ and } p\ge 0\}, \] and the **polymer basis** is the Hilbert basis of this cone [2011.10677]. The polymer basis consists of those polymers that appear in some saturated configuration and cannot be partitioned into two or more self-saturated polymers [2011.10677]. This identifies the “fundamental components” out of which locally minimal energy configurations are composed and enables reasoning not only about stable equilibria but also about entire kinetic pathways [2011.10677]. ## 6. Kinetic barriers, amplification, and concentration-level interpretations Although TBNs were introduced as an equilibrium model, later work used them to reason about kinetic structure induced by thermodynamic constraints. "Programming Substrate-Independent Kinetic Barriers with Thermodynamic Binding Networks" extends the model with a barrier notion defined by the maximum excess free energy along a path of configurations and shows that one can engineer barriers that are independent of the substrate being processed [1810.12889]. Its constructions use repeated modules so that any path between designated states must pass through an unfavorable intermediate whose penalty scales with the number of repeats; the paper states that for every \(n\), there exists a TBN family with barrier at least \(n\), independent of the substrate [1810.12889]. The examples include catalytic systems, translator constructions, and hashgate modules [1810.12889]. The 2023 paper studies a different question: how much the stable-state landscape can change when a single analyte monomer is added [2307.01550]. It defines a distance \(d(T,T')\) between TBNs by minimizing the \(L^1\) distance between polymer-count vectors of stable configurations [2307.01550]. Its main theorem states that for every \(n\ge 1\) and \(k\ge 2\), there exists a TBN \(T_{n,k}\) and analyte \(\mathbf a\) such that \(T_{n,k}\) and \(T_{n,k}^{\mathbf a}\) each have exactly one stable configuration, those stable configurations are at distance at least \(2^n\), both systems have entropy gap \(\lfloor k/2\rfloor-1\), and the construction uses \(\mathcal O(nk)\) total monomer types, \(\mathcal O(nk^2)\) domain types, and \(\mathcal O(k^2)\) domains per monomer [2307.01550]. In the analyte-absent stable state, all reporter monomers are bound; after adding one analyte copy, those reporters are unbound [2307.01550]. The same paper also proves a limitation theorem: if a TBN has \(d\) domain types, \(m\) monomer types, and at most \(a\) domains on each monomer, with \(n=\max\{d,m,a\}\), then adding one copy of a monomer changes the stable-state landscape by at most \[ d(T,T') \le n^{8n^{7n^2}}. \] This doubly exponential upper bound is derived through an integer-programming representation over polymer-basis variables and sensitivity results from integer programming [2307.01550]. The translator-gadget refinement \(\widetilde{T}_{n,k}\) reduces the largest polymer size to \(\mathcal O(k)\) while preserving exponential separation between analyte-absent and analyte-present stable landscapes [2307.01550]. A final extension connects the discrete TBN viewpoint to real-valued equilibrium concentrations in athermic chemistry. "Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems" studies monomer–polymer systems in which all interactions preserve enthalpy and equilibrium is governed purely by entropy, a regime described as consistent with saturated configurations in the TBN model [2507.12699]. It proves that if an on-target set of polymers is stable in the appropriate ratio sense, then there exist monomer concentrations realizing a detailed-balance equilibrium in which each on-target polymer \(P\) has concentration \(c^{\bar\mu(P)}\), while every off-target polymer has exponent strictly larger than \(1\) and therefore concentration strictly below \(c\) for \(0