Acknowledgments This post and the arithmetic-circuits crate were developed at NP-Labs as part of our implementation of the Ligero Polynomial Interactive Oracle Proof (PIOP) system. This work was a collaborative effort between Antonio Mejías Gil, Marcin Górny…

Plonky3 is a general purpose toolkit for implementing polynomial IOP's. In addition to

In our previous post, we delved into the Jolt zkVM and uncovered several significant bugs in the code. In this post, we will provide a detailed walkthrough on how Jolt actually works.
Jolt is a zero-knowledge Virtual Machine (zkVM) designed for the RISC-V…

Operations on elliptic curves over large prime fields can be significantly sped up via optimisations to their underlying field multiplication methods. As a result, client-side zero-knowledge (ZK)…

A course site for ZK Shanghai

Welcome to zkMesh, a monthly newsletter covering the latest in advanced privacy-enhancing cryptography, distributed protocol development, and zero-knowledge systems research.

At Veridise, we continuously explore new frontiers in zero-knowledge cryptography and frameworks. In addition to our security auditing and…

Welcome to zkMesh, a monthly newsletter covering the latest in advanced privacy-enhancing cryptography, distributed protocol development, and zero-knowledge systems research.

Integration of the RISC Zero verifiable compute platform with Ethereum and EVM chains. - risc0/risc0-ethereum

32-bit Binary Towers are 5x more hardware efficient than Mersenne31 multipliers

Credits to 1k(x) for the header image. A big thank you to Alessandro Coglio, Eric McCarthy & Evan Schott for their comments and feedback. Over the last years, theory and tooling to generate zero-knowledge proofs have advanced massively. It is now possible…

In the rapidly evolving world of blockchain and cryptography, we often hear about blazing-fast zero-knowledge virtual machines (zkVMs) designed to scale Ethereum or tackle large-scale computational problems. However, for true privacy, ZKPs need to run locally.…

Intro

The goal of this article is to dive into the techniques behind the SuperSpartan's polynomial IOP, which uses the sum-check protocol to prove CCS instances, by writing the protocol explicitely for a specific example. This is part 1 of a two-post series. These…

Learn to write and modify Zero Knowledge Proofs from scratch. You'll build a digital signature scheme using hash-based commitments, gaining practical ZKP programming skills and intuition along the way. By the end, you'll have all the tools you need to implement…

Learn the theory, mathematics, and cryptography that power the most powerful devised by cryptographers — zero-knowledge proofs

Learn about ZK Compression — all its properties and caveats — with Overclock's dubbelosix