We develop a general framework for forcing with coherent adequate sets on [Formula: see text] as side conditions, where [Formula: see text] is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent adequate type forcings. The main theorem of the paper is that any coherent adequate type forcing preserves CH. We show that there exists a forcing poset for adding a club subset of [Formula: see text] with finite conditions while preserving CH, solving (...) a problem of Friedman [Forcing with finite conditions, in Set Theory: Centre de Recerca Matemática, Barcelona, 2003–2004, Trends in Mathematics, pp. 285–295.]. (shrink)

We introduce a new method for building models of [Formula: see text], together with [Formula: see text] statements over [Formula: see text], by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only [Formula: see text]-many of them. Using this approach, we build a model in which a very strong form of the negation of Club Guessing at [Formula: see text] known as [Formula: see text] holds together with [Formula: see text], thereby answering a well-known (...) question of Moore. This construction can be described as a finite-support weak forcing iteration with side conditions consisting of suitable graphs of sets of models with markers. The [Formula: see text]-preservation is accomplished through the imposition of copying constraints on the information carried by the condition, as dictated by the edges in the graph. (shrink)