The genetic code as an information theorem: forced architecture, early freezing and the door of 20

We address the complementary question to PAP_BIO_002: why does the genetic code have this architecture and not another? The answer is an information theorem, not a group theory result. First, the code is exceptional against chance (0 of 2×10⁴ random codes dominate it simultaneously in chemical balance and robustness) but it is not the global or local optimum: it is an early freezing (Freeland 2000), and living mitochondrial codes still move toward the Pareto frontier today. Second, the evolutionary chronology of amino acids follows the binary expansion tree of the code (Spearman ρ = 0.77, p = 5×10⁻⁵): the oldest level is the most informative and the most protected. Third, we prove the forced architecture theorem (T1–T5): given the chemical two-bit alphabet with antipodal involution and ~20 identity signals, any optimized molecular information system necessarily has words of length 3, 5-bit identity plus one free bit (wobble/punctuation), antipodal covariance (Hardy–Littlewood–Pólya rearrangement), reading hierarchy by information gain, and extreme error correction. The architecture is separated into three parts: the forced (pure information theory), the contingent (the concrete assignment, frozen within the Pareto frontier), and the number 20 of amino acids, whose direct attack is reported and completed here with honesty: aminoacylation fidelity does not bound it (n_max ~ 600) and the chemical coverage saturation program is executed in both metrics (density and range, pre-registered criteria) with negative result. The two routes to 20 (icosahedron via Clifford and roots of A₄ via SU(5)) are proven to be a single mathematical object (A₅/ℤ₃ with canonical ℤ₂), and this object yields its first verified non-circular prediction: the number of degeneracy-1 amino acids is 2, from the color ℤ₃ of the chain itself. Five no-gos are reported with honesty, including the A₅ simplicity obstruction that closes the labeling route at the theorem level. With optimality routes exhausted, 20 is accepted as a declared input.