In this talk we describe a new methodology to efficiently realize recursive composition of succinct non-interactive arguments of knowledge (SNARKs). The methodology leverages a novel connection between holographic proofs and preprocessing SNARKs.