Proving _knowledge_ or simple properties about the pre-image doesn&#x27;t get you much of anything interesting.<p>In this protocol the prover proves something that makes the preimage valuable to the verifier.  This generally puts into the land of ZKP for general computation; and in that land, facts about pedersen commitment are not more efficient to prove than SHA256.<p>(except with exceptional parameter selection... e.g. constructing a EC group out of the field created by the SNARK constructions&#x27; group.)