We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other similar types of families commonly studied in combinatorial set theory. We then prove that every combinatorial family of reals of arithmetical type which is indestructible by the product of Sacks forcing S ℵ 0 is in fact universally Sacks-indestructible, i.e. it is indestructible by any countably supported iteration or product of Sacks-forcing of any length. Further, under CH we present a unified construction of universally Sacks-indestructible families for various arithmetical types of families. In particular we prove the existence of a universally Sacks-indestructible maximal cofinitary group under CH .

We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for diagonalizing maximal ideals. Introducing a new robust coding technique, we establish the relative consistency of a g = d < c = ℵ 2 alongside the existence of a Δ 3 1 -well-order of the reals and a co-analytic witness for a g .