Transparent Recursive Polynomial Commitment Scheme Eliminates Trusted Setup Tradeoff
A novel recursive commitment scheme creates transparent zero-knowledge proofs with non-transparent efficiency, securing ZK-Rollups from trusted setup risk.
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.
