We characterize the optimal mechanism for the provision of n public goods in an economy with m agents, binary valuations. The mechanism “links” the n problems together because decisions and transfers are based on the whole vector of valuations of the agents. In particular, the decision on whether or not to provide a public good depends not only on the valuations of the agents for that good but, in some cases, also on the valuations for the other goods reported by the low‐valuation agents. For the two‐agent case, we show that the mechanism is asymptotically efficient and we provide an example that compares its relative efficiency with optimal separate provision and with another asymptotically efficient mechanism in the literature.