Polynomial IOPs for Memory Consistency Checks in Zero-Knowledge Virtual Machines

Search for a command to run...

No comments yet. Be the first to comment.
Do you know that we have a team of scholar apes? Stay updated on the latest research findings and join us in geeking out over their fascinating discoveries!
https://www.youtube.com/watch?v=Ayg7DQIFlvs Abstract For years, Bitcoin miners put little effort into adopting several widely-acclaimed block acceleration techniques, which, as some argued, would secure their revenues. Their indifference inspires a...
🍨 Your weekly bite of the latest updates from the Bitcoin tech ecosystem!

🍨 不可错过的每周比特币技术生态速览

🍨 Your weekly bite of the latest updates from the Bitcoin tech ecosystem!

🍨 不可错过的每周比特币技术生态速览

🍨 Your weekly bite of the latest updates from the Bitcoin tech ecosystem!

On this page
This talk introduces our work that is published in Asiacrypt 2023. This work is about zero-knowledge virtual machines (ZKVM). ZKVM has become increasingly popular recently because of its potential applications in various areas, particularly its ability to enhance the privacy and scalability of blockchain systems. In this work, we focus on an influential and expensive component of ZKVMs---memory consistency checks (MCC). We formalize the state-of-the-art constructions of MCC in the PIOP model and prove their security. Observing that the bottleneck of existing designs, we propose a novel memory consistency check, dubbed Permem. Compared to the existing MCC protocols, Permem not only has improved efficiency, but also supports the memory address space as large as the entire finite field, significantly boosting the memory sizes of ZKVMs.
Read the full paper.
Yuncong Zhang, ShiFeng Sun, Ren Zhang, Dawu Gu
Proof System, SNARK, ZKVM, Random Access Memory
More papers from the authors: