create evm prover

[tuxcanfly]

Overview

[WIP] create evm proving service

• query the Groth16 client on SimApp for the client and consensus state.
• decode trusted height and header
• query evm chain for target height
• serialize evm block into blob use rsp::executor::execute_variant
• lookup proofs for blob from celestia
• generate proof for range by invoking blevm [blocked by Generate aggregate proof #42]

[tuxcanfly]

Blocked on #42 ideally we should be able to pass [trusted_height, target_height] range to generate aggregate proof using a helper importing blevm as a library.

Until that is implemented we can use the mock program: S1nus/blevm#2 once that's merged.

[ninabarbakadze]

any reason why you added a separate .env.example?

[tuxcanfly]

It should use the common .env

[ninabarbakadze]

we have a node auth token file in test files so it should probably consume the key form there?

[tuxcanfly]

yep

[tuxcanfly]

Rebased on sp1 sdk v4.

[tuxcanfly]

Next steps: need to create a aggregator which has BlevmAggOutput as it's public values and which verifies the blevm-aggregator proofs inside it, so that we can we verify consecutive ranges by comparing output1.newest_header_hash and output2.oldest_header_hash. The range proof will be a binary tree where the intermediate nodes are aggregate proofs and the leafs are single block proofs. The root node will give us the recursive proofs required to prove the entire range in O(log n).

[tuxcanfly]

Next steps: need to create a aggregator which has BlevmAggOutput as it's public values and which verifies the blevm-aggregator proofs inside it, so that we can we verify consecutive ranges by comparing output1.newest_header_hash and output2.oldest_header_hash. The range proof will be a binary tree where the intermediate nodes are aggregate proofs and the leafs are single block proofs. The root node will give us the recursive proofs required to prove the entire range in O(log n).

This is being done in #154

Rebased this PR on latest main, need to into the aggregator once the above is merged.