DNA Ternary Full Adder

arXiv:2603.11684v2 Announce Type: replace
Abstract: As transistor dimensions continue to shrink, binary devices are rapidly approaching their fundamental limits in power density. In response, multi-valued systems have attracted significant attention due to their enhanced information density. Among these, the ternary system stands out as the most practical option, being the closest integer base to (e), which is considered optimal for information efficiency. Despite the intrinsic advantages of DNA nanomaterials, such as programmability, energy efficiency, and massive parallelism, their application in ternary logic remains largely unexplored, particularly in the realm of ternary addition circuits. This gap can be attributed to a fundamental challenge: ternary logic requires circuits capable of recognizing and processing a far larger set of input combinations than binary systems, a task that existing models and techniques often struggle to accomplish. In this work, we propose a novel architecture for a ternary full adder. Our design includes a competitive blocking (CB) circuit that enables the recognition and computation of all possible three-input ternary combinations. Coupled with a dynamic concentration adjustment (CA) strategy, this approach significantly enhances the number of trits that can be processed. Biochemical experiments demonstrate that the CB circuit successfully yields the correct output digits for a ternary full adder, achieving 17-trit ternary addition. To our knowledge, this work represents the first successful DNA-based ternary adder, establishing a new methodological foundation for DNA computing and highlighting its considerable potential for scalable digital information processing.