EN
Assuming the existence of a P₂κ-hypermeasurable cardinal, we construct a model of Set Theory with a measurable cardinal κ such that $2^{κ} = κ⁺⁺$ and the group Sym(κ) of all permutations of κ cannot be written as the union of a chain of proper subgroups of length < κ⁺⁺. The proof involves iteration of a suitably defined uncountable version of the Miller forcing poset as well as the "tuning fork" argument introduced by the first author and K. Thompson [J. Symbolic Logic 73 (2008)].