Recursive SNARKs (Succinct Non-interactive Argument of Knowledge) are a cryptographic technology that makes it possible to chain together multiple succinct proofs while preserving their size and efficiency. This method lies at the heart of advances in scalability on the blockchain and other decentralised systems. Put simply, a SNARK is a succinct proof that can be used to demonstrate that a computation was carried out correctly, without any need to repeat the computation itself. When we speak of recursion, it means that a proof can itself contain the verification of other proofs, thereby creating a loop that compresses information.
How Do Recursive SNARKs Work?
The idea behind recursive SNARKs is to allow a proof to verify not only a computation but also other, earlier proofs, all while maintaining a fixed size and constant verification efficiency. This allows for extreme compression of proofs, which is crucial for large-scale applications such as blockchains.
In systems such as Coda (now known as Mina Protocol), this approach is used to maintain an extremely lightweight blockchain, where the size of the proof remains constant regardless of the volume of transactions and computations included oai_citation:3,Coda: Proof-of-stake and recursive zk-SNARKs in practice. This allows users to synchronise the network with a minimal amount of data and computation.
Applications and Advantages of Recursive SNARKs
Recursive SNARKs find their use in several fields:
- Blockchain scalability: The recursion of SNARKs makes it possible to considerably reduce the size of the data to be stored and verified, making blockchains lighter and faster without compromising security. For example, Mina Protocol uses this technique to create a succinct blockchain, where nodes do not need to download the entire chain to verify its validity.
- Proof aggregation: One of the great advantages of recursive SNARKs is the ability to aggregate multiple proofs into a single one, which makes it possible to validate several transactions in a single verification. This improves the efficiency and speed of complex systems, particularly those handling large volumes of transactions oai_citation:2,Zero Knowledge Proofs.
- Distributed verification: In systems like Coda, proofs can be generated in a distributed manner. This makes it possible to offload the network's workload while guaranteeing the correct validation of transactions by multiple parties oai_citation:1,Coda: Proof-of-stake and recursive zk-SNARKs in practice.
Why Are Recursive SNARKs So Promising?
Recursive SNARKs have the potential to revolutionise cryptographic verification by making scalability far more accessible for blockchains and other complex systems. Here are a few major advantages:
- Verification efficiency: Verifying a SNARK is much faster than the original computation. By making SNARKs recursive, a complex series of computations can be compressed into a single succinct proof, making verification faster still.
- Fixed proof size: No matter how complex the computations or how many proofs are aggregated, the size of recursive SNARKs remains fixed. This represents a significant advantage for systems that must handle ever-growing volumes of data.
- Applications in decentralised blockchains: Modern blockchains are searching for solutions to remain efficient at scale. Recursive SNARKs offer a solution that could make it possible to preserve integrity and decentralisation while increasing the network's capacity.
Conclusion
Recursive SNARKs play an essential role in the evolution of cryptographic verification technologies. By enabling the efficient compression and aggregation of proofs, they have become a key element of scalability for decentralised applications such as blockchains. Coupled with technologies like blockchains and zero-knowledge proof systems, they pave the way for a new generation of decentralised systems that are faster, more efficient and just as secure.