Abstract
The argument size of succinct non-interactive arguments (SNARG) is a crucial metric to minimize, especially when the SNARG is deployed within a bandwidth constrained environment.
We present a non-recursive proof compression technique to reduce the size of hash-based succinct arguments. The technique is black-box in the underlying succinct arguments, requires no trusted setup, can be instantiated from standard assumptions (and even when !) and is concretely efficient.
We implement and extensively benchmark our method on a number of concretely deployed succinct arguments, achieving compression across the board to as much as of the original proof size. We further detail non-black-box analogues of our methods to further reduce the argument size.