Transparent Recursive Polynomial Commitment Scheme Achieves Efficient Setup-Free ZK-SNARKs
Novel recursive commitment eliminates trusted setup risk, achieving transparent ZK-SNARK efficiency on par with non-transparent schemes.
New Transparent Recursive Commitment Scheme Eliminates Trusted Setup Efficiency Trade-Off
LUMEN introduces a novel recursive polynomial commitment scheme, achieving transparent zk-SNARK efficiency on par with trusted-setup protocols.
