NEBRA launches its universal proof aggregation protocol, aiming to reduce costs associated with zero-knowledge proofs

NEBRA has launched its Universal Proof Aggregation protocol, aiming to reduce the cost and complexity of verifying zero-knowledge proofs on Ethereum and EVM-compatible chains. 

The protocol will use "recursive SNARKs," a system that can verify other SNARKs — a Zero-Knowledge Succinct Non-Interactive Argument of Knowledge, or a type of cryptographic tool that allows one party to prove they have information without revealing it.

NEBRA’s team claims the UPA will be “secured by one million Ethereum validators” and does not add additional hardware “trust assumptions” like trusted execution environments used by Flashbots. 

The UPA can aggregate proofs from various circuits, allowing a mix of proof types in a single batch. This means proofs from zkEVMs, zkDIDs, or any other ZKP applications can be processed together, promoting an "economy of scale" in proof verification.

Like other decentralized protocols, anyone can submit a proof. It also includes a mechanism for "forced inclusion" to prevent censorship, ensuring that even if an off-chain worker refuses to include a proof, it can still be processed through this fallback. 

NEBRA claims that using UPA could reduce proof verification costs by up to five times, making it more feasible to implement ZKPs in real-world applications like identity verification without the prohibitive costs previously associated with zero-knowledge proofs.

In April, the research firm raised $4.5 million in pre-seed and seed funding rounds led by Nascent and Bankless Ventures.