In this last part of the series PLONK by Hand, we will verify that the proof (constructed in Part 2) can be accepted.

In this second part of the series, we will create a list of elliptic curve points (along with a few field elements) to demonstrate that our assignment satisfies the circuit we constructed in Part 1.

This article will explain how to execute a PLONK zero-knowledge proof system completely by hand. In particular we will show how to choose parameters, run a trusted setup, and convert a statement into a PLONK-style circuit by hand.

It details Fʀᴀᴄᴛᴀʟ's subprotocols, such as Univariate Sumcheck for rational functions, Holographic Lincheck, Sparse Matrix Arithmetization or the Verifier

Fractal is a new general-purpose zero-knowledge proof system (and no, it doesn't have anything to do with the fractals you're probably thinking of). This is a two-part in-depth dive into FRACTAL.

Part II introduces the DARK Integer Commitment Scheme and describes at a high level how DARK can be used as a Homomorphic Polynomial Commitment Scheme, and how DARK may be instantiated in various groups of unknown order.

Part I of this blog post will review how Supersonic fits into the landscape of modern SNARKs and give context and background for the technical details in Part II.

After few years into this emerging, yet fast-moving blockchain space, it became apparent that knowledge in cryptography is indispensable. In this context, knowledge refers to: 1) what, where, and why cryptography is used; and 2) limitations of the cryptography used in decentralized protocols.