Assessment reportsPublic findings
Back to Zellic site
↗
Assessment reports>Gnark support in Universal Proof Aggregation circuits
GeneralOverview
Findings
Low (2)
Informational (3)
DiscussionDifferences in batch verification to integrate gnark proofsTerminology confusion regarding LegoSNARKConfusing implementation of InCircuitHash and FieldElementRepresentation for AssignedVerificationKeyDummy function for BatchEntry has confusing comments regarding commitmentsLength variables could be with or without commitmentOutdated or incorrect commentsConfusing behavior of native compute_challenge_pointsInaccuracies in the specificationAdditional check for well-constructed keccak inputs
Audit ResultsAssessment Results
Nebra
June 7, 2024
Gnark support in Universal Proof Aggregation circuits
Findings Impact LevelCount
Critical0
High0
Medium0
Low2
Informational3
CriticalHighMediumLowInformational
Prepared by
Mohit SharmaEngineer[email protected]
↗
Malte LeipEngineer[email protected]
↗
Sylvain PelissierEngineer[email protected]
↗
About

Nebra contributed the following description of Gnark support in Universal Proof Aggregation circuits:

NEBRA’s Universal Proof Aggregator (UPA) v1.0.0 reduces the on-chain verification costs of Groth16 proofs by aggregating them into a single proof.

Executive Summary

Zellic conducted a security assessment for Nebra from May 27th to June 7th, 2024. During this engagement, Zellic reviewed Gnark support in Universal Proof Aggregation circuits's code for security vulnerabilities, design issues, and general weaknesses in security posture.

Zellic © 2025Back to top ↑