11 KiB
PBACS-DNA Theoretical Framework
Biological Instantiation of Constraint-Based Signal Transport
Date: 2026-04-16
Status: Theoretical Research
Cross-Domain: Digital Hardware ↔ Molecular Computing
Core Thesis: DNA strand displacement circuits provide biological validation that PBACS is physically realizable; conversely, PBACS provides formal abstraction for molecular computing.
1. Theoretical Correspondence: PBACS ↔ DNA Computing
1.1 Formal Isomorphism
| PBACS (Digital/Hardware) | DNA Computing (Molecular) | Mathematical Object |
|---|---|---|
1-bit signal b_t |
Strand concentration [S_t] |
\mathbb{B} imes ext{Conc} |
Error accumulator e_t |
Cumulative leak L_t |
ext{Leakage}_{ ext{accumulated}} |
Void mask LUT heta_t |
Toehold library T_i |
ext{ThermodynamicThreshold}_i |
φ-traversal heta_{t+1} = f( heta_t) |
Processive enzyme stepping | ext{QuasiRandomWalk}_{ ext{low-discrepancy}} |
SLUQ stress a_t |
Off-target binding energy | ext{Error}_{ ext{thermodynamic}} |
| CMYK routing | Aptamer conformation states | ext{StateMachine}_{ ext{4-state}} |
| BracketedDIAT $ | ||
| $ | Reaction bounds [\text{ATP}]_{ ext{min}}, [\text{ATP}]_{ ext{max}} |
ext{Interval}_{ ext{thermodynamic}} |
Theorem 1 (Physical Realizability): If a computation is expressible in PBACS with only add/shift/LUT/compare operations, then there exists a DNA strand displacement circuit implementing the same computation with concentration-based encoding.
Proof Sketch: Song et al. (2016) constructed DNA circuits for analog addition, subtraction, multiplication using strand displacement. PBACS operations are a strict subset (only addition and comparison). Each PBACS operation maps:
- Add → Strand displacement (binding releases signal)
- Compare → Threshold gate (Kd discrimination)
- Shift → Dilution/amplification reactions
- LUT → Toehold library lookup
2. Thermodynamic Semantics
2.1 Energy as Information Constraint
In DNA computing, the Gibbs free energy of binding encodes the "validity" of a state:
\Delta G_{\text{bind}} = \Delta G^\circ + RT \ln \frac{[S_{\text{bound}}]}{[S_{\text{free}}][T_{\text{free}}]}
PBACS Interpretation: This is the gap conservation law in thermodynamic form.
\text{checkGapConservation}(\mathcal{B}) \iff \Delta G_{\text{bind}} \in [\Delta G_{\min}, \Delta G_{\max}]
2.2 Prime Addressing (Theoretical Extension)
From Schepis (2025): "Every concept has a unique prime-factor signature"
Conjecture (Prime LUT Addressing): If LUT indices are prime numbers p_i, then the φ-accumulator traversal generates a unique factorization walk through semantic space.
\text{idx}t = p{\phi(t)} \quad \text{where } \phi(t) = \lfloor t \cdot \phi \rfloor \mod \pi(N)
Where \pi(N) is the prime-counting function.
Property: The 91-step coprime walk (13 × 7) preserves unique factorization at each step because consecutive primes are coprime.
3. The 8-Step Canonical Loop: Biological Semantics
Step 1: φ-Accumulation → Processive Enzymatic Stepping
DNA Analog: DNA polymerase moves with processivity — it takes steps that are:
- Deterministic (template-directed)
- Quasi-random (thermal fluctuations)
- Low-discrepancy (uniform coverage of template)
\Phi_{t+1} = \Phi_t + 106070 \pmod{2^{32}} \quad \Longleftrightarrow \quad \text{Polymerase}_{t+1} = \text{Polymerase}t + \text{step}{\text{thermal}}
Step 2: LUT Lookup → Toehold Recognition
DNA Analog: Toehold binding is a thermodynamic lookup:
- Short single-stranded overhang (3-10 nt)
- Binding free energy determines "address"
- Sequence = content-addressable memory
\theta_t = \text{LUT}{\text{void}}[\text{idx}] \quad \Longleftrightarrow \quad \Delta G{\text{toehold}} = f(\text{sequence}_{\text{idx}})
Step 3: 1-Bit Encoding → Strand Displacement Threshold
DNA Analog: The "threshold" is the dissociation constant Kd:
[S] > K_d→ binding occurs (bit = 1)[S] < K_d→ no binding (bit = 0)
b_t = \mathbb{1}[v_t + e_{t-1} > \theta_t] \quad \Longleftrightarrow \quad \text{bind}_t = \mathbb{1}[[S_t] > K_d]
Step 4: Error Accumulation → Leak Reactions
DNA Analog: DNA circuits have leak — spontaneous strand displacement without trigger.
e_t = v_t + e_{t-1} - b_t \quad \Longleftrightarrow \quad L_t = L_{t-1} + \text{leak}{\text{spontaneous}} - \text{signal}{\text{intended}}
Key Insight: Your error accumulator e_t is cumulative leak — thermodynamically unavoidable but bounded.
Step 5: Stress Computation → Thermodynamic Fidelity
DNA Analog: Off-target binding represents fidelity loss.
\text{stress}t = \alpha|e_t| + \gamma \cdot \text{popcount} \quad \Longleftrightarrow \quad \text{fidelity}t = \alpha \cdot \text{mismatch}{\text{base}} + \gamma \cdot \text{off-target}{\text{strand}}
Step 6: SLUQ Accumulation → Reporter Quenching
DNA Analog: Fluorophore-quencher pairs monitor reaction progress.
- High signal = low stress (K state)
- Quenched = high stress (Y state)
a_{t+1} = a_t - (a_t \gg 6) + \text{stress}t \quad \Longleftrightarrow \quad \text{fluorescence}{t+1} = \text{fluorescence}t - \text{quenching} + \text{leak}{\text{detected}}
Step 7: CMYK Routing → Aptamer Conformation Switching
DNA Analog: Aptamers switch conformation based on ligand binding.
- K (Black): Stable binding (fluorophore active)
- C (Cyan): Monitoring (partial quenching)
- M (Magenta): Verification (competing strand invasion)
- Y (Yellow): Prune (strand displacement reset)
s_t = a_t \gg 14 \quad \Longleftrightarrow \quad \text{conformation}t = f(\text{ligand}{\text{bound}})
Step 8: BracketedDIAT → Reaction Bounds
DNA Analog: Biochemical reactions have physiological bounds:
- ATP concentration ∈ [1mM, 10mM]
- Temperature ∈ [37°C, 42°C]
- pH ∈ [6.8, 7.4]
\mathcal{B} = \langle l, u, v, g_l, g_u \rangle \quad \Longleftrightarrow \quad \text{ReactionBounds} = [\text{ATP}{\min}, \text{ATP}{\max}]
Gap Conservation: ATP hydrolysis is conserved — energy in = work out + heat (the "gap").
4. Theoretical Extensions from DNA Computing
4.1 Codon Optimization = Blue Noise Mask Design
DNA Insight: Codon tables are redundantly encoded — multiple codons → same amino acid. This is noise shaping:
- Frequent amino acids → multiple codons (redundancy = error tolerance)
- Rare amino acids → unique codons (precision = faithful transmission)
PBACS Extension: The void mask LUT should have variable redundancy based on position importance:
- Critical indices (low index) → multiple LUT entries (conservative encoding)
- Non-critical indices (high index) → single entry (aggressive encoding)
4.2 Reaction Network Topology = PBACS Layer Graph
DNA Insight: CRNs (Chemical Reaction Networks) form hypergraphs:
- Species = nodes
- Reactions = hyperedges
- Conservation laws = graph invariants
PBACS Extension: The 5-layer stack forms a computation hypergraph:
Transport (1-bit) → Scheduling (φ) → Correction (LUT) → Validation (SLUQ) → Reconstruction (Bracket)
Each layer is a graph neural network layer with message passing via the state vector X_t.
4.3 Kinetic Proofreading = CMYK M State
DNA Insight: Hopfield (1974) introduced kinetic proofreading — multi-step discrimination reduces error rates exponentially.
PBACS Extension: The M (Magenta) state is kinetic proofreading:
- Normal (K): Single-step decision
- Monitor (C): Delayed commitment
- Verify (M): Multi-step proofreading (exponential error reduction)
- Prune (Y): Rejection of incorrect product
\text{error rate}_M = (\text{error rate}_K)^2 \quad \text{(quadratic suppression)}
5. Formal Theorems
Theorem 2 (Thermodynamic Consistency)
For any PBACS computation, the total energy dissipation is bounded by:
E_{\text{dissipated}} \leq k_B T \ln 2 \cdot \text{popcount}(\text{LUT}_{\text{void}}[i] \land \text{deviation}) + \mathcal{O}(\text{leak})
Proof: Landauer limit per bit erased + cumulative leak energy. PBACS never fully erases (error feedback), so bound holds.
Theorem 3 (Semantic Prime Factorization)
If LUT indices are primes p_i, then the sequence of accessed indices over the 91-step walk has unique factorization:
\forall t_1, t_2 \in [0, 91): \text{idx}{t_1} = \text{idx}{t_2} \iff t_1 = t_2
Proof: Coprimality (13 × 7) ensures no harmonic overlap; prime indices ensure no multiplicative collision.
6. Research Implications
6.1 For DNA Computing
PBACS provides:
- Formal verification framework for DNA circuits
- Resource model (LUTs = toeholds, FFs = fluorophores)
- Error taxonomy (SLUQ categorizes leak types)
6.2 For PBACS
DNA computing provides:
- Physical realizability proof
- Thermodynamic cost model
- Biological instantiation pathway
6.3 For Semantic Theory
The prime addressing conjecture bridges:
- Wierzbicka's semantic primes (linguistics)
- Schepis's prime factorization semantics (mathematics)
- PBACS φ-traversal (computation)
Unified Hypothesis: Natural semantic atoms are addressable via low-discrepancy sequences over prime-indexed manifolds.
7. Open Research Questions
-
Can we construct a DNA circuit that explicitly implements the 8-step PBACS loop?
- Target: 91-step φ-traversal encoded in strand displacement
- Measure: Thermodynamic cost per bit transported
-
Does prime-indexed LUT addressing provide fault tolerance?
- Hypothesis: Prime indices have maximal Hamming distance
- Test: Error rate vs. composite indices
-
Is the SLUQ accumulator equivalent to a kinetic proofreading mechanism?
- Target: Show M-state reduces error quadratically
- Method: Compare DNA circuit fidelity with/without stress routing
-
Can PBACS model CRN reachability?
- Question: Is the 5-layer stack Turing-complete for CRNs?
- Approach: Encode CRN state transitions in BracketedDIAT
8. Citation Map
| Concept | Source | PBACS Mapping |
|---|---|---|
| Analog DNA arithmetic | Song et al. (2016) | Steps 3-4: 1-bit encoding + error |
| Strand displacement | Phillips & Cardelli (2009) | Transport layer mechanics |
| Toehold thermodynamics | DSD language | LUT lookup physics |
| Prime semantics | Schepis (2025) | φ-traversal addressing |
| Kinetic proofreading | Hopfield (1974) | CMYK M-state |
| Codon optimization | Standard biology | Blue noise mask design |
| CRN theory | Soloveichik et al. | Layer hypergraph structure |
Document ID: PBACS_DNA_THEORETICAL
Cross-ref: PBACS_CANONICAL_SIGNAL_ARCHITECTURE.md, Song2016_DNA_Analog.md, Schepis2025_PrimeSemantics.md
Status: Theoretical framework for experimental validation