Specular Bit Architecture for DNA Data Storage: Exact Normalization, Local Integrity Checks, and Orientation in Constrained Codes

Specular Bit Architecture (SBA) can provide an exact digital representation and integrity layer for DNA storage, provided that arithmetic normalization, channel decoding, and molecular implementation are distinguished. This paper rebuilds the DNA-storage application around the current finite-support mirror-counter framework. Primitive Fibonacci weights, sign-coherent canonical words, complete atomic transactions, and decreasing potentials replace earlier incomplete normalization and propagation arguments. A concrete mapping of two nonnegative canonical lanes to nucleotides yields an exactly enumerable constrained code. We prove that its intersection with its reverse-complement image contains only four alternating words; an interior GC-content constraint therefore gives unambiguous orientation for error-free framed blocks. Paired Fibonacci checksums detect bounded errors on any two adjacent arithmetic coordinates and recover them when their location and the reference are trusted. Applied separately to the two lanes, they provide a conditional repair construction for adjacent nucleotide substitutions. Interior normalization transactions preserve both checksums, enabling a precisely scoped reduction in reference-update work. The updated State-11 theory supplies reversible sanitizer records, exact weighted event budgets, and finite neutral relaxation without changing the stored payload. Capacity bounds, allocation contracts, counterexamples, and matched evaluation criteria delimit these results. The contributions are mathematical constructions and controller specifications; improved molecular endurance, autonomous biochemical repair, and superiority to established DNA-storage codecs are not established. Index Terms: Specular Bit Architecture, DNA data storage; Fibonacci numeration, exact rewriting, constrained coding, reverse complement, local checksums, State-11 accounting