# Smaller degrees with unchanged variable counts The v28 manuscript `papers/finite_algebra/unit_norm_20261114_v28.tex` proves the new general degree bounds, gives all source formulas, and describes one finite integer-polynomial construction for each row. The complete native circuits and specifications are reproducible from `computation/few_variables/unit_norm_v28`. | Route | Total variables | Previous bound | New bound | |:--|--:|:--|:--| | Inherited premises, no additional conjecture | 25 | <2^78 | **64674204453175296 <2^56** | | Fully specified under inherited premises | 27 | <2^80 | **442502070853959680 <2^59** | | Weak rational abc at 121/100 | 13 | <2^38 | **155568385 <2^28** | | Weak rational abc at 16/15 | 13 | <2^38 | **126445825 <2^27** | All counts include the input. These are upper bounds for unexpanded polynomials. No reduction of the 25- or 13-variable counts is asserted. The quartic counts 204, 260 fully specified, and 79 under ordinary rational abc are unchanged. The largest improvement replaces a product over possible nonzero ranks by one determinant, using a scalar algebra norm to exclude all bad conjugate components. A new completeness proof shows that integer inputs still have witnesses on this smaller locus. Point coordinates use a free rank-four basis; elliptic differences are computed homogeneously; the pole equations undergo an invertible rational rescaling and exact square extraction. In the 25-variable family alone the scale `(1+rho*T^2)^2` is replaced by `1+rho*T^2`. That last arithmetic change may change the ineffective sufficient exponent for the 25-variable family. It is not made in the explicit 27-variable family: its certified L=20483 is retained, and its coefficient height is now below **2^(2^72)**. The conditional sufficient shifts remain ineffective. Stored L=3 and B=3 fixtures are not certified defining members. The full-unit completeness proof uses the already retained simultaneous elliptic pole realization, including density obtained by independent odd multiples. It would not follow merely from a black-box assertion that one pole witness exists. Density permits avoiding finitely many zero sets; it does not permit identifying pole parameters or prescribing one of them arbitrarily. The proof includes vanishing conjugate guards, nonreal quadratic roots, nonreduced boundary fibers, negative and even conditional indices, and all source denominators. The old source manuscripts and byte-pinned data are unchanged. The external arithmetic audit and non-author mathematical review remain incomplete. Exact computations certify the stated algebraic and combinatorial checks, not those infinite premises. Run `scripts/verify_v28.py`, `scripts/verify_release_v27.py`, and `scripts/verify.py --full` with native Python 3.12 and SymPy 1.14.0.