Frank Mangone·Jan 24The ZK Chronicles: Circuits (Part 2)We now move forward to our first truly general computation correctness proving mechanism!
Frank Mangone·Dec 8, 2025The ZK Chronicles: Circuits (Part 1)As we get closer to general proving systems, we are required to look at computation models, which brings us to circuits!
Frank Mangone·Nov 26, 2025The ZK Chronicles: Sum-CheckEquipped with finite fields and polynomials, it’s time to take a look at our very first proving system!
Hanhan Robert·Sep 20, 2025Inside the Sum-check Engine: How Can We Built a Hardware Prover SchemeIf you’ve ever wondered how a computer chip can execute cryptographic proofs at blistering speed, welcome to the world of sum-check…
Hanhan Robert·Sep 15, 2025Polynomial expansion and sumcheck protocolHi all, I’m Robert Hanhan, Ph.D. student in Secure Electronic Systems Lab for the past two years. This is my first medium article and I’m…
Ingonyama·Apr 6, 2025BaseFold±: A Simple Improvement to BaseFold’s Multilinear Polynomial Commitment Scheme using…By Yuval Domb
Ingonyama·Apr 1, 2025Hardware-friendliness of HyperPlonk, Part2This article is a follow-up to our earlier post on the hardware-friendliness of HyperPlonk, expanding on claims made about the Sumcheck…
Ingonyama·Jul 3, 2024Sumcheck and Open-Biniusby Suyash Bagad In late 2023, Justin Thaler posted a paper on optimized sumcheck for fields of small characteristics. Having experience…
Ingonyama·Mar 11, 2024Sumcheck 201, Chapter 2: Checkfold - Folding Sumcheck Instancesby Karthik Inbasekar and Suyash Bagad
