  We give theorems about asymptotic normality of general additive functionals
on patricia tries in an i.i.d. setting, derived from results on tries by Janson
(2022). These theorems are applied to show asymptotic normality of the
distribution of random fringe trees in patricia tries. Formulas for asymptotic
mean and variance are given. The proportion of fringe trees with $k$ keys is
asymptotically, ignoring oscillations, given by $(1-\rho(k))/(H+J)k(k-1)$ with
the source entropy $H$, an entropy-like constant $J$, that is $H$ in the binary
case, and an exponentially decreasing function $\rho(k)$. Another application
gives asymptotic normality of the independence number.
