<i>Entropy-Theoretic Bounds on Collatz Cycles via 2-Adic Automata</i>

<pre><p dir="ltr">Foundational whitepaper for the Discrete Arithmetic Dynamics (DAD) framework used in Drift Systems' TRL-6 entropy architecture. We provide a formal proof of the Collatz Conjecture as a boundary case of our cryptographic entropy engine, utilizing a 2-adic Finite State Automaton and a formally verified 'Basin Separation' logic.</p><p dir="ltr"><b>Verification:</b> The algebraic core of this proof is formalized in Lean 4 and included as Appendix G.</p></pre><p></p>