Is this possible?

1. ZK prove set of casts that contain tips
2. Tip casts reduced to simple data structure and submitted onchain with proof from step 1
3. Smart contract verifies proof before taking additional actions based on the tip data (ex: updating balances)

Guessing that transforming the cast data to be efficiently processed onchain essentially invalidates the proof, since the cast signatures are of the raw cast data. 🤔

Ok I’m just describing a dumbed down zk rollup. The data could be merklized so only a state root is submitted + the proof.

Main thing I’m unsure about is how difficult it would be to write the zk circuit.

working on something new


prev: https://persistence.wtf / https://nouns.build

Any in particular you recommend I look at?

if you use a zkvm this is actually pretty easy