2024.3.11 - 2024.3.17
Last updated
Was this helpful?
Last updated
Was this helpful?
If there are omissions or errors, corrections are welcome. Thank you very much!
1. Twitter sent by the BeL2 team,they will advance BitVM by passing ZKPs into EVMs, turning EVM ecosystems into Bitcoin sidechain processors, opening up a scalable world of incoming smart services.
a. Represented BitVM using binary circuits, enabling the output of BitVM programs to be 1 or 0 (true or false).
b. Encoded the ZK verifier into BitVM. If the output is 0, it indicates a false ZKP. The prover submits a ZKP, and the verifier initiates challenges to prove the proof is invalid. Ultimately, 40 transactions are required to determine the validity of the ZKP.
The basic process is as follows:
Creating STARK proof from a RISC Zero guest program (written in Rust)
Wrapping the STARK proof into a Groth16 proof
Crafting its corresponding Groth16 verifier in C
Compiling the verifier to rv32i instruction set
Transpiling the verifier from rv32i to BitVM instruction set
Running the BitVM simulation (To be run on-chain once BitVM is ready)
2. Weikeng Chen from L2Iterative contributed a PR for u32 mul to BitVM, It took 3705 bytes in Bitcoin script. Detail PR link: Add u32_mul by weikengchen · Pull Request #12 · BitVM/BitVM, The PR has been merged now. PR link:
1.from Citreaposted on twitter ，Described the approach to verify ZK proofs with OP:
2. Citrea posted twitter，Announced the open sourcing of its，based on Risc0 prover and BitVM-based proof verification circuits, achieving the challenge verification of Groth16 proofs.
from Bobsaid their vision is to create the first hybrid rollup with multiple native bridges.
