It's Friday and you know the drill: it's time for ZK Mesh Mini!
ZK Mesh Mini is your weekly dose of ZK, where we unpack the top developments in the ZK space from the past 7 days. In this edition we'll cover:
@Scroll_ZKP research on parallel zkVM,
@reilabs_io on zkFV, formal verification for zero-knowledge,
@NovaNet_zkp announcement,
@rishotics & @NitanshuL on FflonK,
@TACEO_IO on zkML with @nil_foundation.
In a recent paper, @Scroll_ZKP research team described an architecture for a performant zkVM targeting at real time proving, by combining GKR parallelization, smaller field arithmetic & pay-what-you-need approach.
Paper 2024/387 Wenqing Hu , Missouri University of Science and Technology Tianyi Liu , University of Illinois Urbana-Champaign Ye Zhang , Scroll Foundation Yuncong Zhang , Shanghai Jiao Tong University Zhenfei Zhang , Scroll Foundation Abstract Zero-knowledge virtual machine (zkVM) is a novel applica- tion of succinct and non-interactive zero-knowledge proof protocols that allows for verifiable computation over arbitrary codes.
In their article, @reilabs_io covered how they use Formal Verification (FV) as a way to ensure zk-circuits work as they should, and why zkFV is an important technique to improve zk-tooling and zk-security.
Formal Verification for ZK Safety
The EVM's ability to run computations on-chain has a major weakness: the cost of running code is often too great. Given a lot of the use-cases for this kind of public computation involve more interesting operations, we've seen a rapid rise in the use of systems that aim to alleviate those costs.
At #ETHDenver, @NovaNet_zkp announced their peer-to-peer proving network. Its purpose is to enable decentralized zk-proofs via an incentivized way to run proofs everywhere. It is based on SuperNova NIVC.
@rishotics & @NitanshuL, with some help from @EllipticHector, wrote an article to dive into the weeds of the “Multiple Polynomials” technique in the context of the FflonK framework.
An overview of how fflonk is better than vanilla Plonk
@TACEO_IO published a blog post as a tutorial on their ONNX frontend for zkLLVM, from the setup/build and with examples. It allows building zkML circuits and validating large ML models.
Excited to share our progress on zkML for @nil_foundation Proof-Market! Dive into our latest blog post to discover how we're enhancing zkLLVM with an ONNX extension. Full tutorial inside!A monthly newsletter sharing the latest in decentralised privacy-preserving technologies, privacy protocol development and Zero Knowledge systems. Click to read zkMesh, a Substack publication with thousands of subscribers.
It's Friday and you know the drill: it's time for ZK Mesh Mini!
ZK Mesh Mini is your weekly dose of ZK, where we unpack the top developments in the ZK space from the past 7 days. In this edition we'll cover:
@Scroll_ZKP research on parallel zkVM,
@reilabs_io on zkFV, formal verification for zero-knowledge,
@NovaNet_zkp announcement,
@rishotics & @NitanshuL on FflonK,
@TACEO_IO on zkML with @nil_foundation.
In a recent paper, @Scroll_ZKP research team described an architecture for a performant zkVM targeting at real time proving, by combining GKR parallelization, smaller field arithmetic & pay-what-you-need approach.
Paper 2024/387 Wenqing Hu , Missouri University of Science and Technology Tianyi Liu , University of Illinois Urbana-Champaign Ye Zhang , Scroll Foundation Yuncong Zhang , Shanghai Jiao Tong University Zhenfei Zhang , Scroll Foundation Abstract Zero-knowledge virtual machine (zkVM) is a novel applica- tion of succinct and non-interactive zero-knowledge proof protocols that allows for verifiable computation over arbitrary codes.
In their article, @reilabs_io covered how they use Formal Verification (FV) as a way to ensure zk-circuits work as they should, and why zkFV is an important technique to improve zk-tooling and zk-security.
Formal Verification for ZK SafetyThe EVM's ability to run computations on-chain has a major weakness: the cost of running code is often too great. Given a lot of the use-cases for this kind of public computation involve more interesting operations, we've seen a rapid rise in the use of systems that aim to alleviate those costs.
At #ETHDenver, @NovaNet_zkp announced their peer-to-peer proving network. Its purpose is to enable decentralized zk-proofs via an incentivized way to run proofs everywhere. It is based on SuperNova NIVC.
@rishotics & @NitanshuL, with some help from @EllipticHector, wrote an article to dive into the weeds of the “Multiple Polynomials” technique in the context of the FflonK framework.
An overview of how fflonk is better than vanilla Plonk
@TACEO_IO published a blog post as a tutorial on their ONNX frontend for zkLLVM, from the setup/build and with examples. It allows building zkML circuits and validating large ML models.
Excited to share our progress on zkML for @nil_foundation Proof-Market! Dive into our latest blog post to discover how we're enhancing zkLLVM with an ONNX extension. Full tutorial inside!A monthly newsletter sharing the latest in decentralised privacy-preserving technologies, privacy protocol development and Zero Knowledge systems. Click to read zkMesh, a Substack publication with thousands of subscribers.
Privacy, verifiable compute, and scalability are a few of the amazing things you can do with zero-knowledge proofs in NovaNet.
Hope you liked this week’s #ZkMeshMini! Subscribe to our newsletter for the full 𝗭𝗞 𝗠𝗲𝘀𝗵 capturing all the top research, articles, announcements, and more from this month and the last ones: https://zkmesh.substack.com
Privacy, verifiable compute, and scalability are a few of the amazing things you can do with zero-knowledge proofs in NovaNet.
Hope you liked this week’s #ZkMeshMini! Subscribe to our newsletter for the full 𝗭𝗞 𝗠𝗲𝘀𝗵 capturing all the top research, articles, announcements, and more from this month and the last ones: https://zkmesh.substack.com
Share Dialog
Share Dialog
Subscribe to ZK Mesh Mini
Subscribe to ZK Mesh Mini
ZK Mesh Mini
ZK Mesh Mini
<100 subscribers
<100 subscribers
No activity yet