"Universal" SNARKs present a very attractive tradeoff, where trusted setup based parameters are allowed, but the same parameters must be used for all statements of a certain size.

A central tool in recent constructions is the polynomial commitment scheme of Kate, Zaverucha and Goldberg. We will review various ways in which the KZG scheme is used in these constructions.