Fractal - Post-Quantum and Transparent Recursive Proofs from Holography

Explore a groundbreaking paper on post-quantum cryptography and transparent recursive proofs presented at Eurocrypt 2020. Delve into the foundations of recursive composition of SNARKs, post-quantum recursion theorems, and holographic proofs. Learn about the Fractal system's evaluation as both a standalone and recursive SNARK, and discover the implications of preprocessing for efficient recursion. Examine the concept of post-quantum preprocessing SNARKs and their connection to holographic proofs. Investigate the potential for efficient holography and linear-size encoding of sparse matrices in this cutting-edge cryptographic research.

Intro
Recursive composition of SNARKS
Foundations of recursion
Post-Quantum Recursion Theorem
Recursion in practice
Preprocessing implies efficient recursion
Evaluation of Fractal (as a standalone SNARK)
Post-Quantum PCD
Realizing recursion for Fractal
Evaluation of Fractal (as a recursive SNARK)
Post-quantum preprocessing SNARKS
Holographic proofs
From holographic PCPs to preprocessing SNARKS
Efficient holography?
Linear-size encoding of a sparse matrix
Summary