arXiv:2611.24527v1 Announce Type: new Abstract: The hull $\mathrm{Hull}(\mathcal{C})=\mathcal{C}\cap\mathcal{C}^{\perp}$ of a linear code $\mathcal{C}\subseteq\mathbb{F}_q^n$ interpolates between linear complementary dual (LCD) codes, with trivial hull, and self-dual codes. Its dimension is preserved by coordinate permutations but not by scalings $\mathcal{C}\mapsto\mathbf{x}\cdot\mathcal{C}$, $\mathbf{x}\in(\mathbb{F}_q^*)^n$. This governs the complexity of Sendrier's support-splitting algorithm and decides whether an equivalence class contains LCD codes. We study this hull-variation problem, formalised by Chen, for algebraic geometry codes $\mathcal{C}(D,G)$ over a function field $\mathcal{F}/\mathbb{F}_q$ of genus $g>0$, where scalings are twists of $G$ by principal divisors; as a natural relaxation, we allow twists $G\mapsto G+L$ by arbitrary divisors. Writing $\mathcal{C}(D,G)^{\perp}=\mathcal{C}(D,H)$, with $H=D-G+W$, $W$ canonical, a twist acts by $(G,H)\mapsto(G+L,H-L)$. Whenever $\gcd(G+L,H-L)$ is non-special, the hull dimensions of $\mathcal{C}(D,G+L)$ and $\mathcal{C}(D,G)$ differ by exactly $\frac12(\mathrm{deg}|G-H|-\mathrm{deg}|G-H+2L|)$. For a genuine scaling, $L=-(z)$, this variation is bounded by $2[\mathcal{F}:\mathbb{F}_q(z)]$. Under the same hypothesis, we obtain an upper bound on the hull dimension depending only on $D$ and $W$, and characterise exactly when it is attained by a scaling of it. These bounds shed new light on Chen's maximal hull dimension; explicit scalings on Kummer extensions show that the first is sharp. We construct explicit twists that raise, respectively lower, the hull dimension by prescribed amounts, one unit at a time, and apply them to two classical families. Starting from known LCD codes, we reach every hull dimension in an explicit range; starting from a self-dual code ($q$ even) or a code of maximal hull dimension ($q$ odd), we descend to $0$, yielding LCD codes of various dimensions.