(This is started, but paused work by Zippie team/Compute unit)
Talk about this work: https://www.youtube.com/watch?v=leCd5kyDTR8
What if you could prove the execution of a Cartesi Machine with a Zero Knowledge Proof (ZKP)?
A 200 byte-ish proof that indeed a computation started in a particular point and ended in a particular point? Without revealing the contents of the execution, or optimistic proving needing week(s) to settle. That is possible to prove to an Ethereum L1, or other Cartesi Machines.
Value brought to users: Ability to do parts of whole of execution of a Cartesi Machine without revealing data contents to others. There is also dependencies by some Dave variants that will need this.
We suggest the direction that we do this with RiscZero technology and we did a proof of concept with this, re-using the existing Cartesi Machine code.