This chapter explores the concept of pre-processing in relation to recursion in SNARKs. It discusses the importance of condensing the circuit into a small digest to enable efficient verification. The chapter also compares the fractal and stark constructions and highlights the role of hash functions in improving verification algorithms.