A Relational Proof Architecture for the Collatz Problem in the Hclean Model

This preliminary manuscript introduces the Hclean relational proof architecture for the reduced Collatz dynamics. The framework reorganizes the dynamics through finite-resolution relational states, valuation signatures, tail families, a relational center generated by the reduced fixed point 1, anti-escape analysis, anti-autonomy analysis, and a final bridge to closure at the classical reduced fixed point. The deposit establishes a timestamped priority record before planned Lean 4 formalization, external mathematical review, and reproducible release.