Curve Trees: Global Anonymity Sets for Lelantus Spark
Lelantus Spark’s unique modular design allows the upgrading of its components, and in this case, curve trees would replace Spark’s use of one-out-of-many proofs.
We are proud to publish the results of the research grant on curve trees carried out by Aram Jivanyan and funded by the MAGIC Firo Fund. Curve trees is a new technique that allows scaling zero-knowledge membership proofs to allow global anonymity sets, meaning that the ZKP is performant enough that it can encompass all transactions in a blockchain. It achieves this without any need for a trusted setup, a key requirement of Firo’s privacy research, while retaining small transaction sizes and quick proving and verification times. Curve trees also allow for efficient batching verification techniques, which can further decrease the marginal cost of proof verification.
Lelantus Spark’s unique modular design allows the upgrading of its components, and in this case, curve trees would replace Spark’s use of one-out-of-many proofs. The research note covers the necessary modifications to implement curve trees in Spark to scale it to global anonymity sets.
We would like to thank Luke Parker (kayabanerve) and Aaron Feickert of Cypher Stack for their valuable feedback and help in grasping curve trees and how they would apply to Spark.
Related article:
Comments ()