In a Commit-and-Prove system I can convince you that I know an opening u to a public commitment c and that this opening satisfies a certain property (e.g. it is a number in a certain range). One advantage of such systems (among others) is that I can publish a committed version of my data ahead of time and
then later prove facts about them. Such commitment can be compressing (i.e. very small compared to the original data). In order to allow interoperability among different applications (as well as other reasons), it may be worthy to start a discussion on a standard for this type of proof systems.
You can find a full draft of the proposal here.