Summary: Non-excluding verification of past contract events.
Team Members: Philogy (GitHub, $\mathbb{X}$)
Repo Link: Repo Link
Additional Resources: -
Want to save gas on state updates that are not latency update. In our case collection & accounting of validator rewards.
- instead of a bunch of storage slot updates every block we emit a summary hash
- we can the prove the list of summary hashes via SP1 by proving the events from our contract via SP1 (prove hash chain => prove receipt trie in relevant blocks)
- prove content of summary hash => sum
- commit to final sum within the program
1.4M cycles / block to be proven on average. Still a WIP and unoptimized.