When it comes to commitment schemes for data, the state of the art today requires us to go through trade-offs. Do you want fast and cheap proving or fast commitment outside of the circuit? Choose one.
Merkle Tree Translation aims to allow picking both options and thus reducing the overhead of general proving over that data, and especially SnapDeals.
Motivation
SnapDeals currently have a proving overhead comparable to PoRep, with Merkle Tree Translation (MTT) another commitment to the data could be used, reducing the proving time and cost of SnapDeals 40 times.
It would also allow efficient production of proofs using that data, allowing a verifiable version of Compute over Data.
See SnapDeals with Reduced Overhead - Adopting alternative Data Commitment - The primary approach to solving this issue is Proof of Merkle Tree Translation or non-interactive Proof of Wrong Merkle Tree Translation (or a combination of both). for the earlier iteration.