Random Constraint Satisfaction Problems exhibit several phase transitions when their density of constraints is varied. One of these threshold phenomena, known as the clustering or dynamic transition, corresponds to a transition for an information theoretic problem called tree reconstruction. In this article we study this threshold for two CSPs, namely the bicoloring of $k$-uniform hypergraphs with a density $α$ of constraints, and the $q$-coloring of random graphs with average degree $c$. We show that in the large $k,q$ limit the clustering transition occurs for $α= \frac{2^{k-1}}{k} (\ln k + \ln \ln k + γ_{\rm d} + o(1))$, $c= q (\ln q + \ln \ln q + γ_{\rm d}+ o(1))$, where $γ_{\rm d}$ is the same constant for both models. We characterize $γ_{\rm d}$ via a functional equation, solve the latter numerically to estimate $γ_{\rm d} \approx 0.871$, and obtain an analytic lowerbound $γ_{\rm d} \ge 1 + \ln (2 (\sqrt{2}-1)) \approx 0.812$. Our analysis unveils a subtle interplay of the clustering transition with the rigidity (naive reconstruction) threshold that occurs on the same asymptotic scale at $γ_{\rm r}=1$.