Image

Functional commitment (FC) schemes are a key primitive in the construction of efficient succinct argument systems. At a high level, FC schemes enable committing to a message, and then later proving the correctness of evaluations of functions over the committed message.
Popular examples include polynomial commitments, vector commitments, and linear-function commitments.
In this talk, I will introduce FC schemes, discuss recent progress on "correct" definitions for them, and provide representative constructions.