0xPolygonZero/plonky2

The `Solidity` Verifier for `Plonky2` Proofs

xiyu1984 opened this issue · 7 comments

Hi,

Is there any convenient way to verify the proof generated by plonky2 in the solidity smart contract?

Thanks to gnark-plonky2-verifier my demand has been met.

just curious if you know of a way to verify plonky2 STARK proof in EVM/solidity?

just curious if you know of a way to verify plonky2 STARK proof in EVM/solidity?

Until now, I've not tried. The proof is about 200k even though I used high-rate recursive proof.

qope commented

https://github.com/DoHoonKim8/stark-verifier
This is aother option for on-chain verification of plonky2. It consumes more gas than gnark-plonky2-verifier but has lower memory usage, operating with about 16GB of RAM.

https://github.com/DoHoonKim8/stark-verifier This is aother option for on-chain verification of plonky2. It consumes more gas than gnark-plonky2-verifier but has lower memory usage, operating with about 16GB of RAM

Awesome! I will try it soon.

https://github.com/DoHoonKim8/stark-verifier This is aother option for on-chain verification of plonky2. It consumes more gas than gnark-plonky2-verifier but has lower memory usage, operating with about 16GB of RAM.

hey @qope , [stark-verifier](https://github.com/DoHoonKim8/stark-verifier) makes a better performance to generate snark proof. But I failed in compile_solidity when running test test_recursive_halo2_proof.

I think it's about the version of solc, so could you tell me what is the version when you make the test?

qope commented

Hi, @xiyu1984, I'm using solc version 0.8.20.