We improve an existence condition for weak bases of relational clones on finite sets. Moreover, we provide a set of singleton weak bases of Boolean relational clones different than those exhibited by Lagerkvist in [10]. We treat groups of 'similar' Boolean clones in a uniform manner with the goal of thereby simplifying proofs working by case distinction along the clones in Post's lattice.